Lines Matching refs:l_
160 nasty_list() : l_() {} in nasty_list()
161 explicit nasty_list(size_type n) : l_(n) {} in nasty_list()
162 nasty_list(size_type n, const value_type& value) : l_(n,value) {} in nasty_list()
164 nasty_list(Iter first, Iter last) : l_(first, last) {} in nasty_list()
166 nasty_list(std::initializer_list<value_type> il) : l_(il) {} in nasty_list()
172 nasty_list& operator=(std::initializer_list<value_type> il) { l_ = il; return *this; } in operator =()
175 void assign(Iter first, Iter last) { l_.assign(first, last); } in assign()
176 void assign(size_type n, const value_type& t) { l_.assign(n, t); } in assign()
178 void assign(std::initializer_list<value_type> il) { l_.assign(il); } in assign()
182 iterator begin() TEST_NOEXCEPT { return l_.begin(); } in begin()
183 const_iterator begin() const TEST_NOEXCEPT { return l_.begin(); } in begin()
184 iterator end() TEST_NOEXCEPT { return l_.end(); } in end()
185 const_iterator end() const TEST_NOEXCEPT { return l_.end(); } in end()
187 reverse_iterator rbegin() TEST_NOEXCEPT { return l_.rbegin(); } in rbegin()
188 const_reverse_iterator rbegin() const TEST_NOEXCEPT { return l_.rbegin(); } in rbegin()
189 reverse_iterator rend() TEST_NOEXCEPT { return l_.rend(); } in rend()
190 const_reverse_iterator rend() const TEST_NOEXCEPT { return l_.rend(); } in rend()
192 const_iterator cbegin() const TEST_NOEXCEPT { return l_.cbegin(); } in cbegin()
193 const_iterator cend() const TEST_NOEXCEPT { return l_.cend(); } in cend()
194 const_reverse_iterator crbegin() const TEST_NOEXCEPT { return l_.crbegin(); } in crbegin()
195 const_reverse_iterator crend() const TEST_NOEXCEPT { return l_.crend(); } in crend()
197 reference front() { return l_.front(); } in front()
198 const_reference front() const { return l_.front(); } in front()
199 reference back() { return l_.back(); } in back()
200 const_reference back() const { return l_.back(); } in back()
202 size_type size() const TEST_NOEXCEPT { return l_.size(); } in size()
203 size_type max_size() const TEST_NOEXCEPT { return l_.max_size(); } in max_size()
204 bool empty() const TEST_NOEXCEPT { return l_.empty(); } in empty()
206 void push_front(const value_type& x) { l_.push_front(x); } in push_front()
207 void push_back(const value_type& x) { l_.push_back(x); } in push_back()
209 void push_back(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); } in push_back()
210 void push_front(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); } in push_front()
212 void emplace_back(Args&&... args) { l_.emplace_back(std::forward<Args>(args)...); } in emplace_back()
214 void emplace_front(Args&&... args) { l_.emplace_front(std::forward<Args>(args)...); } in emplace_front()
216 void pop_front() { l_.pop_front(); } in pop_front()
217 void pop_back() { l_.pop_back(); } in pop_back()
221 { return l_.emplace(pos, std::forward<Args>(args)...); } in emplace()
224 iterator insert(const_iterator pos, const value_type& x) { return l_.insert(pos, x); } in insert()
226 …iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<valu… in insert()
228 …iterator insert(const_iterator pos, size_type n, const value_type& x) { return l_.insert(pos, n, x… in insert()
231 { return l_.insert(pos, first, last); } in insert()
234 …iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return l_.insert(pos, … in insert()
237 iterator erase(const_iterator pos) { return l_.erase(pos); } in erase()
238 iterator erase(const_iterator pos, const_iterator last) { return l_.erase(pos, last); } in erase()
240 void resize(size_type) { l_.resize(); } in resize()
241 void resize(size_type, const value_type& c) { l_.resize(c); } in resize()
249 { l_.swap(nl.l_); } in swap()
251 void clear() TEST_NOEXCEPT { l_.clear(); } in clear()
281 nested_container l_; member in nasty_list
285 bool operator==(const nasty_list<T>& x, const nasty_list<T>& y) { return x.l_ == y.l_; } in operator ==()