70       id2entry_.reserve(table_size);  in hash_func_()
80         id2entry_(table.id2entry_) { }  in HashBiTable()
91         id2entry_.push_back(entry);
92         id_ref = id2entry_.size();
101     return id2entry_[s];  in FindEntry()
104   I Size() const { return id2entry_.size(); }  in Size()
110   vector<T> id2entry_;  variable
152       id2entry_.reserve(table_size);  in hash_func_()
161         id2entry_(table.id2entry_) {  in CompactHashBiTable()
175         I key = id2entry_.size();
176         id2entry_.push_back(entry);
187   const T &FindEntry(I s) const { return id2entry_[s]; }  in FindEntry()
189   I Size() const { return id2entry_.size(); }  in Size()
193     if (n < 0 || n > id2entry_.size())
194       n = id2entry_.size();
196       I key = id2entry_.size() - 1;
198       id2entry_.pop_back();
245       return id2entry_[k];  in Key2Entry()
253   vector<T> id2entry_;  variable
283       id2entry_.reserve(table_size);
289         id2entry_(table.id2entry_) { }  in VectorBiTable()
300         id2entry_.push_back(entry);
301         id_ref = id2entry_.size();
309   const T &FindEntry(I s) const { return id2entry_[s]; }  in FindEntry()
311   I Size() const { return id2entry_.size(); }  in Size()
318   vector<T> id2entry_;  variable
349       id2entry_.reserve(entry_size);  in selector_()
356         id2entry_(table.id2entry_),  in VectorHashBiTable()
377           id2entry_.push_back(entry);
378           fp2id_[fp] = id2entry_.size();
389           I key = id2entry_.size();
390           id2entry_.push_back(entry);
403     return id2entry_[s];  in FindEntry()
406   I Size() const { return id2entry_.size(); }  in Size()
454       return id2entry_[k];  in Key2Entry()
461   vector<T> id2entry_;  // Maps state IDs to entry  variable
495         id2entry_.push_back(entry);
496         id_ref = id2entry_.size() + first_;
504   const T &FindEntry(I s) const { return id2entry_[s - first_]; }  in FindEntry()
506   I Size() const { return id2entry_.size(); }  in Size()
509     T &entry = id2entry_[s - first_];  in Erase()
513     id2entry_[s - first_] = empty_entry_;  in Erase()
514     while (!id2entry_.empty() && id2entry_.front() == empty_entry_) {  in Erase()
515       id2entry_.pop_front();  in Erase()
522   deque<T> id2entry_;  variable