diff options
author | miham <miham@openttd.org> | 2004-12-29 13:13:29 +0000 |
---|---|---|
committer | miham <miham@openttd.org> | 2004-12-29 13:13:29 +0000 |
commit | 57852f64988b92fa7d9031ea76aa89b67d08c4f6 (patch) | |
tree | 66526ea5c00e53199cc02447a0970c13b4e8175e /queue.c | |
parent | 14dfb539b06bb9ad411dbcf6e4141f189713a099 (diff) | |
download | openttd-57852f64988b92fa7d9031ea76aa89b67d08c4f6.tar.xz |
(svn r1297) Language fixes in the source.. (ln-)
Diffstat (limited to 'queue.c')
-rw-r--r-- | queue.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -355,7 +355,7 @@ bool BinaryHeap_Delete(Queue* q, void* item, int priority) j = i; // Check if we have 2 childs if (2*j+1 <= q->data.binaryheap.size) { - // Is this child smaller then the parent? + // Is this child smaller than the parent? if (BIN_HEAP_ARR(j).priority >= BIN_HEAP_ARR(2*j).priority) {i = 2*j; } // Yes, we _need_ to use i here, not j, because we want to have the smallest child // This way we get that straight away! @@ -365,7 +365,7 @@ bool BinaryHeap_Delete(Queue* q, void* item, int priority) if (BIN_HEAP_ARR(j).priority >= BIN_HEAP_ARR(2*j).priority) { i = 2*j; } } - // One of our childs is smaller then we are, switch + // One of our childs is smaller than we are, switch if (i != j) { temp = BIN_HEAP_ARR(j); BIN_HEAP_ARR(j) = BIN_HEAP_ARR(i); |