Go to the documentation of this file.
37 template<
class Key,
class Hash>
38 template<
class InputIter>
46 if (!this->capacity())
56 return insert(first, last);
62 template<
class Key,
class Hash>
72 template<
class Key,
class Hash>
81 template<
class Key,
class Hash>
91 template<
class Key,
class Hash>
96 insert(list.begin(), list.end());
100 template<
class Key,
class Hash>
101 template<
class AnyType,
class AnyHash>
109 for (
auto iter = tbl.
cbegin(); iter != tbl.
cend(); ++iter)
118 template<
class Key,
class Hash>
119 template<
class InputIter>
127 while (first != last)
139 template<
class Key,
class Hash>
142 std::initializer_list<Key> list
145 return insert(list.begin(), list.end());
149 template<
class Key,
class Hash>
160 template<
class Key,
class Hash>
170 template<
class Key,
class Hash>
181 template<
class Key,
class Hash>
182 template<
class InputIter>
193 template<
class Key,
class Hash>
196 std::initializer_list<Key> list
199 return unset(list.begin(), list.end());
203 template<
class Key,
class Hash>
214 template<
class Key,
class Hash>
224 template<
class Key,
class Hash>
237 template<
class Key,
class Hash>
244 template<
class Key,
class Hash>
251 template<
class Key,
class Hash>
259 template<
class Key,
class Hash>
266 template<
class Key,
class Hash>
269 assignMany(rhs.size(), rhs.begin(), rhs.end());
273 template<
class Key,
class Hash>
277 if (this->size() != rhs.size())
284 if (!this->
found(iter.key()))
294 template<
class Key,
class Hash>
301 template<
class Key,
class Hash>
315 template<
class Key,
class Hash>
319 this->parent_type::retain(rhs);
324 template<
class Key,
class Hash>
331 if (this->
found(iter.key()))
333 this->
erase(iter.key());
345 template<
class Key,
class Hash>
349 return this->operator|=(rhs);
353 template<
class Key,
class Hash>
365 template<
class Key,
class Hash>
374 template<
class Key,
class Hash>
377 const HashSet<Key, Hash>& a,
378 const HashSet<Key, Hash>&
b
381 HashSet<Key, Hash> result(a);
387 template<
class Key,
class Hash>
390 const HashSet<Key, Hash>& a,
391 const HashSet<Key, Hash>&
b
394 HashSet<Key, Hash> result(a.capacity());
396 for (
const Key&
k : a)
408 template<
class Key,
class Hash>
411 const HashSet<Key, Hash>& a,
412 const HashSet<Key, Hash>&
b
415 HashSet<Key, Hash> result(a);
421 template<
class Key,
class Hash>
424 const HashSet<Key, Hash>& a,
425 const HashSet<Key, Hash>&
b
428 HashSet<Key, Hash> result(a.capacity());
430 for (
const Key&
k : a)
444 template<
class Key,
class Hash>
455 template<
class Key,
class Hash>
466 template<
class Key,
class Hash>
477 template<
class Key,
class Hash>
485 template<
class Key,
class Hash>
493 template<
class Key,
class Hash>
srcOptions insert("case", fileName(rootDirSource/caseDirSource))
iterator end()
Return an iterator at end of list.
HashSet()
Default construct with default (128) table capacity.
iterator end() noexcept
Return an iterator to end traversing the FixedList.
iterator end() noexcept
Return an iterator to end traversing the UList.
bool operator[](const Key &key) const noexcept
Return true if the entry exists, same as found().
void operator=(const this_type &rhs)
Copy assign.
const_iterator cbegin() const
const_iterator set to the beginning of the HashTable
auto key(const Type &t) -> typename std::enable_if< std::is_enum< Type >::value, typename std::underlying_type< Type >::type >::type
static constexpr label size() noexcept
Return the number of elements in the FixedList.
constexpr const_iterator cend() const noexcept
const_iterator to signal the end (for any HashTable)
void unset(List< bool > &bools, const labelRange &range)
Unset the specified range 'on' in a boolList.
bool operator==(const this_type &rhs) const
A HashTable with keys but without contents that is similar to std::unordered_set.
this_type & operator+=(const this_type &rhs)
Add entries to this HashSet. Same as the '|=' operator.
this_type & operator|=(const this_type &rhs)
Add entries to this HashSet.
typename parent_type::const_key_iterator const_iterator
A const_iterator, returning reference to the key.
iterator begin() noexcept
Return an iterator to begin traversing the FixedList.
Ostream & operator<<(Ostream &, const boundaryPatch &p)
Write boundaryPatch as dictionary entries (without surrounding braces)
bool operator!=(const this_type &rhs) const
The opposite of the equality operation.
iterator begin() noexcept
Return an iterator to begin traversing the UList.
patchWriters resize(patchIds.size())
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
tmp< faMatrix< Type > > operator==(const faMatrix< Type > &, const faMatrix< Type > &)
Number of items before requiring line-breaks in the list output.
this_type & operator&=(const this_type &rhs)
Only retain entries found in both HashSets.
bool unset(const Key &key)
Unset the specified key - same as erase.
constexpr const_iterator cend() const noexcept
this_type & operator-=(const this_type &rhs)
Remove entries from this HashSet. Uses erase()
OBJstream os(runTime.globalPath()/outputName)
iterator begin()
Return an iterator at begin of list.
bool operator()(const Key &key) const noexcept
Return true if the entry exists, same as found()
A HashTable similar to std::unordered_map.
iterator begin()
iterator set to the beginning of the HashTable
label capacity() const noexcept
The size of the underlying table.
this_type & operator^=(const this_type &rhs)
Only retain unique entries (xor)
const_iterator cbegin() const
A 1D vector of objects of type <T> with a fixed length <N>.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
label k
Boltzmann constant.
bool insert(const Key &key)
Insert a new entry, not overwriting existing entries.
typename parent_type::key_iterator iterator
An iterator, returning reference to the key.
Base for lists with indirect addressing, templated on the list contents type and the addressing type....
void size(const label n)
Older name for setAddressableSize.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...