Lines Matching refs:containers

591   value based on another value.  Map-like containers also support efficient
592   queries for containment (whether a key is in the map).  Map-like containers
594   need that, use two maps.  Some map-like containers also support efficient
595   iteration through the keys in sorted order.  Map-like containers are the most
600   containers support efficient iteration through the elements in sorted order.
601   Set-like containers are more expensive than sequential containers.
613   eliminating duplicates.  Bit containers require a maximum of 1 bit for each
630 There are a variety of sequential containers available for you, based on your
883 by the ``ilist<T>`` (and analogous containers) in the default manner.
928 Other STL containers are available, such as ``std::string``.
936 String-like containers
949 For more information on choosing string containers for APIs, please see
970 StringRef has a few major limitations which make more powerful string containers
1077 Set-like containers are useful when you need to canonicalize multiple values
1255 size 16 ``SmallSet`` for the underlying containers, so it is quite expensive.
1295 "hash_set" like containers (whether from C++ TR1 or from the SGI library).  We
1308 Map-like containers are useful when you want to associate data to a key.  As
1317 trivially use the same approach as :ref:`sorted vectors for set-like containers
1485 "hash_map" like containers (whether from C++ TR1 or from the SGI library).  We
1495 Bit storage containers (BitVector, SparseBitVector)
1498 Unlike the other containers, there are only two bit storage containers, and
1516 set operations compared to other containers.  Use the BitVector when you expect
1719 usable with standard algorithms and containers.  For example, they prevent the