---

LIST Class Template Reference

template class LIST. More...

#include <list.h>

List of all members.

Public Types
typedef list_type*	handle
	define a handle type to abstract the list_type type. More...
Public Methods
	LIST (void)
	class constructor. More...
	LIST (const LIST< T > &rhs)
	The copy constructor copies the list pointer. More...
	~LIST ()
	destructor does nothing. More...
void	dealloc (void)
	deallocate the list. More...
void	add (T data)
	Add an element to the list. More...
void	reverse (void)
	reverse the list. More...
unsigned int	length (void)
	return the lenght of the list. More...
handle	remove (void)
	remove. More...
T	get_item (handle h)
	given a handle, return the associated data item. More...
handle	first (void)
	get the first element from the list. More...
handle	next (handle h)
	iterator to get the next element. More...
Private Attributes
list_type*	list
	list head. More...

---

Detailed Description

template<class T> class LIST

template class LIST.

This is a generic list type. It should be instantiated with a scalar type, like an integer or a pointer to a larger type (e.g., a string or a structure). For example

 
      LIST<char *> list;
      LIST<my_struct *> list;

The list "links" are allocated in a memory pool. This allocation is handled by the local version of new in list_type. The memory allocated for the list_type objects will be deallocated when the memory pool is freed.

Definition at line 59 of file list.h.

---

Member Typedef Documentation

template<class T> typedef list_type * LIST<T>::handle

define a handle type to abstract the list_type type. Definition at line 88 of file list.h.

---

Constructor & Destructor Documentation

template<class T> LIST<T>::LIST<T> ( void ) [inline]

class constructor. Definition at line 92 of file list.h. { list = 0; }

template<class T> LIST<T>::LIST<T> ( const LIST< T > & rhs ) [inline]

The copy constructor copies the list pointer. Definition at line 99 of file list.h. { list = rhs.list; }

template<class T> LIST<T>::~LIST<T> ( ) [inline]

destructor does nothing. Definition at line 105 of file list.h. {}

---

Member Function Documentation

template<class T> void LIST<T>::add ( T data ) [inline]

Add an element to the list. Definition at line 117 of file list.h. Referenced by invpacktree_int::new_level(), invpacktree::new_level(), invpacktree_int::reduce(), and invpacktree::reduce(). { list_type *t; t = new list_type(); t->data = data; t->next = 0; if (list == 0) { list = t; } else { t->next = list; list = t; } } // add

template<class T> void LIST<T>::dealloc ( void ) [inline]

deallocate the list. Definition at line 109 of file list.h. { while ( remove() != 0 ) /* nada */; } // dealloc

template<class T> handle LIST<T>::first ( void ) [inline]

get the first element from the list. Definition at line 193 of file list.h. Referenced by invpacktree_int::add_elem(), invpacktree::add_elem(), invpacktree::invpacktree(), invpacktree_int::invpacktree_int(), invpacktree_int::reduce(), and invpacktree::reduce(). { return list; } // first

template<class T> T LIST<T>::get_item ( handle h ) [inline]

given a handle, return the associated data item. Definition at line 185 of file list.h. Referenced by invpacktree_int::add_elem(), invpacktree::add_elem(), invpacktree::invpacktree(), invpacktree_int::invpacktree_int(), invpacktree_int::reduce(), and invpacktree::reduce(). { return h->data; } // get_item

template<class T> unsigned int LIST<T>::length ( void ) [inline]

return the lenght of the list. Definition at line 150 of file list.h. { list_type *elem; unsigned int cnt = 0; for (elem = list; elem != 0; elem = elem->next) cnt++; return cnt; } // lenght

template<class T> handle LIST<T>::next ( handle h ) [inline]

iterator to get the next element. Definition at line 200 of file list.h. { list_type *next = 0; if (h != 0) { next = h->next; } return next; } // next

template<class T> handle LIST<T>::remove ( void ) [inline]

remove. Remove an element from the start of the list and return the first element of the remaining list. This function relies on the fact that the list elements were allocated from a pool. The memory for these elements will be recovered when the pool is deallocated. Definition at line 171 of file list.h. Referenced by dealloc(), invpacktree::invpacktree(), invpacktree_int::invpacktree_int(), invpacktree_int::reduce(), and invpacktree::reduce(). { list_type *t; if (list != 0) { t = list; list = t->next; // no delete t; } return list; } // remove

template<class T> void LIST<T>::reverse ( void ) [inline]

reverse the list. Definition at line 135 of file list.h. { list_type *revlist = 0; list_type *next; for (list_type *t = list; t != 0; t = next) { next = t->next; t->next = revlist; revlist = t; } list = revlist; } // reverse

---

Member Data Documentation

template<class T> list_type * LIST<T>::list [private]

list head. Definition at line 84 of file list.h.

---

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

• list.h

---