Rafael Schouten

But the code is much simpler. Its only a few lines in Flatten.jl and it it compiles away. You also dont have the problem in of iterating the set tuple...

I dont think that its actually the same as `setall` on `Recursive`? `Recursive` returns nested tuples, not flat tuples. Doesn't that mean it would set from nested tuples too? How...

Ok right of course it doesnt. I dont actually use Recursive. But as far as I know there's nowhere in Accessors.jl that flattens anything now. But if you can handle...

Maybe a keyword flag to `coordinates` would be enough? e.g: ```julia coodinates(shape; split_holes=false) ```

The holes aren't excluded, they just don't have to be separated for the algorithm to work. It's a line crossing algorithm, so it doesn't matter if a line is for...

Also using the struct sounds like a good idea.

Adding a keyword to coordinates easily fixes this (over 2x performance improvement for `rasterize`). But its harder to implement in practice, because it would need to be added in every...

Ok. I do understand that it needs to be sorted out for polygon applications, and am not suggesting that should change. But a separate interface (or keyword) could avoid that...

A few points of clarification. A wrapper wouldn't be sufficient, as none of the contents can be mutable either. The object needs to be `isbits(obj) = true`. What could work...

Yep as the content of a grid on CPU, and as any part of a model on GPU. I don't really know how this package works :)