fixup to original commit: add indexing

Author: jensmaurer

source/containers.tex

@@ -112,6 +112,7 @@
 \indexlibrarymemberx{array}{#1}%
 \indexlibrarymemberx{deque}{#1}%
 \indexlibrarymemberx{forward_list}{#1}%
+\indexlibrarymemberx{hive}{#1}%
 \indexlibrarymemberx{list}{#1}%
 \indexlibrarymemberx{vector}{#1}%
 \indexlibrarymemberx{map}{#1}%
@@ -426,7 +427,25 @@
 Constant.
 \end{itemdescr}
 
-\indexcont{operator==}%
+% hive is excluded here
+\indexlibrarymisc{\idxcode{operator==}}{containers}%
+\indexlibrarymemberx{array}{operator==}%
+\indexlibrarymemberx{deque}{operator==}%
+\indexlibrarymemberx{forward_list}{operator==}%
+\indexlibrarymemberx{list}{operator==}%
+\indexlibrarymemberx{vector}{operator==}%
+\indexlibrarymemberx{map}{operator==}%
+\indexlibrarymemberx{set}{operator==}%
+\indexlibrarymemberx{multiset}{operator==}%
+\indexlibrarymemberx{multimap}{operator==}%
+\indexlibrarymemberx{unordered_map}{operator==}%
+\indexlibrarymemberx{unordered_set}{operator==}%
+\indexlibrarymemberx{unordered_multiset}{operator==}%
+\indexlibrarymemberx{unordered_multimap}{operator==}%
+\indexlibrarymemberx{flat_map}{operator==}%
+\indexlibrarymemberx{flat_set}{operator==}%
+\indexlibrarymemberx{flat_multiset}{operator==}%
+\indexlibrarymemberx{flat_multimap}{operator==}%
 \begin{itemdecl}
 c == b
 \end{itemdecl}
@@ -457,7 +476,25 @@
 \tcode{==} is an equivalence relation.
 \end{itemdescr}
 
-\indexcont{operator"!=}%
+% hive is excluded here
+\indexlibrarymisc{\idxcode{operator"!=}}{containers}%
+\indexlibrarymemberx{array}{operator"!=}%
+\indexlibrarymemberx{deque}{operator"!=}%
+\indexlibrarymemberx{forward_list}{operator"!=}%
+\indexlibrarymemberx{list}{operator"!=}%
+\indexlibrarymemberx{vector}{operator"!=}%
+\indexlibrarymemberx{map}{operator"!=}%
+\indexlibrarymemberx{set}{operator"!=}%
+\indexlibrarymemberx{multiset}{operator"!=}%
+\indexlibrarymemberx{multimap}{operator"!=}%
+\indexlibrarymemberx{unordered_map}{operator"!=}%
+\indexlibrarymemberx{unordered_set}{operator"!=}%
+\indexlibrarymemberx{unordered_multiset}{operator"!=}%
+\indexlibrarymemberx{unordered_multimap}{operator"!=}%
+\indexlibrarymemberx{flat_map}{operator"!=}%
+\indexlibrarymemberx{flat_set}{operator"!=}%
+\indexlibrarymemberx{flat_multiset}{operator"!=}%
+\indexlibrarymemberx{flat_multimap}{operator"!=}%
 \begin{itemdecl}
 c != b
 \end{itemdecl}
@@ -727,6 +764,7 @@
 \indexlibrarymisc{\idxcode{#1}}{reversible containers}%
 \indexlibrarymemberx{array}{#1}%
 \indexlibrarymemberx{deque}{#1}%
+\indexlibrarymemberx{hive}{#1}%
 \indexlibrarymemberx{list}{#1}%
 \indexlibrarymemberx{vector}{#1}%
 \indexlibrarymemberx{map}{#1}%
@@ -1038,6 +1076,7 @@
 \indexlibrarymisc{\idxcode{#1}}{allocator-aware containers}%
 \indexlibrarymemberx{deque}{#1}%
 \indexlibrarymemberx{forward_list}{#1}%
+\indexlibrarymemberx{hive}{#1}%
 \indexlibrarymemberx{list}{#1}%
 \indexlibrarymemberx{vector}{#1}%
 \indexlibrarymemberx{map}{#1}%
@@ -7810,9 +7849,9 @@
 #include <compare>              // see \ref{compare.syn}
 
 namespace std {
-  struct hive_limits {
-    size_t min;
-    size_t max;
+  struct @\libglobal{hive_limits}@ {
+    size_t @\libmember{min}{hive_limits}@;
+    size_t @\libmember{max}{hive_limits}@;
     constexpr hive_limits(size_t minimum, size_t maximum) noexcept
       : min(minimum), max(maximum) {}
   };
@@ -8062,6 +8101,7 @@
 
 \rSec3[hive.cons]{Constructors, copy, and assignment}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 constexpr explicit hive(const Allocator&) noexcept;
 \end{itemdecl}
@@ -8076,6 +8116,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 constexpr hive(hive_limits block_limits, const Allocator&);
 \end{itemdecl}
@@ -8091,6 +8132,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 explicit hive(size_type n, const Allocator& = Allocator());
 hive(size_type n, hive_limits block_limits, const Allocator& = Allocator());
@@ -8113,6 +8155,7 @@
 Linear in \tcode{n}.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 hive(size_type n, const T& value, const Allocator& = Allocator());
 hive(size_type n, const T& value, hive_limits block_limits, const Allocator& = Allocator());
@@ -8135,6 +8178,7 @@
 Linear in \tcode{n}.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 template<class InputIterator>
   hive(InputIterator first, InputIterator last, const Allocator& = Allocator());
@@ -8156,6 +8200,7 @@
 Linear in \tcode{distance(first, last)}.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 template<@\exposconcept{container-compatible-range}@<T> R>
   hive(from_range_t, R&& rg, const Allocator& = Allocator());
@@ -8176,6 +8221,7 @@
 Linear in \tcode{ranges::distance(rg)}.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 hive(const hive& x);
 hive(const hive& x, const type_identity_t<Allocator>& alloc);
@@ -8197,6 +8243,7 @@
 Linear in \tcode{x.size()}.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 hive(hive&& x);
 hive(hive&& x, const type_identity_t<Allocator>& alloc);
@@ -8238,6 +8285,7 @@
 Otherwise constant.
 \end{itemdescr}
 
+\indexlibraryctor{hive}%
 \begin{itemdecl}
 hive(initializer_list<T> il, const Allocator& = Allocator());
 hive(initializer_list<T> il, hive_limits block_limits, const Allocator& = Allocator());
@@ -8260,6 +8308,7 @@
 Linear in \tcode{il.size()}.
 \end{itemdescr}
 
+\indexlibrarymember{operator=}{hive}%
 \begin{itemdecl}
 hive& operator=(const hive& x);
 \end{itemdecl}
@@ -8283,6 +8332,7 @@
 Linear in \tcode{size() + x.size()}.
 \end{itemdescr}
 
+\indexlibrarymember{operator=}{hive}%
 \begin{itemdecl}
 hive& operator=(hive&& x)
   noexcept(allocator_traits<Allocator>::propagate_on_container_move_assignment::value ||
@@ -8345,6 +8395,7 @@
 
 \rSec3[hive.capacity]{Capacity}
 
+\indexlibrarymember{capacity}{hive}%
 \begin{itemdecl}
 size_type capacity() const noexcept;
 \end{itemdecl}
@@ -8360,6 +8411,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibrarymember{reserve}{hive}%
 \begin{itemdecl}
 void reserve(size_type n);
 \end{itemdecl}
@@ -8390,6 +8442,7 @@
 as well as the past-the-end iterator, remain valid.
 \end{itemdescr}
 
+\indexlibrarymember{shrink_to_fit}{hive}%
 \begin{itemdecl}
 void shrink_to_fit();
 \end{itemdecl}
@@ -8427,6 +8480,7 @@
 as well as the past-the-end iterator, are invalidated.
 \end{itemdescr}
 
+\indexlibrarymember{trim_capacity}{hive}%
 \begin{itemdecl}
 void trim_capacity() noexcept;
 void trim_capacity(size_type n) noexcept;
@@ -8449,6 +8503,7 @@
 as well as the past-the-end iterator, remain valid.
 \end{itemdescr}
 
+\indexlibrarymember{block_capacity_limits}{hive}%
 \begin{itemdecl}
 constexpr hive_limits block_capacity_limits() const noexcept;
 \end{itemdecl}
@@ -8463,6 +8518,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibrarymember{block_capacity_default_limits}{hive}%
 \begin{itemdecl}
 static constexpr hive_limits block_capacity_default_limits() noexcept;
 \end{itemdecl}
@@ -8479,6 +8535,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibrarymember{block_capacity_hard_limits}{hive}%
 \begin{itemdecl}
 static constexpr hive_limits block_capacity_hard_limits() noexcept;
 \end{itemdecl}
@@ -8495,6 +8552,7 @@
 Constant.
 \end{itemdescr}
 
+\indexlibrarymember{reshape}{hive}%
 \begin{itemdecl}
 void reshape(hive_limits block_limits);
 \end{itemdecl}
@@ -8542,6 +8600,7 @@
 
 \rSec3[hive.modifiers]{Modifiers}
 
+\indexlibrarymember{emplace}{hive}%
 \begin{itemdecl}
 template<class... Args> iterator emplace(Args&&... args);
 template<class... Args> iterator emplace_hint(const_iterator hint, Args&&... args);
@@ -8575,6 +8634,7 @@
 Invalidates the past-the-end iterator.
 \end{itemdescr}
 
+\indexlibrarymember{insert}{hive}%
 \begin{itemdecl}
 iterator insert(const T& x);
 iterator insert(const_iterator hint, const T& x);
@@ -8591,6 +8651,7 @@
 \end{note}
 \end{itemdescr}
 
+\indexlibrarymember{insert}{hive}%
 \begin{itemdecl}
 void insert(initializer_list<T> rg);
 template<@\exposconcept{container-compatible-range}@<T> R>
@@ -8619,6 +8680,7 @@
 If an element is inserted, invalidates the past-the-end iterator.
 \end{itemdescr}
 
+\indexlibrarymember{insert}{hive}%
 \begin{itemdecl}
 void insert(size_type n, const T& x);
 \end{itemdecl}
@@ -8642,6 +8704,7 @@
 If an element is inserted, invalidates the past-the-end iterator.
 \end{itemdescr}
 
+\indexlibrarymember{insert}{hive}%
 \begin{itemdecl}
 template<class InputIterator>
   void insert(InputIterator first, InputIterator last);
@@ -8653,6 +8716,7 @@
 Equivalent to \tcode{insert_range(ranges::subrange(first, last))}.
 \end{itemdescr}
 
+\indexlibrarymember{erase}{hive}%
 \begin{itemdecl}
 iterator erase(const_iterator position);
 iterator erase(const_iterator first, const_iterator last);
@@ -8674,6 +8738,7 @@
 also invalidates the past-the-end iterator.
 \end{itemdescr}
 
+\indexlibrarymember{swap}{hive}%
 \begin{itemdecl}
 void swap(hive& x)
   noexcept(allocator_traits<Allocator>::propagate_on_container_swap::value ||
@@ -8702,6 +8767,7 @@
 are the same as those of \tcode{next(i, n)} and \tcode{prev(i, n)}, respectively.
 For \tcode{sort}, the definitions and requirements in \ref{alg.sorting} apply.
 
+\indexlibrarymember{splice}{hive}%
 \begin{itemdecl}
 void splice(hive& x);
 void splice(hive&& x);
@@ -8740,6 +8806,7 @@
 invalidates the past-the-end iterator for both \tcode{x} and \tcode{*this}.
 \end{itemdescr}
 
+\indexlibrarymember{unique}{hive}%
 \begin{itemdecl}
 template<class BinaryPredicate = equal_to<T>>
   size_type unique(BinaryPredicate binary_pred = BinaryPredicate());
@@ -8781,6 +8848,7 @@
 also invalidates the past-the-end iterator.
 \end{itemdescr}
 
+\indexlibrarymember{sort}{hive}%
 \begin{itemdecl}
 template<class Compare = less<T>>
   void sort(Compare comp = Compare());
@@ -8812,6 +8880,7 @@
 \end{note}
 \end{itemdescr}
 
+\indexlibrarymember{get_iterator}{hive}%
 \begin{itemdecl}
 iterator get_iterator(const_pointer p) noexcept;
 const_iterator get_iterator(const_pointer p) const noexcept;
@@ -8834,6 +8903,7 @@
 
 \rSec3[hive.erasure]{Erasure}
 
+\indexlibrarymember{erase}{hive}%
 \begin{itemdecl}
 template<class T, class Allocator, class U>
   typename hive<T, Allocator>::size_type
@@ -8849,6 +8919,7 @@
 \end{codeblock}
 \end{itemdescr}
 
+\indexlibrarymember{erase_if}{hive}%
 \begin{itemdecl}
 template<class T, class Allocator, class Predicate>
   typename hive<T, Allocator>::size_type