Lines Matching refs:item
55 int Add(T item)
58 ((T *)_items)[_size] = item;
61 void Insert(int index, T item)
64 ((T *)_items)[index] = item;
82 int FindInSorted(const T& item) const
89 if (item == midValue)
91 if (item < midValue)
99 int AddToUniqueSorted(const T& item)
106 if (item == midValue)
108 if (item < midValue)
113 Insert(right, item);
191 int Add(const T& item)
192 { return CPointerVector::Add(new T(item)); }
193 void Insert(int index, const T& item)
194 { CPointerVector::Insert(index, new T(item)); }
202 int Find(const T& item) const
205 if (item == (*this)[i])
209 int FindInSorted(const T& item) const
216 if (item == midValue)
218 if (item < midValue)
225 int AddToSorted(const T& item)
232 if (item == midValue)
237 if (item < midValue)
242 Insert(right, item);