Merge pull request #741 from AlisdairM/fix_use_of_tcode_in_index

[18-27] Remove tcode from index entries

Author: jwakely

source/containers.tex

@@ -3085,7 +3085,7 @@
 
 \rSec3[deque.capacity]{\tcode{deque} capacity}
 
-\indexlibrary{\idxcode{resize}!\tcode{deque}}%
+\indexlibrary{\idxcode{resize}!\idxcode{deque}}%
 \begin{itemdecl}
 void resize(size_type sz);
 \end{itemdecl}
@@ -3100,7 +3100,7 @@
 \requires \tcode{T} shall be \tcode{MoveInsertable} and \tcode{DefaultInsertable} into \tcode{*this}.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{resize}!\tcode{deque}}%
+\indexlibrary{\idxcode{resize}!\idxcode{deque}}%
 \begin{itemdecl}
 void resize(size_type sz, const T& c);
 \end{itemdecl}
@@ -3136,10 +3136,10 @@
 
 \rSec3[deque.modifiers]{\tcode{deque} modifiers}
 
-\indexlibrary{\idxcode{insert}!\tcode{deque}}%
-\indexlibrary{insert@\tcode{push_front}!\tcode{deque}}%
-\indexlibrary{insert@\tcode{push_back}!\tcode{deque}}%
-\indexlibrary{insert@\tcode{emplace}!\tcode{deque}}%
+\indexlibrary{\idxcode{insert}!\idxcode{deque}}%
+\indexlibrary{insert@\idxcode{push_front}!\idxcode{deque}}%
+\indexlibrary{insert@\idxcode{push_back}!\idxcode{deque}}%
+\indexlibrary{insert@\idxcode{emplace}!\idxcode{deque}}%
 \begin{itemdecl}
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
@@ -3189,7 +3189,7 @@
 \tcode{T}.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{erase}!\tcode{deque}}%
+\indexlibrary{\idxcode{erase}!\idxcode{deque}}%
 \begin{itemdecl}
 iterator erase(const_iterator position);
 iterator erase(const_iterator first, const_iterator last);
@@ -4240,7 +4240,7 @@
 
 \rSec3[list.capacity]{\tcode{list} capacity}
 
-\indexlibrary{\idxcode{resize}!\tcode{list}}%
+\indexlibrary{\idxcode{resize}!\idxcode{list}}%
 \begin{itemdecl}
 void resize(size_type sz);
 \end{itemdecl}
@@ -4265,7 +4265,7 @@
 \tcode{DefaultInsertable} into \tcode{*this}.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{resize}!\tcode{list}}%
+\indexlibrary{\idxcode{resize}!\idxcode{list}}%
 \begin{itemdecl}
 void resize(size_type sz, const T& c);
 \end{itemdecl}
@@ -4292,7 +4292,7 @@
 
 \rSec3[list.modifiers]{\tcode{list} modifiers}
 
-\indexlibrary{\idxcode{insert}!\tcode{list}}%
+\indexlibrary{\idxcode{insert}!\idxcode{list}}%
 \begin{itemdecl}
 iterator insert(const_iterator position, const T& x);
 iterator insert(const_iterator position, T&& x);
@@ -4327,7 +4327,7 @@
 to the number of elements inserted.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{erase}!\tcode{list}}%
+\indexlibrary{\idxcode{erase}!\idxcode{list}}%
 \begin{itemdecl}
 iterator erase(const_iterator position);
 iterator erase(const_iterator first, const_iterator last);
@@ -4368,7 +4368,7 @@
 another. The behavior of splice operations is undefined if \tcode{get_allocator() !=
 x.get_allocator()}.
 
-\indexlibrary{\idxcode{splice}!\tcode{list}}%
+\indexlibrary{\idxcode{splice}!\idxcode{list}}%
 \begin{itemdecl}
 void splice(const_iterator position, list& x);
 void splice(const_iterator position, list&& x);
@@ -4502,7 +4502,7 @@
 otherwise, linear time.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{remove}!\tcode{list}}%
+\indexlibrary{\idxcode{remove}!\idxcode{list}}%
 \begin{itemdecl}
 void remove(const T& value);
 template <class Predicate> void remove_if(Predicate pred);
@@ -4532,7 +4532,7 @@
 applications of the corresponding predicate.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{unique}!\tcode{list}}%
+\indexlibrary{\idxcode{unique}!\idxcode{list}}%
 \begin{itemdecl}
 void unique();
 template <class BinaryPredicate> void unique(BinaryPredicate binary_pred);
@@ -4565,7 +4565,7 @@
 otherwise no applications of the predicate.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{merge}!\tcode{list}}%
+\indexlibrary{\idxcode{merge}!\idxcode{list}}%
 \begin{itemdecl}
 void merge(list& x);
 void merge(list&& x);
@@ -4607,7 +4607,7 @@
 If an exception is thrown other than by a comparison there are no effects.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{reverse}!\tcode{list}}%
+\indexlibrary{\idxcode{reverse}!\idxcode{list}}%
 \begin{itemdecl}
 void reverse() noexcept;
 \end{itemdecl}
@@ -4623,7 +4623,7 @@
 Linear time.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{sort}!\tcode{list}}%
+\indexlibrary{\idxcode{sort}!\idxcode{list}}%
 \begin{itemdecl}
 void sort();
 template <class Compare> void sort(Compare comp);
@@ -4822,8 +4822,8 @@
       noexcept(noexcept(x.swap(y)));
 }
 \end{codeblock}%
-\indexlibrary{\idxcode{vector}!\tcode{operator==}}%
-\indexlibrary{\idxcode{vector}!\tcode{operator<}}
+\indexlibrary{\idxcode{vector}!\idxcode{operator==}}%
+\indexlibrary{\idxcode{vector}!\idxcode{operator<}}
 
 \pnum
 An incomplete type \tcode{T} may be used when instantiating \tcode{vector}
@@ -8772,7 +8772,7 @@
 
 \rSec3[priqueue.members]{\tcode{priority_queue} members}
 
-\indexlibrary{\idxcode{push}!\tcode{priority_queue}}%
+\indexlibrary{\idxcode{push}!\idxcode{priority_queue}}%
 \begin{itemdecl}
 void push(const value_type& x);
 \end{itemdecl}
@@ -8787,7 +8787,7 @@
 \end{codeblock}
 \end{itemdescr}
 
-\indexlibrary{\idxcode{push}!\tcode{priority_queue}}%
+\indexlibrary{\idxcode{push}!\idxcode{priority_queue}}%
 \begin{itemdecl}
 void push(value_type&& x);
 \end{itemdecl}
@@ -8819,7 +8819,7 @@
 \end{itemdescr}
 
 
-\indexlibrary{\idxcode{pop}!\tcode{priority_queue}}%
+\indexlibrary{\idxcode{pop}!\idxcode{priority_queue}}%
 \begin{itemdecl}
 void pop();
 \end{itemdecl}

source/iostreams.tex

@@ -4534,7 +4534,7 @@
 None.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{operator bool}!\tcode{basic_istream}}%
+\indexlibrary{\idxcode{operator bool}!\idxcode{basic_istream}}%
 \begin{itemdecl}
 explicit operator bool() const;
 \end{itemdecl}

source/iterators.tex

@@ -1368,7 +1368,7 @@
 
 \rSec4[reverse.iter.op=]{\tcode{reverse_iterator::operator=}}
 
-\indexlibrary{\idxcode{operator=}!\tcode{reverse_iterator}}%
+\indexlibrary{\idxcode{operator=}!\idxcode{reverse_iterator}}%
 \begin{itemdecl}
 template <class U>
 constexpr reverse_iterator&

source/locales.tex

@@ -794,8 +794,8 @@
 
 \rSec3[locale.operators]{\tcode{locale} operators}
 
-\indexlibrary{\idxcode{locale}!\idxcode{operators==}}%
-\indexlibrary{\idxcode{operators==}!\idxcode{locale}}%
+\indexlibrary{\idxcode{locale}!\idxcode{operator==}}%
+\indexlibrary{\idxcode{operator==}!\idxcode{locale}}%
 \begin{itemdecl}
 bool operator==(const locale& other) const;
 \end{itemdecl}

source/strings.tex

@@ -1311,7 +1311,7 @@
 \remarks
 Uses
 \tcode{traits::length()}.
-\indexlibrary{\idxcode{length}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{length}!\idxcode{char_traits}}%
 \end{itemdescr}
 
 \indexlibrary{\idxcode{basic_string}!constructor}%
@@ -1474,7 +1474,7 @@
 \pnum
 \remarks
 Uses
-\indexlibrary{\idxcode{length}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{length}!\idxcode{char_traits}}%
 \tcode{traits::length()}.
 \end{itemdescr}
 
@@ -2178,7 +2178,7 @@
 \end{itemdescr}
 
 
-\indexlibrary{\idxcode{length}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{length}!\idxcode{char_traits}}%
 \begin{itemdecl}
 basic_string& assign(size_type n, charT c);
 \end{itemdecl}
@@ -2801,10 +2801,10 @@
 
 \rSec4[string.accessors]{\tcode{basic_string} accessors}
 
-\indexlibrary{\idxcode{c_str}!\tcode{basic_string}}%
-\indexlibrary{\idxcode{data}!\tcode{basic_string}}%
-\indexlibrary{\idxcode{basic_string}!\tcode{c_str}}%
-\indexlibrary{\idxcode{basic_string}!\tcode{data}}%
+\indexlibrary{\idxcode{c_str}!\idxcode{basic_string}}%
+\indexlibrary{\idxcode{data}!\idxcode{basic_string}}%
+\indexlibrary{\idxcode{basic_string}!\idxcode{c_str}}%
+\indexlibrary{\idxcode{basic_string}!\idxcode{data}}%
 \begin{itemdecl}
 const charT* c_str() const noexcept;
 const charT* data() const noexcept;
@@ -2823,8 +2823,8 @@
 The program shall not alter any of the values stored in the character array.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{data}!\tcode{basic_string}}%
-\indexlibrary{\idxcode{basic_string}!\tcode{data}}%
+\indexlibrary{\idxcode{data}!\idxcode{basic_string}}%
+\indexlibrary{\idxcode{basic_string}!\idxcode{data}}%
 \begin{itemdecl}
 charT* data() noexcept;
 \end{itemdecl}
@@ -2877,7 +2877,7 @@
 \tcode{pos <= xpos} and
 \tcode{xpos + str.size() <= size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos + I), str.at(I))}
 for all elements \tcode{I} of the string controlled by \tcode{str}.
 \end{itemize}
@@ -2955,7 +2955,7 @@
 and
 \tcode{xpos + str.size() <= size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos + I), str.at(I))}
 for all elements \tcode{I} of the string controlled by \tcode{str}.
 \end{itemize}
@@ -3034,7 +3034,7 @@
 and
 \tcode{xpos < size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos), str.at(I))}
 for some element \tcode{I} of the string controlled by \tcode{str}.
 \end{itemize}
@@ -3114,7 +3114,7 @@
 and
 \tcode{xpos < size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos), str.at(I))}
 for some element \tcode{I} of the string controlled by \tcode{str}.
 \end{itemize}
@@ -3193,7 +3193,7 @@
 and
 \tcode{xpos < size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos), str.at(I))}
 for no element \tcode{I} of the string controlled by \tcode{str}.
 \end{itemize}
@@ -3273,7 +3273,7 @@
 and
 \tcode{xpos < size()};
 \item
-\indexlibrary{\idxcode{eq}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{eq}!\idxcode{char_traits}}%
 \tcode{traits::eq(at(xpos), str.at(I))}
 for no element \tcode{I} of the string
 controlled by \tcode{str}.
@@ -3709,7 +3709,7 @@
 \tcode{lhs.compare(rhs) == 0}.
 \end{itemdescr}
 
-\indexlibrary{\idxcode{length}!\tcode{char_traits}}%
+\indexlibrary{\idxcode{length}!\idxcode{char_traits}}%
 \rSec3[string::op!=]{\tcode{operator!=}}
 
 \indexlibrary{\idxcode{basic_string}!\idxcode{operator"!=}}%