| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2013 Google Inc. | 2 * Copyright 2013 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "SkTDynamicHash.h" |
| 8 #include "Test.h" | 9 #include "Test.h" |
| 9 #include "SkTDynamicHash.h" | |
| 10 | 10 |
| 11 namespace { | 11 namespace { |
| 12 | 12 |
| 13 struct Entry { | 13 struct Entry { |
| 14 int key; | 14 int key; |
| 15 double value; | 15 double value; |
| 16 }; | 16 }; |
| 17 | 17 |
| 18 const int& GetKey(const Entry& entry) { return entry.key; } | 18 const int& GetKey(const Entry& entry) { return entry.key; } |
| 19 uint32_t GetHash(const int& key) { return key; } | 19 uint32_t GetHash(const int& key) { return key; } |
| (...skipping 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 135 ASSERT(hash.find(5) != NULL); | 135 ASSERT(hash.find(5) != NULL); |
| 136 ASSERT(hash.find(5)->value == 3.0); | 136 ASSERT(hash.find(5)->value == 3.0); |
| 137 } | 137 } |
| 138 | 138 |
| 139 DEF_TEST(DynamicHash, reporter) { | 139 DEF_TEST(DynamicHash, reporter) { |
| 140 test_growth(reporter); | 140 test_growth(reporter); |
| 141 test_add(reporter); | 141 test_add(reporter); |
| 142 test_lookup(reporter); | 142 test_lookup(reporter); |
| 143 test_remove(reporter); | 143 test_remove(reporter); |
| 144 } | 144 } |
| OLD | NEW |