Docs: Update stdlib coverage (abc–curses)

Co-Authored-By: Codex <codex@openai.com>

Author: heikkitoivonen

DOCUMENTATION_STATUS.md

@@ -4,9 +4,9 @@ This document tracks the coverage of built-in functions, types, and standard lib
 
 ## Overview
 
-- **Total Items**: 318 (150 builtins + 168 stdlib modules)
-- **Documented**: 373 (174 builtins + 199 stdlib)
-- **Coverage**: 117.3%
+- **Total Items**: 317 (150 builtins + 167 stdlib modules)
+- **Documented**: 375 (174 builtins + 201 stdlib)
+- **Coverage**: 118.3%
 
 **Note**: Coverage exceeds 100% because comprehensive documentation files (like `exceptions.md`) cover multiple individual items, and we document deprecated/removed modules for historical reference.
 
@@ -203,7 +203,7 @@ Complete coverage of all built-in functions, types, exceptions, and constants:
 
 ## Standard Library Modules
 
-**Coverage: 118.5% (199/168)**
+**Coverage: 120.4% (201/167)**
 
 All standard library modules are fully documented, including new Python 3.14 modules. Coverage exceeds 100% due to documentation of deprecated/removed modules for historical reference.
 
@@ -225,12 +225,13 @@ All standard library modules are fully documented, including new Python 3.14 mod
 - ✅ `plistlib` - Property list format
 - ✅ `sndhdr` - Sound file format detection
 
-### ⊘ Excluded Items (3 - intentionally out of scope)
+### ⊘ Excluded Items (4 - intentionally out of scope)
 
 These items appear in audit but are **intentionally not documented** as they are not part of Python's standard library:
 
 **Project Scripts** (not stdlib):
 - `audit_documentation` - Project's own audit script
+- `introspect` - Project's introspection script
 
 **Third-party Packages** (external, not stdlib):
 - `pip` - External package manager
@@ -536,4 +537,3 @@ A: Tests will fail (`test_minimum_builtin_coverage`, `test_minimum_stdlib_covera
 
 **Q: How do I update the audit?**
 A: Run `python scripts/audit_documentation.py` before committing. It regenerates `data/documentation_audit.json`.
-

data/documentation_audit.json

@@ -167,18 +167,19 @@
     }
   },
   "stdlib": {
-    "total": 166,
-    "documented": 199,
-    "coverage_percent": 119.9,
+    "total": 167,
+    "documented": 201,
+    "coverage_percent": 120.4,
     "missing": [
       "audit_documentation",
       "cProfile",
+      "introspect",
       "pip"
     ]
   },
   "summary": {
-    "total_items": 316,
-    "total_documented": 373,
-    "overall_coverage_percent": 118.0
+    "total_items": 317,
+    "total_documented": 375,
+    "overall_coverage_percent": 118.3
   }
 }

docs/stdlib/abc.md

@@ -7,11 +7,16 @@ The `abc` module provides infrastructure for defining abstract base classes (ABC
 | Operation | Time | Space | Notes |
 |-----------|------|-------|-------|
 | `@abstractmethod` decorator | O(1) | O(1) | Mark method abstract |
+| `@abstractclassmethod` decorator | O(1) | O(1) | Mark classmethod abstract (legacy helper) |
+| `@abstractstaticmethod` decorator | O(1) | O(1) | Mark staticmethod abstract (legacy helper) |
+| `@abstractproperty` decorator | O(1) | O(1) | Mark property abstract (legacy helper) |
 | Class instantiation attempt | O(n) | O(n) | n = abstract methods |
 | `isinstance(obj, ABC)` | O(n) | O(1) | n = MRO length; may also check virtual subclasses |
 | `issubclass(cls, ABC)` | O(n) | O(1) | n = MRO length; may also check virtual subclasses |
 | Method resolution (MRO) | O(n) | O(n) | n = class hierarchy depth |
 | Register virtual subclass | O(1) | O(n) | n = registered classes |
+| `get_cache_token()` | O(1) | O(1) | Monotonic token for ABC cache invalidation |
+| `update_abstractmethods(cls)` | O(n) | O(n) | n = class hierarchy depth |
 
 ## Abstract Base Classes
 

docs/stdlib/annotationlib.md

@@ -11,8 +11,11 @@ The `annotationlib` module provides tools for introspecting annotations. Added i
 | `get_annotations(obj, format=FORWARDREF)` | O(n) | O(n) | Partial evaluation |
 | `get_annotations(obj, format=VALUE)` | O(n) | O(n) | Slowest: full evaluation, may import |
 | `call_annotate_function()` | O(n) | O(n) | Calls __annotate__ with format |
+| `call_evaluate_function()` | O(n) | O(n) | Calls __evaluate__ with format |
+| `get_annotate_from_class_namespace()` | O(n) | O(n) | Collects class __annotations__ |
 | `annotations_to_string()` | O(n) | O(n) | Convert dict values to strings |
 | `ForwardRef.evaluate()` | O(1) | O(1) | Resolve single forward reference |
+| `type_repr()` | O(1) | O(1) | String repr for types |
 
 ## Performance Characteristics
 

docs/stdlib/antigravity.md

@@ -7,6 +7,7 @@ The `antigravity` module is an Easter egg in Python that opens a web browser to
 | Operation | Time | Space | Notes |
 |-----------|------|-------|-------|
 | Import module | O(1) | O(1) | Open browser |
+| `geohash()` | O(n) | O(1) | n = input length, hashes and encodes |
 
 ## The Easter Egg
 

docs/stdlib/argparse.md

@@ -10,6 +10,8 @@ The `argparse` module provides a framework for creating command-line argument pa
 | `add_argument()` | O(1) | O(1) | Add single argument |
 | `parse_args()` | O(n) | O(n) | n = number of CLI args |
 | Help generation | O(m) | O(m) | m = total help text |
+| `FileType()` | O(1) | O(1) | Create file-opening callable |
+| `Namespace()` | O(1) | O(1) | Simple attribute container |
 
 ## Basic Usage
 

docs/stdlib/array.md

@@ -13,6 +13,7 @@ The `array` module provides an efficient array type for storing homogeneous data
 | Search | O(n) | O(1) | Linear search |
 | Insert | O(n) | O(1) | Insert at position |
 | Remove | O(n) | O(1) | Remove element |
+| `typecodes` | O(1) | O(1) | String of supported type codes |
 
 ## Basic Usage
 

docs/stdlib/ast.md

@@ -8,8 +8,20 @@ The `ast` module provides classes for working with abstract syntax trees of Pyth
 |-----------|------|-------|-------|
 | `ast.parse()` | O(n) | O(n) | n = source code length |
 | `ast.literal_eval()` | O(n) | O(n) | Safe evaluation of literals |
+| `ast.compare()` | O(n) | O(h) | n = nodes, h = max recursion depth |
 | Tree traversal | O(n) | O(h) | n = nodes, h = max recursion depth |
 | Node creation | O(1) | O(1) | Create single node |
+| `ast.dump()` | O(n) | O(n) | n = nodes included in output |
+| `ast.unparse()` | O(n) | O(n) | n = nodes in tree |
+| `ast.walk()` | O(n) | O(n) | n = nodes returned |
+| `ast.iter_child_nodes()` | O(k) | O(1) | k = direct children |
+| `ast.iter_fields()` | O(k) | O(1) | k = fields on a node |
+| `ast.copy_location()` | O(1) | O(1) | Copies lineno/col offsets |
+| `ast.fix_missing_locations()` | O(n) | O(h) | Walks and fills missing info |
+| `ast.increment_lineno()` | O(n) | O(h) | Adjusts lineno across tree |
+| `ast.get_docstring()` | O(n) | O(1) | Scans first statements |
+| `ast.get_source_segment()` | O(m) | O(1) | m = segment length |
+| `ast.main()` | O(n) | O(n) | Parses input file and dumps AST |
 
 ## Parsing Python Code
 

docs/stdlib/asyncio.md

@@ -11,7 +11,43 @@ The `asyncio` module provides infrastructure for writing single-threaded concurr
 | Task creation | O(1) | O(1) | Wrap coroutine |
 | `asyncio.gather()` | O(1) | O(n) | n = number of tasks |
 | `asyncio.wait()` | O(n) | O(n) | n = tasks waiting |
+| `asyncio.sleep()` | O(1) | O(1) | Schedules timer handle |
+| `asyncio.iscoroutine()` | O(1) | O(1) | Type check |
+| `asyncio.iscoroutinefunction()` | O(1) | O(1) | Type check |
+| `asyncio.isfuture()` | O(1) | O(1) | Type check |
+| `asyncio.to_thread()` | O(1) | O(1) | Offload to thread; work cost external |
+| `asyncio.run_coroutine_threadsafe()` | O(1) | O(1) | Submit coroutine to loop thread |
+| `asyncio.create_task()` | O(1) | O(1) | Schedule coroutine in loop |
+| `asyncio.ensure_future()` | O(1) | O(1) | Wrap coroutine/future |
+| `asyncio.all_tasks()` | O(n) | O(1) | n = tasks tracked by loop |
+| `asyncio.current_task()` | O(1) | O(1) | Lookup current task |
+| `asyncio.as_completed()` | O(n) | O(n) | n = awaitables, yields as done |
+| `asyncio.wait()` | O(n) | O(n) | n = tasks waiting |
+| `asyncio.wait_for()` | O(1) | O(1) | Timeout wrapper around awaitable |
+| `asyncio.timeout()` | O(1) | O(1) | Async context manager wrapper |
+| `asyncio.timeout_at()` | O(1) | O(1) | Absolute-time timeout wrapper |
 | Event queue operation | O(log n) | O(1) | Heap-based scheduling; n = pending events |
+| `asyncio.open_connection()` | O(1) | O(1) | Connection setup; I/O dominates |
+| `asyncio.open_unix_connection()` | O(1) | O(1) | Unix socket setup |
+| `asyncio.start_server()` | O(1) | O(1) | Create server and start listening |
+| `asyncio.start_unix_server()` | O(1) | O(1) | Unix socket server |
+| `asyncio.create_subprocess_exec()` | O(1) | O(1) | Spawn subprocess; external cost |
+| `asyncio.create_subprocess_shell()` | O(1) | O(1) | Spawn shell; external cost |
+| `asyncio.wrap_future()` | O(1) | O(1) | Convert concurrent future |
+| `asyncio.shield()` | O(1) | O(1) | Prevent cancellation propagation |
+| `asyncio.get_event_loop()` | O(1) | O(1) | Returns or creates loop |
+| `asyncio.get_running_loop()` | O(1) | O(1) | Lookup running loop |
+| `asyncio.new_event_loop()` | O(1) | O(1) | Create loop |
+| `asyncio.set_event_loop()` | O(1) | O(1) | Set loop in policy |
+| `asyncio.get_event_loop_policy()` | O(1) | O(1) | Get global policy |
+| `asyncio.set_event_loop_policy()` | O(1) | O(1) | Set global policy |
+| `asyncio.create_eager_task_factory()` | O(1) | O(1) | Build task factory callable |
+| `asyncio.eager_task_factory()` | O(1) | O(1) | Prebuilt eager task factory |
+| `asyncio.capture_call_graph()` | O(n) | O(n) | n = frames and awaited tasks |
+| `asyncio.format_call_graph()` | O(n) | O(n) | Formats captured call graph |
+| `asyncio.print_call_graph()` | O(n) | O(n) | Prints captured call graph |
+| `asyncio.future_add_to_awaited_by()` | O(1) | O(1) | Register awaiter |
+| `asyncio.future_discard_from_awaited_by()` | O(1) | O(1) | Unregister awaiter |
 
 ## Async Basics
 
@@ -507,6 +543,7 @@ asyncio.run(main())
 - **Task state**: O(m) for m coroutine frames
 - **Queues**: O(n) for n items
 
+
 ## Related Documentation
 
 - [Threading Module](threading.md)

docs/stdlib/atexit.md

@@ -0,0 +1,62 @@
+# atexit Module Complexity
+
+The `atexit` module registers functions to run when the interpreter terminates
+normally. Handlers run in last-in, first-out (LIFO) order.
+
+## Complexity Reference
+
+| Operation | Time | Space | Notes |
+|-----------|------|-------|-------|
+| `atexit.register()` | O(1) | O(1) | Append handler to stack |
+| `atexit.unregister()` | O(n) | O(1) | n = registered handlers; removes all matches |
+| Handler execution | O(n) | O(1) | n = registered handlers; LIFO order |
+
+!!! warning "When handlers run"
+    Handlers run only on normal interpreter shutdown (e.g., program end or
+    `sys.exit()`). They do not run on `os._exit()` or hard termination signals.
+
+## Registering Cleanup Handlers
+
+```python
+import atexit
+
+# Register handler - O(1)
+@atexit.register
+def cleanup():
+    print("Cleaning up")
+```
+
+## Handler Order (LIFO)
+
+```python
+import atexit
+
+@atexit.register
+def first():
+    print("first")
+
+@atexit.register
+def second():
+    print("second")
+
+# On shutdown:
+# second
+# first
+```
+
+## Unregistering Handlers
+
+```python
+import atexit
+
+def temp():
+    pass
+
+atexit.register(temp)
+atexit.unregister(temp)  # O(n) scan to remove all matches
+```
+
+## Related Documentation
+
+- [sys Module](sys.md)
+- [signal Module](signal.md)