Home
last modified time | relevance | path

Searched refs:kMaxCapacity (Results 1 - 24 of 24) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_navigator_test.cc91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity *
[all...]
H A Dcord_rep_btree_test.cc190 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
191 assert(size <= CordRepBtree::kMaxCapacity); in MakeLeaf()
373 for (size_t i = 1; i < CordRepBtree::kMaxCapacity; ++i) { in TEST_P()
391 for (size_t i = 1; i < CordRepBtree::kMaxCapacity; ++i) { in TEST_P()
412 for (size_t i = 1; i < CordRepBtree::kMaxCapacity; ++i) { in TEST_P()
459 constexpr size_t max_cap = CordRepBtree::kMaxCapacity; in TEST_P()
489 constexpr size_t max_cap = CordRepBtree::kMaxCapacity; in TEST_P()
520 constexpr size_t max_cap = CordRepBtree::kMaxCapacity; in TEST_P()
550 constexpr size_t max_cap = CordRepBtree::kMaxCapacity; in TEST_P()
614 CordRepBtree* left = MakeLeaf(CordRepBtree::kMaxCapacity in TEST_P()
[all...]
H A Dcord_rep_btree.h81 static constexpr size_t kMaxCapacity = 6; member in absl::cord_internal::CordRepBtree
245 // `kMaxCapacity` contains the maximum capacity of a btree node.
246 // For now, `capacity` and `kMaxCapacity` return the same value, but this may
250 size_t capacity() const { return kMaxCapacity; } in capacity()
510 CordRep* edges_[kMaxCapacity];
670 // total size for the kMaxCapacity = 6 case. I.e., we can branch (switch) on in AlignBegin()
674 ABSL_INTERNAL_ASSUME(new_end <= kMaxCapacity); in AlignBegin()
692 ABSL_INTERNAL_ASSUME(new_end <= kMaxCapacity); in AlignEnd()
H A Dcord_rep_btree_reader_test.cc52 const size_t cap = CordRepBtree::kMaxCapacity; in TEST()
84 const size_t cap = CordRepBtree::kMaxCapacity; in TEST()
127 const size_t cap = CordRepBtree::kMaxCapacity; in TEST()
239 const size_t cap = CordRepBtree::kMaxCapacity; in TEST()
H A Dcordz_info_statistics_test.cc442 ASSERT_THAT(CordRepBtree::kMaxCapacity, Ge(3)); in TEST()
452 size_t flat3_count = CordRepBtree::kMaxCapacity - 3; in TEST()
481 const size_t flat3_count = CordRepBtree::kMaxCapacity - 3; in TEST()
H A Dcord_rep_btree.cc35 constexpr size_t CordRepBtree::kMaxCapacity; // NOLINT: needed for c++ < c++17 member in absl::cord_internal::CordRepBtree
432 if (size() >= kMaxCapacity) return {New(edge), kPopped}; in AddEdge()
613 if (merge_node->size() + src->size() <= kMaxCapacity) { in Merge()
H A Dcord_rep_ring.h95 static constexpr size_t kMaxCapacity = (std::numeric_limits<uint32_t>::max)(); member in absl::cord_internal::CordRepRing
377 // The maximum capacity of a CordRepRing is capped at kMaxCapacity.
378 // Throws `std::length_error` if `capacity + extra' exceeds kMaxCapacity.
H A Dcord_rep_ring.cc46 // Verifies that n + extra <= kMaxCapacity: throws std::length_error otherwise.
48 if (ABSL_PREDICT_FALSE(extra > CordRepRing::kMaxCapacity - n)) { in CheckCapacity()
132 constexpr size_t CordRepRing::kMaxCapacity; // NOLINT: needed for c++11 member in absl::cord_internal::CordRepRing
/third_party/node/deps/v8/src/objects/
H A Dordered-hash-table.h438 DCHECK_LE(capacity, kMaxCapacity); in SizeFor()
453 DCHECK_LE(capacity, kMaxCapacity); in Capacity()
489 static const int kMaxCapacity = 254; member in v8::internal::SmallOrderedHashTable
490 STATIC_ASSERT(kMaxCapacity < kNotFound);
500 // kMaxCapacity, but since the kMaxCapacity is always less than 256,
502 // by changing the new capacity to be kMaxCapacity in
H A Dordered-hash-table.cc922 DCHECK_GE(kMaxCapacity, new_capacity); in Rehash()
1002 new_capacity = kMaxCapacity; in Grow()
1006 if (new_capacity > kMaxCapacity) { in Grow()
1084 if (capacity < SmallTable::kMaxCapacity) { in Allocate()
H A Dhash-table.h93 // number of elements. May be more than HashTable::kMaxCapacity.
175 // FixedArray. Staying below kMaxCapacity also ensures that EntryToIndex
177 static const int kMaxCapacity = variable
H A Dhash-table-inl.h260 DCHECK_LE(capacity, kMaxCapacity); in SetCapacity()
H A Dfixed-array.h405 static const int kMaxCapacity =
H A Dobjects.cc5711 if (capacity > HashTable::kMaxCapacity) { in New()
6398 if (capacity > ObjectHashTable::kMaxCapacity) { in Put()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/
H A Dfloat_conversion.cc70 static constexpr size_t kMaxCapacity = kStep * kNumSteps; member in absl::str_format_internal::__anon19387::StackArray
73 assert(capacity <= kMaxCapacity); in RunWithCapacity()
143 static_cast<int>(StackArray::kMaxCapacity) >= in RunConversion()
251 static_assert(StackArray::kMaxCapacity >= in RunConversion()
/third_party/icu/icu4c/source/common/
H A Dunistr.cpp356 const int32_t kMaxCapacity = 0x7ffffff5; member
360 if(growSize <= (kMaxCapacity - newLength)) { in getGrowCapacity()
363 return kMaxCapacity; in getGrowCapacity()
375 if(capacity <= kMaxCapacity) { in allocate()
1937 if(minCapacity <= (kMaxCapacity - oldLength) && in getAppendBuffer()
1938 desiredCapacityHint <= (kMaxCapacity - oldLength) && in getAppendBuffer()
/third_party/node/deps/icu-small/source/common/
H A Dunistr.cpp356 const int32_t kMaxCapacity = 0x7ffffff5; member
360 if(growSize <= (kMaxCapacity - newLength)) { in getGrowCapacity()
363 return kMaxCapacity; in getGrowCapacity()
375 if(capacity <= kMaxCapacity) { in allocate()
1979 if(minCapacity <= (kMaxCapacity - oldLength) && in getAppendBuffer()
1980 desiredCapacityHint <= (kMaxCapacity - oldLength) && in getAppendBuffer()
/third_party/skia/third_party/externals/icu/source/common/
H A Dunistr.cpp355 const int32_t kMaxCapacity = 0x7ffffff5; member
359 if(growSize <= (kMaxCapacity - newLength)) { in getGrowCapacity()
362 return kMaxCapacity; in getGrowCapacity()
374 if(capacity <= kMaxCapacity) { in allocate()
1936 if(minCapacity <= (kMaxCapacity - oldLength) && in getAppendBuffer()
1937 desiredCapacityHint <= (kMaxCapacity - oldLength) && in getAppendBuffer()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dcord_ring_test.cc545 CordRepRing::Create(flat, CordRepRing::kMaxCapacity); in TEST_F()
551 EXPECT_DEATH(CordRepRing::Create(flat, CordRepRing::kMaxCapacity), ".*"); in TEST_F()
/third_party/node/deps/v8/src/heap/
H A Dfactory-base.cc960 if (capacity < 0 || capacity > WeakArrayList::kMaxCapacity) { in AllocateRawWeakArrayList()
H A Dfactory.cc557 capacity = std::min({capacity, T::kMaxCapacity}); in AllocateSmallOrderedHashTable()
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc1335 CHECK_LE(capacity, kMaxCapacity); in SmallOrderedHashTableVerify()
/third_party/node/deps/v8/src/codegen/
H A Dcode-stub-assembler.cc3619 IntPtrConstant(NameDictionary::kMaxCapacity)));
/third_party/rust/crates/bindgen/bindgen-tests/tests/
H A Dstylo.hpp[all...]

Completed in 88 milliseconds