Cross Reference: /external/lzma/CPP/Common/MyVector.h

Lines Matching refs:item
190   unsigned Add(const T item)

193     _items[_size] = item;

197   void AddInReserved(const T item)

199     _items[_size++] = item;

202   void Insert(unsigned index, const T item)

206     _items[index] = item;

236   int FindInSorted(const T item, unsigned left, unsigned right) const

242       if (item == midVal)

244       if (item < midVal)

252   int FindInSorted2(const T &item, unsigned left, unsigned right) const

258       int comp = item.Compare(midVal);

269   int FindInSorted(const T item) const

271     return FindInSorted(item, 0, _size);

274   int FindInSorted2(const T &item) const

276     return FindInSorted2(item, 0, _size);

279   unsigned AddToUniqueSorted(const T item)

286       if (item == midVal)

288       if (item < midVal)

293     Insert(right, item);

297   unsigned AddToUniqueSorted2(const T &item)

304       int comp = item.Compare(midVal);

312     Insert(right, item);

450   unsigned Add(const T& item) { return _v.Add(new T(item)); }

452   void AddInReserved(const T& item) { _v.AddInReserved(new T(item)); }

468   void Insert(unsigned index, const T& item) { _v.Insert(index, new T(item)); }

533   int Find(const T& item) const

537       if (item == (*this)[i])

543   int FindInSorted(const T& item) const

550       int comp = item.Compare(midVal);

561   unsigned AddToUniqueSorted(const T& item)

568       int comp = item.Compare(midVal);

576     Insert(right, item);

581   unsigned AddToSorted(const T& item)

588       int comp = item.Compare(midVal);

599     Insert(right, item);
OpenGrok
