Comments on: extending Zend_Db_Table to create NestedSet models

By: Chris

Chris — Sat, 13 Feb 2010 07:27:50 +0000

Another possibility is to integrate doctrine (e.g. http://www.zendcasts.com/deep-integration-between-zend-and-doctrine-1-2/2010/01/ -there are more article about this topic) and use doctrine-nested-sets: http://www.doctrine-project.org/documentation/manual/1_2/en/hierarchical-data

By: Nested Set - php.de

Nested Set - php.de — Tue, 07 Jul 2009 14:11:28 +0000

[...] ma Google abgegrast, jedoch dort nur Beispiele gefunden wo bereits Daten vorhanden sind. Linkliste: dev.iordanov.net http://www.tutorials.de/ http://www.traum-projekt.com/ http://reeg.junetz.de/ [...]

By: ivan

ivan — Sun, 31 May 2009 17:37:33 +0000

@Sakruta, this variable is optional .. if table has other fields .. eg. sort_order this code can’t handle it that’s why i use this variable

By: Sokruta

Sokruta — Sat, 30 May 2009 17:23:56 +0000

Why do you create class variable $_insertData. It doesnt make any sense. Insert operations can be sucessfully accomplished without using it.

By: dantan

dantan — Wed, 11 Mar 2009 10:48:58 +0000

Are you still working on this?

Maybe someone has an idea on move functions?

By: CrOOgie

CrOOgie — Mon, 19 Jan 2009 17:31:04 +0000

Nice class… gooood idea to work with

I have done method to retrieve a subtree for given id:
[code]
public function getSubTree($id)
{

$ret = $this->_db->query("
SELECT node.{$this->_primary}, node.{$this->_toString},
(
COUNT(parent.{$this->_toString}) - (sub_tree.depth + 1)
) AS depth
FROM
`{$this->_name}` AS node,
`{$this->_name}` AS parent,
`{$this->_name}` AS sub_parent,
(
SELECT node.{$this->_primary}, (COUNT(parent.{$this->_toString}) - 1) AS depth
FROM `{$this->_name}` AS node, `{$this->_name}` AS parent
WHERE node.{$this->_left} BETWEEN parent.{$this->_left} AND parent.{$this->_right}
AND node.{$this->_primary} = $id
GROUP BY node.{$this->_primary}
ORDER BY node.{$this->_left}
) AS sub_tree
WHERE node.{$this->_left} BETWEEN parent.{$this->_left} AND parent.{$this->_right}
AND node.{$this->_left} BETWEEN sub_parent.{$this->_left} AND sub_parent.{$this->_right}
AND sub_parent.{$this->_primary} = sub_tree.{$this->_primary}
GROUP BY node.{$this->_primary}
ORDER BY node.{$this->_left}
");
return $ret->fetchAll();
}
[/code]

Just base on code found in article at MYSql.com

By: dantan

dantan — Mon, 05 Jan 2009 14:30:59 +0000

Nice class. Are you still developing on this one?

I am missing move functions.

By: HerrSerker

HerrSerker — Thu, 04 Dec 2008 14:40:32 +0000

Good, … I mean excellent job! But I think the level is missing, i.e. the depth of the leaves in the nested set tree

By: Thomas

Thomas — Tue, 11 Nov 2008 16:09:24 +0000

Hi Ivan,
Hi S?bastien,
Hi Stefan,
What about the fully funcional nested set class for ZF…
Where can it be found?
Kind Regards and thanks in advance.
Thomas

By: Stefan Schmalhaus

Stefan Schmalhaus — Wed, 03 Sep 2008 16:47:42 +0000

@S?bastien: You mentioned a fully functional nested set class for ZF. I couldn’t find it on zym-project.com. Can you provide another URL? Thanks in advance.