Classes
struct	Pred< IterType, PredType >

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

	variant_filter_iterator ()

	variant_filter_iterator (const Iterator &rhs)

template<class OtherType , class OtherReferenceType , class OtherPointerType >
	variant_filter_iterator (const variant_filter_iterator< Predicate, OtherType, OtherReferenceType, OtherPointerType > &rhs)

virtual	~variant_filter_iterator ()

ReferenceType	operator* () const

PointerType	operator-> () const

Iterator &	operator++ ()

const Iterator	operator++ (int)

bool	equal (const variant_filter_iterator &other) const

void	swap (Iterator &lhs, Iterator &rhs)

Iterator &	operator= (const Iterator &rhs)

void	satisfy_predicate ()

template<class Predicate , class Type , class ReferenceType , class PointerType >
bool	operator== (const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &x, const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &y)

template<class Predicate , class Type , class ReferenceType , class PointerType >
bool	operator!= (const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &x, const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &y)

Variables
template<class Predicate , class Type , class ReferenceType = Type &, class PointerType = Type *>
IterType	iter_data

IterBase *	data

IterBase *	end

PredBase *	pred

Function Documentation

◆ equal()

bool equal ( const variant_filter_iterator & other ) const

Forwards to the equal() function defined for the IterBase pointer.

Definition at line 470 of file variant_filter_iterator.h.

References data.

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

◆ operator!=()

template<class Predicate , class Type , class ReferenceType , class PointerType >

bool operator!=	(	const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &	x,
		const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &	y
	)

inlineprivate

Definition at line 534 of file variant_filter_iterator.h.

 {
   return !(x == y);
 }

◆ operator*()

ReferenceType operator* ( ) const

unary op*() forwards on to Iter::op*()

Definition at line 431 of file variant_filter_iterator.h.

References data.

   {
     return **data;
   }

◆ operator++() [1/2]

Iterator& operator++ ( )

op++() forwards on to Iter::op++()

Definition at line 448 of file variant_filter_iterator.h.

References data, and satisfy_predicate().

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

◆ operator++() [2/2]

const Iterator operator++ ( int )

postfix op++(), creates a temporary!

Definition at line 458 of file variant_filter_iterator.h.

References data, and satisfy_predicate().

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

◆ operator->()

PointerType operator-> ( ) const

op->()

Definition at line 440 of file variant_filter_iterator.h.

   {
     return (&**this);
   }

◆ operator=()

Iterator& operator= ( const Iterator & rhs )

Assignment operator.

Definition at line 493 of file variant_filter_iterator.h.

References swap().

   {
     Iterator temp(rhs);
     swap(temp, *this);
     return *this;
   }

◆ operator==()

template<class Predicate , class Type , class ReferenceType , class PointerType >

bool operator==	(	const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &	x,
		const variant_filter_iterator< Predicate, Type, ReferenceType, PointerType > &	y
	)

inlineprivate

Definition at line 523 of file variant_filter_iterator.h.

 {
   return x.equal(y);
 }

◆ satisfy_predicate()

void satisfy_predicate ( )

private

Advances the data pointer until it reaches the end or the predicate is satisfied.

Definition at line 508 of file variant_filter_iterator.h.

References data, and end.

Referenced by operator++(), and variant_filter_iterator().

   {
     while ( !data->equal(end) && !(*pred)(data) )
       ++(*data);
   }

◆ swap()

void swap	(	Iterator &	lhs,
		Iterator &	rhs
	)

swap, used to implement op=

Definition at line 478 of file variant_filter_iterator.h.

Referenced by libMesh::DenseMatrix< Number >::_evd_lapack(), libMesh::DenseMatrix< Number >::_lu_back_substitute(), libMesh::DenseMatrix< Number >::_lu_decompose(), libMesh::DenseMatrix< Number >::_multiply_blas(), libMesh::GmshIO::build_element_maps(), libMesh::Elem::compute_key(), libMesh::Nemesis_IO_Helper::compute_num_global_nodesets(), libMesh::Nemesis_IO_Helper::compute_num_global_sidesets(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::Utility::deallocate(), libMesh::SystemSubsetBySubdomain::init(), libMesh::MeshRefinement::limit_level_mismatch_at_edge(), libMesh::BuildProjectionList::operator()(), libMesh::Utility::ReverseBytes::operator()(), operator=(), libMesh::PeriodicBoundary::PeriodicBoundary(), libMesh::DofMap::prepare_send_list(), libMesh::TreeNode< N >::refine(), libMesh::ReplicatedMesh::renumber_nodes_and_elements(), libMesh::EpetraMatrix< T >::swap(), libMesh::DenseMatrix< Number >::swap(), libMesh::EigenSparseVector< T >::swap(), libMesh::DistributedVector< T >::swap(), libMesh::LaspackVector< T >::swap(), libMesh::PetscMatrix< T >::swap(), libMesh::EpetraVector< T >::swap(), libMesh::PetscVector< T >::swap(), libMesh::NumericVector< Number >::swap(), libMesh::DifferentiableSystem::swap_physics(), libMesh::TreeNode< N >::transform_nodes_to_elements(), and libMesh::BuildProjectionList::unique().

   {
     // 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);
   }

◆ variant_filter_iterator() [1/4]

template<typename PredType , typename IterType >

variant_filter_iterator	(	const IterType &	d,
		const IterType &	e,
		const PredType &	p
	)

Templated Constructor. Allows you to construct the iterator and predicate from any types. Also advances the data pointer to the first entry which satisfies the predicate.

Note: The initialization list uses the default IterBase copy constructor.

Definition at line 364 of file variant_filter_iterator.h.

References satisfy_predicate().

                                                :
     data ( new Iter<IterType>(d) ),
     end  ( new Iter<IterType>(e) ),
     pred ( new Pred<IterType,PredType>(p) )
   {
     this->satisfy_predicate();
   }

◆ variant_filter_iterator() [2/4]

variant_filter_iterator ( )

Default Constructor.

Definition at line 377 of file variant_filter_iterator.h.

                              :
     data(nullptr),
     end(nullptr),
     pred(nullptr) {}

◆ variant_filter_iterator() [3/4]

variant_filter_iterator ( const Iterator & rhs )

Copy Constructor. Copy the internal data instead of sharing it.

Definition at line 386 of file variant_filter_iterator.h.

                                                  :
     data (rhs.data != nullptr ? rhs.data->clone() : nullptr),
     end  (rhs.end  != nullptr ? rhs.end->clone()  : nullptr),
     pred (rhs.pred != nullptr ? rhs.pred->clone() : nullptr) {}

◆ variant_filter_iterator() [4/4]

template<class OtherType , class OtherReferenceType , class OtherPointerType >

variant_filter_iterator ( const variant_filter_iterator< Predicate, OtherType, OtherReferenceType, OtherPointerType > & rhs )

Copy construct from another (similar) variant_filter_iterator. The Predicate is the same, but the Type, ReferenceType and PointerType are different. Example: You are iterating over a std::vector<int *> with std::vector<int *>::iterator Then, you have: Type=int * , ReferenceType=int *& , PointerType=int ** On the other hand, when you iterate using std::vector<int *>::const_iterator you have: Type=int * const, ReferenceType=int * const & , PointerType=int * const *

Definition at line 405 of file variant_filter_iterator.h.

     : data (rhs.data != nullptr ? rhs.data->const_clone() : nullptr),
       end  (rhs.end  != nullptr ? rhs.end->const_clone()  : nullptr),
       pred (rhs.pred != nullptr ? rhs.pred->const_clone() : nullptr)
   {
     // libMesh::out << "Called templated copy constructor for variant_filter_iterator" << std::endl;
   }

◆ ~variant_filter_iterator()

virtual ~variant_filter_iterator ( )

virtual

Destructor

Definition at line 421 of file variant_filter_iterator.h.

References data, end, and pred.

   {
     delete data; data = nullptr;
     delete end;  end  = nullptr;
     delete pred; pred = nullptr;
   }

Variable Documentation

◆ data

IterBase* data

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 337 of file variant_filter_iterator.h.

◆ end

IterBase* end

Also have a polymorphic pointer to the end object, this prevents iterating past the end.

Definition at line 343 of file variant_filter_iterator.h.

◆ iter_data

template<class Predicate , class Type , class ReferenceType = Type &, class PointerType = Type *>

IterType iter_data

Original Authors: Corwin Joy * Michael Gradman cjoy@.nosp@m.hous.nosp@m.ton.r.nosp@m.r.co.nosp@m.m * Micha.nosp@m.el.G.nosp@m.radma.nosp@m.n@ca.nosp@m.minus.nosp@m..com Caminus, Suite 1150, Two Allen Center, 1200 Smith Street, Houston, TX 77002 This class is an extension of variant_bidirectional_iterator to a filter_iterator similar to boost's. The filter iterator is modeled after a forward_iterator since to go backward and forward requires the storage of both a "begin" and "end" iterator to avoid stepping off the end or the beginning. To reduce complexity, we only allow traversal in one direction.

Author: John W. Peterson

Date: 2004 This is the iterator passed by the user.

Definition at line 50 of file variant_filter_iterator.h.

◆ pred

PredBase* pred

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 350 of file variant_filter_iterator.h.

Referenced by libMesh::Predicates::abstract_multi_predicate< T >::operator()(), and ~variant_filter_iterator().

Classes

Functions

Variables