A HashTable with keys but without contents that is similar to std::unordered_set.
More...
Public Types | |
| typedef HashSet< Key, Hash > | this_type |
| The template instance used for this HashSet. More... | |
| typedef HashTable< zero::null, Key, Hash > | parent_type |
| The template instance used for the parent HashTable. More... | |
| using | iterator = typename parent_type::key_iterator |
| An iterator, returning reference to the key. More... | |
| using | const_iterator = typename parent_type::const_key_iterator |
| A const_iterator, returning reference to the key. More... | |
 Public Types inherited from HashTable< T, Key, Hash > | |
| typedef HashTable< T, Key, Hash > | this_type |
| The template instance used for this HashTable. More... | |
| typedef std::conditional< std::is_same< zero::null, typenamestd::remove_cv< T >::type >::value, Detail::HashTableSingle< Key >, Detail::HashTablePair< Key, T > >::type | node_type |
| typedef Key | key_type |
| The second template parameter, type of keys used. More... | |
| typedef T | mapped_type |
| The first template parameter, type of objects contained. More... | |
| typedef T | value_type |
| Same as mapped_type for OpenFOAM HashTables. More... | |
| typedef Hash | hasher |
| The third template parameter, the hash index method. More... | |
| typedef T * | pointer |
| Pointer type for storing into value_type objects. More... | |
| typedef T & | reference |
| Reference to the stored value_type. More... | |
| typedef const T * | const_pointer |
| Const pointer type for the stored value_type. More... | |
| typedef const T & | const_reference |
| Const reference to the stored value_type. More... | |
| typedef label | difference_type |
| The type to represent the difference between two iterators. More... | |
| typedef label | size_type |
| The type that can represent the size of a HashTable. More... | |
| using | key_iterator = key_iterator_base< iterator > |
| Forward iterator returning the key. More... | |
| using | const_key_iterator = key_iterator_base< const_iterator > |
| Forward const iterator returning the key. More... | |
Public Member Functions | |
| HashSet () | |
| Default construct with default (128) table capacity. More... | |
| HashSet (const this_type &rhs) | |
| Copy construct. More... | |
| HashSet (this_type &&rhs) | |
| Move construct. More... | |
| HashSet (const label size) | |
| Construct given initial table capacity. More... | |
| HashSet (Istream &is) | |
| Construct from Istream with default table capacity. More... | |
| template<unsigned N> | |
| HashSet (const FixedList< Key, N > &list) | |
| Construct from FixedList of Key. More... | |
| HashSet (const UList< Key > &list) | |
| Construct from UList of Key. More... | |
| template<class Addr > | |
| HashSet (const IndirectListBase< Key, Addr > &list) | |
| Construct from an indirect list. More... | |
| HashSet (std::initializer_list< Key > list) | |
| Construct from an initializer list of Key. More... | |
| template<class AnyType , class AnyHash > | |
| HashSet (const HashTable< AnyType, Key, AnyHash > &tbl) | |
| bool | test (const Key &key) const noexcept |
| Same as found() - return true if key exists in the set. More... | |
| bool | insert (const Key &key) |
| Insert a new entry, not overwriting existing entries. More... | |
| bool | set (const Key &key) |
| Same as insert (no value to overwrite) More... | |
| bool | unset (const Key &key) |
| Unset the specified key - same as erase. More... | |
| template<class InputIter > | |
| label | insert (InputIter first, InputIter last) |
| Insert keys from the input iterator range. More... | |
| label | insert (std::initializer_list< Key > list) |
| Insert keys from a initializer list of Key. More... | |
| template<unsigned N> | |
| label | insert (const FixedList< Key, N > &list) |
| Insert keys from the list of Key. More... | |
| label | insert (const UList< Key > &list) |
| Insert keys from the list of Key. More... | |
| template<class Addr > | |
| label | insert (const IndirectListBase< Key, Addr > &list) |
| Insert keys from the list of Key. More... | |
| template<class InputIter > | |
| label | set (InputIter first, InputIter last) |
| Same as insert (no value to overwrite) More... | |
| label | set (std::initializer_list< Key > list) |
| Same as insert (no value to overwrite) More... | |
| template<unsigned N> | |
| label | set (const FixedList< Key, N > &list) |
| Same as insert (no value to overwrite) More... | |
| label | set (const UList< Key > &list) |
| Same as insert (no value to overwrite) More... | |
| template<class Addr > | |
| label | set (const IndirectListBase< Key, Addr > &list) |
| Same as insert (no value to overwrite) More... | |
| template<class InputIter > | |
| label | setMany (InputIter first, InputIter last) |
| Same as insert (no value to overwrite) More... | |
| template<class InputIter > | |
| label | unset (InputIter first, InputIter last) |
| Unset the keys listed in the input iterator range. More... | |
| label | unset (std::initializer_list< Key > list) |
| Unset the listed keys - same as erase. More... | |
| template<unsigned N> | |
| label | unset (const FixedList< Key, N > &list) |
| Unset the listed keys - same as erase. More... | |
| label | unset (const UList< Key > &list) |
| Unset the listed keys - same as erase. More... | |
| template<class Addr > | |
| label | unset (const IndirectListBase< Key, Addr > &list) |
| Unset the listed keys - same as erase. More... | |
| iterator | begin () |
| const_iterator | begin () const |
| const_iterator | cbegin () const |
| iterator | end () noexcept |
| const_iterator | end () const noexcept |
| constexpr const_iterator | cend () const noexcept |
| Ostream & | writeList (Ostream &os, const label shortLen=0) const |
| bool | operator() (const Key &key) const noexcept |
| Return true if the entry exists, same as found() More... | |
| bool | operator[] (const Key &key) const noexcept |
| Return true if the entry exists, same as found(). More... | |
| void | operator= (const this_type &rhs) |
| Copy assign. More... | |
| void | operator= (this_type &&rhs) |
| Move assign. More... | |
| bool | operator== (const this_type &rhs) const |
| bool | operator!= (const this_type &rhs) const |
| The opposite of the equality operation. More... | |
| void | operator= (const UList< Key > &rhs) |
| Assignment from a UList of keys. More... | |
| template<unsigned N> | |
| void | operator= (const FixedList< Key, N > &rhs) |
| Assignment from a FixedList of keys. More... | |
| void | operator= (std::initializer_list< Key > rhs) |
| Assignment from an initializer list of keys. More... | |
| this_type & | operator|= (const this_type &rhs) |
| Add entries to this HashSet. More... | |
| this_type & | operator&= (const this_type &rhs) |
| Only retain entries found in both HashSets. More... | |
| this_type & | operator^= (const this_type &rhs) |
| Only retain unique entries (xor) More... | |
| this_type & | operator+= (const this_type &rhs) |
| Add entries to this HashSet. Same as the '|=' operator. More... | |
| this_type & | operator-= (const this_type &rhs) |
| Remove entries from this HashSet. Uses erase() More... | |
| template<class UnaryPredicate > | |
| List< Key > | tocValues (const UnaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class BinaryPredicate > | |
| List< Key > | tocEntries (const BinaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class UnaryPredicate > | |
| label | countValues (const UnaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class BinaryPredicate > | |
| label | countEntries (const BinaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class UnaryPredicate > | |
| label | filterValues (const UnaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class BinaryPredicate > | |
| label | filterEntries (const BinaryPredicate &, const bool)=delete |
| Not applicable for HashSet. More... | |
| template<class InputIter > | |
| Foam::label | assignMany (const label nItems, InputIter first, InputIter last) |
| template<class InputIter > | |
| Foam::label | insert (InputIter first, InputIter last) |
| template<unsigned N> | |
| Foam::label | insert (const FixedList< Key, N > &list) |
| template<class Addr > | |
| Foam::label | insert (const IndirectListBase< Key, Addr > &list) |
| template<class InputIter > | |
| Foam::label | unset (InputIter first, InputIter last) |
| template<unsigned N> | |
| Foam::label | unset (const FixedList< Key, N > &list) |
| template<class Addr > | |
| Foam::label | unset (const IndirectListBase< Key, Addr > &list) |
| Public Member Functions inherited from HashTable< T, Key, Hash > | |
| HashTable () | |
| Default construct with default (128) table capacity. More... | |
| HashTable (const label size) | |
| Construct given initial table capacity. More... | |
| HashTable (Istream &is, const label size=128) | |
| Construct from Istream with default table capacity. More... | |
| HashTable (const this_type &ht) | |
| Copy construct. More... | |
| HashTable (this_type &&rhs) | |
| Move construct. More... | |
| HashTable (std::initializer_list< std::pair< Key, T > > list) | |
| Construct from an initializer list. More... | |
| ~HashTable () | |
| Destructor. More... | |
| label | capacity () const noexcept |
| The size of the underlying table. More... | |
| label | size () const noexcept |
| The number of elements in table. More... | |
| bool | empty () const noexcept |
| True if the hash table is empty. More... | |
| T & | at (const Key &key) |
| Find and return a hashed entry. FatalError if it does not exist. More... | |
| const T & | at (const Key &key) const |
| Find and return a hashed entry. FatalError if it does not exist. More... | |
| bool | found (const Key &key) const |
| Return true if hashed entry is found in table. More... | |
| iterator | find (const Key &key) |
| Find and return an iterator set at the hashed entry. More... | |
| const_iterator | find (const Key &key) const |
| Find and return an const_iterator set at the hashed entry. More... | |
| const_iterator | cfind (const Key &key) const |
| Find and return an const_iterator set at the hashed entry. More... | |
| const T & | lookup (const Key &key, const T &deflt) const |
| Return hashed entry if it exists, or return the given default. More... | |
| List< Key > | toc () const |
| The table of contents (the keys) in unsorted order. More... | |
| List< Key > | sortedToc () const |
| The table of contents (the keys) in sorted order. More... | |
| template<class Compare > | |
| List< Key > | sortedToc (const Compare &comp) const |
| template<class UnaryPredicate > | |
| List< Key > | tocKeys (const UnaryPredicate &pred, const bool invert=false) const |
| template<class UnaryPredicate > | |
| List< Key > | tocValues (const UnaryPredicate &pred, const bool invert=false) const |
| template<class BinaryPredicate > | |
| List< Key > | tocEntries (const BinaryPredicate &pred, const bool invert=false) const |
| UPtrList< const node_type > | csorted () const |
| UPtrList< const node_type > | sorted () const |
| UPtrList< node_type > | sorted () |
| template<class UnaryPredicate > | |
| label | countKeys (const UnaryPredicate &pred, const bool invert=false) const |
| Count the number of keys that satisfy the unary predicate. More... | |
| template<class UnaryPredicate > | |
| label | countValues (const UnaryPredicate &pred, const bool invert=false) const |
| Count the number of values that satisfy the unary predicate. More... | |
| template<class BinaryPredicate > | |
| label | countEntries (const BinaryPredicate &pred, const bool invert=false) const |
| Count the number of entries that satisfy the binary predicate. More... | |
| template<class... Args> | |
| bool | emplace (const Key &key, Args &&... args) |
| Emplace insert a new entry, not overwriting existing entries. More... | |
| template<class... Args> | |
| bool | emplace_set (const Key &key, Args &&... args) |
| Emplace set an entry, overwriting any existing entries. More... | |
| bool | insert (const Key &key, const T &obj) |
| Copy insert a new entry, not overwriting existing entries. More... | |
| bool | insert (const Key &key, T &&obj) |
| Move insert a new entry, not overwriting existing entries. More... | |
| bool | set (const Key &key, const T &obj) |
| Copy assign a new entry, overwriting existing entries. More... | |
| bool | set (const Key &key, T &&obj) |
| Move assign a new entry, overwriting existing entries. More... | |
| bool | erase (const iterator &iter) |
| Erase an entry specified by given iterator. More... | |
| bool | erase (const Key &key) |
| Erase an entry specified by the given key. More... | |
| template<class AnyType , class AnyHash > | |
| label | erase (const HashTable< AnyType, Key, AnyHash > &other) |
| Remove table entries given by keys of the other hash-table. More... | |
| label | erase (std::initializer_list< Key > keys) |
| Remove table entries given by the listed keys. More... | |
| template<class InputIter > | |
| label | erase (InputIter first, InputIter last) |
| Remove multiple entries using an iterator range of keys. More... | |
| template<unsigned N> | |
| label | erase (const FixedList< Key, N > &keys) |
| Remove table entries given by the listed keys. More... | |
| label | erase (const UList< Key > &keys) |
| Remove table entries given by the listed keys. More... | |
| template<class AnyType , class AnyHash > | |
| label | retain (const HashTable< AnyType, Key, AnyHash > &other) |
| Retain table entries given by keys of the other hash-table. More... | |
| template<class UnaryPredicate > | |
| label | filterKeys (const UnaryPredicate &pred, const bool pruning=false) |
| Generalized means to filter table entries based on their keys. More... | |
| template<class UnaryPredicate > | |
| label | filterValues (const UnaryPredicate &pred, const bool pruning=false) |
| Generalized means to filter table entries based on their values. More... | |
| template<class BinaryPredicate > | |
| label | filterEntries (const BinaryPredicate &pred, const bool pruning=false) |
| Generalized means to filter table entries based on their key/value. More... | |
| void | resize (const label sz) |
| Resize the hash table for efficiency. More... | |
| void | clear () |
| Clear all entries from table. More... | |
| void | clearStorage () |
| Clear the table entries and the table itself. More... | |
| void | swap (HashTable< T, Key, Hash > &rhs) |
| Swap contents into this table. More... | |
| void | transfer (HashTable< T, Key, Hash > &rhs) |
| Transfer contents into this table. More... | |
| T & | operator[] (const Key &key) |
| Find and return a hashed entry. FatalError if it does not exist. More... | |
| const T & | operator[] (const Key &key) const |
| Find and return a hashed entry. FatalError if it does not exist. More... | |
| T & | operator() (const Key &key) |
| Return existing entry or create a new entry. More... | |
| T & | operator() (const Key &key, const T &deflt) |
| Return existing entry or insert a new entry. More... | |
| void | operator= (const this_type &rhs) |
| Copy assign. More... | |
| void | operator= (std::initializer_list< std::pair< Key, T > > rhs) |
| Copy assign from an initializer list. More... | |
| void | operator= (this_type &&rhs) |
| Move assign. More... | |
| bool | operator== (const this_type &rhs) const |
| bool | operator!= (const this_type &rhs) const |
| The opposite of the equality operation. More... | |
| this_type & | operator+= (const this_type &rhs) |
| Add entries into this HashTable. More... | |
| const_iterator_pair< const_key_iterator, this_type > | keys () const |
| A const iterator begin/end pair for iterating over keys. More... | |
| iterator | begin () |
| iterator set to the beginning of the HashTable More... | |
| const_iterator | begin () const |
| const_iterator set to the beginning of the HashTable More... | |
| const_iterator | cbegin () const |
| const_iterator set to the beginning of the HashTable More... | |
| iterator | end () noexcept |
| iterator to signal the end (for any HashTable) More... | |
| const_iterator | end () const noexcept |
| const_iterator to signal the end (for any HashTable) More... | |
| constexpr const_iterator | cend () const noexcept |
| const_iterator to signal the end (for any HashTable) More... | |
| Ostream & | printInfo (Ostream &os) const |
| Print information. More... | |
| Ostream & | writeKeys (Ostream &os, const label shortLen=0) const |
| template<class Compare > | |
| Foam::List< Key > | sortedToc (const Compare &comp) const |
| template<class UnaryPredicate > | |
| Foam::List< Key > | tocKeys (const UnaryPredicate &pred, const bool invert) const |
| template<class UnaryPredicate > | |
| Foam::List< Key > | tocValues (const UnaryPredicate &pred, const bool invert) const |
| template<class BinaryPredicate > | |
| Foam::List< Key > | tocEntries (const BinaryPredicate &pred, const bool invert) const |
| template<class UnaryPredicate > | |
| Foam::label | countKeys (const UnaryPredicate &pred, const bool invert) const |
| template<class UnaryPredicate > | |
| Foam::label | countValues (const UnaryPredicate &pred, const bool invert) const |
| template<class BinaryPredicate > | |
| Foam::label | countEntries (const BinaryPredicate &pred, const bool invert) const |
| template<class InputIter > | |
| Foam::label | erase (InputIter first, InputIter last) |
| template<unsigned N> | |
| Foam::label | erase (const FixedList< Key, N > &keys) |
| template<class AnyType , class AnyHash > | |
| Foam::label | erase (const HashTable< AnyType, Key, AnyHash > &other) |
| template<class AnyType , class AnyHash > | |
| Foam::label | retain (const HashTable< AnyType, Key, AnyHash > &other) |
| template<class UnaryPredicate > | |
| Foam::label | filterKeys (const UnaryPredicate &pred, const bool pruning) |
| template<class UnaryPredicate > | |
| Foam::label | filterValues (const UnaryPredicate &pred, const bool pruning) |
| template<class BinaryPredicate > | |
| Foam::label | filterEntries (const BinaryPredicate &pred, const bool pruning) |
| Public Member Functions inherited from HashTableCore | |
| ClassName ("HashTable") | |
| Declare type-name (with debug switch) More... | |
| HashTableCore ()=default | |
| Default construct. More... | |
Additional Inherited Members | |
| Static Public Member Functions inherited from HashTableCore | |
| static label | canonicalSize (const label requested_size) |
| Return a canonical (power-of-two) of the requested size. More... | |
| Static Public Attributes inherited from HashTableCore | |
| static const label | maxTableSize |
| Maximum allowable internal table size. Approximately labelMax/4. More... | |
| Protected Member Functions inherited from HashTable< T, Key, Hash > | |
| bool | iterator_erase (node_type *&entry, label &index) |
| Low-level entry erasure using iterator internals. More... | |
A HashTable with keys but without contents that is similar to std::unordered_set.
The entries are considered unordered since their placement depends on the method used to generate the hash key index, the table capacity, insertion order etc. When the key order is important, use the sortedToc() method to obtain a list of sorted keys and use that for further access.
| typedef HashTable<zero::null, Key, Hash> parent_type |
| using iterator = typename parent_type::key_iterator |
| using const_iterator = typename parent_type::const_key_iterator |
|
inline |
|
inlineexplicit |
Construct from FixedList of Key.
Definition at line 64 of file HashSet.C.
References FixedList< T, N >::begin(), FixedList< T, N >::end(), and HashSet< Key, Hash >::insert().
Construct from UList of Key.
Definition at line 73 of file HashSet.C.
References UList< T >::begin(), UList< T >::end(), and HashSet< Key, Hash >::insert().
|
explicit |
Construct from an indirect list.
Definition at line 83 of file HashSet.C.
References IndirectListBase< T, Addr >::begin(), IndirectListBase< T, Addr >::end(), and HashSet< Key, Hash >::insert().
| HashSet | ( | std::initializer_list< Key > | list | ) |
Construct from an initializer list of Key.
Definition at line 92 of file HashSet.C.
References HashSet< Key, Hash >::insert().
Construct from the keys of another HashTable, the type of values held is arbitrary.
Definition at line 102 of file HashSet.C.
References HashTable< T, Key, Hash >::cbegin(), HashTable< T, Key, Hash >::cend(), and HashSet< Key, Hash >::insert().
|
inlinenoexcept |
Same as found() - return true if key exists in the set.
Method name compatibility with bitSet and boolList.
Definition at line 180 of file HashSet.H.
Referenced by mappedPatchBase::calcMapping().
|
inline |
Insert a new entry, not overwriting existing entries.
Definition at line 191 of file HashSet.H.
Referenced by primitiveMeshGeometry::affectedCells(), polyMeshGeometry::affectedCells(), PDRblock::blockMeshDict(), faMesh::boundaryProcs(), faPatch::boundaryProcs(), decompositionMethod::calcCellCells(), cellToFaceStencil::calcFaceStencil(), faPatch::calcPointLabels(), solarLoad::calculate(), extractEulerianParticles::calculateAddressing(), cellFeatures::cellFeatures(), cellVolumeWeight::cellVolumeWeight(), polyMeshGeometry::checkCellDeterminant(), primitiveMeshGeometry::checkCellDeterminant(), primitiveMesh::checkCellsZipUp(), primitiveMesh::checkCellVolumes(), primitiveMesh::checkClosedCells(), primitiveMesh::checkCommonOrder(), primitiveMesh::checkConcaveCells(), zone::checkDefinition(), primitiveMesh::checkDuplicateFaces(), primitiveMesh::checkEdgeLength(), polyMeshGeometry::checkFaceAngles(), primitiveMeshGeometry::checkFaceAngles(), primitiveMesh::checkFaceAngles(), polyMeshGeometry::checkFaceArea(), primitiveMeshGeometry::checkFaceArea(), primitiveMesh::checkFaceAreas(), primitiveMeshGeometry::checkFaceDotProduct(), polyMeshGeometry::checkFaceFlatness(), primitiveMesh::checkFaceFlatness(), primitiveMesh::checkFaceOrthogonality(), polyMeshGeometry::checkFacePyramids(), primitiveMeshGeometry::checkFacePyramids(), primitiveMesh::checkFacePyramids(), polyMeshGeometry::checkFaceSkewness(), primitiveMeshGeometry::checkFaceSkewness(), primitiveMesh::checkFaceSkewness(), polyMeshGeometry::checkFaceTets(), polyMeshTetDecomposition::checkFaceTets(), polyMeshGeometry::checkFaceTwist(), primitiveMeshGeometry::checkFaceTwist(), primitiveMesh::checkFaceVertices(), polyMeshGeometry::checkFaceWeights(), primitiveMeshGeometry::checkFaceWeights(), PatchTools::checkOrientation(), PrimitivePatch< FaceList, PointField >::checkPointManifold(), primitiveMesh::checkPointNearness(), primitiveMesh::checkPoints(), PrimitivePatch< FaceList, PointField >::checkTopology(), polyMeshGeometry::checkTriangleTwist(), primitiveMesh::checkUpperTriangular(), polyMeshGeometry::checkVolRatio(), hexRef8::consistentSlowRefinement2(), inverseFaceDistanceDiffusivity::correct(), inversePointDistanceDiffusivity::correct(), meshRefinement::createBaffles(), box::createMap(), curvatureSeparation::curvatureSeparation(), geomCellLooper::cut(), hexCellLooper::cut(), Foam::meshTools::cutDirToEdge(), structuredDecomp::decompose(), faMeshDecomposition::decomposeMesh(), meshRefinement::doRemovePoints(), meshRefinement::doRestorePoints(), polyBoundaryMesh::findPatchIDs(), Foam::getAcceptableFunctionKeys(), surfaceSets::getHangingCells(), combineFaces::getMergeSets(), cellDistFuncs::getPatchIDs(), cellDistFuncs::getPointNeighbours(), surfaceSets::getSurfaceSets(), removePoints::getUnrefimentSet(), triSurfaceTools::getVertexVertices(), HashSet< Key, Hash >::HashSet(), faBoundaryMesh::indices(), polyBoundaryMesh::indices(), ZoneMesh< ZoneType, MeshType >::indices(), viewFactor::initialise(), cellToCellStencil::insertFaceCells(), cellToFaceStencil::insertFaceCells(), dynamicOversetFvMesh::interpolateFields(), Foam::interpolatePointToCell(), inverseDistance::inverseDistance(), isoSurfaceTopo::isoSurfaceTopo(), seriesWriter::load(), edgeMesh::mergeEdges(), surfaceIntersection::mergeEdges(), meshRefinement::mergePatchFaces(), meshRefinement::mergePatchFacesUndo(), noiseFFT::octaveBandInfo(), faceAreaWeightAMI2D::overlappingTgtFaces(), InflationInjection< CloudType >::parcelsToInject(), ParticleErosion< CloudType >::ParticleErosion(), polyBoundaryMesh::patchSet(), Foam::polyMeshZipUpCells(), probes::prepare(), Foam::printBadEntries(), AMIWeights::read(), wallShearStress::read(), wallHeatFlux::read(), NASsurfaceFormat< Face >::read(), functionObjectList::readFunctionObject(), triSurface::readTypes(), structuredRenumber::renumber(), faMeshBoundaryHalo::reset(), vtuSizing::reset(), motionSmootherAlgo::scaleMesh(), mapDistributeBase::schedule(), triSurfaceLoader::select(), HashSet< Key, Hash >::set(), cellSetOption::setCellSelection(), HashSet< Key, Hash >::setMany(), noiseModel::setOctaveBands(), removePoints::setRefinement(), addPatchCellLayer::setRefinement(), perfectInterface::setRefinement(), hexRef8::setRefinement(), removeFaces::setRefinement(), hexRef8::setUnrefinement(), meshRefinement::splitFacesUndo(), edgeVertex::updateLabels(), faGlobalMeshData::updateMesh(), Foam::HashSetOps::used(), cuttingSurfaceBase::walkCellCuts(), Foam::meshTools::writeOBJ(), triSurface::writeStats(), isoAdvection::writeSurfaceCells(), and triSurface::writeTypes().
|
inline |
Same as insert (no value to overwrite)
Definition at line 197 of file HashSet.H.
References HashSet< Key, Hash >::insert().
Referenced by mappedPatchBase::calcMapping(), Foam::checkFireEdges(), pointSet::distribute(), cellSet::distribute(), faceSet::distribute(), topoSet::set(), Foam::BitOps::set(), faceSet::sync(), pointSet::sync(), and topoSet::updateLabels().
|
inline |
Unset the specified key - same as erase.
Definition at line 204 of file HashSet.H.
Referenced by turbulenceFields::initialise(), Foam::listSwitches(), topoSet::unset(), and Foam::BitOps::unset().
|
inline |
Insert keys from the input iterator range.
|
inline |
Insert keys from the list of Key.
|
inline |
|
inline |
Insert keys from the list of Key.
|
inline |
Same as insert (no value to overwrite)
Definition at line 237 of file HashSet.H.
References HashSet< Key, Hash >::insert().
|
inline |
Same as insert (no value to overwrite)
Definition at line 243 of file HashSet.H.
References HashSet< Key, Hash >::insert().
Same as insert (no value to overwrite)
Definition at line 250 of file HashSet.H.
References HashSet< Key, Hash >::insert().
|
inline |
Same as insert (no value to overwrite)
Definition at line 256 of file HashSet.H.
References HashSet< Key, Hash >::insert().
|
inline |
Same as insert (no value to overwrite)
Definition at line 263 of file HashSet.H.
References HashSet< Key, Hash >::insert().
|
inline |
Same as insert (no value to overwrite)
Definition at line 271 of file HashSet.H.
References HashSet< Key, Hash >::insert().
|
inline |
Unset the keys listed in the input iterator range.
|
inline |
Unset the listed keys - same as erase.
|
inline |
|
inline |
Unset the listed keys - same as erase.
|
inline |
Definition at line 446 of file HashSet.C.
References HashTable< T, Key, Hash >::begin().
Referenced by Foam::HashSetOps::bitset(), and Foam::HashSetOps::bools().
|
inline |
Definition at line 457 of file HashSet.C.
References HashTable< T, Key, Hash >::begin().
|
inline |
Definition at line 468 of file HashSet.C.
References HashTable< T, Key, Hash >::cbegin().
Referenced by HashSet< Key, Hash >::operator==().
|
inlinenoexcept |
Definition at line 479 of file HashSet.C.
Referenced by Foam::HashSetOps::bitset(), and Foam::HashSetOps::bools().
|
inlinenoexcept |
|
inlineconstexprnoexcept |
Definition at line 495 of file HashSet.C.
Referenced by HashSet< Key, Hash >::operator==().
Copy assign.
Definition at line 332 of file HashSet.H.
References HashTable< T, Key, Hash >::operator=().
Move assign.
Definition at line 338 of file HashSet.H.
References HashTable< T, Key, Hash >::operator=().
Sets are equal if all keys are equal, independent of order or underlying storage size.
Definition at line 274 of file HashSet.C.
References HashSet< Key, Hash >::cbegin(), HashSet< Key, Hash >::cend(), and HashTable< T, Key, Hash >::size().
The opposite of the equality operation.
Definition at line 295 of file HashSet.C.
References Foam::operator==().
Assignment from a UList of keys.
Definition at line 260 of file HashSet.C.
References UList< T >::begin(), UList< T >::end(), and UList< T >::size().
Assignment from a FixedList of keys.
Definition at line 253 of file HashSet.C.
References FixedList< T, N >::begin(), FixedList< T, N >::end(), and FixedList< T, N >::size().
| void operator= | ( | std::initializer_list< Key > | rhs | ) |
| Foam::HashSet< Key, Hash > & operator|= | ( | const this_type & | rhs | ) |
|
inline |
| Foam::HashSet< Key, Hash > & operator^= | ( | const this_type & | rhs | ) |
|
inline |
|
inline |
|
inline |
|
inline |
Definition at line 151 of file HashSet.C.
References FixedList< T, N >::begin(), FixedList< T, N >::end(), and insert().
|
inline |
|
inline |
Definition at line 205 of file HashSet.C.
References FixedList< T, N >::begin(), and FixedList< T, N >::end().
|
inline |
1.9.5 