feedc0de/boost_iterator
1
0
Fork 0
forked from boostorg/iterator
Code Pull Requests Activity

Apply typo fixes from Julio M. Merino Vidal

Browse Source 
[SVN r27513]
This commit is contained in:
Rene Rivera
2005-02-27 17:28:24 +00:00
parent 1d018cc602
commit ef895f0cc7
4 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
doc/interoperability-revisited.rst
View File

@ -67,7 +67,7 @@ Mutable m;
c == m; // ok, dispatched to Constant::equal_to
m == c; // !! error, dispatched to Mutable::equal_to
Instead the following "slightly" more complicated implementation is neccessary
Instead the following "slightly" more complicated implementation is necessary
struct Mutable : Facade<Mutable>
{
@ -87,7 +87,7 @@ struct Constant : Tag<Constant>
Beside the fact that the code is significantly more complex to understand and to teach there is
a major design problem lurking here. Note that in both types equal_to is a function template with
an unconstrained argument T. This is neccessary so that further types can be made interoperable with
an unconstrained argument T. This is necessary so that further types can be made interoperable with
Mutable or Constant. Would Mutable be defined as
struct Mutable : Facade<Mutable>
@ -229,4 +229,4 @@ Iterator implementations using iterator_facade look exactly as if they were
a) Less burden for the user
b) The definition (standardese) of specialized adpters might be easier
(This has to be proved yet)
(This has to be proved yet)