From 57852f64988b92fa7d9031ea76aa89b67d08c4f6 Mon Sep 17 00:00:00 2001 From: miham Date: Wed, 29 Dec 2004 13:13:29 +0000 Subject: (svn r1297) Language fixes in the source.. (ln-) --- queue.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'queue.c') diff --git a/queue.c b/queue.c index 8c88542ef..5cff8fc4f 100644 --- a/queue.c +++ b/queue.c @@ -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); -- cgit v1.2.3-54-g00ecf