Improved the pre-/postorder iterators: They visit the root node and are now
authorChristian Bauer <Christian.Bauer@uni-mainz.de>
Fri, 5 Sep 2003 19:58:11 +0000 (19:58 +0000)
committerChristian Bauer <Christian.Bauer@uni-mainz.de>
Fri, 5 Sep 2003 19:58:11 +0000 (19:58 +0000)
commita49cc30f7d44e7ac93d41c4beb2d9e9a325a3728
tree12cb05053c95a8b56fabf3dbe48b3770e1911b26
parentbe295fb5e60d42767db0dde2a3c693ce86f95e42
Improved the pre-/postorder iterators: They visit the root node and are now
only marginally slower than a recursive function like traverse(). The only
remaining problem is that for an expression consisting of only one primitive
object, ex::begin() and ex::end() return the same value, so the iteration
immediately stops without visiting the one existing node. We probably need
special versions of begin()/end() for creating pre-/postorder iterators after
all.
ginac/ex.h