@fluidframework/tree 2.3.1 → 2.4.0-297027

package/src/feature-libraries/modular-schema/modularChangeFamily.ts

@@ -38,6 +38,7 @@ import {
 	revisionMetadataSourceFromInfo,
 	areEqualChangeAtomIds,
 	type ChangeAtomId,
+	areEqualChangeAtomIdOpts,
 } from "../../core/index.js";
 import {
 	type IdAllocationState,
@@ -263,8 +264,6 @@ export class ModularChangeFamily
 		const genId: IdAllocator = idAllocatorFromState(idState);
 		const revisionMetadata: RevisionMetadataSource = revisionMetadataSourceFromInfo(revInfos);
 
-		const crossFieldTable = newComposeTable(change1, change2);
-
 		// We merge nodeChanges, nodeToParent, and nodeAliases from the two changesets.
 		// The merged tables will have correct entries for all nodes which are only referenced in one of the input changesets.
 		// During composeFieldMaps and composeInvalidatedElements we will find all nodes referenced in both input changesets
@@ -284,9 +283,12 @@ export class ModularChangeFamily
 			mergeBTrees(change1.nodeAliases, change2.nodeAliases),
 		);
 
+		const crossFieldTable = newComposeTable(change1, change2, composedNodeToParent);
+
 		const composedFields = this.composeFieldMaps(
 			change1.fieldChanges,
 			change2.fieldChanges,
+			undefined,
 			genId,
 			crossFieldTable,
 			revisionMetadata,
@@ -321,7 +323,7 @@ export class ModularChangeFamily
 	): void {
 		const context = crossFieldTable.fieldToContext.get(fieldChange);
 		assert(context !== undefined, 0x8cc /* Should have context for every invalidated field */);
-		const { change1: fieldChange1, change2: fieldChange2, composedChange } = context;
+		const { fieldId, change1: fieldChange1, change2: fieldChange2, composedChange } = context;
 
 		const rebaser = getChangeHandler(this.fieldKinds, composedChange.fieldKind).rebaser;
 		const composeNodes = (child1: NodeId | undefined, child2: NodeId | undefined): NodeId => {
@@ -342,7 +344,7 @@ export class ModularChangeFamily
 			fieldChange2,
 			composeNodes,
 			genId,
-			new ComposeManager(crossFieldTable, fieldChange, false),
+			new ComposeManager(crossFieldTable, fieldChange, fieldId, false),
 			revisionMetadata,
 		);
 		composedChange.change = brand(amendedChange);
@@ -470,7 +472,14 @@ export class ModularChangeFamily
 				? [fieldChange, emptyChange]
 				: [emptyChange, fieldChange];
 
-			const composedField = this.composeFieldChanges(change1, change2, genId, table, metadata);
+			const composedField = this.composeFieldChanges(
+				fieldId,
+				change1,
+				change2,
+				genId,
+				table,
+				metadata,
+			);
 
 			if (fieldId.nodeId === undefined) {
 				composedFields.set(fieldId.field, composedField);
@@ -499,6 +508,7 @@ export class ModularChangeFamily
 	private composeFieldMaps(
 		change1: FieldChangeMap | undefined,
 		change2: FieldChangeMap | undefined,
+		parentId: NodeId | undefined,
 		genId: IdAllocator,
 		crossFieldTable: ComposeTable,
 		revisionMetadata: RevisionMetadataSource,
@@ -509,10 +519,12 @@ export class ModularChangeFamily
 		}
 
 		for (const [field, fieldChange1] of change1) {
+			const fieldId: FieldId = { nodeId: parentId, field };
 			const fieldChange2 = change2.get(field);
 			const composedField =
 				fieldChange2 !== undefined
 					? this.composeFieldChanges(
+							fieldId,
 							fieldChange1,
 							fieldChange2,
 							genId,
@@ -545,6 +557,7 @@ export class ModularChangeFamily
 	 * Any composed `FieldChange` which is invalidated by new cross-field information will be added to `crossFieldTable.invalidatedFields`.
 	 */
 	private composeFieldChanges(
+		fieldId: FieldId,
 		change1: FieldChange,
 		change2: FieldChange,
 		idAllocator: IdAllocator,
@@ -558,7 +571,7 @@ export class ModularChangeFamily
 			change2: change2Normalized,
 		} = this.normalizeFieldChanges(change1, change2, idAllocator, revisionMetadata);
 
-		const manager = new ComposeManager(crossFieldTable, change1);
+		const manager = new ComposeManager(crossFieldTable, change1, fieldId);
 
 		const composedChange = changeHandler.rebaser.compose(
 			change1Normalized,
@@ -581,6 +594,7 @@ export class ModularChangeFamily
 		};
 
 		crossFieldTable.fieldToContext.set(change1, {
+			fieldId,
 			change1: change1Normalized,
 			change2: change2Normalized,
 			composedChange: composedField,
@@ -605,6 +619,7 @@ export class ModularChangeFamily
 		const nodeChangeset1 = nodeChangeFromId(nodeChanges1, id1);
 		const nodeChangeset2 = nodeChangeFromId(nodeChanges2, id2);
 		const composedNodeChangeset = this.composeNodeChanges(
+			id1,
 			nodeChangeset1,
 			nodeChangeset2,
 			idAllocator,
@@ -627,6 +642,7 @@ export class ModularChangeFamily
 	}
 
 	private composeNodeChanges(
+		nodeId: NodeId,
 		change1: NodeChangeset,
 		change2: NodeChangeset,
 		genId: IdAllocator,
@@ -638,6 +654,7 @@ export class ModularChangeFamily
 		const composedFieldChanges = this.composeFieldMaps(
 			change1.fieldChanges,
 			change2.fieldChanges,
+			nodeId,
 			genId,
 			crossFieldTable,
 			revisionMetadata,
@@ -887,7 +904,7 @@ export class ModularChangeFamily
 			rebasedNodes,
 		);
 
-		return makeModularChangeset(
+		const rebased = makeModularChangeset(
 			this.pruneFieldMap(rebasedFields, rebasedNodes),
 			rebasedNodes,
 			crossFieldTable.rebasedNodeToParent,
@@ -900,6 +917,8 @@ export class ModularChangeFamily
 			change.destroys,
 			change.refreshers,
 		);
+
+		return rebased;
 	}
 
 	// This performs a first pass on all fields which have both new and base changes.
@@ -1584,6 +1603,57 @@ export class ModularChangeFamily
 		const emptyChange = getChangeHandler(this.fieldKinds, fieldKind).createEmpty();
 		return { fieldKind, change: brand(emptyChange) };
 	}
+
+	public validateChangeset(change: ModularChangeset): void {
+		let numNodes = this.validateFieldChanges(change, change.fieldChanges, undefined);
+
+		for (const [[revision, localId], node] of change.nodeChanges.entries()) {
+			if (node.fieldChanges === undefined) {
+				continue;
+			}
+
+			const nodeId: NodeId = { revision, localId };
+			const numChildren = this.validateFieldChanges(change, node.fieldChanges, nodeId);
+
+			numNodes += numChildren;
+		}
+
+		assert(numNodes === change.nodeChanges.size, "Node table contains unparented nodes");
+	}
+
+	/**
+	 * Asserts that each child and cross field key in each field has a correct entry in
+	 * `nodeToParent` or `crossFieldKeyTable`.
+	 * @returns the number of children found.
+	 */
+	private validateFieldChanges(
+		change: ModularChangeset,
+		fieldChanges: FieldChangeMap,
+		nodeParent: NodeId | undefined,
+	): number {
+		let numChildren = 0;
+		for (const [field, fieldChange] of fieldChanges.entries()) {
+			const fieldId = { nodeId: nodeParent, field };
+			const handler = getChangeHandler(this.fieldKinds, fieldChange.fieldKind);
+			for (const [child, _index] of handler.getNestedChanges(fieldChange.change)) {
+				const parentFieldId = getParentFieldId(change, child);
+				assert(areEqualFieldIds(parentFieldId, fieldId), "Inconsistent node parentage");
+				numChildren += 1;
+			}
+
+			for (const keyRange of handler.getCrossFieldKeys(fieldChange.change)) {
+				const fields = getFieldsForCrossFieldKey(change, keyRange);
+				assert(
+					fields.length === 1 &&
+						fields[0] !== undefined &&
+						areEqualFieldIds(fields[0], fieldId),
+					"Inconsistent cross field keys",
+				);
+			}
+		}
+
+		return numChildren;
+	}
 }
 
 function replaceCrossFieldKeyTableRevisions(
@@ -2059,6 +2129,7 @@ interface RebaseFieldContext {
 function newComposeTable(
 	baseChange: ModularChangeset,
 	newChange: ModularChangeset,
+	composedNodeToParent: ChangeAtomIdBTree<FieldId>,
 ): ComposeTable {
 	return {
 		...newCrossFieldTable<FieldChange>(),
@@ -2068,6 +2139,7 @@ function newComposeTable(
 		newFieldToBaseField: new Map(),
 		newToBaseNodeId: newTupleBTree(),
 		composedNodes: new Set(),
+		composedNodeToParent,
 		pendingCompositions: {
 			nodeIdsToCompose: [],
 			affectedBaseFields: newTupleBTree(),
@@ -2087,6 +2159,7 @@ interface ComposeTable extends CrossFieldTable<FieldChange> {
 	readonly newFieldToBaseField: Map<FieldChange, FieldChange>;
 	readonly newToBaseNodeId: ChangeAtomIdBTree<NodeId>;
 	readonly composedNodes: Set<NodeChangeset>;
+	readonly composedNodeToParent: ChangeAtomIdBTree<FieldId>;
 	readonly pendingCompositions: PendingCompositions;
 }
 
@@ -2109,6 +2182,10 @@ interface PendingCompositions {
 }
 
 interface ComposeFieldContext {
+	/**
+	 * The field ID for this field in the composed changeset.
+	 */
+	fieldId: FieldId;
 	change1: FieldChangeset;
 	change2: FieldChangeset;
 	composedChange: FieldChange;
@@ -2324,7 +2401,12 @@ class RebaseManager extends CrossFieldManagerI<FieldChange> {
 
 // TODO: Deduplicate this with RebaseTable
 class ComposeManager extends CrossFieldManagerI<FieldChange> {
-	public constructor(table: ComposeTable, currentField: FieldChange, allowInval = true) {
+	public constructor(
+		table: ComposeTable,
+		currentField: FieldChange,
+		private readonly fieldId: FieldId,
+		allowInval = true,
+	) {
 		super(table, currentField, allowInval);
 	}
 
@@ -2377,15 +2459,16 @@ class ComposeManager extends CrossFieldManagerI<FieldChange> {
 	}
 
 	public override onMoveIn(id: ChangeAtomId): void {
-		throw new Error("Method not implemented.");
+		setInChangeAtomIdMap(this.table.composedNodeToParent, id, this.fieldId);
 	}
+
 	public override moveKey(
 		target: CrossFieldTarget,
 		revision: RevisionTag | undefined,
 		id: ChangesetLocalId,
 		count: number,
 	): void {
-		throw new Error("Method not implemented.");
+		throw new Error("Moving cross-field keys during compose is currently unsupported");
 	}
 
 	private get table(): ComposeTable {
@@ -3022,3 +3105,7 @@ function getFromChangeAtomIdMap<T>(
 function setInChangeAtomIdMap<T>(map: ChangeAtomIdBTree<T>, id: ChangeAtomId, value: T): void {
 	map.set([id.revision, id.localId], value);
 }
+
+function areEqualFieldIds(a: FieldId, b: FieldId): boolean {
+	return areEqualChangeAtomIdOpts(a.nodeId, b.nodeId) && a.field === b.field;
+}

package/src/feature-libraries/sequence-field/compose.ts

@@ -576,6 +576,9 @@ export class ComposeQueue {
 	private dequeueBase(length: number = Infinity): ComposeMarks {
 		const baseMark = this.baseMarks.dequeueUpTo(length);
 		const movedChanges = getMovedChangesFromMark(this.moveEffects, baseMark);
+		if (movedChanges !== undefined) {
+			this.moveEffects.onMoveIn(movedChanges);
+		}
 
 		const newMark = createNoopMark(baseMark.count, movedChanges, getOutputCellId(baseMark));
 		return { baseMark, newMark };

package/src/feature-libraries/sequence-field/utils.ts

@@ -10,6 +10,7 @@ import {
 	type ChangesetLocalId,
 	type RevisionMetadataSource,
 	type RevisionTag,
+	areEqualChangeAtomIdOpts,
 	areEqualChangeAtomIds,
 	makeChangeAtomId,
 } from "../../core/index.js";
@@ -118,10 +119,7 @@ export function isActiveReattach(
 }
 
 export function areEqualCellIds(a: CellId | undefined, b: CellId | undefined): boolean {
-	if (a === undefined || b === undefined) {
-		return a === b;
-	}
-	return areEqualChangeAtomIds(a, b);
+	return areEqualChangeAtomIdOpts(a, b);
 }
 
 export function getInputCellId(mark: Mark): CellId | undefined {

package/src/feature-libraries/typed-schema/flexList.ts

@@ -49,33 +49,17 @@ export function markEager<T>(t: T): T {
  */
 export type FlexList<Item = unknown> = readonly LazyItem<Item>[];
 
-/**
- * Given a `FlexList` of eager and lazy items, return an equivalent list where all items are lazy.
- */
-export function normalizeFlexListLazy<List extends FlexList>(
-	t: List,
-): FlexListToLazyArray<List> {
-	return t.map((value: LazyItem) => {
-		if (isLazy(value)) {
-			return value;
-		}
-		return () => value;
-	}) as FlexListToLazyArray<List>;
-}
-
 /**
  * Given a `FlexList` of eager and lazy items, return an equivalent list where all items are eager.
  */
-export function normalizeFlexListEager<List extends FlexList>(
-	t: List,
-): FlexListToNonLazyArray<List> {
-	const data: readonly unknown[] = t.map((value: LazyItem) => {
+export function normalizeFlexListEager<T>(t: FlexList<T>): T[] {
+	const data: T[] = t.map((value: LazyItem<T>) => {
 		if (isLazy(value)) {
 			return value();
 		}
 		return value;
 	});
-	return data as FlexListToNonLazyArray<List>;
+	return data;
 }
 
 /**
@@ -86,12 +70,6 @@ export function normalizeFlexListEager<List extends FlexList>(
  */
 export type LazyItem<Item = unknown> = Item | (() => Item);
 
-/**
- */
-export type NormalizedFlexList<Item> = readonly Item[];
-
-export type NormalizedLazyFlexList<Item> = (() => Item)[];
-
 /**
  * Get the `Item` type from a `LazyItem<Item>`.
  * @system @public
@@ -100,67 +78,8 @@ export type ExtractItemType<Item extends LazyItem> = Item extends () => infer Re
 	? Result
 	: Item;
 
-/**
- */
-export type ExtractListItemType<List extends FlexList> = List extends FlexList<infer Item>
-	? Item
-	: unknown;
-
-export type NormalizeLazyItem<List extends LazyItem> = List extends () => unknown
-	? List
-	: () => List;
-
-/**
- * Normalize FlexList type to a non-lazy array.
- */
-export type FlexListToNonLazyArray<List extends FlexList> =
-	ArrayHasFixedLength<List> extends true
-		? ConstantFlexListToNonLazyArray<List>
-		: NormalizedFlexList<ExtractListItemType<List>>;
-
 /**
  * Normalize FlexList type to a union.
  * @system @public
  */
 export type FlexListToUnion<TList extends FlexList> = ExtractItemType<TList[number]>;
-
-/**
- * Normalize FlexList type to a non-lazy array.
- */
-export type ConstantFlexListToNonLazyArray<List extends FlexList> = List extends readonly [
-	infer Head,
-	...infer Tail,
-]
-	? [ExtractItemType<Head>, ...ConstantFlexListToNonLazyArray<Tail>]
-	: [];
-
-/**
- * Detect if an array is a Tuple (fixed length) or unknown length.
- *
- * Types which many have one of multiple fixed lengths (like `[] | [0]`) count as having a fixed length.
- *
- * @remarks
- * Type operations designed to work on tuples can often behave very badly on regular arrays.
- * For example recursive patterns for processing them often just return the base case,
- * losing all the type information.
- */
-// This works by determining if the length is `number` (and not a specific number).
-export type ArrayHasFixedLength<List extends readonly unknown[]> =
-	number extends List["length"] ? false : true;
-
-/**
- * Normalize FlexList type to a lazy array.
- */
-export type FlexListToLazyArray<List extends FlexList> = ArrayHasFixedLength<List> extends true
-	? ConstantFlexListToLazyArray<List>
-	: NormalizedLazyFlexList<ExtractListItemType<List>>;
-
-/**
- * Normalize FlexList type to a lazy array.
- */
-export type ConstantFlexListToLazyArray<List extends FlexList> = List extends readonly [
-	infer Head,
-	...infer Tail,
-]
-	? [NormalizeLazyItem<Head>, ...ConstantFlexListToLazyArray<Tail>]
-	: [];

package/src/feature-libraries/typed-schema/index.ts

@@ -3,45 +3,13 @@
  * Licensed under the MIT License.
  */
 
-export {
-	type FlexTreeNodeSchema,
-	FlexFieldSchema,
-	allowedTypesToTypeSet,
-	type FlexAllowedTypes,
-	type LazyTreeNodeSchema,
-	LeafNodeSchema,
-	FlexMapNodeSchema,
-	FlexObjectNodeSchema,
-	type FlexTreeSchema,
-	type Unenforced,
-	type AllowedTypeSet,
-	type FlexMapFieldSchema,
-	type SchemaCollection,
-	TreeNodeSchemaBase,
-	type FlexObjectNodeFields,
-	schemaIsLeaf,
-	schemaIsMap,
-	schemaIsObjectNode,
-	intoStoredSchema,
-	allowedTypesSchemaSet,
-	intoStoredSchemaCollection,
-} from "./typedTreeSchema.js";
-
-export { ViewSchema } from "./view.js";
-
-export {
-	type SchemaLibraryData,
-	type SchemaLintConfiguration,
-	aggregateSchemaLibraries,
-	schemaLintDefault,
-} from "./schemaCollection.js";
+export { type Unenforced } from "./typedTreeSchema.js";
 
 export {
 	type FlexList,
 	markEager,
 	type LazyItem,
 	isLazy,
-	type NormalizeLazyItem,
 	type FlexListToUnion,
 	type ExtractItemType,
 	normalizeFlexListEager,