Lines Matching defs:it
48 // // Lookup integer ID from entry. If it doesn't exist and 'insert'
49 // / is true, then add it. Otherwise return -1.
90 if (insert) { // store and assign it a new ID
172 typename KeyHashSet::const_iterator it = keys_.find(kCurrentKey);
173 if (it == keys_.end()) { // T not found
174 if (insert) { // store and assign it a new ID
183 return *it;
271 // It is passed a function object FP that should fingerprint entries
299 if (insert) { // store and assign it a new ID
376 if (insert) { // store and assign it a new ID
386 typename KeyHashSet::const_iterator it = keys_.find(kCurrentKey);
387 if (it == keys_.end()) {
397 return *it;
494 if (insert) { // store and assign it a new ID
510 typename unordered_map<T, I, F>::iterator it =
512 entry2id_.erase(it);
