AXOM
Axom provides a robust, flexible software infrastructure for the development of multi-physics applications and computational tools.
|
Alias template for an OrderedSet whose elements belong to a contiguous range \( \in [0,size) \). More...
#include </home/docs/checkouts/readthedocs.org/user_builds/axom/checkouts/v0.5.0/src/axom/slam/RangeSet.hpp>
Public Types | |
using | PositionType = P |
using | ElementType = E |
using | SizePolicyType = policies::RuntimeSize< P > |
using | OffsetPolicyType = policies::ZeroOffset< P > |
using | StridePolicyType = policies::StrideOne< P > |
using | IndirectionPolicyType = policies::NoIndirection< P, E > |
using | SubsettingPolicyType = policies::NoSubset |
using | ModularIntType = ModularInt< policies::RuntimeSize< P > > |
using | PositionSet = OrderedSet< PositionType > |
using | const_iterator = OrderedSetIterator< ElementType, true > |
using | const_iterator_pair = std::pair< const_iterator, const_iterator > |
using | iterator = OrderedSetIterator< ElementType, false > |
using | iterator_pair = std::pair< iterator, iterator > |
using | IndirectionResult = E |
using | ConstIndirectionResult = const E |
using | IndirectionBufferType = struct { } |
using | ParentSetType = const Set<> |
Public Member Functions | |
PositionSet (PositionType size=DEFAULT_SIZE) | |
PositionSet (const typename OrderedSetType::SetBuilder &builder) | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
iterator_pair | range () |
const_iterator_pair | range () const |
policies::NoIndirection< P, E > ::ConstIndirectionResult | operator[] (PositionType pos) const |
Given a position in the Set, return a position in the larger index space. More... | |
policies::NoIndirection< P, E > ::IndirectionResult | operator[] (PositionType pos) |
ElementType | at (PositionType pos) const |
Random access to the entities of the set. More... | |
PositionType | size () const |
Get the number of entities in the set. More... | |
P & | size () |
bool | empty () const |
Checks if there are any elements in the set – equivalent to: set.size() == 0. More... | |
bool | isValid (bool verboseOutput=false) const |
Checks whether the set is valid. More... | |
bool | isValid (P, P, P, bool) const |
template<typename OrderedSetIt > | |
bool | isValid (OrderedSetIt, OrderedSetIt, bool) const |
bool | isSubset () const |
Determines if the Set is a Subset of another set. More... | |
bool | isValidIndex (PositionType pos) const |
checks whether the given position (index) is valid. More... | |
PositionSet | positions () const |
returns a PositionSet over the set's positions More... | |
P | operator() () const |
P & | operator() () |
P | operator() () const |
const P | operator() () const |
IndirectionResult | operator() (P pos) const |
P | offset () const |
const P | stride () const |
void | setStride (P AXOM_DEBUG_PARAM(val)) |
IndirectionResult | indirection (P pos) const |
IndirectionBufferType * | data () |
bool | hasIndirection () const |
const ParentSetType * | parentSet () const |
Static Public Attributes | |
static const NullSet | s_nullSet |
OrderedSet_Size_Policies | |
A few default policies for the size of an OrderedSet | |
static const P | DEFAULT_VALUE |
OrderedSet_Offset_Policies | |
A few default policies for the offset of an OrderedSet | |
static const P | DEFAULT_VALUE |
OrderedSet_Stride_Policies | |
A few default policies for the stride of an OrderedSet | |
static const P | DEFAULT_VALUE |
Protected Attributes | |
P | m_sz |
Alias template for an OrderedSet whose elements belong to a contiguous range \( \in [0,size) \).
P | The PositionType |
E | The ElementType |
using axom::slam::PositionSet< P, E >::PositionType = P |
using axom::slam::PositionSet< P, E >::ElementType = E |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inline |
|
inline |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
Given a position in the Set, return a position in the larger index space.
|
inlineinherited |
|
inlinevirtualinherited |
Random access to the entities of the set.
The | index of the desired element |
Implements axom::slam::Set< P, E >.
|
inlinevirtualinherited |
Get the number of entities in the set.
Implements axom::slam::Set< P, E >.
|
inlineinherited |
|
inlinevirtualinherited |
Checks if there are any elements in the set – equivalent to: set.size() == 0.
Implements axom::slam::Set< P, E >.
|
virtualinherited |
Checks whether the set is valid.
Implements axom::slam::Set< P, E >.
|
inlineinherited |
|
inlineinherited |
|
inlinevirtualinherited |
Determines if the Set is a Subset of another set.
Implements axom::slam::Set< P, E >.
|
inlineinherited |
checks whether the given position (index) is valid.
An index pos is valid when \( 0 \le pos < size() \)
|
inlineinherited |
returns a PositionSet over the set's positions
This can be used to simplify code to loop through the elements of a set.
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
staticinherited |
|
staticinherited |
|
staticinherited |
|
protectedinherited |
|
staticinherited |
Referenced by axom::slam::policies::VirtualParentSubset::isSubset().