From: "Jochem van Dieten"
> The results in a nested set are supposed to be completely
> ordered. So the way to handle this is to put them in the right
> place when you insert them, not when you are querying them.
>
That's what I figured. I should have added that that's what I figured, and I
was wondering if anyone had any elegant solutions for the insertion end -
particularly with regards to user interface issues. I'm picturing something
that allows users to modify the data in the tree by selecting both the
parent and the item at the same level that this item they're adding should
"come before." I know how to spread the tree and insert a new child, so it
shouldn't be too hard to indicate "insert a new child _here_." _OR_ I'm
trying to figure out how to automatically alphabetize on insert. (And,
debating the merits of each method.)
Thoughts?
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]
