os/support/ObjectList.h

62 	static int _unary_predicate_glue(const void *item, void *context);
70 UnaryPredicate<T>::_unary_predicate_glue(const void *item, void *context)
72 	return ((UnaryPredicate<T> *)context)->operator()((const T *)item);
142 									// if owning, deletes the removed item
144 									// returns the removed item
148 								// item access
152 									// if list is owning, deletes the item
156 									// delete old item at <index>, returns it
179 								// linear search, returns first item that
199 			int32				BinarySearchIndex(const T&item,
201 			int32				BinarySearchIndex(const T&item,
218 								// unique insert, returns false if item already
226 								// insert a copy of the item, returns new
227 								// inserted item
233 								// insert a copy of the item if not in list
234 								// already returns new inserted item or existing
235 								// item in case of a conflict
245 									// item should be inserted or index of an
246 									// existing item that matches the predicate
436 			T* item = list.ItemAt(index);
437 			if (item)
438 				item = new (std::nothrow) T(*item);
439 			_SetItem(index, item);
465 			T* item = list.ItemAt(index);
466 			if (item)
467 				item = new (std::nothrow) T(*item);
468 			_SetItem(index, item);
477 BObjectList<T>::AddItem(T* item)
480 	return _PointerList_::AddItem((void*)item);
486 BObjectList<T>::AddItem(T* item, int32 index)
488 	return _PointerList_::AddItem((void*)item, index);
510 BObjectList<T>::RemoveItem(T* item, bool deleteIfOwning)
512 	bool result = _PointerList_::RemoveItem((void*)item);
515 		delete item;
539 BObjectList<T>::ReplaceItem(int32 index, T* item)
544 	return _PointerList_::ReplaceItem(index, (void*)item);
550 BObjectList<T>::SwapWithItem(int32 index, T* item)
553 	_PointerList_::ReplaceItem(index, (void*)item);
577 BObjectList<T>::IndexOf(const T* item) const
579 	return _PointerList_::IndexOf((void*)item);
601 BObjectList<T>::HasItem(const T* item) const
603 	return _PointerList_::HasItem((void*)item);
752 BObjectList<T>::BinarySearchIndex(const T& item, CompareFunction compare) const
754 	return _PointerList_::BinarySearchIndex(&item,
761 BObjectList<T>::BinarySearchIndex(const T& item,
764 	return _PointerList_::BinarySearchIndex(&item,
782 BObjectList<T>::BinaryInsert(T* item, CompareFunction func)
784 	int32 index = _PointerList_::BinarySearchIndex(item,
788 		return AddItem(item, index + 1);
791 	return AddItem(item, -index - 1);
797 BObjectList<T>::BinaryInsert(T* item, CompareFunctionWithState func,
800 	int32 index = _PointerList_::BinarySearchIndex(item,
804 		return AddItem(item, index + 1);
807 	return AddItem(item, -index - 1);
813 BObjectList<T>::BinaryInsertUnique(T* item, CompareFunction func)
815 	int32 index = _PointerList_::BinarySearchIndex(item,
820 	return AddItem(item, -index - 1);
826 BObjectList<T>::BinaryInsertUnique(T* item, CompareFunctionWithState func,
829 	int32 index = _PointerList_::BinarySearchIndex(item,
834 	return AddItem(item, -index - 1);
928 BObjectList<T>::BinaryInsert(T* item, const UnaryPredicate<T>& pred)
930 	return AddItem(item, FindBinaryInsertionIndex(pred));
936 BObjectList<T>::BinaryInsertUnique(T* item, const UnaryPredicate<T>& pred)
943 	AddItem(item, index);