[x] I added an entry to rstar/CHANGELOG.md if knowledge of this change could be valuable to users.
This avoids the overhead of allocating an internal buffer to keep track of upcoming nodes when implementing the Iterator trait.
I also found a mistake in the old code from #37 (lack of early return in the parent case) and now the benchmarks also look somewhat nicer, i.e. directly comparing internal and external iteration on the same data set:
[x] I added an entry to
rstar/CHANGELOG.md
if knowledge of this change could be valuable to users.This avoids the overhead of allocating an internal buffer to keep track of upcoming nodes when implementing the
Iterator
trait.I also found a mistake in the old code from #37 (lack of early return in the parent case) and now the benchmarks also look somewhat nicer, i.e. directly comparing internal and external iteration on the same data set:
Closes #163