Lines Matching refs:list
46 of the item not in list.
48 int32 BinarySearchIndex(const void *key, const BList *list);
51 not be found in the list.
53 void* BinarySearch(const void *key, const BList *list);
55 Sorts the items in list.
57 void SortItems(BList *list);
59 Removes the first item in list and appends it at the bottom of
60 the list and sorts all items but the last item.
62 void HSortItems(BList *list);
68 // Use insertion sort if number of elements in list is less than
72 // list is less than kPivotThreshold.
114 AbstractPointerListHelper::BinarySearchIndex(const void *key, const BList *list)
117 const void **items = static_cast<const void**>(list->Items());
118 BinarySearch(key, items, list->CountItems(), index);
124 AbstractPointerListHelper::BinarySearch(const void *key, const BList *list)
127 const void **items = static_cast<const void**>(list->Items());
128 return BinarySearch(key, items, list->CountItems(), index);
133 AbstractPointerListHelper::SortItems(BList *list)
135 void **items = static_cast<void**>(list->Items());
136 QuickSort(items, 0, list->CountItems()-1);
141 AbstractPointerListHelper::HSortItems(BList *list)
143 void **items = static_cast<void**>(list->Items());
144 int32 numItems = list->CountItems();
252 _PointerList_::_PointerList_(const _PointerList_ &list)
254 BList(list),
255 owning(list.owning)