| 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_HASHMAP_H_ | 28 #ifndef V8_HASHMAP_H_ |
| 29 #define V8_HASHMAP_H_ | 29 #define V8_HASHMAP_H_ |
| 30 | 30 |
| 31 namespace v8 { namespace internal { | 31 namespace v8 { |
| 32 namespace internal { |
| 32 | 33 |
| 33 | 34 |
| 34 // Allocator defines the memory allocator interface | 35 // Allocator defines the memory allocator interface |
| 35 // used by HashMap and implements a default allocator. | 36 // used by HashMap and implements a default allocator. |
| 36 class Allocator BASE_EMBEDDED { | 37 class Allocator BASE_EMBEDDED { |
| 37 public: | 38 public: |
| 38 virtual ~Allocator() {} | 39 virtual ~Allocator() {} |
| 39 virtual void* New(size_t size) { return Malloced::New(size); } | 40 virtual void* New(size_t size) { return Malloced::New(size); } |
| 40 virtual void Delete(void* p) { Malloced::Delete(p); } | 41 virtual void Delete(void* p) { Malloced::Delete(p); } |
| 41 }; | 42 }; |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 110 Entry* map_end() const { return map_ + capacity_; } | 111 Entry* map_end() const { return map_ + capacity_; } |
| 111 Entry* Probe(void* key, uint32_t hash); | 112 Entry* Probe(void* key, uint32_t hash); |
| 112 void Initialize(uint32_t capacity); | 113 void Initialize(uint32_t capacity); |
| 113 void Resize(); | 114 void Resize(); |
| 114 }; | 115 }; |
| 115 | 116 |
| 116 | 117 |
| 117 } } // namespace v8::internal | 118 } } // namespace v8::internal |
| 118 | 119 |
| 119 #endif // V8_HASHMAP_H_ | 120 #endif // V8_HASHMAP_H_ |
| OLD | NEW |