Home
last modified time | relevance | path

Searched refs:kCount (Results 1 – 25 of 108) sorted by relevance

12345

/external/libchrome/base/containers/
Did_map_unittest.cc107 const int kCount = 5; in TEST() local
108 TestObject obj[kCount]; in TEST()
110 for (int i = 0; i < kCount; i++) in TEST()
114 int32_t ids_in_iteration_order[kCount]; in TEST()
115 const TestObject* objs_in_iteration_order[kCount]; in TEST()
217 const int kCount = 5; in TEST() local
218 TestObject obj[kCount]; in TEST()
220 for (int i = 0; i < kCount; i++) in TEST()
224 int32_t ids_in_iteration_order[kCount]; in TEST()
225 const TestObject* objs_in_iteration_order[kCount]; in TEST()
[all …]
/external/grpc-grpc/src/cpp/ext/filters/census/
Dmeasures.cc40 constexpr char kCount[] = "1"; variable
80 "Number of messages sent per RPC", kCount); in RpcClientSentMessagesPerRpc()
87 "Number of messages received per RPC", kCount); in RpcClientReceivedMessagesPerRpc()
118 "Number of messages sent per RPC", kCount); in RpcServerSentMessagesPerRpc()
125 "Number of messages received per RPC", kCount); in RpcServerReceivedMessagesPerRpc()
/external/rust/crates/grpcio-sys/grpc/src/cpp/ext/filters/census/
Dmeasures.cc40 constexpr char kCount[] = "1"; variable
80 "Number of messages sent per RPC", kCount); in RpcClientSentMessagesPerRpc()
87 "Number of messages received per RPC", kCount); in RpcClientReceivedMessagesPerRpc()
118 "Number of messages sent per RPC", kCount); in RpcServerSentMessagesPerRpc()
125 "Number of messages received per RPC", kCount); in RpcServerReceivedMessagesPerRpc()
/external/skqp/include/private/
DSkTemplates.h152 if (fCount > kCount) { in reset()
158 if (count > kCount) { in reset()
204 static const int kCount = kCountRequested * sizeof(T) > kMaxBytes variable
208 static const int kCount = kCountRequested;
214 char fStorage[kCount * sizeof(T)];
269 if (count > kCount) { in SkAutoSTMalloc()
294 if (count > kCount) { in reset()
324 if (count > kCount) { in realloc()
327 memcpy(fPtr, fTStorage, kCount * sizeof(T)); in realloc()
347 static const size_t kCount = kCountRequested * sizeof(T) > kMaxBytes variable
[all …]
/external/skia/include/private/
DSkTemplates.h165 if (fCount > kCount) { in reset()
171 if (count > kCount) { in reset()
222 static const int kCount = kCountRequested * sizeof(T) > kMaxBytes variable
226 static const int kCount = kCountRequested;
232 char fStorage[kCount * sizeof(T)];
298 if (count > kCount) { in SkAutoSTMalloc()
323 if (count > kCount) { in reset()
357 if (count > kCount) { in realloc()
360 memcpy((void*)fPtr, fTStorage, kCount * sizeof(T)); in realloc()
380 static const size_t kCount = kCountRequested * sizeof(T) > kMaxBytes variable
[all …]
/external/tensorflow/tensorflow/core/lib/random/
Dsimple_philox_test.cc73 const int kCount = 1000; in TEST() local
81 for (int i = 0; i < kCount; ++i) { in TEST()
91 EXPECT_EQ(kCount, first.size()); in TEST()
92 EXPECT_EQ(2 * kCount, all.size()); in TEST()
/external/angle/third_party/abseil-cpp/absl/random/
Dbeta_distribution_test.cc69 constexpr int kCount = 1000; in TYPED_TEST() local
115 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
152 constexpr int kCount = 1000; in TYPED_TEST() local
176 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
184 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
202 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
217 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
227 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
236 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/tensorflow/tensorflow/core/kernels/data/experimental/
Drandom_dataset_op_test.cc27 constexpr int kCount = 10; variable
114 /*expected_outputs=*/GenerateExpectedData(42, 42, kCount)}, in GetNextTestCases()
116 /*expected_outputs=*/GenerateExpectedData(1000, 42, kCount)}, in GetNextTestCases()
118 /*expected_outputs=*/GenerateExpectedData(42, 1000, kCount)}}; in GetNextTestCases()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/
Dbeta_distribution_test.cc61 constexpr int kCount = 1000; in TYPED_TEST() local
110 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
169 constexpr int kCount = 1000; in TYPED_TEST() local
193 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
201 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
219 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
234 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
244 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
253 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/libtextclassifier/abseil-cpp/absl/random/
Dbeta_distribution_test.cc61 constexpr int kCount = 1000; in TYPED_TEST() local
110 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
169 constexpr int kCount = 1000; in TYPED_TEST() local
193 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
201 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
219 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
234 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
244 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
253 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/abseil-cpp/absl/random/
Dbeta_distribution_test.cc60 constexpr int kCount = 1000; in TYPED_TEST() local
109 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
164 constexpr int kCount = 1000; in TYPED_TEST() local
188 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
196 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
214 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
229 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
239 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
248 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/webrtc/third_party/abseil-cpp/absl/random/
Dbeta_distribution_test.cc60 constexpr int kCount = 1000; in TYPED_TEST() local
109 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
164 constexpr int kCount = 1000; in TYPED_TEST() local
188 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
196 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
214 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
229 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
239 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
248 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/openscreen/third_party/abseil/src/absl/random/
Dbeta_distribution_test.cc61 constexpr int kCount = 1000; in TYPED_TEST() local
110 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
169 constexpr int kCount = 1000; in TYPED_TEST() local
193 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
201 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
219 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
234 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
244 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
253 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
/external/webrtc/api/video_codecs/
Dvp8_frame_config.cc56 case Buffer::kCount: in References()
71 case Buffer::kCount: in Updates()
/external/skqp/include/effects/
DSkColorMatrix.h16 kCount = 20 enumerator
18 SkScalar fMat[kCount];
/external/boringssl/src/crypto/stack/
Dstack_test.cc202 static const int kCount = 100000; in TEST() local
203 for (int i = 0; i < kCount; i++) { in TEST()
355 static const size_t kCount = 100; in TEST() local
356 for (size_t i = 0; i < kCount; i++) { in TEST()
358 for (size_t j = i; j <= kCount; j++) { in TEST()
374 for (size_t k = j; k < kCount; k++) { in TEST()
/external/rust/crates/quiche/deps/boringssl/src/crypto/stack/
Dstack_test.cc202 static const int kCount = 100000; in TEST() local
203 for (int i = 0; i < kCount; i++) { in TEST()
355 static const size_t kCount = 100; in TEST() local
356 for (size_t i = 0; i < kCount; i++) { in TEST()
358 for (size_t j = i; j <= kCount; j++) { in TEST()
374 for (size_t k = j; k < kCount; k++) { in TEST()
/external/pdfium/core/fxge/
Dfx_ge_linux.cpp26 kCount enumerator
29 const char* const g_LinuxJpFontList[][JpFontFamily::kCount] = {
/external/angle/third_party/abseil-cpp/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/openscreen/third_party/abseil/src/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/webrtc/third_party/abseil-cpp/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/libtextclassifier/abseil-cpp/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/abseil-cpp/absl/random/internal/
Dranden_engine_test.cc639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/external/libchrome/base/task/sequence_manager/
Dtask_queue_selector_logic.h30 kCount = 9, enumerator

12345