From dd8d0536854b236b653e26a28e1779397433e3c2 Mon Sep 17 00:00:00 2001 From: Pavol Droba Date: Wed, 14 Jul 2004 22:17:10 +0000 Subject: [PATCH] Some spelling errors fixed. [SVN r23560] --- string/doc/design.xml | 16 ++++++++-------- string/doc/quickref.xml | 2 +- string/doc/usage.xml | 10 +++++----- 3 files changed, 14 insertions(+), 14 deletions(-) diff --git a/string/doc/design.xml b/string/doc/design.xml index d055fa1..ac10a0b 100644 --- a/string/doc/design.xml +++ b/string/doc/design.xml @@ -25,7 +25,7 @@ First requirement of string-type is that it must accessible using collection traits. This facility allows to access 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 external collection interface. This is sufficient for our library @@ -36,9 +36,9 @@ work even if this requirement will not be satisfied, however at the cost of performance degradation. - 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 - the type satifies the sequence (Std §23.1.1) requirements. + the type satisfies the sequence (Std §23.1.1) requirements. In the reference and also in the code, requirement on the string type is designated by the name of @@ -78,7 +78,7 @@ and end() 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 type information from the encapsulated iterators. As such, the interface is compatible with - the collecion traits requirements so + the collection traits requirements so it is possible to use this class as a parameter to many algorithms in this library. @@ -336,24 +336,24 @@ The library provides some exceptions safety guaranties under following assumptions: - + All types that are used as a template arguments or passed as arguments to the - facilities in this library provide basic exception guarantie. + facilities in this library provide basic exception guarantee. If the types mentioned in the first assumption can provide - strong exception guarantie for their const operations, some algorithm + strong exception guarantee for their const operations, some algorithm can provide stronger guaranties. - Unless stated otherwise, all facilities and algorithms in this library have basic exception guarantie. + Unless stated otherwise, all facilities and algorithms in this library have basic exception guarantee. diff --git a/string/doc/quickref.xml b/string/doc/quickref.xml index 75d04a3..af71d47 100644 --- a/string/doc/quickref.xml +++ b/string/doc/quickref.xml @@ -409,7 +409,7 @@ find_all - Find/Extract all matching substrings in hte input + Find/Extract all matching substrings in the input find_all() diff --git a/string/doc/usage.xml b/string/doc/usage.xml index 1e658e9..a2204aa 100644 --- a/string/doc/usage.xml +++ b/string/doc/usage.xml @@ -66,7 +66,7 @@ Algorithm stacking: Copy versions return a transformed input as a result, thus allow a simple chaining of transformations within one expression (i.e. one can write trim_copy(to_upper_copy(s))). - Mutable versions have void return, to avoid missuse. + Mutable versions have void return, to avoid misuse. @@ -246,8 +246,8 @@ 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. - This facility is using the Finder to incrementaly + 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 iterator_range object, that delimits the current match. @@ -292,8 +292,8 @@ 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 - a common string types and reuse it. Additionaly make_*_iterator functions helps - to contruct a find iterator for a particular collection. + a common string types and reuse it. Additionally make_*_iterator functions helps + to construct a find iterator for a particular collection. See the reference in boost/algorithm/string/find_iterator.hpp.