Electronics and Software
Engineering Innovation
Beam-lib  2.15.1
BEntryList Member List

This is the complete list of members for BEntryList, including all inherited members.

append(const BEntry &item)BList< BEntry >
append(const BList< BEntry > &l)BList< BEntry >
begin() constBList< BEntry >
BEntryList()BEntryList
BList()BList< BEntry >
BList(const BList< BEntry > &l)BList< BEntry >
clear()BEntryListvirtual
del(BIter &i)BEntryListvirtual
deleteEntry(BString name)BEntryList
deleteFirst()BList< BEntry >
deleteLast()BList< BEntry >
end() constBList< BEntry >
end(BIter &i) constBList< BEntry >
find(BString name)BEntryList
findValue(BString name)BEntryList
front()BList< BEntry >
get(BIter i)BList< BEntry >
get(BIter i) constBList< BEntry >
getString()BEntryList
goTo(int pos) constBList< BEntry >
has(const BEntry &i) constBList< BEntry >
insert(BIter &i, const BEntry &item)BEntryListvirtual
insertAfter(BIter &i, const BEntry &item)BList< BEntry >
isEnd(BIter &i) constBList< BEntry >
isSet(BString name)BEntryList
next(BIter &i) constBList< BEntry >
nodeCreate(const BEntry &item)BList< BEntry >protectedvirtual
nodeGet(BIter i)BList< BEntry >protectedvirtual
nodeGet(BIter i) constBList< BEntry >protectedvirtual
number() constBList< BEntry >
olastPosBEntryListprivate
olengthBList< BEntry >protected
onodesBList< BEntry >protected
operator+(const BList< BEntry > &l) constBList< BEntry >
operator=(const BEntryList &l)BEntryList
BList< BEntry >::operator=(const BList< BEntry > &l)BList< BEntry >
operator[](int i)BList< BEntry >
operator[](int i) constBList< BEntry >
operator[](BIter i)BList< BEntry >
operator[](const BIter &i) constBList< BEntry >
pop()BList< BEntry >
position(BIter i)BList< BEntry >
prev(BIter &i)BList< BEntry >
print()BEntryList
push(const BEntry &i)BList< BEntry >
queueAdd(const BEntry &i)BList< BEntry >
queueGet()BList< BEntry >
rear()BList< BEntry >
setValue(BString name, BString value)BEntryList
setValueRaw(BString name, BString value)BEntryList
size() constBList< BEntry >
sort()BList< BEntry >
sort(SortFunc func)BList< BEntry >
SortFunc typedefBList< BEntry >
start(BIter &i) constBList< BEntry >
swap(BIter i1, BIter i2)BList< BEntry >
~BList()BList< BEntry >virtual