Lines Matching refs:item

111 		Item* item = (Item*)list.ItemAt(i);
115 if (item != NULL) {
116 item->Print();
129 Item* item = (Item*)list.ItemAt(i);
130 if (item != NULL) {
131 delete item;
157 int prevValue = -1; // item values are >= 0
159 Item* item = (Item*)list.ItemAt(i);
160 assert(item != NULL);
161 int value = item->Value();
174 Item* item = (Item*)list.ItemAt(i);
175 if (item != NULL && item->Value() == value) {
250 Item* item = NULL;
252 item = (Item*)clone.ItemAt(0);
255 // HSortItems seems to put the first item at the end of the list
259 assert(!hasItems || item == (Item*)clone.ItemAt(lastItem));
303 Item* item = NULL;
305 item = (Item*)clone.ItemAt(0);
308 // HSortItems seems to put the first item at the end of the list
314 assert(!hasItems || item == (Item*)clone.ItemAt(lastItem));
322 void* CopyTo(void* item, void* data)
325 list->AddItem(item);
329 void* FirstItem(void* item, void* data)
331 return item;
344 void* item = list.EachElement(FirstItem, NULL);
345 assert (item == list.ItemAt(0));
363 Item* item = (Item*)list.ItemAt(i);
364 assert(item != NULL);
366 Item* found = (Item*)list.BinarySearch(item, Item::Compare);
367 assert(item->Equals(found));
369 found = (Item*)list.BinarySearch(item, ::Compare, gData);
370 assert(item->Equals(found));
397 Item* item = (Item*)_item;
399 return item->Value() - value->value;
414 Item* item = (Item*)list.ItemAt(i);
415 assert(item != NULL);
416 Value value(item->Value());
418 int index = IndexOf(list, item->Value());
420 searchIndex = list.BinarySearchIndex(item, Item::Compare);
423 searchIndex = list.BinarySearchIndex(item, ::Compare, gData);