---

LINKLIST< T > Class Template Reference

#include <linklist.H>

List of all members.

Public Methods
	LINKLIST ()
	LINKLIST (const LINKLIST< T > &l)
const LINKLIST< T > &	operator= (const LINKLIST< T > &right)
Iterator	insert_before (Iterator position, const T &data)
Iterator	insert_after (Iterator position, const T &data)
Iterator	insert (Iterator position, const T &data)
Iterator	insert (const T &data)
Iterator	erase (Iterator position)
const T &	front () const
T &	front ()
const T &	back () const
T &	back ()
Iterator	begin () const
Iterator	end () const
Iterator	rbegin () const
Iterator	get_iterator_at (int index) const
Iterator	rget_iterator_at (int index) const
Iterator	push_front (const T &data)
Iterator	push_back (const T &data)
T	pop_front ()
T	pop_back ()
void	swap (Iterator pos1, Iterator pos2)
Iterator	find (const T &data)
void	clear ()
bool	empty () const
int	size ()
int	num ()
void	reverse ()
int	operator== (const LINKLIST< T > &)
Protected Attributes
int	_length
Node *	_bound
Friends
class	Iterator
struct	Node

template<class T>
class LINKLIST< T >

---

Constructor & Destructor Documentation

template<class T> LINKLIST< T >::LINKLIST (    )  [inline]

template<class T> LINKLIST< T >::LINKLIST (  const LINKLIST< T > &    l )  [inline]

---

Member Function Documentation

template<class T> T& LINKLIST< T >::back (    )  [inline]

template<class T> const T& LINKLIST< T >::back (    )  const [inline]

template<class T> Iterator LINKLIST< T >::begin (    )  const [inline]

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

template<class T> bool LINKLIST< T >::empty (    )  const [inline]

template<class T> Iterator LINKLIST< T >::end (    )  const [inline]

template<class T> Iterator LINKLIST< T >::erase (  Iterator    position )  [inline]

template<class T> Iterator LINKLIST< T >::find (  const T &    data )  [inline]

template<class T> T& LINKLIST< T >::front (    )  [inline]

template<class T> const T& LINKLIST< T >::front (    )  const [inline]

template<class T> Iterator LINKLIST< T >::get_iterator_at (  int    index )  const [inline]

template<class T> Iterator LINKLIST< T >::insert (  const T &    data )  [inline]

template<class T> Iterator LINKLIST< T >::insert (  Iterator    position, const T &    data )  [inline]

template<class T> Iterator LINKLIST< T >::insert_after (  Iterator    position, const T &    data )  [inline]

template<class T> Iterator LINKLIST< T >::insert_before (  Iterator    position, const T &    data )  [inline]

template<class T> int LINKLIST< T >::num (    )  [inline]

template<class T> const LINKLIST<T>& LINKLIST< T >::operator= (  const LINKLIST< T > &    right )  [inline]

template<class T> int LINKLIST< T >::operator== (  const LINKLIST< T > &    )  [inline]

template<class T> T LINKLIST< T >::pop_back (    )  [inline]

template<class T> T LINKLIST< T >::pop_front (    )  [inline]

template<class T> Iterator LINKLIST< T >::push_back (  const T &    data )  [inline]

template<class T> Iterator LINKLIST< T >::push_front (  const T &    data )  [inline]

template<class T> Iterator LINKLIST< T >::rbegin (    )  const [inline]

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

template<class T> Iterator LINKLIST< T >::rget_iterator_at (  int    index )  const [inline]

template<class T> int LINKLIST< T >::size (    )  [inline]

template<class T> void LINKLIST< T >::swap (  Iterator    pos1, Iterator    pos2 )  [inline]

---

Friends And Related Function Documentation

template<class T> friend class Iterator [friend]

template<class T> friend struct Node [friend]

---

Member Data Documentation

template<class T> Node* LINKLIST< T >::_bound [protected]

template<class T> int LINKLIST< T >::_length [protected]

---

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

• linklist.H

---