Lines Matching refs:list
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
38 // SmallPointerList is a list optimized for storing no or just a
41 // The interface tries to be as close to List from list.h as possible.
54 if (list()->capacity() >= capacity) return;
55 int old_length = list()->length();
56 list()->AddBlock(NULL, capacity - list()->capacity());
57 list()->Rewind(old_length);
60 PointerList* list = new PointerList(capacity);
62 list->Add(single_value());
64 ASSERT(IsAligned(reinterpret_cast<intptr_t>(list), kPointerAlignment));
65 data_ = reinterpret_cast<intptr_t>(list) | kListTag;
77 return list()->length();
87 PointerList* list = new PointerList(2);
88 list->Add(single_value());
89 list->Add(pointer);
90 ASSERT(IsAligned(reinterpret_cast<intptr_t>(list), kPointerAlignment));
91 data_ = reinterpret_cast<intptr_t>(list) | kListTag;
94 list()->Add(pointer);
97 // Note: returns T* and not T*& (unlike List from list.h).
105 return list()->at(i);
111 // Remove the given element from the list (if present).
120 list()->RemoveElement(pointer);
130 return list()->RemoveLast();
145 list()->Rewind(pos);
156 return list()->CountOccurrences(pointer, start, end);
176 PointerList* list() const {