Class: Tree_Dynamic_DBnested

Tree_Dynamic_DBnested Tree_Dynamic_DBnested( mixed $dsn, [mixed $options = array()])

integer add( array $newValues, [integer $parentId = 0], [integer $prevId = 0])

add a new element to the tree there are three ways to use this method 1.

give only the $parentId and the $newValues will be inserted as the first child of this parent i.e. // insert a new element under the parent with the ID=7 $tree->add( array('name'=>'new element name') , 7 ); 2. give the $prevId ($parentId will be dismissed) and the new element will be inserted in the tree after the element with the ID=$prevId the parentId is not necessary because the prevId defines exactly where the new element has to be place in the tree, and the parent is the same as for the element with the ID=$prevId i.e. // insert a new element after the element with the ID=5 $tree->add( array('name'=>'new') , 0 , 5 ); 3. neither $parentId nor prevId is given, then the root element will be inserted this requires that programmer is responsible to confirm this this method does not (yet) check if there is already a root element saved !!!

Parameters:

void copy( mixed $id, mixed $parentId, mixed $prevId)

copy a subtree/node/... under a new parent or/and behind a given element

mixed getChild( mixed $id)

mixed getChildren( mixed $id)

get the children of the given element

mixed getElement( mixed $id)

void getFirstRoot( )

mixed getLeft( mixed $id)

gets the element to the left, the left visit

mixed getNext( mixed $id)

get the next element on the same level if there is none return false

array &getNode( [integer $startId = 0], [integer $depth = 0])

gets the tree under the given element in one array, sorted so you can go through the elements from begin to end and list them as they are in the tree, where every child (until the deepest) is retreived

Parameters:

mixed getParent( mixed $id)

get the parent of the element with the given id

mixed getPath( mixed $id)

gets the path from the element with the given id down

to the root the returned array is sorted to start at root for simply walking through and retreiving the path

Overrides Tree_Common::getPath() (gets the path to the element given by its id)

mixed getPrevious( mixed $id)

get the previous element on the same level if there is none return false

mixed getRight( mixed $id)

gets the element to the right, the right visit

mixed getRoot( )

get the root

boolean isChildOf( int $id, int $childId)

returns if $childId is a child of $id

Overrides Tree_Common::isChildOf() (returns if $childId is a child of $id)

Parameters:

mixed move( integer $idsToMove, integer $newParentId, [integer $newPrevId = 0])

move an entry under a given parent or behind a given entry.

If a newPrevId is given the newParentId is dismissed! call it either like this: $tree->move( x , y ) to move the element (or entire tree) with the id x under the element with the id y or $tree->move( x , 0 , y ); // ommit the second parameter by setting it to 0 to move the element (or entire tree) with the id x behind the element with the id y or $tree->move( array(x1,x2,x3) , ... the first parameter can also be an array of elements that shall be moved the second and third para can be as described above If you are using the Memory_DBnested then this method would be invain, since Memory.php already does the looping through multiple elements, but if Dynamic_DBnested is used we need to do the looping here

Parameters:

boolean remove( integer $id)

remove a tree element this automatically remove all children and their children if a node shall be removed that has children

Parameters:

mixed update( int $id, array $newValues)

update the tree element given by $id with the values in $newValues

Parameters:

mixed _move( integer $idToMove, integer $newParentId, [integer $newPrevId = 0])

this method moves one tree element

Parameters:

void __construct( mixed $dsn, [mixed $options = array()])