python generators are good replacements for lists in most cases expect where I would like to check for empty condition which is not possible with plain generators. I am trying to write a wrapper which will allow checking for empty condition but is still lazy and gives the benefit of generators.
class mygen:
def __init__(self,iterable):
self.iterable = (x for x in iterable)
self.peeked = False
self.peek = None
def __iter__(self):
if self.peeked:
yield self.peek
self.peeked = False
for val in self.iterable:
if self.peeked:
yield self.peek
self.peeked = False
yield val
if self.peeked:
yield self.peek
self.peeked = False
def __nonzero__(self):
if self.peeked:
return True
try:
self.peek = self.iterable.next()
self.peeked = True
return True
except:
return False
Sample usage:
def get_odd(l):
return mygen(x for x in l if x%2)
def print_odd(odd_nums):
if odd_nums:
print "odd numbers found",list(odd_nums)
else:
print "No odd numbers found"
print_odd(get_odd([2,4,6,8]))
print_odd(get_odd([2,4,6,8,7]))
Use itertools.tee
to implement the nonzero test, and simply cache it on creation:
from itertools import tee
class NonZeroIterable(object):
def __init__(self, iterable):
self.__iterable, test = tee(iter(iterable))
try:
test.next()
self.__nonzero = True
except StopIteration:
self.__nonzero = False
def __nonzero__(self):
return self.__nonzero
def __iter__(self):
return self.__iterable
Little demo:
>>> nz = NonZeroIterable('foobar')
>>> if nz: print list(nz)
...
['f', 'o', 'o', 'b', 'a', 'r']
>>> nz2 = NonZeroIterable([])
>>> if not nz2: print 'empty'
...
empty
This version of the NonZeroIterable caches the flag; it thus only tells you if the iterator was non-empty at the start. If you need to be able to test the iterable at other points in it's lifecycle, use Sven's version instead; there the __nonzero__
flag will tell you after every iteration if there are more items to come still.
Your sample code is way too simple and not a good argument for your usecase; you first test for non-emptyness (which potentially iterates over the input list to seach for an odd number) but then exhaust the whole iterator anyway. The following code would be just as efficient and wouldn't require you to invent ways to break python idioms:
def print_odd(odd_nums):
odd_nums = list(odd_nums)
if odd_nums:
print "odd numbers found", odd_nums
else:
print "No odd numbers found"
I would not usually implement this kind
of generator. There is an idiomatic way how to test if a iterator it
is exhausted:
try:
next_item = next(it)
except StopIteration:
# exhausted, handle this case
Substituting this EAFP idiom by some project-specific LBYL idiom seems confusing and not beneficial at all.
That said, here is how I would implement this if I really wanted to:
class MyIterator(object):
def __init__(self, iterable):
self._iterable = iter(iterable)
self._exhausted = False
self._cache_next_item()
def _cache_next_item(self):
try:
self._next_item = next(self._iterable)
except StopIteration:
self._exhausted = True
def __iter__(self):
return self
def next(self):
if self._exhausted:
raise StopIteration
next_item = self._next_item
self._cache_next_item()
return next_item
def __nonzero__(self):
return not self._exhausted
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With