GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
GeezerVison is showing github.com — Update `combinations` docs by ruaridhw · Pull Request #19732 · python/cpython
Update
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -199,9 +199,9 @@ loops that truncate the stream. | |
|
|
||
| Return *r* length subsequences of elements from the input *iterable*. | ||
|
|
||
| Combinations are emitted in lexicographic sort order. So, if the | ||
| input *iterable* is sorted, the combination tuples will be produced | ||
| in sorted order. | ||
| The combination tuples are emitted in lexicographic ordering according to | ||
| the order of the input *iterable*. So, if the input *iterable* is sorted, | ||
| the combination tuples will be produced in sorted order. | ||
|
|
||
| Elements are treated as unique based on their position, not on their | ||
| value. So if the input elements are unique, there will be no repeat | ||
|
|
@@ -248,9 +248,9 @@ loops that truncate the stream. | |
| Return *r* length subsequences of elements from the input *iterable* | ||
| allowing individual elements to be repeated more than once. | ||
|
|
||
| Combinations are emitted in lexicographic sort order. So, if the | ||
| input *iterable* is sorted, the combination tuples will be produced | ||
| in sorted order. | ||
| The combination tuples are emitted in lexicographic ordering according to | ||
| the order of the input *iterable*. So, if the input *iterable* is sorted, | ||
| the combination tuples will be produced in sorted order. | ||
|
|
||
| Elements are treated as unique based on their position, not on their | ||
| value. So if the input elements are unique, the generated combinations | ||
|
|
@@ -484,9 +484,9 @@ loops that truncate the stream. | |
| of the *iterable* and all possible full-length permutations | ||
| are generated. | ||
|
|
||
| Permutations are emitted in lexicographic sort order. So, if the | ||
| input *iterable* is sorted, the permutation tuples will be produced | ||
| in sorted order. | ||
| The permutation tuples are emitted in lexicographic ordering according to | ||
| the order of the input *iterable*. So, if the input *iterable* is sorted, | ||
| the combination tuples will be produced in sorted order. | ||
|
Member
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Should "combination tuples" be "permutation tuples" here?
Sorry, something went wrong. Uh oh!
There was an error while loading. Please reload this page. All reactions
Contributor
Author
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Yes, good spot 🤦
Sorry, something went wrong. Uh oh!
There was an error while loading. Please reload this page. All reactions |
||
|
|
||
| Elements are treated as unique based on their position, not on their | ||
| value. So if the input elements are unique, there will be no repeat | ||
|
|
||
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.