diff --git a/filter_iterator.htm b/filter_iterator.htm index ca0293e..fe5f10c 100644 --- a/filter_iterator.htm +++ b/filter_iterator.htm @@ -46,7 +46,7 @@ namespace boost {
To implement a transform iterator we will only change one of the base iterator's behaviors, so the transform_iterator_policies class can inherit the rest from default_iterator_policies. We will define - the dereference() member function, which is used implement + the dereference() member function, which is used to implement operator*() of the adapted iterator. The implementation will dereference the base iterator and apply the function object. The type<Reference> parameter is used to convey the appropriate @@ -584,7 +588,7 @@ mixed in comparison and subtraction expressions.
There is an unlimited number of ways the the iterator_adaptors +
There is an unlimited number of ways the iterator_adaptors class can be used to create iterators. One interesting exercise would be to re-implement the iterators of std::list and std::slist using iterator_adaptors, where the adapted Iterator types @@ -736,5 +740,6 @@ bool operator==(const iterator_adaptor<B1,P,V1,R1,P1,C,D>&, - + + diff --git a/reverse_iterator.htm b/reverse_iterator.htm index f7ea319..6bb712e 100644 --- a/reverse_iterator.htm +++ b/reverse_iterator.htm @@ -1,12 +1,16 @@ + +