list.h File Reference

Routines to manage a singly-linked list of "things". Defining TRUE and FALSE is usually a Bad Idea, because you will probably be inconsistent with anyone else who had the same clever idea. Therefore: DON'T USE THIS FILE. More...

#include "copyright.h"
#include "utility.h"

Go to the source code of this file.

Classes
class	ListElement
	The following class defines a "list element" – which is used to keep track of one item on a list. It is equivalent to a LISP cell, with a "car" ("next") pointing to the next element on the list, and a "cdr" ("item") pointing to the item on the list. More...
class	List

Detailed Description

Routines to manage a singly-linked list of "things". Defining TRUE and FALSE is usually a Bad Idea, because you will probably be inconsistent with anyone else who had the same clever idea. Therefore: DON'T USE THIS FILE.

Data structures to manage LISP-like lists.

Routines to manage a singly-linked list of "things".

Author

Olivier Hureau, Hugo Feydel , Julien ALaimo

 A "ListElement" is allocated for each item to be put on the
 list; it is de-allocated when the item is removed. This means
 we don't need to keep a "next" pointer in every object we
 want to put on a list.

 NOTE: Mutual exclusion must be provided by the caller.
 If you want a synchronized list, you must use the routines 
 in synchlist.cc.

Copyright (c) 1992-1993 The Regents of the University of California. All rights reserved. See copyright.h for copyright notice and limitation of liability and disclaimer of warranty provisions.

Author

Olivier Hureau, Hugo Feydel , Julien ALaimo

 As in LISP, a list can contain any type of data structure
 as an item on the list: thread control blocks,
 pending interrupts, etc.  That is why each item is a "void *",
 or in other words, a "pointers to anything".

Copyright (c) 1992-1993 The Regents of the University of California. All rights reserved. See copyright.h for copyright notice and limitation of liability and disclaimer of warranty provisions.