@cr_docs_t/dts 0.35.2 → 0.35.3

package/dist/dts/Serailizers/General.d.ts

@@ -2,8 +2,9 @@ import { BasePresenceMessage } from "../../types/Presence.js";
 import { BaseMessage } from "../../types/Message.js";
 import { BaseFugueMessage } from "../../types/index.js";
 export type Message = BaseFugueMessage[] | BasePresenceMessage[];
+type OutgoingMessage = BaseMessage | BasePresenceMessage;
 export declare const COMP = true;
-declare function serialize(msgs: BaseMessage | BaseMessage[]): Uint8Array;
+declare function serialize(msgs: OutgoingMessage | OutgoingMessage[]): Uint8Array;
 declare function deserialize(bytes: Uint8Array): Message;
 export declare const Serializer: {
     serialize: typeof serialize;

package/dist/dts/Serailizers/General.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"General.d.ts","sourceRoot":"","sources":["../../../src/dts/Serailizers/General.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,WAAW,EAAe,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAMxD,MAAM,MAAM,OAAO,GAAG,gBAAgB,EAAE,GAAG,mBAAmB,EAAE,CAAC;AAEjE,eAAO,MAAM,IAAI,OAAO,CAAC;AAIzB,iBAAS,SAAS,CAAC,IAAI,EAAE,WAAW,GAAG,WAAW,EAAE,GAAG,UAAU,CAyBhE;AAED,iBAAS,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAyB/C;AAED,eAAO,MAAM,UAAU;;;CAGtB,CAAC"}
+{"version":3,"file":"General.d.ts","sourceRoot":"","sources":["../../../src/dts/Serailizers/General.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,WAAW,EAAe,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAMxD,MAAM,MAAM,OAAO,GAAG,gBAAgB,EAAE,GAAG,mBAAmB,EAAE,CAAC;AACjE,KAAK,eAAe,GAAG,WAAW,GAAG,mBAAmB,CAAC;AAEzD,eAAO,MAAM,IAAI,OAAO,CAAC;AAIzB,iBAAS,SAAS,CAAC,IAAI,EAAE,eAAe,GAAG,eAAe,EAAE,GAAG,UAAU,CAyBxE;AAED,iBAAS,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAyB/C;AAED,eAAO,MAAM,UAAU;;;CAGtB,CAAC"}

package/dist/dts/Serailizers/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/Serailizers/index.ts"],"names":[],"mappings":"AACA,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/Serailizers/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC"}

package/dist/dts/Serailizers/index.js

@@ -1,4 +1,3 @@
-// export * from "./Fugue/index.js";
 export * from "./FugueTree/index.js";
 export * from "./Presence.js";
 export * from "./General.js";

package/dist/dts/index.d.ts

@@ -1,6 +1,3 @@
-export * from "./CausalTree/index.js";
 export * from "./Serailizers/index.js";
-export * from "./TotalOrder/index.js";
-export * from "./Fugue/index.js";
 export * from "./FugueTree/index.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/dts/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dts/index.ts"],"names":[],"mappings":"AAAA,cAAc,uBAAuB,CAAC;AACtC,cAAc,wBAAwB,CAAC;AACvC,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dts/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC"}

package/dist/dts/index.js

@@ -1,5 +1,2 @@
-export * from "./CausalTree/index.js";
 export * from "./Serailizers/index.js";
-export * from "./TotalOrder/index.js";
-export * from "./Fugue/index.js";
 export * from "./FugueTree/index.js";

package/dist/tests/unit/mocks/FugueTree-mocks.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FugueTree-mocks.d.ts","sourceRoot":"","sources":["../../../../src/tests/unit/mocks/FugueTree-mocks.ts"],"names":[],"mappings":"AACA,OAAO,EAAa,SAAS,EAAoB,MAAM,uBAAuB,CAAC;AAC/E,OAAO,EAAE,YAAY,EAA0B,MAAM,yBAAyB,CAAC;AAE/E,eAAO,MAAM,MAAM,aAAa,CAAC;AACjC,eAAO,MAAM,OAAO,cAAc,CAAC;AAEnC;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAExE;AAED,eAAO,MAAM,cAAc,WAAkB,CAAC;AAE9C;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAOpD;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAChC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EACZ,UAAU,GAAE,MAAe,GAC5B,YAAY,CAYd;AAED,wBAAgB,oBAAoB,CAChC,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EAC7C,UAAU,GAAE,MAAe,GAC5B,YAAY,CAWd"}
+{"version":3,"file":"FugueTree-mocks.d.ts","sourceRoot":"","sources":["../../../../src/tests/unit/mocks/FugueTree-mocks.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,YAAY,EAA0B,MAAM,yBAAyB,CAAC;AAE/E,eAAO,MAAM,MAAM,aAAa,CAAC;AACjC,eAAO,MAAM,OAAO,cAAc,CAAC;AAEnC;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAExE;AAED,eAAO,MAAM,cAAc,WAAkB,CAAC;AAE9C;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAOpD;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAChC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EACZ,UAAU,GAAE,MAAe,GAC5B,YAAY,CAYd;AAED,wBAAgB,oBAAoB,CAChC,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EAC7C,UAAU,GAAE,MAAe,GAC5B,YAAY,CAWd"}

package/dist/types/Message.d.ts

@@ -6,5 +6,6 @@ export interface BaseMessage<T extends MessageType = MessageType> {
     msgType: T;
     documentID: string;
     userIdentity: string;
+    projectID?: string;
 }
 //# 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,WAAW;IACnB,KAAK,IAAA;IACL,QAAQ,IAAA;CACX;AAED,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW;IAC5D,OAAO,EAAE,CAAC,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACxB"}
+{"version":3,"file":"Message.d.ts","sourceRoot":"","sources":["../../src/types/Message.ts"],"names":[],"mappings":"AAAA,oBAAY,WAAW;IACnB,KAAK,IAAA;IACL,QAAQ,IAAA;CACX;AAED,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW;IAC5D,OAAO,EAAE,CAAC,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB"}

package/dist/types/Presence.d.ts

@@ -1,16 +1,20 @@
 import { BaseMessage, MessageType } from "./Message.js";
 export declare enum PresenceMessageType {
     CURSOR = 0,
-    UPDATE = 1
+    UPDATE = 1,
+    JOIN = 2
 }
-export interface BasePresenceMessage<T extends PresenceMessageType = PresenceMessageType> extends BaseMessage<MessageType.PRESENCE> {
+export interface BasePresenceMessage<T extends PresenceMessageType = PresenceMessageType> extends Omit<BaseMessage<MessageType.PRESENCE>, "documentID"> {
     type: T;
+    documentID?: string;
 }
 export interface PresenceCursorMessage extends BasePresenceMessage<PresenceMessageType.CURSOR> {
     pos: number;
 }
 export interface PresenceUpdateMessage extends BasePresenceMessage<PresenceMessageType.UPDATE> {
 }
-export type PresenceMessage = PresenceCursorMessage | PresenceUpdateMessage;
+export interface PresenceJoinMessage extends BasePresenceMessage<PresenceMessageType.JOIN> {
+}
+export type PresenceMessage = PresenceCursorMessage | PresenceUpdateMessage | PresenceJoinMessage;
 export declare const makePresenceMsg: <T extends PresenceMessage>(msg: Omit<T, "msgType">) => BasePresenceMessage;
 //# sourceMappingURL=Presence.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"Presence.d.ts","sourceRoot":"","sources":["../../src/types/Presence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAExD,oBAAY,mBAAmB;IAC3B,MAAM,IAAA;IACN,MAAM,IAAA;CACT;AAED,MAAM,WAAW,mBAAmB,CAAC,CAAC,SAAS,mBAAmB,GAAG,mBAAmB,CACpF,SAAQ,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC;CACX;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB,CAAC,mBAAmB,CAAC,MAAM,CAAC;IAC1F,GAAG,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB,CAAC,mBAAmB,CAAC,MAAM,CAAC;CAAG;AAEjG,MAAM,MAAM,eAAe,GAAG,qBAAqB,GAAG,qBAAqB,CAAC;AAE5E,eAAO,MAAM,eAAe,GAAI,CAAC,SAAS,eAAe,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,KAAG,mBAKpF,CAAC"}
+{"version":3,"file":"Presence.d.ts","sourceRoot":"","sources":["../../src/types/Presence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAExD,oBAAY,mBAAmB;IAC3B,MAAM,IAAA;IACN,MAAM,IAAA;IACN,IAAI,IAAA;CACP;AAED,MAAM,WAAW,mBAAmB,CAClC,CAAC,SAAS,mBAAmB,GAAG,mBAAmB,CACnD,SAAQ,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IAC7D,IAAI,EAAE,CAAC,CAAC;IACR,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB,CAAC,mBAAmB,CAAC,MAAM,CAAC;IAC1F,GAAG,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB,CAAC,mBAAmB,CAAC,MAAM,CAAC;CAAI;AAElG,MAAM,WAAW,mBAAoB,SAAQ,mBAAmB,CAAC,mBAAmB,CAAC,IAAI,CAAC;CAAI;AAE9F,MAAM,MAAM,eAAe,GAAG,qBAAqB,GAAG,qBAAqB,GAAG,mBAAmB,CAAC;AAElG,eAAO,MAAM,eAAe,GAAI,CAAC,SAAS,eAAe,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,KAAG,mBAKpF,CAAC"}

package/dist/types/Presence.js

@@ -3,7 +3,10 @@ export var PresenceMessageType;
 (function (PresenceMessageType) {
     PresenceMessageType[PresenceMessageType["CURSOR"] = 0] = "CURSOR";
     PresenceMessageType[PresenceMessageType["UPDATE"] = 1] = "UPDATE";
+    PresenceMessageType[PresenceMessageType["JOIN"] = 2] = "JOIN";
 })(PresenceMessageType || (PresenceMessageType = {}));
+;
+;
 export const makePresenceMsg = (msg) => {
     return {
         ...msg,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cr_docs_t/dts",
-  "version": "0.35.2",
+  "version": "0.35.3",
   "description": "",
   "main": "dist/index.js",
   "type": "module",

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"CTNode.d.ts","sourceRoot":"","sources":["../../../src/dts/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/dts/CausalTree/CTNode.js

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

package/dist/dts/CausalTree/CausalTree.d.ts

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"CausalTree.d.ts","sourceRoot":"","sources":["../../../src/dts/CausalTree/CausalTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,qBAAa,UAAU;IAWnB,IAAI,EAAE,MAAM,CAAC;gBAED,IAAI,EAAE,MAAM;CAG3B"}

package/dist/dts/CausalTree/CausalTree.js

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

package/dist/dts/CausalTree/index.d.ts

@@ -1,3 +0,0 @@
-export * from "./CausalTree.js";
-export * from "./CTNode.js";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/CausalTree/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC"}

package/dist/dts/CausalTree/index.js

@@ -1,2 +0,0 @@
-export * from "./CausalTree.js";
-export * from "./CTNode.js";

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"FNode.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FNode.ts"],"names":[],"mappings":"AAEA,qBAAa,SAAS,CAAC,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,CAAC,CAAC;gBAEA,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;CAI1C"}

package/dist/dts/Fugue/FNode.js

@@ -1,6 +0,0 @@
-export class FListNode {
-    constructor(position, value) {
-        this.value = value;
-        this.position = position;
-    }
-}

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

@@ -1,102 +0,0 @@
-import { FugueState, FugueMessage } from "../../types/Fugue/index.js";
-import { UniquelyDenseTotalOrder } from "../TotalOrder/UniquelyDenseTotalOrder.js";
-/**
- * A Fugue List CRDT, with insert and delete operations
- */
-export declare class FugueList<P> {
-    state: FugueState<P>;
-    totalOrder: UniquelyDenseTotalOrder<P>;
-    positionCounter: number;
-    ws: WebSocket | null;
-    documentID: string;
-    userIdentity: string | undefined;
-    readonly batchSize = 100;
-    constructor(totalOrder: UniquelyDenseTotalOrder<P>, ws: WebSocket | null, documentID: string, userIdentity?: string);
-    /**
-     * Propagates message or messages to replicas
-     * @param msg - Message or messages to propagate to replicas
-     */
-    private propagate;
-    private binarySearchPosition;
-    /**
-     * 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;
-    /**
-     * Inserts multiple characters at given index, this
-     * handles large insertions by batching messages
-     * @param index - Index to insert at
-     * @param value - Value to insert
-     */
-    insertMultiple(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;
-    /**
-     * Deletes multiple values starting from index, this
-     * handles large deletions by batching messages
-     * @param index - Starting index to delete from
-     * @param count -  Number of values to delete
-     */
-    deleteMultiple(index: number, count: number): void;
-    /**
-     * Observes the current visible state of the list
-     * @returns The current visible state of the list as a string
-     */
-    observe(): string;
-    /**
-     * Applies a single effect message to the list
-     * @param msg - Message to apply effect for
-     */
-    private singleEffect;
-    /**
-     * Applies batched effect messages to the list
-     * @param msgs - Messages to apply effect for in batch
-     */
-    private batchEffect;
-    /**
-     * Applies effect messages to the list
-     * @param msg - Message or messages to apply effect for, can be batched
-     */
-    effect(msg: FugueMessage<P> | FugueMessage<P>[]): void;
-    replicaId(): string;
-    /**
-     * Performs garbage collection by removing tombstoned nodes from the state
-     */
-    garbageCollect(): void;
-}
-//# sourceMappingURL=FugueList.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FugueList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAa,MAAM,4BAA4B,CAAC;AACjF,OAAO,EAAE,uBAAuB,EAAE,MAAM,0CAA0C,CAAC;AAInF;;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;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,QAAQ,CAAC,SAAS,OAAO;gBAGrB,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,EACtC,EAAE,EAAE,SAAS,GAAG,IAAI,EACpB,UAAU,EAAE,MAAM,EAClB,YAAY,CAAC,EAAE,MAAM;IAQzB;;;OAGG;IACH,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,oBAAoB;IAmB5B;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IAqBxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAenC;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAiD3C;;;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;IAqBpB;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAqD3C;;;OAGG;IACH,OAAO,IAAI,MAAM;IAmBjB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAcpB;;;OAGG;IACH,OAAO,CAAC,WAAW;IAqGnB;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAW/C,SAAS,IAAI,MAAM;IAInB;;OAEG;IACH,cAAc;CAOjB"}

package/dist/dts/Fugue/FugueList.js

@@ -1,432 +0,0 @@
-import { FListNode } from "./FNode.js";
-import { Operation } from "../../types/Fugue/index.js";
-import { FugueMessageSerialzier } from "../Serailizers/Fugue/index.js";
-import { logger } from "../../utils/logging.js";
-/**
- * A Fugue List CRDT, with insert and delete operations
- */
-export class FugueList {
-    constructor(totalOrder, ws, documentID, userIdentity) {
-        this.state = [];
-        this.positionCounter = 0;
-        this.batchSize = 100;
-        this.totalOrder = totalOrder;
-        this.ws = ws;
-        this.documentID = documentID;
-        this.userIdentity = userIdentity;
-    }
-    /**
-     * Propagates message or messages to replicas
-     * @param msg - Message or messages to propagate to replicas
-     */
-    propagate(msg) {
-        if (!this.ws)
-            return;
-        const allMsgs = Array.isArray(msg) ? msg : [msg];
-        const serializedFugueMsg = FugueMessageSerialzier.serialize(allMsgs);
-        this.ws.send(serializedFugueMsg);
-    }
-    binarySearchPosition(position) {
-        let low = 0;
-        let high = this.state.length - 1;
-        while (low <= high) {
-            const mid = Math.floor((low + high) / 2);
-            const midPos = this.state[mid][0].position;
-            const cmp = this.totalOrder.compare(midPos, position);
-            if (cmp === 0) {
-                return mid;
-            }
-            else if (cmp < 0) {
-                low = mid + 1;
-            }
-            else {
-                high = mid - 1;
-            }
-        }
-        // If not found, return the position where it can be inserted
-        return low;
-    }
-    /**
-     * Inserts a value at a given position
-     * @param position - Position to insert at
-     * @param value - Value to insert
-     */
-    insertAtPosition(position, value) {
-        let index = this.binarySearchPosition(position);
-        // Check if the position already exists at this index, i.e. there is a collision
-        if (index < this.state.length && this.totalOrder.compare(this.state[index][0].position, position) === 0) {
-            const cell = this.state[index];
-            const existing = cell.find((n) => this.totalOrder.compare(n.position, position) === 0);
-            // Don't insert if it already exists,
-            // TODO: ideally this should trigger a collision resolution
-            if (!existing) {
-                cell.push(new FListNode(position, value));
-                cell.sort((a, b) => this.totalOrder.compare(a.position, b.position));
-            }
-        }
-        // Insert new cell at index
-        else {
-            this.state.splice(index, 0, [new FListNode(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);
-        this.insertAtPosition(pos, value);
-        this.propagate({
-            documentID: this.documentID,
-            replicaId: this.totalOrder.getReplicaId(),
-            operation: Operation.INSERT,
-            position: pos,
-            userIdentity: this.userIdentity,
-            data: value,
-        });
-    }
-    /**
-     * Inserts multiple characters at given index, this
-     * handles large insertions by batching messages
-     * @param index - Index to insert at
-     * @param value - Value to insert
-     */
-    insertMultiple(index, value) {
-        if (value.length === 0)
-            return;
-        if (value.length === 1) {
-            this.insert(index, value);
-            return;
-        }
-        // Find left and right anchors
-        const lA = index > 0 ? this.findVisiblePosition(index - 1) : undefined;
-        const rA = this.findVisiblePosition(index);
-        const newCells = [];
-        let cL = lA;
-        let msgs = [];
-        for (const c of value) {
-            const pos = this.totalOrder.createBetween(cL, rA);
-            // Collect new cells
-            newCells.push([new FListNode(pos, c)]);
-            // Batch propagate
-            msgs.push({
-                documentID: this.documentID,
-                replicaId: this.totalOrder.getReplicaId(),
-                operation: Operation.INSERT,
-                position: pos,
-                userIdentity: this.userIdentity,
-                data: c,
-            });
-            cL = pos;
-            if (msgs.length >= this.batchSize) {
-                this.propagate(msgs);
-                msgs = [];
-            }
-        }
-        // Single splice to insert all new cells
-        const firstPos = newCells[0][0].position;
-        const insertIndex = this.binarySearchPosition(firstPos);
-        this.state.splice(insertIndex, 0, ...newCells);
-        // Propagate remaining
-        if (msgs.length > 0) {
-            this.propagate(msgs);
-        }
-    }
-    /**
-     *  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) {
-        const position = this.findVisiblePosition(index);
-        if (!position) {
-            logger.warn(`No element at position -> ${position}`);
-            return;
-        }
-        this.deleteAtPosition(position);
-        // Send to replicas
-        this.propagate({
-            documentID: this.documentID,
-            replicaId: this.totalOrder.getReplicaId(),
-            operation: Operation.DELETE,
-            position: position,
-            userIdentity: this.userIdentity,
-            data: null,
-        });
-    }
-    /**
-     * Deletes multiple values starting from index, this
-     * handles large deletions by batching messages
-     * @param index - Starting index to delete from
-     * @param count -  Number of values to delete
-     */
-    deleteMultiple(index, count) {
-        if (count <= 0)
-            return;
-        if (count === 1) {
-            this.delete(index);
-            return;
-        }
-        let currentVisibleIndex = 0;
-        let deletedCount = 0;
-        let msgs = [];
-        outer: for (const c of this.state) {
-            for (const n of c) {
-                // Only consider visible nodes
-                if (n.value !== undefined) {
-                    if (currentVisibleIndex >= index) {
-                        const pos = n.position;
-                        // Tombstone the node
-                        n.value = undefined;
-                        deletedCount++;
-                        // Batch
-                        msgs.push({
-                            documentID: this.documentID,
-                            replicaId: this.totalOrder.getReplicaId(),
-                            operation: Operation.DELETE,
-                            position: pos,
-                            userIdentity: this.userIdentity,
-                            data: null,
-                        });
-                        if (msgs.length >= this.batchSize) {
-                            this.propagate(msgs);
-                            msgs = [];
-                        }
-                    }
-                    // Processed a visible node
-                    currentVisibleIndex++;
-                    // Check if we've deleted enough
-                    if (deletedCount >= count) {
-                        break outer;
-                    }
-                }
-            }
-        }
-        if (msgs.length > 0) {
-            this.propagate(msgs);
-        }
-    }
-    /**
-     * 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) {
-            // 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 result jand if somehow
-            // a value is undefined append empty string
-            for (const n of nodes) {
-                res += n.value || "";
-            }
-        }
-        return res.toString();
-    }
-    /**
-     * Applies a single effect message to the list
-     * @param msg - Message to apply effect for
-     */
-    singleEffect(msg) {
-        const { replicaId, operation, data, position } = msg;
-        if (replicaId === this.totalOrder.getReplicaId())
-            return;
-        switch (operation) {
-            case Operation.INSERT:
-                if (!data)
-                    throw Error("Data is required for Operation.INSERT");
-                return this.insertAtPosition(position, data);
-            case Operation.DELETE:
-                return this.deleteAtPosition(position);
-        }
-        throw Error("Invalid operation");
-    }
-    /**
-     * Applies batched effect messages to the list
-     * @param msgs - Messages to apply effect for in batch
-     */
-    batchEffect(msgs) {
-        const inserts = [];
-        const deletes = new Set();
-        // Separate operations
-        for (const msg of msgs) {
-            const { replicaId, operation, position, data } = msg;
-            if (replicaId === this.totalOrder.getReplicaId())
-                continue;
-            switch (operation) {
-                case Operation.INSERT:
-                    if (!data)
-                        continue;
-                    inserts.push(msg);
-                    break;
-                case Operation.DELETE:
-                    deletes.add(JSON.stringify(position));
-                    break;
-            }
-        }
-        // Apply deletes first
-        if (deletes.size > 0) {
-            for (const posStr of deletes) {
-                // Parse the position back from the set
-                const pos = JSON.parse(posStr);
-                const idx = this.binarySearchPosition(pos);
-                // Check if we found the right cell
-                if (idx < this.state.length) {
-                    const cell = this.state[idx];
-                    // Find the specific node in the collision cell
-                    const node = cell.find((n) => this.totalOrder.compare(n.position, pos) === 0);
-                    if (node && node.value !== undefined) {
-                        node.value = undefined; // Tombstone
-                    }
-                }
-            }
-        }
-        // Then apply inserts
-        if (inserts.length > 0) {
-            inserts.sort((a, b) => this.totalOrder.compare(a.position, b.position));
-            // Group into chunks, of contiguous inserts
-            let batchCells = [];
-            let startIdx = -1;
-            for (const msg of inserts) {
-                const { position, data } = msg;
-                // Find the index to insert at
-                const idx = this.binarySearchPosition(position);
-                // Check for collision
-                //TODO: should trigger collision resolution
-                if (idx < this.state.length && this.totalOrder.compare(this.state[idx][0].position, position) === 0) {
-                    const cell = this.state[idx];
-                    const existing = cell.find((n) => this.totalOrder.compare(n.position, position) === 0);
-                    // Don't insert if it already exists
-                    if (!existing) {
-                        cell.push(new FListNode(position, data ? data : undefined));
-                        cell.sort((a, b) => this.totalOrder.compare(a.position, b.position));
-                    }
-                }
-                else {
-                    // Start a new batch if:
-                    // - It's the first item
-                    // - This index is not contiguous with the previous group
-                    if (startIdx === -1) {
-                        startIdx = idx;
-                        batchCells = [[new FListNode(position, data ? data : undefined)]];
-                    }
-                    // If the index is the same as startIdx, continue the batch
-                    else if (idx === startIdx) {
-                        batchCells.push([new FListNode(position, data ? data : undefined)]);
-                    }
-                    // The index is different, i.e. not contiguous, so flush the current batch,
-                    // commit it and start a new one
-                    else {
-                        // Commit batch
-                        this.state.splice(startIdx, 0, ...batchCells);
-                        // Start new batch
-                        // Calculate the shift caused by the splice
-                        // If the new idx (calculated on old state) is after the splice point,
-                        // we must add the length of the batch we just inserted.
-                        const shift = idx >= startIdx ? batchCells.length : 0;
-                        startIdx = idx + shift;
-                        batchCells = [[new FListNode(position, data ? data : undefined)]];
-                    }
-                }
-            }
-            // Commit any remaining batch
-            if (batchCells.length > 0)
-                this.state.splice(startIdx, 0, ...batchCells);
-        }
-    }
-    /**
-     * Applies effect messages to the list
-     * @param msg - Message or messages to apply effect for, can be batched
-     */
-    effect(msg) {
-        if (Array.isArray(msg)) {
-            this.batchEffect(msg);
-            // for (const m of msg) {
-            //     this.singleEffect(m);
-            // }
-        }
-        else {
-            this.singleEffect(msg);
-        }
-    }
-    replicaId() {
-        return this.totalOrder.getReplicaId();
-    }
-    /**
-     * Performs garbage collection by removing tombstoned nodes from the state
-     */
-    garbageCollect() {
-        this.state = this.state.filter((cell) => {
-            // Check if cell has any visible nodes
-            const hasVisible = cell.some((n) => n.value !== undefined);
-            return hasVisible;
-        });
-    }
-}

package/dist/dts/Fugue/index.d.ts

@@ -1,2 +0,0 @@
-export * from "./FugueList.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/dts/Fugue/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/index.ts"],"names":[],"mappings":"AACA,cAAc,gBAAgB,CAAC"}

package/dist/dts/Fugue/index.js

@@ -1,2 +0,0 @@
-// export * from "./FNode.js";
-export * from "./FugueList.js";

package/dist/dts/Serailizers/Fugue/Message.d.ts

@@ -1,9 +0,0 @@
-import { FugueMessageType } from "../../../types/Fugue/index.js";
-declare function serialize<P>(msgs: FugueMessageType<P>[]): Uint8Array<ArrayBuffer>;
-declare function deserialize<P>(data: Uint8Array): FugueMessageType<P>[];
-export declare const FugueMessageSerialzier: {
-    serialize: typeof serialize;
-    deserialize: typeof deserialize;
-};
-export {};
-//# sourceMappingURL=Message.d.ts.map

package/dist/dts/Serailizers/Fugue/Message.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Message.d.ts","sourceRoot":"","sources":["../../../../src/dts/Serailizers/Fugue/Message.ts"],"names":[],"mappings":"AACA,OAAO,EAGH,gBAAgB,EAInB,MAAM,+BAA+B,CAAC;AAEvC,iBAAS,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,2BAEhD;AAED,iBAAS,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAM/D;AA6DD,eAAO,MAAM,sBAAsB;;;CAGlC,CAAC"}

package/dist/dts/Serailizers/Fugue/Message.js

@@ -1,73 +0,0 @@
-import { encode, decode } from "@msgpack/msgpack";
-import { Operation, } from "../../../types/Fugue/index.js";
-function serialize(msgs) {
-    return encode(msgs.map((m) => toTuple(m)));
-}
-function deserialize(data) {
-    const dec = decode(data);
-    if (Array.isArray(dec) && Array.isArray(dec[0])) {
-        return dec.map((t) => fromTuple(t));
-    }
-    return [fromTuple(dec)];
-}
-function toTuple(msg) {
-    // Check if msg is of FugueJoinMessage type
-    switch (msg.operation) {
-        case Operation.JOIN:
-            return [
-                msg.operation,
-                msg.documentID,
-                msg.state,
-                msg.userIdentity,
-                msg.collaborators,
-                msg.offlineChanges,
-                msg.replicaId,
-            ];
-        case Operation.INSERT:
-        case Operation.DELETE:
-            return [msg.operation, msg.documentID, msg.replicaId, msg.position, msg.data, msg.userIdentity];
-        case Operation.REJECT:
-            return [msg.operation];
-        case Operation.LEAVE:
-            return [msg.operation, msg.userIdentity];
-    }
-    throw new Error("Unknown message type");
-}
-function fromTuple(tuple) {
-    switch (tuple[0]) {
-        case Operation.JOIN:
-            return {
-                operation: tuple[0],
-                documentID: tuple[1],
-                state: tuple[2],
-                userIdentity: tuple[3],
-                collaborators: tuple[4],
-                offlineChanges: tuple[5],
-                replicaId: tuple[6],
-            };
-        case Operation.INSERT:
-        case Operation.DELETE:
-            return {
-                operation: tuple[0],
-                documentID: tuple[1],
-                replicaId: tuple[2],
-                position: tuple[3],
-                data: tuple[4],
-                userIdentity: tuple[5],
-            };
-        case Operation.REJECT:
-            return {
-                operation: tuple[0],
-            };
-        case Operation.LEAVE:
-            return {
-                operation: tuple[0],
-                userIdentity: tuple[1],
-            };
-    }
-    throw new Error("Unknown tuple format");
-}
-export const FugueMessageSerialzier = {
-    serialize,
-    deserialize,
-};

package/dist/dts/Serailizers/Fugue/State.d.ts

@@ -1,9 +0,0 @@
-import { FugueState } from "../../../types/Fugue/index.js";
-declare function serialize(state: FugueState<string>): Uint8Array<ArrayBufferLike>;
-declare function deserialize(compressed: Uint8Array<ArrayBufferLike>): FugueState<string>;
-export declare const FugueStateSerializer: {
-    serialize: typeof serialize;
-    deserialize: typeof deserialize;
-};
-export {};
-//# sourceMappingURL=State.d.ts.map

package/dist/dts/Serailizers/Fugue/State.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"State.d.ts","sourceRoot":"","sources":["../../../../src/dts/Serailizers/Fugue/State.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAE3D,iBAAS,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,eAAe,CAAC,CAKzE;AAED,iBAAS,WAAW,CAAC,UAAU,EAAE,UAAU,CAAC,eAAe,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAIhF;AAED,eAAO,MAAM,oBAAoB;;;CAGhC,CAAC"}

package/dist/dts/Serailizers/Fugue/State.js

@@ -1,16 +0,0 @@
-import { encode, decode } from "@msgpack/msgpack";
-function serialize(state) {
-    // const flat = state.flatMap((c) => c.map((n) => [n.position, n.value]));
-    const bin = encode(state);
-    // const com = compress(bin);
-    return bin;
-}
-function deserialize(compressed) {
-    // const raw = decompress(compressed);
-    const state = decode(compressed);
-    return state;
-}
-export const FugueStateSerializer = {
-    serialize,
-    deserialize,
-};

package/dist/dts/Serailizers/Fugue/index.d.ts

@@ -1,3 +0,0 @@
-export * from "./State.js";
-export * from "./Message.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/dts/Serailizers/Fugue/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/dts/Serailizers/Fugue/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC"}

package/dist/dts/Serailizers/Fugue/index.js

@@ -1,2 +0,0 @@
-export * from "./State.js";
-export * from "./Message.js";

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

@@ -1,11 +0,0 @@
-import { UniquelyDenseTotalOrder } from "./UniquelyDenseTotalOrder.js";
-export type StringPosition = string;
-export declare class StringTotalOrder implements UniquelyDenseTotalOrder<StringPosition> {
-    readonly replicaID: string;
-    private counter;
-    getReplicaId(): string;
-    compare(a: StringPosition, b: StringPosition): number;
-    constructor(replicaID: string);
-    createBetween(a?: StringPosition, b?: StringPosition): string;
-}
-//# sourceMappingURL=StringTotalOrder.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"StringTotalOrder.d.ts","sourceRoot":"","sources":["../../../src/dts/TotalOrder/StringTotalOrder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAEvE,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,cAAc,EAAE,CAAC,EAAE,cAAc,GAAG,MAAM;gBAIzC,SAAS,EAAE,MAAM;IAI7B,aAAa,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,cAAc,GAAG,MAAM;CA6BhE"}

package/dist/dts/TotalOrder/StringTotalOrder.js

@@ -1,38 +0,0 @@
-export class StringTotalOrder {
-    getReplicaId() {
-        return this.replicaID;
-    }
-    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.slice(0, -1) + "L" + uniqueStr + "R";
-        }
-        // If node is the last position at that index
-        if (!b) {
-            return a + uniqueStr + "R";
-        }
-        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";
-        }
-        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";
-        }
-    }
-}

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

@@ -1,27 +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> {
-    getReplicaId(): string;
-    /**
-     * 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;
-}
-//# sourceMappingURL=UniquelyDenseTotalOrder.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"UniquelyDenseTotalOrder.d.ts","sourceRoot":"","sources":["../../../src/dts/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/dts/TotalOrder/UniquelyDenseTotalOrder.js

@@ -1 +0,0 @@
-export {};

package/dist/dts/TotalOrder/index.d.ts

@@ -1,3 +0,0 @@
-export * from "./StringTotalOrder.js";
-export * from "./UniquelyDenseTotalOrder.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/dts/TotalOrder/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/TotalOrder/index.ts"],"names":[],"mappings":"AAAA,cAAc,uBAAuB,CAAC;AACtC,cAAc,8BAA8B,CAAC"}

package/dist/dts/TotalOrder/index.js

@@ -1,2 +0,0 @@
-export * from "./StringTotalOrder.js";
-export * from "./UniquelyDenseTotalOrder.js";

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"Fugue.d.ts","sourceRoot":"","sources":["../../../src/types/Fugue/Fugue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAErD,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC"}

package/dist/types/Fugue/Fugue.js

@@ -1 +0,0 @@
-export {};

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

@@ -1,36 +0,0 @@
-import { FugueState } from "./Fugue.js";
-export declare enum Operation {
-    INSERT = 0,
-    DELETE = 1,
-    JOIN = 2,
-    REJECT = 3,
-    LEAVE = 4
-}
-export type Data = string;
-export interface FugueMessage<P> {
-    operation: Operation.INSERT | Operation.DELETE;
-    documentID: string;
-    replicaId: string;
-    position: P;
-    data: Data | null;
-    userIdentity?: string;
-}
-export interface FugueJoinMessage<P> {
-    operation: Operation.JOIN;
-    documentID: string;
-    state: FugueState<P> | null;
-    userIdentity?: string;
-    collaborators?: string[];
-    offlineChanges?: FugueState<P> | null;
-    replicaId?: string;
-}
-export interface FugueRejectMessage {
-    operation: Operation.REJECT;
-}
-export interface FugueLeaveMessage {
-    operation: Operation.LEAVE;
-    userIdentity: string;
-}
-export type FugueMessageType<P> = FugueMessage<P> | FugueJoinMessage<P> | FugueRejectMessage | FugueLeaveMessage;
-export type FugueMutationMessageTypes<P> = Extract<FugueMessageType<P>, FugueMessage<P> | FugueJoinMessage<P>>;
-//# sourceMappingURL=Message.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Message.d.ts","sourceRoot":"","sources":["../../../src/types/Fugue/Message.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,oBAAY,SAAS;IACjB,MAAM,IAAA;IACN,MAAM,IAAA;IACN,IAAI,IAAA;IACJ,MAAM,IAAA;IACN,KAAK,IAAA;CACR;AAED,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,YAAY,CAAC,CAAC;IAC3B,SAAS,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAC/C,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,CAAC,CAAC;IACZ,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,gBAAgB,CAAC,CAAC;IAC/B,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAC5B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,cAAc,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IAC/B,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;AAEjH,MAAM,MAAM,yBAAyB,CAAC,CAAC,IAAI,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC"}

package/dist/types/Fugue/Message.js

@@ -1,8 +0,0 @@
-export var Operation;
-(function (Operation) {
-    Operation[Operation["INSERT"] = 0] = "INSERT";
-    Operation[Operation["DELETE"] = 1] = "DELETE";
-    Operation[Operation["JOIN"] = 2] = "JOIN";
-    Operation[Operation["REJECT"] = 3] = "REJECT";
-    Operation[Operation["LEAVE"] = 4] = "LEAVE";
-})(Operation || (Operation = {}));

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

@@ -1,3 +0,0 @@
-export * from "./Fugue.js";
-export * from "./Message.js";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/Fugue/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC"}

package/dist/types/Fugue/index.js

@@ -1,2 +0,0 @@
-export * from "./Fugue.js";
-export * from "./Message.js";