@fluidframework/container-runtime 2.0.0-dev.2.2.0.111723 → 2.0.0-dev.3.1.0.125672

package/src/throttler.ts

@@ -4,28 +4,28 @@
  */
 
 export interface IThrottler {
-    /**
-     * Computes what the throttle delay should be, and records an attempt
-     * which will be used for calculating future attempt delays.
-     */
-    getDelay(): number;
-
-    /**
-     * Number of attempts that occurred within the sliding window as of
-     * the most recent delay computation.
-     */
-    readonly numAttempts: number;
-
-    /** Width of sliding delay window in milliseconds. */
-    readonly delayWindowMs: number;
-    /** Maximum delay allowed in milliseconds. */
-    readonly maxDelayMs: number;
-    /**
-     * Delay function used to calculate what the delay should be.
-     * The input is the number of attempts that occurred within the sliding window.
-     * The result is the calculated delay in milliseconds.
-     */
-    readonly delayFn: (numAttempts: number) => number;
+	/**
+	 * Computes what the throttle delay should be, and records an attempt
+	 * which will be used for calculating future attempt delays.
+	 */
+	getDelay(): number;
+
+	/**
+	 * Number of attempts that occurred within the sliding window as of
+	 * the most recent delay computation.
+	 */
+	readonly numAttempts: number;
+
+	/** Width of sliding delay window in milliseconds. */
+	readonly delayWindowMs: number;
+	/** Maximum delay allowed in milliseconds. */
+	readonly maxDelayMs: number;
+	/**
+	 * Delay function used to calculate what the delay should be.
+	 * The input is the number of attempts that occurred within the sliding window.
+	 * The result is the calculated delay in milliseconds.
+	 */
+	readonly delayFn: (numAttempts: number) => number;
 }
 
 /**
@@ -33,74 +33,74 @@ export interface IThrottler {
  * Delay is based on previous attempts within specified time window, subtracting delay time.
  */
 export class Throttler implements IThrottler {
-    private startTimes: number[] = [];
-
-    public get numAttempts() {
-        return this.startTimes.length;
-    }
-
-    /**
-     * Gets all attempt start times after compensating for the delay times
-     * by adding the delay times to the actual times.
-     */
-    public getAttempts(): readonly number[] {
-        return [...this.startTimes];
-    }
-
-    /**
-     * Latest attempt time after compensating for the delay time itself
-     * by adding the delay time to the actual time.
-     */
-    public get latestAttemptTime() {
-        return this.startTimes.length > 0 ? this.startTimes[this.startTimes.length - 1] : undefined;
-    }
-
-    constructor(
-        /** Width of sliding delay window in milliseconds. */
-        public readonly delayWindowMs: number,
-        /** Maximum delay allowed in milliseconds. */
-        public readonly maxDelayMs: number,
-        /**
-         * Delay function used to calculate what the delay should be.
-         * The input is the number of attempts that occurred within the sliding window.
-         * The result is the calculated delay in milliseconds.
-         */
-        public readonly delayFn: (numAttempts: number) => number,
-    ) { }
-
-    public getDelay() {
-        const now = Date.now();
-
-        const latestAttemptTime = this.latestAttemptTime;
-        if (latestAttemptTime !== undefined) {
-            // If getDelay was called sooner than the most recent delay,
-            // subtract the remaining time, since we previously added it.
-            const earlyMs = latestAttemptTime - now;
-            if (earlyMs > 0) {
-                this.startTimes = this.startTimes.map((t) => t - earlyMs);
-            }
-        }
-
-        // Remove all attempts that have already fallen out of the window.
-        this.startTimes = this.startTimes.filter((t) => (now - t) < this.delayWindowMs);
-
-        // Compute delay, but do not exceed the specified max delay.
-        const delayMs = Math.min(this.delayFn(this.startTimes.length), this.maxDelayMs);
-
-        // Record this attempt start time.
-        this.startTimes.push(now);
-
-        // Account for the delay time, by effectively removing it from the delay window.
-        this.startTimes = this.startTimes.map((t) => t + delayMs);
-
-        if (delayMs === this.maxDelayMs) {
-            // We hit max delay, so adding more won't affect anything.
-            // Shift off oldest time to stop this array from growing forever.
-            this.startTimes.shift();
-        }
-
-        return delayMs;
-    }
+	private startTimes: number[] = [];
+
+	public get numAttempts() {
+		return this.startTimes.length;
+	}
+
+	/**
+	 * Gets all attempt start times after compensating for the delay times
+	 * by adding the delay times to the actual times.
+	 */
+	public getAttempts(): readonly number[] {
+		return [...this.startTimes];
+	}
+
+	/**
+	 * Latest attempt time after compensating for the delay time itself
+	 * by adding the delay time to the actual time.
+	 */
+	public get latestAttemptTime() {
+		return this.startTimes.length > 0 ? this.startTimes[this.startTimes.length - 1] : undefined;
+	}
+
+	constructor(
+		/** Width of sliding delay window in milliseconds. */
+		public readonly delayWindowMs: number,
+		/** Maximum delay allowed in milliseconds. */
+		public readonly maxDelayMs: number,
+		/**
+		 * Delay function used to calculate what the delay should be.
+		 * The input is the number of attempts that occurred within the sliding window.
+		 * The result is the calculated delay in milliseconds.
+		 */
+		public readonly delayFn: (numAttempts: number) => number,
+	) {}
+
+	public getDelay() {
+		const now = Date.now();
+
+		const latestAttemptTime = this.latestAttemptTime;
+		if (latestAttemptTime !== undefined) {
+			// If getDelay was called sooner than the most recent delay,
+			// subtract the remaining time, since we previously added it.
+			const earlyMs = latestAttemptTime - now;
+			if (earlyMs > 0) {
+				this.startTimes = this.startTimes.map((t) => t - earlyMs);
+			}
+		}
+
+		// Remove all attempts that have already fallen out of the window.
+		this.startTimes = this.startTimes.filter((t) => now - t < this.delayWindowMs);
+
+		// Compute delay, but do not exceed the specified max delay.
+		const delayMs = Math.min(this.delayFn(this.startTimes.length), this.maxDelayMs);
+
+		// Record this attempt start time.
+		this.startTimes.push(now);
+
+		// Account for the delay time, by effectively removing it from the delay window.
+		this.startTimes = this.startTimes.map((t) => t + delayMs);
+
+		if (delayMs === this.maxDelayMs) {
+			// We hit max delay, so adding more won't affect anything.
+			// Shift off oldest time to stop this array from growing forever.
+			this.startTimes.shift();
+		}
+
+		return delayMs;
+	}
 }
 
 /**
@@ -114,28 +114,37 @@ export class Throttler implements IThrottler {
  * Use initialDelay to decide what should happen when numAttempts is 0,
  * leave it undefined to not special case.
  */
- export const formExponentialFn = ({
-    multiplier = 2,
-    coefficient = 1,
-    offset = 0,
-    initialDelay = undefined as number | undefined,
-} = {}): IThrottler["delayFn"] => (numAttempts) => Math.max(0,
-    numAttempts <= 0 && initialDelay !== undefined
-    ? initialDelay
-    : coefficient * (Math.pow(multiplier, numAttempts)) + offset);
+export const formExponentialFn =
+	({
+		multiplier = 2,
+		coefficient = 1,
+		offset = 0,
+		initialDelay = undefined as number | undefined,
+	} = {}): IThrottler["delayFn"] =>
+	(numAttempts) =>
+		Math.max(
+			0,
+			numAttempts <= 0 && initialDelay !== undefined
+				? initialDelay
+				: coefficient * Math.pow(multiplier, numAttempts) + offset,
+		);
 
 /** f(n) = C x (B^(n+A)) + F = (C x B^A) x B^n + F */
-export const formExponentialFnWithAttemptOffset = (attemptOffset: number, {
-    multiplier = 2,
-    coefficient = 1,
-    offset = 0,
-    initialDelay = undefined as number | undefined,
-} = {}) => formExponentialFn({
-    multiplier,
-    coefficient: coefficient * Math.pow(multiplier, attemptOffset),
-    offset,
-    initialDelay,
-});
+export const formExponentialFnWithAttemptOffset = (
+	attemptOffset: number,
+	{
+		multiplier = 2,
+		coefficient = 1,
+		offset = 0,
+		initialDelay = undefined as number | undefined,
+	} = {},
+) =>
+	formExponentialFn({
+		multiplier,
+		coefficient: coefficient * Math.pow(multiplier, attemptOffset),
+		offset,
+		initialDelay,
+	});
 
 /**
  * Helper function to generate simple linear throttle functions.
@@ -144,17 +153,17 @@ export const formExponentialFnWithAttemptOffset = (attemptOffset: number, {
  * If not provided, coefficient will default to 1, and offset to 0, yielding:
  * 0 ms, 1 ms, 2 ms, 3 ms, ..., n ms delays; a linear back-off.
  */
-export const formLinearFn = ({
-    coefficient = 1,
-    offset = 0,
-} = {}): IThrottler["delayFn"] => (numAttempts) => Math.max(0,
-    coefficient * numAttempts + offset);
+export const formLinearFn =
+	({ coefficient = 1, offset = 0 } = {}): IThrottler["delayFn"] =>
+	(numAttempts) =>
+		Math.max(0, coefficient * numAttempts + offset);
 
 /** f(n) = C x (n+A) + F = C x n + (C x A + F) */
-export const formLinearFnWithAttemptOffset = (attemptOffset: number, {
-    coefficient = 1,
-    offset = 0,
-} = {}) => formLinearFn({
-    coefficient,
-    offset: coefficient * attemptOffset + offset,
-});
+export const formLinearFnWithAttemptOffset = (
+	attemptOffset: number,
+	{ coefficient = 1, offset = 0 } = {},
+) =>
+	formLinearFn({
+		coefficient,
+		offset: coefficient * attemptOffset + offset,
+	});

package/tsconfig.esnext.json

@@ -1,7 +1,7 @@
 {
-    "extends": "./tsconfig.json",
-    "compilerOptions": {
-        "outDir": "./lib",
-        "module": "esnext"
-    },
-}
+	"extends": "./tsconfig.json",
+	"compilerOptions": {
+		"outDir": "./lib",
+		"module": "esnext",
+	},
+}

package/tsconfig.json

@@ -1,14 +1,10 @@
 {
-    "extends": "@fluidframework/build-common/ts-common-config.json",
-    "compilerOptions": {
-        "composite": true,
-        "rootDir": "./src",
-        "outDir": "./dist"
-    },
-    "include": [
-        "src/**/*"
-    ],
-    "exclude": [
-        "src/test/**/*"
-    ]
-}
+	"extends": "@fluidframework/build-common/ts-common-config.json",
+	"compilerOptions": {
+		"composite": true,
+		"rootDir": "./src",
+		"outDir": "./dist",
+	},
+	"include": ["src/**/*"],
+	"exclude": ["src/test/**/*"],
+}

package/dist/batchManager.d.ts

@@ -1,42 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ITelemetryLogger } from "@fluidframework/common-definitions";
-import { IBatchMessage } from "@fluidframework/container-definitions";
-import { ContainerRuntimeMessage, ICompressionRuntimeOptions } from "./containerRuntime";
-/**
- * Message type used by BatchManager
- */
-export declare type BatchMessage = IBatchMessage & {
-    localOpMetadata: unknown;
-    deserializedContent: ContainerRuntimeMessage;
-    referenceSequenceNumber: number;
-};
-export interface IBatchManagerOptions {
-    readonly hardLimit: number;
-    readonly softLimit?: number;
-    readonly compressionOptions?: ICompressionRuntimeOptions;
-}
-/**
- * Helper class that manages partial batch & rollback.
- */
-export declare class BatchManager {
-    readonly logger: ITelemetryLogger;
-    readonly options: IBatchManagerOptions;
-    private readonly opCompressor;
-    private pendingBatch;
-    private batchContentSize;
-    get length(): number;
-    constructor(logger: ITelemetryLogger, options: IBatchManagerOptions);
-    push(message: BatchMessage): boolean;
-    get empty(): boolean;
-    popBatch(): BatchMessage[];
-    /**
-     * Capture the pending state at this point
-     */
-    checkpoint(): {
-        rollback: (process: (message: BatchMessage) => void) => void;
-    };
-}
-//# sourceMappingURL=batchManager.d.ts.map

package/dist/batchManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"batchManager.d.ts","sourceRoot":"","sources":["../src/batchManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,uCAAuC,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,0BAA0B,EAAE,MAAM,oBAAoB,CAAC;AAGzF;;GAEG;AACH,oBAAY,YAAY,GAAG,aAAa,GAAG;IACvC,eAAe,EAAE,OAAO,CAAC;IACzB,mBAAmB,EAAE,uBAAuB,CAAC;IAC7C,uBAAuB,EAAE,MAAM,CAAC;CACnC,CAAC;AAEF,MAAM,WAAW,oBAAoB;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,kBAAkB,CAAC,EAAE,0BAA0B,CAAC;CAC5D;AAED;;GAEG;AACH,qBAAa,YAAY;aAOO,MAAM,EAAE,gBAAgB;aAAkB,OAAO,EAAE,oBAAoB;IANnG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,gBAAgB,CAAK;IAE7B,IAAW,MAAM,WAAuC;gBAE5B,MAAM,EAAE,gBAAgB,EAAkB,OAAO,EAAE,oBAAoB;IAI5F,IAAI,CAAC,OAAO,EAAE,YAAY,GAAG,OAAO;IAiC3C,IAAW,KAAK,YAA6C;IAEtD,QAAQ;IAef;;OAEG;IACI,UAAU;sCAGqB,YAAY,KAAK,IAAI;;CAY9D"}

package/dist/batchManager.js

@@ -1,83 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BatchManager = void 0;
-const opCompressor_1 = require("./opCompressor");
-/**
- * Helper class that manages partial batch & rollback.
- */
-class BatchManager {
-    constructor(logger, options) {
-        this.logger = logger;
-        this.options = options;
-        this.pendingBatch = [];
-        this.batchContentSize = 0;
-        this.opCompressor = new opCompressor_1.OpCompressor(logger);
-    }
-    get length() { return this.pendingBatch.length; }
-    push(message) {
-        var _a, _b, _c, _d, _e, _f;
-        const contentSize = this.batchContentSize + ((_b = (_a = message.contents) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0);
-        const opCount = this.pendingBatch.length;
-        // Attempt to estimate batch size, aka socket message size.
-        // Each op has pretty large envelope, estimating to be 200 bytes.
-        // Also content will be strigified, and that adds a lot of overhead due to a lot of escape characters.
-        // Not taking it into account, as compression work should help there - compressed payload will be
-        // initially stored as base64, and that requires only 2 extra escape characters.
-        const socketMessageSize = contentSize + 200 * opCount;
-        // If we were provided soft limit, check for exceeding it.
-        // But only if we have any ops, as the intention here is to flush existing ops (on exceeding this limit)
-        // and start over. That's not an option if we have no ops.
-        // If compression is enabled, the soft and hard limit are ignored and the message will be pushed anyways.
-        // Cases where the message is still too large will be handled by the maxConsecutiveReconnects path.
-        if (this.options.softLimit !== undefined
-            && this.length > 0
-            && socketMessageSize >= this.options.softLimit
-            && Infinity === ((_d = (_c = this.options.compressionOptions) === null || _c === void 0 ? void 0 : _c.minimumBatchSizeInBytes) !== null && _d !== void 0 ? _d : Infinity)) {
-            return false;
-        }
-        if (socketMessageSize >= this.options.hardLimit
-            && Infinity === ((_f = (_e = this.options.compressionOptions) === null || _e === void 0 ? void 0 : _e.minimumBatchSizeInBytes) !== null && _f !== void 0 ? _f : Infinity)) {
-            return false;
-        }
-        this.batchContentSize = contentSize;
-        this.pendingBatch.push(message);
-        return true;
-    }
-    get empty() { return this.pendingBatch.length === 0; }
-    popBatch() {
-        const batch = this.pendingBatch;
-        const size = this.batchContentSize;
-        this.pendingBatch = [];
-        this.batchContentSize = 0;
-        if (batch.length > 0
-            && this.options.compressionOptions !== undefined
-            && this.options.compressionOptions.minimumBatchSizeInBytes < size) {
-            return this.opCompressor.compressBatch(batch, size);
-        }
-        return batch;
-    }
-    /**
-     * Capture the pending state at this point
-     */
-    checkpoint() {
-        const startPoint = this.pendingBatch.length;
-        return {
-            rollback: (process) => {
-                var _a, _b;
-                for (let i = this.pendingBatch.length; i > startPoint;) {
-                    i--;
-                    const message = this.pendingBatch[i];
-                    this.batchContentSize -= (_b = (_a = message.contents) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0;
-                    process(message);
-                }
-                this.pendingBatch.length = startPoint;
-            },
-        };
-    }
-}
-exports.BatchManager = BatchManager;
-//# sourceMappingURL=batchManager.js.map

package/dist/batchManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"batchManager.js","sourceRoot":"","sources":["../src/batchManager.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAKH,iDAA8C;AAiB9C;;GAEG;AACH,MAAa,YAAY;IAOrB,YAA4B,MAAwB,EAAkB,OAA6B;QAAvE,WAAM,GAAN,MAAM,CAAkB;QAAkB,YAAO,GAAP,OAAO,CAAsB;QAL3F,iBAAY,GAAoB,EAAE,CAAC;QACnC,qBAAgB,GAAG,CAAC,CAAC;QAKzB,IAAI,CAAC,YAAY,GAAG,IAAI,2BAAY,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAJD,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAMjD,IAAI,CAAC,OAAqB;;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,GAAG,CAAC,MAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,MAAM,mCAAI,CAAC,CAAC,CAAC;QAC5E,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QAEzC,2DAA2D;QAC3D,iEAAiE;QACjE,sGAAsG;QACtG,iGAAiG;QACjG,gFAAgF;QAChF,MAAM,iBAAiB,GAAG,WAAW,GAAG,GAAG,GAAG,OAAO,CAAC;QAEtD,0DAA0D;QAC1D,wGAAwG;QACxG,0DAA0D;QAC1D,yGAAyG;QACzG,mGAAmG;QACnG,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS;eACjC,IAAI,CAAC,MAAM,GAAG,CAAC;eACf,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;eAC3C,QAAQ,KAAK,CAAC,MAAA,MAAA,IAAI,CAAC,OAAO,CAAC,kBAAkB,0CAAE,uBAAuB,mCAAI,QAAQ,CAAC,EAAE;YACxF,OAAO,KAAK,CAAC;SAChB;QAED,IAAI,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;eACxC,QAAQ,KAAK,CAAC,MAAA,MAAA,IAAI,CAAC,OAAO,CAAC,kBAAkB,0CAAE,uBAAuB,mCAAI,QAAQ,CAAC,EAAE;YACxF,OAAO,KAAK,CAAC;SAChB;QAED,IAAI,CAAC,gBAAgB,GAAG,WAAW,CAAC;QACpC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;IAEtD,QAAQ;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAE1B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;eACb,IAAI,CAAC,OAAO,CAAC,kBAAkB,KAAK,SAAS;eAC7C,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,uBAAuB,GAAG,IAAI,EAAE;YACnE,OAAO,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;SACvD;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,UAAU;QACb,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QAC5C,OAAO;YACH,QAAQ,EAAE,CAAC,OAAwC,EAAE,EAAE;;gBACnD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,GAAG;oBACpD,CAAC,EAAE,CAAC;oBACJ,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oBACrC,IAAI,CAAC,gBAAgB,IAAI,MAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,MAAM,mCAAI,CAAC,CAAC;oBACvD,OAAO,CAAC,OAAO,CAAC,CAAC;iBACpB;gBAED,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,UAAU,CAAC;YAC1C,CAAC;SACJ,CAAC;IACN,CAAC;CACJ;AA/ED,oCA+EC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { IBatchMessage } from \"@fluidframework/container-definitions\";\nimport { ContainerRuntimeMessage, ICompressionRuntimeOptions } from \"./containerRuntime\";\nimport { OpCompressor } from \"./opCompressor\";\n\n/**\n * Message type used by BatchManager\n */\nexport type BatchMessage = IBatchMessage & {\n    localOpMetadata: unknown;\n    deserializedContent: ContainerRuntimeMessage;\n    referenceSequenceNumber: number;\n};\n\nexport interface IBatchManagerOptions {\n    readonly hardLimit: number;\n    readonly softLimit?: number;\n    readonly compressionOptions?: ICompressionRuntimeOptions;\n}\n\n/**\n * Helper class that manages partial batch & rollback.\n */\nexport class BatchManager {\n    private readonly opCompressor: OpCompressor;\n    private pendingBatch: BatchMessage [] = [];\n    private batchContentSize = 0;\n\n    public get length() { return this.pendingBatch.length; }\n\n    constructor(public readonly logger: ITelemetryLogger, public readonly options: IBatchManagerOptions) {\n        this.opCompressor = new OpCompressor(logger);\n    }\n\n    public push(message: BatchMessage): boolean {\n        const contentSize = this.batchContentSize + (message.contents?.length ?? 0);\n        const opCount = this.pendingBatch.length;\n\n        // Attempt to estimate batch size, aka socket message size.\n        // Each op has pretty large envelope, estimating to be 200 bytes.\n        // Also content will be strigified, and that adds a lot of overhead due to a lot of escape characters.\n        // Not taking it into account, as compression work should help there - compressed payload will be\n        // initially stored as base64, and that requires only 2 extra escape characters.\n        const socketMessageSize = contentSize + 200 * opCount;\n\n        // If we were provided soft limit, check for exceeding it.\n        // But only if we have any ops, as the intention here is to flush existing ops (on exceeding this limit)\n        // and start over. That's not an option if we have no ops.\n        // If compression is enabled, the soft and hard limit are ignored and the message will be pushed anyways.\n        // Cases where the message is still too large will be handled by the maxConsecutiveReconnects path.\n        if (this.options.softLimit !== undefined\n            && this.length > 0\n            && socketMessageSize >= this.options.softLimit\n            && Infinity === (this.options.compressionOptions?.minimumBatchSizeInBytes ?? Infinity)) {\n            return false;\n        }\n\n        if (socketMessageSize >= this.options.hardLimit\n            && Infinity === (this.options.compressionOptions?.minimumBatchSizeInBytes ?? Infinity)) {\n            return false;\n        }\n\n        this.batchContentSize = contentSize;\n        this.pendingBatch.push(message);\n        return true;\n    }\n\n    public get empty() { return this.pendingBatch.length === 0; }\n\n    public popBatch() {\n        const batch = this.pendingBatch;\n        const size = this.batchContentSize;\n        this.pendingBatch = [];\n        this.batchContentSize = 0;\n\n        if (batch.length > 0\n            && this.options.compressionOptions !== undefined\n            && this.options.compressionOptions.minimumBatchSizeInBytes < size) {\n            return this.opCompressor.compressBatch(batch, size);\n        }\n\n        return batch;\n    }\n\n    /**\n     * Capture the pending state at this point\n     */\n    public checkpoint() {\n        const startPoint = this.pendingBatch.length;\n        return {\n            rollback: (process: (message: BatchMessage) => void) => {\n                for (let i = this.pendingBatch.length; i > startPoint;) {\n                    i--;\n                    const message = this.pendingBatch[i];\n                    this.batchContentSize -= message.contents?.length ?? 0;\n                    process(message);\n                }\n\n                this.pendingBatch.length = startPoint;\n            },\n        };\n    }\n}\n"]}

package/dist/opCompressor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"opCompressor.d.ts","sourceRoot":"","sources":["../src/opCompressor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AAItE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;GAIG;AACH,qBAAa,YAAY;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxB,OAAO,CAAC,oBAAoB,CAAK;gBAErB,MAAM,EAAE,gBAAgB;IAI7B,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,cAAc,EAAE,MAAM,GAAG,YAAY,EAAE;CAiCtF"}

package/dist/opCompressor.js

@@ -1,50 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.OpCompressor = void 0;
-const common_utils_1 = require("@fluidframework/common-utils");
-const telemetry_utils_1 = require("@fluidframework/telemetry-utils");
-const lz4js_1 = require("lz4js");
-const containerRuntime_1 = require("./containerRuntime");
-/**
- * Compresses batches of ops. It generates a single compressed op that contains
- * the contents of each op in the batch. It then submits empty ops for each original
- * op to reserve sequence numbers.
- */
-class OpCompressor {
-    constructor(logger) {
-        this.compressedBatchCount = 0;
-        this.logger = telemetry_utils_1.ChildLogger.create(logger, "OpCompressor");
-    }
-    compressBatch(batch, originalLength) {
-        const batchToSend = [];
-        this.compressedBatchCount++;
-        const batchedContents = [];
-        for (const message of batch) {
-            batchedContents.push(message.deserializedContent);
-        }
-        const compressionStart = Date.now();
-        const contentsAsBuffer = new TextEncoder().encode(JSON.stringify(batchedContents));
-        const compressedContents = (0, lz4js_1.compress)(contentsAsBuffer);
-        const compressedContent = common_utils_1.IsoBuffer.from(compressedContents).toString("base64");
-        const duration = Date.now() - compressionStart;
-        if (originalLength > 200000 || this.compressedBatchCount % 100) {
-            this.logger.sendPerformanceEvent({
-                eventName: "CompressedBatch",
-                duration,
-                sizeBeforeCompression: originalLength,
-                sizeAfterCompression: compressedContent.length,
-            });
-        }
-        batchToSend.push(Object.assign(Object.assign({}, batch[0]), { contents: JSON.stringify({ packedContents: compressedContent }), metadata: Object.assign(Object.assign({}, batch[0].metadata), { compressed: true }), compression: containerRuntime_1.CompressionAlgorithms.lz4 }));
-        for (const message of batch.slice(1)) {
-            batchToSend.push(Object.assign(Object.assign({}, message), { contents: undefined }));
-        }
-        return batchToSend;
-    }
-}
-exports.OpCompressor = OpCompressor;
-//# sourceMappingURL=opCompressor.js.map

package/dist/opCompressor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"opCompressor.js","sourceRoot":"","sources":["../src/opCompressor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,+DAAyD;AACzD,qEAA8D;AAC9D,iCAAiC;AAEjC,yDAAoF;AAEpF;;;;GAIG;AACH,MAAa,YAAY;IAIrB,YAAY,MAAwB;QAF5B,yBAAoB,GAAG,CAAC,CAAC;QAG7B,IAAI,CAAC,MAAM,GAAG,6BAAW,CAAC,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC7D,CAAC;IAEM,aAAa,CAAC,KAAqB,EAAE,cAAsB;QAC9D,MAAM,WAAW,GAAmB,EAAE,CAAC;QACvC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC5B,MAAM,eAAe,GAA8B,EAAE,CAAC;QACtD,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE;YACzB,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;SACrD;QAED,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,gBAAgB,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC;QACnF,MAAM,kBAAkB,GAAG,IAAA,gBAAQ,EAAC,gBAAgB,CAAC,CAAC;QACtD,MAAM,iBAAiB,GAAG,wBAAS,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAChF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,gBAAgB,CAAC;QAE/C,IAAI,cAAc,GAAG,MAAM,IAAI,IAAI,CAAC,oBAAoB,GAAG,GAAG,EAAE;YAC5D,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC;gBAC7B,SAAS,EAAE,iBAAiB;gBAC5B,QAAQ;gBACR,qBAAqB,EAAE,cAAc;gBACrC,oBAAoB,EAAE,iBAAiB,CAAC,MAAM;aACjD,CAAC,CAAC;SACN;QAED,WAAW,CAAC,IAAI,iCAAM,KAAK,CAAC,CAAC,CAAC,KAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,iBAAiB,EAAE,CAAC,EAC5E,QAAQ,kCAAO,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAE,UAAU,EAAE,IAAI,KAClD,WAAW,EAAE,wCAAqB,CAAC,GAAG,IAAG,CAAC;QAE7D,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAClC,WAAW,CAAC,IAAI,iCAAM,OAAO,KAAE,QAAQ,EAAE,SAAS,IAAG,CAAC;SACzD;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;CACJ;AAzCD,oCAyCC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { IsoBuffer } from \"@fluidframework/common-utils\";\nimport { ChildLogger } from \"@fluidframework/telemetry-utils\";\nimport { compress } from \"lz4js\";\nimport { BatchMessage } from \"./batchManager\";\nimport { CompressionAlgorithms, ContainerRuntimeMessage } from \"./containerRuntime\";\n\n/**\n * Compresses batches of ops. It generates a single compressed op that contains\n * the contents of each op in the batch. It then submits empty ops for each original\n * op to reserve sequence numbers.\n */\nexport class OpCompressor {\n    private readonly logger;\n    private compressedBatchCount = 0;\n\n    constructor(logger: ITelemetryLogger) {\n        this.logger = ChildLogger.create(logger, \"OpCompressor\");\n    }\n\n    public compressBatch(batch: BatchMessage[], originalLength: number): BatchMessage[] {\n        const batchToSend: BatchMessage[] = [];\n        this.compressedBatchCount++;\n        const batchedContents: ContainerRuntimeMessage[] = [];\n        for (const message of batch) {\n            batchedContents.push(message.deserializedContent);\n        }\n\n        const compressionStart = Date.now();\n        const contentsAsBuffer = new TextEncoder().encode(JSON.stringify(batchedContents));\n        const compressedContents = compress(contentsAsBuffer);\n        const compressedContent = IsoBuffer.from(compressedContents).toString(\"base64\");\n        const duration = Date.now() - compressionStart;\n\n        if (originalLength > 200000 || this.compressedBatchCount % 100) {\n            this.logger.sendPerformanceEvent({\n                eventName: \"CompressedBatch\",\n                duration,\n                sizeBeforeCompression: originalLength,\n                sizeAfterCompression: compressedContent.length,\n            });\n        }\n\n        batchToSend.push({ ...batch[0], contents: JSON.stringify({ packedContents: compressedContent }),\n                           metadata: { ...batch[0].metadata, compressed: true },\n                           compression: CompressionAlgorithms.lz4 });\n\n        for (const message of batch.slice(1)) {\n            batchToSend.push({ ...message, contents: undefined });\n        }\n\n        return batchToSend;\n    }\n}\n"]}

package/dist/opDecompressor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"opDecompressor.d.ts","sourceRoot":"","sources":["../src/opDecompressor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AAIjF;;;;;;;GAOG;AACH,qBAAa,cAAc;IACvB,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,mBAAmB,CAAkB;IAC7C,OAAO,CAAC,cAAc,CAAK;IAEpB,cAAc,CAAC,OAAO,EAAE,yBAAyB,GAAG,yBAAyB;CA0DvF"}

package/dist/opDecompressor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"opDecompressor.js","sourceRoot":"","sources":["../src/opDecompressor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,iCAAmC;AAEnC,+DAAqF;AACrF,wBAA0C;AAE1C;;;;;;;GAOG;AACH,MAAa,cAAc;IAA3B;QACY,gBAAW,GAAG,KAAK,CAAC;QAEpB,mBAAc,GAAG,CAAC,CAAC;IA4D/B,CAAC;IA1DU,cAAc,CAAC,OAAkC;;QACpD,6EAA6E;QAC7E,0EAA0E;QAC1E,4EAA4E;QAC5E,WAAW;QACX,IAAI,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,KAAK,MAAK,IAAI;eAC7B,CAAC,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,UAAU,KAAI,OAAO,CAAC,WAAW,KAAK,SAAS,CAAC,EAAE;YACxE,kCAAkC;YAClC,IAAA,qBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,KAAK,EAAE,wCAAwC,CAAC,CAAC;YAC7E,IAAI,OAAO,CAAC,WAAW,EAAE;gBACrB,0DAA0D;gBAC1D,IAAA,qBAAM,EAAC,OAAO,CAAC,WAAW,KAAK,wBAAqB,CAAC,GAAG,EAChD,2DAA2D,CAAC,CAAC;aACxE;YAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YAExB,MAAM,QAAQ,GAAG,wBAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;YAC3E,MAAM,mBAAmB,GAAG,IAAA,kBAAU,EAAC,QAAQ,CAAC,CAAC;YACjD,MAAM,UAAU,GAAG,IAAA,iCAAkB,EAAC,mBAAmB,CAAC,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACrC,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;YAEjC,uCAAY,OAAO,KAAE,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,IAAG;SACpF;QAED,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS,IAAI,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,KAAK,MAAK,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACrG,mCAAmC;YACnC,uCAAY,OAAO,KAAE,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,IAAG;SACpF;QAED,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS,IAAI,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,KAAK,MAAK,KAAK,EAAE;YAC7E,0BAA0B;YAC1B,MAAM,aAAa,mCAAQ,OAAO,KACV,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,GAAE,CAAC;YAEpF,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;YACzB,IAAI,CAAC,mBAAmB,GAAG,SAAS,CAAC;YACrC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YAExB,OAAO,aAAa,CAAC;SACxB;QAED,IAAI,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,KAAK,MAAK,SAAS;YACrC,CAAC,CAAA,MAAA,OAAO,CAAC,QAAQ,0CAAE,UAAU,KAAI,OAAO,CAAC,WAAW,KAAK,wBAAqB,CAAC,GAAG,CAAC,EAAE;YACrF,4BAA4B;YAC5B,IAAA,qBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,KAAK,EAAE,2DAA2D,CAAC,CAAC;YAEhG,MAAM,QAAQ,GAAG,wBAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;YAC3E,MAAM,mBAAmB,GAAG,IAAA,kBAAU,EAAC,QAAQ,CAAC,CAAC;YACjD,MAAM,UAAU,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAErC,uCAAY,OAAO,KAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,IAAG;SAC7C;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AA/DD,wCA+DC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { decompress } from \"lz4js\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport { assert, IsoBuffer, Uint8ArrayToString } from \"@fluidframework/common-utils\";\nimport { CompressionAlgorithms } from \".\";\n\n/**\n * State machine that \"unrolls\" contents of compressed batches of ops after decompressing them.\n * This class relies on some implicit contracts defined below:\n * 1. A compressed batch will have its first message with batch metadata set to true and compressed set to true\n * 2. Messages in the middle of a compressed batch will have neither batch metadata nor the compression property set\n * 3. The final message of a batch will have batch metadata set to false\n * 4. An individually compressed op will have undefined batch metadata and compression set to true\n */\nexport class OpDecompressor {\n    private activeBatch = false;\n    private rootMessageContents: any | undefined;\n    private processedCount = 0;\n\n    public processMessage(message: ISequencedDocumentMessage): ISequencedDocumentMessage {\n        // We're checking for compression = true or top level compression property so\n        // that we can enable compression without waiting on all ordering services\n        // to pick up protocol change. Eventually only the top level property should\n        // be used.\n        if (message.metadata?.batch === true\n            && (message.metadata?.compressed || message.compression !== undefined)) {\n            // Beginning of a compressed batch\n            assert(this.activeBatch === false, \"shouldn't have multiple active batches\");\n            if (message.compression) {\n                // lz4 is the only supported compression algorithm for now\n                assert(message.compression === CompressionAlgorithms.lz4,\n                        \"lz4 is currently the only supported compression algorithm\");\n            }\n\n            this.activeBatch = true;\n\n            const contents = IsoBuffer.from(message.contents.packedContents, \"base64\");\n            const decompressedMessage = decompress(contents);\n            const intoString = Uint8ArrayToString(decompressedMessage);\n            const asObj = JSON.parse(intoString);\n            this.rootMessageContents = asObj;\n\n            return { ...message, contents: this.rootMessageContents[this.processedCount++] };\n        }\n\n        if (this.rootMessageContents !== undefined && message.metadata?.batch === undefined && this.activeBatch) {\n            // Continuation of compressed batch\n            return { ...message, contents: this.rootMessageContents[this.processedCount++] };\n        }\n\n        if (this.rootMessageContents !== undefined && message.metadata?.batch === false) {\n            // End of compressed batch\n            const returnMessage = { ...message,\n                                    contents: this.rootMessageContents[this.processedCount++] };\n\n            this.activeBatch = false;\n            this.rootMessageContents = undefined;\n            this.processedCount = 0;\n\n            return returnMessage;\n        }\n\n        if (message.metadata?.batch === undefined &&\n            (message.metadata?.compressed || message.compression === CompressionAlgorithms.lz4)) {\n            // Single compressed message\n            assert(this.activeBatch === false, \"shouldn't receive compressed message in middle of a batch\");\n\n            const contents = IsoBuffer.from(message.contents.packedContents, \"base64\");\n            const decompressedMessage = decompress(contents);\n            const intoString = new TextDecoder().decode(decompressedMessage);\n            const asObj = JSON.parse(intoString);\n\n            return { ...message, contents: asObj[0] };\n        }\n\n        return message;\n    }\n}\n"]}

package/lib/batchManager.d.ts

@@ -1,42 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ITelemetryLogger } from "@fluidframework/common-definitions";
-import { IBatchMessage } from "@fluidframework/container-definitions";
-import { ContainerRuntimeMessage, ICompressionRuntimeOptions } from "./containerRuntime";
-/**
- * Message type used by BatchManager
- */
-export declare type BatchMessage = IBatchMessage & {
-    localOpMetadata: unknown;
-    deserializedContent: ContainerRuntimeMessage;
-    referenceSequenceNumber: number;
-};
-export interface IBatchManagerOptions {
-    readonly hardLimit: number;
-    readonly softLimit?: number;
-    readonly compressionOptions?: ICompressionRuntimeOptions;
-}
-/**
- * Helper class that manages partial batch & rollback.
- */
-export declare class BatchManager {
-    readonly logger: ITelemetryLogger;
-    readonly options: IBatchManagerOptions;
-    private readonly opCompressor;
-    private pendingBatch;
-    private batchContentSize;
-    get length(): number;
-    constructor(logger: ITelemetryLogger, options: IBatchManagerOptions);
-    push(message: BatchMessage): boolean;
-    get empty(): boolean;
-    popBatch(): BatchMessage[];
-    /**
-     * Capture the pending state at this point
-     */
-    checkpoint(): {
-        rollback: (process: (message: BatchMessage) => void) => void;
-    };
-}
-//# sourceMappingURL=batchManager.d.ts.map

package/lib/batchManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"batchManager.d.ts","sourceRoot":"","sources":["../src/batchManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,uCAAuC,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,0BAA0B,EAAE,MAAM,oBAAoB,CAAC;AAGzF;;GAEG;AACH,oBAAY,YAAY,GAAG,aAAa,GAAG;IACvC,eAAe,EAAE,OAAO,CAAC;IACzB,mBAAmB,EAAE,uBAAuB,CAAC;IAC7C,uBAAuB,EAAE,MAAM,CAAC;CACnC,CAAC;AAEF,MAAM,WAAW,oBAAoB;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,kBAAkB,CAAC,EAAE,0BAA0B,CAAC;CAC5D;AAED;;GAEG;AACH,qBAAa,YAAY;aAOO,MAAM,EAAE,gBAAgB;aAAkB,OAAO,EAAE,oBAAoB;IANnG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,gBAAgB,CAAK;IAE7B,IAAW,MAAM,WAAuC;gBAE5B,MAAM,EAAE,gBAAgB,EAAkB,OAAO,EAAE,oBAAoB;IAI5F,IAAI,CAAC,OAAO,EAAE,YAAY,GAAG,OAAO;IAiC3C,IAAW,KAAK,YAA6C;IAEtD,QAAQ;IAef;;OAEG;IACI,UAAU;sCAGqB,YAAY,KAAK,IAAI;;CAY9D"}