Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.python > #15128

Re: Fast recursive generators?

Show key headers only | View raw

En Fri, 28 Oct 2011 15:10:14 -0300, Michael McGlothlin  
<michaelm@plumbersstock.com> escribió:

> I'm trying to generate a list of values where each value is dependent
> on the previous value in the list and this bit of code needs to be
> repeatedly so I'd like it to be fast. It doesn't seem that
> comprehensions will work as each pass needs to take the result of the
> previous pass as it's argument. map() doesn't seem likely. filter() or
> reduce() seem workable but not very clean. Is there a good way to do
> this? About the best I can get is this:
>
> l = [ func ( start ) ]
> f = lambda a: func ( l[-1] ) or a
> filter ( f, range ( big_number, -1, -1 ) )
>
>
> I guess I'm looking for something more like:
>
> l = do ( lambda a: func ( a ), big_number, start )

What about a generator function?

def my_generator():
   prev = 1
   yield prev
   while True:
     this = 2*prev
     yield this
     prev = this

print list(itertools.islice(my_generator(), 10))

-- 
Gabriel Genellina

Back to comp.lang.python | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

Re: Fast recursive generators? "Gabriel Genellina" <gagsl-py2@yahoo.com.ar> - 2011-10-29 00:18 -0300
  Re: Fast recursive generators? 88888 Dihedral <dihedral88888@googlemail.com> - 2011-10-29 02:10 -0700
  Re: Fast recursive generators? 88888 Dihedral <dihedral88888@googlemail.com> - 2011-10-29 02:10 -0700

csiph-web