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< labelPairPair, labelPairPair::Hash<> > | |
Foam::label | assignMany (const label nItems, InputIter first, InputIter last) |
HashSet () | |
Construct null with default (128) table capacity. More... | |
HashSet (const label size) | |
Construct given initial table capacity. More... | |
HashSet (Istream &is) | |
Construct from Istream with default table capacity. More... | |
HashSet (const FixedList< labelPairPair, N > &list) | |
Construct from FixedList of Key. More... | |
HashSet (const UList< labelPairPair > &list) | |
Construct from UList of Key. More... | |
HashSet (const IndirectListBase< labelPairPair, Addr > &list) | |
Construct from an indirect list. More... | |
HashSet (std::initializer_list< labelPairPair > list) | |
Construct from an initializer list of Key. More... | |
HashSet (const this_type &hs) | |
Copy construct. More... | |
HashSet (this_type &&hs) | |
Move construct. More... | |
HashSet (const HashTable< AnyType, labelPairPair, AnyHash > &tbl) | |
bool | test (const labelPairPair &key) const |
Same as found() - return true if key exists in the set. More... | |
bool | insert (const labelPairPair &key) |
Insert a new entry, not overwriting existing entries. More... | |
label | insert (InputIter first, InputIter last) |
Insert keys from the input iterator range. More... | |
label | insert (std::initializer_list< labelPairPair > list) |
Insert keys from a initializer list of Key. More... | |
label | insert (const FixedList< labelPairPair, N > &list) |
Insert keys from the list of Key. More... | |
label | insert (const UList< labelPairPair > &list) |
Insert keys from the list of Key. More... | |
label | insert (const IndirectListBase< labelPairPair, Addr > &list) |
Insert keys from the list of Key. More... | |
Foam::label | insert (InputIter first, InputIter last) |
Foam::label | insert (const FixedList< labelPairPair, N > &list) |
Foam::label | insert (const IndirectListBase< labelPairPair, Addr > &list) |
bool | set (const labelPairPair &key) |
Same as insert (no value to overwrite) More... | |
label | set (InputIter first, InputIter last) |
Same as insert (no value to overwrite) More... | |
label | set (std::initializer_list< labelPairPair > list) |
Same as insert (no value to overwrite) More... | |
label | set (const FixedList< labelPairPair, N > &list) |
Same as insert (no value to overwrite) More... | |
label | set (const UList< labelPairPair > &list) |
Same as insert (no value to overwrite) More... | |
label | set (const IndirectListBase< labelPairPair, Addr > &list) |
Same as insert (no value to overwrite) More... | |
bool | unset (const labelPairPair &key) |
Unset the specified key - same as erase. More... | |
label | unset (InputIter first, InputIter last) |
Unset the keys listed in the input iterator range. More... | |
label | unset (std::initializer_list< labelPairPair > list) |
Unset the listed keys - same as erase. More... | |
label | unset (const FixedList< labelPairPair, N > &list) |
Unset the listed keys - same as erase. More... | |
label | unset (const UList< labelPairPair > &list) |
Unset the listed keys - same as erase. More... | |
label | unset (const IndirectListBase< labelPairPair, Addr > &list) |
Unset the listed keys - same as erase. More... | |
Foam::label | unset (InputIter first, InputIter last) |
Foam::label | unset (const FixedList< labelPairPair, N > &list) |
Foam::label | unset (const IndirectListBase< labelPairPair, Addr > &list) |
label | setMany (InputIter first, InputIter last) |
Same as insert (no value to overwrite) More... | |
iterator | begin () |
const_iterator | begin () const |
const_iterator | cbegin () const |
const iterator & | end () |
const const_iterator & | end () const |
const const_iterator & | cend () const |
Ostream & | writeList (Ostream &os, const label shortLen=0) const |
bool | operator() (const labelPairPair &key) const |
Return true if the entry exists, same as found() More... | |
bool | operator[] (const labelPairPair &key) const |
Return true if the entry exists, same as found(). More... | |
void | operator= (const this_type &rhs) |
Copy assignment. More... | |
void | operator= (this_type &&rhs) |
Move assignment. More... | |
void | operator= (const UList< labelPairPair > &rhs) |
Assignment from a UList of keys. More... | |
void | operator= (const FixedList< labelPairPair, N > &rhs) |
Assignment from a FixedList of keys. More... | |
void | operator= (std::initializer_list< labelPairPair > rhs) |
Assignment from an initializer list of keys. 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 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. More... | |
this_type & | operator-= (const this_type &rhs) |
Remove entries from this HashSet. More... | |
List< labelPairPair > | tocValues (const UnaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
List< labelPairPair > | tocEntries (const BinaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
label | countValues (const UnaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
label | countEntries (const BinaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
label | filterValues (const UnaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
label | filterEntries (const BinaryPredicate &, const bool)=delete |
Not applicable for HashSet. More... | |
Public Member Functions inherited from HashTable< zero::null, labelPairPair, labelPairPair::Hash<> > | |
HashTable () | |
Construct null 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< labelPairPair, zero::null >> 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... | |
zero::null & | at (const labelPairPair &key) |
Find and return a hashed entry. FatalError if it does not exist. More... | |
const zero::null & | at (const labelPairPair &key) const |
Find and return a hashed entry. FatalError if it does not exist. More... | |
bool | found (const labelPairPair &key) const |
Return true if hashed entry is found in table. More... | |
iterator | find (const labelPairPair &key) |
Find and return an iterator set at the hashed entry. More... | |
const_iterator | find (const labelPairPair &key) const |
Find and return an const_iterator set at the hashed entry. More... | |
const_iterator | cfind (const labelPairPair &key) const |
Find and return an const_iterator set at the hashed entry. More... | |
const zero::null & | lookup (const labelPairPair &key, const zero::null &deflt) const |
Return hashed entry if it exists, or return the given default. More... | |
List< labelPairPair > | toc () const |
The table of contents (the keys) in unsorted order. More... | |
List< labelPairPair > | sortedToc () const |
The table of contents (the keys) in sorted order. More... | |
List< labelPairPair > | sortedToc (const Compare &comp) const |
Foam::List< labelPairPair > | sortedToc (const Compare &comp) const |
List< labelPairPair > | tocKeys (const UnaryPredicate &pred, const bool invert=false) const |
Foam::List< labelPairPair > | tocKeys (const UnaryPredicate &pred, const bool invert) const |
List< labelPairPair > | tocValues (const UnaryPredicate &pred, const bool invert=false) const |
Foam::List< labelPairPair > | tocValues (const UnaryPredicate &pred, const bool invert) const |
List< labelPairPair > | tocEntries (const BinaryPredicate &pred, const bool invert=false) const |
Foam::List< labelPairPair > | tocEntries (const BinaryPredicate &pred, const bool invert) const |
label | countKeys (const UnaryPredicate &pred, const bool invert=false) const |
Count the number of keys that satisfy the unary predicate. More... | |
Foam::label | countKeys (const UnaryPredicate &pred, const bool invert) const |
label | countValues (const UnaryPredicate &pred, const bool invert=false) const |
Count the number of values that satisfy the unary predicate. More... | |
Foam::label | countValues (const UnaryPredicate &pred, const bool invert) const |
label | countEntries (const BinaryPredicate &pred, const bool invert=false) const |
Count the number of entries that satisfy the binary predicate. More... | |
Foam::label | countEntries (const BinaryPredicate &pred, const bool invert) const |
bool | emplace (const labelPairPair &key, Args &&... args) |
Emplace insert a new entry, not overwriting existing entries. More... | |
bool | insert (const labelPairPair &key, const zero::null &obj) |
Copy insert a new entry, not overwriting existing entries. More... | |
bool | insert (const labelPairPair &key, zero::null &&obj) |
Move insert a new entry, not overwriting existing entries. More... | |
bool | set (const labelPairPair &key, const zero::null &obj) |
Copy assign a new entry, overwriting existing entries. More... | |
bool | set (const labelPairPair &key, zero::null &&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 labelPairPair &key) |
Erase an entry specified by the given key. More... | |
label | erase (const HashTable< AnyType, labelPairPair, AnyHash > &other) |
Remove table entries given by keys of the other hash-table. More... | |
label | erase (std::initializer_list< labelPairPair > keys) |
Remove table entries given by the listed keys. More... | |
label | erase (InputIter first, InputIter last) |
Remove multiple entries using an iterator range of keys. More... | |
label | erase (const FixedList< labelPairPair, N > &keys) |
Remove table entries given by the listed keys. More... | |
label | erase (const UList< labelPairPair > &keys) |
Remove table entries given by the listed keys. More... | |
Foam::label | erase (InputIter first, InputIter last) |
Foam::label | erase (const FixedList< labelPairPair, N > &keys) |
Foam::label | erase (const HashTable< AnyType, labelPairPair, AnyHash > &other) |
label | retain (const HashTable< AnyType, labelPairPair, AnyHash > &other) |
Retain table entries given by keys of the other hash-table. More... | |
Foam::label | retain (const HashTable< AnyType, labelPairPair, AnyHash > &other) |
label | filterKeys (const UnaryPredicate &pred, const bool pruning=false) |
Generalized means to filter table entries based on their keys. More... | |
Foam::label | filterKeys (const UnaryPredicate &pred, const bool pruning) |
label | filterValues (const UnaryPredicate &pred, const bool pruning=false) |
Generalized means to filter table entries based on their values. More... | |
Foam::label | filterValues (const UnaryPredicate &pred, const bool pruning) |
label | filterEntries (const BinaryPredicate &pred, const bool pruning=false) |
Generalized means to filter table entries based on their key/value. More... | |
Foam::label | filterEntries (const BinaryPredicate &pred, const bool pruning) |
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< zero::null, labelPairPair, labelPairPair::Hash<> > &rhs) |
Swap contents into this table. More... | |
void | transfer (HashTable< zero::null, labelPairPair, labelPairPair::Hash<> > &rhs) |
Transfer contents into this table. More... | |
zero::null & | operator[] (const labelPairPair &key) |
Find and return a hashed entry. FatalError if it does not exist. More... | |
const zero::null & | operator[] (const labelPairPair &key) const |
Find and return a hashed entry. FatalError if it does not exist. More... | |
zero::null & | operator() (const labelPairPair &key) |
Return existing entry or create a new entry. More... | |
zero::null & | operator() (const labelPairPair &key, const zero::null &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< labelPairPair, zero::null >> 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... | |
const iterator & | end () |
iterator to signal the end for any HashTable More... | |
const const_iterator & | end () const |
const_iterator to signal the end for any HashTable More... | |
const const_iterator & | cend () const |
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 |
Additional Inherited Members | |
Public Types inherited from HashSet< labelPairPair, labelPairPair::Hash<> > | |
typedef HashSet< labelPairPair, labelPairPair::Hash<> > | this_type |
The template instance used for this HashSet. More... | |
typedef HashTable< zero::null, labelPairPair, labelPairPair::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< zero::null, labelPairPair, labelPairPair::Hash<> > | |
typedef HashTable< zero::null, labelPairPair, labelPairPair::Hash<> > | this_type |
The template instance used for this HashTable. More... | |
typedef labelPairPair | key_type |
The second template parameter, type of keys used. More... | |
typedef zero::null | mapped_type |
The first template parameter, type of objects contained. More... | |
typedef zero::null | value_type |
Same as mapped_type for OpenFOAM HashTables. More... | |
typedef labelPairPair::Hash<> | hasher |
The third template parameter, the hash index method. More... | |
typedef zero::null & | reference |
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 Attributes inherited from HashTable< zero::null, labelPairPair, labelPairPair::Hash<> > | |
const typedef zero::null & | const_reference |
Const reference to the stored value_type. More... | |
Protected Member Functions inherited from HashTable< zero::null, labelPairPair, labelPairPair::Hash<> > | |
bool | iterator_erase (node_type *&entry, label &index) |
Low-level entry erasure using iterator internals. 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 55 of file pointPairs.H.
pointPairs | ( | const Triangulation & | triangulation | ) |
Construct from triangulation.
~pointPairs | ( | ) |
Destructor.
|
inline |
|
inline |