@anoki/fse-ui 2.3.0-RC13 → 2.3.0-RC14

package/dist/index.es619.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es619.js","sources":["../node_modules/deepmerge/dist/cjs.js"],"sourcesContent":["'use strict';\n\nvar isMergeableObject = function isMergeableObject(value) {\n\treturn isNonNullObject(value)\n\t\t&& !isSpecial(value)\n};\n\nfunction isNonNullObject(value) {\n\treturn !!value && typeof value === 'object'\n}\n\nfunction isSpecial(value) {\n\tvar stringValue = Object.prototype.toString.call(value);\n\n\treturn stringValue === '[object RegExp]'\n\t\t|| stringValue === '[object Date]'\n\t\t|| isReactElement(value)\n}\n\n// see https://github.com/facebook/react/blob/b5ac963fb791d1298e7f396236383bc955f916c1/src/isomorphic/classic/element/ReactElement.js#L21-L25\nvar canUseSymbol = typeof Symbol === 'function' && Symbol.for;\nvar REACT_ELEMENT_TYPE = canUseSymbol ? Symbol.for('react.element') : 0xeac7;\n\nfunction isReactElement(value) {\n\treturn value.$$typeof === REACT_ELEMENT_TYPE\n}\n\nfunction emptyTarget(val) {\n\treturn Array.isArray(val) ? [] : {}\n}\n\nfunction cloneUnlessOtherwiseSpecified(value, options) {\n\treturn (options.clone !== false && options.isMergeableObject(value))\n\t\t? deepmerge(emptyTarget(value), value, options)\n\t\t: value\n}\n\nfunction defaultArrayMerge(target, source, options) {\n\treturn target.concat(source).map(function(element) {\n\t\treturn cloneUnlessOtherwiseSpecified(element, options)\n\t})\n}\n\nfunction getMergeFunction(key, options) {\n\tif (!options.customMerge) {\n\t\treturn deepmerge\n\t}\n\tvar customMerge = options.customMerge(key);\n\treturn typeof customMerge === 'function' ? customMerge : deepmerge\n}\n\nfunction getEnumerableOwnPropertySymbols(target) {\n\treturn Object.getOwnPropertySymbols\n\t\t? Object.getOwnPropertySymbols(target).filter(function(symbol) {\n\t\t\treturn Object.propertyIsEnumerable.call(target, symbol)\n\t\t})\n\t\t: []\n}\n\nfunction getKeys(target) {\n\treturn Object.keys(target).concat(getEnumerableOwnPropertySymbols(target))\n}\n\nfunction propertyIsOnObject(object, property) {\n\ttry {\n\t\treturn property in object\n\t} catch(_) {\n\t\treturn false\n\t}\n}\n\n// Protects from prototype poisoning and unexpected merging up the prototype chain.\nfunction propertyIsUnsafe(target, key) {\n\treturn propertyIsOnObject(target, key) // Properties are safe to merge if they don't exist in the target yet,\n\t\t&& !(Object.hasOwnProperty.call(target, key) // unsafe if they exist up the prototype chain,\n\t\t\t&& Object.propertyIsEnumerable.call(target, key)) // and also unsafe if they're nonenumerable.\n}\n\nfunction mergeObject(target, source, options) {\n\tvar destination = {};\n\tif (options.isMergeableObject(target)) {\n\t\tgetKeys(target).forEach(function(key) {\n\t\t\tdestination[key] = cloneUnlessOtherwiseSpecified(target[key], options);\n\t\t});\n\t}\n\tgetKeys(source).forEach(function(key) {\n\t\tif (propertyIsUnsafe(target, key)) {\n\t\t\treturn\n\t\t}\n\n\t\tif (propertyIsOnObject(target, key) && options.isMergeableObject(source[key])) {\n\t\t\tdestination[key] = getMergeFunction(key, options)(target[key], source[key], options);\n\t\t} else {\n\t\t\tdestination[key] = cloneUnlessOtherwiseSpecified(source[key], options);\n\t\t}\n\t});\n\treturn destination\n}\n\nfunction deepmerge(target, source, options) {\n\toptions = options || {};\n\toptions.arrayMerge = options.arrayMerge || defaultArrayMerge;\n\toptions.isMergeableObject = options.isMergeableObject || isMergeableObject;\n\t// cloneUnlessOtherwiseSpecified is added to `options` so that custom arrayMerge()\n\t// implementations can use it. The caller may not replace it.\n\toptions.cloneUnlessOtherwiseSpecified = cloneUnlessOtherwiseSpecified;\n\n\tvar sourceIsArray = Array.isArray(source);\n\tvar targetIsArray = Array.isArray(target);\n\tvar sourceAndTargetTypesMatch = sourceIsArray === targetIsArray;\n\n\tif (!sourceAndTargetTypesMatch) {\n\t\treturn cloneUnlessOtherwiseSpecified(source, options)\n\t} else if (sourceIsArray) {\n\t\treturn options.arrayMerge(target, source, options)\n\t} else {\n\t\treturn mergeObject(target, source, options)\n\t}\n}\n\ndeepmerge.all = function deepmergeAll(array, options) {\n\tif (!Array.isArray(array)) {\n\t\tthrow new Error('first argument should be an array')\n\t}\n\n\treturn array.reduce(function(prev, next) {\n\t\treturn deepmerge(prev, next, options)\n\t}, {})\n};\n\nvar deepmerge_1 = deepmerge;\n\nmodule.exports = deepmerge_1;\n"],"names":["isMergeableObject","value","isNonNullObject","isSpecial","stringValue","isReactElement","canUseSymbol","REACT_ELEMENT_TYPE","emptyTarget","val","cloneUnlessOtherwiseSpecified","options","deepmerge","defaultArrayMerge","target","source","element","getMergeFunction","key","customMerge","getEnumerableOwnPropertySymbols","symbol","getKeys","propertyIsOnObject","object","property","propertyIsUnsafe","mergeObject","destination","sourceIsArray","targetIsArray","sourceAndTargetTypesMatch","array","prev","next","deepmerge_1","cjs"],"mappings":";;;;AAEA,MAAIA,IAAoB,SAA2BC,GAAO;AACzD,WAAOC,EAAgBD,CAAK,KACxB,CAACE,EAAUF,CAAK;AAAA,EACrB;AAEA,WAASC,EAAgBD,GAAO;AAC/B,WAAO,CAAC,CAACA,KAAS,OAAOA,KAAU;AAAA,EACpC;AAEA,WAASE,EAAUF,GAAO;AACzB,QAAIG,IAAc,OAAO,UAAU,SAAS,KAAKH,CAAK;AAEtD,WAAOG,MAAgB,qBACnBA,MAAgB,mBAChBC,EAAeJ,CAAK;AAAA,EACzB;AAGA,MAAIK,IAAe,OAAO,UAAW,cAAc,OAAO,KACtDC,IAAqBD,IAAe,OAAO,IAAI,eAAe,IAAI;AAEtE,WAASD,EAAeJ,GAAO;AAC9B,WAAOA,EAAM,aAAaM;AAAA,EAC3B;AAEA,WAASC,EAAYC,GAAK;AACzB,WAAO,MAAM,QAAQA,CAAG,IAAI,CAAA,IAAK,CAAA;AAAA,EAClC;AAEA,WAASC,EAA8BT,GAAOU,GAAS;AACtD,WAAQA,EAAQ,UAAU,MAASA,EAAQ,kBAAkBV,CAAK,IAC/DW,EAAUJ,EAAYP,CAAK,GAAGA,GAAOU,CAAO,IAC5CV;AAAA,EACJ;AAEA,WAASY,EAAkBC,GAAQC,GAAQJ,GAAS;AACnD,WAAOG,EAAO,OAAOC,CAAM,EAAE,IAAI,SAASC,GAAS;AAClD,aAAON,EAA8BM,GAASL,CAAO;AAAA,IACvD,CAAE;AAAA,EACF;AAEA,WAASM,EAAiBC,GAAKP,GAAS;AACvC,QAAI,CAACA,EAAQ;AACZ,aAAOC;AAER,QAAIO,IAAcR,EAAQ,YAAYO,CAAG;AACzC,WAAO,OAAOC,KAAgB,aAAaA,IAAcP;AAAA,EAC1D;AAEA,WAASQ,EAAgCN,GAAQ;AAChD,WAAO,OAAO,wBACX,OAAO,sBAAsBA,CAAM,EAAE,OAAO,SAASO,GAAQ;AAC9D,aAAO,OAAO,qBAAqB,KAAKP,GAAQO,CAAM;AAAA,IACzD,CAAG,IACC,CAAA;AAAA,EACJ;AAEA,WAASC,EAAQR,GAAQ;AACxB,WAAO,OAAO,KAAKA,CAAM,EAAE,OAAOM,EAAgCN,CAAM,CAAC;AAAA,EAC1E;AAEA,WAASS,EAAmBC,GAAQC,GAAU;AAC7C,QAAI;AACH,aAAOA,KAAYD;AAAA,IACrB,QAAY;AACV,aAAO;AAAA,IACT;AAAA,EACA;AAGA,WAASE,EAAiBZ,GAAQI,GAAK;AACtC,WAAOK,EAAmBT,GAAQI,CAAG,KACjC,EAAE,OAAO,eAAe,KAAKJ,GAAQI,CAAG,KACvC,OAAO,qBAAqB,KAAKJ,GAAQI,CAAG;AAAA,EAClD;AAEA,WAASS,EAAYb,GAAQC,GAAQJ,GAAS;AAC7C,QAAIiB,IAAc,CAAA;AAClB,WAAIjB,EAAQ,kBAAkBG,CAAM,KACnCQ,EAAQR,CAAM,EAAE,QAAQ,SAASI,GAAK;AACrC,MAAAU,EAAYV,CAAG,IAAIR,EAA8BI,EAAOI,CAAG,GAAGP,CAAO;AAAA,IACxE,CAAG,GAEFW,EAAQP,CAAM,EAAE,QAAQ,SAASG,GAAK;AACrC,MAAIQ,EAAiBZ,GAAQI,CAAG,MAI5BK,EAAmBT,GAAQI,CAAG,KAAKP,EAAQ,kBAAkBI,EAAOG,CAAG,CAAC,IAC3EU,EAAYV,CAAG,IAAID,EAAiBC,GAAKP,CAAO,EAAEG,EAAOI,CAAG,GAAGH,EAAOG,CAAG,GAAGP,CAAO,IAEnFiB,EAAYV,CAAG,IAAIR,EAA8BK,EAAOG,CAAG,GAAGP,CAAO;AAAA,IAExE,CAAE,GACMiB;AAAA,EACR;AAEA,WAAShB,EAAUE,GAAQC,GAAQJ,GAAS;AAC3C,IAAAA,IAAUA,KAAW,CAAA,GACrBA,EAAQ,aAAaA,EAAQ,cAAcE,GAC3CF,EAAQ,oBAAoBA,EAAQ,qBAAqBX,GAGzDW,EAAQ,gCAAgCD;AAExC,QAAImB,IAAgB,MAAM,QAAQd,CAAM,GACpCe,IAAgB,MAAM,QAAQhB,CAAM,GACpCiB,IAA4BF,MAAkBC;AAElD,WAAKC,IAEMF,IACHlB,EAAQ,WAAWG,GAAQC,GAAQJ,CAAO,IAE1CgB,EAAYb,GAAQC,GAAQJ,CAAO,IAJnCD,EAA8BK,GAAQJ,CAAO;AAAA,EAMtD;AAEA,EAAAC,EAAU,MAAM,SAAsBoB,GAAOrB,GAAS;AACrD,QAAI,CAAC,MAAM,QAAQqB,CAAK;AACvB,YAAM,IAAI,MAAM,mCAAmC;AAGpD,WAAOA,EAAM,OAAO,SAASC,GAAMC,GAAM;AACxC,aAAOtB,EAAUqB,GAAMC,GAAMvB,CAAO;AAAA,IACtC,GAAI,CAAA,CAAE;AAAA,EACN;AAEA,MAAIwB,IAAcvB;AAElB,SAAAwB,IAAiBD;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es619.js","sources":["../node_modules/parse-srcset/src/parse-srcset.js"],"sourcesContent":["/**\n * Srcset Parser\n *\n * By Alex Bell |  MIT License\n *\n * JS Parser for the string value that appears in markup <img srcset=\"here\">\n *\n * @returns Array [{url: _, d: _, w: _, h:_}, ...]\n *\n * Based super duper closely on the reference algorithm at:\n * https://html.spec.whatwg.org/multipage/embedded-content.html#parse-a-srcset-attribute\n *\n * Most comments are copied in directly from the spec\n * (except for comments in parens).\n */\n\n(function (root, factory) {\n\tif (typeof define === 'function' && define.amd) {\n\t\t// AMD. Register as an anonymous module.\n\t\tdefine([], factory);\n\t} else if (typeof module === 'object' && module.exports) {\n\t\t// Node. Does not work with strict CommonJS, but\n\t\t// only CommonJS-like environments that support module.exports,\n\t\t// like Node.\n\t\tmodule.exports = factory();\n\t} else {\n\t\t// Browser globals (root is window)\n\t\troot.parseSrcset = factory();\n\t}\n}(this, function () {\n\n\t// 1. Let input be the value passed to this algorithm.\n\treturn function (input) {\n\n\t\t// UTILITY FUNCTIONS\n\n\t\t// Manual is faster than RegEx\n\t\t// http://bjorn.tipling.com/state-and-regular-expressions-in-javascript\n\t\t// http://jsperf.com/whitespace-character/5\n\t\tfunction isSpace(c) {\n\t\t\treturn (c === \"\\u0020\" || // space\n\t\t\tc === \"\\u0009\" || // horizontal tab\n\t\t\tc === \"\\u000A\" || // new line\n\t\t\tc === \"\\u000C\" || // form feed\n\t\t\tc === \"\\u000D\");  // carriage return\n\t\t}\n\n\t\tfunction collectCharacters(regEx) {\n\t\t\tvar chars,\n\t\t\t\tmatch = regEx.exec(input.substring(pos));\n\t\t\tif (match) {\n\t\t\t\tchars = match[ 0 ];\n\t\t\t\tpos += chars.length;\n\t\t\t\treturn chars;\n\t\t\t}\n\t\t}\n\n\t\tvar inputLength = input.length,\n\n\t\t\t// (Don't use \\s, to avoid matching non-breaking space)\n\t\t\tregexLeadingSpaces = /^[ \\t\\n\\r\\u000c]+/,\n\t\t\tregexLeadingCommasOrSpaces = /^[, \\t\\n\\r\\u000c]+/,\n\t\t\tregexLeadingNotSpaces = /^[^ \\t\\n\\r\\u000c]+/,\n\t\t\tregexTrailingCommas = /[,]+$/,\n\t\t\tregexNonNegativeInteger = /^\\d+$/,\n\n\t\t\t// ( Positive or negative or unsigned integers or decimals, without or without exponents.\n\t\t\t// Must include at least one digit.\n\t\t\t// According to spec tests any decimal point must be followed by a digit.\n\t\t\t// No leading plus sign is allowed.)\n\t\t\t// https://html.spec.whatwg.org/multipage/infrastructure.html#valid-floating-point-number\n\t\t\tregexFloatingPoint = /^-?(?:[0-9]+|[0-9]*\\.[0-9]+)(?:[eE][+-]?[0-9]+)?$/,\n\n\t\t\turl,\n\t\t\tdescriptors,\n\t\t\tcurrentDescriptor,\n\t\t\tstate,\n\t\t\tc,\n\n\t\t\t// 2. Let position be a pointer into input, initially pointing at the start\n\t\t\t//    of the string.\n\t\t\tpos = 0,\n\n\t\t\t// 3. Let candidates be an initially empty source set.\n\t\t\tcandidates = [];\n\n\t\t// 4. Splitting loop: Collect a sequence of characters that are space\n\t\t//    characters or U+002C COMMA characters. If any U+002C COMMA characters\n\t\t//    were collected, that is a parse error.\n\t\twhile (true) {\n\t\t\tcollectCharacters(regexLeadingCommasOrSpaces);\n\n\t\t\t// 5. If position is past the end of input, return candidates and abort these steps.\n\t\t\tif (pos >= inputLength) {\n\t\t\t\treturn candidates; // (we're done, this is the sole return path)\n\t\t\t}\n\n\t\t\t// 6. Collect a sequence of characters that are not space characters,\n\t\t\t//    and let that be url.\n\t\t\turl = collectCharacters(regexLeadingNotSpaces);\n\n\t\t\t// 7. Let descriptors be a new empty list.\n\t\t\tdescriptors = [];\n\n\t\t\t// 8. If url ends with a U+002C COMMA character (,), follow these substeps:\n\t\t\t//\t\t(1). Remove all trailing U+002C COMMA characters from url. If this removed\n\t\t\t//         more than one character, that is a parse error.\n\t\t\tif (url.slice(-1) === \",\") {\n\t\t\t\turl = url.replace(regexTrailingCommas, \"\");\n\t\t\t\t// (Jump ahead to step 9 to skip tokenization and just push the candidate).\n\t\t\t\tparseDescriptors();\n\n\t\t\t\t//\tOtherwise, follow these substeps:\n\t\t\t} else {\n\t\t\t\ttokenize();\n\t\t\t} // (close else of step 8)\n\n\t\t\t// 16. Return to the step labeled splitting loop.\n\t\t} // (Close of big while loop.)\n\n\t\t/**\n\t\t * Tokenizes descriptor properties prior to parsing\n\t\t * Returns undefined.\n\t\t */\n\t\tfunction tokenize() {\n\n\t\t\t// 8.1. Descriptor tokeniser: Skip whitespace\n\t\t\tcollectCharacters(regexLeadingSpaces);\n\n\t\t\t// 8.2. Let current descriptor be the empty string.\n\t\t\tcurrentDescriptor = \"\";\n\n\t\t\t// 8.3. Let state be in descriptor.\n\t\t\tstate = \"in descriptor\";\n\n\t\t\twhile (true) {\n\n\t\t\t\t// 8.4. Let c be the character at position.\n\t\t\t\tc = input.charAt(pos);\n\n\t\t\t\t//  Do the following depending on the value of state.\n\t\t\t\t//  For the purpose of this step, \"EOF\" is a special character representing\n\t\t\t\t//  that position is past the end of input.\n\n\t\t\t\t// In descriptor\n\t\t\t\tif (state === \"in descriptor\") {\n\t\t\t\t\t// Do the following, depending on the value of c:\n\n\t\t\t\t\t// Space character\n\t\t\t\t\t// If current descriptor is not empty, append current descriptor to\n\t\t\t\t\t// descriptors and let current descriptor be the empty string.\n\t\t\t\t\t// Set state to after descriptor.\n\t\t\t\t\tif (isSpace(c)) {\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t\tcurrentDescriptor = \"\";\n\t\t\t\t\t\t\tstate = \"after descriptor\";\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// U+002C COMMA (,)\n\t\t\t\t\t\t// Advance position to the next character in input. If current descriptor\n\t\t\t\t\t\t// is not empty, append current descriptor to descriptors. Jump to the step\n\t\t\t\t\t\t// labeled descriptor parser.\n\t\t\t\t\t} else if (c === \",\") {\n\t\t\t\t\t\tpos += 1;\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// U+0028 LEFT PARENTHESIS (()\n\t\t\t\t\t\t// Append c to current descriptor. Set state to in parens.\n\t\t\t\t\t} else if (c === \"\\u0028\") {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t\tstate = \"in parens\";\n\n\t\t\t\t\t\t// EOF\n\t\t\t\t\t\t// If current descriptor is not empty, append current descriptor to\n\t\t\t\t\t\t// descriptors. Jump to the step labeled descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Append c to current descriptor.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t}\n\t\t\t\t\t// (end \"in descriptor\"\n\n\t\t\t\t\t// In parens\n\t\t\t\t} else if (state === \"in parens\") {\n\n\t\t\t\t\t// U+0029 RIGHT PARENTHESIS ())\n\t\t\t\t\t// Append c to current descriptor. Set state to in descriptor.\n\t\t\t\t\tif (c === \")\") {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t\tstate = \"in descriptor\";\n\n\t\t\t\t\t\t// EOF\n\t\t\t\t\t\t// Append current descriptor to descriptors. Jump to the step labeled\n\t\t\t\t\t\t// descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Append c to current descriptor.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t}\n\n\t\t\t\t\t// After descriptor\n\t\t\t\t} else if (state === \"after descriptor\") {\n\n\t\t\t\t\t// Do the following, depending on the value of c:\n\t\t\t\t\t// Space character: Stay in this state.\n\t\t\t\t\tif (isSpace(c)) {\n\n\t\t\t\t\t\t// EOF: Jump to the step labeled descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Set state to in descriptor. Set position to the previous character in input.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstate = \"in descriptor\";\n\t\t\t\t\t\tpos -= 1;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Advance position to the next character in input.\n\t\t\t\tpos += 1;\n\n\t\t\t\t// Repeat this step.\n\t\t\t} // (close while true loop)\n\t\t}\n\n\t\t/**\n\t\t * Adds descriptor properties to a candidate, pushes to the candidates array\n\t\t * @return undefined\n\t\t */\n\t\t// Declared outside of the while loop so that it's only created once.\n\t\tfunction parseDescriptors() {\n\n\t\t\t// 9. Descriptor parser: Let error be no.\n\t\t\tvar pError = false,\n\n\t\t\t\t// 10. Let width be absent.\n\t\t\t\t// 11. Let density be absent.\n\t\t\t\t// 12. Let future-compat-h be absent. (We're implementing it now as h)\n\t\t\t\tw, d, h, i,\n\t\t\t\tcandidate = {},\n\t\t\t\tdesc, lastChar, value, intVal, floatVal;\n\n\t\t\t// 13. For each descriptor in descriptors, run the appropriate set of steps\n\t\t\t// from the following list:\n\t\t\tfor (i = 0 ; i < descriptors.length; i++) {\n\t\t\t\tdesc = descriptors[ i ];\n\n\t\t\t\tlastChar = desc[ desc.length - 1 ];\n\t\t\t\tvalue = desc.substring(0, desc.length - 1);\n\t\t\t\tintVal = parseInt(value, 10);\n\t\t\t\tfloatVal = parseFloat(value);\n\n\t\t\t\t// If the descriptor consists of a valid non-negative integer followed by\n\t\t\t\t// a U+0077 LATIN SMALL LETTER W character\n\t\t\t\tif (regexNonNegativeInteger.test(value) && (lastChar === \"w\")) {\n\n\t\t\t\t\t// If width and density are not both absent, then let error be yes.\n\t\t\t\t\tif (w || d) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing non-negative integers to the descriptor.\n\t\t\t\t\t// If the result is zero, let error be yes.\n\t\t\t\t\t// Otherwise, let width be the result.\n\t\t\t\t\tif (intVal === 0) {pError = true;} else {w = intVal;}\n\n\t\t\t\t\t// If the descriptor consists of a valid floating-point number followed by\n\t\t\t\t\t// a U+0078 LATIN SMALL LETTER X character\n\t\t\t\t} else if (regexFloatingPoint.test(value) && (lastChar === \"x\")) {\n\n\t\t\t\t\t// If width, density and future-compat-h are not all absent, then let error\n\t\t\t\t\t// be yes.\n\t\t\t\t\tif (w || d || h) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing floating-point number values to the descriptor.\n\t\t\t\t\t// If the result is less than zero, let error be yes. Otherwise, let density\n\t\t\t\t\t// be the result.\n\t\t\t\t\tif (floatVal < 0) {pError = true;} else {d = floatVal;}\n\n\t\t\t\t\t// If the descriptor consists of a valid non-negative integer followed by\n\t\t\t\t\t// a U+0068 LATIN SMALL LETTER H character\n\t\t\t\t} else if (regexNonNegativeInteger.test(value) && (lastChar === \"h\")) {\n\n\t\t\t\t\t// If height and density are not both absent, then let error be yes.\n\t\t\t\t\tif (h || d) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing non-negative integers to the descriptor.\n\t\t\t\t\t// If the result is zero, let error be yes. Otherwise, let future-compat-h\n\t\t\t\t\t// be the result.\n\t\t\t\t\tif (intVal === 0) {pError = true;} else {h = intVal;}\n\n\t\t\t\t\t// Anything else, Let error be yes.\n\t\t\t\t} else {pError = true;}\n\t\t\t} // (close step 13 for loop)\n\n\t\t\t// 15. If error is still no, then append a new image source to candidates whose\n\t\t\t// URL is url, associated with a width width if not absent and a pixel\n\t\t\t// density density if not absent. Otherwise, there is a parse error.\n\t\t\tif (!pError) {\n\t\t\t\tcandidate.url = url;\n\t\t\t\tif (w) { candidate.w = w;}\n\t\t\t\tif (d) { candidate.d = d;}\n\t\t\t\tif (h) { candidate.h = h;}\n\t\t\t\tcandidates.push(candidate);\n\t\t\t} else if (console && console.log) {\n\t\t\t\tconsole.log(\"Invalid srcset descriptor found in '\" +\n\t\t\t\t\tinput + \"' at '\" + desc + \"'.\");\n\t\t\t}\n\t\t} // (close parseDescriptors fn)\n\n\t}\n}));\n"],"names":["root","factory","module","this","input","isSpace","c","collectCharacters","regEx","chars","match","pos","inputLength","regexLeadingSpaces","regexLeadingCommasOrSpaces","regexLeadingNotSpaces","regexTrailingCommas","regexNonNegativeInteger","regexFloatingPoint","url","descriptors","currentDescriptor","state","candidates","parseDescriptors","tokenize","pError","w","d","h","i","candidate","desc","lastChar","value","intVal","floatVal"],"mappings":";;;;AAgBA,KAAC,SAAUA,GAAMC,GAAS;AAIlB,MAAkCC,EAAO,UAI/CA,EAAA,UAAiBD,EAAO,IAGxBD,EAAK,cAAcC,EAAO;AAAA,IAE5B,GAAEE,GAAM,WAAY;AAGnB,aAAO,SAAUC,GAAO;AAOvB,iBAASC,EAAQC,GAAG;AACnB,iBAAQA,MAAM;AAAA,UACdA,MAAM;AAAA,UACNA,MAAM;AAAA;AAAA,UACNA,MAAM;AAAA,UACNA,MAAM;AAAA,QACT;AAEE,iBAASC,EAAkBC,GAAO;AACjC,cAAIC,GACHC,IAAQF,EAAM,KAAKJ,EAAM,UAAUO,CAAG,CAAC;AACxC,cAAID;AACH,mBAAAD,IAAQC,EAAO,CAAC,GAChBC,KAAOF,EAAM,QACNA;AAAA,QAEX;AAkCE,iBAhCIG,IAAcR,EAAM,QAGvBS,IAAqB,qBACrBC,IAA6B,sBAC7BC,IAAwB,sBACxBC,IAAsB,SACtBC,IAA0B,SAO1BC,IAAqB,qDAErBC,GACAC,GACAC,GACAC,GACAhB,GAIAK,IAAM,GAGNY,IAAa,CAAA,OAKD;AAIZ,cAHAhB,EAAkBO,CAA0B,GAGxCH,KAAOC;AACV,mBAAOW;AAKR,UAAAJ,IAAMZ,EAAkBQ,CAAqB,GAG7CK,IAAc,CAAA,GAKVD,EAAI,MAAM,EAAE,MAAM,OACrBA,IAAMA,EAAI,QAAQH,GAAqB,EAAE,GAEzCQ,EAAgB,KAIhBC,EAAQ;AAAA,QAIZ;AAME,iBAASA,IAAW;AAWnB,eARAlB,EAAkBM,CAAkB,GAGpCQ,IAAoB,IAGpBC,IAAQ,qBAEK;AAUZ,gBAPAhB,IAAIF,EAAM,OAAOO,CAAG,GAOhBW,MAAU;AAOb,kBAAIjB,EAAQC,CAAC;AACZ,gBAAIe,MACHD,EAAY,KAAKC,CAAiB,GAClCA,IAAoB,IACpBC,IAAQ;AAAA,uBAOChB,MAAM,KAAK;AACrB,gBAAAK,KAAO,GACHU,KACHD,EAAY,KAAKC,CAAiB,GAEnCG,EAAgB;AAChB;AAAA,cAIN,WAAgBlB,MAAM;AAChB,gBAAAe,IAAoBA,IAAoBf,GACxCgB,IAAQ;AAAA,uBAKEhB,MAAM,IAAI;AACpB,gBAAIe,KACHD,EAAY,KAAKC,CAAiB,GAEnCG,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAH,IAAoBA,IAAoBf;AAAA,qBAK/BgB,MAAU;AAIpB,kBAAIhB,MAAM;AACT,gBAAAe,IAAoBA,IAAoBf,GACxCgB,IAAQ;AAAA,uBAKEhB,MAAM,IAAI;AACpB,gBAAAc,EAAY,KAAKC,CAAiB,GAClCG,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAH,IAAoBA,IAAoBf;AAAA,qBAI/BgB,MAAU,sBAIhB,CAAAjB,EAAQC,CAAC;AAGN,kBAAIA,MAAM,IAAI;AACpB,gBAAAkB,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAF,IAAQ,iBACRX,KAAO;AAMT,YAAAA,KAAO;AAAA,UAGX;AAAA,QACA;AAOE,iBAASa,IAAmB;AAG3B,cAAIE,IAAS,IAKZC,GAAGC,GAAGC,GAAGC,GACTC,IAAY,CAAA,GACZC,GAAMC,GAAUC,GAAOC,GAAQC;AAIhC,eAAKN,IAAI,GAAIA,IAAIV,EAAY,QAAQU;AACpC,YAAAE,IAAOZ,EAAaU,CAAC,GAErBG,IAAWD,EAAMA,EAAK,SAAS,CAAC,GAChCE,IAAQF,EAAK,UAAU,GAAGA,EAAK,SAAS,CAAC,GACzCG,IAAS,SAASD,GAAO,EAAE,GAC3BE,IAAW,WAAWF,CAAK,GAIvBjB,EAAwB,KAAKiB,CAAK,KAAMD,MAAa,QAGpDN,KAAKC,OAAIF,IAAS,KAKlBS,MAAW,IAAIT,IAAS,KAAaC,IAAIQ,KAInCjB,EAAmB,KAAKgB,CAAK,KAAMD,MAAa,QAItDN,KAAKC,KAAKC,OAAIH,IAAS,KAKvBU,IAAW,IAAIV,IAAS,KAAaE,IAAIQ,KAInCnB,EAAwB,KAAKiB,CAAK,KAAMD,MAAa,QAG3DJ,KAAKD,OAAIF,IAAS,KAKlBS,MAAW,IAAIT,IAAS,KAAaG,IAAIM,KAGtCT,IAAS;AAMlB,UAAKA,IAMM,WAAW,QAAQ,OAC7B,QAAQ,IAAI,yCACXtB,IAAQ,WAAW4B,IAAO,IAAI,KAP/BD,EAAU,MAAMZ,GACZQ,MAAKI,EAAU,IAAIJ,IACnBC,MAAKG,EAAU,IAAIH,IACnBC,MAAKE,EAAU,IAAIF,IACvBN,EAAW,KAAKQ,CAAS;AAAA,QAK7B;AAAA,MAEA;AAAA,IACA,CAAC;AAAA;;","x_google_ignoreList":[0]}

package/dist/index.es62.js

@@ -1,5 +1,5 @@
 import { j as e } from "./index.es266.js";
-import { clsx as r } from "./index.es267.js";
+import { clsx as r } from "./index.es268.js";
 import './components/ui/CardService/CardService.css';/* empty css            */
 import { Ellipse3 as x } from "./index.es123.js";
 import { Ellipse2 as p } from "./index.es122.js";

package/dist/index.es620.js

@@ -1,72 +1,53 @@
-import { __module as m } from "./index.es672.js";
-var F = m.exports, q;
-function k() {
-  return q ? m.exports : (q = 1, (function(L) {
-    (function(f, c) {
-      L.exports ? L.exports = c() : f.parseSrcset = c();
-    })(F, function() {
-      return function(f) {
-        function c(r) {
-          return r === " " || // space
-          r === "	" || // horizontal tab
-          r === `
-` || // new line
-          r === "\f" || // form feed
-          r === "\r";
-        }
-        function w(r) {
-          var s, i = r.exec(f.substring(u));
-          if (i)
-            return s = i[0], u += s.length, s;
-        }
-        for (var D = f.length, I = /^[ \t\n\r\u000c]+/, N = /^[, \t\n\r\u000c]+/, P = /^[^ \t\n\r\u000c]+/, b = /[,]+$/, _ = /^\d+$/, A = /^-?(?:[0-9]+|[0-9]*\.[0-9]+)(?:[eE][+-]?[0-9]+)?$/, p, a, e, n, t, u = 0, $ = []; ; ) {
-          if (w(N), u >= D)
-            return $;
-          p = w(P), a = [], p.slice(-1) === "," ? (p = p.replace(b, ""), g()) : E();
-        }
-        function E() {
-          for (w(I), e = "", n = "in descriptor"; ; ) {
-            if (t = f.charAt(u), n === "in descriptor")
-              if (c(t))
-                e && (a.push(e), e = "", n = "after descriptor");
-              else if (t === ",") {
-                u += 1, e && a.push(e), g();
-                return;
-              } else if (t === "(")
-                e = e + t, n = "in parens";
-              else if (t === "") {
-                e && a.push(e), g();
-                return;
-              } else
-                e = e + t;
-            else if (n === "in parens")
-              if (t === ")")
-                e = e + t, n = "in descriptor";
-              else if (t === "") {
-                a.push(e), g();
-                return;
-              } else
-                e = e + t;
-            else if (n === "after descriptor" && !c(t))
-              if (t === "") {
-                g();
-                return;
-              } else
-                n = "in descriptor", u -= 1;
-            u += 1;
-          }
-        }
-        function g() {
-          var r = !1, s, i, d, S, h = {}, o, v, l, x, C;
-          for (S = 0; S < a.length; S++)
-            o = a[S], v = o[o.length - 1], l = o.substring(0, o.length - 1), x = parseInt(l, 10), C = parseFloat(l), _.test(l) && v === "w" ? ((s || i) && (r = !0), x === 0 ? r = !0 : s = x) : A.test(l) && v === "x" ? ((s || i || d) && (r = !0), C < 0 ? r = !0 : i = C) : _.test(l) && v === "h" ? ((d || i) && (r = !0), x === 0 ? r = !0 : d = x) : r = !0;
-          r ? console && console.log && console.log("Invalid srcset descriptor found in '" + f + "' at '" + o + "'.") : (h.url = p, s && (h.w = s), i && (h.d = i), d && (h.h = d), $.push(h));
-        }
-      };
-    });
-  })(m), m.exports);
+import { __require as x } from "./index.es673.js";
+import { __require as O } from "./index.es674.js";
+import { __require as W } from "./index.es675.js";
+import { __require as E } from "./index.es676.js";
+import { __require as I } from "./index.es677.js";
+import { __require as J } from "./index.es678.js";
+import { __require as z } from "./index.es679.js";
+import { __require as G } from "./index.es680.js";
+import { __require as b } from "./index.es681.js";
+import { __require as j } from "./index.es682.js";
+import { __require as F } from "./index.es683.js";
+import { __require as M } from "./index.es684.js";
+import { __require as V } from "./index.es685.js";
+import { __require as k } from "./index.es686.js";
+import { __require as B } from "./index.es687.js";
+import { __require as H } from "./index.es688.js";
+import { __require as K } from "./index.es689.js";
+import { __require as Q } from "./index.es690.js";
+var a, w;
+function pr() {
+  if (w) return a;
+  w = 1;
+  let m = x(), l = O(), R = W(), g = E(), c = I(), p = J(), d = z(), y = G(), P = b(), C = j(), h = F(), N = M(), i = V(), A = k(), q = B(), _ = H(), S = K(), v = Q();
+  function r(...e) {
+    return e.length === 1 && Array.isArray(e[0]) && (e = e[0]), new i(e);
+  }
+  return r.plugin = function(s, D) {
+    let f = !1;
+    function t(...u) {
+      console && console.warn && !f && (f = !0, console.warn(
+        s + `: postcss.plugin was deprecated. Migration guide:
+https://evilmartians.com/chronicles/postcss-8-plugin-migration`
+      ), process.env.LANG && process.env.LANG.startsWith("cn") && console.warn(
+        s + `: 里面 postcss.plugin 被弃用. 迁移指南:
+https://www.w3ctech.com/topic/2226`
+      ));
+      let o = D(...u);
+      return o.postcssPlugin = s, o.postcssVersion = new i().version, o;
+    }
+    let n;
+    return Object.defineProperty(t, "postcss", {
+      get() {
+        return n || (n = t()), n;
+      }
+    }), t.process = function(u, o, L) {
+      return r([t(L)]).process(u, o);
+    }, t;
+  }, r.stringify = S, r.parse = N, r.fromJSON = d, r.list = C, r.comment = (e) => new l(e), r.atRule = (e) => new m(e), r.decl = (e) => new c(e), r.rule = (e) => new _(e), r.root = (e) => new q(e), r.document = (e) => new p(e), r.CssSyntaxError = g, r.Declaration = c, r.Container = R, r.Processor = i, r.Document = p, r.Comment = l, r.Warning = v, r.AtRule = m, r.Result = A, r.Input = y, r.Rule = _, r.Root = q, r.Node = h, P.registerPostcss(r), a = r, r.default = r, a;
 }
 export {
-  k as __require
+  pr as __require
 };
 //# sourceMappingURL=index.es620.js.map

package/dist/index.es620.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es620.js","sources":["../node_modules/parse-srcset/src/parse-srcset.js"],"sourcesContent":["/**\n * Srcset Parser\n *\n * By Alex Bell |  MIT License\n *\n * JS Parser for the string value that appears in markup <img srcset=\"here\">\n *\n * @returns Array [{url: _, d: _, w: _, h:_}, ...]\n *\n * Based super duper closely on the reference algorithm at:\n * https://html.spec.whatwg.org/multipage/embedded-content.html#parse-a-srcset-attribute\n *\n * Most comments are copied in directly from the spec\n * (except for comments in parens).\n */\n\n(function (root, factory) {\n\tif (typeof define === 'function' && define.amd) {\n\t\t// AMD. Register as an anonymous module.\n\t\tdefine([], factory);\n\t} else if (typeof module === 'object' && module.exports) {\n\t\t// Node. Does not work with strict CommonJS, but\n\t\t// only CommonJS-like environments that support module.exports,\n\t\t// like Node.\n\t\tmodule.exports = factory();\n\t} else {\n\t\t// Browser globals (root is window)\n\t\troot.parseSrcset = factory();\n\t}\n}(this, function () {\n\n\t// 1. Let input be the value passed to this algorithm.\n\treturn function (input) {\n\n\t\t// UTILITY FUNCTIONS\n\n\t\t// Manual is faster than RegEx\n\t\t// http://bjorn.tipling.com/state-and-regular-expressions-in-javascript\n\t\t// http://jsperf.com/whitespace-character/5\n\t\tfunction isSpace(c) {\n\t\t\treturn (c === \"\\u0020\" || // space\n\t\t\tc === \"\\u0009\" || // horizontal tab\n\t\t\tc === \"\\u000A\" || // new line\n\t\t\tc === \"\\u000C\" || // form feed\n\t\t\tc === \"\\u000D\");  // carriage return\n\t\t}\n\n\t\tfunction collectCharacters(regEx) {\n\t\t\tvar chars,\n\t\t\t\tmatch = regEx.exec(input.substring(pos));\n\t\t\tif (match) {\n\t\t\t\tchars = match[ 0 ];\n\t\t\t\tpos += chars.length;\n\t\t\t\treturn chars;\n\t\t\t}\n\t\t}\n\n\t\tvar inputLength = input.length,\n\n\t\t\t// (Don't use \\s, to avoid matching non-breaking space)\n\t\t\tregexLeadingSpaces = /^[ \\t\\n\\r\\u000c]+/,\n\t\t\tregexLeadingCommasOrSpaces = /^[, \\t\\n\\r\\u000c]+/,\n\t\t\tregexLeadingNotSpaces = /^[^ \\t\\n\\r\\u000c]+/,\n\t\t\tregexTrailingCommas = /[,]+$/,\n\t\t\tregexNonNegativeInteger = /^\\d+$/,\n\n\t\t\t// ( Positive or negative or unsigned integers or decimals, without or without exponents.\n\t\t\t// Must include at least one digit.\n\t\t\t// According to spec tests any decimal point must be followed by a digit.\n\t\t\t// No leading plus sign is allowed.)\n\t\t\t// https://html.spec.whatwg.org/multipage/infrastructure.html#valid-floating-point-number\n\t\t\tregexFloatingPoint = /^-?(?:[0-9]+|[0-9]*\\.[0-9]+)(?:[eE][+-]?[0-9]+)?$/,\n\n\t\t\turl,\n\t\t\tdescriptors,\n\t\t\tcurrentDescriptor,\n\t\t\tstate,\n\t\t\tc,\n\n\t\t\t// 2. Let position be a pointer into input, initially pointing at the start\n\t\t\t//    of the string.\n\t\t\tpos = 0,\n\n\t\t\t// 3. Let candidates be an initially empty source set.\n\t\t\tcandidates = [];\n\n\t\t// 4. Splitting loop: Collect a sequence of characters that are space\n\t\t//    characters or U+002C COMMA characters. If any U+002C COMMA characters\n\t\t//    were collected, that is a parse error.\n\t\twhile (true) {\n\t\t\tcollectCharacters(regexLeadingCommasOrSpaces);\n\n\t\t\t// 5. If position is past the end of input, return candidates and abort these steps.\n\t\t\tif (pos >= inputLength) {\n\t\t\t\treturn candidates; // (we're done, this is the sole return path)\n\t\t\t}\n\n\t\t\t// 6. Collect a sequence of characters that are not space characters,\n\t\t\t//    and let that be url.\n\t\t\turl = collectCharacters(regexLeadingNotSpaces);\n\n\t\t\t// 7. Let descriptors be a new empty list.\n\t\t\tdescriptors = [];\n\n\t\t\t// 8. If url ends with a U+002C COMMA character (,), follow these substeps:\n\t\t\t//\t\t(1). Remove all trailing U+002C COMMA characters from url. If this removed\n\t\t\t//         more than one character, that is a parse error.\n\t\t\tif (url.slice(-1) === \",\") {\n\t\t\t\turl = url.replace(regexTrailingCommas, \"\");\n\t\t\t\t// (Jump ahead to step 9 to skip tokenization and just push the candidate).\n\t\t\t\tparseDescriptors();\n\n\t\t\t\t//\tOtherwise, follow these substeps:\n\t\t\t} else {\n\t\t\t\ttokenize();\n\t\t\t} // (close else of step 8)\n\n\t\t\t// 16. Return to the step labeled splitting loop.\n\t\t} // (Close of big while loop.)\n\n\t\t/**\n\t\t * Tokenizes descriptor properties prior to parsing\n\t\t * Returns undefined.\n\t\t */\n\t\tfunction tokenize() {\n\n\t\t\t// 8.1. Descriptor tokeniser: Skip whitespace\n\t\t\tcollectCharacters(regexLeadingSpaces);\n\n\t\t\t// 8.2. Let current descriptor be the empty string.\n\t\t\tcurrentDescriptor = \"\";\n\n\t\t\t// 8.3. Let state be in descriptor.\n\t\t\tstate = \"in descriptor\";\n\n\t\t\twhile (true) {\n\n\t\t\t\t// 8.4. Let c be the character at position.\n\t\t\t\tc = input.charAt(pos);\n\n\t\t\t\t//  Do the following depending on the value of state.\n\t\t\t\t//  For the purpose of this step, \"EOF\" is a special character representing\n\t\t\t\t//  that position is past the end of input.\n\n\t\t\t\t// In descriptor\n\t\t\t\tif (state === \"in descriptor\") {\n\t\t\t\t\t// Do the following, depending on the value of c:\n\n\t\t\t\t\t// Space character\n\t\t\t\t\t// If current descriptor is not empty, append current descriptor to\n\t\t\t\t\t// descriptors and let current descriptor be the empty string.\n\t\t\t\t\t// Set state to after descriptor.\n\t\t\t\t\tif (isSpace(c)) {\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t\tcurrentDescriptor = \"\";\n\t\t\t\t\t\t\tstate = \"after descriptor\";\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// U+002C COMMA (,)\n\t\t\t\t\t\t// Advance position to the next character in input. If current descriptor\n\t\t\t\t\t\t// is not empty, append current descriptor to descriptors. Jump to the step\n\t\t\t\t\t\t// labeled descriptor parser.\n\t\t\t\t\t} else if (c === \",\") {\n\t\t\t\t\t\tpos += 1;\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// U+0028 LEFT PARENTHESIS (()\n\t\t\t\t\t\t// Append c to current descriptor. Set state to in parens.\n\t\t\t\t\t} else if (c === \"\\u0028\") {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t\tstate = \"in parens\";\n\n\t\t\t\t\t\t// EOF\n\t\t\t\t\t\t// If current descriptor is not empty, append current descriptor to\n\t\t\t\t\t\t// descriptors. Jump to the step labeled descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tif (currentDescriptor) {\n\t\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Append c to current descriptor.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t}\n\t\t\t\t\t// (end \"in descriptor\"\n\n\t\t\t\t\t// In parens\n\t\t\t\t} else if (state === \"in parens\") {\n\n\t\t\t\t\t// U+0029 RIGHT PARENTHESIS ())\n\t\t\t\t\t// Append c to current descriptor. Set state to in descriptor.\n\t\t\t\t\tif (c === \")\") {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t\tstate = \"in descriptor\";\n\n\t\t\t\t\t\t// EOF\n\t\t\t\t\t\t// Append current descriptor to descriptors. Jump to the step labeled\n\t\t\t\t\t\t// descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tdescriptors.push(currentDescriptor);\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Append c to current descriptor.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurrentDescriptor = currentDescriptor + c;\n\t\t\t\t\t}\n\n\t\t\t\t\t// After descriptor\n\t\t\t\t} else if (state === \"after descriptor\") {\n\n\t\t\t\t\t// Do the following, depending on the value of c:\n\t\t\t\t\t// Space character: Stay in this state.\n\t\t\t\t\tif (isSpace(c)) {\n\n\t\t\t\t\t\t// EOF: Jump to the step labeled descriptor parser.\n\t\t\t\t\t} else if (c === \"\") {\n\t\t\t\t\t\tparseDescriptors();\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t// Anything else\n\t\t\t\t\t\t// Set state to in descriptor. Set position to the previous character in input.\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstate = \"in descriptor\";\n\t\t\t\t\t\tpos -= 1;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Advance position to the next character in input.\n\t\t\t\tpos += 1;\n\n\t\t\t\t// Repeat this step.\n\t\t\t} // (close while true loop)\n\t\t}\n\n\t\t/**\n\t\t * Adds descriptor properties to a candidate, pushes to the candidates array\n\t\t * @return undefined\n\t\t */\n\t\t// Declared outside of the while loop so that it's only created once.\n\t\tfunction parseDescriptors() {\n\n\t\t\t// 9. Descriptor parser: Let error be no.\n\t\t\tvar pError = false,\n\n\t\t\t\t// 10. Let width be absent.\n\t\t\t\t// 11. Let density be absent.\n\t\t\t\t// 12. Let future-compat-h be absent. (We're implementing it now as h)\n\t\t\t\tw, d, h, i,\n\t\t\t\tcandidate = {},\n\t\t\t\tdesc, lastChar, value, intVal, floatVal;\n\n\t\t\t// 13. For each descriptor in descriptors, run the appropriate set of steps\n\t\t\t// from the following list:\n\t\t\tfor (i = 0 ; i < descriptors.length; i++) {\n\t\t\t\tdesc = descriptors[ i ];\n\n\t\t\t\tlastChar = desc[ desc.length - 1 ];\n\t\t\t\tvalue = desc.substring(0, desc.length - 1);\n\t\t\t\tintVal = parseInt(value, 10);\n\t\t\t\tfloatVal = parseFloat(value);\n\n\t\t\t\t// If the descriptor consists of a valid non-negative integer followed by\n\t\t\t\t// a U+0077 LATIN SMALL LETTER W character\n\t\t\t\tif (regexNonNegativeInteger.test(value) && (lastChar === \"w\")) {\n\n\t\t\t\t\t// If width and density are not both absent, then let error be yes.\n\t\t\t\t\tif (w || d) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing non-negative integers to the descriptor.\n\t\t\t\t\t// If the result is zero, let error be yes.\n\t\t\t\t\t// Otherwise, let width be the result.\n\t\t\t\t\tif (intVal === 0) {pError = true;} else {w = intVal;}\n\n\t\t\t\t\t// If the descriptor consists of a valid floating-point number followed by\n\t\t\t\t\t// a U+0078 LATIN SMALL LETTER X character\n\t\t\t\t} else if (regexFloatingPoint.test(value) && (lastChar === \"x\")) {\n\n\t\t\t\t\t// If width, density and future-compat-h are not all absent, then let error\n\t\t\t\t\t// be yes.\n\t\t\t\t\tif (w || d || h) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing floating-point number values to the descriptor.\n\t\t\t\t\t// If the result is less than zero, let error be yes. Otherwise, let density\n\t\t\t\t\t// be the result.\n\t\t\t\t\tif (floatVal < 0) {pError = true;} else {d = floatVal;}\n\n\t\t\t\t\t// If the descriptor consists of a valid non-negative integer followed by\n\t\t\t\t\t// a U+0068 LATIN SMALL LETTER H character\n\t\t\t\t} else if (regexNonNegativeInteger.test(value) && (lastChar === \"h\")) {\n\n\t\t\t\t\t// If height and density are not both absent, then let error be yes.\n\t\t\t\t\tif (h || d) {pError = true;}\n\n\t\t\t\t\t// Apply the rules for parsing non-negative integers to the descriptor.\n\t\t\t\t\t// If the result is zero, let error be yes. Otherwise, let future-compat-h\n\t\t\t\t\t// be the result.\n\t\t\t\t\tif (intVal === 0) {pError = true;} else {h = intVal;}\n\n\t\t\t\t\t// Anything else, Let error be yes.\n\t\t\t\t} else {pError = true;}\n\t\t\t} // (close step 13 for loop)\n\n\t\t\t// 15. If error is still no, then append a new image source to candidates whose\n\t\t\t// URL is url, associated with a width width if not absent and a pixel\n\t\t\t// density density if not absent. Otherwise, there is a parse error.\n\t\t\tif (!pError) {\n\t\t\t\tcandidate.url = url;\n\t\t\t\tif (w) { candidate.w = w;}\n\t\t\t\tif (d) { candidate.d = d;}\n\t\t\t\tif (h) { candidate.h = h;}\n\t\t\t\tcandidates.push(candidate);\n\t\t\t} else if (console && console.log) {\n\t\t\t\tconsole.log(\"Invalid srcset descriptor found in '\" +\n\t\t\t\t\tinput + \"' at '\" + desc + \"'.\");\n\t\t\t}\n\t\t} // (close parseDescriptors fn)\n\n\t}\n}));\n"],"names":["root","factory","module","this","input","isSpace","c","collectCharacters","regEx","chars","match","pos","inputLength","regexLeadingSpaces","regexLeadingCommasOrSpaces","regexLeadingNotSpaces","regexTrailingCommas","regexNonNegativeInteger","regexFloatingPoint","url","descriptors","currentDescriptor","state","candidates","parseDescriptors","tokenize","pError","w","d","h","i","candidate","desc","lastChar","value","intVal","floatVal"],"mappings":";;;;AAgBA,KAAC,SAAUA,GAAMC,GAAS;AAIlB,MAAkCC,EAAO,UAI/CA,EAAA,UAAiBD,EAAO,IAGxBD,EAAK,cAAcC,EAAO;AAAA,IAE5B,GAAEE,GAAM,WAAY;AAGnB,aAAO,SAAUC,GAAO;AAOvB,iBAASC,EAAQC,GAAG;AACnB,iBAAQA,MAAM;AAAA,UACdA,MAAM;AAAA,UACNA,MAAM;AAAA;AAAA,UACNA,MAAM;AAAA,UACNA,MAAM;AAAA,QACT;AAEE,iBAASC,EAAkBC,GAAO;AACjC,cAAIC,GACHC,IAAQF,EAAM,KAAKJ,EAAM,UAAUO,CAAG,CAAC;AACxC,cAAID;AACH,mBAAAD,IAAQC,EAAO,CAAC,GAChBC,KAAOF,EAAM,QACNA;AAAA,QAEX;AAkCE,iBAhCIG,IAAcR,EAAM,QAGvBS,IAAqB,qBACrBC,IAA6B,sBAC7BC,IAAwB,sBACxBC,IAAsB,SACtBC,IAA0B,SAO1BC,IAAqB,qDAErBC,GACAC,GACAC,GACAC,GACAhB,GAIAK,IAAM,GAGNY,IAAa,CAAA,OAKD;AAIZ,cAHAhB,EAAkBO,CAA0B,GAGxCH,KAAOC;AACV,mBAAOW;AAKR,UAAAJ,IAAMZ,EAAkBQ,CAAqB,GAG7CK,IAAc,CAAA,GAKVD,EAAI,MAAM,EAAE,MAAM,OACrBA,IAAMA,EAAI,QAAQH,GAAqB,EAAE,GAEzCQ,EAAgB,KAIhBC,EAAQ;AAAA,QAIZ;AAME,iBAASA,IAAW;AAWnB,eARAlB,EAAkBM,CAAkB,GAGpCQ,IAAoB,IAGpBC,IAAQ,qBAEK;AAUZ,gBAPAhB,IAAIF,EAAM,OAAOO,CAAG,GAOhBW,MAAU;AAOb,kBAAIjB,EAAQC,CAAC;AACZ,gBAAIe,MACHD,EAAY,KAAKC,CAAiB,GAClCA,IAAoB,IACpBC,IAAQ;AAAA,uBAOChB,MAAM,KAAK;AACrB,gBAAAK,KAAO,GACHU,KACHD,EAAY,KAAKC,CAAiB,GAEnCG,EAAgB;AAChB;AAAA,cAIN,WAAgBlB,MAAM;AAChB,gBAAAe,IAAoBA,IAAoBf,GACxCgB,IAAQ;AAAA,uBAKEhB,MAAM,IAAI;AACpB,gBAAIe,KACHD,EAAY,KAAKC,CAAiB,GAEnCG,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAH,IAAoBA,IAAoBf;AAAA,qBAK/BgB,MAAU;AAIpB,kBAAIhB,MAAM;AACT,gBAAAe,IAAoBA,IAAoBf,GACxCgB,IAAQ;AAAA,uBAKEhB,MAAM,IAAI;AACpB,gBAAAc,EAAY,KAAKC,CAAiB,GAClCG,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAH,IAAoBA,IAAoBf;AAAA,qBAI/BgB,MAAU,sBAIhB,CAAAjB,EAAQC,CAAC;AAGN,kBAAIA,MAAM,IAAI;AACpB,gBAAAkB,EAAgB;AAChB;AAAA,cAIN;AACM,gBAAAF,IAAQ,iBACRX,KAAO;AAMT,YAAAA,KAAO;AAAA,UAGX;AAAA,QACA;AAOE,iBAASa,IAAmB;AAG3B,cAAIE,IAAS,IAKZC,GAAGC,GAAGC,GAAGC,GACTC,IAAY,CAAA,GACZC,GAAMC,GAAUC,GAAOC,GAAQC;AAIhC,eAAKN,IAAI,GAAIA,IAAIV,EAAY,QAAQU;AACpC,YAAAE,IAAOZ,EAAaU,CAAC,GAErBG,IAAWD,EAAMA,EAAK,SAAS,CAAC,GAChCE,IAAQF,EAAK,UAAU,GAAGA,EAAK,SAAS,CAAC,GACzCG,IAAS,SAASD,GAAO,EAAE,GAC3BE,IAAW,WAAWF,CAAK,GAIvBjB,EAAwB,KAAKiB,CAAK,KAAMD,MAAa,QAGpDN,KAAKC,OAAIF,IAAS,KAKlBS,MAAW,IAAIT,IAAS,KAAaC,IAAIQ,KAInCjB,EAAmB,KAAKgB,CAAK,KAAMD,MAAa,QAItDN,KAAKC,KAAKC,OAAIH,IAAS,KAKvBU,IAAW,IAAIV,IAAS,KAAaE,IAAIQ,KAInCnB,EAAwB,KAAKiB,CAAK,KAAMD,MAAa,QAG3DJ,KAAKD,OAAIF,IAAS,KAKlBS,MAAW,IAAIT,IAAS,KAAaG,IAAIM,KAGtCT,IAAS;AAMlB,UAAKA,IAMM,WAAW,QAAQ,OAC7B,QAAQ,IAAI,yCACXtB,IAAQ,WAAW4B,IAAO,IAAI,KAP/BD,EAAU,MAAMZ,GACZQ,MAAKI,EAAU,IAAIJ,IACnBC,MAAKG,EAAU,IAAIH,IACnBC,MAAKE,EAAU,IAAIF,IACvBN,EAAW,KAAKQ,CAAS;AAAA,QAK7B;AAAA,MAEA;AAAA,IACA,CAAC;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es620.js","sources":["../node_modules/postcss/lib/postcss.js"],"sourcesContent":["'use strict'\n\nlet AtRule = require('./at-rule')\nlet Comment = require('./comment')\nlet Container = require('./container')\nlet CssSyntaxError = require('./css-syntax-error')\nlet Declaration = require('./declaration')\nlet Document = require('./document')\nlet fromJSON = require('./fromJSON')\nlet Input = require('./input')\nlet LazyResult = require('./lazy-result')\nlet list = require('./list')\nlet Node = require('./node')\nlet parse = require('./parse')\nlet Processor = require('./processor')\nlet Result = require('./result.js')\nlet Root = require('./root')\nlet Rule = require('./rule')\nlet stringify = require('./stringify')\nlet Warning = require('./warning')\n\nfunction postcss(...plugins) {\n  if (plugins.length === 1 && Array.isArray(plugins[0])) {\n    plugins = plugins[0]\n  }\n  return new Processor(plugins)\n}\n\npostcss.plugin = function plugin(name, initializer) {\n  let warningPrinted = false\n  function creator(...args) {\n    // eslint-disable-next-line no-console\n    if (console && console.warn && !warningPrinted) {\n      warningPrinted = true\n      // eslint-disable-next-line no-console\n      console.warn(\n        name +\n          ': postcss.plugin was deprecated. Migration guide:\\n' +\n          'https://evilmartians.com/chronicles/postcss-8-plugin-migration'\n      )\n      if (process.env.LANG && process.env.LANG.startsWith('cn')) {\n        /* c8 ignore next 7 */\n        // eslint-disable-next-line no-console\n        console.warn(\n          name +\n            ': 里面 postcss.plugin 被弃用. 迁移指南:\\n' +\n            'https://www.w3ctech.com/topic/2226'\n        )\n      }\n    }\n    let transformer = initializer(...args)\n    transformer.postcssPlugin = name\n    transformer.postcssVersion = new Processor().version\n    return transformer\n  }\n\n  let cache\n  Object.defineProperty(creator, 'postcss', {\n    get() {\n      if (!cache) cache = creator()\n      return cache\n    }\n  })\n\n  creator.process = function (css, processOpts, pluginOpts) {\n    return postcss([creator(pluginOpts)]).process(css, processOpts)\n  }\n\n  return creator\n}\n\npostcss.stringify = stringify\npostcss.parse = parse\npostcss.fromJSON = fromJSON\npostcss.list = list\n\npostcss.comment = defaults => new Comment(defaults)\npostcss.atRule = defaults => new AtRule(defaults)\npostcss.decl = defaults => new Declaration(defaults)\npostcss.rule = defaults => new Rule(defaults)\npostcss.root = defaults => new Root(defaults)\npostcss.document = defaults => new Document(defaults)\n\npostcss.CssSyntaxError = CssSyntaxError\npostcss.Declaration = Declaration\npostcss.Container = Container\npostcss.Processor = Processor\npostcss.Document = Document\npostcss.Comment = Comment\npostcss.Warning = Warning\npostcss.AtRule = AtRule\npostcss.Result = Result\npostcss.Input = Input\npostcss.Rule = Rule\npostcss.Root = Root\npostcss.Node = Node\n\nLazyResult.registerPostcss(postcss)\n\nmodule.exports = postcss\npostcss.default = postcss\n"],"names":["AtRule","require$$0","Comment","require$$1","Container","require$$2","CssSyntaxError","require$$3","Declaration","require$$4","Document","require$$5","fromJSON","require$$6","Input","require$$7","LazyResult","require$$8","list","require$$9","Node","require$$10","parse","require$$11","Processor","require$$12","Result","require$$13","Root","require$$14","Rule","require$$15","stringify","require$$16","Warning","require$$17","postcss","plugins","name","initializer","warningPrinted","creator","args","transformer","cache","css","processOpts","pluginOpts","defaults","postcss_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAEA,MAAIA,IAASC,EAAA,GACTC,IAAUC,EAAA,GACVC,IAAYC,EAAA,GACZC,IAAiBC,EAAA,GACjBC,IAAcC,EAAA,GACdC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAQC,EAAA,GACRC,IAAaC,EAAA,GACbC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAQC,EAAA,GACRC,IAAYC,EAAA,GACZC,IAASC,EAAA,GACTC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAYC,EAAA,GACZC,IAAUC,EAAA;AAEd,WAASC,KAAWC,GAAS;AAC3B,WAAIA,EAAQ,WAAW,KAAK,MAAM,QAAQA,EAAQ,CAAC,CAAC,MAClDA,IAAUA,EAAQ,CAAC,IAEd,IAAIb,EAAUa,CAAO;AAAA,EAC9B;AAEA,SAAAD,EAAQ,SAAS,SAAgBE,GAAMC,GAAa;AAClD,QAAIC,IAAiB;AACrB,aAASC,KAAWC,GAAM;AAExB,MAAI,WAAW,QAAQ,QAAQ,CAACF,MAC9BA,IAAiB,IAEjB,QAAQ;AAAA,QACNF,IACE;AAAA;AAAA,MAEV,GACU,QAAQ,IAAI,QAAQ,QAAQ,IAAI,KAAK,WAAW,IAAI,KAGtD,QAAQ;AAAA,QACNA,IACE;AAAA;AAAA,MAEZ;AAGI,UAAIK,IAAcJ,EAAY,GAAGG,CAAI;AACrC,aAAAC,EAAY,gBAAgBL,GAC5BK,EAAY,iBAAiB,IAAInB,IAAY,SACtCmB;AAAA,IACX;AAEE,QAAIC;AACJ,kBAAO,eAAeH,GAAS,WAAW;AAAA,MACxC,MAAM;AACJ,eAAKG,MAAOA,IAAQH,EAAO,IACpBG;AAAA,MACb;AAAA,KACG,GAEDH,EAAQ,UAAU,SAAUI,GAAKC,GAAaC,GAAY;AACxD,aAAOX,EAAQ,CAACK,EAAQM,CAAU,CAAC,CAAC,EAAE,QAAQF,GAAKC,CAAW;AAAA,IAClE,GAESL;AAAA,EACT,GAEAL,EAAQ,YAAYJ,GACpBI,EAAQ,QAAQd,GAChBc,EAAQ,WAAWxB,GACnBwB,EAAQ,OAAOlB,GAEfkB,EAAQ,UAAU,CAAAY,MAAY,IAAI9C,EAAQ8C,CAAQ,GAClDZ,EAAQ,SAAS,CAAAY,MAAY,IAAIhD,EAAOgD,CAAQ,GAChDZ,EAAQ,OAAO,CAAAY,MAAY,IAAIxC,EAAYwC,CAAQ,GACnDZ,EAAQ,OAAO,CAAAY,MAAY,IAAIlB,EAAKkB,CAAQ,GAC5CZ,EAAQ,OAAO,CAAAY,MAAY,IAAIpB,EAAKoB,CAAQ,GAC5CZ,EAAQ,WAAW,CAAAY,MAAY,IAAItC,EAASsC,CAAQ,GAEpDZ,EAAQ,iBAAiB9B,GACzB8B,EAAQ,cAAc5B,GACtB4B,EAAQ,YAAYhC,GACpBgC,EAAQ,YAAYZ,GACpBY,EAAQ,WAAW1B,GACnB0B,EAAQ,UAAUlC,GAClBkC,EAAQ,UAAUF,GAClBE,EAAQ,SAASpC,GACjBoC,EAAQ,SAASV,GACjBU,EAAQ,QAAQtB,GAChBsB,EAAQ,OAAON,GACfM,EAAQ,OAAOR,GACfQ,EAAQ,OAAOhB,GAEfJ,EAAW,gBAAgBoB,CAAO,GAElCa,IAAiBb,GACjBA,EAAQ,UAAUA;;","x_google_ignoreList":[0]}

package/dist/index.es622.js

@@ -1,49 +1,5 @@
-import r from "react";
-import { createContextScope as y } from "./index.es513.js";
-import { useComposedRefs as S } from "./index.es514.js";
-import { createSlot as M } from "./index.es516.js";
-import { j as d } from "./index.es266.js";
-function D(s) {
-  const m = s + "CollectionProvider", [A, E] = y(m), [N, f] = A(
-    m,
-    { collectionRef: { current: null }, itemMap: /* @__PURE__ */ new Map() }
-  ), p = (c) => {
-    const { scope: e, children: l } = c, o = r.useRef(null), t = r.useRef(/* @__PURE__ */ new Map()).current;
-    return /* @__PURE__ */ d.jsx(N, { scope: e, itemMap: t, collectionRef: o, children: l });
-  };
-  p.displayName = m;
-  const a = s + "CollectionSlot", _ = M(a), C = r.forwardRef(
-    (c, e) => {
-      const { scope: l, children: o } = c, t = f(a, l), n = S(e, t.collectionRef);
-      return /* @__PURE__ */ d.jsx(_, { ref: n, children: o });
-    }
-  );
-  C.displayName = a;
-  const u = s + "CollectionItemSlot", R = "data-radix-collection-item", T = M(u), x = r.forwardRef(
-    (c, e) => {
-      const { scope: l, children: o, ...t } = c, n = r.useRef(null), I = S(e, n), i = f(u, l);
-      return r.useEffect(() => (i.itemMap.set(n, { ref: n, ...t }), () => void i.itemMap.delete(n))), /* @__PURE__ */ d.jsx(T, { [R]: "", ref: I, children: o });
-    }
-  );
-  x.displayName = u;
-  function O(c) {
-    const e = f(s + "CollectionConsumer", c);
-    return r.useCallback(() => {
-      const o = e.collectionRef.current;
-      if (!o) return [];
-      const t = Array.from(o.querySelectorAll(`[${R}]`));
-      return Array.from(e.itemMap.values()).sort(
-        (i, v) => t.indexOf(i.ref.current) - t.indexOf(v.ref.current)
-      );
-    }, [e.collectionRef, e.itemMap]);
-  }
-  return [
-    { Provider: p, Slot: C, ItemSlot: x },
-    O,
-    E
-  ];
-}
+var o = {};
 export {
-  D as createCollection
+  o as __exports
 };
 //# sourceMappingURL=index.es622.js.map

package/dist/index.es622.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es622.js","sources":["../node_modules/@radix-ui/react-collection/dist/index.mjs"],"sourcesContent":["\"use client\";\n\n// src/collection-legacy.tsx\nimport React from \"react\";\nimport { createContextScope } from \"@radix-ui/react-context\";\nimport { useComposedRefs } from \"@radix-ui/react-compose-refs\";\nimport { createSlot } from \"@radix-ui/react-slot\";\nimport { jsx } from \"react/jsx-runtime\";\nfunction createCollection(name) {\n  const PROVIDER_NAME = name + \"CollectionProvider\";\n  const [createCollectionContext, createCollectionScope] = createContextScope(PROVIDER_NAME);\n  const [CollectionProviderImpl, useCollectionContext] = createCollectionContext(\n    PROVIDER_NAME,\n    { collectionRef: { current: null }, itemMap: /* @__PURE__ */ new Map() }\n  );\n  const CollectionProvider = (props) => {\n    const { scope, children } = props;\n    const ref = React.useRef(null);\n    const itemMap = React.useRef(/* @__PURE__ */ new Map()).current;\n    return /* @__PURE__ */ jsx(CollectionProviderImpl, { scope, itemMap, collectionRef: ref, children });\n  };\n  CollectionProvider.displayName = PROVIDER_NAME;\n  const COLLECTION_SLOT_NAME = name + \"CollectionSlot\";\n  const CollectionSlotImpl = createSlot(COLLECTION_SLOT_NAME);\n  const CollectionSlot = React.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children } = props;\n      const context = useCollectionContext(COLLECTION_SLOT_NAME, scope);\n      const composedRefs = useComposedRefs(forwardedRef, context.collectionRef);\n      return /* @__PURE__ */ jsx(CollectionSlotImpl, { ref: composedRefs, children });\n    }\n  );\n  CollectionSlot.displayName = COLLECTION_SLOT_NAME;\n  const ITEM_SLOT_NAME = name + \"CollectionItemSlot\";\n  const ITEM_DATA_ATTR = \"data-radix-collection-item\";\n  const CollectionItemSlotImpl = createSlot(ITEM_SLOT_NAME);\n  const CollectionItemSlot = React.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children, ...itemData } = props;\n      const ref = React.useRef(null);\n      const composedRefs = useComposedRefs(forwardedRef, ref);\n      const context = useCollectionContext(ITEM_SLOT_NAME, scope);\n      React.useEffect(() => {\n        context.itemMap.set(ref, { ref, ...itemData });\n        return () => void context.itemMap.delete(ref);\n      });\n      return /* @__PURE__ */ jsx(CollectionItemSlotImpl, { ...{ [ITEM_DATA_ATTR]: \"\" }, ref: composedRefs, children });\n    }\n  );\n  CollectionItemSlot.displayName = ITEM_SLOT_NAME;\n  function useCollection(scope) {\n    const context = useCollectionContext(name + \"CollectionConsumer\", scope);\n    const getItems = React.useCallback(() => {\n      const collectionNode = context.collectionRef.current;\n      if (!collectionNode) return [];\n      const orderedNodes = Array.from(collectionNode.querySelectorAll(`[${ITEM_DATA_ATTR}]`));\n      const items = Array.from(context.itemMap.values());\n      const orderedItems = items.sort(\n        (a, b) => orderedNodes.indexOf(a.ref.current) - orderedNodes.indexOf(b.ref.current)\n      );\n      return orderedItems;\n    }, [context.collectionRef, context.itemMap]);\n    return getItems;\n  }\n  return [\n    { Provider: CollectionProvider, Slot: CollectionSlot, ItemSlot: CollectionItemSlot },\n    useCollection,\n    createCollectionScope\n  ];\n}\n\n// src/collection.tsx\nimport React2 from \"react\";\nimport { createContextScope as createContextScope2 } from \"@radix-ui/react-context\";\nimport { useComposedRefs as useComposedRefs2 } from \"@radix-ui/react-compose-refs\";\nimport { createSlot as createSlot2 } from \"@radix-ui/react-slot\";\n\n// src/ordered-dictionary.ts\nvar __instanciated = /* @__PURE__ */ new WeakMap();\nvar OrderedDict = class _OrderedDict extends Map {\n  #keys;\n  constructor(entries) {\n    super(entries);\n    this.#keys = [...super.keys()];\n    __instanciated.set(this, true);\n  }\n  set(key, value) {\n    if (__instanciated.get(this)) {\n      if (this.has(key)) {\n        this.#keys[this.#keys.indexOf(key)] = key;\n      } else {\n        this.#keys.push(key);\n      }\n    }\n    super.set(key, value);\n    return this;\n  }\n  insert(index, key, value) {\n    const has = this.has(key);\n    const length = this.#keys.length;\n    const relativeIndex = toSafeInteger(index);\n    let actualIndex = relativeIndex >= 0 ? relativeIndex : length + relativeIndex;\n    const safeIndex = actualIndex < 0 || actualIndex >= length ? -1 : actualIndex;\n    if (safeIndex === this.size || has && safeIndex === this.size - 1 || safeIndex === -1) {\n      this.set(key, value);\n      return this;\n    }\n    const size = this.size + (has ? 0 : 1);\n    if (relativeIndex < 0) {\n      actualIndex++;\n    }\n    const keys = [...this.#keys];\n    let nextValue;\n    let shouldSkip = false;\n    for (let i = actualIndex; i < size; i++) {\n      if (actualIndex === i) {\n        let nextKey = keys[i];\n        if (keys[i] === key) {\n          nextKey = keys[i + 1];\n        }\n        if (has) {\n          this.delete(key);\n        }\n        nextValue = this.get(nextKey);\n        this.set(key, value);\n      } else {\n        if (!shouldSkip && keys[i - 1] === key) {\n          shouldSkip = true;\n        }\n        const currentKey = keys[shouldSkip ? i : i - 1];\n        const currentValue = nextValue;\n        nextValue = this.get(currentKey);\n        this.delete(currentKey);\n        this.set(currentKey, currentValue);\n      }\n    }\n    return this;\n  }\n  with(index, key, value) {\n    const copy = new _OrderedDict(this);\n    copy.insert(index, key, value);\n    return copy;\n  }\n  before(key) {\n    const index = this.#keys.indexOf(key) - 1;\n    if (index < 0) {\n      return void 0;\n    }\n    return this.entryAt(index);\n  }\n  /**\n   * Sets a new key-value pair at the position before the given key.\n   */\n  setBefore(key, newKey, value) {\n    const index = this.#keys.indexOf(key);\n    if (index === -1) {\n      return this;\n    }\n    return this.insert(index, newKey, value);\n  }\n  after(key) {\n    let index = this.#keys.indexOf(key);\n    index = index === -1 || index === this.size - 1 ? -1 : index + 1;\n    if (index === -1) {\n      return void 0;\n    }\n    return this.entryAt(index);\n  }\n  /**\n   * Sets a new key-value pair at the position after the given key.\n   */\n  setAfter(key, newKey, value) {\n    const index = this.#keys.indexOf(key);\n    if (index === -1) {\n      return this;\n    }\n    return this.insert(index + 1, newKey, value);\n  }\n  first() {\n    return this.entryAt(0);\n  }\n  last() {\n    return this.entryAt(-1);\n  }\n  clear() {\n    this.#keys = [];\n    return super.clear();\n  }\n  delete(key) {\n    const deleted = super.delete(key);\n    if (deleted) {\n      this.#keys.splice(this.#keys.indexOf(key), 1);\n    }\n    return deleted;\n  }\n  deleteAt(index) {\n    const key = this.keyAt(index);\n    if (key !== void 0) {\n      return this.delete(key);\n    }\n    return false;\n  }\n  at(index) {\n    const key = at(this.#keys, index);\n    if (key !== void 0) {\n      return this.get(key);\n    }\n  }\n  entryAt(index) {\n    const key = at(this.#keys, index);\n    if (key !== void 0) {\n      return [key, this.get(key)];\n    }\n  }\n  indexOf(key) {\n    return this.#keys.indexOf(key);\n  }\n  keyAt(index) {\n    return at(this.#keys, index);\n  }\n  from(key, offset) {\n    const index = this.indexOf(key);\n    if (index === -1) {\n      return void 0;\n    }\n    let dest = index + offset;\n    if (dest < 0) dest = 0;\n    if (dest >= this.size) dest = this.size - 1;\n    return this.at(dest);\n  }\n  keyFrom(key, offset) {\n    const index = this.indexOf(key);\n    if (index === -1) {\n      return void 0;\n    }\n    let dest = index + offset;\n    if (dest < 0) dest = 0;\n    if (dest >= this.size) dest = this.size - 1;\n    return this.keyAt(dest);\n  }\n  find(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return entry;\n      }\n      index++;\n    }\n    return void 0;\n  }\n  findIndex(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return index;\n      }\n      index++;\n    }\n    return -1;\n  }\n  filter(predicate, thisArg) {\n    const entries = [];\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        entries.push(entry);\n      }\n      index++;\n    }\n    return new _OrderedDict(entries);\n  }\n  map(callbackfn, thisArg) {\n    const entries = [];\n    let index = 0;\n    for (const entry of this) {\n      entries.push([entry[0], Reflect.apply(callbackfn, thisArg, [entry, index, this])]);\n      index++;\n    }\n    return new _OrderedDict(entries);\n  }\n  reduce(...args) {\n    const [callbackfn, initialValue] = args;\n    let index = 0;\n    let accumulator = initialValue ?? this.at(0);\n    for (const entry of this) {\n      if (index === 0 && args.length === 1) {\n        accumulator = entry;\n      } else {\n        accumulator = Reflect.apply(callbackfn, this, [accumulator, entry, index, this]);\n      }\n      index++;\n    }\n    return accumulator;\n  }\n  reduceRight(...args) {\n    const [callbackfn, initialValue] = args;\n    let accumulator = initialValue ?? this.at(-1);\n    for (let index = this.size - 1; index >= 0; index--) {\n      const entry = this.at(index);\n      if (index === this.size - 1 && args.length === 1) {\n        accumulator = entry;\n      } else {\n        accumulator = Reflect.apply(callbackfn, this, [accumulator, entry, index, this]);\n      }\n    }\n    return accumulator;\n  }\n  toSorted(compareFn) {\n    const entries = [...this.entries()].sort(compareFn);\n    return new _OrderedDict(entries);\n  }\n  toReversed() {\n    const reversed = new _OrderedDict();\n    for (let index = this.size - 1; index >= 0; index--) {\n      const key = this.keyAt(index);\n      const element = this.get(key);\n      reversed.set(key, element);\n    }\n    return reversed;\n  }\n  toSpliced(...args) {\n    const entries = [...this.entries()];\n    entries.splice(...args);\n    return new _OrderedDict(entries);\n  }\n  slice(start, end) {\n    const result = new _OrderedDict();\n    let stop = this.size - 1;\n    if (start === void 0) {\n      return result;\n    }\n    if (start < 0) {\n      start = start + this.size;\n    }\n    if (end !== void 0 && end > 0) {\n      stop = end - 1;\n    }\n    for (let index = start; index <= stop; index++) {\n      const key = this.keyAt(index);\n      const element = this.get(key);\n      result.set(key, element);\n    }\n    return result;\n  }\n  every(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (!Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return false;\n      }\n      index++;\n    }\n    return true;\n  }\n  some(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return true;\n      }\n      index++;\n    }\n    return false;\n  }\n};\nfunction at(array, index) {\n  if (\"at\" in Array.prototype) {\n    return Array.prototype.at.call(array, index);\n  }\n  const actualIndex = toSafeIndex(array, index);\n  return actualIndex === -1 ? void 0 : array[actualIndex];\n}\nfunction toSafeIndex(array, index) {\n  const length = array.length;\n  const relativeIndex = toSafeInteger(index);\n  const actualIndex = relativeIndex >= 0 ? relativeIndex : length + relativeIndex;\n  return actualIndex < 0 || actualIndex >= length ? -1 : actualIndex;\n}\nfunction toSafeInteger(number) {\n  return number !== number || number === 0 ? 0 : Math.trunc(number);\n}\n\n// src/collection.tsx\nimport { jsx as jsx2 } from \"react/jsx-runtime\";\nfunction createCollection2(name) {\n  const PROVIDER_NAME = name + \"CollectionProvider\";\n  const [createCollectionContext, createCollectionScope] = createContextScope2(PROVIDER_NAME);\n  const [CollectionContextProvider, useCollectionContext] = createCollectionContext(\n    PROVIDER_NAME,\n    {\n      collectionElement: null,\n      collectionRef: { current: null },\n      collectionRefObject: { current: null },\n      itemMap: new OrderedDict(),\n      setItemMap: () => void 0\n    }\n  );\n  const CollectionProvider = ({ state, ...props }) => {\n    return state ? /* @__PURE__ */ jsx2(CollectionProviderImpl, { ...props, state }) : /* @__PURE__ */ jsx2(CollectionInit, { ...props });\n  };\n  CollectionProvider.displayName = PROVIDER_NAME;\n  const CollectionInit = (props) => {\n    const state = useInitCollection();\n    return /* @__PURE__ */ jsx2(CollectionProviderImpl, { ...props, state });\n  };\n  CollectionInit.displayName = PROVIDER_NAME + \"Init\";\n  const CollectionProviderImpl = (props) => {\n    const { scope, children, state } = props;\n    const ref = React2.useRef(null);\n    const [collectionElement, setCollectionElement] = React2.useState(\n      null\n    );\n    const composeRefs = useComposedRefs2(ref, setCollectionElement);\n    const [itemMap, setItemMap] = state;\n    React2.useEffect(() => {\n      if (!collectionElement) return;\n      const observer = getChildListObserver(() => {\n      });\n      observer.observe(collectionElement, {\n        childList: true,\n        subtree: true\n      });\n      return () => {\n        observer.disconnect();\n      };\n    }, [collectionElement]);\n    return /* @__PURE__ */ jsx2(\n      CollectionContextProvider,\n      {\n        scope,\n        itemMap,\n        setItemMap,\n        collectionRef: composeRefs,\n        collectionRefObject: ref,\n        collectionElement,\n        children\n      }\n    );\n  };\n  CollectionProviderImpl.displayName = PROVIDER_NAME + \"Impl\";\n  const COLLECTION_SLOT_NAME = name + \"CollectionSlot\";\n  const CollectionSlotImpl = createSlot2(COLLECTION_SLOT_NAME);\n  const CollectionSlot = React2.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children } = props;\n      const context = useCollectionContext(COLLECTION_SLOT_NAME, scope);\n      const composedRefs = useComposedRefs2(forwardedRef, context.collectionRef);\n      return /* @__PURE__ */ jsx2(CollectionSlotImpl, { ref: composedRefs, children });\n    }\n  );\n  CollectionSlot.displayName = COLLECTION_SLOT_NAME;\n  const ITEM_SLOT_NAME = name + \"CollectionItemSlot\";\n  const ITEM_DATA_ATTR = \"data-radix-collection-item\";\n  const CollectionItemSlotImpl = createSlot2(ITEM_SLOT_NAME);\n  const CollectionItemSlot = React2.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children, ...itemData } = props;\n      const ref = React2.useRef(null);\n      const [element, setElement] = React2.useState(null);\n      const composedRefs = useComposedRefs2(forwardedRef, ref, setElement);\n      const context = useCollectionContext(ITEM_SLOT_NAME, scope);\n      const { setItemMap } = context;\n      const itemDataRef = React2.useRef(itemData);\n      if (!shallowEqual(itemDataRef.current, itemData)) {\n        itemDataRef.current = itemData;\n      }\n      const memoizedItemData = itemDataRef.current;\n      React2.useEffect(() => {\n        const itemData2 = memoizedItemData;\n        setItemMap((map) => {\n          if (!element) {\n            return map;\n          }\n          if (!map.has(element)) {\n            map.set(element, { ...itemData2, element });\n            return map.toSorted(sortByDocumentPosition);\n          }\n          return map.set(element, { ...itemData2, element }).toSorted(sortByDocumentPosition);\n        });\n        return () => {\n          setItemMap((map) => {\n            if (!element || !map.has(element)) {\n              return map;\n            }\n            map.delete(element);\n            return new OrderedDict(map);\n          });\n        };\n      }, [element, memoizedItemData, setItemMap]);\n      return /* @__PURE__ */ jsx2(CollectionItemSlotImpl, { ...{ [ITEM_DATA_ATTR]: \"\" }, ref: composedRefs, children });\n    }\n  );\n  CollectionItemSlot.displayName = ITEM_SLOT_NAME;\n  function useInitCollection() {\n    return React2.useState(new OrderedDict());\n  }\n  function useCollection(scope) {\n    const { itemMap } = useCollectionContext(name + \"CollectionConsumer\", scope);\n    return itemMap;\n  }\n  const functions = {\n    createCollectionScope,\n    useCollection,\n    useInitCollection\n  };\n  return [\n    { Provider: CollectionProvider, Slot: CollectionSlot, ItemSlot: CollectionItemSlot },\n    functions\n  ];\n}\nfunction shallowEqual(a, b) {\n  if (a === b) return true;\n  if (typeof a !== \"object\" || typeof b !== \"object\") return false;\n  if (a == null || b == null) return false;\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n  if (keysA.length !== keysB.length) return false;\n  for (const key of keysA) {\n    if (!Object.prototype.hasOwnProperty.call(b, key)) return false;\n    if (a[key] !== b[key]) return false;\n  }\n  return true;\n}\nfunction isElementPreceding(a, b) {\n  return !!(b.compareDocumentPosition(a) & Node.DOCUMENT_POSITION_PRECEDING);\n}\nfunction sortByDocumentPosition(a, b) {\n  return !a[1].element || !b[1].element ? 0 : isElementPreceding(a[1].element, b[1].element) ? -1 : 1;\n}\nfunction getChildListObserver(callback) {\n  const observer = new MutationObserver((mutationsList) => {\n    for (const mutation of mutationsList) {\n      if (mutation.type === \"childList\") {\n        callback();\n        return;\n      }\n    }\n  });\n  return observer;\n}\nexport {\n  createCollection,\n  createCollection2 as unstable_createCollection\n};\n//# sourceMappingURL=index.mjs.map\n"],"names":["createCollection","name","PROVIDER_NAME","createCollectionContext","createCollectionScope","createContextScope","CollectionProviderImpl","useCollectionContext","CollectionProvider","props","scope","children","ref","React","itemMap","jsx","COLLECTION_SLOT_NAME","CollectionSlotImpl","createSlot","CollectionSlot","forwardedRef","context","composedRefs","useComposedRefs","ITEM_SLOT_NAME","ITEM_DATA_ATTR","CollectionItemSlotImpl","CollectionItemSlot","itemData","useCollection","collectionNode","orderedNodes","a","b"],"mappings":";;;;;AAQA,SAASA,EAAiBC,GAAM;AAC9B,QAAMC,IAAgBD,IAAO,sBACvB,CAACE,GAAyBC,CAAqB,IAAIC,EAAmBH,CAAa,GACnF,CAACI,GAAwBC,CAAoB,IAAIJ;AAAA,IACrDD;AAAA,IACA,EAAE,eAAe,EAAE,SAAS,KAAI,GAAI,SAAyB,oBAAI,IAAG,EAAE;AAAA,EAC1E,GACQM,IAAqB,CAACC,MAAU;AACpC,UAAM,EAAE,OAAAC,GAAO,UAAAC,EAAQ,IAAKF,GACtBG,IAAMC,EAAM,OAAO,IAAI,GACvBC,IAAUD,EAAM,OAAuB,oBAAI,IAAG,CAAE,EAAE;AACxD,WAAuBE,gBAAAA,EAAAA,IAAIT,GAAwB,EAAE,OAAAI,GAAO,SAAAI,GAAS,eAAeF,GAAK,UAAAD,GAAU;AAAA,EACrG;AACA,EAAAH,EAAmB,cAAcN;AACjC,QAAMc,IAAuBf,IAAO,kBAC9BgB,IAAqBC,EAAWF,CAAoB,GACpDG,IAAiBN,EAAM;AAAA,IAC3B,CAACJ,GAAOW,MAAiB;AACvB,YAAM,EAAE,OAAAV,GAAO,UAAAC,EAAQ,IAAKF,GACtBY,IAAUd,EAAqBS,GAAsBN,CAAK,GAC1DY,IAAeC,EAAgBH,GAAcC,EAAQ,aAAa;AACxE,aAAuBN,gBAAAA,EAAAA,IAAIE,GAAoB,EAAE,KAAKK,GAAc,UAAAX,EAAQ,CAAE;AAAA,IAChF;AAAA,EACJ;AACE,EAAAQ,EAAe,cAAcH;AAC7B,QAAMQ,IAAiBvB,IAAO,sBACxBwB,IAAiB,8BACjBC,IAAyBR,EAAWM,CAAc,GAClDG,IAAqBd,EAAM;AAAA,IAC/B,CAACJ,GAAOW,MAAiB;AACvB,YAAM,EAAE,OAAAV,GAAO,UAAAC,GAAU,GAAGiB,EAAQ,IAAKnB,GACnCG,IAAMC,EAAM,OAAO,IAAI,GACvBS,IAAeC,EAAgBH,GAAcR,CAAG,GAChDS,IAAUd,EAAqBiB,GAAgBd,CAAK;AAC1DG,aAAAA,EAAM,UAAU,OACdQ,EAAQ,QAAQ,IAAIT,GAAK,EAAE,KAAAA,GAAK,GAAGgB,GAAU,GACtC,MAAM,KAAKP,EAAQ,QAAQ,OAAOT,CAAG,EAC7C,GACsBG,gBAAAA,MAAIW,GAAwB,EAAO,CAACD,CAAc,GAAG,IAAM,KAAKH,GAAc,UAAAX,GAAU;AAAA,IACjH;AAAA,EACJ;AACE,EAAAgB,EAAmB,cAAcH;AACjC,WAASK,EAAcnB,GAAO;AAC5B,UAAMW,IAAUd,EAAqBN,IAAO,sBAAsBS,CAAK;AAWvE,WAViBG,EAAM,YAAY,MAAM;AACvC,YAAMiB,IAAiBT,EAAQ,cAAc;AAC7C,UAAI,CAACS,EAAgB,QAAO,CAAA;AAC5B,YAAMC,IAAe,MAAM,KAAKD,EAAe,iBAAiB,IAAIL,CAAc,GAAG,CAAC;AAKtF,aAJc,MAAM,KAAKJ,EAAQ,QAAQ,QAAQ,EACtB;AAAA,QACzB,CAACW,GAAGC,MAAMF,EAAa,QAAQC,EAAE,IAAI,OAAO,IAAID,EAAa,QAAQE,EAAE,IAAI,OAAO;AAAA,MAC1F;AAAA,IAEI,GAAG,CAACZ,EAAQ,eAAeA,EAAQ,OAAO,CAAC;AAAA,EAE7C;AACA,SAAO;AAAA,IACL,EAAE,UAAUb,GAAoB,MAAMW,GAAgB,UAAUQ,EAAkB;AAAA,IAClFE;AAAA,IACAzB;AAAA,EACJ;AACA;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es622.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es623.js

@@ -1,17 +1,5 @@
-import * as e from "react";
-import { j as n } from "./index.es266.js";
-var o = e.createContext(void 0), a = (r) => {
-  const { dir: t, children: i } = r;
-  return /* @__PURE__ */ n.jsx(o.Provider, { value: t, children: i });
-};
-function s(r) {
-  const t = e.useContext(o);
-  return r || t || "ltr";
-}
-var v = a;
+var r = {};
 export {
-  a as DirectionProvider,
-  v as Provider,
-  s as useDirection
+  r as __exports
 };
 //# sourceMappingURL=index.es623.js.map

package/dist/index.es623.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es623.js","sources":["../node_modules/@radix-ui/react-direction/dist/index.mjs"],"sourcesContent":["// packages/react/direction/src/direction.tsx\nimport * as React from \"react\";\nimport { jsx } from \"react/jsx-runtime\";\nvar DirectionContext = React.createContext(void 0);\nvar DirectionProvider = (props) => {\n  const { dir, children } = props;\n  return /* @__PURE__ */ jsx(DirectionContext.Provider, { value: dir, children });\n};\nfunction useDirection(localDir) {\n  const globalDir = React.useContext(DirectionContext);\n  return localDir || globalDir || \"ltr\";\n}\nvar Provider = DirectionProvider;\nexport {\n  DirectionProvider,\n  Provider,\n  useDirection\n};\n//# sourceMappingURL=index.mjs.map\n"],"names":["DirectionContext","React","DirectionProvider","props","dir","children","jsx","useDirection","localDir","globalDir","Provider"],"mappings":";;AAGA,IAAIA,IAAmBC,EAAM,cAAc,MAAM,GAC7CC,IAAoB,CAACC,MAAU;AACjC,QAAM,EAAE,KAAAC,GAAK,UAAAC,EAAQ,IAAKF;AAC1B,SAAuBG,gBAAAA,EAAAA,IAAIN,EAAiB,UAAU,EAAE,OAAOI,GAAK,UAAAC,GAAU;AAChF;AACA,SAASE,EAAaC,GAAU;AAC9B,QAAMC,IAAYR,EAAM,WAAWD,CAAgB;AACnD,SAAOQ,KAAYC,KAAa;AAClC;AACG,IAACC,IAAWR;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es623.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es624.js

@@ -1,222 +1,5 @@
-import * as c from "react";
-import { useFloating as xe, offset as Pe, shift as ye, flip as Ae, size as ve, arrow as Ce, hide as be, limitShift as Re } from "./index.es717.js";
-import { Root as Se } from "./index.es718.js";
-import { useComposedRefs as T } from "./index.es514.js";
-import { createContextScope as Oe } from "./index.es513.js";
-import { Primitive as z } from "./index.es526.js";
-import { useCallbackRef as Ee } from "./index.es608.js";
-import { useLayoutEffect as B } from "./index.es607.js";
-import { useSize as Ne } from "./index.es544.js";
-import { j as f } from "./index.es266.js";
-import { autoUpdate as _e } from "./index.es719.js";
-var N = "Popper", [L, Ue] = Oe(N), [$e, Z] = L(N), U = (e) => {
-  const { __scopePopper: s, children: a } = e, [t, i] = c.useState(null);
-  return /* @__PURE__ */ f.jsx($e, { scope: s, anchor: t, onAnchorChange: i, children: a });
-};
-U.displayName = N;
-var q = "PopperAnchor", G = c.forwardRef(
-  (e, s) => {
-    const { __scopePopper: a, virtualRef: t, ...i } = e, r = Z(q, a), o = c.useRef(null), w = T(s, o), n = c.useRef(null);
-    return c.useEffect(() => {
-      const p = n.current;
-      n.current = (t == null ? void 0 : t.current) || o.current, p !== n.current && r.onAnchorChange(n.current);
-    }), t ? null : /* @__PURE__ */ f.jsx(z.div, { ...i, ref: w });
-  }
-);
-G.displayName = q;
-var _ = "PopperContent", [je, He] = L(_), J = c.forwardRef(
-  (e, s) => {
-    var I, Y, M, X, D, F;
-    const {
-      __scopePopper: a,
-      side: t = "bottom",
-      sideOffset: i = 0,
-      align: r = "center",
-      alignOffset: o = 0,
-      arrowPadding: w = 0,
-      avoidCollisions: n = !0,
-      collisionBoundary: p = [],
-      collisionPadding: x = 0,
-      sticky: m = "partial",
-      hideWhenDetached: y = !1,
-      updatePositionStrategy: A = "optimized",
-      onPlaced: l,
-      ...d
-    } = e, v = Z(_, a), [h, C] = c.useState(null), ee = T(s, (P) => C(P)), [E, te] = c.useState(null), u = Ne(E), re = (u == null ? void 0 : u.width) ?? 0, $ = (u == null ? void 0 : u.height) ?? 0, oe = t + (r !== "center" ? "-" + r : ""), ne = typeof x == "number" ? x : { top: 0, right: 0, bottom: 0, left: 0, ...x }, j = Array.isArray(p) ? p : [p], ae = j.length > 0, b = {
-      padding: ne,
-      boundary: j.filter(Ie),
-      // with `strategy: 'fixed'`, this is the only way to get it to respect boundaries
-      altBoundary: ae
-    }, { refs: ie, floatingStyles: H, placement: se, isPositioned: R, middlewareData: g } = xe({
-      // default to `fixed` strategy so users don't have to pick and we also avoid focus scroll issues
-      strategy: "fixed",
-      placement: oe,
-      whileElementsMounted: (...P) => _e(...P, {
-        animationFrame: A === "always"
-      }),
-      elements: {
-        reference: v.anchor
-      },
-      middleware: [
-        Pe({ mainAxis: i + $, alignmentAxis: o }),
-        n && ye({
-          mainAxis: !0,
-          crossAxis: !1,
-          limiter: m === "partial" ? Re() : void 0,
-          ...b
-        }),
-        n && Ae({ ...b }),
-        ve({
-          ...b,
-          apply: ({ elements: P, rects: k, availableWidth: he, availableHeight: ue }) => {
-            const { width: ge, height: we } = k.reference, O = P.floating.style;
-            O.setProperty("--radix-popper-available-width", `${he}px`), O.setProperty("--radix-popper-available-height", `${ue}px`), O.setProperty("--radix-popper-anchor-width", `${ge}px`), O.setProperty("--radix-popper-anchor-height", `${we}px`);
-          }
-        }),
-        E && Ce({ element: E, padding: w }),
-        Ye({ arrowWidth: re, arrowHeight: $ }),
-        y && be({ strategy: "referenceHidden", ...b })
-      ]
-    }), [W, pe] = V(se), S = Ee(l);
-    B(() => {
-      R && (S == null || S());
-    }, [R, S]);
-    const ce = (I = g.arrow) == null ? void 0 : I.x, de = (Y = g.arrow) == null ? void 0 : Y.y, le = ((M = g.arrow) == null ? void 0 : M.centerOffset) !== 0, [fe, me] = c.useState();
-    return B(() => {
-      h && me(window.getComputedStyle(h).zIndex);
-    }, [h]), /* @__PURE__ */ f.jsx(
-      "div",
-      {
-        ref: ie.setFloating,
-        "data-radix-popper-content-wrapper": "",
-        style: {
-          ...H,
-          transform: R ? H.transform : "translate(0, -200%)",
-          // keep off the page when measuring
-          minWidth: "max-content",
-          zIndex: fe,
-          "--radix-popper-transform-origin": [
-            (X = g.transformOrigin) == null ? void 0 : X.x,
-            (D = g.transformOrigin) == null ? void 0 : D.y
-          ].join(" "),
-          // hide the content if using the hide middleware and should be hidden
-          // set visibility to hidden and disable pointer events so the UI behaves
-          // as if the PopperContent isn't there at all
-          ...((F = g.hide) == null ? void 0 : F.referenceHidden) && {
-            visibility: "hidden",
-            pointerEvents: "none"
-          }
-        },
-        dir: e.dir,
-        children: /* @__PURE__ */ f.jsx(
-          je,
-          {
-            scope: a,
-            placedSide: W,
-            onArrowChange: te,
-            arrowX: ce,
-            arrowY: de,
-            shouldHideArrow: le,
-            children: /* @__PURE__ */ f.jsx(
-              z.div,
-              {
-                "data-side": W,
-                "data-align": pe,
-                ...d,
-                ref: ee,
-                style: {
-                  ...d.style,
-                  // if the PopperContent hasn't been placed yet (not all measurements done)
-                  // we prevent animations so that users's animation don't kick in too early referring wrong sides
-                  animation: R ? void 0 : "none"
-                }
-              }
-            )
-          }
-        )
-      }
-    );
-  }
-);
-J.displayName = _;
-var K = "PopperArrow", We = {
-  top: "bottom",
-  right: "left",
-  bottom: "top",
-  left: "right"
-}, Q = c.forwardRef(function(s, a) {
-  const { __scopePopper: t, ...i } = s, r = He(K, t), o = We[r.placedSide];
-  return (
-    // we have to use an extra wrapper because `ResizeObserver` (used by `useSize`)
-    // doesn't report size as we'd expect on SVG elements.
-    // it reports their bounding box which is effectively the largest path inside the SVG.
-    /* @__PURE__ */ f.jsx(
-      "span",
-      {
-        ref: r.onArrowChange,
-        style: {
-          position: "absolute",
-          left: r.arrowX,
-          top: r.arrowY,
-          [o]: 0,
-          transformOrigin: {
-            top: "",
-            right: "0 0",
-            bottom: "center 0",
-            left: "100% 0"
-          }[r.placedSide],
-          transform: {
-            top: "translateY(100%)",
-            right: "translateY(50%) rotate(90deg) translateX(-50%)",
-            bottom: "rotate(180deg)",
-            left: "translateY(50%) rotate(-90deg) translateX(50%)"
-          }[r.placedSide],
-          visibility: r.shouldHideArrow ? "hidden" : void 0
-        },
-        children: /* @__PURE__ */ f.jsx(
-          Se,
-          {
-            ...i,
-            ref: a,
-            style: {
-              ...i.style,
-              // ensures the element can be measured correctly (mostly for if SVG)
-              display: "block"
-            }
-          }
-        )
-      }
-    )
-  );
-});
-Q.displayName = K;
-function Ie(e) {
-  return e !== null;
-}
-var Ye = (e) => ({
-  name: "transformOrigin",
-  options: e,
-  fn(s) {
-    var v, h, C;
-    const { placement: a, rects: t, middlewareData: i } = s, o = ((v = i.arrow) == null ? void 0 : v.centerOffset) !== 0, w = o ? 0 : e.arrowWidth, n = o ? 0 : e.arrowHeight, [p, x] = V(a), m = { start: "0%", center: "50%", end: "100%" }[x], y = (((h = i.arrow) == null ? void 0 : h.x) ?? 0) + w / 2, A = (((C = i.arrow) == null ? void 0 : C.y) ?? 0) + n / 2;
-    let l = "", d = "";
-    return p === "bottom" ? (l = o ? m : `${y}px`, d = `${-n}px`) : p === "top" ? (l = o ? m : `${y}px`, d = `${t.floating.height + n}px`) : p === "right" ? (l = `${-n}px`, d = o ? m : `${A}px`) : p === "left" && (l = `${t.floating.width + n}px`, d = o ? m : `${A}px`), { data: { x: l, y: d } };
-  }
-});
-function V(e) {
-  const [s, a = "center"] = e.split("-");
-  return [s, a];
-}
-var qe = U, Ge = G, Je = J, Ke = Q;
+var r = {};
 export {
-  Ge as Anchor,
-  Ke as Arrow,
-  Je as Content,
-  U as Popper,
-  G as PopperAnchor,
-  Q as PopperArrow,
-  J as PopperContent,
-  qe as Root,
-  Ue as createPopperScope
+  r as __exports
 };
 //# sourceMappingURL=index.es624.js.map