(svn r15128) -Remove: remove WrightAI and AI Libraries from SVN, as they are now available via the content service

2 files changed, 0 insertions, 129 deletions

diff --git a/bin/ai/library/queue/priority_queue/library.nut b/bin/ai/library/queue/priority_queue/library.nut
deleted file mode 100644
index 1559393ee..000000000
--- a/bin/ai/library/queue/priority_queue/library.nut
+++ /dev/null
@@ -1,14 +0,0 @@
-/* $Id$ */
-
-class Priority_Queue extends AILibrary {
-	function GetAuthor()      { return "OpenTTD NoAI Developers Team"; }
-	function GetName()        { return "Priority Queue"; }
-	function GetShortName()   { return "QUPQ"; }
-	function GetDescription() { return "An implementation of a Priority Queue"; }
-	function GetVersion()     { return 2; }
-	function GetDate()        { return "2008-06-10"; }
-	function CreateInstance() { return "Priority_Queue"; }
-	function GetCategory()    { return "Queue"; }
-}
-
-RegisterLibrary(Priority_Queue());
diff --git a/bin/ai/library/queue/priority_queue/main.nut b/bin/ai/library/queue/priority_queue/main.nut
deleted file mode 100644
index feda89559..000000000
--- a/bin/ai/library/queue/priority_queue/main.nut
+++ /dev/null
@@ -1,115 +0,0 @@
-/* $Id$ */
-
-/**
- * Priority Queue.
- *  Peek and Pop always return the current lowest value in the list.
- *  Sort is done on insertion only.
- */
-class Priority_Queue
-{
-	_queue = null;
-	_count = 0;
-
-	constructor()
-	{
-		_count = 0;
-		_queue = [];
-	}
-
-	/**
-	 * Insert a new entry in the list.
-	 *  The complexity of this operation is O(n).
-	 * @param item The item to add to the list.
-	 * @param priority The priority this item has.
-	 */
-	function Insert(item, priority);
-
-	/**
-	 * Pop the first entry of the list.
-	 *  This is always the item with the lowest priority.
-	 *  The complexity of this operation is O(1).
-	 * @return The item of the entry with the lowest priority.
-	 */
-	function Pop();
-
-	/**
-	 * Peek the first entry of the list.
-	 *  This is always the item with the lowest priority.
-	 *  The complexity of this operation is O(1).
-	 * @return The item of the entry with the lowest priority.
-	 */
-	function Peek();
-
-	/**
-	 * Get the amount of current items in the list.
-	 *  The complexity of this operation is O(1).
-	 * @return The amount of items currently in the list.
-	 */
-	function Count();
-
-	/**
-	 * Check if an item exists in the list.
-	 *  The complexity of this operation is O(n).
-	 * @param item The item to check for.
-	 * @return True if the item is already in the list.
-	 */
-	function Exists(item);
-};
-
-function Priority_Queue::Insert(item, priority)
-{
-	/* Append dummy entry */
-	_queue.append(0);
-	_count++;
-
-	local i;
-	/* Find the point of insertion */
-	for (i = _count - 2; i >= 0; i--) {
-		if (priority > _queue[i][1]) {
-			/* All items bigger move one place to the right */
-			_queue[i + 1] = _queue[i];
-		} else if (item == _queue[i][0]) {
-			/* Same item, ignore insertion */
-			return false;
-		} else {
-			/* Found place to insert at */
-			break;
-		}
-	}
-	/* Insert new pair */
-	_queue[i + 1] = [item, priority];
-
-	return true;
-}
-
-function Priority_Queue::Pop()
-{
-	if (_count == 0) return null;
-
-	local node = _queue.pop();
-	_count--;
-
-	return node[0];
-}
-
-function Priority_Queue::Peek()
-{
-	if (_count == 0) return null;
-
-	return _queue[_count - 1][0];
-}
-
-function Priority_Queue::Count()
-{
-	return _count;
-}
-
-function Priority_Queue::Exists(item)
-{
-	/* Brute-force find the item (there is no faster way, as we don't have the priority number) */
-	foreach (node in _queue) {
-		if (node[0] == item) return true;
-	}
-
-	return false;
-}