ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-05 15:18:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update core:container/lru to support clear and take a boolean to indicate whether or not to call the on_remove procedure on clear or destroy

Browse Source
This commit is contained in:
gingerBill
2022-02-02 23:38:32 +00:00
parent 5db603ded2
commit 35533a7baa
1 changed files with 23 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/container/lru/lru_cache.odin
+23 -14
View File
@@ -1,9 +1,9 @@
package container_lru package container_lru
import "core:runtime"
import "core:intrinsics" import "core:intrinsics"
import "core:mem" _ :: runtime
_ :: intrinsics _ :: intrinsics
_ :: mem
Node :: struct($Key, $Value: typeid) where intrinsics.type_is_valid_map_key(Key) { Node :: struct($Key, $Value: typeid) where intrinsics.type_is_valid_map_key(Key) {
prev, next: ^Node(Key, Value), prev, next: ^Node(Key, Value),
@@ -23,11 +23,10 @@ Cache :: struct($Key, $Value: typeid) where intrinsics.type_is_valid_map_key(Key
count: int, count: int,
capacity: int, capacity: int,
node_allocator: mem.Allocator, node_allocator: runtime.Allocator,
on_remove: proc(key: Key, value: Value, user_data: rawptr), on_remove: proc(key: Key, value: Value, user_data: rawptr),
on_remove_user_data: rawptr, on_remove_user_data: rawptr,
call_on_remove_on_destroy: bool,
} }
// init initializes a Cache // init initializes a Cache
@@ -37,23 +36,28 @@ init :: proc(c: ^$C/Cache($Key, $Value), capacity: int, entries_allocator := con
c.capacity = capacity c.capacity = capacity
} }
// destroy deinitializes a Cache // destroy deinitializes a Cachem
destroy :: proc(c: ^$C/Cache($Key, $Value)) { destroy :: proc(c: ^$C/Cache($Key, $Value), call_on_remove: bool) {
clear(c, call_on_remove)
delete(c.entries)
}
// clear the contents of a Cache
clear :: proc(c: ^$C/Cache($Key, $Value), call_on_remove: bool) {
for _, node in c.entries { for _, node in c.entries {
if c.call_on_remove_on_destroy && c.on_remove != nil { if call_on_remove {
c.on_remove(node.key, node.value, c.on_remove_user_data) _call_on_remove(c, node)
} }
free(node, c.node_allocator) free(node, c.node_allocator)
} }
clear(&c.entries) runtime.clear(&c.entries)
delete(c.entries)
c.head = nil c.head = nil
c.tail = nil c.tail = nil
c.count = 0 c.count = 0
} }
// set the given key value pair. This operation updates the recent usage of the item. // set the given key value pair. This operation updates the recent usage of the item.
set :: proc(c: ^$C/Cache($Key, $Value), key: Key, value: Value) -> mem.Allocator_Error { set :: proc(c: ^$C/Cache($Key, $Value), key: Key, value: Value) -> runtime.Allocator_Error {
if e, ok := c.entries[key]; ok { if e, ok := c.entries[key]; ok {
e.value = value e.value = value
return nil return nil
@@ -143,14 +147,19 @@ _remove_node :: proc(c: ^$C/Cache($Key, $Value), node: ^Node(Key, Value)) {
delete_key(&c.entries, node.key) delete_key(&c.entries, node.key)
if c.on_remove != nil { _call_on_remove(c, node)
c.on_remove(node.key, node.value, c.on_remove_user_data)
}
free(node, c.node_allocator) free(node, c.node_allocator)
} }
@(private)
_call_on_remove :: proc(c: ^$C/Cache($Key, $Value), node: ^Node(Key, Value)) {
if c.on_remove != nil {
c.on_remove(node.key, node.value, c.on_remove_user_data)
}
}
@(private) @(private)
_push_front_node :: proc(c: ^$C/Cache($Key, $Value), e: ^Node(Key, Value)) { _push_front_node :: proc(c: ^$C/Cache($Key, $Value), e: ^Node(Key, Value)) {
if c.head != nil { if c.head != nil {