Add a note
This commit is contained in:
parent
120ede4b1b
commit
13279f61ed
@ -162,6 +162,12 @@ impl<A> Rule<A> {
|
|||||||
|
|
||||||
let mut count = 0;
|
let mut count = 0;
|
||||||
|
|
||||||
|
// TODO: Why is this forcing it to build up the entire stack
|
||||||
|
// to the recursion limit, and *then* start generating
|
||||||
|
// geometry and winding the stack back down?
|
||||||
|
//
|
||||||
|
// Isn't there some way that it can generate geometry at every
|
||||||
|
// step and only have to add to the stack to handle a branch?
|
||||||
while !stack.is_empty() {
|
while !stack.is_empty() {
|
||||||
|
|
||||||
// TODO: This, more elegantly?
|
// TODO: This, more elegantly?
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user