Lines Matching refs:item

214   unsigned Add(const T item)

219 _items[size] = item;
224 unsigned Add2(const T &item)
229 _items[size] = item;
234 unsigned AddInReserved(const T item)
238 _items[size] = item;
242 void Insert(unsigned index, const T item)
246 _items[index] = item;
250 void InsertInReserved(unsigned index, const T item)
253 _items[index] = item;
285 int FindInSorted(const T item, unsigned left, unsigned right) const
292 if (item == midVal)
294 if (item < midVal)
302 int FindInSorted2(const T &item, unsigned left, unsigned right) const
309 const int comp = item.Compare(midVal);
320 int FindInSorted(const T item) const
322 return FindInSorted(item, 0, _size);
325 int FindInSorted2(const T &item) const
327 return FindInSorted2(item, 0, _size);
330 unsigned AddToUniqueSorted(const T item)
338 if (item == midVal)
340 if (item < midVal)
345 Insert(right, item);
349 unsigned AddToUniqueSorted2(const T &item)
357 const int comp = item.Compare(midVal);
365 Insert(right, item);
513 unsigned Add(const T& item)
516 return AddInReserved(item);
519 unsigned AddInReserved(const T& item)
521 return _v.AddInReserved(new T(item));
554 void Insert(unsigned index, const T& item)
557 _v.InsertInReserved(index, new T(item));
625 int Find(const T& item) const
629 if (item == (*this)[i])
635 int FindInSorted(const T& item) const
643 const int comp = item.Compare(midVal);
654 unsigned AddToUniqueSorted(const T& item)
662 const int comp = item.Compare(midVal);
670 Insert(right, item);
675 unsigned AddToSorted(const T& item)
683 const int comp = item.Compare(midVal);
694 Insert(right, item);