diff --git a/doc/history_ack.qbk b/doc/history_ack.qbk
index f8c39e4..27f9e2a 100644
--- a/doc/history_ack.qbk
+++ b/doc/history_ack.qbk
@@ -20,7 +20,7 @@ Special thanks goes to
* Pavel Vozenilek for help with porting the library
* Jonathan Turkanis and John Torjo for help with documentation
* Hartmut Kaiser for being review manager
-* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+* Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
The concept checks and their documentation was provided by Daniel Walker.
diff --git a/doc/html/index.html b/doc/html/index.html
index 01dcdb6..e67d025 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
-Last revised: December 13, 2012 at 06:35:02 GMT |
+Last revised: December 13, 2012 at 06:53:49 GMT |
|
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index f3f974e..0297e85 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -72,7 +72,7 @@
Hartmut Kaiser for being review manager
- Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+ Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
diff --git a/doc/html/range/reference/adaptors/reference/type_erased.html b/doc/html/range/reference/adaptors/reference/type_erased.html
index c678e56..20430be 100644
--- a/doc/html/range/reference/adaptors/reference/type_erased.html
+++ b/doc/html/range/reference/adaptors/reference/type_erased.html
@@ -105,7 +105,7 @@
Traversal is
the tag used to identify the traversal of the resultant range.
- Frequently it is desireable to set a traversal category lower
+ Frequently it is desirable to set a traversal category lower
than the source container or range to maximize the number of
ranges that can convert to the any_range.
If this is left as boost::use_default then Traversal
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index 065b6df..0355369 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -43,7 +43,7 @@
fill_n assigns the value
- val to n elements in the range rng begining with boost::begin(rng).
+ val to n elements in the range rng beginning with boost::begin(rng).
diff --git a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
index 669ad55..7f28b05 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -107,7 +107,7 @@
Let x be an object
of SinglePassRange1's
value type. Let y
- be an obect of SinglePassRange2's
+ be an object of SinglePassRange2's
value type. x <
y must be valid. y <
x must be valid.
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index df6cf62..b89faa4 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -109,7 +109,7 @@
mismatch finds the first
- position where the correseponding elements from the two ranges rng1 and rng2
+ position where the corresponding elements from the two ranges rng1 and rng2
are not equal.
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index 46fd9e7..8303f4b 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -90,7 +90,7 @@
An operator+
is defined for a left-hand operand of type Value
- and a right-hand operance of the SinglePassRange
+ and a right-hand operand of the SinglePassRange
value type.
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index bc6b928..3470733 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -44,7 +44,7 @@
then one can still call all its member functions. This design decision
avoids the iterator_range
imposing limitations upon ranges of iterators that are not singular. Any
- singularity limitation is simply propogated from the underlying iterator
+ singularity limitation is simply propagated from the underlying iterator
type.
diff --git a/doc/reference/adaptors/type_erased.qbk b/doc/reference/adaptors/type_erased.qbk
index a24bee7..9fb72a5 100644
--- a/doc/reference/adaptors/type_erased.qbk
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -18,7 +18,7 @@ Let `Rng` be the type of `rng`.
* [*Template parameters:]
* `Value` is the `value_type` for the `any_range`. If this is set to boost::use_default, `Value` will be calculated from the
range type when the adaptor is applied.
- * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desireable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal::type>::type`
+ * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desirable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal::type>::type`
* `Reference` is the `reference` for the `any_range`. `boost::use_default` will equate to `typename range_reference::type`.
* `Difference` is the `difference_type` for the any_range. `boost::use_default` will equate to `typename boost::range_difference::type`
* `Buffer` is the storage used to allocate the underlying iterator wrappers. This can typically be ignored, but is available as a template parameter for customization. Buffer must be a model of the `AnyIteratorBufferConcept`.
diff --git a/doc/reference/algorithm/fill_n.qbk b/doc/reference/algorithm/fill_n.qbk
index 6458255..1375d4e 100644
--- a/doc/reference/algorithm/fill_n.qbk
+++ b/doc/reference/algorithm/fill_n.qbk
@@ -14,7 +14,7 @@ ForwardRange& fill( ForwardRange& rng, Size n, const Value& val );
[heading Description]
-`fill_n` assigns the value `val` to `n` elements in the range `rng` begining with `boost::begin(rng)`.
+`fill_n` assigns the value `val` to `n` elements in the range `rng` beginning with `boost::begin(rng)`.
[heading Definition]
diff --git a/doc/reference/algorithm/lexicographical_compare.qbk b/doc/reference/algorithm/lexicographical_compare.qbk
index c8fad4b..8160b15 100644
--- a/doc/reference/algorithm/lexicographical_compare.qbk
+++ b/doc/reference/algorithm/lexicographical_compare.qbk
@@ -41,7 +41,7 @@ Defined in the header file `boost/range/algorithm/lexicographical_compare.hpp`
* `SinglePassRange2` is a model of the __single_pass_range__ Concept.
* `SinglePassRange1`'s value type is a model of the `LessThanComparableConcept`.
* `SinglePassRange2`'s value type is a model of the `LessThanComparableConcept`.
-* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an obect of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
+* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an object of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
[*For the predicate versions of lexicographical_compare:]
diff --git a/doc/reference/algorithm/mismatch.qbk b/doc/reference/algorithm/mismatch.qbk
index eb23928..3599733 100644
--- a/doc/reference/algorithm/mismatch.qbk
+++ b/doc/reference/algorithm/mismatch.qbk
@@ -80,7 +80,7 @@ mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2,
[heading Description]
-`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal.
+`mismatch` finds the first position where the corresponding elements from the two ranges `rng1` and `rng2` are not equal.
Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions.
diff --git a/doc/reference/numeric/accumulate.qbk b/doc/reference/numeric/accumulate.qbk
index af5df1d..e151e63 100644
--- a/doc/reference/numeric/accumulate.qbk
+++ b/doc/reference/numeric/accumulate.qbk
@@ -42,7 +42,7 @@ Defined in the header file `boost/range/numeric.hpp`
# `SinglePassRange` is a model of the __single_pass_range__ Concept.
# `Value` is a model of the `AssignableConcept`.
-# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operance of the `SinglePassRange` value type.
+# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operand of the `SinglePassRange` value type.
# The return type of the above operator is convertible to `Value`.
[heading For the second version]
diff --git a/doc/reference/utilities.qbk b/doc/reference/utilities.qbk
index 25a7edb..0da1f52 100644
--- a/doc/reference/utilities.qbk
+++ b/doc/reference/utilities.qbk
@@ -21,7 +21,7 @@ The intention of the `iterator_range` class is to encapsulate two iterators so t
If the template argument is not a model of __forward_traversal_iterator__, one can still use a subset of the interface. In particular, `size()` requires Random Access Traversal Iterators whereas `empty()` only requires Single Pass Iterators.
-Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propogated from the underlying iterator type.
+Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propagated from the underlying iterator type.
[h4 Synopsis]