(svn r20679) -Codechange: Remove unused insertion sorter.

This commit is contained in:
alberth
2010-08-29 13:32:39 +00:00
parent 0439025e74
commit 17c4783571
2 changed files with 0 additions and 94 deletions

View File

@@ -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;
@@ -67,9 +61,6 @@ struct Queue {
Queue_FreeProc *free;
union {
struct {
InsSortNode *first;
} inssort;
struct {
uint max_size;
uint size;
@@ -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: