Lines Matching refs:tuple
47 // // Lookup state ID by tuple. If it doesn't exist, then add it.
49 // // Lookup state tuple by state ID.
50 // const StateTuple<StateId> &Tuple(StateId) const;
55 // A state tuple has the form:
66 // An implementation using a hash map for the tuple to state ID mapping.
67 // The state tuple T must have == defined and the default constructor
68 // must produce a tuple that will never be seen. H is the hash function.
79 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
80 const StateTuple &Tuple(StateId s) const { return FindEntry(s); }
84 // An implementation using a hash set for the tuple to state ID
85 // mapping. The state tuple T must have == defined and the default
86 // constructor must produce a tuple that will never be seen. H is the
104 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
105 const StateTuple &Tuple(StateId s) const { return FindEntry(s); }
108 // An implementation using a vector for the tuple to state mapping.
126 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
127 const StateTuple &Tuple(StateId s) const { return FindEntry(s); }
134 // for each tuple to be hashed in the vector (these need to be
136 // hashing tuple into the compact hash table.
156 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
157 const StateTuple &Tuple(StateId s) const { return FindEntry(s); }
161 // An implementation using a hash map for the tuple to state ID
162 // mapping. This version permits erasing of states. The state tuple T
164 // tuple that will never be seen. F is the hash function.
176 StateId FindState(const StateTuple &tuple) { return FindId(tuple); }
177 const StateTuple &Tuple(StateId s) const { return FindEntry(s); }
196 // // Lookup state ID by tuple. If it doesn't exist, then add it.
198 // // Lookup state tuple by state ID.
199 // const StateTuple<StateId> &Tuple(StateId) const;
297 size_t operator()(const StateTuple &tuple) {
298 return tuple.state_id1 + tuple.state_id2 * mult1_ +
299 tuple.filter_state.Hash() * mult2_;
308 // Useful when the first composition state determines the tuple.
316 size_t operator()(const StateTuple &tuple) { return tuple.state_id1; }
320 // Useful when the second composition state determines the tuple.
328 size_t operator()(const StateTuple &tuple) { return tuple.state_id2; }
366 // composition filter that creates at most one filter state per tuple
406 // composition filter that creates at most one filter state per tuple
445 // to that tuple or doesn't care that if it does, it is assigned a new
