List Class Reference

#include <list.h>

List of all members.

Public Member Functions
	List ()
	~List ()
void	Prepend (void *item)
void	Append (void *item)
void *	Remove ()
void	Mapcar (VoidFunctionPtr func)
bool	IsEmpty ()
void	SortedInsert (void *item, int sortKey)
void *	SortedRemove (int *keyPtr)
ListElement *	GetFirst ()

---

Constructor & Destructor Documentation

List::List (   )

Definition at line 43 of file list.cc. { first = last = NULL; }

List::~List (   )

Definition at line 58 of file list.cc. References Remove(). { while (Remove() != NULL) ; // delete all the list elements }

---

Member Function Documentation

void List::Append (  void *  item  )

Definition at line 76 of file list.cc. References IsEmpty(), and ListElement::next. Referenced by SynchList::Append(), Semaphore::P(), and Scheduler::ReadyToRun(). { ListElement *element = new ListElement(item, 0); if (IsEmpty()) { // list is empty first = element; last = element; } else { // else put it after last last->next = element; last = element; } }

ListElement * List::GetFirst (   )

Definition at line 251 of file list.cc. { return first; }

bool List::IsEmpty (   )

Definition at line 159 of file list.cc. References FALSE, and TRUE. Referenced by Append(), Scheduler::IsEmpty(), Prepend(), SynchList::Remove(), SortedInsert(), SortedRemove(), and Interrupt::~Interrupt(). { if (first == NULL) return TRUE; else return FALSE; }

void List::Mapcar (  VoidFunctionPtr  func  )

Definition at line 144 of file list.cc. References DEBUG(), ListElement::item, ListElement::next, and VoidFunctionPtr. Referenced by Interrupt::DumpState(), SynchList::Mapcar(), and Scheduler::Print(). { for (ListElement *ptr = first; ptr != NULL; ptr = ptr->next) { DEBUG('l', "In mapcar, about to invoke %x(%x)\n", func, ptr->item); (*func)((int)ptr->item); } }

void List::Prepend (  void *  item  )

Definition at line 105 of file list.cc. References IsEmpty(), and ListElement::next. { ListElement *element = new ListElement(item, 0); if (IsEmpty()) { // list is empty first = element; last = element; } else { // else put it before first element->next = first; first = element; } }

void * List::Remove (   )

Definition at line 129 of file list.cc. References SortedRemove(). Referenced by Scheduler::FindNextToRun(), SynchList::Remove(), Semaphore::V(), Interrupt::~Interrupt(), and ~List(). { return SortedRemove(NULL); // Same as SortedRemove, but ignore the key }

void List::SortedInsert (  void *  item, int  sortKey )

Definition at line 182 of file list.cc. References IsEmpty(), ListElement::key, and ListElement::next. Referenced by Interrupt::Schedule(). { ListElement *element = new ListElement(item, sortKey); ListElement *ptr;// keep track if (IsEmpty()) { // if list is empty, put first = element; last = element; } else if (sortKey < first->key) { // item goes on front of list element->next = first; first = element; } else { // look for first elt in list bigger than item for (ptr = first; ptr->next != NULL; ptr = ptr->next) { if (sortKey < ptr->next->key) { element->next = ptr->next; ptr->next = element; return; } } last->next = element;// item goes at end of list last = element; } }

void * List::SortedRemove (  int *  keyPtr  )

Definition at line 227 of file list.cc. References IsEmpty(), ListElement::item, ListElement::key, and ListElement::next. Referenced by Remove(). { ListElement *element = first; void *thing; if (IsEmpty()) return NULL; thing = first->item; if (first == last) { // list had one item, now has none first = NULL; last = NULL; } else { first = element->next; } if (keyPtr != NULL) *keyPtr = element->key; delete element; return thing; }

---

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

• list.h
• list.cc

---