@slicemachine/manager 0.18.3-beta.1 → 0.18.3-beta.2

package/dist/_node_modules/unist-util-visit/lib/index.cjs

@@ -1,39 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const index = require("../../unist-util-visit-parents/lib/index.cjs");
-const visit = (
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  /**
-   * @param {Node} tree
-   * @param {Test} test
-   * @param {Visitor} visitor
-   * @param {boolean | null | undefined} [reverse]
-   * @returns {void}
-   */
-  function(tree, test, visitor, reverse) {
-    if (typeof test === "function" && typeof visitor !== "function") {
-      reverse = visitor;
-      visitor = test;
-      test = null;
-    }
-    index.visitParents(tree, test, overload, reverse);
-    function overload(node, parents) {
-      const parent = parents[parents.length - 1];
-      return visitor(
-        node,
-        parent ? parent.children.indexOf(node) : null,
-        parent
-      );
-    }
-  }
-);
-exports.CONTINUE = index.CONTINUE;
-exports.EXIT = index.EXIT;
-exports.SKIP = index.SKIP;
-exports.visit = visit;
-//# sourceMappingURL=index.cjs.map

package/dist/_node_modules/unist-util-visit/lib/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * Check if `Child` can be a child of `Ancestor`.\n *\n * Returns the ancestor when `Child` can be a child of `Ancestor`, or returns\n * `never`.\n *\n * @template {Node} Ancestor\n *   Node type.\n * @template {Node} Child\n *   Node type.\n * @typedef {(\n *   Ancestor extends Parent\n *     ? Child extends Ancestor['children'][number]\n *       ? Ancestor\n *       : never\n *     : never\n * )} ParentsOf\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends Node ? number | null : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends Node ? Ancestor | null : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * Build a typed `Visitor` function from a node and all possible parents.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Visited\n *   Node type.\n * @template {Parent} Ancestor\n *   Parent type.\n * @typedef {Visitor<Visited, ParentsOf<Ancestor, Visited>>} BuildVisitorFromMatch\n */\n\n/**\n * Build a typed `Visitor` function from a list of descendants and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     import('unist-util-visit-parents/complex-types.js').Matches<Descendant, Check>,\n *     Extract<Descendant, Parent>\n *   >\n * )} BuildVisitorFromDescendants\n */\n\n/**\n * Build a typed `Visitor` function from a tree and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} [Tree=Node]\n *   Node type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     import('unist-util-visit-parents/complex-types.js').InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visit =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        visitor = test\n        test = null\n      }\n\n      visitParents(tree, test, overload, reverse)\n\n      /**\n       * @param {Node} node\n       * @param {Array<Parent>} parents\n       */\n      function overload(node, parents) {\n        const parent = parents[parents.length - 1]\n        return visitor(\n          node,\n          parent ? parent.children.indexOf(node) : null,\n          parent\n        )\n      }\n    }\n  )\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n"],"names":["visitParents"],"mappings":";;;AA8IY,MAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeT,SAAU,MAAM,MAAM,SAAS,SAAS;AACtC,QAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,gBAAU;AACV,gBAAU;AACV,aAAO;AAAA,IACR;AAEDA,UAAAA,aAAa,MAAM,MAAM,UAAU,OAAO;AAM1C,aAAS,SAAS,MAAM,SAAS;AAC/B,YAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,aAAO;AAAA,QACL;AAAA,QACA,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI;AAAA,QACzC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAAA;;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/unist-util-visit/lib/index.js

@@ -1,40 +0,0 @@
-import { visitParents } from "../../unist-util-visit-parents/lib/index.js";
-import { CONTINUE, EXIT, SKIP } from "../../unist-util-visit-parents/lib/index.js";
-const visit = (
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  /**
-   * @param {Node} tree
-   * @param {Test} test
-   * @param {Visitor} visitor
-   * @param {boolean | null | undefined} [reverse]
-   * @returns {void}
-   */
-  function(tree, test, visitor, reverse) {
-    if (typeof test === "function" && typeof visitor !== "function") {
-      reverse = visitor;
-      visitor = test;
-      test = null;
-    }
-    visitParents(tree, test, overload, reverse);
-    function overload(node, parents) {
-      const parent = parents[parents.length - 1];
-      return visitor(
-        node,
-        parent ? parent.children.indexOf(node) : null,
-        parent
-      );
-    }
-  }
-);
-export {
-  CONTINUE,
-  EXIT,
-  SKIP,
-  visit
-};
-//# sourceMappingURL=index.js.map

package/dist/_node_modules/unist-util-visit/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * Check if `Child` can be a child of `Ancestor`.\n *\n * Returns the ancestor when `Child` can be a child of `Ancestor`, or returns\n * `never`.\n *\n * @template {Node} Ancestor\n *   Node type.\n * @template {Node} Child\n *   Node type.\n * @typedef {(\n *   Ancestor extends Parent\n *     ? Child extends Ancestor['children'][number]\n *       ? Ancestor\n *       : never\n *     : never\n * )} ParentsOf\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends Node ? number | null : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends Node ? Ancestor | null : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * Build a typed `Visitor` function from a node and all possible parents.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Visited\n *   Node type.\n * @template {Parent} Ancestor\n *   Parent type.\n * @typedef {Visitor<Visited, ParentsOf<Ancestor, Visited>>} BuildVisitorFromMatch\n */\n\n/**\n * Build a typed `Visitor` function from a list of descendants and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     import('unist-util-visit-parents/complex-types.js').Matches<Descendant, Check>,\n *     Extract<Descendant, Parent>\n *   >\n * )} BuildVisitorFromDescendants\n */\n\n/**\n * Build a typed `Visitor` function from a tree and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} [Tree=Node]\n *   Node type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     import('unist-util-visit-parents/complex-types.js').InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visit =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        visitor = test\n        test = null\n      }\n\n      visitParents(tree, test, overload, reverse)\n\n      /**\n       * @param {Node} node\n       * @param {Array<Parent>} parents\n       */\n      function overload(node, parents) {\n        const parent = parents[parents.length - 1]\n        return visitor(\n          node,\n          parent ? parent.children.indexOf(node) : null,\n          parent\n        )\n      }\n    }\n  )\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n"],"names":[],"mappings":";;AA8IY,MAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeT,SAAU,MAAM,MAAM,SAAS,SAAS;AACtC,QAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,gBAAU;AACV,gBAAU;AACV,aAAO;AAAA,IACR;AAED,iBAAa,MAAM,MAAM,UAAU,OAAO;AAM1C,aAAS,SAAS,MAAM,SAAS;AAC/B,YAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,aAAO;AAAA,QACL;AAAA,QACA,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI;AAAA,QACzC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAAA;","x_google_ignoreList":[0]}

package/dist/_node_modules/unist-util-visit-parents/lib/color.browser.cjs

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-function color(d) {
-  return d;
-}
-exports.color = color;
-//# sourceMappingURL=color.browser.cjs.map

package/dist/_node_modules/unist-util-visit-parents/lib/color.browser.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.browser.cjs","sources":["../../../../../../node_modules/unist-util-visit-parents/lib/color.browser.js"],"sourcesContent":["/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n"],"names":[],"mappings":";;AAIO,SAAS,MAAM,GAAG;AACvB,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/unist-util-visit-parents/lib/color.browser.js

@@ -1,7 +0,0 @@
-function color(d) {
-  return d;
-}
-export {
-  color
-};
-//# sourceMappingURL=color.browser.js.map

package/dist/_node_modules/unist-util-visit-parents/lib/color.browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.browser.js","sources":["../../../../../../node_modules/unist-util-visit-parents/lib/color.browser.js"],"sourcesContent":["/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n"],"names":[],"mappings":"AAIO,SAAS,MAAM,GAAG;AACvB,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/_node_modules/unist-util-visit-parents/lib/index.cjs

@@ -1,86 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const color_browser = require("./color.browser.cjs");
-const index = require("../../unist-util-is/lib/index.cjs");
-const CONTINUE = true;
-const EXIT = false;
-const SKIP = "skip";
-const visitParents = (
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  /**
-   * @param {Node} tree
-   * @param {Test} test
-   * @param {Visitor<Node>} visitor
-   * @param {boolean | null | undefined} [reverse]
-   * @returns {void}
-   */
-  function(tree, test, visitor, reverse) {
-    if (typeof test === "function" && typeof visitor !== "function") {
-      reverse = visitor;
-      visitor = test;
-      test = null;
-    }
-    const is = index.convert(test);
-    const step = reverse ? -1 : 1;
-    factory(tree, void 0, [])();
-    function factory(node, index2, parents) {
-      const value = node && typeof node === "object" ? node : {};
-      if (typeof value.type === "string") {
-        const name = (
-          // `hast`
-          typeof value.tagName === "string" ? value.tagName : (
-            // `xast`
-            typeof value.name === "string" ? value.name : void 0
-          )
-        );
-        Object.defineProperty(visit, "name", {
-          value: "node (" + color_browser.color(node.type + (name ? "<" + name + ">" : "")) + ")"
-        });
-      }
-      return visit;
-      function visit() {
-        let result = [];
-        let subresult;
-        let offset;
-        let grandparents;
-        if (!test || is(node, index2, parents[parents.length - 1] || null)) {
-          result = toResult(visitor(node, parents));
-          if (result[0] === EXIT) {
-            return result;
-          }
-        }
-        if (node.children && result[0] !== SKIP) {
-          offset = (reverse ? node.children.length : -1) + step;
-          grandparents = parents.concat(node);
-          while (offset > -1 && offset < node.children.length) {
-            subresult = factory(node.children[offset], offset, grandparents)();
-            if (subresult[0] === EXIT) {
-              return subresult;
-            }
-            offset = typeof subresult[1] === "number" ? subresult[1] : offset + step;
-          }
-        }
-        return result;
-      }
-    }
-  }
-);
-function toResult(value) {
-  if (Array.isArray(value)) {
-    return value;
-  }
-  if (typeof value === "number") {
-    return [CONTINUE, value];
-  }
-  return [value];
-}
-exports.CONTINUE = CONTINUE;
-exports.EXIT = EXIT;
-exports.SKIP = SKIP;
-exports.visitParents = visitParents;
-//# sourceMappingURL=index.cjs.map

package/dist/_node_modules/unist-util-visit-parents/lib/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n */\n\n/**\n * @typedef {boolean | 'skip'} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<Ancestor>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   Tree type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {Visitor<import('./complex-types.js').Matches<import('./complex-types.js').InclusiveDescendant<Tree>, Check>, Extract<import('./complex-types.js').InclusiveDescendant<Tree>, Parent>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visitParents =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor<Node>} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        // @ts-expect-error no visitor given, so `visitor` is test.\n        visitor = test\n        test = null\n      }\n\n      const is = convert(test)\n      const step = reverse ? -1 : 1\n\n      factory(tree, undefined, [])()\n\n      /**\n       * @param {Node} node\n       * @param {number | undefined} index\n       * @param {Array<Parent>} parents\n       */\n      function factory(node, index, parents) {\n        /** @type {Record<string, unknown>} */\n        // @ts-expect-error: hush\n        const value = node && typeof node === 'object' ? node : {}\n\n        if (typeof value.type === 'string') {\n          const name =\n            // `hast`\n            typeof value.tagName === 'string'\n              ? value.tagName\n              : // `xast`\n              typeof value.name === 'string'\n              ? value.name\n              : undefined\n\n          Object.defineProperty(visit, 'name', {\n            value:\n              'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n          })\n        }\n\n        return visit\n\n        function visit() {\n          /** @type {ActionTuple} */\n          let result = []\n          /** @type {ActionTuple} */\n          let subresult\n          /** @type {number} */\n          let offset\n          /** @type {Array<Parent>} */\n          let grandparents\n\n          if (!test || is(node, index, parents[parents.length - 1] || null)) {\n            result = toResult(visitor(node, parents))\n\n            if (result[0] === EXIT) {\n              return result\n            }\n          }\n\n          // @ts-expect-error looks like a parent.\n          if (node.children && result[0] !== SKIP) {\n            // @ts-expect-error looks like a parent.\n            offset = (reverse ? node.children.length : -1) + step\n            // @ts-expect-error looks like a parent.\n            grandparents = parents.concat(node)\n\n            // @ts-expect-error looks like a parent.\n            while (offset > -1 && offset < node.children.length) {\n              // @ts-expect-error looks like a parent.\n              subresult = factory(node.children[offset], offset, grandparents)()\n\n              if (subresult[0] === EXIT) {\n                return subresult\n              }\n\n              offset =\n                typeof subresult[1] === 'number' ? subresult[1] : offset + step\n            }\n          }\n\n          return result\n        }\n      }\n    }\n  )\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {ActionTuple}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return [value]\n}\n"],"names":["convert","index","color"],"mappings":";;;;AAgFY,MAAC,WAAW;AAKZ,MAAC,OAAO;AAKR,MAAC,OAAO;AA+BR,MAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeT,SAAU,MAAM,MAAM,SAAS,SAAS;AACtC,QAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,gBAAU;AAEV,gBAAU;AACV,aAAO;AAAA,IACR;AAED,UAAM,KAAKA,MAAO,QAAC,IAAI;AACvB,UAAM,OAAO,UAAU,KAAK;AAE5B,YAAQ,MAAM,QAAW,CAAA,CAAE,EAAG;AAO9B,aAAS,QAAQ,MAAMC,QAAO,SAAS;AAGrC,YAAM,QAAQ,QAAQ,OAAO,SAAS,WAAW,OAAO,CAAE;AAE1D,UAAI,OAAO,MAAM,SAAS,UAAU;AAClC,cAAM;AAAA;AAAA,UAEJ,OAAO,MAAM,YAAY,WACrB,MAAM;AAAA;AAAA,YAER,OAAO,MAAM,SAAS,WACpB,MAAM,OACN;AAAA;AAAA;AAEN,eAAO,eAAe,OAAO,QAAQ;AAAA,UACnC,OACE,WAAWC,cAAK,MAAC,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,GAAG,IAAI;AAAA,QAC7E,CAAW;AAAA,MACF;AAED,aAAO;AAEP,eAAS,QAAQ;AAEf,YAAI,SAAS,CAAE;AAEf,YAAI;AAEJ,YAAI;AAEJ,YAAI;AAEJ,YAAI,CAAC,QAAQ,GAAG,MAAMD,QAAO,QAAQ,QAAQ,SAAS,CAAC,KAAK,IAAI,GAAG;AACjE,mBAAS,SAAS,QAAQ,MAAM,OAAO,CAAC;AAExC,cAAI,OAAO,CAAC,MAAM,MAAM;AACtB,mBAAO;AAAA,UACR;AAAA,QACF;AAGD,YAAI,KAAK,YAAY,OAAO,CAAC,MAAM,MAAM;AAEvC,oBAAU,UAAU,KAAK,SAAS,SAAS,MAAM;AAEjD,yBAAe,QAAQ,OAAO,IAAI;AAGlC,iBAAO,SAAS,MAAM,SAAS,KAAK,SAAS,QAAQ;AAEnD,wBAAY,QAAQ,KAAK,SAAS,MAAM,GAAG,QAAQ,YAAY,EAAG;AAElE,gBAAI,UAAU,CAAC,MAAM,MAAM;AACzB,qBAAO;AAAA,YACR;AAED,qBACE,OAAO,UAAU,CAAC,MAAM,WAAW,UAAU,CAAC,IAAI,SAAS;AAAA,UAC9D;AAAA,QACF;AAED,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAWL,SAAS,SAAS,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACR;AAED,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAC,UAAU,KAAK;AAAA,EACxB;AAED,SAAO,CAAC,KAAK;AACf;;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/unist-util-visit-parents/lib/index.js

@@ -1,86 +0,0 @@
-import { color } from "./color.browser.js";
-import { convert } from "../../unist-util-is/lib/index.js";
-const CONTINUE = true;
-const EXIT = false;
-const SKIP = "skip";
-const visitParents = (
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  /**
-   * @param {Node} tree
-   * @param {Test} test
-   * @param {Visitor<Node>} visitor
-   * @param {boolean | null | undefined} [reverse]
-   * @returns {void}
-   */
-  function(tree, test, visitor, reverse) {
-    if (typeof test === "function" && typeof visitor !== "function") {
-      reverse = visitor;
-      visitor = test;
-      test = null;
-    }
-    const is = convert(test);
-    const step = reverse ? -1 : 1;
-    factory(tree, void 0, [])();
-    function factory(node, index, parents) {
-      const value = node && typeof node === "object" ? node : {};
-      if (typeof value.type === "string") {
-        const name = (
-          // `hast`
-          typeof value.tagName === "string" ? value.tagName : (
-            // `xast`
-            typeof value.name === "string" ? value.name : void 0
-          )
-        );
-        Object.defineProperty(visit, "name", {
-          value: "node (" + color(node.type + (name ? "<" + name + ">" : "")) + ")"
-        });
-      }
-      return visit;
-      function visit() {
-        let result = [];
-        let subresult;
-        let offset;
-        let grandparents;
-        if (!test || is(node, index, parents[parents.length - 1] || null)) {
-          result = toResult(visitor(node, parents));
-          if (result[0] === EXIT) {
-            return result;
-          }
-        }
-        if (node.children && result[0] !== SKIP) {
-          offset = (reverse ? node.children.length : -1) + step;
-          grandparents = parents.concat(node);
-          while (offset > -1 && offset < node.children.length) {
-            subresult = factory(node.children[offset], offset, grandparents)();
-            if (subresult[0] === EXIT) {
-              return subresult;
-            }
-            offset = typeof subresult[1] === "number" ? subresult[1] : offset + step;
-          }
-        }
-        return result;
-      }
-    }
-  }
-);
-function toResult(value) {
-  if (Array.isArray(value)) {
-    return value;
-  }
-  if (typeof value === "number") {
-    return [CONTINUE, value];
-  }
-  return [value];
-}
-export {
-  CONTINUE,
-  EXIT,
-  SKIP,
-  visitParents
-};
-//# sourceMappingURL=index.js.map

package/dist/_node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n */\n\n/**\n * @typedef {boolean | 'skip'} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<Ancestor>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   Tree type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {Visitor<import('./complex-types.js').Matches<import('./complex-types.js').InclusiveDescendant<Tree>, Check>, Extract<import('./complex-types.js').InclusiveDescendant<Tree>, Parent>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visitParents =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor<Node>} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        // @ts-expect-error no visitor given, so `visitor` is test.\n        visitor = test\n        test = null\n      }\n\n      const is = convert(test)\n      const step = reverse ? -1 : 1\n\n      factory(tree, undefined, [])()\n\n      /**\n       * @param {Node} node\n       * @param {number | undefined} index\n       * @param {Array<Parent>} parents\n       */\n      function factory(node, index, parents) {\n        /** @type {Record<string, unknown>} */\n        // @ts-expect-error: hush\n        const value = node && typeof node === 'object' ? node : {}\n\n        if (typeof value.type === 'string') {\n          const name =\n            // `hast`\n            typeof value.tagName === 'string'\n              ? value.tagName\n              : // `xast`\n              typeof value.name === 'string'\n              ? value.name\n              : undefined\n\n          Object.defineProperty(visit, 'name', {\n            value:\n              'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n          })\n        }\n\n        return visit\n\n        function visit() {\n          /** @type {ActionTuple} */\n          let result = []\n          /** @type {ActionTuple} */\n          let subresult\n          /** @type {number} */\n          let offset\n          /** @type {Array<Parent>} */\n          let grandparents\n\n          if (!test || is(node, index, parents[parents.length - 1] || null)) {\n            result = toResult(visitor(node, parents))\n\n            if (result[0] === EXIT) {\n              return result\n            }\n          }\n\n          // @ts-expect-error looks like a parent.\n          if (node.children && result[0] !== SKIP) {\n            // @ts-expect-error looks like a parent.\n            offset = (reverse ? node.children.length : -1) + step\n            // @ts-expect-error looks like a parent.\n            grandparents = parents.concat(node)\n\n            // @ts-expect-error looks like a parent.\n            while (offset > -1 && offset < node.children.length) {\n              // @ts-expect-error looks like a parent.\n              subresult = factory(node.children[offset], offset, grandparents)()\n\n              if (subresult[0] === EXIT) {\n                return subresult\n              }\n\n              offset =\n                typeof subresult[1] === 'number' ? subresult[1] : offset + step\n            }\n          }\n\n          return result\n        }\n      }\n    }\n  )\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {ActionTuple}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return [value]\n}\n"],"names":[],"mappings":";;AAgFY,MAAC,WAAW;AAKZ,MAAC,OAAO;AAKR,MAAC,OAAO;AA+BR,MAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeT,SAAU,MAAM,MAAM,SAAS,SAAS;AACtC,QAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,gBAAU;AAEV,gBAAU;AACV,aAAO;AAAA,IACR;AAED,UAAM,KAAK,QAAQ,IAAI;AACvB,UAAM,OAAO,UAAU,KAAK;AAE5B,YAAQ,MAAM,QAAW,CAAA,CAAE,EAAG;AAO9B,aAAS,QAAQ,MAAM,OAAO,SAAS;AAGrC,YAAM,QAAQ,QAAQ,OAAO,SAAS,WAAW,OAAO,CAAE;AAE1D,UAAI,OAAO,MAAM,SAAS,UAAU;AAClC,cAAM;AAAA;AAAA,UAEJ,OAAO,MAAM,YAAY,WACrB,MAAM;AAAA;AAAA,YAER,OAAO,MAAM,SAAS,WACpB,MAAM,OACN;AAAA;AAAA;AAEN,eAAO,eAAe,OAAO,QAAQ;AAAA,UACnC,OACE,WAAW,MAAM,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,GAAG,IAAI;AAAA,QAC7E,CAAW;AAAA,MACF;AAED,aAAO;AAEP,eAAS,QAAQ;AAEf,YAAI,SAAS,CAAE;AAEf,YAAI;AAEJ,YAAI;AAEJ,YAAI;AAEJ,YAAI,CAAC,QAAQ,GAAG,MAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC,KAAK,IAAI,GAAG;AACjE,mBAAS,SAAS,QAAQ,MAAM,OAAO,CAAC;AAExC,cAAI,OAAO,CAAC,MAAM,MAAM;AACtB,mBAAO;AAAA,UACR;AAAA,QACF;AAGD,YAAI,KAAK,YAAY,OAAO,CAAC,MAAM,MAAM;AAEvC,oBAAU,UAAU,KAAK,SAAS,SAAS,MAAM;AAEjD,yBAAe,QAAQ,OAAO,IAAI;AAGlC,iBAAO,SAAS,MAAM,SAAS,KAAK,SAAS,QAAQ;AAEnD,wBAAY,QAAQ,KAAK,SAAS,MAAM,GAAG,QAAQ,YAAY,EAAG;AAElE,gBAAI,UAAU,CAAC,MAAM,MAAM;AACzB,qBAAO;AAAA,YACR;AAED,qBACE,OAAO,UAAU,CAAC,MAAM,WAAW,UAAU,CAAC,IAAI,SAAS;AAAA,UAC9D;AAAA,QACF;AAED,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAWL,SAAS,SAAS,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACR;AAED,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAC,UAAU,KAAK;AAAA,EACxB;AAED,SAAO,CAAC,KAAK;AACf;","x_google_ignoreList":[0]}

package/dist/lib/functionCodec.cjs

@@ -1,29 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const t = require("io-ts");
-function _interopNamespaceDefault(e) {
-  const n = Object.create(null, { [Symbol.toStringTag]: { value: "Module" } });
-  if (e) {
-    for (const k in e) {
-      if (k !== "default") {
-        const d = Object.getOwnPropertyDescriptor(e, k);
-        Object.defineProperty(n, k, d.get ? d : {
-          enumerable: true,
-          get: () => e[k]
-        });
-      }
-    }
-  }
-  n.default = e;
-  return Object.freeze(n);
-}
-const t__namespace = /* @__PURE__ */ _interopNamespaceDefault(t);
-const functionCodec = new t__namespace.Type(
-  "function",
-  // eslint-disable-next-line @typescript-eslint/ban-types
-  (input) => typeof input === "function",
-  (input, context) => typeof input === "function" ? t__namespace.success(input) : t__namespace.failure(input, context),
-  t__namespace.identity
-);
-exports.functionCodec = functionCodec;
-//# sourceMappingURL=functionCodec.cjs.map

package/dist/lib/functionCodec.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"functionCodec.cjs","sources":["../../../src/lib/functionCodec.ts"],"sourcesContent":["import * as t from \"io-ts\";\n\nexport const functionCodec = new t.Type<\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\tFunction,\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\tFunction,\n\tunknown\n>(\n\t\"function\",\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\t(input: unknown): input is Function => typeof input === \"function\",\n\t(input, context) =>\n\t\ttypeof input === \"function\" ? t.success(input) : t.failure(input, context),\n\tt.identity,\n);\n"],"names":["t"],"mappings":";;;;;;;;;;;;;;;;;;;;AAEa,MAAA,gBAAgB,IAAIA,aAAE;AAAA,EAOlC;AAAA;AAAA,EAEA,CAAC,UAAsC,OAAO,UAAU;AAAA,EACxD,CAAC,OAAO,YACP,OAAO,UAAU,aAAaA,aAAE,QAAQ,KAAK,IAAIA,aAAE,QAAQ,OAAO,OAAO;AAAA,EAC1EA,aAAE;AAAQ;;"}

package/dist/lib/functionCodec.d.ts

@@ -1,2 +0,0 @@
-import * as t from "io-ts";
-export declare const functionCodec: t.Type<Function, Function, unknown>;

package/dist/lib/functionCodec.js

@@ -1,12 +0,0 @@
-import * as t from "io-ts";
-const functionCodec = new t.Type(
-  "function",
-  // eslint-disable-next-line @typescript-eslint/ban-types
-  (input) => typeof input === "function",
-  (input, context) => typeof input === "function" ? t.success(input) : t.failure(input, context),
-  t.identity
-);
-export {
-  functionCodec
-};
-//# sourceMappingURL=functionCodec.js.map

package/dist/lib/functionCodec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"functionCodec.js","sources":["../../../src/lib/functionCodec.ts"],"sourcesContent":["import * as t from \"io-ts\";\n\nexport const functionCodec = new t.Type<\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\tFunction,\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\tFunction,\n\tunknown\n>(\n\t\"function\",\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\t(input: unknown): input is Function => typeof input === \"function\",\n\t(input, context) =>\n\t\ttypeof input === \"function\" ? t.success(input) : t.failure(input, context),\n\tt.identity,\n);\n"],"names":[],"mappings":";AAEa,MAAA,gBAAgB,IAAI,EAAE;AAAA,EAOlC;AAAA;AAAA,EAEA,CAAC,UAAsC,OAAO,UAAU;AAAA,EACxD,CAAC,OAAO,YACP,OAAO,UAAU,aAAa,EAAE,QAAQ,KAAK,IAAI,EAAE,QAAQ,OAAO,OAAO;AAAA,EAC1E,EAAE;AAAQ;"}

package/dist/lib/markdownToHTML.cjs

@@ -1,91 +0,0 @@
-"use strict";
-var __create = Object.create;
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __getProtoOf = Object.getPrototypeOf;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
-  // If the importer is in node compatibility mode or this is not an ESM
-  // file that has been converted to a CommonJS file using a Babel-
-  // compatible transform (i.e. "__esModule" has not been set), then set
-  // "default" to the CommonJS "module.exports" for node compatibility.
-  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
-  mod
-));
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const index = require('./../_node_modules/unist-util-visit/lib/index.cjs');
-const createRehypeStarryNight = async () => {
-  const { createStarryNight, common } = await import("@wooorm/starry-night");
-  const { default: tsxGrammar } = await import("@wooorm/starry-night/lang/source.tsx.js");
-  const { default: vueGrammar } = await import("@wooorm/starry-night/lang/text.html.vue.js");
-  const { toString } = await import("hast-util-to-string");
-  return (options = {}) => {
-    const grammars = options.grammars || [...common, tsxGrammar, vueGrammar];
-    const starryNightPromise = createStarryNight(grammars);
-    const prefix = "language-";
-    return async (tree) => {
-      const starryNight = await starryNightPromise;
-      index.visit(tree, "element", function(node, index2, parent) {
-        if (!parent || index2 === null || node.tagName !== "pre") {
-          return;
-        }
-        const head = node.children[0];
-        if (!head || head.type !== "element" || head.tagName !== "code" || !head.properties) {
-          return;
-        }
-        const classes = head.properties.className;
-        if (!Array.isArray(classes)) {
-          return;
-        }
-        const language = classes.find((d) => typeof d === "string" && d.startsWith(prefix));
-        if (typeof language !== "string") {
-          return;
-        }
-        const scope = starryNight.flagToScope(language.slice(prefix.length));
-        if (!scope) {
-          return;
-        }
-        const fragment = starryNight.highlight(toString(head), scope);
-        const children = fragment.children;
-        parent.children.splice(index2, 1, {
-          type: "element",
-          tagName: "div",
-          properties: {
-            className: [
-              "highlight",
-              "highlight-" + scope.replace(/^source\./, "").replace(/\./g, "-")
-            ]
-          },
-          children: [
-            { type: "element", tagName: "pre", properties: {}, children }
-          ]
-        });
-      });
-    };
-  };
-};
-let processor;
-const markdownToHTML = async (markdown) => {
-  if (!processor) {
-    const { unified } = await import("unified");
-    const remarkParse = await import("remark-parse");
-    const remarkGfm = await import("remark-gfm");
-    const remarkRehype = await import("remark-rehype");
-    const rehypeStringify = await import("rehype-stringify");
-    const rehypeStarryNight = await createRehypeStarryNight();
-    processor = unified().use(remarkParse.default).use(remarkGfm.default).use(remarkRehype.default).use(rehypeStarryNight).use(rehypeStringify.default);
-  }
-  const virtualFile = await processor.process(markdown);
-  return virtualFile.toString();
-};
-exports.markdownToHTML = markdownToHTML;
-//# sourceMappingURL=markdownToHTML.cjs.map

package/dist/lib/markdownToHTML.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"markdownToHTML.cjs","sources":["../../../src/lib/markdownToHTML.ts"],"sourcesContent":["import type { Plugin, Processor } from \"unified\";\nimport type { Root, ElementContent } from \"hast\";\nimport type { Grammar } from \"@wooorm/starry-night\";\nimport { visit } from \"unist-util-visit\";\n\ntype RehypeStarryNightOptions = {\n\tgrammars?: Grammar[];\n};\n\n/**\n * Rehype plugin to highlight code with `starry-night`.\n *\n * Adapted from:\n * https://github.com/wooorm/starry-night/tree/c73aac7b8bff41ada86747f668dd932a791b851b#example-integrate-with-unified-remark-and-rehype\n */\nconst createRehypeStarryNight = async (): Promise<\n\tPlugin<[options?: RehypeStarryNightOptions], Root>\n> => {\n\tconst { createStarryNight, common } = await import(\"@wooorm/starry-night\");\n\tconst { default: tsxGrammar } = await import(\n\t\t\"@wooorm/starry-night/lang/source.tsx.js\"\n\t);\n\tconst { default: vueGrammar } = await import(\n\t\t\"@wooorm/starry-night/lang/text.html.vue.js\"\n\t);\n\tconst { toString } = await import(\"hast-util-to-string\");\n\n\treturn (options = {}) => {\n\t\tconst grammars = options.grammars || [...common, tsxGrammar, vueGrammar];\n\t\tconst starryNightPromise = createStarryNight(grammars);\n\t\tconst prefix = \"language-\";\n\n\t\treturn async (tree) => {\n\t\t\tconst starryNight = await starryNightPromise;\n\n\t\t\tvisit(tree, \"element\", function (node, index, parent) {\n\t\t\t\tif (!parent || index === null || node.tagName !== \"pre\") {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst head = node.children[0];\n\n\t\t\t\tif (\n\t\t\t\t\t!head ||\n\t\t\t\t\thead.type !== \"element\" ||\n\t\t\t\t\thead.tagName !== \"code\" ||\n\t\t\t\t\t!head.properties\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst classes = head.properties.className;\n\n\t\t\t\tif (!Array.isArray(classes)) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst language = classes.find(\n\t\t\t\t\t(d) => typeof d === \"string\" && d.startsWith(prefix),\n\t\t\t\t);\n\n\t\t\t\tif (typeof language !== \"string\") {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst scope = starryNight.flagToScope(language.slice(prefix.length));\n\n\t\t\t\t// Maybe warn?\n\t\t\t\tif (!scope) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst fragment = starryNight.highlight(toString(head), scope);\n\t\t\t\tconst children = fragment.children as ElementContent[];\n\n\t\t\t\tparent.children.splice(index, 1, {\n\t\t\t\t\ttype: \"element\",\n\t\t\t\t\ttagName: \"div\",\n\t\t\t\t\tproperties: {\n\t\t\t\t\t\tclassName: [\n\t\t\t\t\t\t\t\"highlight\",\n\t\t\t\t\t\t\t\"highlight-\" + scope.replace(/^source\\./, \"\").replace(/\\./g, \"-\"),\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t\tchildren: [\n\t\t\t\t\t\t{ type: \"element\", tagName: \"pre\", properties: {}, children },\n\t\t\t\t\t],\n\t\t\t\t});\n\t\t\t});\n\t\t};\n\t};\n};\n\nlet processor: Processor;\n\nexport const markdownToHTML = async (markdown: string): Promise<string> => {\n\tif (!processor) {\n\t\tconst { unified } = await import(\"unified\");\n\t\tconst remarkParse = await import(\"remark-parse\");\n\t\tconst remarkGfm = await import(\"remark-gfm\");\n\t\tconst remarkRehype = await import(\"remark-rehype\");\n\t\tconst rehypeStringify = await import(\"rehype-stringify\");\n\t\tconst rehypeStarryNight = await createRehypeStarryNight();\n\n\t\tprocessor = unified()\n\t\t\t.use(remarkParse.default)\n\t\t\t.use(remarkGfm.default)\n\t\t\t.use(remarkRehype.default)\n\t\t\t.use(rehypeStarryNight)\n\t\t\t.use(rehypeStringify.default);\n\t}\n\n\tconst virtualFile = await processor.process(markdown);\n\n\treturn virtualFile.toString();\n};\n"],"names":["visit","index"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAeA,MAAM,0BAA0B,YAE5B;AACH,QAAM,EAAE,mBAAmB,OAAW,IAAA,MAAM,OAAO,sBAAsB;AACzE,QAAM,EAAE,SAAS,WAAe,IAAA,MAAM,OACrC,yCAAyC;AAE1C,QAAM,EAAE,SAAS,WAAe,IAAA,MAAM,OACrC,4CAA4C;AAE7C,QAAM,EAAE,SAAA,IAAa,MAAM,OAAO,qBAAqB;AAEhD,SAAA,CAAC,UAAU,OAAM;AACvB,UAAM,WAAW,QAAQ,YAAY,CAAC,GAAG,QAAQ,YAAY,UAAU;AACjE,UAAA,qBAAqB,kBAAkB,QAAQ;AACrD,UAAM,SAAS;AAEf,WAAO,OAAO,SAAQ;AACrB,YAAM,cAAc,MAAM;AAE1BA,YAAA,MAAM,MAAM,WAAW,SAAU,MAAMC,QAAO,QAAM;AACnD,YAAI,CAAC,UAAUA,WAAU,QAAQ,KAAK,YAAY,OAAO;AACxD;AAAA,QACA;AAEK,cAAA,OAAO,KAAK,SAAS,CAAC;AAG3B,YAAA,CAAC,QACD,KAAK,SAAS,aACd,KAAK,YAAY,UACjB,CAAC,KAAK,YACL;AACD;AAAA,QACA;AAEK,cAAA,UAAU,KAAK,WAAW;AAEhC,YAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAC5B;AAAA,QACA;AAEK,cAAA,WAAW,QAAQ,KACxB,CAAC,MAAM,OAAO,MAAM,YAAY,EAAE,WAAW,MAAM,CAAC;AAGjD,YAAA,OAAO,aAAa,UAAU;AACjC;AAAA,QACA;AAED,cAAM,QAAQ,YAAY,YAAY,SAAS,MAAM,OAAO,MAAM,CAAC;AAGnE,YAAI,CAAC,OAAO;AACX;AAAA,QACA;AAED,cAAM,WAAW,YAAY,UAAU,SAAS,IAAI,GAAG,KAAK;AAC5D,cAAM,WAAW,SAAS;AAEnB,eAAA,SAAS,OAAOA,QAAO,GAAG;AAAA,UAChC,MAAM;AAAA,UACN,SAAS;AAAA,UACT,YAAY;AAAA,YACX,WAAW;AAAA,cACV;AAAA,cACA,eAAe,MAAM,QAAQ,aAAa,EAAE,EAAE,QAAQ,OAAO,GAAG;AAAA,YAChE;AAAA,UACD;AAAA,UACD,UAAU;AAAA,YACT,EAAE,MAAM,WAAW,SAAS,OAAO,YAAY,IAAI,SAAU;AAAA,UAC7D;AAAA,QAAA,CACD;AAAA,MAAA,CACD;AAAA,IAAA;AAAA,EACF;AAEF;AAEA,IAAI;AAES,MAAA,iBAAiB,OAAO,aAAqC;AACzE,MAAI,CAAC,WAAW;AACf,UAAM,EAAE,QAAA,IAAY,MAAM,OAAO,SAAS;AACpC,UAAA,cAAc,MAAM,OAAO,cAAc;AACzC,UAAA,YAAY,MAAM,OAAO,YAAY;AACrC,UAAA,eAAe,MAAM,OAAO,eAAe;AAC3C,UAAA,kBAAkB,MAAM,OAAO,kBAAkB;AACjD,UAAA,oBAAoB,MAAM;AAEhC,gBAAY,QACV,EAAA,IAAI,YAAY,OAAO,EACvB,IAAI,UAAU,OAAO,EACrB,IAAI,aAAa,OAAO,EACxB,IAAI,iBAAiB,EACrB,IAAI,gBAAgB,OAAO;AAAA,EAC7B;AAED,QAAM,cAAc,MAAM,UAAU,QAAQ,QAAQ;AAEpD,SAAO,YAAY;AACpB;;"}

package/dist/lib/markdownToHTML.d.ts

@@ -1 +0,0 @@
-export declare const markdownToHTML: (markdown: string) => Promise<string>;

package/dist/lib/markdownToHTML.js

@@ -1,69 +0,0 @@
-import { visit } from './../_node_modules/unist-util-visit/lib/index.js';
-const createRehypeStarryNight = async () => {
-  const { createStarryNight, common } = await import("@wooorm/starry-night");
-  const { default: tsxGrammar } = await import("@wooorm/starry-night/lang/source.tsx.js");
-  const { default: vueGrammar } = await import("@wooorm/starry-night/lang/text.html.vue.js");
-  const { toString } = await import("hast-util-to-string");
-  return (options = {}) => {
-    const grammars = options.grammars || [...common, tsxGrammar, vueGrammar];
-    const starryNightPromise = createStarryNight(grammars);
-    const prefix = "language-";
-    return async (tree) => {
-      const starryNight = await starryNightPromise;
-      visit(tree, "element", function(node, index, parent) {
-        if (!parent || index === null || node.tagName !== "pre") {
-          return;
-        }
-        const head = node.children[0];
-        if (!head || head.type !== "element" || head.tagName !== "code" || !head.properties) {
-          return;
-        }
-        const classes = head.properties.className;
-        if (!Array.isArray(classes)) {
-          return;
-        }
-        const language = classes.find((d) => typeof d === "string" && d.startsWith(prefix));
-        if (typeof language !== "string") {
-          return;
-        }
-        const scope = starryNight.flagToScope(language.slice(prefix.length));
-        if (!scope) {
-          return;
-        }
-        const fragment = starryNight.highlight(toString(head), scope);
-        const children = fragment.children;
-        parent.children.splice(index, 1, {
-          type: "element",
-          tagName: "div",
-          properties: {
-            className: [
-              "highlight",
-              "highlight-" + scope.replace(/^source\./, "").replace(/\./g, "-")
-            ]
-          },
-          children: [
-            { type: "element", tagName: "pre", properties: {}, children }
-          ]
-        });
-      });
-    };
-  };
-};
-let processor;
-const markdownToHTML = async (markdown) => {
-  if (!processor) {
-    const { unified } = await import("unified");
-    const remarkParse = await import("remark-parse");
-    const remarkGfm = await import("remark-gfm");
-    const remarkRehype = await import("remark-rehype");
-    const rehypeStringify = await import("rehype-stringify");
-    const rehypeStarryNight = await createRehypeStarryNight();
-    processor = unified().use(remarkParse.default).use(remarkGfm.default).use(remarkRehype.default).use(rehypeStarryNight).use(rehypeStringify.default);
-  }
-  const virtualFile = await processor.process(markdown);
-  return virtualFile.toString();
-};
-export {
-  markdownToHTML
-};
-//# sourceMappingURL=markdownToHTML.js.map

package/dist/lib/markdownToHTML.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"markdownToHTML.js","sources":["../../../src/lib/markdownToHTML.ts"],"sourcesContent":["import type { Plugin, Processor } from \"unified\";\nimport type { Root, ElementContent } from \"hast\";\nimport type { Grammar } from \"@wooorm/starry-night\";\nimport { visit } from \"unist-util-visit\";\n\ntype RehypeStarryNightOptions = {\n\tgrammars?: Grammar[];\n};\n\n/**\n * Rehype plugin to highlight code with `starry-night`.\n *\n * Adapted from:\n * https://github.com/wooorm/starry-night/tree/c73aac7b8bff41ada86747f668dd932a791b851b#example-integrate-with-unified-remark-and-rehype\n */\nconst createRehypeStarryNight = async (): Promise<\n\tPlugin<[options?: RehypeStarryNightOptions], Root>\n> => {\n\tconst { createStarryNight, common } = await import(\"@wooorm/starry-night\");\n\tconst { default: tsxGrammar } = await import(\n\t\t\"@wooorm/starry-night/lang/source.tsx.js\"\n\t);\n\tconst { default: vueGrammar } = await import(\n\t\t\"@wooorm/starry-night/lang/text.html.vue.js\"\n\t);\n\tconst { toString } = await import(\"hast-util-to-string\");\n\n\treturn (options = {}) => {\n\t\tconst grammars = options.grammars || [...common, tsxGrammar, vueGrammar];\n\t\tconst starryNightPromise = createStarryNight(grammars);\n\t\tconst prefix = \"language-\";\n\n\t\treturn async (tree) => {\n\t\t\tconst starryNight = await starryNightPromise;\n\n\t\t\tvisit(tree, \"element\", function (node, index, parent) {\n\t\t\t\tif (!parent || index === null || node.tagName !== \"pre\") {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst head = node.children[0];\n\n\t\t\t\tif (\n\t\t\t\t\t!head ||\n\t\t\t\t\thead.type !== \"element\" ||\n\t\t\t\t\thead.tagName !== \"code\" ||\n\t\t\t\t\t!head.properties\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst classes = head.properties.className;\n\n\t\t\t\tif (!Array.isArray(classes)) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst language = classes.find(\n\t\t\t\t\t(d) => typeof d === \"string\" && d.startsWith(prefix),\n\t\t\t\t);\n\n\t\t\t\tif (typeof language !== \"string\") {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst scope = starryNight.flagToScope(language.slice(prefix.length));\n\n\t\t\t\t// Maybe warn?\n\t\t\t\tif (!scope) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst fragment = starryNight.highlight(toString(head), scope);\n\t\t\t\tconst children = fragment.children as ElementContent[];\n\n\t\t\t\tparent.children.splice(index, 1, {\n\t\t\t\t\ttype: \"element\",\n\t\t\t\t\ttagName: \"div\",\n\t\t\t\t\tproperties: {\n\t\t\t\t\t\tclassName: [\n\t\t\t\t\t\t\t\"highlight\",\n\t\t\t\t\t\t\t\"highlight-\" + scope.replace(/^source\\./, \"\").replace(/\\./g, \"-\"),\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t\tchildren: [\n\t\t\t\t\t\t{ type: \"element\", tagName: \"pre\", properties: {}, children },\n\t\t\t\t\t],\n\t\t\t\t});\n\t\t\t});\n\t\t};\n\t};\n};\n\nlet processor: Processor;\n\nexport const markdownToHTML = async (markdown: string): Promise<string> => {\n\tif (!processor) {\n\t\tconst { unified } = await import(\"unified\");\n\t\tconst remarkParse = await import(\"remark-parse\");\n\t\tconst remarkGfm = await import(\"remark-gfm\");\n\t\tconst remarkRehype = await import(\"remark-rehype\");\n\t\tconst rehypeStringify = await import(\"rehype-stringify\");\n\t\tconst rehypeStarryNight = await createRehypeStarryNight();\n\n\t\tprocessor = unified()\n\t\t\t.use(remarkParse.default)\n\t\t\t.use(remarkGfm.default)\n\t\t\t.use(remarkRehype.default)\n\t\t\t.use(rehypeStarryNight)\n\t\t\t.use(rehypeStringify.default);\n\t}\n\n\tconst virtualFile = await processor.process(markdown);\n\n\treturn virtualFile.toString();\n};\n"],"names":[],"mappings":";AAeA,MAAM,0BAA0B,YAE5B;AACH,QAAM,EAAE,mBAAmB,OAAW,IAAA,MAAM,OAAO,sBAAsB;AACzE,QAAM,EAAE,SAAS,WAAe,IAAA,MAAM,OACrC,yCAAyC;AAE1C,QAAM,EAAE,SAAS,WAAe,IAAA,MAAM,OACrC,4CAA4C;AAE7C,QAAM,EAAE,SAAA,IAAa,MAAM,OAAO,qBAAqB;AAEhD,SAAA,CAAC,UAAU,OAAM;AACvB,UAAM,WAAW,QAAQ,YAAY,CAAC,GAAG,QAAQ,YAAY,UAAU;AACjE,UAAA,qBAAqB,kBAAkB,QAAQ;AACrD,UAAM,SAAS;AAEf,WAAO,OAAO,SAAQ;AACrB,YAAM,cAAc,MAAM;AAE1B,YAAM,MAAM,WAAW,SAAU,MAAM,OAAO,QAAM;AACnD,YAAI,CAAC,UAAU,UAAU,QAAQ,KAAK,YAAY,OAAO;AACxD;AAAA,QACA;AAEK,cAAA,OAAO,KAAK,SAAS,CAAC;AAG3B,YAAA,CAAC,QACD,KAAK,SAAS,aACd,KAAK,YAAY,UACjB,CAAC,KAAK,YACL;AACD;AAAA,QACA;AAEK,cAAA,UAAU,KAAK,WAAW;AAEhC,YAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAC5B;AAAA,QACA;AAEK,cAAA,WAAW,QAAQ,KACxB,CAAC,MAAM,OAAO,MAAM,YAAY,EAAE,WAAW,MAAM,CAAC;AAGjD,YAAA,OAAO,aAAa,UAAU;AACjC;AAAA,QACA;AAED,cAAM,QAAQ,YAAY,YAAY,SAAS,MAAM,OAAO,MAAM,CAAC;AAGnE,YAAI,CAAC,OAAO;AACX;AAAA,QACA;AAED,cAAM,WAAW,YAAY,UAAU,SAAS,IAAI,GAAG,KAAK;AAC5D,cAAM,WAAW,SAAS;AAEnB,eAAA,SAAS,OAAO,OAAO,GAAG;AAAA,UAChC,MAAM;AAAA,UACN,SAAS;AAAA,UACT,YAAY;AAAA,YACX,WAAW;AAAA,cACV;AAAA,cACA,eAAe,MAAM,QAAQ,aAAa,EAAE,EAAE,QAAQ,OAAO,GAAG;AAAA,YAChE;AAAA,UACD;AAAA,UACD,UAAU;AAAA,YACT,EAAE,MAAM,WAAW,SAAS,OAAO,YAAY,IAAI,SAAU;AAAA,UAC7D;AAAA,QAAA,CACD;AAAA,MAAA,CACD;AAAA,IAAA;AAAA,EACF;AAEF;AAEA,IAAI;AAES,MAAA,iBAAiB,OAAO,aAAqC;AACzE,MAAI,CAAC,WAAW;AACf,UAAM,EAAE,QAAA,IAAY,MAAM,OAAO,SAAS;AACpC,UAAA,cAAc,MAAM,OAAO,cAAc;AACzC,UAAA,YAAY,MAAM,OAAO,YAAY;AACrC,UAAA,eAAe,MAAM,OAAO,eAAe;AAC3C,UAAA,kBAAkB,MAAM,OAAO,kBAAkB;AACjD,UAAA,oBAAoB,MAAM;AAEhC,gBAAY,QACV,EAAA,IAAI,YAAY,OAAO,EACvB,IAAI,UAAU,OAAO,EACrB,IAAI,aAAa,OAAO,EACxB,IAAI,iBAAiB,EACrB,IAAI,gBAAgB,OAAO;AAAA,EAC7B;AAED,QAAM,cAAc,MAAM,UAAU,QAAQ,QAAQ;AAEpD,SAAO,YAAY;AACpB;"}

package/src/lib/functionCodec.ts

@@ -1,16 +0,0 @@
-import * as t from "io-ts";
-
-export const functionCodec = new t.Type<
-	// eslint-disable-next-line @typescript-eslint/ban-types
-	Function,
-	// eslint-disable-next-line @typescript-eslint/ban-types
-	Function,
-	unknown
->(
-	"function",
-	// eslint-disable-next-line @typescript-eslint/ban-types
-	(input: unknown): input is Function => typeof input === "function",
-	(input, context) =>
-		typeof input === "function" ? t.success(input) : t.failure(input, context),
-	t.identity,
-);