List of Entries. Where an entry is a name value pair. More...

#include <BEntry.h>

Inheritance diagram for BEntryList:

Public Member Functions
	BEntryList ()

int	isSet (BString name)
	1 if name is in list and value is set

BEntry *	find (BString name)
	Returns entry if name is found otherwise NULL.

BString	findValue (BString name)
	Returns value of name. Returns "" if name not found.

int	setValue (BString name, BString value)
	Set the value of name. Returns 0 if name not found.

int	setValueRaw (BString name, BString value)
	Raw setting of value without looking up existing entry.

void	deleteEntry (BString name)
	Deletes the entry.

void	print ()
	Print list.

BString	getString ()
	Return list as string. Each Entry padded and on a new line.

void	insert (BIter &i, const BEntry &item)

void	del (BIter &i)
	Delete specified item.

void	clear ()
	Clear the list.

BEntryList &	operator= (const BEntryList &l)

Public Member Functions inherited from BList< BEntry >
	BList ()

	BList (const BList< BEntry > &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.

BEntry &	front ()
	Get first item in list.

BEntry &	rear ()
	Get last item in list.

BEntry &	get (BIter i)
	Get item specified by iterator in list.

const BEntry &	get (BIter i) const
	Get item specified by iterator in list.

void	append (const BEntry &item)
	Append item to list.

void	append (const BList< BEntry > &l)
	Append list to list.

virtual void	insert (BIter &i, const BEntry &item)
	Insert item before item.

void	insertAfter (BIter &i, const BEntry &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 BEntry &i)
	Push item onto list.

BEntry	pop ()
	Pop item from list deleteing item.

void	queueAdd (const BEntry &i)
	Add item to end of list.

BEntry	queueGet ()
	Get item from front of list deleteing item.

int	has (const BEntry &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< BEntry > &	operator= (const BList< BEntry > &l)

BEntry &	operator[] (int i)

const BEntry &	operator[] (int i) const

BEntry &	operator[] (BIter i)

const BEntry &	operator[] (const BIter &i) const

BList< BEntry >	operator+ (const BList< BEntry > &l) const

Private Attributes
BIter	olastPos

Additional Inherited Members
Public Types inherited from BList< BEntry >
typedef int(*	SortFunc) (BEntry &a, BEntry &b)
	Prototype for sorting function.

Protected Member Functions inherited from BList< BEntry >
virtual Node *	nodeGet (BIter i)

virtual const Node *	nodeGet (BIter i) const

virtual Node *	nodeCreate (const BEntry &item)

Protected Attributes inherited from BList< BEntry >
Node *	onodes

unsigned int	olength

Detailed Description

List of Entries. Where an entry is a name value pair.

Constructor & Destructor Documentation

◆ BEntryList()

BEntryList::BEntryList ( )

Member Function Documentation

◆ clear()

void BEntryList::clear ( )

virtual

Clear the list.

Reimplemented from BList< BEntry >.

◆ del()

void BEntryList::del ( BIter & i )

virtual

Delete specified item.

Reimplemented from BList< BEntry >.

◆ deleteEntry()

void BEntryList::deleteEntry ( BString name )

Deletes the entry.

◆ find()

BEntry * BEntryList::find ( BString name )

Returns entry if name is found otherwise NULL.

◆ findValue()

BString BEntryList::findValue ( BString name )

Returns value of name. Returns "" if name not found.

◆ getString()

BString BEntryList::getString ( )

Return list as string. Each Entry padded and on a new line.

◆ insert()

void BEntryList::insert	(	BIter &	i,
		const BEntry &	item
	)

◆ isSet()

int BEntryList::isSet ( BString name )

1 if name is in list and value is set

◆ operator=()

BEntryList & BEntryList::operator= ( const BEntryList & l )

◆ print()

void BEntryList::print ( )

Print list.

◆ setValue()

int BEntryList::setValue	(	BString	name,
		BString	value
	)

Set the value of name. Returns 0 if name not found.

◆ setValueRaw()

int BEntryList::setValueRaw	(	BString	name,
		BString	value
	)

Raw setting of value without looking up existing entry.

Member Data Documentation

◆ olastPos

BIter BEntryList::olastPos

private

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

/src/cern/tms/tms/beam/libBeam/BEntry.h
/src/cern/tms/tms/beam/libBeam/BEntry.cpp

Account

Public Member Functions

Private Attributes

Additional Inherited Members