Skip to content

Commit 4e2e390

Browse files
EelisEelis
committed
[unord.req] Move library name index entries to library name index.
1 parent 13cd3ff commit 4e2e390

File tree

1 file changed

+58
-58
lines changed

1 file changed

+58
-58
lines changed

‎source/containers.tex

Lines changed: 58 additions & 58 deletions
Original file line numberDiff line numberDiff line change
@@ -2195,8 +2195,8 @@
21952195
\endhead
21962196
%%
21972197
\tcode{X::key_type} &
2198-
\indextext{unordered associative containers!\idxcode{key_type}}%
2199-
\indextext{\idxcode{key_type}!unordered associative containers}%
2198+
\indexlibrary{unordered associative containers!\idxcode{key_type}}%
2199+
\indexlibrary{\idxcode{key_type}!unordered associative containers}%
22002200
\tcode{Key} &
22012201
&
22022202
compile time \\ \rowsep
@@ -2220,8 +2220,8 @@
22202220
& \tcode{Hash}
22212221
& \tcode{Hash} shall be a unary function object type such that the expression
22222222
\tcode{hf(k)} has type \tcode{size_t}.%
2223-
\indextext{unordered associative containers!\idxcode{hasher}}%
2224-
\indextext{\idxcode{hasher}!unordered associative containers}%
2223+
\indexlibrary{unordered associative containers!\idxcode{hasher}}%
2224+
\indexlibrary{\idxcode{hasher}!unordered associative containers}%
22252225
& compile time
22262226
\\ \rowsep
22272227
%
@@ -2230,8 +2230,8 @@
22302230
& \requires\ \tcode{Pred} is \tcode{CopyConstructible}.\br
22312231
\tcode{Pred} shall be a binary predicate that takes two arguments
22322232
of type \tcode{Key}. \tcode{Pred} is an equivalence relation.%
2233-
\indextext{unordered associative containers!\idxcode{key_equal}}%
2234-
\indextext{\idxcode{key_equal}!unordered associative containers}%
2233+
\indexlibrary{unordered associative containers!\idxcode{key_equal}}%
2234+
\indexlibrary{\idxcode{key_equal}!unordered associative containers}%
22352235
& compile time
22362236
\\ \rowsep
22372237
%
@@ -2242,8 +2242,8 @@
22422242
& A \tcode{local_iterator} object may be used to iterate through a
22432243
single bucket, but may not be used to iterate across
22442244
buckets.%
2245-
\indextext{unordered associative containers!\idxcode{local_iterator}}%
2246-
\indextext{\idxcode{local_iterator}!unordered associative containers}%
2245+
\indexlibrary{unordered associative containers!\idxcode{local_iterator}}%
2246+
\indexlibrary{\idxcode{local_iterator}!unordered associative containers}%
22472247
& compile time
22482248
\\ \rowsep
22492249
%
@@ -2254,8 +2254,8 @@
22542254
& A \tcode{const_local_iterator} object may be used to iterate through a
22552255
single bucket, but may not be used to iterate across
22562256
buckets.%
2257-
\indextext{unordered associative containers!\idxcode{const_local_iterator}}%
2258-
\indextext{\idxcode{const_local_iterator}!unordered associative containers}%
2257+
\indexlibrary{unordered associative containers!\idxcode{const_local_iterator}}%
2258+
\indexlibrary{\idxcode{const_local_iterator}!unordered associative containers}%
22592259
& compile time
22602260
\\ \rowsep
22612261
%
@@ -2399,16 +2399,16 @@
23992399
\tcode{b.hash_function()}
24002400
& \tcode{hasher}
24012401
& Returns \tcode{b}'s hash function.%
2402-
\indextext{unordered associative containers!\idxcode{hash_function}}%
2403-
\indextext{\idxcode{hash_function}!unordered associative containers}%
2402+
\indexlibrary{unordered associative containers!\idxcode{hash_function}}%
2403+
\indexlibrary{\idxcode{hash_function}!unordered associative containers}%
24042404
& constant
24052405
\\ \rowsep
24062406
%
24072407
\tcode{b.key_eq()}
24082408
& \tcode{key_equal}
24092409
& Returns \tcode{b}'s key equality predicate.%
2410-
\indextext{unordered associative containers!\idxcode{key_eq}}%
2411-
\indextext{\idxcode{key_eq}!unordered associative containers}%
2410+
\indexlibrary{unordered associative containers!\idxcode{key_eq}}%
2411+
\indexlibrary{\idxcode{key_eq}!unordered associative containers}%
24122412
& constant
24132413
\\ \rowsep
24142414
%
@@ -2456,8 +2456,8 @@
24562456
component of the returned pair indicates whether the insertion
24572457
takes place, and the \tcode{iterator} component points to the element
24582458
with key equivalent to the key of \tcode{t}.%
2459-
\indextext{unordered associative containers!\idxcode{insert}}%
2460-
\indextext{\idxcode{insert}!unordered associative containers}%
2459+
\indexlibrary{unordered associative containers!\idxcode{insert}}%
2460+
\indexlibrary{\idxcode{insert}!unordered associative containers}%
24612461
& Average case \bigoh{1}, worst case \bigoh{\tcode{a_uniq.}\br\tcode{size()}}.
24622462
\\ \rowsep
24632463
%
@@ -2468,8 +2468,8 @@
24682468
\tcode{CopyInsertable} into \tcode{X}.\br
24692469
\effects\ Inserts \tcode{t}, and returns an iterator pointing to the newly
24702470
inserted element.
2471-
\indextext{unordered associative containers!\idxcode{insert}}%
2472-
\indextext{\idxcode{insert}!unordered associative containers}%
2471+
\indexlibrary{unordered associative containers!\idxcode{insert}}%
2472+
\indexlibrary{\idxcode{insert}!unordered associative containers}%
24732473
& Average case \bigoh{1}, worst case \bigoh{\tcode{a_eq.}\br\tcode{size()}}.
24742474
\\ \rowsep
24752475
%
@@ -2482,8 +2482,8 @@
24822482
to the element with the key equivalent to that of \tcode{t}. The
24832483
iterator \tcode{p} is a hint pointing to where the search should
24842484
start. Implementations are permitted to ignore the hint.%
2485-
\indextext{unordered associative containers!\idxcode{insert}}%
2486-
\indextext{\idxcode{insert}!unordered associative containers}%
2485+
\indexlibrary{unordered associative containers!\idxcode{insert}}%
2486+
\indexlibrary{\idxcode{insert}!unordered associative containers}%
24872487
& Average case \bigoh{1}, worst case \bigoh{\tcode{a.size()}}.
24882488
\\ \rowsep
24892489
%
@@ -2492,8 +2492,8 @@
24922492
& \requires\ \tcode{value_type} shall be \tcode{EmplaceConstructible} into \tcode{X} from \tcode{*i}.\br
24932493
\requires \tcode{i} and \tcode{j} are not iterators in \tcode{a}.
24942494
Equivalent to \tcode{a.insert(t)} for each element in \tcode{[i,j)}.%
2495-
\indextext{unordered associative containers!\idxcode{insert}}%
2496-
\indextext{\idxcode{insert}!unordered associative containers}%
2495+
\indexlibrary{unordered associative containers!\idxcode{insert}}%
2496+
\indexlibrary{\idxcode{insert}!unordered associative containers}%
24972497
& Average case \bigoh{N}, where $N$ is \tcode{distance(i, j)}. Worst
24982498
case $\bigoh{N(\tcode{a.size()} + 1)}$.
24992499
\\ \rowsep
@@ -2589,17 +2589,17 @@
25892589
& \tcode{iterator}
25902590
& Erases the element pointed to by \tcode{q}. Returns the
25912591
iterator immediately following \tcode{q} prior to the erasure.
2592-
\indextext{unordered associative containers!\idxcode{erase}}%
2593-
\indextext{\idxcode{erase}!unordered associative containers}%
2592+
\indexlibrary{unordered associative containers!\idxcode{erase}}%
2593+
\indexlibrary{\idxcode{erase}!unordered associative containers}%
25942594
& Average case \bigoh{1}, worst case \bigoh{\tcode{a.size()}}.
25952595
\\ \rowsep
25962596
%
25972597
\tcode{a.erase(r)}
25982598
& \tcode{iterator}
25992599
& Erases the element pointed to by \tcode{r}. Returns the
26002600
iterator immediately following \tcode{r} prior to the erasure.
2601-
\indextext{unordered associative containers!\idxcode{erase}}%
2602-
\indextext{\idxcode{erase}!unordered associative containers}%
2601+
\indexlibrary{unordered associative containers!\idxcode{erase}}%
2602+
\indexlibrary{\idxcode{erase}!unordered associative containers}%
26032603
& Average case \bigoh{1}, worst case \bigoh{\tcode{a.size()}}.
26042604
\\ \rowsep
26052605
%
@@ -2608,8 +2608,8 @@
26082608
& Erases all elements in the range \tcode{[q1, q2)}. Returns
26092609
the iterator immediately following the erased elements prior to the
26102610
erasure.%
2611-
\indextext{unordered associative containers!\idxcode{erase}}%
2612-
\indextext{\idxcode{erase}!unordered associative containers}%
2611+
\indexlibrary{unordered associative containers!\idxcode{erase}}%
2612+
\indexlibrary{\idxcode{erase}!unordered associative containers}%
26132613
& Average case linear in \tcode{distance(q1, q2)},
26142614
worst case \bigoh{\tcode{a.size()}}.
26152615
\\ \rowsep
@@ -2618,25 +2618,25 @@
26182618
& \tcode{void}
26192619
& Erases all elements in the container.
26202620
\postconditions \tcode{a.empty()} returns \tcode{true}%
2621-
\indextext{unordered associative containers!\idxcode{clear}}%
2622-
\indextext{\idxcode{clear}!unordered associative containers}%
2621+
\indexlibrary{unordered associative containers!\idxcode{clear}}%
2622+
\indexlibrary{\idxcode{clear}!unordered associative containers}%
26232623
& Linear in \tcode{a.size()}.
26242624
\\ \rowsep
26252625
%
26262626
\tcode{b.find(k)}
26272627
& \tcode{iterator}; \br \tcode{const_iterator} for const \tcode{b}.
26282628
& Returns an iterator pointing to an element with key equivalent to
26292629
\tcode{k}, or \tcode{b.end()} if no such element exists.%
2630-
\indextext{unordered associative containers!\idxcode{find}}%
2631-
\indextext{\idxcode{find}!unordered associative containers}%
2630+
\indexlibrary{unordered associative containers!\idxcode{find}}%
2631+
\indexlibrary{\idxcode{find}!unordered associative containers}%
26322632
& Average case \bigoh{1}, worst case \bigoh{\tcode{b.size()}}.
26332633
\\ \rowsep
26342634
%
26352635
\tcode{b.count(k)}
26362636
& \tcode{size_type}
26372637
& Returns the number of elements with key equivalent to \tcode{k}.%
2638-
\indextext{unordered associative containers!\idxcode{count}}%
2639-
\indextext{\idxcode{count}!unordered associative containers}%
2638+
\indexlibrary{unordered associative containers!\idxcode{count}}%
2639+
\indexlibrary{\idxcode{count}!unordered associative containers}%
26402640
& Average case \bigoh{\tcode{b.count(k)}}, worst case \bigoh{\tcode{b.size()}}.
26412641
\\ \rowsep
26422642
%
@@ -2646,26 +2646,26 @@
26462646
& Returns a range containing all elements with keys equivalent to
26472647
\tcode{k}. Returns \tcode{make_pair(b.end(), b.end())} if
26482648
no such elements exist.%
2649-
\indextext{unordered associative containers!\idxcode{equal_range}}%
2650-
\indextext{\idxcode{equal_range}!unordered associative containers}%
2649+
\indexlibrary{unordered associative containers!\idxcode{equal_range}}%
2650+
\indexlibrary{\idxcode{equal_range}!unordered associative containers}%
26512651
& Average case \bigoh{\tcode{b.count(k)}}. Worst case
26522652
\bigoh{\tcode{b.size()}}.
26532653
\\ \rowsep
26542654
%
26552655
\tcode{b.bucket_count()}
26562656
& \tcode{size_type}
26572657
& Returns the number of buckets that \tcode{b} contains.%
2658-
\indextext{unordered associative containers!\idxcode{bucket_count}}%
2659-
\indextext{\idxcode{bucket_count}!unordered associative containers}%
2658+
\indexlibrary{unordered associative containers!\idxcode{bucket_count}}%
2659+
\indexlibrary{\idxcode{bucket_count}!unordered associative containers}%
26602660
& Constant
26612661
\\ \rowsep
26622662
%
26632663
\tcode{b.max_bucket_count()}
26642664
& \tcode{size_type}
26652665
& Returns an upper bound on the number of buckets that \tcode{b} might
26662666
ever contain.%
2667-
\indextext{unordered associative containers!\idxcode{max_bucket_count}}%
2668-
\indextext{\idxcode{max_bucket_count}!unordered associative containers}%
2667+
\indexlibrary{unordered associative containers!\idxcode{max_bucket_count}}%
2668+
\indexlibrary{\idxcode{max_bucket_count}!unordered associative containers}%
26692669
& Constant
26702670
\\ \rowsep
26712671
%
@@ -2676,17 +2676,17 @@
26762676
Returns the index of the bucket in which elements with keys equivalent
26772677
to \tcode{k} would be found, if any such element existed.
26782678
\postconditions the return value shall be in the range \tcode{[0, b.bucket_count())}.%
2679-
\indextext{unordered associative containers!\idxcode{bucket}}%
2680-
\indextext{\idxcode{bucket}!unordered associative containers}%
2679+
\indexlibrary{unordered associative containers!\idxcode{bucket}}%
2680+
\indexlibrary{\idxcode{bucket}!unordered associative containers}%
26812681
& Constant
26822682
\\ \rowsep
26832683
%
26842684
\tcode{b.bucket_size(n)}
26852685
& \tcode{size_type}
26862686
& \requires \tcode{n} shall be in the range \tcode{[0, b.bucket_count())}.
26872687
Returns the number of elements in the $\texttt{n}^{\textrm{ th}}$ bucket.%
2688-
\indextext{unordered associative containers!\idxcode{bucket_size}}%
2689-
\indextext{\idxcode{bucket_size}!unordered associative containers}%
2688+
\indexlibrary{unordered associative containers!\idxcode{bucket_size}}%
2689+
\indexlibrary{\idxcode{bucket_size}!unordered associative containers}%
26902690
& \bigoh{\tcode{b.bucket_}\-\tcode{size(n)}}
26912691
\\ \rowsep
26922692
%
@@ -2697,8 +2697,8 @@
26972697
\tcode{b.begin(n)} returns an iterator referring to the
26982698
first element in the bucket. If the bucket is empty, then
26992699
\tcode{b.begin(n) == b.end(n)}.%
2700-
\indextext{unordered associative containers!\idxcode{begin}}%
2701-
\indextext{\idxcode{begin}!unordered associative containers}%
2700+
\indexlibrary{unordered associative containers!\idxcode{begin}}%
2701+
\indexlibrary{\idxcode{begin}!unordered associative containers}%
27022702
& Constant
27032703
\\ \rowsep
27042704
%
@@ -2708,8 +2708,8 @@
27082708
& \requires \tcode{n} shall be in the range \tcode{[0, b.bucket_count())}.
27092709
\tcode{b.end(n)} returns an iterator which is the past-the-end
27102710
value for the bucket.%
2711-
\indextext{unordered associative containers!\idxcode{end}}%
2712-
\indextext{\idxcode{end}!unordered associative containers}%
2711+
\indexlibrary{unordered associative containers!\idxcode{end}}%
2712+
\indexlibrary{\idxcode{end}!unordered associative containers}%
27132713
& Constant
27142714
\\ \rowsep
27152715
%
@@ -2718,24 +2718,24 @@
27182718
& \requires \tcode{n} shall be in the range \tcode{[0, b.bucket_count())}.
27192719
Note: \tcode{[b.cbegin(n), b.cend(n))} is a valid range containing
27202720
all of the elements in the $\texttt{n}^{\textrm{ th}}$ bucket.%
2721-
\indextext{unordered associative containers!\idxcode{cbegin}}%
2722-
\indextext{\idxcode{cbegin}!unordered associative containers}%
2721+
\indexlibrary{unordered associative containers!\idxcode{cbegin}}%
2722+
\indexlibrary{\idxcode{cbegin}!unordered associative containers}%
27232723
& Constant
27242724
\\ \rowsep
27252725
%
27262726
\tcode{b.cend(n)}
27272727
& \tcode{const_local_iterator}
27282728
& \requires \tcode{n} shall be in the range \tcode{[0, b.bucket_count())}.%
2729-
\indextext{unordered associative containers!\idxcode{cend}}%
2730-
\indextext{\idxcode{cend}!unordered associative containers}%
2729+
\indexlibrary{unordered associative containers!\idxcode{cend}}%
2730+
\indexlibrary{\idxcode{cend}!unordered associative containers}%
27312731
& Constant
27322732
\\ \rowsep
27332733
%
27342734
\tcode{b.load_factor()}
27352735
& \tcode{float}
27362736
& Returns the average number of elements per bucket.%
2737-
\indextext{unordered associative containers!\idxcode{load_factor}}%
2738-
\indextext{\idxcode{load_factor}!unordered associative containers}%
2737+
\indexlibrary{unordered associative containers!\idxcode{load_factor}}%
2738+
\indexlibrary{\idxcode{load_factor}!unordered associative containers}%
27392739
& Constant
27402740
\\ \rowsep
27412741
%
@@ -2745,8 +2745,8 @@
27452745
less than or equal to. The container automatically increases the
27462746
number of buckets as necessary to keep the load factor below this
27472747
number.%
2748-
\indextext{unordered associative containers!\idxcode{max_load_factor}}%
2749-
\indextext{\idxcode{max_load_factor}!unordered associative containers}%
2748+
\indexlibrary{unordered associative containers!\idxcode{max_load_factor}}%
2749+
\indexlibrary{\idxcode{max_load_factor}!unordered associative containers}%
27502750
& Constant
27512751
\\ \rowsep
27522752
%
@@ -2761,8 +2761,8 @@
27612761
& \tcode{void}
27622762
& \postconditions \tcode{a.bucket_count() >= a.size() / a.max_load_factor()} and
27632763
\tcode{a.bucket_count() >= n}.%
2764-
\indextext{unordered associative containers!\idxcode{rehash}}%
2765-
\indextext{\idxcode{rehash}!unordered associative containers}%
2764+
\indexlibrary{unordered associative containers!\idxcode{rehash}}%
2765+
\indexlibrary{\idxcode{rehash}!unordered associative containers}%
27662766
& Average case linear in \tcode{a.size()}, worst case quadratic.
27672767
\\ \rowsep
27682768

0 commit comments

Comments
 (0)