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

Groups > comp.lang.python > #15129

Re: Fast recursive generators?

Newsgroups comp.lang.python
Date 2011-10-29 02:10 -0700
References <CAG+HS+53dEnqLK-7P7TWZJmsmQd6ommzyd4SJ1uO=i11rfiz=A@mail.gmail.com> <mailman.2300.1319858257.27778.python-list@python.org>
Subject Re: Fast recursive generators?
From 88888 Dihedral <dihedral88888@googlemail.com>
Message-ID <mailman.2301.1319879431.27778.python-list@python.org> (permalink)

Show all headers | View raw

I am thinking the bye code compiler in python can be faster  if all known immutable instances up to the execution    are compiled immutable objects to be assigned.

Back to comp.lang.python | Previous | Next — Previous in thread | 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