diff options
| author | Raymond Hettinger <python@rcn.com> | 2009-04-10 19:46:51 +0000 |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2009-04-10 19:46:51 +0000 |
| commit | 21fde35e71f239d9968989d4355f9f1794bc8e98 (patch) | |
| tree | f7c2030290df36d496af6e53bf0d55b99004a2b7 | |
| parent | 099769c0e51a364d37f44c4f8a54b0df4735210b (diff) | |
| download | cpython-git-21fde35e71f239d9968989d4355f9f1794bc8e98.tar.gz | |
Fix alignment
| -rw-r--r-- | Doc/library/itertools.rst | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst index 3ca83dcba3..1861df44f5 100644 --- a/Doc/library/itertools.rst +++ b/Doc/library/itertools.rst @@ -65,17 +65,17 @@ Iterator Arguments Results **Combinatoric generators:** - ============================================== ==================== ============================================================= - Iterator Arguments Results - ============================================== ==================== ============================================================= - :func:`product` p, q, ... [repeat=1] cartesian product, equivalent to a nested for-loop - :func:`permutations` p[, r] r-length tuples, all possible orderings, no repeated elements - :func:`combinations` p[, r] r-length tuples, in sorted order, no repeated elements - | - ``product('ABCD', repeat=2)`` ``AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD`` - ``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC`` - ``combinations('ABCD', 2)`` ``AB AC AD BC BD CD`` - ============================================== ==================== ============================================================= +============================================== ==================== ============================================================= +Iterator Arguments Results +============================================== ==================== ============================================================= +:func:`product` p, q, ... [repeat=1] cartesian product, equivalent to a nested for-loop +:func:`permutations` p[, r] r-length tuples, all possible orderings, no repeated elements +:func:`combinations` p[, r] r-length tuples, in sorted order, no repeated elements +| +``product('ABCD', repeat=2)`` ``AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD`` +``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC`` +``combinations('ABCD', 2)`` ``AB AC AD BC BD CD`` +============================================== ==================== ============================================================= .. _itertools-functions: |