DGtal  1.5.beta
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator Class Reference

Built-in iterator on an HashTree. This iterator visits all node in the tree. More...

#include <DGtal/images/ImageContainerByHashTree.h>

Public Member Functions

 Iterator (Node **data, unsigned int position, unsigned int arraySize)
 
bool isAtEnd () const
 
Valueoperator* ()
 
bool operator++ ()
 
bool operator== (const Iterator &it)
 
bool operator!= (const Iterator &it)
 
HashKey getKey () const
 
bool next ()
 

Protected Attributes

NodemyNode
 
unsigned int myCurrentCell
 
unsigned int myArraySize
 
Node ** myContainerData
 

Detailed Description

template<typename TDomain, typename TValue, typename THashKey = typename DGtal::uint64_t>
class DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator

Built-in iterator on an HashTree. This iterator visits all node in the tree.

Iterator inner-class


Definition at line 516 of file ImageContainerByHashTree.h.

Constructor & Destructor Documentation

◆ Iterator()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::Iterator ( Node **  data,
unsigned int  position,
unsigned int  arraySize 
)
inline

Member Function Documentation

◆ getKey()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
HashKey DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::getKey ( ) const
inline

◆ isAtEnd()

◆ next()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
bool DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::next ( )

◆ operator!=()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
bool DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::operator!= ( const Iterator it)
inline

◆ operator*()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
Value& DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::operator* ( )
inline

◆ operator++()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
bool DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::operator++ ( )
inline

◆ operator==()

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
bool DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::operator== ( const Iterator it)
inline

Definition at line 542 of file ImageContainerByHashTree.h.

543  {
544  if (isAtEnd() && it.isAtEnd())
545  return true;
546  else
547  return (myNode == it.myNode);
548  }

References DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::isAtEnd(), and DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::myNode.

Field Documentation

◆ myArraySize

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
unsigned int DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::myArraySize
protected

◆ myContainerData

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
Node** DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::myContainerData
protected

◆ myCurrentCell

template<typename TDomain , typename TValue , typename THashKey = typename DGtal::uint64_t>
unsigned int DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator::myCurrentCell
protected

◆ myNode


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