Lines Matching full:containers
515 value based on another value. Map-like containers also support efficient
516 queries for containment (whether a key is in the map). Map-like containers
518 need that, use two maps. Some map-like containers also support efficient
519 iteration through the keys in sorted order. Map-like containers are the most
524 containers support efficient iteration through the elements in sorted order.
525 Set-like containers are more expensive than sequential containers.
537 eliminating duplicates. Bit containers require a maximum of 1 bit for each
551 Sequential Containers (std::vector, std::list, etc)
554 There are a variety of sequential containers available for you, based on your
807 by the ``ilist<T>`` (and analogous containers) in the default manner.
852 Other STL containers are available, such as ``std::string``.
860 String-like containers
873 For more information on choosing string containers for APIs, please see
894 StringRef has a few major limitations which make more powerful string containers
998 Set-Like Containers (std::set, SmallSet, SetVector, etc)
1001 Set-like containers are useful when you need to canonicalize multiple values
1179 size 16 ``SmallSet`` for the underlying containers
1219 "hash_set" like containers (whether from C++ TR1 or from the SGI library). We
1229 Map-Like Containers (std::map, DenseMap, etc)
1232 Map-like containers are useful when you want to associate data to a key. As
1241 trivially use the same approach as :ref:`sorted vectors for set-like containers
1407 "hash_map" like containers (whether from C++ TR1 or from the SGI library). We
1417 Bit storage containers (BitVector, SparseBitVector)
1420 Unlike the other containers, there are only two bit storage containers, and
1438 set operations compared to other containers. Use the BitVector when you expect
1641 usable with standard algorithms and containers. For example, they prevent the
