From 7aa0bdf48b8f27389ad69c4299b8d910398c43d5 Mon Sep 17 00:00:00 2001
From: truelight <truelight@openttd.org>
Date: Sat, 11 Sep 2004 09:55:19 +0000
Subject: (svn r202) -Codechange: I missed some files with trailing spaces..
 this should be all ;)

---
 queue.c | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'queue.c')

diff --git a/queue.c b/queue.c
index 6817467a1..8c88542ef 100644
--- a/queue.c
+++ b/queue.c
@@ -150,7 +150,7 @@ void InsSort_Clear(Queue* q, bool free_values) {
 		prev = node;
 		node = node->next;
 		free(prev);
-		
+
 	}
 	q->data.inssort.first = NULL;
 }
@@ -283,7 +283,7 @@ bool BinaryHeap_Push(Queue* q, void* item, int priority) {
 	if (q->data.binaryheap.size == q->data.binaryheap.max_size)
 		return false;
 	assert(q->data.binaryheap.size < q->data.binaryheap.max_size);
-	
+
 	if (q->data.binaryheap.elements[q->data.binaryheap.size >> BINARY_HEAP_BLOCKSIZE_BITS] == NULL) {
 		/* The currently allocated blocks are full, allocate a new one */
 		assert((q->data.binaryheap.size & BINARY_HEAP_BLOCKSIZE_MASK) == 0);
@@ -466,14 +466,14 @@ void delete_Hash(Hash* h, bool free_values) {
 		if (h->buckets_in_use[i]) {
 			HashNode* node;
 			/* Free the first value */
-			if (free_values) 
+			if (free_values)
 				free(h->buckets[i].value);
 			node = h->buckets[i].next;
 			while (node != NULL) {
 				HashNode* prev = node;
 				node = node->next;
 				/* Free the value */
-				if (free_values) 
+				if (free_values)
 					free(prev->value);
 				/* Free the node */
 				free(prev);
-- 
cgit v1.2.3-70-g09d2