Add: Complexity row count script

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

Author: heikkitoivonen

docs/index.md

@@ -44,12 +44,12 @@ See [Built-in Types](builtins/list.md) for detailed analysis.
 
 - **Python Versions**: 3.9-3.14
 - **Implementations**: CPython, PyPy, Jython, IronPython
-- **Operations**: Over 100+ built-in and stdlib operations
+- **Operations**: 2,200+ built-in and stdlib operations
 - **Updates**: Regularly updated with new Python releases
 
 ## Why Trust This Documentation?
 
-This documentation has been reviewed and refined through **100+ commits** by multiple AI coding agents (Amp, Claude, Gemini CLI, Kiro, Copilot, Codex) and models (Opus 4.5, Sonnet 4.5, Gemini 3 Pro, gpt-5.2-codex, ...) working alongside human contributors. Each agent brings different perspectives and catches different issues, resulting in thorough cross-validation. A growing unit test suite validates complexity claims against actual Python behavior.
+This documentation has been reviewed and refined by multiple AI coding agents (Amp, Claude, Gemini CLI, Kiro, Copilot, Codex) and models (Opus 4.5, Sonnet 4.5, Gemini 3 Pro, gpt-5.2-codex, ...) working alongside human contributors. Each agent brings different perspectives and catches different issues, resulting in thorough cross-validation. A growing unit test suite validates complexity claims against actual Python behavior.
 
 It's also **fully open source**—anyone can review the content, [file issues](https://github.com/heikkitoivonen/python-time-space-complexity/issues), or [submit improvements](https://github.com/heikkitoivonen/python-time-space-complexity/pulls). All sources are cited, and claims are based on official Python documentation and CPython source code.
 

scripts/count_complexity_rows.py

@@ -0,0 +1,68 @@
+#!/usr/bin/env python3
+from __future__ import annotations
+
+import argparse
+from pathlib import Path
+
+
+def is_separator(line: str) -> bool:
+    stripped = line.strip()
+    if not stripped:
+        return False
+    if not set(stripped) <= set("|-: "):
+        return False
+    return "-" in stripped
+
+
+def count_tables(path: Path) -> int:
+    lines = path.read_text(encoding="utf-8").splitlines()
+    total = 0
+    i = 0
+    while i < len(lines):
+        line = lines[i].strip()
+        if line.startswith("|") and "Time" in line and "Space" in line and "Notes" in line:
+            if i + 1 < len(lines) and is_separator(lines[i + 1]):
+                i += 2
+                while i < len(lines):
+                    row = lines[i].strip()
+                    if not row.startswith("|") or row == "|":
+                        break
+                    if not is_separator(row):
+                        total += 1
+                    i += 1
+                continue
+        i += 1
+    return total
+
+
+def main() -> int:
+    parser = argparse.ArgumentParser(
+        description="Count complexity table rows (Time/Space/Notes) in docs."
+    )
+    parser.add_argument(
+        "--root",
+        default="docs",
+        help="Root docs directory to scan (default: docs).",
+    )
+    args = parser.parse_args()
+
+    root = Path(args.root)
+    counts = {path: count_tables(path) for path in root.rglob("*.md")}
+
+    total_rows = sum(counts.values())
+    files_with_rows = sum(1 for v in counts.values() if v)
+
+    def sum_for(subdir: str) -> int:
+        return sum(v for p, v in counts.items() if p.parts[:2] == (root.name, subdir))
+
+    print(f"total_rows {total_rows}")
+    print(f"total_files_with_rows {files_with_rows}")
+    print(f"builtins_rows {sum_for('builtins')}")
+    print(f"stdlib_rows {sum_for('stdlib')}")
+    print(f"versions_rows {sum_for('versions')}")
+    print(f"implementations_rows {sum_for('implementations')}")
+    return 0
+
+
+if __name__ == "__main__":
+    raise SystemExit(main())