Searched refs:kCapacity (Results 1 – 6 of 6) sorted by relevance
30 LargestGaps(int32_t max) : maxLength(max<=kCapacity ? max : kCapacity), length(0) {} in LargestGaps()78 static const int32_t kCapacity=15; member in __anonf6f692050111::LargestGaps82 int32_t gapStarts[kCapacity];83 int64_t gapLengths[kCapacity];
30 LargestGaps(int32_t max) : maxLength(max<=kCapacity ? max : kCapacity), length(0) {} in LargestGaps()78 static const int32_t kCapacity=15; member in __anon6effb2140111::LargestGaps82 int32_t gapStarts[kCapacity];83 int64_t gapLengths[kCapacity];
30 LargestGaps(int32_t max) : maxLength(max<=kCapacity ? max : kCapacity), length(0) {} in LargestGaps()78 static const int32_t kCapacity=15; member in __anon93ed24930111::LargestGaps82 int32_t gapStarts[kCapacity];83 int64_t gapLengths[kCapacity];
53 static constexpr size_t kCapacity = member in absl::random_internal::__anon0c3cfc510111::RandenPoolEntry71 next_ = kCapacity; in MaybeRefill()109 next_ = kCapacity; in Generate()
156 const uint32_t kCapacity = (uint32_t) 1 << 7; in TEST_F() local157 LockFreeQueue<int, kCapacity, uint8_t> myQ; in TEST_F()
232 constexpr size_t kCapacity = 63; in TEST() local234 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()235 ctrl[kCapacity] = ctrl_t::kSentinel; in TEST()239 for (size_t i = 0; i != kCapacity; ++i) { in TEST()242 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()244 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()245 ASSERT_EQ(ctrl[kCapacity], ctrl_t::kSentinel); in TEST()246 for (size_t i = 0; i < kCapacity + kGroupWidth; ++i) { in TEST()247 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()248 if (i == kCapacity) expected = ctrl_t::kSentinel; in TEST()