Beam-lib 2.15.1 |
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. 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... | |
BNameValue< T > & | front () |
Get first item in list. More... | |
BNameValue< T > & | rear () |
Get last item in list. More... | |
BNameValue< T > & | get (BIter i) |
Get item specified by iterator in list. More... | |
const BNameValue< T > & | get (BIter i) const |
Get item specified by iterator in list. More... | |
void | append (const BNameValue< T > &item) |
Append item to list. More... | |
void | append (const BList< BNameValue< T > > &l) |
Append list to list. More... | |
virtual void | insert (BIter &i, const BNameValue< T > &item) |
Insert item before item. More... | |
void | insertAfter (BIter &i, const BNameValue< 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 BNameValue< T > &i) |
Push item onto list. More... | |
BNameValue< T > | pop () |
Pop item from list deleteing item. More... | |
void | queueAdd (const BNameValue< T > &i) |
Add item to end of list. More... | |
BNameValue< T > | queueGet () |
Get item from front of list deleteing item. More... | |
int | has (const BNameValue< 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< 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. More... | |
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 >
| inline |
◆ findPos()
template<class T >
| inline |
The documentation for this class was generated from the following file:
Generated by 1.8.14