Lines Matching defs:v_
50 reference operator[](size_t index) { return v_[index]; }
51 const_reference operator[](size_t index) const { return v_[index]; }
53 bool empty() const { return v_.empty(); }
54 size_t size() const { return v_.size(); }
56 reverse_iterator rbegin() { return v_.rbegin(); }
57 const_reverse_iterator rbegin() const { return v_.rbegin(); }
58 reverse_iterator rend() { return v_.rend(); }
59 const_reverse_iterator rend() const { return v_.rend(); }
61 iterator begin() { return v_.begin(); }
62 const_iterator begin() const { return v_.begin(); }
63 iterator end() { return v_.end(); }
64 const_iterator end() const { return v_.end(); }
66 const_reference front() const { return v_.front(); }
67 reference front() { return v_.front(); }
68 const_reference back() const { return v_.back(); }
69 reference back() { return v_.back(); }
71 void push_back(T* elem) { v_.push_back(elem); }
72 void push_back(scoped_ptr<T> elem) { v_.push_back(elem.release()); }
76 delete v_.back();
77 v_.pop_back();
80 std::vector<T*>& get() { return v_; }
81 const std::vector<T*>& get() const { return v_; }
82 void swap(std::vector<T*>& other) { v_.swap(other); }
83 void swap(ScopedVector<T>& other) { v_.swap(other.v_); }
85 out->swap(v_);
86 v_.clear();
89 void reserve(size_t capacity) { v_.reserve(capacity); }
93 if (v_.size() > new_size)
94 STLDeleteContainerPointers(v_.begin() + new_size, v_.end());
95 v_.resize(new_size);
100 v_.assign(begin, end);
103 void clear() { STLDeleteElements(&v_); }
106 void weak_clear() { v_.clear(); }
110 return v_.insert(position, x);
114 return v_.insert(position, x.release());
120 v_.insert(position, first, last);
125 return v_.erase(position);
130 return v_.erase(first, last);
135 return v_.erase(position);
140 return v_.erase(first, last);
144 std::vector<T*> v_;
