Bool testhash::Parent::removeChild(const Child & child) const {
if(!child.isExists() || child.getParent() != *this )
return false;
StdUInt hash_value = getChildHash(child.getParentKey());
Child next = child.getNextParentTableListChild();
Child prev = child.getPrevParentTableListChild();
if (prev.isValid()) //! Previous exists
{
if (getChildHash(prev.getParentKey()) != hash_value) //! Previous has different hash
{
if (next.isValid()) //! And next exists
{
if (getChildHash(next.getParentKey()) != hash_value) //! But next has different hash
setiChildTable(hash_value, Child());
else //! Next has the same hash
setiChildTable(hash_value, next);
}
else //! Next is absent
{
setiChildTable(hash_value, Child());
setChildTableMax(getChildHash(prev.getParentKey()));
}
}
}
else //! Previous absent
{
if (next.isValid()) //! Next exists
{
if (getChildHash(next.getParentKey()) != hash_value) //! Next has different hash
{
setiChildTable(hash_value, Child());
setChildTableMin(getChildHash(next.getParentKey()));
}
else //! Next has the same hash
setiChildTable(hash_value, next);
}
else //! Next is absent
{
setiChildTable(hash_value, Child());
setChildTableMax(0);
setChildTableMin(0);
}
}
removeTableListChild(child);
child.setParent(Parent());
child.removeParentHandler();
setNumChilds(getNumChilds() - 1);
return true;
}
Bool testlist::Parent::pushBackChild(const Child & child) const {
if(!child.isExists() || child.getParent().isValid())
return false;
Child last_child = getLastChild();
child.setPrevParentChild(last_child);
if(last_child.isValid())
last_child.setNextParentChild(child);
else
setFirstChild(child);
child.setNextParentChild(Child());
setLastChild(child);
setNumChilds(getNumChilds() + 1);
child.setParent(*this);
child.setupParentHandler();
return true;
}
Bool testhash::Parent::insertChild(const Child & child, Sym key, Bool replace) const {
if(!child.isExists() || child.getParent().isValid() || (!replace && hasKeyChild(key)))
return false;
if (getChildTableLen() == 0)
{
resizeChildTable(getChildTableSize());
for (StdUInt i = 0; i < getChildTableSize(); i++)
setiChildTable(i, Child());
}
StdUInt hash_value = getChildHash(key);
Child first_table_child = getiChildTable(hash_value);
if (first_table_child.isValid())
insertBeforeTableListChild(child, first_table_child);
else
{
if (hash_value < getChildTableMin())
{
pushFrontTableListChild(child);
setChildTableMin(hash_value);
}
else if (hash_value > getChildTableMax())
{
pushBackTableListChild(child);
setChildTableMax(hash_value);
}
else
{
StdUInt next_busy;
for (next_busy = hash_value + 1; next_busy <= getChildTableMax(); next_busy++)
{
Child next_table_child = getiChildTable(next_busy);
if (next_table_child.isValid())
{
insertBeforeTableListChild(child, next_table_child);
break;
}
}
}
}
setiChildTable(hash_value, child);
setNumChilds(getNumChilds() + 1);
child.setParentKey(key);
child.setParent(*this);
child.setupParentHandler();
return true;
}
Void testlist::Parent::cascadeRemoveChild() const {
Child prev;
for ( Child current = getFirstChild(); current.isValid(); current = current.getNextParentChild())
{
if (prev.isValid())
{
prev.removeParentHandler();
prev.setParent(Parent());
prev.destroy();
}
prev = current;
}
if (prev.isValid())
{
prev.removeParentHandler();
prev.destroy();
}
}
testlist::Child testlist::Parent::popFrontChild() const {
Child result = getFirstChild();
if(result.isValid())
{
result.removeParentHandler();
Child next = result.getNextParentChild();
result.setNextParentChild(Child());
result.setPrevParentChild(Child());
setFirstChild(next);
if(!next.isValid())
setLastChild(Child());
else
next.setPrevParentChild(Child());
setNumChilds(getNumChilds() - 1);
result.setParent(Parent());
}
return result;
}
testlist::Child testlist::Parent::popBackChild() const {
Child result = getLastChild();
if(result.isValid())
{
result.removeParentHandler();
Child prev = result.getPrevParentChild();
result.setPrevParentChild(Child());
result.setNextParentChild(Child());
setLastChild(prev);
if(!prev.isValid())
setFirstChild(Child());
else
prev.setNextParentChild(Child());
setNumChilds(getNumChilds() - 1);
result.setParent(Parent());
}
return result;
}
Bool testlist::Parent::insertAfterChild(const Child & child, const Child & prev) const {
if(!child.isExists() ||
!prev.isExists() ||
prev.getParent() != *this ||
child.getParent().isValid())
return false;
Child next = prev.getNextParentChild();
prev.setNextParentChild(child);
child.setPrevParentChild(prev);
child.setNextParentChild(next);
if(next.isValid())
next.setPrevParentChild(child);
else
setLastChild(child);
child.setParent(*this);
setNumChilds(getNumChilds() + 1);
child.setupParentHandler();
return true;
}
Bool testlist::Parent::insertBeforeChild(const Child & child, const Child & next) const {
if(!child.isExists() ||
!next.isExists() ||
next.getParent() != *this ||
child.getParent().isValid())
return false;
Child prev = next.getPrevParentChild();
next.setPrevParentChild(child);
child.setNextParentChild(next);
child.setPrevParentChild(prev);
if(prev.isValid())
prev.setNextParentChild(child);
else
setFirstChild(child);
child.setParent(*this);
setNumChilds(getNumChilds() + 1);
child.setupParentHandler();
return true;
}
Bool testlist::Parent::removeChild(const Child & child) const {
if( !child.isExists() || child.getParent() != *this)
return false;
child.removeParentHandler();
Child next = child.getNextParentChild(), prev = child.getPrevParentChild();
if(next.isValid())
next.setPrevParentChild(prev);
else if (getLastChild() == child)
setLastChild(prev);
else
return false;
if(prev.isValid())
prev.setNextParentChild(next);
else if (getFirstChild() == child)
setFirstChild(next);
else
return false;
child.setNextParentChild(Child());
child.setPrevParentChild(Child());
child.setParent(Parent());
setNumChilds(getNumChilds() - 1);
return true;
}