pointPairs< Triangulation > Class Template Reference

HashSet of unique edges. The edges are stored as a pair of pairs: More...

Inheritance diagram for pointPairs< Triangulation >:
[legend]
Collaboration diagram for pointPairs< Triangulation >:
[legend]

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 >
Foam::label assignMany (const label nItems, InputIter first, InputIter last)
 
 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...
 
 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 HashTable< AnyType, labelPairPair, AnyHash > &tbl)
 
bool test (const labelPairPair &key) const noexcept
 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
 
iterator end () noexcept
 
const_iterator end () const noexcept
 
constexpr const_iterator cend () const noexcept
 
OstreamwriteList (Ostream &os, const label shortLen=0) const
 
bool operator() (const labelPairPair &key) const noexcept
 Return true if the entry exists, same as found() More...
 
bool operator[] (const labelPairPair &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...
 
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_typeoperator|= (const this_type &rhs)
 Add entries to this HashSet. More...
 
this_typeoperator&= (const this_type &rhs)
 Only retain entries found in both HashSets. More...
 
this_typeoperator^= (const this_type &rhs)
 Only retain unique entries (xor) More...
 
this_typeoperator+= (const this_type &rhs)
 Add entries to this HashSet. Same as the '|=' operator. More...
 
this_typeoperator-= (const this_type &rhs)
 Remove entries from this HashSet. Uses erase() More...
 
List< labelPairPairtocValues (const UnaryPredicate &, const bool)=delete
 Not applicable for HashSet. More...
 
List< labelPairPairtocEntries (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...
 

Additional Inherited Members

- Public Types inherited from HashSet< labelPairPair >
typedef HashSet< labelPairPair, Foam::Hash< labelPairPair > > this_type
 The template instance used for this HashSet. More...
 
typedef HashTable< zero::null, labelPairPair, Foam::Hash< labelPairPair > > 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...
 

Detailed Description

template<class Triangulation>
class Foam::pointPairs< Triangulation >

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 56 of file pointPairs.H.

Constructor & Destructor Documentation

◆ pointPairs()

pointPairs ( const Triangulation &  triangulation)

Construct from triangulation.

◆ ~pointPairs()

~pointPairs ( )

Destructor.

Member Function Documentation

◆ isPointPair() [1/2]

bool isPointPair ( const Vertex_handle &  vA,
const Vertex_handle &  vB 
) const
inline

◆ isPointPair() [2/2]

bool isPointPair ( const labelPair vA,
const labelPair vB 
) const
inline

◆ addPointPair() [1/3]

bool addPointPair ( const labelPair vA,
const labelPair vB 
)
inline

◆ addPointPair() [2/3]

bool addPointPair ( const labelPair master,
const DynamicList< labelPair > &  slaves 
)
inline

◆ addPointPair() [3/3]

bool addPointPair ( const label  vA,
const label  vB 
)
inline

◆ reIndex()

void reIndex ( const Map< label > &  oldToNewIndices)

The documentation for this class was generated from the following file: