Searched refs:kDictionaryCapacity (Results 1 – 2 of 2) sorted by relevance
78 const int kDictionaryCapacity = LongStringDictionary::num_entries; in TEST() local79 const int kPartitionIndex = kDictionaryCapacity - 5; in TEST()82 ASSERT_GE(kDictionaryCapacity, 64); in TEST()109 for (int i = kPartitionIndex; i < kDictionaryCapacity; ++i) { in TEST()114 expectedDictionarySize += kDictionaryCapacity - kPartitionIndex; in TEST()124 int count[kDictionaryCapacity]; in TEST()146 bool isKeyInGoodRange = (keyNumber >= 0 && keyNumber < kDictionaryCapacity); in TEST()148 (valueNumber >= 0 && valueNumber < kDictionaryCapacity); in TEST()159 for (size_t i = 0; i < kDictionaryCapacity; ++i) { in TEST()
134 const int kDictionaryCapacity = SimpleStringDictionary::num_entries; in TEST() local135 const int kPartitionIndex = kDictionaryCapacity - 5; in TEST()138 ASSERT_GE(kDictionaryCapacity, 64); in TEST()165 for (int i = kPartitionIndex; i < kDictionaryCapacity; ++i) { in TEST()170 expectedDictionarySize += kDictionaryCapacity - kPartitionIndex; in TEST()180 int count[kDictionaryCapacity]; in TEST()203 (keyNumber >= 0 && keyNumber < kDictionaryCapacity); in TEST()205 (valueNumber >= 0 && valueNumber < kDictionaryCapacity); in TEST()216 for (size_t i = 0; i < kDictionaryCapacity; ++i) { in TEST()