TrackIterRange< TrackType > Struct Template Reference

Range between two TrackIters, usable in range-for statements, and with Visit member functions. More...

#include <Track.h>

Inheritance diagram for TrackIterRange< TrackType >:

Collaboration diagram for TrackIterRange< TrackType >:

Public Member Functions
	TrackIterRange (const TrackIter< TrackType > &begin, const TrackIter< TrackType > &end)
template<typename Predicate2 >
TrackIterRange	operator+ (const Predicate2 &pred2) const
template<typename R , typename C >
TrackIterRange	operator+ (R(C ::*pmf)() const) const
template<typename Predicate2 >
TrackIterRange	operator- (const Predicate2 &pred2) const
template<typename R , typename C >
TrackIterRange	operator- (R(C ::*pmf)() const) const
template<typename TrackType2 >
TrackIterRange< TrackType2 >	Filter () const
TrackIterRange	StartingWith (const Track *pTrack) const
TrackIterRange	EndingAfter (const Track *pTrack) const
TrackIterRange	Excluding (const TrackType *pExcluded) const
template<typename ... Functions>
void	Visit (const Functions &...functions)
	See Track::TypeSwitch. More...
template<typename Flag , typename ... Functions>
void	VisitWhile (Flag &flag, const Functions &...functions)
	See Track::TypeSwitch. More...
Public Member Functions inherited from IteratorRange< TrackIter< TrackType > >
	IteratorRange (const TrackIter< TrackType > &a, const TrackIter< TrackType > &b)
	IteratorRange (TrackIter< TrackType > &&a, TrackIter< TrackType > &&b)
IteratorRange< reverse_iterator >	reversal () const
TrackIter< TrackType >	begin () const
TrackIter< TrackType >	end () const
reverse_iterator	rbegin () const
reverse_iterator	rend () const
bool	empty () const
	operator bool () const
size_t	size () const
iterator	find (const T &t) const
long	index (const T &t) const
bool	contains (const T &t) const
iterator	find_if (const F &f) const
long	index_if (const F &f) const
bool	all_of (const F &f) const
bool	any_of (const F &f) const
bool	none_of (const F &f) const
R	accumulate (R init, Binary binary_op={}, Unary unary_op={}) const
R	accumulate (R init, Binary binary_op, R2(C ::*pmf)() const) const
R	min (Unary unary_op={}) const
R	min (R2(C ::*pmf)() const) const
R	max (Unary unary_op={}) const
R	max (R2(C ::*pmf)() const) const
R	sum (Unary unary_op={}) const
R	sum (R2(C ::*pmf)() const) const

Additional Inherited Members
Public Types inherited from IteratorRange< TrackIter< TrackType > >
using	iterator = TrackIter< TrackType >
using	reverse_iterator = std::reverse_iterator< TrackIter< TrackType > >

Detailed Description

template<typename TrackType>
struct TrackIterRange< TrackType >

Range between two TrackIters, usable in range-for statements, and with Visit member functions.

Definition at line 680 of file Track.h.

Constructor & Destructor Documentation

TrackIterRange()

template<typename TrackType >

TrackIterRange< TrackType >::TrackIterRange ( const TrackIter< TrackType > &  begin, const TrackIter< TrackType > &  end  )

inline

Definition at line 683 of file Track.h.

         : IteratorRange< TrackIter< TrackType > >
            ( begin, end )
   {}

Member Function Documentation

EndingAfter()

template<typename TrackType >

TrackIterRange TrackIterRange< TrackType >::EndingAfter ( const Track *  pTrack ) const

inline

Definition at line 758 of file Track.h.

   {
      const auto newEnd = this->reversal().find( pTrack ).base();
      // More careful construction is needed so that the independent
      // increment and decrement of each iterator in the NEW pair
      // has the expected behavior at boundaries of the range
      return {
         { this->first.mBegin, this->first.mIter, newEnd.mIter,
           this->first.GetPredicate() },
         { this->first.mBegin, newEnd.mIter,      newEnd.mIter,
           this->second.GetPredicate() }
      };
   }

References IteratorRange< TrackIter< TrackType > >::reversal().

Referenced by TrackList::SingletonRange().

Here is the call graph for this function:

Here is the caller graph for this function:

Excluding()

template<typename TrackType >

TrackIterRange TrackIterRange< TrackType >::Excluding ( const TrackType *  pExcluded ) const

inline

Definition at line 773 of file Track.h.

   {
      return this->operator - (
         [=](const Track *pTrack){ return pExcluded == pTrack; } );
   }

References TrackIterRange< TrackType >::operator-().

Here is the call graph for this function:

Filter()

template<typename TrackType >

template<typename TrackType2 >

TrackIterRange< TrackType2 > TrackIterRange< TrackType >::Filter ( ) const

inline

Definition at line 736 of file Track.h.

   {
      return {
         this-> first.template Filter< TrackType2 >(),
         this->second.template Filter< TrackType2 >()
      };
   }

operator+() [1/2]

template<typename TrackType >

template<typename Predicate2 >

TrackIterRange TrackIterRange< TrackType >::operator+ ( const Predicate2 &  pred2 ) const

inline

Definition at line 693 of file Track.h.

   {
      const auto &pred1 = this->first.GetPredicate();
      using Function = typename TrackIter<TrackType>::FunctionType;
      const auto &newPred = pred1
         ? Function{ [=] (typename Function::argument_type track) {
            return pred1(track) && pred2(track);
         } }
         : Function{ pred2 };
      return {
         this->first.Filter( newPred ),
         this->second.Filter( newPred )
      };
   }

Referenced by TrackIterRange< TrackType >::operator+(), and TrackIterRange< TrackType >::operator-().

Here is the caller graph for this function:

operator+() [2/2]

template<typename TrackType >

template<typename R , typename C >

TrackIterRange TrackIterRange< TrackType >::operator+ ( R(C ::*)() const  pmf ) const

inline

Definition at line 711 of file Track.h.

   {
      return this->operator + ( std::mem_fn( pmf ) );
   }

References TrackIterRange< TrackType >::operator+().

Here is the call graph for this function:

operator-() [1/2]

template<typename TrackType >

template<typename Predicate2 >

TrackIterRange TrackIterRange< TrackType >::operator- ( const Predicate2 &  pred2 ) const

inline

Definition at line 719 of file Track.h.

   {
      using ArgumentType =
         typename TrackIterRange::iterator::FunctionType::argument_type;
      auto neg = [=] (ArgumentType track) { return !pred2( track ); };
      return this->operator + ( neg );
   }

References TrackIterRange< TrackType >::operator+().

Referenced by TrackIterRange< TrackType >::Excluding().

Here is the call graph for this function:

Here is the caller graph for this function:

operator-() [2/2]

template<typename TrackType >

template<typename R , typename C >

TrackIterRange TrackIterRange< TrackType >::operator- ( R(C ::*)() const  pmf ) const

inline

Definition at line 730 of file Track.h.

   {
      return this->operator + ( std::not1( std::mem_fn( pmf ) ) );
   }

References TrackIterRange< TrackType >::operator+().

Here is the call graph for this function:

StartingWith()

template<typename TrackType >

TrackIterRange TrackIterRange< TrackType >::StartingWith ( const Track *  pTrack ) const

inline

Definition at line 744 of file Track.h.

   {
      auto newBegin = this->find( pTrack );
      // More careful construction is needed so that the independent
      // increment and decrement of each iterator in the NEW pair
      // has the expected behavior at boundaries of the range
      return {
         { newBegin.mIter, newBegin.mIter,    this->second.mEnd,
           this->first.GetPredicate() },
         { newBegin.mIter, this->second.mIter, this->second.mEnd,
           this->second.GetPredicate() }
      };
   }

References IteratorRange< TrackIter< TrackType > >::find().

Referenced by TrackList::SingletonRange().

Here is the call graph for this function:

Here is the caller graph for this function:

Visit()

template<typename TrackType >

template<typename ... Functions>

void TrackIterRange< TrackType >::Visit ( const Functions &...  functions )

inline

See Track::TypeSwitch.

Definition at line 781 of file Track.h.

   {
      for (auto track : *this)
         track->TypeSwitch(functions...);
   }

VisitWhile()

template<typename TrackType >

template<typename Flag , typename ... Functions>

void TrackIterRange< TrackType >::VisitWhile ( Flag &  flag, const Functions &...  functions  )

inline

See Track::TypeSwitch.

Visit until flag is false, or no more tracks

Definition at line 790 of file Track.h.

   {
      if ( flag ) for (auto track : *this) {
         track->TypeSwitch(functions...);
         if (!flag)
            break;
      }
   }

References flag.

---

The documentation for this struct was generated from the following files:

• ExportUtils.h
• Track.h