MPTtree, Hieararchical trees in a database table

[eluser]TheLoops[/eluser]
[quote author="m4rw3r" date="1211041197"]I could try to implement a hybrid of Modified Preorder Tree Traversal (lft and rgt) and Adjacency List (parent_id and level) (I will probably add it as an option to MPTtree).[/quote]That would be great. (else I'd have to hack it in myelf ;-P )

[quote author="m4rw3r" date="1211041197"]About the getDescendantsCounts() and getChildrenCount(), should they really return an int? I believe you can use count_descendants() / count_children() otherwise, if you only need an int in return.[/quote]Well, the benefit of this method is that you do not need to run an sql query for each and every node. And having a descendants-count at hand is very handy in many situations.

[quote author="m4rw3r" date="1211041197"]And the is_descendant_of() and is_child_of() I'll probably implement in the ORM, it seems more fitting there.[/quote]Right.

[quote author="m4rw3r" date="1211041197"]Haven't checked this with matchbox, haven't really used matchbox before, but I'll look into it (got some work with school, so it may take some time before I have time to do anything of those above).[/quote]Matchbox replaces (replacing, no subclassing!) the CI_Loader with its own enhanced class. And this crashes MPTree. Dunno why, though.