MeshBase::node_iterator

NAME

SYNOPSIS

#include <mesh_base.h>

Inherits variant_filter_iterator< MeshBase::Predicate, Node * >.  

Public Types

typedef variant_filter_iterator< MeshBase::Predicate, Node *, Node *&, Node ** > Iterator
 

Public Member Functions

template<typename PredType , typename IterType > node_iterator (const IterType &d, const IterType &e, const PredType &p)

Node *& operator* () const

Node ** operator-> () const

Iterator & operator++ ()

const Iterator operator++ (int)

bool equal (const variant_filter_iterator &other) const

void swap (Iterator &lhs, Iterator &rhs)
 

Public Attributes

IterBase * data

IterBase * end

PredBase * pred
 

Detailed Description

The definition of the node_iterator struct.

Definition at line 823 of file mesh_base.h.  

Member Typedef Documentation

typedef variant_filter_iterator<MeshBase::Predicate , Node * , Node * & , Node * * > variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::Iterator [inherited]Shortcut name for the fully-qualified typename.

Definition at line 49 of file variant_filter_iterator.h.  

Constructor & Destructor Documentation

template<typename PredType , typename IterType > MeshBase::node_iterator::node_iterator (const IterType &d, const IterType &e, const PredType &p) [inline]

Definition at line 830 of file mesh_base.h.

                                     :
    variant_filter_iterator<MeshBase::Predicate,
                            Node*>(d,e,p) {}

Member Function Documentation

bool variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::equal (const variant_filter_iterator< MeshBase::Predicate, Node * > &other) const [inline, inherited]forwards on the the equal function defined for the IterBase pointer. Possibly also compare the end pointers, but this is usually not important and would require an additional dynamic_cast.

Definition at line 442 of file variant_filter_iterator.h.

  {
    return data->equal(other.data);
  }

Node * & variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator* () const [inline, inherited]unary op*() forwards on to Iter::op*()

Definition at line 401 of file variant_filter_iterator.h.

  {
    return **data;
  }

const Iterator variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator++ (int) [inline, inherited]postfix op++(), creates a temporary!

Definition at line 428 of file variant_filter_iterator.h.

  {
    Iterator oldValue(*this); // standard is to return old value
    ++*data;
    this->satisfy_predicate();
    return oldValue;
  }

Iterator& variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator++ () [inline, inherited]op++() forwards on to Iter::op++()

Definition at line 418 of file variant_filter_iterator.h.

  {
    ++*data;
    this->satisfy_predicate();
    return (*this);
  }

Node * * variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator-> () const [inline, inherited]op->()

Definition at line 410 of file variant_filter_iterator.h.

  {
    return (&**this);
  }

void variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::swap (Iterator &lhs, Iterator &rhs) [inline, inherited]swap, used to implement op=

Definition at line 450 of file variant_filter_iterator.h.

  {
    // Swap the data pointers
    std::swap (lhs.data, rhs.data);

    // Swap the end pointers
    std::swap (lhs.end, rhs.end);

    // Also swap the predicate objects.
    std::swap (lhs.pred, rhs.pred);
  }

Member Data Documentation

IterBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::data [inherited]Ideally this private member data should have protected access. However, if we want a const_iterator to be constructable from an non-const one, templated versions of the same class (not related by inheritance) will need to know about these private members. Thus, they have public access.

Polymorphic pointer to the object. Don't confuse with the data pointer located in the Iter!

Definition at line 310 of file variant_filter_iterator.h.  

IterBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::end [inherited]Also have a polymorphic pointer to the end object, this prevents iterating past the end.

Definition at line 316 of file variant_filter_iterator.h.  

PredBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::pred [inherited]The predicate object. Must have op() capable of operating on IterBase* pointers. Therefore it has to follow the same paradigm as IterBase.

Definition at line 323 of file variant_filter_iterator.h.

Author

Generated automatically by Doxygen for libMesh from the source code.

Index

NAME

SYNOPSIS

Public Types

Public Member Functions

Public Attributes

Detailed Description

Member Typedef Documentation

typedef variant_filter_iterator<MeshBase::Predicate , Node * , Node * & , Node * * > variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::Iterator [inherited]Shortcut name for the fully-qualified typename.

Constructor & Destructor Documentation

template<typename PredType , typename IterType > MeshBase::node_iterator::node_iterator (const IterType &d, const IterType &e, const PredType &p) [inline]

Member Function Documentation

bool variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::equal (const variant_filter_iterator< MeshBase::Predicate, Node * > &other) const [inline, inherited]forwards on the the equal function defined for the IterBase pointer. Possibly also compare the end pointers, but this is usually not important and would require an additional dynamic_cast.

Node * & variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator* () const [inline, inherited]unary op*() forwards on to Iter::op*()

const Iterator variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator++ (int) [inline, inherited]postfix op++(), creates a temporary!

Iterator& variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator++ () [inline, inherited]op++() forwards on to Iter::op++()

Node * * variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::operator-> () const [inline, inherited]op->()

void variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::swap (Iterator &lhs, Iterator &rhs) [inline, inherited]swap, used to implement op=

Member Data Documentation

IterBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::data [inherited]Ideally this private member data should have protected access. However, if we want a const_iterator to be constructable from an non-const one, templated versions of the same class (not related by inheritance) will need to know about these private members. Thus, they have public access.

IterBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::end [inherited]Also have a polymorphic pointer to the end object, this prevents iterating past the end.

PredBase* variant_filter_iterator< MeshBase::Predicate , Node * , Node * & , Node * * >::pred [inherited]The predicate object. Must have op() capable of operating on IterBase* pointers. Therefore it has to follow the same paradigm as IterBase.

Author