Lines Matching refs:v_
38 nasty_vector() : v_() {}
39 explicit nasty_vector(size_type n) : v_(n) {}
40 nasty_vector(size_type n, const value_type& value) : v_(n, value) {}
41 template <class InputIterator> nasty_vector(InputIterator first, InputIterator last) : v_(first, last) {}
43 nasty_vector(std::initializer_list<value_type> il) : v_(il) {}
48 void assign(InputIterator first, InputIterator last) { v_.assign(first, last); }
49 void assign(size_type n, const value_type& u) { v_.assign(n, u); }
51 void assign(std::initializer_list<value_type> il) { v_.assign(il); }
54 iterator begin() TEST_NOEXCEPT { return v_.begin(); }
55 const_iterator begin() const TEST_NOEXCEPT { return v_.begin(); }
56 iterator end() TEST_NOEXCEPT { return v_.end(); }
57 const_iterator end() const TEST_NOEXCEPT { return v_.end(); }
59 reverse_iterator rbegin() TEST_NOEXCEPT { return v_.rbegin(); }
60 const_reverse_iterator rbegin() const TEST_NOEXCEPT { return v_.rbegin(); }
61 reverse_iterator rend() TEST_NOEXCEPT { return v_.rend(); }
62 const_reverse_iterator rend() const TEST_NOEXCEPT { return v_.rend(); }
64 const_iterator cbegin() const TEST_NOEXCEPT { return v_.cbegin(); }
65 const_iterator cend() const TEST_NOEXCEPT { return v_.cend(); }
66 const_reverse_iterator crbegin() const TEST_NOEXCEPT { return v_.crbegin(); }
67 const_reverse_iterator crend() const TEST_NOEXCEPT { return v_.crend(); }
69 size_type size() const TEST_NOEXCEPT { return v_.size(); }
70 size_type max_size() const TEST_NOEXCEPT { return v_.max_size(); }
71 size_type capacity() const TEST_NOEXCEPT { return v_.capacity(); }
72 bool empty() const TEST_NOEXCEPT { return v_.empty(); }
73 void reserve(size_type n) { v_.reserve(n); };
74 void shrink_to_fit() TEST_NOEXCEPT { v_.shrink_to_fit(); }
76 reference operator[](size_type n) { return v_[n]; }
77 const_reference operator[](size_type n) const { return v_[n]; }
78 reference at(size_type n) { return v_.at(n); }
79 const_reference at(size_type n) const { return v_.at(n); }
81 reference front() { return v_.front(); }
82 const_reference front() const { return v_.front(); }
83 reference back() { return v_.back(); }
84 const_reference back() const { return v_.back(); }
86 value_type* data() TEST_NOEXCEPT { return v_.data(); }
87 const value_type* data() const TEST_NOEXCEPT { return v_.data(); }
89 void push_back(const value_type& x) { v_.push_back(x); }
91 void push_back(value_type&& x) { v_.push_back(std::forward<value_type&&>(x)); }
93 void emplace_back(Args&&... args) { v_.emplace_back(std::forward<Args>(args)...); }
95 void pop_back() { v_.pop_back(); }
99 { return v_.emplace(pos, std::forward<Args>(args)...); }
102 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); }
104 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
106 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); }
109 { return v_.insert(pos, first, last); }
112 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(pos, il); }
115 iterator erase(const_iterator pos) { return v_.erase(pos); }
116 iterator erase(const_iterator first, const_iterator last) { return v_.erase(first, last); }
118 void clear() TEST_NOEXCEPT { v_.clear(); }
120 void resize(size_type sz) { v_.resize(sz); }
121 void resize(size_type sz, const value_type& c) { v_.resize(sz, c); }
129 { v_.swap(nv.v_); }
134 nested_container v_;
138 bool operator==(const nasty_vector<T>& x, const nasty_vector<T>& y) { return x.v_ == y.v_; }
