Open
Description
Just wondering out loud here, but would it be within the scope of this package to add relationships based on an ltree
column? So something like children
, parent
and ancestors
. Maybe even to a given depth?
I've just used ltree
for a comments system and ended up doing two queries. The first one gets a paginator just for the first level and the second one gets any children for the items in that paginator. I then have a tree class that builds up the hierarchy, sorts it properly and sets the resulting collection back on the paginator. It'll work just fine for my use case as there won't be many comments at all and even less nested ones, but it got me wondering if this couldn't be solved more efficiently.