Cross Reference: /external/chromium_org/base/stl

Lines Matching refs:container
30 // For a range within a container of pointers, calls delete (non-array version)
48 // For a range within a container of pairs, calls delete (non-array version) on
52 // container may call the hash function on the iterator when it is advanced,
66 // For a range within a container of pairs, calls delete (non-array version) on
79 // For a range within a container of pairs, calls delete.
126 // STLDeleteElements() deletes all the elements in an STL container and clears
127 // the container.  This function is suitable for use with a vector, set,
128 // hash_set, or any other STL container which defines sensible begin(), end(),
131 // If container is NULL, this function is a no-op.
134 // STLElementDeleter (defined below), which ensures that your container's
137 void STLDeleteElements(T* container) {
138   if (!container)
140   STLDeleteContainerPointers(container->begin(), container->end());
141   container->clear();
144 // Given an STL container consisting of (key, value) pairs, STLDeleteValues
145 // deletes all the "value" components and clears the container.  Does nothing
148 void STLDeleteValues(T* container) {
149   if (!container)
151   for (typename T::iterator i(container->begin()); i != container->end(); ++i)
153   container->clear();
168 // Given a pointer to an STL container this class will delete all the element
173   STLElementDeleter<T>(T* container) : container_(container) {}
180 // Given a pointer to an STL container this class will delete all the value
185   STLValueDeleter<T>(T* container) : container_(container) {}
201 // Returns true if the container is sorted.
204   // Note: Use reverse iterator on container to ensure we only require
248 // Returns true if the sorted container |a1| contains all elements of the sorted
249 // container |a2|.