Boost C++ Libraries Home Libraries People FAQ More

PrevUpHomeNext

Class template split_iterator

boost::algorithm::split_iterator — split_iterator

Synopsis

// In header: <boost/algorithm/string/find_iterator.hpp>

template<typename IteratorT> 
class split_iterator : public  {
public:
  // construct/copy/destruct
  ();
  (split_iterator &);
  template<typename FinderT, typename RangeT> 
    (, );

  // public member functions
   (split_iterator & = (split_iterator &, 
                            { );
   (, );
   ();
   ();
   ();
   () ;

  // private member functions
   () ;
   ();
   (split_iterator &) ;

  // public data members
   End;
   Finder;
};

Description

Split iterator encapsulates a Finder and allows for incremental searching in a string. Unlike the find iterator, split iterator iterates through gaps between matches.

Find iterator is a readable forward traversal iterator.

Dereferencing the iterator yields an iterator_range delimiting the current match.

split_iterator public construct/copy/destruct

  1. ();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    Postconditions:

    eof()==true

  2. (split_iterator & Other);
    Copy constructor.

    Construct a copy of the split_iterator

  3. template<typename FinderT, typename RangeT> 
      ( Col,  Finder);
    Constructor.

    Construct new split_iterator for a given finder and a collection.

split_iterator public member functions

  1.  (split_iterator & operator = (split_iterator &, 
                              { );
    Assignment operator.

    Assigns a copy of the split_iterator Constructor

    Construct new split_iterator for a given finder and a range.

  2.  (, );
  3.  ();
  4.  ();
  5.  ();
  6.  () ;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

split_iterator private member functions

  1.  () ;
  2.  ();
  3.  (split_iterator & Other) ;

PrevUpHomeNext