Lines Matching refs:l_
156 nasty_list() : l_() {}
157 explicit nasty_list(size_type n) : l_(n) {}
158 nasty_list(size_type n, const value_type& value) : l_(n,value) {}
160 nasty_list(Iter first, Iter last) : l_(first, last) {}
162 nasty_list(std::initializer_list<value_type> il) : l_(il) {}
168 nasty_list& operator=(std::initializer_list<value_type> il) { l_ = il; return *this; }
171 void assign(Iter first, Iter last) { l_.assign(first, last); }
172 void assign(size_type n, const value_type& t) { l_.assign(n, t); }
174 void assign(std::initializer_list<value_type> il) { l_.assign(il); }
178 iterator begin() _NOEXCEPT { return l_.begin(); }
179 const_iterator begin() const _NOEXCEPT { return l_.begin(); }
180 iterator end() _NOEXCEPT { return l_.end(); }
181 const_iterator end() const _NOEXCEPT { return l_.end(); }
183 reverse_iterator rbegin() _NOEXCEPT { return l_.rbegin(); }
184 const_reverse_iterator rbegin() const _NOEXCEPT { return l_.rbegin(); }
185 reverse_iterator rend() _NOEXCEPT { return l_.rend(); }
186 const_reverse_iterator rend() const _NOEXCEPT { return l_.rend(); }
188 const_iterator cbegin() const _NOEXCEPT { return l_.cbegin(); }
189 const_iterator cend() const _NOEXCEPT { return l_.cend(); }
190 const_reverse_iterator crbegin() const _NOEXCEPT { return l_.crbegin(); }
191 const_reverse_iterator crend() const _NOEXCEPT { return l_.crend(); }
193 reference front() { return l_.front(); }
194 const_reference front() const { return l_.front(); }
195 reference back() { return l_.back(); }
196 const_reference back() const { return l_.back(); }
198 size_type size() const _NOEXCEPT { return l_.size(); }
199 size_type max_size() const _NOEXCEPT { return l_.max_size(); }
200 bool empty() const _NOEXCEPT { return l_.empty(); }
202 void push_front(const value_type& x) { l_.push_front(x); }
203 void push_back(const value_type& x) { l_.push_back(x); }
205 void push_back(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
206 void push_front(value_type&& x) { l_.push_back(std::forward<value_type&&>(x)); }
209 void emplace_back(Args&&... args) { l_.emplace_back(std::forward<Args>(args)...); }
211 void emplace_front(Args&&... args) { l_.emplace_front(std::forward<Args>(args)...); }
214 void pop_front() { l_.pop_front(); }
215 void pop_back() { l_.pop_back(); }
220 { return l_.emplace(pos, std::forward<Args>(args)...); }
224 iterator insert(const_iterator pos, const value_type& x) { return l_.insert(pos, x); }
226 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x)); }
228 iterator insert(const_iterator pos, size_type n, const value_type& x) { return l_.insert(pos, n, x); }
231 { return l_.insert(pos, first, last); }
234 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return l_.insert(pos, il); }
237 iterator erase(const_iterator pos) { return l_.erase(pos); }
238 iterator erase(const_iterator pos, const_iterator last) { return l_.erase(pos, last); }
240 void resize(size_type sz) { l_.resize(); }
241 void resize(size_type sz, const value_type& c) { l_.resize(c); }
244 { l_.swap(nl.l_); }
246 void clear() _NOEXCEPT { l_.clear(); }
276 nested_container l_;
280 bool operator==(const nasty_list<T>& x, const nasty_list<T>& y) { return x.l_ == y.l_; }
