@react-stately/collections 3.11.0 → 3.12.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2019 Adobe
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/CollectionBuilder.main.js

@@ -34,15 +34,20 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
         });
         else if (typeof children === 'function') {
             if (!items) throw new Error('props.children was a function but props.items is missing');
-            for (let item of props.items)yield* this.getFullNode({
-                value: item
-            }, {
-                renderer: children
-            });
+            let index = 0;
+            for (let item of items){
+                yield* this.getFullNode({
+                    value: item,
+                    index: index
+                }, {
+                    renderer: children
+                });
+                index++;
+            }
         } else {
             let items = [];
             (0, ($parcel$interopDefault($ioO2y$react))).Children.forEach(children, (child)=>{
-                items.push(child);
+                if (child) items.push(child);
             });
             let index = 0;
             for (let item of items){
@@ -80,7 +85,8 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
             (0, ($parcel$interopDefault($ioO2y$react))).Children.forEach(partialNode.element.props.children, (child)=>{
                 children.push(child);
             });
-            let index = partialNode.index;
+            var _partialNode_index;
+            let index = (_partialNode_index = partialNode.index) !== null && _partialNode_index !== void 0 ? _partialNode_index : 0;
             for (const child of children)yield* this.getFullNode({
                 element: child,
                 index: index++
@@ -105,17 +111,19 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
         if ((0, ($parcel$interopDefault($ioO2y$react))).isValidElement(element)) {
             let type = element.type;
             if (typeof type !== 'function' && typeof type.getCollectionNode !== 'function') {
-                let name = typeof element.type === 'function' ? element.type.name : element.type;
+                let name = element.type;
                 throw new Error(`Unknown element <${name}> in collection.`);
             }
             let childNodes = type.getCollectionNode(element.props, this.context);
-            let index = partialNode.index;
+            var _partialNode_index1;
+            let index = (_partialNode_index1 = partialNode.index) !== null && _partialNode_index1 !== void 0 ? _partialNode_index1 : 0;
             let result = childNodes.next();
             while(!result.done && result.value){
                 let childNode = result.value;
                 partialNode.index = index;
-                let nodeKey = childNode.key;
-                if (!nodeKey) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
+                var _childNode_key;
+                let nodeKey = (_childNode_key = childNode.key) !== null && _childNode_key !== void 0 ? _childNode_key : null;
+                if (nodeKey == null) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
                 let nodes = this.getFullNode({
                     ...childNode,
                     key: nodeKey,
@@ -126,12 +134,14 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
                     ...nodes
                 ];
                 for (let node of children){
+                    var _childNode_value, _ref;
                     // Cache the node based on its value
-                    node.value = childNode.value || partialNode.value;
+                    node.value = (_ref = (_childNode_value = childNode.value) !== null && _childNode_value !== void 0 ? _childNode_value : partialNode.value) !== null && _ref !== void 0 ? _ref : null;
                     if (node.value) this.cache.set(node.value, node);
+                    var _parentNode_type;
                     // The partial node may have specified a type for the child in order to specify a constraint.
                     // Verify that the full node that was built recursively matches this type.
-                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$51588fd411aace25$var$capitalize(node.type)}> in <${$51588fd411aace25$var$capitalize(parentNode.type)}>. Only <${$51588fd411aace25$var$capitalize(partialNode.type)}> is supported.`);
+                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$51588fd411aace25$var$capitalize(node.type)}> in <${$51588fd411aace25$var$capitalize((_parentNode_type = parentNode === null || parentNode === void 0 ? void 0 : parentNode.type) !== null && _parentNode_type !== void 0 ? _parentNode_type : 'unknown parent type')}>. Only <${$51588fd411aace25$var$capitalize(partialNode.type)}> is supported.`);
                     index++;
                     yield node;
                 }
@@ -140,25 +150,26 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
             return;
         }
         // Ignore invalid elements
-        if (partialNode.key == null) return;
+        if (partialNode.key == null || partialNode.type == null) return;
         // Create full node
         let builder = this;
+        var _partialNode_value, _partialNode_textValue;
         let node = {
             type: partialNode.type,
             props: partialNode.props,
             key: partialNode.key,
             parentKey: parentNode ? parentNode.key : null,
-            value: partialNode.value,
+            value: (_partialNode_value = partialNode.value) !== null && _partialNode_value !== void 0 ? _partialNode_value : null,
             level: parentNode ? parentNode.level + 1 : 0,
             index: partialNode.index,
             rendered: partialNode.rendered,
-            textValue: partialNode.textValue,
+            textValue: (_partialNode_textValue = partialNode.textValue) !== null && _partialNode_textValue !== void 0 ? _partialNode_textValue : '',
             'aria-label': partialNode['aria-label'],
             wrapper: partialNode.wrapper,
             shouldInvalidate: partialNode.shouldInvalidate,
-            hasChildNodes: partialNode.hasChildNodes,
+            hasChildNodes: partialNode.hasChildNodes || false,
             childNodes: $51588fd411aace25$var$iterable(function*() {
-                if (!partialNode.hasChildNodes) return;
+                if (!partialNode.hasChildNodes || !partialNode.childNodes) return;
                 let index = 0;
                 for (let child of partialNode.childNodes()){
                     // Ensure child keys are globally unique by prepending the parent node's key
@@ -167,8 +178,10 @@ class $51588fd411aace25$export$bf788dd355e3a401 {
                     // but another parent has key `ab` and its child has a key `c`. The combined keys would result in both
                     // children having a key of `abc`.
                     child.key = `${node.key}${child.key}`;
-                    child.index = index;
-                    let nodes = builder.getFullNode(child, builder.getChildState(state, child), node.key, node);
+                    let nodes = builder.getFullNode({
+                        ...child,
+                        index: index
+                    }, builder.getChildState(state, child), node.key, node);
                     for (let node of nodes){
                         index++;
                         yield node;

package/dist/CollectionBuilder.main.js.map

@@ -1 +1 @@
-{"mappings":";;;;;;;;;;;;AAAA;;;;;;;;;;CAUC;AAUM,MAAM;IAIX,MAAM,KAAwB,EAAE,OAAiB,EAAE;QACjD,IAAI,CAAC,OAAO,GAAG;QACf,OAAO,+BAAS,IAAM,IAAI,CAAC,iBAAiB,CAAC;IAC/C;IAEA,CAAS,kBAAkB,KAAwB,EAAsB;QACvE,IAAI,YAAC,QAAQ,SAAE,KAAK,EAAC,GAAG;QAExB,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAmC,aAAa,SAAS,IAAI,KAAK,CAAA,GAAA,sCAAI,EAAE,QAAQ,EACtG,OAAO,IAAI,CAAC,iBAAiB,CAAC;YAC5B,UAAU,SAAS,KAAK,CAAC,QAAQ;mBACjC;QACF;aACK,IAAI,OAAO,aAAa,YAAY;YACzC,IAAI,CAAC,OACH,MAAM,IAAI,MAAM;YAGlB,KAAK,IAAI,QAAQ,MAAM,KAAK,CAC1B,OAAO,IAAI,CAAC,WAAW,CAAC;gBACtB,OAAO;YACT,GAAG;gBAAC,UAAU;YAAQ;QAE1B,OAAO;YACL,IAAI,QAAgC,EAAE;YACtC,CAAA,GAAA,sCAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAA;gBAC/B,MAAM,IAAI,CAAC;YACb;YAEA,IAAI,QAAQ;YACZ,KAAK,IAAI,QAAQ,MAAO;gBACtB,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC;oBAC3B,SAAS;oBACT,OAAO;gBACT,GAAG,CAAC;gBAEJ,KAAK,IAAI,QAAQ,MAAO;oBACtB;oBACA,MAAM;gBACR;YACF;QACF;IACF;IAEQ,OAAO,IAA0B,EAAE,WAA2B,EAAE,KAA6B,EAAE,SAAe,EAAO;QAC3H,IAAI,KAAK,GAAG,IAAI,MACd,OAAO,KAAK,GAAG;QAGjB,IAAI,YAAY,IAAI,KAAK,UAAU,YAAY,GAAG,IAAI,MACpD,OAAO,CAAC,EAAE,UAAU,EAAE,YAAY,GAAG,CAAC,CAAC;QAGzC,IAAI,IAAI,YAAY,KAAK;QACzB,IAAI,KAAK,MAAM;gBACH;YAAV,IAAI,MAAM,CAAA,SAAA,EAAE,GAAG,cAAL,oBAAA,SAAS,EAAE,EAAE;YACvB,IAAI,OAAO,MACT,MAAM,IAAI,MAAM;YAGlB,OAAO;QACT;QAEA,OAAO,YAAY,CAAC,EAAE,UAAU,CAAC,EAAE,YAAY,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,YAAY,KAAK,CAAC,CAAC;IACnF;IAEQ,cAAc,KAA6B,EAAE,WAA2B,EAAE;QAChF,OAAO;YACL,UAAU,YAAY,QAAQ,IAAI,MAAM,QAAQ;QAClD;IACF;IAEA,CAAS,YAAY,WAA2B,EAAE,KAA6B,EAAE,SAAe,EAAE,UAAoB,EAAsB;QAC1I,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAmC,YAAY,OAAO,KAAK,YAAY,OAAO,CAAC,IAAI,KAAK,CAAA,GAAA,sCAAI,EAAE,QAAQ,EAAE;YAC9H,IAAI,WAAmC,EAAE;YAEzC,CAAA,GAAA,sCAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,YAAY,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAA;gBACzD,SAAS,IAAI,CAAC;YAChB;YAEA,IAAI,QAAQ,YAAY,KAAK;YAE7B,KAAK,MAAM,SAAS,SAClB,OAAO,IAAI,CAAC,WAAW,CAAC;gBACtB,SAAS;gBACT,OAAO;YACT,GAAG,OAAO,WAAW;YAGvB;QACF;QAEA,qGAAqG;QACrG,6CAA6C;QAC7C,IAAI,UAAU,YAAY,OAAO;QACjC,IAAI,CAAC,WAAW,YAAY,KAAK,IAAI,SAAS,MAAM,QAAQ,EAAE;YAC5D,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,KAAK;YAC7C,IAAI,UAAW,CAAA,CAAC,OAAO,gBAAgB,IAAI,CAAC,OAAO,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAA,GAAI;gBAClF,OAAO,KAAK,GAAG,YAAY,KAAK;gBAChC,OAAO,SAAS,GAAG,aAAa,WAAW,GAAG,GAAG;gBACjD,MAAM;gBACN;YACF;YAEA,UAAU,MAAM,QAAQ,CAAC,YAAY,KAAK;QAC5C;QAEA,wGAAwG;QACxG,0FAA0F;QAC1F,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAC,UAAU;YACjC,IAAI,OAAO,QAAQ,IAAI;YACvB,IAAI,OAAO,SAAS,cAAc,OAAO,KAAK,iBAAiB,KAAK,YAAY;gBAC9E,IAAI,OAAO,OAAO,QAAQ,IAAI,KAAK,aAAa,QAAQ,IAAI,CAAC,IAAI,GAAG,QAAQ,IAAI;gBAChF,MAAM,IAAI,MAAM,CAAC,iBAAiB,EAAE,KAAK,gBAAgB,CAAC;YAC5D;YAEA,IAAI,aAAa,KAAK,iBAAiB,CAAC,QAAQ,KAAK,EAAE,IAAI,CAAC,OAAO;YACnE,IAAI,QAAQ,YAAY,KAAK;YAC7B,IAAI,SAAS,WAAW,IAAI;YAC5B,MAAO,CAAC,OAAO,IAAI,IAAI,OAAO,KAAK,CAAE;gBACnC,IAAI,YAAY,OAAO,KAAK;gBAE5B,YAAY,KAAK,GAAG;gBAEpB,IAAI,UAAU,UAAU,GAAG;gBAC3B,IAAI,CAAC,SACH,UAAU,UAAU,OAAO,GAAG,OAAO,IAAI,CAAC,MAAM,CAAC,SAAiC,aAAa,OAAO;gBAGxG,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC;oBAC3B,GAAG,SAAS;oBACZ,KAAK;2BACL;oBACA,SAAS,8BAAQ,YAAY,OAAO,EAAE,UAAU,OAAO;gBACzD,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,YAAY,YAAY,CAAC,EAAE,UAAU,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,EAAE;gBAEjG,IAAI,WAAW;uBAAI;iBAAM;gBACzB,KAAK,IAAI,QAAQ,SAAU;oBACzB,oCAAoC;oBACpC,KAAK,KAAK,GAAG,UAAU,KAAK,IAAI,YAAY,KAAK;oBACjD,IAAI,KAAK,KAAK,EACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE;oBAG7B,6FAA6F;oBAC7F,0EAA0E;oBAC1E,IAAI,YAAY,IAAI,IAAI,KAAK,IAAI,KAAK,YAAY,IAAI,EACpD,MAAM,IAAI,MAAM,CAAC,kBAAkB,EAAE,iCAAW,KAAK,IAAI,EAAE,MAAM,EAAE,iCAAW,WAAW,IAAI,EAAE,SAAS,EAAE,iCAAW,YAAY,IAAI,EAAE,eAAe,CAAC;oBAGzJ;oBACA,MAAM;gBACR;gBAEA,SAAS,WAAW,IAAI,CAAC;YAC3B;YAEA;QACF;QAEA,0BAA0B;QAC1B,IAAI,YAAY,GAAG,IAAI,MACrB;QAGF,mBAAmB;QACnB,IAAI,UAAU,IAAI;QAClB,IAAI,OAAgB;YAClB,MAAM,YAAY,IAAI;YACtB,OAAO,YAAY,KAAK;YACxB,KAAK,YAAY,GAAG;YACpB,WAAW,aAAa,WAAW,GAAG,GAAG;YACzC,OAAO,YAAY,KAAK;YACxB,OAAO,aAAa,WAAW,KAAK,GAAG,IAAI;YAC3C,OAAO,YAAY,KAAK;YACxB,UAAU,YAAY,QAAQ;YAC9B,WAAW,YAAY,SAAS;YAChC,cAAc,WAAW,CAAC,aAAa;YACvC,SAAS,YAAY,OAAO;YAC5B,kBAAkB,YAAY,gBAAgB;YAC9C,eAAe,YAAY,aAAa;YACxC,YAAY,+BAAS;gBACnB,IAAI,CAAC,YAAY,aAAa,EAC5B;gBAGF,IAAI,QAAQ;gBACZ,KAAK,IAAI,SAAS,YAAY,UAAU,GAAI;oBAC1C,4EAA4E;oBAC5E,IAAI,MAAM,GAAG,IAAI,MACf,qFAAqF;oBACrF,6FAA6F;oBAC7F,sGAAsG;oBACtG,kCAAkC;oBAClC,MAAM,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;oBAGvC,MAAM,KAAK,GAAG;oBACd,IAAI,QAAQ,QAAQ,WAAW,CAAC,OAAO,QAAQ,aAAa,CAAC,OAAO,QAAQ,KAAK,GAAG,EAAE;oBACtF,KAAK,IAAI,QAAQ,MAAO;wBACtB;wBACA,MAAM;oBACR;gBACF;YACF;QACF;QAEA,MAAM;IACR;;aAlNQ,QAA6B,IAAI;;AAmN3C;AAEA,4EAA4E;AAC5E,SAAS,+BAAY,QAAyC;IAC5D,IAAI,QAAQ,EAAE;IACd,IAAI,WAAW;IACf,OAAO;QACL,CAAC,CAAC,OAAO,QAAQ,CAAC;YAChB,KAAK,IAAI,QAAQ,MACf,MAAM;YAGR,IAAI,CAAC,UACH,WAAW;YAGb,KAAK,IAAI,QAAQ,SAAU;gBACzB,MAAM,IAAI,CAAC;gBACX,MAAM;YACR;QACF;IACF;AACF;AAGA,SAAS,8BAAQ,KAAqB,EAAE,KAAqB;IAC3D,IAAI,SAAS,OACX,OAAO,CAAC,UAAY,MAAM,MAAM;IAGlC,IAAI,OACF,OAAO;IAGT,IAAI,OACF,OAAO;AAEX;AAEA,SAAS,iCAAW,GAAW;IAC7B,OAAO,GAAG,CAAC,EAAE,CAAC,WAAW,KAAK,IAAI,KAAK,CAAC;AAC1C","sources":["packages/@react-stately/collections/src/CollectionBuilder.ts"],"sourcesContent":["/*\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\nimport {CollectionBase, CollectionElement, Key, Node} from '@react-types/shared';\nimport {PartialNode} from './types';\nimport React, {ReactElement} from 'react';\n\ninterface CollectionBuilderState {\n  renderer?: (value: any) => ReactElement\n}\n\nexport class CollectionBuilder<T extends object> {\n  private context?: unknown;\n  private cache: WeakMap<T, Node<T>> = new WeakMap();\n\n  build(props: CollectionBase<T>, context?: unknown) {\n    this.context = context;\n    return iterable(() => this.iterateCollection(props));\n  }\n\n  private *iterateCollection(props: CollectionBase<T>): Generator<Node<T>> {\n    let {children, items} = props;\n\n    if (React.isValidElement<{children: CollectionElement<T>}>(children) && children.type === React.Fragment) {\n      yield* this.iterateCollection({\n        children: children.props.children,\n        items\n      });\n    } else if (typeof children === 'function') {\n      if (!items) {\n        throw new Error('props.children was a function but props.items is missing');\n      }\n\n      for (let item of props.items) {\n        yield* this.getFullNode({\n          value: item\n        }, {renderer: children});\n      }\n    } else {\n      let items: CollectionElement<T>[] = [];\n      React.Children.forEach(children, child => {\n        items.push(child);\n      });\n\n      let index = 0;\n      for (let item of items) {\n        let nodes = this.getFullNode({\n          element: item,\n          index: index\n        }, {});\n\n        for (let node of nodes) {\n          index++;\n          yield node;\n        }\n      }\n    }\n  }\n\n  private getKey(item: CollectionElement<T>, partialNode: PartialNode<T>, state: CollectionBuilderState, parentKey?: Key): Key {\n    if (item.key != null) {\n      return item.key;\n    }\n\n    if (partialNode.type === 'cell' && partialNode.key != null) {\n      return `${parentKey}${partialNode.key}`;\n    }\n\n    let v = partialNode.value as any;\n    if (v != null) {\n      let key = v.key ?? v.id;\n      if (key == null) {\n        throw new Error('No key found for item');\n      }\n\n      return key;\n    }\n\n    return parentKey ? `${parentKey}.${partialNode.index}` : `$.${partialNode.index}`;\n  }\n\n  private getChildState(state: CollectionBuilderState, partialNode: PartialNode<T>) {\n    return {\n      renderer: partialNode.renderer || state.renderer\n    };\n  }\n\n  private *getFullNode(partialNode: PartialNode<T>, state: CollectionBuilderState, parentKey?: Key, parentNode?: Node<T>): Generator<Node<T>> {\n    if (React.isValidElement<{children: CollectionElement<T>}>(partialNode.element) && partialNode.element.type === React.Fragment) {\n      let children: CollectionElement<T>[] = [];\n\n      React.Children.forEach(partialNode.element.props.children, child => {\n        children.push(child);\n      });\n\n      let index = partialNode.index;\n\n      for (const child of children) {\n        yield* this.getFullNode({\n          element: child,\n          index: index++\n        }, state, parentKey, parentNode);\n      }\n\n      return;\n    }\n\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\n      element = state.renderer(partialNode.value);\n    }\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 (React.isValidElement(element)) {\n      let type = element.type as any;\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\n      let childNodes = type.getCollectionNode(element.props, this.context) as Generator<PartialNode<T>, void, Node<T>[]>;\n      let index = partialNode.index;\n      let result = childNodes.next();\n      while (!result.done && result.value) {\n        let childNode = result.value;\n\n        partialNode.index = index;\n\n        let nodeKey = childNode.key;\n        if (!nodeKey) {\n          nodeKey = childNode.element ? null : this.getKey(element as CollectionElement<T>, partialNode, state, parentKey);\n        }\n\n        let nodes = this.getFullNode({\n          ...childNode,\n          key: nodeKey,\n          index,\n          wrapper: compose(partialNode.wrapper, childNode.wrapper)\n        }, this.getChildState(state, childNode), parentKey ? `${parentKey}${element.key}` : element.key, parentNode);\n\n        let children = [...nodes];\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) {\n            this.cache.set(node.value, node);\n          }\n\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) {\n            throw new Error(`Unsupported type <${capitalize(node.type)}> in <${capitalize(parentNode.type)}>. Only <${capitalize(partialNode.type)}> is supported.`);\n          }\n\n          index++;\n          yield node;\n        }\n\n        result = childNodes.next(children);\n      }\n\n      return;\n    }\n\n    // Ignore invalid elements\n    if (partialNode.key == null) {\n      return;\n    }\n\n    // Create full node\n    let builder = this;\n    let node: Node<T> = {\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: iterable(function *() {\n        if (!partialNode.hasChildNodes) {\n          return;\n        }\n\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) {\n            // 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          }\n\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\n    yield node;\n  }\n}\n\n// Wraps an iterator function as an iterable object, and caches the results.\nfunction iterable<T>(iterator: () => IterableIterator<Node<T>>): Iterable<Node<T>> {\n  let cache = [];\n  let iterable = null;\n  return {\n    *[Symbol.iterator]() {\n      for (let item of cache) {\n        yield item;\n      }\n\n      if (!iterable) {\n        iterable = iterator();\n      }\n\n      for (let item of iterable) {\n        cache.push(item);\n        yield item;\n      }\n    }\n  };\n}\n\ntype Wrapper = (element: ReactElement) => ReactElement;\nfunction compose(outer: Wrapper | void, inner: Wrapper | void): Wrapper {\n  if (outer && inner) {\n    return (element) => outer(inner(element));\n  }\n\n  if (outer) {\n    return outer;\n  }\n\n  if (inner) {\n    return inner;\n  }\n}\n\nfunction capitalize(str: string) {\n  return str[0].toUpperCase() + str.slice(1);\n}\n"],"names":[],"version":3,"file":"CollectionBuilder.main.js.map"}
+{"mappings":";;;;;;;;;;;;AAAA;;;;;;;;;;CAUC;AAcM,MAAM;IAIX,MAAM,KAAiC,EAAE,OAAiB,EAAE;QAC1D,IAAI,CAAC,OAAO,GAAG;QACf,OAAO,+BAAS,IAAM,IAAI,CAAC,iBAAiB,CAAC;IAC/C;IAEA,CAAS,kBAAkB,KAAiC,EAAsB;QAChF,IAAI,YAAC,QAAQ,SAAE,KAAK,EAAC,GAAG;QAExB,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAmC,aAAa,SAAS,IAAI,KAAK,CAAA,GAAA,sCAAI,EAAE,QAAQ,EACtG,OAAO,IAAI,CAAC,iBAAiB,CAAC;YAC5B,UAAU,SAAS,KAAK,CAAC,QAAQ;mBACjC;QACF;aACK,IAAI,OAAO,aAAa,YAAY;YACzC,IAAI,CAAC,OACH,MAAM,IAAI,MAAM;YAGlB,IAAI,QAAQ;YACZ,KAAK,IAAI,QAAQ,MAAO;gBACtB,OAAO,IAAI,CAAC,WAAW,CAAC;oBACtB,OAAO;2BACP;gBACF,GAAG;oBAAC,UAAU;gBAAQ;gBACtB;YACF;QACF,OAAO;YACL,IAAI,QAAgC,EAAE;YACtC,CAAA,GAAA,sCAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAA;gBAC/B,IAAI,OACF,MAAM,IAAI,CAAC;YAEf;YAEA,IAAI,QAAQ;YACZ,KAAK,IAAI,QAAQ,MAAO;gBACtB,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC;oBAC3B,SAAS;oBACT,OAAO;gBACT,GAAG,CAAC;gBAEJ,KAAK,IAAI,QAAQ,MAAO;oBACtB;oBACA,MAAM;gBACR;YACF;QACF;IACF;IAEQ,OAAO,IAAuC,EAAE,WAA2B,EAAE,KAA6B,EAAE,SAAsB,EAAO;QAC/I,IAAI,KAAK,GAAG,IAAI,MACd,OAAO,KAAK,GAAG;QAGjB,IAAI,YAAY,IAAI,KAAK,UAAU,YAAY,GAAG,IAAI,MACpD,OAAO,GAAG,YAAY,YAAY,GAAG,EAAE;QAGzC,IAAI,IAAI,YAAY,KAAK;QACzB,IAAI,KAAK,MAAM;gBACH;YAAV,IAAI,MAAM,CAAA,SAAA,EAAE,GAAG,cAAL,oBAAA,SAAS,EAAE,EAAE;YACvB,IAAI,OAAO,MACT,MAAM,IAAI,MAAM;YAGlB,OAAO;QACT;QAEA,OAAO,YAAY,GAAG,UAAU,CAAC,EAAE,YAAY,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,YAAY,KAAK,EAAE;IACnF;IAEQ,cAAc,KAA6B,EAAE,WAA2B,EAAE;QAChF,OAAO;YACL,UAAU,YAAY,QAAQ,IAAI,MAAM,QAAQ;QAClD;IACF;IAEA,CAAS,YAAY,WAA6C,EAAE,KAA6B,EAAE,SAAsB,EAAE,UAAoB,EAAsB;QACnK,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAmC,YAAY,OAAO,KAAK,YAAY,OAAO,CAAC,IAAI,KAAK,CAAA,GAAA,sCAAI,EAAE,QAAQ,EAAE;YAC9H,IAAI,WAAmC,EAAE;YAEzC,CAAA,GAAA,sCAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,YAAY,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAA;gBACzD,SAAS,IAAI,CAAC;YAChB;gBAEY;YAAZ,IAAI,QAAQ,CAAA,qBAAA,YAAY,KAAK,cAAjB,gCAAA,qBAAqB;YAEjC,KAAK,MAAM,SAAS,SAClB,OAAO,IAAI,CAAC,WAAW,CAAC;gBACtB,SAAS;gBACT,OAAO;YACT,GAAG,OAAO,WAAW;YAGvB;QACF;QAEA,qGAAqG;QACrG,6CAA6C;QAC7C,IAAI,UAAU,YAAY,OAAO;QACjC,IAAI,CAAC,WAAW,YAAY,KAAK,IAAI,SAAS,MAAM,QAAQ,EAAE;YAC5D,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,KAAK;YAC7C,IAAI,UAAW,CAAA,CAAC,OAAO,gBAAgB,IAAI,CAAC,OAAO,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAA,GAAI;gBAClF,OAAO,KAAK,GAAG,YAAY,KAAK;gBAChC,OAAO,SAAS,GAAG,aAAa,WAAW,GAAG,GAAG;gBACjD,MAAM;gBACN;YACF;YAEA,UAAU,MAAM,QAAQ,CAAC,YAAY,KAAK;QAC5C;QAEA,wGAAwG;QACxG,0FAA0F;QAC1F,IAAI,CAAA,GAAA,sCAAI,EAAE,cAAc,CAAC,UAAU;YACjC,IAAI,OAAO,QAAQ,IAAI;YACvB,IAAI,OAAO,SAAS,cAAc,OAAO,KAAK,iBAAiB,KAAK,YAAY;gBAC9E,IAAI,OAAO,QAAQ,IAAI;gBACvB,MAAM,IAAI,MAAM,CAAC,iBAAiB,EAAE,KAAK,gBAAgB,CAAC;YAC5D;YAEA,IAAI,aAAa,KAAK,iBAAiB,CAAC,QAAQ,KAAK,EAAE,IAAI,CAAC,OAAO;gBACvD;YAAZ,IAAI,QAAQ,CAAA,sBAAA,YAAY,KAAK,cAAjB,iCAAA,sBAAqB;YACjC,IAAI,SAAS,WAAW,IAAI;YAC5B,MAAO,CAAC,OAAO,IAAI,IAAI,OAAO,KAAK,CAAE;gBACnC,IAAI,YAAY,OAAO,KAAK;gBAE5B,YAAY,KAAK,GAAG;oBAEN;gBAAd,IAAI,UAAU,CAAA,iBAAA,UAAU,GAAG,cAAb,4BAAA,iBAAiB;gBAC/B,IAAI,WAAW,MACb,UAAU,UAAU,OAAO,GAAG,OAAO,IAAI,CAAC,MAAM,CAAC,SAA8C,aAAa,OAAO;gBAGrH,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC;oBAC3B,GAAG,SAAS;oBACZ,KAAK;2BACL;oBACA,SAAS,8BAAQ,YAAY,OAAO,EAAE,UAAU,OAAO;gBACzD,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,YAAY,YAAY,GAAG,YAAY,QAAQ,GAAG,EAAE,GAAG,QAAQ,GAAG,EAAE;gBAEjG,IAAI,WAAW;uBAAI;iBAAM;gBACzB,KAAK,IAAI,QAAQ,SAAU;wBAEZ,kBAAA;oBADb,oCAAoC;oBACpC,KAAK,KAAK,GAAG,CAAA,OAAA,CAAA,mBAAA,UAAU,KAAK,cAAf,8BAAA,mBAAmB,YAAY,KAAK,cAApC,kBAAA,OAAwC;oBACrD,IAAI,KAAK,KAAK,EACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE;wBAMmD;oBAHhF,6FAA6F;oBAC7F,0EAA0E;oBAC1E,IAAI,YAAY,IAAI,IAAI,KAAK,IAAI,KAAK,YAAY,IAAI,EACpD,MAAM,IAAI,MAAM,CAAC,kBAAkB,EAAE,iCAAW,KAAK,IAAI,EAAE,MAAM,EAAE,iCAAW,CAAA,mBAAA,uBAAA,iCAAA,WAAY,IAAI,cAAhB,8BAAA,mBAAoB,uBAAuB,SAAS,EAAE,iCAAW,YAAY,IAAI,EAAE,eAAe,CAAC;oBAGnL;oBACA,MAAM;gBACR;gBAEA,SAAS,WAAW,IAAI,CAAC;YAC3B;YAEA;QACF;QAEA,0BAA0B;QAC1B,IAAI,YAAY,GAAG,IAAI,QAAQ,YAAY,IAAI,IAAI,MACjD;QAGF,mBAAmB;QACnB,IAAI,UAAU,IAAI;YAMT,oBAII;QATb,IAAI,OAAgB;YAClB,MAAM,YAAY,IAAI;YACtB,OAAO,YAAY,KAAK;YACxB,KAAK,YAAY,GAAG;YACpB,WAAW,aAAa,WAAW,GAAG,GAAG;YACzC,OAAO,CAAA,qBAAA,YAAY,KAAK,cAAjB,gCAAA,qBAAqB;YAC5B,OAAO,aAAa,WAAW,KAAK,GAAG,IAAI;YAC3C,OAAO,YAAY,KAAK;YACxB,UAAU,YAAY,QAAQ;YAC9B,WAAW,CAAA,yBAAA,YAAY,SAAS,cAArB,oCAAA,yBAAyB;YACpC,cAAc,WAAW,CAAC,aAAa;YACvC,SAAS,YAAY,OAAO;YAC5B,kBAAkB,YAAY,gBAAgB;YAC9C,eAAe,YAAY,aAAa,IAAI;YAC5C,YAAY,+BAAS;gBACnB,IAAI,CAAC,YAAY,aAAa,IAAI,CAAC,YAAY,UAAU,EACvD;gBAGF,IAAI,QAAQ;gBACZ,KAAK,IAAI,SAAS,YAAY,UAAU,GAAI;oBAC1C,4EAA4E;oBAC5E,IAAI,MAAM,GAAG,IAAI,MACf,qFAAqF;oBACrF,6FAA6F;oBAC7F,sGAAsG;oBACtG,kCAAkC;oBAClC,MAAM,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,EAAE;oBAGvC,IAAI,QAAQ,QAAQ,WAAW,CAAC;wBAAC,GAAG,KAAK;+BAAE;oBAAK,GAAG,QAAQ,aAAa,CAAC,OAAO,QAAQ,KAAK,GAAG,EAAE;oBAClG,KAAK,IAAI,QAAQ,MAAO;wBACtB;wBACA,MAAM;oBACR;gBACF;YACF;QACF;QAEA,MAAM;IACR;;aAtNQ,QAA6B,IAAI;;AAuN3C;AAEA,4EAA4E;AAC5E,SAAS,+BAAY,QAAyC;IAC5D,IAAI,QAAwB,EAAE;IAC9B,IAAI,WAA6C;IACjD,OAAO;QACL,CAAC,CAAC,OAAO,QAAQ,CAAC;YAChB,KAAK,IAAI,QAAQ,MACf,MAAM;YAGR,IAAI,CAAC,UACH,WAAW;YAGb,KAAK,IAAI,QAAQ,SAAU;gBACzB,MAAM,IAAI,CAAC;gBACX,MAAM;YACR;QACF;IACF;AACF;AAGA,SAAS,8BAAQ,KAAqB,EAAE,KAAqB;IAC3D,IAAI,SAAS,OACX,OAAO,CAAC,UAAY,MAAM,MAAM;IAGlC,IAAI,OACF,OAAO;IAGT,IAAI,OACF,OAAO;AAEX;AAEA,SAAS,iCAAW,GAAW;IAC7B,OAAO,GAAG,CAAC,EAAE,CAAC,WAAW,KAAK,IAAI,KAAK,CAAC;AAC1C","sources":["packages/@react-stately/collections/src/CollectionBuilder.ts"],"sourcesContent":["/*\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\nimport {CollectionBase, CollectionElement, Key, Node} from '@react-types/shared';\nimport {PartialNode} from './types';\nimport React, {ReactElement} from 'react';\n\ninterface CollectionBuilderState {\n  renderer?: (value: any) => ReactElement | null\n}\n\ninterface CollectReactElement<T> extends ReactElement {\n  getCollectionNode(props: any, context: any): Generator<PartialNode<T>, void, Node<T>[]>\n}\n\nexport class CollectionBuilder<T extends object> {\n  private context?: unknown;\n  private cache: WeakMap<T, Node<T>> = new WeakMap();\n\n  build(props: Partial<CollectionBase<T>>, context?: unknown) {\n    this.context = context;\n    return iterable(() => this.iterateCollection(props));\n  }\n\n  private *iterateCollection(props: Partial<CollectionBase<T>>): Generator<Node<T>> {\n    let {children, items} = props;\n\n    if (React.isValidElement<{children: CollectionElement<T>}>(children) && children.type === React.Fragment) {\n      yield* this.iterateCollection({\n        children: children.props.children,\n        items\n      });\n    } else if (typeof children === 'function') {\n      if (!items) {\n        throw new Error('props.children was a function but props.items is missing');\n      }\n\n      let index = 0;\n      for (let item of items) {\n        yield* this.getFullNode({\n          value: item,\n          index\n        }, {renderer: children});\n        index++;\n      }\n    } else {\n      let items: CollectionElement<T>[] = [];\n      React.Children.forEach(children, child => {\n        if (child) {\n          items.push(child);\n        }\n      });\n\n      let index = 0;\n      for (let item of items) {\n        let nodes = this.getFullNode({\n          element: item,\n          index: index\n        }, {});\n\n        for (let node of nodes) {\n          index++;\n          yield node;\n        }\n      }\n    }\n  }\n\n  private getKey(item: NonNullable<CollectionElement<T>>, partialNode: PartialNode<T>, state: CollectionBuilderState, parentKey?: Key | null): Key {\n    if (item.key != null) {\n      return item.key;\n    }\n\n    if (partialNode.type === 'cell' && partialNode.key != null) {\n      return `${parentKey}${partialNode.key}`;\n    }\n\n    let v = partialNode.value as any;\n    if (v != null) {\n      let key = v.key ?? v.id;\n      if (key == null) {\n        throw new Error('No key found for item');\n      }\n\n      return key;\n    }\n\n    return parentKey ? `${parentKey}.${partialNode.index}` : `$.${partialNode.index}`;\n  }\n\n  private getChildState(state: CollectionBuilderState, partialNode: PartialNode<T>) {\n    return {\n      renderer: partialNode.renderer || state.renderer\n    };\n  }\n\n  private *getFullNode(partialNode: PartialNode<T> & {index: number}, state: CollectionBuilderState, parentKey?: Key | null, parentNode?: Node<T>): Generator<Node<T>> {\n    if (React.isValidElement<{children: CollectionElement<T>}>(partialNode.element) && partialNode.element.type === React.Fragment) {\n      let children: CollectionElement<T>[] = [];\n\n      React.Children.forEach(partialNode.element.props.children, child => {\n        children.push(child);\n      });\n\n      let index = partialNode.index ?? 0;\n\n      for (const child of children) {\n        yield* this.getFullNode({\n          element: child,\n          index: index++\n        }, state, parentKey, parentNode);\n      }\n\n      return;\n    }\n\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\n      element = state.renderer(partialNode.value);\n    }\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 (React.isValidElement(element)) {\n      let type = element.type as unknown as CollectReactElement<T>;\n      if (typeof type !== 'function' && typeof type.getCollectionNode !== 'function') {\n        let name = element.type;\n        throw new Error(`Unknown element <${name}> in collection.`);\n      }\n\n      let childNodes = type.getCollectionNode(element.props, this.context) as Generator<PartialNode<T>, void, Node<T>[]>;\n      let index = partialNode.index ?? 0;\n      let result = childNodes.next();\n      while (!result.done && result.value) {\n        let childNode = result.value;\n\n        partialNode.index = index;\n\n        let nodeKey = childNode.key ?? null;\n        if (nodeKey == null) {\n          nodeKey = childNode.element ? null : this.getKey(element as NonNullable<CollectionElement<T>>, partialNode, state, parentKey);\n        }\n\n        let nodes = this.getFullNode({\n          ...childNode,\n          key: nodeKey,\n          index,\n          wrapper: compose(partialNode.wrapper, childNode.wrapper)\n        }, this.getChildState(state, childNode), parentKey ? `${parentKey}${element.key}` : element.key, parentNode);\n\n        let children = [...nodes];\n        for (let node of children) {\n          // Cache the node based on its value\n          node.value = childNode.value ?? partialNode.value ?? null;\n          if (node.value) {\n            this.cache.set(node.value, node);\n          }\n\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) {\n            throw new Error(`Unsupported type <${capitalize(node.type)}> in <${capitalize(parentNode?.type ?? 'unknown parent type')}>. Only <${capitalize(partialNode.type)}> is supported.`);\n          }\n\n          index++;\n          yield node;\n        }\n\n        result = childNodes.next(children);\n      }\n\n      return;\n    }\n\n    // Ignore invalid elements\n    if (partialNode.key == null || partialNode.type == null) {\n      return;\n    }\n\n    // Create full node\n    let builder = this;\n    let node: Node<T> = {\n      type: partialNode.type,\n      props: partialNode.props,\n      key: partialNode.key,\n      parentKey: parentNode ? parentNode.key : null,\n      value: partialNode.value ?? null,\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 || false,\n      childNodes: iterable(function *() {\n        if (!partialNode.hasChildNodes || !partialNode.childNodes) {\n          return;\n        }\n\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) {\n            // 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          }\n\n          let nodes = builder.getFullNode({...child, index}, builder.getChildState(state, child), node.key, node);\n          for (let node of nodes) {\n            index++;\n            yield node;\n          }\n        }\n      })\n    };\n\n    yield node;\n  }\n}\n\n// Wraps an iterator function as an iterable object, and caches the results.\nfunction iterable<T>(iterator: () => IterableIterator<Node<T>>): Iterable<Node<T>> {\n  let cache: Array<Node<T>> = [];\n  let iterable: null | IterableIterator<Node<T>> = null;\n  return {\n    *[Symbol.iterator]() {\n      for (let item of cache) {\n        yield item;\n      }\n\n      if (!iterable) {\n        iterable = iterator();\n      }\n\n      for (let item of iterable) {\n        cache.push(item);\n        yield item;\n      }\n    }\n  };\n}\n\ntype Wrapper = (element: ReactElement) => ReactElement;\nfunction compose(outer: Wrapper | void, inner: Wrapper | void): Wrapper | undefined {\n  if (outer && inner) {\n    return (element) => outer(inner(element));\n  }\n\n  if (outer) {\n    return outer;\n  }\n\n  if (inner) {\n    return inner;\n  }\n}\n\nfunction capitalize(str: string) {\n  return str[0].toUpperCase() + str.slice(1);\n}\n"],"names":[],"version":3,"file":"CollectionBuilder.main.js.map"}

package/dist/CollectionBuilder.mjs

@@ -24,15 +24,20 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
         });
         else if (typeof children === 'function') {
             if (!items) throw new Error('props.children was a function but props.items is missing');
-            for (let item of props.items)yield* this.getFullNode({
-                value: item
-            }, {
-                renderer: children
-            });
+            let index = 0;
+            for (let item of items){
+                yield* this.getFullNode({
+                    value: item,
+                    index: index
+                }, {
+                    renderer: children
+                });
+                index++;
+            }
         } else {
             let items = [];
             (0, $fzaAv$react).Children.forEach(children, (child)=>{
-                items.push(child);
+                if (child) items.push(child);
             });
             let index = 0;
             for (let item of items){
@@ -70,7 +75,8 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
             (0, $fzaAv$react).Children.forEach(partialNode.element.props.children, (child)=>{
                 children.push(child);
             });
-            let index = partialNode.index;
+            var _partialNode_index;
+            let index = (_partialNode_index = partialNode.index) !== null && _partialNode_index !== void 0 ? _partialNode_index : 0;
             for (const child of children)yield* this.getFullNode({
                 element: child,
                 index: index++
@@ -95,17 +101,19 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
         if ((0, $fzaAv$react).isValidElement(element)) {
             let type = element.type;
             if (typeof type !== 'function' && typeof type.getCollectionNode !== 'function') {
-                let name = typeof element.type === 'function' ? element.type.name : element.type;
+                let name = element.type;
                 throw new Error(`Unknown element <${name}> in collection.`);
             }
             let childNodes = type.getCollectionNode(element.props, this.context);
-            let index = partialNode.index;
+            var _partialNode_index1;
+            let index = (_partialNode_index1 = partialNode.index) !== null && _partialNode_index1 !== void 0 ? _partialNode_index1 : 0;
             let result = childNodes.next();
             while(!result.done && result.value){
                 let childNode = result.value;
                 partialNode.index = index;
-                let nodeKey = childNode.key;
-                if (!nodeKey) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
+                var _childNode_key;
+                let nodeKey = (_childNode_key = childNode.key) !== null && _childNode_key !== void 0 ? _childNode_key : null;
+                if (nodeKey == null) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
                 let nodes = this.getFullNode({
                     ...childNode,
                     key: nodeKey,
@@ -116,12 +124,14 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
                     ...nodes
                 ];
                 for (let node of children){
+                    var _childNode_value, _ref;
                     // Cache the node based on its value
-                    node.value = childNode.value || partialNode.value;
+                    node.value = (_ref = (_childNode_value = childNode.value) !== null && _childNode_value !== void 0 ? _childNode_value : partialNode.value) !== null && _ref !== void 0 ? _ref : null;
                     if (node.value) this.cache.set(node.value, node);
+                    var _parentNode_type;
                     // The partial node may have specified a type for the child in order to specify a constraint.
                     // Verify that the full node that was built recursively matches this type.
-                    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.`);
+                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$eb2240fc39a57fa5$var$capitalize(node.type)}> in <${$eb2240fc39a57fa5$var$capitalize((_parentNode_type = parentNode === null || parentNode === void 0 ? void 0 : parentNode.type) !== null && _parentNode_type !== void 0 ? _parentNode_type : 'unknown parent type')}>. Only <${$eb2240fc39a57fa5$var$capitalize(partialNode.type)}> is supported.`);
                     index++;
                     yield node;
                 }
@@ -130,25 +140,26 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
             return;
         }
         // Ignore invalid elements
-        if (partialNode.key == null) return;
+        if (partialNode.key == null || partialNode.type == null) return;
         // Create full node
         let builder = this;
+        var _partialNode_value, _partialNode_textValue;
         let node = {
             type: partialNode.type,
             props: partialNode.props,
             key: partialNode.key,
             parentKey: parentNode ? parentNode.key : null,
-            value: partialNode.value,
+            value: (_partialNode_value = partialNode.value) !== null && _partialNode_value !== void 0 ? _partialNode_value : null,
             level: parentNode ? parentNode.level + 1 : 0,
             index: partialNode.index,
             rendered: partialNode.rendered,
-            textValue: partialNode.textValue,
+            textValue: (_partialNode_textValue = partialNode.textValue) !== null && _partialNode_textValue !== void 0 ? _partialNode_textValue : '',
             'aria-label': partialNode['aria-label'],
             wrapper: partialNode.wrapper,
             shouldInvalidate: partialNode.shouldInvalidate,
-            hasChildNodes: partialNode.hasChildNodes,
+            hasChildNodes: partialNode.hasChildNodes || false,
             childNodes: $eb2240fc39a57fa5$var$iterable(function*() {
-                if (!partialNode.hasChildNodes) return;
+                if (!partialNode.hasChildNodes || !partialNode.childNodes) return;
                 let index = 0;
                 for (let child of partialNode.childNodes()){
                     // Ensure child keys are globally unique by prepending the parent node's key
@@ -157,8 +168,10 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
                     // but another parent has key `ab` and its child has a key `c`. The combined keys would result in both
                     // children having a key of `abc`.
                     child.key = `${node.key}${child.key}`;
-                    child.index = index;
-                    let nodes = builder.getFullNode(child, builder.getChildState(state, child), node.key, node);
+                    let nodes = builder.getFullNode({
+                        ...child,
+                        index: index
+                    }, builder.getChildState(state, child), node.key, node);
                     for (let node of nodes){
                         index++;
                         yield node;

package/dist/CollectionBuilder.module.js

@@ -24,15 +24,20 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
         });
         else if (typeof children === 'function') {
             if (!items) throw new Error('props.children was a function but props.items is missing');
-            for (let item of props.items)yield* this.getFullNode({
-                value: item
-            }, {
-                renderer: children
-            });
+            let index = 0;
+            for (let item of items){
+                yield* this.getFullNode({
+                    value: item,
+                    index: index
+                }, {
+                    renderer: children
+                });
+                index++;
+            }
         } else {
             let items = [];
             (0, $fzaAv$react).Children.forEach(children, (child)=>{
-                items.push(child);
+                if (child) items.push(child);
             });
             let index = 0;
             for (let item of items){
@@ -70,7 +75,8 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
             (0, $fzaAv$react).Children.forEach(partialNode.element.props.children, (child)=>{
                 children.push(child);
             });
-            let index = partialNode.index;
+            var _partialNode_index;
+            let index = (_partialNode_index = partialNode.index) !== null && _partialNode_index !== void 0 ? _partialNode_index : 0;
             for (const child of children)yield* this.getFullNode({
                 element: child,
                 index: index++
@@ -95,17 +101,19 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
         if ((0, $fzaAv$react).isValidElement(element)) {
             let type = element.type;
             if (typeof type !== 'function' && typeof type.getCollectionNode !== 'function') {
-                let name = typeof element.type === 'function' ? element.type.name : element.type;
+                let name = element.type;
                 throw new Error(`Unknown element <${name}> in collection.`);
             }
             let childNodes = type.getCollectionNode(element.props, this.context);
-            let index = partialNode.index;
+            var _partialNode_index1;
+            let index = (_partialNode_index1 = partialNode.index) !== null && _partialNode_index1 !== void 0 ? _partialNode_index1 : 0;
             let result = childNodes.next();
             while(!result.done && result.value){
                 let childNode = result.value;
                 partialNode.index = index;
-                let nodeKey = childNode.key;
-                if (!nodeKey) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
+                var _childNode_key;
+                let nodeKey = (_childNode_key = childNode.key) !== null && _childNode_key !== void 0 ? _childNode_key : null;
+                if (nodeKey == null) nodeKey = childNode.element ? null : this.getKey(element, partialNode, state, parentKey);
                 let nodes = this.getFullNode({
                     ...childNode,
                     key: nodeKey,
@@ -116,12 +124,14 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
                     ...nodes
                 ];
                 for (let node of children){
+                    var _childNode_value, _ref;
                     // Cache the node based on its value
-                    node.value = childNode.value || partialNode.value;
+                    node.value = (_ref = (_childNode_value = childNode.value) !== null && _childNode_value !== void 0 ? _childNode_value : partialNode.value) !== null && _ref !== void 0 ? _ref : null;
                     if (node.value) this.cache.set(node.value, node);
+                    var _parentNode_type;
                     // The partial node may have specified a type for the child in order to specify a constraint.
                     // Verify that the full node that was built recursively matches this type.
-                    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.`);
+                    if (partialNode.type && node.type !== partialNode.type) throw new Error(`Unsupported type <${$eb2240fc39a57fa5$var$capitalize(node.type)}> in <${$eb2240fc39a57fa5$var$capitalize((_parentNode_type = parentNode === null || parentNode === void 0 ? void 0 : parentNode.type) !== null && _parentNode_type !== void 0 ? _parentNode_type : 'unknown parent type')}>. Only <${$eb2240fc39a57fa5$var$capitalize(partialNode.type)}> is supported.`);
                     index++;
                     yield node;
                 }
@@ -130,25 +140,26 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
             return;
         }
         // Ignore invalid elements
-        if (partialNode.key == null) return;
+        if (partialNode.key == null || partialNode.type == null) return;
         // Create full node
         let builder = this;
+        var _partialNode_value, _partialNode_textValue;
         let node = {
             type: partialNode.type,
             props: partialNode.props,
             key: partialNode.key,
             parentKey: parentNode ? parentNode.key : null,
-            value: partialNode.value,
+            value: (_partialNode_value = partialNode.value) !== null && _partialNode_value !== void 0 ? _partialNode_value : null,
             level: parentNode ? parentNode.level + 1 : 0,
             index: partialNode.index,
             rendered: partialNode.rendered,
-            textValue: partialNode.textValue,
+            textValue: (_partialNode_textValue = partialNode.textValue) !== null && _partialNode_textValue !== void 0 ? _partialNode_textValue : '',
             'aria-label': partialNode['aria-label'],
             wrapper: partialNode.wrapper,
             shouldInvalidate: partialNode.shouldInvalidate,
-            hasChildNodes: partialNode.hasChildNodes,
+            hasChildNodes: partialNode.hasChildNodes || false,
             childNodes: $eb2240fc39a57fa5$var$iterable(function*() {
-                if (!partialNode.hasChildNodes) return;
+                if (!partialNode.hasChildNodes || !partialNode.childNodes) return;
                 let index = 0;
                 for (let child of partialNode.childNodes()){
                     // Ensure child keys are globally unique by prepending the parent node's key
@@ -157,8 +168,10 @@ class $eb2240fc39a57fa5$export$bf788dd355e3a401 {
                     // but another parent has key `ab` and its child has a key `c`. The combined keys would result in both
                     // children having a key of `abc`.
                     child.key = `${node.key}${child.key}`;
-                    child.index = index;
-                    let nodes = builder.getFullNode(child, builder.getChildState(state, child), node.key, node);
+                    let nodes = builder.getFullNode({
+                        ...child,
+                        index: index
+                    }, builder.getChildState(state, child), node.key, node);
                     for (let node of nodes){
                         index++;
                         yield node;