reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
41 Node(T &&V) : V(std::move(V)) {} 42 Node(const T &V) : V(V) {} 44 T V; 78 using value_type = T; 79 using pointer = T *; 80 using reference = T &; 81 using const_pointer = const T *; 82 using const_reference = const T &; 89 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, 97 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase, 101 using value_type = ValueT; 102 using pointer = ValueT *; 103 using reference = ValueT &; 112 IteratorImpl(const IteratorImpl<OtherValueT, OtherIteratorBase> &X, 131 using iterator = IteratorImpl<T, typename list_type::iterator>; 133 IteratorImpl<T, typename list_type::reverse_iterator>; 135 IteratorImpl<const T, typename list_type::const_iterator>; 137 IteratorImpl<const T, typename list_type::const_reverse_iterator>; 182 T &back() { return List.back().V; } 183 T &front() { return List.front().V; } 184 const T &back() const { return List.back().V; } 185 const T &front() const { return List.front().V; } 216 void push_back(T &&V) { insert(end(), std::move(V)); } 217 void push_front(T &&V) { insert(begin(), std::move(V)); } 218 void push_back(const T &V) { insert(end(), V); } 219 void push_front(const T &V) { insert(begin(), V); }include/llvm/ADT/iterator.h
68 : public std::iterator<IteratorCategoryT, T, DifferenceTypeT, PointerT,
unittests/ADT/BumpPtrListTest.cpp37 EmplaceOnly(EmplaceOnly &&X) = delete; 38 EmplaceOnly(const EmplaceOnly &X) = delete; 39 EmplaceOnly &operator=(EmplaceOnly &&X) = delete; 39 EmplaceOnly &operator=(EmplaceOnly &&X) = delete; 40 EmplaceOnly &operator=(const EmplaceOnly &X) = delete; 40 EmplaceOnly &operator=(const EmplaceOnly &X) = delete;usr/include/c++/7.4.0/bits/stl_iterator_base_types.h
123 typedef _Tp value_type;