| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | The message accompanying the TypeError exception on a readonly | Guido van Rossum | 2001-08-10 | 1 | -1/+1 |
|
|
| * | Merge of descr-branch back into trunk. | Tim Peters | 2001-08-02 | 1 | -2/+8 |
|
|
| * | Part way to allowing "from __future__ import generators" to communicate | Tim Peters | 2001-07-16 | 1 | -0/+2 |
|
|
| * | Having fun on my own time: quicker flat_conjoin; Knights Tour solver | Tim Peters | 2001-07-13 | 1 | -113/+123 |
|
|
| * | Remove the last remnants of the hacks to worm around leaks. | Tim Peters | 2001-07-12 | 1 | -12/+3 |
|
|
| * | Repair flawed example. | Tim Peters | 2001-07-12 | 1 | -1/+1 |
|
|
| * | Remove now-unnecessary "from __future__ import nested_scopes" stmts. | Tim Peters | 2001-07-12 | 1 | -2/+0 |
|
|
| * | Remove reference cycle breaking code. The GC now takes care of it. | Neil Schemenauer | 2001-07-12 | 1 | -7/+1 |
|
|
| * | Added a non-recursive implementation of conjoin(), and a Knight's Tour | unknown | 2001-07-04 | 1 | -2/+291 |
|
|
| * | A clever union-find implementation from c.l.py, due to David Eppstein. | Tim Peters | 2001-07-02 | 1 | -0/+77 |
|
|
| * | Derive an industrial-strength conjoin() via cross-recursion loop unrolling, | Tim Peters | 2001-06-30 | 1 | -9/+83 |
|
|
| * | Added a simple but general backtracking generator (conjoin), and a couple | Tim Peters | 2001-06-29 | 1 | -1/+162 |
|
|
| * | Another "if 0:" hack, this time to complain about otherwise invisible | Tim Peters | 2001-06-28 | 1 | -0/+33 |
|
|
| * | This no longer leaks memory when run in an infinite loop. However, | Tim Peters | 2001-06-27 | 1 | -81/+58 |
|
|
| * | gen_getattr: make the gi_running and gi_frame members discoverable (but | Tim Peters | 2001-06-26 | 1 | -2/+22 |
|
|
| * | SF bug #436207: "if 0: yield x" is ignored. | Tim Peters | 2001-06-26 | 1 | -7/+128 |
|
|
| * | Teach the types module about generators. Thanks to James Althoff on the | Tim Peters | 2001-06-25 | 1 | -0/+20 |
|
|
| * | Repair indentation in comment. | Tim Peters | 2001-06-25 | 1 | -2/+9 |
|
|
| * | Added a "generate k-combinations of a list" example posted to c.l.py. | Tim Peters | 2001-06-24 | 1 | -1/+49 |
|
|
| * | New tests to provoke SyntaxErrors unique to generators. Minor fiddling | Tim Peters | 2001-06-24 | 1 | -6/+85 |
|
|
| * | Another variant of the 2-3-5 test, mixing generators with a LazyList class. | Tim Peters | 2001-06-24 | 1 | -0/+37 |
|
|
| * | More tests. | Tim Peters | 2001-06-24 | 1 | -1/+68 |
|
|
| * | Add a recursive Sieve of Eratosthenes prime generator. Not practical, | Tim Peters | 2001-06-23 | 1 | -1/+39 |
|
|
| * | Add all the examples from PEP 255, and a few email examples. | Tim Peters | 2001-06-23 | 1 | -2/+183 |
|
|
| * | New std test for generators, initially populated with doctests NeilS put | Tim Peters | 2001-06-23 | 1 | -0/+139 |
|
|
