Coinductive IR decision engine for structural subset matching.
v3 replaces sinho 2.2's A* search with a direct structural walk:
The coinductive assumption set (seen pairs) prevents infinite loops on recursive structures, analogous to sinho 2.2's seen map.
Coinductive IR decision engine for structural subset matching. v3 replaces sinho 2.2's A* search with a direct structural walk: - Maps: O(n) via key lookup (no pairings search) - Sets: O(n^3) via Kuhn's augmenting-paths for verdicts; greedy O(n^2 log n) for diffs - Sequences: O(m*n) via tree-edit-distance DP - Atoms: O(1) direct equality - Predicates: (pred f) wrapper dispatch The coinductive assumption set (seen pairs) prevents infinite loops on recursive structures, analogous to sinho 2.2's seen map.
(=* a b)(=* a b options)Structural subset matcher: is expected a structural subset of actual? Returns expected on match, a diff structure on mismatch. Options map supports :timeout (ms) for cooperative timeout.
Structural subset matcher: is expected a structural subset of actual? Returns expected on match, a diff structure on mismatch. Options map supports :timeout (ms) for cooperative timeout.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |