Home
last modified time | relevance | path

Searched refs:kTestSize (Results 1 – 3 of 3) sorted by relevance

/external/libchrome/base/memory/
Dshared_memory_unittest.cc482 const uint32_t kTestSize = 1 << 16; in TEST() local
486 options.size = kTestSize; in TEST()
516 const uint32_t kTestSize = 1 << 8; in TEST() local
520 options.size = kTestSize; in TEST()
538 const uint32_t kTestSize = 1 << 8; in TEST() local
542 options.size = kTestSize; in TEST()
/external/libtextclassifier/util/hash/
Dfarmhash.cc1528 static const int kTestSize = 300; variable
3086 for ( ; i < kTestSize - 1; i++) { in RunTest()
3124 for ( ; i < kTestSize - 1; i++) { in main()
3148 static const int kTestSize = 300; variable
3980 for ( ; i < kTestSize - 1; i++) { in RunTest()
4016 for ( ; i < kTestSize - 1; i++) { in main()
4040 static const int kTestSize = 300; variable
5235 for ( ; i < kTestSize - 1; i++) { in RunTest()
5272 for ( ; i < kTestSize - 1; i++) { in main()
5296 static const int kTestSize = 300; variable
[all …]
/external/protobuf/src/google/protobuf/
Dmap_test.cc322 const int kTestSize = 250000; in TEST_P() local
327 while (map.size() < kTestSize) { in TEST_P()
341 GOOGLE_CHECK_EQ(kTestSize % kChunkSize, 0); in TEST_P()
352 if (times.size() < .99 * kTestSize / kChunkSize) { in TEST_P()
370 const int kTestSize = 1024; // must be a power of 2 in TEST_P() local
372 for (int i = 0; s.size() < kTestSize; i++) { in TEST_P()
373 if ((map_.hash_function()(i) & (kTestSize - 1)) < 3) { in TEST_P()