FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
concise-cheat-sheets/python-cs.tex at master · rudymatela/concise-cheat-sheets · GitHub
rudymatela
/
concise-cheat-sheets
Public
Notifications
You must be signed in to change notification settings
Fork
12
Star
115
Code
Issues
0
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
concise-cheat-sheets
/
python-cs.tex
Copy path
More file actions
More file actions
Latest commit
History
History
History
516 lines (405 loc) · 16.8 KB
Breadcrumbs
concise-cheat-sheets
/
python-cs.tex
Copy path
File metadata and controls
516 lines (405 loc) · 16.8 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
%
% python-cs.tex
%
%
Copyright 2018 Rudy Matela
%
%
This text is available under (at your option):
%
* Creative Commons Attribution-ShareAlike 3.0 Licence
%
* GNU Free Documentation License version 1.3 or Later
%
\documentclass
{
refcard
}
\usepackage
[
T1
]{
fontenc
}
%
necessary so '{', '}' and '\' get the right font
\renewcommand
{
\familydefault
}{
\sfdefault
}
\title
{Concise Python Cheat Sheet}
\cright
{
Copyright 2018--2026, Rudy Matela --
Compiled on
\today
{}
\\
Upstream:
\texttt
{
https://github.com/rudymatela/concise-cheat-sheets
}
}{
This text is available under
the Creative Commons Attribution-ShareAlike 3.0 Licence,
\\
\textbf
{
or
} (at your option), the GNU Free Documentation License version 1.3 or Later.
}
\version
{0.3}
\begin
{
document
}
\maketitle
\begin
{
center
}
{
\Large
\textbf
{
NOTE:
} this is a work in progress}
\end
{
center
}
\section
{
Structure
}
\begin
{
verbatim
}
#!/usr/bin/env python
def hello(who):
print("Hello " + who + "!");
hello("world")
\end
{
verbatim
}
%
TODO: add a couple of build tools?
%
TODO: add something about f strings
\section
{
Standard Classes and Types
}
%
https://docs.python.org/2.0/ref/types.html
%
https://docs.python.org/3/reference/datamodel.html
\begin
{
ldesc
}
\li
[
\C
{NoneType}] None
\li
[
\C
{ellipsis}] ...
\li
[
\C
{bool}] False
\li
[
\C
{int}] 5040
\li
[
\C
{float}] 3.141
\li
[
\C
{str}]
"Escape \textbackslash{}"
double-quotes
\textbackslash
{}", not
'single'
"
\li
[
\C
{str}]
'Escape \textbackslash{}'
single-quotes
\textbackslash
{}', not
"double"
'
\li
[
\C
{list}] [360,'abc',3.141,360]
\li
[
\C
{set}]
\{
1,'abc',3
\}
\li
[
\C
{dict}]
\{
'abc': 10, 2: 3, 7:
'def'
\}
\end
{
ldesc
}
\section
{
Evaluation Order
}
Expressions are evaluated left-to-right:
\begin
{
verbatim
}
1st + (2nd * 3rd)
(1st + 2nd) * 3rd
3rd, 4th = 1st, 2nd
\end
{
verbatim
}
\section
{
Modules
}
\begin
{
ldesc
}
\li
[qualified module import] import
\I
{module}
\li
module.foo()
\lI
[unqualified module import] from
\I
{module} import *
\li
foo()
\lI
[import specific name] from
\I
{module} import
\I
{foo}
\li
foo()
\lI
[import module renaming] import
\I
{module} as
\I
{m}
\li
m.foo()
\lI
[import specific rename] from
\I
{module} import
\I
{foo} as
\I
{f}
\li
f()
\end
{
ldesc
}
\pagebreak
\section
{
Operators (grouped by precedence)
}
\begin
{
Ldesc
}
\Li
[tuples, lists, dictionaries] (...), [...],
\{
...
\}
\Li
[attribute reference] .
\Li
[function call, indexing
\&
slicing]
\I
{name}(
\I
{args}),
\I
{name}{[}
\I
{idx}{]}
\Li
[exponentiation] **
\Li
[bitwise negation]
\~
{}
\Li
[unary identity, unary negation] -, +
\Li
[multiplication
\&
repetition, division] *, /
\li
[integer division, integer remainder] //,
\%
\li
[matrix multiplication] @
\Li
[addition
\&
concat, subtraction] +, -
\Li
[left shift, right shift] <{<}, >{>}
\Li
[bitwise and]
\&
\Li
[bitwise xor]
\^
{}
\Li
[bitwise or] |
\Li
[comparisons (chaining)] ==, !=, <, <=, >, >=
\li
[object identity, set membership] is, is not, in, not in
\Li
[logical negation] not
\Li
[conjunction] and
\Li
[disjunction] or
\Li
[ternary selection]
\I
{expr1} if
\I
{cond} else
\I
{expr2}
\Li
[lambda] lambda
\I
{args}:
\I
{expr}
\end
{
Ldesc
}
\vspace
{-1em}
\section
{
Functions
}
\vspace
{-1ex}
\begin
{
ldesc
}
\li
[referencing]
\I
{fun}
\lI
[calling]
\I
{fun}()
\lI
[calling (w/arg)]
\I
{fun}(
\I
{arg
\_
value})
\lI
[calling (w/kw arg)]
\I
{fun}(
\I
{1st
\_
arg},
\I
{2nd
\_
arg},
\I
{key}=
\I
{val})
\li
\li
[0-arguments] def
\I
{fun}():
\li
~~~~
\I
{code-block}
\lI
[1-argument] def
\I
{fun}(
\I
{arg}):
\li
~~~~
\I
{code-block}
\lI
[2-arguments] def
\I
{fun}(
\I
{arg0},
\I
{arg1}):
\li
~~~~
\I
{code-block}
\lI
[default args] def
\I
{fun}(
\I
{mandatory},
\I
{optional}=
\I
{default}):
\li
~~~~
\I
{code-block}
\lI
[arbitrary args] def
\I
{fun}(
\I
{mandatory},
\I
{*args}):
\li
~~~~
\I
{code-block}
\lI
[keyword-exclusive] def
\I
{fun}(*,key=
\I
{default}):
\li
~~~~
\I
{code-block}
\lI
[lambda (1-arg)] lambda
\I
{arg}:~
\I
{expression}
\lI
[lambda (2-args)] lambda
\I
{arg0},
\I
{arg1}:~
\I
{expression}
\lI
[docstring] def
\I
{fun}(
\I
{args}):
\li
~~~~"""Concise summary of purpose
\li
~~~~
\li
~~~~Longer description, ifneedbe
\li
~~~~"""
\li
~~~~
\I
{code-block}
\li
\end
{
ldesc
}
\section
{
Flow Control
}
\begin
{
ldesc
}
\li
[if statement] if
\I
{condition}:
\li
~~~~
\I
{code-block}
\lI
[if-else statement] if
\I
{condition1}:
\li
~~~~
\I
{code-block}
\li
else:
\li
~~~~
\I
{code-block}
\lI
[if-elif-else statement] if
\I
{condition1}:
\li
~~~~
\I
{code-block}
\li
elif
\I
{condition2}:
\li
~~~~
\I
{code-block}
\li
else:
\li
~~~~
\I
{code-block}
\lI
[while statement] while
\I
{condition}:
\li
~~~~
\I
{code-block}
\lI
[for statement] for
\I
{v} in
\I
{values}:
\li
~~~~
\I
{code-block}
\lI
[for statement (copy)] for
\I
{v} in values[:]:
\li
~~~~
\I
{code-block}
\lI
[for statement (count)] for
\I
{i} in range(
\I
{n}):
\li
~~~~
\I
{code-block} ~~
\#
from 0 to n
\lI
[break statement]
\I
{while-or-for-statement}:
\li
~~~~break ~~~
\#
\textnormal
{exit loop, skip else}
\li
else:
\li
~~~~
\I
{code-block}
\lI
[continue-statement]
\I
{while-or-for-statement}:
\li
~~~~continue ~
\#
\textnormal
{next loop iteraction}
\lI
[pass-statement (no-op)]
\I
{def do-nothing():}
\li
~~~~pass
\lI
[case/switch statements]
\textnormal
{There aren't any. Use if-elif-else.}
\end
{
ldesc
}
\section
{
List Comprehensions
}
Take
\emph
{
element
} from
\emph
{
list
}.
If
\emph
{
boolPredicate
}, add element
\emph
{
expr
} to list:
\\
\begin
{
tabular
}{C@{
\s
$
\equiv
$
\s
}C}
\multicolumn
{2}{C}{[
\I
{expr} for
\I
{element} in
\I
{list} if
\I
{boolPredicate} ...]} \\[1ex]
{[}x for x in
\I
{xs}] &
\I
{xs} \\
{[}
\I
{f}(x) for x in [
\I
{a},
\I
{b},
\I
{c}]] & [
\I
{f}(
\I
{a}),
\I
{f}(
\I
{b}),
\I
{f}(
\I
{c})] \\
{[}
\I
{f}(x) for x in
\I
{xs} if
\I
{p}(x)] & list(map(
\I
{f},filter(
\I
{p},
\I
{xs}))) \\
%
\multicolumn{2}{C}{
%
{[}x for x in \I{xs} if \I{p} x if \I{q} x] $\equiv$
%
list(filter(\I{q},filter(\I{p},\I{xs})))
%
} \\
\multicolumn
{2}{C}{
{[}x+y for x in [
\I
{a},
\I
{b}] for y in [
\I
{i},
\I
{j}]]
} \\
\multicolumn
{2}{C}{
\hfill
$
\equiv
$
[
\I
{a}+
\I
{i},
\I
{a}+
\I
{j},
\I
{b}+
\I
{i},
\I
{b}+
\I
{j}]
} \\
\end
{
tabular
}
Generator
\C
{(...)} and set
\C
{
\{
...
\}
} comprehensions
are also allowed.
\begin
{
verbatim
}
lets:
[x for y in ys for x in (doSomethingLong(y),)]
\end
{
verbatim
}
\section
{
Exceptions
}
\begin
{
ldesc
}
\li
[try-except]
try:
\li
~~~~code-block
\li
except
\I
{Exception}:
\li
~~~~code-block
\li
\li
[finally-else]
try:
\li
~~~~code-block
\li
except
\I
{Exception1}:
\li
~~~~
\textnormal
{run when
\I
{
\C
{Exception1}} is raised}
\li
except
\I
{Exception2}:
\li
~~~~
\textnormal
{run when
\I
{
\C
{Exception2}} is raised}
\li
else:
\li
~~~~
\textnormal
{run when no exception is raised}
\li
finally:
\li
~~~~always-run
\li
\li
[catch
\C
{BaseException}] except: ~
\#
\textnormal
{
\emph
{
dangerous
}}
\li
[catch all
\C
{Exception}s] except Exception:
\li
[catch as] except
\I
{Ex1} as
\I
{ex}:
\li
[catch multiple exceptions] except (
\I
{Ex1},
\I
{Ex2},
\I
{Ex3}):
\li
\li
[exception arguments (
\C
{as})]
\I
{ex.args}
\li
[raise exception
\I
{
\C
{Ex1}}] raise
\I
{Ex1}
\li
[raise
\I
{
\C
{Ex1}} with
``
msg
''
] raise
\I
{Ex1}("
\I
{msg}")
\li
[re-raise (inside
\C
{except:})] raise
\end
{
ldesc
}
\subsection
{
Exception Hierarchy
}
%
Please see the following for a complete list
%
https://docs.python.org/3/library/exceptions.html#exception-hierarchy
\begin
{
tabular
}{ll}
\C
{BaseException} & not to be directly inherited \\
\C
{~~SystemExit} & raised by
\C
{sys.exit()} \\
\C
{~~KeyboardInterrupt} & raised on interrupt / ctrl-C \\
\C
{~~Exception} & derive
\textbf
{
user-defined exceptions
} \\
\C
{~~~~StopIteration} & no further items on iterator \\
\C
{~~~~ArithmeticError} & arithmetic error \\
\C
{~~~~~~ZeroDivisionError} & raised on division by zero \\
\C
{~~~~AssertionError} & raised by
\C
{assert()} \\
\C
{~~~~AttributeError} & inaccessible/nonexistent attribute \\
\C
{~~~~BufferError} & error on a buffer operation \\
\C
{~~~~EOFError} & raised by
\C
{input()} on
\C
{EOF} \\
\C
{~~~~LookupError} & error on lookup \\
\C
{~~~~~~IndexError} & out of range list index \\
\C
{~~~~~~KeyError} & key not found on dictionary \\
\C
{~~~~NameError} & name not found \\
\C
{~~~~OSError} & raised by the OS \\
\C
{~~~~~~FileExistsError} & file exists \\
\C
{~~~~~~FileNotFoundError} & file not found \\
\C
{~~~~~~PermissionError} & inadequate access rights \\
\C
{~~~~RuntimeError} & runtime error, see error string \\
\C
{~~~~~~NotImplementedError} & unimplemented abstract method \\
\C
{~~~~~~RecursionError} & maximum recursion depth reached \\
\C
{~~~~TypeError} & inappropriate type \\
\C
{~~~~ValueError} & right type, innapropriate value \\
\C
{~~~~Warning} & warnings \\
\end
{
tabular
}
\section
{
Functions
}
\subsection
{
Objects
}
\begin
{
ldesc
}
\li
[list attributes
\&
methods of object
\I
{o}] dir(o)
\li
[shows the help for object
\I
{o}] help(o)
\li
[type/class of
\I
{x}] type(
\I
{x})
\li
[base classes of
\I
{cls}] cls.
\_\_
bases
\_\_
\end
{
ldesc
}
\subsection
{
Lists
}
\begin
{
ldesc
}
\li
[append
\C
{x} to the end of list
\C
{xs}] xs.append(x)
\li
[append iterable
\C
{iter} to the end of list
\C
{xs}] xs.extend(iter)
\li
[insert
\C
{x} in position
\C
{i} on the list
\C
{xs}] xs.insert(i, x)
\li
[remove the first occurrence of
\C
{x} in
\C
{xs}] xs.remove(x)
\li
[remove then return the last element of xs] xs.pop()
\li
[remove then return the
\C
{i}-th element of xs] xs.pop(i)
\li
[remove all items from
\C
{xs}] xs.clear()
\li
[index of the first occurrence of
\C
{x}] xs.index(x)
\li
[~~~~ between
\C
{i} and
\C
{j}] xs.index(x,i,j)
\li
[count occurrences of
\C
{x} in
\C
{xs}] xs.count(x)
\li
[sort the list
\C
{xs}] xs.sort()
%
\li[sort the list \C{xs} in reverse] xs.sort(reverse=True)
\li
[sort the list
\C
{xs} using keying function
\C
{k}] xs.sort(key=k)
\li
[reverse the list
\C
{xs}] xs.reverse()
\li
[return a copy of the list
\C
{xs}] xs.copy()
\end
{
ldesc
}
\subsection
{
Printing
}
\begin
{
ldesc
}
\li
[printable representation of
\I
{x}] str(
\I
{x})
\li
[parsable printable representation of
\I
{x}] repr(
\I
{x})
\li
[identity of
\I
{x}] parse(repr(
\I
{x}))
\end
{
ldesc
}
\subsection
{
String formatting (f-string)
}
\begin
{
ldesc
}
\li
[format
\I
{x} to string] f"
\{
x
\}
"
\li
[format
\I
{x} to string message] f"We have
\{
x
\}
items."
\li
[format
\I
{x} and
\I
{y} to string] f"x is
\{
x
\}
, y is
\{
y
\}
"
\li
[format
\I
{n} to hexadecimal] f"
\{
n
\}
in hexadecimal is
\{
n:x
\}
"
\li
[format
\I
{n} to octal] f"
\{
n
\}
in hexadecimal is
\{
n:o
\}
"
\li
[format
\I
{n} with six decimal places] f"
\{
n:06d
\}
"
\li
[yield
\C
{"pi is 3.14"}] f"pi is
\{
0:2f
\}
"
\li
[yield
\C
{"pi is 003.141"}] f"pi is
\{
0:3.3f
\}
"
\end
{
ldesc
}
\vspace
{-1ex}
\subsubsection
{
Old printf-style string formatting
}
\begin
{
ldesc
}
\li
[format
\I
{x} to string using
\C
{str}]
"\%s"
\%
x
\li
[format
\I
{x} to string using
\C
{repr}]
"\%s"
\%
x
\li
[format
\I
{x} to decimal]
"\%d"
\%
x
\li
[format
\I
{x} to hexadecimal]
"\%x"
\%
x
\li
[format
\I
{x} to octal]
"\%o"
\%
x
\li
[replace
\C
{
\%
s} by
\I
{s}]
"...~\%s~..."
\%
s
\li
[repl.~
\C
{
\%
s} by
\I
{s1} then
\I
{s2}]
".~\%s~.~\%s~."
\%
(s1,s2)
\li
[generate
\C
{"pi is 3.14"}]
"pi is \%.2f"
\%
math.pi
\li
[generate
\C
{"pi is 003.141"}]
"pi is \%3.3f"
\%
math.pi
\li
[generate
\C
{"1 + 1 = 2"}]
"1 + 1 = \%d"
\%
(1 + 1)
%
\li[generate \C{"2'n'1"}] "\%(two)d'n'\%(one)d" \% \{'one':~1, \li
%
~~~~~~~~~~~~~~~~~~~~~~ "two":~2\}
\end
{
ldesc
}
\subsection
{
Input and output to files
}
\begin
{
ldesc
}
\li
[open a file for reading]
\I
{f} = open('
\I
{file.txt}')
\li
[open a file for reading]
\I
{f} = open('
\I
{file.txt}','r')
\li
[open a file for writing]
\I
{f} = open('
\I
{file.txt}','w')
\li
[open a file for writing (appending)]
\I
{f} = open('
\I
{file.txt}','a')
\li
[closes file
\I
{f}] close(
\I
{f})
\li
[opens and closes] with open('
\I
{file.txt}') as
\I
{f}
\li
~~~~
\I
{operations on f}
\li
[reads the entire contents of file
\I
{f}]
\I
{f}.read()
\li
[reads a line from file
\I
{f}]
\I
{f}.readline()
\li
[reads all lines from file
\I
{f}]
\I
{f}.readlines()
\li
[loop over all lines from file
\I
{f}] for line in
\I
{f}:
\li
~~~~
\I
{code-block}
\li
[writes
\I
{string} on file
\I
{f}]
\I
{f}.write(
\I
{string})
\end
{
ldesc
}
\section
{
Classes
}
\begin
{
ldesc
}
\li
[defining a class]
class
\I
{OurClass}:
\li
~~~~"""Description of
\I
{OurClass}"""
\li
~~~~
\I
{class
\_
var} =
\I
{val} ~
\#
shared
\lI
~~~~def
\I
{f}(self):
\li
~~~~~~~~
\I
{self.instance
\_
var} =
\I
{val}
\li
~~~~~~~~
\I
{code}
\li
\li
[inheritance] class
\I
{OurSubClass}(
\I
{OurClass}):
\li
[multiple inheritance] class
\I
{SubClass}(
\I
{Cl1},
\I
{Cl2}):
\li
[object instance]
\I
{x} =
\I
{MyClass}()
\li
[attribute reference]
\I
{x}.
\I
{x}
\li
[class var reference]
\I
{OurClass}.class
\_
var
\li
[class var reference on obj]
\I
{x}.class
\_
var
\li
[instance var reference]
\I
{x}.instance
\_
var
\li
[method call]
\I
{x}.
\I
{f}()
\li
[initializer/constructor]
def
\_\_
init
\_\_
(self,
\I
{arg1},
\I
{arg2}):
\li
~~~~
\I
{code}
\li
\li
[simple record]
class
\I
{Record}:
\li
~~~~pass
\lI
\I
{record} =
\I
{Record}()
\li
\I
{record}.
\I
{x} =
\I
{value1}
\li
\I
{record}.
\I
{y} =
\I
{value2}
\end
{
ldesc
}
\section
{
Iterators
\&
Generators
}
\begin
{
ldesc
}
\li
[declaring] def
\I
{generator}()
\li
~~~~yield
\I
{value1}
\li
~~~~yield
\I
{value2}
\li
~~~~yield
\I
{value3}
\lI
[using] for
\I
{value} in
\I
{generator}():
\li
~~~~
\I
{code-block}
\end
{
ldesc
}
\end
{
document
}
\section
{
Decorators
}
\begin
{
tabular
}{CC}
\hline
\textnormal
{sugary} &
\textnormal
{explicit} \\[1ex]
\hline
@
\I
{decorate} & def
\I
{fun}(): \\
def
\I
{fun}(): & ~~
\I
{code-block} \\
~~
\I
{code-block} &
\I
{fun} =
\I
{decorate}(
\I
{fun}) \\[1ex]
\hline
@
\I
{decorate}(
\I
{arg})~~~~~ & def
\I
{fun}(): \\
def
\I
{fun}(): & ~~
\I
{code-block} \\
~~
\I
{code-block} &
\I
{fun} =
\I
{decorate}(
\I
{arg})(
\I
{fun}) \\[1ex]
\hline
@
\I
{deco2} & def
\I
{fun}(): \\
@
\I
{deco1} & ~~
\I
{code-block} \\
def
\I
{fun}(): &
\I
{fun} =
\I
{deco2}(
\I
{deco1}(
\I
{fun})) \\
~~
\I
{code-block} & \\
\hline
\end
{
tabular
}
\subsection
{
Defining a decorator
}
\begin
{
verbatim
}
def decorate(fun):
@functools.wraps(fun):
def decorated(*args, **kwargs):
... fun ...
return decorated
\end
{
verbatim
}
\subsection
{
Useful decorators
}
\begin
{
ldesc
}
\li
[class method (class as 1st arg)] @classmethod
\li
[static method (skip 1st arg)] @staticmethod
\li
[overload function
\texttt
{
foo
}] @singledispatch
\li
@
\I
{foo}.register(
\I
{type})
\li
[object property
\texttt
{
obj.prop
}] @property
\li
@
\I
{prop}.setter
\end
{
ldesc
}
\section
{
Libraries
}
\begin
{
tabular
}{Cll}
\textnormal
{library} & description & useful cls/funs/vars \\[1ex]
os & operating system interfaces &
\C
{environ()},
\C
{system()} \\
sys & system specific functions &
\C
{argv[]},
\C
{stdin},
\C
{exit()} \\
inspect & function introspection &
\C
{signature()}\\
functools & functional programming tools &
\C
{reduce()}\\
operator & standard operators as funs. &
\C
{add()},
\C
{mul()}\\
mailbox & manipulate mailboxes &
\C
{Mailbox} \\
email & email/MIME handling &
\C
{EmailMessage} \\
\end
{
tabular
}
\section
{
Interesting resources
}
\begin
{
itemize
}
\item
\texttt
{
www.pythontutor.com
}
\end
{
itemize
}
\end
{
document
}
Back
|
FazBrowse Home
|
New Git URL