...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
boost::algorithm::iter_split — Split find algorithm.
template<typename SequenceSequenceT, typename RangeT, typename FinderT> SequenceSequenceT & iter_split(SequenceSequenceT & Result, RangeT & Input, FinderT Finder);
This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in find_iterator, so the real searching is performed only when needed. Each match is used as a separator of segments. These segments are then returned in the result.
Parameters: |
|
||||||
Returns: |
A reference the result |
||||||
Notes: |
Prior content of the result will be overwritten. |