beam cf17d9ee0a beam: add lis (O(n log n) patience sorting) + tests

2026-10-30 17:38:04 +00:00

..

toposort

beam: sync iterative toposort to sibling copy

2026-10-26 06:24:54 +00:00

.gitignore

…

aho_corasick.py

beam: fix Aho-Corasick empty-pattern handling (emit at every position)

2026-10-25 14:06:35 +00:00

astar.py

beam: A* shortest-path with admissible heuristic + randomized cross-check vs Dijkstra

2026-10-28 22:09:31 +00:00

atomic_write.py

…

beam_assert.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

bellman_ford.py

beam: add bellman_ford with negative-cycle detection + tests

2026-10-30 09:13:27 +00:00

bfs_shortest_path.py

beam: BFS shortest path module with tests

2026-10-27 19:36:01 +00:00

bisect_bounds.py

beam: add bisect_bounds (lower/upper bound) with randomized tests

2026-10-29 02:12:43 +00:00

bloom_filter.py

forge: fix bloom_filter serialization dropping _count on from_bytes round-trip

2026-10-24 02:45:16 +00:00

bulkhead.py

beam: thread-safe bulkhead (bounded concurrency) with tests

2026-10-21 08:08:16 +00:00

canonical_url.py

beam: URL canonicalization utility with tests

2026-10-29 00:11:17 +00:00

CHECK

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

circuit_breaker.py

beam: circuit_breaker HALF_OPEN single-probe gating

2026-10-28 07:55:53 +00:00

clamp.py

beam: add clamp primitive with tests

2026-10-26 20:46:33 +00:00

conftest.py

beam: add conftest.py so pytest importlib mode resolves sibling modules

2026-10-30 12:46:22 +00:00

consistent_hash.py

beam: consistent hashing ring with virtual nodes + tests

2026-10-23 13:11:38 +00:00

count_min_sketch.py

beam: count-min sketch with serialization and tests

2026-10-27 17:33:39 +00:00

csv_rfc4180.py

beam: RFC4180 CSV parser+writer with roundtrip tests

2026-10-21 20:20:31 +00:00

dijkstra.py

beam: dijkstra shortest path with tests

2026-10-23 05:03:32 +00:00

dinic_maxflow.py

beam: Dinic max-flow implementation with randomized cross-check vs Edmonds-Karp (8 tests pass)

2026-10-28 14:00:34 +00:00

dsu_rollback.py

beam: Q94 bullets 2/3/4 -- three cells that each kill a named mutant

2026-10-27 16:58:24 +00:00

dsu.py

beam: add DSU (union-find) with path compression, rank, size, tests

2026-10-22 14:42:55 +00:00

fenwick_range.py

beam: add FenwickRange (range add/range sum) with tests

2026-10-29 16:45:54 +00:00

fenwick.py

beam: Fenwick (BIT) with point update, prefix/range sums, lower_bound + tests

2026-10-28 01:41:08 +00:00

find_duplicate.py

volt: Q95 -- find_duplicate gets a declared dead branch and 12 collected cells

2026-10-28 19:23:04 +00:00

gate-green-2026-10-26.txt

beam: gate-green artifact (Ran 174 tests, rc 0)

2026-10-26 14:36:51 +00:00

hopcroft_karp.py

beam: add Hopcroft-Karp bipartite matching with brute-force-verified tests

2026-10-29 04:14:32 +00:00

index_regen_note.txt

beam: regenerate stale queue-index.md (index-current fault)

2026-10-25 01:53:31 +00:00

interval_overlap.py

beam: cells for interval_overlap.py -- CHECK 202 -> 214, rc 0; docstring names has_any_overlap, early exit added (Q84)

2026-10-27 00:38:24 +00:00

json_canonical.py

volt: beam: Q82 -- json_canonical.py says it is not JCS and names the three measured divergences

2026-10-26 20:05:45 +00:00

jsonl_validate.py

pipe: Q104 re-closed -- revert f3d812f's swept jsonl_validate.py to dc46100 (md5 04227211->88966712), beam gate Ran 276 rc1 -> Ran 276 OK rc0; contract re-measured (bin input rc2 no traceback, BOM rc0); swept --max-errors guard filed as candidate, not smuggled back

2026-10-28 07:47:58 +00:00

jump_consistent_hash.py

beam: add jump consistent hash primitive with tests

2026-10-24 09:33:31 +00:00

jump_ref.c

beam: Q59 -- pin the jump hash mapping with golden vectors from the C reference

2026-10-24 11:46:16 +00:00

kmp.py

beam: KMP substring search primitive with tests

2026-10-25 16:08:22 +00:00

lcs.py

beam: add LCS module with tests (length, reconstruction, diff)

2026-10-22 18:48:06 +00:00

levenshtein.py

beam: add Levenshtein edit distance with two-row DP and verified tests

2026-10-25 05:59:25 +00:00

lfu_cache.py

beam: O(1) LFU cache with doubly-linked freq buckets + tests

2026-10-27 15:31:19 +00:00

lis.py

beam: add lis (O(n log n) patience sorting) + tests

2026-10-30 17:38:04 +00:00

lru_cache.py

beam: fix LRU cache get() missing-key return (None -> -1 to match spec/tests)

2026-10-30 05:37:09 +00:00

lru_ttl_cache_beam.py

beam: LRU cache with per-entry TTL (beam variant) + tests

2026-10-28 20:07:31 +00:00

lru_ttl_cache.py

beam: add thread-safe LRU cache with per-entry TTL + tests

2026-10-23 23:24:46 +00:00

majority_element.py

volt: majority() distinguishes empty, no-majority and a None/NaN majority (Q102)

2026-10-29 15:38:20 +00:00

manacher.py

beam: add Manacher longest-palindromic-substring O(n) with tests

2026-10-29 06:16:21 +00:00

manifest.py

volt: beam: Q79 -- manifest.py carries the lane's 0/1/2 exit contract, records directory symlinks, and stops reading its own output as a tamper

2026-10-26 17:58:37 +00:00

median_two_sorted.py

beam: median of two sorted arrays (binary partition) + fuzz tests

2026-10-29 10:35:08 +00:00

merge_intervals.py

beam: add merge_intervals utility with tests

2026-10-23 03:01:29 +00:00

min_meeting_rooms.py

beam: add min_meeting_rooms (sweep + heap, zero-length safe)

2026-10-30 12:46:22 +00:00

min_window_substring.py

beam: minimum window substring (sliding window) + property tests

2026-10-29 12:36:27 +00:00

minhash_dedup.py

beam: MinHash near-duplicate line detector with tests

2026-10-29 18:46:59 +00:00

near_dup.py

beam: near-duplicate line detector via MinHash + union-find

2026-10-22 04:33:46 +00:00

path_sandbox.py

beam: fix path_sandbox root="/" containment (was requiring "//" prefix)

2026-10-28 11:58:49 +00:00

rate_limiter.py

beam: sliding-window rate limiter with injectable clock + tests

2026-10-25 10:03:13 +00:00

ratelimit.py

beam: token-bucket rate limiter with injectable clock + tests

2026-10-28 16:02:19 +00:00

rendezvous_hash.py

beam: rendezvous (HRW) hashing module with tests

2026-10-25 08:02:00 +00:00

retry_jitter.py

beam: add retry_jitter with bounded full-jitter backoff and tests

2026-10-24 19:43:27 +00:00

retry.py

…

robin_hood_hash.py

beam: Robin Hood open-addressing hash table with randomized correctness tests

2026-10-26 08:28:10 +00:00

rotated_binary_search.py

beam: add rotated binary search with tests

2026-10-30 05:37:09 +00:00

run_lane_tests.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

safe_eval.py

beam: fix safe_eval chained unary signs (--2, +-3) by recursing factor

2026-10-24 01:26:32 +00:00

safe_extract.py

beam: safe tar extraction module with path-traversal/symlink/hardlink guards + tests

2026-10-22 08:37:04 +00:00

scc_tarjan.py

beam: Tarjan SCC implementation with tests

2026-10-26 04:21:13 +00:00

scc.py

beam: iterative Tarjan SCC (no recursion limit), verified vs recursive oracle + 200k cycle

2026-10-24 21:46:31 +00:00

segment_tree.py

volt: Q77 -- segment-tree cells collected (beam discover 159->174, rc 0), out-of-range raises IndexError instead of clamping, empty-tree phantom red-celled, power-of-two padding asserted over 205,693 internal nodes

2026-10-26 13:34:27 +00:00

semver.py

beam: add semver parser/comparator with tests

2026-10-30 05:37:10 +00:00

sha256_manifest.py

volt: beam: Q79 -- name one canonical directory manifest: manifest.py, with sha256_manifest.py retained for the sha256sum-compatible line format

2026-10-26 17:58:42 +00:00

shadow_lint.py

beam: fix shadow_lint outer_line always 0 (record binding lines)

2026-10-26 00:17:08 +00:00

singleflight.py

beam: add single-flight (request coalescing) primitive with tests

2026-10-21 10:10:26 +00:00

sliding_window_max.py

beam: add sliding_window_max (monotonic deque) + tests

2026-10-30 13:28:00 +00:00

sliding_window_median.py

beam: sliding window median with two-heap lazy deletion + tests

2026-10-26 10:29:44 +00:00

sliding_window.py

beam: add sliding-window rate limiter primitive with tests

2026-10-22 02:32:38 +00:00

smooth_wrr.py

beam: add smooth weighted round-robin scheduler with tests

2026-10-24 13:37:32 +00:00

sparse_table.py

beam: add SparseTable (O(1) idempotent range query) + randomized tests

2026-10-28 05:44:13 +00:00

task_scheduler.py

beam: exact task scheduler with brute-force cross-check

2026-10-23 07:05:30 +00:00

test_aho_corasick.py

beam: Aho-Corasick multi-pattern matcher with failure links and tests

2026-10-23 19:18:45 +00:00

test_astar.py

beam: A* shortest-path with admissible heuristic + randomized cross-check vs Dijkstra

2026-10-28 22:09:31 +00:00

test_atomic_write.py

…

test_bellman_ford.py

beam: add bellman_ford with negative-cycle detection + tests

2026-10-30 09:13:27 +00:00

test_bfs.py

q98: bind the last 8 host-locked test files to their own directory; import_resolve_check 9 faults -> 0

2026-10-27 19:45:56 +00:00

test_bisect_bounds.py

beam: guard module-level sys.exit in two test files so pytest collection succeeds

2026-10-29 08:33:58 +00:00

test_bloom_filter.py

forge: fix bloom_filter serialization dropping _count on from_bytes round-trip

2026-10-24 02:45:16 +00:00

test_bulkhead.py

beam: thread-safe bulkhead (bounded concurrency) with tests

2026-10-21 08:08:16 +00:00

test_canonical_url.py

volt: Q126 -- gate 9/9: nine host-bound test files rebound to the repo module, 225 census paths ledgered

2026-10-30 05:37:30 +00:00

test_circuit_breaker.py

beam: thread-safe circuit breaker with state machine + tests

2026-10-21 06:06:35 +00:00

test_clamp.py

beam: add clamp primitive with tests

2026-10-26 20:46:33 +00:00

test_consistent_hash.py

beam: consistent hashing ring with virtual nodes + tests

2026-10-23 13:11:38 +00:00

test_count_min_sketch.py

q98: bind the last 8 host-locked test files to their own directory; import_resolve_check 9 faults -> 0

2026-10-27 19:45:56 +00:00

test_csv.py

beam: remove sys.path shadowing so CHECK runs against repo modules

2026-10-22 16:45:49 +00:00

test_dijkstra.py

beam: dijkstra shortest path with tests

2026-10-23 05:03:32 +00:00

test_dinic_maxflow.py

beam: Dinic max-flow implementation with randomized cross-check vs Edmonds-Karp (8 tests pass)

2026-10-28 14:00:34 +00:00

test_dsu_rollback.py

beam: Q94 bullets 2/3/4 -- three cells that each kill a named mutant

2026-10-27 16:58:24 +00:00

test_dsu.py

beam: add DSU (union-find) with path compression, rank, size, tests

2026-10-22 14:42:55 +00:00

test_fenwick_range.py

beam: add FenwickRange (range add/range sum) with tests

2026-10-29 16:45:54 +00:00

test_fenwick.py

beam: Fenwick (BIT) with point update, prefix/range sums, lower_bound + tests

2026-10-28 01:41:08 +00:00

test_find_duplicate.py

volt: Q95 -- find_duplicate gets a declared dead branch and 12 collected cells

2026-10-28 19:23:04 +00:00

test_hopcroft_karp.py

beam: add Hopcroft-Karp bipartite matching with brute-force-verified tests

2026-10-29 04:14:32 +00:00

test_interval_overlap.py

beam: cells for interval_overlap.py -- CHECK 202 -> 214, rc 0; docstring names has_any_overlap, early exit added (Q84)

2026-10-27 00:38:24 +00:00

test_json_canonical.py

volt: beam: Q82 -- test_json_canonical.py becomes 7 discoverable cells; lane gate Ran 191 -> 198

2026-10-26 20:05:13 +00:00

test_jsonl_validate.py

volt: Q104 done -- beam jsonl_validate's exit-code contract pinned by a 25-test file, and the decode path returns 2 not 1

2026-10-28 05:01:10 +00:00

test_jump_consistent_hash.py

beam: Q59 -- pin the jump hash mapping with golden vectors from the C reference

2026-10-24 11:46:16 +00:00

test_kmp.py

beam: Q66 pin overlapping search_count (aaaa,aa)==3

2026-10-26 02:19:21 +00:00

test_lcs.py

beam: fix hardcoded sys.path in test_lcs/toposort + make merge_intervals discoverable

2026-10-23 15:13:46 +00:00

test_levenshtein.py

beam: convert test_levenshtein to unittest.TestCase so lane gate collects it

2026-10-25 22:14:26 +00:00

test_lfu_cache.py

beam: count-min sketch with serialization and tests

2026-10-27 17:33:39 +00:00

test_lis.py

beam: add lis (O(n log n) patience sorting) + tests

2026-10-30 17:38:04 +00:00

test_lru_cache.py

beam: O(1) LRU cache with randomized property tests

2026-10-24 07:32:13 +00:00

test_lru_ttl_cache_beam.py

beam: LRU cache with per-entry TTL (beam variant) + tests

2026-10-28 20:07:31 +00:00

test_lru_ttl_cache.py

beam: add thread-safe LRU cache with per-entry TTL + tests

2026-10-23 23:24:46 +00:00

test_majority_element.py

volt: majority() distinguishes empty, no-majority and a None/NaN majority (Q102)

2026-10-29 15:38:20 +00:00

test_manacher.py

beam: add Manacher longest-palindromic-substring O(n) with tests

2026-10-29 06:16:21 +00:00

test_manifest.py

volt: beam: Q79 -- test_manifest.py lands 17 discoverable cells; lane gate Ran 174 -> 191

2026-10-26 17:58:45 +00:00

test_median.py

volt: Q126 -- gate 9/9: nine host-bound test files rebound to the repo module, 225 census paths ledgered

2026-10-30 05:37:30 +00:00

test_merge_intervals.py

beam: fix hardcoded sys.path in test_lcs/toposort + make merge_intervals discoverable

2026-10-23 15:13:46 +00:00

test_min_meeting_rooms.py

beam: add min_meeting_rooms (sweep + heap, zero-length safe)

2026-10-30 12:46:22 +00:00

test_min_window_substring.py

beam: minimum window substring (sliding window) + property tests

2026-10-29 12:36:27 +00:00

test_minhash.py

beam: MinHash near-duplicate line detector with tests

2026-10-29 18:46:59 +00:00

test_near_dup.py

beam: near-duplicate line detector via MinHash + union-find

2026-10-22 04:33:46 +00:00

test_path_sandbox.py

beam: path_sandbox module with traversal/symlink guards + tests

2026-10-25 12:04:34 +00:00

test_rate_limiter.py

beam: sliding-window rate limiter with injectable clock + tests

2026-10-25 10:03:13 +00:00

test_ratelimit.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

test_rendezvous_hash.py

volt: Q68 -- topo_levels materialises a one-shot edges iterable (generator/map/iter all returned every node in level 0 and a one-shot cycle was reported as ordered), and the suite resolves its sibling instead of the host copy

2026-10-25 19:43:49 +00:00

test_retry_jitter.py

beam: convert retry_jitter tests to TestCase + mutant-killing assertions (Q59)

2026-10-29 14:38:19 +00:00

test_retry.py

…

test_robin_hood_hash.py

beam: Q76 -- median cells are collected by the lane gate, and CHECK is green unmasked

2026-10-26 11:18:04 +00:00

test_rotated_binary_search.py

beam: fix rotated_binary_search test pivot expectation (left-rotation semantics)

2026-10-30 07:11:14 +00:00

test_run_lane_tests.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

test_safe_eval.py

beam: guard module-level sys.exit in two test files so pytest collection succeeds

2026-10-29 08:33:58 +00:00

test_safe_extract.py

beam: safe tar extraction module with path-traversal/symlink/hardlink guards + tests

2026-10-22 08:37:04 +00:00

test_scc_tarjan.py

beam: Tarjan SCC implementation with tests

2026-10-26 04:21:13 +00:00

test_scc.py

beam: test_scc imports in-tree module instead of external wizard-outputs copy

2026-10-24 23:48:42 +00:00

test_segment_tree.py

volt: Q77 -- segment-tree cells collected (beam discover 159->174, rc 0), out-of-range raises IndexError instead of clamping, empty-tree phantom red-celled, power-of-two padding asserted over 205,693 internal nodes

2026-10-26 13:34:27 +00:00

test_semver.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

test_sha256_manifest.py

…

test_shadow.py

volt: Q111 correction -- 11ms control was 19/20 red (20ms now, 30/30) + test_shadow fixture race (10/10 red concurrent -> 0/10)

2026-10-28 14:35:29 +00:00

test_singleflight.py

beam: add single-flight (request coalescing) primitive with tests

2026-10-21 10:10:26 +00:00

test_sliding_window_max.py

beam: add sliding_window_max (monotonic deque) + tests

2026-10-30 13:28:00 +00:00

test_sliding_window_median.py

beam: Q76 -- median cells are collected by the lane gate, and CHECK is green unmasked

2026-10-26 11:18:04 +00:00

test_sliding_window.py

beam: remove sys.path shadowing so CHECK runs against repo modules

2026-10-22 16:45:49 +00:00

test_smooth_wrr.py

beam: add smooth weighted round-robin scheduler with tests

2026-10-24 13:37:32 +00:00

test_sparse_table.py

beam: add SparseTable (O(1) idempotent range query) + randomized tests

2026-10-28 05:44:13 +00:00

test_task_scheduler.py

beam: add test_task_scheduler.py (11 tests) covering exact-vs-critical-path and validation

2026-10-28 18:05:57 +00:00

test_token_bucket.py

beam: convert test_token_bucket to unittest so runner collects all 9

2026-10-30 15:33:49 +00:00

test_topo_beam.py

beam: remove sys.path shadowing so CHECK runs against repo modules

2026-10-22 16:45:49 +00:00

test_topo_levels.py

volt: Q68 -- closure record and evidence doc; the docstring's host-path token removed so the census reads 0 in beam's three files; index re-rendered

2026-10-25 19:49:25 +00:00

test_topo_sort.py

beam: remove sys.path shadowing so CHECK runs against repo modules

2026-10-22 16:45:49 +00:00

test_topo.py

beam: remove sys.path shadowing so CHECK runs against repo modules

2026-10-22 16:45:49 +00:00

test_toposort.py

beam: Q61 -- materialise each dependency iterable once, resolve the module locally, drop the dead first pass

2026-10-24 16:14:24 +00:00

test_tree_root.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

test_trie.py

volt: Q70 -- beam's trie cells now run in CHECK (139 -> 151 tests) and count_prefix counts distinct words, not lifetime inserts (rc 0, 8/8 mutants killed)

2026-10-26 00:20:31 +00:00

test_weighted_interval_scheduling.py

beam: Q128 -- CHECK now grades all 570 cells on stdlib alone (no pytest)

2026-10-30 16:13:11 +00:00

test_z_algorithm.py

beam: add Z-algorithm utility + randomized brute-force tests

2026-10-28 03:42:55 +00:00

test_zeller_dow.py

beam: zeller_dow validate gap dates and month lengths; add tests

2026-10-27 03:03:12 +00:00

token_bucket.py

…

topo_levels.py

volt: Q68 -- topo_levels materialises a one-shot edges iterable (generator/map/iter all returned every node in level 0 and a one-shot cycle was reported as ordered), and the suite resolves its sibling instead of the host copy

2026-10-25 19:43:49 +00:00

topo_sort.py

beam: deterministic topo sort with cycle detection + tests

2026-10-21 16:17:19 +00:00

topo.py

beam: deterministic topological sort with cycle detection

2026-10-22 10:38:56 +00:00

toposort.py

beam: make topo_sort cycle detection iterative (no RecursionError)

2026-10-26 06:23:52 +00:00

tree_root.py

beam: fix find_tree_root to realpath for symlink parity

2026-10-27 05:09:12 +00:00

trie.py

volt: Q70 -- beam's trie cells now run in CHECK (139 -> 151 tests) and count_prefix counts distinct words, not lifetime inserts (rc 0, 8/8 mutants killed)

2026-10-26 00:20:31 +00:00

verify_toposort_gen.py

beam: verify_toposort_gen probe for one-shot iterator materialisation

2026-10-29 22:55:10 +00:00

verify_toposort_none.py

q63: beam/verify_toposort_none -- asserts to _check(), so -O cannot print ALL VERIFIED on a broken toposort; record the unwired one-off status in-file

2026-10-24 18:26:47 +00:00

weighted_interval_scheduling.py

volt: Q111 -- weighted_interval_scheduling handles zero-length intervals, rejects reversed input; new test_*.py cell collected by beam CHECK (rc 0, 415 passed / 2007 subtests)

2026-10-28 14:00:59 +00:00

z_algorithm.py

beam: add Z-algorithm utility + randomized brute-force tests

2026-10-28 03:42:55 +00:00

zeller_dow.py

beam: zeller_dow validate gap dates and month lengths; add tests

2026-10-27 03:03:12 +00:00