A recipe often requested on the likes of stackoverflow and activestate is a way to look 'ahead' in an iterator, without altering the values returned for subsequent next() calls.

Last time this came up on python-ideas, it got a reasonable reception:
  http://code.activestate.com/lists/python-ideas/19509/

So, having wanted (and implemented) this again, I thought it was worth a formal proposal.

Is this an idea worth pursuing?


I've attached a quick pure Python implementation, that adds a 'peek' method, used like this:

>>> it = lookahead(range(10))
>>> next(it)
0
>>> it.peek()
1
>>> next(it)
1
>>> it.peek(index=1)
3
>>> it.peek()
2
>>> next(it)
2

Another possible way to go is to expand the existing tee() object to support __getitem__ and __bool__ methods.

I like the suggested API: "iterator with indexing" is a good articulation of the request.

This doesn't seem to have gained any traction and I haven't interest in the subject for years.  Marking this as closed.  If the topic takes on a new life, this can be reopened and we can revisit the idea.

I don't think it would be hard to patch itertools.tee() to support indexing modeled on the patch above, but it is unclear whether it would be useful in practice or whether it would just be an attractive nuisance.  (Note, we added copy support to tee() based on similar requests however this feature turned out to be ignored in practice).