miloignis/kraken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

3 sec laptop speed improvement in hash_map

Browse Source
This commit is contained in:
Nathan Braswell
2017-01-22 16:36:04 -05:00
parent ebb34d5ba3
commit beb50b8e25
4 changed files with 17 additions and 88 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
stdlib/hash_map.krak
View File

@@ -53,13 +53,13 @@ obj hash_map<T,U> (Object, Serializable) {
if (!data[(key_hash%data.size) cast int].contains_key(key)) {
size++
if (size > data.size) {
var new_data = vector::vector<map::map<T,U>>()
var new_data.construct(size*2): vector::vector<map::map<T,U>>
for (var i = 0; i < size*2; i++;)
new_data.addEnd(map::map<T,U>())
for_each(fun(key: T, value: U) {
new_data[(util::hash(key)%new_data.size) cast int].set(key, value)
})
data = new_data
data.swap(new_data)
}
}
data[(key_hash%data.size) cast int].set(key, value)
@@ -67,6 +67,9 @@ obj hash_map<T,U> (Object, Serializable) {
fun get(key: ref T): ref U {
return data[(util::hash(key)%data.size) cast int].get(key)
}
fun get_ptr_or_null(key: ref T): *U {
return data[(util::hash(key)%data.size) cast int].get_ptr_or_null(key)
}
fun contains_key(key: ref T): bool {
return data[(util::hash(key)%data.size) cast int].contains_key(key)
}