Skip to content

Commit 7f587cd

Browse files
committed
Fix alignment
1 parent 5bfd8ce commit 7f587cd

1 file changed

Lines changed: 13 additions & 13 deletions

File tree

Doc/library/itertools.rst

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -61,19 +61,19 @@ Iterator Arguments Results
6161

6262
**Combinatoric generators:**
6363

64-
============================================== ==================== =============================================================
65-
Iterator Arguments Results
66-
============================================== ==================== =============================================================
67-
:func:`product` p, q, ... [repeat=1] cartesian product, equivalent to a nested for-loop
68-
:func:`permutations` p[, r] r-length tuples, all possible orderings, no repeated elements
69-
:func:`combinations` p[, r] r-length tuples, in sorted order, no repeated elements
70-
:func:`combinations_with_replacement` p[, r] r-length tuples, in sorted order, with repeated elements
71-
|
72-
``product('ABCD', repeat=2)`` ``AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD``
73-
``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC``
74-
``combinations('ABCD', 2)`` ``AB AC AD BC BD CD``
75-
``combinations_with_replacement('ABCD', 2)`` ``AA AB AC AD BB BC BD CC CD DD``
76-
============================================== ==================== =============================================================
64+
============================================== ==================== =============================================================
65+
Iterator Arguments Results
66+
============================================== ==================== =============================================================
67+
:func:`product` p, q, ... [repeat=1] cartesian product, equivalent to a nested for-loop
68+
:func:`permutations` p[, r] r-length tuples, all possible orderings, no repeated elements
69+
:func:`combinations` p[, r] r-length tuples, in sorted order, no repeated elements
70+
:func:`combinations_with_replacement` p[, r] r-length tuples, in sorted order, with repeated elements
71+
|
72+
``product('ABCD', repeat=2)`` ``AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD``
73+
``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC``
74+
``combinations('ABCD', 2)`` ``AB AC AD BC BD CD``
75+
``combinations_with_replacement('ABCD', 2)`` ``AA AB AC AD BB BC BD CC CD DD``
76+
============================================== ==================== =============================================================
7777

7878

7979
.. _itertools-functions:

0 commit comments

Comments
 (0)