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

Inheritance diagram for pointPairs< Triangulation >:

Collaboration diagram for pointPairs< Triangulation >:

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...

	HashSet (const HashSet< Key, Hash > &hs)
	Construct as copy. More...

	HashSet (const Xfer< HashSet< Key, Hash > > &hs)
	Construct by transferring the parameter contents. More...

	HashSet (const Xfer< HashTable< nil, Key, Hash > > &hs)
	Construct by transferring the parameter contents. More...

template<class AnyType , class AnyHash >
	HashSet (const HashTable< AnyType, Key, AnyHash > &)
	Construct from the keys of another HashTable,. 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...

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, word, string::hash >
bool	set (const Key &, const T &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< T, Key, Hash > &)
	Construct as copy. More...

	HashTable (const Xfer< HashTable< T, Key, Hash > > &)
	Construct by transferring the parameter contents. 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 T &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< T, Key, Hash > &)
	Transfer the contents of the argument table into this table. More...

Xfer< HashTable< T, Key, Hash > >	xfer ()
	Transfer contents to the Xfer container. More...

T &	operator[] (const Key &)
	Find and return a hashedEntry. More...

const T &	operator[] (const Key &) const
	Find and return a hashedEntry. More...

T &	operator() (const Key &)
	Find and return a hashedEntry, create it null if not present. More...

void	operator= (const HashTable< T, Key, Hash > &)
	Assignment. More...

bool	operator== (const HashTable< T, Key, Hash > &) const
	Equality. Hash tables are equal if the keys and values are equal. More...

bool	operator!= (const HashTable< T, 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...

Private Types
typedef Triangulation::Vertex_handle	Vertex_handle

Private Member Functions
Pair< labelPair >	orderPointPair (const labelPair &vA, const labelPair &vB) const

bool	insertPointPair (const labelPair &vA, const labelPair &vB)

bool	findPointPair (const labelPair &vA, const labelPair &vB) const

Private Attributes
const Triangulation &	triangulation_

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, word, string::hash >
typedef T	value_type
	Type of values the HashTable contains. More...

typedef T &	reference
	Type that can be used for storing into HashTable::value_type. More...

typedef label	size_type
	The type that can represent the size of a HashTable. More...

Data Fields inherited from HashTable< nil, word, string::hash >
const typedef T &	const_reference
	Type that can be used for storing into constant. 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 60 of file pointPairs.H.

Member Typedef Documentation

◆ Vertex_handle

typedef Triangulation::Vertex_handle Vertex_handle

private

Definition at line 66 of file pointPairs.H.

Constructor & Destructor Documentation

◆ pointPairs()

pointPairs ( const Triangulation & triangulation )

Construct from triangulation.

◆ ~pointPairs()

~pointPairs ( )

Destructor.

Member Function Documentation

◆ orderPointPair()

Pair<labelPair> orderPointPair	(	const labelPair &	vA,
		const labelPair &	vB
	)		const

inlineprivate

◆ insertPointPair()

bool insertPointPair	(	const labelPair &	vA,
		const labelPair &	vB
	)

inlineprivate

◆ findPointPair()

bool findPointPair	(	const labelPair &	vA,
		const labelPair &	vB
	)		const

inlineprivate

◆ 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 )

Field Documentation

◆ triangulation_

const Triangulation& triangulation_

private

Definition at line 71 of file pointPairs.H.

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

applications/utilities/mesh/generation/foamyMesh/conformalVoronoiMesh/pointPairs/pointPairs.H

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

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

Member Typedef Documentation

◆ Vertex_handle

Constructor & Destructor Documentation

◆ pointPairs()

◆ ~pointPairs()

Member Function Documentation

◆ orderPointPair()

◆ insertPointPair()

◆ findPointPair()

◆ isPointPair() [1/2]

◆ isPointPair() [2/2]

◆ addPointPair() [1/3]

◆ addPointPair() [2/3]

◆ addPointPair() [3/3]

◆ reIndex()

Field Documentation

◆ triangulation_

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