HashSet of unique edges. The edges are stored as a pair of pairs: More...
Public Member Functions | |
pointPairs (const Triangulation &triangulation) | |
Construct from triangulation. More... | |
~pointPairs () | |
Destructor. More... | |
bool | isPointPair (const Vertex_handle &vA, const Vertex_handle &vB) const |
bool | isPointPair (const labelPair &vA, const labelPair &vB) const |
bool | addPointPair (const labelPair &vA, const labelPair &vB) |
bool | addPointPair (const labelPair &master, const DynamicList< labelPair > &slaves) |
bool | addPointPair (const label vA, const label vB) |
void | reIndex (const Map< label > &oldToNewIndices) |
Public Member Functions inherited from HashSet< Key, Hash > | |
HashSet (const label size=128) | |
Construct given initial size. More... | |
HashSet (Istream &is) | |
Construct from Istream. More... | |
HashSet (const UList< Key > &) | |
Construct from UList of Key. More... | |
template<unsigned Size> | |
HashSet (const FixedList< Key, Size > &) | |
Construct from FixedList of Key. More... | |
HashSet (const HashSet< Key, Hash > &hs)=default | |
Copy constructor. More... | |
HashSet (HashSet< Key, Hash > &&hs)=default | |
Move constructor. More... | |
template<class AnyType , class AnyHash > | |
HashSet (const HashTable< AnyType, Key, AnyHash > &) | |
Construct from the keys of another HashTable,. More... | |
HashSet (std::initializer_list< Key >) | |
Construct from an initialiser list. More... | |
bool | insert (const Key &key) |
Insert a new entry. More... | |
label | insert (const UList< Key > &) |
Insert keys from a UList of Key. More... | |
bool | set (const Key &key) |
Same as insert (cannot overwrite nil content) More... | |
label | set (const UList< Key > &lst) |
Same as insert (cannot overwrite nil content) More... | |
bool | unset (const Key &key) |
Unset the specified key - same as erase. More... | |
bool | operator[] (const Key &) const |
Return true if the entry exists, same as found() More... | |
void | operator= (const HashSet< Key, Hash > &) |
Assignment operator. More... | |
void | operator= (HashSet< Key, Hash > &&) |
Move assignment operator. More... | |
bool | operator== (const HashSet< Key, Hash > &) const |
Equality. Two hashtables are equal when their contents are equal. More... | |
bool | operator!= (const HashSet< Key, Hash > &) const |
The opposite of the equality operation. More... | |
void | operator|= (const HashSet< Key, Hash > &) |
Combine entries from HashSets. More... | |
void | operator &= (const HashSet< Key, Hash > &) |
Only retain entries found in both HashSets. More... | |
void | operator^= (const HashSet< Key, Hash > &) |
Only retain unique entries (xor) More... | |
void | operator+= (const HashSet< Key, Hash > &rhs) |
Add entries listed in the given HashSet to this HashSet. More... | |
void | operator-= (const HashSet< Key, Hash > &) |
Remove entries listed in the given HashSet from this HashSet. More... | |
Public Member Functions inherited from HashTable< nil, Key, Hash > | |
bool | set (const Key &, const nil &newElmt) |
Assign a new hashedEntry, overwriting existing entries. More... | |
HashTable (const label size=128) | |
Construct given initial table size. More... | |
HashTable (Istream &, const label size=128) | |
Construct from Istream. More... | |
HashTable (const HashTable< nil, Key, Hash > &) | |
Copy constructor. More... | |
HashTable (HashTable< nil, Key, Hash > &&) | |
Move constructor. More... | |
HashTable (std::initializer_list< Tuple2< Key, nil >>) | |
Construct from an initialiser list. More... | |
~HashTable () | |
Destructor. More... | |
label | capacity () const |
The size of the underlying table. More... | |
label | size () const |
Return number of elements in table. More... | |
bool | empty () const |
Return true if the hash table is empty. More... | |
bool | found (const Key &) const |
Return true if hashedEntry is found in table. More... | |
iterator | find (const Key &) |
Find and return an iterator set at the hashedEntry. More... | |
const_iterator | find (const Key &) const |
Find and return an const_iterator set at the hashedEntry. More... | |
List< Key > | toc () const |
Return the table of contents. More... | |
List< Key > | sortedToc () const |
Return the table of contents as a sorted list. More... | |
Ostream & | printInfo (Ostream &) const |
Print information. More... | |
bool | insert (const Key &, const nil &newElmt) |
Insert a new hashedEntry. More... | |
bool | erase (const iterator &) |
Erase a hashedEntry specified by given iterator. More... | |
bool | erase (const Key &) |
Erase a hashedEntry specified by the given key. More... | |
label | erase (const UList< Key > &) |
Remove entries given by the listed keys from this HashTable. More... | |
label | erase (const HashTable< AnyType, Key, AnyHash > &) |
Remove entries given by the given keys from this HashTable. More... | |
Foam::label | erase (const HashTable< AnyType, Key, AnyHash > &rhs) |
void | resize (const label newSize) |
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 | shrink () |
Shrink the allocated table to approx. twice number of elements. More... | |
void | transfer (HashTable< nil, Key, Hash > &) |
Transfer the contents of the argument table into this table. More... | |
nil & | operator[] (const Key &) |
Find and return a hashedEntry. More... | |
const nil & | operator[] (const Key &) const |
Find and return a hashedEntry. More... | |
nil & | operator() (const Key &) |
Find and return a hashedEntry, create it null if not present. More... | |
void | operator= (const HashTable< nil, Key, Hash > &) |
Assignment operator. More... | |
void | operator= (HashTable< nil, Key, Hash > &&) |
Move assignment operator. More... | |
void | operator= (std::initializer_list< Tuple2< Key, nil >>) |
Assignment to an initialiser list. More... | |
bool | operator== (const HashTable< nil, Key, Hash > &) const |
Equality. Hash tables are equal if the keys and values are equal. More... | |
bool | operator!= (const HashTable< nil, Key, Hash > &) const |
The opposite of the equality operation. Takes linear time. 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... | |
Public Member Functions inherited from HashTableCore | |
HashTableCore () | |
Construct null. More... | |
ClassName ("HashTable") | |
Define template name and debug. More... | |
Additional Inherited Members | |
Public Types inherited from HashSet< Key, Hash > | |
typedef HashTable< nil, Key, Hash >::iterator | iterator |
typedef HashTable< nil, Key, Hash >::const_iterator | const_iterator |
Public Types inherited from HashTable< nil, Key, Hash > | |
typedef nil | value_type |
Type of values the HashTable contains. More... | |
typedef nil & | reference |
Type that can be used for storing into HashTable::value_type. More... | |
typedef const nil & | const_reference |
Type that can be used for storing into constant. More... | |
typedef label | size_type |
The type that can represent the size of a HashTable. More... | |
Static Public Member Functions inherited from HashTableCore | |
static label | canonicalSize (const label) |
Return a canonical (power-of-two) size. More... | |
static iteratorEnd | cend () |
iteratorEnd set to beyond the end of any HashTable More... | |
static iteratorEnd | end () |
iteratorEnd set to beyond the end of any HashTable More... | |
Static Public Attributes inherited from HashTableCore | |
static const label | maxTableSize |
Maximum allowable table size. More... | |
HashSet of unique edges. The edges are stored as a pair of pairs:
( (local index, processor index) (local index, processor index) )
e.g.,
( (0 1) (3 1) ) ( (0 2) (5 1) )
Definition at line 60 of file pointPairs.H.
pointPairs | ( | const Triangulation & | triangulation | ) |
Construct from triangulation.
~pointPairs | ( | ) |
Destructor.
|
inline |
Referenced by conformalVoronoiMesh::maxSurfaceProtrusion().
|
inline |