Lines Matching full:list
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
36 // The list is a template for very light-weight lists. We are not
41 // The list is parameterized by the type of its elements (T) and by an
46 // template <typename T, class P = FreeStoreAllocationPolicy> class List;
48 class List {
51 List() { Initialize(0); }
52 INLINE(explicit List(int capacity)) { Initialize(capacity); }
53 INLINE(~List()) { DeleteData(data_); }
55 // Deallocates memory used by the list and leaves the list in a consistent
68 // not safe to use after operations that can change the list's
87 // Adds a copy of the given 'element' to the end of the list,
88 // expanding the list if necessary.
91 // Add all the elements from the argument list to this list.
92 void AddAll(const List<T, P>& other);
96 // until the next change is made to this list.
102 // size of the list.
109 // Clears the list by setting the length to zero. Even if T is a
110 // pointer type, clearing the list doesn't delete the entries.
113 // Drops all but the first 'pos' elements from the list.
118 // Iterate through all list entries, starting at index 0.
121 // Sort all list entries (using QuickSort)
135 // Increase the capacity of a full list, and add an element.
136 // List must be full already.
143 // Resize the list.
146 DISALLOW_COPY_AND_ASSIGN(List);
154 void List<FrameElement,
