@new-black/lyra 0.1.8 → 0.1.9

package/dist/lyra100.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra100.cjs","sources":["../node_modules/@react-stately/collections/dist/import.mjs"],"sourcesContent":["import $tyW6A$react, {useMemo as $tyW6A$useMemo} from \"react\";\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $c1d7fb2ec91bae71$var$Item(props) {\n    return null;\n}\n$c1d7fb2ec91bae71$var$Item.getCollectionNode = function* getCollectionNode(props, context) {\n    let { childItems: childItems , title: title , children: children  } = props;\n    let rendered = props.title || props.children;\n    let textValue = props.textValue || (typeof rendered === \"string\" ? rendered : \"\") || props[\"aria-label\"] || \"\";\n    // suppressTextValueWarning is used in components like Tabs, which don't have type to select support.\n    if (!textValue && !(context === null || context === void 0 ? void 0 : context.suppressTextValueWarning)) console.warn(\"<Item> with non-plain text contents is unsupported by type to select for accessibility. Please add a `textValue` prop.\");\n    yield {\n        type: \"item\",\n        props: props,\n        rendered: rendered,\n        textValue: textValue,\n        \"aria-label\": props[\"aria-label\"],\n        hasChildNodes: $c1d7fb2ec91bae71$var$hasChildItems(props),\n        *childNodes () {\n            if (childItems) for (let child of childItems)yield {\n                type: \"item\",\n                value: child\n            };\n            else if (title) {\n                let items = [];\n                (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                    items.push({\n                        type: \"item\",\n                        element: child\n                    });\n                });\n                yield* items;\n            }\n        }\n    };\n};\nfunction $c1d7fb2ec91bae71$var$hasChildItems(props) {\n    if (props.hasChildItems != null) return props.hasChildItems;\n    if (props.childItems) return true;\n    if (props.title && (0, $tyW6A$react).Children.count(props.children) > 0) return true;\n    return false;\n}\n// We don't want getCollectionNode to show up in the type definition\nlet $c1d7fb2ec91bae71$export$6d08773d2e66f8f2 = $c1d7fb2ec91bae71$var$Item;\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $9fc4852771d079eb$var$Section(props) {\n    return null;\n}\n$9fc4852771d079eb$var$Section.getCollectionNode = function* getCollectionNode(props) {\n    let { children: children , title: title , items: items  } = props;\n    yield {\n        type: \"section\",\n        props: props,\n        hasChildNodes: true,\n        rendered: title,\n        \"aria-label\": props[\"aria-label\"],\n        *childNodes () {\n            if (typeof children === \"function\") {\n                if (!items) throw new Error(\"props.children was a function but props.items is missing\");\n                for (let item of items)yield {\n                    type: \"item\",\n                    value: item,\n                    renderer: children\n                };\n            } else {\n                let items = [];\n                (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                    items.push({\n                        type: \"item\",\n                        element: child\n                    });\n                });\n                yield* items;\n            }\n        }\n    };\n};\n// We don't want getCollectionNode to show up in the type definition\nlet $9fc4852771d079eb$export$6e2c8f0811a474ce = $9fc4852771d079eb$var$Section;\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nclass $eb2240fc39a57fa5$export$bf788dd355e3a401 {\n    build(props, context) {\n        this.context = context;\n        return $eb2240fc39a57fa5$var$iterable(()=>this.iterateCollection(props));\n    }\n    *iterateCollection(props) {\n        let { children: children , items: items  } = props;\n        if (typeof children === \"function\") {\n            if (!items) throw new Error(\"props.children was a function but props.items is missing\");\n            for (let item of props.items)yield* this.getFullNode({\n                value: item\n            }, {\n                renderer: children\n            });\n        } else {\n            let items = [];\n            (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                items.push(child);\n            });\n            let index = 0;\n            for (let item of items){\n                let nodes = this.getFullNode({\n                    element: item,\n                    index: index\n                }, {});\n                for (let node of nodes){\n                    index++;\n                    yield node;\n                }\n            }\n        }\n    }\n    getKey(item, partialNode, state, parentKey) {\n        if (item.key != null) return item.key;\n        if (partialNode.type === \"cell\" && partialNode.key != null) return `${parentKey}${partialNode.key}`;\n        let v = partialNode.value;\n        if (v != null) {\n            var _v_key;\n            let key = (_v_key = v.key) !== null && _v_key !== void 0 ? _v_key : v.id;\n            if (key == null) throw new Error(\"No key found for item\");\n            return key;\n        }\n        return parentKey ? `${parentKey}.${partialNode.index}` : `$.${partialNode.index}`;\n    }\n    getChildState(state, partialNode) {\n        return {\n            renderer: partialNode.renderer || state.renderer\n        };\n    }\n    *getFullNode(partialNode, state, parentKey, parentNode) {\n        // If there's a value instead of an element on the node, and a parent renderer function is available,\n        // use it to render an element for the value.\n        let element = partialNode.element;\n        if (!element && partialNode.value && state && state.renderer) {\n            let cached = this.cache.get(partialNode.value);\n            if (cached && (!cached.shouldInvalidate || !cached.shouldInvalidate(this.context))) {\n                cached.index = partialNode.index;\n                cached.parentKey = parentNode ? parentNode.key : null;\n                yield cached;\n                return;\n            }\n            element = state.renderer(partialNode.value);\n        }\n        // If there's an element with a getCollectionNode function on its type, then it's a supported component.\n        // Call this function to get a partial node, and recursively build a full node from there.\n        if ((0, $tyW6A$react).isValidElement(element)) {\n            let type = element.type;\n            if (typeof type !== \"function\" && typeof type.getCollectionNode !== \"function\") {\n                let name = typeof element.type === \"function\" ? element.type.name : element.type;\n                throw new Error(`Unknown element <${name}> in collection.`);\n            }\n            let childNodes = type.getCollectionNode(element.props, this.context);\n            let index = partialNode.index;\n            let result = childNodes.next();\n            while(!result.done && result.value){\n                let childNode = result.value;\n                partialNode.index = index;\n                let nodeKey = childNode.key;\n                if (!nodeKey) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);\n                let nodes = this.getFullNode({\n                    ...childNode,\n                    key: nodeKey,\n                    index: index,\n                    wrapper: $eb2240fc39a57fa5$var$compose(partialNode.wrapper, childNode.wrapper)\n                }, this.getChildState(state, childNode), parentKey ? `${parentKey}${element.key}` : element.key, parentNode);\n                let children = [\n                    ...nodes\n                ];\n                for (let node of children){\n                    // Cache the node based on its value\n                    node.value = childNode.value || partialNode.value;\n                    if (node.value) this.cache.set(node.value, node);\n                    // The partial node may have specified a type for the child in order to specify a constraint.\n                    // Verify that the full node that was built recursively matches this type.\n                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$eb2240fc39a57fa5$var$capitalize(node.type)}> in <${$eb2240fc39a57fa5$var$capitalize(parentNode.type)}>. Only <${$eb2240fc39a57fa5$var$capitalize(partialNode.type)}> is supported.`);\n                    index++;\n                    yield node;\n                }\n                result = childNodes.next(children);\n            }\n            return;\n        }\n        // Ignore invalid elements\n        if (partialNode.key == null) return;\n        // Create full node\n        let builder = this;\n        let node = {\n            type: partialNode.type,\n            props: partialNode.props,\n            key: partialNode.key,\n            parentKey: parentNode ? parentNode.key : null,\n            value: partialNode.value,\n            level: parentNode ? parentNode.level + 1 : 0,\n            index: partialNode.index,\n            rendered: partialNode.rendered,\n            textValue: partialNode.textValue,\n            \"aria-label\": partialNode[\"aria-label\"],\n            wrapper: partialNode.wrapper,\n            shouldInvalidate: partialNode.shouldInvalidate,\n            hasChildNodes: partialNode.hasChildNodes,\n            childNodes: $eb2240fc39a57fa5$var$iterable(function*() {\n                if (!partialNode.hasChildNodes) return;\n                let index = 0;\n                for (let child of partialNode.childNodes()){\n                    // Ensure child keys are globally unique by prepending the parent node's key\n                    if (child.key != null) // TODO: Remove this line entirely and enforce that users always provide unique keys.\n                    // Currently this line will have issues when a parent has a key `a` and a child with key `bc`\n                    // but another parent has key `ab` and its child has a key `c`. The combined keys would result in both\n                    // children having a key of `abc`.\n                    child.key = `${node.key}${child.key}`;\n                    child.index = index;\n                    let nodes = builder.getFullNode(child, builder.getChildState(state, child), node.key, node);\n                    for (let node of nodes){\n                        index++;\n                        yield node;\n                    }\n                }\n            })\n        };\n        yield node;\n    }\n    constructor(){\n        this.cache = new WeakMap();\n    }\n}\n// Wraps an iterator function as an iterable object, and caches the results.\nfunction $eb2240fc39a57fa5$var$iterable(iterator) {\n    let cache = [];\n    let iterable = null;\n    return {\n        *[Symbol.iterator] () {\n            for (let item of cache)yield item;\n            if (!iterable) iterable = iterator();\n            for (let item of iterable){\n                cache.push(item);\n                yield item;\n            }\n        }\n    };\n}\nfunction $eb2240fc39a57fa5$var$compose(outer, inner) {\n    if (outer && inner) return (element)=>outer(inner(element));\n    if (outer) return outer;\n    if (inner) return inner;\n}\nfunction $eb2240fc39a57fa5$var$capitalize(str) {\n    return str[0].toUpperCase() + str.slice(1);\n}\n\n\n\nfunction $7613b1592d41b092$export$6cd28814d92fa9c9(props, factory, context) {\n    let builder = (0, $tyW6A$useMemo)(()=>new (0, $eb2240fc39a57fa5$export$bf788dd355e3a401)(), []);\n    let { children: children , items: items , collection: collection  } = props;\n    let result = (0, $tyW6A$useMemo)(()=>{\n        if (collection) return collection;\n        let nodes = builder.build({\n            children: children,\n            items: items\n        }, context);\n        return factory(nodes);\n    }, [\n        builder,\n        children,\n        items,\n        collection,\n        context,\n        factory\n    ]);\n    return result;\n}\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ function $c5a24bc478652b5f$export$1005530eda016c13(node, collection) {\n    // New API: call collection.getChildren with the node key.\n    if (typeof collection.getChildren === \"function\") return collection.getChildren(node.key);\n    // Old API: access childNodes directly.\n    return node.childNodes;\n}\nfunction $c5a24bc478652b5f$export$fbdeaa6a76694f71(iterable) {\n    return $c5a24bc478652b5f$export$5f3398f8733f90e2(iterable, 0);\n}\nfunction $c5a24bc478652b5f$export$5f3398f8733f90e2(iterable, index) {\n    if (index < 0) return undefined;\n    let i = 0;\n    for (let item of iterable){\n        if (i === index) return item;\n        i++;\n    }\n}\nfunction $c5a24bc478652b5f$export$7475b2c64539e4cf(iterable) {\n    let lastItem = undefined;\n    for (let value of iterable)lastItem = value;\n    return lastItem;\n}\nfunction $c5a24bc478652b5f$export$8c434b3a7a4dad6(collection, a, b) {\n    // If the two nodes have the same parent, compare their indices.\n    if (a.parentKey === b.parentKey) return a.index - b.index;\n    // Otherwise, collect all of the ancestors from each node, and find the first one that doesn't match starting from the root.\n    // Include the base nodes in case we are comparing nodes of different levels so that we can compare the higher node to the lower level node's\n    // ancestor of the same level\n    let aAncestors = [\n        ...$c5a24bc478652b5f$var$getAncestors(collection, a),\n        a\n    ];\n    let bAncestors = [\n        ...$c5a24bc478652b5f$var$getAncestors(collection, b),\n        b\n    ];\n    let firstNonMatchingAncestor = aAncestors.slice(0, bAncestors.length).findIndex((a, i)=>a !== bAncestors[i]);\n    if (firstNonMatchingAncestor !== -1) {\n        // Compare the indices of two children within the common ancestor.\n        a = aAncestors[firstNonMatchingAncestor];\n        b = bAncestors[firstNonMatchingAncestor];\n        return a.index - b.index;\n    }\n    // If there isn't a non matching ancestor, we might be in a case where one of the nodes is the ancestor of the other.\n    if (aAncestors.findIndex((node)=>node === b) >= 0) return 1;\n    else if (bAncestors.findIndex((node)=>node === a) >= 0) return -1;\n    // 🤷\n    return -1;\n}\nfunction $c5a24bc478652b5f$var$getAncestors(collection, node) {\n    let parents = [];\n    while((node === null || node === void 0 ? void 0 : node.parentKey) != null){\n        node = collection.getItem(node.parentKey);\n        parents.unshift(node);\n    }\n    return parents;\n}\n\n\nconst $453cc9f0df89c0a5$var$cache = new WeakMap();\nfunction $453cc9f0df89c0a5$export$77d5aafae4e095b2(collection) {\n    let count = $453cc9f0df89c0a5$var$cache.get(collection);\n    if (count != null) return count;\n    count = 0;\n    let countItems = (items)=>{\n        for (let item of items)if (item.type === \"section\") countItems((0, $c5a24bc478652b5f$export$1005530eda016c13)(item, collection));\n        else count++;\n    };\n    countItems(collection);\n    $453cc9f0df89c0a5$var$cache.set(collection, count);\n    return count;\n}\n\n\n\n\n\n\nexport {$c1d7fb2ec91bae71$export$6d08773d2e66f8f2 as Item, $9fc4852771d079eb$export$6e2c8f0811a474ce as Section, $7613b1592d41b092$export$6cd28814d92fa9c9 as useCollection, $453cc9f0df89c0a5$export$77d5aafae4e095b2 as getItemCount, $c5a24bc478652b5f$export$1005530eda016c13 as getChildNodes, $c5a24bc478652b5f$export$fbdeaa6a76694f71 as getFirstItem, $c5a24bc478652b5f$export$7475b2c64539e4cf as getLastItem, $c5a24bc478652b5f$export$5f3398f8733f90e2 as getNthItem, $c5a24bc478652b5f$export$8c434b3a7a4dad6 as compareNodeOrder, $eb2240fc39a57fa5$export$bf788dd355e3a401 as CollectionBuilder};\n//# sourceMappingURL=module.js.map\n"],"names":["$eb2240fc39a57fa5$export$bf788dd355e3a401","props","context","$eb2240fc39a57fa5$var$iterable","children","items","item","$tyW6A$react","child","index","nodes","node","partialNode","state","parentKey","v","_v_key","key","parentNode","element","cached","type","name","childNodes","result","childNode","nodeKey","$eb2240fc39a57fa5$var$compose","$eb2240fc39a57fa5$var$capitalize","builder","iterator","cache","iterable","outer","inner","str","$7613b1592d41b092$export$6cd28814d92fa9c9","factory","$tyW6A$useMemo","collection","$c5a24bc478652b5f$export$1005530eda016c13","$c5a24bc478652b5f$export$fbdeaa6a76694f71","$c5a24bc478652b5f$export$5f3398f8733f90e2","i","$c5a24bc478652b5f$export$8c434b3a7a4dad6","a","b","aAncestors","$c5a24bc478652b5f$var$getAncestors","bAncestors","firstNonMatchingAncestor","parents","$453cc9f0df89c0a5$var$cache","$453cc9f0df89c0a5$export$77d5aafae4e095b2","count","countItems"],"mappings":"yGAuIA,MAAMA,CAA0C,CAC5C,MAAMC,EAAOC,EAAS,CAClB,YAAK,QAAUA,EACRC,EAA+B,IAAI,KAAK,kBAAkBF,CAAK,CAAC,CAC1E,CACD,CAAC,kBAAkBA,EAAO,CACtB,GAAI,CAAE,SAAUG,EAAW,MAAOC,CAAK,EAAMJ,EAC7C,GAAI,OAAOG,GAAa,WAAY,CAChC,GAAI,CAACC,EAAO,MAAM,IAAI,MAAM,0DAA0D,EACtF,QAASC,KAAQL,EAAM,MAAM,MAAO,KAAK,YAAY,CACjD,MAAOK,CACvB,EAAe,CACC,SAAUF,CAC1B,CAAa,CACb,KAAe,CACH,IAAIC,EAAQ,CAAA,EACRE,EAAc,SAAS,QAAQH,EAAWI,GAAQ,CAClDH,EAAM,KAAKG,CAAK,CAChC,CAAa,EACD,IAAIC,EAAQ,EACZ,QAASH,KAAQD,EAAM,CACnB,IAAIK,EAAQ,KAAK,YAAY,CACzB,QAASJ,EACT,MAAOG,CACV,EAAE,CAAE,CAAA,EACL,QAASE,KAAQD,EACbD,IACA,MAAME,CAEb,CACJ,CACJ,CACD,OAAOL,EAAMM,EAAaC,EAAOC,EAAW,CACxC,GAAIR,EAAK,KAAO,KAAM,OAAOA,EAAK,IAClC,GAAIM,EAAY,OAAS,QAAUA,EAAY,KAAO,KAAM,MAAO,GAAGE,CAAS,GAAGF,EAAY,GAAG,GACjG,IAAIG,EAAIH,EAAY,MACpB,GAAIG,GAAK,KAAM,CACX,IAAIC,EACJ,IAAIC,GAAOD,EAASD,EAAE,OAAS,MAAQC,IAAW,OAASA,EAASD,EAAE,GACtE,GAAIE,GAAO,KAAM,MAAM,IAAI,MAAM,uBAAuB,EACxD,OAAOA,CACV,CACD,OAAOH,EAAY,GAAGA,CAAS,IAAIF,EAAY,KAAK,GAAK,KAAKA,EAAY,KAAK,EAClF,CACD,cAAcC,EAAOD,EAAa,CAC9B,MAAO,CACH,SAAUA,EAAY,UAAYC,EAAM,QACpD,CACK,CACD,CAAC,YAAYD,EAAaC,EAAOC,EAAWI,EAAY,CAGpD,IAAIC,EAAUP,EAAY,QAC1B,GAAI,CAACO,GAAWP,EAAY,OAASC,GAASA,EAAM,SAAU,CAC1D,IAAIO,EAAS,KAAK,MAAM,IAAIR,EAAY,KAAK,EAC7C,GAAIQ,IAAW,CAACA,EAAO,kBAAoB,CAACA,EAAO,iBAAiB,KAAK,OAAO,GAAI,CAChFA,EAAO,MAAQR,EAAY,MAC3BQ,EAAO,UAAYF,EAAaA,EAAW,IAAM,KACjD,MAAME,EACN,MACH,CACDD,EAAUN,EAAM,SAASD,EAAY,KAAK,CAC7C,CAGD,GAAQL,EAAc,eAAeY,CAAO,EAAG,CAC3C,IAAIE,EAAOF,EAAQ,KACnB,GAAI,OAAOE,GAAS,YAAc,OAAOA,EAAK,mBAAsB,WAAY,CAC5E,IAAIC,EAAO,OAAOH,EAAQ,MAAS,WAAaA,EAAQ,KAAK,KAAOA,EAAQ,KAC5E,MAAM,IAAI,MAAM,oBAAoBG,CAAI,kBAAkB,CAC7D,CACD,IAAIC,EAAaF,EAAK,kBAAkBF,EAAQ,MAAO,KAAK,OAAO,EAC/DV,EAAQG,EAAY,MACpBY,EAASD,EAAW,OACxB,KAAM,CAACC,EAAO,MAAQA,EAAO,OAAM,CAC/B,IAAIC,EAAYD,EAAO,MACvBZ,EAAY,MAAQH,EACpB,IAAIiB,EAAUD,EAAU,IACnBC,IAASA,EAAUD,EAAU,QAAU,KAAO,KAAK,OAAON,EAASP,EAAaC,EAAOC,CAAS,GAOrG,IAAIV,EAAW,CACX,GAPQ,KAAK,YAAY,CACzB,GAAGqB,EACH,IAAKC,EACL,MAAOjB,EACP,QAASkB,EAA8Bf,EAAY,QAASa,EAAU,OAAO,CACjG,EAAmB,KAAK,cAAcZ,EAAOY,CAAS,EAAGX,EAAY,GAAGA,CAAS,GAAGK,EAAQ,GAAG,GAAKA,EAAQ,IAAKD,CAAU,CAG3H,EACgB,QAASP,KAAQP,EAAS,CAMtB,GAJAO,EAAK,MAAQc,EAAU,OAASb,EAAY,MACxCD,EAAK,OAAO,KAAK,MAAM,IAAIA,EAAK,MAAOA,CAAI,EAG3CC,EAAY,MAAQD,EAAK,OAASC,EAAY,KAAM,MAAM,IAAI,MAAM,qBAAqBgB,EAAiCjB,EAAK,IAAI,CAAC,SAASiB,EAAiCV,EAAW,IAAI,CAAC,YAAYU,EAAiChB,EAAY,IAAI,CAAC,iBAAiB,EACjRH,IACA,MAAME,CACT,CACDa,EAASD,EAAW,KAAKnB,CAAQ,CACpC,CACD,MACH,CAED,GAAIQ,EAAY,KAAO,KAAM,OAE7B,IAAIiB,EAAU,KACVlB,EAAO,CACP,KAAMC,EAAY,KAClB,MAAOA,EAAY,MACnB,IAAKA,EAAY,IACjB,UAAWM,EAAaA,EAAW,IAAM,KACzC,MAAON,EAAY,MACnB,MAAOM,EAAaA,EAAW,MAAQ,EAAI,EAC3C,MAAON,EAAY,MACnB,SAAUA,EAAY,SACtB,UAAWA,EAAY,UACvB,aAAcA,EAAY,YAAY,EACtC,QAASA,EAAY,QACrB,iBAAkBA,EAAY,iBAC9B,cAAeA,EAAY,cAC3B,WAAYT,EAA+B,WAAY,CACnD,GAAI,CAACS,EAAY,cAAe,OAChC,IAAIH,EAAQ,EACZ,QAASD,KAASI,EAAY,aAAa,CAEnCJ,EAAM,KAAO,OAIjBA,EAAM,IAAM,GAAGG,EAAK,GAAG,GAAGH,EAAM,GAAG,IACnCA,EAAM,MAAQC,EACd,IAAIC,EAAQmB,EAAQ,YAAYrB,EAAOqB,EAAQ,cAAchB,EAAOL,CAAK,EAAGG,EAAK,IAAKA,CAAI,EAC1F,QAASA,KAAQD,EACbD,IACA,MAAME,CAEb,CACjB,CAAa,CACb,EACQ,MAAMA,CACT,CACD,aAAa,CACT,KAAK,MAAQ,IAAI,OACpB,CACL,CAEA,SAASR,EAA+B2B,EAAU,CAC9C,IAAIC,EAAQ,CAAA,EACRC,EAAW,KACf,MAAO,CACH,EAAE,OAAO,QAAQ,GAAK,CAClB,QAAS1B,KAAQyB,EAAM,MAAMzB,EACxB0B,IAAUA,EAAWF,KAC1B,QAASxB,KAAQ0B,EACbD,EAAM,KAAKzB,CAAI,EACf,MAAMA,CAEb,CACT,CACA,CACA,SAASqB,EAA8BM,EAAOC,EAAO,CACjD,GAAID,GAASC,EAAO,OAAQf,GAAUc,EAAMC,EAAMf,CAAO,CAAC,EAC1D,GAAIc,EAAO,OAAOA,EAClB,GAAIC,EAAO,OAAOA,CACtB,CACA,SAASN,EAAiCO,EAAK,CAC3C,OAAOA,EAAI,CAAC,EAAE,YAAa,EAAGA,EAAI,MAAM,CAAC,CAC7C,CAIA,SAASC,EAA0CnC,EAAOoC,EAASnC,EAAS,CACxE,IAAI2B,EAAcS,EAAc,QAAE,IAAI,IAAQtC,EAA8C,CAAA,CAAE,EAC1F,CAAE,SAAUI,EAAW,MAAOC,EAAQ,WAAYkC,CAAa,EAAGtC,EAgBtE,OAfiBqC,EAAAA,QAAgB,IAAI,CACjC,GAAIC,EAAY,OAAOA,EACvB,IAAI7B,EAAQmB,EAAQ,MAAM,CACtB,SAAUzB,EACV,MAAOC,CACV,EAAEH,CAAO,EACV,OAAOmC,EAAQ3B,CAAK,CAC5B,EAAO,CACCmB,EACAzB,EACAC,EACAkC,EACArC,EACAmC,CACR,CAAK,CAEL,CAuBI,SAASG,EAA0C7B,EAAM4B,EAAY,CAErE,OAAI,OAAOA,EAAW,aAAgB,WAAmBA,EAAW,YAAY5B,EAAK,GAAG,EAEjFA,EAAK,UAChB,CACA,SAAS8B,EAA0CT,EAAU,CACzD,OAAOU,EAA0CV,EAAU,CAAC,CAChE,CACA,SAASU,EAA0CV,EAAUvB,EAAO,CAChE,GAAIA,EAAQ,EAAG,OACf,IAAIkC,EAAI,EACR,QAASrC,KAAQ0B,EAAS,CACtB,GAAIW,IAAMlC,EAAO,OAAOH,EACxBqC,GACH,CACL,CAMA,SAASC,EAAyCL,EAAYM,EAAGC,EAAG,CAEhE,GAAID,EAAE,YAAcC,EAAE,UAAW,OAAOD,EAAE,MAAQC,EAAE,MAIpD,IAAIC,EAAa,CACb,GAAGC,EAAmCT,EAAYM,CAAC,EACnDA,CACR,EACQI,EAAa,CACb,GAAGD,EAAmCT,EAAYO,CAAC,EACnDA,CACR,EACQI,EAA2BH,EAAW,MAAM,EAAGE,EAAW,MAAM,EAAE,UAAU,CAACJ,EAAGF,IAAIE,IAAMI,EAAWN,CAAC,CAAC,EAC3G,OAAIO,IAA6B,IAE7BL,EAAIE,EAAWG,CAAwB,EACvCJ,EAAIG,EAAWC,CAAwB,EAChCL,EAAE,MAAQC,EAAE,OAGnBC,EAAW,UAAWpC,GAAOA,IAASmC,CAAC,GAAK,EAAU,GACjDG,EAAW,UAAWtC,GAAOA,IAASkC,CAAC,GAAK,EAAU,GAGnE,CACA,SAASG,EAAmCT,EAAY5B,EAAM,CAC1D,IAAIwC,EAAU,CAAA,EACd,MAAOxC,GAAS,KAA0B,OAASA,EAAK,YAAc,MAClEA,EAAO4B,EAAW,QAAQ5B,EAAK,SAAS,EACxCwC,EAAQ,QAAQxC,CAAI,EAExB,OAAOwC,CACX,CAGA,MAAMC,EAA8B,IAAI,QACxC,SAASC,EAA0Cd,EAAY,CAC3D,IAAIe,EAAQF,EAA4B,IAAIb,CAAU,EACtD,GAAIe,GAAS,KAAM,OAAOA,EAC1BA,EAAQ,EACR,IAAIC,EAAclD,GAAQ,CACtB,QAASC,KAAQD,EAAUC,EAAK,OAAS,UAAWiD,EAAef,EAA2ClC,EAAMiC,CAAU,CAAC,EAC1He,GACb,EACI,OAAAC,EAAWhB,CAAU,EACrBa,EAA4B,IAAIb,EAAYe,CAAK,EAC1CA,CACX","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra100.cjs","sources":["../node_modules/@react-stately/collections/dist/import.mjs"],"sourcesContent":["import $tyW6A$react, {useMemo as $tyW6A$useMemo} from \"react\";\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $c1d7fb2ec91bae71$var$Item(props) {\n    return null;\n}\n$c1d7fb2ec91bae71$var$Item.getCollectionNode = function* getCollectionNode(props, context) {\n    let { childItems: childItems, title: title, children: children } = props;\n    let rendered = props.title || props.children;\n    let textValue = props.textValue || (typeof rendered === \"string\" ? rendered : \"\") || props[\"aria-label\"] || \"\";\n    // suppressTextValueWarning is used in components like Tabs, which don't have type to select support.\n    if (!textValue && !(context === null || context === void 0 ? void 0 : context.suppressTextValueWarning)) console.warn(\"<Item> with non-plain text contents is unsupported by type to select for accessibility. Please add a `textValue` prop.\");\n    yield {\n        type: \"item\",\n        props: props,\n        rendered: rendered,\n        textValue: textValue,\n        \"aria-label\": props[\"aria-label\"],\n        hasChildNodes: $c1d7fb2ec91bae71$var$hasChildItems(props),\n        *childNodes () {\n            if (childItems) for (let child of childItems)yield {\n                type: \"item\",\n                value: child\n            };\n            else if (title) {\n                let items = [];\n                (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                    items.push({\n                        type: \"item\",\n                        element: child\n                    });\n                });\n                yield* items;\n            }\n        }\n    };\n};\nfunction $c1d7fb2ec91bae71$var$hasChildItems(props) {\n    if (props.hasChildItems != null) return props.hasChildItems;\n    if (props.childItems) return true;\n    if (props.title && (0, $tyW6A$react).Children.count(props.children) > 0) return true;\n    return false;\n}\n// We don't want getCollectionNode to show up in the type definition\nlet $c1d7fb2ec91bae71$export$6d08773d2e66f8f2 = $c1d7fb2ec91bae71$var$Item;\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $9fc4852771d079eb$var$Section(props) {\n    return null;\n}\n$9fc4852771d079eb$var$Section.getCollectionNode = function* getCollectionNode(props) {\n    let { children: children, title: title, items: items } = props;\n    yield {\n        type: \"section\",\n        props: props,\n        hasChildNodes: true,\n        rendered: title,\n        \"aria-label\": props[\"aria-label\"],\n        *childNodes () {\n            if (typeof children === \"function\") {\n                if (!items) throw new Error(\"props.children was a function but props.items is missing\");\n                for (let item of items)yield {\n                    type: \"item\",\n                    value: item,\n                    renderer: children\n                };\n            } else {\n                let items = [];\n                (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                    items.push({\n                        type: \"item\",\n                        element: child\n                    });\n                });\n                yield* items;\n            }\n        }\n    };\n};\n// We don't want getCollectionNode to show up in the type definition\nlet $9fc4852771d079eb$export$6e2c8f0811a474ce = $9fc4852771d079eb$var$Section;\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nclass $eb2240fc39a57fa5$export$bf788dd355e3a401 {\n    build(props, context) {\n        this.context = context;\n        return $eb2240fc39a57fa5$var$iterable(()=>this.iterateCollection(props));\n    }\n    *iterateCollection(props) {\n        let { children: children, items: items } = props;\n        if (typeof children === \"function\") {\n            if (!items) throw new Error(\"props.children was a function but props.items is missing\");\n            for (let item of props.items)yield* this.getFullNode({\n                value: item\n            }, {\n                renderer: children\n            });\n        } else {\n            let items = [];\n            (0, $tyW6A$react).Children.forEach(children, (child)=>{\n                items.push(child);\n            });\n            let index = 0;\n            for (let item of items){\n                let nodes = this.getFullNode({\n                    element: item,\n                    index: index\n                }, {});\n                for (let node of nodes){\n                    index++;\n                    yield node;\n                }\n            }\n        }\n    }\n    getKey(item, partialNode, state, parentKey) {\n        if (item.key != null) return item.key;\n        if (partialNode.type === \"cell\" && partialNode.key != null) return `${parentKey}${partialNode.key}`;\n        let v = partialNode.value;\n        if (v != null) {\n            var _v_key;\n            let key = (_v_key = v.key) !== null && _v_key !== void 0 ? _v_key : v.id;\n            if (key == null) throw new Error(\"No key found for item\");\n            return key;\n        }\n        return parentKey ? `${parentKey}.${partialNode.index}` : `$.${partialNode.index}`;\n    }\n    getChildState(state, partialNode) {\n        return {\n            renderer: partialNode.renderer || state.renderer\n        };\n    }\n    *getFullNode(partialNode, state, parentKey, parentNode) {\n        // If there's a value instead of an element on the node, and a parent renderer function is available,\n        // use it to render an element for the value.\n        let element = partialNode.element;\n        if (!element && partialNode.value && state && state.renderer) {\n            let cached = this.cache.get(partialNode.value);\n            if (cached && (!cached.shouldInvalidate || !cached.shouldInvalidate(this.context))) {\n                cached.index = partialNode.index;\n                cached.parentKey = parentNode ? parentNode.key : null;\n                yield cached;\n                return;\n            }\n            element = state.renderer(partialNode.value);\n        }\n        // If there's an element with a getCollectionNode function on its type, then it's a supported component.\n        // Call this function to get a partial node, and recursively build a full node from there.\n        if ((0, $tyW6A$react).isValidElement(element)) {\n            let type = element.type;\n            if (typeof type !== \"function\" && typeof type.getCollectionNode !== \"function\") {\n                let name = typeof element.type === \"function\" ? element.type.name : element.type;\n                throw new Error(`Unknown element <${name}> in collection.`);\n            }\n            let childNodes = type.getCollectionNode(element.props, this.context);\n            let index = partialNode.index;\n            let result = childNodes.next();\n            while(!result.done && result.value){\n                let childNode = result.value;\n                partialNode.index = index;\n                let nodeKey = childNode.key;\n                if (!nodeKey) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);\n                let nodes = this.getFullNode({\n                    ...childNode,\n                    key: nodeKey,\n                    index: index,\n                    wrapper: $eb2240fc39a57fa5$var$compose(partialNode.wrapper, childNode.wrapper)\n                }, this.getChildState(state, childNode), parentKey ? `${parentKey}${element.key}` : element.key, parentNode);\n                let children = [\n                    ...nodes\n                ];\n                for (let node of children){\n                    // Cache the node based on its value\n                    node.value = childNode.value || partialNode.value;\n                    if (node.value) this.cache.set(node.value, node);\n                    // The partial node may have specified a type for the child in order to specify a constraint.\n                    // Verify that the full node that was built recursively matches this type.\n                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$eb2240fc39a57fa5$var$capitalize(node.type)}> in <${$eb2240fc39a57fa5$var$capitalize(parentNode.type)}>. Only <${$eb2240fc39a57fa5$var$capitalize(partialNode.type)}> is supported.`);\n                    index++;\n                    yield node;\n                }\n                result = childNodes.next(children);\n            }\n            return;\n        }\n        // Ignore invalid elements\n        if (partialNode.key == null) return;\n        // Create full node\n        let builder = this;\n        let node = {\n            type: partialNode.type,\n            props: partialNode.props,\n            key: partialNode.key,\n            parentKey: parentNode ? parentNode.key : null,\n            value: partialNode.value,\n            level: parentNode ? parentNode.level + 1 : 0,\n            index: partialNode.index,\n            rendered: partialNode.rendered,\n            textValue: partialNode.textValue,\n            \"aria-label\": partialNode[\"aria-label\"],\n            wrapper: partialNode.wrapper,\n            shouldInvalidate: partialNode.shouldInvalidate,\n            hasChildNodes: partialNode.hasChildNodes,\n            childNodes: $eb2240fc39a57fa5$var$iterable(function*() {\n                if (!partialNode.hasChildNodes) return;\n                let index = 0;\n                for (let child of partialNode.childNodes()){\n                    // Ensure child keys are globally unique by prepending the parent node's key\n                    if (child.key != null) // TODO: Remove this line entirely and enforce that users always provide unique keys.\n                    // Currently this line will have issues when a parent has a key `a` and a child with key `bc`\n                    // but another parent has key `ab` and its child has a key `c`. The combined keys would result in both\n                    // children having a key of `abc`.\n                    child.key = `${node.key}${child.key}`;\n                    child.index = index;\n                    let nodes = builder.getFullNode(child, builder.getChildState(state, child), node.key, node);\n                    for (let node of nodes){\n                        index++;\n                        yield node;\n                    }\n                }\n            })\n        };\n        yield node;\n    }\n    constructor(){\n        this.cache = new WeakMap();\n    }\n}\n// Wraps an iterator function as an iterable object, and caches the results.\nfunction $eb2240fc39a57fa5$var$iterable(iterator) {\n    let cache = [];\n    let iterable = null;\n    return {\n        *[Symbol.iterator] () {\n            for (let item of cache)yield item;\n            if (!iterable) iterable = iterator();\n            for (let item of iterable){\n                cache.push(item);\n                yield item;\n            }\n        }\n    };\n}\nfunction $eb2240fc39a57fa5$var$compose(outer, inner) {\n    if (outer && inner) return (element)=>outer(inner(element));\n    if (outer) return outer;\n    if (inner) return inner;\n}\nfunction $eb2240fc39a57fa5$var$capitalize(str) {\n    return str[0].toUpperCase() + str.slice(1);\n}\n\n\n\nfunction $7613b1592d41b092$export$6cd28814d92fa9c9(props, factory, context) {\n    let builder = (0, $tyW6A$useMemo)(()=>new (0, $eb2240fc39a57fa5$export$bf788dd355e3a401)(), []);\n    let { children: children, items: items, collection: collection } = props;\n    let result = (0, $tyW6A$useMemo)(()=>{\n        if (collection) return collection;\n        let nodes = builder.build({\n            children: children,\n            items: items\n        }, context);\n        return factory(nodes);\n    }, [\n        builder,\n        children,\n        items,\n        collection,\n        context,\n        factory\n    ]);\n    return result;\n}\n\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ /*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ function $c5a24bc478652b5f$export$1005530eda016c13(node, collection) {\n    // New API: call collection.getChildren with the node key.\n    if (typeof collection.getChildren === \"function\") return collection.getChildren(node.key);\n    // Old API: access childNodes directly.\n    return node.childNodes;\n}\nfunction $c5a24bc478652b5f$export$fbdeaa6a76694f71(iterable) {\n    return $c5a24bc478652b5f$export$5f3398f8733f90e2(iterable, 0);\n}\nfunction $c5a24bc478652b5f$export$5f3398f8733f90e2(iterable, index) {\n    if (index < 0) return undefined;\n    let i = 0;\n    for (let item of iterable){\n        if (i === index) return item;\n        i++;\n    }\n}\nfunction $c5a24bc478652b5f$export$7475b2c64539e4cf(iterable) {\n    let lastItem = undefined;\n    for (let value of iterable)lastItem = value;\n    return lastItem;\n}\nfunction $c5a24bc478652b5f$export$8c434b3a7a4dad6(collection, a, b) {\n    // If the two nodes have the same parent, compare their indices.\n    if (a.parentKey === b.parentKey) return a.index - b.index;\n    // Otherwise, collect all of the ancestors from each node, and find the first one that doesn't match starting from the root.\n    // Include the base nodes in case we are comparing nodes of different levels so that we can compare the higher node to the lower level node's\n    // ancestor of the same level\n    let aAncestors = [\n        ...$c5a24bc478652b5f$var$getAncestors(collection, a),\n        a\n    ];\n    let bAncestors = [\n        ...$c5a24bc478652b5f$var$getAncestors(collection, b),\n        b\n    ];\n    let firstNonMatchingAncestor = aAncestors.slice(0, bAncestors.length).findIndex((a, i)=>a !== bAncestors[i]);\n    if (firstNonMatchingAncestor !== -1) {\n        // Compare the indices of two children within the common ancestor.\n        a = aAncestors[firstNonMatchingAncestor];\n        b = bAncestors[firstNonMatchingAncestor];\n        return a.index - b.index;\n    }\n    // If there isn't a non matching ancestor, we might be in a case where one of the nodes is the ancestor of the other.\n    if (aAncestors.findIndex((node)=>node === b) >= 0) return 1;\n    else if (bAncestors.findIndex((node)=>node === a) >= 0) return -1;\n    // 🤷\n    return -1;\n}\nfunction $c5a24bc478652b5f$var$getAncestors(collection, node) {\n    let parents = [];\n    while((node === null || node === void 0 ? void 0 : node.parentKey) != null){\n        node = collection.getItem(node.parentKey);\n        parents.unshift(node);\n    }\n    return parents;\n}\n\n\nconst $453cc9f0df89c0a5$var$cache = new WeakMap();\nfunction $453cc9f0df89c0a5$export$77d5aafae4e095b2(collection) {\n    let count = $453cc9f0df89c0a5$var$cache.get(collection);\n    if (count != null) return count;\n    count = 0;\n    let countItems = (items)=>{\n        for (let item of items)if (item.type === \"section\") countItems((0, $c5a24bc478652b5f$export$1005530eda016c13)(item, collection));\n        else count++;\n    };\n    countItems(collection);\n    $453cc9f0df89c0a5$var$cache.set(collection, count);\n    return count;\n}\n\n\n\n\n\n\nexport {$c1d7fb2ec91bae71$export$6d08773d2e66f8f2 as Item, $9fc4852771d079eb$export$6e2c8f0811a474ce as Section, $7613b1592d41b092$export$6cd28814d92fa9c9 as useCollection, $453cc9f0df89c0a5$export$77d5aafae4e095b2 as getItemCount, $c5a24bc478652b5f$export$1005530eda016c13 as getChildNodes, $c5a24bc478652b5f$export$fbdeaa6a76694f71 as getFirstItem, $c5a24bc478652b5f$export$7475b2c64539e4cf as getLastItem, $c5a24bc478652b5f$export$5f3398f8733f90e2 as getNthItem, $c5a24bc478652b5f$export$8c434b3a7a4dad6 as compareNodeOrder, $eb2240fc39a57fa5$export$bf788dd355e3a401 as CollectionBuilder};\n//# sourceMappingURL=module.js.map\n"],"names":["$c1d7fb2ec91bae71$var$Item","props","context","childItems","title","children","rendered","textValue","$c1d7fb2ec91bae71$var$hasChildItems","child","items","$tyW6A$react","$c1d7fb2ec91bae71$export$6d08773d2e66f8f2","$eb2240fc39a57fa5$export$bf788dd355e3a401","$eb2240fc39a57fa5$var$iterable","item","index","nodes","node","partialNode","state","parentKey","v","_v_key","key","parentNode","element","cached","type","name","childNodes","result","childNode","nodeKey","$eb2240fc39a57fa5$var$compose","$eb2240fc39a57fa5$var$capitalize","builder","iterator","cache","iterable","outer","inner","str","$7613b1592d41b092$export$6cd28814d92fa9c9","factory","$tyW6A$useMemo","collection","$c5a24bc478652b5f$export$1005530eda016c13","$c5a24bc478652b5f$export$fbdeaa6a76694f71","$c5a24bc478652b5f$export$5f3398f8733f90e2","i","$c5a24bc478652b5f$export$8c434b3a7a4dad6","a","b","aAncestors","$c5a24bc478652b5f$var$getAncestors","bAncestors","firstNonMatchingAncestor","parents","$453cc9f0df89c0a5$var$cache","$453cc9f0df89c0a5$export$77d5aafae4e095b2","count","countItems"],"mappings":"yGAuBA,SAASA,EAA2BC,EAAO,CACvC,OAAO,IACX,CACAD,EAA2B,kBAAoB,UAA4BC,EAAOC,EAAS,CACvF,GAAI,CAAE,WAAYC,EAAY,MAAOC,EAAO,SAAUC,CAAU,EAAGJ,EAC/DK,EAAWL,EAAM,OAASA,EAAM,SAChCM,EAAYN,EAAM,YAAc,OAAOK,GAAa,SAAWA,EAAW,KAAOL,EAAM,YAAY,GAAK,GAExG,CAACM,GAAa,EAAEL,GAAY,MAAsCA,EAAQ,2BAA2B,QAAQ,KAAK,wHAAwH,EAC9O,KAAM,CACF,KAAM,OACN,MAAOD,EACP,SAAUK,EACV,UAAWC,EACX,aAAcN,EAAM,YAAY,EAChC,cAAeO,EAAoCP,CAAK,EACxD,CAAC,YAAc,CACX,GAAIE,EAAY,QAASM,KAASN,EAAW,KAAM,CAC/C,KAAM,OACN,MAAOM,CACvB,UACqBL,EAAO,CACZ,IAAIM,EAAQ,CAAA,EACRC,EAAc,SAAS,QAAQN,EAAWI,GAAQ,CAClDC,EAAM,KAAK,CACP,KAAM,OACN,QAASD,CACjC,CAAqB,CACrB,CAAiB,EACD,MAAOC,CACV,CACJ,CACT,CACA,EACA,SAASF,EAAoCP,EAAO,CAChD,OAAIA,EAAM,eAAiB,KAAaA,EAAM,cAC1C,GAAAA,EAAM,YACNA,EAAM,OAAaU,EAAc,SAAS,MAAMV,EAAM,QAAQ,EAAI,EAE1E,CAEG,IAACW,EAA4CZ,EAuEhD,MAAMa,CAA0C,CAC5C,MAAMZ,EAAOC,EAAS,CAClB,YAAK,QAAUA,EACRY,EAA+B,IAAI,KAAK,kBAAkBb,CAAK,CAAC,CAC1E,CACD,CAAC,kBAAkBA,EAAO,CACtB,GAAI,CAAE,SAAUI,EAAU,MAAOK,CAAK,EAAKT,EAC3C,GAAI,OAAOI,GAAa,WAAY,CAChC,GAAI,CAACK,EAAO,MAAM,IAAI,MAAM,0DAA0D,EACtF,QAASK,KAAQd,EAAM,MAAM,MAAO,KAAK,YAAY,CACjD,MAAOc,CACvB,EAAe,CACC,SAAUV,CAC1B,CAAa,CACb,KAAe,CACH,IAAIK,EAAQ,CAAA,EACRC,EAAc,SAAS,QAAQN,EAAWI,GAAQ,CAClDC,EAAM,KAAKD,CAAK,CAChC,CAAa,EACD,IAAIO,EAAQ,EACZ,QAASD,KAAQL,EAAM,CACnB,IAAIO,EAAQ,KAAK,YAAY,CACzB,QAASF,EACT,MAAOC,CACV,EAAE,CAAE,CAAA,EACL,QAASE,KAAQD,EACbD,IACA,MAAME,CAEb,CACJ,CACJ,CACD,OAAOH,EAAMI,EAAaC,EAAOC,EAAW,CACxC,GAAIN,EAAK,KAAO,KAAM,OAAOA,EAAK,IAClC,GAAII,EAAY,OAAS,QAAUA,EAAY,KAAO,KAAM,MAAO,GAAGE,CAAS,GAAGF,EAAY,GAAG,GACjG,IAAIG,EAAIH,EAAY,MACpB,GAAIG,GAAK,KAAM,CACX,IAAIC,EACJ,IAAIC,GAAOD,EAASD,EAAE,OAAS,MAAQC,IAAW,OAASA,EAASD,EAAE,GACtE,GAAIE,GAAO,KAAM,MAAM,IAAI,MAAM,uBAAuB,EACxD,OAAOA,CACV,CACD,OAAOH,EAAY,GAAGA,CAAS,IAAIF,EAAY,KAAK,GAAK,KAAKA,EAAY,KAAK,EAClF,CACD,cAAcC,EAAOD,EAAa,CAC9B,MAAO,CACH,SAAUA,EAAY,UAAYC,EAAM,QACpD,CACK,CACD,CAAC,YAAYD,EAAaC,EAAOC,EAAWI,EAAY,CAGpD,IAAIC,EAAUP,EAAY,QAC1B,GAAI,CAACO,GAAWP,EAAY,OAASC,GAASA,EAAM,SAAU,CAC1D,IAAIO,EAAS,KAAK,MAAM,IAAIR,EAAY,KAAK,EAC7C,GAAIQ,IAAW,CAACA,EAAO,kBAAoB,CAACA,EAAO,iBAAiB,KAAK,OAAO,GAAI,CAChFA,EAAO,MAAQR,EAAY,MAC3BQ,EAAO,UAAYF,EAAaA,EAAW,IAAM,KACjD,MAAME,EACN,MACH,CACDD,EAAUN,EAAM,SAASD,EAAY,KAAK,CAC7C,CAGD,GAAQR,EAAc,eAAee,CAAO,EAAG,CAC3C,IAAIE,EAAOF,EAAQ,KACnB,GAAI,OAAOE,GAAS,YAAc,OAAOA,EAAK,mBAAsB,WAAY,CAC5E,IAAIC,EAAO,OAAOH,EAAQ,MAAS,WAAaA,EAAQ,KAAK,KAAOA,EAAQ,KAC5E,MAAM,IAAI,MAAM,oBAAoBG,CAAI,kBAAkB,CAC7D,CACD,IAAIC,EAAaF,EAAK,kBAAkBF,EAAQ,MAAO,KAAK,OAAO,EAC/DV,EAAQG,EAAY,MACpBY,EAASD,EAAW,OACxB,KAAM,CAACC,EAAO,MAAQA,EAAO,OAAM,CAC/B,IAAIC,EAAYD,EAAO,MACvBZ,EAAY,MAAQH,EACpB,IAAIiB,EAAUD,EAAU,IACnBC,IAASA,EAAUD,EAAU,QAAU,KAAO,KAAK,OAAON,EAASP,EAAaC,EAAOC,CAAS,GAOrG,IAAIhB,EAAW,CACX,GAPQ,KAAK,YAAY,CACzB,GAAG2B,EACH,IAAKC,EACL,MAAOjB,EACP,QAASkB,EAA8Bf,EAAY,QAASa,EAAU,OAAO,CACjG,EAAmB,KAAK,cAAcZ,EAAOY,CAAS,EAAGX,EAAY,GAAGA,CAAS,GAAGK,EAAQ,GAAG,GAAKA,EAAQ,IAAKD,CAAU,CAG3H,EACgB,QAASP,KAAQb,EAAS,CAMtB,GAJAa,EAAK,MAAQc,EAAU,OAASb,EAAY,MACxCD,EAAK,OAAO,KAAK,MAAM,IAAIA,EAAK,MAAOA,CAAI,EAG3CC,EAAY,MAAQD,EAAK,OAASC,EAAY,KAAM,MAAM,IAAI,MAAM,qBAAqBgB,EAAiCjB,EAAK,IAAI,CAAC,SAASiB,EAAiCV,EAAW,IAAI,CAAC,YAAYU,EAAiChB,EAAY,IAAI,CAAC,iBAAiB,EACjRH,IACA,MAAME,CACT,CACDa,EAASD,EAAW,KAAKzB,CAAQ,CACpC,CACD,MACH,CAED,GAAIc,EAAY,KAAO,KAAM,OAE7B,IAAIiB,EAAU,KACVlB,EAAO,CACP,KAAMC,EAAY,KAClB,MAAOA,EAAY,MACnB,IAAKA,EAAY,IACjB,UAAWM,EAAaA,EAAW,IAAM,KACzC,MAAON,EAAY,MACnB,MAAOM,EAAaA,EAAW,MAAQ,EAAI,EAC3C,MAAON,EAAY,MACnB,SAAUA,EAAY,SACtB,UAAWA,EAAY,UACvB,aAAcA,EAAY,YAAY,EACtC,QAASA,EAAY,QACrB,iBAAkBA,EAAY,iBAC9B,cAAeA,EAAY,cAC3B,WAAYL,EAA+B,WAAY,CACnD,GAAI,CAACK,EAAY,cAAe,OAChC,IAAIH,EAAQ,EACZ,QAASP,KAASU,EAAY,aAAa,CAEnCV,EAAM,KAAO,OAIjBA,EAAM,IAAM,GAAGS,EAAK,GAAG,GAAGT,EAAM,GAAG,IACnCA,EAAM,MAAQO,EACd,IAAIC,EAAQmB,EAAQ,YAAY3B,EAAO2B,EAAQ,cAAchB,EAAOX,CAAK,EAAGS,EAAK,IAAKA,CAAI,EAC1F,QAASA,KAAQD,EACbD,IACA,MAAME,CAEb,CACjB,CAAa,CACb,EACQ,MAAMA,CACT,CACD,aAAa,CACT,KAAK,MAAQ,IAAI,OACpB,CACL,CAEA,SAASJ,EAA+BuB,EAAU,CAC9C,IAAIC,EAAQ,CAAA,EACRC,EAAW,KACf,MAAO,CACH,EAAE,OAAO,QAAQ,GAAK,CAClB,QAASxB,KAAQuB,EAAM,MAAMvB,EACxBwB,IAAUA,EAAWF,KAC1B,QAAStB,KAAQwB,EACbD,EAAM,KAAKvB,CAAI,EACf,MAAMA,CAEb,CACT,CACA,CACA,SAASmB,EAA8BM,EAAOC,EAAO,CACjD,GAAID,GAASC,EAAO,OAAQf,GAAUc,EAAMC,EAAMf,CAAO,CAAC,EAC1D,GAAIc,EAAO,OAAOA,EAClB,GAAIC,EAAO,OAAOA,CACtB,CACA,SAASN,EAAiCO,EAAK,CAC3C,OAAOA,EAAI,CAAC,EAAE,YAAa,EAAGA,EAAI,MAAM,CAAC,CAC7C,CAIA,SAASC,EAA0C1C,EAAO2C,EAAS1C,EAAS,CACxE,IAAIkC,EAAcS,EAAc,QAAE,IAAI,IAAQhC,EAA8C,CAAA,CAAE,EAC1F,CAAE,SAAUR,EAAU,MAAOK,EAAO,WAAYoC,CAAY,EAAG7C,EAgBnE,OAfiB4C,EAAAA,QAAgB,IAAI,CACjC,GAAIC,EAAY,OAAOA,EACvB,IAAI7B,EAAQmB,EAAQ,MAAM,CACtB,SAAU/B,EACV,MAAOK,CACV,EAAER,CAAO,EACV,OAAO0C,EAAQ3B,CAAK,CAC5B,EAAO,CACCmB,EACA/B,EACAK,EACAoC,EACA5C,EACA0C,CACR,CAAK,CAEL,CAuBI,SAASG,EAA0C7B,EAAM4B,EAAY,CAErE,OAAI,OAAOA,EAAW,aAAgB,WAAmBA,EAAW,YAAY5B,EAAK,GAAG,EAEjFA,EAAK,UAChB,CACA,SAAS8B,EAA0CT,EAAU,CACzD,OAAOU,EAA0CV,EAAU,CAAC,CAChE,CACA,SAASU,EAA0CV,EAAUvB,EAAO,CAChE,GAAIA,EAAQ,EAAG,OACf,IAAIkC,EAAI,EACR,QAASnC,KAAQwB,EAAS,CACtB,GAAIW,IAAMlC,EAAO,OAAOD,EACxBmC,GACH,CACL,CAMA,SAASC,EAAyCL,EAAYM,EAAGC,EAAG,CAEhE,GAAID,EAAE,YAAcC,EAAE,UAAW,OAAOD,EAAE,MAAQC,EAAE,MAIpD,IAAIC,EAAa,CACb,GAAGC,EAAmCT,EAAYM,CAAC,EACnDA,CACR,EACQI,EAAa,CACb,GAAGD,EAAmCT,EAAYO,CAAC,EACnDA,CACR,EACQI,EAA2BH,EAAW,MAAM,EAAGE,EAAW,MAAM,EAAE,UAAU,CAACJ,EAAGF,IAAIE,IAAMI,EAAWN,CAAC,CAAC,EAC3G,OAAIO,IAA6B,IAE7BL,EAAIE,EAAWG,CAAwB,EACvCJ,EAAIG,EAAWC,CAAwB,EAChCL,EAAE,MAAQC,EAAE,OAGnBC,EAAW,UAAWpC,GAAOA,IAASmC,CAAC,GAAK,EAAU,GACjDG,EAAW,UAAWtC,GAAOA,IAASkC,CAAC,GAAK,EAAU,GAGnE,CACA,SAASG,EAAmCT,EAAY5B,EAAM,CAC1D,IAAIwC,EAAU,CAAA,EACd,MAAOxC,GAAS,KAA0B,OAASA,EAAK,YAAc,MAClEA,EAAO4B,EAAW,QAAQ5B,EAAK,SAAS,EACxCwC,EAAQ,QAAQxC,CAAI,EAExB,OAAOwC,CACX,CAGA,MAAMC,EAA8B,IAAI,QACxC,SAASC,EAA0Cd,EAAY,CAC3D,IAAIe,EAAQF,EAA4B,IAAIb,CAAU,EACtD,GAAIe,GAAS,KAAM,OAAOA,EAC1BA,EAAQ,EACR,IAAIC,EAAcpD,GAAQ,CACtB,QAASK,KAAQL,EAAUK,EAAK,OAAS,UAAW+C,EAAef,EAA2ChC,EAAM+B,CAAU,CAAC,EAC1He,GACb,EACI,OAAAC,EAAWhB,CAAU,EACrBa,EAA4B,IAAIb,EAAYe,CAAK,EAC1CA,CACX","x_google_ignoreList":[0]}

package/dist/lyra100.js

@@ -1,103 +1,138 @@
-import x, { useMemo as v } from "react";
-class k {
+import y, { useMemo as b } from "react";
+function k(l) {
+  return null;
+}
+k.getCollectionNode = function* (e, t) {
+  let { childItems: r, title: n, children: i } = e, u = e.title || e.children, d = e.textValue || (typeof u == "string" ? u : "") || e["aria-label"] || "";
+  !d && !(t != null && t.suppressTextValueWarning) && console.warn("<Item> with non-plain text contents is unsupported by type to select for accessibility. Please add a `textValue` prop."), yield {
+    type: "item",
+    props: e,
+    rendered: u,
+    textValue: d,
+    "aria-label": e["aria-label"],
+    hasChildNodes: p(e),
+    *childNodes() {
+      if (r)
+        for (let f of r)
+          yield {
+            type: "item",
+            value: f
+          };
+      else if (n) {
+        let f = [];
+        y.Children.forEach(i, (c) => {
+          f.push({
+            type: "item",
+            element: c
+          });
+        }), yield* f;
+      }
+    }
+  };
+};
+function p(l) {
+  return l.hasChildItems != null ? l.hasChildItems : !!(l.childItems || l.title && y.Children.count(l.children) > 0);
+}
+let A = k;
+class w {
   build(e, t) {
-    return this.context = t, p(() => this.iterateCollection(e));
+    return this.context = t, v(() => this.iterateCollection(e));
   }
   *iterateCollection(e) {
-    let { children: t, items: i } = e;
+    let { children: t, items: r } = e;
     if (typeof t == "function") {
-      if (!i)
+      if (!r)
         throw new Error("props.children was a function but props.items is missing");
-      for (let l of e.items)
+      for (let n of e.items)
         yield* this.getFullNode({
-          value: l
+          value: n
         }, {
           renderer: t
         });
     } else {
-      let l = [];
-      x.Children.forEach(t, (f) => {
-        l.push(f);
+      let n = [];
+      y.Children.forEach(t, (u) => {
+        n.push(u);
       });
-      let r = 0;
-      for (let f of l) {
-        let c = this.getFullNode({
-          element: f,
-          index: r
+      let i = 0;
+      for (let u of n) {
+        let d = this.getFullNode({
+          element: u,
+          index: i
         }, {});
-        for (let u of c)
-          r++, yield u;
+        for (let f of d)
+          i++, yield f;
       }
     }
   }
-  getKey(e, t, i, l) {
+  getKey(e, t, r, n) {
     if (e.key != null)
       return e.key;
     if (t.type === "cell" && t.key != null)
-      return `${l}${t.key}`;
-    let r = t.value;
-    if (r != null) {
-      var f;
-      let c = (f = r.key) !== null && f !== void 0 ? f : r.id;
-      if (c == null)
+      return `${n}${t.key}`;
+    let i = t.value;
+    if (i != null) {
+      var u;
+      let d = (u = i.key) !== null && u !== void 0 ? u : i.id;
+      if (d == null)
         throw new Error("No key found for item");
-      return c;
+      return d;
     }
-    return l ? `${l}.${t.index}` : `$.${t.index}`;
+    return n ? `${n}.${t.index}` : `$.${t.index}`;
   }
   getChildState(e, t) {
     return {
       renderer: t.renderer || e.renderer
     };
   }
-  *getFullNode(e, t, i, l) {
-    let r = e.element;
-    if (!r && e.value && t && t.renderer) {
-      let u = this.cache.get(e.value);
-      if (u && (!u.shouldInvalidate || !u.shouldInvalidate(this.context))) {
-        u.index = e.index, u.parentKey = l ? l.key : null, yield u;
+  *getFullNode(e, t, r, n) {
+    let i = e.element;
+    if (!i && e.value && t && t.renderer) {
+      let f = this.cache.get(e.value);
+      if (f && (!f.shouldInvalidate || !f.shouldInvalidate(this.context))) {
+        f.index = e.index, f.parentKey = n ? n.key : null, yield f;
         return;
       }
-      r = t.renderer(e.value);
+      i = t.renderer(e.value);
     }
-    if (x.isValidElement(r)) {
-      let u = r.type;
-      if (typeof u != "function" && typeof u.getCollectionNode != "function") {
-        let d = typeof r.type == "function" ? r.type.name : r.type;
-        throw new Error(`Unknown element <${d}> in collection.`);
+    if (y.isValidElement(i)) {
+      let f = i.type;
+      if (typeof f != "function" && typeof f.getCollectionNode != "function") {
+        let s = typeof i.type == "function" ? i.type.name : i.type;
+        throw new Error(`Unknown element <${s}> in collection.`);
       }
-      let s = u.getCollectionNode(r.props, this.context), y = e.index, h = s.next();
+      let c = f.getCollectionNode(i.props, this.context), a = e.index, h = c.next();
       for (; !h.done && h.value; ) {
-        let d = h.value;
-        e.index = y;
-        let $ = d.key;
-        $ || ($ = d.element ? null : this.getKey(r, e, t, i));
-        let m = [
+        let s = h.value;
+        e.index = a;
+        let $ = s.key;
+        $ || ($ = s.element ? null : this.getKey(i, e, t, r));
+        let x = [
           ...this.getFullNode({
-            ...d,
+            ...s,
             key: $,
-            index: y,
-            wrapper: w(e.wrapper, d.wrapper)
-          }, this.getChildState(t, d), i ? `${i}${r.key}` : r.key, l)
+            index: a,
+            wrapper: I(e.wrapper, s.wrapper)
+          }, this.getChildState(t, s), r ? `${r}${i.key}` : i.key, n)
         ];
-        for (let o of m) {
-          if (o.value = d.value || e.value, o.value && this.cache.set(o.value, o), e.type && o.type !== e.type)
-            throw new Error(`Unsupported type <${a(o.type)}> in <${a(l.type)}>. Only <${a(e.type)}> is supported.`);
-          y++, yield o;
+        for (let o of x) {
+          if (o.value = s.value || e.value, o.value && this.cache.set(o.value, o), e.type && o.type !== e.type)
+            throw new Error(`Unsupported type <${m(o.type)}> in <${m(n.type)}>. Only <${m(e.type)}> is supported.`);
+          a++, yield o;
         }
-        h = s.next(m);
+        h = c.next(x);
       }
       return;
     }
     if (e.key == null)
       return;
-    let f = this, c = {
+    let u = this, d = {
       type: e.type,
       props: e.props,
       key: e.key,
-      parentKey: l ? l.key : null,
+      parentKey: n ? n.key : null,
       value: e.value,
-      level: l ? l.level + 1 : 0,
+      level: n ? n.level + 1 : 0,
       index: e.index,
       rendered: e.rendered,
       textValue: e.textValue,
@@ -105,118 +140,119 @@ class k {
       wrapper: e.wrapper,
       shouldInvalidate: e.shouldInvalidate,
       hasChildNodes: e.hasChildNodes,
-      childNodes: p(function* () {
+      childNodes: v(function* () {
         if (!e.hasChildNodes)
           return;
-        let u = 0;
-        for (let s of e.childNodes()) {
-          s.key != null && (s.key = `${c.key}${s.key}`), s.index = u;
-          let y = f.getFullNode(s, f.getChildState(t, s), c.key, c);
-          for (let h of y)
-            u++, yield h;
+        let f = 0;
+        for (let c of e.childNodes()) {
+          c.key != null && (c.key = `${d.key}${c.key}`), c.index = f;
+          let a = u.getFullNode(c, u.getChildState(t, c), d.key, d);
+          for (let h of a)
+            f++, yield h;
         }
       })
     };
-    yield c;
+    yield d;
   }
   constructor() {
     this.cache = /* @__PURE__ */ new WeakMap();
   }
 }
-function p(n) {
+function v(l) {
   let e = [], t = null;
   return {
     *[Symbol.iterator]() {
-      for (let i of e)
-        yield i;
-      t || (t = n());
-      for (let i of t)
-        e.push(i), yield i;
+      for (let r of e)
+        yield r;
+      t || (t = l());
+      for (let r of t)
+        e.push(r), yield r;
     }
   };
 }
-function w(n, e) {
-  if (n && e)
-    return (t) => n(e(t));
-  if (n)
-    return n;
+function I(l, e) {
+  if (l && e)
+    return (t) => l(e(t));
+  if (l)
+    return l;
   if (e)
     return e;
 }
-function a(n) {
-  return n[0].toUpperCase() + n.slice(1);
+function m(l) {
+  return l[0].toUpperCase() + l.slice(1);
 }
-function K(n, e, t) {
-  let i = v(() => new k(), []), { children: l, items: r, collection: f } = n;
-  return v(() => {
-    if (f)
-      return f;
-    let u = i.build({
-      children: l,
-      items: r
+function M(l, e, t) {
+  let r = b(() => new w(), []), { children: n, items: i, collection: u } = l;
+  return b(() => {
+    if (u)
+      return u;
+    let f = r.build({
+      children: n,
+      items: i
     }, t);
-    return e(u);
+    return e(f);
   }, [
-    i,
-    l,
     r,
-    f,
+    n,
+    i,
+    u,
     t,
     e
   ]);
 }
-function C(n, e) {
-  return typeof e.getChildren == "function" ? e.getChildren(n.key) : n.childNodes;
+function E(l, e) {
+  return typeof e.getChildren == "function" ? e.getChildren(l.key) : l.childNodes;
 }
-function A(n) {
-  return I(n, 0);
+function S(l) {
+  return V(l, 0);
 }
-function I(n, e) {
+function V(l, e) {
   if (e < 0)
     return;
   let t = 0;
-  for (let i of n) {
+  for (let r of l) {
     if (t === e)
-      return i;
+      return r;
     t++;
   }
 }
-function M(n, e, t) {
+function U(l, e, t) {
   if (e.parentKey === t.parentKey)
     return e.index - t.index;
-  let i = [
-    ...b(n, e),
+  let r = [
+    ...g(l, e),
     e
-  ], l = [
-    ...b(n, t),
+  ], n = [
+    ...g(l, t),
     t
-  ], r = i.slice(0, l.length).findIndex((f, c) => f !== l[c]);
-  return r !== -1 ? (e = i[r], t = l[r], e.index - t.index) : i.findIndex((f) => f === t) >= 0 ? 1 : (l.findIndex((f) => f === e) >= 0, -1);
+  ], i = r.slice(0, n.length).findIndex((u, d) => u !== n[d]);
+  return i !== -1 ? (e = r[i], t = n[i], e.index - t.index) : r.findIndex((u) => u === t) >= 0 ? 1 : (n.findIndex((u) => u === e) >= 0, -1);
 }
-function b(n, e) {
+function g(l, e) {
   let t = [];
   for (; (e == null ? void 0 : e.parentKey) != null; )
-    e = n.getItem(e.parentKey), t.unshift(e);
+    e = l.getItem(e.parentKey), t.unshift(e);
   return t;
 }
-const g = /* @__PURE__ */ new WeakMap();
-function S(n) {
-  let e = g.get(n);
+const C = /* @__PURE__ */ new WeakMap();
+function W(l) {
+  let e = C.get(l);
   if (e != null)
     return e;
   e = 0;
-  let t = (i) => {
-    for (let l of i)
-      l.type === "section" ? t(C(l, n)) : e++;
+  let t = (r) => {
+    for (let n of r)
+      n.type === "section" ? t(E(n, l)) : e++;
   };
-  return t(n), g.set(n, e), e;
+  return t(l), C.set(l, e), e;
 }
 export {
-  k as CollectionBuilder,
-  M as compareNodeOrder,
-  C as getChildNodes,
-  A as getFirstItem,
-  S as getItemCount,
-  I as getNthItem,
-  K as useCollection
+  w as CollectionBuilder,
+  A as Item,
+  U as compareNodeOrder,
+  E as getChildNodes,
+  S as getFirstItem,
+  W as getItemCount,
+  V as getNthItem,
+  M as useCollection
 };