Query the archive
Find the right depth.
Filter the notebook by what you know, how much time you have, and where you want to go next.
9 matching notes
| The fastest operation is the one your algorithm avoids | intermediate | 32 min | 3.10+ | Performance, Algorithms |
| Allocation is work: object churn and memory locality | advanced | 31 min | 3.10+ | Performance, Internals |
| How to benchmark Python without lying to yourself | intermediate | 28 min | 3.10+ | Performance, Tooling |
| Crossing the Python boundary | advanced | 33 min | 3.10+ | Performance, Internals |
| Deque, heap, and bisect: choosing the non-obvious container | advanced | 31 min | 3.10+ (3.14+ for max-heaps) | Internals, Data Structures |
| Function calls and vectorcall | advanced | 31 min | 3.14 | Internals, Performance |
| Profile first: finding where the time actually went | intermediate | 30 min | 3.10+ | Performance, Tooling |
| What CPython's specializing interpreter optimizes for you | advanced | 30 min | 3.14 | Performance, Internals |
| The GIL, without the folklore | advanced | 32 min | 3.13+ | Internals, Concurrency |