OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_HASHMAP_H_ | 5 #ifndef V8_HASHMAP_H_ |
6 #define V8_HASHMAP_H_ | 6 #define V8_HASHMAP_H_ |
7 | 7 |
8 #include "src/allocation.h" | 8 #include "src/allocation.h" |
9 #include "src/base/bits.h" | 9 #include "src/base/bits.h" |
10 #include "src/base/logging.h" | 10 #include "src/base/logging.h" |
(...skipping 332 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
343 Iterator end() const { return Iterator(this, NULL); } | 343 Iterator end() const { return Iterator(this, NULL); } |
344 Iterator find(Key* key, bool insert = false, | 344 Iterator find(Key* key, bool insert = false, |
345 AllocationPolicy allocator = AllocationPolicy()) { | 345 AllocationPolicy allocator = AllocationPolicy()) { |
346 if (insert) { | 346 if (insert) { |
347 return Iterator(this, this->LookupOrInsert(key, key->Hash(), allocator)); | 347 return Iterator(this, this->LookupOrInsert(key, key->Hash(), allocator)); |
348 } | 348 } |
349 return Iterator(this, this->Lookup(key, key->Hash())); | 349 return Iterator(this, this->Lookup(key, key->Hash())); |
350 } | 350 } |
351 }; | 351 }; |
352 | 352 |
353 } } // namespace v8::internal | 353 } // namespace internal |
| 354 } // namespace v8 |
354 | 355 |
355 #endif // V8_HASHMAP_H_ | 356 #endif // V8_HASHMAP_H_ |
OLD | NEW |