@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/simple-tree/types.d.ts

@@ -0,0 +1,243 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { TreeValue } from "../core";
+import { RestrictiveReadonlyRecord } from "../util";
+import { FieldKind, FieldKinds, AllowedTypes, Any, FieldNodeSchema, TreeFieldSchema, InternalTypedSchemaTypes, LeafNodeSchema, MapNodeSchema, ObjectNodeSchema, TreeNodeSchema, AssignableFieldKinds } from "../feature-libraries";
+import { IterableTreeListContent, TreeListNodeOld } from "./treeListNode";
+/**
+ * Type alias to document which values are un-hydrated.
+ *
+ * Un-hydrated values are nodes produced from schema's create functions that haven't been inserted into a tree yet.
+ *
+ * Since un-hydrated nodes become hydrated when inserted, strong typing can't be used to distinguish them.
+ * This no-op wrapper is used instead.
+ * @beta
+ */
+export type Unhydrated<T> = T;
+/**
+ * A non-{@link LeafNodeSchema|leaf} SharedTree node. Includes objects, lists, and maps.
+ *
+ * @remarks
+ * Base type which all nodes extend.
+ * @privateRemarks
+ * Adding a member which all nodes have, like a type symbol, would produce much strong typing for this.
+ * @beta
+ */
+export declare class TreeNode {
+}
+/**
+ * A generic List type, used to defined types like {@link (TreeArrayNode:interface)}.
+ * @beta
+ */
+export interface TreeArrayNodeBase<out T, in TNew, in TMoveFrom> extends ReadonlyArray<T> {
+    /**
+     * Inserts new item(s) at a specified location.
+     * @param index - The index at which to insert `value`.
+     * @param value - The content to insert.
+     * @throws Throws if `index` is not in the range [0, `list.length`).
+     */
+    insertAt(index: number, ...value: (TNew | IterableTreeListContent<TNew>)[]): void;
+    /**
+     * Inserts new item(s) at the start of the list.
+     * @param value - The content to insert.
+     */
+    insertAtStart(...value: (TNew | IterableTreeListContent<TNew>)[]): void;
+    /**
+     * Inserts new item(s) at the end of the list.
+     * @param value - The content to insert.
+     */
+    insertAtEnd(...value: (TNew | IterableTreeListContent<TNew>)[]): void;
+    /**
+     * Removes the item at the specified location.
+     * @param index - The index at which to remove the item.
+     * @throws Throws if `index` is not in the range [0, `list.length`).
+     */
+    removeAt(index: number): void;
+    /**
+     * Removes all items between the specified indices.
+     * @param start - The starting index of the range to remove (inclusive). Defaults to the start of the list.
+     * @param end - The ending index of the range to remove (exclusive).
+     * @throws Throws if `start` is not in the range [0, `list.length`).
+     * @throws Throws if `end` is less than `start`.
+     * If `end` is not supplied or is greater than the length of the list, all items after `start` are deleted.
+     */
+    removeRange(start?: number, end?: number): void;
+    /**
+     * Moves the specified item to the start of the list.
+     * @param sourceIndex - The index of the item to move.
+     * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).
+     */
+    moveToStart(sourceIndex: number): void;
+    /**
+     * Moves the specified item to the start of the list.
+     * @param sourceIndex - The index of the item to move.
+     * @param source - The source list to move the item out of.
+     * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).
+     */
+    moveToStart(sourceIndex: number, source: TMoveFrom): void;
+    /**
+     * Moves the specified item to the end of the list.
+     * @param sourceIndex - The index of the item to move.
+     * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).
+     */
+    moveToEnd(sourceIndex: number): void;
+    /**
+     * Moves the specified item to the end of the list.
+     * @param sourceIndex - The index of the item to move.
+     * @param source - The source list to move the item out of.
+     * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).
+     */
+    moveToEnd(sourceIndex: number, source: TMoveFrom): void;
+    /**
+     * Moves the specified item to the desired location in the list.
+     * @param index - The index to move the item to.
+     * This is based on the state of the list before moving the source item.
+     * @param sourceIndex - The index of the item to move.
+     * @throws Throws if any of the input indices are not in the range [0, `list.length`).
+     */
+    moveToIndex(index: number, sourceIndex: number): void;
+    /**
+     * Moves the specified item to the desired location in the list.
+     * @param index - The index to move the item to.
+     * @param sourceIndex - The index of the item to move.
+     * @param source - The source list to move the item out of.
+     * @throws Throws if any of the input indices are not in the range [0, `list.length`).
+     */
+    moveToIndex(index: number, sourceIndex: number, source: TMoveFrom): void;
+    /**
+     * Moves the specified items to the start of the list.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @throws Throws if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToStart(sourceStart: number, sourceEnd: number): void;
+    /**
+     * Moves the specified items to the start of the list.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @param source - The source list to move items out of.
+     * @throws Throws if the types of any of the items being moved are not allowed in the destination list,
+     * if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToStart(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;
+    /**
+     * Moves the specified items to the end of the list.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @throws Throws if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToEnd(sourceStart: number, sourceEnd: number): void;
+    /**
+     * Moves the specified items to the end of the list.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @param source - The source list to move items out of.
+     * @throws Throws if the types of any of the items being moved are not allowed in the destination list,
+     * if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToEnd(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;
+    /**
+     * Moves the specified items to the desired location within the list.
+     * @param index - The index to move the items to.
+     * This is based on the state of the list before moving the source items.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @throws Throws if any of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;
+    /**
+     * Moves the specified items to the desired location within the list.
+     * @param index - The index to move the items to.
+     * @param sourceStart - The starting index of the range to move (inclusive).
+     * @param sourceEnd - The ending index of the range to move (exclusive)
+     * @param source - The source list to move items out of.
+     * @throws Throws if the types of any of the items being moved are not allowed in the destination list,
+     * if any of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.
+     */
+    moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number, source: TMoveFrom): void;
+}
+/**
+ * An object which supports property-based access to fields.
+ */
+export type TreeObjectNode<TSchema extends ObjectNodeSchema> = TreeObjectNodeFields<TSchema["objectNodeFieldsObject"]>;
+/**
+ * Helper for generating the properties of a {@link TreeObjectNode}.
+ * @privateRemarks
+ * This type is composed of four subtypes for each mutually exclusive combination of "readonly" and "optional".
+ * If it were possible to map to getters and setters separately, the "readonly" cases would collapse, but this is not currently a feature in TS.
+ * See https://github.com/microsoft/TypeScript/issues/43826 for more details on this limitation.
+ */
+export type TreeObjectNodeFields<TFields extends RestrictiveReadonlyRecord<string, TreeFieldSchema>> = {
+    -readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? TFields[key]["kind"] extends typeof FieldKinds.optional ? key : never : never]?: TreeField<TFields[key]>;
+} & {
+    -readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? TFields[key]["kind"] extends typeof FieldKinds.optional ? never : key : never]-?: TreeField<TFields[key]>;
+} & {
+    readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? never : TFields[key]["kind"] extends typeof FieldKinds.optional ? key : never]?: TreeField<TFields[key]>;
+} & {
+    readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? never : TFields[key]["kind"] extends typeof FieldKinds.optional ? never : key]-?: TreeField<TFields[key]>;
+};
+/**
+ * A map of string keys to tree objects.
+ *
+ * @privateRemarks
+ * Add support for `clear` once we have established merge semantics for it.
+ *
+ */
+export interface TreeMapNode<TSchema extends MapNodeSchema = MapNodeSchema> extends TreeMapNodeBase<TreeField<TSchema["info"], "notEmpty">> {
+}
+/**
+ * A map of string keys to tree objects.
+ *
+ * @privateRemarks
+ * Add support for `clear` once we have established merge semantics for it.
+ *
+ * @beta
+ */
+export interface TreeMapNodeBase<TOut, TIn = TOut> extends ReadonlyMap<string, TOut> {
+    /**
+     * Adds or updates an entry in the map with a specified `key` and a `value`.
+     *
+     * @param key - The key of the element to add to the map.
+     * @param value - The value of the element to add to the map.
+     *
+     * @remarks
+     * Setting the value at a key to `undefined` is equivalent to calling {@link TreeMapNodeBase.delete} with that key.
+     */
+    set(key: string, value: TIn | undefined): void;
+    /**
+     * Removes the specified element from this map by its `key`.
+     *
+     * @remarks
+     * Note: unlike JavaScript's Map API, this method does not return a flag indicating whether or not the value was
+     * deleted.
+     *
+     * @privateRemarks
+     * Regarding the choice to not return a boolean: Since this data structure is distributed in nature, it isn't
+     * possible to tell whether or not the item was deleted as a result of this method call. Returning a "best guess"
+     * is more likely to create issues / promote bad usage patterns than offer useful information.
+     *
+     * @param key - The key of the element to remove from the map.
+     */
+    delete(key: string): void;
+}
+/**
+ * Given a field's schema, return the corresponding object in the proxy-based API.
+ */
+export type TreeField<TSchema extends TreeFieldSchema = TreeFieldSchema, Emptiness extends "maybeEmpty" | "notEmpty" = "maybeEmpty"> = TreeFieldInner<TSchema["kind"], TSchema["allowedTypes"], Emptiness>;
+/**
+ * Helper for implementing {@link TreeField}.
+ */
+export type TreeFieldInner<Kind extends FieldKind, TTypes extends AllowedTypes, Emptiness extends "maybeEmpty" | "notEmpty"> = Kind extends typeof FieldKinds.sequence ? never : Kind extends typeof FieldKinds.required ? TreeNodeUnion<TTypes> : Kind extends typeof FieldKinds.optional ? TreeNodeUnion<TTypes> | (Emptiness extends "notEmpty" ? never : undefined) : unknown;
+/**
+ * Given multiple node schema types, return the corresponding object type union in the proxy-based API.
+ */
+export type TreeNodeUnion<TTypes extends AllowedTypes> = TTypes extends readonly [Any] ? unknown : {
+    [Index in keyof TTypes]: TTypes[Index] extends InternalTypedSchemaTypes.LazyItem<infer InnerType> ? InnerType extends TreeNodeSchema ? TypedNode<InnerType> : never : never;
+}[number];
+/**
+ * Given a node's schema, return the corresponding object in the proxy-based API.
+ */
+export type TypedNode<TSchema extends TreeNodeSchema> = TSchema extends LeafNodeSchema ? TreeValue<TSchema["info"]> : TSchema extends MapNodeSchema ? TreeMapNode<TSchema> : TSchema extends FieldNodeSchema ? TreeListNodeOld<TSchema["info"]["allowedTypes"]> : TSchema extends ObjectNodeSchema ? TreeObjectNode<TSchema> : TreeNode;
+//# sourceMappingURL=types.d.ts.map

package/lib/simple-tree/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/simple-tree/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,yBAAyB,EAAE,MAAM,SAAS,CAAC;AACpD,OAAO,EACN,SAAS,EACT,UAAU,EACV,YAAY,EACZ,GAAG,EACH,eAAe,EACf,eAAe,EACf,wBAAwB,EACxB,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EACpB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,uBAAuB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE1E;;;;;;;;GAQG;AACH,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC;AAE9B;;;;;;;;GAQG;AAEH,qBAAa,QAAQ;CAAG;AAExB;;;GAGG;AACH,MAAM,WAAW,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACxF;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;IAElF;;;OAGG;IACH,aAAa,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;IAExE;;;OAGG;IACH,WAAW,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;IAEtE;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAE9B;;;;;;;OAOG;IACH,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAEhD;;;;OAIG;IACH,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAEvC;;;;;OAKG;IACH,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;IAE1D;;;;OAIG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAErC;;;;;OAKG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;IAExD;;;;;;OAMG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAEtD;;;;;;OAMG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;IAEzE;;;;;OAKG;IACH,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAE/D;;;;;;;OAOG;IACH,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;IAElF;;;;;OAKG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAE7D;;;;;;;OAOG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;IAEhF;;;;;;;OAOG;IACH,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAE9E;;;;;;;;OAQG;IACH,gBAAgB,CACf,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,SAAS,GACf,IAAI,CAAC;CACR;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,CAAC,OAAO,SAAS,gBAAgB,IAAI,oBAAoB,CAClF,OAAO,CAAC,wBAAwB,CAAC,CACjC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,oBAAoB,CAC/B,OAAO,SAAS,yBAAyB,CAAC,MAAM,EAAE,eAAe,CAAC,IAC/D;IAEH,CAAC,UAAU,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GACjF,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtD,GAAG,GACH,KAAK,GACN,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACnC,GAAG;IAEH,CAAC,UAAU,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GACjF,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtD,KAAK,GACL,GAAG,GACJ,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACpC,GAAG;IAEH,QAAQ,EAAE,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GAChF,KAAK,GACL,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,OAAO,UAAU,CAAC,QAAQ,GACvD,GAAG,GACH,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACnC,GAAG;IAEH,QAAQ,EAAE,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GAChF,KAAK,GACL,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,OAAO,UAAU,CAAC,QAAQ,GACvD,KAAK,GACL,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CAClC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW,CAAC,OAAO,SAAS,aAAa,GAAG,aAAa,CACzE,SAAQ,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;CAAG;AAEnE;;;;;;;GAOG;AACH,MAAM,WAAW,eAAe,CAAC,IAAI,EAAE,GAAG,GAAG,IAAI,CAAE,SAAQ,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC;IACnF;;;;;;;;OAQG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC;IAE/C;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,MAAM,SAAS,CACpB,OAAO,SAAS,eAAe,GAAG,eAAe,EAEjD,SAAS,SAAS,YAAY,GAAG,UAAU,GAAG,YAAY,IACvD,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,EAAE,SAAS,CAAC,CAAC;AAExE;;GAEG;AACH,MAAM,MAAM,cAAc,CACzB,IAAI,SAAS,SAAS,EACtB,MAAM,SAAS,YAAY,EAC3B,SAAS,SAAS,YAAY,GAAG,UAAU,IACxC,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACxC,KAAK,GACL,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACvC,aAAa,CAAC,MAAM,CAAC,GACrB,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACvC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,SAAS,UAAU,GAAG,KAAK,GAAG,SAAS,CAAC,GAC1E,OAAO,CAAC;AAEX;;GAEG;AACH,MAAM,MAAM,aAAa,CAAC,MAAM,SAAS,YAAY,IAAI,MAAM,SAAS,SAAS,CAAC,GAAG,CAAC,GACnF,OAAO,GACP;KAIC,KAAK,IAAI,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,wBAAwB,CAAC,QAAQ,CAC/E,MAAM,SAAS,CACf,GACE,SAAS,SAAS,cAAc,GAC/B,SAAS,CAAC,SAAS,CAAC,GACpB,KAAK,GACN,KAAK;CACP,CAAC,MAAM,CAAC,CAAC;AAEb;;GAEG;AACH,MAAM,MAAM,SAAS,CAAC,OAAO,SAAS,cAAc,IAAI,OAAO,SAAS,cAAc,GACnF,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAC1B,OAAO,SAAS,aAAa,GAC7B,WAAW,CAAC,OAAO,CAAC,GACpB,OAAO,SAAS,eAAe,GAC/B,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,CAAC,GAChD,OAAO,SAAS,gBAAgB,GAChC,cAAc,CAAC,OAAO,CAAC,GACvB,QAAQ,CAAC"}

package/lib/simple-tree/types.js

@@ -0,0 +1,17 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * A non-{@link LeafNodeSchema|leaf} SharedTree node. Includes objects, lists, and maps.
+ *
+ * @remarks
+ * Base type which all nodes extend.
+ * @privateRemarks
+ * Adding a member which all nodes have, like a type symbol, would produce much strong typing for this.
+ * @beta
+ */
+// eslint-disable-next-line @typescript-eslint/no-extraneous-class
+export class TreeNode {
+}
+//# sourceMappingURL=types.js.map

package/lib/simple-tree/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/simple-tree/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA+BH;;;;;;;;GAQG;AACH,kEAAkE;AAClE,MAAM,OAAO,QAAQ;CAAG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { TreeValue } from \"../core\";\nimport { RestrictiveReadonlyRecord } from \"../util\";\nimport {\n\tFieldKind,\n\tFieldKinds,\n\tAllowedTypes,\n\tAny,\n\tFieldNodeSchema,\n\tTreeFieldSchema,\n\tInternalTypedSchemaTypes,\n\tLeafNodeSchema,\n\tMapNodeSchema,\n\tObjectNodeSchema,\n\tTreeNodeSchema,\n\tAssignableFieldKinds,\n} from \"../feature-libraries\";\nimport { IterableTreeListContent, TreeListNodeOld } from \"./treeListNode\";\n\n/**\n * Type alias to document which values are un-hydrated.\n *\n * Un-hydrated values are nodes produced from schema's create functions that haven't been inserted into a tree yet.\n *\n * Since un-hydrated nodes become hydrated when inserted, strong typing can't be used to distinguish them.\n * This no-op wrapper is used instead.\n * @beta\n */\nexport type Unhydrated<T> = T;\n\n/**\n * A non-{@link LeafNodeSchema|leaf} SharedTree node. Includes objects, lists, and maps.\n *\n * @remarks\n * Base type which all nodes extend.\n * @privateRemarks\n * Adding a member which all nodes have, like a type symbol, would produce much strong typing for this.\n * @beta\n */\n// eslint-disable-next-line @typescript-eslint/no-extraneous-class\nexport class TreeNode {}\n\n/**\n * A generic List type, used to defined types like {@link (TreeArrayNode:interface)}.\n * @beta\n */\nexport interface TreeArrayNodeBase<out T, in TNew, in TMoveFrom> extends ReadonlyArray<T> {\n\t/**\n\t * Inserts new item(s) at a specified location.\n\t * @param index - The index at which to insert `value`.\n\t * @param value - The content to insert.\n\t * @throws Throws if `index` is not in the range [0, `list.length`).\n\t */\n\tinsertAt(index: number, ...value: (TNew | IterableTreeListContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the start of the list.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtStart(...value: (TNew | IterableTreeListContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the end of the list.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtEnd(...value: (TNew | IterableTreeListContent<TNew>)[]): void;\n\n\t/**\n\t * Removes the item at the specified location.\n\t * @param index - The index at which to remove the item.\n\t * @throws Throws if `index` is not in the range [0, `list.length`).\n\t */\n\tremoveAt(index: number): void;\n\n\t/**\n\t * Removes all items between the specified indices.\n\t * @param start - The starting index of the range to remove (inclusive). Defaults to the start of the list.\n\t * @param end - The ending index of the range to remove (exclusive).\n\t * @throws Throws if `start` is not in the range [0, `list.length`).\n\t * @throws Throws if `end` is less than `start`.\n\t * If `end` is not supplied or is greater than the length of the list, all items after `start` are deleted.\n\t */\n\tremoveRange(start?: number, end?: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the list.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).\n\t */\n\tmoveToStart(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the list.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source list to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).\n\t */\n\tmoveToStart(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the end of the list.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).\n\t */\n\tmoveToEnd(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the end of the list.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source list to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `list.length`).\n\t */\n\tmoveToEnd(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the list.\n\t * @param index - The index to move the item to.\n\t * This is based on the state of the list before moving the source item.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if any of the input indices are not in the range [0, `list.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the list.\n\t * @param index - The index to move the item to.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source list to move the item out of.\n\t * @throws Throws if any of the input indices are not in the range [0, `list.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the start of the list.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the start of the list.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source list to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination list,\n\t * if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the end of the list.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the end of the list.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source list to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination list,\n\t * if either of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the list.\n\t * @param index - The index to move the items to.\n\t * This is based on the state of the list before moving the source items.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if any of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the list.\n\t * @param index - The index to move the items to.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source list to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination list,\n\t * if any of the input indices are not in the range [0, `list.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: TMoveFrom,\n\t): void;\n}\n\n/**\n * An object which supports property-based access to fields.\n */\nexport type TreeObjectNode<TSchema extends ObjectNodeSchema> = TreeObjectNodeFields<\n\tTSchema[\"objectNodeFieldsObject\"]\n>;\n\n/**\n * Helper for generating the properties of a {@link TreeObjectNode}.\n * @privateRemarks\n * This type is composed of four subtypes for each mutually exclusive combination of \"readonly\" and \"optional\".\n * If it were possible to map to getters and setters separately, the \"readonly\" cases would collapse, but this is not currently a feature in TS.\n * See https://github.com/microsoft/TypeScript/issues/43826 for more details on this limitation.\n */\nexport type TreeObjectNodeFields<\n\tTFields extends RestrictiveReadonlyRecord<string, TreeFieldSchema>,\n> = {\n\t// Filter for properties that are both assignable and optional; mark them `-readonly` and `?`.\n\t-readonly [key in keyof TFields as TFields[key][\"kind\"] extends AssignableFieldKinds\n\t\t? TFields[key][\"kind\"] extends typeof FieldKinds.optional\n\t\t\t? key\n\t\t\t: never\n\t\t: never]?: TreeField<TFields[key]>;\n} & {\n\t// Filter for properties that are assignable but are not optional; mark them `-readonly` and `-?`.\n\t-readonly [key in keyof TFields as TFields[key][\"kind\"] extends AssignableFieldKinds\n\t\t? TFields[key][\"kind\"] extends typeof FieldKinds.optional\n\t\t\t? never\n\t\t\t: key\n\t\t: never]-?: TreeField<TFields[key]>;\n} & {\n\t// Filter for properties that are not assignable but are optional; mark them `readonly` and `?`.\n\treadonly [key in keyof TFields as TFields[key][\"kind\"] extends AssignableFieldKinds\n\t\t? never\n\t\t: TFields[key][\"kind\"] extends typeof FieldKinds.optional\n\t\t? key\n\t\t: never]?: TreeField<TFields[key]>;\n} & {\n\t// Filter for properties that are not assignable and are not optional; mark them `readonly` and `-?`.\n\treadonly [key in keyof TFields as TFields[key][\"kind\"] extends AssignableFieldKinds\n\t\t? never\n\t\t: TFields[key][\"kind\"] extends typeof FieldKinds.optional\n\t\t? never\n\t\t: key]-?: TreeField<TFields[key]>;\n};\n\n/**\n * A map of string keys to tree objects.\n *\n * @privateRemarks\n * Add support for `clear` once we have established merge semantics for it.\n *\n */\nexport interface TreeMapNode<TSchema extends MapNodeSchema = MapNodeSchema>\n\textends TreeMapNodeBase<TreeField<TSchema[\"info\"], \"notEmpty\">> {}\n\n/**\n * A map of string keys to tree objects.\n *\n * @privateRemarks\n * Add support for `clear` once we have established merge semantics for it.\n *\n * @beta\n */\nexport interface TreeMapNodeBase<TOut, TIn = TOut> extends ReadonlyMap<string, TOut> {\n\t/**\n\t * Adds or updates an entry in the map with a specified `key` and a `value`.\n\t *\n\t * @param key - The key of the element to add to the map.\n\t * @param value - The value of the element to add to the map.\n\t *\n\t * @remarks\n\t * Setting the value at a key to `undefined` is equivalent to calling {@link TreeMapNodeBase.delete} with that key.\n\t */\n\tset(key: string, value: TIn | undefined): void;\n\n\t/**\n\t * Removes the specified element from this map by its `key`.\n\t *\n\t * @remarks\n\t * Note: unlike JavaScript's Map API, this method does not return a flag indicating whether or not the value was\n\t * deleted.\n\t *\n\t * @privateRemarks\n\t * Regarding the choice to not return a boolean: Since this data structure is distributed in nature, it isn't\n\t * possible to tell whether or not the item was deleted as a result of this method call. Returning a \"best guess\"\n\t * is more likely to create issues / promote bad usage patterns than offer useful information.\n\t *\n\t * @param key - The key of the element to remove from the map.\n\t */\n\tdelete(key: string): void;\n}\n\n/**\n * Given a field's schema, return the corresponding object in the proxy-based API.\n */\nexport type TreeField<\n\tTSchema extends TreeFieldSchema = TreeFieldSchema,\n\t// If \"notEmpty\", then optional fields will unbox to their content (not their content | undefined)\n\tEmptiness extends \"maybeEmpty\" | \"notEmpty\" = \"maybeEmpty\",\n> = TreeFieldInner<TSchema[\"kind\"], TSchema[\"allowedTypes\"], Emptiness>;\n\n/**\n * Helper for implementing {@link TreeField}.\n */\nexport type TreeFieldInner<\n\tKind extends FieldKind,\n\tTTypes extends AllowedTypes,\n\tEmptiness extends \"maybeEmpty\" | \"notEmpty\",\n> = Kind extends typeof FieldKinds.sequence\n\t? never // Sequences are only supported underneath FieldNodes. See FieldNode case in `ProxyNode`.\n\t: Kind extends typeof FieldKinds.required\n\t? TreeNodeUnion<TTypes>\n\t: Kind extends typeof FieldKinds.optional\n\t? TreeNodeUnion<TTypes> | (Emptiness extends \"notEmpty\" ? never : undefined)\n\t: unknown;\n\n/**\n * Given multiple node schema types, return the corresponding object type union in the proxy-based API.\n */\nexport type TreeNodeUnion<TTypes extends AllowedTypes> = TTypes extends readonly [Any]\n\t? unknown\n\t: {\n\t\t\t// TODO: Is the the best way to write this type function? Can it be simplified?\n\t\t\t// This first maps the tuple of AllowedTypes to a tuple of node API types.\n\t\t\t// Then, it uses [number] to index arbitrarily into that tuple, effectively converting the type tuple into a type union.\n\t\t\t[Index in keyof TTypes]: TTypes[Index] extends InternalTypedSchemaTypes.LazyItem<\n\t\t\t\tinfer InnerType\n\t\t\t>\n\t\t\t\t? InnerType extends TreeNodeSchema\n\t\t\t\t\t? TypedNode<InnerType>\n\t\t\t\t\t: never\n\t\t\t\t: never;\n\t  }[number];\n\n/**\n * Given a node's schema, return the corresponding object in the proxy-based API.\n */\nexport type TypedNode<TSchema extends TreeNodeSchema> = TSchema extends LeafNodeSchema\n\t? TreeValue<TSchema[\"info\"]>\n\t: TSchema extends MapNodeSchema\n\t? TreeMapNode<TSchema>\n\t: TSchema extends FieldNodeSchema\n\t? TreeListNodeOld<TSchema[\"info\"][\"allowedTypes\"]>\n\t: TSchema extends ObjectNodeSchema\n\t? TreeObjectNode<TSchema>\n\t: TreeNode;\n"]}

package/lib/treeFactory.d.ts

@@ -0,0 +1,55 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { IChannelAttributes, IChannelFactory, IChannelServices, IFluidDataStoreRuntime } from "@fluidframework/datastore-definitions";
+import { IFluidHandle, IFluidLoadable } from "@fluidframework/core-interfaces";
+import { ITelemetryContext, ISummaryTreeWithStats, IExperimentalIncrementalSummaryContext, IGarbageCollectionData } from "@fluidframework/runtime-definitions";
+import { SharedTreeOptions } from "./shared-tree";
+import { ITree, ImplicitFieldSchema, TreeConfiguration, TreeFieldFromImplicitField, TreeView } from "./class-tree";
+/**
+ * Configuration to specialize a Tree DDS for a particular use.
+ * @internal
+ */
+export interface TreeOptions extends SharedTreeOptions {
+    /**
+     * Name appended to {@link @fluidframework/datastore-definitions#IChannelFactory."type"} to identify this factory configuration.
+     * @privateRemarks
+     * TODO: evaluate if this design is a good idea, or if "subtype" should be removed.
+     * TODO: evaluate if schematize should be separated from DDS construction.
+     */
+    readonly subtype?: string;
+}
+/**
+ * A channel factory that creates an {@link ITree}.
+ * @internal
+ */
+export declare class TreeFactory implements IChannelFactory {
+    private readonly options;
+    readonly type: string;
+    readonly attributes: IChannelAttributes;
+    constructor(options: TreeOptions);
+    load(runtime: IFluidDataStoreRuntime, id: string, services: IChannelServices, channelAttributes: Readonly<IChannelAttributes>): Promise<ITree>;
+    create(runtime: IFluidDataStoreRuntime, id: string): ITree;
+}
+/**
+ * SharedTree is a hierarchical data structure for collaboratively editing JSON-like trees
+ * of objects, arrays, and other data types.
+ *
+ * @internal
+ */
+export declare class SharedTree implements ITree {
+    static getFactory(): TreeFactory;
+    schematize<TRoot extends ImplicitFieldSchema>(config: TreeConfiguration<TRoot>): TreeView<TreeFieldFromImplicitField<TRoot>>;
+    private useFactory;
+    get id(): string;
+    get attributes(): IChannelAttributes;
+    get handle(): IFluidHandle;
+    get IFluidLoadable(): IFluidLoadable;
+    getAttachSummary(fullTree?: boolean | undefined, trackState?: boolean | undefined, telemetryContext?: ITelemetryContext | undefined): ISummaryTreeWithStats;
+    summarize(fullTree?: boolean | undefined, trackState?: boolean | undefined, telemetryContext?: ITelemetryContext | undefined, incrementalSummaryContext?: IExperimentalIncrementalSummaryContext | undefined): Promise<ISummaryTreeWithStats>;
+    isAttached(): boolean;
+    connect(services: IChannelServices): void;
+    getGCData(fullGC?: boolean | undefined): IGarbageCollectionData;
+}
+//# sourceMappingURL=treeFactory.d.ts.map

package/lib/treeFactory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeFactory.d.ts","sourceRoot":"","sources":["../src/treeFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,gBAAgB,EAChB,sBAAsB,EACtB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAC/E,OAAO,EACN,iBAAiB,EACjB,qBAAqB,EACrB,sCAAsC,EACtC,sBAAsB,EACtB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAgC,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAChF,OAAO,EACN,KAAK,EACL,mBAAmB,EACnB,iBAAiB,EACjB,0BAA0B,EAC1B,QAAQ,EACR,MAAM,cAAc,CAAC;AAEtB;;;GAGG;AACH,MAAM,WAAW,WAAY,SAAQ,iBAAiB;IACrD;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;GAGG;AACH,qBAAa,WAAY,YAAW,eAAe;IAI/B,OAAO,CAAC,QAAQ,CAAC,OAAO;IAH3C,SAAgB,IAAI,EAAE,MAAM,CAAC;IAC7B,SAAgB,UAAU,EAAE,kBAAkB,CAAC;gBAEX,OAAO,EAAE,WAAW;IAU3C,IAAI,CAChB,OAAO,EAAE,sBAAsB,EAC/B,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,gBAAgB,EAC1B,iBAAiB,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAC7C,OAAO,CAAC,KAAK,CAAC;IAMV,MAAM,CAAC,OAAO,EAAE,sBAAsB,EAAE,EAAE,EAAE,MAAM,GAAG,KAAK;CAKjE;AAED;;;;;GAKG;AACH,qBAAa,UAAW,YAAW,KAAK;WAOzB,UAAU,IAAI,WAAW;IAIhC,UAAU,CAAC,KAAK,SAAS,mBAAmB,EAClD,MAAM,EAAE,iBAAiB,CAAC,KAAK,CAAC,GAC9B,QAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;IAI9C,OAAO,CAAC,UAAU;IAIlB,IAAW,EAAE,IAAI,MAAM,CAEtB;IAED,IAAW,UAAU,IAAI,kBAAkB,CAE1C;IAED,IAAW,MAAM,IAAI,YAAY,CAEhC;IAED,IAAW,cAAc,IAAI,cAAc,CAE1C;IAEM,gBAAgB,CACtB,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,EAC9B,UAAU,CAAC,EAAE,OAAO,GAAG,SAAS,EAChC,gBAAgB,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAC9C,qBAAqB;IAIX,SAAS,CACrB,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,EAC9B,UAAU,CAAC,EAAE,OAAO,GAAG,SAAS,EAChC,gBAAgB,CAAC,EAAE,iBAAiB,GAAG,SAAS,EAChD,yBAAyB,CAAC,EAAE,sCAAsC,GAAG,SAAS,GAC5E,OAAO,CAAC,qBAAqB,CAAC;IAI1B,UAAU,IAAI,OAAO;IAIrB,OAAO,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI;IAIzC,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,sBAAsB;CAGtE"}

package/lib/treeFactory.js

@@ -0,0 +1,80 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { SharedTree as SharedTreeImpl } from "./shared-tree";
+/**
+ * A channel factory that creates an {@link ITree}.
+ * @internal
+ */
+export class TreeFactory {
+    constructor(options) {
+        this.options = options;
+        this.type = `https://graph.microsoft.com/types/tree/${options.subtype ?? "default"}`;
+        this.attributes = {
+            type: this.type,
+            snapshotFormatVersion: "0.0.0",
+            packageVersion: "0.0.0",
+        };
+    }
+    async load(runtime, id, services, channelAttributes) {
+        const tree = new SharedTreeImpl(id, runtime, channelAttributes, this.options, "SharedTree");
+        await tree.load(services);
+        return tree;
+    }
+    create(runtime, id) {
+        const tree = new SharedTreeImpl(id, runtime, this.attributes, this.options, "SharedTree");
+        tree.initializeLocal();
+        return tree;
+    }
+}
+/**
+ * SharedTree is a hierarchical data structure for collaboratively editing JSON-like trees
+ * of objects, arrays, and other data types.
+ *
+ * @internal
+ */
+export class SharedTree {
+    // The IFluidContainer ContainerSchema currently requires a constructable class that
+    // implements the union of IChannel and the interface to be returned to the user.
+    //
+    // Temporarily, we provide one until the following work items is addressed:
+    // https://dev.azure.com/fluidframework/internal/_workitems/edit/6458
+    static getFactory() {
+        return new TreeFactory({});
+    }
+    schematize(config) {
+        return this.useFactory();
+    }
+    useFactory() {
+        throw new Error("Use factory to create instance.");
+    }
+    get id() {
+        return this.useFactory();
+    }
+    get attributes() {
+        return this.useFactory();
+    }
+    get handle() {
+        return this.useFactory();
+    }
+    get IFluidLoadable() {
+        return this.useFactory();
+    }
+    getAttachSummary(fullTree, trackState, telemetryContext) {
+        return this.useFactory();
+    }
+    async summarize(fullTree, trackState, telemetryContext, incrementalSummaryContext) {
+        return this.useFactory();
+    }
+    isAttached() {
+        return this.useFactory();
+    }
+    connect(services) {
+        return this.useFactory();
+    }
+    getGCData(fullGC) {
+        return this.useFactory();
+    }
+}
+//# sourceMappingURL=treeFactory.js.map

package/lib/treeFactory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeFactory.js","sourceRoot":"","sources":["../src/treeFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAeH,OAAO,EAAE,UAAU,IAAI,cAAc,EAAqB,MAAM,eAAe,CAAC;AAuBhF;;;GAGG;AACH,MAAM,OAAO,WAAW;IAIvB,YAAoC,OAAoB;QAApB,YAAO,GAAP,OAAO,CAAa;QACvD,IAAI,CAAC,IAAI,GAAG,0CAA0C,OAAO,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAErF,IAAI,CAAC,UAAU,GAAG;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,qBAAqB,EAAE,OAAO;YAC9B,cAAc,EAAE,OAAO;SACvB,CAAC;IACH,CAAC;IAEM,KAAK,CAAC,IAAI,CAChB,OAA+B,EAC/B,EAAU,EACV,QAA0B,EAC1B,iBAA+C;QAE/C,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC5F,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,MAAM,CAAC,OAA+B,EAAE,EAAU;QACxD,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC1F,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IACtB,oFAAoF;IACpF,iFAAiF;IACjF,EAAE;IACF,2EAA2E;IAC3E,qEAAqE;IAE9D,MAAM,CAAC,UAAU;QACvB,OAAO,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAEM,UAAU,CAChB,MAAgC;QAEhC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEO,UAAU;QACjB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACpD,CAAC;IAED,IAAW,EAAE;QACZ,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAED,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAED,IAAW,cAAc;QACxB,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEM,gBAAgB,CACtB,QAA8B,EAC9B,UAAgC,EAChC,gBAAgD;QAEhD,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEM,KAAK,CAAC,SAAS,CACrB,QAA8B,EAC9B,UAAgC,EAChC,gBAAgD,EAChD,yBAA8E;QAE9E,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEM,UAAU;QAChB,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEM,OAAO,CAAC,QAA0B;QACxC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAEM,SAAS,CAAC,MAA4B;QAC5C,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tIChannelAttributes,\n\tIChannelFactory,\n\tIChannelServices,\n\tIFluidDataStoreRuntime,\n} from \"@fluidframework/datastore-definitions\";\nimport { IFluidHandle, IFluidLoadable } from \"@fluidframework/core-interfaces\";\nimport {\n\tITelemetryContext,\n\tISummaryTreeWithStats,\n\tIExperimentalIncrementalSummaryContext,\n\tIGarbageCollectionData,\n} from \"@fluidframework/runtime-definitions\";\nimport { SharedTree as SharedTreeImpl, SharedTreeOptions } from \"./shared-tree\";\nimport {\n\tITree,\n\tImplicitFieldSchema,\n\tTreeConfiguration,\n\tTreeFieldFromImplicitField,\n\tTreeView,\n} from \"./class-tree\";\n\n/**\n * Configuration to specialize a Tree DDS for a particular use.\n * @internal\n */\nexport interface TreeOptions extends SharedTreeOptions {\n\t/**\n\t * Name appended to {@link @fluidframework/datastore-definitions#IChannelFactory.\"type\"} to identify this factory configuration.\n\t * @privateRemarks\n\t * TODO: evaluate if this design is a good idea, or if \"subtype\" should be removed.\n\t * TODO: evaluate if schematize should be separated from DDS construction.\n\t */\n\treadonly subtype?: string;\n}\n\n/**\n * A channel factory that creates an {@link ITree}.\n * @internal\n */\nexport class TreeFactory implements IChannelFactory {\n\tpublic readonly type: string;\n\tpublic readonly attributes: IChannelAttributes;\n\n\tpublic constructor(private readonly options: TreeOptions) {\n\t\tthis.type = `https://graph.microsoft.com/types/tree/${options.subtype ?? \"default\"}`;\n\n\t\tthis.attributes = {\n\t\t\ttype: this.type,\n\t\t\tsnapshotFormatVersion: \"0.0.0\",\n\t\t\tpackageVersion: \"0.0.0\",\n\t\t};\n\t}\n\n\tpublic async load(\n\t\truntime: IFluidDataStoreRuntime,\n\t\tid: string,\n\t\tservices: IChannelServices,\n\t\tchannelAttributes: Readonly<IChannelAttributes>,\n\t): Promise<ITree> {\n\t\tconst tree = new SharedTreeImpl(id, runtime, channelAttributes, this.options, \"SharedTree\");\n\t\tawait tree.load(services);\n\t\treturn tree;\n\t}\n\n\tpublic create(runtime: IFluidDataStoreRuntime, id: string): ITree {\n\t\tconst tree = new SharedTreeImpl(id, runtime, this.attributes, this.options, \"SharedTree\");\n\t\ttree.initializeLocal();\n\t\treturn tree;\n\t}\n}\n\n/**\n * SharedTree is a hierarchical data structure for collaboratively editing JSON-like trees\n * of objects, arrays, and other data types.\n *\n * @internal\n */\nexport class SharedTree implements ITree {\n\t// The IFluidContainer ContainerSchema currently requires a constructable class that\n\t// implements the union of IChannel and the interface to be returned to the user.\n\t//\n\t// Temporarily, we provide one until the following work items is addressed:\n\t// https://dev.azure.com/fluidframework/internal/_workitems/edit/6458\n\n\tpublic static getFactory(): TreeFactory {\n\t\treturn new TreeFactory({});\n\t}\n\n\tpublic schematize<TRoot extends ImplicitFieldSchema>(\n\t\tconfig: TreeConfiguration<TRoot>,\n\t): TreeView<TreeFieldFromImplicitField<TRoot>> {\n\t\treturn this.useFactory();\n\t}\n\n\tprivate useFactory(): never {\n\t\tthrow new Error(\"Use factory to create instance.\");\n\t}\n\n\tpublic get id(): string {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic get attributes(): IChannelAttributes {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic get handle(): IFluidHandle {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic get IFluidLoadable(): IFluidLoadable {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic getAttachSummary(\n\t\tfullTree?: boolean | undefined,\n\t\ttrackState?: boolean | undefined,\n\t\ttelemetryContext?: ITelemetryContext | undefined,\n\t): ISummaryTreeWithStats {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic async summarize(\n\t\tfullTree?: boolean | undefined,\n\t\ttrackState?: boolean | undefined,\n\t\ttelemetryContext?: ITelemetryContext | undefined,\n\t\tincrementalSummaryContext?: IExperimentalIncrementalSummaryContext | undefined,\n\t): Promise<ISummaryTreeWithStats> {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic isAttached(): boolean {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic connect(services: IChannelServices): void {\n\t\treturn this.useFactory();\n\t}\n\n\tpublic getGCData(fullGC?: boolean | undefined): IGarbageCollectionData {\n\t\treturn this.useFactory();\n\t}\n}\n"]}

package/lib/util/brand.d.ts

@@ -0,0 +1,179 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { TUnsafe } from "@sinclair/typebox";
+import { Covariant, isAny } from "./typeCheck";
+import { Assume } from "./utils";
+/**
+ * Constructs a "Branded" type, adding a type-checking only field to `ValueType`.
+ *
+ * Two usages of `Brand` should never use the same `Name`.
+ * If they do, the resulting types will be assignable which defeats the point of this type.
+ *
+ * This type is constructed such that the first line of type errors when assigning
+ * mismatched branded types will be:
+ * `Type 'Name1' is not assignable to type 'Name2'.`
+ *
+ * These branded types are not opaque: A `Brand<A, B>` can still be used as a `B`.
+ * @internal
+ */
+export type Brand<ValueType, Name extends string | ErasedType<string>> = ValueType & BrandedType<ValueType, Name extends Erased<infer TName> ? TName : Assume<Name, string>>;
+/**
+ * "opaque" handle which can be used to expose a branded type without referencing its value type.
+ *
+ * Recommended usage is to use `interface` instead of `type` so tooling (such as tsc and refactoring tools)
+ * uses the type name instead of expanding it:
+ * ```typescript
+ * export interface MyType extends Erased<"myPackage.MyType">{}
+ * ```
+ * @internal
+ */
+export type Erased<Name extends string> = ErasedType<Name>;
+/**
+ * Helper for {@link Erased}.
+ * This is split out into its own as that's the only way to:
+ * - have doc comments for the member.
+ * - make the member protected (so you don't accidentally try and read it).
+ * - get nominal typing (so types produced without using this class can never be assignable to it).
+ *
+ * See `InternalTypes.MakeNominal` for some more details.
+ *
+ * Do not use this class with `instanceof`: this will always be false at runtime,
+ * but the compiler may think it's true in some cases.
+ *
+ * @sealed
+ * @internal
+ */
+export declare abstract class ErasedType<out Name extends string> {
+    /**
+     * Compile time only marker to make type checking more strict.
+     * This method will not exist at runtime and accessing it is invalid.
+     * See {@link Brand} for details.
+     *
+     * @privateRemarks
+     * `Name` is used as the return type of a method rather than a a simple readonly member as this allows types with two brands to be intersected without getting `never`.
+     * The method takes in never to help emphasize that its not callable.
+     */
+    protected abstract brand(dummy: never): Name;
+    /**
+     * This class should never exist at runtime, so make it un-constructable.
+     */
+    private constructor();
+}
+/**
+ * Helper for {@link Brand}.
+ * This is split out into its own as that's the only way to:
+ * - have doc comments for the member.
+ * - make the member protected (so you don't accidentally try and read it).
+ * - get nominal typing (so types produced without using this class can never be assignable to it).
+ * - allow use as {@link Opaque} branded type (not assignable to `ValueType`, but captures `ValueType`).
+ *
+ * See `InternalTypes.MakeNominal` for some more details.
+ *
+ * Do not use this class with `instanceof`: this will always be false at runtime,
+ * but the compiler may think it's true in some cases.
+ *
+ * @remarks
+ * This is covariant over ValueType.
+ * This is suitable for when ValueType is immutable (like string or number),
+ * which is the common use-case for branding.
+ *
+ * @sealed
+ * @internal
+ */
+export declare abstract class BrandedType<out ValueType, Name extends string> {
+    protected _typeCheck?: Covariant<ValueType>;
+    /**
+     * Compile time only marker to make type checking more strict.
+     * This method will not exist at runtime and accessing it is invalid.
+     * See {@link Brand} for details.
+     *
+     * @privateRemarks
+     * `Name` is used as the return type of a method rather than a a simple readonly member as this allows types with two brands to be intersected without getting `never`.
+     * The method takes in never to help emphasize that its not callable.
+     */
+    protected abstract brand(dummy: never): Name;
+    /**
+     * This class should never exist at runtime, so make it un-constructable.
+     */
+    private constructor();
+}
+/**
+ * Converts a Branded type into an "opaque" handle.
+ * This prevents the value from being used directly, but does not fully type erase it
+ * (and this its not really fully opaque):
+ * The type can be recovered using {@link extractFromOpaque},
+ * however if we assume only code that produces these "opaque" handles does that conversion,
+ * they can function like opaque handles.
+ *
+ * Recommended usage is to use `interface` instead of `type` so tooling (such as tsc and refactoring tools)
+ * uses the type name instead of expanding it:
+ * ```typescript
+ * export interface MyType extends Opaque<Brand<string, "myPackage.MyType">>{}
+ * ```
+ * @internal
+ */
+export type Opaque<T extends Brand<any, string>> = T extends BrandedType<infer ValueType, infer Name> ? BrandedType<ValueType, Name> : never;
+/**
+ * See {@link extractFromOpaque}.
+ * @internal
+ */
+export type ExtractFromOpaque<TOpaque extends BrandedType<any, string>> = TOpaque extends BrandedType<infer ValueType, infer Name> ? isAny<ValueType> extends true ? unknown : Brand<ValueType, Name> : never;
+/**
+ * Implementation detail of type branding. Should not be used directly outside this file,
+ * but shows up as part of branded types so API-Extractor requires it to be exported.
+ * @internal
+ */
+export type ValueFromBranded<T extends BrandedType<any, string>> = T extends BrandedType<infer ValueType, string> ? ValueType : never;
+/**
+ * Implementation detail of type branding. Should not be used directly outside this file,
+ * but shows up as part of branded types so API-Extractor requires it to be exported.
+ * @internal
+ */
+export type NameFromBranded<T extends BrandedType<any, string>> = T extends BrandedType<any, infer Name> ? Name : never;
+/**
+ * Converts a {@link Opaque} handle to the underlying branded type.
+ *
+ * It is assumed that only code that produces these "opaque" handles does this conversion,
+ * allowing these handles to be considered opaque.
+ * @internal
+ */
+export declare function extractFromOpaque<TOpaque extends BrandedType<any, string>>(value: TOpaque): ExtractFromOpaque<TOpaque>;
+/**
+ * Converts a {@link Erased} handle to the underlying branded type.
+ *
+ * It is assumed that only code that produces these "opaque" handles does this conversion,
+ * allowing these handles to be considered opaque.
+ * @internal
+ */
+export declare function fromErased<TBranded extends BrandedType<unknown, string>, TName extends string = NameFromBranded<TBranded>>(value: ErasedType<TName>): TBranded;
+/**
+ * Adds a type {@link Brand} to a value.
+ *
+ * Only do this when specifically allowed by the requirements of the type being converted to.
+ * @internal
+ */
+export declare function brand<T extends Brand<any, string>>(value: T extends BrandedType<infer ValueType, string> ? ValueType : never): T;
+/**
+ * Adds a type {@link Brand} to a value, returning it as a {@link Opaque} handle.
+ *
+ * Only do this when specifically allowed by the requirements of the type being converted to.
+ * @internal
+ */
+export declare function brandOpaque<T extends BrandedType<any, string>>(value: isAny<ValueFromBranded<T>> extends true ? never : ValueFromBranded<T>): BrandedType<ValueFromBranded<T>, NameFromBranded<T>>;
+/**
+ * Adds a type {@link Brand} to a value, returning it as a {@link Erased} handle.
+ *
+ * Only do this when specifically allowed by the requirements of the type being converted to.
+ * @internal
+ */
+export declare function brandErased<T extends BrandedType<any, string>>(value: isAny<ValueFromBranded<T>> extends true ? never : ValueFromBranded<T>): ErasedType<NameFromBranded<T>>;
+/**
+ * Create a TypeBox string schema for a branded string type.
+ * This only validates that the value is a string,
+ * and not that it came from the correct branded type (that information is lost when serialized).
+ */
+export declare function brandedStringType<T extends string>(): TUnsafe<T>;
+export declare function brandedNumberType<T extends number>(): TUnsafe<T>;
+//# sourceMappingURL=brand.d.ts.map

package/lib/util/brand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"brand.d.ts","sourceRoot":"","sources":["../../src/util/brand.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,OAAO,EAAQ,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAEjC;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,KAAK,CAAC,SAAS,EAAE,IAAI,SAAS,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,SAAS,GACjF,WAAW,CAAC,SAAS,EAAE,IAAI,SAAS,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAEzF;;;;;;;;;GASG;AACH,MAAM,MAAM,MAAM,CAAC,IAAI,SAAS,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;AAE3D;;;;;;;;;;;;;;GAcG;AACH,8BAAsB,UAAU,CAAC,GAAG,CAAC,IAAI,SAAS,MAAM;IACvD;;;;;;;;OAQG;IACH,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;IAE5C;;OAEG;IACH,OAAO;CACP;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,8BAAsB,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,SAAS,MAAM;IACnE,SAAS,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;IAC5C;;;;;;;;OAQG;IACH,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;IAE5C;;OAEG;IACH,OAAO;CACP;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,WAAW,CACvE,MAAM,SAAS,EACf,MAAM,IAAI,CACV,GACE,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,GAC5B,KAAK,CAAC;AAET;;;GAGG;AACH,MAAM,MAAM,iBAAiB,CAAC,OAAO,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,IACrE,OAAO,SAAS,WAAW,CAAC,MAAM,SAAS,EAAE,MAAM,IAAI,CAAC,GACrD,KAAK,CAAC,SAAS,CAAC,SAAS,IAAI,GAC5B,OAAO,GACP,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,GACvB,KAAK,CAAC;AAEV;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,WAAW,CACvF,MAAM,SAAS,EACf,MAAM,CACN,GACE,SAAS,GACT,KAAK,CAAC;AAET;;;;GAIG;AACH,MAAM,MAAM,eAAe,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,WAAW,CACtF,GAAG,EACH,MAAM,IAAI,CACV,GACE,IAAI,GACJ,KAAK,CAAC;AAET;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EACzE,KAAK,EAAE,OAAO,GACZ,iBAAiB,CAAC,OAAO,CAAC,CAE5B;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACzB,QAAQ,SAAS,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,EAC7C,KAAK,SAAS,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,EAC/C,KAAK,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,QAAQ,CAEpC;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,EACjD,KAAK,EAAE,CAAC,SAAS,WAAW,CAAC,MAAM,SAAS,EAAE,MAAM,CAAC,GAAG,SAAS,GAAG,KAAK,GACvE,CAAC,CAEH;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAC7D,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,KAAK,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAC1E,WAAW,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAEtD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAC7D,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,KAAK,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAC1E,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAEhC;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAOhE;AAED,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAGhE"}