| /system/chre/util/include/chre/util/ |
| array_queue_impl.h | 28 template<typename ElementType, size_t kCapacity>
29 ArrayQueue<ElementType, kCapacity>::~ArrayQueue() {
35 template<typename ElementType, size_t kCapacity>
36 bool ArrayQueue<ElementType, kCapacity>::empty() const {
40 template<typename ElementType, size_t kCapacity>
41 bool ArrayQueue<ElementType, kCapacity>::full() const {
42 return (mSize == kCapacity);
45 template<typename ElementType, size_t kCapacity>
46 size_t ArrayQueue<ElementType, kCapacity>::size() const {
50 template<typename ElementType, size_t kCapacity>
[all...] |
| fixed_size_vector_impl.h | 27 template<typename ElementType, size_t kCapacity>
28 FixedSizeVector<ElementType, kCapacity>::~FixedSizeVector() {
32 template<typename ElementType, size_t kCapacity>
33 ElementType& FixedSizeVector<ElementType, kCapacity>::back() {
38 template<typename ElementType, size_t kCapacity>
39 const ElementType& FixedSizeVector<ElementType, kCapacity>::back() const {
44 template<typename ElementType, size_t kCapacity>
45 ElementType& FixedSizeVector<ElementType, kCapacity>::front() {
50 template<typename ElementType, size_t kCapacity>
51 const ElementType& FixedSizeVector<ElementType, kCapacity>::front() const
[all...] |
| fixed_size_vector.h | 26 template<typename ElementType, size_t kCapacity>
161 * that is greater than kCapacity. This will result in an assertion failure
162 * and a resize to kCapacity if assertions are disabled. All iterators and
178 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
179 typename FixedSizeVector<ElementType, kCapacity>::const_iterator begin() const;
180 typename FixedSizeVector<ElementType, kCapacity>::const_iterator cbegin() const;
185 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
186 typename FixedSizeVector<ElementType, kCapacity>::const_iterator end() const;
187 typename FixedSizeVector<ElementType, kCapacity>::const_iterator cend() const;
193 alignof(ElementType)>::type mData[kCapacity];
[all...] |
| array_queue.h | 32 template<typename ElementType, size_t kCapacity>
184 mPointer = mBase + kCapacity;
185 } else if (mPointer == (mBase + kCapacity - 1)) {
220 typename ArrayQueue<ElementType, kCapacity>::iterator begin();
221 typename ArrayQueue<ElementType, kCapacity>::const_iterator begin() const;
222 typename ArrayQueue<ElementType, kCapacity>::const_iterator cbegin() const;
227 typename ArrayQueue<ElementType, kCapacity>::iterator end();
228 typename ArrayQueue<ElementType, kCapacity>::const_iterator end() const;
229 typename ArrayQueue<ElementType, kCapacity>::const_iterator cend() const;
237 alignof(ElementType)>::type mData[kCapacity];
[all...] |
| fixed_size_blocking_queue_impl.h | 82 template<typename ElementType, size_t kCapacity>
83 ElementType& FixedSizeBlockingQueue<ElementType, kCapacity>::operator[](
89 template<typename ElementType, size_t kCapacity>
90 const ElementType& FixedSizeBlockingQueue<ElementType, kCapacity>::operator[](
|
| /art/libartbase/base/ |
| bit_string.h | 149 static constexpr size_t kCapacity = arraysize(kBitSizeAtPosition); // MaxBitstringLen above.
155 while (idx < position && idx < kCapacity) {
167 DCHECK_GE(kCapacity, position);
174 if (position >= kCapacity) {
183 DCHECK_LT(idx, kCapacity);
194 DCHECK_LT(idx, kCapacity);
210 for (i = kCapacity - 1u; ; --i) {
222 return kCapacity - num_trailing_zeros;
232 return GetBitLengthTotalAtPosition(kCapacity);
256 DCHECK_GE(kCapacity, end)
[all...] |
| bit_string_test.cc | 24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity;
48 CHECK_GE(BitString::kCapacity, values.size());
69 template <size_t kCount = BitString::kCapacity>
92 ASSERT_LE(3u, BitString::kCapacity);
93 // Test will fail if kCapacity is not at least 3. Update it.
110 ASSERT_EQ(BitString::kCapacity, 3u);
120 // There should be at least "kCapacity" # of checks here, 1 for each unique position.
143 EXPECT_EQ(MaskLeastSignificant(BitString::GetBitLengthTotalAtPosition(BitString::kCapacity)),
158 ASSERT_LE(3u, BitString::kCapacity);
[all...] |
| /art/runtime/ |
| subtype_check_info_test.cc | 24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity;
48 CHECK_GE(BitString::kCapacity, values.size());
69 template <size_t kCount = BitString::kCapacity>
157 ASSERT_LE(3u, BitString::kCapacity);
209 // Test edge conditions: depth == BitString::kCapacity (No Next value).
214 /*depth*/BitString::kCapacity).GetState());
216 MakeSubtypeCheckInfo(/*path*/MakeBitStringMax<BitString::kCapacity - 1u>(),
219 /*depth*/BitString::kCapacity).GetState());
220 // Test edge conditions: depth > BitString::kCapacity (Must overflow)
[all...] |
| subtype_check_info.h | 402 return depth_ < BitString::kCapacity;
410 return idx < BitString::kCapacity;
420 return std::min(depth, BitString::kCapacity);
465 for (i = 0; i < BitString::kCapacity; ++i) {
473 for (; i < BitString::kCapacity; ++i) {
|
| subtype_check_test.cc | 24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity;
305 CreateRootedTree(BitString::kCapacity + 2u, BitString::kCapacity + 2u);
689 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity;
761 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity + 1u;
768 if (kls->Depth() > BitString::kCapacity) {
785 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity + 2u;
792 if (kls->Depth() > BitString::kCapacity) {
808 if (depth > BitString::kCapacity) {
[all...] |
| /external/icu/icu4c/source/tools/toolutil/ |
| denseranges.cpp | 30 LargestGaps(int32_t max) : maxLength(max<=kCapacity ? max : kCapacity), length(0) {}
78 static const int32_t kCapacity=15;
82 int32_t gapStarts[kCapacity];
83 int64_t gapLengths[kCapacity];
|
| /frameworks/native/libs/vr/libdvr/tests/ |
| dvr_display-test.cpp | 88 constexpr size_t kCapacity = 1;
92 direct_surface_, width, height, kFormat, kLayerCount, kUsage, kCapacity,
140 constexpr size_t kCapacity = 2;
144 direct_surface_, width, height, kFormat, kLayerCount, kUsage, kCapacity,
227 constexpr size_t kCapacity = 1;
233 direct_surface_0, width, height, kFormat, kLayerCount, kUsage, kCapacity,
240 direct_surface_1, width, height, kFormat, kLayerCount, kUsage, kCapacity,
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/rtcp_packet/ |
| transport_feedback.cc | 107 static const int kCapacity = 14;
112 for (size_t i = 0; i < kCapacity; ++i) {
124 uint16_t NumSymbols() const override { return kCapacity; }
128 vec->insert(vec->end(), &symbols_[0], &symbols_[kCapacity]);
163 TransportFeedback::StatusSymbol symbols_[kCapacity];
180 static const int kCapacity = 7;
185 for (size_t i = 0; i < kCapacity; ++i) {
197 uint16_t NumSymbols() const override { return kCapacity; }
201 vec->insert(vec->end(), &symbols_[0], &symbols_[kCapacity]);
232 TransportFeedback::StatusSymbol symbols_[kCapacity];
[all...] |
| /hardware/google/av/codec2/tests/vndk/ |
| C2BufferTest.cpp | 345 constexpr size_t kCapacity = 1024u * 1024u;
347 allocateLinear(kCapacity);
350 mapLinear(0u, kCapacity, &addr);
353 for (size_t i = 0; i < kCapacity; ++i) {
360 mapLinear(kCapacity / 3, kCapacity / 3, &addr);
362 for (size_t i = 0; i < kCapacity / 3; ++i) {
363 ASSERT_EQ((i + kCapacity / 3) % 100, addr[i]) << " at i = " << i;
368 constexpr size_t kCapacity = 1024u * 1024u;
374 kCapacity,
[all...] |
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
| biginteger.h | 133 RAPIDJSON_ASSERT(count_ + offset <= kCapacity);
235 RAPIDJSON_ASSERT(count_ < kCapacity);
280 static const size_t kCapacity = kBitCount / sizeof(Type);
283 Type digits_[kCapacity];
|
| /art/runtime/mirror/ |
| class.cc | 49 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
50 constexpr size_t BitString::kCapacity;
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen.cc | [all...] |
