Python and Rust developer; I write about any topics you're interested in. Follow me! (#^.^#)
The article explains Retrieval‑Augmented Generation (RAG) by describing how a programmer, frustrated with oversized prompts for a large language model, discovers that retrieving relevant document fragments, embedding them, and feeding the augmented context to the model yields accurate, fact‑based answers.
This article walks through Python generators in depth—covering basic yield behavior, the __next__, send, throw, and close methods, pre‑activation states, delegation with yield from, generator expressions pitfalls, and their role in coroutine implementation—while briefly recounting a personal conflict that sparked the write‑up.
This article explains the inner workings of Python closures by tracing how nested functions are compiled into bytecode, how the CPython VM creates cell objects, binds them via the func_closure field, and stores variables in the localsplus array for static access.
This article explains the low‑level mechanics of Python function calls, distinguishing Python‑implemented and C‑implemented functions, dissecting the bytecode generated for a simple call, and walking through the CPython CALL instruction, stack layout, method handling, and the relationship between PyFunctionObject, PyFrameObject, and PyCodeObject.
The article explains step‑by‑step how a Python function is turned into a PyFunctionObject at runtime, covering the role of PyCodeObject, the MAKE_FUNCTION bytecode instruction, attribute handling such as defaults and annotations, name resolution, variable binding, and techniques for inspecting and copying functions.
The article explains Python's exception handling implementation, detailing how the virtual machine executes try/except/else/finally blocks, the bytecode instructions generated for each clause, the static exception table used for fast dispatch, and the effects of return and del statements on control flow and object lifetimes.
The article dissects Python’s exception mechanism, showing how the interpreter and virtual machine raise, record, and propagate errors via thread‑state objects, traceback chains, and C‑level APIs, while also illustrating generator return values, Java checked exceptions, and the final printing of tracebacks.
This article explains Python 3.10's match‑case control‑flow construct, covering its basic syntax, pattern‑matching capabilities, variable binding, OR patterns, guard clauses, and the generated bytecode, while comparing it to traditional if statements and noting portability considerations.
The article dissects Python's CPython implementation of the if‑elif‑else control‑flow construct, detailing the generated bytecode, the POP_JUMP_IF_FALSE/TRUE instructions, jump macros, helper truth‑testing functions, computed‑goto support, and the role of instruction prediction in the virtual machine.
The article explains that CPython stores function local variables in a statically‑indexed array (f_localsplus), accesses them via GETLOCAL/SETLOCAL macros, and builds the locals() dictionary on demand, showing how exec, variable assignment order, and the hidden local namespace interact with this mechanism.
