diff options
author | alberth <alberth@openttd.org> | 2010-08-29 13:32:39 +0000 |
---|---|---|
committer | alberth <alberth@openttd.org> | 2010-08-29 13:32:39 +0000 |
commit | ded2acf02ea8b480a683da6982ecda39de48912e (patch) | |
tree | 12d85402a9ebb4d70c3e4b87f720621b5ce01635 /src/pathfinder/npf/queue.h | |
parent | fa6203fdc30a0879bcee79087573bba1315e0b62 (diff) | |
download | openttd-ded2acf02ea8b480a683da6982ecda39de48912e.tar.xz |
(svn r20679) -Codechange: Remove unused insertion sorter.
Diffstat (limited to 'src/pathfinder/npf/queue.h')
-rw-r--r-- | src/pathfinder/npf/queue.h | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/src/pathfinder/npf/queue.h b/src/pathfinder/npf/queue.h index d7a7a7919..31dac0c0a 100644 --- a/src/pathfinder/npf/queue.h +++ b/src/pathfinder/npf/queue.h @@ -25,12 +25,6 @@ typedef bool Queue_DeleteProc(Queue *q, void *item, int priority); typedef void Queue_ClearProc(Queue *q, bool free_values); typedef void Queue_FreeProc(Queue *q, bool free_values); -struct InsSortNode { - void *item; - int priority; - InsSortNode *next; -}; - struct BinaryHeapNode { void *item; int priority; @@ -68,9 +62,6 @@ struct Queue { union { struct { - InsSortNode *first; - } inssort; - struct { uint max_size; uint size; uint blocks; ///< The amount of blocks for which space is reserved in elements @@ -80,15 +71,6 @@ struct Queue { }; -/** - * Insertion Sorter - */ - -/* Initializes a inssort and allocates internal memory. There is no maximum - * size */ -void init_InsSort(Queue *q); - - /* * Binary Heap * For information, see: |