@fluidframework/merge-tree 2.0.0-internal.8.0.0 → 2.0.0-rc.1.0.0

package/dist/merge-tree-beta.d.ts

@@ -170,18 +170,8 @@ declare class EndOfTreeSegment extends BaseEndpointSegment implements ISegment,
 
 /* Excluded from this release type: IAttributionCollectionSpec */
 
-/* Excluded from this release type: IChannelStorageService */
-
 /* Excluded from this release type: IClientEvents */
 
-/* Excluded from this release type: IEventThisPlaceHolder */
-
-/* Excluded from this release type: IFluidDataStoreRuntime */
-
-/* Excluded from this release type: IFluidHandle */
-
-/* Excluded from this release type: IFluidSerializer */
-
 /* Excluded from this release type: IHierBlock */
 
 /* Excluded from this release type: IJSONMarkerSegment */
@@ -271,10 +261,6 @@ declare type ISegmentLeaf = ISegment & IMergeLeaf;
 
 /* Excluded from this release type: isMergeTreeDeltaRevertible */
 
-/* Excluded from this release type: ISummaryTreeWithStats */
-
-/* Excluded from this release type: ITelemetryLoggerExt */
-
 /* Excluded from this release type: ITrackingGroup */
 
 /* Excluded from this release type: KeyComparer */
@@ -675,8 +661,6 @@ declare class StartOfTreeSegment extends BaseEndpointSegment implements ISegment
 
 /* Excluded from this release type: TrackingGroupCollection */
 
-/* Excluded from this release type: TypedEventEmitter */
-
 /* Excluded from this release type: UnassignedSequenceNumber */
 
 /* Excluded from this release type: UniversalSequenceNumber */

package/dist/merge-tree-public.d.ts

@@ -170,18 +170,8 @@ declare class EndOfTreeSegment extends BaseEndpointSegment implements ISegment,
 
 /* Excluded from this release type: IAttributionCollectionSpec */
 
-/* Excluded from this release type: IChannelStorageService */
-
 /* Excluded from this release type: IClientEvents */
 
-/* Excluded from this release type: IEventThisPlaceHolder */
-
-/* Excluded from this release type: IFluidDataStoreRuntime */
-
-/* Excluded from this release type: IFluidHandle */
-
-/* Excluded from this release type: IFluidSerializer */
-
 /* Excluded from this release type: IHierBlock */
 
 /* Excluded from this release type: IJSONMarkerSegment */
@@ -271,10 +261,6 @@ declare type ISegmentLeaf = ISegment & IMergeLeaf;
 
 /* Excluded from this release type: isMergeTreeDeltaRevertible */
 
-/* Excluded from this release type: ISummaryTreeWithStats */
-
-/* Excluded from this release type: ITelemetryLoggerExt */
-
 /* Excluded from this release type: ITrackingGroup */
 
 /* Excluded from this release type: KeyComparer */
@@ -675,8 +661,6 @@ declare class StartOfTreeSegment extends BaseEndpointSegment implements ISegment
 
 /* Excluded from this release type: TrackingGroupCollection */
 
-/* Excluded from this release type: TypedEventEmitter */
-
 /* Excluded from this release type: UnassignedSequenceNumber */
 
 /* Excluded from this release type: UniversalSequenceNumber */

package/dist/merge-tree-untrimmed.d.ts

@@ -18,7 +18,7 @@ import { TypedEventEmitter } from '@fluid-internal/client-utils';
 export declare function addProperties(oldProps: PropertySet | undefined, newProps: PropertySet): PropertySet;
 
 /**
- * @internal
+ * @alpha
  */
 export declare function appendToMergeTreeDeltaRevertibles(deltaArgs: IMergeTreeDeltaCallbackArgs, revertibles: MergeTreeDeltaRevertible[]): void;
 
@@ -344,13 +344,6 @@ export declare class Client extends TypedEventEmitter<IClientEvents> {
     getClientId(): number;
     getLength(): number;
     startOrUpdateCollaboration(longClientId: string | undefined, minSeq?: number, currentSeq?: number): void;
-    /**
-     * @deprecated Use searchForMarker instead.
-     */
-    findTile(startPos: number, tileLabel: string, preceding?: boolean): {
-        tile: ReferencePosition;
-        pos: number;
-    } | undefined;
     /**
      * Searches a string for the nearest marker in either direction to a given start position.
      * The search will include the start position, so markers at the start position are valid
@@ -556,7 +549,7 @@ export declare interface Dictionary<TKey, TData> {
 }
 
 /**
- * @internal
+ * @alpha
  */
 export declare function discardMergeTreeDeltaRevertible(revertibles: MergeTreeDeltaRevertible[]): void;
 
@@ -1629,19 +1622,6 @@ declare class MergeTree {
     private nodeLength;
     setMinSeq(minSeq: number): void;
     referencePositionToLocalPosition(refPos: ReferencePosition, refSeq?: number, clientId?: number): number;
-    /**
-     * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `tilePrecedesPos`.
-     * @deprecated Use searchForMarker instead.
-     *
-     * @param startPos - Position at which to start the search
-     * @param clientId - clientId dictating the perspective to search from
-     * @param tileLabel - Label of the tile to search for
-     * @param tilePrecedesPos - Whether the desired tile comes before (true) or after (false) `startPos`
-     */
-    findTile(startPos: number, clientId: number, tileLabel: string, tilePrecedesPos?: boolean): {
-        tile: ReferencePosition;
-        pos: number;
-    } | undefined;
     /**
      * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `forwards`.
      * Uses depthFirstNodeWalk in addition to block-accelerated functionality. The search position will be included in
@@ -1655,10 +1635,6 @@ declare class MergeTree {
      * @param forwards - Whether the string should be searched in the forward or backward direction
      */
     searchForMarker(startPos: number, clientId: number, markerLabel: string, forwards?: boolean): Marker | undefined;
-    private search;
-    private searchBlock;
-    private backwardSearch;
-    private backwardSearchBlock;
     private updateRoot;
     /**
      * Assign sequence number to existing segment; update partial lengths to reflect the change
@@ -1805,7 +1781,7 @@ export declare type MergeTreeDeltaOperationType = typeof MergeTreeDeltaType.ANNO
 export declare type MergeTreeDeltaOperationTypes = MergeTreeDeltaOperationType | MergeTreeMaintenanceType;
 
 /**
- * @internal
+ * @alpha
  */
 export declare type MergeTreeDeltaRevertible = {
     operation: typeof MergeTreeDeltaType.INSERT;
@@ -2360,7 +2336,7 @@ export declare interface ReferencePosition {
 export declare enum ReferenceType {
     Simple = 0,
     /**
-     * Allows this reference to be located using the `findTile` API on merge-tree.
+     * Allows this reference to be located using the `searchForMarker` API on merge-tree.
      */
     Tile = 1,
     /**
@@ -2439,7 +2415,7 @@ export declare const reservedRangeLabelsKey = "referenceRangeLabels";
 export declare const reservedTileLabelsKey = "referenceTileLabels";
 
 /**
- * @internal
+ * @alpha
  */
 export declare function revertMergeTreeDeltaRevertibles(driver: MergeTreeRevertibleDriver, revertibles: MergeTreeDeltaRevertible[]): void;
 

package/dist/mergeTree.d.ts

@@ -248,19 +248,6 @@ export declare class MergeTree {
     private nodeLength;
     setMinSeq(minSeq: number): void;
     referencePositionToLocalPosition(refPos: ReferencePosition, refSeq?: number, clientId?: number): number;
-    /**
-     * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `tilePrecedesPos`.
-     * @deprecated Use searchForMarker instead.
-     *
-     * @param startPos - Position at which to start the search
-     * @param clientId - clientId dictating the perspective to search from
-     * @param tileLabel - Label of the tile to search for
-     * @param tilePrecedesPos - Whether the desired tile comes before (true) or after (false) `startPos`
-     */
-    findTile(startPos: number, clientId: number, tileLabel: string, tilePrecedesPos?: boolean): {
-        tile: ReferencePosition;
-        pos: number;
-    } | undefined;
     /**
      * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `forwards`.
      * Uses depthFirstNodeWalk in addition to block-accelerated functionality. The search position will be included in
@@ -274,10 +261,6 @@ export declare class MergeTree {
      * @param forwards - Whether the string should be searched in the forward or backward direction
      */
     searchForMarker(startPos: number, clientId: number, markerLabel: string, forwards?: boolean): Marker | undefined;
-    private search;
-    private searchBlock;
-    private backwardSearch;
-    private backwardSearchBlock;
     private updateRoot;
     /**
      * Assign sequence number to existing segment; update partial lengths to reflect the change

package/dist/mergeTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mergeTree.d.ts","sourceRoot":"","sources":["../src/mergeTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAU,IAAI,EAAa,MAAM,4BAA4B,CAAC;AAErE,OAAO,EAAE,gCAAgC,EAAE,MAAM,yBAAyB,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAY,MAAM,eAAe,CAAC;AAO3D,OAAO,EAIN,sBAAsB,EACtB,iBAAiB,EACjB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAGN,mBAAmB,EAEnB,WAAW,EACX,UAAU,EACV,UAAU,EAIV,QAAQ,EACR,cAAc,EAEd,MAAM,EAEN,UAAU,EAIV,YAAY,EAIZ,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACN,qBAAqB,EAErB,sBAAsB,EACtB,4BAA4B,EAE5B,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAsB,aAAa,EAAE,MAAM,OAAO,CAAC;AAGhG,OAAO,EAAiD,WAAW,EAAE,MAAM,cAAc,CAAC;AAC1F,OAAO,EAEN,iBAAiB,EAIjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAWhE,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAE1E;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,CAAC;AAiJjD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;;OAMG;IACH,qCAAqC,CAAC,EAAE,OAAO,CAAC;IAChD,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC;;;;;;;;;;;;;;;;OAgBG;IACH,0BAA0B,CAAC,EAAE,OAAO,CAAC;IAErC;;OAEG;IACH,WAAW,CAAC,EAAE,4BAA4B,CAAC;IAE3C;;;;;;;OAOG;IACH,yBAAyB,CAAC,EAAE,OAAO,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,4BAA4B;IAC5C;;;;;;;;OAQG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB;;;;;OAKG;IACH,aAAa,CAAC,EAAE,MAAM,iBAAiB,CAAC;CACxC;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IACjC;;;;;;OAMG;IAEH,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IACjC;;OAEG;IACH,MAAM,EAAE,MAAM,IAAI,CAAC;IACnB,KAAK;IACL,UAAU,EAAE,OAAO,CAAC;IACpB;;OAEG;IACH,UAAU,EAAE,gCAAgC,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IAC1B,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAgB,SAAQ,WAAW;IACnD,SAAS,CAAC,EAAE,SAAS,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CACjC,aAAa,EAAE,UAAU,GAAG,SAAS,GACnC,eAAe,GAAG,SAAS,CAY7B;AAoFD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC/B,MAAM,EAAE;IAAE,OAAO,EAAE,QAAQ,GAAG,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,EACrE,iBAAiB,GAAE,iBAA6C,EAChE,qBAAqB,GAAE,OAAe;aAFnB,QAAQ,GAAG,SAAS;YAAU,MAAM,GAAG,SAAS;EAsBnE;AAED;;GAEG;AACH,qBAAa,SAAS;IAgEK,OAAO,CAAC;IA/DlC,gBAAuB,OAAO;;;;MAI5B;IAEF,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAgD;IAGzF,SAAgB,YAAY,sBAA6B;IAGzD,SAAgB,eAAe,iCAAwC;IAEvE,SAAgB,eAAe,mBAA4C;IAE3E,SAAgB,iBAAiB,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAEjE;;;;OAIG;IACH,OAAO,CAAC,qBAAqB,CAAS;IAGtC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACjD,sBAAsB,CAAC,EAAE,sBAAsB,CAAC;IAChD,4BAA4B,CAAC,EAAE,4BAA4B,CAAC;IAEnE;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,QAAQ,CAAgB;IAEhC;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA0B;IAExD;;;;;;OAMG;IAEH,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAwC;gBAEnD,OAAO,CAAC,+BAAmB;IAMrD,OAAO,CAAC,KAAK,CAAkB;IAC/B,IAAW,IAAI,IAAI,eAAe,CAEjC;IAED,IAAW,IAAI,CAAC,KAAK,EAJF,eAIE,EAGpB;IAEM,SAAS,CAAC,UAAU,EAAE,MAAM;IAMnC;;;;;;OAMG;IACI,cAAc,CACpB,OAAO,EAAE,QAAQ,EACjB,MAAM,CAAC,EAAE,MAAM,EACf,QAAQ,CAAC,EAAE,MAAM,GACf,MAAM,GAAG,SAAS;IAwDd,YAAY,CAAC,MAAM,EAAE,MAAM;IAOlC,OAAO,CAAC,OAAO;IAMR,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,EAAE;IAoDvC,kBAAkB,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAQnF,OAAO,CAAC,WAAW;IAYZ,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI1D;;OAEG;IACH,IAAW,MAAM,uBAEhB;IAEM,WAAW,CACjB,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM,GACf,MAAM;IAuBF,oBAAoB,CAAC,CAAC,SAAS,QAAQ,EAC7C,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM;;;;IAwBlB;;;;;;;;;;;;;;;;;;;OAmBG;IACH,OAAO,CAAC,kCAAkC;IA4L1C,OAAO,CAAC,WAAW;IAMnB;;;;OAIG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM;IAoB1C,OAAO,CAAC,UAAU;IA4EX,SAAS,CAAC,MAAM,EAAE,MAAM;IAsBxB,gCAAgC,CACtC,MAAM,EAAE,iBAAiB,EACzB,MAAM,SAA+B,EACrC,QAAQ,SAA6B,GACnC,MAAM;IAgBT;;;;;;;;OAQG;IACI,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,UAAO;;;;IA4C7F;;;;;;;;;;;OAWG;IACI,eAAe,CACrB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,EACnB,QAAQ,UAAO,GACb,MAAM,GAAG,SAAS;IAwCrB,OAAO,CAAC,MAAM;IAUd,OAAO,CAAC,WAAW;IA+CnB,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,mBAAmB;IA4C3B,OAAO,CAAC,UAAU;IAWlB;;;OAGG;IACI,iBAAiB,CAAC,MAAM,EAAE,qBAAqB;IAoFtD,OAAO,CAAC,gBAAgB;IAmCjB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAItD;;;;;;OAMG;IACI,kBAAkB,CACxB,WAAW,EAAE,iBAAiB,EAC9B,MAAM,SAA+B,EACrC,QAAQ,SAA6B;IAuB/B,cAAc,CACpB,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,QAAQ,EAAE,EACpB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,qBAAqB,GAAG,SAAS;IA0B1C;;;;;;;;;;;;;OAaG;IACI,2BAA2B,CACjC,oBAAoB,EAAE,MAAM,EAC5B,kBAAkB,EAAE,MAAM,EAC1B,cAAc,EAAE,MAAM,GACpB,MAAM,GAAG,SAAS;IAuBrB,OAAO,CAAC,WAAW;IA8NnB,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAkB/B;IAEF,OAAO,CAAC,sBAAsB;IAa9B,OAAO,CAAC,QAAQ;IA6BhB,OAAO,CAAC,oBAAoB;IAI5B,OAAO,CAAC,aAAa;IAwHrB,OAAO,CAAC,KAAK;IAeN,kBAAkB,CAAC,KAAK,EAAE,WAAW;IAU5C;;;;;;;;;;OAUG;IACI,aAAa,CACnB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,qBAAqB,EAC7B,QAAQ,GAAE,kBAA4C;IAwDvD;;OAEG;IACI,eAAe,CACrB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,SAAS,qBAAiB,EAC1B,MAAM,EAAE,qBAAqB,GAC3B,IAAI;IA4HA,gBAAgB,CACtB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,SAAS,qBAAQ,EACjB,MAAM,EAAE,qBAAqB,GAC3B,IAAI;IAsFP;;OAEG;IAEI,QAAQ,CAAC,EAAE,EAAE,iBAAiB,EAAE,eAAe,EAAE,YAAY;IAuGpE;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAmBrB,4BAA4B,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,UAAQ;IAQ7D,4BAA4B,CAClC,IAAI,EAAE,sBAAsB,GAC1B,sBAAsB,GAAG,SAAS;IAKrC,WAAW,qBAAgC;IAC3C,SAAS,mBAA8B;IAEhC,4BAA4B,CAClC,QAAQ,EAAE,YAAY,GAAG,OAAO,GAAG,KAAK,EACxC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,aAAa,EACtB,UAAU,EAAE,WAAW,GAAG,SAAS,EACnC,iBAAiB,CAAC,EAAE,iBAAiB,EACrC,kBAAkB,CAAC,EAAE,OAAO,GAC1B,sBAAsB;IAsCzB,OAAO,CAAC,yBAAyB;IAqGjC;;;;;;;;;;;;;;;;;;;OAmBG;IACI,yBAAyB,IAAI,IAAI;IAmCxC,OAAO,CAAC,iBAAiB;IA4BzB,OAAO,CAAC,WAAW;IAwBZ,sBAAsB,CAC5B,UAAU,EAAE,WAAW,GAAG,SAAS,EACnC,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,YAAY,UAAQ;IAarB,OAAO,CAAC,iBAAiB;IAsBzB;;;;;;OAMG;IACI,QAAQ,CAAC,WAAW,EAC1B,OAAO,EAAE,cAAc,CAAC,WAAW,CAAC,EACpC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,WAAW,EAClB,KAAK,CAAC,EAAE,MAAM,EACd,GAAG,CAAC,EAAE,MAAM,EACZ,UAAU,GAAE,OAAe,EAC3B,aAAa,GAAE,MAAe;IAuB/B;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,OAAO,CAAC,OAAO;CAkEf"}
+{"version":3,"file":"mergeTree.d.ts","sourceRoot":"","sources":["../src/mergeTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAU,IAAI,EAAa,MAAM,4BAA4B,CAAC;AAErE,OAAO,EAAE,gCAAgC,EAAE,MAAM,yBAAyB,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAY,MAAM,eAAe,CAAC;AAO3D,OAAO,EAIN,sBAAsB,EACtB,iBAAiB,EACjB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAGN,mBAAmB,EAEnB,WAAW,EACX,UAAU,EACV,UAAU,EAIV,QAAQ,EACR,cAAc,EAEd,MAAM,EAEN,UAAU,EAGV,YAAY,EAIZ,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACN,qBAAqB,EAErB,sBAAsB,EACtB,4BAA4B,EAE5B,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAsB,aAAa,EAAE,MAAM,OAAO,CAAC;AAGhG,OAAO,EAAiD,WAAW,EAAE,MAAM,cAAc,CAAC;AAC1F,OAAO,EAEN,iBAAiB,EAIjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAWhE,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAE1E;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,CAAC;AAyFjD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;;OAMG;IACH,qCAAqC,CAAC,EAAE,OAAO,CAAC;IAChD,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC;;;;;;;;;;;;;;;;OAgBG;IACH,0BAA0B,CAAC,EAAE,OAAO,CAAC;IAErC;;OAEG;IACH,WAAW,CAAC,EAAE,4BAA4B,CAAC;IAE3C;;;;;;;OAOG;IACH,yBAAyB,CAAC,EAAE,OAAO,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,4BAA4B;IAC5C;;;;;;;;OAQG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB;;;;;OAKG;IACH,aAAa,CAAC,EAAE,MAAM,iBAAiB,CAAC;CACxC;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IACjC;;;;;;OAMG;IAEH,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IACjC;;OAEG;IACH,MAAM,EAAE,MAAM,IAAI,CAAC;IACnB,KAAK;IACL,UAAU,EAAE,OAAO,CAAC;IACpB;;OAEG;IACH,UAAU,EAAE,gCAAgC,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IAC1B,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAgB,SAAQ,WAAW;IACnD,SAAS,CAAC,EAAE,SAAS,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CACjC,aAAa,EAAE,UAAU,GAAG,SAAS,GACnC,eAAe,GAAG,SAAS,CAY7B;AAoFD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC/B,MAAM,EAAE;IAAE,OAAO,EAAE,QAAQ,GAAG,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,EACrE,iBAAiB,GAAE,iBAA6C,EAChE,qBAAqB,GAAE,OAAe;aAFnB,QAAQ,GAAG,SAAS;YAAU,MAAM,GAAG,SAAS;EAsBnE;AAED;;GAEG;AACH,qBAAa,SAAS;IAgEK,OAAO,CAAC;IA/DlC,gBAAuB,OAAO;;;;MAI5B;IAEF,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAgD;IAGzF,SAAgB,YAAY,sBAA6B;IAGzD,SAAgB,eAAe,iCAAwC;IAEvE,SAAgB,eAAe,mBAA4C;IAE3E,SAAgB,iBAAiB,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAEjE;;;;OAIG;IACH,OAAO,CAAC,qBAAqB,CAAS;IAGtC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACjD,sBAAsB,CAAC,EAAE,sBAAsB,CAAC;IAChD,4BAA4B,CAAC,EAAE,4BAA4B,CAAC;IAEnE;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,QAAQ,CAAgB;IAEhC;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA0B;IAExD;;;;;;OAMG;IAEH,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAwC;gBAEnD,OAAO,CAAC,+BAAmB;IAMrD,OAAO,CAAC,KAAK,CAAkB;IAC/B,IAAW,IAAI,IAAI,eAAe,CAEjC;IAED,IAAW,IAAI,CAAC,KAAK,EAJF,eAIE,EAGpB;IAEM,SAAS,CAAC,UAAU,EAAE,MAAM;IAMnC;;;;;;OAMG;IACI,cAAc,CACpB,OAAO,EAAE,QAAQ,EACjB,MAAM,CAAC,EAAE,MAAM,EACf,QAAQ,CAAC,EAAE,MAAM,GACf,MAAM,GAAG,SAAS;IAwDd,YAAY,CAAC,MAAM,EAAE,MAAM;IAOlC,OAAO,CAAC,OAAO;IAMR,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,EAAE;IAoDvC,kBAAkB,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAQnF,OAAO,CAAC,WAAW;IAYZ,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI1D;;OAEG;IACH,IAAW,MAAM,uBAEhB;IAEM,WAAW,CACjB,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM,GACf,MAAM;IAuBF,oBAAoB,CAAC,CAAC,SAAS,QAAQ,EAC7C,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM;;;;IAwBlB;;;;;;;;;;;;;;;;;;;OAmBG;IACH,OAAO,CAAC,kCAAkC;IA4L1C,OAAO,CAAC,WAAW;IAMnB;;;;OAIG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM;IAoB1C,OAAO,CAAC,UAAU;IA4EX,SAAS,CAAC,MAAM,EAAE,MAAM;IAsBxB,gCAAgC,CACtC,MAAM,EAAE,iBAAiB,EACzB,MAAM,SAA+B,EACrC,QAAQ,SAA6B,GACnC,MAAM;IAeT;;;;;;;;;;;OAWG;IACI,eAAe,CACrB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,EACnB,QAAQ,UAAO,GACb,MAAM,GAAG,SAAS;IAwCrB,OAAO,CAAC,UAAU;IAWlB;;;OAGG;IACI,iBAAiB,CAAC,MAAM,EAAE,qBAAqB;IAoFtD,OAAO,CAAC,gBAAgB;IAmCjB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAItD;;;;;;OAMG;IACI,kBAAkB,CACxB,WAAW,EAAE,iBAAiB,EAC9B,MAAM,SAA+B,EACrC,QAAQ,SAA6B;IAuB/B,cAAc,CACpB,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,QAAQ,EAAE,EACpB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,qBAAqB,GAAG,SAAS;IA0B1C;;;;;;;;;;;;;OAaG;IACI,2BAA2B,CACjC,oBAAoB,EAAE,MAAM,EAC5B,kBAAkB,EAAE,MAAM,EAC1B,cAAc,EAAE,MAAM,GACpB,MAAM,GAAG,SAAS;IAuBrB,OAAO,CAAC,WAAW;IA8NnB,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAkB/B;IAEF,OAAO,CAAC,sBAAsB;IAa9B,OAAO,CAAC,QAAQ;IA6BhB,OAAO,CAAC,oBAAoB;IAI5B,OAAO,CAAC,aAAa;IAwHrB,OAAO,CAAC,KAAK;IAeN,kBAAkB,CAAC,KAAK,EAAE,WAAW;IAU5C;;;;;;;;;;OAUG;IACI,aAAa,CACnB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,qBAAqB,EAC7B,QAAQ,GAAE,kBAA4C;IAwDvD;;OAEG;IACI,eAAe,CACrB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,SAAS,qBAAiB,EAC1B,MAAM,EAAE,qBAAqB,GAC3B,IAAI;IA4HA,gBAAgB,CACtB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,SAAS,qBAAQ,EACjB,MAAM,EAAE,qBAAqB,GAC3B,IAAI;IAsFP;;OAEG;IAEI,QAAQ,CAAC,EAAE,EAAE,iBAAiB,EAAE,eAAe,EAAE,YAAY;IAuGpE;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAmBrB,4BAA4B,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,UAAQ;IAQ7D,4BAA4B,CAClC,IAAI,EAAE,sBAAsB,GAC1B,sBAAsB,GAAG,SAAS;IAKrC,WAAW,qBAAgC;IAC3C,SAAS,mBAA8B;IAEhC,4BAA4B,CAClC,QAAQ,EAAE,YAAY,GAAG,OAAO,GAAG,KAAK,EACxC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,aAAa,EACtB,UAAU,EAAE,WAAW,GAAG,SAAS,EACnC,iBAAiB,CAAC,EAAE,iBAAiB,EACrC,kBAAkB,CAAC,EAAE,OAAO,GAC1B,sBAAsB;IAsCzB,OAAO,CAAC,yBAAyB;IAqGjC;;;;;;;;;;;;;;;;;;;OAmBG;IACI,yBAAyB,IAAI,IAAI;IAmCxC,OAAO,CAAC,iBAAiB;IA4BzB,OAAO,CAAC,WAAW;IAwBZ,sBAAsB,CAC5B,UAAU,EAAE,WAAW,GAAG,SAAS,EACnC,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,YAAY,UAAQ;IAarB,OAAO,CAAC,iBAAiB;IAsBzB;;;;;;OAMG;IACI,QAAQ,CAAC,WAAW,EAC1B,OAAO,EAAE,cAAc,CAAC,WAAW,CAAC,EACpC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,WAAW,EAClB,KAAK,CAAC,EAAE,MAAM,EACd,GAAG,CAAC,EAAE,MAAM,EACZ,UAAU,GAAE,OAAe,EAC3B,aAAa,GAAE,MAAe;IAuB/B;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,OAAO,CAAC,OAAO;CAkEf"}

package/dist/mergeTree.js

@@ -63,35 +63,6 @@ const LRUSegmentComparer = {
     min: { maxSeq: -2 },
     compare: (a, b) => a.maxSeq - b.maxSeq,
 };
-function recordTileStart(segment, segpos, refSeq, clientId, start, end, searchInfo) {
-    if (mergeTreeNodes_1.Marker.is(segment)) {
-        if ((0, referencePositions_1.refHasTileLabel)(segment, searchInfo.tileLabel)) {
-            searchInfo.tile = segment;
-        }
-    }
-    return false;
-}
-function tileShift(node, segpos, refSeq, clientId, offset, end, searchInfo) {
-    if (node.isLeaf()) {
-        const seg = node;
-        if ((searchInfo.mergeTree.localNetLength(seg) ?? 0) > 0 && mergeTreeNodes_1.Marker.is(seg)) {
-            if ((0, referencePositions_1.refHasTileLabel)(seg, searchInfo.tileLabel)) {
-                searchInfo.tile = seg;
-            }
-        }
-    }
-    else {
-        const block = node;
-        const marker = searchInfo.tilePrecedesPos
-            ? block.rightmostTiles[searchInfo.tileLabel]
-            : block.leftmostTiles[searchInfo.tileLabel];
-        if (marker !== undefined) {
-            (0, core_utils_1.assert)(marker.isLeaf() && mergeTreeNodes_1.Marker.is(marker), 0x868 /* Object returned is not a valid marker */);
-            searchInfo.tile = marker;
-        }
-    }
-    return true;
-}
 function addTile(tile, tiles) {
     const tileLabels = (0, referencePositions_1.refGetTileLabels)(tile);
     if (tileLabels) {
@@ -682,42 +653,6 @@ class MergeTree {
         }
         return referencePositions_1.DetachedReferencePosition;
     }
-    // TODO: filter function
-    /**
-     * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `tilePrecedesPos`.
-     * @deprecated Use searchForMarker instead.
-     *
-     * @param startPos - Position at which to start the search
-     * @param clientId - clientId dictating the perspective to search from
-     * @param tileLabel - Label of the tile to search for
-     * @param tilePrecedesPos - Whether the desired tile comes before (true) or after (false) `startPos`
-     */
-    findTile(startPos, clientId, tileLabel, tilePrecedesPos = true) {
-        const searchInfo = {
-            mergeTree: this,
-            tilePrecedesPos,
-            tileLabel,
-        };
-        if (tilePrecedesPos) {
-            this.search(startPos, constants_1.UniversalSequenceNumber, clientId, { leaf: recordTileStart, shift: tileShift }, searchInfo);
-        }
-        else {
-            this.backwardSearch(startPos, constants_1.UniversalSequenceNumber, clientId, { leaf: recordTileStart, shift: tileShift }, searchInfo);
-        }
-        if (searchInfo.tile) {
-            let pos;
-            if (searchInfo.tile.isLeaf()) {
-                const marker = searchInfo.tile;
-                pos = this.getPosition(marker, constants_1.UniversalSequenceNumber, clientId);
-            }
-            else {
-                const localRef = searchInfo.tile;
-                pos = this.referencePositionToLocalPosition(localRef, constants_1.UniversalSequenceNumber, clientId);
-            }
-            return { tile: searchInfo.tile, pos };
-        }
-        return undefined;
-    }
     /**
      * Finds the nearest reference with ReferenceType.Tile to `startPos` in the direction dictated by `forwards`.
      * Uses depthFirstNodeWalk in addition to block-accelerated functionality. The search position will be included in
@@ -757,71 +692,6 @@ class MergeTree {
         }, undefined, undefined, forwards);
         return foundMarker;
     }
-    search(pos, refSeq, clientId, actions, clientData) {
-        return this.searchBlock(this.root, pos, 0, refSeq, clientId, actions, clientData);
-    }
-    searchBlock(block, pos, segpos, refSeq, clientId, actions, clientData, localSeq) {
-        const { pre, post, contains, leaf, shift } = actions ?? {};
-        let _pos = pos;
-        let _segpos = segpos;
-        const children = block.children;
-        pre?.(block, _segpos, refSeq, clientId, undefined, undefined, clientData);
-        for (let childIndex = 0; childIndex < block.childCount; childIndex++) {
-            const child = children[childIndex];
-            const len = this.nodeLength(child, refSeq, clientId, localSeq) ?? 0;
-            if ((!contains && _pos < len) ||
-                contains?.(child, _pos, refSeq, clientId, undefined, undefined, clientData)) {
-                // Found entry containing pos
-                if (!child.isLeaf()) {
-                    return this.searchBlock(child, _pos, _segpos, refSeq, clientId, actions, clientData, localSeq);
-                }
-                else {
-                    leaf?.(child, _segpos, refSeq, clientId, _pos, -1, clientData);
-                    return child;
-                }
-            }
-            else {
-                shift?.(child, _segpos, refSeq, clientId, _pos, undefined, clientData);
-                _pos -= len;
-                _segpos += len;
-            }
-        }
-        post?.(block, _segpos, refSeq, clientId, undefined, undefined, clientData);
-    }
-    backwardSearch(pos, refSeq, clientId, actions, clientData) {
-        const len = this.getLength(refSeq, clientId);
-        if (pos > len) {
-            return undefined;
-        }
-        return this.backwardSearchBlock(this.root, pos, len, refSeq, clientId, actions, clientData);
-    }
-    backwardSearchBlock(block, pos, segEnd, refSeq, clientId, actions, clientData) {
-        const { pre, post, contains, leaf, shift } = actions ?? {};
-        let _segEnd = segEnd;
-        const children = block.children;
-        pre?.(block, _segEnd, refSeq, clientId, undefined, undefined, clientData);
-        for (let childIndex = block.childCount - 1; childIndex >= 0; childIndex--) {
-            const child = children[childIndex];
-            const len = this.nodeLength(child, refSeq, clientId) ?? 0;
-            const segpos = _segEnd - len;
-            if ((!contains && pos >= segpos) ||
-                contains?.(child, pos, refSeq, clientId, undefined, undefined, clientData)) {
-                // Found entry containing pos
-                if (!child.isLeaf()) {
-                    return this.backwardSearchBlock(child, pos, _segEnd, refSeq, clientId, actions, clientData);
-                }
-                else {
-                    leaf?.(child, segpos, refSeq, clientId, pos, -1, clientData);
-                    return child;
-                }
-            }
-            else {
-                shift?.(child, segpos, refSeq, clientId, pos, undefined, clientData);
-                _segEnd = segpos;
-            }
-        }
-        post?.(block, _segEnd, refSeq, clientId, undefined, undefined, clientData);
-    }
     updateRoot(splitNode) {
         if (splitNode !== undefined) {
             const newRoot = this.makeBlock(2);