Search  

---

DList Class Reference

#include <DList.hpp>

List of all members.

Public Methods
	DList ()
virtual	~DList ()
void	clear ()
void	insert (Elem item)
void	append (Elem item)
Elem	remove ()
void	setFirst ()
void	prev ()
void	next ()
ULONG	length ()
void	setPos (ULONG pos)
void	setValue (Elem item)
Elem	getValue ()
Elem	currValue ()
bool	isEmpty () const
bool	isInList () const
long	getPos ()
long	size ()
long	find (Elem val)
long	findID (ULONG ID)
void	display ()
void	enqueue (Elem item)
Elem	dequeue ()
long	findTimeStamp (double stamp)
Private Attributes
DLink *	head
DLink *	tail
DLink *	curr
ULONG	pos
ULONG	nbElements

---

Constructor & Destructor Documentation

DList::DList (    )  [inline]

Definition at line 8 of file DList.cpp. : nbElements( 0 ), pos( 0 ) // No Element in the list yet ! { head = new DLink(); // Create an empty header Link // where prev and next are NULL curr = tail = head; // Share the same empty Link assert( head != NULL ); assert( curr != NULL ); assert( tail != NULL ); }

DList::~DList (    )  [virtual]

Definition at line 20 of file DList.cpp. { // Destructor while(head != NULL) { // Return Link nodes to free shared memory curr = head; // Set the current ptr to the head ptr. head = head->next; // The current head ptr now points to delete curr; // the next elem which become the new head, nbElements--; // so the current head ptr can be deleted. } }

---

Member Function Documentation

void DList::append (  Elem    item )

Definition at line 181 of file DList.cpp. Referenced by enqueue(), and insert(). { if ( tail == NULL ) { tail = curr = head; } // Create the new tail DLink(Elem Element, DLink* nextp, DLink* prevp) tail->next = new DLink( item, NULL, tail ); tail = tail->next; curr = tail; nbElements++; pos++; }

void DList::clear (    )

Definition at line 29 of file DList.cpp. { while (head->next != NULL) // Return Link nodes to free memory { curr = head->next; // Current ptr points to next header element head->next = curr->next; // Next head elem is the next current element delete curr; // Delete the current element nbElements--; } curr = tail = head; // The head, tail and current is the samething pos = 0; }

Elem DList::currValue (    )  [inline]

Definition at line 127 of file DList.cpp. { return getValue(); }

Elem DList::dequeue (    )  [inline]

Definition at line 202 of file DList.cpp. { assert( head != NULL ); curr = head->next; if ( curr == NULL ) return ZERO; return remove(); }

void DList::display (    )

Definition at line 247 of file DList.cpp. { if ( nbElements < 1 ) { printf( "Empty List\n" ); return; // Empty List } DLink* temp = curr; setFirst(); printf( "\n===========================================\n" ); while ( curr != NULL ) // Stop if we reach the end { printf( "%d) ", pos ); printf( "%d\t", curr->element ); printf( "%s\t", curr->element->pkt+4 ); printf( "[%u]\t", curr->element->pktLength ); if ( curr->prev == NULL ) { printf( "NULL \t" ); } else { printf( "%d\t", curr->prev->element ); } if ( curr->next == NULL ) { printf( "NULL \n" ); } else { printf( "%d\n", curr->next->element ); } curr = curr->next; pos++; } printf( "\n===========================================\n" ); fflush( stdout ); curr = temp; }

void DList::enqueue (  Elem    item )  [inline]

Definition at line 197 of file DList.cpp. { append( item ); }

long DList::find (  Elem    val )

Definition at line 295 of file DList.cpp. { if ( curr == NULL ) { curr = head; pos = 0; } if ( nbElements < 1 ) { printf( "Can't search inside an empty list\n" ); return -50; } if ( curr == head ) { curr = head->next; // We start at the next header element pos = 1; } register ULONG i = 0; DLink* temp = curr; for( ; curr != NULL; i++, pos++ ) // Stop if we reach the tail { if ( curr->element == ZERO ) // Valid data inside !? { exit( 1 ); printf( "Search process aborted, since current element's data are not defined.\n" ); curr = temp; return -100 - i; } if ( curr->element == val ) { return pos; // Found it } else { curr = curr->next; } } curr = temp; return -1; // Not found }

long DList::findID (  ULONG    ID )

Definition at line 344 of file DList.cpp. { if ( curr == NULL ) { curr = head; pos = 0; } if ( nbElements < 1 ) { // printf( "Can't search inside an empty list\n" ); return -50; } if ( curr == head ) { curr = head->next; // We start at the next header element pos = 1; } register ULONG i = 0; DLink* temp = curr; for( ; curr != NULL; i++, pos++ ) // Stop if we reach the tail { if ( curr->element == ZERO ) // Valid data inside !? { exit( 1 ); printf( "Search process aborted, since current element's data are not defined.\n" ); curr = temp; return -100 - i; } if ( curr->element->getID() == ID ) { return pos; // Found it } else { curr = curr->next; } } curr = temp; return -1; // Not found }

long DList::findTimeStamp (  double    stamp )

Definition at line 392 of file DList.cpp. { if ( curr == NULL ) { setFirst(); } if ( nbElements < 1 ) { // printf( "Can't search inside an empty list\n" ); return -50; } if ( curr == head ) { setFirst(); } register ULONG i = 0; DLink* temp = curr; for( ; curr != NULL; i++, pos++ ) // Stop if we reach the tail { if ( curr->element == ZERO ) // Valid data inside !? { exit( 1 ); printf( "Search process aborted, since current element's data are not defined.\n" ); curr = temp; return -100 - i; } if ( curr->element->getTimeStamp() <= stamp ) { printf("Found at %d\n",pos); fflush(stdout); return pos; // Found it } else { curr = curr->next; } } curr = temp; return -1; // Not found }

long DList::getPos (    )  [inline]

Definition at line 242 of file DList.cpp. { return pos; }

Elem DList::getValue (    )

Definition at line 132 of file DList.cpp. Referenced by currValue(). { if ( curr != NULL && curr != head && nbElements > 0 ) { return curr->element; // Return value of the current element } return ZERO; }

void DList::insert (  Elem    item )

Definition at line 152 of file DList.cpp. { if ( curr == NULL || curr->prev == NULL ) { curr = head; pos = 0; append( item ); return; } // Create the new DLink(Elem Element, DLink* nextp, DLink* prevp) curr->next = new DLink( item, curr->next, curr ); if ( curr->next->next != NULL ) // New element is not the tail ? { curr->next->next->prev = curr->next; // Set the old curr->next DLink } // Backward ptr to the new DLink. if ( tail == curr ) { tail = curr->next; } curr = curr->next; // New element is now the current. nbElements++; }

bool DList::isEmpty (    )  const [inline]

Definition at line 142 of file DList.cpp. { return ( head->next == NULL ); }

bool DList::isInList (    )  const [inline]

Definition at line 147 of file DList.cpp. { return ( curr != NULL ); }

ULONG DList::length (    )

Definition at line 92 of file DList.cpp. { ULONG cnt = 0; for(DLink* temp = head->next; // Create a temp which next head ptr. temp != NULL; // Until tail i.e. NULL temp = temp->next ) // Move the the next Link ptr. { cnt++; // Count the number of elements available } nbElements = cnt; return cnt; // which are not NULL. }

void DList::next (    )  [inline]

Definition at line 70 of file DList.cpp. { if ( curr != NULL ) // if current is known. { if ( curr->next == NULL ) { curr = tail; pos = nbElements; } else { curr = curr->next; // Current ptr is now the next position ptr pos = 0; } } }

void DList::prev (    )  [inline]

Definition at line 56 of file DList.cpp. { if (curr != NULL) { curr = curr->prev; // Current ptr is now the previous position ptr pos--; } else { curr = head; pos = 0; } }

Elem DList::remove (    )

Definition at line 211 of file DList.cpp. { assert( curr != NULL ); // Must be a valid position in the list if ( curr == head ) { curr = head->next; } assert( nbElements > 0 ); // Is it the head ? Elem temp = curr->element; // Save the removed element's data DLink* newCurr = curr->prev; // Save the new current position curr->prev->next = curr->next; // Set prev elem forward ptr to next elem if ( curr->next == NULL ) // Is it the tail ? { tail == curr->prev; // Previous element is now the tail } else { curr->next->prev = curr->prev; // Set next elem backward ptr to prev elem } delete curr; // Delete the current removed Link curr = newCurr; // Moving backward, in case we are at the tail nbElements--; // We just erase an element, so substract it. pos--; return temp; // Send the old current data to user }

void DList::setFirst (    )  [inline]

Definition at line 42 of file DList.cpp. Referenced by display(), and findTimeStamp(). { if ( head->next != NULL ) { curr = head; pos = 1; } else { curr = head; pos = 0; } }

void DList::setPos (  ULONG    pos )

Definition at line 106 of file DList.cpp. { curr = head; // The header is position 0 pos = 0; for( register ULONG i = 0; (curr != NULL) && (i < pos); // Move to position 1, 2, ... , pos. i++ ) { curr = curr->next; pos++; } }

void DList::setValue (  Elem    val )

Definition at line 119 of file DList.cpp. { if ( curr != NULL && curr != head && nbElements > 0 ) { curr->element = val; } }

long DList::size (    )  [inline]

Definition at line 87 of file DList.cpp. { return nbElements; }

---

Member Data Documentation

DLink* DList::curr [private]

Definition at line 47 of file DList.hpp.

DLink* DList::head [private]

Definition at line 45 of file DList.hpp.

ULONG DList::nbElements [private]

Definition at line 50 of file DList.hpp.

ULONG DList::pos [private]

Definition at line 49 of file DList.hpp.

DLink* DList::tail [private]

Definition at line 46 of file DList.hpp.

---

The documentation for this class was generated from the following files:

• C:/temp/src/j2k/DataType/Link/DList.hpp
• C:/temp/src/j2k/DataType/Link/DList.cpp

---