From fecd4405273cfd6b30524b8b883eb46118de1d4c Mon Sep 17 00:00:00 2001 From: Daniel James Date: Sat, 30 Oct 2010 15:53:41 +0000 Subject: [PATCH] Fix some links I missed in string algorithms [SVN r66278] --- string/doc/usage.xml | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/string/doc/usage.xml b/string/doc/usage.xml index 3b7e220..a30d366 100644 --- a/string/doc/usage.xml +++ b/string/doc/usage.xml @@ -208,7 +208,7 @@ We have used find_last() to search the text for "ll". - The result is given in the boost::iterator_range. + The result is given in the boost::iterator_range. This range delimits the part of the input which satisfies the find criteria. In our example it is the last occurrence of "ll". @@ -217,7 +217,7 @@ Boost.Range. The following lines transform the result. Notice that - boost::iterator_range has familiar + boost::iterator_range has familiar begin() and end() methods, so it can be used like any other STL container. Also it is convertible to bool therefore it is easy to use find algorithms for a simple containment checking. @@ -264,7 +264,7 @@ the find iterator allows us to iterate over the substrings matching the specified criteria. This facility is using the Finder to incrementally search the string. - Dereferencing a find iterator yields an boost::iterator_range + Dereferencing a find iterator yields an boost::iterator_range object, that delimits the current match.