mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-04-05 17:14:08 +00:00
Code Activity

Added reserve() method to haslib classes and

Browse source 
calculate hashtable size based on entries capacity, not size
This commit is contained in:
Clifford Wolf 2016-01-31 22:50:34 +01:00
parent 173fc4f420
commit 13e15a24a2
1 changed files with 6 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
kernel/hashlib.h
View file

@ -233,7 +233,7 @@ class dict
void do_rehash() void do_rehash()
{ {
hashtable.clear(); hashtable.clear();
hashtable.resize(hashtable_size(entries.size() * hashtable_size_factor), -1); hashtable.resize(hashtable_size(entries.capacity() * hashtable_size_factor), -1);
for (int i = 0; i < int(entries.size()); i++) { for (int i = 0; i < int(entries.size()); i++) {
do_assert(-1 <= entries[i].next && entries[i].next < int(entries.size())); do_assert(-1 <= entries[i].next && entries[i].next < int(entries.size()));
@ -552,6 +552,7 @@ public:
return !operator==(other); return !operator==(other);
} }
void reserve(size_t n) { entries.reserve(n); }
size_t size() const { return entries.size(); } size_t size() const { return entries.size(); }
bool empty() const { return entries.empty(); } bool empty() const { return entries.empty(); }
void clear() { hashtable.clear(); entries.clear(); } void clear() { hashtable.clear(); entries.clear(); }
@ -601,7 +602,7 @@ protected:
void do_rehash() void do_rehash()
{ {
hashtable.clear(); hashtable.clear();
hashtable.resize(hashtable_size(entries.size() * hashtable_size_factor), -1); hashtable.resize(hashtable_size(entries.capacity() * hashtable_size_factor), -1);
for (int i = 0; i < int(entries.size()); i++) { for (int i = 0; i < int(entries.size()); i++) {
do_assert(-1 <= entries[i].next && entries[i].next < int(entries.size())); do_assert(-1 <= entries[i].next && entries[i].next < int(entries.size()));
@ -868,6 +869,7 @@ public:
return !operator==(other); return !operator==(other);
} }
void reserve(size_t n) { entries.reserve(n); }
size_t size() const { return entries.size(); } size_t size() const { return entries.size(); }
bool empty() const { return entries.empty(); } bool empty() const { return entries.empty(); }
void clear() { hashtable.clear(); entries.clear(); } void clear() { hashtable.clear(); entries.clear(); }
@ -938,6 +940,7 @@ public:
database.swap(other.database); database.swap(other.database);
} }
void reserve(size_t n) { database.reserve(n); }
size_t size() const { return database.size(); } size_t size() const { return database.size(); }
bool empty() const { return database.empty(); } bool empty() const { return database.empty(); }
void clear() { database.clear(); } void clear() { database.clear(); }
@ -1031,6 +1034,7 @@ public:
parents.swap(other.parents); parents.swap(other.parents);
} }
void reserve(size_t n) { database.reserve(n); }
size_t size() const { return database.size(); } size_t size() const { return database.size(); }
bool empty() const { return database.empty(); } bool empty() const { return database.empty(); }
void clear() { database.clear(); parents.clear(); } void clear() { database.clear(); parents.clear(); }