On Sun, Apr 15, 2018 at 11:55 PM, Chris Angelico <ros...@gmail.com> wrote:
> On Mon, Apr 16, 2018 at 6:46 AM, Koos Zevenhoven <k7ho...@gmail.com> > wrote: > > Anyway, the whole linked list is unnecessary if the iterable can be > iterated > > over multiple times. But "tee" won't know when to do that. *That* is > what I > > call overhead (unless of course all the tee branches are consumed in an > > interleaved manner). > > But if you have something you can iterate over multiple times, why > bother with tee at all? Just take N iterators from the underlying > iterable. The overhead is intrinsic to the value of the function. > > Indeed. But if you have, say, an Iterable[int], you don't know if you need the additional buffer or not. It could be a range object or a set or a generator (or iterator), who knows. Even your type checker doesn't know what you need. -- Koos -- + Koos Zevenhoven + http://twitter.com/k7hoven +
_______________________________________________ Python-ideas mailing list Python-ideas@python.org https://mail.python.org/mailman/listinfo/python-ideas Code of Conduct: http://python.org/psf/codeofconduct/
