Lines Matching defs:containers

985 following natural iteration idiom for fallible containers like Archive:
1004 To enable this idiom, iterators over fallible containers are written in a
1477   value based on another value.  Map-like containers also support efficient
1478   queries for containment (whether a key is in the map).  Map-like containers
1480   need that, use two maps.  Some map-like containers also support efficient
1481   iteration through the keys in sorted order.  Map-like containers are the most
1486   containers support efficient iteration through the elements in sorted order.
1487   Set-like containers are more expensive than sequential containers.
1499   eliminating duplicates.  Bit containers require a maximum of 1 bit for each
1516 There are a variety of sequential containers available for you, based on your
1825 by the ``ilist<T>`` (and analogous containers) in the default manner.
1870 Other STL containers are available, such as ``std::string``.
1878 String-like containers
1891 For more information on choosing string containers for APIs, please see
1912 StringRef has a few major limitations which make more powerful string containers
2019 Set-like containers are useful when you need to canonicalize multiple values
2212 size 16 ``SmallSet`` for the underlying containers, so it is quite expensive.
2252 std::unordered_set.  We never use containers like unordered_set because
2265 Map-like containers are useful when you want to associate data to a key.  As
2274 trivially use the same approach as :ref:`sorted vectors for set-like containers
2458 std::unordered_map.  We never use containers like unordered_map because
2467 Bit storage containers
2470 There are several bit storage containers, and choosing when to use each is
2488 set operations compared to other containers.  Use the BitVector when you expect