@anoki/fse-ui 2.3.0-RC15 → 2.3.0-RC18

package/dist/index.es739.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es739.js","sources":["../node_modules/@radix-ui/themes/dist/esm/helpers/get-subtree.js"],"sourcesContent":["import*as a from\"react\";function d(i,e){const{asChild:r,children:c}=i;if(!r)return typeof e==\"function\"?e(c):e;const t=a.Children.only(c);return a.cloneElement(t,{children:typeof e==\"function\"?e(t.props.children):e})}export{d as getSubtree};\n//# sourceMappingURL=get-subtree.js.map\n"],"names":["d","i","e","r","c","t","a"],"mappings":";AAAwB,SAASA,EAAEC,GAAEC,GAAE;AAAC,QAAK,EAAC,SAAQC,GAAE,UAASC,EAAC,IAAEH;AAAE,MAAG,CAACE,EAAE,QAAO,OAAOD,KAAG,aAAWA,EAAEE,CAAC,IAAEF;AAAE,QAAMG,IAAEC,EAAE,SAAS,KAAKF,CAAC;AAAE,SAAOE,EAAE,aAAaD,GAAE,EAAC,UAAS,OAAOH,KAAG,aAAWA,EAAEG,EAAE,MAAM,QAAQ,IAAEH,EAAC,CAAC;AAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es739.js","sources":["../node_modules/domutils/lib/manipulation.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.removeElement = removeElement;\nexports.replaceElement = replaceElement;\nexports.appendChild = appendChild;\nexports.append = append;\nexports.prependChild = prependChild;\nexports.prepend = prepend;\n/**\n * Remove an element from the dom\n *\n * @category Manipulation\n * @param elem The element to be removed\n */\nfunction removeElement(elem) {\n    if (elem.prev)\n        elem.prev.next = elem.next;\n    if (elem.next)\n        elem.next.prev = elem.prev;\n    if (elem.parent) {\n        var childs = elem.parent.children;\n        var childsIndex = childs.lastIndexOf(elem);\n        if (childsIndex >= 0) {\n            childs.splice(childsIndex, 1);\n        }\n    }\n    elem.next = null;\n    elem.prev = null;\n    elem.parent = null;\n}\n/**\n * Replace an element in the dom\n *\n * @category Manipulation\n * @param elem The element to be replaced\n * @param replacement The element to be added\n */\nfunction replaceElement(elem, replacement) {\n    var prev = (replacement.prev = elem.prev);\n    if (prev) {\n        prev.next = replacement;\n    }\n    var next = (replacement.next = elem.next);\n    if (next) {\n        next.prev = replacement;\n    }\n    var parent = (replacement.parent = elem.parent);\n    if (parent) {\n        var childs = parent.children;\n        childs[childs.lastIndexOf(elem)] = replacement;\n        elem.parent = null;\n    }\n}\n/**\n * Append a child to an element.\n *\n * @category Manipulation\n * @param parent The element to append to.\n * @param child The element to be added as a child.\n */\nfunction appendChild(parent, child) {\n    removeElement(child);\n    child.next = null;\n    child.parent = parent;\n    if (parent.children.push(child) > 1) {\n        var sibling = parent.children[parent.children.length - 2];\n        sibling.next = child;\n        child.prev = sibling;\n    }\n    else {\n        child.prev = null;\n    }\n}\n/**\n * Append an element after another.\n *\n * @category Manipulation\n * @param elem The element to append after.\n * @param next The element be added.\n */\nfunction append(elem, next) {\n    removeElement(next);\n    var parent = elem.parent;\n    var currNext = elem.next;\n    next.next = currNext;\n    next.prev = elem;\n    elem.next = next;\n    next.parent = parent;\n    if (currNext) {\n        currNext.prev = next;\n        if (parent) {\n            var childs = parent.children;\n            childs.splice(childs.lastIndexOf(currNext), 0, next);\n        }\n    }\n    else if (parent) {\n        parent.children.push(next);\n    }\n}\n/**\n * Prepend a child to an element.\n *\n * @category Manipulation\n * @param parent The element to prepend before.\n * @param child The element to be added as a child.\n */\nfunction prependChild(parent, child) {\n    removeElement(child);\n    child.parent = parent;\n    child.prev = null;\n    if (parent.children.unshift(child) !== 1) {\n        var sibling = parent.children[1];\n        sibling.prev = child;\n        child.next = sibling;\n    }\n    else {\n        child.next = null;\n    }\n}\n/**\n * Prepend an element before another.\n *\n * @category Manipulation\n * @param elem The element to prepend before.\n * @param prev The element be added.\n */\nfunction prepend(elem, prev) {\n    removeElement(prev);\n    var parent = elem.parent;\n    if (parent) {\n        var childs = parent.children;\n        childs.splice(childs.indexOf(elem), 0, prev);\n    }\n    if (elem.prev) {\n        elem.prev.next = prev;\n    }\n    prev.parent = parent;\n    prev.prev = elem.prev;\n    prev.next = elem;\n    elem.prev = prev;\n}\n//# sourceMappingURL=manipulation.js.map"],"names":["manipulation","removeElement","replaceElement","appendChild","append","prependChild","prepend","elem","childs","childsIndex","replacement","prev","next","parent","child","sibling","currNext"],"mappings":";;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,gBAAwBC,GACxBD,EAAA,iBAAyBE,GACzBF,EAAA,cAAsBG,GACtBH,EAAA,SAAiBI,GACjBJ,EAAA,eAAuBK,GACvBL,EAAA,UAAkBM;AAOlB,WAASL,EAAcM,GAAM;AAKzB,QAJIA,EAAK,SACLA,EAAK,KAAK,OAAOA,EAAK,OACtBA,EAAK,SACLA,EAAK,KAAK,OAAOA,EAAK,OACtBA,EAAK,QAAQ;AACb,UAAIC,IAASD,EAAK,OAAO,UACrBE,IAAcD,EAAO,YAAYD,CAAI;AACzC,MAAIE,KAAe,KACfD,EAAO,OAAOC,GAAa,CAAC;AAAA,IAExC;AACI,IAAAF,EAAK,OAAO,MACZA,EAAK,OAAO,MACZA,EAAK,SAAS;AAAA,EAClB;AAQA,WAASL,EAAeK,GAAMG,GAAa;AACvC,QAAIC,IAAQD,EAAY,OAAOH,EAAK;AACpC,IAAII,MACAA,EAAK,OAAOD;AAEhB,QAAIE,IAAQF,EAAY,OAAOH,EAAK;AACpC,IAAIK,MACAA,EAAK,OAAOF;AAEhB,QAAIG,IAAUH,EAAY,SAASH,EAAK;AACxC,QAAIM,GAAQ;AACR,UAAIL,IAASK,EAAO;AACpB,MAAAL,EAAOA,EAAO,YAAYD,CAAI,CAAC,IAAIG,GACnCH,EAAK,SAAS;AAAA,IACtB;AAAA,EACA;AAQA,WAASJ,EAAYU,GAAQC,GAAO;AAIhC,QAHAb,EAAca,CAAK,GACnBA,EAAM,OAAO,MACbA,EAAM,SAASD,GACXA,EAAO,SAAS,KAAKC,CAAK,IAAI,GAAG;AACjC,UAAIC,IAAUF,EAAO,SAASA,EAAO,SAAS,SAAS,CAAC;AACxD,MAAAE,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,IACrB;AAEQ,MAAAD,EAAM,OAAO;AAAA,EAErB;AAQA,WAASV,EAAOG,GAAMK,GAAM;AACxB,IAAAX,EAAcW,CAAI;AAClB,QAAIC,IAASN,EAAK,QACdS,IAAWT,EAAK;AAKpB,QAJAK,EAAK,OAAOI,GACZJ,EAAK,OAAOL,GACZA,EAAK,OAAOK,GACZA,EAAK,SAASC,GACVG;AAEA,UADAA,EAAS,OAAOJ,GACZC,GAAQ;AACR,YAAIL,IAASK,EAAO;AACpB,QAAAL,EAAO,OAAOA,EAAO,YAAYQ,CAAQ,GAAG,GAAGJ,CAAI;AAAA,MAC/D;AAAA,UAES,CAAIC,KACLA,EAAO,SAAS,KAAKD,CAAI;AAAA,EAEjC;AAQA,WAASP,EAAaQ,GAAQC,GAAO;AAIjC,QAHAb,EAAca,CAAK,GACnBA,EAAM,SAASD,GACfC,EAAM,OAAO,MACTD,EAAO,SAAS,QAAQC,CAAK,MAAM,GAAG;AACtC,UAAIC,IAAUF,EAAO,SAAS,CAAC;AAC/B,MAAAE,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,IACrB;AAEQ,MAAAD,EAAM,OAAO;AAAA,EAErB;AAQA,WAASR,EAAQC,GAAMI,GAAM;AACzB,IAAAV,EAAcU,CAAI;AAClB,QAAIE,IAASN,EAAK;AAClB,QAAIM,GAAQ;AACR,UAAIL,IAASK,EAAO;AACpB,MAAAL,EAAO,OAAOA,EAAO,QAAQD,CAAI,GAAG,GAAGI,CAAI;AAAA,IACnD;AACI,IAAIJ,EAAK,SACLA,EAAK,KAAK,OAAOI,IAErBA,EAAK,SAASE,GACdF,EAAK,OAAOJ,EAAK,MACjBI,EAAK,OAAOJ,GACZA,EAAK,OAAOI;AAAA,EAChB;;;","x_google_ignoreList":[0]}

package/dist/index.es740.js

@@ -1,9 +1,64 @@
-function o(...n) {
-  let e = {};
-  for (const t of n) t && (e = { ...e, ...t });
-  return Object.keys(e).length ? e : void 0;
+import { __exports as u } from "./index.es775.js";
+import { __require as o } from "./index.es667.js";
+var d;
+function O() {
+  if (d) return u;
+  d = 1, Object.defineProperty(u, "__esModule", { value: !0 }), u.filter = y, u.find = s, u.findOneChild = g, u.findOne = c, u.existsOne = v, u.findAll = A;
+  var e = /* @__PURE__ */ o();
+  function y(f, r, n, t) {
+    return n === void 0 && (n = !0), t === void 0 && (t = 1 / 0), s(f, Array.isArray(r) ? r : [r], n, t);
+  }
+  function s(f, r, n, t) {
+    for (var a = [], i = [Array.isArray(r) ? r : [r]], h = [0]; ; ) {
+      if (h[0] >= i[0].length) {
+        if (h.length === 1)
+          return a;
+        i.shift(), h.shift();
+        continue;
+      }
+      var l = i[0][h[0]++];
+      if (f(l) && (a.push(l), --t <= 0))
+        return a;
+      n && (0, e.hasChildren)(l) && l.children.length > 0 && (h.unshift(0), i.unshift(l.children));
+    }
+  }
+  function g(f, r) {
+    return r.find(f);
+  }
+  function c(f, r, n) {
+    n === void 0 && (n = !0);
+    for (var t = Array.isArray(r) ? r : [r], a = 0; a < t.length; a++) {
+      var i = t[a];
+      if ((0, e.isTag)(i) && f(i))
+        return i;
+      if (n && (0, e.hasChildren)(i) && i.children.length > 0) {
+        var h = c(f, i.children, !0);
+        if (h)
+          return h;
+      }
+    }
+    return null;
+  }
+  function v(f, r) {
+    return (Array.isArray(r) ? r : [r]).some(function(n) {
+      return (0, e.isTag)(n) && f(n) || (0, e.hasChildren)(n) && v(f, n.children);
+    });
+  }
+  function A(f, r) {
+    for (var n = [], t = [Array.isArray(r) ? r : [r]], a = [0]; ; ) {
+      if (a[0] >= t[0].length) {
+        if (t.length === 1)
+          return n;
+        t.shift(), a.shift();
+        continue;
+      }
+      var i = t[0][a[0]++];
+      (0, e.isTag)(i) && f(i) && n.push(i), (0, e.hasChildren)(i) && i.children.length > 0 && (a.unshift(0), t.unshift(i.children));
+    }
+  }
+  return u;
 }
 export {
-  o as mergeStyles
+  O as __require
 };
 //# sourceMappingURL=index.es740.js.map

package/dist/index.es740.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es740.js","sources":["../node_modules/@radix-ui/themes/dist/esm/helpers/merge-styles.js"],"sourcesContent":["function l(...t){let e={};for(const n of t)n&&(e={...e,...n});return Object.keys(e).length?e:void 0}export{l as mergeStyles};\n//# sourceMappingURL=merge-styles.js.map\n"],"names":["l","t","n"],"mappings":"AAAA,SAASA,KAAKC,GAAE;AAAC,MAAI,IAAE;AAAG,aAAUC,KAAKD,EAAE,CAAAC,MAAI,IAAE,EAAC,GAAG,GAAE,GAAGA,EAAC;AAAG,SAAO,OAAO,KAAK,CAAC,EAAE,SAAO,IAAE;AAAM;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es740.js","sources":["../node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.filter = filter;\nexports.find = find;\nexports.findOneChild = findOneChild;\nexports.findOne = findOne;\nexports.existsOne = existsOne;\nexports.findAll = findAll;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param node Node to search. Will be included in the result set if it matches.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction filter(test, node, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return find(test, Array.isArray(node) ? node : [node], recurse, limit);\n}\n/**\n * Search an array of nodes and their children for nodes passing a test function.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction find(test, nodes, recurse, limit) {\n    var result = [];\n    /** Stack of the arrays we are looking at. */\n    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];\n    /** Stack of the indices within the arrays. */\n    var indexStack = [0];\n    for (;;) {\n        // First, check if the current array has any more elements to look at.\n        if (indexStack[0] >= nodeStack[0].length) {\n            // If we have no more arrays to look at, we are done.\n            if (indexStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (test(elem)) {\n            result.push(elem);\n            if (--limit <= 0)\n                return result;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            /*\n             * Add the children to the stack. We are depth-first, so this is\n             * the next array we look at.\n             */\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\n/**\n * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns The first node in the array that passes `test`.\n * @deprecated Use `Array.prototype.find` directly.\n */\nfunction findOneChild(test, nodes) {\n    return nodes.find(test);\n}\n/**\n * Finds one element in a tree that passes a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Node or array of nodes to search.\n * @param recurse Also consider child nodes.\n * @returns The first node that passes `test`.\n */\nfunction findOne(test, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    var searchedNodes = Array.isArray(nodes) ? nodes : [nodes];\n    for (var i = 0; i < searchedNodes.length; i++) {\n        var node = searchedNodes[i];\n        if ((0, domhandler_1.isTag)(node) && test(node)) {\n            return node;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(node) && node.children.length > 0) {\n            var found = findOne(test, node.children, true);\n            if (found)\n                return found;\n        }\n    }\n    return null;\n}\n/**\n * Checks if a tree of nodes contains at least one node passing a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns Whether a tree of nodes contains at least one node passing the test.\n */\nfunction existsOne(test, nodes) {\n    return (Array.isArray(nodes) ? nodes : [nodes]).some(function (node) {\n        return ((0, domhandler_1.isTag)(node) && test(node)) ||\n            ((0, domhandler_1.hasChildren)(node) && existsOne(test, node.children));\n    });\n}\n/**\n * Search an array of nodes and their children for elements passing a test function.\n *\n * Same as `find`, but limited to elements and with less options, leading to reduced complexity.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns All nodes passing `test`.\n */\nfunction findAll(test, nodes) {\n    var result = [];\n    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];\n    var indexStack = [0];\n    for (;;) {\n        if (indexStack[0] >= nodeStack[0].length) {\n            if (nodeStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if ((0, domhandler_1.isTag)(elem) && test(elem))\n            result.push(elem);\n        if ((0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\n//# sourceMappingURL=querying.js.map"],"names":["querying","filter","find","findOneChild","findOne","existsOne","findAll","domhandler_1","require$$0","test","node","recurse","limit","nodes","result","nodeStack","indexStack","elem","searchedNodes","i","found"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,SAAiBC,GACjBD,EAAA,OAAeE,GACfF,EAAA,eAAuBG,GACvBH,EAAA,UAAkBI,GAClBJ,EAAA,YAAoBK,GACpBL,EAAA,UAAkBM;AAClB,MAAIC,IAAeC,gBAAAA,EAAA;AAWnB,WAASP,EAAOQ,GAAMC,GAAMC,GAASC,GAAO;AACxC,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,QACzBV,EAAKO,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AAAA,EACzE;AAWA,WAASV,EAAKO,GAAMI,GAAOF,GAASC,GAAO;AAMvC,aALIE,IAAS,CAAA,GAETC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GAEnDG,IAAa,CAAC,CAAC,OACV;AAEL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAEtC,YAAIC,EAAW,WAAW;AACtB,iBAAOF;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAIP,EAAKQ,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEL,KAAS;AACX,eAAOE;AAEf,MAAIH,SAAeJ,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;AAUA,WAASd,EAAaM,GAAMI,GAAO;AAC/B,WAAOA,EAAM,KAAKJ,CAAI;AAAA,EAC1B;AAUA,WAASL,EAAQK,GAAMI,GAAOF,GAAS;AACnC,IAAIA,MAAY,WAAUA,IAAU;AAEpC,aADIO,IAAgB,MAAM,QAAQL,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAChDM,IAAI,GAAGA,IAAID,EAAc,QAAQC,KAAK;AAC3C,UAAIT,IAAOQ,EAAcC,CAAC;AAC1B,cAAQZ,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI;AAC1C,eAAOA;AAEX,UAAIC,SAAeJ,EAAa,aAAaG,CAAI,KAAKA,EAAK,SAAS,SAAS,GAAG;AAC5E,YAAIU,IAAQhB,EAAQK,GAAMC,EAAK,UAAU,EAAI;AAC7C,YAAIU;AACA,iBAAOA;AAAA,MACvB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AASA,WAASf,EAAUI,GAAMI,GAAO;AAC5B,YAAQ,MAAM,QAAQA,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAAG,KAAK,SAAUH,GAAM;AACjE,iBAAYH,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI,SACzCH,EAAa,aAAaG,CAAI,KAAKL,EAAUI,GAAMC,EAAK,QAAQ;AAAA,IACjF,CAAK;AAAA,EACL;AAWA,WAASJ,EAAQG,GAAMI,GAAO;AAI1B,aAHIC,IAAS,CAAA,GACTC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GACnDG,IAAa,CAAC,CAAC,OACV;AACL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AACtC,YAAIA,EAAU,WAAW;AACrB,iBAAOD;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAQT,EAAa,OAAOU,CAAI,KAAKR,EAAKQ,CAAI,KAC1CH,EAAO,KAAKG,CAAI,OACZV,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAC9DD,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;;;","x_google_ignoreList":[0]}