Lines Matching refs:numItems
79 void* BinarySearch(const void *key, const void **items, int32 numItems,
144 int32 numItems = list->CountItems();
145 if (numItems > 1) {
147 Swap(items, 0, numItems-1);
150 QuickSort(items, 0, numItems-2);
156 int32 numItems, int32 &index)
158 const void** end = &items[numItems];
161 if (index != numItems && Compare(key, *found) == 0) {
272 int32 numItems = CountItems();
275 for (int32 index = 0; index < numItems; index++) {