Searched refs:kTestSize (Results 1 – 3 of 3) sorted by relevance
600 const uint32_t kTestSize = 1 << 16; in TEST_P() local604 options.size = kTestSize; in TEST_P()626 const uint32_t kTestSize = 1 << 16; in TEST() local630 options.size = kTestSize; in TEST()663 const uint32_t kTestSize = 1 << 8; in TEST_P() local667 options.size = kTestSize; in TEST_P()689 const uint32_t kTestSize = 1 << 8; in TEST_P() local693 options.size = kTestSize; in TEST_P()
1524 static const int kTestSize = 300; variable3082 for ( ; i < kTestSize - 1; i++) { in RunTest()3120 for ( ; i < kTestSize - 1; i++) { in main()3144 static const int kTestSize = 300; variable3976 for ( ; i < kTestSize - 1; i++) { in RunTest()4012 for ( ; i < kTestSize - 1; i++) { in main()4036 static const int kTestSize = 300; variable5231 for ( ; i < kTestSize - 1; i++) { in RunTest()5268 for ( ; i < kTestSize - 1; i++) { in main()5292 static const int kTestSize = 300; variable[all …]
322 const int kTestSize = 250000; in TEST_P() local327 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() local372 for (int i = 0; s.size() < kTestSize; i++) { in TEST_P()373 if ((map_.hash_function()(i) & (kTestSize - 1)) < 3) { in TEST_P()