OLD | NEW |
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
164 CHECK(set.Present(y)); | 164 CHECK(set.Present(y)); |
165 } | 165 } |
166 y = y * factor + offset; | 166 y = y * factor + offset; |
167 } | 167 } |
168 } | 168 } |
169 CHECK_EQ(0, set.occupancy()); | 169 CHECK_EQ(0, set.occupancy()); |
170 } | 170 } |
171 | 171 |
172 | 172 |
173 TEST(Set) { | 173 TEST(Set) { |
174 TestSet(Hash, 1000); | 174 TestSet(Hash, 100); |
175 TestSet(CollisionHash, 100); | 175 TestSet(CollisionHash, 50); |
176 } | 176 } |
OLD | NEW |