OLD | NEW |
1 #include "SkChecksum.h" | 1 #include "SkChecksum.h" |
2 #include "SkString.h" | 2 #include "SkString.h" |
3 #include "SkTHash.h" | 3 #include "SkTHash.h" |
4 #include "Test.h" | 4 #include "Test.h" |
5 | 5 |
6 namespace { uint32_t hash_int(int k) { return SkChecksum::Mix(k); } } | 6 namespace { uint32_t hash_int(int k) { return SkChecksum::Mix(k); } } |
7 | 7 |
8 static void set_negative_key(int key, double* d) { *d = -key; } | 8 static void set_negative_key(int key, double* d) { *d = -key; } |
9 | 9 |
10 DEF_TEST(HashMap, r) { | 10 DEF_TEST(HashMap, r) { |
(...skipping 23 matching lines...) Expand all Loading... |
34 REPORTER_ASSERT(r, found); | 34 REPORTER_ASSERT(r, found); |
35 REPORTER_ASSERT(r, *found == i*2.0); | 35 REPORTER_ASSERT(r, *found == i*2.0); |
36 } | 36 } |
37 for (int i = N; i < 2*N; i++) { | 37 for (int i = N; i < 2*N; i++) { |
38 REPORTER_ASSERT(r, !map.find(i)); | 38 REPORTER_ASSERT(r, !map.find(i)); |
39 } | 39 } |
40 | 40 |
41 REPORTER_ASSERT(r, map.count() == N); | 41 REPORTER_ASSERT(r, map.count() == N); |
42 } | 42 } |
43 | 43 |
44 namespace { uint32_t hash_string(SkString s) { return s.size(); } } | 44 namespace { uint32_t hash_string(SkString s) { return (uint32_t)s.size(); } } |
45 | 45 |
46 DEF_TEST(HashSet, r) { | 46 DEF_TEST(HashSet, r) { |
47 SkTHashSet<SkString, hash_string> set; | 47 SkTHashSet<SkString, hash_string> set; |
48 | 48 |
49 set.add(SkString("Hello")); | 49 set.add(SkString("Hello")); |
50 set.add(SkString("World")); | 50 set.add(SkString("World")); |
51 | 51 |
52 REPORTER_ASSERT(r, set.count() == 2); | 52 REPORTER_ASSERT(r, set.count() == 2); |
53 | 53 |
54 REPORTER_ASSERT(r, set.contains(SkString("Hello"))); | 54 REPORTER_ASSERT(r, set.contains(SkString("Hello"))); |
55 REPORTER_ASSERT(r, set.contains(SkString("World"))); | 55 REPORTER_ASSERT(r, set.contains(SkString("World"))); |
56 REPORTER_ASSERT(r, !set.contains(SkString("Goodbye"))); | 56 REPORTER_ASSERT(r, !set.contains(SkString("Goodbye"))); |
57 } | 57 } |
OLD | NEW |