4 ms·
This twists a problem to make the solution fit. Nobody would store "Foo 1 a" as name of the deepest item, they would want to build the name dynamically based o
by iLoveOncall 3y ago
This twists a problem to make the solution fit.
Nobody would store "Foo 1 a" as name of the deepest item, they would want to build the name dynamically based on the concatenation of the parents "Foo" and "1", in which case the system doesn't work at all.
Otherwise, most operations on the structure are impossible to perform (a simple rename in the middle of a branch).
Disingenuous article.
- kroolik 3y agoAgree. The article is imho clickbaity and very shallow in the reasoning presented.
- pflanze 3y agoThe sorting is according to the "sort" column, not the "name" column (they are not explicit about this but it's clearly what they mean, and it solves your problem). I think the benefit could mostly be for the implementation of the GUI to change the tree (that they do mention). If you don't feel like using a hack, don't. (They make that clear, too.)