Searched refs:maxEntries (Results 1 – 6 of 6) sorted by relevance
318 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_P() local319 for (int i = 0; i < maxEntries; i++) { in TEST_P()325 uint8_t k = maxEntries; in TEST_P()331 for (int i = 0; i < maxEntries+1; i++) { in TEST_P()338 ASSERT_EQ(found, i >= maxEntries/2); in TEST_P()341 ASSERT_EQ(maxEntries/2 + 1, numCached); in TEST_P()349 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_P() local350 for (int i = 0; i < maxEntries; i++) { in TEST_P()356 uint8_t k = maxEntries; in TEST_P()361 for (int i = 0; i < maxEntries+1; i++) { in TEST_P()[all …]
249 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_F() local250 for (int i = 0; i < maxEntries; i++) { in TEST_F()256 uint8_t k = maxEntries; in TEST_F()261 for (int i = 0; i < maxEntries+1; i++) { in TEST_F()267 ASSERT_EQ(maxEntries/2 + 1, numCached); in TEST_F()306 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_F() local307 for (int i = 0; i < maxEntries; i++) { in TEST_F()315 for (int i = 0; i < maxEntries; i++) { in TEST_F()325 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_F() local326 for (int i = 0; i < maxEntries; i++) { in TEST_F()[all …]
29 public SimpleCache(final int maxEntries) { in SimpleCache() argument30 super(maxEntries + 1, 1f, true); in SimpleCache()31 mMaxEntries = maxEntries; in SimpleCache()
120 const int maxEntries = MAX_TOTAL_SIZE / 2; in TEST_P() local121 for (int i = 0; i < maxEntries; i++) { in TEST_P()132 uint8_t k = maxEntries; in TEST_P()138 for (int i = 0; i < maxEntries+1; i++) { in TEST_P()150 ASSERT_EQ(maxEntries/2, numCached); in TEST_P()151 ASSERT_EQ(size_t((maxEntries/2)*2), sizeCached); in TEST_P()157 const int initialNumEntries = maxEntries; in TEST_P()
229 protected void truncateHistory(ContentResolver cr, int maxEntries) { in truncateHistory() argument230 if (maxEntries < 0) { in truncateHistory()237 if (maxEntries > 0) { in truncateHistory()241 " LIMIT -1 OFFSET " + String.valueOf(maxEntries) + ")"; in truncateHistory()
56423 field protected final int maxEntries;