kernel/util/VectorSet.h

54 	status_t Insert(const Value &value, bool replace = true);
56 	int32 Remove(const Value &value);
70 	Iterator Find(const Value &value);
71 	ConstIterator Find(const Value &value) const;
72 	Iterator FindClose(const Value &value, bool less);
73 	ConstIterator FindClose(const Value &value, bool less) const;
76 	int32 _FindInsertionIndex(const Value &value, bool &exists) const;
111 /*!	\brief Inserts a copy of the the supplied value.
113 	If an element with the supplied value is already in the set, the
118 	\param value The value to be inserted.
119 	\param replace If the an element with this value does already exist and
128 _VECTOR_SET_CLASS_NAME::Insert(const Value &value, bool replace)
131 	int32 index = _FindInsertionIndex(value, exists);
134 			fElements[index] = value;
137 	return fElements.Insert(value, index);
141 /*!	\brief Removes the element with the supplied value.
142 	\param value The value of the element to be removed.
144 			contained an element with the value, \c 0 otherwise.
148 _VECTOR_SET_CLASS_NAME::Remove(const Value &value)
151 	int32 index = _FindInsertionIndex(value, exists);
274 	Null() is used as a return value, if something went wrong. It must
290 	Null() is used as a return value, if something went wrong. It must
305 		   specified value.
306 	\param value The value of the element to be found.
308 			set doesn't contain any element with the given value.
312 _VECTOR_SET_CLASS_NAME::Find(const Value &value)
315 	int32 index = _FindInsertionIndex(value, exists);
323 		   specified value.
324 	\param value The value of the element to be found.
326 			set doesn't contain any element with the given value.
330 _VECTOR_SET_CLASS_NAME::Find(const Value &value) const
333 	int32 index = _FindInsertionIndex(value, exists);
340 /*!	\brief Returns an iterator referring to the element with a value closest
343 	If the set contains an element with the specified value, an iterator
348 	value than the specified one, End() is returned. Similarly, when \a less
357 	\param value The value of the element to be found.
359 			set doesn't contain any element with the given value or a close
364 _VECTOR_SET_CLASS_NAME::FindClose(const Value &value, bool less)
367 	int32 index = _FindInsertionIndex(value, exists);
369 	// an element with a greater value or to End(). So, no special handling
373 	// An element with a smaller value is desired. The previous one (if any)
381 /*!	\brief Returns an iterator referring to the element with a value closest
384 	If the set contains an element with the specified value, an iterator
389 	value than the specified one, End() is returned. Similarly, when \a less
398 	\param value The value of the element to be found.
400 			set doesn't contain any element with the given value or a close
405 _VECTOR_SET_CLASS_NAME::FindClose(const Value &value, bool less) const
408 	int32 index = _FindInsertionIndex(value, exists);
410 	// an element with a greater value or to End(). So, no special handling
414 	// An element with a smaller value is desired. The previous one (if any)
422 /*!	\brief Finds the index at which the element with the supplied value is
424 	\param value The value.
426 		   element with that value.
427 	\return The index at which the element with the supplied value is
432 _VECTOR_SET_CLASS_NAME::_FindInsertionIndex(const Value &value,
440 		int cmp = fCompare(fElements[mid], value);
446 	exists = (lower < Count() && fCompare(value, fElements[lower]) == 0);