@ori-ori/coherence
v0.1.0
Published
Propagation graph and change detection for ori
Readme
@ori-ori/coherence
Change detection and propagation for the ori coherence graph.
Concepts
- Node: a file (
filepropagation level) or section ({#id}-anchored H2/H3). - Edge:
derives_from(SSoT-protected) orreferences(weak link). - Graph: bidirectional adjacency; built from slice/page manifests.
- Propagation: single algorithm — when a node changes, every adjacent node is marked dirty. The receiver decides what to do (re-derive, propose, ignore).
- SSoT protection: enforced at edit-time via
--force, not at propagation time.
Exports
buildGraph(edges)/neighbors(graph, node)— graph construction & lookuppropagate(graph, changedNode)— fan out a change to all neighboursdetectChangesInFile(path, prev, curr, opts)— compare two revisions and return changed nodesparseManifest(yaml)— validate.ori/slices/<id>/manifest.yamlor.ori/pages/<id>/manifest.yaml(discriminated bytype)
