Software: Apache/2.0.54 (Unix) mod_perl/1.99_09 Perl/v5.8.0 mod_ssl/2.0.54 OpenSSL/0.9.7l DAV/2 FrontPage/5.0.2.2635 PHP/4.4.0 mod_gzip/2.0.26.1a uname -a: Linux snow.he.net 4.4.276-v2-mono-1 #1 SMP Wed Jul 21 11:21:17 PDT 2021 i686 uid=99(nobody) gid=98(nobody) groups=98(nobody) Safe-mode: OFF (not secure) /usr/doc/python-2.2.3/html/lib/ drwxr-xr-x | |
| Viewing file: Select action/file-type:
|
| Operation | Result | Notes |
|---|---|---|
x in s |
1 if an item of s is equal to x, else 0 |
|
x not in s |
0 if an item of s is
equal to x, else 1 |
|
s + t |
the concatenation of s and t | |
s * n , n * s |
n shallow copies of s concatenated | (1) |
s[i] |
i'th item of s, origin 0 | (2) |
s[i:j] |
slice of s from i to j | (2), (3) |
len(s) |
length of s | |
min(s) |
smallest item of s | |
max(s) |
largest item of s |
Notes:
0 are treated as
0 (which yields an empty sequence of the same type as
s). Note also that the copies are shallow; nested structures
are not copied. This often haunts new Python programmers; consider:
>>> lists = [[]] * 3 >>> lists [[], [], []] >>> lists[0].append(3) >>> lists [[3], [3], [3]]
What has happened is that lists is a list containing three
copies of the list [[]] (a one-element list containing an
empty list), but the contained list is shared by each copy. You can
create a list of different lists this way:
>>> lists = [[] for i in range(3)] >>> lists[0].append(3) >>> lists[1].append(5) >>> lists[2].append(7) >>> lists [[3], [5], [7]]
len(s) + i or
len(s) + j is substituted. But note that -0 is
still 0.
i <=
k < j. If i or j is greater than
len(s), use len(s). If i is omitted,
use 0. If j is omitted, use len(s). If
i is greater than or equal to j, the slice is empty.
:: Command execute :: | |
--[ c99shell v. 1.0 pre-release build #13 powered by Captain Crunch Security Team | http://ccteam.ru | Generation time: 0.0092 ]-- |