| /external/eigen/Eigen/src/StlSupport/ |
| StdDeque.h | 94 void push_front(const value_type& x) function in class:std::deque
95 { deque_base::push_front(x); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| queue.h | 45 * atomic access. push_front() and pop_front() must not be called
83 push_front(const _Tp& __t) function in class:__gnu_parallel::_RestrictedBoundedConcurrentQueue
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| queue.h | 45 * atomic access. push_front() and pop_front() must not be called
83 push_front(const _Tp& __t) function in class:__gnu_parallel::_RestrictedBoundedConcurrentQueue
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_list.h | 22 // Intrusive singly-linked list with size(), push_back(), push_front()
53 void push_front(Item *x) { function in struct:__sanitizer::IntrusiveList
|
| /bionic/linker/ |
| linked_list.h | 93 void push_front(T* const element) { function in class:LinkedList
|
| /external/skia/src/core/ |
| SkDeque.cpp | 69 void* SkDeque::push_front() { function in class:SkDeque
|
| /external/skqp/src/core/ |
| SkDeque.cpp | 69 void* SkDeque::push_front() { function in class:SkDeque
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| shape_util.h | 66 // push_front is O(n^2), but shapes don't usually have a ton of dimensions.
67 void push_front(int64 value) { indices_.insert(indices_.begin(), value); } function in class:xla::ShapeIndex
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 35 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
145 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| AllocatorList.h | 218 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
220 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
