HomeSort by relevance Sort by last modified time
    Searched refs:kNumKeys (Results 1 - 6 of 6) sorted by null

  /external/chromium_org/third_party/leveldatabase/src/issues/
issue178_test.cc 16 const int kNumKeys = 1100000;
46 for (size_t i = 0; i < kNumKeys; i++) {
53 for (size_t i = 0; i < kNumKeys; i++) {
60 for (size_t i = 0; i < kNumKeys; i++) {
67 std::string end_key = Key1(kNumKeys - 1);
81 ASSERT_EQ(kNumKeys, num_keys) << "Bad number of keys";
  /external/chromium/net/disk_cache/
stress_cache.cc 120 const int kNumKeys = 5000;
122 const int kNumKeys = 1700;
125 std::string keys[kNumKeys];
128 for (int i = 0; i < kNumKeys; i++) {
138 int key = rand() % kNumKeys;
158 key = rand() % kNumKeys;
  /external/chromium_org/net/disk_cache/
stress_cache.cc 136 // kNumKeys is meant to be enough to have about 3x or 4x iterations before
139 const int kNumKeys = 4000;
141 const int kNumKeys = 1200;
144 std::string keys[kNumKeys];
147 for (int i = 0; i < kNumKeys; i++) {
157 int key = rand() % kNumKeys;
179 key = rand() % kNumKeys;
  /system/core/libutils/tests/
LruCache_test.cpp 181 const size_t kNumKeys = 16 * 1024;
183 char* strings[kNumKeys];
185 for (size_t i = 0; i < kNumKeys; i++) {
193 int index = random() % kNumKeys;
203 size_t expectedHitCount = kNumIters * kCacheSize / kNumKeys;
208 for (size_t i = 0; i < kNumKeys; i++) {
  /external/chromium_org/chrome/browser/sync/test/integration/performance/
autofill_sync_perf_test.cc 33 static const int kNumKeys = 163;
196 AddKeys(0, kNumKeys);
201 ASSERT_EQ(kNumKeys, GetKeyCount(1));
  /external/chromium_org/third_party/leveldatabase/src/db/
db_test.cc     [all...]

Completed in 1953 milliseconds