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

Fix typo in priority_queue.odin and add default_swap_proc

Browse Source
This commit is contained in:
gingerBill
2022-01-01 13:11:53 +00:00
parent 0d7cb02386
commit 70ed280c5a
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/container/priority_queue/priority_queue.odin
+7 -1
View File
@@ -11,6 +11,12 @@ Priority_Queue :: struct($T: typeid) {
DEFAULT_CAPACITY :: 16 DEFAULT_CAPACITY :: 16
default_swap_proc :: proc($T: typeid) -> proc(q: []T, i, j: int) {
return proc(q: []T, i, j: int) {
q[i], q[j] = q[j], q[i]
}
}
init :: proc(pq: ^$Q/Priority_Queue($T), less: proc(a, b: T) -> bool, swap: proc(q: []T, i, j: int), capacity := DEFAULT_CAPACITY, allocator := context.allocator) { init :: proc(pq: ^$Q/Priority_Queue($T), less: proc(a, b: T) -> bool, swap: proc(q: []T, i, j: int), capacity := DEFAULT_CAPACITY, allocator := context.allocator) {
if pq.queue.allocator.procedure == nil { if pq.queue.allocator.procedure == nil {
pq.queue.allocator = allocator pq.queue.allocator = allocator
@@ -65,7 +71,7 @@ _shift_down :: proc(pq: ^$Q/Priority_Queue($T), i0, n: int) -> bool {
} }
j, j2 = j1, j1+1 j, j2 = j1, j1+1
if j1 < n && pq.less(queue[j2], queue[j1]) { if j1 < n && pq.less(queue[j2], queue[j1]) {
j1 = j2 j = j2
} }
if !pq.less(queue[i], queue[j]) { if !pq.less(queue[i], queue[j]) {
break break