Mince should return an iterator

[dpsanders]

For efficiency

[lbenet]

I find this is a good proposal!

Do you have some specific idea how to implement this? mince is implemented here for Intervals (note that and nodes is a range), and here for IntervalBoxes.

[dpsanders]

I think it's just a question of replacing the array comprehension by a generator expression, i.e. replacing square brackets with parentheses:

        function mince(x::Interval, n)
             nodes = range(x.lo, x.hi, length = n+1)
             return (Interval(nodes[i], nodes[i+1]) for i in 1:length(nodes)-1)
         end

[lbenet]

I've open #467, which improves performance (broadcasting!), but returns a vector...

[OlivierHnt]

Is this still a wanted feature?

[edtrelo]

@dpsanders what about using a new structure that relies on ranges? @lbenet and I have been discussing this issue and we think it would be useful to have an implementation of the getindex method, that proposed structure would enable us to achive such task.

[OlivierHnt]

I still wonder why this is so bad for mince to allocate a vector, since this is fairly cheap. Unless of course mince is used in a loop. Then perhaps an in-place version mince! should be implemented, instead of resorting to some new structure / generators.
On master

julia> @btime mince($interval(1, 2), $10_000);
  9.917 μs (2 allocations: 156.30 KiB)