Lines Matching full:a
18 <p>Following are the library's interface specifics. <a href=
19 "tutorial.html">Short Tutorial</a> is a short tutorial, and
20 <a href="concepts.html">Concepts</a> describes some
24 <h2><a name="namespaces" id="namespaces">Namespace</a></h2>
31 <h2><a name="containers" id="containers">Containers</a></h2>
33 <h3><a name="containers_assoc" id=
34 "containers_assoc">Associative Containers</a></h3>
37 <li><a href=
38 "container_base.html"><tt>container_base</tt></a> -
44 <li><a href=
45 "basic_hash_table.html"><tt>basic_hash_table</tt></a>
49 <li><a href=
50 "cc_hash_table.html"><tt>cc_hash_table</tt></a>
54 <li><a href=
55 "gp_hash_table.html"><tt>gp_hash_table</tt></a>
64 <li><a href=
65 "basic_tree.html"><tt>basic_tree</tt></a>
69 <li><a href=
70 "tree.html"><tt>tree</tt></a>
74 <li><a href=
75 "trie.html"><tt>trie</tt></a>
84 <li><a href=
85 "list_update.html"><tt>list_update</tt></a> -
91 <h3><a name="containers_pq" id="containers_pq">Priority
92 Queues</a></h3>
95 <li><a href="priority_queue.html"><tt>priority_queue</tt></a>
100 <h2><a name="tag" id="tag">Container Tags and
101 Traits</a></h2>
103 <h3><a name="ds_ts" id="ds_ts">Container Tags</a></h3>
105 <h4><a name="ds_ts_common" id="ds_ts_common">Common</a></h4>
108 <li><a href="container_tag.html"><tt>container_tag</tt></a> -
112 <h4><a name="ds_ts_assoc" id=
113 "ds_ts_assoc">Associative-Containers</a></h4>
116 <li><a href=
117 "associative_container_tag.html"><tt>associative_container_tag</tt></a> -
120 <li><a href=
121 "basic_hash_tag.html"><tt>basic_hash_tag</tt></a> -
124 <li><a href="cc_hash_tag.html"><tt>cc_hash_tag</tt></a>
127 <li><a href="gp_hash_tag.html"><tt>gp_hash_tag</tt></a>
130 <li><a href=
131 "basic_tree_tag.html"><tt>basic_tree_tag</tt></a>
134 <li><a href=
135 "tree_tag.html"><tt>tree_tag</tt></a> -
138 <li><a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
141 <li><a href=
142 "splay_tree_tag.html"><tt>splay_tree_tag</tt></a> -
145 <li><a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
148 <li><a href=
149 "trie_tag.html"><tt>trie_tag</tt></a> -
152 <li><a href=
153 "pat_trie_tag.html"><tt>pat_trie_tag</tt></a> -
156 <li><a href="list_update_tag.html"><tt>list_update_tag</tt></a> - list
160 <h4><a name="ds_ts_pq" id="ds_ts_pq">Priority-Queues</a></h4>
163 <li><a href=
164 "priority_queue_tag.html"><tt>priority_queue_tag</tt></a> - base
167 <li><a href=
168 "pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a> -
171 <li><a href=
172 "binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
175 <li><a href=
176 "rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
177 - redundant-counter binomial-heap (<i>i.e.</i>, a heap where
178 binomial trees form a sequence that is similar to a
181 <li><a href=
182 "binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -
186 <li><a href=
187 "thin_heap_tag.html"><tt>thin_heap_tag</tt></a> - thin
188 heap (an alternative [<a href=
189 "references.html#kt99fat_heaps">kt99fat_heaps</a>] to
193 <h3><a name="ds_inv_tag" id="ds_inv_tag">Invalidation-Guarantee
194 Tags</a></h3>
197 <li><a href=
198 "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a>
201 <li><a href=
202 "point_invalidation_guarantee.html"><tt>point_invalidation_guarantee</tt></a>
205 <li><a href=
206 "range_invalidation_guarantee.html"><tt>range_invalidation_guarantee</tt></a>
210 <h3><a name="container_traits" id="container_traits">Container
211 Traits</a></h3>
214 <li><a href="pq_container_traits.html"><tt>container_traits</tt></a> -
220 <h2><a name="ds_policy_classes" id=
221 "ds_policy_classes">Container Policy Classes</a></h2>
223 <h3><a name="hash_related_policies" id=
224 "hash_related_policies">Hash Policies</a></h3>
232 <li><a href="null_hash_fn.html"><tt>null_hash_fn</tt></a>
240 <li><a href="sample_range_hashing.html">Sample
241 range-hashing function</a> - interface required of a
244 <li><a href=
245 "direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
248 <li><a href=
249 "direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
257 <li><a href="sample_probe_fn.html">Sample probe
258 function</a> - interface required of a probe functor</li>
260 <li><a href=
261 "null_probe_fn.html"><tt>null_probe_fn</tt></a> - type
264 <li><a href=
265 "linear_probe_fn.html"><tt>linear_probe_fn</tt></a> -
268 <li><a href=
269 "quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>-
277 <li><a href="sample_ranged_hash_fn.html">Sample
278 ranged-hash function</a> - interface required of a
286 <li><a href="sample_ranged_probe_fn.html">Sample
287 ranged-probe function</a> - interface required of a
298 <li><a href="sample_resize_policy.html">Sample resize
299 policy</a> - interface required of a resize policy</li>
301 <li><a href=
302 "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
310 <li><a href="sample_size_policy.html">Sample size
311 policy</a> - interface required of a size policy</li>
313 <li><a href=
314 "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
318 <li><a href=
319 "hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
328 <li><a href="sample_resize_trigger.html">Sample trigger
329 policy</a> - interface required of a trigger policy</li>
331 <li><a href=
332 "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
335 <li><a href=
336 …sh_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
342 <h3><a name="tree_related_policies" id=
343 "tree_related_policies">Tree Policies</a></h3>
349 <li><a href="sample_tree_node_update.html">Sample node
350 updater policy</a> - interface required of a tree
353 <li><a href=
354 "null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
357 <li><a href=
358 "tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
362 <h3><a name="trie_related_policies" id=
363 "trie_related_policies">Trie Policies</a></h3>
369 <li><a href="sample_trie_e_access_traits.html">Sample
370 element-access traits</a> - interface required of
373 <li><a href=
374 "string_trie_e_access_traits.html"><tt>string_trie_e_access_traits</tt></a>
382 <li><a href="sample_trie_node_update.html">Sample node
383 updater policy</a> - interface required of a trie node
386 <li><a href=
387 "null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
390 <li><a href=
391 "trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
394 <li><a href=
395 "trie_order_statistics_node_update.html"><tt>trie_order_statistics_node_update</tt></a>
399 <h3><a name="list_related_policies" id=
400 "list_related_policies">List Policies</a></h3>
406 <li><a href="sample_update_policy.html">Sample list update
407 policy</a> - interface required of a list update policy</li>
409 <li><a href=
410 "move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
413 <li><a href=
414 "counter_lu_policy.html"><tt>counter_lu_policy</tt></a> -
418 <h3><a name="ds_pol" id="ds_pol">Mapped-Type Policies</a></h3>
422 <li><a href=
423 "null_mapped_type.html"><tt>null_mapped_type</tt></a> - data
424 policy indicating that a container is a "set"</li>
428 <h2><a name="exceptions" id="exceptions">Exceptions</a></h2>
432 <li><a href="exceptions.html"><tt>container_error</tt></a>
435 <li><a href=
436 "insert_error.html"><tt>insert_error</tt></a></li>
438 <li><a href="join_error.html"><tt>join_error</tt></a></li>
440 <li><a href=
441 "resize_error.html"><tt>resize_error</tt></a></li>