Searched refs:kSetSize (Results 1 – 10 of 10) sorted by relevance
33 constexpr size_t kSetSize = 3; variable60 std::map<Inode, SmallSet<DataType, kSetSize>> map_;
56 ASSERT_EQ(kSetSize, 3u); in TEST()
286 enum { kSetSize = 4 }; enumerator289 for (int i = 0; i < kSetSize; i++) { in PrintAll()299 for (int i = 0; i < kSetSize; i++) { in insertOrMerge()329 for (int i = 1; i < kSetSize; i++) { in insertOrMerge()355 SetEntry Entries[kSetSize];
1036 const uint32 kSetSize = 4; in FixClusteredPixel() local1038 static const int32 kOffset [kNumSets] [kSetSize] [2] = in FixClusteredPixel()1077 for (uint32 entry = 0; entry < kSetSize; entry++) in FixClusteredPixel()1545 const uint32 kSetSize = 8; in FixClusteredRect() local1547 static const int32 kOffset [kNumSets] [kSetSize] [2] = in FixClusteredRect()1656 for (uint32 entry = 0; entry < kSetSize; entry++) in FixClusteredRect()
1111 const int kSetSize = 1201; in TEST() local1113 for (int i = 0; i < kSetSize; ++i) { in TEST()1122 my_set.insert(kSetSize); in TEST()1128 my_set.erase(kSetSize - 1); in TEST()1135 for (int i = 0; i < kSetSize; ++i) { in TEST()1151 my_map["hello"] = kSetSize; in TEST()1157 my_map.erase(std::string(kSetSize - 1, 'a')); in TEST()
1117 const int kSetSize = 1201; in TEST() local1119 for (int i = 0; i < kSetSize; ++i) { in TEST()1128 my_set.insert(kSetSize); in TEST()1134 my_set.erase(kSetSize - 1); in TEST()1141 for (int i = 0; i < kSetSize; ++i) { in TEST()1157 my_map["hello"] = kSetSize; in TEST()1163 my_map.erase(std::string(kSetSize - 1, 'a')); in TEST()
1118 const int kSetSize = 1201; in TEST() local1120 for (int i = 0; i < kSetSize; ++i) { in TEST()1129 my_set.insert(kSetSize); in TEST()1135 my_set.erase(kSetSize - 1); in TEST()1142 for (int i = 0; i < kSetSize; ++i) { in TEST()1158 my_map["hello"] = kSetSize; in TEST()1164 my_map.erase(std::string(kSetSize - 1, 'a')); in TEST()