PUBLIC

HashTreeBodyC::HashTreeBodyC(const DataT &) HashTreeBodyC::HashTreeBodyC(void) HashTreeBodyC::Node(const KeyT &) HashTreeBodyC::IsLeaf(void) const HashTreeBodyC::Follow(const DListC &) HashTreeBodyC::Child(const KeyT &,HashTreeNodeC &) HashTreeBodyC::Add(const KeyT &,const DataT &) HashTreeBodyC::Add(const KeyT &,const HashTreeC &) HashTreeBodyC::Children(void) HashTreeBodyC::Children(void) const HashTreeBodyC::Dump(ostream &,int) const HashTreeNodeBodyC::Data(void) HashTreeNodeBodyC::Data(void) const HashTreeNodeBodyC::IsLeaf(void) const HashTreeNodeBodyC::Dump(ostream &,int) const RCBodyVC::Save(ostream &) const RCBodyVC::Save(BinOStreamC &) const RCBodyVC::Copy(void) const RCBodyVC::DeepCopy(UIntT) const RCBodyC::References(void) const RCBodyC::Copy(void) const RCBodyC::DeepCopy(UIntT) const RCBodyC::IncRefCounter(void) RCBodyC::DecRefCounter(void)

public HashTreeNodeBodyC<KeyT,DataT>

XMLTreeBodyC

HashTreeBodyC(const DataT & dat)

Constructor.

HashTreeBodyC()

Default constructor.

HashTreeNodeC<KeyT,DataT> & Node(const KeyT & key)

Access child node.

bool IsLeaf() const

Test if node is a leaf in the tree.

HashTreeNodeC<KeyT,DataT> Follow(const DListC<KeyT> & lst)

Follow list of keys to a node.
If node is not found then an invalid handle is returned.

bool Child(const KeyT & key,HashTreeNodeC<KeyT,DataT> & child)

lookup child in tree.
Returns true and updates 'child' if child is found.

bool Add(const KeyT & key,const DataT & data)

Add a child with given key and data.
returns false if child exists.

bool Add(const KeyT & key,const HashTreeC<KeyT,DataT> & subtree)

Add a sub tree
returns false if child exists.

HashC<KeyT,HashTreeNodeC<KeyT,DataT>> & Children()

Access table of children.

const HashC<KeyT,HashTreeNodeC<KeyT,DataT>> & Children() const

Access table of children.

ostream & Dump(ostream & out,int level = 0) const

Dump in a easly readable format.
This is a little poor at the moment, its really expecting a derived class to provide a better function.

DataT & Data()

Access data.

const DataT & Data() const

Access data.

bool IsLeaf() const

Test if node is a leaf in the tree.

ostream & Dump(ostream & out,int level = 0) const

Dump in a easly readable format.

bool Save(ostream & out) const

Save to stream 'out'.

bool Save(BinOStreamC & out) const

Save to binary stream 'out'.

RCBodyVC & Copy() const

Make copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

RCBodyC & DeepCopy(UIntT levels = ((UIntT))) const

Make a deep copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

UIntT References() const

Access count of handles open to this object.

RCBodyC & Copy() const

Make copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

RCBodyC & DeepCopy(UIntT levels = ((UIntT))) const

Make a deep copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

void IncRefCounter()

Increment reference counter.

bool DecRefCounter()

Decrement reference counter.