I was monitoring the other thread you started and I was not aware of this new thread. Anyway, just read my last two replies to your original thread to get a picture of what I am trying to use MPTT for. I took a recursive approach for rebuilding tree traversal data for reasons described in my last two replies to the original thread. The recursive approach at the time seemed to make sense and offered better DRY possibilities in terms of not having to write and maintain a separate set of queries for each function applied to the tree.
I also posted a link to my current implementation. I made a few optimizations so that recursion is used only when absolutely necessary. But as AD7six points out, it is possible to rebuild the tree traversal data without resorting to recursion (as is being done by the current AclNode implementation). On 1/3/07, Langdon Stevenson <[EMAIL PROTECTED]> wrote:
Hi Nimrod > This discussion has peaked my interest in MPTT implementations. I am > working on an object system for a CMS based on CakePHP and the object > tree is implemented using MPTT. I did a "textbook" implementation of > the thing, which means using a recursive algorithm to reorder the tree > traversal data (lft and rgt) for each tree node in for inserts and > deletes. Tree traversal methods are not in my area of expertise unfortunately (I am better at using the tools given to me), so excuse me if I can't add much to this sub thread. I am however very interested to hear what you have to say on the subject :-) Regards, Langdon >
-- _nimrod_a_abing_ [?] http://abing.gotdns.com --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Cake PHP" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/cake-php?hl=en -~----------~----~----~----~------~----~------~--~---
