Lines Matching refs:set
234 * Cache-friendly set of 32-bit IDs with O(1) insert/erase/lookup and
237 * Internally implemented as a bit vector: If the set contains an ID, the
238 * corresponding bit is set. It doesn't use std::vector<bool> since we then
241 * The interface resembles a subset of std::set/std::unordered_set.
245 const IDSet* set;
275 it.set = this;
287 it.set = this;
313 it.set = this;
327 it.set = this;
348 uint64_t m = set->words[word];
352 if (word == set->words.size())
356 for (; word < set->words.size(); word++) {
357 if (set->words[word]) {
358 bit = ffsll(set->words[word]) - 1;
372 assert(set == other.set);