Windows and internal state need storage, and allocation can fail. Initialization, reset, copy, and end determine what can be retained and what must be cleaned up.
Locate this topic on the global map ↗The first 2 chapters explain algorithms, data layouts, and optimizations. The final chapter connects the proof argument. Read in order or enter from a familiar stage.
- 01IMPLEMENTATION DETAIL↗
Reset, dictionaries, and state copies
Choose when to reuse a task, start another, or copy the current progress.
- 02IMPLEMENTATION DETAIL↗
Initialization, lazy allocation, and cleanup
Follow allocation and cleanup through success, failure, and resource reuse.
- 03PROOF ARGUMENT↗
The lifetime proof argument
Explain the ownership facts that justify memory access and final cleanup.