BNameValueList< T > Class Template Reference

#include <BNameValue.h>

Inheritance diagram for BNameValueList< T >:

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

Additional Inherited Members
Public Types inherited from BList< BNameValue< T > >
typedef int(*	SortFunc) (BNameValue< T > &a, BNameValue< T > &b)
	Prototype for sorting function.
Protected Member Functions inherited from BList< BNameValue< T > >
virtual Node *	nodeGet (BIter i)
virtual const Node *	nodeGet (BIter i) const
virtual Node *	nodeCreate (const BNameValue< T > &item)
Protected Attributes inherited from BList< BNameValue< T > >
Node *	onodes
unsigned int	olength

Member Function Documentation

find()

template<class T >

T * BNameValueList< T >::find ( BString  name )

inline

findPos()

template<class T >

BIter BNameValueList< T >::findPos ( BString  name )

inline

---

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

• /src/cern/tms/tms/beam/libBeam/BNameValue.h