cpython: 4383d403aaef (original) (raw)
Mercurial > cpython
changeset 105808:4383d403aaef
Issue #1446619: Merge slicing description from 3.6 [#1446619]
Martin Panter vadmium+py@gmail.com | |
---|---|
date | Sat, 24 Dec 2016 08:31:37 +0000 |
parents | 3af3702b2f0a(current diff)031af2160094(diff) |
children | 8e311f109b22 |
files | Doc/library/stdtypes.rst |
diffstat | 1 files changed, 4 insertions(+), 2 deletions(-)[+] [-] Doc/library/stdtypes.rst 6 |
line wrap: on
line diff
--- a/Doc/library/stdtypes.rst
+++ b/Doc/library/stdtypes.rst
@@ -942,8 +942,10 @@ Notes:
The slice of s from i to j with step k is defined as the sequence of
items with index x = i + n*k
such that 0 <= n < (j-i)/k
. In other words,
the indices are i
, i+k
, i+2*k
, i+3*k
and so on, stopping when
- j is reached (but never including j). If i or j is greater than
len(s)
, uselen(s)
. If i or j are omitted orNone
, they become
- j is reached (but never including j). When k is positive,
- i and j are reduced to
len(s)
if they are greater. - When k is negative, i and j are reduced to
len(s) - 1
if - they are greater. If i or j are omitted or
None
, they become "end" values (which end depends on the sign of k). Note, k cannot be zero. If k isNone
, it is treated like1
.