This repository has been archived on 2020-05-27. You can view files and clone it, but cannot push or open issues/pull-requests.
clinkedlist/Linked.c

169 lines
3.6 KiB
C
Raw Normal View History

2004-02-11 02:58:36 -05:00
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "List.h"
void MakeList ( List *mylist, short (*Compare) ( const Element Data1, const Element Data2 ) ) {
mylist->RootNode = malloc ( sizeof( Node ) );
if ( mylist->RootNode == NULL )
return; /* out of memory */
2004-02-11 02:58:36 -05:00
mylist->Compare = Compare;
mylist->RootNode->Previous = NULL;
mylist->RootNode->Next = NULL;
mylist->RootNode->NodeElement = NULL;
mylist->size = 0;
}
Node *Find ( List *mylist, Element Data ) {
Node *n = mylist->RootNode;
do {
2004-02-11 02:58:36 -05:00
if ( mylist->Compare ( n->NodeElement, Data ) == 0 )
return n;
n = n->Next;
} while ( n != mylist->RootNode );
/* not found */
2004-02-11 02:58:36 -05:00
return NULL;
}
Node *Get ( List *mylist, unsigned long index ) {
unsigned long i, halfsize;
2004-02-11 02:58:36 -05:00
Node *GetPtr;
/* gotta check for special case get's */
if ( index == 0 )
return mylist->RootNode;
2004-02-11 02:58:36 -05:00
if ( index > mylist->size )
return (Node *)NULL;
2004-02-11 02:58:36 -05:00
halfsize = mylist->size / 2;
if ( index > halfsize ) {
GetPtr = mylist->RootNode->Previous;
for ( i = 0; i < index; i++ )
GetPtr = GetPtr->Previous;
}
else {
GetPtr = mylist->RootNode->Next;
for ( i = 0; i < index; i++ )
GetPtr = GetPtr->Next;
}
2004-02-11 02:58:36 -05:00
return GetPtr;
}
short InsertAt ( List *mylist, Element Data, Node *Pos ) {
Node *New = NULL;
2004-02-11 02:58:36 -05:00
if ( mylist->size == 0 ) {
New = mylist->RootNode;
New->Next = NULL;
New->Previous = NULL;
} else {
New = malloc ( sizeof( Node ) );
if ( New == NULL )
return 0;
New->Next = Pos;
}
2004-02-11 02:58:36 -05:00
New->NodeElement = Data;
2004-02-11 02:58:36 -05:00
mylist->size++;
if ( Pos != NULL ) {
New->Previous = Pos->Previous;
Pos->Previous = New;
}
if ( New->Previous != NULL )
New->Previous->Next = New;
return 1;
2004-02-11 02:58:36 -05:00
}
short IsEmpty ( List *mylist ) {
return mylist->size == 0;
}
unsigned long ListSize ( List *mylist ) {
return mylist->size;
}
short Push ( List *mylist, Element Data ) {
return InsertAt ( mylist, Data, mylist->RootNode );
2004-02-11 02:58:36 -05:00
}
Element Pop ( List *mylist ) {
Node *Return = NULL, *Next = NULL;
Element data = NULL;
Return = mylist->RootNode;
if ( Return != NULL ) {
Next = Return->Next;
mylist->RootNode = Next;
data = Return->NodeElement;
if ( Return->Previous != NULL )
Return->Previous->Next = Next;
Next->Previous = Return->Previous;
free ( Return );
mylist->size--;
}
2004-02-11 02:58:36 -05:00
return data;
}
short Enqueue ( List *mylist, Element Data ) {
return InsertAt ( mylist, Data, mylist->RootNode );
2004-02-11 02:58:36 -05:00
}
Element Dequeue ( List *mylist ) {
return Pop ( mylist );
}
void Delete ( List *mylist, Element Data ) {
Node *Deleted;
Deleted = Find ( mylist, Data );
if ( Deleted == NULL )
return;
if ( Deleted->Next != NULL )
Deleted->Next->Previous = Deleted->Previous;
if ( Deleted->Previous != NULL )
Deleted->Previous->Next = Deleted->Next;
free ( Deleted->NodeElement );
free ( Deleted );
}
void DeletePosition ( List *mylist, unsigned long index ) {
2004-02-11 02:58:36 -05:00
Node *Deleted, *Prev, *Next;
unsigned long i;
2004-02-11 02:58:36 -05:00
Deleted = mylist->RootNode;
for ( i = 0; i < index; i++ ) {
Deleted = Deleted->Next;
if ( Deleted == NULL )
return;
}
Prev = Deleted->Previous;
Next = Deleted->Next;
free ( Deleted->NodeElement );
free ( Deleted );
if ( Prev != NULL )
Prev->Next = Next;
if ( Next != NULL )
Next->Previous = Prev;
mylist->size--;
}
void MakeEmpty ( List *mylist ) {
Node *node, *next;
next = NULL;
node = mylist->RootNode;
mylist->size = 0;
if ( node->Previous != NULL )
node->Previous->Next = NULL;
do {
next = node->Next;
2004-02-11 02:58:36 -05:00
if ( node->NodeElement != NULL )
free ( node->NodeElement );
free ( node );
node = next;
} while ( node != NULL );
2004-02-11 02:58:36 -05:00
}