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

Some spelling errors fixed.

Browse Source 
[SVN r23560]
This commit is contained in:
Pavol Droba
2004-07-14 22:17:10 +00:00
parent 54075a951b
commit dd8d053685
3 changed files with 14 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
string/doc/design.xml
View File

@ -25,7 +25,7 @@
First requirement of string-type is that it must accessible using First requirement of string-type is that it must accessible using
<link linkend="string_algo.collection_traits">collection traits</link>. This facility allows to access <link linkend="string_algo.collection_traits">collection traits</link>. This facility allows to access
the elements inside the string in a uniform iterator-based fashion. the elements inside the string in a uniform iterator-based fashion.
This facility actualy requires lessen requirements then collection concept. It implements This facility actually requires lessen requirements then collection concept. It implements
<ulink url="../../libs/algorithm/string/doc/external_concepts.html">external</ulink> collection interface. <ulink url="../../libs/algorithm/string/doc/external_concepts.html">external</ulink> collection interface.
This is sufficient for our library This is sufficient for our library
</para> </para>
@ -36,9 +36,9 @@
work even if this requirement will not be satisfied, however at the cost of performance degradation. work even if this requirement will not be satisfied, however at the cost of performance degradation.
<para> <para>
</para> </para>
In addition some algorithms have additional requirements on the string-type. Particulary, it is required, In addition some algorithms have additional requirements on the string-type. Particularly, it is required,
that an algorithm can create a new string of the given type. In this case, it is required, that that an algorithm can create a new string of the given type. In this case, it is required, that
the type satifies the sequence (Std &sect;23.1.1) requirements. the type satisfies the sequence (Std &sect;23.1.1) requirements.
</para> </para>
<para> <para>
In the reference and also in the code, requirement on the string type is designated by the name of In the reference and also in the code, requirement on the string type is designated by the name of
@ -78,7 +78,7 @@
and <code>end()</code> accessors, it has member functions for checking if the range is empty, and <code>end()</code> accessors, it has member functions for checking if the range is empty,
or to determine the size of the range. It has also a set of member typedefs that extract or to determine the size of the range. It has also a set of member typedefs that extract
type information from the encapsulated iterators. As such, the interface is compatible with type information from the encapsulated iterators. As such, the interface is compatible with
the <link linkend="string_algo.collection_traits">collecion traits</link> requirements so the <link linkend="string_algo.collection_traits">collection traits</link> requirements so
it is possible to use this class as a parameter to many algorithms in this library. it is possible to use this class as a parameter to many algorithms in this library.
</para> </para>
<para> <para>
@ -336,24 +336,24 @@
<para> <para>
The library provides some exceptions safety guaranties under following assumptions: The library provides some exceptions safety guaranties under following assumptions:
<orderedlist numeration="arabic"> <orderedlist numeration="arabic">
<listitem> <listitem>
<para> <para>
All types that are used as a template arguments or passed as arguments to the All types that are used as a template arguments or passed as arguments to the
facilities in this library provide <emphasis>basic exception guarantie</emphasis>. facilities in this library provide <emphasis>basic exception guarantee</emphasis>.
</para> </para>
</listitem> </listitem>
<listitem> <listitem>
<para> <para>
If the types mentioned in the first assumption can provide If the types mentioned in the first assumption can provide
<emphasis>strong exception guarantie</emphasis> for their const operations, some algorithm <emphasis>strong exception guarantee</emphasis> for their const operations, some algorithm
can provide stronger guaranties. can provide stronger guaranties.
</para> </para>
</listitem> </listitem>
</orderedlist> </orderedlist>
</para> </para>
<para> <para>
Unless stated otherwise, all facilities and algorithms in this library have <emphasis>basic exception guarantie</emphasis>. Unless stated otherwise, all facilities and algorithms in this library have <emphasis>basic exception guarantee</emphasis>.
</para> </para>
</section> </section>
</section> </section>

2
string/doc/quickref.xml
View File

@ -409,7 +409,7 @@
<tbody> <tbody>
<row> <row>
<entry>find_all</entry> <entry>find_all</entry>
<entry>Find/Extract all matching substrings in hte input</entry> <entry>Find/Extract all matching substrings in the input</entry>
<entry> <entry>
<functionname>find_all()</functionname> <functionname>find_all()</functionname>
<sbr/> <sbr/>

10
string/doc/usage.xml
View File

@ -66,7 +66,7 @@
<para><emphasis role="bold">Algorithm stacking:</emphasis> <para><emphasis role="bold">Algorithm stacking:</emphasis>
Copy versions return a transformed input as a result, thus allow a simple chaining of Copy versions return a transformed input as a result, thus allow a simple chaining of
transformations within one expression (i.e. one can write <code>trim_copy(to_upper_copy(s))</code>). transformations within one expression (i.e. one can write <code>trim_copy(to_upper_copy(s))</code>).
Mutable versions have <code>void</code> return, to avoid missuse. Mutable versions have <code>void</code> return, to avoid misuse.
</para> </para>
</listitem> </listitem>
<listitem> <listitem>
@ -246,8 +246,8 @@
<para> <para>
An extension to find algorithms it the Find Iterator. Instead of searching for just a one part of a string, An extension to find algorithms it the Find Iterator. Instead of searching for just a one part of a string,
the find iterator allows us to iterate over the substrings matching the specified criterium. the find iterator allows us to iterate over the substrings matching the specified criteria.
This facility is using the <link linkend="string_algo.finder_concept">Finder</link> to incrementaly This facility is using the <link linkend="string_algo.finder_concept">Finder</link> to incrementally
search the string. search the string.
Dereferencing a find iterator yields an <link linkend="string_algo.iterator_range"><code>iterator_range</code></link> Dereferencing a find iterator yields an <link linkend="string_algo.iterator_range"><code>iterator_range</code></link>
object, that delimits the current match. object, that delimits the current match.
@ -292,8 +292,8 @@
<para> <para>
Note that find iterators have only one template parameter. It is the base iterator type. Note that find iterators have only one template parameter. It is the base iterator type.
Finder is specified at runtime. This allows us to typedef a find iterator for Finder is specified at runtime. This allows us to typedef a find iterator for
a common string types and reuse it. Additionaly make_*_iterator functions helps a common string types and reuse it. Additionally make_*_iterator functions helps
to contruct a find iterator for a particular collection. to construct a find iterator for a particular collection.
</para> </para>
<para> <para>
See the reference in <headername>boost/algorithm/string/find_iterator.hpp</headername>. See the reference in <headername>boost/algorithm/string/find_iterator.hpp</headername>.