@angular/cdk 9.2.1 → 9.2.2

package/bundles/cdk-tree.umd.min.js.map

@@ -1 +1 @@
-{"version":3,"sources":["src/cdk/cdk-tree.umd.js"],"names":["global","factory","exports","module","require","define","amd","self","ng","cdk","tree","collections","rxjs","operators","core","bidi","coercion","a11y","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","hasOwnProperty","__extends","__","constructor","prototype","create","__read","o","n","m","Symbol","iterator","r","e","i","call","ar","next","done","push","value","error","__spread","arguments","length","concat","BaseTreeControl","expansionModel","SelectionModel","toggle","dataNode","expand","select","collapse","deselect","isExpanded","isSelected","toggleDescendants","collapseDescendants","expandDescendants","collapseAll","clear","_a","toBeProcessed","apply","getDescendants","FlatTreeControl","_super","getLevel","isExpandable","_this","results","dataNodes","indexOf","expandAll","NestedTreeControl","getChildren","allNodes","reduce","accumulator","descendants","_getDescendants","splice","childrenNodes","isArray","forEach","child","isObservable","pipe","take","filter","Boolean","subscribe","children","e_1","children_1","__values","children_1_1","e_1_1","return","CDK_TREE_NODE_OUTLET_NODE","InjectionToken","CdkTreeNodeOutlet","viewContainer","_node","decorators","type","Directive","args","selector","ctorParameters","ViewContainerRef","undefined","Inject","Optional","CdkTreeNodeOutletContext","data","$implicit","CdkTreeNodeDef","template","inputs","TemplateRef","getTreeNoValidDataSourceError","Error","getTreeMultipleDefaultNodeDefsError","getTreeMissingMatchingNodeDefError","getTreeControlMissingError","getTreeControlFunctionsMissingError","CdkTree","_differs","_changeDetectorRef","_onDestroy","Subject","_levels","Map","viewChange","BehaviorSubject","start","end","Number","MAX_VALUE","defineProperty","get","_dataSource","set","dataSource","_switchDataSource","enumerable","configurable","ngOnInit","_dataDiffer","find","trackBy","treeControl","ngOnDestroy","_nodeOutlet","complete","disconnect","_dataSubscription","unsubscribe","ngAfterContentChecked","defaultNodeDefs","_nodeDefs","def","when","_defaultNodeDef","_observeRenderChanges","dataStream","isDataSource","connect","of","takeUntil","renderNodeChanges","dataDiffer","parentData","changes","diff","forEachOperation","item","adjustedPreviousIndex","currentIndex","previousIndex","insertNode","remove","delete","view","move","detectChanges","_getNodeDef","first","nodeDef","nodeData","index","node","context","level","has","createEmbeddedView","CdkTreeNode","mostRecentTreeNode","Component","exportAs","host","class","role","encapsulation","ViewEncapsulation","None","changeDetection","ChangeDetectionStrategy","Default","IterableDiffers","ChangeDetectorRef","propDecorators","Input","ViewChild","static","ContentChildren","_elementRef","_tree","_destroyed","_dataChanges","_data","_setRoleFromData","focus","nativeElement","_setRoleFromChildren","[attr.aria-expanded]","[attr.aria-level]","[attr.role]","ElementRef","CdkNestedTreeNode","ngAfterContentInit","updateChildrenNodes","result","nodeOutlet","_clear","outlet","_getNodeOutlet","_children","outlets","providers","provide","useExisting","cssUnitPattern","CdkTreeNodePadding","_treeNode","_renderer","_element","_dir","indentUnits","_indent","_setPadding","change","_level","coerceNumberProperty","indent","units","parts","split","_paddingIndent","nodeLevel","forceChange","padding","_currentPadding","element","paddingProp","resetProp","style","Renderer2","Directionality","CdkTreeNodeToggle","_recursive","coerceBooleanProperty","_toggle","event","recursive","stopPropagation","HostListener","EXPORTED_DECLARATIONS","CdkTreeModule","NgModule","declarations","FocusMonitor"],"mappings":"CAAC,SAAUA,EAAQC,GACI,iBAAZC,SAA0C,oBAAXC,OAAyBF,EAAQC,QAASE,QAAQ,4BAA6BA,QAAQ,QAASA,QAAQ,kBAAmBA,QAAQ,iBAAkBA,QAAQ,qBAAsBA,QAAQ,yBAA0BA,QAAQ,sBACjP,mBAAXC,QAAyBA,OAAOC,IAAMD,OAAO,oBAAqB,CAAC,UAAW,2BAA4B,OAAQ,iBAAkB,gBAAiB,oBAAqB,wBAAyB,qBAAsBJ,GACtMA,IAAzBD,EAASA,GAAUO,MAAsBC,GAAKR,EAAOQ,IAAM,GAAIR,EAAOQ,GAAGC,IAAMT,EAAOQ,GAAGC,KAAO,GAAIT,EAAOQ,GAAGC,IAAIC,KAAO,IAAKV,EAAOQ,GAAGC,IAAIE,YAAaX,EAAOY,KAAMZ,EAAOY,KAAKC,UAAWb,EAAOQ,GAAGM,KAAMd,EAAOQ,GAAGC,IAAIM,KAAMf,EAAOQ,GAAGC,IAAIO,SAAUhB,EAAOQ,GAAGC,IAAIQ,MAH5Q,CAIEC,MAAM,SAAWhB,EAASS,EAAaC,EAAMC,EAAWC,EAAMC,EAAMC,EAAUC,GAAQ;;;;;;;;;;;;;;oFAkBpF,IAAIE,EAAgB,SAASC,EAAGC,GAI5B,OAHAF,EAAgBG,OAAOC,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUL,EAAGC,GAAKD,EAAEI,UAAYH,IACvE,SAAUD,EAAGC,GAAK,IAAK,IAAIK,KAAKL,EAAOA,EAAEM,eAAeD,KAAIN,EAAEM,GAAKL,EAAEK,MACpDN,EAAGC,IAG5B,SAASO,EAAUR,EAAGC,GAElB,SAASQ,IAAOX,KAAKY,YAAcV,EADnCD,EAAcC,EAAGC,GAEjBD,EAAEW,UAAkB,OAANV,EAAaC,OAAOU,OAAOX,IAAMQ,EAAGE,UAAYV,EAAEU,UAAW,IAAIF,GA6FnF,SAASI,EAAOC,EAAGC,GACf,IAAIC,EAAsB,mBAAXC,QAAyBH,EAAEG,OAAOC,UACjD,IAAKF,EAAG,OAAOF,EACf,IAAmBK,EAAYC,EAA3BC,EAAIL,EAAEM,KAAKR,GAAOS,EAAK,GAC3B,IACI,WAAc,IAANR,GAAgBA,KAAM,MAAQI,EAAIE,EAAEG,QAAQC,MAAMF,EAAGG,KAAKP,EAAEQ,OAExE,MAAOC,GAASR,EAAI,CAAEQ,MAAOA,GAC7B,QACI,IACQT,IAAMA,EAAEM,OAAST,EAAIK,EAAU,SAAIL,EAAEM,KAAKD,GAElD,QAAU,GAAID,EAAG,MAAMA,EAAEQ,OAE7B,OAAOL,EAGX,SAASM,IACL,IAAK,IAAIN,EAAK,GAAIF,EAAI,EAAGA,EAAIS,UAAUC,OAAQV,IAC3CE,EAAKA,EAAGS,OAAOnB,EAAOiB,UAAUT,KACpC,OAAOE,EA2DX,IAAIU,EAAiC,WACjC,SAASA,IAELnC,KAAKoC,eAAiB,IAAI3C,EAAY4C,gBAAe,GA0CzD,OAvCAF,EAAgBtB,UAAUyB,OAAS,SAAUC,GACzCvC,KAAKoC,eAAeE,OAAOC,IAG/BJ,EAAgBtB,UAAU2B,OAAS,SAAUD,GACzCvC,KAAKoC,eAAeK,OAAOF,IAG/BJ,EAAgBtB,UAAU6B,SAAW,SAAUH,GAC3CvC,KAAKoC,eAAeO,SAASJ,IAGjCJ,EAAgBtB,UAAU+B,WAAa,SAAUL,GAC7C,OAAOvC,KAAKoC,eAAeS,WAAWN,IAG1CJ,EAAgBtB,UAAUiC,kBAAoB,SAAUP,GACpDvC,KAAKoC,eAAeS,WAAWN,GACzBvC,KAAK+C,oBAAoBR,GACzBvC,KAAKgD,kBAAkBT,IAGjCJ,EAAgBtB,UAAUoC,YAAc,WACpCjD,KAAKoC,eAAec,SAGxBf,EAAgBtB,UAAUmC,kBAAoB,SAAUT,GACpD,IAAIY,EACAC,EAAgB,CAACb,GACrBa,EAAcxB,KAAKyB,MAAMD,EAAerB,EAAS/B,KAAKsD,eAAef,MACpEY,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAASqB,KAGzDjB,EAAgBtB,UAAUkC,oBAAsB,SAAUR,GACtD,IAAIY,EACAC,EAAgB,CAACb,GACrBa,EAAcxB,KAAKyB,MAAMD,EAAerB,EAAS/B,KAAKsD,eAAef,MACpEY,EAAKnD,KAAKoC,gBAAgBO,SAASU,MAAMF,EAAIpB,EAASqB,KAEpDjB,EA7CyB,GAwDhCoB,EAAiC,SAAUC,GAG3C,SAASD,EAAgBE,EAAUC,GAC/B,IAAIC,EAAQH,EAAOhC,KAAKxB,OAASA,KAGjC,OAFA2D,EAAMF,SAAWA,EACjBE,EAAMD,aAAeA,EACdC,EAgCX,OAtCAjD,EAAU6C,EAAiBC,GAc3BD,EAAgB1C,UAAUyC,eAAiB,SAAUf,GASjD,IARA,IACIqB,EAAU,GAOLrC,EARQvB,KAAK6D,UAAUC,QAAQvB,GAQd,EAAGhB,EAAIvB,KAAK6D,UAAU5B,QAAUjC,KAAKyD,SAASlB,GAAYvC,KAAKyD,SAASzD,KAAK6D,UAAUtC,IAAKA,IAClHqC,EAAQhC,KAAK5B,KAAK6D,UAAUtC,IAEhC,OAAOqC,GAQXL,EAAgB1C,UAAUkD,UAAY,WAClC,IAAIZ,GACHA,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAAS/B,KAAK6D,aAEvDN,EAvCyB,CAwClCpB,GAGE6B,EAAmC,SAAUR,GAG7C,SAASQ,EAAkBC,GACvB,IAAIN,EAAQH,EAAOhC,KAAKxB,OAASA,KAEjC,OADA2D,EAAMM,YAAcA,EACbN,EAsDX,OA3DAjD,EAAUsD,EAAmBR,GAa7BQ,EAAkBnD,UAAUkD,UAAY,WACpC,IAAIZ,EACAQ,EAAQ3D,KACZA,KAAKoC,eAAec,QACpB,IAAIgB,EAAWlE,KAAK6D,UAAUM,QAAO,SAAUC,EAAa7B,GACxD,OAAOR,EAASqC,EAAaT,EAAML,eAAef,GAAW,CAACA,MAC/D,KACFY,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAASmC,KAGzDF,EAAkBnD,UAAUyC,eAAiB,SAAUf,GACnD,IAAI8B,EAAc,GAGlB,OAFArE,KAAKsE,gBAAgBD,EAAa9B,GAE3B8B,EAAYE,OAAO,IAG9BP,EAAkBnD,UAAUyD,gBAAkB,SAAUD,EAAa9B,GACjE,IAAIoB,EAAQ3D,KACZqE,EAAYzC,KAAKW,GACjB,IAAIiC,EAAgBxE,KAAKiE,YAAY1B,GACjChC,MAAMkE,QAAQD,GACdA,EAAcE,SAAQ,SAAUC,GAAS,OAAOhB,EAAMW,gBAAgBD,EAAaM,MAE9EjF,EAAKkF,aAAaJ,IAGvBA,EAAcK,KAAKlF,EAAUmF,KAAK,GAAInF,EAAUoF,OAAOC,UAClDC,WAAU,SAAUC,GACrB,IAAIC,EAAKhC,EACT,IACI,IAAK,IAAIiC,EA1O7B,SAASC,EAASrE,GACd,IAAIE,EAAsB,mBAAXC,QAAyBH,EAAEG,OAAOC,UAAWG,EAAI,EAChE,OAAIL,EAAUA,EAAEM,KAAKR,GACd,CACHU,KAAM,WAEF,OADIV,GAAKO,GAAKP,EAAEiB,SAAQjB,OAAI,GACrB,CAAEa,MAAOb,GAAKA,EAAEO,KAAMI,MAAOX,KAoONqE,CAASH,GAAWI,EAAeF,EAAW1D,QAAS4D,EAAa3D,KAAM2D,EAAeF,EAAW1D,OAEtHiC,EAAMW,gBAAgBD,EADViB,EAAazD,OAIjC,MAAO0D,GAASJ,EAAM,CAAErD,MAAOyD,GAC/B,QACI,IACQD,IAAiBA,EAAa3D,OAASwB,EAAKiC,EAAWI,SAASrC,EAAG3B,KAAK4D,GAEhF,QAAU,GAAID,EAAK,MAAMA,EAAIrD,YAKtCkC,EA5D2B,CA6DpC7B,GAcEsD,EAA4B,IAAI7F,EAAK8F,eAAe,6BAKpDC,EAAmC,WACnC,SAASA,EAAkBC,EAAeC,GACtC7F,KAAK4F,cAAgBA,EACrB5F,KAAK6F,MAAQA,EAYjB,OAVAF,EAAkBG,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,0BAI1BP,EAAkBQ,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMnG,EAAKwG,kBACb,CAAEL,UAAMM,EAAWP,WAAY,CAAC,CAAEC,KAAMnG,EAAK0G,OAAQL,KAAM,CAACR,IAA+B,CAAEM,KAAMnG,EAAK2G,cAErGZ,EAf2B,GA0BlCa,EACA,SAASA,EAAyBC,GAC9BzG,KAAK0G,UAAYD,GAQrBE,EAAgC,WAEhC,SAASA,EAAeC,GACpB5G,KAAK4G,SAAWA,EAcpB,OAZAD,EAAeb,WAAa,CACxB,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,mBACVW,OAAQ,CACJ,gCAKpBF,EAAeR,eAAiB,WAAc,MAAO,CACjD,CAAEJ,KAAMnG,EAAKkH,eAEVH,EAjBwB;;;;;;;;;;;;;;;AA+BnC,SAASI,IACL,OAAOC,MAAM,yCAMjB,SAASC,IACL,OAAOD,MAAM,wEAMjB,SAASE,IACL,OAAOF,MAAM,yEAMjB,SAASG,IACL,OAAOH,MAAM,+CAMjB,SAASI,IACL,OAAOJ,MAAM,kEAOjB,IAAIK,EAAyB,WACzB,SAASA,EAAQC,EAAUC,GACvBvH,KAAKsH,SAAWA,EAChBtH,KAAKuH,mBAAqBA,EAE1BvH,KAAKwH,WAAa,IAAI9H,EAAK+H,QAE3BzH,KAAK0H,QAAU,IAAIC,IAOnB3H,KAAK4H,WAAa,IAAIlI,EAAKmI,gBAAgB,CAAEC,MAAO,EAAGC,IAAKC,OAAOC,YAiMvE,OA/LA7H,OAAO8H,eAAeb,EAAQxG,UAAW,aAAc,CAMnDsH,IAAK,WAAc,OAAOnI,KAAKoI,aAC/BC,IAAK,SAAUC,GACPtI,KAAKoI,cAAgBE,GACrBtI,KAAKuI,kBAAkBD,IAG/BE,YAAY,EACZC,cAAc,IAElBpB,EAAQxG,UAAU6H,SAAW,WAEzB,GADA1I,KAAK2I,YAAc3I,KAAKsH,SAASsB,KAAK,IAAI9H,OAAOd,KAAK6I,UACjD7I,KAAK8I,YACN,MAAM3B,KAGdE,EAAQxG,UAAUkI,YAAc,WAC5B/I,KAAKgJ,YAAYpD,cAAc1C,QAC/BlD,KAAKwH,WAAW9F,OAChB1B,KAAKwH,WAAWyB,WACZjJ,KAAKoI,aAAsD,mBAAhCpI,KAAKoI,YAAYc,YAC5ClJ,KAAKsI,WAAWY,WAAWlJ,MAE3BA,KAAKmJ,oBACLnJ,KAAKmJ,kBAAkBC,cACvBpJ,KAAKmJ,kBAAoB,OAGjC9B,EAAQxG,UAAUwI,sBAAwB,WACtC,IAAIC,EAAkBtJ,KAAKuJ,UAAUxE,QAAO,SAAUyE,GAAO,OAAQA,EAAIC,QACzE,GAAIH,EAAgBrH,OAAS,EACzB,MAAMgF,IAEVjH,KAAK0J,gBAAkBJ,EAAgB,GACnCtJ,KAAKsI,YAActI,KAAKuJ,YAAcvJ,KAAKmJ,mBAC3CnJ,KAAK2J,yBAUbtC,EAAQxG,UAAU0H,kBAAoB,SAAUD,GACxCtI,KAAKoI,aAAsD,mBAAhCpI,KAAKoI,YAAYc,YAC5ClJ,KAAKsI,WAAWY,WAAWlJ,MAE3BA,KAAKmJ,oBACLnJ,KAAKmJ,kBAAkBC,cACvBpJ,KAAKmJ,kBAAoB,MAGxBb,GACDtI,KAAKgJ,YAAYpD,cAAc1C,QAEnClD,KAAKoI,YAAcE,EACftI,KAAKuJ,WACLvJ,KAAK2J,yBAIbtC,EAAQxG,UAAU8I,sBAAwB,WACtC,IACIC,EADAjG,EAAQ3D,KAWZ,GATIP,EAAYoK,aAAa7J,KAAKoI,aAC9BwB,EAAa5J,KAAKoI,YAAY0B,QAAQ9J,MAEjCN,EAAKkF,aAAa5E,KAAKoI,aAC5BwB,EAAa5J,KAAKoI,YAEb7H,MAAMkE,QAAQzE,KAAKoI,eACxBwB,EAAalK,EAAKqK,GAAG/J,KAAKoI,eAE1BwB,EAKA,MAAM7C,IAJN/G,KAAKmJ,kBAAoBS,EAAW/E,KAAKlF,EAAUqK,UAAUhK,KAAKwH,aAC7DvC,WAAU,SAAUwB,GAAQ,OAAO9C,EAAMsG,kBAAkBxD,OAOxEY,EAAQxG,UAAUoJ,kBAAoB,SAAUxD,EAAMyD,EAAYtE,EAAeuE,GAC7E,IAAIxG,EAAQ3D,UACO,IAAfkK,IAAyBA,EAAalK,KAAK2I,kBACzB,IAAlB/C,IAA4BA,EAAgB5F,KAAKgJ,YAAYpD,eACjE,IAAIwE,EAAUF,EAAWG,KAAK5D,GACzB2D,IAGLA,EAAQE,kBAAiB,SAAUC,EAAMC,EAAuBC,GAC5D,GAA0B,MAAtBF,EAAKG,cACL/G,EAAMgH,WAAWlE,EAAKgE,GAAeA,EAAc7E,EAAeuE,QAEjE,GAAoB,MAAhBM,EACL7E,EAAcgF,OAAOJ,GACrB7G,EAAM+D,QAAQmD,OAAON,EAAKA,UAEzB,CACD,IAAIO,EAAOlF,EAAcuC,IAAIqC,GAC7B5E,EAAcmF,KAAKD,EAAML,OAGjCzK,KAAKuH,mBAAmByD,kBAQ5B3D,EAAQxG,UAAUoK,YAAc,SAAUxE,EAAMlF,GAC5C,GAA8B,IAA1BvB,KAAKuJ,UAAUtH,OACf,OAAOjC,KAAKuJ,UAAU2B,MAE1B,IAAIC,EAAUnL,KAAKuJ,UAAUX,MAAK,SAAUY,GAAO,OAAOA,EAAIC,MAAQD,EAAIC,KAAKlI,EAAGkF,OAAazG,KAAK0J,gBACpG,IAAKyB,EACD,MAAMjE,IAEV,OAAOiE,GAMX9D,EAAQxG,UAAU8J,WAAa,SAAUS,EAAUC,EAAOzF,EAAeuE,GACrE,IAAImB,EAAOtL,KAAKiL,YAAYG,EAAUC,GAElCE,EAAU,IAAI/E,EAAyB4E,GAIvCG,EAAQC,MADRxL,KAAK8I,YAAYrF,SACDzD,KAAK8I,YAAYrF,SAAS2H,QAEf,IAAfjB,GAA8BnK,KAAK0H,QAAQ+D,IAAItB,GAC3CnK,KAAK0H,QAAQS,IAAIgC,GAAc,EAG/B,EAEpBnK,KAAK0H,QAAQW,IAAI+C,EAAUG,EAAQC,QAEnB5F,GAAgC5F,KAAKgJ,YAAYpD,eACvD8F,mBAAmBJ,EAAK1E,SAAU2E,EAASF,GAIjDM,EAAYC,qBACZD,EAAYC,mBAAmBnF,KAAO2E,IAG9C/D,EAAQvB,WAAa,CACjB,CAAEC,KAAMnG,EAAKiM,UAAW5F,KAAM,CAAC,CACnBC,SAAU,WACV4F,SAAU,UACVlF,SAAU,kDACVmF,KAAM,CACFC,MAAS,WACTC,KAAQ,QAEZC,cAAetM,EAAKuM,kBAAkBC,KAKtCC,gBAAiBzM,EAAK0M,wBAAwBC,YAI9DlF,EAAQlB,eAAiB,WAAc,MAAO,CAC1C,CAAEJ,KAAMnG,EAAK4M,iBACb,CAAEzG,KAAMnG,EAAK6M,qBAEjBpF,EAAQqF,eAAiB,CACrBpE,WAAY,CAAC,CAAEvC,KAAMnG,EAAK+M,QAC1B7D,YAAa,CAAC,CAAE/C,KAAMnG,EAAK+M,QAC3B9D,QAAS,CAAC,CAAE9C,KAAMnG,EAAK+M,QACvB3D,YAAa,CAAC,CAAEjD,KAAMnG,EAAKgN,UAAW3G,KAAM,CAACN,EAAmB,CAAEkH,QAAQ,MAC1EtD,UAAW,CAAC,CAAExD,KAAMnG,EAAKkN,gBAAiB7G,KAAM,CAACU,EAAgB,CAGjDtC,aAAa,OAG1BgD,EA/MiB,GAoNxBsE,EAA6B,WAC7B,SAASA,EAAYoB,EAAaC,GAC9BhN,KAAK+M,YAAcA,EACnB/M,KAAKgN,MAAQA,EAEbhN,KAAKiN,WAAa,IAAIvN,EAAK+H,QAE3BzH,KAAKkN,aAAe,IAAIxN,EAAK+H,QAK7BzH,KAAKiM,KAAO,WACZN,EAAYC,mBAAqB5L,KA0FrC,OAxFAI,OAAO8H,eAAeyD,EAAY9K,UAAW,OAAQ,CAEjDsH,IAAK,WAAc,OAAOnI,KAAKmN,OAC/B9E,IAAK,SAAUxG,GACPA,IAAU7B,KAAKmN,QACfnN,KAAKmN,MAAQtL,EACb7B,KAAKoN,mBACLpN,KAAKkN,aAAaxL,SAG1B8G,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAeyD,EAAY9K,UAAW,aAAc,CACvDsH,IAAK,WACD,OAAOnI,KAAKgN,MAAMlE,YAAYlG,WAAW5C,KAAKmN,QAElD3E,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAeyD,EAAY9K,UAAW,QAAS,CAClDsH,IAAK,WACD,OAAOnI,KAAKgN,MAAMlE,YAAYrF,SAAWzD,KAAKgN,MAAMlE,YAAYrF,SAASzD,KAAKmN,OAAS,GAE3F3E,YAAY,EACZC,cAAc,IAElBkD,EAAY9K,UAAUkI,YAAc,WAG5B4C,EAAYC,qBAAuB5L,OACnC2L,EAAYC,mBAAqB,MAErC5L,KAAKkN,aAAajE,WAClBjJ,KAAKiN,WAAWvL,OAChB1B,KAAKiN,WAAWhE,YAGpB0C,EAAY9K,UAAUwM,MAAQ,WAC1BrN,KAAK+M,YAAYO,cAAcD,SAEnC1B,EAAY9K,UAAUuM,iBAAmB,WACrC,IAAIzJ,EAAQ3D,KACZ,GAAIA,KAAKgN,MAAMlE,YAAYpF,aACvB1D,KAAKiM,KAAOjM,KAAKgN,MAAMlE,YAAYpF,aAAa1D,KAAKmN,OAAS,QAAU,eAEvE,CACD,IAAKnN,KAAKgN,MAAMlE,YAAY7E,YACxB,MAAMmD,IAEV,IAAI5C,EAAgBxE,KAAKgN,MAAMlE,YAAY7E,YAAYjE,KAAKmN,OACxD5M,MAAMkE,QAAQD,GACdxE,KAAKuN,qBAAqB/I,GAErB9E,EAAKkF,aAAaJ,IACvBA,EAAcK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACvChI,WAAU,SAAUC,GAAY,OAAOvB,EAAM4J,qBAAqBrI,QAInFyG,EAAY9K,UAAU0M,qBAAuB,SAAUrI,GACnDlF,KAAKiM,KAAO/G,GAAYA,EAASjD,OAAS,QAAU,YAMxD0J,EAAYC,mBAAqB,KACjCD,EAAY7F,WAAa,CACrB,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,gBACV4F,SAAU,cACVC,KAAM,CACFyB,uBAAwB,aACxBC,oBAAqB,qCACrBC,cAAe,OACf1B,MAAS,qBAK7BL,EAAYxF,eAAiB,WAAc,MAAO,CAC9C,CAAEJ,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMsB,KAEZsE,EAAYe,eAAiB,CACzBT,KAAM,CAAC,CAAElG,KAAMnG,EAAK+M,SAEjBhB,EAvGqB,GAgH5BiC,EAAmC,SAAUpK,GAE7C,SAASoK,EAAkBb,EAAaC,EAAO1F,GAC3C,IAAI3D,EAAQH,EAAOhC,KAAKxB,KAAM+M,EAAaC,IAAUhN,KAIrD,OAHA2D,EAAMoJ,YAAcA,EACpBpJ,EAAMqJ,MAAQA,EACdrJ,EAAM2D,SAAWA,EACV3D,EAkFX,OAxFAjD,EAAUkN,EAAmBpK,GAQ7BoK,EAAkB/M,UAAUgN,mBAAqB,WAC7C,IAAIlK,EAAQ3D,KAEZ,GADAA,KAAK2I,YAAc3I,KAAKsH,SAASsB,KAAK,IAAI9H,OAAOd,KAAKgN,MAAMnE,UACvD7I,KAAKgN,MAAMlE,YAAY7E,YACxB,MAAMmD,IAEV,IAAI5C,EAAgBxE,KAAKgN,MAAMlE,YAAY7E,YAAYjE,KAAKyG,MACxDlG,MAAMkE,QAAQD,GACdxE,KAAK8N,oBAAoBtJ,GAEpB9E,EAAKkF,aAAaJ,IACvBA,EAAcK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACvChI,WAAU,SAAU8I,GAAU,OAAOpK,EAAMmK,oBAAoBC,MAExE/N,KAAKgO,WAAW5D,QAAQvF,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACjDhI,WAAU,WAAc,OAAOtB,EAAMmK,0BAE9CF,EAAkB/M,UAAUkI,YAAc,WACtC/I,KAAKiO,SACLzK,EAAO3C,UAAUkI,YAAYvH,KAAKxB,OAGtC4N,EAAkB/M,UAAUiN,oBAAsB,SAAU5I,GACxD,IAAIgJ,EAASlO,KAAKmO,iBACdjJ,IACAlF,KAAKoO,UAAYlJ,GAEjBgJ,GAAUlO,KAAKoO,UAEfpO,KAAKgN,MAAM/C,kBAAkBjK,KAAKoO,UAAWpO,KAAK2I,YAD9BuF,EAAOtI,cACmD5F,KAAKmN,OAInFnN,KAAK2I,YAAY0B,KAAK,KAI9BuD,EAAkB/M,UAAUoN,OAAS,WACjC,IAAIC,EAASlO,KAAKmO,iBACdD,IACAA,EAAOtI,cAAc1C,QACrBlD,KAAK2I,YAAY0B,KAAK,MAI9BuD,EAAkB/M,UAAUsN,eAAiB,WACzC,IAAIxK,EAAQ3D,KACRqO,EAAUrO,KAAKgO,WAGnB,OAAOK,GAAWA,EAAQzF,MAAK,SAAUsF,GAAU,OAAQA,EAAOrI,OAASqI,EAAOrI,QAAUlC,MAEhGiK,EAAkB9H,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,uBACV4F,SAAU,oBACVC,KAAM,CACFyB,uBAAwB,aACxBE,cAAe,OACf1B,MAAS,sCAEbsC,UAAW,CACP,CAAEC,QAAS5C,EAAa6C,YAAaZ,GACrC,CAAEW,QAAS9I,EAA2B+I,YAAaZ,QAKvEA,EAAkBzH,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMsB,GACR,CAAEtB,KAAMnG,EAAK4M,mBAEjBoB,EAAkBlB,eAAiB,CAC/BsB,WAAY,CAAC,CAAEjI,KAAMnG,EAAKkN,gBAAiB7G,KAAM,CAACN,EAAmB,CAGrDtB,aAAa,OAG1BuJ,EAzF2B,CA0FpCjC,GAUE8C,EAAiB,gBAKjBC,EAAoC,WACpC,SAASA,EAAmBC,EAAW3B,EAKvC4B,EAAWC,EAAUC,GACjB,IAAInL,EAAQ3D,KACZA,KAAK2O,UAAYA,EACjB3O,KAAKgN,MAAQA,EACbhN,KAAK6O,SAAWA,EAChB7O,KAAK8O,KAAOA,EAEZ9O,KAAKiN,WAAa,IAAIvN,EAAK+H,QAE3BzH,KAAK+O,YAAc,KACnB/O,KAAKgP,QAAU,GACfhP,KAAKiP,cACDH,GACAA,EAAKI,OAAOrK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aAAahI,WAAU,WAAc,OAAOtB,EAAMsL,aAAY,MAK5GN,EAAUzB,aAAajI,WAAU,WAAc,OAAOtB,EAAMsL,iBA6EhE,OA3EA7O,OAAO8H,eAAewG,EAAmB7N,UAAW,QAAS,CAEzDsH,IAAK,WAAc,OAAOnI,KAAKmP,QAC/B9G,IAAK,SAAUxG,GAIX7B,KAAKmP,OAASrP,EAASsP,qBAAqBvN,EAAO,MACnD7B,KAAKiP,eAETzG,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAewG,EAAmB7N,UAAW,SAAU,CAK1DsH,IAAK,WAAc,OAAOnI,KAAKgP,SAC/B3G,IAAK,SAAUgH,GACX,IAAIxN,EAAQwN,EACRC,EAAQ,KACZ,GAAsB,iBAAXD,EAAqB,CAC5B,IAAIE,EAAQF,EAAOG,MAAMf,GACzB5M,EAAQ0N,EAAM,GACdD,EAAQC,EAAM,IAAMD,EAExBtP,KAAK+O,YAAcO,EACnBtP,KAAKgP,QAAUlP,EAASsP,qBAAqBvN,GAC7C7B,KAAKiP,eAETzG,YAAY,EACZC,cAAc,IAElBiG,EAAmB7N,UAAUkI,YAAc,WACvC/I,KAAKiN,WAAWvL,OAChB1B,KAAKiN,WAAWhE,YAGpByF,EAAmB7N,UAAU4O,eAAiB,WAC1C,IAAIC,EAAa1P,KAAK2O,UAAUlI,MAAQzG,KAAKgN,MAAMlE,YAAYrF,SACzDzD,KAAKgN,MAAMlE,YAAYrF,SAASzD,KAAK2O,UAAUlI,MAC/C,KACF+E,EAAuB,MAAfxL,KAAKmP,OAAiBO,EAAY1P,KAAKmP,OACnD,MAAwB,iBAAV3D,EAAqB,GAAKA,EAAQxL,KAAKgP,QAAUhP,KAAK+O,YAAc,MAEtFL,EAAmB7N,UAAUoO,YAAc,SAAUU,QAC7B,IAAhBA,IAA0BA,GAAc,GAC5C,IAAIC,EAAU5P,KAAKyP,iBACnB,GAAIG,IAAY5P,KAAK6P,iBAAmBF,EAAa,CACjD,IAAIG,EAAU9P,KAAK6O,SAASvB,cACxByC,EAAc/P,KAAK8O,MAA4B,QAApB9O,KAAK8O,KAAKjN,MAAkB,eAAiB,cACxEmO,EAA4B,gBAAhBD,EAAgC,eAAiB,cACjED,EAAQG,MAAMF,GAAeH,GAAW,GACxCE,EAAQG,MAAMD,GAAa,GAC3BhQ,KAAK6P,gBAAkBD,IAG/BlB,EAAmB5I,WAAa,CAC5B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,2BAI1BwI,EAAmBvI,eAAiB,WAAc,MAAO,CACrD,CAAEJ,KAAM4F,GACR,CAAE5F,KAAMsB,GACR,CAAEtB,KAAMnG,EAAKsQ,WACb,CAAEnK,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMlG,EAAKsQ,eAAgBrK,WAAY,CAAC,CAAEC,KAAMnG,EAAK2G,cAE3DmI,EAAmBhC,eAAiB,CAChClB,MAAO,CAAC,CAAEzF,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,wBACnCoJ,OAAQ,CAAC,CAAEtJ,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,+BAEjCyI,EArG4B,GAkHnC0B,EAAmC,WACnC,SAASA,EAAkBpD,EAAO2B,GAC9B3O,KAAKgN,MAAQA,EACbhN,KAAK2O,UAAYA,EACjB3O,KAAKqQ,YAAa,EAgCtB,OA9BAjQ,OAAO8H,eAAekI,EAAkBvP,UAAW,YAAa,CAE5DsH,IAAK,WAAc,OAAOnI,KAAKqQ,YAC/BhI,IAAK,SAAUxG,GAAS7B,KAAKqQ,WAAavQ,EAASwQ,sBAAsBzO,IACzE2G,YAAY,EACZC,cAAc,IAOlB2H,EAAkBvP,UAAU0P,QAAU,SAAUC,GAC5CxQ,KAAKyQ,UACCzQ,KAAKgN,MAAMlE,YAAYhG,kBAAkB9C,KAAK2O,UAAUlI,MACxDzG,KAAKgN,MAAMlE,YAAYxG,OAAOtC,KAAK2O,UAAUlI,MACnD+J,EAAME,mBAEVN,EAAkBtK,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CAAEC,SAAU,0BAG/CkK,EAAkBjK,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMsB,GACR,CAAEtB,KAAM4F,KAEZyE,EAAkB1D,eAAiB,CAC/B+D,UAAW,CAAC,CAAE1K,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,gCACvCsK,QAAS,CAAC,CAAExK,KAAMnG,EAAK+Q,aAAc1K,KAAM,CAAC,QAAS,CAAC,cAEnDmK,EApC2B,GA8ClCQ,EAAwB,CACxBhD,EACAjH,EACA+H,EACA0B,EACA/I,EACAsE,EACAhG,GAEAkL,EAA+B,WAC/B,SAASA,KAST,OAPAA,EAAc/K,WAAa,CACvB,CAAEC,KAAMnG,EAAKkR,SAAU7K,KAAM,CAAC,CAClBjH,QAAS4R,EACTG,aAAcH,EACdtC,UAAW,CAACvO,EAAKiR,aAAcrK,OAGxCkK,EAVuB;;;;;;;;AAyBlC7R,EAAQmD,gBAAkBA,EAC1BnD,EAAQyG,0BAA4BA,EACpCzG,EAAQ4O,kBAAoBA,EAC5B5O,EAAQqI,QAAUA,EAClBrI,EAAQ6R,cAAgBA,EACxB7R,EAAQ2M,YAAcA,EACtB3M,EAAQ2H,eAAiBA,EACzB3H,EAAQ2G,kBAAoBA,EAC5B3G,EAAQwH,yBAA2BA,EACnCxH,EAAQ0P,mBAAqBA,EAC7B1P,EAAQoR,kBAAoBA,EAC5BpR,EAAQuE,gBAAkBA,EAC1BvE,EAAQgF,kBAAoBA,EAC5BhF,EAAQoI,oCAAsCA,EAC9CpI,EAAQmI,2BAA6BA,EACrCnI,EAAQkI,mCAAqCA,EAC7ClI,EAAQiI,oCAAsCA,EAC9CjI,EAAQ+H,8BAAgCA,EAExC3G,OAAO8H,eAAelJ,EAAS,aAAc,CAAE6C,OAAO","sourcesContent":["(function (global, factory) {\n    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@angular/cdk/collections'), require('rxjs'), require('rxjs/operators'), require('@angular/core'), require('@angular/cdk/bidi'), require('@angular/cdk/coercion'), require('@angular/cdk/a11y')) :\n    typeof define === 'function' && define.amd ? define('@angular/cdk/tree', ['exports', '@angular/cdk/collections', 'rxjs', 'rxjs/operators', '@angular/core', '@angular/cdk/bidi', '@angular/cdk/coercion', '@angular/cdk/a11y'], factory) :\n    (global = global || self, factory((global.ng = global.ng || {}, global.ng.cdk = global.ng.cdk || {}, global.ng.cdk.tree = {}), global.ng.cdk.collections, global.rxjs, global.rxjs.operators, global.ng.core, global.ng.cdk.bidi, global.ng.cdk.coercion, global.ng.cdk.a11y));\n}(this, (function (exports, collections, rxjs, operators, core, bidi, coercion, a11y) { 'use strict';\n\n    /*! *****************************************************************************\r\n    Copyright (c) Microsoft Corporation. All rights reserved.\r\n    Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\n    this file except in compliance with the License. You may obtain a copy of the\r\n    License at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\n    THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n    KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\n    WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\n    MERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\n    See the Apache Version 2.0 License for specific language governing permissions\r\n    and limitations under the License.\r\n    ***************************************************************************** */\r\n    /* global Reflect, Promise */\r\n\r\n    var extendStatics = function(d, b) {\r\n        extendStatics = Object.setPrototypeOf ||\r\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n        return extendStatics(d, b);\r\n    };\r\n\r\n    function __extends(d, b) {\r\n        extendStatics(d, b);\r\n        function __() { this.constructor = d; }\r\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n    }\r\n\r\n    var __assign = function() {\r\n        __assign = Object.assign || function __assign(t) {\r\n            for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n                s = arguments[i];\r\n                for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n            }\r\n            return t;\r\n        };\r\n        return __assign.apply(this, arguments);\r\n    };\r\n\r\n    function __rest(s, e) {\r\n        var t = {};\r\n        for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n            t[p] = s[p];\r\n        if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n            for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n                if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                    t[p[i]] = s[p[i]];\r\n            }\r\n        return t;\r\n    }\r\n\r\n    function __decorate(decorators, target, key, desc) {\r\n        var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n        if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n        else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n        return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n    }\r\n\r\n    function __param(paramIndex, decorator) {\r\n        return function (target, key) { decorator(target, key, paramIndex); }\r\n    }\r\n\r\n    function __metadata(metadataKey, metadataValue) {\r\n        if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n    }\r\n\r\n    function __awaiter(thisArg, _arguments, P, generator) {\r\n        return new (P || (P = Promise))(function (resolve, reject) {\r\n            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n            function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n            function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n            step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n        });\r\n    }\r\n\r\n    function __generator(thisArg, body) {\r\n        var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n        return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n        function verb(n) { return function (v) { return step([n, v]); }; }\r\n        function step(op) {\r\n            if (f) throw new TypeError(\"Generator is already executing.\");\r\n            while (_) try {\r\n                if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n                if (y = 0, t) op = [op[0] & 2, t.value];\r\n                switch (op[0]) {\r\n                    case 0: case 1: t = op; break;\r\n                    case 4: _.label++; return { value: op[1], done: false };\r\n                    case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                    case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                    default:\r\n                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                        if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                        if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                        if (t[2]) _.ops.pop();\r\n                        _.trys.pop(); continue;\r\n                }\r\n                op = body.call(thisArg, _);\r\n            } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n            if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n        }\r\n    }\r\n\r\n    function __exportStar(m, exports) {\r\n        for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n    }\r\n\r\n    function __values(o) {\r\n        var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n        if (m) return m.call(o);\r\n        return {\r\n            next: function () {\r\n                if (o && i >= o.length) o = void 0;\r\n                return { value: o && o[i++], done: !o };\r\n            }\r\n        };\r\n    }\r\n\r\n    function __read(o, n) {\r\n        var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n        if (!m) return o;\r\n        var i = m.call(o), r, ar = [], e;\r\n        try {\r\n            while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n        }\r\n        catch (error) { e = { error: error }; }\r\n        finally {\r\n            try {\r\n                if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n            }\r\n            finally { if (e) throw e.error; }\r\n        }\r\n        return ar;\r\n    }\r\n\r\n    function __spread() {\r\n        for (var ar = [], i = 0; i < arguments.length; i++)\r\n            ar = ar.concat(__read(arguments[i]));\r\n        return ar;\r\n    }\r\n\r\n    function __spreadArrays() {\r\n        for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n        for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n            for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n                r[k] = a[j];\r\n        return r;\r\n    };\r\n\r\n    function __await(v) {\r\n        return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n    }\r\n\r\n    function __asyncGenerator(thisArg, _arguments, generator) {\r\n        if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n        var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n        return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n        function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n        function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n        function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n        function fulfill(value) { resume(\"next\", value); }\r\n        function reject(value) { resume(\"throw\", value); }\r\n        function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n    }\r\n\r\n    function __asyncDelegator(o) {\r\n        var i, p;\r\n        return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n        function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n    }\r\n\r\n    function __asyncValues(o) {\r\n        if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n        var m = o[Symbol.asyncIterator], i;\r\n        return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n        function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n        function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n    }\r\n\r\n    function __makeTemplateObject(cooked, raw) {\r\n        if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n        return cooked;\r\n    };\r\n\r\n    function __importStar(mod) {\r\n        if (mod && mod.__esModule) return mod;\r\n        var result = {};\r\n        if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n        result.default = mod;\r\n        return result;\r\n    }\r\n\r\n    function __importDefault(mod) {\r\n        return (mod && mod.__esModule) ? mod : { default: mod };\r\n    }\n\n    /** Base tree control. It has basic toggle/expand/collapse operations on a single data node. */\n    var BaseTreeControl = /** @class */ (function () {\n        function BaseTreeControl() {\n            /** A selection model with multi-selection to track expansion status. */\n            this.expansionModel = new collections.SelectionModel(true);\n        }\n        /** Toggles one single data node's expanded/collapsed state. */\n        BaseTreeControl.prototype.toggle = function (dataNode) {\n            this.expansionModel.toggle(dataNode);\n        };\n        /** Expands one single data node. */\n        BaseTreeControl.prototype.expand = function (dataNode) {\n            this.expansionModel.select(dataNode);\n        };\n        /** Collapses one single data node. */\n        BaseTreeControl.prototype.collapse = function (dataNode) {\n            this.expansionModel.deselect(dataNode);\n        };\n        /** Whether a given data node is expanded or not. Returns true if the data node is expanded. */\n        BaseTreeControl.prototype.isExpanded = function (dataNode) {\n            return this.expansionModel.isSelected(dataNode);\n        };\n        /** Toggles a subtree rooted at `node` recursively. */\n        BaseTreeControl.prototype.toggleDescendants = function (dataNode) {\n            this.expansionModel.isSelected(dataNode)\n                ? this.collapseDescendants(dataNode)\n                : this.expandDescendants(dataNode);\n        };\n        /** Collapse all dataNodes in the tree. */\n        BaseTreeControl.prototype.collapseAll = function () {\n            this.expansionModel.clear();\n        };\n        /** Expands a subtree rooted at given data node recursively. */\n        BaseTreeControl.prototype.expandDescendants = function (dataNode) {\n            var _a;\n            var toBeProcessed = [dataNode];\n            toBeProcessed.push.apply(toBeProcessed, __spread(this.getDescendants(dataNode)));\n            (_a = this.expansionModel).select.apply(_a, __spread(toBeProcessed));\n        };\n        /** Collapses a subtree rooted at given data node recursively. */\n        BaseTreeControl.prototype.collapseDescendants = function (dataNode) {\n            var _a;\n            var toBeProcessed = [dataNode];\n            toBeProcessed.push.apply(toBeProcessed, __spread(this.getDescendants(dataNode)));\n            (_a = this.expansionModel).deselect.apply(_a, __spread(toBeProcessed));\n        };\n        return BaseTreeControl;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Flat tree control. Able to expand/collapse a subtree recursively for flattened tree. */\n    var FlatTreeControl = /** @class */ (function (_super) {\n        __extends(FlatTreeControl, _super);\n        /** Construct with flat tree data node functions getLevel and isExpandable. */\n        function FlatTreeControl(getLevel, isExpandable) {\n            var _this = _super.call(this) || this;\n            _this.getLevel = getLevel;\n            _this.isExpandable = isExpandable;\n            return _this;\n        }\n        /**\n         * Gets a list of the data node's subtree of descendent data nodes.\n         *\n         * To make this working, the `dataNodes` of the TreeControl must be flattened tree nodes\n         * with correct levels.\n         */\n        FlatTreeControl.prototype.getDescendants = function (dataNode) {\n            var startIndex = this.dataNodes.indexOf(dataNode);\n            var results = [];\n            // Goes through flattened tree nodes in the `dataNodes` array, and get all descendants.\n            // The level of descendants of a tree node must be greater than the level of the given\n            // tree node.\n            // If we reach a node whose level is equal to the level of the tree node, we hit a sibling.\n            // If we reach a node whose level is greater than the level of the tree node, we hit a\n            // sibling of an ancestor.\n            for (var i = startIndex + 1; i < this.dataNodes.length && this.getLevel(dataNode) < this.getLevel(this.dataNodes[i]); i++) {\n                results.push(this.dataNodes[i]);\n            }\n            return results;\n        };\n        /**\n         * Expands all data nodes in the tree.\n         *\n         * To make this working, the `dataNodes` variable of the TreeControl must be set to all flattened\n         * data nodes of the tree.\n         */\n        FlatTreeControl.prototype.expandAll = function () {\n            var _a;\n            (_a = this.expansionModel).select.apply(_a, __spread(this.dataNodes));\n        };\n        return FlatTreeControl;\n    }(BaseTreeControl));\n\n    /** Nested tree control. Able to expand/collapse a subtree recursively for NestedNode type. */\n    var NestedTreeControl = /** @class */ (function (_super) {\n        __extends(NestedTreeControl, _super);\n        /** Construct with nested tree function getChildren. */\n        function NestedTreeControl(getChildren) {\n            var _this = _super.call(this) || this;\n            _this.getChildren = getChildren;\n            return _this;\n        }\n        /**\n         * Expands all dataNodes in the tree.\n         *\n         * To make this working, the `dataNodes` variable of the TreeControl must be set to all root level\n         * data nodes of the tree.\n         */\n        NestedTreeControl.prototype.expandAll = function () {\n            var _a;\n            var _this = this;\n            this.expansionModel.clear();\n            var allNodes = this.dataNodes.reduce(function (accumulator, dataNode) {\n                return __spread(accumulator, _this.getDescendants(dataNode), [dataNode]);\n            }, []);\n            (_a = this.expansionModel).select.apply(_a, __spread(allNodes));\n        };\n        /** Gets a list of descendant dataNodes of a subtree rooted at given data node recursively. */\n        NestedTreeControl.prototype.getDescendants = function (dataNode) {\n            var descendants = [];\n            this._getDescendants(descendants, dataNode);\n            // Remove the node itself\n            return descendants.splice(1);\n        };\n        /** A helper function to get descendants recursively. */\n        NestedTreeControl.prototype._getDescendants = function (descendants, dataNode) {\n            var _this = this;\n            descendants.push(dataNode);\n            var childrenNodes = this.getChildren(dataNode);\n            if (Array.isArray(childrenNodes)) {\n                childrenNodes.forEach(function (child) { return _this._getDescendants(descendants, child); });\n            }\n            else if (rxjs.isObservable(childrenNodes)) {\n                // TypeScript as of version 3.5 doesn't seem to treat `Boolean` like a function that\n                // returns a `boolean` specifically in the context of `filter`, so we manually clarify that.\n                childrenNodes.pipe(operators.take(1), operators.filter(Boolean))\n                    .subscribe(function (children) {\n                    var e_1, _a;\n                    try {\n                        for (var children_1 = __values(children), children_1_1 = children_1.next(); !children_1_1.done; children_1_1 = children_1.next()) {\n                            var child = children_1_1.value;\n                            _this._getDescendants(descendants, child);\n                        }\n                    }\n                    catch (e_1_1) { e_1 = { error: e_1_1 }; }\n                    finally {\n                        try {\n                            if (children_1_1 && !children_1_1.done && (_a = children_1.return)) _a.call(children_1);\n                        }\n                        finally { if (e_1) throw e_1.error; }\n                    }\n                });\n            }\n        };\n        return NestedTreeControl;\n    }(BaseTreeControl));\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Injection token used to provide a `CdkTreeNode` to its outlet.\n     * Used primarily to avoid circular imports.\n     * @docs-private\n     */\n    var CDK_TREE_NODE_OUTLET_NODE = new core.InjectionToken('CDK_TREE_NODE_OUTLET_NODE');\n    /**\n     * Outlet for nested CdkNode. Put `[cdkTreeNodeOutlet]` on a tag to place children dataNodes\n     * inside the outlet.\n     */\n    var CdkTreeNodeOutlet = /** @class */ (function () {\n        function CdkTreeNodeOutlet(viewContainer, _node) {\n            this.viewContainer = viewContainer;\n            this._node = _node;\n        }\n        CdkTreeNodeOutlet.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodeOutlet]'\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeOutlet.ctorParameters = function () { return [\n            { type: core.ViewContainerRef },\n            { type: undefined, decorators: [{ type: core.Inject, args: [CDK_TREE_NODE_OUTLET_NODE,] }, { type: core.Optional }] }\n        ]; };\n        return CdkTreeNodeOutlet;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Context provided to the tree node component. */\n    var CdkTreeNodeOutletContext = /** @class */ (function () {\n        function CdkTreeNodeOutletContext(data) {\n            this.$implicit = data;\n        }\n        return CdkTreeNodeOutletContext;\n    }());\n    /**\n     * Data node definition for the CdkTree.\n     * Captures the node's template and a when predicate that describes when this node should be used.\n     */\n    var CdkTreeNodeDef = /** @class */ (function () {\n        /** @docs-private */\n        function CdkTreeNodeDef(template) {\n            this.template = template;\n        }\n        CdkTreeNodeDef.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodeDef]',\n                        inputs: [\n                            'when: cdkTreeNodeDefWhen'\n                        ],\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeDef.ctorParameters = function () { return [\n            { type: core.TemplateRef }\n        ]; };\n        return CdkTreeNodeDef;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Returns an error to be thrown when there is no usable data.\n     * @docs-private\n     */\n    function getTreeNoValidDataSourceError() {\n        return Error(\"A valid data source must be provided.\");\n    }\n    /**\n     * Returns an error to be thrown when there are multiple nodes that are missing a when function.\n     * @docs-private\n     */\n    function getTreeMultipleDefaultNodeDefsError() {\n        return Error(\"There can only be one default row without a when predicate function.\");\n    }\n    /**\n     * Returns an error to be thrown when there are no matching node defs for a particular set of data.\n     * @docs-private\n     */\n    function getTreeMissingMatchingNodeDefError() {\n        return Error(\"Could not find a matching node definition for the provided node data.\");\n    }\n    /**\n     * Returns an error to be thrown when there are tree control.\n     * @docs-private\n     */\n    function getTreeControlMissingError() {\n        return Error(\"Could not find a tree control for the tree.\");\n    }\n    /**\n     * Returns an error to be thrown when tree control did not implement functions for flat/nested node.\n     * @docs-private\n     */\n    function getTreeControlFunctionsMissingError() {\n        return Error(\"Could not find functions for nested/flat tree in tree control.\");\n    }\n\n    /**\n     * CDK tree component that connects with a data source to retrieve data of type `T` and renders\n     * dataNodes with hierarchy. Updates the dataNodes when new data is provided by the data source.\n     */\n    var CdkTree = /** @class */ (function () {\n        function CdkTree(_differs, _changeDetectorRef) {\n            this._differs = _differs;\n            this._changeDetectorRef = _changeDetectorRef;\n            /** Subject that emits when the component has been destroyed. */\n            this._onDestroy = new rxjs.Subject();\n            /** Level of nodes */\n            this._levels = new Map();\n            // TODO(tinayuangao): Setup a listener for scrolling, emit the calculated view to viewChange.\n            //     Remove the MAX_VALUE in viewChange\n            /**\n             * Stream containing the latest information on what rows are being displayed on screen.\n             * Can be used by the data source to as a heuristic of what data should be provided.\n             */\n            this.viewChange = new rxjs.BehaviorSubject({ start: 0, end: Number.MAX_VALUE });\n        }\n        Object.defineProperty(CdkTree.prototype, \"dataSource\", {\n            /**\n             * Provides a stream containing the latest data array to render. Influenced by the tree's\n             * stream of view window (what dataNodes are currently on screen).\n             * Data source can be an observable of data array, or a data array to render.\n             */\n            get: function () { return this._dataSource; },\n            set: function (dataSource) {\n                if (this._dataSource !== dataSource) {\n                    this._switchDataSource(dataSource);\n                }\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTree.prototype.ngOnInit = function () {\n            this._dataDiffer = this._differs.find([]).create(this.trackBy);\n            if (!this.treeControl) {\n                throw getTreeControlMissingError();\n            }\n        };\n        CdkTree.prototype.ngOnDestroy = function () {\n            this._nodeOutlet.viewContainer.clear();\n            this._onDestroy.next();\n            this._onDestroy.complete();\n            if (this._dataSource && typeof this._dataSource.disconnect === 'function') {\n                this.dataSource.disconnect(this);\n            }\n            if (this._dataSubscription) {\n                this._dataSubscription.unsubscribe();\n                this._dataSubscription = null;\n            }\n        };\n        CdkTree.prototype.ngAfterContentChecked = function () {\n            var defaultNodeDefs = this._nodeDefs.filter(function (def) { return !def.when; });\n            if (defaultNodeDefs.length > 1) {\n                throw getTreeMultipleDefaultNodeDefsError();\n            }\n            this._defaultNodeDef = defaultNodeDefs[0];\n            if (this.dataSource && this._nodeDefs && !this._dataSubscription) {\n                this._observeRenderChanges();\n            }\n        };\n        // TODO(tinayuangao): Work on keyboard traversal and actions, make sure it's working for RTL\n        //     and nested trees.\n        /**\n         * Switch to the provided data source by resetting the data and unsubscribing from the current\n         * render change subscription if one exists. If the data source is null, interpret this by\n         * clearing the node outlet. Otherwise start listening for new data.\n         */\n        CdkTree.prototype._switchDataSource = function (dataSource) {\n            if (this._dataSource && typeof this._dataSource.disconnect === 'function') {\n                this.dataSource.disconnect(this);\n            }\n            if (this._dataSubscription) {\n                this._dataSubscription.unsubscribe();\n                this._dataSubscription = null;\n            }\n            // Remove the all dataNodes if there is now no data source\n            if (!dataSource) {\n                this._nodeOutlet.viewContainer.clear();\n            }\n            this._dataSource = dataSource;\n            if (this._nodeDefs) {\n                this._observeRenderChanges();\n            }\n        };\n        /** Set up a subscription for the data provided by the data source. */\n        CdkTree.prototype._observeRenderChanges = function () {\n            var _this = this;\n            var dataStream;\n            if (collections.isDataSource(this._dataSource)) {\n                dataStream = this._dataSource.connect(this);\n            }\n            else if (rxjs.isObservable(this._dataSource)) {\n                dataStream = this._dataSource;\n            }\n            else if (Array.isArray(this._dataSource)) {\n                dataStream = rxjs.of(this._dataSource);\n            }\n            if (dataStream) {\n                this._dataSubscription = dataStream.pipe(operators.takeUntil(this._onDestroy))\n                    .subscribe(function (data) { return _this.renderNodeChanges(data); });\n            }\n            else {\n                throw getTreeNoValidDataSourceError();\n            }\n        };\n        /** Check for changes made in the data and render each change (node added/removed/moved). */\n        CdkTree.prototype.renderNodeChanges = function (data, dataDiffer, viewContainer, parentData) {\n            var _this = this;\n            if (dataDiffer === void 0) { dataDiffer = this._dataDiffer; }\n            if (viewContainer === void 0) { viewContainer = this._nodeOutlet.viewContainer; }\n            var changes = dataDiffer.diff(data);\n            if (!changes) {\n                return;\n            }\n            changes.forEachOperation(function (item, adjustedPreviousIndex, currentIndex) {\n                if (item.previousIndex == null) {\n                    _this.insertNode(data[currentIndex], currentIndex, viewContainer, parentData);\n                }\n                else if (currentIndex == null) {\n                    viewContainer.remove(adjustedPreviousIndex);\n                    _this._levels.delete(item.item);\n                }\n                else {\n                    var view = viewContainer.get(adjustedPreviousIndex);\n                    viewContainer.move(view, currentIndex);\n                }\n            });\n            this._changeDetectorRef.detectChanges();\n        };\n        /**\n         * Finds the matching node definition that should be used for this node data. If there is only\n         * one node definition, it is returned. Otherwise, find the node definition that has a when\n         * predicate that returns true with the data. If none return true, return the default node\n         * definition.\n         */\n        CdkTree.prototype._getNodeDef = function (data, i) {\n            if (this._nodeDefs.length === 1) {\n                return this._nodeDefs.first;\n            }\n            var nodeDef = this._nodeDefs.find(function (def) { return def.when && def.when(i, data); }) || this._defaultNodeDef;\n            if (!nodeDef) {\n                throw getTreeMissingMatchingNodeDefError();\n            }\n            return nodeDef;\n        };\n        /**\n         * Create the embedded view for the data node template and place it in the correct index location\n         * within the data node view container.\n         */\n        CdkTree.prototype.insertNode = function (nodeData, index, viewContainer, parentData) {\n            var node = this._getNodeDef(nodeData, index);\n            // Node context that will be provided to created embedded view\n            var context = new CdkTreeNodeOutletContext(nodeData);\n            // If the tree is flat tree, then use the `getLevel` function in flat tree control\n            // Otherwise, use the level of parent node.\n            if (this.treeControl.getLevel) {\n                context.level = this.treeControl.getLevel(nodeData);\n            }\n            else if (typeof parentData !== 'undefined' && this._levels.has(parentData)) {\n                context.level = this._levels.get(parentData) + 1;\n            }\n            else {\n                context.level = 0;\n            }\n            this._levels.set(nodeData, context.level);\n            // Use default tree nodeOutlet, or nested node's nodeOutlet\n            var container = viewContainer ? viewContainer : this._nodeOutlet.viewContainer;\n            container.createEmbeddedView(node.template, context, index);\n            // Set the data to just created `CdkTreeNode`.\n            // The `CdkTreeNode` created from `createEmbeddedView` will be saved in static variable\n            //     `mostRecentTreeNode`. We get it from static variable and pass the node data to it.\n            if (CdkTreeNode.mostRecentTreeNode) {\n                CdkTreeNode.mostRecentTreeNode.data = nodeData;\n            }\n        };\n        CdkTree.decorators = [\n            { type: core.Component, args: [{\n                        selector: 'cdk-tree',\n                        exportAs: 'cdkTree',\n                        template: \"<ng-container cdkTreeNodeOutlet></ng-container>\",\n                        host: {\n                            'class': 'cdk-tree',\n                            'role': 'tree',\n                        },\n                        encapsulation: core.ViewEncapsulation.None,\n                        // The \"OnPush\" status for the `CdkTree` component is effectively a noop, so we are removing it.\n                        // The view for `CdkTree` consists entirely of templates declared in other views. As they are\n                        // declared elsewhere, they are checked when their declaration points are checked.\n                        // tslint:disable-next-line:validate-decorators\n                        changeDetection: core.ChangeDetectionStrategy.Default\n                    }] }\n        ];\n        /** @nocollapse */\n        CdkTree.ctorParameters = function () { return [\n            { type: core.IterableDiffers },\n            { type: core.ChangeDetectorRef }\n        ]; };\n        CdkTree.propDecorators = {\n            dataSource: [{ type: core.Input }],\n            treeControl: [{ type: core.Input }],\n            trackBy: [{ type: core.Input }],\n            _nodeOutlet: [{ type: core.ViewChild, args: [CdkTreeNodeOutlet, { static: true },] }],\n            _nodeDefs: [{ type: core.ContentChildren, args: [CdkTreeNodeDef, {\n                            // We need to use `descendants: true`, because Ivy will no longer match\n                            // indirect descendants if it's left as false.\n                            descendants: true\n                        },] }]\n        };\n        return CdkTree;\n    }());\n    /**\n     * Tree node for CdkTree. It contains the data in the tree node.\n     */\n    var CdkTreeNode = /** @class */ (function () {\n        function CdkTreeNode(_elementRef, _tree) {\n            this._elementRef = _elementRef;\n            this._tree = _tree;\n            /** Subject that emits when the component has been destroyed. */\n            this._destroyed = new rxjs.Subject();\n            /** Emits when the node's data has changed. */\n            this._dataChanges = new rxjs.Subject();\n            /**\n             * The role of the node should be 'group' if it's an internal node,\n             * and 'treeitem' if it's a leaf node.\n             */\n            this.role = 'treeitem';\n            CdkTreeNode.mostRecentTreeNode = this;\n        }\n        Object.defineProperty(CdkTreeNode.prototype, \"data\", {\n            /** The tree node's data. */\n            get: function () { return this._data; },\n            set: function (value) {\n                if (value !== this._data) {\n                    this._data = value;\n                    this._setRoleFromData();\n                    this._dataChanges.next();\n                }\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNode.prototype, \"isExpanded\", {\n            get: function () {\n                return this._tree.treeControl.isExpanded(this._data);\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNode.prototype, \"level\", {\n            get: function () {\n                return this._tree.treeControl.getLevel ? this._tree.treeControl.getLevel(this._data) : 0;\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTreeNode.prototype.ngOnDestroy = function () {\n            // If this is the last tree node being destroyed,\n            // clear out the reference to avoid leaking memory.\n            if (CdkTreeNode.mostRecentTreeNode === this) {\n                CdkTreeNode.mostRecentTreeNode = null;\n            }\n            this._dataChanges.complete();\n            this._destroyed.next();\n            this._destroyed.complete();\n        };\n        /** Focuses the menu item. Implements for FocusableOption. */\n        CdkTreeNode.prototype.focus = function () {\n            this._elementRef.nativeElement.focus();\n        };\n        CdkTreeNode.prototype._setRoleFromData = function () {\n            var _this = this;\n            if (this._tree.treeControl.isExpandable) {\n                this.role = this._tree.treeControl.isExpandable(this._data) ? 'group' : 'treeitem';\n            }\n            else {\n                if (!this._tree.treeControl.getChildren) {\n                    throw getTreeControlFunctionsMissingError();\n                }\n                var childrenNodes = this._tree.treeControl.getChildren(this._data);\n                if (Array.isArray(childrenNodes)) {\n                    this._setRoleFromChildren(childrenNodes);\n                }\n                else if (rxjs.isObservable(childrenNodes)) {\n                    childrenNodes.pipe(operators.takeUntil(this._destroyed))\n                        .subscribe(function (children) { return _this._setRoleFromChildren(children); });\n                }\n            }\n        };\n        CdkTreeNode.prototype._setRoleFromChildren = function (children) {\n            this.role = children && children.length ? 'group' : 'treeitem';\n        };\n        /**\n         * The most recently created `CdkTreeNode`. We save it in static variable so we can retrieve it\n         * in `CdkTree` and set the data to it.\n         */\n        CdkTreeNode.mostRecentTreeNode = null;\n        CdkTreeNode.decorators = [\n            { type: core.Directive, args: [{\n                        selector: 'cdk-tree-node',\n                        exportAs: 'cdkTreeNode',\n                        host: {\n                            '[attr.aria-expanded]': 'isExpanded',\n                            '[attr.aria-level]': 'role === \"treeitem\" ? level : null',\n                            '[attr.role]': 'role',\n                            'class': 'cdk-tree-node',\n                        },\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNode.ctorParameters = function () { return [\n            { type: core.ElementRef },\n            { type: CdkTree }\n        ]; };\n        CdkTreeNode.propDecorators = {\n            role: [{ type: core.Input }]\n        };\n        return CdkTreeNode;\n    }());\n\n    /**\n     * Nested node is a child of `<cdk-tree>`. It works with nested tree.\n     * By using `cdk-nested-tree-node` component in tree node template, children of the parent node will\n     * be added in the `cdkTreeNodeOutlet` in tree node template.\n     * The children of node will be automatically added to `cdkTreeNodeOutlet`.\n     */\n    var CdkNestedTreeNode = /** @class */ (function (_super) {\n        __extends(CdkNestedTreeNode, _super);\n        function CdkNestedTreeNode(_elementRef, _tree, _differs) {\n            var _this = _super.call(this, _elementRef, _tree) || this;\n            _this._elementRef = _elementRef;\n            _this._tree = _tree;\n            _this._differs = _differs;\n            return _this;\n        }\n        CdkNestedTreeNode.prototype.ngAfterContentInit = function () {\n            var _this = this;\n            this._dataDiffer = this._differs.find([]).create(this._tree.trackBy);\n            if (!this._tree.treeControl.getChildren) {\n                throw getTreeControlFunctionsMissingError();\n            }\n            var childrenNodes = this._tree.treeControl.getChildren(this.data);\n            if (Array.isArray(childrenNodes)) {\n                this.updateChildrenNodes(childrenNodes);\n            }\n            else if (rxjs.isObservable(childrenNodes)) {\n                childrenNodes.pipe(operators.takeUntil(this._destroyed))\n                    .subscribe(function (result) { return _this.updateChildrenNodes(result); });\n            }\n            this.nodeOutlet.changes.pipe(operators.takeUntil(this._destroyed))\n                .subscribe(function () { return _this.updateChildrenNodes(); });\n        };\n        CdkNestedTreeNode.prototype.ngOnDestroy = function () {\n            this._clear();\n            _super.prototype.ngOnDestroy.call(this);\n        };\n        /** Add children dataNodes to the NodeOutlet */\n        CdkNestedTreeNode.prototype.updateChildrenNodes = function (children) {\n            var outlet = this._getNodeOutlet();\n            if (children) {\n                this._children = children;\n            }\n            if (outlet && this._children) {\n                var viewContainer = outlet.viewContainer;\n                this._tree.renderNodeChanges(this._children, this._dataDiffer, viewContainer, this._data);\n            }\n            else {\n                // Reset the data differ if there's no children nodes displayed\n                this._dataDiffer.diff([]);\n            }\n        };\n        /** Clear the children dataNodes. */\n        CdkNestedTreeNode.prototype._clear = function () {\n            var outlet = this._getNodeOutlet();\n            if (outlet) {\n                outlet.viewContainer.clear();\n                this._dataDiffer.diff([]);\n            }\n        };\n        /** Gets the outlet for the current node. */\n        CdkNestedTreeNode.prototype._getNodeOutlet = function () {\n            var _this = this;\n            var outlets = this.nodeOutlet;\n            // Note that since we use `descendants: true` on the query, we have to ensure\n            // that we don't pick up the outlet of a child node by accident.\n            return outlets && outlets.find(function (outlet) { return !outlet._node || outlet._node === _this; });\n        };\n        CdkNestedTreeNode.decorators = [\n            { type: core.Directive, args: [{\n                        selector: 'cdk-nested-tree-node',\n                        exportAs: 'cdkNestedTreeNode',\n                        host: {\n                            '[attr.aria-expanded]': 'isExpanded',\n                            '[attr.role]': 'role',\n                            'class': 'cdk-tree-node cdk-nested-tree-node',\n                        },\n                        providers: [\n                            { provide: CdkTreeNode, useExisting: CdkNestedTreeNode },\n                            { provide: CDK_TREE_NODE_OUTLET_NODE, useExisting: CdkNestedTreeNode }\n                        ]\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkNestedTreeNode.ctorParameters = function () { return [\n            { type: core.ElementRef },\n            { type: CdkTree },\n            { type: core.IterableDiffers }\n        ]; };\n        CdkNestedTreeNode.propDecorators = {\n            nodeOutlet: [{ type: core.ContentChildren, args: [CdkTreeNodeOutlet, {\n                            // We need to use `descendants: true`, because Ivy will no longer match\n                            // indirect descendants if it's left as false.\n                            descendants: true\n                        },] }]\n        };\n        return CdkNestedTreeNode;\n    }(CdkTreeNode));\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Regex used to split a string on its CSS units. */\n    var cssUnitPattern = /([A-Za-z%]+)$/;\n    /**\n     * Indent for the children tree dataNodes.\n     * This directive will add left-padding to the node to show hierarchy.\n     */\n    var CdkTreeNodePadding = /** @class */ (function () {\n        function CdkTreeNodePadding(_treeNode, _tree, \n        /**\n         * @deprecated _renderer parameter no longer being used. To be removed.\n         * @breaking-change 11.0.0\n         */\n        _renderer, _element, _dir) {\n            var _this = this;\n            this._treeNode = _treeNode;\n            this._tree = _tree;\n            this._element = _element;\n            this._dir = _dir;\n            /** Subject that emits when the component has been destroyed. */\n            this._destroyed = new rxjs.Subject();\n            /** CSS units used for the indentation value. */\n            this.indentUnits = 'px';\n            this._indent = 40;\n            this._setPadding();\n            if (_dir) {\n                _dir.change.pipe(operators.takeUntil(this._destroyed)).subscribe(function () { return _this._setPadding(true); });\n            }\n            // In Ivy the indentation binding might be set before the tree node's data has been added,\n            // which means that we'll miss the first render. We have to subscribe to changes in the\n            // data to ensure that everything is up to date.\n            _treeNode._dataChanges.subscribe(function () { return _this._setPadding(); });\n        }\n        Object.defineProperty(CdkTreeNodePadding.prototype, \"level\", {\n            /** The level of depth of the tree node. The padding will be `level * indent` pixels. */\n            get: function () { return this._level; },\n            set: function (value) {\n                // Set to null as the fallback value so that _setPadding can fall back to the node level if the\n                // consumer set the directive as `cdkTreeNodePadding=\"\"`. We still want to take this value if\n                // they set 0 explicitly.\n                this._level = coercion.coerceNumberProperty(value, null);\n                this._setPadding();\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNodePadding.prototype, \"indent\", {\n            /**\n             * The indent for each level. Can be a number or a CSS string.\n             * Default number 40px from material design menu sub-menu spec.\n             */\n            get: function () { return this._indent; },\n            set: function (indent) {\n                var value = indent;\n                var units = 'px';\n                if (typeof indent === 'string') {\n                    var parts = indent.split(cssUnitPattern);\n                    value = parts[0];\n                    units = parts[1] || units;\n                }\n                this.indentUnits = units;\n                this._indent = coercion.coerceNumberProperty(value);\n                this._setPadding();\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTreeNodePadding.prototype.ngOnDestroy = function () {\n            this._destroyed.next();\n            this._destroyed.complete();\n        };\n        /** The padding indent value for the tree node. Returns a string with px numbers if not null. */\n        CdkTreeNodePadding.prototype._paddingIndent = function () {\n            var nodeLevel = (this._treeNode.data && this._tree.treeControl.getLevel)\n                ? this._tree.treeControl.getLevel(this._treeNode.data)\n                : null;\n            var level = this._level == null ? nodeLevel : this._level;\n            return typeof level === 'number' ? \"\" + level * this._indent + this.indentUnits : null;\n        };\n        CdkTreeNodePadding.prototype._setPadding = function (forceChange) {\n            if (forceChange === void 0) { forceChange = false; }\n            var padding = this._paddingIndent();\n            if (padding !== this._currentPadding || forceChange) {\n                var element = this._element.nativeElement;\n                var paddingProp = this._dir && this._dir.value === 'rtl' ? 'paddingRight' : 'paddingLeft';\n                var resetProp = paddingProp === 'paddingLeft' ? 'paddingRight' : 'paddingLeft';\n                element.style[paddingProp] = padding || '';\n                element.style[resetProp] = '';\n                this._currentPadding = padding;\n            }\n        };\n        CdkTreeNodePadding.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodePadding]',\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodePadding.ctorParameters = function () { return [\n            { type: CdkTreeNode },\n            { type: CdkTree },\n            { type: core.Renderer2 },\n            { type: core.ElementRef },\n            { type: bidi.Directionality, decorators: [{ type: core.Optional }] }\n        ]; };\n        CdkTreeNodePadding.propDecorators = {\n            level: [{ type: core.Input, args: ['cdkTreeNodePadding',] }],\n            indent: [{ type: core.Input, args: ['cdkTreeNodePaddingIndent',] }]\n        };\n        return CdkTreeNodePadding;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Node toggle to expand/collapse the node.\n     */\n    var CdkTreeNodeToggle = /** @class */ (function () {\n        function CdkTreeNodeToggle(_tree, _treeNode) {\n            this._tree = _tree;\n            this._treeNode = _treeNode;\n            this._recursive = false;\n        }\n        Object.defineProperty(CdkTreeNodeToggle.prototype, \"recursive\", {\n            /** Whether expand/collapse the node recursively. */\n            get: function () { return this._recursive; },\n            set: function (value) { this._recursive = coercion.coerceBooleanProperty(value); },\n            enumerable: true,\n            configurable: true\n        });\n        // We have to use a `HostListener` here in order to support both Ivy and ViewEngine.\n        // In Ivy the `host` bindings will be merged when this class is extended, whereas in\n        // ViewEngine they're overwritten.\n        // TODO(crisbeto): we move this back into `host` once Ivy is turned on by default.\n        // tslint:disable-next-line:no-host-decorator-in-concrete\n        CdkTreeNodeToggle.prototype._toggle = function (event) {\n            this.recursive\n                ? this._tree.treeControl.toggleDescendants(this._treeNode.data)\n                : this._tree.treeControl.toggle(this._treeNode.data);\n            event.stopPropagation();\n        };\n        CdkTreeNodeToggle.decorators = [\n            { type: core.Directive, args: [{ selector: '[cdkTreeNodeToggle]' },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeToggle.ctorParameters = function () { return [\n            { type: CdkTree },\n            { type: CdkTreeNode }\n        ]; };\n        CdkTreeNodeToggle.propDecorators = {\n            recursive: [{ type: core.Input, args: ['cdkTreeNodeToggleRecursive',] }],\n            _toggle: [{ type: core.HostListener, args: ['click', ['$event'],] }]\n        };\n        return CdkTreeNodeToggle;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    var EXPORTED_DECLARATIONS = [\n        CdkNestedTreeNode,\n        CdkTreeNodeDef,\n        CdkTreeNodePadding,\n        CdkTreeNodeToggle,\n        CdkTree,\n        CdkTreeNode,\n        CdkTreeNodeOutlet,\n    ];\n    var CdkTreeModule = /** @class */ (function () {\n        function CdkTreeModule() {\n        }\n        CdkTreeModule.decorators = [\n            { type: core.NgModule, args: [{\n                        exports: EXPORTED_DECLARATIONS,\n                        declarations: EXPORTED_DECLARATIONS,\n                        providers: [a11y.FocusMonitor, CdkTreeNodeDef]\n                    },] }\n        ];\n        return CdkTreeModule;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n\n    /**\n     * Generated bundle index. Do not edit.\n     */\n\n    exports.BaseTreeControl = BaseTreeControl;\n    exports.CDK_TREE_NODE_OUTLET_NODE = CDK_TREE_NODE_OUTLET_NODE;\n    exports.CdkNestedTreeNode = CdkNestedTreeNode;\n    exports.CdkTree = CdkTree;\n    exports.CdkTreeModule = CdkTreeModule;\n    exports.CdkTreeNode = CdkTreeNode;\n    exports.CdkTreeNodeDef = CdkTreeNodeDef;\n    exports.CdkTreeNodeOutlet = CdkTreeNodeOutlet;\n    exports.CdkTreeNodeOutletContext = CdkTreeNodeOutletContext;\n    exports.CdkTreeNodePadding = CdkTreeNodePadding;\n    exports.CdkTreeNodeToggle = CdkTreeNodeToggle;\n    exports.FlatTreeControl = FlatTreeControl;\n    exports.NestedTreeControl = NestedTreeControl;\n    exports.getTreeControlFunctionsMissingError = getTreeControlFunctionsMissingError;\n    exports.getTreeControlMissingError = getTreeControlMissingError;\n    exports.getTreeMissingMatchingNodeDefError = getTreeMissingMatchingNodeDefError;\n    exports.getTreeMultipleDefaultNodeDefsError = getTreeMultipleDefaultNodeDefsError;\n    exports.getTreeNoValidDataSourceError = getTreeNoValidDataSourceError;\n\n    Object.defineProperty(exports, '__esModule', { value: true });\n\n})));\n//# sourceMappingURL=cdk-tree.umd.js.map\n"]}
+{"version":3,"sources":["src/cdk/cdk-tree.umd.js"],"names":["global","factory","exports","module","require","define","amd","self","ng","cdk","tree","collections","rxjs","operators","core","bidi","coercion","a11y","this","extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","hasOwnProperty","__extends","__","constructor","prototype","create","__read","o","n","m","Symbol","iterator","r","e","i","call","ar","next","done","push","value","error","__spread","arguments","length","concat","BaseTreeControl","expansionModel","SelectionModel","toggle","dataNode","expand","select","collapse","deselect","isExpanded","isSelected","toggleDescendants","collapseDescendants","expandDescendants","collapseAll","clear","_a","toBeProcessed","apply","getDescendants","FlatTreeControl","_super","getLevel","isExpandable","_this","results","dataNodes","indexOf","expandAll","NestedTreeControl","getChildren","allNodes","reduce","accumulator","descendants","_getDescendants","splice","childrenNodes","isArray","forEach","child","isObservable","pipe","take","filter","Boolean","subscribe","children","e_1","children_1","__values","children_1_1","e_1_1","return","CDK_TREE_NODE_OUTLET_NODE","InjectionToken","CdkTreeNodeOutlet","viewContainer","_node","decorators","type","Directive","args","selector","ctorParameters","ViewContainerRef","undefined","Inject","Optional","CdkTreeNodeOutletContext","data","$implicit","CdkTreeNodeDef","template","inputs","TemplateRef","getTreeNoValidDataSourceError","Error","getTreeMultipleDefaultNodeDefsError","getTreeMissingMatchingNodeDefError","getTreeControlMissingError","getTreeControlFunctionsMissingError","CdkTree","_differs","_changeDetectorRef","_onDestroy","Subject","_levels","Map","viewChange","BehaviorSubject","start","end","Number","MAX_VALUE","defineProperty","get","_dataSource","set","dataSource","_switchDataSource","enumerable","configurable","ngOnInit","_dataDiffer","find","trackBy","treeControl","ngOnDestroy","_nodeOutlet","complete","disconnect","_dataSubscription","unsubscribe","ngAfterContentChecked","defaultNodeDefs","_nodeDefs","def","when","_defaultNodeDef","_observeRenderChanges","dataStream","isDataSource","connect","of","takeUntil","renderNodeChanges","dataDiffer","parentData","changes","diff","forEachOperation","item","adjustedPreviousIndex","currentIndex","previousIndex","insertNode","remove","delete","view","move","detectChanges","_getNodeDef","first","nodeDef","nodeData","index","node","context","level","has","createEmbeddedView","CdkTreeNode","mostRecentTreeNode","Component","exportAs","host","class","role","encapsulation","ViewEncapsulation","None","changeDetection","ChangeDetectionStrategy","Default","IterableDiffers","ChangeDetectorRef","propDecorators","Input","ViewChild","static","ContentChildren","_elementRef","_tree","_destroyed","_dataChanges","_data","_setRoleFromData","focus","nativeElement","_setRoleFromChildren","[attr.aria-expanded]","[attr.aria-level]","[attr.role]","ElementRef","CdkNestedTreeNode","ngAfterContentInit","updateChildrenNodes","result","nodeOutlet","_clear","outlet","_getNodeOutlet","_children","outlets","providers","provide","useExisting","cssUnitPattern","CdkTreeNodePadding","_treeNode","_renderer","_element","_dir","indentUnits","_indent","_setPadding","change","_level","coerceNumberProperty","indent","units","parts","split","_paddingIndent","nodeLevel","forceChange","padding","_currentPadding","element","paddingProp","resetProp","style","Renderer2","Directionality","CdkTreeNodeToggle","_recursive","coerceBooleanProperty","_toggle","event","recursive","stopPropagation","HostListener","EXPORTED_DECLARATIONS","CdkTreeModule","NgModule","declarations","FocusMonitor"],"mappings":"CAAC,SAAUA,EAAQC,GACI,iBAAZC,SAA0C,oBAAXC,OAAyBF,EAAQC,QAASE,QAAQ,4BAA6BA,QAAQ,QAASA,QAAQ,kBAAmBA,QAAQ,iBAAkBA,QAAQ,qBAAsBA,QAAQ,yBAA0BA,QAAQ,sBACjP,mBAAXC,QAAyBA,OAAOC,IAAMD,OAAO,oBAAqB,CAAC,UAAW,2BAA4B,OAAQ,iBAAkB,gBAAiB,oBAAqB,wBAAyB,qBAAsBJ,GACtMA,IAAzBD,EAASA,GAAUO,MAAsBC,GAAKR,EAAOQ,IAAM,GAAIR,EAAOQ,GAAGC,IAAMT,EAAOQ,GAAGC,KAAO,GAAIT,EAAOQ,GAAGC,IAAIC,KAAO,IAAKV,EAAOQ,GAAGC,IAAIE,YAAaX,EAAOY,KAAMZ,EAAOY,KAAKC,UAAWb,EAAOQ,GAAGM,KAAMd,EAAOQ,GAAGC,IAAIM,KAAMf,EAAOQ,GAAGC,IAAIO,SAAUhB,EAAOQ,GAAGC,IAAIQ,MAH5Q,CAIEC,MAAM,SAAWhB,EAASS,EAAaC,EAAMC,EAAWC,EAAMC,EAAMC,EAAUC,GAAQ;;;;;;;;;;;;;;oFAkBpF,IAAIE,EAAgB,SAASC,EAAGC,GAI5B,OAHAF,EAAgBG,OAAOC,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUL,EAAGC,GAAKD,EAAEI,UAAYH,IACvE,SAAUD,EAAGC,GAAK,IAAK,IAAIK,KAAKL,EAAOA,EAAEM,eAAeD,KAAIN,EAAEM,GAAKL,EAAEK,MACpDN,EAAGC,IAG5B,SAASO,EAAUR,EAAGC,GAElB,SAASQ,IAAOX,KAAKY,YAAcV,EADnCD,EAAcC,EAAGC,GAEjBD,EAAEW,UAAkB,OAANV,EAAaC,OAAOU,OAAOX,IAAMQ,EAAGE,UAAYV,EAAEU,UAAW,IAAIF,GA6FnF,SAASI,EAAOC,EAAGC,GACf,IAAIC,EAAsB,mBAAXC,QAAyBH,EAAEG,OAAOC,UACjD,IAAKF,EAAG,OAAOF,EACf,IAAmBK,EAAYC,EAA3BC,EAAIL,EAAEM,KAAKR,GAAOS,EAAK,GAC3B,IACI,WAAc,IAANR,GAAgBA,KAAM,MAAQI,EAAIE,EAAEG,QAAQC,MAAMF,EAAGG,KAAKP,EAAEQ,OAExE,MAAOC,GAASR,EAAI,CAAEQ,MAAOA,GAC7B,QACI,IACQT,IAAMA,EAAEM,OAAST,EAAIK,EAAU,SAAIL,EAAEM,KAAKD,GAElD,QAAU,GAAID,EAAG,MAAMA,EAAEQ,OAE7B,OAAOL,EAGX,SAASM,IACL,IAAK,IAAIN,EAAK,GAAIF,EAAI,EAAGA,EAAIS,UAAUC,OAAQV,IAC3CE,EAAKA,EAAGS,OAAOnB,EAAOiB,UAAUT,KACpC,OAAOE,EA2DX,IAAIU,EAAiC,WACjC,SAASA,IAELnC,KAAKoC,eAAiB,IAAI3C,EAAY4C,gBAAe,GA0CzD,OAvCAF,EAAgBtB,UAAUyB,OAAS,SAAUC,GACzCvC,KAAKoC,eAAeE,OAAOC,IAG/BJ,EAAgBtB,UAAU2B,OAAS,SAAUD,GACzCvC,KAAKoC,eAAeK,OAAOF,IAG/BJ,EAAgBtB,UAAU6B,SAAW,SAAUH,GAC3CvC,KAAKoC,eAAeO,SAASJ,IAGjCJ,EAAgBtB,UAAU+B,WAAa,SAAUL,GAC7C,OAAOvC,KAAKoC,eAAeS,WAAWN,IAG1CJ,EAAgBtB,UAAUiC,kBAAoB,SAAUP,GACpDvC,KAAKoC,eAAeS,WAAWN,GACzBvC,KAAK+C,oBAAoBR,GACzBvC,KAAKgD,kBAAkBT,IAGjCJ,EAAgBtB,UAAUoC,YAAc,WACpCjD,KAAKoC,eAAec,SAGxBf,EAAgBtB,UAAUmC,kBAAoB,SAAUT,GACpD,IAAIY,EACAC,EAAgB,CAACb,GACrBa,EAAcxB,KAAKyB,MAAMD,EAAerB,EAAS/B,KAAKsD,eAAef,MACpEY,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAASqB,KAGzDjB,EAAgBtB,UAAUkC,oBAAsB,SAAUR,GACtD,IAAIY,EACAC,EAAgB,CAACb,GACrBa,EAAcxB,KAAKyB,MAAMD,EAAerB,EAAS/B,KAAKsD,eAAef,MACpEY,EAAKnD,KAAKoC,gBAAgBO,SAASU,MAAMF,EAAIpB,EAASqB,KAEpDjB,EA7CyB,GAwDhCoB,EAAiC,SAAUC,GAG3C,SAASD,EAAgBE,EAAUC,GAC/B,IAAIC,EAAQH,EAAOhC,KAAKxB,OAASA,KAGjC,OAFA2D,EAAMF,SAAWA,EACjBE,EAAMD,aAAeA,EACdC,EAgCX,OAtCAjD,EAAU6C,EAAiBC,GAc3BD,EAAgB1C,UAAUyC,eAAiB,SAAUf,GASjD,IARA,IACIqB,EAAU,GAOLrC,EARQvB,KAAK6D,UAAUC,QAAQvB,GAQd,EAAGhB,EAAIvB,KAAK6D,UAAU5B,QAAUjC,KAAKyD,SAASlB,GAAYvC,KAAKyD,SAASzD,KAAK6D,UAAUtC,IAAKA,IAClHqC,EAAQhC,KAAK5B,KAAK6D,UAAUtC,IAEhC,OAAOqC,GAQXL,EAAgB1C,UAAUkD,UAAY,WAClC,IAAIZ,GACHA,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAAS/B,KAAK6D,aAEvDN,EAvCyB,CAwClCpB,GAGE6B,EAAmC,SAAUR,GAG7C,SAASQ,EAAkBC,GACvB,IAAIN,EAAQH,EAAOhC,KAAKxB,OAASA,KAEjC,OADA2D,EAAMM,YAAcA,EACbN,EAsDX,OA3DAjD,EAAUsD,EAAmBR,GAa7BQ,EAAkBnD,UAAUkD,UAAY,WACpC,IAAIZ,EACAQ,EAAQ3D,KACZA,KAAKoC,eAAec,QACpB,IAAIgB,EAAWlE,KAAK6D,UAAUM,QAAO,SAAUC,EAAa7B,GACxD,OAAOR,EAASqC,EAAaT,EAAML,eAAef,GAAW,CAACA,MAC/D,KACFY,EAAKnD,KAAKoC,gBAAgBK,OAAOY,MAAMF,EAAIpB,EAASmC,KAGzDF,EAAkBnD,UAAUyC,eAAiB,SAAUf,GACnD,IAAI8B,EAAc,GAGlB,OAFArE,KAAKsE,gBAAgBD,EAAa9B,GAE3B8B,EAAYE,OAAO,IAG9BP,EAAkBnD,UAAUyD,gBAAkB,SAAUD,EAAa9B,GACjE,IAAIoB,EAAQ3D,KACZqE,EAAYzC,KAAKW,GACjB,IAAIiC,EAAgBxE,KAAKiE,YAAY1B,GACjChC,MAAMkE,QAAQD,GACdA,EAAcE,SAAQ,SAAUC,GAAS,OAAOhB,EAAMW,gBAAgBD,EAAaM,MAE9EjF,EAAKkF,aAAaJ,IAGvBA,EAAcK,KAAKlF,EAAUmF,KAAK,GAAInF,EAAUoF,OAAOC,UAClDC,WAAU,SAAUC,GACrB,IAAIC,EAAKhC,EACT,IACI,IAAK,IAAIiC,EA1O7B,SAASC,EAASrE,GACd,IAAIE,EAAsB,mBAAXC,QAAyBH,EAAEG,OAAOC,UAAWG,EAAI,EAChE,OAAIL,EAAUA,EAAEM,KAAKR,GACd,CACHU,KAAM,WAEF,OADIV,GAAKO,GAAKP,EAAEiB,SAAQjB,OAAI,GACrB,CAAEa,MAAOb,GAAKA,EAAEO,KAAMI,MAAOX,KAoONqE,CAASH,GAAWI,EAAeF,EAAW1D,QAAS4D,EAAa3D,KAAM2D,EAAeF,EAAW1D,OAEtHiC,EAAMW,gBAAgBD,EADViB,EAAazD,OAIjC,MAAO0D,GAASJ,EAAM,CAAErD,MAAOyD,GAC/B,QACI,IACQD,IAAiBA,EAAa3D,OAASwB,EAAKiC,EAAWI,SAASrC,EAAG3B,KAAK4D,GAEhF,QAAU,GAAID,EAAK,MAAMA,EAAIrD,YAKtCkC,EA5D2B,CA6DpC7B,GAcEsD,EAA4B,IAAI7F,EAAK8F,eAAe,6BAKpDC,EAAmC,WACnC,SAASA,EAAkBC,EAAeC,GACtC7F,KAAK4F,cAAgBA,EACrB5F,KAAK6F,MAAQA,EAYjB,OAVAF,EAAkBG,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,0BAI1BP,EAAkBQ,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMnG,EAAKwG,kBACb,CAAEL,UAAMM,EAAWP,WAAY,CAAC,CAAEC,KAAMnG,EAAK0G,OAAQL,KAAM,CAACR,IAA+B,CAAEM,KAAMnG,EAAK2G,cAErGZ,EAf2B,GA0BlCa,EACA,SAASA,EAAyBC,GAC9BzG,KAAK0G,UAAYD,GAQrBE,EAAgC,WAEhC,SAASA,EAAeC,GACpB5G,KAAK4G,SAAWA,EAcpB,OAZAD,EAAeb,WAAa,CACxB,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,mBACVW,OAAQ,CACJ,gCAKpBF,EAAeR,eAAiB,WAAc,MAAO,CACjD,CAAEJ,KAAMnG,EAAKkH,eAEVH,EAjBwB;;;;;;;;;;;;;;;AA+BnC,SAASI,IACL,OAAOC,MAAM,yCAMjB,SAASC,IACL,OAAOD,MAAM,wEAMjB,SAASE,IACL,OAAOF,MAAM,yEAMjB,SAASG,IACL,OAAOH,MAAM,+CAMjB,SAASI,IACL,OAAOJ,MAAM,kEAOjB,IAAIK,EAAyB,WACzB,SAASA,EAAQC,EAAUC,GACvBvH,KAAKsH,SAAWA,EAChBtH,KAAKuH,mBAAqBA,EAE1BvH,KAAKwH,WAAa,IAAI9H,EAAK+H,QAE3BzH,KAAK0H,QAAU,IAAIC,IAOnB3H,KAAK4H,WAAa,IAAIlI,EAAKmI,gBAAgB,CAAEC,MAAO,EAAGC,IAAKC,OAAOC,YAkMvE,OAhMA7H,OAAO8H,eAAeb,EAAQxG,UAAW,aAAc,CAMnDsH,IAAK,WAAc,OAAOnI,KAAKoI,aAC/BC,IAAK,SAAUC,GACPtI,KAAKoI,cAAgBE,GACrBtI,KAAKuI,kBAAkBD,IAG/BE,YAAY,EACZC,cAAc,IAElBpB,EAAQxG,UAAU6H,SAAW,WAEzB,GADA1I,KAAK2I,YAAc3I,KAAKsH,SAASsB,KAAK,IAAI9H,OAAOd,KAAK6I,UACjD7I,KAAK8I,YACN,MAAM3B,KAGdE,EAAQxG,UAAUkI,YAAc,WAC5B/I,KAAKgJ,YAAYpD,cAAc1C,QAC/BlD,KAAK4H,WAAWqB,WAChBjJ,KAAKwH,WAAW9F,OAChB1B,KAAKwH,WAAWyB,WACZjJ,KAAKoI,aAAsD,mBAAhCpI,KAAKoI,YAAYc,YAC5ClJ,KAAKsI,WAAWY,WAAWlJ,MAE3BA,KAAKmJ,oBACLnJ,KAAKmJ,kBAAkBC,cACvBpJ,KAAKmJ,kBAAoB,OAGjC9B,EAAQxG,UAAUwI,sBAAwB,WACtC,IAAIC,EAAkBtJ,KAAKuJ,UAAUxE,QAAO,SAAUyE,GAAO,OAAQA,EAAIC,QACzE,GAAIH,EAAgBrH,OAAS,EACzB,MAAMgF,IAEVjH,KAAK0J,gBAAkBJ,EAAgB,GACnCtJ,KAAKsI,YAActI,KAAKuJ,YAAcvJ,KAAKmJ,mBAC3CnJ,KAAK2J,yBAUbtC,EAAQxG,UAAU0H,kBAAoB,SAAUD,GACxCtI,KAAKoI,aAAsD,mBAAhCpI,KAAKoI,YAAYc,YAC5ClJ,KAAKsI,WAAWY,WAAWlJ,MAE3BA,KAAKmJ,oBACLnJ,KAAKmJ,kBAAkBC,cACvBpJ,KAAKmJ,kBAAoB,MAGxBb,GACDtI,KAAKgJ,YAAYpD,cAAc1C,QAEnClD,KAAKoI,YAAcE,EACftI,KAAKuJ,WACLvJ,KAAK2J,yBAIbtC,EAAQxG,UAAU8I,sBAAwB,WACtC,IACIC,EADAjG,EAAQ3D,KAWZ,GATIP,EAAYoK,aAAa7J,KAAKoI,aAC9BwB,EAAa5J,KAAKoI,YAAY0B,QAAQ9J,MAEjCN,EAAKkF,aAAa5E,KAAKoI,aAC5BwB,EAAa5J,KAAKoI,YAEb7H,MAAMkE,QAAQzE,KAAKoI,eACxBwB,EAAalK,EAAKqK,GAAG/J,KAAKoI,eAE1BwB,EAKA,MAAM7C,IAJN/G,KAAKmJ,kBAAoBS,EAAW/E,KAAKlF,EAAUqK,UAAUhK,KAAKwH,aAC7DvC,WAAU,SAAUwB,GAAQ,OAAO9C,EAAMsG,kBAAkBxD,OAOxEY,EAAQxG,UAAUoJ,kBAAoB,SAAUxD,EAAMyD,EAAYtE,EAAeuE,GAC7E,IAAIxG,EAAQ3D,UACO,IAAfkK,IAAyBA,EAAalK,KAAK2I,kBACzB,IAAlB/C,IAA4BA,EAAgB5F,KAAKgJ,YAAYpD,eACjE,IAAIwE,EAAUF,EAAWG,KAAK5D,GACzB2D,IAGLA,EAAQE,kBAAiB,SAAUC,EAAMC,EAAuBC,GAC5D,GAA0B,MAAtBF,EAAKG,cACL/G,EAAMgH,WAAWlE,EAAKgE,GAAeA,EAAc7E,EAAeuE,QAEjE,GAAoB,MAAhBM,EACL7E,EAAcgF,OAAOJ,GACrB7G,EAAM+D,QAAQmD,OAAON,EAAKA,UAEzB,CACD,IAAIO,EAAOlF,EAAcuC,IAAIqC,GAC7B5E,EAAcmF,KAAKD,EAAML,OAGjCzK,KAAKuH,mBAAmByD,kBAQ5B3D,EAAQxG,UAAUoK,YAAc,SAAUxE,EAAMlF,GAC5C,GAA8B,IAA1BvB,KAAKuJ,UAAUtH,OACf,OAAOjC,KAAKuJ,UAAU2B,MAE1B,IAAIC,EAAUnL,KAAKuJ,UAAUX,MAAK,SAAUY,GAAO,OAAOA,EAAIC,MAAQD,EAAIC,KAAKlI,EAAGkF,OAAazG,KAAK0J,gBACpG,IAAKyB,EACD,MAAMjE,IAEV,OAAOiE,GAMX9D,EAAQxG,UAAU8J,WAAa,SAAUS,EAAUC,EAAOzF,EAAeuE,GACrE,IAAImB,EAAOtL,KAAKiL,YAAYG,EAAUC,GAElCE,EAAU,IAAI/E,EAAyB4E,GAIvCG,EAAQC,MADRxL,KAAK8I,YAAYrF,SACDzD,KAAK8I,YAAYrF,SAAS2H,QAEf,IAAfjB,GAA8BnK,KAAK0H,QAAQ+D,IAAItB,GAC3CnK,KAAK0H,QAAQS,IAAIgC,GAAc,EAG/B,EAEpBnK,KAAK0H,QAAQW,IAAI+C,EAAUG,EAAQC,QAEnB5F,GAAgC5F,KAAKgJ,YAAYpD,eACvD8F,mBAAmBJ,EAAK1E,SAAU2E,EAASF,GAIjDM,EAAYC,qBACZD,EAAYC,mBAAmBnF,KAAO2E,IAG9C/D,EAAQvB,WAAa,CACjB,CAAEC,KAAMnG,EAAKiM,UAAW5F,KAAM,CAAC,CACnBC,SAAU,WACV4F,SAAU,UACVlF,SAAU,kDACVmF,KAAM,CACFC,MAAS,WACTC,KAAQ,QAEZC,cAAetM,EAAKuM,kBAAkBC,KAKtCC,gBAAiBzM,EAAK0M,wBAAwBC,YAI9DlF,EAAQlB,eAAiB,WAAc,MAAO,CAC1C,CAAEJ,KAAMnG,EAAK4M,iBACb,CAAEzG,KAAMnG,EAAK6M,qBAEjBpF,EAAQqF,eAAiB,CACrBpE,WAAY,CAAC,CAAEvC,KAAMnG,EAAK+M,QAC1B7D,YAAa,CAAC,CAAE/C,KAAMnG,EAAK+M,QAC3B9D,QAAS,CAAC,CAAE9C,KAAMnG,EAAK+M,QACvB3D,YAAa,CAAC,CAAEjD,KAAMnG,EAAKgN,UAAW3G,KAAM,CAACN,EAAmB,CAAEkH,QAAQ,MAC1EtD,UAAW,CAAC,CAAExD,KAAMnG,EAAKkN,gBAAiB7G,KAAM,CAACU,EAAgB,CAGjDtC,aAAa,OAG1BgD,EAhNiB,GAqNxBsE,EAA6B,WAC7B,SAASA,EAAYoB,EAAaC,GAC9BhN,KAAK+M,YAAcA,EACnB/M,KAAKgN,MAAQA,EAEbhN,KAAKiN,WAAa,IAAIvN,EAAK+H,QAE3BzH,KAAKkN,aAAe,IAAIxN,EAAK+H,QAK7BzH,KAAKiM,KAAO,WACZN,EAAYC,mBAAqB5L,KA0FrC,OAxFAI,OAAO8H,eAAeyD,EAAY9K,UAAW,OAAQ,CAEjDsH,IAAK,WAAc,OAAOnI,KAAKmN,OAC/B9E,IAAK,SAAUxG,GACPA,IAAU7B,KAAKmN,QACfnN,KAAKmN,MAAQtL,EACb7B,KAAKoN,mBACLpN,KAAKkN,aAAaxL,SAG1B8G,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAeyD,EAAY9K,UAAW,aAAc,CACvDsH,IAAK,WACD,OAAOnI,KAAKgN,MAAMlE,YAAYlG,WAAW5C,KAAKmN,QAElD3E,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAeyD,EAAY9K,UAAW,QAAS,CAClDsH,IAAK,WACD,OAAOnI,KAAKgN,MAAMlE,YAAYrF,SAAWzD,KAAKgN,MAAMlE,YAAYrF,SAASzD,KAAKmN,OAAS,GAE3F3E,YAAY,EACZC,cAAc,IAElBkD,EAAY9K,UAAUkI,YAAc,WAG5B4C,EAAYC,qBAAuB5L,OACnC2L,EAAYC,mBAAqB,MAErC5L,KAAKkN,aAAajE,WAClBjJ,KAAKiN,WAAWvL,OAChB1B,KAAKiN,WAAWhE,YAGpB0C,EAAY9K,UAAUwM,MAAQ,WAC1BrN,KAAK+M,YAAYO,cAAcD,SAEnC1B,EAAY9K,UAAUuM,iBAAmB,WACrC,IAAIzJ,EAAQ3D,KACZ,GAAIA,KAAKgN,MAAMlE,YAAYpF,aACvB1D,KAAKiM,KAAOjM,KAAKgN,MAAMlE,YAAYpF,aAAa1D,KAAKmN,OAAS,QAAU,eAEvE,CACD,IAAKnN,KAAKgN,MAAMlE,YAAY7E,YACxB,MAAMmD,IAEV,IAAI5C,EAAgBxE,KAAKgN,MAAMlE,YAAY7E,YAAYjE,KAAKmN,OACxD5M,MAAMkE,QAAQD,GACdxE,KAAKuN,qBAAqB/I,GAErB9E,EAAKkF,aAAaJ,IACvBA,EAAcK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACvChI,WAAU,SAAUC,GAAY,OAAOvB,EAAM4J,qBAAqBrI,QAInFyG,EAAY9K,UAAU0M,qBAAuB,SAAUrI,GACnDlF,KAAKiM,KAAO/G,GAAYA,EAASjD,OAAS,QAAU,YAMxD0J,EAAYC,mBAAqB,KACjCD,EAAY7F,WAAa,CACrB,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,gBACV4F,SAAU,cACVC,KAAM,CACFyB,uBAAwB,aACxBC,oBAAqB,qCACrBC,cAAe,OACf1B,MAAS,qBAK7BL,EAAYxF,eAAiB,WAAc,MAAO,CAC9C,CAAEJ,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMsB,KAEZsE,EAAYe,eAAiB,CACzBT,KAAM,CAAC,CAAElG,KAAMnG,EAAK+M,SAEjBhB,EAvGqB,GAgH5BiC,EAAmC,SAAUpK,GAE7C,SAASoK,EAAkBb,EAAaC,EAAO1F,GAC3C,IAAI3D,EAAQH,EAAOhC,KAAKxB,KAAM+M,EAAaC,IAAUhN,KAIrD,OAHA2D,EAAMoJ,YAAcA,EACpBpJ,EAAMqJ,MAAQA,EACdrJ,EAAM2D,SAAWA,EACV3D,EAkFX,OAxFAjD,EAAUkN,EAAmBpK,GAQ7BoK,EAAkB/M,UAAUgN,mBAAqB,WAC7C,IAAIlK,EAAQ3D,KAEZ,GADAA,KAAK2I,YAAc3I,KAAKsH,SAASsB,KAAK,IAAI9H,OAAOd,KAAKgN,MAAMnE,UACvD7I,KAAKgN,MAAMlE,YAAY7E,YACxB,MAAMmD,IAEV,IAAI5C,EAAgBxE,KAAKgN,MAAMlE,YAAY7E,YAAYjE,KAAKyG,MACxDlG,MAAMkE,QAAQD,GACdxE,KAAK8N,oBAAoBtJ,GAEpB9E,EAAKkF,aAAaJ,IACvBA,EAAcK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACvChI,WAAU,SAAU8I,GAAU,OAAOpK,EAAMmK,oBAAoBC,MAExE/N,KAAKgO,WAAW5D,QAAQvF,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aACjDhI,WAAU,WAAc,OAAOtB,EAAMmK,0BAE9CF,EAAkB/M,UAAUkI,YAAc,WACtC/I,KAAKiO,SACLzK,EAAO3C,UAAUkI,YAAYvH,KAAKxB,OAGtC4N,EAAkB/M,UAAUiN,oBAAsB,SAAU5I,GACxD,IAAIgJ,EAASlO,KAAKmO,iBACdjJ,IACAlF,KAAKoO,UAAYlJ,GAEjBgJ,GAAUlO,KAAKoO,UAEfpO,KAAKgN,MAAM/C,kBAAkBjK,KAAKoO,UAAWpO,KAAK2I,YAD9BuF,EAAOtI,cACmD5F,KAAKmN,OAInFnN,KAAK2I,YAAY0B,KAAK,KAI9BuD,EAAkB/M,UAAUoN,OAAS,WACjC,IAAIC,EAASlO,KAAKmO,iBACdD,IACAA,EAAOtI,cAAc1C,QACrBlD,KAAK2I,YAAY0B,KAAK,MAI9BuD,EAAkB/M,UAAUsN,eAAiB,WACzC,IAAIxK,EAAQ3D,KACRqO,EAAUrO,KAAKgO,WAGnB,OAAOK,GAAWA,EAAQzF,MAAK,SAAUsF,GAAU,OAAQA,EAAOrI,OAASqI,EAAOrI,QAAUlC,MAEhGiK,EAAkB9H,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,uBACV4F,SAAU,oBACVC,KAAM,CACFyB,uBAAwB,aACxBE,cAAe,OACf1B,MAAS,sCAEbsC,UAAW,CACP,CAAEC,QAAS5C,EAAa6C,YAAaZ,GACrC,CAAEW,QAAS9I,EAA2B+I,YAAaZ,QAKvEA,EAAkBzH,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMsB,GACR,CAAEtB,KAAMnG,EAAK4M,mBAEjBoB,EAAkBlB,eAAiB,CAC/BsB,WAAY,CAAC,CAAEjI,KAAMnG,EAAKkN,gBAAiB7G,KAAM,CAACN,EAAmB,CAGrDtB,aAAa,OAG1BuJ,EAzF2B,CA0FpCjC,GAUE8C,EAAiB,gBAKjBC,EAAoC,WACpC,SAASA,EAAmBC,EAAW3B,EAKvC4B,EAAWC,EAAUC,GACjB,IAAInL,EAAQ3D,KACZA,KAAK2O,UAAYA,EACjB3O,KAAKgN,MAAQA,EACbhN,KAAK6O,SAAWA,EAChB7O,KAAK8O,KAAOA,EAEZ9O,KAAKiN,WAAa,IAAIvN,EAAK+H,QAE3BzH,KAAK+O,YAAc,KACnB/O,KAAKgP,QAAU,GACfhP,KAAKiP,cACDH,GACAA,EAAKI,OAAOrK,KAAKlF,EAAUqK,UAAUhK,KAAKiN,aAAahI,WAAU,WAAc,OAAOtB,EAAMsL,aAAY,MAK5GN,EAAUzB,aAAajI,WAAU,WAAc,OAAOtB,EAAMsL,iBA6EhE,OA3EA7O,OAAO8H,eAAewG,EAAmB7N,UAAW,QAAS,CAEzDsH,IAAK,WAAc,OAAOnI,KAAKmP,QAC/B9G,IAAK,SAAUxG,GAIX7B,KAAKmP,OAASrP,EAASsP,qBAAqBvN,EAAO,MACnD7B,KAAKiP,eAETzG,YAAY,EACZC,cAAc,IAElBrI,OAAO8H,eAAewG,EAAmB7N,UAAW,SAAU,CAK1DsH,IAAK,WAAc,OAAOnI,KAAKgP,SAC/B3G,IAAK,SAAUgH,GACX,IAAIxN,EAAQwN,EACRC,EAAQ,KACZ,GAAsB,iBAAXD,EAAqB,CAC5B,IAAIE,EAAQF,EAAOG,MAAMf,GACzB5M,EAAQ0N,EAAM,GACdD,EAAQC,EAAM,IAAMD,EAExBtP,KAAK+O,YAAcO,EACnBtP,KAAKgP,QAAUlP,EAASsP,qBAAqBvN,GAC7C7B,KAAKiP,eAETzG,YAAY,EACZC,cAAc,IAElBiG,EAAmB7N,UAAUkI,YAAc,WACvC/I,KAAKiN,WAAWvL,OAChB1B,KAAKiN,WAAWhE,YAGpByF,EAAmB7N,UAAU4O,eAAiB,WAC1C,IAAIC,EAAa1P,KAAK2O,UAAUlI,MAAQzG,KAAKgN,MAAMlE,YAAYrF,SACzDzD,KAAKgN,MAAMlE,YAAYrF,SAASzD,KAAK2O,UAAUlI,MAC/C,KACF+E,EAAuB,MAAfxL,KAAKmP,OAAiBO,EAAY1P,KAAKmP,OACnD,MAAwB,iBAAV3D,EAAqB,GAAKA,EAAQxL,KAAKgP,QAAUhP,KAAK+O,YAAc,MAEtFL,EAAmB7N,UAAUoO,YAAc,SAAUU,QAC7B,IAAhBA,IAA0BA,GAAc,GAC5C,IAAIC,EAAU5P,KAAKyP,iBACnB,GAAIG,IAAY5P,KAAK6P,iBAAmBF,EAAa,CACjD,IAAIG,EAAU9P,KAAK6O,SAASvB,cACxByC,EAAc/P,KAAK8O,MAA4B,QAApB9O,KAAK8O,KAAKjN,MAAkB,eAAiB,cACxEmO,EAA4B,gBAAhBD,EAAgC,eAAiB,cACjED,EAAQG,MAAMF,GAAeH,GAAW,GACxCE,EAAQG,MAAMD,GAAa,GAC3BhQ,KAAK6P,gBAAkBD,IAG/BlB,EAAmB5I,WAAa,CAC5B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CACnBC,SAAU,2BAI1BwI,EAAmBvI,eAAiB,WAAc,MAAO,CACrD,CAAEJ,KAAM4F,GACR,CAAE5F,KAAMsB,GACR,CAAEtB,KAAMnG,EAAKsQ,WACb,CAAEnK,KAAMnG,EAAK+N,YACb,CAAE5H,KAAMlG,EAAKsQ,eAAgBrK,WAAY,CAAC,CAAEC,KAAMnG,EAAK2G,cAE3DmI,EAAmBhC,eAAiB,CAChClB,MAAO,CAAC,CAAEzF,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,wBACnCoJ,OAAQ,CAAC,CAAEtJ,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,+BAEjCyI,EArG4B,GAkHnC0B,EAAmC,WACnC,SAASA,EAAkBpD,EAAO2B,GAC9B3O,KAAKgN,MAAQA,EACbhN,KAAK2O,UAAYA,EACjB3O,KAAKqQ,YAAa,EAgCtB,OA9BAjQ,OAAO8H,eAAekI,EAAkBvP,UAAW,YAAa,CAE5DsH,IAAK,WAAc,OAAOnI,KAAKqQ,YAC/BhI,IAAK,SAAUxG,GAAS7B,KAAKqQ,WAAavQ,EAASwQ,sBAAsBzO,IACzE2G,YAAY,EACZC,cAAc,IAOlB2H,EAAkBvP,UAAU0P,QAAU,SAAUC,GAC5CxQ,KAAKyQ,UACCzQ,KAAKgN,MAAMlE,YAAYhG,kBAAkB9C,KAAK2O,UAAUlI,MACxDzG,KAAKgN,MAAMlE,YAAYxG,OAAOtC,KAAK2O,UAAUlI,MACnD+J,EAAME,mBAEVN,EAAkBtK,WAAa,CAC3B,CAAEC,KAAMnG,EAAKoG,UAAWC,KAAM,CAAC,CAAEC,SAAU,0BAG/CkK,EAAkBjK,eAAiB,WAAc,MAAO,CACpD,CAAEJ,KAAMsB,GACR,CAAEtB,KAAM4F,KAEZyE,EAAkB1D,eAAiB,CAC/B+D,UAAW,CAAC,CAAE1K,KAAMnG,EAAK+M,MAAO1G,KAAM,CAAC,gCACvCsK,QAAS,CAAC,CAAExK,KAAMnG,EAAK+Q,aAAc1K,KAAM,CAAC,QAAS,CAAC,cAEnDmK,EApC2B,GA8ClCQ,EAAwB,CACxBhD,EACAjH,EACA+H,EACA0B,EACA/I,EACAsE,EACAhG,GAEAkL,EAA+B,WAC/B,SAASA,KAST,OAPAA,EAAc/K,WAAa,CACvB,CAAEC,KAAMnG,EAAKkR,SAAU7K,KAAM,CAAC,CAClBjH,QAAS4R,EACTG,aAAcH,EACdtC,UAAW,CAACvO,EAAKiR,aAAcrK,OAGxCkK,EAVuB;;;;;;;;AAyBlC7R,EAAQmD,gBAAkBA,EAC1BnD,EAAQyG,0BAA4BA,EACpCzG,EAAQ4O,kBAAoBA,EAC5B5O,EAAQqI,QAAUA,EAClBrI,EAAQ6R,cAAgBA,EACxB7R,EAAQ2M,YAAcA,EACtB3M,EAAQ2H,eAAiBA,EACzB3H,EAAQ2G,kBAAoBA,EAC5B3G,EAAQwH,yBAA2BA,EACnCxH,EAAQ0P,mBAAqBA,EAC7B1P,EAAQoR,kBAAoBA,EAC5BpR,EAAQuE,gBAAkBA,EAC1BvE,EAAQgF,kBAAoBA,EAC5BhF,EAAQoI,oCAAsCA,EAC9CpI,EAAQmI,2BAA6BA,EACrCnI,EAAQkI,mCAAqCA,EAC7ClI,EAAQiI,oCAAsCA,EAC9CjI,EAAQ+H,8BAAgCA,EAExC3G,OAAO8H,eAAelJ,EAAS,aAAc,CAAE6C,OAAO","sourcesContent":["(function (global, factory) {\n    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@angular/cdk/collections'), require('rxjs'), require('rxjs/operators'), require('@angular/core'), require('@angular/cdk/bidi'), require('@angular/cdk/coercion'), require('@angular/cdk/a11y')) :\n    typeof define === 'function' && define.amd ? define('@angular/cdk/tree', ['exports', '@angular/cdk/collections', 'rxjs', 'rxjs/operators', '@angular/core', '@angular/cdk/bidi', '@angular/cdk/coercion', '@angular/cdk/a11y'], factory) :\n    (global = global || self, factory((global.ng = global.ng || {}, global.ng.cdk = global.ng.cdk || {}, global.ng.cdk.tree = {}), global.ng.cdk.collections, global.rxjs, global.rxjs.operators, global.ng.core, global.ng.cdk.bidi, global.ng.cdk.coercion, global.ng.cdk.a11y));\n}(this, (function (exports, collections, rxjs, operators, core, bidi, coercion, a11y) { 'use strict';\n\n    /*! *****************************************************************************\r\n    Copyright (c) Microsoft Corporation. All rights reserved.\r\n    Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\n    this file except in compliance with the License. You may obtain a copy of the\r\n    License at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\n    THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n    KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\n    WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\n    MERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\n    See the Apache Version 2.0 License for specific language governing permissions\r\n    and limitations under the License.\r\n    ***************************************************************************** */\r\n    /* global Reflect, Promise */\r\n\r\n    var extendStatics = function(d, b) {\r\n        extendStatics = Object.setPrototypeOf ||\r\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n        return extendStatics(d, b);\r\n    };\r\n\r\n    function __extends(d, b) {\r\n        extendStatics(d, b);\r\n        function __() { this.constructor = d; }\r\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n    }\r\n\r\n    var __assign = function() {\r\n        __assign = Object.assign || function __assign(t) {\r\n            for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n                s = arguments[i];\r\n                for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n            }\r\n            return t;\r\n        };\r\n        return __assign.apply(this, arguments);\r\n    };\r\n\r\n    function __rest(s, e) {\r\n        var t = {};\r\n        for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n            t[p] = s[p];\r\n        if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n            for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n                if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                    t[p[i]] = s[p[i]];\r\n            }\r\n        return t;\r\n    }\r\n\r\n    function __decorate(decorators, target, key, desc) {\r\n        var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n        if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n        else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n        return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n    }\r\n\r\n    function __param(paramIndex, decorator) {\r\n        return function (target, key) { decorator(target, key, paramIndex); }\r\n    }\r\n\r\n    function __metadata(metadataKey, metadataValue) {\r\n        if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n    }\r\n\r\n    function __awaiter(thisArg, _arguments, P, generator) {\r\n        return new (P || (P = Promise))(function (resolve, reject) {\r\n            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n            function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n            function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n            step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n        });\r\n    }\r\n\r\n    function __generator(thisArg, body) {\r\n        var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n        return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n        function verb(n) { return function (v) { return step([n, v]); }; }\r\n        function step(op) {\r\n            if (f) throw new TypeError(\"Generator is already executing.\");\r\n            while (_) try {\r\n                if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n                if (y = 0, t) op = [op[0] & 2, t.value];\r\n                switch (op[0]) {\r\n                    case 0: case 1: t = op; break;\r\n                    case 4: _.label++; return { value: op[1], done: false };\r\n                    case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                    case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                    default:\r\n                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                        if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                        if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                        if (t[2]) _.ops.pop();\r\n                        _.trys.pop(); continue;\r\n                }\r\n                op = body.call(thisArg, _);\r\n            } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n            if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n        }\r\n    }\r\n\r\n    function __exportStar(m, exports) {\r\n        for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n    }\r\n\r\n    function __values(o) {\r\n        var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n        if (m) return m.call(o);\r\n        return {\r\n            next: function () {\r\n                if (o && i >= o.length) o = void 0;\r\n                return { value: o && o[i++], done: !o };\r\n            }\r\n        };\r\n    }\r\n\r\n    function __read(o, n) {\r\n        var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n        if (!m) return o;\r\n        var i = m.call(o), r, ar = [], e;\r\n        try {\r\n            while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n        }\r\n        catch (error) { e = { error: error }; }\r\n        finally {\r\n            try {\r\n                if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n            }\r\n            finally { if (e) throw e.error; }\r\n        }\r\n        return ar;\r\n    }\r\n\r\n    function __spread() {\r\n        for (var ar = [], i = 0; i < arguments.length; i++)\r\n            ar = ar.concat(__read(arguments[i]));\r\n        return ar;\r\n    }\r\n\r\n    function __spreadArrays() {\r\n        for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n        for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n            for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n                r[k] = a[j];\r\n        return r;\r\n    };\r\n\r\n    function __await(v) {\r\n        return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n    }\r\n\r\n    function __asyncGenerator(thisArg, _arguments, generator) {\r\n        if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n        var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n        return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n        function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n        function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n        function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n        function fulfill(value) { resume(\"next\", value); }\r\n        function reject(value) { resume(\"throw\", value); }\r\n        function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n    }\r\n\r\n    function __asyncDelegator(o) {\r\n        var i, p;\r\n        return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n        function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n    }\r\n\r\n    function __asyncValues(o) {\r\n        if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n        var m = o[Symbol.asyncIterator], i;\r\n        return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n        function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n        function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n    }\r\n\r\n    function __makeTemplateObject(cooked, raw) {\r\n        if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n        return cooked;\r\n    };\r\n\r\n    function __importStar(mod) {\r\n        if (mod && mod.__esModule) return mod;\r\n        var result = {};\r\n        if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n        result.default = mod;\r\n        return result;\r\n    }\r\n\r\n    function __importDefault(mod) {\r\n        return (mod && mod.__esModule) ? mod : { default: mod };\r\n    }\n\n    /** Base tree control. It has basic toggle/expand/collapse operations on a single data node. */\n    var BaseTreeControl = /** @class */ (function () {\n        function BaseTreeControl() {\n            /** A selection model with multi-selection to track expansion status. */\n            this.expansionModel = new collections.SelectionModel(true);\n        }\n        /** Toggles one single data node's expanded/collapsed state. */\n        BaseTreeControl.prototype.toggle = function (dataNode) {\n            this.expansionModel.toggle(dataNode);\n        };\n        /** Expands one single data node. */\n        BaseTreeControl.prototype.expand = function (dataNode) {\n            this.expansionModel.select(dataNode);\n        };\n        /** Collapses one single data node. */\n        BaseTreeControl.prototype.collapse = function (dataNode) {\n            this.expansionModel.deselect(dataNode);\n        };\n        /** Whether a given data node is expanded or not. Returns true if the data node is expanded. */\n        BaseTreeControl.prototype.isExpanded = function (dataNode) {\n            return this.expansionModel.isSelected(dataNode);\n        };\n        /** Toggles a subtree rooted at `node` recursively. */\n        BaseTreeControl.prototype.toggleDescendants = function (dataNode) {\n            this.expansionModel.isSelected(dataNode)\n                ? this.collapseDescendants(dataNode)\n                : this.expandDescendants(dataNode);\n        };\n        /** Collapse all dataNodes in the tree. */\n        BaseTreeControl.prototype.collapseAll = function () {\n            this.expansionModel.clear();\n        };\n        /** Expands a subtree rooted at given data node recursively. */\n        BaseTreeControl.prototype.expandDescendants = function (dataNode) {\n            var _a;\n            var toBeProcessed = [dataNode];\n            toBeProcessed.push.apply(toBeProcessed, __spread(this.getDescendants(dataNode)));\n            (_a = this.expansionModel).select.apply(_a, __spread(toBeProcessed));\n        };\n        /** Collapses a subtree rooted at given data node recursively. */\n        BaseTreeControl.prototype.collapseDescendants = function (dataNode) {\n            var _a;\n            var toBeProcessed = [dataNode];\n            toBeProcessed.push.apply(toBeProcessed, __spread(this.getDescendants(dataNode)));\n            (_a = this.expansionModel).deselect.apply(_a, __spread(toBeProcessed));\n        };\n        return BaseTreeControl;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Flat tree control. Able to expand/collapse a subtree recursively for flattened tree. */\n    var FlatTreeControl = /** @class */ (function (_super) {\n        __extends(FlatTreeControl, _super);\n        /** Construct with flat tree data node functions getLevel and isExpandable. */\n        function FlatTreeControl(getLevel, isExpandable) {\n            var _this = _super.call(this) || this;\n            _this.getLevel = getLevel;\n            _this.isExpandable = isExpandable;\n            return _this;\n        }\n        /**\n         * Gets a list of the data node's subtree of descendent data nodes.\n         *\n         * To make this working, the `dataNodes` of the TreeControl must be flattened tree nodes\n         * with correct levels.\n         */\n        FlatTreeControl.prototype.getDescendants = function (dataNode) {\n            var startIndex = this.dataNodes.indexOf(dataNode);\n            var results = [];\n            // Goes through flattened tree nodes in the `dataNodes` array, and get all descendants.\n            // The level of descendants of a tree node must be greater than the level of the given\n            // tree node.\n            // If we reach a node whose level is equal to the level of the tree node, we hit a sibling.\n            // If we reach a node whose level is greater than the level of the tree node, we hit a\n            // sibling of an ancestor.\n            for (var i = startIndex + 1; i < this.dataNodes.length && this.getLevel(dataNode) < this.getLevel(this.dataNodes[i]); i++) {\n                results.push(this.dataNodes[i]);\n            }\n            return results;\n        };\n        /**\n         * Expands all data nodes in the tree.\n         *\n         * To make this working, the `dataNodes` variable of the TreeControl must be set to all flattened\n         * data nodes of the tree.\n         */\n        FlatTreeControl.prototype.expandAll = function () {\n            var _a;\n            (_a = this.expansionModel).select.apply(_a, __spread(this.dataNodes));\n        };\n        return FlatTreeControl;\n    }(BaseTreeControl));\n\n    /** Nested tree control. Able to expand/collapse a subtree recursively for NestedNode type. */\n    var NestedTreeControl = /** @class */ (function (_super) {\n        __extends(NestedTreeControl, _super);\n        /** Construct with nested tree function getChildren. */\n        function NestedTreeControl(getChildren) {\n            var _this = _super.call(this) || this;\n            _this.getChildren = getChildren;\n            return _this;\n        }\n        /**\n         * Expands all dataNodes in the tree.\n         *\n         * To make this working, the `dataNodes` variable of the TreeControl must be set to all root level\n         * data nodes of the tree.\n         */\n        NestedTreeControl.prototype.expandAll = function () {\n            var _a;\n            var _this = this;\n            this.expansionModel.clear();\n            var allNodes = this.dataNodes.reduce(function (accumulator, dataNode) {\n                return __spread(accumulator, _this.getDescendants(dataNode), [dataNode]);\n            }, []);\n            (_a = this.expansionModel).select.apply(_a, __spread(allNodes));\n        };\n        /** Gets a list of descendant dataNodes of a subtree rooted at given data node recursively. */\n        NestedTreeControl.prototype.getDescendants = function (dataNode) {\n            var descendants = [];\n            this._getDescendants(descendants, dataNode);\n            // Remove the node itself\n            return descendants.splice(1);\n        };\n        /** A helper function to get descendants recursively. */\n        NestedTreeControl.prototype._getDescendants = function (descendants, dataNode) {\n            var _this = this;\n            descendants.push(dataNode);\n            var childrenNodes = this.getChildren(dataNode);\n            if (Array.isArray(childrenNodes)) {\n                childrenNodes.forEach(function (child) { return _this._getDescendants(descendants, child); });\n            }\n            else if (rxjs.isObservable(childrenNodes)) {\n                // TypeScript as of version 3.5 doesn't seem to treat `Boolean` like a function that\n                // returns a `boolean` specifically in the context of `filter`, so we manually clarify that.\n                childrenNodes.pipe(operators.take(1), operators.filter(Boolean))\n                    .subscribe(function (children) {\n                    var e_1, _a;\n                    try {\n                        for (var children_1 = __values(children), children_1_1 = children_1.next(); !children_1_1.done; children_1_1 = children_1.next()) {\n                            var child = children_1_1.value;\n                            _this._getDescendants(descendants, child);\n                        }\n                    }\n                    catch (e_1_1) { e_1 = { error: e_1_1 }; }\n                    finally {\n                        try {\n                            if (children_1_1 && !children_1_1.done && (_a = children_1.return)) _a.call(children_1);\n                        }\n                        finally { if (e_1) throw e_1.error; }\n                    }\n                });\n            }\n        };\n        return NestedTreeControl;\n    }(BaseTreeControl));\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Injection token used to provide a `CdkTreeNode` to its outlet.\n     * Used primarily to avoid circular imports.\n     * @docs-private\n     */\n    var CDK_TREE_NODE_OUTLET_NODE = new core.InjectionToken('CDK_TREE_NODE_OUTLET_NODE');\n    /**\n     * Outlet for nested CdkNode. Put `[cdkTreeNodeOutlet]` on a tag to place children dataNodes\n     * inside the outlet.\n     */\n    var CdkTreeNodeOutlet = /** @class */ (function () {\n        function CdkTreeNodeOutlet(viewContainer, _node) {\n            this.viewContainer = viewContainer;\n            this._node = _node;\n        }\n        CdkTreeNodeOutlet.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodeOutlet]'\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeOutlet.ctorParameters = function () { return [\n            { type: core.ViewContainerRef },\n            { type: undefined, decorators: [{ type: core.Inject, args: [CDK_TREE_NODE_OUTLET_NODE,] }, { type: core.Optional }] }\n        ]; };\n        return CdkTreeNodeOutlet;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Context provided to the tree node component. */\n    var CdkTreeNodeOutletContext = /** @class */ (function () {\n        function CdkTreeNodeOutletContext(data) {\n            this.$implicit = data;\n        }\n        return CdkTreeNodeOutletContext;\n    }());\n    /**\n     * Data node definition for the CdkTree.\n     * Captures the node's template and a when predicate that describes when this node should be used.\n     */\n    var CdkTreeNodeDef = /** @class */ (function () {\n        /** @docs-private */\n        function CdkTreeNodeDef(template) {\n            this.template = template;\n        }\n        CdkTreeNodeDef.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodeDef]',\n                        inputs: [\n                            'when: cdkTreeNodeDefWhen'\n                        ],\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeDef.ctorParameters = function () { return [\n            { type: core.TemplateRef }\n        ]; };\n        return CdkTreeNodeDef;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Returns an error to be thrown when there is no usable data.\n     * @docs-private\n     */\n    function getTreeNoValidDataSourceError() {\n        return Error(\"A valid data source must be provided.\");\n    }\n    /**\n     * Returns an error to be thrown when there are multiple nodes that are missing a when function.\n     * @docs-private\n     */\n    function getTreeMultipleDefaultNodeDefsError() {\n        return Error(\"There can only be one default row without a when predicate function.\");\n    }\n    /**\n     * Returns an error to be thrown when there are no matching node defs for a particular set of data.\n     * @docs-private\n     */\n    function getTreeMissingMatchingNodeDefError() {\n        return Error(\"Could not find a matching node definition for the provided node data.\");\n    }\n    /**\n     * Returns an error to be thrown when there are tree control.\n     * @docs-private\n     */\n    function getTreeControlMissingError() {\n        return Error(\"Could not find a tree control for the tree.\");\n    }\n    /**\n     * Returns an error to be thrown when tree control did not implement functions for flat/nested node.\n     * @docs-private\n     */\n    function getTreeControlFunctionsMissingError() {\n        return Error(\"Could not find functions for nested/flat tree in tree control.\");\n    }\n\n    /**\n     * CDK tree component that connects with a data source to retrieve data of type `T` and renders\n     * dataNodes with hierarchy. Updates the dataNodes when new data is provided by the data source.\n     */\n    var CdkTree = /** @class */ (function () {\n        function CdkTree(_differs, _changeDetectorRef) {\n            this._differs = _differs;\n            this._changeDetectorRef = _changeDetectorRef;\n            /** Subject that emits when the component has been destroyed. */\n            this._onDestroy = new rxjs.Subject();\n            /** Level of nodes */\n            this._levels = new Map();\n            // TODO(tinayuangao): Setup a listener for scrolling, emit the calculated view to viewChange.\n            //     Remove the MAX_VALUE in viewChange\n            /**\n             * Stream containing the latest information on what rows are being displayed on screen.\n             * Can be used by the data source to as a heuristic of what data should be provided.\n             */\n            this.viewChange = new rxjs.BehaviorSubject({ start: 0, end: Number.MAX_VALUE });\n        }\n        Object.defineProperty(CdkTree.prototype, \"dataSource\", {\n            /**\n             * Provides a stream containing the latest data array to render. Influenced by the tree's\n             * stream of view window (what dataNodes are currently on screen).\n             * Data source can be an observable of data array, or a data array to render.\n             */\n            get: function () { return this._dataSource; },\n            set: function (dataSource) {\n                if (this._dataSource !== dataSource) {\n                    this._switchDataSource(dataSource);\n                }\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTree.prototype.ngOnInit = function () {\n            this._dataDiffer = this._differs.find([]).create(this.trackBy);\n            if (!this.treeControl) {\n                throw getTreeControlMissingError();\n            }\n        };\n        CdkTree.prototype.ngOnDestroy = function () {\n            this._nodeOutlet.viewContainer.clear();\n            this.viewChange.complete();\n            this._onDestroy.next();\n            this._onDestroy.complete();\n            if (this._dataSource && typeof this._dataSource.disconnect === 'function') {\n                this.dataSource.disconnect(this);\n            }\n            if (this._dataSubscription) {\n                this._dataSubscription.unsubscribe();\n                this._dataSubscription = null;\n            }\n        };\n        CdkTree.prototype.ngAfterContentChecked = function () {\n            var defaultNodeDefs = this._nodeDefs.filter(function (def) { return !def.when; });\n            if (defaultNodeDefs.length > 1) {\n                throw getTreeMultipleDefaultNodeDefsError();\n            }\n            this._defaultNodeDef = defaultNodeDefs[0];\n            if (this.dataSource && this._nodeDefs && !this._dataSubscription) {\n                this._observeRenderChanges();\n            }\n        };\n        // TODO(tinayuangao): Work on keyboard traversal and actions, make sure it's working for RTL\n        //     and nested trees.\n        /**\n         * Switch to the provided data source by resetting the data and unsubscribing from the current\n         * render change subscription if one exists. If the data source is null, interpret this by\n         * clearing the node outlet. Otherwise start listening for new data.\n         */\n        CdkTree.prototype._switchDataSource = function (dataSource) {\n            if (this._dataSource && typeof this._dataSource.disconnect === 'function') {\n                this.dataSource.disconnect(this);\n            }\n            if (this._dataSubscription) {\n                this._dataSubscription.unsubscribe();\n                this._dataSubscription = null;\n            }\n            // Remove the all dataNodes if there is now no data source\n            if (!dataSource) {\n                this._nodeOutlet.viewContainer.clear();\n            }\n            this._dataSource = dataSource;\n            if (this._nodeDefs) {\n                this._observeRenderChanges();\n            }\n        };\n        /** Set up a subscription for the data provided by the data source. */\n        CdkTree.prototype._observeRenderChanges = function () {\n            var _this = this;\n            var dataStream;\n            if (collections.isDataSource(this._dataSource)) {\n                dataStream = this._dataSource.connect(this);\n            }\n            else if (rxjs.isObservable(this._dataSource)) {\n                dataStream = this._dataSource;\n            }\n            else if (Array.isArray(this._dataSource)) {\n                dataStream = rxjs.of(this._dataSource);\n            }\n            if (dataStream) {\n                this._dataSubscription = dataStream.pipe(operators.takeUntil(this._onDestroy))\n                    .subscribe(function (data) { return _this.renderNodeChanges(data); });\n            }\n            else {\n                throw getTreeNoValidDataSourceError();\n            }\n        };\n        /** Check for changes made in the data and render each change (node added/removed/moved). */\n        CdkTree.prototype.renderNodeChanges = function (data, dataDiffer, viewContainer, parentData) {\n            var _this = this;\n            if (dataDiffer === void 0) { dataDiffer = this._dataDiffer; }\n            if (viewContainer === void 0) { viewContainer = this._nodeOutlet.viewContainer; }\n            var changes = dataDiffer.diff(data);\n            if (!changes) {\n                return;\n            }\n            changes.forEachOperation(function (item, adjustedPreviousIndex, currentIndex) {\n                if (item.previousIndex == null) {\n                    _this.insertNode(data[currentIndex], currentIndex, viewContainer, parentData);\n                }\n                else if (currentIndex == null) {\n                    viewContainer.remove(adjustedPreviousIndex);\n                    _this._levels.delete(item.item);\n                }\n                else {\n                    var view = viewContainer.get(adjustedPreviousIndex);\n                    viewContainer.move(view, currentIndex);\n                }\n            });\n            this._changeDetectorRef.detectChanges();\n        };\n        /**\n         * Finds the matching node definition that should be used for this node data. If there is only\n         * one node definition, it is returned. Otherwise, find the node definition that has a when\n         * predicate that returns true with the data. If none return true, return the default node\n         * definition.\n         */\n        CdkTree.prototype._getNodeDef = function (data, i) {\n            if (this._nodeDefs.length === 1) {\n                return this._nodeDefs.first;\n            }\n            var nodeDef = this._nodeDefs.find(function (def) { return def.when && def.when(i, data); }) || this._defaultNodeDef;\n            if (!nodeDef) {\n                throw getTreeMissingMatchingNodeDefError();\n            }\n            return nodeDef;\n        };\n        /**\n         * Create the embedded view for the data node template and place it in the correct index location\n         * within the data node view container.\n         */\n        CdkTree.prototype.insertNode = function (nodeData, index, viewContainer, parentData) {\n            var node = this._getNodeDef(nodeData, index);\n            // Node context that will be provided to created embedded view\n            var context = new CdkTreeNodeOutletContext(nodeData);\n            // If the tree is flat tree, then use the `getLevel` function in flat tree control\n            // Otherwise, use the level of parent node.\n            if (this.treeControl.getLevel) {\n                context.level = this.treeControl.getLevel(nodeData);\n            }\n            else if (typeof parentData !== 'undefined' && this._levels.has(parentData)) {\n                context.level = this._levels.get(parentData) + 1;\n            }\n            else {\n                context.level = 0;\n            }\n            this._levels.set(nodeData, context.level);\n            // Use default tree nodeOutlet, or nested node's nodeOutlet\n            var container = viewContainer ? viewContainer : this._nodeOutlet.viewContainer;\n            container.createEmbeddedView(node.template, context, index);\n            // Set the data to just created `CdkTreeNode`.\n            // The `CdkTreeNode` created from `createEmbeddedView` will be saved in static variable\n            //     `mostRecentTreeNode`. We get it from static variable and pass the node data to it.\n            if (CdkTreeNode.mostRecentTreeNode) {\n                CdkTreeNode.mostRecentTreeNode.data = nodeData;\n            }\n        };\n        CdkTree.decorators = [\n            { type: core.Component, args: [{\n                        selector: 'cdk-tree',\n                        exportAs: 'cdkTree',\n                        template: \"<ng-container cdkTreeNodeOutlet></ng-container>\",\n                        host: {\n                            'class': 'cdk-tree',\n                            'role': 'tree',\n                        },\n                        encapsulation: core.ViewEncapsulation.None,\n                        // The \"OnPush\" status for the `CdkTree` component is effectively a noop, so we are removing it.\n                        // The view for `CdkTree` consists entirely of templates declared in other views. As they are\n                        // declared elsewhere, they are checked when their declaration points are checked.\n                        // tslint:disable-next-line:validate-decorators\n                        changeDetection: core.ChangeDetectionStrategy.Default\n                    }] }\n        ];\n        /** @nocollapse */\n        CdkTree.ctorParameters = function () { return [\n            { type: core.IterableDiffers },\n            { type: core.ChangeDetectorRef }\n        ]; };\n        CdkTree.propDecorators = {\n            dataSource: [{ type: core.Input }],\n            treeControl: [{ type: core.Input }],\n            trackBy: [{ type: core.Input }],\n            _nodeOutlet: [{ type: core.ViewChild, args: [CdkTreeNodeOutlet, { static: true },] }],\n            _nodeDefs: [{ type: core.ContentChildren, args: [CdkTreeNodeDef, {\n                            // We need to use `descendants: true`, because Ivy will no longer match\n                            // indirect descendants if it's left as false.\n                            descendants: true\n                        },] }]\n        };\n        return CdkTree;\n    }());\n    /**\n     * Tree node for CdkTree. It contains the data in the tree node.\n     */\n    var CdkTreeNode = /** @class */ (function () {\n        function CdkTreeNode(_elementRef, _tree) {\n            this._elementRef = _elementRef;\n            this._tree = _tree;\n            /** Subject that emits when the component has been destroyed. */\n            this._destroyed = new rxjs.Subject();\n            /** Emits when the node's data has changed. */\n            this._dataChanges = new rxjs.Subject();\n            /**\n             * The role of the node should be 'group' if it's an internal node,\n             * and 'treeitem' if it's a leaf node.\n             */\n            this.role = 'treeitem';\n            CdkTreeNode.mostRecentTreeNode = this;\n        }\n        Object.defineProperty(CdkTreeNode.prototype, \"data\", {\n            /** The tree node's data. */\n            get: function () { return this._data; },\n            set: function (value) {\n                if (value !== this._data) {\n                    this._data = value;\n                    this._setRoleFromData();\n                    this._dataChanges.next();\n                }\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNode.prototype, \"isExpanded\", {\n            get: function () {\n                return this._tree.treeControl.isExpanded(this._data);\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNode.prototype, \"level\", {\n            get: function () {\n                return this._tree.treeControl.getLevel ? this._tree.treeControl.getLevel(this._data) : 0;\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTreeNode.prototype.ngOnDestroy = function () {\n            // If this is the last tree node being destroyed,\n            // clear out the reference to avoid leaking memory.\n            if (CdkTreeNode.mostRecentTreeNode === this) {\n                CdkTreeNode.mostRecentTreeNode = null;\n            }\n            this._dataChanges.complete();\n            this._destroyed.next();\n            this._destroyed.complete();\n        };\n        /** Focuses the menu item. Implements for FocusableOption. */\n        CdkTreeNode.prototype.focus = function () {\n            this._elementRef.nativeElement.focus();\n        };\n        CdkTreeNode.prototype._setRoleFromData = function () {\n            var _this = this;\n            if (this._tree.treeControl.isExpandable) {\n                this.role = this._tree.treeControl.isExpandable(this._data) ? 'group' : 'treeitem';\n            }\n            else {\n                if (!this._tree.treeControl.getChildren) {\n                    throw getTreeControlFunctionsMissingError();\n                }\n                var childrenNodes = this._tree.treeControl.getChildren(this._data);\n                if (Array.isArray(childrenNodes)) {\n                    this._setRoleFromChildren(childrenNodes);\n                }\n                else if (rxjs.isObservable(childrenNodes)) {\n                    childrenNodes.pipe(operators.takeUntil(this._destroyed))\n                        .subscribe(function (children) { return _this._setRoleFromChildren(children); });\n                }\n            }\n        };\n        CdkTreeNode.prototype._setRoleFromChildren = function (children) {\n            this.role = children && children.length ? 'group' : 'treeitem';\n        };\n        /**\n         * The most recently created `CdkTreeNode`. We save it in static variable so we can retrieve it\n         * in `CdkTree` and set the data to it.\n         */\n        CdkTreeNode.mostRecentTreeNode = null;\n        CdkTreeNode.decorators = [\n            { type: core.Directive, args: [{\n                        selector: 'cdk-tree-node',\n                        exportAs: 'cdkTreeNode',\n                        host: {\n                            '[attr.aria-expanded]': 'isExpanded',\n                            '[attr.aria-level]': 'role === \"treeitem\" ? level : null',\n                            '[attr.role]': 'role',\n                            'class': 'cdk-tree-node',\n                        },\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNode.ctorParameters = function () { return [\n            { type: core.ElementRef },\n            { type: CdkTree }\n        ]; };\n        CdkTreeNode.propDecorators = {\n            role: [{ type: core.Input }]\n        };\n        return CdkTreeNode;\n    }());\n\n    /**\n     * Nested node is a child of `<cdk-tree>`. It works with nested tree.\n     * By using `cdk-nested-tree-node` component in tree node template, children of the parent node will\n     * be added in the `cdkTreeNodeOutlet` in tree node template.\n     * The children of node will be automatically added to `cdkTreeNodeOutlet`.\n     */\n    var CdkNestedTreeNode = /** @class */ (function (_super) {\n        __extends(CdkNestedTreeNode, _super);\n        function CdkNestedTreeNode(_elementRef, _tree, _differs) {\n            var _this = _super.call(this, _elementRef, _tree) || this;\n            _this._elementRef = _elementRef;\n            _this._tree = _tree;\n            _this._differs = _differs;\n            return _this;\n        }\n        CdkNestedTreeNode.prototype.ngAfterContentInit = function () {\n            var _this = this;\n            this._dataDiffer = this._differs.find([]).create(this._tree.trackBy);\n            if (!this._tree.treeControl.getChildren) {\n                throw getTreeControlFunctionsMissingError();\n            }\n            var childrenNodes = this._tree.treeControl.getChildren(this.data);\n            if (Array.isArray(childrenNodes)) {\n                this.updateChildrenNodes(childrenNodes);\n            }\n            else if (rxjs.isObservable(childrenNodes)) {\n                childrenNodes.pipe(operators.takeUntil(this._destroyed))\n                    .subscribe(function (result) { return _this.updateChildrenNodes(result); });\n            }\n            this.nodeOutlet.changes.pipe(operators.takeUntil(this._destroyed))\n                .subscribe(function () { return _this.updateChildrenNodes(); });\n        };\n        CdkNestedTreeNode.prototype.ngOnDestroy = function () {\n            this._clear();\n            _super.prototype.ngOnDestroy.call(this);\n        };\n        /** Add children dataNodes to the NodeOutlet */\n        CdkNestedTreeNode.prototype.updateChildrenNodes = function (children) {\n            var outlet = this._getNodeOutlet();\n            if (children) {\n                this._children = children;\n            }\n            if (outlet && this._children) {\n                var viewContainer = outlet.viewContainer;\n                this._tree.renderNodeChanges(this._children, this._dataDiffer, viewContainer, this._data);\n            }\n            else {\n                // Reset the data differ if there's no children nodes displayed\n                this._dataDiffer.diff([]);\n            }\n        };\n        /** Clear the children dataNodes. */\n        CdkNestedTreeNode.prototype._clear = function () {\n            var outlet = this._getNodeOutlet();\n            if (outlet) {\n                outlet.viewContainer.clear();\n                this._dataDiffer.diff([]);\n            }\n        };\n        /** Gets the outlet for the current node. */\n        CdkNestedTreeNode.prototype._getNodeOutlet = function () {\n            var _this = this;\n            var outlets = this.nodeOutlet;\n            // Note that since we use `descendants: true` on the query, we have to ensure\n            // that we don't pick up the outlet of a child node by accident.\n            return outlets && outlets.find(function (outlet) { return !outlet._node || outlet._node === _this; });\n        };\n        CdkNestedTreeNode.decorators = [\n            { type: core.Directive, args: [{\n                        selector: 'cdk-nested-tree-node',\n                        exportAs: 'cdkNestedTreeNode',\n                        host: {\n                            '[attr.aria-expanded]': 'isExpanded',\n                            '[attr.role]': 'role',\n                            'class': 'cdk-tree-node cdk-nested-tree-node',\n                        },\n                        providers: [\n                            { provide: CdkTreeNode, useExisting: CdkNestedTreeNode },\n                            { provide: CDK_TREE_NODE_OUTLET_NODE, useExisting: CdkNestedTreeNode }\n                        ]\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkNestedTreeNode.ctorParameters = function () { return [\n            { type: core.ElementRef },\n            { type: CdkTree },\n            { type: core.IterableDiffers }\n        ]; };\n        CdkNestedTreeNode.propDecorators = {\n            nodeOutlet: [{ type: core.ContentChildren, args: [CdkTreeNodeOutlet, {\n                            // We need to use `descendants: true`, because Ivy will no longer match\n                            // indirect descendants if it's left as false.\n                            descendants: true\n                        },] }]\n        };\n        return CdkNestedTreeNode;\n    }(CdkTreeNode));\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /** Regex used to split a string on its CSS units. */\n    var cssUnitPattern = /([A-Za-z%]+)$/;\n    /**\n     * Indent for the children tree dataNodes.\n     * This directive will add left-padding to the node to show hierarchy.\n     */\n    var CdkTreeNodePadding = /** @class */ (function () {\n        function CdkTreeNodePadding(_treeNode, _tree, \n        /**\n         * @deprecated _renderer parameter no longer being used. To be removed.\n         * @breaking-change 11.0.0\n         */\n        _renderer, _element, _dir) {\n            var _this = this;\n            this._treeNode = _treeNode;\n            this._tree = _tree;\n            this._element = _element;\n            this._dir = _dir;\n            /** Subject that emits when the component has been destroyed. */\n            this._destroyed = new rxjs.Subject();\n            /** CSS units used for the indentation value. */\n            this.indentUnits = 'px';\n            this._indent = 40;\n            this._setPadding();\n            if (_dir) {\n                _dir.change.pipe(operators.takeUntil(this._destroyed)).subscribe(function () { return _this._setPadding(true); });\n            }\n            // In Ivy the indentation binding might be set before the tree node's data has been added,\n            // which means that we'll miss the first render. We have to subscribe to changes in the\n            // data to ensure that everything is up to date.\n            _treeNode._dataChanges.subscribe(function () { return _this._setPadding(); });\n        }\n        Object.defineProperty(CdkTreeNodePadding.prototype, \"level\", {\n            /** The level of depth of the tree node. The padding will be `level * indent` pixels. */\n            get: function () { return this._level; },\n            set: function (value) {\n                // Set to null as the fallback value so that _setPadding can fall back to the node level if the\n                // consumer set the directive as `cdkTreeNodePadding=\"\"`. We still want to take this value if\n                // they set 0 explicitly.\n                this._level = coercion.coerceNumberProperty(value, null);\n                this._setPadding();\n            },\n            enumerable: true,\n            configurable: true\n        });\n        Object.defineProperty(CdkTreeNodePadding.prototype, \"indent\", {\n            /**\n             * The indent for each level. Can be a number or a CSS string.\n             * Default number 40px from material design menu sub-menu spec.\n             */\n            get: function () { return this._indent; },\n            set: function (indent) {\n                var value = indent;\n                var units = 'px';\n                if (typeof indent === 'string') {\n                    var parts = indent.split(cssUnitPattern);\n                    value = parts[0];\n                    units = parts[1] || units;\n                }\n                this.indentUnits = units;\n                this._indent = coercion.coerceNumberProperty(value);\n                this._setPadding();\n            },\n            enumerable: true,\n            configurable: true\n        });\n        CdkTreeNodePadding.prototype.ngOnDestroy = function () {\n            this._destroyed.next();\n            this._destroyed.complete();\n        };\n        /** The padding indent value for the tree node. Returns a string with px numbers if not null. */\n        CdkTreeNodePadding.prototype._paddingIndent = function () {\n            var nodeLevel = (this._treeNode.data && this._tree.treeControl.getLevel)\n                ? this._tree.treeControl.getLevel(this._treeNode.data)\n                : null;\n            var level = this._level == null ? nodeLevel : this._level;\n            return typeof level === 'number' ? \"\" + level * this._indent + this.indentUnits : null;\n        };\n        CdkTreeNodePadding.prototype._setPadding = function (forceChange) {\n            if (forceChange === void 0) { forceChange = false; }\n            var padding = this._paddingIndent();\n            if (padding !== this._currentPadding || forceChange) {\n                var element = this._element.nativeElement;\n                var paddingProp = this._dir && this._dir.value === 'rtl' ? 'paddingRight' : 'paddingLeft';\n                var resetProp = paddingProp === 'paddingLeft' ? 'paddingRight' : 'paddingLeft';\n                element.style[paddingProp] = padding || '';\n                element.style[resetProp] = '';\n                this._currentPadding = padding;\n            }\n        };\n        CdkTreeNodePadding.decorators = [\n            { type: core.Directive, args: [{\n                        selector: '[cdkTreeNodePadding]',\n                    },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodePadding.ctorParameters = function () { return [\n            { type: CdkTreeNode },\n            { type: CdkTree },\n            { type: core.Renderer2 },\n            { type: core.ElementRef },\n            { type: bidi.Directionality, decorators: [{ type: core.Optional }] }\n        ]; };\n        CdkTreeNodePadding.propDecorators = {\n            level: [{ type: core.Input, args: ['cdkTreeNodePadding',] }],\n            indent: [{ type: core.Input, args: ['cdkTreeNodePaddingIndent',] }]\n        };\n        return CdkTreeNodePadding;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    /**\n     * Node toggle to expand/collapse the node.\n     */\n    var CdkTreeNodeToggle = /** @class */ (function () {\n        function CdkTreeNodeToggle(_tree, _treeNode) {\n            this._tree = _tree;\n            this._treeNode = _treeNode;\n            this._recursive = false;\n        }\n        Object.defineProperty(CdkTreeNodeToggle.prototype, \"recursive\", {\n            /** Whether expand/collapse the node recursively. */\n            get: function () { return this._recursive; },\n            set: function (value) { this._recursive = coercion.coerceBooleanProperty(value); },\n            enumerable: true,\n            configurable: true\n        });\n        // We have to use a `HostListener` here in order to support both Ivy and ViewEngine.\n        // In Ivy the `host` bindings will be merged when this class is extended, whereas in\n        // ViewEngine they're overwritten.\n        // TODO(crisbeto): we move this back into `host` once Ivy is turned on by default.\n        // tslint:disable-next-line:no-host-decorator-in-concrete\n        CdkTreeNodeToggle.prototype._toggle = function (event) {\n            this.recursive\n                ? this._tree.treeControl.toggleDescendants(this._treeNode.data)\n                : this._tree.treeControl.toggle(this._treeNode.data);\n            event.stopPropagation();\n        };\n        CdkTreeNodeToggle.decorators = [\n            { type: core.Directive, args: [{ selector: '[cdkTreeNodeToggle]' },] }\n        ];\n        /** @nocollapse */\n        CdkTreeNodeToggle.ctorParameters = function () { return [\n            { type: CdkTree },\n            { type: CdkTreeNode }\n        ]; };\n        CdkTreeNodeToggle.propDecorators = {\n            recursive: [{ type: core.Input, args: ['cdkTreeNodeToggleRecursive',] }],\n            _toggle: [{ type: core.HostListener, args: ['click', ['$event'],] }]\n        };\n        return CdkTreeNodeToggle;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n    var EXPORTED_DECLARATIONS = [\n        CdkNestedTreeNode,\n        CdkTreeNodeDef,\n        CdkTreeNodePadding,\n        CdkTreeNodeToggle,\n        CdkTree,\n        CdkTreeNode,\n        CdkTreeNodeOutlet,\n    ];\n    var CdkTreeModule = /** @class */ (function () {\n        function CdkTreeModule() {\n        }\n        CdkTreeModule.decorators = [\n            { type: core.NgModule, args: [{\n                        exports: EXPORTED_DECLARATIONS,\n                        declarations: EXPORTED_DECLARATIONS,\n                        providers: [a11y.FocusMonitor, CdkTreeNodeDef]\n                    },] }\n        ];\n        return CdkTreeModule;\n    }());\n\n    /**\n     * @license\n     * Copyright Google LLC All Rights Reserved.\n     *\n     * Use of this source code is governed by an MIT-style license that can be\n     * found in the LICENSE file at https://angular.io/license\n     */\n\n    /**\n     * Generated bundle index. Do not edit.\n     */\n\n    exports.BaseTreeControl = BaseTreeControl;\n    exports.CDK_TREE_NODE_OUTLET_NODE = CDK_TREE_NODE_OUTLET_NODE;\n    exports.CdkNestedTreeNode = CdkNestedTreeNode;\n    exports.CdkTree = CdkTree;\n    exports.CdkTreeModule = CdkTreeModule;\n    exports.CdkTreeNode = CdkTreeNode;\n    exports.CdkTreeNodeDef = CdkTreeNodeDef;\n    exports.CdkTreeNodeOutlet = CdkTreeNodeOutlet;\n    exports.CdkTreeNodeOutletContext = CdkTreeNodeOutletContext;\n    exports.CdkTreeNodePadding = CdkTreeNodePadding;\n    exports.CdkTreeNodeToggle = CdkTreeNodeToggle;\n    exports.FlatTreeControl = FlatTreeControl;\n    exports.NestedTreeControl = NestedTreeControl;\n    exports.getTreeControlFunctionsMissingError = getTreeControlFunctionsMissingError;\n    exports.getTreeControlMissingError = getTreeControlMissingError;\n    exports.getTreeMissingMatchingNodeDefError = getTreeMissingMatchingNodeDefError;\n    exports.getTreeMultipleDefaultNodeDefsError = getTreeMultipleDefaultNodeDefsError;\n    exports.getTreeNoValidDataSourceError = getTreeNoValidDataSourceError;\n\n    Object.defineProperty(exports, '__esModule', { value: true });\n\n})));\n//# sourceMappingURL=cdk-tree.umd.js.map\n"]}

package/bundles/cdk.umd.js

@@ -12,7 +12,7 @@
 	 * found in the LICENSE file at https://angular.io/license
 	 */
 	/** Current version of the Angular Component Development Kit. */
-	var VERSION = new core.Version('9.2.1');
+	var VERSION = new core.Version('9.2.2');
 
 	/**
 	 * @license

package/bundles/cdk.umd.js.map

@@ -1 +1 @@
-{"version":3,"file":"cdk.umd.js","sources":["../../../../../src/cdk/version.ts","../../../../../src/cdk/public-api.ts","../../../../../src/cdk/index.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('9.2.1');\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nexport * from './version';\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nexport * from './public-api';\n"],"names":["Version"],"mappings":";;;;;;CAAA;;;;;;;AAQA,CAEA;AACA,KAAa,OAAO,GAAG,IAAIA,YAAO,CAAC,mBAAmB,CAAC;;CCXvD;;;;;;IAMG;;CCNH;;;;;;IAMG;;;;;;;;;;;;"}
+{"version":3,"file":"cdk.umd.js","sources":["../../../../../src/cdk/version.ts","../../../../../src/cdk/public-api.ts","../../../../../src/cdk/index.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('9.2.2');\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nexport * from './version';\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nexport * from './public-api';\n"],"names":["Version"],"mappings":";;;;;;CAAA;;;;;;;AAQA,CAEA;AACA,KAAa,OAAO,GAAG,IAAIA,YAAO,CAAC,mBAAmB,CAAC;;CCXvD;;;;;;IAMG;;CCNH;;;;;;IAMG;;;;;;;;;;;;"}

package/bundles/cdk.umd.min.js

@@ -5,7 +5,7 @@
 	 *
 	 * Use of this source code is governed by an MIT-style license that can be
 	 * found in the LICENSE file at https://angular.io/license
-	 */var o=new n.Version("9.2.1");
+	 */var o=new n.Version("9.2.2");
 /**
 	 * @license
 	 * Copyright Google LLC All Rights Reserved.

package/bundles/cdk.umd.min.js.map

@@ -1 +1 @@
-{"version":3,"sources":["src/cdk/cdk.umd.js"],"names":["global","factory","exports","module","require","define","amd","self","ng","cdk","core","this","VERSION","Version","Object","defineProperty","value"],"mappings":"CAAC,SAAUA,EAAQC,GACC,iBAAZC,SAA0C,oBAAXC,OAAyBF,EAAQC,QAASE,QAAQ,kBACtE,mBAAXC,QAAyBA,OAAOC,IAAMD,OAAO,eAAgB,CAAC,UAAW,iBAAkBJ,GACxEA,IAAzBD,EAASA,GAAUO,MAAsBC,GAAKR,EAAOQ,IAAM,GAAIR,EAAOQ,GAAGC,IAAM,IAAKT,EAAOQ,GAAGE,MAHhG,CAIEC,MAAM,SAAWT,EAASQ,GAAQ;;;;;;;IAUnC,IAAIE,EAAU,IAAIF,EAAKG,QAAQ;;;;;;;;;;;;;;IAkB/BX,EAAQU,QAAUA,EAElBE,OAAOC,eAAeb,EAAS,aAAc,CAAEc,OAAO","sourcesContent":["(function (global, factory) {\n\ttypeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@angular/core')) :\n\ttypeof define === 'function' && define.amd ? define('@angular/cdk', ['exports', '@angular/core'], factory) :\n\t(global = global || self, factory((global.ng = global.ng || {}, global.ng.cdk = {}), global.ng.core));\n}(this, (function (exports, core) { 'use strict';\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\t/** Current version of the Angular Component Development Kit. */\n\tvar VERSION = new core.Version('9.2.1');\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\n\texports.VERSION = VERSION;\n\n\tObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n//# sourceMappingURL=cdk.umd.js.map\n"]}
+{"version":3,"sources":["src/cdk/cdk.umd.js"],"names":["global","factory","exports","module","require","define","amd","self","ng","cdk","core","this","VERSION","Version","Object","defineProperty","value"],"mappings":"CAAC,SAAUA,EAAQC,GACC,iBAAZC,SAA0C,oBAAXC,OAAyBF,EAAQC,QAASE,QAAQ,kBACtE,mBAAXC,QAAyBA,OAAOC,IAAMD,OAAO,eAAgB,CAAC,UAAW,iBAAkBJ,GACxEA,IAAzBD,EAASA,GAAUO,MAAsBC,GAAKR,EAAOQ,IAAM,GAAIR,EAAOQ,GAAGC,IAAM,IAAKT,EAAOQ,GAAGE,MAHhG,CAIEC,MAAM,SAAWT,EAASQ,GAAQ;;;;;;;IAUnC,IAAIE,EAAU,IAAIF,EAAKG,QAAQ;;;;;;;;;;;;;;IAkB/BX,EAAQU,QAAUA,EAElBE,OAAOC,eAAeb,EAAS,aAAc,CAAEc,OAAO","sourcesContent":["(function (global, factory) {\n\ttypeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@angular/core')) :\n\ttypeof define === 'function' && define.amd ? define('@angular/cdk', ['exports', '@angular/core'], factory) :\n\t(global = global || self, factory((global.ng = global.ng || {}, global.ng.cdk = {}), global.ng.core));\n}(this, (function (exports, core) { 'use strict';\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\t/** Current version of the Angular Component Development Kit. */\n\tvar VERSION = new core.Version('9.2.2');\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\n\t/**\n\t * @license\n\t * Copyright Google LLC All Rights Reserved.\n\t *\n\t * Use of this source code is governed by an MIT-style license that can be\n\t * found in the LICENSE file at https://angular.io/license\n\t */\n\n\texports.VERSION = VERSION;\n\n\tObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n//# sourceMappingURL=cdk.umd.js.map\n"]}

package/drag-drop/drag-ref.d.ts

@@ -96,8 +96,8 @@ export declare class DragRef<T = any> {
     private _initialContainer;
     /** Index at which the item started in its initial container. */
     private _initialIndex;
-    /** Cached scroll position on the page when the element was picked up. */
-    private _scrollPosition;
+    /** Cached positions of scrollable parent elements. */
+    private _parentPositions;
     /** Emits when the item is being moved. */
     private _moveEvents;
     /** Keeps track of the direction in which the user is dragging along each axis. */
@@ -377,5 +377,7 @@ export declare class DragRef<T = any> {
     private _getDragStartDelay;
     /** Updates the internal state of the draggable element when scrolling has occurred. */
     private _updateOnScroll;
+    /** Gets the scroll position of the viewport. */
+    private _getViewportScrollPosition;
 }
 export {};

package/drag-drop/drop-list-ref.d.ts

@@ -84,7 +84,7 @@ export declare class DropListRef<T = any> {
     private _isDragging;
     /** Cache of the dimensions of all the items inside the container. */
     private _itemPositions;
-    /** Cached positions of the scrollable parent elements. */
+    /** Keeps track of the positions of any parent scrollable elements. */
     private _parentPositions;
     /** Cached `ClientRect` of the drop list. */
     private _clientRect;
@@ -184,6 +184,8 @@ export declare class DropListRef<T = any> {
      * @param elements Elements that can be scrolled.
      */
     withScrollableParents(elements: HTMLElement[]): this;
+    /** Gets the scrollable parents that are registered with this drop container. */
+    getScrollableParents(): ReadonlyArray<HTMLElement>;
     /**
      * Figures out the index of an item in the container.
      * @param item Item whose index should be determined.
@@ -234,6 +236,12 @@ export declare class DropListRef<T = any> {
      * @param delta Direction in which the user is moving.
      */
     private _getItemOffsetPx;
+    /**
+     * Checks if pointer is entering in the first position
+     * @param pointerX Position of the user's pointer along the X axis.
+     * @param pointerY Position of the user's pointer along the Y axis.
+     */
+    private _shouldEnterAsFirstChild;
     /**
      * Gets the index of an item in the drop container, based on the position of the user's pointer.
      * @param item Item that is being sorted.
@@ -244,13 +252,6 @@ export declare class DropListRef<T = any> {
     private _getItemIndexFromPointerPosition;
     /** Caches the current items in the list and their positions. */
     private _cacheItems;
-    /**
-     * Updates the internal state of the container after a scroll event has happened.
-     * @param scrolledParent Element that was scrolled.
-     * @param newTop New top scroll position.
-     * @param newLeft New left scroll position.
-     */
-    private _updateAfterScroll;
     /** Starts the interval that'll auto-scroll the element. */
     private _startScrollInterval;
     /**