Lines Matching defs:v_

45   reference operator[](size_t index) { return v_[index]; }
46 const_reference operator[](size_t index) const { return v_[index]; }
48 bool empty() const { return v_.empty(); }
49 size_t size() const { return v_.size(); }
51 reverse_iterator rbegin() { return v_.rbegin(); }
52 const_reverse_iterator rbegin() const { return v_.rbegin(); }
53 reverse_iterator rend() { return v_.rend(); }
54 const_reverse_iterator rend() const { return v_.rend(); }
56 iterator begin() { return v_.begin(); }
57 const_iterator begin() const { return v_.begin(); }
58 iterator end() { return v_.end(); }
59 const_iterator end() const { return v_.end(); }
61 const_reference front() const { return v_.front(); }
62 reference front() { return v_.front(); }
63 const_reference back() const { return v_.back(); }
64 reference back() { return v_.back(); }
66 void push_back(T* elem) { v_.push_back(elem); }
70 delete v_.back();
71 v_.pop_back();
74 std::vector<T*>& get() { return v_; }
75 const std::vector<T*>& get() const { return v_; }
76 void swap(std::vector<T*>& other) { v_.swap(other); }
77 void swap(ScopedVector<T>& other) { v_.swap(other.v_); }
79 out->swap(v_);
80 v_.clear();
83 void reserve(size_t capacity) { v_.reserve(capacity); }
87 if (v_.size() > new_size)
88 STLDeleteContainerPointers(v_.begin() + new_size, v_.end());
89 v_.resize(new_size);
94 v_.assign(begin, end);
97 void clear() { STLDeleteElements(&v_); }
100 void weak_clear() { v_.clear(); }
104 return v_.insert(position, x);
110 v_.insert(position, first, last);
115 return v_.erase(position);
120 return v_.erase(first, last);
125 return v_.erase(position);
130 return v_.erase(first, last);
134 std::vector<T*> v_;