--- a/bin/ai/library/queue/binary_heap/main.nut	Tue Jun 10 19:11:30 2008 +0000
+++ b/bin/ai/library/queue/binary_heap/main.nut	Tue Jun 10 19:41:54 2008 +0000
@@ -10,7 +10,8 @@
 	_queue = null;
 	_count = 0;
 
-	constructor() {
+	constructor()
+	{
 		this._queue = [];
 	}
 

--- a/bin/ai/library/queue/priority_queue/main.nut	Tue Jun 10 19:11:30 2008 +0000
+++ b/bin/ai/library/queue/priority_queue/main.nut	Tue Jun 10 19:41:54 2008 +0000
@@ -1,11 +1,12 @@
 /* $Id$ */
 
 /**
- * Priority Queue
+ * Priority Queue.
  *  Peek and Remove always return the current lowest value in the list.
  *  Sort is done on insertion only.
  */
-class PriorityQueue {
+class PriorityQueue
+{
 	_queue = null;
 	_count = 0;