waLBerla 7.2
Loading...
Searching...
No Matches
Public Member Functions | List of all members
walberla::cell::CellSet Class Reference

Detailed Description

A set of cells.

#include <CellSet.h>

+ Inheritance diagram for walberla::cell::CellSet:

Public Member Functions

 CellSet ()
 
 CellSet (const Cell &element)
 
 CellSet (const CellVector &cells)
 
void insert (const cell_idx_t x, const cell_idx_t y, const cell_idx_t z)
 
void insert (const uint_t x, const uint_t y, const uint_t z)
 
bool contains (const cell_idx_t x, const cell_idx_t y, const cell_idx_t z) const
 
bool contains (const uint_t x, const uint_t y, const uint_t z) const
 
CellInterval boundingBox () const
 Complexity is O(N), where N == this->size()
 
void pushToCellVector (CellVector &cellVector) const
 
- Public Member Functions inherited from walberla::Set< Cell >
 Set ()=default
 
 Set (const Cell &element)
 
virtual ~Set ()=default
 
std::pair< iterator, bool > insert (const Cell &element)
 
iterator insert (iterator position, const Cell &element)
 
void insert (InputIterator first, InputIterator last)
 
void clear ()
 removes all elements from this set
 
const Set< Cell > & operator&= (const Set< Cell > &set)
 intersection
 
const Set< Cell > & operator+= (const Set< Cell > &set)
 union
 
const Set< Cell > & operator-= (const Set< Cell > &set)
 difference / relative complement
 
bool operator< (const Set< Cell > &set) const
 compares the size (not the content!) of two sets
 
bool operator> (const Set< Cell > &set) const
 compares the size (not the content!) of two sets
 
bool operator<= (const Set< Cell > &set) const
 compares the size (not the content!) of two sets
 
bool operator>= (const Set< Cell > &set) const
 compares the size (not the content!) of two sets
 
bool equalSize (const Set< Cell > &set) const
 compares the size (not the content!) of two sets
 
bool intersects (const Set< Cell > &set) const
 true if both sets intersect
 
bool contains (const Set< Cell > &set) const
 true if "set" is completely contained within this set
 
bool contains (const Cell &element) const
 true if "element" is contained within this set
 
bool isEqual (const Set< Cell > &set) const
 true if both sets contain the same elements
 
bool empty () const
 true if this set is empty
 
bool isEmpty () const
 true if this set is empty
 
size_t size () const
 
void swap (Set< Cell > &set) noexcept
 
void toStream (std::ostream &os) const
 
std::string toString () const
 
const_iterator begin () const
 
iterator begin ()
 
const_iterator end () const
 
iterator end ()
 
const std::set< Cell > & get () const
 
std::set< Cell > & get ()
 

Additional Inherited Members

- Public Types inherited from walberla::Set< Cell >
using value_type
 
using const_iterator
 
using iterator
 
- Static Public Member Functions inherited from walberla::Set< Cell >
static const Set< Cell > emptySet ()
 

Constructor & Destructor Documentation

◆ CellSet() [1/3]

walberla::cell::CellSet::CellSet ( )
inline

◆ CellSet() [2/3]

walberla::cell::CellSet::CellSet ( const Cell & element)
inline

◆ CellSet() [3/3]

walberla::cell::CellSet::CellSet ( const CellVector & cells)
inline

Member Function Documentation

◆ boundingBox()

CellInterval walberla::cell::CellSet::boundingBox ( ) const

Complexity is O(N), where N == this->size()

◆ contains() [1/2]

bool walberla::cell::CellSet::contains ( const cell_idx_t x,
const cell_idx_t y,
const cell_idx_t z ) const
inline

◆ contains() [2/2]

bool walberla::cell::CellSet::contains ( const uint_t x,
const uint_t y,
const uint_t z ) const
inline

◆ insert() [1/2]

void walberla::cell::CellSet::insert ( const cell_idx_t x,
const cell_idx_t y,
const cell_idx_t z )
inline

◆ insert() [2/2]

void walberla::cell::CellSet::insert ( const uint_t x,
const uint_t y,
const uint_t z )
inline

◆ pushToCellVector()

void walberla::cell::CellSet::pushToCellVector ( CellVector & cellVector) const
inline
The documentation for this class was generated from the following files: