os/support/ObjectList.h

151 			bool				ReplaceItem(int32 index, T*);
153 									// at <index> first
154 			T*					SwapWithItem(int32 index, T* newItem);
156 									// delete old item at <index>, returns it
244 									// returns either the index into which a new
245 									// item should be inserted or index of an
264 	for (int32 index = 0; index < count; index++) {
265 		if ((result = (list->ItemAt(index)->*func)(p1)) != 0)
281 	for (int32 index = 0; index < count; index++) {
282 		if ((result = (*func)(list->ItemAt(index), p1)) != 0)
298 	for (int32 index = 0; index < count; index++) {
299 		if ((result = (list->ItemAt(index)->*func)(p1, p2)) != 0)
315 	for (int32 index = 0; index < count; index++) {
316 		if ((result = (*func)(list->ItemAt(index), p1, p2)) != 0)
334 	for (int32 index = 0; index < count; index++) {
335 		if ((result = (*func)(list->ItemAt(index), p1, p2, p3, p4)) != 0)
348 	for (int32 index = 0; index < count; index++)
349 		(list->ItemAt(index)->*func)();
358 	for (int32 index = 0; index < count; index++)
359 		(func)(list->ItemAt(index), p1);
369 	for (int32 index = 0; index < count; index++)
370 		(list->ItemAt(index)->*func)(p1, p2);
380 	for (int32 index = 0; index < count; index++)
381 		(func)(list->ItemAt(index), p1, p2);
391 	for (int32 index = 0; index < count; index++)
392 		(func)(list->ItemAt(index), p1, p2, p3);
403 	for (int32 index = 0; index < count; index++)
404 		(func)(list->ItemAt(index), p1, p2, p3, p4);
435 		for	(int32 index = 0; index < count; index++) {
436 			T* item = list.ItemAt(index);
439 			_SetItem(index, item);
464 		for	(int32 index = 0; index < count; index++) {
465 			T* item = list.ItemAt(index);
468 			_SetItem(index, item);
486 BObjectList<T>::AddItem(T* item, int32 index)
488 	return _PointerList_::AddItem((void*)item, index);
502 BObjectList<T>::AddList(BObjectList<T>* list, int32 index)
504 	return _PointerList_::AddList(list, index);
523 BObjectList<T>::RemoveItemAt(int32 index)
525 	return (T*)_PointerList_::RemoveItem(index);
531 BObjectList<T>::ItemAt(int32 index) const
533 	return (T*)_PointerList_::ItemAt(index);
539 BObjectList<T>::ReplaceItem(int32 index, T* item)
542 		delete ItemAt(index);
544 	return _PointerList_::ReplaceItem(index, (void*)item);
550 BObjectList<T>::SwapWithItem(int32 index, T* item)
552 	T* result = ItemAt(index);
553 	_PointerList_::ReplaceItem(index, (void*)item);
569 BObjectList<T>::_SetItem(int32 index, T* newItem)
571 	_PointerList_::ReplaceItem(index, (void*)newItem);
629 		for (int32 index = 0; index < count; index++)
630 			delete ItemAt(index);
658 	for (int32 index = 0; index < count; index++) {
659 		if (predicate.operator()(ItemAt(index)) == 0)
660 			return ItemAt(index);
670 	for (int32 index = 0; index < count; index++) {
671 		if (predicate.operator()(ItemAt(index)) == 0)
672 			return ItemAt(index);
784 	int32 index = _PointerList_::BinarySearchIndex(item,
786 	if (index >= 0) {
788 		return AddItem(item, index + 1);
791 	return AddItem(item, -index - 1);
800 	int32 index = _PointerList_::BinarySearchIndex(item,
802 	if (index >= 0) {
804 		return AddItem(item, index + 1);
807 	return AddItem(item, -index - 1);
815 	int32 index = _PointerList_::BinarySearchIndex(item,
817 	if (index >= 0)
820 	return AddItem(item, -index - 1);
829 	int32 index = _PointerList_::BinarySearchIndex(item,
831 	if (index >= 0)
834 	return AddItem(item, -index - 1);
842 	int32 index = _PointerList_::BinarySearchIndex(&copyThis,
845 	if (index >= 0)
846 		index++;
848 		index = -index - 1;
851 	AddItem(newItem, index);
861 	int32 index = _PointerList_::BinarySearchIndex(&copyThis,
864 	if (index >= 0)
865 		index++;
867 		index = -index - 1;
870 	AddItem(newItem, index);
879 	int32 index = _PointerList_::BinarySearchIndex(&copyThis,
881 	if (index >= 0)
882 		return ItemAt(index);
884 	index = -index - 1;
886 	AddItem(newItem, index);
896 	int32 index = _PointerList_::BinarySearchIndex(&copyThis,
898 	if (index >= 0)
899 		return ItemAt(index);
901 	index = -index - 1;
903 	AddItem(newItem, index);
913 	int32 index = _PointerList_::BinarySearchIndexByPredicate(&pred,
917 		*alreadyInList = index >= 0;
919 	if (index < 0)
920 		index = -index - 1;
922 	return index;
939 	int32 index = FindBinaryInsertionIndex(pred, &alreadyInList);
943 	AddItem(item, index);