[
https://issues.apache.org/jira/browse/GROOVY-7488?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14615961#comment-14615961
]
Paul King commented on GROOVY-7488:
-----------------------------------
I'm still -1 for inventing our own inorder algorithm. There has been much
research into tree traversal algorithms within computer science. Let's stick to
existing well-defined traversal algorithms. Preorder and postorder seem good
enough and if you want something different you could easily write your own
variation.
If you want something fancier, I'd suggest looking at
ResourceGroovyMethods#traverse for file tree traversal and it's preDir and
postDir closures. If you write the equivalent method signature and groovydoc
for a node traversal equivalent, we could assess that.
> Depth 1st and Breath 1st taking a closure
> -----------------------------------------
>
> Key: GROOVY-7488
> URL: https://issues.apache.org/jira/browse/GROOVY-7488
> Project: Groovy
> Issue Type: Improvement
> Components: groovy-jdk
> Reporter: Suminda Dharmasena
> Priority: Minor
>
> E.g.
> n.depthFirst { level, node -> ... }
> NB: there is level
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
