35 const label len = list.
size();
40 for (label i = 0; i < len; ++i)
42 lookup_.
insert(list[i], i);
50 const label len = list.
size();
57 for (label i = 0; i < len; ++i)
61 if (lookup_.insert(item, i))
65 list[
count] = std::move(item);
void size(const label n)
Older name for setAddressableSize.
void rehash() const
Rebuild the lookup hash indices.
bool insert(const Key &key, const T &obj)
Copy insert a new entry, not overwriting existing entries.
unsigned int count(const UList< bool > &bools, const bool val=true)
Count number of 'true' entries.
void clear()
Remove all entries from table.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
List< word > wordList
List of word.
void reserve(label numEntries)
Reserve space for at least the specified number of elements (not the number of buckets) and regenerat...
void uniq()
Adjust the list (if needed) to eliminate duplicate entries, and rehash the indices.