Containers are bundles of protocols
Design collection behavior by choosing iteration, membership, sizing, indexing, and mutation deliberately.
Independent field notes / Vol. 01
Precise explanations of the machinery, patterns, and tradeoffs that make Python feel deceptively simple.
Read the cover storyThe index
7 notes, edited for signal.
Design collection behavior by choosing iteration, membership, sizing, indexing, and mutation deliberately.
Match queues, priorities, and sorted searches to the containers that make their dominant work cheap.
Pointers, overallocation, shifting costs, and the choices hidden behind Python list operations.
Hash tables for membership, uniqueness, algebra, and the costs sets deliberately trade away.
Code points, compact representations, allocation behavior, and the boundaries where text becomes bytes.
Immutability, hashing, packing bytecode, shallow memory, and choosing records that communicate their shape.
Hashes, collisions, compact entries, and the implementation choices behind Python's most important container.
Editorial policy
No listicles. No folklore. No just trust me abstractions.
Every note should leave you with a better model of the system, not just another snippet to paste.