BNameValueList< T > Member List

This is the complete list of members for BNameValueList< T >, including all inherited members.

append(const BNameValue< T > &item)	BList< BNameValue< T > >
append(const BList< BNameValue< T > > &l)	BList< BNameValue< T > >
begin() const	BList< BNameValue< T > >
BList()	BList< BNameValue< T > >
BList(const BList< BNameValue< T > > &l)	BList< BNameValue< T > >
clear()	BList< BNameValue< T > >	virtual
del(BIter &i)	BList< BNameValue< T > >	virtual
deleteFirst()	BList< BNameValue< T > >
deleteLast()	BList< BNameValue< T > >
end() const	BList< BNameValue< T > >
end(BIter &i) const	BList< BNameValue< T > >
find(BString name)	BNameValueList< T >	inline
findPos(BString name)	BNameValueList< T >	inline
front()	BList< BNameValue< T > >
get(BIter i)	BList< BNameValue< T > >
get(BIter i) const	BList< BNameValue< T > >
goTo(int pos) const	BList< BNameValue< T > >
has(const BNameValue< T > &i) const	BList< BNameValue< T > >
insert(BIter &i, const BNameValue< T > &item)	BList< BNameValue< T > >	virtual
insertAfter(BIter &i, const BNameValue< T > &item)	BList< BNameValue< T > >
isEnd(BIter &i) const	BList< BNameValue< T > >
next(BIter &i) const	BList< BNameValue< T > >
nodeCreate(const BNameValue< T > &item)	BList< BNameValue< T > >	protectedvirtual
nodeGet(BIter i)	BList< BNameValue< T > >	protectedvirtual
nodeGet(BIter i) const	BList< BNameValue< T > >	protectedvirtual
number() const	BList< BNameValue< T > >
olength	BList< BNameValue< T > >	protected
onodes	BList< BNameValue< T > >	protected
operator+(const BList< BNameValue< T > > &l) const	BList< BNameValue< T > >
operator=(const BList< BNameValue< T > > &l)	BList< BNameValue< T > >
operator[](int i)	BList< BNameValue< T > >
operator[](int i) const	BList< BNameValue< T > >
operator[](BIter i)	BList< BNameValue< T > >
operator[](const BIter &i) const	BList< BNameValue< T > >
pop()	BList< BNameValue< T > >
position(BIter i)	BList< BNameValue< T > >
prev(BIter &i)	BList< BNameValue< T > >
push(const BNameValue< T > &i)	BList< BNameValue< T > >
queueAdd(const BNameValue< T > &i)	BList< BNameValue< T > >
queueGet()	BList< BNameValue< T > >
rear()	BList< BNameValue< T > >
size() const	BList< BNameValue< T > >
sort()	BList< BNameValue< T > >
sort(SortFunc func)	BList< BNameValue< T > >
SortFunc typedef	BList< BNameValue< T > >
start(BIter &i) const	BList< BNameValue< T > >
swap(BIter i1, BIter i2)	BList< BNameValue< T > >
~BList()	BList< BNameValue< T > >	virtual