OLD | NEW |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 #ifndef RUNTIME_VM_HASH_MAP_H_ | 5 #ifndef RUNTIME_VM_HASH_MAP_H_ |
6 #define RUNTIME_VM_HASH_MAP_H_ | 6 #define RUNTIME_VM_HASH_MAP_H_ |
7 | 7 |
8 #include "vm/growable_array.h" // For Malloc, EmptyBase | 8 #include "vm/growable_array.h" // For Malloc, EmptyBase |
9 #include "vm/zone.h" | 9 #include "vm/zone.h" |
10 | 10 |
11 namespace dart { | 11 namespace dart { |
12 | 12 |
13 template <typename KeyValueTrait, typename B, typename Allocator = Zone> | 13 template <typename KeyValueTrait, typename B, typename Allocator = Zone> |
14 class BaseDirectChainedHashMap : public B { | 14 class BaseDirectChainedHashMap : public B { |
15 public: | 15 public: |
16 explicit BaseDirectChainedHashMap(Allocator* allocator) | 16 explicit BaseDirectChainedHashMap(Allocator* allocator) |
17 : array_size_(0), | 17 : array_size_(0), |
18 lists_size_(0), | 18 lists_size_(0), |
19 count_(0), | 19 count_(0), |
20 array_(NULL), | 20 array_(NULL), |
21 lists_(NULL), | 21 lists_(NULL), |
22 free_list_head_(kNil), | 22 free_list_head_(kNil), |
23 allocator_(allocator) { | 23 allocator_(allocator) { |
24 ResizeLists(kInitialSize); | 24 ResizeLists(kInitialSize); |
25 Resize(kInitialSize); | 25 Resize(kInitialSize); |
26 } | 26 } |
27 | 27 |
28 BaseDirectChainedHashMap(const BaseDirectChainedHashMap& other); | 28 BaseDirectChainedHashMap(const BaseDirectChainedHashMap& other); |
29 | 29 |
30 ~BaseDirectChainedHashMap() { | 30 virtual ~BaseDirectChainedHashMap() { |
31 allocator_->template Free<HashMapListElement>(array_, array_size_); | 31 allocator_->template Free<HashMapListElement>(array_, array_size_); |
32 allocator_->template Free<HashMapListElement>(lists_, lists_size_); | 32 allocator_->template Free<HashMapListElement>(lists_, lists_size_); |
33 } | 33 } |
34 | 34 |
35 void Insert(typename KeyValueTrait::Pair kv); | 35 void Insert(typename KeyValueTrait::Pair kv); |
36 bool Remove(typename KeyValueTrait::Key key); | 36 bool Remove(typename KeyValueTrait::Key key); |
37 | 37 |
38 typename KeyValueTrait::Value LookupValue( | 38 typename KeyValueTrait::Value LookupValue( |
39 typename KeyValueTrait::Key key) const; | 39 typename KeyValueTrait::Key key) const; |
40 | 40 |
41 typename KeyValueTrait::Pair* Lookup(typename KeyValueTrait::Key key) const; | 41 typename KeyValueTrait::Pair* Lookup(typename KeyValueTrait::Key key) const; |
42 | 42 |
43 bool IsEmpty() const { return count_ == 0; } | 43 bool IsEmpty() const { return count_ == 0; } |
44 | 44 |
45 void Clear() { | 45 virtual void Clear() { |
46 if (!IsEmpty()) { | 46 if (!IsEmpty()) { |
47 count_ = 0; | 47 count_ = 0; |
48 InitArray(array_, array_size_); | 48 InitArray(array_, array_size_); |
49 InitArray(lists_, lists_size_); | 49 InitArray(lists_, lists_size_); |
50 lists_[0].next = kNil; | 50 lists_[0].next = kNil; |
51 for (intptr_t i = 1; i < lists_size_; ++i) { | 51 for (intptr_t i = 1; i < lists_size_; ++i) { |
52 lists_[i].next = i - 1; | 52 lists_[i].next = i - 1; |
53 } | 53 } |
54 free_list_head_ = lists_size_ - 1; | 54 free_list_head_ = lists_size_ - 1; |
55 } | 55 } |
(...skipping 381 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
437 | 437 |
438 static Key KeyOf(Pair kv) { return kv.key; } | 438 static Key KeyOf(Pair kv) { return kv.key; } |
439 static Value ValueOf(Pair kv) { return kv.value; } | 439 static Value ValueOf(Pair kv) { return kv.value; } |
440 static intptr_t Hashcode(Key key) { return reinterpret_cast<intptr_t>(key); } | 440 static intptr_t Hashcode(Key key) { return reinterpret_cast<intptr_t>(key); } |
441 static bool IsKeyEqual(Pair kv, Key key) { return kv.key == key; } | 441 static bool IsKeyEqual(Pair kv, Key key) { return kv.key == key; } |
442 }; | 442 }; |
443 | 443 |
444 } // namespace dart | 444 } // namespace dart |
445 | 445 |
446 #endif // RUNTIME_VM_HASH_MAP_H_ | 446 #endif // RUNTIME_VM_HASH_MAP_H_ |
OLD | NEW |