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

Some bugfixes/added errors, convert most to not use simple_passthrough

Browse Source
This commit is contained in:
Nathan Braswell
2016-04-30 15:38:28 -04:00
parent d126cbf24b
commit 7aa1d9983b
77 changed files with 260 additions and 600 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
stdlib/hash_map.krak
View File

@@ -65,7 +65,7 @@ obj hash_map<T,U> (Object, Serializable) {
/*io::println((this) cast int)*/
/*io::print("size of data:")*/
/*io::println(data.size)*/
var key_hash = util::hash(key)
var key_hash = (util::hash(key)) cast int
if (!data[key_hash%data.size].contains_key(key)) {
size++
if (size > data.size) {
@@ -75,7 +75,7 @@ obj hash_map<T,U> (Object, Serializable) {
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].set(key, value)
new_data[(util::hash(key)) cast int%new_data.size].set(key, value)
})
data = new_data
}
@@ -83,10 +83,10 @@ obj hash_map<T,U> (Object, Serializable) {
data[key_hash%data.size].set(key, value)
}
fun get(key: T): ref U {
return data[util::hash(key)%data.size].get(key)
return data[(util::hash(key)) cast int%data.size].get(key)
}
fun contains_key(key: T): bool {
return data[util::hash(key)%data.size].contains_key(key)
return data[(util::hash(key)) cast int%data.size].contains_key(key)
}
fun contains_value(value: U): bool {
for (var i = 0; i < data.size; i++;) {
@@ -103,7 +103,7 @@ obj hash_map<T,U> (Object, Serializable) {
io::println("trying to reverse get a value that is not in the hash_map")
}
fun remove(key: T) {
data[util::hash(key)%data.size].remove(key)
data[(util::hash(key)) cast int%data.size].remove(key)
}
fun for_each(func: fun(T, U):void) {
for (var i = 0; i < data.size; i++;)