feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

Merge Michael Morin's typo fixes for Boost.Algorithm to release; no functionality change.

Browse Source 
[SVN r82240]
This commit is contained in:
Marshall Clow
2012-12-28 18:19:25 +00:00
parent 60010b4165
commit 6e098b27aa
21 changed files with 45 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
string/doc/concept.xml
View File

@ -162,8 +162,8 @@ boost::iterator_range<std::string> simple_finder(
<para>
Similarly to finders, formatters generalize format operations. When a finder is used to
select a part of the input, formatter takes this selection and performs some formating
on it. Algorithms can abstract from formating using a formatter.
select a part of the input, formatter takes this selection and performs some formatting
on it. Algorithms can abstract from formatting using a formatter.
</para>
<para>
<emphasis role="bold">Examples</emphasis>
@ -171,7 +171,7 @@ boost::iterator_range&lt;std::string&gt; simple_finder(
<para>
<itemizedlist>
<listitem>
Formatter implemented as a class. This Formatter does not perform any formating and
Formatter implemented as a class. This Formatter does not perform any formatting and
returns the match, repackaged. <code>operator()</code>
is templated, so that the Formatter can be used on any Finder type.

2
string/doc/release_notes.xml
View File

@ -36,7 +36,7 @@
New comparison predicates <code>is_less</code>, <code>is_not_greater</code>
</listitem>
<listitem>
Negative indexes support (like Perl) in various algorihtms
Negative indexes support (like Perl) in various algorithms
(<code>*_head/tail</code>, <code>*_nth</code>).
</listitem>
</itemizedlist>