mirror of
https://github.com/odin-lang/Odin.git
synced 2025-12-28 17:04:34 +00:00
76 lines
1.9 KiB
Odin
76 lines
1.9 KiB
Odin
package slice
|
|
|
|
import "base:intrinsics"
|
|
import "base:runtime"
|
|
|
|
_ :: intrinsics
|
|
_ :: runtime
|
|
|
|
map_keys :: proc(m: $M/map[$K]$V, allocator := context.allocator) -> (keys: []K, err: runtime.Allocator_Error) {
|
|
keys = make(type_of(keys), len(m), allocator) or_return
|
|
i := 0
|
|
for key in m {
|
|
keys[i] = key
|
|
i += 1
|
|
}
|
|
return
|
|
}
|
|
map_values :: proc(m: $M/map[$K]$V, allocator := context.allocator) -> (values: []V, err: runtime.Allocator_Error) {
|
|
values = make(type_of(values), len(m), allocator) or_return
|
|
i := 0
|
|
for _, value in m {
|
|
values[i] = value
|
|
i += 1
|
|
}
|
|
return
|
|
}
|
|
|
|
Map_Entry :: struct($Key, $Value: typeid) {
|
|
key: Key,
|
|
value: Value,
|
|
}
|
|
|
|
Map_Entry_Info :: struct($Key, $Value: typeid) {
|
|
hash: uintptr,
|
|
key: Key,
|
|
value: Value,
|
|
}
|
|
|
|
|
|
map_entries :: proc(m: $M/map[$K]$V, allocator := context.allocator) -> (entries: []Map_Entry(K, V), err: runtime.Allocator_Error) {
|
|
entries = make(type_of(entries), len(m), allocator) or_return
|
|
i := 0
|
|
for key, value in m {
|
|
entries[i].key = key
|
|
entries[i].value = value
|
|
i += 1
|
|
}
|
|
return
|
|
}
|
|
|
|
map_entry_infos :: proc(m: $M/map[$K]$V, allocator := context.allocator) -> (entries: []Map_Entry_Info(K, V), err: runtime.Allocator_Error) #no_bounds_check {
|
|
m := m
|
|
rm := (^runtime.Raw_Map)(&m)
|
|
|
|
info := runtime.type_info_base(type_info_of(M)).variant.(runtime.Type_Info_Map)
|
|
if info.map_info != nil {
|
|
entries = make(type_of(entries), len(m), allocator) or_return
|
|
|
|
map_cap := uintptr(cap(m))
|
|
ks, vs, hs, _, _ := runtime.map_kvh_data_dynamic(rm^, info.map_info)
|
|
entry_index := 0
|
|
for bucket_index in 0..<map_cap {
|
|
if hash := hs[bucket_index]; runtime.map_hash_is_valid(hash) {
|
|
key := runtime.map_cell_index_dynamic(ks, info.map_info.ks, bucket_index)
|
|
value := runtime.map_cell_index_dynamic(vs, info.map_info.vs, bucket_index)
|
|
entries[entry_index].hash = hash
|
|
entries[entry_index].key = (^K)(key)^
|
|
entries[entry_index].value = (^V)(value)^
|
|
|
|
entry_index += 1
|
|
}
|
|
}
|
|
}
|
|
return
|
|
}
|