@storacha/md-merge 0.4.0 → 0.5.0

package/dist/crdt/rga.d.ts

@@ -41,6 +41,14 @@ export declare class RGA<T, E extends RGAEvent = RGAEvent> {
     toNodes(): RGANode<T, E>[];
     /** Get all ordered nodes including tombstones. */
     toAllNodes(): RGANode<T, E>[];
+    /** Rebuild ordered nodes via BFS over causal tree (including tombstones). */
+    private allWeighted;
+    /** Get all weighted-order nodes including tombstones. */
+    toAllWeightedNodes(): RGANode<T, E>[];
+    /** Get weighted-order non-tombstoned nodes. */
+    toWeightedNodes(): RGANode<T, E>[];
+    /** Rebuild the weighted-order array, excluding tombstones. */
+    toWeightedArray(): T[];
     /** Merge another RGA into this one. Union of all nodes; tombstones win. */
     merge(other: RGA<T, E>): void;
     /** Create an RGA from an array of items. Each item is inserted sequentially. */

package/dist/crdt/rga.js

@@ -80,6 +80,49 @@ export class RGA {
     toAllNodes() {
         return this.allOrdered();
     }
+    /** Rebuild ordered nodes via BFS over causal tree (including tombstones). */
+    allWeighted() {
+        const ROOT_KEY = '__ROOT__';
+        const children = new Map();
+        for (const node of this.nodes.values()) {
+            const key = node.afterId ? serializeId(node.afterId) : ROOT_KEY;
+            let list = children.get(key);
+            if (!list) {
+                list = [];
+                children.set(key, list);
+            }
+            list.push(node);
+        }
+        for (const list of children.values()) {
+            list.sort((a, b) => this.compareIds(a.id, b.id));
+        }
+        const result = [];
+        let currentLevel = children.get(ROOT_KEY) ?? [];
+        while (currentLevel.length > 0) {
+            result.push(...currentLevel);
+            const nextLevel = [];
+            for (const node of currentLevel) {
+                const kids = children.get(serializeId(node.id));
+                if (kids)
+                    nextLevel.push(...kids);
+            }
+            nextLevel.sort((a, b) => this.compareIds(a.id, b.id));
+            currentLevel = nextLevel;
+        }
+        return result;
+    }
+    /** Get all weighted-order nodes including tombstones. */
+    toAllWeightedNodes() {
+        return this.allWeighted();
+    }
+    /** Get weighted-order non-tombstoned nodes. */
+    toWeightedNodes() {
+        return this.allWeighted().filter(n => !n.tombstone);
+    }
+    /** Rebuild the weighted-order array, excluding tombstones. */
+    toWeightedArray() {
+        return this.toWeightedNodes().map(n => n.value);
+    }
     /** Merge another RGA into this one. Union of all nodes; tombstones win. */
     merge(other) {
         for (const [key, node] of other.nodes) {

package/dist/index.d.ts

@@ -9,9 +9,9 @@ import type { RGAEvent, EventComparator } from "./crdt/rga.js";
 export { parse, stringify, stringifyNode, fingerprint } from "./parse.js";
 export { diff, applyChangeSet } from "./diff.js";
 export { toRGATree, toMdast, applyMdastToRGATree, generateRGAChangeSet, applyRGAChangeSet, } from "./rga-tree.js";
-export { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet } from "./codec.js";
+export { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet, encodeRGA, decodeRGA, } from "./codec.js";
 export type { ChangeSet, Change, RGAChangeSet, RGAChange, RGATreeRoot, RGATreeNode, RGAParentNode, RGALeafNode, } from "./types.js";
-export { RGA, type RGAEvent, type RGANodeId, type EventComparator } from "./types.js";
+export { RGA, type RGAEvent, type RGANodeId, type EventComparator, } from "./types.js";
 /**
  * Compute an RGA-addressed changeset between an existing RGA tree and new markdown.
  */

package/dist/index.js

@@ -10,8 +10,8 @@ import { toRGATree, toMdast, generateRGAChangeSet, applyRGAChangeSet, } from "./
 export { parse, stringify, stringifyNode, fingerprint } from "./parse.js";
 export { diff, applyChangeSet } from "./diff.js";
 export { toRGATree, toMdast, applyMdastToRGATree, generateRGAChangeSet, applyRGAChangeSet, } from "./rga-tree.js";
-export { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet } from "./codec.js";
-export { RGA } from "./types.js";
+export { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet, encodeRGA, decodeRGA, } from "./codec.js";
+export { RGA, } from "./types.js";
 /**
  * Compute an RGA-addressed changeset between an existing RGA tree and new markdown.
  */

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@storacha/md-merge",
-  "version": "0.4.0",
+  "version": "0.5.0",
   "type": "module",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",

package/src/crdt/rga.ts

@@ -108,6 +108,53 @@ export class RGA<T, E extends RGAEvent = RGAEvent> {
     return this.allOrdered()
   }
 
+  /** Rebuild ordered nodes via BFS over causal tree (including tombstones). */
+  private allWeighted(): RGANode<T, E>[] {
+    const ROOT_KEY = '__ROOT__'
+    const children = new Map<string, RGANode<T, E>[]>()
+    for (const node of this.nodes.values()) {
+      const key = node.afterId ? serializeId(node.afterId) : ROOT_KEY
+      let list = children.get(key)
+      if (!list) {
+        list = []
+        children.set(key, list)
+      }
+      list.push(node)
+    }
+    for (const list of children.values()) {
+      list.sort((a, b) => this.compareIds(a.id, b.id))
+    }
+    const result: RGANode<T, E>[] = []
+    let currentLevel = children.get(ROOT_KEY) ?? []
+    while (currentLevel.length > 0) {
+      result.push(...currentLevel)
+      const nextLevel: RGANode<T, E>[] = []
+      for (const node of currentLevel) {
+        const kids = children.get(serializeId(node.id))
+        if (kids) nextLevel.push(...kids)
+      }
+      nextLevel.sort((a, b) => this.compareIds(a.id, b.id))
+      currentLevel = nextLevel
+    }
+    return result
+  }
+
+  /** Get all weighted-order nodes including tombstones. */
+  toAllWeightedNodes(): RGANode<T, E>[] {
+    return this.allWeighted()
+  }
+
+  /** Get weighted-order non-tombstoned nodes. */
+  toWeightedNodes(): RGANode<T, E>[] {
+    return this.allWeighted().filter(n => !n.tombstone)
+  }
+
+  /** Rebuild the weighted-order array, excluding tombstones. */
+  toWeightedArray(): T[] {
+    return this.toWeightedNodes().map(n => n.value)
+  }
+
+
   /** Merge another RGA into this one. Union of all nodes; tombstones win. */
   merge(other: RGA<T, E>): void {
     for (const [key, node] of other.nodes) {

package/src/index.ts

@@ -25,7 +25,14 @@ export {
   generateRGAChangeSet,
   applyRGAChangeSet,
 } from "./rga-tree.js";
-export { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet } from "./codec.js";
+export {
+  encodeTree,
+  decodeTree,
+  encodeChangeSet,
+  decodeChangeSet,
+  encodeRGA,
+  decodeRGA,
+} from "./codec.js";
 export type {
   ChangeSet,
   Change,
@@ -36,7 +43,12 @@ export type {
   RGAParentNode,
   RGALeafNode,
 } from "./types.js";
-export { RGA, type RGAEvent, type RGANodeId, type EventComparator } from "./types.js";
+export {
+  RGA,
+  type RGAEvent,
+  type RGANodeId,
+  type EventComparator,
+} from "./types.js";
 
 /**
  * Compute an RGA-addressed changeset between an existing RGA tree and new markdown.