PUBLIC

LiteralIndexNodeBodyC::LiteralIndexNodeBodyC(UIntT) LiteralIndexNodeBodyC::Term(void) const LiteralIndexNodeBodyC::Lookup(const TupleC &,LiteralIndexElementC &) LiteralIndexNodeBodyC::Filter(const LiteralC &,LiteralIndexElementC &,LiteralC &) LiteralIndexNodeBodyC::Insert(const TupleC &,LiteralIndexElementC &) LiteralIndexNodeBodyC::Name(void) LiteralIndexNodeBodyC::Dump(ostream &,int) const LiteralIndexElementBodyC::Name(void) LiteralIndexElementBodyC::Lookup(const TupleC &,LiteralIndexElementC &) LiteralIndexElementBodyC::Insert(const TupleC &,LiteralIndexElementC &) LiteralIndexElementBodyC::Filter(const LiteralC &,LiteralIndexElementC &,LiteralC &) LiteralIndexElementBodyC::Dump(ostream &,int) const LiteralIndexElementBodyC::Iterator(void) LiteralIndexElementBodyC::Filter(const LiteralC &) 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 LiteralIndexElementBodyC

UIntT term;

Position in tuple we're indexing.

LiteralIndexC index;

LiteralIndexElementC none;

Used for tuples with arity smaller than term.

LiteralIndexNodeBodyC(UIntT nn = 0)

UIntT Term() const

Access element of tuple we're indexing.

bool Lookup(const TupleC & key,LiteralIndexElementC & next)

Lookup next level in tree.
returns true if this level is a leaf and leave next unchanged. if no suitable node is found 'next' is made invalid.

LiteralMapIterC<LiteralIndexElementC> Filter(const LiteralC & key,LiteralIndexElementC & next,LiteralC & var)

Filter next level in tree.
If there's a choice return an iterator otherwise the next branch in the tree is assigned to 'next'. var is the variable to witch the value of the iterator should be bound.

bool Insert(const TupleC & key,LiteralIndexElementC & next)

Insert/Replace element into the node.

StringC Name()

Get name for element.
usefull for debuging.

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

Dump index in human readable form.
For debugging only.

StringC Name()

Get name for element.
usefull for debuging.

bool Lookup(const TupleC & key,LiteralIndexElementC & next)

Lookup next level in tree.
returns true if this level is a leaf and leave next unchanged. if no suitable node is found 'next' is made invalid.

bool Insert(const TupleC & key,LiteralIndexElementC & next)

Insert/Replace element into the node.

LiteralMapIterC<LiteralIndexElementC> Filter(const LiteralC & key,LiteralIndexElementC & next,LiteralC & var)

Filter next level in tree.
If there's a choice return an iterator otherwise the next branch in the tree is assigned to 'next'. var is the variable to witch the value of the iterator should be bound.

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

Dump index in human readable form.
For debugging only.

LiteralMapIterC<LiteralIndexElementC> Iterator()

Access iterator for all branches from this node.

LiteralMapIterC<LiteralIndexElementC> Filter(const LiteralC & filt)

Access iterator for all branches from this node matching filter filt.

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.