HomeSort by relevance Sort by last modified time
    Searched defs:front (Results 1 - 25 of 150) sorted by null

1 2 3 4 5 6

  /art/libartbase/base/
bounded_fifo.h 57 const T& front() const { function in class:art::BoundedFifoPowerOfTwo
dchecked_vector.h 29 // DCHECK()s for the subscript operator, front(), back(), pop_back(),
131 // Element access: front(), back(). Check not empty.
132 reference front() { DCHECK(!empty()); return Base::front(); } function in class:art::dchecked_vector
133 const_reference front() const { DCHECK(!empty()); return Base::front(); } function in class:art::dchecked_vector
array_ref.h 148 reference front() { function in class:art::ArrayRef
153 const_reference front() const { function in class:art::ArrayRef
array_slice.h 88 reference front() { function in class:art::ArraySlice
93 const_reference front() const { function in class:art::ArraySlice
transform_array_ref.h 114 reference front() { return GetFunction()(base().front()); } function in class:art::TransformArrayRef
115 const_reference front() const { return GetFunction()(base().front()); } function in class:art::TransformArrayRef
  /external/eigen/unsupported/Eigen/CXX11/src/util/
EmulateArray.h 29 EIGEN_STRONG_INLINE T& front() { return values[0]; } function in class:Eigen::array
31 EIGEN_STRONG_INLINE const T& front() const { return values[0]; } function in class:Eigen::array
145 EIGEN_STRONG_INLINE T& front() { function in class:Eigen::array
150 EIGEN_STRONG_INLINE const T& front() const { function in class:Eigen::array
  /external/icu/icu4c/source/layoutex/
LXUtilities.cpp 79 le_int32 front, back; local
81 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) {
82 le_int32 swap = array[front];
84 array[front] = array[back];
91 le_int32 front, back; local
93 for (front = 0, back = length - 1; front < back; front += 1, back -= 1)
    [all...]
  /external/libchrome/base/memory/
ref_counted_memory.cc 18 (memcmp(front(), other->front(), size()) == 0);
25 const unsigned char* RefCountedStaticMemory::front() const { function in class:base::RefCountedStaticMemory
53 const unsigned char* RefCountedBytes::front() const { function in class:base::RefCountedBytes
54 // STL will assert if we do front() on an empty vector, but calling code
56 return size() ? &data_.front() : nullptr;
77 const unsigned char* RefCountedString::front() const { function in class:base::RefCountedString
98 const unsigned char* RefCountedSharedMemory::front() const { function in class:base::RefCountedSharedMemory
114 const unsigned char* RefCountedSharedMemoryMapping::front() const { function in class:base::RefCountedSharedMemoryMapping
ref_counted_memory.h 32 virtual const unsigned char* front() const = 0;
40 // Handy method to simplify calling front() with a reinterpret_cast.
42 return reinterpret_cast<const T*>(front());
61 const unsigned char* front() const override;
96 const unsigned char* front() const override;
102 // Non-const versions of front() and front_as() that are simply shorthand for
104 unsigned char* front() { return data_.data(); } function in class:base::RefCountedBytes
107 return reinterpret_cast<T*>(front());
130 const unsigned char* front() const override;
153 const unsigned char* front() const override
    [all...]
  /external/libcxxabi/src/demangle/
StringView.h 52 char front() const { function in class:__anon27995::StringView
  /external/mesa3d/src/mesa/drivers/dri/nouveau/
nv04_state_raster.c 128 int front = ctx->Polygon.FrontFace; local
145 nv04->ctrl[0] |= (cull == GL_FRONT) ^ (front == GL_CCW) ?
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
TinyPtrVector.h 91 EltTy front() const { function in class:llvm::TinyPtrVector
95 return Val.template get<VecTy*>()->front();
ArrayRef.h 91 /// front - Get the first element.
92 const T &front() const { function in class:llvm::ArrayRef
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
SetVector.h 123 const T &front() const { function in class:llvm::SetVector
124 assert(!empty() && "Cannot call front() on empty SetVector!");
125 return vector_.front();
  /external/tensorflow/tensorflow/core/grappler/utils/
topological_sort.cc 63 int front = 0; local
80 while (front != back) {
81 int ready_node = (*ready_nodes)[front];
89 ++front;
  /frameworks/av/media/libstagefright/webm/
LinkedBlockingQueue.h 32 T front(bool remove) { function in class:android::LinkedBlockingQueue
64 return front(false);
68 return front(true);
  /cts/apps/CtsVerifier/jni/audio_loopback/audio_utils/
fifo.c 65 // Return the difference between two indices: rear - front, where 0 <= difference <= mFrameCount.
67 int32_t front)
69 int32_t diff = rear - front;
72 int32_t genDiff = (rear & mask) - (front & mask);
85 int32_t front = android_atomic_acquire_load(&fifo->mFront); local
87 size_t availToWrite = fifo->mFrameCount - audio_utils_fifo_diff(fifo, rear, front);
113 int32_t front = fifo->mFront; local
114 size_t availToRead = audio_utils_fifo_diff(fifo, rear, front);
118 front &= fifo->mFrameCountP2 - 1;
119 size_t part1 = fifo->mFrameCount - front;
    [all...]
  /device/google/cuttlefish_common/guest/hals/hwcomposer/vsoc/
stats_keeper.cpp 130 raw_composition_data_.front().time_point()) {
131 const CompositionData& front = raw_composition_data_.front(); local
133 num_prepare_calls_ -= front.num_prepare_calls();
135 num_layers_ -= front.num_layers();
136 num_hwcomposited_layers_ -= front.num_hwcomposited_layers();
138 Nanoseconds(prepare_call_total_time_ - front.prepare_time());
140 Nanoseconds(set_call_total_time_ - front.set_calls_time());
142 MultisetDeleteOne(&prepare_calls_per_set_calls_, front.num_prepare_calls());
143 MultisetDeleteOne(&layers_per_compositions_, front.num_layers())
    [all...]
  /external/drrickorang/LoopbackApp/app/src/main/cpp/audio_utils/
fifo.c 68 // Return the difference between two indices: rear - front, where 0 <= difference <= mFrameCount.
70 int32_t front) {
71 int32_t diff = rear - front;
75 int32_t genDiff = (rear & mask) - (front & mask);
90 int32_t front = android_atomic_acquire_load(&fifo->mFront); local
92 size_t availToWrite = fifo->mFrameCount - audio_utils_fifo_diff(fifo, rear, front);
123 int32_t front = fifo->mFront; local
124 size_t availToRead = audio_utils_fifo_diff(fifo, rear, front);
129 front &= fifo->mFrameCountP2 - 1;
130 size_t part1 = fifo->mFrameCount - front;
151 int32_t front = fifo->mFront; local
    [all...]
  /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/
PipeShort.java 89 int front = mFront & (mMaxValues - 1); local
90 int read = mMaxValues - front;
97 System.arraycopy(mBuffer, front, buffer, offset, read);
99 if (front + read == mMaxValues) {
100 if ((count -= read) > front) {
101 count = front;
  /external/parameter-framework/asio-1.10.6/include/asio/detail/
op_queue.hpp 47 static Operation*& front(op_queue<Operation>& q) function in class:asio::detail::op_queue_access
81 // Get the operation at the front of the queue.
82 Operation* front() function in class:asio::detail::op_queue
87 // Pop an operation from the front of the queue.
120 if (Operation* other_front = op_queue_access::front(q))
127 op_queue_access::front(q) = 0;
141 // The front of the queue.
  /external/perfetto/src/tracing/core/
patch_list.h 87 const Patch& front() const { function in class:perfetto::PatchList
89 return list_.front();
  /external/v8/src/
detachable-vector.h 45 T& front() const { return vector_->front(); } function in class:v8::internal::DetachableVector
  /external/boringssl/src/include/openssl/
span.h 137 T &front() const { function in class:Span
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_list.h 73 Item *front() { return first_; } function in struct:__sanitizer::IntrusiveList
74 const Item *front() const { return first_; } function in struct:__sanitizer::IntrusiveList

Completed in 1371 milliseconds

1 2 3 4 5 6