Electronics and Software
Engineering Innovation
Beam-lib  2.15.1

Template based list class. More...

#include <BList.h>

Inheritance diagram for BList< T >:
BQueue< T >

Classes

class  Node
 

Public Types

typedef int(* SortFunc) (T &a, T &b)
 Prototype for sorting function. More...
 

Public Member Functions

 BList ()
 
 BList (const BList< T > &l)
 
virtual ~BList ()
 
void start (BIter &i) const
 Iterator to start of list. More...
 
BIter begin () const
 Iterator for start of list. More...
 
BIter end () const
 Iterator for end of list. More...
 
BIter end (BIter &i) const
 Iterator for end of list. More...
 
void next (BIter &i) const
 Iterator for next item in list. More...
 
void prev (BIter &i)
 Iterator for previous item in list. More...
 
BIter goTo (int pos) const
 Iterator for pos item in list. More...
 
int position (BIter i)
 Postition in list item with iterator i. More...
 
unsigned int number () const
 Number of items in list. More...
 
unsigned int size () const
 Number of items in list. More...
 
int isEnd (BIter &i) const
 True if iterator refers to last item. More...
 
T & front ()
 Get first item in list. More...
 
T & rear ()
 Get last item in list. More...
 
T & get (BIter i)
 Get item specified by iterator in list. More...
 
const T & get (BIter i) const
 Get item specified by iterator in list. More...
 
void append (const T &item)
 Append item to list. More...
 
virtual void insert (BIter &i, const T &item)
 Insert item before item. More...
 
void insertAfter (BIter &i, const T &item)
 Insert item after item. More...
 
virtual void clear ()
 Clear the list. More...
 
virtual void del (BIter &i)
 Delete specified item. More...
 
void deleteLast ()
 Delete last item. More...
 
void deleteFirst ()
 Delete fisrt item. More...
 
void push (const T &i)
 Push item onto list. More...
 
pop ()
 Pop item from list deleteing item. More...
 
void queueAdd (const T &i)
 Add item to end of list. More...
 
queueGet ()
 Get item from front of list deleteing item. More...
 
void append (const BList< T > &l)
 Append list to list. More...
 
int has (const T &i) const
 Checks if the item is in the list. More...
 
void swap (BIter i1, BIter i2)
 Swap two items in list. More...
 
void sort ()
 Sort list based on get(i) values. More...
 
void sort (SortFunc func)
 Sort list based on Sort func. More...
 
BList< T > & operator= (const BList< T > &l)
 
T & operator[] (int i)
 
const T & operator[] (int i) const
 
T & operator[] (BIter i)
 
const T & operator[] (const BIter &i) const
 
BList< T > operator+ (const BList< T > &l) const
 

Protected Member Functions

virtual NodenodeGet (BIter i)
 
virtual const NodenodeGet (BIter i) const
 
virtual NodenodeCreate (const T &item)
 

Protected Attributes

Nodeonodes
 
unsigned int olength
 

Private Member Functions

virtual NodenodeCreate ()
 

Detailed Description

template<class T>
class BList< T >

Template based list class.

Member Typedef Documentation

◆ SortFunc

template<class T>
typedef int(* BList< T >::SortFunc) (T &a, T &b)

Prototype for sorting function.

Constructor & Destructor Documentation

◆ BList() [1/2]

template<class T >
BList< T >::BList ( )

◆ BList() [2/2]

template<class T>
BList< T >::BList ( const BList< T > &  l)

◆ ~BList()

template<class T >
BList< T >::~BList ( )
virtual

Member Function Documentation

◆ append() [1/2]

template<class T>
void BList< T >::append ( const T &  item)

Append item to list.

◆ append() [2/2]

template<class T>
void BList< T >::append ( const BList< T > &  l)

Append list to list.

◆ begin()

template<class T >
BIter BList< T >::begin ( ) const

Iterator for start of list.

◆ clear()

template<class T >
void BList< T >::clear ( )
virtual

Clear the list.

Reimplemented in BEntryFile, BDir, BEntryList, BDict< Type >, BQueue< T >, and BQueue< BoapMcPacket >.

◆ del()

template<class T >
void BList< T >::del ( BIter i)
virtual

Delete specified item.

Reimplemented in BEntryList, and BDict< Type >.

◆ deleteFirst()

template<class T >
void BList< T >::deleteFirst ( )

Delete fisrt item.

◆ deleteLast()

template<class T >
void BList< T >::deleteLast ( )

Delete last item.

◆ end() [1/2]

template<class T >
BIter BList< T >::end ( ) const

Iterator for end of list.

◆ end() [2/2]

template<class T >
BIter BList< T >::end ( BIter i) const

Iterator for end of list.

◆ front()

template<class T >
T & BList< T >::front ( )

Get first item in list.

◆ get() [1/2]

template<class T >
T & BList< T >::get ( BIter  i)

Get item specified by iterator in list.

◆ get() [2/2]

template<class T >
const T & BList< T >::get ( BIter  i) const

Get item specified by iterator in list.

◆ goTo()

template<class T >
BIter BList< T >::goTo ( int  pos) const

Iterator for pos item in list.

◆ has()

template<class T>
int BList< T >::has ( const T &  i) const

Checks if the item is in the list.

◆ insert()

template<class T>
void BList< T >::insert ( BIter i,
const T &  item 
)
virtual

Insert item before item.

Reimplemented in BEntryList, and BDict< Type >.

◆ insertAfter()

template<class T>
void BList< T >::insertAfter ( BIter i,
const T &  item 
)

Insert item after item.

◆ isEnd()

template<class T >
int BList< T >::isEnd ( BIter i) const

True if iterator refers to last item.

◆ next()

template<class T >
void BList< T >::next ( BIter i) const

Iterator for next item in list.

◆ nodeCreate() [1/2]

template<class T>
BList< T >::Node * BList< T >::nodeCreate ( const T &  item)
protectedvirtual

◆ nodeCreate() [2/2]

template<class T>
BList< T >::Node * BList< T >::nodeCreate ( )
privatevirtual

◆ nodeGet() [1/2]

template<class T >
BList< T >::Node * BList< T >::nodeGet ( BIter  i)
protectedvirtual

◆ nodeGet() [2/2]

template<class T >
const BList< T >::Node * BList< T >::nodeGet ( BIter  i) const
protectedvirtual

◆ number()

template<class T >
unsigned int BList< T >::number ( ) const

Number of items in list.

◆ operator+()

template<class T>
BList< T > BList< T >::operator+ ( const BList< T > &  l) const

◆ operator=()

template<class T>
BList< T > & BList< T >::operator= ( const BList< T > &  l)

◆ operator[]() [1/4]

template<class T >
T & BList< T >::operator[] ( int  i)

◆ operator[]() [2/4]

template<class T >
const T & BList< T >::operator[] ( int  i) const

◆ operator[]() [3/4]

template<class T >
T & BList< T >::operator[] ( BIter  i)

◆ operator[]() [4/4]

template<class T >
const T & BList< T >::operator[] ( const BIter i) const

◆ pop()

template<class T >
T BList< T >::pop ( )

Pop item from list deleteing item.

◆ position()

template<class T >
int BList< T >::position ( BIter  i)

Postition in list item with iterator i.

◆ prev()

template<class T >
void BList< T >::prev ( BIter i)

Iterator for previous item in list.

◆ push()

template<class T>
void BList< T >::push ( const T &  i)

Push item onto list.

◆ queueAdd()

template<class T>
void BList< T >::queueAdd ( const T &  i)

Add item to end of list.

◆ queueGet()

template<class T >
T BList< T >::queueGet ( )

Get item from front of list deleteing item.

◆ rear()

template<class T >
T & BList< T >::rear ( )

Get last item in list.

◆ size()

template<class T >
unsigned int BList< T >::size ( ) const

Number of items in list.

◆ sort() [1/2]

template<class T >
void BList< T >::sort ( )

Sort list based on get(i) values.

◆ sort() [2/2]

template<class T >
void BList< T >::sort ( SortFunc  func)

Sort list based on Sort func.

◆ start()

template<class T >
void BList< T >::start ( BIter i) const

Iterator to start of list.

◆ swap()

template<class T >
void BList< T >::swap ( BIter  i1,
BIter  i2 
)

Swap two items in list.

Member Data Documentation

◆ olength

template<class T>
unsigned int BList< T >::olength
protected

◆ onodes

template<class T>
Node* BList< T >::onodes
protected

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