Search  

---

List Class Template Reference

List of all members.

Public Methods
	List (int=LIST_SIZE)
	~List ()
void	clear ()
void	insert (const Elem)
void	append (const Elem)
Elem	remove ()
void	setFirst ()
void	prev ()
void	next ()
int	length () const
void	setPos (int)
void	setValue (const Elem)
Elem	currValue () const
bool	isEmpty () const
bool	isInList () const
bool	find (int)
	List (int=LIST_SIZE)
	~List ()
void	clear ()
void	insert (const Elem)
void	append (const Elem)
Elem	remove ()
void	setFirst ()
void	prev ()
void	next ()
int	length () const
void	setPos (int)
void	setValue (const Elem)
Elem	currValue () const
bool	isEmpty () const
bool	isInList () const
bool	find (int)
Private Attributes
int	msize
int	numinlist
int	curr
Elem *	listarray

template<class Elem>
class List< Elem >

---

Constructor & Destructor Documentation

template<class Elem> List< Elem >::List (  int    sz = LIST_SIZE )

Definition at line 30 of file LADTTEX.C. { // Constructor: initialize msize = sz; numinlist = curr = 0; listarray = new Elem[sz]; }

template<class Elem> List< Elem >::~List (    )

Definition at line 36 of file LADTTEX.C. : return array space { delete [] listarray; }

template<class Elem> List< Elem >::List (  int    = LIST_SIZE )

template<class Elem> List< Elem >::~List (    )

---

Member Function Documentation

template<class Elem> void List< Elem >::append (  const    Elem )

template<class Elem> void List< Elem >::append (  const Elem    item )

Definition at line 56 of file LADTTEX.C. Referenced by build_tree(), main(), and read_freqs(). { // Insert at tail assert(numinlist < msize); // List must not be full listarray[numinlist++] = item; // Increment list size }

template<class Elem> void List< Elem >::clear (    )

template<class Elem> void List< Elem >::clear (    )

Definition at line 40 of file LADTTEX.C. { numinlist = curr = 0; } // Simply reinitialize values

template<class Elem> Elem List< Elem >::currValue (    )  const

template<class Elem> Elem List< Elem >::currValue (    )  const

Referenced by build_tree(), print(), and read_freqs().

template<class Elem> bool List< Elem >::find (  int    )

template<class Elem> bool List< Elem >::find (  int    )

template<class Elem> void List< Elem >::insert (  const    Elem )

template<class Elem> void List< Elem >::insert (  const Elem    item )

Definition at line 45 of file LADTTEX.C. Referenced by build_tree(), main(), and read_freqs(). { // Array must not be full and curr must be a legal position assert((numinlist < msize) && (curr >=0) && (curr <= numinlist)); for(int i=numinlist; i>curr; i--) // Shift up to make room listarray[i] = listarray[i-1]; listarray[curr] = item; numinlist++; // Increment current list size }

template<class Elem> bool List< Elem >::isEmpty (    )  const

template<class Elem> bool List< Elem >::isEmpty (    )  const

Referenced by print(), and remove().

template<class Elem> bool List< Elem >::isInList (    )  const

template<class Elem> bool List< Elem >::isInList (    )  const

Referenced by build_tree(), print(), read_freqs(), and remove().

template<class Elem> int List< Elem >::length (    )  const

template<class Elem> int List< Elem >::length (    )  const

Definition at line 82 of file LADTTEX.C. { return numinlist; }

template<class Elem> void List< Elem >::next (    )

template<class Elem> void List< Elem >::next (    )

Definition at line 79 of file LADTTEX.C. Referenced by build_tree(), main(), print(), and read_freqs(). { curr++; } // Move to next position

template<class Elem> void List< Elem >::prev (    )

template<class Elem> void List< Elem >::prev (    )

Definition at line 76 of file LADTTEX.C. { curr--; } // Move to previous pos

template<class Elem> Elem List< Elem >::remove (    )

template<class Elem> Elem List< Elem >::remove (    )

Definition at line 62 of file LADTTEX.C. Referenced by build_tree(). { // Remove and return current Elem assert(!isEmpty() && isInList()); // Must be Elem to remove Elem temp = listarray[curr]; // Store removed Elem for(int i=curr; i<numinlist-1; i++) // Shift elements down listarray[i] = listarray[i+1]; numinlist--; // Decrement current list size return temp; }

template<class Elem> void List< Elem >::setFirst (    )

template<class Elem> void List< Elem >::setFirst (    )

Definition at line 72 of file LADTTEX.C. Referenced by build_tree(), main(), print(), and read_freqs(). { curr = 0; }

template<class Elem> void List< Elem >::setPos (  int    )

template<class Elem> void List< Elem >::setPos (  int    pos )

Definition at line 86 of file LADTTEX.C. Referenced by build_tree(). {curr = pos; }

template<class Elem> void List< Elem >::setValue (  const    Elem )

template<class Elem> void List< Elem >::setValue (  const    Elem )

---

Member Data Documentation

template<class Elem> int List::curr [private]

Definition at line 8 of file LADTTEX.C.

template<class Elem> Elem* List::listarray [private]

Definition at line 9 of file LADTTEX.C.

template<class Elem> int List::msize [private]

Definition at line 6 of file LADTTEX.C.

template<class Elem> int List::numinlist [private]

Definition at line 7 of file LADTTEX.C.

---

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

• C:/temp/src/j2k/Deprecated/RefList/LADTIEX.C
• C:/temp/src/j2k/Deprecated/RefList/LADTTEX.C

---