diff --git a/permutation_iterator.htm b/permutation_iterator.htm index a0a2546..ea68387 100644 --- a/permutation_iterator.htm +++ b/permutation_iterator.htm @@ -47,7 +47,7 @@ namespace boost {

The permutation_iterator_generator is a helper class whose purpose is to construct a permutation iterator type. This class has two template arguments, the first being the iterator type over the range V, the -second being the type of iterator over the indices. +second being the type of the iterator over the indices. 

@@ -78,9 +78,9 @@ of RandomAccessI
 
 IndexIterator
 The iterator over the new indexing scheme. This type must at least be a model
-of ForwardIterator.
+of ForwardIterator.
 The IndexIterator::value_type must be convertible to the 
-ElementIterator::difference_type.
+ElementIterator::difference_type.
 
 
 
Concept Model

@@ -91,9 +91,9 @@ The permutation iterator implements the member functions
 and operators required for the 
 Random Access Iterator
 concept. However, the permutation iterator can only meet the complexity guarantees 
-of the same concept as the OrderIterator. Thus for instance, although the permutation
+of the same concept as the IndexIterator. Thus for instance, although the permutation
 iterator provides operator+=(distance), this operation will take linear time
-in case the OrderIterator is a model of ForwardIterator instead of amortized constant time.
+in case the IndexIterator is a model of ForwardIterator instead of amortized constant time.
 
 

 
@@ -108,7 +108,7 @@ types.
 
 template <class ElementIterator, class IndexIterator >
 typename permutation_iterator_generator<ElementIterator, IndexIterator>::type
-make_permutation_iterator(ElementIterator& base, IndexIterator& order);
+make_permutation_iterator(ElementIterator& base, IndexIterator& indices);