@cr_docs_t/dts 0.0.9-alpha.0 → 0.0.10

package/dist/CausalTree/CTNode.d.ts

@@ -1,8 +1,7 @@
-declare class CTNode {
+export declare class CTNode {
     uid: string;
     character?: string;
     cause?: CTNode;
     constructor(uid: string);
 }
-export default CTNode;
 //# sourceMappingURL=CTNode.d.ts.map

package/dist/CausalTree/CTNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CTNode.d.ts","sourceRoot":"","sources":["../../src/CausalTree/CTNode.ts"],"names":[],"mappings":"AAAA,cAAM,MAAM;IACR,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;gBAEH,GAAG,EAAE,MAAM;CAG1B;AAED,eAAe,MAAM,CAAC"}
+{"version":3,"file":"CTNode.d.ts","sourceRoot":"","sources":["../../src/CausalTree/CTNode.ts"],"names":[],"mappings":"AAAA,qBAAa,MAAM;IACf,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;gBAEH,GAAG,EAAE,MAAM;CAG1B"}

package/dist/CausalTree/CTNode.js

@@ -1,6 +1,5 @@
-class CTNode {
+export class CTNode {
     constructor(uid) {
         this.uid = uid;
     }
 }
-export default CTNode;

package/dist/CausalTree/CausalTree.d.ts

@@ -1,7 +1,6 @@
-import CTNode from "./CTNode";
-declare class CasualTree {
+import { CTNode } from "./CTNode";
+export declare class CasualTree {
     root: CTNode;
     constructor(root: CTNode);
 }
-export default CasualTree;
 //# sourceMappingURL=CausalTree.d.ts.map

package/dist/CausalTree/CausalTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CausalTree.d.ts","sourceRoot":"","sources":["../../src/CausalTree/CausalTree.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,UAAU,CAAC;AAE9B,cAAM,UAAU;IAWZ,IAAI,EAAE,MAAM,CAAC;gBAED,IAAI,EAAE,MAAM;CAG3B;AAED,eAAe,UAAU,CAAC"}
+{"version":3,"file":"CausalTree.d.ts","sourceRoot":"","sources":["../../src/CausalTree/CausalTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,qBAAa,UAAU;IAWnB,IAAI,EAAE,MAAM,CAAC;gBAED,IAAI,EAAE,MAAM;CAG3B"}

package/dist/CausalTree/CausalTree.js

@@ -1,6 +1,5 @@
-class CasualTree {
+export class CasualTree {
     constructor(root) {
         this.root = root;
     }
 }
-export default CasualTree;

package/dist/Fugue/FNode.d.ts

@@ -1,7 +1,6 @@
-declare class FNode<P> {
+export declare class FNode<P> {
     value?: string;
     position: P;
     constructor(position: P, value?: string);
 }
-export default FNode;
 //# sourceMappingURL=FNode.d.ts.map

package/dist/Fugue/FNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FNode.d.ts","sourceRoot":"","sources":["../../src/Fugue/FNode.ts"],"names":[],"mappings":"AAAA,cAAM,KAAK,CAAC,CAAC;IACT,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,CAAC,CAAC;gBAEA,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;CAI1C;AAED,eAAe,KAAK,CAAC"}
+{"version":3,"file":"FNode.d.ts","sourceRoot":"","sources":["../../src/Fugue/FNode.ts"],"names":[],"mappings":"AAAA,qBAAa,KAAK,CAAC,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,CAAC,CAAC;gBAEA,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;CAI1C"}

package/dist/Fugue/FNode.js

@@ -1,7 +1,6 @@
-class FNode {
+export class FNode {
     constructor(position, value) {
         this.value = value;
         this.position = position;
     }
 }
-export default FNode;

package/dist/Fugue/FugueList.d.ts

@@ -1,29 +1,63 @@
 import { FugueState } from "../types/Fugue";
-import UniquelyDenseTotalOrder from "../TotalOrder/UniquelyDenseTotalOrder";
+import { UniquelyDenseTotalOrder } from "../TotalOrder/UniquelyDenseTotalOrder";
 import { FugueMessage } from "../types/Message";
 /**
  * A Fugue List CRDT, with insert and delete operations
  */
-declare class FugueList<P> {
+export declare class FugueList<P> {
     state: FugueState<P>;
     totalOrder: UniquelyDenseTotalOrder<P>;
     positionCounter: number;
     ws: WebSocket | null;
     constructor(totalOrder: UniquelyDenseTotalOrder<P>, ws: WebSocket | null);
     private propagate;
+    /**
+     * Inserts a value at a given position
+     * @param position - Position to insert at
+     * @param value - Value to insert
+     */
+    private insertAtPosition;
+    /**
+     * Generates unique position for new element at 'index'
+     * @param index - Index to generate position for
+     * @returns Generated position
+     */
+    private generatePosition;
     /**
      * Inserts new element with 'value' at 'index' in the list
      * @param index - Index to insert 'value' at
      * @param value - Value to insert
      */
     insert(index: number, value: string): void;
+    /**
+     *  Deletes value at given position
+     * @param position - Position to delete at
+     */
+    private deleteAtPosition;
+    /**
+     * Finds the position of the visible value at index
+     * this ignores tombstoned values
+     * @param index - Index of the visible value
+     */
+    findVisiblePosition(index: number): P | undefined;
+    /**
+     * Finds the visible index of the value at position
+     * this ignores tombstoned values
+     * @param position - Position to find visible index for
+     * @returns
+     */
+    findVisibleIndex(position: P): number | undefined;
     /**
      * Delete value in the list at index
      * @param index - Index of the value to delete
      */
     delete(index: number): void;
+    /**
+     * Observes the current visible state of the list
+     * @returns The current visible state of the list as a string
+     */
     observe(): string;
-    effect(msg: FugueMessage): void;
+    effect(msg: FugueMessage<P>): void;
+    replicaId(): string;
 }
-export default FugueList;
 //# sourceMappingURL=FugueList.d.ts.map

package/dist/Fugue/FugueList.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../src/Fugue/FugueList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,uBAAuB,MAAM,uCAAuC,CAAC;AAC5E,OAAO,EAAE,YAAY,EAAa,MAAM,kBAAkB,CAAC;AAE3D;;GAEG;AACH,cAAM,SAAS,CAAC,CAAC;IACb,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAM;IAC1B,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC;IACvC,eAAe,SAAK;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;gBAET,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,GAAG,IAAI;IAKxE,OAAO,CAAC,SAAS;IAMjB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAsCnC;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAgBpB,OAAO,IAAI,MAAM;IAgBjB,MAAM,CAAC,GAAG,EAAE,YAAY;CAc3B;AAED,eAAe,SAAS,CAAC"}
+{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../src/Fugue/FugueList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,uBAAuB,EAAE,MAAM,uCAAuC,CAAC;AAChF,OAAO,EAAE,YAAY,EAAa,MAAM,kBAAkB,CAAC;AAE3D;;GAEG;AACH,qBAAa,SAAS,CAAC,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAM;IAC1B,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC;IACvC,eAAe,SAAK;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;gBAET,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,GAAG,IAAI;IAKxE,OAAO,CAAC,SAAS;IAMjB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IAiCxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAcnC;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAcxB;;;;OAIG;IACH,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAajD;;;;;OAKG;IACH,gBAAgB,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAejD;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAoBpB;;;OAGG;IACH,OAAO,IAAI,MAAM;IAmBjB,MAAM,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC;IAc3B,SAAS,IAAI,MAAM;CAGtB"}

package/dist/Fugue/FugueList.js

@@ -1,9 +1,9 @@
-import FNode from "./FNode";
+import { FNode } from "./FNode";
 import { Operation } from "../types/Message";
 /**
  * A Fugue List CRDT, with insert and delete operations
  */
-class FugueList {
+export class FugueList {
     constructor(totalOrder, ws) {
         this.state = [];
         this.positionCounter = 0;
@@ -16,93 +16,173 @@ class FugueList {
         this.ws.send(JSON.stringify(msg));
     }
     /**
-     * Inserts new element with 'value' at 'index' in the list
-     * @param index - Index to insert 'value' at
+     * Inserts a value at a given position
+     * @param position - Position to insert at
      * @param value - Value to insert
      */
-    insert(index, value) {
-        if (index >= this.state.length)
-            this.state.push([]);
-        let i = this.state.length - 1;
-        while (i > index) {
-            this.state[i] = this.state[i - 1];
-            i--;
-        }
-        const atIndex = this.state[index];
-        if (index > 0 && index < this.state.length - 1) {
-            const before = this.state[index - 1];
-            const after = this.state[index + 1];
-            if (atIndex.length == 0) {
-                atIndex.push(new FNode(this.totalOrder.createBetween(before[before.length - 1].position), value));
-            }
-            else {
-                const a = atIndex[atIndex.length - 1];
-                atIndex.push(new FNode(this.totalOrder.createBetween(a.position, after[after.length - 1].position), value));
+    insertAtPosition(position, value) {
+        let index = this.state.length;
+        for (let i = 0; i < this.state.length; ++i) {
+            const n = this.state[i][0];
+            // Compare positions, if the value should be
+            // ordered before this one, we found our index
+            // this should fix the issue with inserting in the
+            // middle messing up order
+            if (this.totalOrder.compare(position, n.position) < 0) {
+                index = i;
+                break;
             }
         }
+        console.log({ insertIndex: index });
+        if (index >= this.state.length) {
+            this.state.push([]);
+        }
         else {
-            if (atIndex.length == 0) {
-                atIndex.push(new FNode(this.totalOrder.createBetween(), value));
-            }
-            else {
-                const a = atIndex[atIndex.length - 1];
-                atIndex.push(new FNode(this.totalOrder.createBetween(a.position), value));
-            }
+            this.state.splice(index, 0, []);
         }
-        // Send to replicas
+        // Check if this position already exists at this index
+        // If it does, we don't insert again
+        const cell = this.state[index];
+        const existing = cell.find((n) => this.totalOrder.compare(n.position, position) === 0);
+        if (existing)
+            return;
+        cell.push(new FNode(position, value));
+    }
+    /**
+     * Generates unique position for new element at 'index'
+     * @param index - Index to generate position for
+     * @returns Generated position
+     */
+    generatePosition(index) {
+        // If this is the first thing in the document
+        if (this.state.length === 0)
+            return this.totalOrder.createBetween();
+        const prev = index > 0 ? this.findVisiblePosition(index - 1) : undefined;
+        const next = this.findVisiblePosition(index);
+        return this.totalOrder.createBetween(prev, next);
+    }
+    /**
+     * Inserts new element with 'value' at 'index' in the list
+     * @param index - Index to insert 'value' at
+     * @param value - Value to insert
+     */
+    insert(index, value) {
+        const pos = this.generatePosition(index);
+        console.log({ index, pos });
+        this.insertAtPosition(pos, value);
         this.propagate({
+            replicaId: this.totalOrder.getReplicaId(),
             operation: Operation.INSERT,
-            position: index,
+            position: pos,
             data: value,
         });
     }
+    /**
+     *  Deletes value at given position
+     * @param position - Position to delete at
+     */
+    deleteAtPosition(position) {
+        // Find the cell containing this position
+        for (let i = 0; i < this.state.length; ++i) {
+            const cell = this.state[i];
+            const node = cell.find((n) => this.totalOrder.compare(n.position, position) === 0);
+            if (node) {
+                // Tombstone the node, TODO: Implement garbage collection
+                node.value = undefined;
+                return;
+            }
+        }
+    }
+    /**
+     * Finds the position of the visible value at index
+     * this ignores tombstoned values
+     * @param index - Index of the visible value
+     */
+    findVisiblePosition(index) {
+        let count = 0;
+        for (const cell of this.state) {
+            for (const n of cell) {
+                if (n.value !== undefined) {
+                    if (count === index)
+                        return n.position;
+                    count++;
+                }
+            }
+        }
+    }
+    /**
+     * Finds the visible index of the value at position
+     * this ignores tombstoned values
+     * @param position - Position to find visible index for
+     * @returns
+     */
+    findVisibleIndex(position) {
+        let count = 0;
+        for (const cell of this.state) {
+            for (const n of cell) {
+                if (n.value !== undefined) {
+                    if (this.totalOrder.compare(n.position, position) === 0)
+                        return count;
+                    count++;
+                }
+            }
+        }
+        return undefined;
+    }
     /**
      * Delete value in the list at index
      * @param index - Index of the value to delete
      */
     delete(index) {
-        let i = index;
-        while (i < this.state.length) {
-            this.state[i] = this.state[i + 1];
-            i++;
+        const position = this.findVisiblePosition(index);
+        console.log({ index, position });
+        if (!position) {
+            console.warn(`No element at position -> ${position}`);
+            return;
         }
-        this.state.pop();
+        this.deleteAtPosition(position);
         // Send to replicas
         this.propagate({
+            replicaId: this.totalOrder.getReplicaId(),
             operation: Operation.DELETE,
-            position: index,
+            position: position,
             data: null,
         });
     }
+    /**
+     * Observes the current visible state of the list
+     * @returns The current visible state of the list as a string
+     */
     observe() {
         let res = new String();
         for (const idx of this.state) {
-            if (idx.length > 1) {
-                res += idx
-                    .sort((a, b) => this.totalOrder.compare(a.position, b.position))
-                    .map((node) => node?.value || "ð")
-                    .join("");
-            }
-            else {
-                res += idx[0]?.value || "ð";
+            // Filter out tombstoned nodes and sort by unique position
+            const nodes = idx
+                .filter((n) => n.value !== undefined)
+                .sort((a, b) => this.totalOrder.compare(a.position, b.position));
+            // Then append to resultdkjand if somehow
+            //a value is undefined append the placeholder thorn
+            for (const n of nodes) {
+                res += n.value || "Þ";
             }
         }
         return res.toString();
     }
     effect(msg) {
-        // On
-        const { operation, data, position } = msg;
+        const { replicaId, operation, data, position } = msg;
+        if (replicaId == this.totalOrder.getReplicaId())
+            return;
         switch (operation) {
-            // Operation.INSERT -> insert
             case Operation.INSERT:
                 if (!data)
                     throw Error("Data is required for Operation.INSERT");
-                this.insert(position, data);
-            // Operation.DELETE -> delete
+                return this.insertAtPosition(position, data);
             case Operation.DELETE:
-                this.delete(position);
+                return this.deleteAtPosition(position);
         }
         throw Error("Invalid operation");
     }
+    replicaId() {
+        return this.totalOrder.getReplicaId();
+    }
 }
-export default FugueList;

package/dist/TotalOrder/StringTotalOrder.d.ts

@@ -1,7 +1,9 @@
-import UniquelyDenseTotalOrder from "./UniquelyDenseTotalOrder";
-export default class StringTotalOrder implements UniquelyDenseTotalOrder<string> {
+import { UniquelyDenseTotalOrder } from "./UniquelyDenseTotalOrder";
+export type StringPosition = string;
+export declare class StringTotalOrder implements UniquelyDenseTotalOrder<StringPosition> {
     readonly replicaID: string;
     private counter;
+    getReplicaId(): string;
     compare(a: string, b: string): number;
     constructor(replicaID: string);
     createBetween(a?: string, b?: string): string;

package/dist/TotalOrder/StringTotalOrder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StringTotalOrder.d.ts","sourceRoot":"","sources":["../../src/TotalOrder/StringTotalOrder.ts"],"names":[],"mappings":"AAAA,OAAO,uBAAuB,MAAM,2BAA2B,CAAC;AAEhE,MAAM,CAAC,OAAO,OAAO,gBAAiB,YAAW,uBAAuB,CAAC,MAAM,CAAC;IAC5E,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,OAAO,CAAK;IAEpB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;gBAIzB,SAAS,EAAE,MAAM;IAI7B,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CA6BhD"}
+{"version":3,"file":"StringTotalOrder.d.ts","sourceRoot":"","sources":["../../src/TotalOrder/StringTotalOrder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE,MAAM,MAAM,cAAc,GAAG,MAAM,CAAC;AAEpC,qBAAa,gBAAiB,YAAW,uBAAuB,CAAC,cAAc,CAAC;IAC5E,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,OAAO,CAAK;IAEpB,YAAY,IAAI,MAAM;IAItB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;gBAIzB,SAAS,EAAE,MAAM;IAI7B,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CA6BhD"}

package/dist/TotalOrder/StringTotalOrder.js

@@ -1,4 +1,7 @@
-export default class StringTotalOrder {
+export class StringTotalOrder {
+    getReplicaId() {
+        return this.replicaID;
+    }
     compare(a, b) {
         return a.localeCompare(b);
     }
@@ -15,13 +18,13 @@ export default class StringTotalOrder {
         }
         // If node is the first position at that index
         if (!a) {
-            return b + uniqueStr + "R";
+            return b.slice(0, -1) + "L" + uniqueStr + "R";
         }
         // If node is the last position at that index
         if (!b) {
             return a + uniqueStr + "R";
         }
-        const isAPrefixOfB = b.substring(0, a.length).localeCompare(a);
+        const isAPrefixOfB = b.startsWith(a);
         // If a is not a prefix of b append a globally unique new string to a and return that +R
         if (!isAPrefixOfB) {
             return a + uniqueStr + "R";

package/dist/TotalOrder/UniquelyDenseTotalOrder.d.ts

@@ -4,7 +4,8 @@
  *
  * @type P The type of positions. Treated as immutable.
  */
-export default interface UniquelyDenseTotalOrder<P> {
+export interface UniquelyDenseTotalOrder<P> {
+    getReplicaId(): string;
     /**
      * Usual compare function for sorts: returns negative if a < b in
      * their sort order, positive if a > b.

package/dist/TotalOrder/UniquelyDenseTotalOrder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UniquelyDenseTotalOrder.d.ts","sourceRoot":"","sources":["../../src/TotalOrder/UniquelyDenseTotalOrder.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,WAAW,uBAAuB,CAAC,CAAC;IAC9C;;;OAGG;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IAE5B;;;;;;;;;;OAUG;IACH,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;CAClC"}
+{"version":3,"file":"UniquelyDenseTotalOrder.d.ts","sourceRoot":"","sources":["../../src/TotalOrder/UniquelyDenseTotalOrder.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB,CAAC,CAAC;IACtC,YAAY,IAAI,MAAM,CAAC;IAEvB;;;OAGG;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IAE5B;;;;;;;;;;OAUG;IACH,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;CAClC"}

package/dist/index.d.ts

@@ -1,8 +1,7 @@
-import FugueList from "./Fugue/FugueList";
-import CausalTree from "./CausalTree/CausalTree";
-import UniquelyDenseTotalOrder from "./TotalOrder/UniquelyDenseTotalOrder";
-import StringTotalOrder from "./TotalOrder/StringTotalOrder";
-import { FugueMessage, Operation, Data } from "./types/Message";
-import { FugueState } from "./types/Fugue";
-export { FugueList, CausalTree, UniquelyDenseTotalOrder, StringTotalOrder, FugueMessage, FugueState, Operation, Data, };
+export * from "./Fugue/FugueList";
+export * from "./CausalTree/CausalTree";
+export * from "./TotalOrder/UniquelyDenseTotalOrder";
+export * from "./TotalOrder/StringTotalOrder";
+export * from "./types/Message";
+export * from "./types/Fugue";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,mBAAmB,CAAC;AAC1C,OAAO,UAAU,MAAM,yBAAyB,CAAC;AACjD,OAAO,uBAAuB,MAAM,sCAAsC,CAAC;AAC3E,OAAO,gBAAgB,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAEH,SAAS,EACT,UAAU,EAEV,uBAAuB,EACvB,gBAAgB,EAGhB,YAAY,EACZ,UAAU,EACV,SAAS,EACT,IAAI,GACP,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAC;AAClC,cAAc,yBAAyB,CAAC;AAExC,cAAc,sCAAsC,CAAC;AACrD,cAAc,+BAA+B,CAAC;AAC9C,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC"}

package/dist/index.js

@@ -1,7 +1,6 @@
-import FugueList from "./Fugue/FugueList";
-import CausalTree from "./CausalTree/CausalTree";
-import StringTotalOrder from "./TotalOrder/StringTotalOrder";
-import { Operation } from "./types/Message";
-export { 
-// Data Types
-FugueList, CausalTree, StringTotalOrder, Operation, };
+export * from "./Fugue/FugueList";
+export * from "./CausalTree/CausalTree";
+export * from "./TotalOrder/UniquelyDenseTotalOrder";
+export * from "./TotalOrder/StringTotalOrder";
+export * from "./types/Message";
+export * from "./types/Fugue";

package/dist/types/Fugue.d.ts

@@ -1,3 +1,3 @@
-import FNode from "../Fugue/FNode";
+import { FNode } from "../Fugue/FNode";
 export type FugueState<P> = FNode<P>[][];
 //# sourceMappingURL=Fugue.d.ts.map

package/dist/types/Fugue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Fugue.d.ts","sourceRoot":"","sources":["../../src/types/Fugue.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,gBAAgB,CAAC;AAEnC,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA"}
+{"version":3,"file":"Fugue.d.ts","sourceRoot":"","sources":["../../src/types/Fugue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAEvC,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC"}

package/dist/types/Message.d.ts

@@ -2,11 +2,11 @@ export declare enum Operation {
     INSERT = 0,
     DELETE = 1
 }
-export type Position = number;
 export type Data = string;
-export interface FugueMessage {
+export interface FugueMessage<P> {
+    replicaId: string;
     operation: Operation;
-    position: number;
+    position: P;
     data: Data | null;
 }
 //# sourceMappingURL=Message.d.ts.map

package/dist/types/Message.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Message.d.ts","sourceRoot":"","sources":["../../src/types/Message.ts"],"names":[],"mappings":"AAAA,oBAAY,SAAS;IACjB,MAAM,IAAA;IACN,MAAM,IAAA;CACT;AAED,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,YAAY;IACzB,SAAS,EAAE,SAAS,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;CACrB"}
+{"version":3,"file":"Message.d.ts","sourceRoot":"","sources":["../../src/types/Message.ts"],"names":[],"mappings":"AAAA,oBAAY,SAAS;IACjB,MAAM,IAAA;IACN,MAAM,IAAA;CACT;AAGD,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,YAAY,CAAC,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,SAAS,CAAC;IACrB,QAAQ,EAAE,CAAC,CAAC;IACZ,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;CACrB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cr_docs_t/dts",
-  "version": "0.0.9-alpha.0",
+  "version": "0.0.10",
   "description": "",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",

package/dist/Fugue/FugueTest.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=FugueTest.d.ts.map

package/dist/Fugue/FugueTest.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"FugueTest.d.ts","sourceRoot":"","sources":["../../src/Fugue/FugueTest.ts"],"names":[],"mappings":""}

package/dist/Fugue/FugueTest.js

@@ -1,22 +0,0 @@
-import FugueList from "./FugueList";
-import { randomString } from "../utils/index";
-import StringTotalOrder from "../TotalOrder/StringTotalOrder";
-const test1 = new FugueList(new StringTotalOrder(randomString(5)));
-const test2 = new FugueList(new StringTotalOrder(randomString(5)));
-const word1 = "SHADOW WIZARD MONEY GANG";
-const word2 = "BALLING";
-// Randomly insert words into the list from different simulated users
-async function simulateUser(list, word) {
-    for (let i = 0; i < word.length; i++) {
-        await new Promise((resolve) => setTimeout(resolve, Math.random() * 150));
-        list.insert(i, word.charAt(i));
-        console.log(list.observe());
-        console.log(list.state);
-    }
-}
-Promise.all([
-    simulateUser(test1, word1), //
-    simulateUser(test2, word2),
-])
-    .then(() => console.log(`Done:\t${test1.observe()}\n\t${test2.observe()}`))
-    .catch(console.error);

package/dist/Fugue/utils.d.ts

@@ -1,34 +0,0 @@
-/**
- * Helper interface for sorting and creating unique immutable positions,
- * suitable for use in a List CRDT. Taken from mattweidner.com/2022/10/21/basic-list-crdt.html
- *
- * @type P The type of positions. Treated as immutable.
- */
-export interface UniquelyDenseTotalOrder<P> {
-    /**
-     * Usual compare function for sorts: returns negative if a < b in
-     * their sort order, positive if a > b.
-     */
-    compare(a: P, b: P): number;
-    /**
-     * Returns a globally unique new position c such that a < c < b.
-     *
-     * "Globally unique" means that the created position must be distinct
-     * from all other created positions, including ones created concurrently
-     * by other users.
-     *
-     * When a is undefined, it is treated as the start of the list, i.e.,
-     * this returns c such that c < b. Likewise, undefined b is treated
-     * as the end of the list.
-     */
-    createBetween(a?: P, b?: P): P;
-}
-export declare class StringTotalOrder implements UniquelyDenseTotalOrder<string> {
-    readonly replicaID: string;
-    private counter;
-    compare(a: string, b: string): number;
-    constructor(replicaID: string);
-    createBetween(a?: string, b?: string): string;
-}
-export declare function randomString(length?: number): string;
-//# sourceMappingURL=utils.d.ts.map

package/dist/Fugue/utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/Fugue/utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB,CAAC,CAAC;IACtC;;;OAGG;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IAE5B;;;;;;;;;;OAUG;IACH,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;CAClC;AAED,qBAAa,gBAAiB,YAAW,uBAAuB,CAAC,MAAM,CAAC;IACpE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,OAAO,CAAK;IAEpB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;gBAIzB,SAAS,EAAE,MAAM;IAI7B,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CA6BhD;AAED,wBAAgB,YAAY,CAAC,MAAM,GAAE,MAAW,GAAG,MAAM,CAIxD"}

package/dist/Fugue/utils.js

@@ -1,41 +0,0 @@
-export class StringTotalOrder {
-    compare(a, b) {
-        return a.localeCompare(b);
-    }
-    constructor(replicaID) {
-        this.counter = 0;
-        this.replicaID = replicaID;
-    }
-    createBetween(a, b) {
-        // Create a wholly unique string using a causal dot, i.e. (replicaID, counter)
-        const uniqueStr = `${this.replicaID}${this.counter++}`;
-        // If node is the first ever position in the document
-        if (!a && !b) {
-            return uniqueStr + "R";
-        }
-        // If node is the first position at that index
-        if (!a) {
-            return b + uniqueStr + "R";
-        }
-        // If node is the last position at that index
-        if (!b) {
-            return a + uniqueStr + "R";
-        }
-        const isAPrefixOfB = b.substring(0, a.length).localeCompare(a);
-        // If a is not a prefix of b append a globally unique new string to a and return that +R
-        if (!isAPrefixOfB) {
-            return a + uniqueStr + "R";
-        }
-        else {
-            // If a is a prefix of b replace the R at the end of b with L.
-            // Then append a globally unique string to it and return it  +R.
-            return b.slice(0, -1) + "L" + uniqueStr + "R";
-        }
-    }
-}
-export function randomString(length = 10) {
-    let res = new Array(length);
-    for (let i = 0; i < length; i++)
-        res[i] = String.fromCharCode(97 + Math.floor(Math.random() * 26));
-    return res.join("");
-}