39 lookup_(std::move(list.lookup_))
73template<
class AnyType,
class AnyHash>
102 if (lookup_.insert(val, size()))
111 if (lookup_.insert(val, size()))
125 const label lenHash = lookup_.size();
127 if ((lenList < lenHash) || (lenList && !lenHash))
144 return lookup().found(val);
155 wordList::swap(
static_cast<wordList&
>(list));
156 lookup_.swap(list.lookup_);
163 lookup_.transfer(list.lookup_);
207 return lookup_.lookup(val, -1);
213 return lookup_.found(val);
241 lookup_ = std::move(list.lookup_);
A HashTable similar to std::unordered_map.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
void operator=(const UList< word > &a)
Assignment to UList operator. Takes linear time.
void clear()
Clear the list, i.e. set size to zero.
Ostream & operator()() const
Output stream (master only).
label operator[](const label i) const
Processor-local element id from linear-list of addresses.
friend Ostream & operator(Ostream &, const faMatrix< Type > &)
A wordList with hashed named lookup, which can be faster in some situations than using the normal lis...
void operator=(const hashedWordList &list)
Copy assignment. Rehashes the indices.
label find(const word &val) const
Find index of the value (searches the hash).
hashedWordList()=default
Default construct an empty list.
void swap(hashedWordList &list)
Swap contents.
void sort()
Inplace sort list and rehash the indices.
void rehash() const
Rebuild the lookup hash indices.
void clear()
Clear the list, i.e. set size to zero.
const word & operator[](const label index) const
Return name corresponding to specified index.
const HashTable< label > & lookup() const
Return the hash of words/indices for inspection.
label appendUniq(const word &val)
Append an element if not already in the list.
Lookup type of boundary radiation properties.
lookup(const dictionary &dict, const polyPatch &pp)
Construct from components.
transferModelList & transfer()
Transfer.
bool append() const noexcept
True if output format uses an append mode.
A class for handling words, derived from Foam::string.
Istream & operator>>(Istream &, directionInfo &)
void sort(UList< T > &list)
Sort the list.