@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/core/index.js

@@ -0,0 +1,106 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.initializeForest = exports.ITreeSubscriptionCursorState = exports.TreeNavigationResult = exports.aboveRootPlaceholder = exports.getDetachedFieldContainingPath = exports.DetachedFieldIndex = exports.isCursor = exports.CursorMarker = exports.inCursorNode = exports.inCursorField = exports.anchorSlot = exports.emptyDelta = exports.offsetDetachId = exports.makeDetachedNodeId = exports.isEmptyFieldChanges = exports.emptyFieldChanges = exports.deltaForSet = exports.deltaForRootInitialization = exports.forEachField = exports.forEachNodeInSubtree = exports.forEachNode = exports.compareFieldUpPaths = exports.topDownPath = exports.clonePath = exports.compareUpPaths = exports.getDescendant = exports.SparseNode = exports.setGenericTreeField = exports.makeDetachedFieldIndex = exports.applyDelta = exports.announceDelta = exports.combineVisitors = exports.visitDelta = exports.keyAsDetachedField = exports.detachedFieldAsKey = exports.getMapTreeField = exports.iterateCursorField = exports.mapCursorFields = exports.mapCursorField = exports.getDepth = exports.genericTreeDeleteIfEmpty = exports.getGenericTreeField = exports.genericTreeKeys = exports.castCursorToSynchronous = exports.CursorLocationType = exports.rootField = exports.rootFieldKey = exports.EncodedJsonableTree = exports.AnchorSet = exports.EmptyKey = void 0;
+exports.DiscardResult = exports.RevertResult = exports.RevertibleKind = exports.AllowedUpdateType = exports.Compatibility = exports.AdaptedViewSchema = exports.revisionMetadataSourceFromInfo = exports.rebaseChangeOverChanges = exports.rebaseChange = exports.rebaseBranch = exports.mintRevisionTag = exports.mintCommit = exports.SessionIdSchema = exports.tagRollbackInverse = exports.verifyChangeRebaser = exports.noFailure = exports.mapTaggedChange = exports.tagChange = exports.makeAnonChange = exports.RevisionTagSchema = exports.isRevisionTag = exports.findCommonAncestor = exports.findAncestor = exports.assertIsRevisionTag = exports.areEqualChangeAtomIds = exports.EditBuilder = exports.storedSchemaDecodeDispatcher = exports.encodeFieldSchema = exports.decodeFieldSchema = exports.MapNodeStoredSchema = exports.ObjectNodeStoredSchema = exports.LeafNodeStoredSchema = exports.schemaFormat = exports.storedEmptyFieldSchema = exports.forbiddenFieldKindIdentifier = exports.schemaDataIsEmpty = exports.TreeStoredSchemaRepository = exports.TreeNodeStoredSchema = exports.ValueSchema = exports.moveToDetachedField = void 0;
+var tree_1 = require("./tree");
+Object.defineProperty(exports, "EmptyKey", { enumerable: true, get: function () { return tree_1.EmptyKey; } });
+Object.defineProperty(exports, "AnchorSet", { enumerable: true, get: function () { return tree_1.AnchorSet; } });
+Object.defineProperty(exports, "EncodedJsonableTree", { enumerable: true, get: function () { return tree_1.EncodedJsonableTree; } });
+Object.defineProperty(exports, "rootFieldKey", { enumerable: true, get: function () { return tree_1.rootFieldKey; } });
+Object.defineProperty(exports, "rootField", { enumerable: true, get: function () { return tree_1.rootField; } });
+Object.defineProperty(exports, "CursorLocationType", { enumerable: true, get: function () { return tree_1.CursorLocationType; } });
+Object.defineProperty(exports, "castCursorToSynchronous", { enumerable: true, get: function () { return tree_1.castCursorToSynchronous; } });
+Object.defineProperty(exports, "genericTreeKeys", { enumerable: true, get: function () { return tree_1.genericTreeKeys; } });
+Object.defineProperty(exports, "getGenericTreeField", { enumerable: true, get: function () { return tree_1.getGenericTreeField; } });
+Object.defineProperty(exports, "genericTreeDeleteIfEmpty", { enumerable: true, get: function () { return tree_1.genericTreeDeleteIfEmpty; } });
+Object.defineProperty(exports, "getDepth", { enumerable: true, get: function () { return tree_1.getDepth; } });
+Object.defineProperty(exports, "mapCursorField", { enumerable: true, get: function () { return tree_1.mapCursorField; } });
+Object.defineProperty(exports, "mapCursorFields", { enumerable: true, get: function () { return tree_1.mapCursorFields; } });
+Object.defineProperty(exports, "iterateCursorField", { enumerable: true, get: function () { return tree_1.iterateCursorField; } });
+Object.defineProperty(exports, "getMapTreeField", { enumerable: true, get: function () { return tree_1.getMapTreeField; } });
+Object.defineProperty(exports, "detachedFieldAsKey", { enumerable: true, get: function () { return tree_1.detachedFieldAsKey; } });
+Object.defineProperty(exports, "keyAsDetachedField", { enumerable: true, get: function () { return tree_1.keyAsDetachedField; } });
+Object.defineProperty(exports, "visitDelta", { enumerable: true, get: function () { return tree_1.visitDelta; } });
+Object.defineProperty(exports, "combineVisitors", { enumerable: true, get: function () { return tree_1.combineVisitors; } });
+Object.defineProperty(exports, "announceDelta", { enumerable: true, get: function () { return tree_1.announceDelta; } });
+Object.defineProperty(exports, "applyDelta", { enumerable: true, get: function () { return tree_1.applyDelta; } });
+Object.defineProperty(exports, "makeDetachedFieldIndex", { enumerable: true, get: function () { return tree_1.makeDetachedFieldIndex; } });
+Object.defineProperty(exports, "setGenericTreeField", { enumerable: true, get: function () { return tree_1.setGenericTreeField; } });
+Object.defineProperty(exports, "SparseNode", { enumerable: true, get: function () { return tree_1.SparseNode; } });
+Object.defineProperty(exports, "getDescendant", { enumerable: true, get: function () { return tree_1.getDescendant; } });
+Object.defineProperty(exports, "compareUpPaths", { enumerable: true, get: function () { return tree_1.compareUpPaths; } });
+Object.defineProperty(exports, "clonePath", { enumerable: true, get: function () { return tree_1.clonePath; } });
+Object.defineProperty(exports, "topDownPath", { enumerable: true, get: function () { return tree_1.topDownPath; } });
+Object.defineProperty(exports, "compareFieldUpPaths", { enumerable: true, get: function () { return tree_1.compareFieldUpPaths; } });
+Object.defineProperty(exports, "forEachNode", { enumerable: true, get: function () { return tree_1.forEachNode; } });
+Object.defineProperty(exports, "forEachNodeInSubtree", { enumerable: true, get: function () { return tree_1.forEachNodeInSubtree; } });
+Object.defineProperty(exports, "forEachField", { enumerable: true, get: function () { return tree_1.forEachField; } });
+Object.defineProperty(exports, "deltaForRootInitialization", { enumerable: true, get: function () { return tree_1.deltaForRootInitialization; } });
+Object.defineProperty(exports, "deltaForSet", { enumerable: true, get: function () { return tree_1.deltaForSet; } });
+Object.defineProperty(exports, "emptyFieldChanges", { enumerable: true, get: function () { return tree_1.emptyFieldChanges; } });
+Object.defineProperty(exports, "isEmptyFieldChanges", { enumerable: true, get: function () { return tree_1.isEmptyFieldChanges; } });
+Object.defineProperty(exports, "makeDetachedNodeId", { enumerable: true, get: function () { return tree_1.makeDetachedNodeId; } });
+Object.defineProperty(exports, "offsetDetachId", { enumerable: true, get: function () { return tree_1.offsetDetachId; } });
+Object.defineProperty(exports, "emptyDelta", { enumerable: true, get: function () { return tree_1.emptyDelta; } });
+Object.defineProperty(exports, "anchorSlot", { enumerable: true, get: function () { return tree_1.anchorSlot; } });
+Object.defineProperty(exports, "inCursorField", { enumerable: true, get: function () { return tree_1.inCursorField; } });
+Object.defineProperty(exports, "inCursorNode", { enumerable: true, get: function () { return tree_1.inCursorNode; } });
+Object.defineProperty(exports, "CursorMarker", { enumerable: true, get: function () { return tree_1.CursorMarker; } });
+Object.defineProperty(exports, "isCursor", { enumerable: true, get: function () { return tree_1.isCursor; } });
+Object.defineProperty(exports, "DetachedFieldIndex", { enumerable: true, get: function () { return tree_1.DetachedFieldIndex; } });
+Object.defineProperty(exports, "getDetachedFieldContainingPath", { enumerable: true, get: function () { return tree_1.getDetachedFieldContainingPath; } });
+Object.defineProperty(exports, "aboveRootPlaceholder", { enumerable: true, get: function () { return tree_1.aboveRootPlaceholder; } });
+var forest_1 = require("./forest");
+Object.defineProperty(exports, "TreeNavigationResult", { enumerable: true, get: function () { return forest_1.TreeNavigationResult; } });
+Object.defineProperty(exports, "ITreeSubscriptionCursorState", { enumerable: true, get: function () { return forest_1.ITreeSubscriptionCursorState; } });
+Object.defineProperty(exports, "initializeForest", { enumerable: true, get: function () { return forest_1.initializeForest; } });
+Object.defineProperty(exports, "moveToDetachedField", { enumerable: true, get: function () { return forest_1.moveToDetachedField; } });
+var schema_stored_1 = require("./schema-stored");
+Object.defineProperty(exports, "ValueSchema", { enumerable: true, get: function () { return schema_stored_1.ValueSchema; } });
+Object.defineProperty(exports, "TreeNodeStoredSchema", { enumerable: true, get: function () { return schema_stored_1.TreeNodeStoredSchema; } });
+Object.defineProperty(exports, "TreeStoredSchemaRepository", { enumerable: true, get: function () { return schema_stored_1.TreeStoredSchemaRepository; } });
+Object.defineProperty(exports, "schemaDataIsEmpty", { enumerable: true, get: function () { return schema_stored_1.schemaDataIsEmpty; } });
+Object.defineProperty(exports, "forbiddenFieldKindIdentifier", { enumerable: true, get: function () { return schema_stored_1.forbiddenFieldKindIdentifier; } });
+Object.defineProperty(exports, "storedEmptyFieldSchema", { enumerable: true, get: function () { return schema_stored_1.storedEmptyFieldSchema; } });
+Object.defineProperty(exports, "schemaFormat", { enumerable: true, get: function () { return schema_stored_1.schemaFormat; } });
+Object.defineProperty(exports, "LeafNodeStoredSchema", { enumerable: true, get: function () { return schema_stored_1.LeafNodeStoredSchema; } });
+Object.defineProperty(exports, "ObjectNodeStoredSchema", { enumerable: true, get: function () { return schema_stored_1.ObjectNodeStoredSchema; } });
+Object.defineProperty(exports, "MapNodeStoredSchema", { enumerable: true, get: function () { return schema_stored_1.MapNodeStoredSchema; } });
+Object.defineProperty(exports, "decodeFieldSchema", { enumerable: true, get: function () { return schema_stored_1.decodeFieldSchema; } });
+Object.defineProperty(exports, "encodeFieldSchema", { enumerable: true, get: function () { return schema_stored_1.encodeFieldSchema; } });
+Object.defineProperty(exports, "storedSchemaDecodeDispatcher", { enumerable: true, get: function () { return schema_stored_1.storedSchemaDecodeDispatcher; } });
+var change_family_1 = require("./change-family");
+Object.defineProperty(exports, "EditBuilder", { enumerable: true, get: function () { return change_family_1.EditBuilder; } });
+var rebase_1 = require("./rebase");
+Object.defineProperty(exports, "areEqualChangeAtomIds", { enumerable: true, get: function () { return rebase_1.areEqualChangeAtomIds; } });
+Object.defineProperty(exports, "assertIsRevisionTag", { enumerable: true, get: function () { return rebase_1.assertIsRevisionTag; } });
+Object.defineProperty(exports, "findAncestor", { enumerable: true, get: function () { return rebase_1.findAncestor; } });
+Object.defineProperty(exports, "findCommonAncestor", { enumerable: true, get: function () { return rebase_1.findCommonAncestor; } });
+Object.defineProperty(exports, "isRevisionTag", { enumerable: true, get: function () { return rebase_1.isRevisionTag; } });
+Object.defineProperty(exports, "RevisionTagSchema", { enumerable: true, get: function () { return rebase_1.RevisionTagSchema; } });
+Object.defineProperty(exports, "makeAnonChange", { enumerable: true, get: function () { return rebase_1.makeAnonChange; } });
+Object.defineProperty(exports, "tagChange", { enumerable: true, get: function () { return rebase_1.tagChange; } });
+Object.defineProperty(exports, "mapTaggedChange", { enumerable: true, get: function () { return rebase_1.mapTaggedChange; } });
+Object.defineProperty(exports, "noFailure", { enumerable: true, get: function () { return rebase_1.noFailure; } });
+Object.defineProperty(exports, "verifyChangeRebaser", { enumerable: true, get: function () { return rebase_1.verifyChangeRebaser; } });
+Object.defineProperty(exports, "tagRollbackInverse", { enumerable: true, get: function () { return rebase_1.tagRollbackInverse; } });
+Object.defineProperty(exports, "SessionIdSchema", { enumerable: true, get: function () { return rebase_1.SessionIdSchema; } });
+Object.defineProperty(exports, "mintCommit", { enumerable: true, get: function () { return rebase_1.mintCommit; } });
+Object.defineProperty(exports, "mintRevisionTag", { enumerable: true, get: function () { return rebase_1.mintRevisionTag; } });
+Object.defineProperty(exports, "rebaseBranch", { enumerable: true, get: function () { return rebase_1.rebaseBranch; } });
+Object.defineProperty(exports, "rebaseChange", { enumerable: true, get: function () { return rebase_1.rebaseChange; } });
+Object.defineProperty(exports, "rebaseChangeOverChanges", { enumerable: true, get: function () { return rebase_1.rebaseChangeOverChanges; } });
+Object.defineProperty(exports, "revisionMetadataSourceFromInfo", { enumerable: true, get: function () { return rebase_1.revisionMetadataSourceFromInfo; } });
+var schema_view_1 = require("./schema-view");
+Object.defineProperty(exports, "AdaptedViewSchema", { enumerable: true, get: function () { return schema_view_1.AdaptedViewSchema; } });
+Object.defineProperty(exports, "Compatibility", { enumerable: true, get: function () { return schema_view_1.Compatibility; } });
+Object.defineProperty(exports, "AllowedUpdateType", { enumerable: true, get: function () { return schema_view_1.AllowedUpdateType; } });
+var revertible_1 = require("./revertible");
+Object.defineProperty(exports, "RevertibleKind", { enumerable: true, get: function () { return revertible_1.RevertibleKind; } });
+Object.defineProperty(exports, "RevertResult", { enumerable: true, get: function () { return revertible_1.RevertResult; } });
+Object.defineProperty(exports, "DiscardResult", { enumerable: true, get: function () { return revertible_1.DiscardResult; } });
+//# sourceMappingURL=index.js.map

package/dist/core/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;AAEH,+BA+FgB;AA9Ff,gGAAA,QAAQ,OAAA;AAIR,iGAAA,SAAS,OAAA;AAmBT,2GAAA,mBAAmB,OAAA;AACnB,oGAAA,YAAY,OAAA;AACZ,iGAAA,SAAS,OAAA;AAET,0GAAA,kBAAkB,OAAA;AAElB,+GAAA,uBAAuB,OAAA;AAGvB,uGAAA,eAAe,OAAA;AACf,2GAAA,mBAAmB,OAAA;AACnB,gHAAA,wBAAwB,OAAA;AACxB,gGAAA,QAAQ,OAAA;AACR,sGAAA,cAAc,OAAA;AACd,uGAAA,eAAe,OAAA;AACf,0GAAA,kBAAkB,OAAA;AAClB,uGAAA,eAAe,OAAA;AAEf,0GAAA,kBAAkB,OAAA;AAClB,0GAAA,kBAAkB,OAAA;AAClB,kGAAA,UAAU,OAAA;AACV,uGAAA,eAAe,OAAA;AACf,qGAAA,aAAa,OAAA;AACb,kGAAA,UAAU,OAAA;AACV,8GAAA,sBAAsB,OAAA;AACtB,2GAAA,mBAAmB,OAAA;AAInB,kGAAA,UAAU,OAAA;AACV,qGAAA,aAAa,OAAA;AACb,sGAAA,cAAc,OAAA;AACd,iGAAA,SAAS,OAAA;AACT,mGAAA,WAAW,OAAA;AACX,2GAAA,mBAAmB,OAAA;AACnB,mGAAA,WAAW,OAAA;AACX,4GAAA,oBAAoB,OAAA;AACpB,oGAAA,YAAY,OAAA;AAEZ,kHAAA,0BAA0B,OAAA;AAC1B,mGAAA,WAAW,OAAA;AACX,yGAAA,iBAAiB,OAAA;AACjB,2GAAA,mBAAmB,OAAA;AACnB,0GAAA,kBAAkB,OAAA;AAClB,sGAAA,cAAc,OAAA;AACd,kGAAA,UAAU,OAAA;AAGV,kGAAA,UAAU,OAAA;AAEV,qGAAA,aAAa,OAAA;AACb,oGAAA,YAAY,OAAA;AAIZ,oGAAA,YAAY,OAAA;AACZ,gGAAA,QAAQ,OAAA;AACR,0GAAA,kBAAkB,OAAA;AAElB,sHAAA,8BAA8B,OAAA;AAC9B,4GAAA,oBAAoB,OAAA;AAarB,mCAakB;AAZjB,8GAAA,oBAAoB,OAAA;AAOpB,sHAAA,4BAA4B,OAAA;AAC5B,0GAAA,gBAAgB,OAAA;AAEhB,6GAAA,mBAAmB,OAAA;AAIpB,iDA2ByB;AAvBxB,4GAAA,WAAW,OAAA;AACX,qHAAA,oBAAoB,OAAA;AAOpB,2HAAA,0BAA0B,OAAA;AAC1B,kHAAA,iBAAiB,OAAA;AAEjB,6HAAA,4BAA4B,OAAA;AAC5B,uHAAA,sBAAsB,OAAA;AAEtB,6GAAA,YAAY,OAAA;AACZ,qHAAA,oBAAoB,OAAA;AACpB,uHAAA,sBAAsB,OAAA;AACtB,oHAAA,mBAAmB,OAAA;AAEnB,kHAAA,iBAAiB,OAAA;AACjB,kHAAA,iBAAiB,OAAA;AACjB,6HAAA,4BAA4B,OAAA;AAI7B,iDAAgF;AAArC,4GAAA,WAAW,OAAA;AAEtD,mCAkCkB;AAjCjB,+GAAA,qBAAqB,OAAA;AACrB,6GAAA,mBAAmB,OAAA;AAEnB,sGAAA,YAAY,OAAA;AACZ,4GAAA,kBAAkB,OAAA;AAElB,uGAAA,aAAa,OAAA;AAEb,2GAAA,iBAAiB,OAAA;AAKjB,wGAAA,cAAc,OAAA;AACd,mGAAA,SAAS,OAAA;AACT,yGAAA,eAAe,OAAA;AACf,mGAAA,SAAS,OAAA;AAET,6GAAA,mBAAmB,OAAA;AACnB,4GAAA,kBAAkB,OAAA;AAElB,yGAAA,eAAe,OAAA;AACf,oGAAA,UAAU,OAAA;AACV,yGAAA,eAAe,OAAA;AACf,sGAAA,YAAY,OAAA;AAEZ,sGAAA,YAAY,OAAA;AACZ,iHAAA,uBAAuB,OAAA;AAEvB,wHAAA,8BAA8B,OAAA;AAM/B,6CAMuB;AAJtB,gHAAA,iBAAiB,OAAA;AACjB,4GAAA,aAAa,OAAA;AAEb,gHAAA,iBAAiB,OAAA;AAGlB,2CAAuF;AAAlE,4GAAA,cAAc,OAAA;AAAE,0GAAA,YAAY,OAAA;AAAE,2GAAA,aAAa,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tEmptyKey,\n\tTreeType,\n\tValue,\n\tTreeValue,\n\tAnchorSet,\n\tDetachedField,\n\tUpPath,\n\tRange,\n\tRangeUpPath,\n\tPlaceUpPath,\n\tPlaceIndex,\n\tNodeIndex,\n\tDetachedPlaceUpPath,\n\tDetachedRangeUpPath,\n\tFieldUpPath,\n\tAnchor,\n\tRootField,\n\tChildCollection,\n\tChildLocation,\n\tFieldMapObject,\n\tNodeData,\n\tGenericTreeNode,\n\tJsonableTree,\n\tEncodedJsonableTree,\n\trootFieldKey,\n\trootField,\n\tITreeCursor,\n\tCursorLocationType,\n\tITreeCursorSynchronous,\n\tcastCursorToSynchronous,\n\tGenericFieldsNode,\n\tAnchorLocator,\n\tgenericTreeKeys,\n\tgetGenericTreeField,\n\tgenericTreeDeleteIfEmpty,\n\tgetDepth,\n\tmapCursorField,\n\tmapCursorFields,\n\titerateCursorField,\n\tgetMapTreeField,\n\tMapTree,\n\tdetachedFieldAsKey,\n\tkeyAsDetachedField,\n\tvisitDelta,\n\tcombineVisitors,\n\tannounceDelta,\n\tapplyDelta,\n\tmakeDetachedFieldIndex,\n\tsetGenericTreeField,\n\tDeltaVisitor,\n\tAnnouncedVisitor,\n\tPathVisitor,\n\tSparseNode,\n\tgetDescendant,\n\tcompareUpPaths,\n\tclonePath,\n\ttopDownPath,\n\tcompareFieldUpPaths,\n\tforEachNode,\n\tforEachNodeInSubtree,\n\tforEachField,\n\tPathRootPrefix,\n\tdeltaForRootInitialization,\n\tdeltaForSet,\n\temptyFieldChanges,\n\tisEmptyFieldChanges,\n\tmakeDetachedNodeId,\n\toffsetDetachId,\n\temptyDelta,\n\tAnchorSlot,\n\tAnchorNode,\n\tanchorSlot,\n\tUpPathDefault,\n\tinCursorField,\n\tinCursorNode,\n\tAnchorEvents,\n\tAnchorSetRootEvents,\n\tProtoNodes,\n\tCursorMarker,\n\tisCursor,\n\tDetachedFieldIndex,\n\tForestRootId,\n\tgetDetachedFieldContainingPath,\n\taboveRootPlaceholder,\n\tDeltaRoot,\n\tDeltaProtoNode,\n\tDeltaMark,\n\tDeltaDetachedNodeId,\n\tDeltaFieldMap,\n\tDeltaDetachedNodeChanges,\n\tDeltaDetachedNodeBuild,\n\tDeltaDetachedNodeDestruction,\n\tDeltaDetachedNodeRename,\n\tDeltaFieldChanges,\n} from \"./tree\";\n\nexport {\n\tTreeNavigationResult,\n\tIEditableForest,\n\tIForestSubscription,\n\tTreeLocation,\n\tFieldLocation,\n\tForestLocation,\n\tITreeSubscriptionCursor,\n\tITreeSubscriptionCursorState,\n\tinitializeForest,\n\tFieldAnchor,\n\tmoveToDetachedField,\n\tForestEvents,\n} from \"./forest\";\n\nexport {\n\tFieldKey,\n\tTreeNodeSchemaIdentifier,\n\tTreeFieldStoredSchema,\n\tValueSchema,\n\tTreeNodeStoredSchema,\n\tTreeStoredSchemaSubscription as TreeStoredSchemaSubscription,\n\tMutableTreeStoredSchema,\n\tFieldKindIdentifier,\n\tFieldKindSpecifier,\n\tTreeTypeSet,\n\tTreeStoredSchema,\n\tTreeStoredSchemaRepository,\n\tschemaDataIsEmpty,\n\tSchemaEvents,\n\tforbiddenFieldKindIdentifier,\n\tstoredEmptyFieldSchema,\n\tStoredSchemaCollection,\n\tschemaFormat,\n\tLeafNodeStoredSchema,\n\tObjectNodeStoredSchema,\n\tMapNodeStoredSchema,\n\tBrandedTreeNodeSchemaDataFormat,\n\tdecodeFieldSchema,\n\tencodeFieldSchema,\n\tstoredSchemaDecodeDispatcher,\n\tErasedTreeNodeSchemaDataFormat,\n} from \"./schema-stored\";\n\nexport { ChangeFamily, ChangeFamilyEditor, EditBuilder } from \"./change-family\";\n\nexport {\n\tareEqualChangeAtomIds,\n\tassertIsRevisionTag,\n\tChangeRebaser,\n\tfindAncestor,\n\tfindCommonAncestor,\n\tGraphCommit,\n\tisRevisionTag,\n\tRevisionTag,\n\tRevisionTagSchema,\n\tChangesetLocalId,\n\tChangeAtomId,\n\tChangeAtomIdMap,\n\tTaggedChange,\n\tmakeAnonChange,\n\ttagChange,\n\tmapTaggedChange,\n\tnoFailure,\n\tOutputType,\n\tverifyChangeRebaser,\n\ttagRollbackInverse,\n\tSessionId,\n\tSessionIdSchema,\n\tmintCommit,\n\tmintRevisionTag,\n\trebaseBranch,\n\tBranchRebaseResult,\n\trebaseChange,\n\trebaseChangeOverChanges,\n\tRevisionMetadataSource,\n\trevisionMetadataSourceFromInfo,\n\tRevisionInfo,\n\tEncodedRevisionTag,\n\tEncodedChangeAtomId,\n} from \"./rebase\";\n\nexport {\n\tAdapters,\n\tAdaptedViewSchema,\n\tCompatibility,\n\tTreeAdapter,\n\tAllowedUpdateType,\n} from \"./schema-view\";\n\nexport { Revertible, RevertibleKind, RevertResult, DiscardResult } from \"./revertible\";\n"]}

package/dist/core/rebase/changeRebaser.d.ts

@@ -0,0 +1,132 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Invariant } from "../../util";
+import type { RevisionTag } from "./types";
+/**
+ * Rebasing logic for a particular kind of change.
+ *
+ * This interface is used to provide rebase policy to `Rebaser`.
+ *
+ * The implementation must ensure TChangeset forms a [group](https://en.wikipedia.org/wiki/Group_(mathematics)) where:
+ * - `compose([])` is the identity element.
+ * - associativity is defined as `compose([...a, ...b])` is equal to
+ * `compose([compose(a), compose(b)])` for all `a` and `b`.
+ * - `inverse(a)` gives the inverse element of `a`.
+ *
+ * In these requirements the definition of equality is up to the implementer,
+ * but it is required that any two changes which are considered equal:
+ * - have the same impact when applied to any tree.
+ * - can be substituted for each-other in all methods on this
+ * interface and produce equal (by this same definition) results.
+ *
+ * For the sake of testability, implementations will likely want to have a concrete equality implementation.
+ *
+ * This API uses `compose` on arrays instead of an explicit identity element and associative binary operator
+ * to allow the implementation more room for optimization,
+ * but should otherwise be equivalent to the identity element and binary operator group approach.
+ *
+ * TODO:
+ * Be more specific about the above requirements.
+ * For example, would something that is close to forming a group but has precision issues
+ * (ex: the floating point numbers and addition) be ok?
+ * Would this cause decoherence (and thus be absolutely not ok),
+ * or just minor semantic precision issues, which could be tolerated.
+ * For now assume that such issues are not ok.
+ */
+export interface ChangeRebaser<TChangeset> {
+    _typeCheck?: Invariant<TChangeset>;
+    /**
+     * Compose a collection of changesets into a single one.
+     * See {@link ChangeRebaser} for requirements.
+     */
+    compose(changes: TaggedChange<TChangeset>[]): TChangeset;
+    /**
+     * @param changes - The changes to invert.
+     * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when
+     * performing a sandwich rebase.
+     * This flag is relevant to merge semantics that are dependent on edit sequencing order:
+     * - In the context of an undo, this function inverts a change that is sequenced and applied before the produced inverse.
+     * - In the context of a rollback, this function inverts a change that is sequenced after but applied before the produced inverse.
+     * @returns the inverse of `changes`.
+     *
+     * `compose([changes, inverse(changes)])` be equal to `compose([])`:
+     * See {@link ChangeRebaser} for details.
+     */
+    invert(changes: TaggedChange<TChangeset>, isRollback: boolean): TChangeset;
+    /**
+     * Rebase `change` over `over`.
+     *
+     * The resulting changeset should, as much as possible, replicate the same semantics as `change`,
+     * except be valid to apply after `over` instead of before it.
+     *
+     * When rebasing `change` onto a new branch, `revisionMetadata` should include entries for all changesets
+     * from the source which are being rebased onto the target branch.
+     *
+     * Requirements:
+     * The implementation must ensure that for all possible changesets `a`, `b` and `c`:
+     * - `rebase(a, compose([b, c])` is equal to `rebase(rebase(a, b), c)`.
+     * - `rebase(compose([a, b]), c)` is equal to
+     * `compose([rebase(a, c), rebase(b, compose([inverse(a), c, rebase(a, c)])])`.
+     * - `rebase(a, compose([]))` is equal to `a`.
+     * - `rebase(compose([]), a)` is equal to `compose([])`.
+     */
+    rebase(change: TChangeset, over: TaggedChange<TChangeset>, revisionMetadata: RevisionMetadataSource): TChangeset;
+}
+/**
+ * @internal
+ */
+export interface TaggedChange<TChangeset> {
+    readonly revision: RevisionTag | undefined;
+    /**
+     * When populated, indicates that the changeset is a rollback for the purpose of a rebase sandwich.
+     * The value corresponds to the `revision` of the original changeset being rolled back.
+     */
+    readonly rollbackOf?: RevisionTag;
+    readonly change: TChangeset;
+}
+export declare function mapTaggedChange<TIn, TOut>(input: TaggedChange<TIn>, change: TOut): TaggedChange<TOut>;
+/**
+ * A callback that returns the index of the changeset associated with the given RevisionTag among the changesets being
+ * composed or rebased. This index is solely meant to communicate relative ordering, and is only valid within the scope of the
+ * compose or rebase operation.
+ *
+ * During composition, the index reflects the order of the changeset within the overall composed changeset that is
+ * being produced.
+ *
+ * During rebase, the indices of the base changes are all lower than the indices of the change being rebased.
+ * @internal
+ */
+export type RevisionIndexer = (tag: RevisionTag) => number | undefined;
+/**
+ * @internal
+ */
+export interface RevisionMetadataSource {
+    readonly getIndex: RevisionIndexer;
+    readonly tryGetInfo: (tag: RevisionTag | undefined) => RevisionInfo | undefined;
+    readonly hasRollback: (tag: RevisionTag) => boolean;
+}
+/**
+ * @internal
+ */
+export interface RevisionInfo {
+    readonly revision: RevisionTag;
+    /**
+     * When populated, indicates that the changeset is a rollback for the purpose of a rebase sandwich.
+     * The value corresponds to the `revision` of the original changeset being rolled back.
+     */
+    readonly rollbackOf?: RevisionTag;
+}
+export declare function tagChange<T>(change: T, revision: RevisionTag | undefined): TaggedChange<T>;
+export declare function tagRollbackInverse<T>(inverseChange: T, revision: RevisionTag | undefined, rollbackOf: RevisionTag | undefined): TaggedChange<T>;
+export declare function makeAnonChange<T>(change: T): TaggedChange<T>;
+export interface FinalChange {
+    readonly status: FinalChangeStatus;
+}
+export declare enum FinalChangeStatus {
+    conflicted = 0,
+    rebased = 1,
+    commuted = 2
+}
+//# sourceMappingURL=changeRebaser.d.ts.map

package/dist/core/rebase/changeRebaser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"changeRebaser.d.ts","sourceRoot":"","sources":["../../../src/core/rebase/changeRebaser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,WAAW,aAAa,CAAC,UAAU;IACxC,UAAU,CAAC,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;IAEnC;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,GAAG,UAAU,CAAC;IAEzD;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU,CAAC;IAE3E;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CACL,MAAM,EAAE,UAAU,EAClB,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,EAC9B,gBAAgB,EAAE,sBAAsB,GACtC,UAAU,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,YAAY,CAAC,UAAU;IACvC,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,SAAS,CAAC;IAC3C;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;CAC5B;AAED,wBAAgB,eAAe,CAAC,GAAG,EAAE,IAAI,EACxC,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,EACxB,MAAM,EAAE,IAAI,GACV,YAAY,CAAC,IAAI,CAAC,CAEpB;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,WAAW,KAAK,MAAM,GAAG,SAAS,CAAC;AAEvE;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,WAAW,GAAG,SAAS,KAAK,YAAY,GAAG,SAAS,CAAC;IAChF,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,OAAO,CAAC;CACpD;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC;CAClC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,WAAW,GAAG,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAE1F;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EACnC,aAAa,EAAE,CAAC,EAChB,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,UAAU,EAAE,WAAW,GAAG,SAAS,GACjC,YAAY,CAAC,CAAC,CAAC,CAMjB;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAE5D;AAED,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;CACnC;AAED,oBAAY,iBAAiB;IAC5B,UAAU,IAAA;IACV,OAAO,IAAA;IACP,QAAQ,IAAA;CACR"}

package/dist/core/rebase/changeRebaser.js

@@ -0,0 +1,34 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FinalChangeStatus = exports.makeAnonChange = exports.tagRollbackInverse = exports.tagChange = exports.mapTaggedChange = void 0;
+function mapTaggedChange(input, change) {
+    return { ...input, change };
+}
+exports.mapTaggedChange = mapTaggedChange;
+function tagChange(change, revision) {
+    return { revision, change };
+}
+exports.tagChange = tagChange;
+function tagRollbackInverse(inverseChange, revision, rollbackOf) {
+    return {
+        revision,
+        change: inverseChange,
+        rollbackOf,
+    };
+}
+exports.tagRollbackInverse = tagRollbackInverse;
+function makeAnonChange(change) {
+    return { revision: undefined, change };
+}
+exports.makeAnonChange = makeAnonChange;
+var FinalChangeStatus;
+(function (FinalChangeStatus) {
+    FinalChangeStatus[FinalChangeStatus["conflicted"] = 0] = "conflicted";
+    FinalChangeStatus[FinalChangeStatus["rebased"] = 1] = "rebased";
+    FinalChangeStatus[FinalChangeStatus["commuted"] = 2] = "commuted";
+})(FinalChangeStatus || (exports.FinalChangeStatus = FinalChangeStatus = {}));
+//# sourceMappingURL=changeRebaser.js.map

package/dist/core/rebase/changeRebaser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"changeRebaser.js","sourceRoot":"","sources":["../../../src/core/rebase/changeRebaser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAgGH,SAAgB,eAAe,CAC9B,KAAwB,EACxB,MAAY;IAEZ,OAAO,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AALD,0CAKC;AAoCD,SAAgB,SAAS,CAAI,MAAS,EAAE,QAAiC;IACxE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAFD,8BAEC;AAED,SAAgB,kBAAkB,CACjC,aAAgB,EAChB,QAAiC,EACjC,UAAmC;IAEnC,OAAO;QACN,QAAQ;QACR,MAAM,EAAE,aAAa;QACrB,UAAU;KACV,CAAC;AACH,CAAC;AAVD,gDAUC;AAED,SAAgB,cAAc,CAAI,MAAS;IAC1C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AACxC,CAAC;AAFD,wCAEC;AAMD,IAAY,iBAIX;AAJD,WAAY,iBAAiB;IAC5B,qEAAU,CAAA;IACV,+DAAO,CAAA;IACP,iEAAQ,CAAA;AACT,CAAC,EAJW,iBAAiB,iCAAjB,iBAAiB,QAI5B","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Invariant } from \"../../util\";\nimport type { RevisionTag } from \"./types\";\n\n/**\n * Rebasing logic for a particular kind of change.\n *\n * This interface is used to provide rebase policy to `Rebaser`.\n *\n * The implementation must ensure TChangeset forms a [group](https://en.wikipedia.org/wiki/Group_(mathematics)) where:\n * - `compose([])` is the identity element.\n * - associativity is defined as `compose([...a, ...b])` is equal to\n * `compose([compose(a), compose(b)])` for all `a` and `b`.\n * - `inverse(a)` gives the inverse element of `a`.\n *\n * In these requirements the definition of equality is up to the implementer,\n * but it is required that any two changes which are considered equal:\n * - have the same impact when applied to any tree.\n * - can be substituted for each-other in all methods on this\n * interface and produce equal (by this same definition) results.\n *\n * For the sake of testability, implementations will likely want to have a concrete equality implementation.\n *\n * This API uses `compose` on arrays instead of an explicit identity element and associative binary operator\n * to allow the implementation more room for optimization,\n * but should otherwise be equivalent to the identity element and binary operator group approach.\n *\n * TODO:\n * Be more specific about the above requirements.\n * For example, would something that is close to forming a group but has precision issues\n * (ex: the floating point numbers and addition) be ok?\n * Would this cause decoherence (and thus be absolutely not ok),\n * or just minor semantic precision issues, which could be tolerated.\n * For now assume that such issues are not ok.\n */\nexport interface ChangeRebaser<TChangeset> {\n\t_typeCheck?: Invariant<TChangeset>;\n\n\t/**\n\t * Compose a collection of changesets into a single one.\n\t * See {@link ChangeRebaser} for requirements.\n\t */\n\tcompose(changes: TaggedChange<TChangeset>[]): TChangeset;\n\n\t/**\n\t * @param changes - The changes to invert.\n\t * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when\n\t * performing a sandwich rebase.\n\t * This flag is relevant to merge semantics that are dependent on edit sequencing order:\n\t * - In the context of an undo, this function inverts a change that is sequenced and applied before the produced inverse.\n\t * - In the context of a rollback, this function inverts a change that is sequenced after but applied before the produced inverse.\n\t * @returns the inverse of `changes`.\n\t *\n\t * `compose([changes, inverse(changes)])` be equal to `compose([])`:\n\t * See {@link ChangeRebaser} for details.\n\t */\n\tinvert(changes: TaggedChange<TChangeset>, isRollback: boolean): TChangeset;\n\n\t/**\n\t * Rebase `change` over `over`.\n\t *\n\t * The resulting changeset should, as much as possible, replicate the same semantics as `change`,\n\t * except be valid to apply after `over` instead of before it.\n\t *\n\t * When rebasing `change` onto a new branch, `revisionMetadata` should include entries for all changesets\n\t * from the source which are being rebased onto the target branch.\n\t *\n\t * Requirements:\n\t * The implementation must ensure that for all possible changesets `a`, `b` and `c`:\n\t * - `rebase(a, compose([b, c])` is equal to `rebase(rebase(a, b), c)`.\n\t * - `rebase(compose([a, b]), c)` is equal to\n\t * `compose([rebase(a, c), rebase(b, compose([inverse(a), c, rebase(a, c)])])`.\n\t * - `rebase(a, compose([]))` is equal to `a`.\n\t * - `rebase(compose([]), a)` is equal to `compose([])`.\n\t */\n\trebase(\n\t\tchange: TChangeset,\n\t\tover: TaggedChange<TChangeset>,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): TChangeset;\n}\n\n/**\n * @internal\n */\nexport interface TaggedChange<TChangeset> {\n\treadonly revision: RevisionTag | undefined;\n\t/**\n\t * When populated, indicates that the changeset is a rollback for the purpose of a rebase sandwich.\n\t * The value corresponds to the `revision` of the original changeset being rolled back.\n\t */\n\treadonly rollbackOf?: RevisionTag;\n\treadonly change: TChangeset;\n}\n\nexport function mapTaggedChange<TIn, TOut>(\n\tinput: TaggedChange<TIn>,\n\tchange: TOut,\n): TaggedChange<TOut> {\n\treturn { ...input, change };\n}\n\n/**\n * A callback that returns the index of the changeset associated with the given RevisionTag among the changesets being\n * composed or rebased. This index is solely meant to communicate relative ordering, and is only valid within the scope of the\n * compose or rebase operation.\n *\n * During composition, the index reflects the order of the changeset within the overall composed changeset that is\n * being produced.\n *\n * During rebase, the indices of the base changes are all lower than the indices of the change being rebased.\n * @internal\n */\nexport type RevisionIndexer = (tag: RevisionTag) => number | undefined;\n\n/**\n * @internal\n */\nexport interface RevisionMetadataSource {\n\treadonly getIndex: RevisionIndexer;\n\treadonly tryGetInfo: (tag: RevisionTag | undefined) => RevisionInfo | undefined;\n\treadonly hasRollback: (tag: RevisionTag) => boolean;\n}\n\n/**\n * @internal\n */\nexport interface RevisionInfo {\n\treadonly revision: RevisionTag;\n\t/**\n\t * When populated, indicates that the changeset is a rollback for the purpose of a rebase sandwich.\n\t * The value corresponds to the `revision` of the original changeset being rolled back.\n\t */\n\treadonly rollbackOf?: RevisionTag;\n}\n\nexport function tagChange<T>(change: T, revision: RevisionTag | undefined): TaggedChange<T> {\n\treturn { revision, change };\n}\n\nexport function tagRollbackInverse<T>(\n\tinverseChange: T,\n\trevision: RevisionTag | undefined,\n\trollbackOf: RevisionTag | undefined,\n): TaggedChange<T> {\n\treturn {\n\t\trevision,\n\t\tchange: inverseChange,\n\t\trollbackOf,\n\t};\n}\n\nexport function makeAnonChange<T>(change: T): TaggedChange<T> {\n\treturn { revision: undefined, change };\n}\n\nexport interface FinalChange {\n\treadonly status: FinalChangeStatus;\n}\n\nexport enum FinalChangeStatus {\n\tconflicted,\n\trebased,\n\tcommuted,\n}\n"]}

package/dist/core/rebase/index.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { assertIsRevisionTag, areEqualChangeAtomIds, mintRevisionTag, isRevisionTag, mintCommit, GraphCommit, RevisionTag, RevisionTagSchema, EncodedRevisionTag, EncodedChangeAtomId, ChangesetLocalId, ChangeAtomId, ChangeAtomIdMap, SessionId, SessionIdSchema, } from "./types";
+export { ChangeRebaser, FinalChange, FinalChangeStatus, makeAnonChange, tagChange, mapTaggedChange, tagRollbackInverse, TaggedChange, RevisionMetadataSource, RevisionInfo, } from "./changeRebaser";
+export { Exception, Failure, noFailure, OutputType, verifyChangeRebaser, Violation, } from "./verifyChangeRebaser";
+export { findAncestor, findCommonAncestor, rebaseBranch, BranchRebaseResult, rebaseChange, rebaseChangeOverChanges, revisionMetadataSourceFromInfo, } from "./utils";
+//# sourceMappingURL=index.d.ts.map

package/dist/core/rebase/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/rebase/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,mBAAmB,EACnB,qBAAqB,EACrB,eAAe,EACf,aAAa,EACb,UAAU,EACV,WAAW,EACX,WAAW,EACX,iBAAiB,EACjB,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,YAAY,EACZ,eAAe,EACf,SAAS,EACT,eAAe,GACf,MAAM,SAAS,CAAC;AACjB,OAAO,EACN,aAAa,EACb,WAAW,EACX,iBAAiB,EACjB,cAAc,EACd,SAAS,EACT,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,sBAAsB,EACtB,YAAY,GACZ,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACN,SAAS,EACT,OAAO,EACP,SAAS,EACT,UAAU,EACV,mBAAmB,EACnB,SAAS,GACT,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACN,YAAY,EACZ,kBAAkB,EAClB,YAAY,EACZ,kBAAkB,EAClB,YAAY,EACZ,uBAAuB,EACvB,8BAA8B,GAC9B,MAAM,SAAS,CAAC"}

package/dist/core/rebase/index.js

@@ -0,0 +1,32 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.revisionMetadataSourceFromInfo = exports.rebaseChangeOverChanges = exports.rebaseChange = exports.rebaseBranch = exports.findCommonAncestor = exports.findAncestor = exports.verifyChangeRebaser = exports.noFailure = exports.tagRollbackInverse = exports.mapTaggedChange = exports.tagChange = exports.makeAnonChange = exports.FinalChangeStatus = exports.SessionIdSchema = exports.RevisionTagSchema = exports.mintCommit = exports.isRevisionTag = exports.mintRevisionTag = exports.areEqualChangeAtomIds = exports.assertIsRevisionTag = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "assertIsRevisionTag", { enumerable: true, get: function () { return types_1.assertIsRevisionTag; } });
+Object.defineProperty(exports, "areEqualChangeAtomIds", { enumerable: true, get: function () { return types_1.areEqualChangeAtomIds; } });
+Object.defineProperty(exports, "mintRevisionTag", { enumerable: true, get: function () { return types_1.mintRevisionTag; } });
+Object.defineProperty(exports, "isRevisionTag", { enumerable: true, get: function () { return types_1.isRevisionTag; } });
+Object.defineProperty(exports, "mintCommit", { enumerable: true, get: function () { return types_1.mintCommit; } });
+Object.defineProperty(exports, "RevisionTagSchema", { enumerable: true, get: function () { return types_1.RevisionTagSchema; } });
+Object.defineProperty(exports, "SessionIdSchema", { enumerable: true, get: function () { return types_1.SessionIdSchema; } });
+var changeRebaser_1 = require("./changeRebaser");
+Object.defineProperty(exports, "FinalChangeStatus", { enumerable: true, get: function () { return changeRebaser_1.FinalChangeStatus; } });
+Object.defineProperty(exports, "makeAnonChange", { enumerable: true, get: function () { return changeRebaser_1.makeAnonChange; } });
+Object.defineProperty(exports, "tagChange", { enumerable: true, get: function () { return changeRebaser_1.tagChange; } });
+Object.defineProperty(exports, "mapTaggedChange", { enumerable: true, get: function () { return changeRebaser_1.mapTaggedChange; } });
+Object.defineProperty(exports, "tagRollbackInverse", { enumerable: true, get: function () { return changeRebaser_1.tagRollbackInverse; } });
+var verifyChangeRebaser_1 = require("./verifyChangeRebaser");
+Object.defineProperty(exports, "noFailure", { enumerable: true, get: function () { return verifyChangeRebaser_1.noFailure; } });
+Object.defineProperty(exports, "verifyChangeRebaser", { enumerable: true, get: function () { return verifyChangeRebaser_1.verifyChangeRebaser; } });
+var utils_1 = require("./utils");
+Object.defineProperty(exports, "findAncestor", { enumerable: true, get: function () { return utils_1.findAncestor; } });
+Object.defineProperty(exports, "findCommonAncestor", { enumerable: true, get: function () { return utils_1.findCommonAncestor; } });
+Object.defineProperty(exports, "rebaseBranch", { enumerable: true, get: function () { return utils_1.rebaseBranch; } });
+Object.defineProperty(exports, "rebaseChange", { enumerable: true, get: function () { return utils_1.rebaseChange; } });
+Object.defineProperty(exports, "rebaseChangeOverChanges", { enumerable: true, get: function () { return utils_1.rebaseChangeOverChanges; } });
+Object.defineProperty(exports, "revisionMetadataSourceFromInfo", { enumerable: true, get: function () { return utils_1.revisionMetadataSourceFromInfo; } });
+//# sourceMappingURL=index.js.map

package/dist/core/rebase/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/rebase/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,iCAgBiB;AAfhB,4GAAA,mBAAmB,OAAA;AACnB,8GAAA,qBAAqB,OAAA;AACrB,wGAAA,eAAe,OAAA;AACf,sGAAA,aAAa,OAAA;AACb,mGAAA,UAAU,OAAA;AAGV,0GAAA,iBAAiB,OAAA;AAOjB,wGAAA,eAAe,OAAA;AAEhB,iDAWyB;AARxB,kHAAA,iBAAiB,OAAA;AACjB,+GAAA,cAAc,OAAA;AACd,0GAAA,SAAS,OAAA;AACT,gHAAA,eAAe,OAAA;AACf,mHAAA,kBAAkB,OAAA;AAKnB,6DAO+B;AAJ9B,gHAAA,SAAS,OAAA;AAET,0HAAA,mBAAmB,OAAA;AAGpB,iCAQiB;AAPhB,qGAAA,YAAY,OAAA;AACZ,2GAAA,kBAAkB,OAAA;AAClB,qGAAA,YAAY,OAAA;AAEZ,qGAAA,YAAY,OAAA;AACZ,gHAAA,uBAAuB,OAAA;AACvB,uHAAA,8BAA8B,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tassertIsRevisionTag,\n\tareEqualChangeAtomIds,\n\tmintRevisionTag,\n\tisRevisionTag,\n\tmintCommit,\n\tGraphCommit,\n\tRevisionTag,\n\tRevisionTagSchema,\n\tEncodedRevisionTag,\n\tEncodedChangeAtomId,\n\tChangesetLocalId,\n\tChangeAtomId,\n\tChangeAtomIdMap,\n\tSessionId,\n\tSessionIdSchema,\n} from \"./types\";\nexport {\n\tChangeRebaser,\n\tFinalChange,\n\tFinalChangeStatus,\n\tmakeAnonChange,\n\ttagChange,\n\tmapTaggedChange,\n\ttagRollbackInverse,\n\tTaggedChange,\n\tRevisionMetadataSource,\n\tRevisionInfo,\n} from \"./changeRebaser\";\nexport {\n\tException,\n\tFailure,\n\tnoFailure,\n\tOutputType,\n\tverifyChangeRebaser,\n\tViolation,\n} from \"./verifyChangeRebaser\";\nexport {\n\tfindAncestor,\n\tfindCommonAncestor,\n\trebaseBranch,\n\tBranchRebaseResult,\n\trebaseChange,\n\trebaseChangeOverChanges,\n\trevisionMetadataSourceFromInfo,\n} from \"./utils\";\n"]}

package/dist/core/rebase/types.d.ts

@@ -0,0 +1,93 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { StableId } from "@fluidframework/id-compressor";
+import { Brand, NestedMap, RangeMap } from "../../util";
+/**
+ * The identifier for a particular session/user/client that can generate `GraphCommit`s
+ */
+export type SessionId = string;
+export declare const SessionIdSchema: import("@sinclair/typebox").TUnsafe<string>;
+/**
+ * A unique identifier for a commit. Commits that have been rebased, but are semantically
+ * the same, will share the same revision tag.
+ * @internal
+ */
+export type RevisionTag = StableId;
+export type EncodedRevisionTag = Brand<string, "EncodedRevisionTag">;
+export declare const RevisionTagSchema: import("@sinclair/typebox").TUnsafe<EncodedRevisionTag>;
+/**
+ * An ID which is unique within a revision of a `ModularChangeset`.
+ * A `ModularChangeset` which is a composition of multiple revisions may contain duplicate `ChangesetLocalId`s,
+ * but they are unique when qualified by the revision of the change they are used in.
+ * @internal
+ */
+export type ChangesetLocalId = Brand<number, "ChangesetLocalId">;
+/**
+ * A globally unique ID for an atom of change, or a node associated with the atom of change.
+ * @internal
+ *
+ * @privateRemarks
+ * TODO: Rename this to be more general.
+ */
+export interface ChangeAtomId {
+    /**
+     * Uniquely identifies the changeset within which the change was made.
+     * Only undefined when referring to an anonymous changesets.
+     */
+    readonly revision?: RevisionTag;
+    /**
+     * Uniquely identifies, in the scope of the changeset, the change made to the field.
+     */
+    readonly localId: ChangesetLocalId;
+}
+export interface EncodedChangeAtomId {
+    readonly revision?: EncodedRevisionTag;
+    readonly localId: ChangesetLocalId;
+}
+/**
+ * @internal
+ */
+export type ChangeAtomIdMap<T> = NestedMap<RevisionTag | undefined, ChangesetLocalId, T>;
+/**
+ * @internal
+ */
+export type ChangeAtomIdRangeMap<T> = Map<RevisionTag | undefined, RangeMap<T>>;
+/**
+ * @returns true iff `a` and `b` are the same.
+ */
+export declare function areEqualChangeAtomIds(a: ChangeAtomId, b: ChangeAtomId): boolean;
+/**
+ * @returns a `RevisionTag` from the given string, or fails if the string is not a valid `RevisionTag`
+ */
+export declare function assertIsRevisionTag(revision: string): RevisionTag;
+/**
+ * @returns true iff the given string is a valid `RevisionTag`
+ */
+export declare function isRevisionTag(revision: string): revision is RevisionTag;
+/**
+ * @returns a random, universally unique `RevisionTag`
+ */
+export declare function mintRevisionTag(): RevisionTag;
+/**
+ * A node in a graph of commits. A commit's parent is the commit on which it was based.
+ */
+export interface GraphCommit<TChange> {
+    /** The tag for this commit. If this commit is rebased, the corresponding rebased commit will retain this tag. */
+    readonly revision: RevisionTag;
+    /** The change that will result from applying this commit */
+    readonly change: TChange;
+    /** The parent of this commit, on whose change this commit's change is based */
+    readonly parent?: GraphCommit<TChange>;
+    /** The inverse of this commit */
+    inverse?: TChange;
+}
+/**
+ * Creates a new graph commit object. This is useful for creating copies of commits with different parentage.
+ * @param parent - the parent of the new commit
+ * @param commit - the contents of the new commit object
+ * @returns the new commit object
+ */
+export declare function mintCommit<TChange>(parent: GraphCommit<TChange>, commit: Omit<GraphCommit<TChange>, "parent">): GraphCommit<TChange>;
+//# sourceMappingURL=types.d.ts.map

package/dist/core/rebase/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/core/rebase/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAc,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAuC,MAAM,YAAY,CAAC;AAE7F;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAC/B,eAAO,MAAM,eAAe,6CAAiC,CAAC;AAE9D;;;;GAIG;AAEH,MAAM,MAAM,WAAW,GAAG,QAAQ,CAAC;AACnC,MAAM,MAAM,kBAAkB,GAAG,KAAK,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAC;AACrE,eAAO,MAAM,iBAAiB,yDAA0C,CAAC;AAEzE;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;AAEjE;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC5B;;;OAGG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;IAChC;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,gBAAgB,CAAC;CACnC;AAED,MAAM,WAAW,mBAAmB;IACnC,QAAQ,CAAC,QAAQ,CAAC,EAAE,kBAAkB,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,gBAAgB,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,SAAS,CAAC,WAAW,GAAG,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC;AAEzF;;GAEG;AACH,MAAM,MAAM,oBAAoB,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,GAAG,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAEhF;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,OAAO,CAE/E;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,CAGjE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,IAAI,WAAW,CAEvE;AAED;;GAEG;AACH,wBAAgB,eAAe,IAAI,WAAW,CAE7C;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,OAAO;IACnC,iHAAiH;IACjH,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,+EAA+E;IAC/E,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC;IACvC,iCAAiC;IACjC,OAAO,CAAC,EAAE,OAAO,CAAC;CAClB;AAED;;;;;GAKG;AAGH,wBAAgB,UAAU,CAAC,OAAO,EACjC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAC5B,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,GAC1C,WAAW,CAAC,OAAO,CAAC,CAOtB"}

package/dist/core/rebase/types.js

@@ -0,0 +1,59 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mintCommit = exports.mintRevisionTag = exports.isRevisionTag = exports.assertIsRevisionTag = exports.areEqualChangeAtomIds = exports.RevisionTagSchema = exports.SessionIdSchema = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const id_compressor_1 = require("@fluidframework/id-compressor");
+const util_1 = require("../../util");
+exports.SessionIdSchema = (0, util_1.brandedStringType)();
+exports.RevisionTagSchema = (0, util_1.brandedStringType)();
+/**
+ * @returns true iff `a` and `b` are the same.
+ */
+function areEqualChangeAtomIds(a, b) {
+    return a.localId === b.localId && a.revision === b.revision;
+}
+exports.areEqualChangeAtomIds = areEqualChangeAtomIds;
+/**
+ * @returns a `RevisionTag` from the given string, or fails if the string is not a valid `RevisionTag`
+ */
+function assertIsRevisionTag(revision) {
+    (0, core_utils_1.assert)(isRevisionTag(revision), 0x577 /* Expected revision to be valid RevisionTag */);
+    return revision;
+}
+exports.assertIsRevisionTag = assertIsRevisionTag;
+/**
+ * @returns true iff the given string is a valid `RevisionTag`
+ */
+function isRevisionTag(revision) {
+    return (0, id_compressor_1.isStableId)(revision);
+}
+exports.isRevisionTag = isRevisionTag;
+/**
+ * @returns a random, universally unique `RevisionTag`
+ */
+function mintRevisionTag() {
+    return (0, util_1.generateStableId)();
+}
+exports.mintRevisionTag = mintRevisionTag;
+/**
+ * Creates a new graph commit object. This is useful for creating copies of commits with different parentage.
+ * @param parent - the parent of the new commit
+ * @param commit - the contents of the new commit object
+ * @returns the new commit object
+ */
+// Note that this function is synchronous, and therefore it is not a Promise.
+// However, it is still a strong commit-mint.
+function mintCommit(parent, commit) {
+    const { revision, change } = commit;
+    return {
+        revision,
+        change,
+        parent,
+    };
+}
+exports.mintCommit = mintCommit;
+//# sourceMappingURL=types.js.map

package/dist/core/rebase/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/rebase/types.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,iEAAqE;AACrE,qCAA6F;AAMhF,QAAA,eAAe,GAAG,IAAA,wBAAiB,GAAa,CAAC;AAUjD,QAAA,iBAAiB,GAAG,IAAA,wBAAiB,GAAsB,CAAC;AA4CzE;;GAEG;AACH,SAAgB,qBAAqB,CAAC,CAAe,EAAE,CAAe;IACrE,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC;AAC7D,CAAC;AAFD,sDAEC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,QAAgB;IACnD,IAAA,mBAAM,EAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACvF,OAAO,QAAQ,CAAC;AACjB,CAAC;AAHD,kDAGC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,QAAgB;IAC7C,OAAO,IAAA,0BAAU,EAAC,QAAQ,CAAC,CAAC;AAC7B,CAAC;AAFD,sCAEC;AAED;;GAEG;AACH,SAAgB,eAAe;IAC9B,OAAO,IAAA,uBAAgB,GAAE,CAAC;AAC3B,CAAC;AAFD,0CAEC;AAgBD;;;;;GAKG;AACH,6EAA6E;AAC7E,6CAA6C;AAC7C,SAAgB,UAAU,CACzB,MAA4B,EAC5B,MAA4C;IAE5C,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IACpC,OAAO;QACN,QAAQ;QACR,MAAM;QACN,MAAM;KACN,CAAC;AACH,CAAC;AAVD,gCAUC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { isStableId, StableId } from \"@fluidframework/id-compressor\";\nimport { Brand, NestedMap, RangeMap, brandedStringType, generateStableId } from \"../../util\";\n\n/**\n * The identifier for a particular session/user/client that can generate `GraphCommit`s\n */\nexport type SessionId = string;\nexport const SessionIdSchema = brandedStringType<SessionId>();\n\n/**\n * A unique identifier for a commit. Commits that have been rebased, but are semantically\n * the same, will share the same revision tag.\n * @internal\n */\n// TODO: These can be compressed by an `IdCompressor` in the future\nexport type RevisionTag = StableId;\nexport type EncodedRevisionTag = Brand<string, \"EncodedRevisionTag\">;\nexport const RevisionTagSchema = brandedStringType<EncodedRevisionTag>();\n\n/**\n * An ID which is unique within a revision of a `ModularChangeset`.\n * A `ModularChangeset` which is a composition of multiple revisions may contain duplicate `ChangesetLocalId`s,\n * but they are unique when qualified by the revision of the change they are used in.\n * @internal\n */\nexport type ChangesetLocalId = Brand<number, \"ChangesetLocalId\">;\n\n/**\n * A globally unique ID for an atom of change, or a node associated with the atom of change.\n * @internal\n *\n * @privateRemarks\n * TODO: Rename this to be more general.\n */\nexport interface ChangeAtomId {\n\t/**\n\t * Uniquely identifies the changeset within which the change was made.\n\t * Only undefined when referring to an anonymous changesets.\n\t */\n\treadonly revision?: RevisionTag;\n\t/**\n\t * Uniquely identifies, in the scope of the changeset, the change made to the field.\n\t */\n\treadonly localId: ChangesetLocalId;\n}\n\nexport interface EncodedChangeAtomId {\n\treadonly revision?: EncodedRevisionTag;\n\treadonly localId: ChangesetLocalId;\n}\n\n/**\n * @internal\n */\nexport type ChangeAtomIdMap<T> = NestedMap<RevisionTag | undefined, ChangesetLocalId, T>;\n\n/**\n * @internal\n */\nexport type ChangeAtomIdRangeMap<T> = Map<RevisionTag | undefined, RangeMap<T>>;\n\n/**\n * @returns true iff `a` and `b` are the same.\n */\nexport function areEqualChangeAtomIds(a: ChangeAtomId, b: ChangeAtomId): boolean {\n\treturn a.localId === b.localId && a.revision === b.revision;\n}\n\n/**\n * @returns a `RevisionTag` from the given string, or fails if the string is not a valid `RevisionTag`\n */\nexport function assertIsRevisionTag(revision: string): RevisionTag {\n\tassert(isRevisionTag(revision), 0x577 /* Expected revision to be valid RevisionTag */);\n\treturn revision;\n}\n\n/**\n * @returns true iff the given string is a valid `RevisionTag`\n */\nexport function isRevisionTag(revision: string): revision is RevisionTag {\n\treturn isStableId(revision);\n}\n\n/**\n * @returns a random, universally unique `RevisionTag`\n */\nexport function mintRevisionTag(): RevisionTag {\n\treturn generateStableId();\n}\n\n/**\n * A node in a graph of commits. A commit's parent is the commit on which it was based.\n */\nexport interface GraphCommit<TChange> {\n\t/** The tag for this commit. If this commit is rebased, the corresponding rebased commit will retain this tag. */\n\treadonly revision: RevisionTag;\n\t/** The change that will result from applying this commit */\n\treadonly change: TChange;\n\t/** The parent of this commit, on whose change this commit's change is based */\n\treadonly parent?: GraphCommit<TChange>;\n\t/** The inverse of this commit */\n\tinverse?: TChange;\n}\n\n/**\n * Creates a new graph commit object. This is useful for creating copies of commits with different parentage.\n * @param parent - the parent of the new commit\n * @param commit - the contents of the new commit object\n * @returns the new commit object\n */\n// Note that this function is synchronous, and therefore it is not a Promise.\n// However, it is still a strong commit-mint.\nexport function mintCommit<TChange>(\n\tparent: GraphCommit<TChange>,\n\tcommit: Omit<GraphCommit<TChange>, \"parent\">,\n): GraphCommit<TChange> {\n\tconst { revision, change } = commit;\n\treturn {\n\t\trevision,\n\t\tchange,\n\t\tparent,\n\t};\n}\n"]}