nsList< T, S > Class Template Reference

A numerically sortable List. More...

#include <list.h>

Inheritance diagram for nsList< T, S >:

Collaboration diagram for nsList< T, S >:

Public Member Functions
	nsList ()
void	qsort (bool=false)
	Quicksort is really quick: sorts 1 000 000 records (int) in less than 50 secs on a 486DX4/100 under Linux (32 MB Ram).
T *	sortin_r (T &, bool=false)
long	move_window (const S &val) const
Public Member Functions inherited from List< T >
	List ()
	List (const List< T > &)
List< T > &	operator= (const List< T > &)
List< T > &	alias (const List< T > &)
iterator	begin () const
iterator	end () const
riterator	rbegin () const
riterator	rend () const
T *	append ()
T *	append (T *)
void	erase (T *)
void	deltree (T *)
	Deletes List from item to end.
void	deltree ()
	~List ()
T *	getfirst () const
T *	getlast () const
T *	getcurr () const
T *	getnext () const
T *	getprev () const
T *	setfirst () const
T *	setlast () const
T *	setnext () const
T *	setprev () const
T *	inscurr ()
T *	inscurr (T *)
T *	delcurr ()
T *	detachcurr ()
unsigned long	getlength () const
unsigned long	size () const
unsigned long	getcurrnr () const
	Note that the numbers are 1-based.
unsigned long	getnr (const T *) const
unsigned long	getnr () const
T *	getbynr (long) const
T *	setcurrnr (const unsigned long) const
T *	setcurr (const T *rec) const
void	dumpList () const

Protected Member Functions
void	quick (ListItem< T > *, ListItem< T > *)
Protected Member Functions inherited from List< T >
void	checklast ()
ListItem< T > *	app ()

Protected Attributes
bool	dir
Protected Attributes inherited from List< T >
ListItem< T > *	curr
unsigned long	count
unsigned long	currnr
unsigned long	vers
ListItem< T > *	root
ListItem< T > *	last
ListItem< T > *	detached

Additional Inherited Members
Public Types inherited from List< T >
typedef ListIterator< T >	iterator
typedef ListRIterator< T >	riterator

Detailed Description

template<typename T, typename S = double>
class nsList< T, S >

A numerically sortable List.

ListItems have to def. a member function getval() which returns the value which is used to sort

Definition at line 770 of file list.h.

Constructor & Destructor Documentation

nsList()

template<typename T, typename S = double>

nsList< T, S >::nsList ( )

inline

Definition at line 781 of file list.h.

References dir, List< T >::List(), and T.

Member Function Documentation

move_window()

template<typename T, typename S>

long nsList< T, S >::move_window

(

const S &

val

)

const

Definition at line 922 of file list.h.

References List< T >::curr, List< T >::currnr, ListItem< T >::data, dir, ListItem< T >::next, ListItem< T >::prev, and List< T >::root.

qsort()

template<typename T, typename S>

void nsList< T, S >::qsort

(

bool

desc = false

)

Quicksort is really quick: sorts 1 000 000 records (int) in less than 50 secs on a 486DX4/100 under Linux (32 MB Ram).

Definition at line 854 of file list.h.

References dir, List< T >::last, NULL, quick(), and List< T >::root.

quick()

template<typename T, typename S>

void nsList< T, S >::quick ( ListItem< T > * left, ListItem< T > * right )

protected

Definition at line 788 of file list.h.

References ListItem< T >::data, dir, ListItem< T >::next, ListItem< T >::prev, quick(), right, and T.

Referenced by qsort(), and quick().

sortin_r()

template<class T, class S>

T * nsList< T, S >::sortin_r	(	T &	dat,
		bool	frst = false )

Definition at line 863 of file list.h.

References ListItem< T >::data, dir, List< T >::last, ListItem< T >::next, NULL, ListItem< T >::prev, List< T >::root, List< T >::setlast(), STD__, and T.

Member Data Documentation

dir

template<typename T, typename S = double>

bool nsList< T, S >::dir

protected

Definition at line 778 of file list.h.

Referenced by move_window(), nsList(), qsort(), quick(), and sortin_r().

---

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

• list.h