so i set up bookmarker (ran into a little pgsql snag, but at least now i know…), and well, it’s not quite all that i had hoped for. a few of the problems i’ll be able to fix through some js / interface polishing, but some of it is just it’s data model. it honestly wouldn’t be too hard to fix. just time i don’t have right now… so i’m gonna put it off a bit.
actually, i’ve been trying to find what’s the agreed upon best algorithm for arbitrary level threaded-tree like nesting, but haven’t found anything offhand. i guess i’ll go through some code to check it out. my first look on the thing is to have each node have a root flag, parent pointer, and depth level variable. that would completely simplify the sql call i would need to use (order by root, depth level, parent, id#), but i don’t know if there’s a more standard / faster algorithm used on these things…