@fluidframework/tree 2.2.0 → 2.3.0

package/lib/feature-libraries/flex-tree/flexTreeTypes.d.ts

@@ -2,11 +2,10 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { type AnchorNode, type ExclusiveMapTree, type FieldKey, type FieldUpPath, type TreeValue } from "../../core/index.js";
-import type { Assume, FlattenKeys } from "../../util/index.js";
+import { type AnchorNode, type ExclusiveMapTree, type FieldKey, type FieldUpPath, type TreeFieldStoredSchema, type TreeNodeSchemaIdentifier, type TreeValue } from "../../core/index.js";
 import type { FieldKinds, SequenceFieldEditBuilder, ValueFieldEditBuilder, OptionalFieldEditBuilder } from "../default-schema/index.js";
 import type { FlexFieldKind } from "../modular-schema/index.js";
-import type { Any, FlexAllowedTypes, FlexFieldSchema, FlexList, FlexListToUnion, FlexMapNodeSchema, FlexObjectNodeFields, FlexObjectNodeSchema, FlexTreeNodeSchema, LazyItem, LeafNodeSchema } from "../typed-schema/index.js";
+import type { FlexTreeNodeSchema } from "../typed-schema/index.js";
 import type { FlexTreeContext } from "./context.js";
 /**
  * An anchor slot which records the {@link FlexTreeNode} associated with that anchor, if there is one.
@@ -17,7 +16,6 @@ export declare const flexTreeSlot: import("../../core/index.js").AnchorSlot<Flex
  * Indicates that an object is a flex tree.
  */
 export declare const flexTreeMarker: unique symbol;
-export declare function isFlexTreeEntity(t: unknown): t is FlexTreeEntity;
 export declare function isFlexTreeNode(t: unknown): t is FlexTreeNode;
 /**
  */
@@ -39,29 +37,16 @@ export declare enum FlexTreeEntityKind {
  * Design and document iterator invalidation rules and ordering rules.
  * Providing a custom iterator type with place anchor semantics would be a good approach.
  */
-export interface FlexTreeEntity<out TSchema = unknown> {
+export interface FlexTreeEntity {
     /**
      * Indicates that an object is a specific kind of flex tree FlexTreeEntity.
      * This makes it possible to both down cast FlexTreeEntities safely as well as validate if an object is or is not a FlexTreeEntity.
      */
     readonly [flexTreeMarker]: FlexTreeEntityKind;
     /**
-     * Schema for this entity.
-     * If well-formed, it must follow this schema.
-     */
-    readonly schema: TSchema;
-    /**
-     * A common context of a "forest" of FlexTrees.
-     * @remarks This is `undefined` for unhydrated nodes or fields that have not yet been inserted into the tree.
-     */
-    readonly context?: FlexTreeContext;
-    /**
-     * Iterate through all nodes/fields in this field/node.
-     *
-     * @remarks
-     * No mutations to the current view of the shared tree are permitted during iteration.
+     * A common context of FlexTrees.
      */
-    boxedIterator(): IterableIterator<FlexTreeEntity>;
+    readonly context: FlexTreeContext;
 }
 /**
  * Status of the tree that a particular node belongs to.
@@ -82,6 +67,20 @@ export declare enum TreeStatus {
     Deleted = 2,
     /**
      * Is created but has not yet been inserted into the tree.
+     * @remarks
+     * See also {@link Unhydrated}.
+     *
+     * Nodes in the new state have some limitations:
+     *
+     * - Events are not currently triggered for changes. Fixes for this are planned.
+     *
+     * - Reading identifiers from nodes which were left unspecified (defaulted) when creating the tree will error.
+     * This is because allocating unique identifiers in a compressible manner requires knowing which tree the nodes will be inserted into.
+     *
+     * - Transactions do not work: transactions apply to a single {@link TreeView}, and `New` nodes are not part of one.
+     *
+     * - `Tree.shortId` (when the identifier was explicitly specified and thus works at all) will just return the full identifier as a string,
+     * but might return a compressed form as a number once hydrated.
      */
     New = 3
 }
@@ -101,7 +100,7 @@ export declare enum TreeStatus {
  * the schema aware API may be more ergonomic.
  * All editing is actually done via {@link FlexTreeField}s: the nodes are immutable other than that they contain mutable fields.
  */
-export interface FlexTreeNode extends FlexTreeEntity<FlexTreeNodeSchema> {
+export interface FlexTreeNode extends FlexTreeEntity {
     readonly [flexTreeMarker]: FlexTreeEntityKind.Node;
     /**
      * Value stored on this node.
@@ -131,7 +130,7 @@ export interface FlexTreeNode extends FlexTreeEntity<FlexTreeNodeSchema> {
     /**
      * Type guard for narrowing / down-casting to a specific schema.
      */
-    is<TSchema extends FlexTreeNodeSchema>(schema: TSchema): this is FlexTreeTypedNode<TSchema>;
+    is(schema: FlexTreeNodeSchema): boolean;
     boxedIterator(): IterableIterator<FlexTreeField>;
     /**
      * The anchor node associated with this node
@@ -142,6 +141,25 @@ export interface FlexTreeNode extends FlexTreeEntity<FlexTreeNodeSchema> {
      * a separate Anchor (and thus ref count) must be allocated to keep it alive.
      */
     readonly anchorNode: AnchorNode;
+    /**
+     * Returns an iterable of keys for non-empty fields.
+     *
+     * @remarks
+     * All fields under a map implicitly exist, but `keys` will yield only the keys of fields which contain one or more nodes.
+     *
+     * No guarantees are made regarding the order of the keys returned.
+     */
+    keys(): IterableIterator<FieldKey>;
+    /**
+     * Schema for this entity.
+     * If well-formed, it must follow this schema.
+     */
+    readonly schema: TreeNodeSchemaIdentifier;
+    /**
+     * Schema for this entity.
+     * If well-formed, it must follow this schema.
+     */
+    readonly flexSchema: FlexTreeNodeSchema;
 }
 /**
  * A collaboratively editable collection of nodes within a {@link FlexTreeEntity}.
@@ -161,7 +179,7 @@ export interface FlexTreeNode extends FlexTreeEntity<FlexTreeNodeSchema> {
  * All content in the tree is accessible without down-casting, but if the schema is known,
  * the schema aware API may be more ergonomic.
  */
-export interface FlexTreeField extends FlexTreeEntity<FlexFieldSchema> {
+export interface FlexTreeField extends FlexTreeEntity {
     readonly [flexTreeMarker]: FlexTreeEntityKind.Field;
     /**
      * The number of nodes in this field
@@ -180,7 +198,7 @@ export interface FlexTreeField extends FlexTreeEntity<FlexFieldSchema> {
     /**
      * Type guard for narrowing / down-casting to a specific schema.
      */
-    is<TSchema extends FlexFieldSchema>(schema: TSchema): this is FlexTreeTypedField<TSchema>;
+    is<TKind extends FlexFieldKind>(kind: TKind): this is FlexTreeTypedField<TKind>;
     boxedIterator(): IterableIterator<FlexTreeNode>;
     /**
      * Gets a node of this field by its index without unboxing.
@@ -193,188 +211,16 @@ export interface FlexTreeField extends FlexTreeEntity<FlexFieldSchema> {
      * Semantics match {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at}.
      */
     boxedAt(index: number): FlexTreeNode | undefined;
-}
-/**
- * A {@link FlexTreeNode} that behaves like a `Map<string, Field>` for a specific `Field` type.
- *
- * @remarks
- * Unlike TypeScript Map type, {@link FlexTreeMapNode.get} always provides a reference to any field looked up, even if it has never been set.
- *
- * This means that, for example, a `MapNode` of {@link FlexTreeSequenceField} fields will return an empty sequence when a previously unused key is looked up,
- * and that sequence can be used to insert new items into the field.
- * Additionally empty fields (those containing no nodes) are not distinguished from fields which do not exist.
- * This differs from JavaScript Maps which have a subtle distinction between storing undefined as a value in the map and deleting an entry from the map.
- */
-export interface FlexTreeMapNode<in out TSchema extends FlexMapNodeSchema> extends FlexTreeNode {
-    readonly schema: TSchema;
-    /**
-     * Get the field for `key`.
-     * @param key - which map entry to look up.
-     *
-     * @remarks
-     * All fields under a map implicitly exist, so `get` can be called with any key and will always return a field.
-     * Even if the field is empty, it will still be returned, and can be edited to insert content into the map.
-     */
-    getBoxed(key: string): FlexTreeTypedField<TSchema["info"]>;
     /**
-     * Returns an iterable of keys in the map.
-     *
-     * @remarks
-     * All fields under a map implicitly exist, but `keys` will yield only the keys of fields which contain one or more nodes.
-     *
-     * No guarantees are made regarding the order of the keys returned.
-     */
-    keys(): IterableIterator<FieldKey>;
-    /**
-     * Returns an iterable of values in the map.
-     *
-     * @remarks
-     * All fields under a map implicitly exist, but `values` will yield only the fields containing one or more nodes.
-     *
-     * No guarantees are made regarding the order of the values returned.
-     */
-    values(): IterableIterator<FlexTreeUnboxField<TSchema["info"], "notEmpty">>;
-    /**
-     * Returns an iterable of key, value pairs for every entry in the map.
-     *
-     * @remarks
-     * All fields under a map implicitly exist, but `entries` will yield only the entries whose fields contain one or more nodes.
-     *
-     * This iteration provided by `entries()` is equivalent to that provided by direct iteration of the {@link FlexTreeMapNode} (a.k.a. `[Symbol.Iterator]()`).
-     *
-     * No guarantees are made regarding the order of the entries returned.
-     */
-    entries(): IterableIterator<[FieldKey, FlexTreeUnboxField<TSchema["info"], "notEmpty">]>;
-    /**
-     * Executes a provided function once per each key/value pair in the map.
-     * @param callbackFn - The function to run for each map entry
-     * @param thisArg - If present, `callbackFn` will be bound to `thisArg`
-     *
-     * @privateRemarks
-     * TODO: This should run over fields in insertion order if we want to match the javascript foreach spec.
-     */
-    forEach(callbackFn: (value: FlexTreeUnboxField<TSchema["info"], "notEmpty">, key: FieldKey, map: FlexTreeMapNode<TSchema>) => void, thisArg?: any): void;
-    /**
-     * Iterate through all fields in the map.
-     *
-     * @remarks
-     * No mutations to the current view of the shared tree are permitted during iteration.
-     * To iterate over the unboxed values of the map, use `Symbol.Iterator()`.
+     * Gets the FieldUpPath of a field.
      */
-    boxedIterator(): IterableIterator<FlexTreeTypedField<TSchema["info"]>>;
-    [Symbol.iterator](): IterableIterator<[
-        FieldKey,
-        FlexTreeUnboxField<TSchema["info"], "notEmpty">
-    ]>;
-}
-/**
- * A {@link FlexTreeNode} that behaves like an "object" or "struct", providing properties to access its fields.
- *
- * ObjectNodes consist of a finite collection of fields, each with their own (distinct) key and {@link FlexFieldSchema}.
- *
- * @remarks
- * ObjectNodes require complex typing, and have been split into two parts for implementation purposes.
- * See {@link FlexTreeObjectNodeTyped} for the schema aware extensions to this that provide access to the fields.
- *
- * These "Objects" resemble "Structs" from a wide variety of programming languages
- * (Including Algol 68, C, Go, Rust, C# etc.).
- * ObjectNodes also somewhat resemble JavaScript objects: this analogy is less precise (objects don't have a fixed schema for example),
- * but for consistency with other systems in the JavaScript ecosystem (like JSON) is "ObjectNodes" nodes are named "Objects".
- *
- * Another common name for this abstraction is [record](https://en.wikipedia.org/wiki/Record_(computer_science)).
- * The name "Record" is avoided (in favor of Object) here because it has less precise connotations for most TypeScript developers.
- * For example, TypeScript has a built in `Record` type, but it requires all of the fields to have the same type,
- * putting its semantics half way between this library's "Object" schema and {@link FlexTreeMapNode}.
- */
-export interface FlexTreeObjectNode extends FlexTreeNode {
-    readonly schema: FlexObjectNodeSchema;
-}
-/**
- * Leaf holding a value.
- *
- * @remarks
- * Leaves are immutable and have no children.
- * Leaf unboxes its content, so in schema aware APIs which do unboxing, the Leaf itself will be skipped over and its value will be returned directly.
- */
-export interface FlexTreeLeafNode<in out TSchema extends LeafNodeSchema> extends FlexTreeNode {
-    readonly schema: TSchema;
+    getFieldPath(): FieldUpPath;
     /**
-     * Value stored on this node.
+     * Schema for this entity.
+     * If well-formed, it must follow this schema.
      */
-    readonly value: TreeValue<TSchema["info"]>;
+    readonly schema: TreeFieldStoredSchema;
 }
-/**
- * An {@link FlexTreeObjectNode} with schema aware accessors for its fields.
- *
- * @privateRemarks
- *
- * The corresponding implementation logic for this lives in `LazyTree.ts` under `buildStructClass`.
- * If you change the signature here, you will need to update that logic to match.
- */
-export type FlexTreeObjectNodeTyped<TSchema extends FlexObjectNodeSchema> = FlexObjectNodeSchema extends TSchema ? FlexTreeObjectNode : FlexTreeObjectNode & FlexTreeObjectNodeFields<TSchema["info"]>;
-/**
- * Properties to access an object node's fields. See {@link FlexTreeObjectNodeTyped}.
- *
- * @privateRemarks
- * TODO: Support custom field keys.
- */
-export type FlexTreeObjectNodeFields<TFields extends FlexObjectNodeFields> = FlexTreeObjectNodeFieldsInner<FlattenKeys<{
-    [key in keyof TFields as key extends PropertyNameFromFieldKey<key & string> ? key : never]: TFields[key];
-} & {
-    [key in keyof TFields as key extends PropertyNameFromFieldKey<key & string> ? never : PropertyNameFromFieldKey<key & string>]: TFields[key];
-}>>;
-/**
- * Properties to access an object node's fields. See {@link FlexTreeObjectNodeTyped}.
- *
- * @privateRemarks
- * TODO: Do we keep assignment operator + "setFoo" methods, or just use methods?
- * Inconsistency in the API experience could confusing for consumers.
- */
-export type FlexTreeObjectNodeFieldsInner<TFields extends FlexObjectNodeFields> = FlattenKeys<{
-    readonly [key in keyof TFields as `boxed${Capitalize<key & string>}`]: FlexTreeTypedField<TFields[key]>;
-} & {
-    readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? never : key]: FlexTreeUnboxField<TFields[key]>;
-} & {
-    -readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? key : never]: FlexTreeUnboxField<TFields[key]>;
-} & {
-    readonly [key in keyof TFields as TFields[key]["kind"] extends AssignableFieldKinds ? `set${Capitalize<key & string>}` : never]: (content: FlexibleNodeContent) => void;
-}>;
-/**
- * Reserved object node field property names to avoid collisions with the rest of the object node API.
- */
-export declare const reservedObjectNodeFieldPropertyNames: readonly ["anchorNode", "constructor", "context", "is", "parentField", "schema", "tryGetField", "type", "value", "boxedIterator", "iterator", "getBoxed"];
-/**
- * Reserved object node field property names prefixes.
- * These are reserved to avoid collisions with properties derived from field other field names.
- *
- * Field names starting with these must be followed by a lowercase letter, or be escaped.
- */
-export declare const reservedObjectNodeFieldPropertyNamePrefixes: readonly ["set", "boxed", "field", "Field"];
-/**
- * {@link reservedObjectNodeFieldPropertyNamePrefixes} as a type union.
- */
-export type ReservedObjectNodeFieldPropertyNames = (typeof reservedObjectNodeFieldPropertyNames)[number];
-/**
- * {@link reservedObjectNodeFieldPropertyNamePrefixes} as a type union.
- */
-export type ReservedObjectNodeFieldPropertyNamePrefixes = (typeof reservedObjectNodeFieldPropertyNamePrefixes)[number];
-/**
- * Convert an object node's field key into an escaped string usable as a property name.
- *
- * @privateRemarks
- * TODO:
- * Collisions are still possible.
- * For example fields named "foo" and "Foo" would both produce a setter "setFoo".
- * Consider naming schemes to avoid this, ensure that there is a good workaround for these cases.
- * Another approach would be to support custom field names (separate from keys),
- * and do the escaping (if needed) when creating the flex tree schema (both when manually creating them and when doing so automatically):
- * this would enable better intellisense for escaped fields, as well as allow the feature of custom field property names.
- */
-export type PropertyNameFromFieldKey<T extends string> = T extends ReservedObjectNodeFieldPropertyNames ? `field${Capitalize<T>}` : T extends `${ReservedObjectNodeFieldPropertyNamePrefixes}${Capitalize<string>}` ? `field${Capitalize<T>}` : T;
-/**
- * Field kinds that allow value assignment.
- */
-export type AssignableFieldKinds = typeof FieldKinds.optional | typeof FieldKinds.required;
 /**
  * Typed tree for inserting as the content of a field.
  */
@@ -383,20 +229,6 @@ export type FlexibleFieldContent = ExclusiveMapTree[];
  * Tree for inserting as a node.
  */
 export type FlexibleNodeContent = ExclusiveMapTree;
-/**
- * Tree for inserting a subsequence of nodes.
- *
- * Used to insert a batch of 0 or more nodes into some location in a {@link FlexTreeSequenceField}.
- */
-export type FlexibleNodeSubSequence = ExclusiveMapTree[];
-/**
- * Type to ensures two types overlap in at least one way.
- * It evaluates to the input type if this is true, and never otherwise.
- * Examples:
- * CheckTypesOverlap\<number | boolean, number | object\> = number | boolean
- * CheckTypesOverlap\<number | boolean, string | object\> = never
- */
-export type CheckTypesOverlap<T, TCheck> = [Extract<T, TCheck> extends never ? never : T][0];
 /**
  * {@link FlexTreeField} that stores a sequence of children.
  *
@@ -413,7 +245,7 @@ export type CheckTypesOverlap<T, TCheck> = [Extract<T, TCheck> extends never ? n
  * Add anchor API that can actually hold onto locations in a sequence.
  * Currently only nodes can be held onto with anchors, and this does not replicate the behavior implemented for editing.
  */
-export interface FlexTreeSequenceField<in out TTypes extends FlexAllowedTypes> extends FlexTreeField {
+export interface FlexTreeSequenceField extends FlexTreeField {
     /**
      * Gets a node of this field by its index with unboxing.
      * @param index - Zero-based index of the item to retrieve. Negative values are interpreted from the end of the sequence.
@@ -424,32 +256,21 @@ export interface FlexTreeSequenceField<in out TTypes extends FlexAllowedTypes> e
      * @remarks
      * Semantics match {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at}.
      */
-    at(index: number): FlexTreeUnboxNodeUnion<TTypes> | undefined;
+    at(index: number): FlexTreeUnknownUnboxed | undefined;
     /**
      * {@inheritdoc FlexTreeField.boxedAt}
      */
-    boxedAt(index: number): FlexTreeTypedNodeUnion<TTypes> | undefined;
-    /**
-     * Calls the provided callback function on each child of this sequence, and returns an array that contains the results.
-     * @param callbackfn - A function that accepts the child and its index.
-     */
-    map<U>(callbackfn: (value: FlexTreeUnboxNodeUnion<TTypes>, index: number) => U): U[];
+    boxedAt(index: number): FlexTreeNode | undefined;
     /**
      * Calls the provided callback function on each child of this sequence, and returns an array that contains the results.
      * @param callbackfn - A function that accepts the child and its index.
      */
-    mapBoxed<U>(callbackfn: (value: FlexTreeTypedNodeUnion<TTypes>, index: number) => U): U[];
-    readonly length: number;
+    map<U>(callbackfn: (value: FlexTreeUnknownUnboxed, index: number) => U): U[];
     /**
      * Get an editor for this sequence.
      */
     readonly editor: SequenceFieldEditBuilder<FlexibleFieldContent>;
-    boxedIterator(): IterableIterator<FlexTreeTypedNodeUnion<TTypes>>;
-    /**
-     * Gets the FieldUpPath of a field.
-     */
-    getFieldPath(): FieldUpPath;
-    [Symbol.iterator](): IterableIterator<FlexTreeUnboxNodeUnion<TTypes>>;
+    boxedIterator(): IterableIterator<FlexTreeNode>;
 }
 /**
  * Field that stores exactly one child.
@@ -457,8 +278,8 @@ export interface FlexTreeSequenceField<in out TTypes extends FlexAllowedTypes> e
  * @remarks
  * Unboxes its content, so in schema aware APIs which do unboxing, the RequiredField itself will be skipped over and its content will be returned directly.
  */
-export interface FlexTreeRequiredField<in out TTypes extends FlexAllowedTypes> extends FlexTreeField {
-    get content(): FlexTreeUnboxNodeUnion<TTypes>;
+export interface FlexTreeRequiredField extends FlexTreeField {
+    get content(): FlexTreeUnknownUnboxed;
     readonly editor: ValueFieldEditBuilder<FlexibleNodeContent>;
 }
 /**
@@ -474,59 +295,14 @@ export interface FlexTreeRequiredField<in out TTypes extends FlexAllowedTypes> e
  * Better centralize the documentation about what kinds of merge semantics are available for field kinds.
  * Maybe link editor?
  */
-export interface FlexTreeOptionalField<in out TTypes extends FlexAllowedTypes> extends FlexTreeField {
-    get content(): FlexTreeUnboxNodeUnion<TTypes> | undefined;
+export interface FlexTreeOptionalField extends FlexTreeField {
+    get content(): FlexTreeUnknownUnboxed | undefined;
     readonly editor: OptionalFieldEditBuilder<FlexibleNodeContent>;
 }
 /**
  * Schema aware specialization of {@link FlexTreeField}.
  */
-export type FlexTreeTypedField<TSchema extends FlexFieldSchema> = FlexTreeTypedFieldInner<TSchema["kind"], TSchema["allowedTypes"]>;
-/**
- * Helper for implementing {@link FlexTreeTypedField}.
- */
-export type FlexTreeTypedFieldInner<Kind extends FlexFieldKind, Types extends FlexAllowedTypes> = Kind extends typeof FieldKinds.sequence ? FlexTreeSequenceField<Types> : Kind extends typeof FieldKinds.required ? FlexTreeRequiredField<Types> : Kind extends typeof FieldKinds.optional ? FlexTreeOptionalField<Types> : FlexTreeField;
-/**
- * Schema aware specialization of {@link FlexTreeNode} for a given {@link FlexAllowedTypes}.
- */
-export type FlexTreeTypedNodeUnion<T extends FlexAllowedTypes> = T extends FlexList<FlexTreeNodeSchema> ? FlexTreeTypedNode<Assume<FlexListToUnion<T>, FlexTreeNodeSchema>> : FlexTreeNode;
-/**
- * Schema aware specialization of {@link FlexTreeNode} for a given {@link FlexTreeNodeSchema}.
- */
-export type FlexTreeTypedNode<TSchema extends FlexTreeNodeSchema> = TSchema extends LeafNodeSchema ? FlexTreeLeafNode<TSchema> : TSchema extends FlexMapNodeSchema ? FlexTreeMapNode<TSchema> : TSchema extends FlexObjectNodeSchema ? FlexTreeObjectNodeTyped<TSchema> : FlexTreeNode;
-/**
- * Schema aware unboxed field.
- * @remarks
- * Unboxes fields to their content if appropriate for the kind.
- * Recursively unboxes that content (then its content etc.) as well if the node union does unboxing.
- */
-export type FlexTreeUnboxField<TSchema extends FlexFieldSchema, Emptiness extends "maybeEmpty" | "notEmpty" = "maybeEmpty"> = FlexTreeUnboxFieldInner<TSchema["kind"], TSchema["allowedTypes"], Emptiness>;
-/**
- * Helper for implementing FlexTreeUnboxField.
- */
-export type FlexTreeUnboxFieldInner<Kind extends FlexFieldKind, TTypes extends FlexAllowedTypes, Emptiness extends "maybeEmpty" | "notEmpty"> = Kind extends typeof FieldKinds.sequence ? FlexTreeSequenceField<TTypes> : Kind extends typeof FieldKinds.required ? FlexTreeUnboxNodeUnion<TTypes> : Kind extends typeof FieldKinds.optional ? FlexTreeUnboxNodeUnion<TTypes> | (Emptiness extends "notEmpty" ? never : undefined) : unknown;
-/**
- * Schema aware unboxed union of tree types.
- * @remarks
- * Unboxes when not polymorphic.
- * Recursively unboxes that content as well if the node kind does unboxing.
- */
-export type FlexTreeUnboxNodeUnion<TTypes extends FlexAllowedTypes> = TTypes extends readonly [
-    LazyItem<infer InnerType>
-] ? InnerType extends FlexTreeNodeSchema ? FlexTreeUnboxNode<InnerType> : InnerType extends Any ? FlexTreeNode : unknown : boolean extends IsArrayOfOne<TTypes> ? FlexTreeUnknownUnboxed : FlexTreeTypedNodeUnion<TTypes>;
-/**
- * `true` if T is known to be an array of one item.
- * `false` if T is known not to be an array of one item.
- * `boolean` if it is unknown if T is an array of one item or not.
- */
-export type IsArrayOfOne<T extends readonly unknown[]> = T["length"] extends 1 ? true : 1 extends T["length"] ? boolean : false;
-/**
- * Schema aware unboxed tree type.
- * @remarks
- * Unboxes if the node kind does unboxing.
- * Recursively unboxes that content as well if it does unboxing.
- */
-export type FlexTreeUnboxNode<TSchema extends FlexTreeNodeSchema> = TSchema extends LeafNodeSchema ? TreeValue<TSchema["info"]> : TSchema extends FlexMapNodeSchema ? FlexTreeMapNode<TSchema> : TSchema extends FlexObjectNodeSchema ? FlexTreeObjectNodeTyped<TSchema> : FlexTreeUnknownUnboxed;
+export type FlexTreeTypedField<Kind extends FlexFieldKind> = Kind extends typeof FieldKinds.sequence ? FlexTreeSequenceField : Kind extends typeof FieldKinds.required ? FlexTreeRequiredField : Kind extends typeof FieldKinds.optional ? FlexTreeOptionalField : FlexTreeField;
 /**
  * Unboxed tree type for unknown schema cases.
  */

package/lib/feature-libraries/flex-tree/flexTreeTypes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"flexTreeTypes.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/flexTreeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,KAAK,UAAU,EACf,KAAK,gBAAgB,EACrB,KAAK,QAAQ,EACb,KAAK,WAAW,EAChB,KAAK,SAAS,EAEd,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAC/D,OAAO,KAAK,EACX,UAAU,EACV,wBAAwB,EACxB,qBAAqB,EACrB,wBAAwB,EACxB,MAAM,4BAA4B,CAAC;AACpC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,KAAK,EACX,GAAG,EACH,gBAAgB,EAChB,eAAe,EACf,QAAQ,EACR,eAAe,EACf,iBAAiB,EACjB,oBAAoB,EACpB,oBAAoB,EACpB,kBAAkB,EAClB,QAAQ,EACR,cAAc,EACd,MAAM,0BAA0B,CAAC;AAElC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD;;;GAGG;AACH,eAAO,MAAM,YAAY,wDAA6B,CAAC;AAEvD;;GAEG;AACH,eAAO,MAAM,cAAc,eAA2B,CAAC;AAEvD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,cAAc,CAEhE;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,YAAY,CAE5D;AAED;GACG;AACH,oBAAY,kBAAkB;IAC7B,IAAI,IAAA;IACJ,KAAK,IAAA;CACL;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,cAAc,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO;IACpD;;;OAGG;IACH,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC;IAE9C;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAEzB;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,eAAe,CAAC;IAEnC;;;;;OAKG;IACH,aAAa,IAAI,gBAAgB,CAAC,cAAc,CAAC,CAAC;CAClD;AAED;;;GAGG;AACH,oBAAY,UAAU;IACrB;;OAEG;IACH,UAAU,IAAI;IAEd;;OAEG;IACH,OAAO,IAAI;IAEX;;OAEG;IACH,OAAO,IAAI;IAEX;;OAEG;IACH,GAAG,IAAI;CACP;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,YAAa,SAAQ,cAAc,CAAC,kBAAkB,CAAC;IACvE,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC,IAAI,CAAC;IAEnD;;OAEG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;IAE3B;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,GAAG,aAAa,CAAC;IAEtD;;;;;;;;OAQG;IACH,QAAQ,CAAC,GAAG,EAAE,QAAQ,GAAG,aAAa,CAAC;IAEvC;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAEjF;;OAEG;IACH,EAAE,CAAC,OAAO,SAAS,kBAAkB,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAE5F,aAAa,IAAI,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAEjD;;;;;;;OAOG;IACH,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,WAAW,aAAc,SAAQ,cAAc,CAAC,eAAe,CAAC;IACrE,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC,KAAK,CAAC;IAEpD;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB;;;OAGG;IACH,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IAEvB;;;OAGG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC;IAE/B;;OAEG;IACH,EAAE,CAAC,OAAO,SAAS,eAAe,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAE1F,aAAa,IAAI,gBAAgB,CAAC,YAAY,CAAC,CAAC;IAEhD;;;;;;;;;OASG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAAC;CACjD;AAID;;;;;;;;;;GAUG;AACH,MAAM,WAAW,eAAe,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,SAAS,iBAAiB,CACxE,SAAQ,YAAY;IACpB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAEzB;;;;;;;OAOG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D;;;;;;;OAOG;IACH,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAEnC;;;;;;;OAOG;IACH,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAE5E;;;;;;;;;OASG;IACH,OAAO,IAAI,gBAAgB,CAAC,CAAC,QAAQ,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAEzF;;;;;;;OAOG;IACH,OAAO,CACN,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,EACtD,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,eAAe,CAAC,OAAO,CAAC,KACzB,IAAI,EAET,OAAO,CAAC,EAAE,GAAG,GACX,IAAI,CAAC;IAER;;;;;;OAMG;IACH,aAAa,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAEvE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CACpC;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,WAAW,kBAAmB,SAAQ,YAAY;IACvD,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;CACtC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,SAAS,cAAc,CAAE,SAAQ,YAAY;IAC5F,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAEzB;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;CAC3C;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,CAAC,OAAO,SAAS,oBAAoB,IACvE,oBAAoB,SAAS,OAAO,GACjC,kBAAkB,GAClB,kBAAkB,GAAG,wBAAwB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAEnE;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,CAAC,OAAO,SAAS,oBAAoB,IACxE,6BAA6B,CAC5B,WAAW,CACV;KAEE,GAAG,IAAI,MAAM,OAAO,IAAI,GAAG,SAAS,wBAAwB,CAAC,GAAG,GAAG,MAAM,CAAC,GACxE,GAAG,GACH,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;CACvB,GAAG;KACF,GAAG,IAAI,MAAM,OAAO,IAAI,GAAG,SAAS,wBAAwB,CAAC,GAAG,GAAG,MAAM,CAAC,GACxE,KAAK,GACL,wBAAwB,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC;CACxD,CACD,CACD,CAAC;AAEH;;;;;;GAMG;AACH,MAAM,MAAM,6BAA6B,CAAC,OAAO,SAAS,oBAAoB,IAAI,WAAW,CAC5F;IAEC,QAAQ,EAAE,GAAG,IAAI,MAAM,OAAO,IAAI,QAAQ,UAAU,CAAC,GAAG,GAAG,MAAM,CAAC,EAAE,GAAG,kBAAkB,CACxF,OAAO,CAAC,GAAG,CAAC,CACZ;CACD,GAAG;IAIH,QAAQ,EAAE,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GAChF,KAAK,GACL,GAAG,GAAG,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACzC,GAAG;IAIH,CAAC,UAAU,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GACjF,GAAG,GACH,KAAK,GAAG,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CAC3C,GAAG;IAEH,QAAQ,EAAE,GAAG,IAAI,MAAM,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,oBAAoB,GAChF,MAAM,UAAU,CAAC,GAAG,GAAG,MAAM,CAAC,EAAE,GAChC,KAAK,GAAG,CAAC,OAAO,EAAE,mBAAmB,KAAK,IAAI;CACjD,CACD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oCAAoC,2JAavC,CAAC;AAEX;;;;;GAKG;AACH,eAAO,MAAM,2CAA2C,6CAK9C,CAAC;AAEX;;GAEG;AACH,MAAM,MAAM,oCAAoC,GAC/C,CAAC,OAAO,oCAAoC,CAAC,CAAC,MAAM,CAAC,CAAC;AAEvD;;GAEG;AACH,MAAM,MAAM,2CAA2C,GACtD,CAAC,OAAO,2CAA2C,CAAC,CAAC,MAAM,CAAC,CAAC;AAE9D;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,wBAAwB,CAAC,CAAC,SAAS,MAAM,IACpD,CAAC,SAAS,oCAAoC,GAC3C,QAAQ,UAAU,CAAC,CAAC,CAAC,EAAE,GACvB,CAAC,SAAS,GAAG,2CAA2C,GAAG,UAAU,CAAC,MAAM,CAAC,EAAE,GAC9E,QAAQ,UAAU,CAAC,CAAC,CAAC,EAAE,GACvB,CAAC,CAAC;AAEP;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,OAAO,UAAU,CAAC,QAAQ,GAAG,OAAO,UAAU,CAAC,QAAQ,CAAC;AAM3F;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,gBAAgB,EAAE,CAAC;AAEtD;;GAEG;AACH,MAAM,MAAM,mBAAmB,GAAG,gBAAgB,CAAC;AAEnD;;;;GAIG;AACH,MAAM,MAAM,uBAAuB,GAAG,gBAAgB,EAAE,CAAC;AAEzD;;;;;;GAMG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7F;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,qBAAqB,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,SAAS,gBAAgB,CAC5E,SAAQ,aAAa;IACrB;;;;;;;;;OASG;IACH,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IAE9D;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IAEnE;;;OAGG;IACH,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IAErF;;;OAGG;IACH,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IAE1F,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC,oBAAoB,CAAC,CAAC;IAEhE,aAAa,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC;IAElE;;OAEG;IACH,YAAY,IAAI,WAAW,CAAC;IAE5B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC;CACtE;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAqB,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,SAAS,gBAAgB,CAC5E,SAAQ,aAAa;IACrB,IAAI,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAE9C,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC,mBAAmB,CAAC,CAAC;CAC5D;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,qBAAqB,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,SAAS,gBAAgB,CAC5E,SAAQ,aAAa;IACrB,IAAI,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IAE1D,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC,mBAAmB,CAAC,CAAC;CAC/D;AAMD;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,OAAO,SAAS,eAAe,IAAI,uBAAuB,CACxF,OAAO,CAAC,MAAM,CAAC,EACf,OAAO,CAAC,cAAc,CAAC,CACvB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,CAClC,IAAI,SAAS,aAAa,EAC1B,KAAK,SAAS,gBAAgB,IAC3B,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACxC,qBAAqB,CAAC,KAAK,CAAC,GAC5B,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,qBAAqB,CAAC,KAAK,CAAC,GAC5B,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,qBAAqB,CAAC,KAAK,CAAC,GAC5B,aAAa,CAAC;AAEnB;;GAEG;AACH,MAAM,MAAM,sBAAsB,CAAC,CAAC,SAAS,gBAAgB,IAC5D,CAAC,SAAS,QAAQ,CAAC,kBAAkB,CAAC,GACnC,iBAAiB,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,GACjE,YAAY,CAAC;AAEjB;;GAEG;AACH,MAAM,MAAM,iBAAiB,CAAC,OAAO,SAAS,kBAAkB,IAC/D,OAAO,SAAS,cAAc,GAC3B,gBAAgB,CAAC,OAAO,CAAC,GACzB,OAAO,SAAS,iBAAiB,GAChC,eAAe,CAAC,OAAO,CAAC,GACxB,OAAO,SAAS,oBAAoB,GACnC,uBAAuB,CAAC,OAAO,CAAC,GAChC,YAAY,CAAC;AAMnB;;;;;GAKG;AACH,MAAM,MAAM,kBAAkB,CAC7B,OAAO,SAAS,eAAe,EAE/B,SAAS,SAAS,YAAY,GAAG,UAAU,GAAG,YAAY,IACvD,uBAAuB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,EAAE,SAAS,CAAC,CAAC;AAEjF;;GAEG;AACH,MAAM,MAAM,uBAAuB,CAClC,IAAI,SAAS,aAAa,EAC1B,MAAM,SAAS,gBAAgB,EAC/B,SAAS,SAAS,YAAY,GAAG,UAAU,IACxC,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACxC,qBAAqB,CAAC,MAAM,CAAC,GAC7B,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,sBAAsB,CAAC,MAAM,CAAC,GAC9B,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,SAAS,UAAU,GAAG,KAAK,GAAG,SAAS,CAAC,GAEpF,OAAO,CAAC;AAEZ;;;;;GAKG;AACH,MAAM,MAAM,sBAAsB,CAAC,MAAM,SAAS,gBAAgB,IAAI,MAAM,SAAS,SAAS;IAC7F,QAAQ,CAAC,MAAM,SAAS,CAAC;CACzB,GACE,SAAS,SAAS,kBAAkB,GACnC,iBAAiB,CAAC,SAAS,CAAC,GAC5B,SAAS,SAAS,GAAG,GACpB,YAAY,GAEb,OAAO,GACR,OAAO,SAAS,YAAY,CAAC,MAAM,CAAC,GACnC,sBAAsB,GACtB,sBAAsB,CAAC,MAAM,CAAC,CAAC;AAEnC;;;;GAIG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAC3E,IAAI,GACJ,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,GACpB,OAAO,GACP,KAAK,CAAC;AAEV;;;;;GAKG;AACH,MAAM,MAAM,iBAAiB,CAAC,OAAO,SAAS,kBAAkB,IAC/D,OAAO,SAAS,cAAc,GAC3B,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAC1B,OAAO,SAAS,iBAAiB,GAChC,eAAe,CAAC,OAAO,CAAC,GACxB,OAAO,SAAS,oBAAoB,GACnC,uBAAuB,CAAC,OAAO,CAAC,GAChC,sBAAsB,CAAC;AAE7B;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,SAAS,GAAG,YAAY,CAAC"}
+{"version":3,"file":"flexTreeTypes.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/flexTreeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,KAAK,UAAU,EACf,KAAK,gBAAgB,EACrB,KAAK,QAAQ,EACb,KAAK,WAAW,EAChB,KAAK,qBAAqB,EAC1B,KAAK,wBAAwB,EAC7B,KAAK,SAAS,EAEd,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EACX,UAAU,EACV,wBAAwB,EACxB,qBAAqB,EACrB,wBAAwB,EACxB,MAAM,4BAA4B,CAAC;AACpC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAEnE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD;;;GAGG;AACH,eAAO,MAAM,YAAY,wDAA6B,CAAC;AAEvD;;GAEG;AACH,eAAO,MAAM,cAAc,eAA2B,CAAC;AAMvD,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,YAAY,CAE5D;AAED;GACG;AACH,oBAAY,kBAAkB;IAC7B,IAAI,IAAA;IACJ,KAAK,IAAA;CACL;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,cAAc;IAC9B;;;OAGG;IACH,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC;IAE9C;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC;CAClC;AAED;;;GAGG;AACH,oBAAY,UAAU;IACrB;;OAEG;IACH,UAAU,IAAI;IAEd;;OAEG;IACH,OAAO,IAAI;IAEX;;OAEG;IACH,OAAO,IAAI;IAEX;;;;;;;;;;;;;;;;OAgBG;IACH,GAAG,IAAI;CACP;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,YAAa,SAAQ,cAAc;IACnD,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC,IAAI,CAAC;IAEnD;;OAEG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;IAE3B;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,GAAG,aAAa,CAAC;IAEtD;;;;;;;;OAQG;IACH,QAAQ,CAAC,GAAG,EAAE,QAAQ,GAAG,aAAa,CAAC;IAEvC;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAEjF;;OAEG;IACH,EAAE,CAAC,MAAM,EAAE,kBAAkB,GAAG,OAAO,CAAC;IAExC,aAAa,IAAI,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAEjD;;;;;;;OAOG;IACH,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAEhC;;;;;;;OAOG;IACH,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAEnC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC;IAE1C;;;OAGG;IACH,QAAQ,CAAC,UAAU,EAAE,kBAAkB,CAAC;CACxC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,WAAW,aAAc,SAAQ,cAAc;IACpD,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,kBAAkB,CAAC,KAAK,CAAC;IAEpD;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB;;;OAGG;IACH,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IAEvB;;;OAGG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC;IAE/B;;OAEG;IACH,EAAE,CAAC,KAAK,SAAS,aAAa,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAEhF,aAAa,IAAI,gBAAgB,CAAC,YAAY,CAAC,CAAC;IAEhD;;;;;;;;;OASG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAAC;IAEjD;;OAEG;IACH,YAAY,IAAI,WAAW,CAAC;IAE5B;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC;CACvC;AAID;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,gBAAgB,EAAE,CAAC;AAEtD;;GAEG;AACH,MAAM,MAAM,mBAAmB,GAAG,gBAAgB,CAAC;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,qBAAsB,SAAQ,aAAa;IAC3D;;;;;;;;;OASG;IACH,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,GAAG,SAAS,CAAC;IAEtD;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAAC;IAEjD;;;OAGG;IACH,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IAE7E;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC,oBAAoB,CAAC,CAAC;IAEhE,aAAa,IAAI,gBAAgB,CAAC,YAAY,CAAC,CAAC;CAChD;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAsB,SAAQ,aAAa;IAC3D,IAAI,OAAO,IAAI,sBAAsB,CAAC;IAEtC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC,mBAAmB,CAAC,CAAC;CAC5D;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,qBAAsB,SAAQ,aAAa;IAC3D,IAAI,OAAO,IAAI,sBAAsB,GAAG,SAAS,CAAC;IAElD,QAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC,mBAAmB,CAAC,CAAC;CAC/D;AAMD;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,IAAI,SAAS,aAAa,IACxD,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACpC,qBAAqB,GACrB,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,qBAAqB,GACrB,IAAI,SAAS,OAAO,UAAU,CAAC,QAAQ,GACtC,qBAAqB,GACrB,aAAa,CAAC;AAIpB;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,SAAS,GAAG,YAAY,CAAC"}

package/lib/feature-libraries/flex-tree/flexTreeTypes.js

@@ -12,7 +12,7 @@ export const flexTreeSlot = anchorSlot();
  * Indicates that an object is a flex tree.
  */
 export const flexTreeMarker = Symbol("flexTreeMarker");
-export function isFlexTreeEntity(t) {
+function isFlexTreeEntity(t) {
     return typeof t === "object" && t !== null && flexTreeMarker in t;
 }
 export function isFlexTreeNode(t) {
@@ -45,37 +45,21 @@ export var TreeStatus;
     TreeStatus[TreeStatus["Deleted"] = 2] = "Deleted";
     /**
      * Is created but has not yet been inserted into the tree.
+     * @remarks
+     * See also {@link Unhydrated}.
+     *
+     * Nodes in the new state have some limitations:
+     *
+     * - Events are not currently triggered for changes. Fixes for this are planned.
+     *
+     * - Reading identifiers from nodes which were left unspecified (defaulted) when creating the tree will error.
+     * This is because allocating unique identifiers in a compressible manner requires knowing which tree the nodes will be inserted into.
+     *
+     * - Transactions do not work: transactions apply to a single {@link TreeView}, and `New` nodes are not part of one.
+     *
+     * - `Tree.shortId` (when the identifier was explicitly specified and thus works at all) will just return the full identifier as a string,
+     * but might return a compressed form as a number once hydrated.
      */
     TreeStatus[TreeStatus["New"] = 3] = "New";
 })(TreeStatus || (TreeStatus = {}));
-/**
- * Reserved object node field property names to avoid collisions with the rest of the object node API.
- */
-export const reservedObjectNodeFieldPropertyNames = [
-    "anchorNode",
-    "constructor",
-    "context",
-    "is",
-    "parentField",
-    "schema",
-    "tryGetField",
-    "type",
-    "value",
-    "boxedIterator",
-    "iterator",
-    "getBoxed",
-];
-/**
- * Reserved object node field property names prefixes.
- * These are reserved to avoid collisions with properties derived from field other field names.
- *
- * Field names starting with these must be followed by a lowercase letter, or be escaped.
- */
-export const reservedObjectNodeFieldPropertyNamePrefixes = [
-    "set",
-    "boxed",
-    "field",
-    "Field",
-];
-// #endregion
 //# sourceMappingURL=flexTreeTypes.js.map