HashTest.cpp - OpenGrok cross reference for /third

Lines Matching refs:set
27     map.set(3, 4.0);
48         map.set(i, 2.0*i);
122         refMap.set(0, ref);
133     SkTHashSet<SkString> set;
135     set.add(SkString("Hello"));
136     set.add(SkString("World"));
137     REPORTER_ASSERT(r, set.count() == 2);
138     REPORTER_ASSERT(r, set.contains(SkString("Hello")));
139     REPORTER_ASSERT(r, set.contains(SkString("World")));
140     REPORTER_ASSERT(r, !set.contains(SkString("Goodbye")));
141     REPORTER_ASSERT(r, set.find(SkString("Hello")));
142     REPORTER_ASSERT(r, *set.find(SkString("Hello")) == SkString("Hello"));
144     // Test walking the set with iterators, using preincrement (++iter).
145     for (SkTHashSet<SkString>::Iter iter = set.begin(); iter != set.end(); ++iter) {
149     // Test walking the set with iterators, using postincrement (iter++).
150     for (SkTHashSet<SkString>::Iter iter = set.begin(); iter != set.end(); iter++) {
154     // Test walking the set with range-based for.
155     for (auto& entry : set) {
159     // Ensure that iteration works equally well on a const set.
160     const auto& cset = set;
165     // Ensure that range-based for works equally well on a const set.
170     SkTHashSet<SkString> clone = set;
178     set.remove(SkString("Hello"));
179     REPORTER_ASSERT(r, !set.contains(SkString("Hello")));
180     REPORTER_ASSERT(r, set.count() == 1);
184     set.reset();
185     REPORTER_ASSERT(r, set.count() == 0);
187     clone = set;
237     SkTHashSet<CopyCounter, HashCopyCounter> set;
244     set.add(copyCounter1);
246     REPORTER_ASSERT(r, set.contains(copyCounter1));
248     set.add(copyCounter1);
252     set.add(copyCounter2);
254     REPORTER_ASSERT(r, set.contains(copyCounter1));
255     REPORTER_ASSERT(r, set.contains(copyCounter2));
257     set.add(copyCounter1);
258     set.add(copyCounter2);
280     table.set(&seven);