[iterator.requirements.general] Consistently index iterator terms.

Author: jensmaurer

source/iterators.tex

@@ -556,26 +556,22 @@
 \end{note}
 
 \pnum
+\indextext{past-the-end iterator|see{iterator, past-the-end}}%
+\indextext{dereferenceable iterator|see{iterator, dereferenceable}}%
 Just as a regular pointer to an array guarantees that there is a pointer value pointing past the last element
 of the array, so for any iterator type there is an iterator value that points past the last element of a
 corresponding sequence.
-Such a value is called a \defnadj{past-the-end}{value}.
-Values of an iterator
-\tcode{i}
-for which the expression
-\tcode{*i}
-is defined are called
-\defn{dereferenceable}.
+Such a value is called a \defnx{past-the-end value}{iterator!past-the-end}.
+Values of an iterator \tcode{i}
+for which the expression \tcode{*i} is defined
+are called \defnx{dereferenceable}{iterator!dereferenceable}.
 The library never assumes that past-the-end values are dereferenceable.
 Iterators can also have singular values that are not associated with any
 sequence.
 \begin{example}
-After the declaration of an uninitialized pointer
-\tcode{x}
-(as with
-\tcode{int* x;}),
-\tcode{x}
-must always be assumed to have a singular value of a pointer.
+After the declaration of an uninitialized pointer \tcode{x}
+(as with \tcode{int* x;}),
+\tcode{x} must always be assumed to have a singular value of a pointer.
 \end{example}
 Results of most expressions are undefined for singular values;
 the only exceptions are destroying an iterator that holds a singular value,