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

Lines Matching defs:_v
406   CPointerVector _v;

408   unsigned Size() const { return _v.Size(); }

409   bool IsEmpty() const { return _v.IsEmpty(); }

410   void ReserveDown() { _v.ReserveDown(); }

411   // void Reserve(unsigned newCapacity) { _v.Reserve(newCapacity); }

412   void ClearAndReserve(unsigned newCapacity) { Clear(); _v.ClearAndReserve(newCapacity); }

418     _v.ConstructReserve(size);

420       _v.AddInReserved(new T(v[i]));

426     _v.Reserve(size);

428       _v.AddInReserved(new T(v[i]));

435     _v.Reserve(Size() + size);

437       _v.AddInReserved(new T(v[i]));

441   const T& operator[](unsigned index) const { return *((T *)_v[index]); }

442         T& operator[](unsigned index)       { return *((T *)_v[index]); }

445   const T& Back() const  { return operator[](_v.Size() - 1); }

446         T& Back()        { return operator[](_v.Size() - 1); }

448   void MoveToFront(unsigned index) { _v.MoveToFront(index); }

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

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

457     _v.Add(p);

464     _v.AddInReserved(p);

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

473     _v.Insert(index, p);

479     for (unsigned i = _v.Size(); i != 0;)

480       delete (T *)_v[--i];

486     _v.ClearAndFree();

491     for (unsigned i = _v.Size(); i != 0;)

492       delete (T *)_v[--i];

493     _v.Clear();

498     unsigned size = _v.Size();

500       delete (T *)_v[i];

501     _v.DeleteFrom(index);

507       delete (T *)_v[i];

508     _v.DeleteFrontal(num);

513     delete (T *)_v[_v.Size() - 1];

514     _v.DeleteBack();

519     delete (T *)_v[index];

520     _v.Delete(index);

527       delete (T *)_v[index + i];

528     _v.Delete(index, num);

605     { _v.Sort(compare, param); }

610   void Sort() { _v.Sort(CompareObjectItems, 0); }
OpenGrok
