Retrieve tree sorting by something other than default order

[dmaksimov]

Would it be possible to have a way to pull the tree of nodes but sort it by another column.

Sometimes I need to pull all the nodes into an array but also order it alphabetically by the node's name.

I know I can use the toTree method, but having it all in one collection would be easier since I wouldn't have to recursively iterate through the children.

So the result would look something like the following.

• A parent
• - A child
• - B Child
• - C child
• B Parent
• - F child
• - - A child
• - - B Child
• - G child
• M Parent
• - A child
• - N child
• - O Child

So it would still pull the child nodes after the parent, but the child nodes under that parent would be in alphabetical order. The parents would also be in alphabetical order.

[lazychaser]

First of all, thanks for your support!

I don't see a query-based solution right now. You need to pull your nodes, convert them to tree, and then flatten it. Or reconsider your algorithm to use recursion in the first place.

[dmaksimov]

Yeah I figured it wouldn't be something that can be done with a query. It would be nice if the Collection class had a method to create a tree and then flatten it.

I forked the repo and added some methods to do that so I can use it in my code. dmaksimov@ca678b3

If there's any way I can contribute, I'd love to. I'm still relatively new to Github and OOP in general so I'm still learning the ropes.

Let me know what you think.

[lazychaser]

You can create a pull request from your repository and I'll merge it. And would be great to have some tests written =)