Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using a local clone.
Compiler implementation of the D programming language.
- An Expression tree walker that will visit each Expression e in the tree, in depth-first evaluation order, and call fp(e,param) on it. fp() signals whether the walking continues with its return value:Returns:0 continue 1 done It's a bit slower than using virtual functions, but more encapsulated and less brittle. Creating an iterator for this would be much more complex.