Lines Matching defs:tuple
48 // // Lookup state ID by tuple. If it doesn't exist, then add it.
50 // // Lookup state tuple by state ID.
56 // A state tuple has the form:
68 // An implementation using a hash map for the tuple to state ID mapping.
69 // The state tuple T must have == defined. H is the hash function.
85 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
90 // An implementation using a hash map for the tuple to state ID mapping.
91 // The state tuple T must have == defined. H is the hash function.
108 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
112 // An implementation using a vector for the tuple to state mapping.
133 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
141 // for each tuple to be hashed in the vector (these need to be
143 // hashing tuple into the compact hash table.
163 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
168 // An implementation using a hash map for the tuple to state ID
169 // mapping. This version permits erasing of states. The state tuple T
171 // tuple that will never be seen. F is the hash function.
183 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
203 // // Lookup state ID by tuple. If it doesn't exist, then add it.
205 // // Lookup state tuple by state ID.
306 size_t operator()(const StateTuple &tuple) {
307 return tuple.state_id1 + tuple.state_id2 * mult1_ +
308 tuple.filter_state.Hash() * mult2_;
317 // Useful when the first composition state determines the tuple.
325 size_t operator()(const StateTuple &tuple) { return tuple.state_id1; }
329 // Useful when the second composition state determines the tuple.
337 size_t operator()(const StateTuple &tuple) { return tuple.state_id2; }
376 // composition filter that creates at most one filter state per tuple
418 // composition filter that creates at most one filter state per tuple
459 // to that tuple or doesn't care that if it does, it is assigned a new