| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| simple_ilist.h | 141 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
142 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
147 /// Insert a node at the back; never copies.
153 /// Remove the node at the back; never deletes.
307 // Sort the sublists and merge back together.
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| AllocatorList.h | 183 T &back() { return List.back().V; } function in class:llvm::AllocatorList
185 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
|
| ArrayRef.h | 157 /// back - Get the last element.
158 const T &back() const { function in class:llvm::ArrayRef
343 /// back - Get the last element.
344 T &back() const { function in class:llvm::ArrayRef
|
| MapVector.h | 75 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
151 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
| TinyPtrVector.h | 227 EltTy back() const { function in class:llvm::TinyPtrVector
231 return Val.template get<VecTy*>()->back();
282 // benefit to collapsing back to a pointer
|
| simple_ilist.h | 141 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
142 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
147 /// Insert a node at the back; never copies.
153 /// Remove the node at the back; never deletes.
307 // Sort the sublists and merge back together.
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| AllocatorList.h | 183 T &back() { return List.back().V; } function in class:llvm::AllocatorList
185 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
|
| ArrayRef.h | 157 /// back - Get the last element.
158 const T &back() const { function in class:llvm::ArrayRef
343 /// back - Get the last element.
344 T &back() const { function in class:llvm::ArrayRef
|
| MapVector.h | 75 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
151 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
| TinyPtrVector.h | 227 EltTy back() const { function in class:llvm::TinyPtrVector
231 return Val.template get<VecTy*>()->back();
282 // benefit to collapsing back to a pointer
|
| simple_ilist.h | 141 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
142 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
147 /// Insert a node at the back; never copies.
153 /// Remove the node at the back; never deletes.
307 // Sort the sublists and merge back together.
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| AllocatorList.h | 183 T &back() { return List.back().V; } function in class:llvm::AllocatorList
185 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
|
| ArrayRef.h | 157 /// back - Get the last element.
158 const T &back() const { function in class:llvm::ArrayRef
343 /// back - Get the last element.
344 T &back() const { function in class:llvm::ArrayRef
|
| MapVector.h | 75 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
151 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
| TinyPtrVector.h | 227 EltTy back() const { function in class:llvm::TinyPtrVector
231 return Val.template get<VecTy*>()->back();
282 // benefit to collapsing back to a pointer
|
| simple_ilist.h | 141 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
142 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
147 /// Insert a node at the back; never copies.
153 /// Remove the node at the back; never deletes.
307 // Sort the sublists and merge back together.
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| AllocatorList.h | 183 T &back() { return List.back().V; } function in class:llvm::AllocatorList
185 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
|
| ArrayRef.h | 157 /// back - Get the last element.
158 const T &back() const { function in class:llvm::ArrayRef
343 /// back - Get the last element.
344 T &back() const { function in class:llvm::ArrayRef
|
| MapVector.h | 75 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
151 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
| TinyPtrVector.h | 227 EltTy back() const { function in class:llvm::TinyPtrVector
231 return Val.template get<VecTy*>()->back();
282 // benefit to collapsing back to a pointer
|
| simple_ilist.h | 141 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
142 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
147 /// Insert a node at the back; never copies.
153 /// Remove the node at the back; never deletes.
307 // Sort the sublists and merge back together.
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| AllocatorList.h | 183 T &back() { return List.back().V; } function in class:llvm::AllocatorList
185 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
|
| ArrayRef.h | 157 /// back - Get the last element.
158 const T &back() const { function in class:llvm::ArrayRef
343 /// back - Get the last element.
344 T &back() const { function in class:llvm::ArrayRef
|
| MapVector.h | 75 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
76 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
151 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
| TinyPtrVector.h | 227 EltTy back() const { function in class:llvm::TinyPtrVector
231 return Val.template get<VecTy*>()->back();
282 // benefit to collapsing back to a pointer
|
