SG++-Doxygen-Documentation
sgpp::combigrid::LowestTreeStorageNode< T > Class Template Reference

The Tree does not contain single elements of T in its leafs. More...

#include <LowestTreeStorageNode.hpp>

Inheritance diagram for sgpp::combigrid::LowestTreeStorageNode< T >:
sgpp::combigrid::AbstractTreeStorageNode< T >

Public Member Functions

virtual bool containsIndex (MultiIndex const &index, size_t depth=0) const
 
void ensureVectorEntry (size_t currentIndex)
 Helper function that fills elements and statusVector until they contain the given index. More...
 
virtual T & get (MultiIndex const &index, size_t depth=0)
 
virtual bool isLeaf () const
 
 LowestTreeStorageNode (TreeStorageContext< T > &context)
 
virtual size_t numChildren () const
 
virtual void set (MultiIndex const &index, T const &value, size_t depth=0)
 
virtual ~LowestTreeStorageNode ()
 
- Public Member Functions inherited from sgpp::combigrid::AbstractTreeStorageNode< T >
virtual ~AbstractTreeStorageNode ()
 

Public Attributes

TreeStorageContext< T > & context
 
std::vector< T > elements
 
std::vector< StorageStatusstatusVector
 

Detailed Description

template<typename T>
class sgpp::combigrid::LowestTreeStorageNode< T >

The Tree does not contain single elements of T in its leafs.

For efficiency reasons, the lowest Node contains a vector of T's instead. See also InternalTreeStorageNode.

Constructor & Destructor Documentation

◆ LowestTreeStorageNode()

template<typename T>
sgpp::combigrid::LowestTreeStorageNode< T >::LowestTreeStorageNode ( TreeStorageContext< T > &  context)
inlineexplicit

◆ ~LowestTreeStorageNode()

template<typename T>
virtual sgpp::combigrid::LowestTreeStorageNode< T >::~LowestTreeStorageNode ( )
inlinevirtual

Member Function Documentation

◆ containsIndex()

template<typename T>
virtual bool sgpp::combigrid::LowestTreeStorageNode< T >::containsIndex ( MultiIndex const &  index,
size_t  depth = 0 
) const
inlinevirtual
Parameters
indexMulti-index indicating the storage position.
depthLevel of the node in the tree, starting from zero.
Returns
true iff the storage contains data at the given index.

Implements sgpp::combigrid::AbstractTreeStorageNode< T >.

References sgpp::combigrid::STORED.

◆ ensureVectorEntry()

template<typename T>
void sgpp::combigrid::LowestTreeStorageNode< T >::ensureVectorEntry ( size_t  currentIndex)
inline

◆ get()

template<typename T>
virtual T& sgpp::combigrid::LowestTreeStorageNode< T >::get ( MultiIndex const &  index,
size_t  depth = 0 
)
inlinevirtual

◆ isLeaf()

template<typename T>
virtual bool sgpp::combigrid::LowestTreeStorageNode< T >::isLeaf ( ) const
inlinevirtual
Returns
Returns true iff the node is a leaf

Implements sgpp::combigrid::AbstractTreeStorageNode< T >.

◆ numChildren()

template<typename T>
virtual size_t sgpp::combigrid::LowestTreeStorageNode< T >::numChildren ( ) const
inlinevirtual
Returns
Returns the number of children of this node.

Implements sgpp::combigrid::AbstractTreeStorageNode< T >.

References create_scripts::s, and sgpp::combigrid::STORED.

◆ set()

template<typename T>
virtual void sgpp::combigrid::LowestTreeStorageNode< T >::set ( MultiIndex const &  index,
T const &  value,
size_t  depth = 0 
)
inlinevirtual
Parameters
indexIndex of the value to set.
valueValue to set.
depthDepth of the node, starting from zero.

Implements sgpp::combigrid::AbstractTreeStorageNode< T >.

References sgpp::combigrid::LowestTreeStorageNode< T >::ensureVectorEntry(), and sgpp::combigrid::STORED.

Referenced by sgpp::combigrid::TreeStorageGuidedIterator< T >::setValue().

Member Data Documentation

◆ context

◆ elements

◆ statusVector


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