@cr_docs_t/dts 0.0.3 → 0.0.4

package/dist/CausalTree/CTNode.d.ts

@@ -0,0 +1,8 @@
+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

@@ -0,0 +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"}

package/dist/CausalTree/CTNode.js

@@ -1,11 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
 class CTNode {
-    uid; //userId @ lamport timestamp
-    character;
-    cause; //the causal prior?
     constructor(uid) {
         this.uid = uid;
     }
 }
-exports.default = CTNode;
+export default CTNode;

package/dist/CausalTree/CausalTree.d.ts

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

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

@@ -0,0 +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"}

package/dist/CausalTree/CausalTree.js

@@ -1,19 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
 class CasualTree {
-    /*
-    This is the fug crdt
-    It is a tree
-    It has a root
-    
-    We can insert into the tree
-    Delete from the tree
-    Display the characters...
-    Maybe add a build method from a list of operations...
-    */
-    root;
     constructor(root) {
         this.root = root;
     }
 }
-exports.default = CasualTree;
+export default CasualTree;

package/dist/Fugue/FNode.d.ts

@@ -0,0 +1,7 @@
+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

@@ -0,0 +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"}

package/dist/Fugue/FNode.js

@@ -1,11 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
 class FNode {
-    value;
-    position;
     constructor(position, value) {
         this.value = value;
         this.position = position;
     }
 }
-exports.default = FNode;
+export default FNode;

package/dist/Fugue/FugueList.d.ts

@@ -0,0 +1,25 @@
+import FNode from "./FNode";
+import { UniquelyDenseTotalOrder } from "./utils";
+/**
+ * A Fugue List CRDT, with insert and delete operations
+ */
+declare class FugueList<P> {
+    state: FNode<P>[][];
+    totalOrder: UniquelyDenseTotalOrder<P>;
+    positionCounter: number;
+    constructor(totalOrder: UniquelyDenseTotalOrder<P>);
+    /**
+     * 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;
+    /**
+     * Delete value in the list at index
+     * @param index - Index of the value to delete
+     */
+    delete(index: number): void;
+    observe(): string;
+}
+export default FugueList;
+//# sourceMappingURL=FugueList.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../src/Fugue/FugueList.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EAAoB,uBAAuB,EAAE,MAAM,SAAS,CAAC;AAEpE;;GAEG;AACH,cAAM,SAAS,CAAC,CAAC;IACb,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAM;IACzB,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC;IACvC,eAAe,SAAK;gBAER,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC;IAIlD;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IA+BnC;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IASpB,OAAO,IAAI,MAAM;CAepB;AAED,eAAe,SAAS,CAAC"}

package/dist/Fugue/FugueList.js

@@ -1,17 +1,11 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const FNode_1 = __importDefault(require("./FNode"));
+import FNode from "./FNode";
 /**
  * A Fugue List CRDT, with insert and delete operations
  */
 class FugueList {
-    state = [];
-    totalOrder;
-    positionCounter = 0;
     constructor(totalOrder) {
+        this.state = [];
+        this.positionCounter = 0;
         this.totalOrder = totalOrder;
     }
     /**
@@ -32,20 +26,20 @@ class FugueList {
             const before = this.state[index - 1];
             const after = this.state[index + 1];
             if (atIndex.length == 0) {
-                atIndex.push(new FNode_1.default(this.totalOrder.createBetween(before[before.length - 1].position), value));
+                atIndex.push(new FNode(this.totalOrder.createBetween(before[before.length - 1].position), value));
             }
             else {
                 const a = atIndex[atIndex.length - 1];
-                atIndex.push(new FNode_1.default(this.totalOrder.createBetween(a.position, after[after.length - 1].position), value));
+                atIndex.push(new FNode(this.totalOrder.createBetween(a.position, after[after.length - 1].position), value));
             }
         }
         else {
             if (atIndex.length == 0) {
-                atIndex.push(new FNode_1.default(this.totalOrder.createBetween(), value));
+                atIndex.push(new FNode(this.totalOrder.createBetween(), value));
             }
             else {
                 const a = atIndex[atIndex.length - 1];
-                atIndex.push(new FNode_1.default(this.totalOrder.createBetween(a.position), value));
+                atIndex.push(new FNode(this.totalOrder.createBetween(a.position), value));
             }
         }
     }
@@ -77,4 +71,4 @@ class FugueList {
         return res.toString();
     }
 }
-exports.default = FugueList;
+export default FugueList;

package/dist/Fugue/FugueTest.d.ts

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

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

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

package/dist/Fugue/FugueTest.js

@@ -1,12 +1,7 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const FugueList_1 = __importDefault(require("./FugueList"));
-const utils_1 = require("./utils");
-const test1 = new FugueList_1.default(new utils_1.StringTotalOrder((0, utils_1.randomString)(5)));
-const test2 = new FugueList_1.default(new utils_1.StringTotalOrder((0, utils_1.randomString)(5)));
+import FugueList from "./FugueList";
+import { randomString, StringTotalOrder } from "./utils";
+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

package/dist/Fugue/utils.d.ts

@@ -0,0 +1,34 @@
+/**
+ * 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

@@ -0,0 +1 @@
+{"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,14 +1,9 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.StringTotalOrder = void 0;
-exports.randomString = randomString;
-class StringTotalOrder {
-    replicaID;
-    counter = 0;
+export class StringTotalOrder {
     compare(a, b) {
         return a.localeCompare(b);
     }
     constructor(replicaID) {
+        this.counter = 0;
         this.replicaID = replicaID;
     }
     createBetween(a, b) {
@@ -38,8 +33,7 @@ class StringTotalOrder {
         }
     }
 }
-exports.StringTotalOrder = StringTotalOrder;
-function randomString(length = 10) {
+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));

package/{src/index.ts → dist/index.d.ts}

@@ -1,4 +1,4 @@
 import FugueList from "./Fugue/FugueList";
 import CausalTree from "./CausalTree/CausalTree";
-
 export { FugueList, CausalTree };
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +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;AAEjD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC"}

package/dist/index.js

@@ -1,2 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
+import FugueList from "./Fugue/FugueList";
+import CausalTree from "./CausalTree/CausalTree";
+export { FugueList, CausalTree };

package/package.json

@@ -1,9 +1,15 @@
 {
   "name": "@cr_docs_t/dts",
-  "version": "0.0.3",
+  "version": "0.0.4",
   "description": "",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
   "keywords": [],
   "author": [
     "Madiba Hudson-Quansah",
@@ -14,6 +20,9 @@
     "@types/node": "^24.10.1",
     "typescript": "^5.9.3"
   },
+  "files": [
+    "dist"
+  ],
   "scripts": {
     "build": "tsc"
   }

package/biome.jsonc

@@ -1,12 +0,0 @@
-{
-  "formatter": {
-    "indentStyle": "space", // default is `tab`
-    "lineWidth": 120, // default is `80`
-    "indentWidth": 4, // default is `2`
-  },
-  "json": {
-    "formatter": {
-      "enabled": false,
-    },
-  },
-}

package/src/CausalTree/CTNode.ts

@@ -1,12 +0,0 @@
-class CTNode {
-    uid: string; //userId @ lamport timestamp
-    character?: string;
-    cause?: CTNode; //the causal prior?
-
-    constructor(uid: string) {
-        this.uid = uid;
-    }
-}
-
-export default CTNode;
-

package/src/CausalTree/CausalTree.ts

@@ -1,21 +0,0 @@
-import CTNode from "./CTNode";
-
-class CasualTree {
-    /* 
-    This is the fug crdt
-    It is a tree
-    It has a root 
-    
-    We can insert into the tree
-    Delete from the tree
-    Display the characters...
-    Maybe add a build method from a list of operations...
-    */
-    root: CTNode;
-
-    constructor(root: CTNode) {
-        this.root = root;
-    }
-}
-
-export default CasualTree;

package/src/Fugue/FNode.ts

@@ -1,11 +0,0 @@
-class FNode<P> {
-    value?: string;
-    position: P;
-
-    constructor(position: P, value?: string) {
-        this.value = value;
-        this.position = position;
-    }
-}
-
-export default FNode;

package/src/Fugue/FugueList.ts

@@ -1,82 +0,0 @@
-import FNode from "./FNode";
-import { StringTotalOrder, UniquelyDenseTotalOrder } from "./utils";
-
-/**
- * A Fugue List CRDT, with insert and delete operations
- */
-class FugueList<P> {
-    state: FNode<P>[][] = [];
-    totalOrder: UniquelyDenseTotalOrder<P>;
-    positionCounter = 0;
-
-    constructor(totalOrder: UniquelyDenseTotalOrder<P>) {
-        this.totalOrder = totalOrder;
-    }
-
-    /**
-     * 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) {
-        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<P>(this.totalOrder.createBetween(before[before.length - 1].position), value));
-            } else {
-                const a = atIndex[atIndex.length - 1];
-                atIndex.push(
-                    new FNode<P>(this.totalOrder.createBetween(a.position, after[after.length - 1].position), value),
-                );
-            }
-        } else {
-            if (atIndex.length == 0) {
-                atIndex.push(new FNode<P>(this.totalOrder.createBetween(), value));
-            } else {
-                const a = atIndex[atIndex.length - 1];
-                atIndex.push(new FNode<P>(this.totalOrder.createBetween(a.position), value));
-            }
-        }
-    }
-
-    /**
-     * Delete value in the list at index
-     * @param index - Index of the value to delete
-     */
-    delete(index: number) {
-        let i = index;
-        while (i < this.state.length) {
-            this.state[i] = this.state[i + 1];
-            i++;
-        }
-        this.state.pop();
-    }
-
-    observe(): string {
-        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 || "ð";
-            }
-        }
-
-        return res.toString();
-    }
-}
-
-export default FugueList;

package/src/Fugue/FugueTest.ts

@@ -1,25 +0,0 @@
-import FugueList from "./FugueList";
-import { randomString, StringTotalOrder } from "./utils";
-
-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: FugueList<string>, word: string) {
-    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/src/Fugue/utils.ts

@@ -1,75 +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 class StringTotalOrder implements UniquelyDenseTotalOrder<string> {
-    readonly replicaID: string;
-    private counter = 0;
-
-    compare(a: string, b: string): number {
-        return a.localeCompare(b);
-    }
-
-    constructor(replicaID: string) {
-        this.replicaID = replicaID;
-    }
-
-    createBetween(a?: string, b?: string): string {
-        // 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: number = 10): string {
-    let res = new Array<string>(length);
-    for (let i = 0; i < length; i++) res[i] = String.fromCharCode(97 + Math.floor(Math.random() * 26));
-    return res.join("");
-}

package/tsconfig.json

@@ -1,13 +0,0 @@
-{
-  // Visit https://aka.ms/tsconfig to read more about this file
-  "compilerOptions": {
-    "module": "nodenext",
-    "target": "esnext",
-    "rootDir": "./src",
-    "esModuleInterop": true,
-    "forceConsistentCasingInFileNames": true,
-    "strict": true,
-    "skipLibCheck": true,
-    "outDir": "./dist",
-  }
-}