18 void List<T, P>::Add(const T& element, P alloc) {  in Add()
22     List<T, P>::ResizeAdd(element, alloc);  in Add()
28 void List<T, P>::AddAll(const List<T, P>& other, P alloc) {  in AddAll()
34 void List<T, P>::AddAll(const Vector<T>& other, P alloc) {  in AddAll()
49 void List<T, P>::ResizeAdd(const T& element, P alloc) {  in ResizeAdd()
55 void List<T, P>::ResizeAddInternal(const T& element, P alloc) {  in ResizeAddInternal()
69 void List<T, P>::Resize(int new_capacity, P alloc) {  in Resize()
73   List<T, P>::DeleteData(data_);  in Resize()
80 Vector<T> List<T, P>::AddBlock(T value, int count, P alloc) {  in AddBlock()
88 void List<T, P>::Set(int index, const T& elm) {  in Set()
95 void List<T, P>::InsertAt(int index, const T& elm, P alloc) {  in InsertAt()
106 T List<T, P>::Remove(int i) {  in Remove()
118 bool List<T, P>::RemoveElement(const T& elm) {  in RemoveElement()
129 void List<T, P>::Swap(List<T, P>* list) {  in Swap()
136 void List<T, P>::Allocate(int length, P allocator) {  in Allocate()
144 void List<T, P>::Clear() {  in Clear()
155 void List<T, P>::Rewind(int pos) {  in Rewind()
162 void List<T, P>::Trim(P alloc) {  in Trim()
170 void List<T, P>::Iterate(void (*callback)(T* x)) {  in Iterate()
177 void List<T, P>::Iterate(Visitor* visitor) {  in Iterate()
183 bool List<T, P>::Contains(const T& elm) const {  in Contains()
193 int List<T, P>::CountOccurrences(const T& elm, int start, int end) const {  in CountOccurrences()
204 void List<T, P>::Sort(CompareFunction cmp) {  in Sort()
211 void List<T, P>::Sort(CompareFunction cmp, size_t s, size_t l) {  in Sort()
220 void List<T, P>::Sort() {  in Sort()
227 void List<T, P>::StableSort(CompareFunction cmp) {  in StableSort()
234 void List<T, P>::StableSort(CompareFunction cmp, size_t s, size_t l) {  in StableSort()
243 void List<T, P>::StableSort() {  in StableSort()
249 int SortedListBSearch(const List<T>& list, P cmp) {  in SortedListBSearch()
284 int SortedListBSearch(const List<T>& list, T elem) {  in SortedListBSearch()