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

Merge pull request #3780 from destroycomputers/fix/rbtree/key-ordering-constraint

Browse Source 
Loosen constraint on the Key type in rb & avl tree
This commit is contained in:
Jeroen van Rijn
2024-06-18 13:42:36 +02:00
committed by GitHub
parent dd364c0c0f de44dd5412
commit aad7ddf2d1
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/container/avl/avl.odin
+1 -1
View File
@@ -87,7 +87,7 @@ init_cmp :: proc(
init_ordered :: proc( init_ordered :: proc(
t: ^$T/Tree($Value), t: ^$T/Tree($Value),
node_allocator := context.allocator, node_allocator := context.allocator,
) where intrinsics.type_is_ordered_numeric(Value) { ) where intrinsics.type_is_ordered(Value) {
init_cmp(t, slice.cmp_proc(Value), node_allocator) init_cmp(t, slice.cmp_proc(Value), node_allocator)
} }
core/container/rbtree/rbtree.odin
+1 -1
View File
@@ -79,7 +79,7 @@ init_cmp :: proc(t: ^$T/Tree($Key, $Value), cmp_fn: proc(a, b: Key) -> Ordering,
// init_ordered initializes a tree containing ordered keys, with // init_ordered initializes a tree containing ordered keys, with
// a comparison function that results in an ascending order sort. // a comparison function that results in an ascending order sort.
init_ordered :: proc(t: ^$T/Tree($Key, $Value), node_allocator := context.allocator) where intrinsics.type_is_ordered_numeric(Key) { init_ordered :: proc(t: ^$T/Tree($Key, $Value), node_allocator := context.allocator) where intrinsics.type_is_ordered(Key) {
init_cmp(t, slice.cmp_proc(Key), node_allocator) init_cmp(t, slice.cmp_proc(Key), node_allocator)
} }