@pie-element/ebsr 9.0.2-next.28 → 9.0.2-next.45

package/configure/node_modules/slate/dist/interfaces/node.d.ts

@@ -1,174 +0,0 @@
-import { Editor, Path, Range, Text } from '..';
-import { Element, ElementEntry } from './element';
-/**
- * The `Node` union type represents all of the different types of nodes that
- * occur in a Slate document tree.
- */
-export declare type BaseNode = Editor | Element | Text;
-export declare type Node = Editor | Element | Text;
-export interface NodeAncestorsOptions {
-    reverse?: boolean;
-}
-export interface NodeChildrenOptions {
-    reverse?: boolean;
-}
-export interface NodeDescendantsOptions {
-    from?: Path;
-    to?: Path;
-    reverse?: boolean;
-    pass?: (node: NodeEntry) => boolean;
-}
-export interface NodeElementsOptions {
-    from?: Path;
-    to?: Path;
-    reverse?: boolean;
-    pass?: (node: NodeEntry) => boolean;
-}
-export interface NodeLevelsOptions {
-    reverse?: boolean;
-}
-export interface NodeNodesOptions {
-    from?: Path;
-    to?: Path;
-    reverse?: boolean;
-    pass?: (entry: NodeEntry) => boolean;
-}
-export interface NodeTextsOptions {
-    from?: Path;
-    to?: Path;
-    reverse?: boolean;
-    pass?: (node: NodeEntry) => boolean;
-}
-export interface NodeInterface {
-    /**
-     * Get the node at a specific path, asserting that it's an ancestor node.
-     */
-    ancestor: (root: Node, path: Path) => Ancestor;
-    /**
-     * Return a generator of all the ancestor nodes above a specific path.
-     *
-     * By default the order is top-down, from highest to lowest ancestor in
-     * the tree, but you can pass the `reverse: true` option to go bottom-up.
-     */
-    ancestors: (root: Node, path: Path, options?: NodeAncestorsOptions) => Generator<NodeEntry<Ancestor>, void, undefined>;
-    /**
-     * Get the child of a node at a specific index.
-     */
-    child: (root: Node, index: number) => Descendant;
-    /**
-     * Iterate over the children of a node at a specific path.
-     */
-    children: (root: Node, path: Path, options?: NodeChildrenOptions) => Generator<NodeEntry<Descendant>, void, undefined>;
-    /**
-     * Get an entry for the common ancesetor node of two paths.
-     */
-    common: (root: Node, path: Path, another: Path) => NodeEntry;
-    /**
-     * Get the node at a specific path, asserting that it's a descendant node.
-     */
-    descendant: (root: Node, path: Path) => Descendant;
-    /**
-     * Return a generator of all the descendant node entries inside a root node.
-     */
-    descendants: (root: Node, options?: NodeDescendantsOptions) => Generator<NodeEntry<Descendant>, void, undefined>;
-    /**
-     * Return a generator of all the element nodes inside a root node. Each iteration
-     * will return an `ElementEntry` tuple consisting of `[Element, Path]`. If the
-     * root node is an element it will be included in the iteration as well.
-     */
-    elements: (root: Node, options?: NodeElementsOptions) => Generator<ElementEntry, void, undefined>;
-    /**
-     * Extract props from a Node.
-     */
-    extractProps: (node: Node) => NodeProps;
-    /**
-     * Get the first node entry in a root node from a path.
-     */
-    first: (root: Node, path: Path) => NodeEntry;
-    /**
-     * Get the sliced fragment represented by a range inside a root node.
-     */
-    fragment: (root: Node, range: Range) => Descendant[];
-    /**
-     * Get the descendant node referred to by a specific path. If the path is an
-     * empty array, it refers to the root node itself.
-     */
-    get: (root: Node, path: Path) => Node;
-    /**
-     * Check if a descendant node exists at a specific path.
-     */
-    has: (root: Node, path: Path) => boolean;
-    /**
-     * Check if a value implements the `Node` interface.
-     */
-    isNode: (value: any) => value is Node;
-    /**
-     * Check if a value is a list of `Node` objects.
-     */
-    isNodeList: (value: any) => value is Node[];
-    /**
-     * Get the last node entry in a root node from a path.
-     */
-    last: (root: Node, path: Path) => NodeEntry;
-    /**
-     * Get the node at a specific path, ensuring it's a leaf text node.
-     */
-    leaf: (root: Node, path: Path) => Text;
-    /**
-     * Return a generator of the in a branch of the tree, from a specific path.
-     *
-     * By default the order is top-down, from highest to lowest node in the tree,
-     * but you can pass the `reverse: true` option to go bottom-up.
-     */
-    levels: (root: Node, path: Path, options?: NodeLevelsOptions) => Generator<NodeEntry, void, undefined>;
-    /**
-     * Check if a node matches a set of props.
-     */
-    matches: (node: Node, props: Partial<Node>) => boolean;
-    /**
-     * Return a generator of all the node entries of a root node. Each entry is
-     * returned as a `[Node, Path]` tuple, with the path referring to the node's
-     * position inside the root node.
-     */
-    nodes: (root: Node, options?: NodeNodesOptions) => Generator<NodeEntry, void, undefined>;
-    /**
-     * Get the parent of a node at a specific path.
-     */
-    parent: (root: Node, path: Path) => Ancestor;
-    /**
-     * Get the concatenated text string of a node's content.
-     *
-     * Note that this will not include spaces or line breaks between block nodes.
-     * It is not a user-facing string, but a string for performing offset-related
-     * computations for a node.
-     */
-    string: (node: Node) => string;
-    /**
-     * Return a generator of all leaf text nodes in a root node.
-     */
-    texts: (root: Node, options?: NodeTextsOptions) => Generator<NodeEntry<Text>, void, undefined>;
-}
-export declare const Node: NodeInterface;
-/**
- * The `Descendant` union type represents nodes that are descendants in the
- * tree. It is returned as a convenience in certain cases to narrow a value
- * further than the more generic `Node` union.
- */
-export declare type Descendant = Element | Text;
-/**
- * The `Ancestor` union type represents nodes that are ancestors in the tree.
- * It is returned as a convenience in certain cases to narrow a value further
- * than the more generic `Node` union.
- */
-export declare type Ancestor = Editor | Element;
-/**
- * `NodeEntry` objects are returned when iterating over the nodes in a Slate
- * document tree. They consist of the node and its `Path` relative to the root
- * node in the document.
- */
-export declare type NodeEntry<T extends Node = Node> = [T, Path];
-/**
- * Convenience type for returning the props of a node.
- */
-export declare type NodeProps = Omit<Editor, 'children'> | Omit<Element, 'children'> | Omit<Text, 'text'>;
-//# sourceMappingURL=node.d.ts.map

package/configure/node_modules/slate/dist/interfaces/node.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAY,IAAI,EAAE,MAAM,IAAI,CAAA;AACxD,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAA;AAEjD;;;GAGG;AAEH,oBAAY,QAAQ,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAA;AAC9C,oBAAY,IAAI,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAA;AAE1C,MAAM,WAAW,oBAAoB;IACnC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,sBAAsB;IACrC,IAAI,CAAC,EAAE,IAAI,CAAA;IACX,EAAE,CAAC,EAAE,IAAI,CAAA;IACT,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAA;CACpC;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,CAAC,EAAE,IAAI,CAAA;IACX,EAAE,CAAC,EAAE,IAAI,CAAA;IACT,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAA;CACpC;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,IAAI,CAAA;IACX,EAAE,CAAC,EAAE,IAAI,CAAA;IACT,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,KAAK,OAAO,CAAA;CACrC;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,IAAI,CAAA;IACX,EAAE,CAAC,EAAE,IAAI,CAAA;IACT,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAA;CACpC;AAED,MAAM,WAAW,aAAa;IAC5B;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAA;IAE9C;;;;;OAKG;IACH,SAAS,EAAE,CACT,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,oBAAoB,KAC3B,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAEpD;;OAEG;IACH,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,KAAK,UAAU,CAAA;IAEhD;;OAEG;IACH,QAAQ,EAAE,CACR,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,mBAAmB,KAC1B,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAEtD;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,SAAS,CAAA;IAE5D;;OAEG;IACH,UAAU,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,UAAU,CAAA;IAElD;;OAEG;IACH,WAAW,EAAE,CACX,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,sBAAsB,KAC7B,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAEtD;;;;OAIG;IACH,QAAQ,EAAE,CACR,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,mBAAmB,KAC1B,SAAS,CAAC,YAAY,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAE7C;;OAEG;IACH,YAAY,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS,CAAA;IAEvC;;OAEG;IACH,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,SAAS,CAAA;IAE5C;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,EAAE,CAAA;IAEpD;;;OAGG;IACH,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAA;IAErC;;OAEG;IACH,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,OAAO,CAAA;IAExC;;OAEG;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,IAAI,CAAA;IAErC;;OAEG;IACH,UAAU,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,IAAI,EAAE,CAAA;IAE3C;;OAEG;IACH,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,SAAS,CAAA;IAE3C;;OAEG;IACH,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAA;IAEtC;;;;;OAKG;IACH,MAAM,EAAE,CACN,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,iBAAiB,KACxB,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAE1C;;OAEG;IACH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO,CAAA;IAEtD;;;;OAIG;IACH,KAAK,EAAE,CACL,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,gBAAgB,KACvB,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAE1C;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAA;IAE5C;;;;;;OAMG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,CAAA;IAE9B;;OAEG;IACH,KAAK,EAAE,CACL,IAAI,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,gBAAgB,KACvB,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;CACjD;AAKD,eAAO,MAAM,IAAI,EAAE,aAmYlB,CAAA;AAED;;;;GAIG;AAEH,oBAAY,UAAU,GAAG,OAAO,GAAG,IAAI,CAAA;AAEvC;;;;GAIG;AAEH,oBAAY,QAAQ,GAAG,MAAM,GAAG,OAAO,CAAA;AAEvC;;;;GAIG;AAEH,oBAAY,SAAS,CAAC,CAAC,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;AAExD;;GAEG;AACH,oBAAY,SAAS,GACjB,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,GACxB,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,GACzB,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA"}

package/configure/node_modules/slate/dist/interfaces/operation.d.ts

@@ -1,108 +0,0 @@
-import { ExtendedType, Node, Path, Range } from '..';
-export declare type BaseInsertNodeOperation = {
-    type: 'insert_node';
-    path: Path;
-    node: Node;
-};
-export declare type InsertNodeOperation = ExtendedType<'InsertNodeOperation', BaseInsertNodeOperation>;
-export declare type BaseInsertTextOperation = {
-    type: 'insert_text';
-    path: Path;
-    offset: number;
-    text: string;
-};
-export declare type InsertTextOperation = ExtendedType<'InsertTextOperation', BaseInsertTextOperation>;
-export declare type BaseMergeNodeOperation = {
-    type: 'merge_node';
-    path: Path;
-    position: number;
-    properties: Partial<Node>;
-};
-export declare type MergeNodeOperation = ExtendedType<'MergeNodeOperation', BaseMergeNodeOperation>;
-export declare type BaseMoveNodeOperation = {
-    type: 'move_node';
-    path: Path;
-    newPath: Path;
-};
-export declare type MoveNodeOperation = ExtendedType<'MoveNodeOperation', BaseMoveNodeOperation>;
-export declare type BaseRemoveNodeOperation = {
-    type: 'remove_node';
-    path: Path;
-    node: Node;
-};
-export declare type RemoveNodeOperation = ExtendedType<'RemoveNodeOperation', BaseRemoveNodeOperation>;
-export declare type BaseRemoveTextOperation = {
-    type: 'remove_text';
-    path: Path;
-    offset: number;
-    text: string;
-};
-export declare type RemoveTextOperation = ExtendedType<'RemoveTextOperation', BaseRemoveTextOperation>;
-export declare type BaseSetNodeOperation = {
-    type: 'set_node';
-    path: Path;
-    properties: Partial<Node>;
-    newProperties: Partial<Node>;
-};
-export declare type SetNodeOperation = ExtendedType<'SetNodeOperation', BaseSetNodeOperation>;
-export declare type BaseSetSelectionOperation = {
-    type: 'set_selection';
-    properties: null;
-    newProperties: Range;
-} | {
-    type: 'set_selection';
-    properties: Partial<Range>;
-    newProperties: Partial<Range>;
-} | {
-    type: 'set_selection';
-    properties: Range;
-    newProperties: null;
-};
-export declare type SetSelectionOperation = ExtendedType<'SetSelectionOperation', BaseSetSelectionOperation>;
-export declare type BaseSplitNodeOperation = {
-    type: 'split_node';
-    path: Path;
-    position: number;
-    properties: Partial<Node>;
-};
-export declare type SplitNodeOperation = ExtendedType<'SplitNodeOperation', BaseSplitNodeOperation>;
-export declare type NodeOperation = InsertNodeOperation | MergeNodeOperation | MoveNodeOperation | RemoveNodeOperation | SetNodeOperation | SplitNodeOperation;
-export declare type SelectionOperation = SetSelectionOperation;
-export declare type TextOperation = InsertTextOperation | RemoveTextOperation;
-/**
- * `Operation` objects define the low-level instructions that Slate editors use
- * to apply changes to their internal state. Representing all changes as
- * operations is what allows Slate editors to easily implement history,
- * collaboration, and other features.
- */
-export declare type BaseOperation = NodeOperation | SelectionOperation | TextOperation;
-export declare type Operation = ExtendedType<'Operation', BaseOperation>;
-export interface OperationInterface {
-    /**
-     * Check if a value is a `NodeOperation` object.
-     */
-    isNodeOperation: (value: any) => value is NodeOperation;
-    /**
-     * Check if a value is an `Operation` object.
-     */
-    isOperation: (value: any) => value is Operation;
-    /**
-     * Check if a value is a list of `Operation` objects.
-     */
-    isOperationList: (value: any) => value is Operation[];
-    /**
-     * Check if a value is a `SelectionOperation` object.
-     */
-    isSelectionOperation: (value: any) => value is SelectionOperation;
-    /**
-     * Check if a value is a `TextOperation` object.
-     */
-    isTextOperation: (value: any) => value is TextOperation;
-    /**
-     * Invert an operation, returning a new operation that will exactly undo the
-     * original when applied.
-     */
-    inverse: (op: Operation) => Operation;
-}
-export declare const Operation: OperationInterface;
-//# sourceMappingURL=operation.d.ts.map

package/configure/node_modules/slate/dist/interfaces/operation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"operation.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/operation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,IAAI,CAAA;AAGpD,oBAAY,uBAAuB,GAAG;IACpC,IAAI,EAAE,aAAa,CAAA;IACnB,IAAI,EAAE,IAAI,CAAA;IACV,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AAED,oBAAY,mBAAmB,GAAG,YAAY,CAC5C,qBAAqB,EACrB,uBAAuB,CACxB,CAAA;AAED,oBAAY,uBAAuB,GAAG;IACpC,IAAI,EAAE,aAAa,CAAA;IACnB,IAAI,EAAE,IAAI,CAAA;IACV,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,oBAAY,mBAAmB,GAAG,YAAY,CAC5C,qBAAqB,EACrB,uBAAuB,CACxB,CAAA;AAED,oBAAY,sBAAsB,GAAG;IACnC,IAAI,EAAE,YAAY,CAAA;IAClB,IAAI,EAAE,IAAI,CAAA;IACV,QAAQ,EAAE,MAAM,CAAA;IAChB,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;CAC1B,CAAA;AAED,oBAAY,kBAAkB,GAAG,YAAY,CAC3C,oBAAoB,EACpB,sBAAsB,CACvB,CAAA;AAED,oBAAY,qBAAqB,GAAG;IAClC,IAAI,EAAE,WAAW,CAAA;IACjB,IAAI,EAAE,IAAI,CAAA;IACV,OAAO,EAAE,IAAI,CAAA;CACd,CAAA;AAED,oBAAY,iBAAiB,GAAG,YAAY,CAC1C,mBAAmB,EACnB,qBAAqB,CACtB,CAAA;AAED,oBAAY,uBAAuB,GAAG;IACpC,IAAI,EAAE,aAAa,CAAA;IACnB,IAAI,EAAE,IAAI,CAAA;IACV,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AAED,oBAAY,mBAAmB,GAAG,YAAY,CAC5C,qBAAqB,EACrB,uBAAuB,CACxB,CAAA;AAED,oBAAY,uBAAuB,GAAG;IACpC,IAAI,EAAE,aAAa,CAAA;IACnB,IAAI,EAAE,IAAI,CAAA;IACV,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,oBAAY,mBAAmB,GAAG,YAAY,CAC5C,qBAAqB,EACrB,uBAAuB,CACxB,CAAA;AAED,oBAAY,oBAAoB,GAAG;IACjC,IAAI,EAAE,UAAU,CAAA;IAChB,IAAI,EAAE,IAAI,CAAA;IACV,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;IACzB,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;CAC7B,CAAA;AAED,oBAAY,gBAAgB,GAAG,YAAY,CACzC,kBAAkB,EAClB,oBAAoB,CACrB,CAAA;AAED,oBAAY,yBAAyB,GACjC;IACE,IAAI,EAAE,eAAe,CAAA;IACrB,UAAU,EAAE,IAAI,CAAA;IAChB,aAAa,EAAE,KAAK,CAAA;CACrB,GACD;IACE,IAAI,EAAE,eAAe,CAAA;IACrB,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IAC1B,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;CAC9B,GACD;IACE,IAAI,EAAE,eAAe,CAAA;IACrB,UAAU,EAAE,KAAK,CAAA;IACjB,aAAa,EAAE,IAAI,CAAA;CACpB,CAAA;AAEL,oBAAY,qBAAqB,GAAG,YAAY,CAC9C,uBAAuB,EACvB,yBAAyB,CAC1B,CAAA;AAED,oBAAY,sBAAsB,GAAG;IACnC,IAAI,EAAE,YAAY,CAAA;IAClB,IAAI,EAAE,IAAI,CAAA;IACV,QAAQ,EAAE,MAAM,CAAA;IAChB,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;CAC1B,CAAA;AAED,oBAAY,kBAAkB,GAAG,YAAY,CAC3C,oBAAoB,EACpB,sBAAsB,CACvB,CAAA;AAED,oBAAY,aAAa,GACrB,mBAAmB,GACnB,kBAAkB,GAClB,iBAAiB,GACjB,mBAAmB,GACnB,gBAAgB,GAChB,kBAAkB,CAAA;AAEtB,oBAAY,kBAAkB,GAAG,qBAAqB,CAAA;AAEtD,oBAAY,aAAa,GAAG,mBAAmB,GAAG,mBAAmB,CAAA;AAErE;;;;;GAKG;AAEH,oBAAY,aAAa,GAAG,aAAa,GAAG,kBAAkB,GAAG,aAAa,CAAA;AAC9E,oBAAY,SAAS,GAAG,YAAY,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;AAEhE,MAAM,WAAW,kBAAkB;IACjC;;OAEG;IACH,eAAe,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,aAAa,CAAA;IAEvD;;OAEG;IACH,WAAW,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,SAAS,CAAA;IAE/C;;OAEG;IACH,eAAe,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,SAAS,EAAE,CAAA;IAErD;;OAEG;IACH,oBAAoB,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,kBAAkB,CAAA;IAEjE;;OAEG;IACH,eAAe,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,aAAa,CAAA;IAEvD;;;OAGG;IACH,OAAO,EAAE,CAAC,EAAE,EAAE,SAAS,KAAK,SAAS,CAAA;CACtC;AAGD,eAAO,MAAM,SAAS,EAAE,kBAsJvB,CAAA"}

package/configure/node_modules/slate/dist/interfaces/path-ref.d.ts

@@ -1,19 +0,0 @@
-import { Operation, Path } from '..';
-/**
- * `PathRef` objects keep a specific path in a document synced over time as new
- * operations are applied to the editor. You can access their `current` property
- * at any time for the up-to-date path value.
- */
-export interface PathRef {
-    current: Path | null;
-    affinity: 'forward' | 'backward' | null;
-    unref(): Path | null;
-}
-export interface PathRefInterface {
-    /**
-     * Transform the path ref's current value by an operation.
-     */
-    transform: (ref: PathRef, op: Operation) => void;
-}
-export declare const PathRef: PathRefInterface;
-//# sourceMappingURL=path-ref.d.ts.map

package/configure/node_modules/slate/dist/interfaces/path-ref.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"path-ref.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/path-ref.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,IAAI,CAAA;AAEpC;;;;GAIG;AAEH,MAAM,WAAW,OAAO;IACtB,OAAO,EAAE,IAAI,GAAG,IAAI,CAAA;IACpB,QAAQ,EAAE,SAAS,GAAG,UAAU,GAAG,IAAI,CAAA;IACvC,KAAK,IAAI,IAAI,GAAG,IAAI,CAAA;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,SAAS,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,KAAK,IAAI,CAAA;CACjD;AAGD,eAAO,MAAM,OAAO,EAAE,gBAerB,CAAA"}

package/configure/node_modules/slate/dist/interfaces/path.d.ts

@@ -1,133 +0,0 @@
-import { InsertNodeOperation, MergeNodeOperation, MoveNodeOperation, Operation, RemoveNodeOperation, SplitNodeOperation } from '..';
-import { TextDirection } from '../types/types';
-/**
- * `Path` arrays are a list of indexes that describe a node's exact position in
- * a Slate node tree. Although they are usually relative to the root `Editor`
- * object, they can be relative to any `Node` object.
- */
-export declare type Path = number[];
-export interface PathAncestorsOptions {
-    reverse?: boolean;
-}
-export interface PathLevelsOptions {
-    reverse?: boolean;
-}
-export interface PathTransformOptions {
-    affinity?: TextDirection | null;
-}
-export interface PathInterface {
-    /**
-     * Get a list of ancestor paths for a given path.
-     *
-     * The paths are sorted from shallowest to deepest ancestor. However, if the
-     * `reverse: true` option is passed, they are reversed.
-     */
-    ancestors: (path: Path, options?: PathAncestorsOptions) => Path[];
-    /**
-     * Get the common ancestor path of two paths.
-     */
-    common: (path: Path, another: Path) => Path;
-    /**
-     * Compare a path to another, returning an integer indicating whether the path
-     * was before, at, or after the other.
-     *
-     * Note: Two paths of unequal length can still receive a `0` result if one is
-     * directly above or below the other. If you want exact matching, use
-     * [[Path.equals]] instead.
-     */
-    compare: (path: Path, another: Path) => -1 | 0 | 1;
-    /**
-     * Check if a path ends after one of the indexes in another.
-     */
-    endsAfter: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path ends at one of the indexes in another.
-     */
-    endsAt: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path ends before one of the indexes in another.
-     */
-    endsBefore: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is exactly equal to another.
-     */
-    equals: (path: Path, another: Path) => boolean;
-    /**
-     * Check if the path of previous sibling node exists
-     */
-    hasPrevious: (path: Path) => boolean;
-    /**
-     * Check if a path is after another.
-     */
-    isAfter: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is an ancestor of another.
-     */
-    isAncestor: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is before another.
-     */
-    isBefore: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is a child of another.
-     */
-    isChild: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is equal to or an ancestor of another.
-     */
-    isCommon: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is a descendant of another.
-     */
-    isDescendant: (path: Path, another: Path) => boolean;
-    /**
-     * Check if a path is the parent of another.
-     */
-    isParent: (path: Path, another: Path) => boolean;
-    /**
-     * Check is a value implements the `Path` interface.
-     */
-    isPath: (value: any) => value is Path;
-    /**
-     * Check if a path is a sibling of another.
-     */
-    isSibling: (path: Path, another: Path) => boolean;
-    /**
-     * Get a list of paths at every level down to a path. Note: this is the same
-     * as `Path.ancestors`, but including the path itself.
-     *
-     * The paths are sorted from shallowest to deepest. However, if the `reverse:
-     * true` option is passed, they are reversed.
-     */
-    levels: (path: Path, options?: PathLevelsOptions) => Path[];
-    /**
-     * Given a path, get the path to the next sibling node.
-     */
-    next: (path: Path) => Path;
-    /**
-     * Returns whether this operation can affect paths or not. Used as an
-     * optimization when updating dirty paths during normalization
-     *
-     * NOTE: This *must* be kept in sync with the implementation of 'transform'
-     * below
-     */
-    operationCanTransformPath: (operation: Operation) => operation is InsertNodeOperation | RemoveNodeOperation | MergeNodeOperation | SplitNodeOperation | MoveNodeOperation;
-    /**
-     * Given a path, return a new path referring to the parent node above it.
-     */
-    parent: (path: Path) => Path;
-    /**
-     * Given a path, get the path to the previous sibling node.
-     */
-    previous: (path: Path) => Path;
-    /**
-     * Get a path relative to an ancestor.
-     */
-    relative: (path: Path, ancestor: Path) => Path;
-    /**
-     * Transform a path by an operation.
-     */
-    transform: (path: Path, operation: Operation, options?: PathTransformOptions) => Path | null;
-}
-export declare const Path: PathInterface;
-//# sourceMappingURL=path.d.ts.map

package/configure/node_modules/slate/dist/interfaces/path.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"path.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/path.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,iBAAiB,EACjB,SAAS,EACT,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,IAAI,CAAA;AACX,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAE9C;;;;GAIG;AAEH,oBAAY,IAAI,GAAG,MAAM,EAAE,CAAA;AAE3B,MAAM,WAAW,oBAAoB;IACnC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,EAAE,aAAa,GAAG,IAAI,CAAA;CAChC;AAED,MAAM,WAAW,aAAa;IAC5B;;;;;OAKG;IACH,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,oBAAoB,KAAK,IAAI,EAAE,CAAA;IAEjE;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,IAAI,CAAA;IAE3C;;;;;;;OAOG;IACH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAElD;;OAEG;IACH,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEjD;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAE9C;;OAEG;IACH,UAAU,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAElD;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAE9C;;OAEG;IACH,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAA;IAEpC;;OAEG;IACH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAE/C;;OAEG;IACH,UAAU,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAElD;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEhD;;OAEG;IACH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAE/C;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEhD;;OAEG;IACH,YAAY,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEpD;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEhD;;OAEG;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,IAAI,CAAA;IAErC;;OAEG;IACH,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO,CAAA;IAEjD;;;;;;OAMG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,iBAAiB,KAAK,IAAI,EAAE,CAAA;IAE3D;;OAEG;IACH,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAA;IAE1B;;;;;;OAMG;IACH,yBAAyB,EAAE,CACzB,SAAS,EAAE,SAAS,KACjB,SAAS,IACV,mBAAmB,GACnB,mBAAmB,GACnB,kBAAkB,GAClB,kBAAkB,GAClB,iBAAiB,CAAA;IAErB;;OAEG;IACH,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAA;IAE5B;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAA;IAE9B;;OAEG;IACH,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,KAAK,IAAI,CAAA;IAE9C;;OAEG;IACH,SAAS,EAAE,CACT,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,SAAS,EACpB,OAAO,CAAC,EAAE,oBAAoB,KAC3B,IAAI,GAAG,IAAI,CAAA;CACjB;AAGD,eAAO,MAAM,IAAI,EAAE,aAgVlB,CAAA"}

package/configure/node_modules/slate/dist/interfaces/point-ref.d.ts

@@ -1,20 +0,0 @@
-import { Operation, Point } from '..';
-import { TextDirection } from '../types/types';
-/**
- * `PointRef` objects keep a specific point in a document synced over time as new
- * operations are applied to the editor. You can access their `current` property
- * at any time for the up-to-date point value.
- */
-export interface PointRef {
-    current: Point | null;
-    affinity: TextDirection | null;
-    unref(): Point | null;
-}
-export interface PointRefInterface {
-    /**
-     * Transform the point ref's current value by an operation.
-     */
-    transform: (ref: PointRef, op: Operation) => void;
-}
-export declare const PointRef: PointRefInterface;
-//# sourceMappingURL=point-ref.d.ts.map

package/configure/node_modules/slate/dist/interfaces/point-ref.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"point-ref.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/point-ref.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,IAAI,CAAA;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAE9C;;;;GAIG;AAEH,MAAM,WAAW,QAAQ;IACvB,OAAO,EAAE,KAAK,GAAG,IAAI,CAAA;IACrB,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAA;IAC9B,KAAK,IAAI,KAAK,GAAG,IAAI,CAAA;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,SAAS,EAAE,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,KAAK,IAAI,CAAA;CAClD;AAGD,eAAO,MAAM,QAAQ,EAAE,iBAetB,CAAA"}

package/configure/node_modules/slate/dist/interfaces/point.d.ts

@@ -1,50 +0,0 @@
-import { ExtendedType, Operation, Path } from '..';
-import { TextDirection } from '../types/types';
-/**
- * `Point` objects refer to a specific location in a text node in a Slate
- * document. Its path refers to the location of the node in the tree, and its
- * offset refers to the distance into the node's string of text. Points can
- * only refer to `Text` nodes.
- */
-export interface BasePoint {
-    path: Path;
-    offset: number;
-}
-export declare type Point = ExtendedType<'Point', BasePoint>;
-export interface PointTransformOptions {
-    affinity?: TextDirection | null;
-}
-export interface PointInterface {
-    /**
-     * Compare a point to another, returning an integer indicating whether the
-     * point was before, at, or after the other.
-     */
-    compare: (point: Point, another: Point) => -1 | 0 | 1;
-    /**
-     * Check if a point is after another.
-     */
-    isAfter: (point: Point, another: Point) => boolean;
-    /**
-     * Check if a point is before another.
-     */
-    isBefore: (point: Point, another: Point) => boolean;
-    /**
-     * Check if a point is exactly equal to another.
-     */
-    equals: (point: Point, another: Point) => boolean;
-    /**
-     * Check if a value implements the `Point` interface.
-     */
-    isPoint: (value: any) => value is Point;
-    /**
-     * Transform a point by an operation.
-     */
-    transform: (point: Point, op: Operation, options?: PointTransformOptions) => Point | null;
-}
-export declare const Point: PointInterface;
-/**
- * `PointEntry` objects are returned when iterating over `Point` objects that
- * belong to a range.
- */
-export declare type PointEntry = [Point, 'anchor' | 'focus'];
-//# sourceMappingURL=point.d.ts.map

package/configure/node_modules/slate/dist/interfaces/point.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"point.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/point.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,IAAI,CAAA;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAE9C;;;;;GAKG;AAEH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,IAAI,CAAA;IACV,MAAM,EAAE,MAAM,CAAA;CACf;AAED,oBAAY,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;AAEpD,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,EAAE,aAAa,GAAG,IAAI,CAAA;CAChC;AAED,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAErD;;OAEG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,OAAO,CAAA;IAElD;;OAEG;IACH,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,OAAO,CAAA;IAEnD;;OAEG;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,OAAO,CAAA;IAEjD;;OAEG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,KAAK,CAAA;IAEvC;;OAEG;IACH,SAAS,EAAE,CACT,KAAK,EAAE,KAAK,EACZ,EAAE,EAAE,SAAS,EACb,OAAO,CAAC,EAAE,qBAAqB,KAC5B,KAAK,GAAG,IAAI,CAAA;CAClB;AAGD,eAAO,MAAM,KAAK,EAAE,cAqHnB,CAAA;AAED;;;GAGG;AAEH,oBAAY,UAAU,GAAG,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAA"}

package/configure/node_modules/slate/dist/interfaces/range-ref.d.ts

@@ -1,19 +0,0 @@
-import { Operation, Range } from '..';
-/**
- * `RangeRef` objects keep a specific range in a document synced over time as new
- * operations are applied to the editor. You can access their `current` property
- * at any time for the up-to-date range value.
- */
-export interface RangeRef {
-    current: Range | null;
-    affinity: 'forward' | 'backward' | 'outward' | 'inward' | null;
-    unref(): Range | null;
-}
-export interface RangeRefInterface {
-    /**
-     * Transform the range ref's current value by an operation.
-     */
-    transform: (ref: RangeRef, op: Operation) => void;
-}
-export declare const RangeRef: RangeRefInterface;
-//# sourceMappingURL=range-ref.d.ts.map

package/configure/node_modules/slate/dist/interfaces/range-ref.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"range-ref.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/range-ref.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,IAAI,CAAA;AAErC;;;;GAIG;AAEH,MAAM,WAAW,QAAQ;IACvB,OAAO,EAAE,KAAK,GAAG,IAAI,CAAA;IACrB,QAAQ,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,IAAI,CAAA;IAC9D,KAAK,IAAI,KAAK,GAAG,IAAI,CAAA;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,SAAS,EAAE,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,KAAK,IAAI,CAAA;CAClD;AAGD,eAAO,MAAM,QAAQ,EAAE,iBAetB,CAAA"}

package/configure/node_modules/slate/dist/interfaces/range.d.ts

@@ -1,81 +0,0 @@
-import { ExtendedType, Operation, Path, Point, PointEntry } from '..';
-import { RangeDirection } from '../types/types';
-/**
- * `Range` objects are a set of points that refer to a specific span of a Slate
- * document. They can define a span inside a single node or a can span across
- * multiple nodes.
- */
-export interface BaseRange {
-    anchor: Point;
-    focus: Point;
-}
-export declare type Range = ExtendedType<'Range', BaseRange>;
-export interface RangeEdgesOptions {
-    reverse?: boolean;
-}
-export interface RangeTransformOptions {
-    affinity?: RangeDirection | null;
-}
-export interface RangeInterface {
-    /**
-     * Get the start and end points of a range, in the order in which they appear
-     * in the document.
-     */
-    edges: (range: Range, options?: RangeEdgesOptions) => [Point, Point];
-    /**
-     * Get the end point of a range.
-     */
-    end: (range: Range) => Point;
-    /**
-     * Check if a range is exactly equal to another.
-     */
-    equals: (range: Range, another: Range) => boolean;
-    /**
-     * Check if a range includes a path, a point or part of another range.
-     */
-    includes: (range: Range, target: Path | Point | Range) => boolean;
-    /**
-     * Get the intersection of a range with another.
-     */
-    intersection: (range: Range, another: Range) => Range | null;
-    /**
-     * Check if a range is backward, meaning that its anchor point appears in the
-     * document _after_ its focus point.
-     */
-    isBackward: (range: Range) => boolean;
-    /**
-     * Check if a range is collapsed, meaning that both its anchor and focus
-     * points refer to the exact same position in the document.
-     */
-    isCollapsed: (range: Range) => boolean;
-    /**
-     * Check if a range is expanded.
-     *
-     * This is the opposite of [[Range.isCollapsed]] and is provided for legibility.
-     */
-    isExpanded: (range: Range) => boolean;
-    /**
-     * Check if a range is forward.
-     *
-     * This is the opposite of [[Range.isBackward]] and is provided for legibility.
-     */
-    isForward: (range: Range) => boolean;
-    /**
-     * Check if a value implements the [[Range]] interface.
-     */
-    isRange: (value: any) => value is Range;
-    /**
-     * Iterate through all of the point entries in a range.
-     */
-    points: (range: Range) => Generator<PointEntry, void, undefined>;
-    /**
-     * Get the start point of a range.
-     */
-    start: (range: Range) => Point;
-    /**
-     * Transform a range by an operation.
-     */
-    transform: (range: Range, op: Operation, options?: RangeTransformOptions) => Range | null;
-}
-export declare const Range: RangeInterface;
-//# sourceMappingURL=range.d.ts.map

package/configure/node_modules/slate/dist/interfaces/range.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.d.ts","sourceRoot":"","sources":["../packages/slate/src/interfaces/range.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,IAAI,CAAA;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAE/C;;;;GAIG;AAEH,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,KAAK,CAAA;IACb,KAAK,EAAE,KAAK,CAAA;CACb;AAED,oBAAY,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;AAEpD,MAAM,WAAW,iBAAiB;IAChC,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,EAAE,cAAc,GAAG,IAAI,CAAA;CACjC;AAED,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,iBAAiB,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAEpE;;OAEG;IACH,GAAG,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,KAAK,CAAA;IAE5B;;OAEG;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,OAAO,CAAA;IAEjD;;OAEG;IACH,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,KAAK,OAAO,CAAA;IAEjE;;OAEG;IACH,YAAY,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK,KAAK,GAAG,IAAI,CAAA;IAE5D;;;OAGG;IACH,UAAU,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAA;IAErC;;;OAGG;IACH,WAAW,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAA;IAEtC;;;;OAIG;IACH,UAAU,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAA;IAErC;;;;OAIG;IACH,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAA;IAEpC;;OAEG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,KAAK,CAAA;IAEvC;;OAEG;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;IAEhE;;OAEG;IACH,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,KAAK,CAAA;IAE9B;;OAEG;IACH,SAAS,EAAE,CACT,KAAK,EAAE,KAAK,EACZ,EAAE,EAAE,SAAS,EACb,OAAO,CAAC,EAAE,qBAAqB,KAC5B,KAAK,GAAG,IAAI,CAAA;CAClB;AAGD,eAAO,MAAM,KAAK,EAAE,cAoJnB,CAAA"}