|
Home | Libraries | People | FAQ | More |
boost::algorithm::split_iterator — split_iterator
// In header: <boost/algorithm/string/find_iterator.hpp> template<typename IteratorT> class split_iterator : public { public: // construct/copy/destruct (); (); template<typename FinderT, typename RangeT> (, ); // public member functions ( = (, { ); (, ); (); (); (); () ; // private member functions () ; (); () ; // public data members End; Finder; };
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();Default constructor.
Construct null iterator. All null iterators are equal.
Postconditions: |
eof()==true |
( Other);Copy constructor.
Construct a copy of the split_iterator
template<typename FinderT, typename RangeT> ( Col, Finder);Constructor.
Construct new split_iterator for a given finder and a collection.
split_iterator public member functions( operator = (, { );Assignment operator.
Assigns a copy of the split_iterator Constructor
Construct new split_iterator for a given finder and a range.
(, );
();
();
();
() ;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.