@zalom/plastic 1.0.0-beta.7 → 1.0.0-beta.9

package/scripts/lib/graph_rebuild.rb

@@ -0,0 +1,328 @@
+# encoding: UTF-8
+# frozen_string_literal: true
+
+# GraphRebuild — pure logic for repairing the store-wide sources/chain graph
+# (intent 49). Mirrors the pure-module style of IntentValidator: module-function
+# helpers with no file IO. The IO shell (scripts/rebuild-graph) and doctor build
+# the in-memory maps and feed them here.
+#
+# Two concerns live here:
+#   1. Cross-store relocation. Each store's INDEX.md `## Relocated` log records
+#      moves like `global:24 → project:22c` (or backtick bare-id form `1b1a1 → 41`).
+#      build_relocation_map parses every log into a multi-hop-collapsed map; the
+#      resolver consults it BEFORE direct id resolution so a relocation always wins
+#      over a coincidentally-reused id (the `global:24` impostor hazard).
+#   2. The per-intent rebuild transform (intent 68 I-invariants, one-directional):
+#      dedupe -> I3 (formative edge wins) -> cross-store resolve -> I1 backlinks ->
+#      I2 preserved (relational chains survive).
+module GraphRebuild
+  module_function
+
+  RELOCATION_ARROW = "→" # the unicode → used in every Relocated log
+
+  # PURE. Parse every store's INDEX.md `## Relocated` block into a multi-hop
+  # relocation map.
+  #
+  # `index_texts` is { store_key => index_md_string } where store_key is "global"
+  # or "project:<slug>". Returns { [from_store, from_id] => [to_store, to_id] }
+  # with chains transitively collapsed to their final hop. The `to_store` token is
+  # NORMALIZED: the generic `project:` token in the global log is left as the
+  # literal it appears with; resolve_ref maps a same-family target to a bare id.
+  #
+  # Two real arrow forms are handled:
+  #   - `global:24 → project:22c`   (store-prefixed, global log)
+  #   - `1b1a1 → 41` inside backticks (bare ids, plastic log) — these are
+  #     same-store moves; from/to store both default to the store the log lives in.
+  def build_relocation_map(index_texts)
+    raw = {}
+    (index_texts || {}).each do |store_key, text|
+      next unless text.is_a?(String)
+
+      relocated_block(text).each_line do |line|
+        parse_relocation_line(line, store_key).each do |(from, to)|
+          raw[from] = to
+        end
+      end
+    end
+    collapse_multi_hop(raw)
+  end
+
+  # Extract the text of the `## Relocated` section (everything from the heading to
+  # the next top-level `## ` heading or EOF). Returns "" when absent.
+  def relocated_block(text)
+    lines = text.lines
+    start = lines.index { |l| l.strip == "## Relocated" }
+    return "" if start.nil?
+
+    rest = lines[(start + 1)..] || []
+    stop = rest.index { |l| l.start_with?("## ") }
+    (stop ? rest[0...stop] : rest).join
+  end
+
+  # Parse one log line into an array of [[from_store, from_id], [to_store, to_id]]
+  # pairs. A line may pack several comma-separated pairs and carry trailing prose
+  # in parens. Lines without an arrow yield []. `home_store` is the store whose
+  # log this line came from (used as the default store for bare ids).
+  def parse_relocation_line(line, home_store)
+    body = line.sub(/\A\s*-\s*/, "") # drop list bullet
+    return [] unless body.include?(RELOCATION_ARROW)
+
+    body.split(",").filter_map do |segment|
+      seg = segment.strip
+      next nil unless seg.include?(RELOCATION_ARROW)
+
+      left, right = seg.split(RELOCATION_ARROW, 2)
+      from = parse_token(left, home_store)
+      to = parse_token(right, home_store)
+      next nil if from.nil? || to.nil?
+
+      [from, to]
+    end
+  end
+
+  # Parse a single `store:id` / bare-id token (possibly wrapped in backticks or
+  # trailed by parenthetical prose) into [store_key, bare_id], or nil. A bare id
+  # defaults to `home_store`. The generic `project:` prefix is resolved later by
+  # resolve_ref against the referer's store family; here it is recorded literally.
+  def parse_token(token, home_store)
+    cleaned = token.to_s.tr("`", " ").strip
+    cleaned = cleaned.sub(/\s*\(.*\z/, "").strip # drop trailing "(prose"
+    cleaned = cleaned.split(/\s/).first.to_s     # first whitespace-delimited atom
+    return nil if cleaned.empty?
+
+    if cleaned.include?(":")
+      store_tok, id = cleaned.split(":", 2)
+      return nil if id.to_s.empty?
+
+      [normalize_store_token(store_tok), id]
+    else
+      [home_store, cleaned]
+    end
+  end
+
+  # Normalize a store token from a log to a store_key. "global" stays "global".
+  # The generic "project" token (used in the global log) is kept as the sentinel
+  # "project" — resolve_ref binds it to the referer's project family.
+  def normalize_store_token(tok)
+    t = tok.to_s.strip
+    t == "global" ? "global" : t
+  end
+
+  # Transitively collapse a → b → c chains so every key maps to its FINAL hop.
+  # Cycle-guarded. Keys/values are [store_key, id] pairs.
+  def collapse_multi_hop(raw)
+    raw.each_with_object({}) do |(from, _to), acc|
+      seen = [from]
+      cur = raw[from]
+      while cur && raw.key?(cur) && !seen.include?(cur)
+        seen << cur
+        cur = raw[cur]
+      end
+      acc[from] = cur
+    end
+  end
+
+  # PURE. Resolve a single ref (a `store:id` cross-store ref, or a bare same-store
+  # id) to a final location and classification. ORDER IS LOAD-BEARING: the
+  # relocation map is consulted FIRST, so a relocation wins over a coincidentally
+  # reused id.
+  #
+  #   ref             — "global:24" or "22c"
+  #   referer_store   — store_key of the intent carrying the ref ("global"/"project:plastic")
+  #   relocation_map  — from build_relocation_map
+  #   store_index     — { store_key => Array/Set of bare ids present in that store }
+  #
+  # Returns a Hash:
+  #   { status: :same_store, id: "<bare id>" }              -> collapse to bare id
+  #   { status: :cross_store, ref: "<store>:<id>" }         -> keep/repoint store:id
+  #   { status: :dead, ref: <original> }                    -> drop (resolves nowhere)
+  def resolve_ref(ref, referer_store:, relocation_map:, store_index:)
+    store_tok, bare = split_ref(ref, referer_store)
+
+    # 1) Relocation FIRST. Look up [store, id]; the generic "project" target token
+    #    is bound to the referer's family when emitting the location.
+    reloc_key = [store_tok, bare]
+    if (relocation_map || {}).key?(reloc_key)
+      to_store, to_id = relocation_map[reloc_key]
+      to_store = bind_project_token(to_store, referer_store, store_index, to_id)
+      return classify(to_store, to_id, referer_store, store_index, ref)
+    end
+
+    # 2) Direct resolution against the live store index.
+    classify(store_tok, bare, referer_store, store_index, ref)
+  end
+
+  # Split a ref into [store_key, bare_id]; bare refs take the referer's store.
+  def split_ref(ref, referer_store)
+    s = ref.to_s
+    if s.include?(":")
+      store_tok, id = s.split(":", 2)
+      [normalize_store_token(store_tok), id]
+    else
+      [referer_store, s]
+    end
+  end
+
+  # The global log writes relocation targets as the generic `project:` token. Bind
+  # it to the concrete store family that actually owns the bare id. Prefer the
+  # referer's store when it holds the id; otherwise pick any store that has it.
+  def bind_project_token(to_store, referer_store, store_index, to_id)
+    return to_store unless to_store == "project"
+
+    return referer_store if ids_in(store_index, referer_store).include?(to_id)
+
+    owner = (store_index || {}).keys.find { |k| ids_in(store_index, k).include?(to_id) }
+    owner || referer_store
+  end
+
+  # Map a ref store token to the canonical store_index key. Refs in frontmatter
+  # use the slug form (`global`, `knowdb`, `plastic`); store_index keys use
+  # `global` and `project:<slug>`. "global" is canonical; anything else maps to
+  # `project:<token>` when that key exists, else the token itself (it may already
+  # be a `project:<slug>` key, e.g. a relocation target).
+  def canonical_store_key(store_tok, store_index)
+    return store_tok if store_tok == "global"
+    return store_tok if (store_index || {}).key?(store_tok)
+
+    projected = "project:#{store_tok}"
+    (store_index || {}).key?(projected) ? projected : store_tok
+  end
+
+  # The slug form of a canonical store key, for emitting a cross-store `slug:id`
+  # ref (the form used in frontmatter). "global" stays "global"; "project:<slug>"
+  # becomes "<slug>".
+  def slug_of(canonical_key)
+    canonical_key.to_s.sub(/\Aproject:/, "")
+  end
+
+  # Classify a resolved (store, id) relative to the referer, using the live store
+  # index to detect dead targets:
+  #   - target id present in the referer's OWN store -> :same_store (collapse to bare)
+  #   - target id present in a DIFFERENT store       -> :cross_store (keep slug:id)
+  #   - target id present NOWHERE                     -> :dead (drop)
+  def classify(store_tok, bare, referer_store, store_index, original_ref)
+    canonical = canonical_store_key(store_tok, store_index)
+    if ids_in(store_index, canonical).include?(bare)
+      if canonical == referer_store
+        { status: :same_store, id: bare }
+      else
+        { status: :cross_store, ref: "#{slug_of(canonical)}:#{bare}" }
+      end
+    else
+      { status: :dead, ref: original_ref.to_s }
+    end
+  end
+
+  def ids_in(store_index, store_key)
+    Array((store_index || {})[store_key])
+  end
+
+  # PURE. Per-store rebuild transform (intent 68 I-invariants, one-directional).
+  # Deterministic and idempotent: a second call over the result yields zero changes.
+  #
+  #   nodes          — ONE store's { id => { sources: [...], chain: [...] } } map
+  #   referer_store  — that store's key ("global" / "project:<slug>")
+  #   relocation_map — from build_relocation_map (spans all stores)
+  #   store_index    — { store_key => bare ids present } (spans all stores)
+  #
+  # Returns { nodes: <new map>, changes: [ {intent:, kind:, before:, after:} ] }.
+  # kinds: :dedupe, :i3, :repoint, :collapse, :drop, :i1_backlink.
+  #
+  # Order is load-bearing (spec Phase 2):
+  #   1. dedupe each array order-preserving
+  #   2. I3: an id in BOTH sources and chain is kept in sources, dropped from chain
+  #   3. cross-store resolve each ref (relocation FIRST): repoint, collapse to bare
+  #      same-store, or drop dead
+  #   4. I1: for every in-store source s, ensure s.chain backlinks this intent
+  #   5. I2 preserved: never synthesize a reciprocal source, never strip a
+  #      relational chain entry
+  def rebuild_store(nodes, referer_store:, relocation_map:, store_index:)
+    out = {}
+    (nodes || {}).each do |id, edges|
+      edges = {} unless edges.is_a?(Hash)
+      out[id.to_s] = {
+        sources: Array(edges[:sources] || edges["sources"]).map(&:to_s),
+        chain: Array(edges[:chain] || edges["chain"]).map(&:to_s),
+      }
+    end
+
+    changes = []
+
+    out.each do |id, edges|
+      # 1. dedupe order-preserving
+      deduped_sources = edges[:sources].uniq
+      deduped_chain = edges[:chain].uniq
+      if deduped_sources != edges[:sources] || deduped_chain != edges[:chain]
+        changes << { intent: id, kind: :dedupe,
+                     before: { sources: edges[:sources].dup, chain: edges[:chain].dup },
+                     after: { sources: deduped_sources, chain: deduped_chain } }
+      end
+      edges[:sources] = deduped_sources
+      edges[:chain] = deduped_chain
+
+      # 2. I3: overlap kept in sources, dropped from chain
+      overlap = edges[:sources] & edges[:chain]
+      overlap.each do |o|
+        changes << { intent: id, kind: :i3, before: o, after: nil }
+      end
+      edges[:chain] -= overlap unless overlap.empty?
+
+      # 3. cross-store resolve sources and chain
+      %i[sources chain].each do |field|
+        rebuilt = []
+        edges[field].each do |ref|
+          unless ref.include?(":")
+            rebuilt << ref # bare same-store id, left as-is here (I4 is doctor's job)
+            next
+          end
+
+          res = resolve_ref(ref, referer_store: referer_store,
+                                 relocation_map: relocation_map, store_index: store_index)
+          case res[:status]
+          when :same_store
+            if res[:id] != ref
+              changes << { intent: id, kind: :collapse, field: field, before: ref, after: res[:id] }
+            end
+            rebuilt << res[:id]
+          when :cross_store
+            if res[:ref] != ref
+              changes << { intent: id, kind: :repoint, field: field, before: ref, after: res[:ref] }
+            end
+            rebuilt << res[:ref]
+          when :dead
+            changes << { intent: id, kind: :drop, field: field, before: ref, after: nil }
+            # dropped: not appended
+          end
+        end
+        # de-dupe again after collapse/repoint may have created duplicates
+        edges[field] = rebuilt.uniq
+      end
+
+      # 3b. Re-apply I3 AFTER resolution: a cross-store ref that collapses to a
+      #     bare same-store id can newly overlap an existing chain entry (e.g.
+      #     sources:[global:14a]→[19a] meeting chain:[19a]). Formative edge wins.
+      post_overlap = edges[:sources] & edges[:chain]
+      post_overlap.each do |o|
+        changes << { intent: id, kind: :i3, before: o, after: nil }
+      end
+      edges[:chain] -= post_overlap unless post_overlap.empty?
+    end
+
+    # 4. I1: in-store source backlinks (mutates OTHER nodes). Runs after resolution
+    #    so collapsed bare ids participate. Order-preserving append.
+    out.each do |id, edges|
+      edges[:sources].each do |s|
+        next if s.include?(":")        # cross-store: backlink lives in another store
+        next unless out.key?(s)        # unresolved bare id is an I4 dangler, not I1
+        next if out[s][:chain].include?(id)
+
+        before_chain = out[s][:chain].dup
+        out[s][:chain] = out[s][:chain] + [id]
+        changes << { intent: s, kind: :i1_backlink, field: :chain,
+                     before: before_chain, after: out[s][:chain].dup, backlink: id }
+      end
+    end
+
+    { nodes: out, changes: changes }
+  end
+end

package/scripts/lib/installer_core.rb

@@ -214,6 +214,10 @@ class InstallerCore
       "scripts/lib/qmd_sync.rb" => "scripts/lib/qmd_sync.rb",
       "scripts/qmd-sync" => "scripts/qmd-sync",
       "scripts/lib/intent_validator.rb" => "scripts/lib/intent_validator.rb",
+      "scripts/lib/graph_rebuild.rb" => "scripts/lib/graph_rebuild.rb",
+      "scripts/lib/frontmatter_writer.rb" => "scripts/lib/frontmatter_writer.rb",
+      "scripts/lib/links_projection.rb" => "scripts/lib/links_projection.rb",
+      "scripts/lib/links_section.rb" => "scripts/lib/links_section.rb",
       "scripts/validate-intent" => "scripts/validate-intent",
       "scripts/new-intent" => "scripts/new-intent",
       "scripts/hook-create-gate" => "scripts/hook-create-gate",

package/scripts/lib/links_projection.rb

@@ -0,0 +1,160 @@
+# encoding: UTF-8
+# frozen_string_literal: true
+
+# LinksProjection — pure logic that projects one intent's sources/chain graph into
+# the canonical I5 `## Links` section text (intent 72). Mirrors the pure-module
+# style of GraphRebuild: module-function helpers, no file IO, no eval, no
+# ENV/global state. The IO shell (scripts/project-links) and doctor build the
+# cross-store resolver and feed it here.
+#
+# Pinned canonical projection (the human's format call):
+#   1. ORDERING (load-bearing): ALL sources first, in frontmatter order, THEN all
+#      chain, in frontmatter order. Sources can NEVER appear at the end. No group
+#      headings, no per-entry source/chain tags: the ordering carries the meaning.
+#   2. ENTRY SHAPE: one list item `- [[<id>--<slug>|<target's full intent: text>]]`,
+#      where the wikilink TARGET is the target intent's resolvable `id--slug` file
+#      basename (so it clicks through in Obsidian) and the LABEL is the target's
+#      full `intent:` frontmatter text, whitespace-trimmed.
+#   3. CROSS-STORE: a cross-store target renders
+#      `- [[<store>:<id>--<slug>|<target's full intent: text>]]`.
+#   4. RESOLVER MISS: a ref that resolves to no intent raises UnresolvedRef. No
+#      bare-id, slug-less, or guessed link is ever emitted.
+#   5. EMPTY-STATE: empty sources AND chain yields the heading plus a single
+#      explanatory comment.
+module LinksProjection
+  module_function
+
+  HEADING = "## Links"
+  EMPTY_COMMENT = "<!-- No sources or chain; this intent has no graph edges to project. -->"
+
+  # Raised when a sources/chain ref resolves to no intent. Carries the offending
+  # ref so the IO shell can report it per-intent and skip the write.
+  class UnresolvedRef < StandardError
+    attr_reader :ref
+
+    def initialize(ref)
+      @ref = ref
+      super("unresolved sources/chain ref: #{ref.inspect}")
+    end
+  end
+
+  # PURE. Build the canonical `## Links` section text for one intent.
+  #
+  #   sources — array of id / `store:id` ref strings, in frontmatter order
+  #   chain   — array of id / `store:id` ref strings, in frontmatter order
+  #   resolve — a callable (`->(ref) { ... }`) mapping ONE ref to a Hash like
+  #             { target: "<id>--<slug>",            label: "<full intent: text>" } or
+  #             { target: "<store>:<id>--<slug>",    label: "<full intent: text>" }.
+  #             Returning nil (or a Hash lacking :target) signals no target and
+  #             raises UnresolvedRef. Keeping resolution injected keeps this module
+  #             pure and hermetically testable with in-memory maps.
+  #
+  # Returns the full section text: the `## Links` heading line, one entry line per
+  # ref (sources first, then chain), and a single trailing newline. The empty case
+  # returns the heading + the empty-state comment + a single trailing newline.
+  def section(sources:, chain:, resolve:)
+    src = Array(sources).map(&:to_s)
+    chn = Array(chain).map(&:to_s)
+
+    # Resolve EVERY ref to its { target:, label: } first, then dedup by the RESOLVED
+    # target (not the raw ref string). This is load-bearing: the same intent may be
+    # referenced as a bare id in one group and as `store:id` in another (or via a
+    # relocation), which dedups identically only AFTER resolution. Sources win
+    # (formative edge), and frontmatter order is preserved within each group.
+    seen = {}
+    rendered = []
+    src.each { |ref| add_entry(ref, resolve, seen, rendered) }
+    chn.each { |ref| add_entry(ref, resolve, seen, rendered) }
+
+    return empty_section if rendered.empty?
+
+    (["#{HEADING}\n"] + rendered.map { |line| "#{line}\n" }).join
+  end
+
+  # PURE. The canonical empty-state section: heading + the single comment line.
+  def empty_section
+    "#{HEADING}\n#{EMPTY_COMMENT}\n"
+  end
+
+  # Resolve `ref`, render its entry, and append it to `rendered` UNLESS its resolved
+  # target was already emitted (dedup by resolved target, first-seen wins so sources
+  # precede chain). Mutates `seen` and `rendered`. Raises UnresolvedRef on a miss.
+  def add_entry(ref, resolve, seen, rendered)
+    target, label = resolve_entry(ref, resolve)
+    return if seen.key?(target)
+
+    seen[target] = true
+    rendered << "- [[#{target}|#{label}]]"
+  end
+
+  # PURE. Resolve one ref to [target, label]. Raises UnresolvedRef when the
+  # resolver returns nothing usable.
+  def resolve_entry(ref, resolve)
+    resolved = resolve.call(ref)
+    target = resolved.is_a?(Hash) ? resolved[:target] || resolved["target"] : nil
+    raise UnresolvedRef, ref if target.nil? || target.to_s.strip.empty?
+
+    label = (resolved[:label] || resolved["label"]).to_s.strip
+    [target.to_s, label]
+  end
+
+  # PURE. Render one entry line `- [[<target>|<label>]]` from a single ref. Kept for
+  # callers/tests that render one entry; #section uses add_entry for dedup.
+  def entry(ref, resolve)
+    target, label = resolve_entry(ref, resolve)
+    "- [[#{target}|#{label}]]"
+  end
+
+  # PURE. Resolve ONE sources/chain ref to its `{ target:, label: }` projection,
+  # given the in-memory cross-store maps. This is the single resolver definition
+  # shared by the IO shell (scripts/project-links) and the doctor check, so the two
+  # can never diverge.
+  #
+  #   ref            — "40" (same-store bare id) or "knowdb:1" (cross-store)
+  #   referer_store  — store_key of the intent carrying the ref ("global" / "project:<slug>")
+  #   relocation_map — from GraphRebuild.build_relocation_map (spans all stores)
+  #   store_index    — { store_key => [bare ids present] } (spans all stores)
+  #   node_index     — { store_key => { id => { basename:, label: } } } (spans all stores)
+  #
+  # Returns { target:, label: } (target is `<id>--<slug>` for a same-store id, or
+  # `<slug>:<id>--<slug>` for a cross-store one), or nil when the ref resolves to no
+  # live intent (which makes #section / #entry raise UnresolvedRef).
+  #
+  # Uses GraphRebuild.resolve_ref so a relocation always wins over a coincidentally
+  # reused id (the `global:24` impostor hazard), exactly as the frontmatter rebuild
+  # and the cross-store doctor check do.
+  def resolve_ref_projection(ref, referer_store:, relocation_map:, store_index:, node_index:)
+    require_relative "graph_rebuild"
+
+    res = GraphRebuild.resolve_ref(ref, referer_store: referer_store,
+                                        relocation_map: relocation_map,
+                                        store_index: store_index)
+    case res[:status]
+    when :same_store
+      node = (node_index[referer_store] || {})[res[:id]]
+      return nil if node.nil?
+
+      { target: node[:basename], label: node[:label] }
+    when :cross_store
+      slug, bare = res[:ref].split(":", 2)
+      target_key = canonical_store_key(slug, store_index)
+      node = (node_index[target_key] || {})[bare]
+      return nil if node.nil?
+
+      { target: "#{slug}:#{node[:basename]}", label: node[:label] }
+    else # :dead
+      nil
+    end
+  end
+
+  # Map a ref store slug ("global", "knowdb", "plastic") to a node_index/store_index
+  # key ("global", "project:knowdb", "project:plastic"). Mirrors
+  # GraphRebuild.canonical_store_key's intent for the node_index keyspace.
+  def canonical_store_key(slug, store_index)
+    return "global" if slug == "global"
+    return slug if (store_index || {}).key?(slug)
+
+    projected = "project:#{slug}"
+    (store_index || {}).key?(projected) ? projected : slug
+  end
+end