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

Correct _shift_down logic

Browse Source
This commit is contained in:
gingerBill
2022-01-01 13:44:37 +00:00
parent 70ed280c5a
commit 43763ddfda
1 changed files with 7 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/container/priority_queue/priority_queue.odin
+7 -8
View File
@@ -56,24 +56,23 @@ cap :: proc(pq: $Q/Priority_Queue($T)) -> int {
_shift_down :: proc(pq: ^$Q/Priority_Queue($T), i0, n: int) -> bool { _shift_down :: proc(pq: ^$Q/Priority_Queue($T), i0, n: int) -> bool {
// O(n log n) // O(n log n)
i := i0 if 0 > i0 || i0 > n {
j, j1, j2: int
if 0 > i || i > n {
return false return false
} }
i := i0
queue := pq.queue[:] queue := pq.queue[:]
for { for {
j1 := 2*i + 1 j1 := 2*i + 1
if 0 > j1 || j1 >= n { if j1 < 0 || j1 >= n {
break break
} }
j, j2 = j1, j1+1 j := j1
if j1 < n && pq.less(queue[j2], queue[j1]) { if j2 := j1+1; j2 < n && pq.less(queue[j2], queue[j1]) {
j = j2 j = j2
} }
if !pq.less(queue[i], queue[j]) { if !pq.less(queue[j], queue[i]) {
break break
} }
@@ -87,7 +86,7 @@ _shift_up :: proc(pq: ^$Q/Priority_Queue($T), j: int) {
j := j j := j
queue := pq.queue[:] queue := pq.queue[:]
n := builtin.len(queue) n := builtin.len(queue)
for 0 <= j && j < n { for 0 <= j {
i := (j-1)/2 i := (j-1)/2
if i == j || !pq.less(queue[j], queue[i]) { if i == j || !pq.less(queue[j], queue[i]) {
break break