@fluidframework/tree 2.83.0 → 2.90.0

package/src/text/textDomain.ts

@@ -3,14 +3,22 @@
  * Licensed under the MIT License.
  */
 
-import { EmptyKey } from "../core/index.js";
+import { compareArrays, debugAssert } from "@fluidframework/core-utils/internal";
+
+import { EmptyKey, mapCursorField, type ITreeCursorSynchronous } from "../core/index.js";
 import {
 	eraseSchemaDetails,
+	getInnerNode,
 	SchemaFactory,
 	SchemaFactoryAlpha,
 	TreeArrayNode,
 } from "../simple-tree/index.js";
+// eslint-disable-next-line import-x/no-duplicates
 import type { TreeNode, WithType } from "../simple-tree/index.js";
+// Add some unused imports which show up in the generated d.ts file.
+// This prevents them from getting inline imports generated, cleaning up the d.ts file and API reports.
+// eslint-disable-next-line @typescript-eslint/no-unused-vars, unused-imports/no-unused-imports, import-x/no-duplicates
+import type { NodeKind, TreeNodeSchema } from "../simple-tree/index.js";
 
 const sf = new SchemaFactoryAlpha("com.fluidframework.text");
 
@@ -26,16 +34,49 @@ class TextNode
 			TreeArrayNode.spread(charactersFromString(additionalCharacters)),
 		);
 	}
-	public removeRange(index: number, length: number): void {
-		this.content.removeRange(index, length);
+	public removeRange(index: number | undefined, end: number | undefined): void {
+		this.content.removeRange(index, end);
 	}
 	public characters(): Iterable<string> {
 		return this.content[Symbol.iterator]();
 	}
+
+	public characterCount(): number {
+		return this.content.length;
+	}
+
+	public charactersCopy(): string[] {
+		const result = this.content.charactersCopy();
+		debugAssert(
+			() =>
+				compareArrays(result, this.charactersCopy_reference()) ||
+				"invalid charactersCopy optimizations",
+		);
+		return result;
+	}
+
 	public fullString(): string {
+		const result = this.content.fullString();
+		debugAssert(
+			() => result === this.fullString_reference() || "invalid fullString optimizations",
+		);
+		return result;
+	}
+
+	/**
+	 * Unoptimized trivially correct implementation of fullString.
+	 */
+	public fullString_reference(): string {
 		return this.content.join("");
 	}
 
+	/**
+	 * Unoptimized trivially correct implementation of charactersCopy.
+	 */
+	public charactersCopy_reference(): string[] {
+		return [...this.content];
+	}
+
 	public static fromString(value: string): TextNode {
 		// Constructing an ArrayNode from an iterator is supported, so creating an array from the iterable of characters seems like its not necessary here,
 		// but to reduce the risk of incorrect data interpretation, we actually ban this in the special case where the iterable is a string directly, which is the case here.
@@ -58,7 +99,25 @@ export function charactersFromString(value: string): Iterable<string> {
 	return value;
 }
 
-class StringArray extends sf.array("StringArray", SchemaFactory.string) {}
+class StringArray extends sf.array("StringArray", SchemaFactory.string) {
+	public withBorrowedSequenceCursor<T>(f: (cursor: ITreeCursorSynchronous) => T): T {
+		const cursor = getInnerNode(this).borrowCursor();
+		cursor.enterField(EmptyKey);
+		const result = f(cursor);
+		cursor.exitField();
+		return result;
+	}
+
+	public charactersCopy(): string[] {
+		return this.withBorrowedSequenceCursor((cursor) =>
+			mapCursorField(cursor, () => cursor.value as string),
+		);
+	}
+
+	public fullString(): string {
+		return this.charactersCopy().join("");
+	}
+}
 
 /**
  * A collection of text related types, schema and utilities for working with text beyond the basic {@link SchemaStatics.string}.
@@ -120,12 +179,12 @@ class StringArray extends sf.array("StringArray", SchemaFactory.string) {}
  *
  * Part of that work will be establishing and documenting those patterns so other components with complex encodings can follow them,
  * in addition to implementing them for text.
- * @internal
+ * @alpha
  */
 export namespace TextAsTree {
 	/**
 	 * Statics for text nodes.
-	 * @internal
+	 * @alpha
 	 */
 	export interface Statics {
 		/**
@@ -150,7 +209,7 @@ export namespace TextAsTree {
 	 *
 	 * @see {@link TextAsTree.Statics.fromString} for construction.
 	 * @see {@link TextAsTree.(Tree:type)} for schema.
-	 * @internal
+	 * @alpha
 	 */
 	export interface Members {
 		/**
@@ -160,6 +219,20 @@ export namespace TextAsTree {
 		 */
 		characters(): Iterable<string>;
 
+		/**
+		 * Optimized way to get a copy of the {@link TextAsTree.Members.characters} in an array.
+		 */
+		charactersCopy(): string[];
+
+		/**
+		 * Gets the number of characters currently in the text.
+		 * @remarks
+		 * The length of {@link TextAsTree.Members.characters}.
+		 * This is not the length of the string returned by {@link TextAsTree.Members.fullString},
+		 * as that string may contain characters which are made up of multiple UTF-16 code units.
+		 */
+		characterCount(): number;
+
 		/**
 		 * Copy the content of this node into a string.
 		 */
@@ -184,16 +257,22 @@ export namespace TextAsTree {
 		 * Remove a range from a string based on character index.
 		 * See {@link (TreeArrayNode:interface).removeRange} for more details on the behavior.
 		 */
-		removeRange(index: number, length: number): void;
+		removeRange(startIndex: number | undefined, endIndex: number | undefined): void;
 	}
 
 	/**
-	 * Schema for a text node.
+	 * Schema for a {@link TextAsTree.(Tree:variable)} node.
 	 * @remarks
-	 * See {@link TextAsTree.Members} for the API.
-	 * See {@link TextAsTree.Statics} for static APIs on this Schema, including construction.
-	 * @internal
+	 * See {@link TextAsTree.Statics} for static APIs on this schema, including construction.
+	 * @alpha
 	 */
 	export const Tree = eraseSchemaDetails<Members, Statics>()(TextNode);
+
+	/**
+	 * Node for the {@link TextAsTree.(Tree:type)} schema exposing the {@link TextAsTree.Members} API.
+	 * @remarks
+	 * Create using {@link TextAsTree.Statics.fromString}.
+	 * @alpha
+	 */
 	export type Tree = Members & TreeNode & WithType<"com.fluidframework.text.Text">;
 }

package/src/text/textDomainFormatted.ts

@@ -3,14 +3,16 @@
  * Licensed under the MIT License.
  */
 
-import { assert } from "@fluidframework/core-utils/internal";
+import { assert, compareArrays, debugAssert, fail } from "@fluidframework/core-utils/internal";
 import { UsageError } from "@fluidframework/telemetry-utils/internal";
 
-import { EmptyKey } from "../core/index.js";
+import { EmptyKey, mapCursorField, type ITreeCursorSynchronous } from "../core/index.js";
+import { currentObserver } from "../feature-libraries/index.js";
 import { TreeAlpha } from "../shared-tree/index.js";
 import {
 	enumFromStrings,
 	eraseSchemaDetails,
+	getInnerNode,
 	SchemaFactory,
 	SchemaFactoryAlpha,
 	TreeArrayNode,
@@ -22,7 +24,7 @@ import type {
 	TreeNodeFromImplicitAllowedTypes,
 	WithType,
 } from "../simple-tree/index.js";
-import { mapIterable } from "../util/index.js";
+import { mapIterable, validateIndex, validateIndexRange } from "../util/index.js";
 
 import { charactersFromString, type TextAsTree } from "./textDomain.js";
 
@@ -43,16 +45,51 @@ class TextNode
 			TreeArrayNode.spread(textAtomsFromString(additionalCharacters, this.defaultFormat)),
 		);
 	}
-	public removeRange(index: number, length: number): void {
-		this.content.removeRange(index, length);
+
+	public removeRange(index: number | undefined, end: number | undefined): void {
+		this.content.removeRange(index, end);
 	}
+
 	public characters(): Iterable<string> {
 		return mapIterable(this.content, (atom) => atom.content.content);
 	}
+
+	public charactersCopy(): string[] {
+		const result = this.content.charactersCopy();
+		debugAssert(
+			() =>
+				compareArrays(result, this.charactersCopy_reference()) ||
+				"invalid charactersCopy optimizations",
+		);
+		return result;
+	}
+
+	public characterCount(): number {
+		return this.content.length;
+	}
+
 	public fullString(): string {
+		const result = this.content.fullString();
+		debugAssert(
+			() => result === this.fullString_reference() || "invalid fullString optimizations",
+		);
+		return result;
+	}
+
+	/**
+	 * A non-optimized reference implementation of fullString.
+	 */
+	public fullString_reference(): string {
 		return [...this.characters()].join("");
 	}
 
+	/**
+	 * Unoptimized trivially correct implementation of charactersCopy.
+	 */
+	public charactersCopy_reference(): string[] {
+		return [...this.characters()];
+	}
+
 	public static fromString(
 		value: string,
 		format?: FormattedTextAsTree.CharacterFormat,
@@ -70,7 +107,7 @@ class TextNode
 		});
 	}
 
-	public charactersWithFormatting(): Iterable<FormattedTextAsTree.StringAtom> {
+	public charactersWithFormatting(): readonly FormattedTextAsTree.StringAtom[] {
 		return this.content;
 	}
 	public insertWithFormattingAt(
@@ -80,14 +117,25 @@ class TextNode
 		this.content.insertAt(index, TreeArrayNode.spread(additionalCharacters));
 	}
 	public formatRange(
-		startIndex: number,
-		length: number,
+		start: number | undefined,
+		end: number | undefined,
 		format: Partial<FormattedTextAsTree.CharacterFormat>,
 	): void {
+		const formatStart = start ?? 0;
+		validateIndex(formatStart, this.content, "FormattedTextAsTree.formatRange", true);
+
+		const formatEnd = Math.min(this.content.length, end ?? this.content.length);
+		validateIndexRange(
+			formatStart,
+			formatEnd,
+			this.content,
+			"FormattedTextAsTree.formatRange",
+		);
+
 		const branch = TreeAlpha.branch(this);
 
 		const applyFormatting = (): void => {
-			for (let i = startIndex; i < startIndex + length; i++) {
+			for (let i = formatStart; i < formatEnd; i++) {
 				const atom = this.content[i];
 				if (atom === undefined) {
 					throw new UsageError("Index out of bounds while formatting text range.");
@@ -149,7 +197,61 @@ function textAtomsFromString(
 	return result;
 }
 
-class StringArray extends sf.array("StringArray", [() => FormattedTextAsTree.StringAtom]) {}
+class StringArray extends sf.array("StringArray", [() => FormattedTextAsTree.StringAtom]) {
+	public withBorrowedSequenceCursor<T>(f: (cursor: ITreeCursorSynchronous) => T): T {
+		const innerNode = getInnerNode(this);
+		// Since the cursor will be used to read content from the tree and won't track observations,
+		// treat it as if it observed the whole subtree.
+		currentObserver?.observeNodeDeep(innerNode);
+		const cursor = innerNode.borrowCursor();
+		cursor.enterField(EmptyKey);
+		const result = f(cursor);
+		cursor.exitField();
+		return result;
+	}
+
+	public charactersCopy(): string[] {
+		return this.withBorrowedSequenceCursor((cursor) =>
+			mapCursorField(cursor, () => {
+				debugAssert(
+					() =>
+						cursor.type === FormattedTextAsTree.StringAtom.identifier ||
+						"invalid fullString type optimizations",
+				);
+				cursor.enterField(EmptyKey);
+				cursor.enterNode(0);
+				let content: string;
+				switch (cursor.type) {
+					case FormattedTextAsTree.StringTextAtom.identifier: {
+						cursor.enterField(EmptyKey);
+						cursor.enterNode(0);
+						content = cursor.value as string;
+						debugAssert(
+							() => typeof content === "string" || "invalid fullString type optimizations",
+						);
+						cursor.exitNode();
+						cursor.exitField();
+						break;
+					}
+					case FormattedTextAsTree.StringLineAtom.identifier: {
+						content = "\n";
+						break;
+					}
+					default: {
+						fail(0xcde /* Unsupported node type in text array */, () => `${cursor.type}`);
+					}
+				}
+				cursor.exitNode();
+				cursor.exitField();
+				return content;
+			}),
+		);
+	}
+
+	public fullString(): string {
+		return this.charactersCopy().join("");
+	}
+}
 
 /**
  * A collection of text related types, schema and utilities for working with text beyond the basic {@link SchemaStatics.string}.
@@ -284,11 +386,15 @@ export namespace FormattedTextAsTree {
 		defaultFormat: CharacterFormat;
 
 		/**
-		 * Gets an iterable over the characters currently in the text.
+		 * Gets an array type view of the characters currently in the text.
 		 * @remarks
 		 * This iterator matches the behavior of {@link (TreeArrayNode:interface)} with respect to edits during iteration.
+		 * @privateRemarks
+		 * Currently this is implemented by a node and changes with the text over time.
+		 * We might not want to leak a node like this in the API.
+		 * Providing a way to index and iterate separately might be better.
 		 */
-		charactersWithFormatting(): Iterable<StringAtom>;
+		charactersWithFormatting(): readonly StringAtom[];
 
 		/**
 		 * Insert a range of characters into the string based on character index.
@@ -310,11 +416,17 @@ export namespace FormattedTextAsTree {
 
 		/**
 		 * Apply formatting to a range of characters based on character index.
-		 * @param startIndex - The starting index of the range to format.
-		 * @param length - The number of characters to format.
+		 * @param startIndex - The starting index (inclusive) of the range to format.
+		 * @param endIndex - The ending index (exclusive) of the range to format.
 		 * @param format - The formatting to apply to the specified range.
+		 * @remarks
+		 * The start and end behave the same as in {@link (TreeArrayNode:interface).removeRange}.
 		 */
-		formatRange(startIndex: number, length: number, format: Partial<CharacterFormat>): void;
+		formatRange(
+			startIndex: number | undefined,
+			endIndex: number | undefined,
+			format: Partial<CharacterFormat>,
+		): void;
 	}
 
 	/**

package/src/util/rangeMap.ts

@@ -5,8 +5,6 @@
 
 import { assert, oob } from "@fluidframework/core-utils/internal";
 import { BTree } from "@tylerbu/sorted-btree-es6";
-// eslint-disable-next-line import-x/no-internal-modules
-import { union } from "@tylerbu/sorted-btree-es6/extended/union";
 
 /**
  * RangeMap represents a mapping from keys of type K to values of type V or undefined.
@@ -215,6 +213,7 @@ export class RangeMap<K, V> {
 
 	/**
 	 * Returns a new map which contains the entries from both input maps.
+	 * Whenever both maps contain entires for the same keys, the value from map `b` is used in the returned map.
 	 */
 	public static union<K, V>(a: RangeMap<K, V>, b: RangeMap<K, V>): RangeMap<K, V> {
 		assert(
@@ -224,15 +223,10 @@ export class RangeMap<K, V> {
 			0xaae /* Maps should have the same behavior */,
 		);
 
-		const merged = new RangeMap<K, V>(a.offsetKey, a.subtractKeys, a.offsetValue);
-
-		merged.tree = union<BTree<K, RangeEntry<V>>, K, RangeEntry<V>>(
-			a.tree,
-			b.tree,
-			(_key, _val1, val2) => {
-				return val2;
-			},
-		);
+		const merged = a.clone();
+		for (const entry of b.entries()) {
+			merged.set(entry.start, entry.length, entry.value);
+		}
 
 		return merged;
 	}

package/dist/core/schema-view/index.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { type Adapters, type TreeAdapter, AdaptedViewSchema, } from "./view.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/schema-view/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/schema-view/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,KAAK,QAAQ,EACb,KAAK,WAAW,EAChB,iBAAiB,GACjB,MAAM,WAAW,CAAC"}

package/dist/core/schema-view/index.js

@@ -1,10 +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.AdaptedViewSchema = void 0;
-var view_js_1 = require("./view.js");
-Object.defineProperty(exports, "AdaptedViewSchema", { enumerable: true, get: function () { return view_js_1.AdaptedViewSchema; } });
-//# sourceMappingURL=index.js.map

package/dist/core/schema-view/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/schema-view/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAImB;AADlB,4GAAA,iBAAiB,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\ttype Adapters,\n\ttype TreeAdapter,\n\tAdaptedViewSchema,\n} from \"./view.js\";\n"]}

package/dist/core/schema-view/view.d.ts

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import type { TreeNodeSchemaIdentifier, TreeStoredSchema } from "../schema-stored/index.js";
-/**
- * APIs for applying `view schema` to documents.
- */
-export interface TreeAdapter {
-    readonly output: TreeNodeSchemaIdentifier;
-    readonly input: TreeNodeSchemaIdentifier;
-}
-/**
- * Minimal selection of adapters (nothing for general out of schema, field level adjustments etc.).
- * Would be used with schematize and have actual conversion/update functionality.
- *
- * TODO: Support more kinds of adapters
- * TODO: support efficient lookup of adapters
- */
-export interface Adapters {
-    readonly tree?: readonly TreeAdapter[];
-}
-/**
- * A collection of View information for schema, including policy.
- */
-export declare class AdaptedViewSchema {
-    readonly adapters: Adapters;
-    readonly adaptedForViewSchema: TreeStoredSchema;
-    constructor(adapters: Adapters, adaptedForViewSchema: TreeStoredSchema);
-}
-//# sourceMappingURL=view.d.ts.map

package/dist/core/schema-view/view.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"view.d.ts","sourceRoot":"","sources":["../../../src/core/schema-view/view.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,wBAAwB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAE5F;;GAEG;AAEH,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC;IAC1C,QAAQ,CAAC,KAAK,EAAE,wBAAwB,CAAC;CAGzC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAQ;IACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;CACvC;AAED;;GAEG;AACH,qBAAa,iBAAiB;aAEZ,QAAQ,EAAE,QAAQ;aAClB,oBAAoB,EAAE,gBAAgB;gBADtC,QAAQ,EAAE,QAAQ,EAClB,oBAAoB,EAAE,gBAAgB;CAEvD"}

package/dist/core/schema-view/view.js

@@ -1,18 +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.AdaptedViewSchema = void 0;
-/**
- * A collection of View information for schema, including policy.
- */
-class AdaptedViewSchema {
-    constructor(adapters, adaptedForViewSchema) {
-        this.adapters = adapters;
-        this.adaptedForViewSchema = adaptedForViewSchema;
-    }
-}
-exports.AdaptedViewSchema = AdaptedViewSchema;
-//# sourceMappingURL=view.js.map

package/dist/core/schema-view/view.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"view.js","sourceRoot":"","sources":["../../../src/core/schema-view/view.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AA0BH;;GAEG;AACH,MAAa,iBAAiB;IAC7B,YACiB,QAAkB,EAClB,oBAAsC;QADtC,aAAQ,GAAR,QAAQ,CAAU;QAClB,yBAAoB,GAApB,oBAAoB,CAAkB;IACpD,CAAC;CACJ;AALD,8CAKC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport type { TreeNodeSchemaIdentifier, TreeStoredSchema } from \"../schema-stored/index.js\";\n\n/**\n * APIs for applying `view schema` to documents.\n */\n\nexport interface TreeAdapter {\n\treadonly output: TreeNodeSchemaIdentifier;\n\treadonly input: TreeNodeSchemaIdentifier;\n\n\t// TODO: include actual adapter functionality, not just what types it converts\n}\n\n/**\n * Minimal selection of adapters (nothing for general out of schema, field level adjustments etc.).\n * Would be used with schematize and have actual conversion/update functionality.\n *\n * TODO: Support more kinds of adapters\n * TODO: support efficient lookup of adapters\n */\nexport interface Adapters {\n\treadonly tree?: readonly TreeAdapter[];\n}\n\n/**\n * A collection of View information for schema, including policy.\n */\nexport class AdaptedViewSchema {\n\tpublic constructor(\n\t\tpublic readonly adapters: Adapters,\n\t\tpublic readonly adaptedForViewSchema: TreeStoredSchema,\n\t) {}\n}\n"]}

package/dist/feature-libraries/forest-summary/formatV1.d.ts

@@ -1,12 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import type { Static } from "@sinclair/typebox";
-export declare const FormatV1: import("@sinclair/typebox").TObject<{
-    version: import("@sinclair/typebox").TLiteral<import("../../util/brand.js").Brand<1, "ForestFormatVersion">>;
-    keys: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<import("../../core/index.js").FieldKey>>;
-    fields: import("@sinclair/typebox").TUnsafe<import("../../index.js").JsonCompatibleReadOnly>;
-}>;
-export type FormatV1 = Static<typeof FormatV1>;
-//# sourceMappingURL=formatV1.d.ts.map

package/dist/feature-libraries/forest-summary/formatV1.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatV1.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/formatV1.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAIhD,eAAO,MAAM,QAAQ;;;;EAAuC,CAAC;AAC7D,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,QAAQ,CAAC,CAAC"}

package/dist/feature-libraries/forest-summary/formatV1.js

@@ -1,10 +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.FormatV1 = void 0;
-const formatCommon_js_1 = require("./formatCommon.js");
-exports.FormatV1 = (0, formatCommon_js_1.FormatCommon)(formatCommon_js_1.ForestFormatVersion.v1);
-//# sourceMappingURL=formatV1.js.map

package/dist/feature-libraries/forest-summary/formatV1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatV1.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/formatV1.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAIH,uDAAsE;AAEzD,QAAA,QAAQ,GAAG,IAAA,8BAAY,EAAC,qCAAmB,CAAC,EAAE,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport type { Static } from \"@sinclair/typebox\";\n\nimport { FormatCommon, ForestFormatVersion } from \"./formatCommon.js\";\n\nexport const FormatV1 = FormatCommon(ForestFormatVersion.v1);\nexport type FormatV1 = Static<typeof FormatV1>;\n"]}

package/dist/feature-libraries/forest-summary/formatV2.d.ts

@@ -1,12 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import type { Static } from "@sinclair/typebox";
-export declare const FormatV2: import("@sinclair/typebox").TObject<{
-    version: import("@sinclair/typebox").TLiteral<import("../../util/brand.js").Brand<2, "ForestFormatVersion">>;
-    keys: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<import("../../core/index.js").FieldKey>>;
-    fields: import("@sinclair/typebox").TUnsafe<import("../../index.js").JsonCompatibleReadOnly>;
-}>;
-export type FormatV2 = Static<typeof FormatV2>;
-//# sourceMappingURL=formatV2.d.ts.map

package/dist/feature-libraries/forest-summary/formatV2.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatV2.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/formatV2.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAIhD,eAAO,MAAM,QAAQ;;;;EAAuC,CAAC;AAC7D,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,QAAQ,CAAC,CAAC"}

package/dist/feature-libraries/forest-summary/formatV2.js

@@ -1,10 +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.FormatV2 = void 0;
-const formatCommon_js_1 = require("./formatCommon.js");
-exports.FormatV2 = (0, formatCommon_js_1.FormatCommon)(formatCommon_js_1.ForestFormatVersion.v2);
-//# sourceMappingURL=formatV2.js.map

package/dist/feature-libraries/forest-summary/formatV2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatV2.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/formatV2.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAIH,uDAAsE;AAEzD,QAAA,QAAQ,GAAG,IAAA,8BAAY,EAAC,qCAAmB,CAAC,EAAE,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport type { Static } from \"@sinclair/typebox\";\n\nimport { FormatCommon, ForestFormatVersion } from \"./formatCommon.js\";\n\nexport const FormatV2 = FormatCommon(ForestFormatVersion.v2);\nexport type FormatV2 = Static<typeof FormatV2>;\n"]}

package/lib/core/schema-view/index.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { type Adapters, type TreeAdapter, AdaptedViewSchema, } from "./view.js";
-//# sourceMappingURL=index.d.ts.map

package/lib/core/schema-view/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/schema-view/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,KAAK,QAAQ,EACb,KAAK,WAAW,EAChB,iBAAiB,GACjB,MAAM,WAAW,CAAC"}

package/lib/core/schema-view/index.js

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { AdaptedViewSchema, } from "./view.js";
-//# sourceMappingURL=index.js.map

package/lib/core/schema-view/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/schema-view/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAGN,iBAAiB,GACjB,MAAM,WAAW,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\ttype Adapters,\n\ttype TreeAdapter,\n\tAdaptedViewSchema,\n} from \"./view.js\";\n"]}

package/lib/core/schema-view/view.d.ts

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import type { TreeNodeSchemaIdentifier, TreeStoredSchema } from "../schema-stored/index.js";
-/**
- * APIs for applying `view schema` to documents.
- */
-export interface TreeAdapter {
-    readonly output: TreeNodeSchemaIdentifier;
-    readonly input: TreeNodeSchemaIdentifier;
-}
-/**
- * Minimal selection of adapters (nothing for general out of schema, field level adjustments etc.).
- * Would be used with schematize and have actual conversion/update functionality.
- *
- * TODO: Support more kinds of adapters
- * TODO: support efficient lookup of adapters
- */
-export interface Adapters {
-    readonly tree?: readonly TreeAdapter[];
-}
-/**
- * A collection of View information for schema, including policy.
- */
-export declare class AdaptedViewSchema {
-    readonly adapters: Adapters;
-    readonly adaptedForViewSchema: TreeStoredSchema;
-    constructor(adapters: Adapters, adaptedForViewSchema: TreeStoredSchema);
-}
-//# sourceMappingURL=view.d.ts.map

package/lib/core/schema-view/view.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"view.d.ts","sourceRoot":"","sources":["../../../src/core/schema-view/view.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,wBAAwB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAE5F;;GAEG;AAEH,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC;IAC1C,QAAQ,CAAC,KAAK,EAAE,wBAAwB,CAAC;CAGzC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAQ;IACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;CACvC;AAED;;GAEG;AACH,qBAAa,iBAAiB;aAEZ,QAAQ,EAAE,QAAQ;aAClB,oBAAoB,EAAE,gBAAgB;gBADtC,QAAQ,EAAE,QAAQ,EAClB,oBAAoB,EAAE,gBAAgB;CAEvD"}

package/lib/core/schema-view/view.js

@@ -1,14 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * A collection of View information for schema, including policy.
- */
-export class AdaptedViewSchema {
-    constructor(adapters, adaptedForViewSchema) {
-        this.adapters = adapters;
-        this.adaptedForViewSchema = adaptedForViewSchema;
-    }
-}
-//# sourceMappingURL=view.js.map