Lines Matching refs:v_
47 reference operator[](size_t index) { return v_[index]; }
48 const_reference operator[](size_t index) const { return v_[index]; }
50 bool empty() const { return v_.empty(); }
51 size_t size() const { return v_.size(); }
53 reverse_iterator rbegin() { return v_.rbegin(); }
54 const_reverse_iterator rbegin() const { return v_.rbegin(); }
55 reverse_iterator rend() { return v_.rend(); }
56 const_reverse_iterator rend() const { return v_.rend(); }
58 iterator begin() { return v_.begin(); }
59 const_iterator begin() const { return v_.begin(); }
60 iterator end() { return v_.end(); }
61 const_iterator end() const { return v_.end(); }
63 const_reference front() const { return v_.front(); }
64 reference front() { return v_.front(); }
65 const_reference back() const { return v_.back(); }
66 reference back() { return v_.back(); }
68 void push_back(T* elem) { v_.push_back(elem); }
69 void push_back(std::unique_ptr<T> elem) { v_.push_back(elem.release()); }
73 delete v_.back();
74 v_.pop_back();
77 std::vector<T*>& get() { return v_; }
78 const std::vector<T*>& get() const { return v_; }
79 void swap(std::vector<T*>& other) { v_.swap(other); }
80 void swap(ScopedVector<T>& other) { v_.swap(other.v_); }
82 out->swap(v_);
83 v_.clear();
86 void reserve(size_t capacity) { v_.reserve(capacity); }
90 if (v_.size() > new_size) {
91 for (auto it = v_.begin() + new_size; it != v_.end(); ++it)
94 v_.resize(new_size);
99 v_.assign(begin, end);
105 v_.clear();
109 void weak_clear() { v_.clear(); }
113 return v_.insert(position, x);
117 return v_.insert(position, x.release());
123 v_.insert(position, first, last);
128 return v_.erase(position);
134 return v_.erase(first, last);
139 return v_.erase(position);
144 return v_.erase(first, last);
148 std::vector<T*> v_;
