diff options
| author | Georg Brandl <georg@python.org> | 2007-10-21 10:52:38 +0000 |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2007-10-21 10:52:38 +0000 |
| commit | cf3fb259329eedfa9d2c802b2ea5ced287c21e78 (patch) | |
| tree | bd09350c4ac4d66064526573c19ebbcd27f77279 /Doc/library/itertools.rst | |
| parent | bb75e4e5d243a32cf31b91543b06b829c63e2c70 (diff) | |
| download | cpython-git-cf3fb259329eedfa9d2c802b2ea5ced287c21e78.tar.gz | |
Add :term: for generators.
Diffstat (limited to 'Doc/library/itertools.rst')
| -rw-r--r-- | Doc/library/itertools.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst index 93e62f657a..e150070697 100644 --- a/Doc/library/itertools.rst +++ b/Doc/library/itertools.rst @@ -460,8 +460,8 @@ The superior memory performance is kept by processing elements one at a time rather than bringing the whole iterable into memory all at once. Code volume is kept small by linking the tools together in a functional style which helps eliminate temporary variables. High speed is retained by preferring -"vectorized" building blocks over the use of for-loops and generators which -incur interpreter overhead. :: +"vectorized" building blocks over the use of for-loops and :term:`generator`\s +which incur interpreter overhead. :: def take(n, seq): return list(islice(seq, n)) |