Lines Matching refs:index

104 BList::AddItem(void* item, int32 index)
106 if (index < 0 || index > fItemCount)
115 move_items(fObjectList + index, 1, fItemCount - index - 1);
116 fObjectList[index] = item;
140 BList::AddList(const BList* list, int32 index)
142 bool result = (list && index >= 0 && index <= fItemCount);
150 move_items(fObjectList + index, count, fItemCount - index - count);
151 memcpy(fObjectList + index, list->fObjectList,
165 int32 index = fItemCount;
172 memcpy(fObjectList + index, list->fObjectList,
184 int32 index = IndexOf(item);
185 bool result = (index >= 0);
187 RemoveItem(index);
193 BList::RemoveItem(int32 index)
196 if (index >= 0 && index < fItemCount) {
197 item = fObjectList[index];
198 move_items(fObjectList + index + 1, -1, fItemCount - index - 1);
208 BList::RemoveItems(int32 index, int32 count)
210 bool result = (index >= 0 && index <= fItemCount);
212 if (index + count > fItemCount)
213 count = fItemCount - index;
215 move_items(fObjectList + index + count, -count,
216 fItemCount - index - count);
228 BList::ReplaceItem(int32 index, void* item)
232 if (index >= 0 && index < fItemCount) {
233 fObjectList[index] = item;
309 BList::ItemAt(int32 index) const
312 if (index >= 0 && index < fItemCount)
313 item = fObjectList[index];
329 BList::ItemAtFast(int32 index) const
331 return fObjectList[index];
417 int32 index = 0;
419 while ((!terminate) && (index < fItemCount)) {
420 terminate = func(fObjectList[index]);
421 index++;
436 bool terminate = false; int32 index = 0;
437 while ((!terminate) && (index < fItemCount)) {
438 terminate = func(fObjectList[index], arg);
439 index++;
452 // obsolete AddList(BList* list, int32 index) and AddList(BList* list)
455 AddList__5BListP5BListl(BList* self, BList* list, int32 index)
457 return self->AddList((const BList*)list, index);