Lines Matching full:seqs
53 SeqMap Seqs;
70 typename SeqMap::iterator I = Seqs.lower_bound(Seq);
74 if (I != Seqs.end() && isSuffix(Seq, I->first))
77 I = Seqs.insert(I, std::make_pair(Seq, 0u));
80 if (I != Seqs.begin() && isSuffix((--I)->first, Seq))
81 Seqs.erase(I);
84 bool empty() const { return Seqs.empty(); }
89 // Lay out the table in Seqs iteration order.
90 for (typename SeqMap::iterator I = Seqs.begin(), E = Seqs.end(); I != E;
101 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq);
102 assert(I != Seqs.end() && isSuffix(Seq, I->first) &&
113 for (typename SeqMap::const_iterator I = Seqs.begin(), E = Seqs.end();
