{"mappings":"C,A,S,C,C,C,C,C,C,C,C,C,E,I,E,A,a,O,W,W,A,a,O,K,K,A,a,O,O,O,A,a,O,O,O,C,E,E,A,Y,O,C,C,E,E,C,C,E,C,E,E,K,E,C,E,E,A,a,O,Q,A,Y,O,O,O,E,O,O,C,I,C,Q,S,E,C,C,C,E,G,C,C,C,E,C,C,G,C,C,C,E,C,C,I,E,A,Y,O,C,C,E,E,C,C,E,C,G,C,G,E,O,E,E,C,G,G,E,O,E,E,C,G,G,G,A,U,O,E,O,E,G,I,E,A,M,uB,E,I,O,E,I,C,mB,C,C,E,O,C,S,C,E,I,E,C,C,E,C,E,C,E,C,O,A,M,E,E,C,E,E,K,C,C,E,I,E,C,C,E,C,I,E,M,C,G,C,C,E,C,E,C,I,C,E,O,C,E,E,E,O,C,I,C,C,O,C,C,E,C,O,C,S,E,C,E,I,E,E,O,C,G,M,A,C,I,E,C,E,E,E,C,C,E,e,C,C,E,E,M,C,S,C,E,I,C,E,C,E,I,C,M,C,E,I,C,O,C,C,C,E,E,O,C,E,E,K,C,E,E,M,C,E,E,Q,C,S,C,C,C,E,C,C,E,C,C,S,C,C,C,E,E,O,C,C,E,C,E,A,E,O,c,C,E,O,C,I,W,O,C,C,E,A,C,G,C,C,E,C,E,I,I,E,E,E,E,M,C,I,E,C,C,E,C,E,C,M,C,S,C,C,C,C,C,E,I,E,E,kD,E,iB,C,GCoBA,EAAA,MAAA,CAAA,EAAA,kBAAA,IAAS,IAAT,EAAA,MAAA,CAAA,EAAA,oBAAA,IAA0B,IAA1B,EAAA,MAAA,CAAA,EAAA,aAAA,IAA6C,IAA7C,EAAA,MAAA,CAAA,EAAA,aAAA,IAAyD,IApBzD,IAAA,EAAA,EAAA,yBACA,EAAA,EAAA,c,E,E,c,C,GACA,EAAA,EAAA,a,E,E,c,C,GACA,EAAA,EAAA,aACA,EAAA,EAAA,aACA,EAAA,EAAA,SACA,EAAA,EAAA,a,E,E,c,C,GACA,EAAA,EAAA,cACA,EAAA,EAAA,2B,E,E,c,C,GACA,EAAA,EAAA,wB,E,E,c,C,GACA,EAAA,EAAA,sB,E,E,c,C,GACA,EAAA,EAAA,+B,E,E,c,C,GACA,EAAA,EAAA,S,E,E,c,C,GACA,EAAA,EAAA,0BACA,EAAA,EAAA,4BAGO,EAAe,SAAS,EAAe,SAAS,EAAc,QAA8B,EAAiB,OAAO,EAAgB,UAAU,SAAS,EAAU,CAAO,EAAE,MAAO,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,QAAQ,CAAC,EAAQ,WAAW,GAAG,CAAC,IAAI,EAAc,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,EAAgB,CAAC,GAAG,CAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAe,CAAC,GAAG,CAAa,AAAA,EAAE,SAAS,EAAa,CAAG,CAAC,EAAQ,CAAC,CAAC,EAAE,MAAO,AAAA,CAAA,EAAA,EAAA,QAAO,AAAP,EAAS,EAAI,EAAQ,EAAgB,EAAe,CAAC,SAAS,EAAmB,CAAG,CAAC,EAAQ,CAAC,CAAC,EAA0G,IAAI,EAA5G,OAAO,GAAwI,CAAnC,EAAO,EAA1E,EAA2F,CAAC,IAAiB,QAAQ,CAAC,OAAQ,CAAA,EAAO,CAAC,EAAE,EAAO,KAAK,CAAC,EAAE,IAAI,EAAE,CAAA,AAAA,EAAG,GAA3J,EAAa,EAAI,CAAiJ,SAAS,EAAkB,CAAG,CAAC,EAAQ,CAAC,CAAC,EAA2P,IAAI,EAAnI,EAA1H,OAAO,GAAyR,CAAnC,EAAO,EAA5N,EAA6O,CAAC,IAAiB,UAAU,CAAC,UAAW,CAAA,EAAO,EAAO,OAAO,CAAC,QAAQ,IAAA,EAAM,IAAvM,CAAhC,EAAO,EAAzD,IAAyF,QAAQ,CAAC,SAAU,CAAA,EAAO,AAAA,CAAA,EAAA,EAAA,MAAK,AAAL,EAAO,EAAA,EAAS,EAA/H,CAA4R,IAAI,EAAO,AAAA,GAAW,EAAU,QAAQ,GAAG,OAAO,GAAG,CAAC,cAAc,EAAa,AAAA,GAAW,EAAU,QAAQ,GAAG,OAAO,GAAG,CAAC,qBAAyB,EAAoB,CAAC,GAAG,EAAU,IAAI,CAAC,WAAW,KAAK,CAAC,EAAE,EAAY,AAAA,CAAA,EAAA,EAAA,MAAM,AAAN,EAAO,MAAM,CAAC,AAAA,CAAA,EAAA,EAAA,OAAE,AAAF,KAAO,SAAS,EAAsB,CAAc,EAAE,OAAO,AAAgB,MAAhB,EAAqB,EAAe,IAAI,CAAC,IAAI,CAAC,SAAS,EAAgB,CAAS,EAAE,OAAO,EAAU,MAAM,CAAC,AAAA,GAAG,AAAS,qBAAT,EAAE,IAAI,EAAuB,AAAS,oBAAT,EAAE,IAAI,CAAqB,CAAC,SAAS,EAAmB,CAAI,EAAE,IAAI,EAAO,EAAE,CAAC,OAAO,EAAU,QAAQ,CAAC,EAAK,CAAC,iBAAiB,CAAC,CAAC,CAAS,EAAE,EAAO,IAAI,CAAC,EAAgB,GAAW,MAAM,CAAE,EAAE,gBAAgB,CAAC,CAAC,CAAS,EAAE,EAAO,IAAI,CAAC,EAAgB,GAAW,MAAM,CAAE,CAAC,EAAE,GAAqB,KAAK,GAAG,IAAI,EAAO,CAAk6C,SAAS,EAAY,CAAU,EAAE,MAAO,CAAC,aAAa,CAAC,KAAK,SAAS,MAAM,EAAmB,EAAW,EAAE,IAAI,CAAU,CAAC,CAA0/B,SAAS,EAAa,CAAK,EAAE,GAAG,CAAC,MAAO,CAAC,GAAG,AAA/Z,SAAe,CAAK,EAAE,IAAI,EAAI,EAAY,KAAK,CAAC,CAAC,CAAC,EAAE,EAAM,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,GAAG,EAAc,CAAC,aAAa,CAAC,KAAK,SAAS,EAAE,IAAA,CAAG,EAAE,GAAG,AAAa,MAAb,EAAI,IAAI,CAAC,EAAE,CAAO,CAAC,IAAI,EAAS,EAAI,IAAI,CAAC,EAAE,CAAC,GAA0B,wBAAnB,EAAS,IAAI,CAA4B,CAAC,IAAI,EAAiB,AAAxwB,SAAyB,CAAU,EAAE,OAAO,EAAW,IAAI,EAAE,IAAI,aAAa,MAAhrD,CAAC,aAAa,CAAC,KAAK,aAAa,WAAW,EAA2pD,EAAtnD,EAAE,IAAonD,CAAlmD,CAA8mD,KAAI,UAAU,MAAhlD,CAAC,aAAa,CAAC,KAAK,SAAS,EAAE,IAAqkD,CAAtjD,CAAkkD,KAAI,qBAAqB,IAAI,8BAAxjD,EAA0H,EAA+H,EAAy1C,OAA9jD,EAAU,MAAM,CAAC,AAAkkD,EAAzjD,IAAI,CAAC,CAAC,WAAW,CAAI,EAAE,EAAoB,CAAK,CAAC,EAAE,GAAyB,EAAa,CAAC,KAAK,AAAqB,MAArB,EAA0B,UAAU,WAAW,OAAO,AAAo6C,EAA35C,MAAM,CAAC,UAAU,AAAyB,IAAzB,AAA04C,EAAj4C,MAAM,CAAC,MAAM,AAAI,EAA2D,AAAgB,OAAzE,EAAe,EAAsB,AAAy0C,EAAh0C,EAAE,IAAgC,CAAA,EAAa,UAAU,CAAC,CAAA,EAAgB,CAAC,aAAA,EAAa,IAAwuC,CAA5tC,CAAwuC,KAAI,sBAAvsC,EAAytC,OAA9rC,EAAU,MAAM,CAAC,AAA+rC,EAArrC,IAAI,CAAC,CAAC,WAAW,CAAI,EAAE,EAAoB,CAAK,CAAC,EAAE,GAAqB,CAAC,aAAa,CAAC,KAAK,AAAqB,MAArB,EAA0B,UAAU,QAAQ,WAAW,EAAsB,AAA4gC,EAAlgC,EAAE,CAAC,EAAE,IAA6/B,CAAh/B,CAA4/B,KAAI,iBAAj9B,EAA8B,EAAg8B,OAA99B,EAAa,CAAC,KAAK,SAAS,EAAkF,AAAgB,OAAhG,EAAe,EAAsB,AAAk7B,EAAn6B,cAAc,CAAC,IAAI,IAAgC,CAAA,EAAa,UAAU,CAAC,CAAA,EAAgB,CAAC,aAAA,EAAa,IAA0zB,CAAxyB,CAAozB,KAAI,iBAAiB,MAA7rB,AAAwC,UAAxC,EAA1F,AAAuB,qBAAvB,AAAwyB,EAA/xB,MAAM,CAAC,IAAI,CAAsB,AAA8vB,EAArvB,MAAM,CAAC,QAAQ,CAAC,AAAquB,EAA5tB,MAAM,EAAwD,EAAY,AAAkpB,EAAzoB,SAAS,CAAC,EAAE,EAAE,IAAuoB,KAAI,mBAAmB,OAAO,EAAY,EAAY,KAAI,kBAAkB,MAA7iB,CAAC,aAAa,CAAC,KAAK,QAAQ,MAAM,EAA6hB,EAAhgB,EAAE,IAA8f,CAAjf,CAA6f,SAAQ,OAAO,IAAI,CAAC,EAAyQ,EAAS,UAAU,CAAE,AAAkB,OAAlB,GAAyB,CAAA,EAAc,CAAA,CAAuB,CAAE,CAAC,OAAO,CAAa,EAAmD,EAAM,AAAA,CAAC,CAAC,KAAK,CAAC,CAAC,MAAO,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,CAAC,CAAyB,SAAS,EAAc,CAAC,KAAA,CAAI,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,aAAA,CAAY,CAAC,EAAE,MAAO,CAAC,KAAA,EAAK,MAAA,EAAM,QAAA,EAAQ,KAAK,GAAM,EAAM,aAAA,CAAY,CAAC,CAAC,SAAS,EAAe,CAAK,EAAE,OAAO,EAAM,OAAO,CAAC,cAAc,IAAI,OAAO,CAAC,eAAe,GAAG,CAAC,SAAS,EAAe,CAAK,EAAE,OAAO,EAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAa,CAAG,CAAC,EAAQ,CAAC,CAAC,EAAE,OAAO,EAAe,EAAmB,EAAI,GAAS,CAAC,SAAS,EAAY,CAAG,CAAC,EAAQ,CAAC,CAAC,EAAE,OAAO,EAAe,EAAa,EAAI,GAAS,CAAyQ,SAAS,EAAuB,CAAK,CAAC,CAAgB,EAAE,GAAG,CAAC,aAAA,CAAY,CAAC,IAAA,CAAG,CAAC,CAAC,EAAa,GAAO,CAAC,KAAA,CAAI,CAAC,CAAC,EAAa,EAAM,EAAQ,EAAK,OAAO,GAAM,IAAI,aAAa,IAAI,UAAU,EAAM,EAAM,EAAQ,EAAM,KAAM,KAAI,SAAS,CAAC,GAAG,CAAC,MAAA,CAAK,CAAC,CAAC,CAAa,CAAA,EAAM,EAAe,EAAQ,AAAQ,IAAR,EAAU,EAAa,EAAI,CAAC,GAAG,KAAK,EAAK,EAAa,GAAK,KAAK,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,WAAA,CAAU,CAAC,CAAC,CAAa,CAAA,EAAM,AAAY,MAAZ,GAAmB,EAAU,GAAuB,EAAX,EAA2B,EAAQ,AAA+B,IAA/B,EAAe,GAAO,MAAM,CAAK,EAAM,KAAK,EAAK,EAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAA,CAAK,CAAC,CAAC,CAAa,CAAA,EAAM,EAAc,EAAQ,GAAO,EAAE,EAAY,EAAI,CAAC,GAAG,KAAK,EAAK,EAAY,GAAK,KAAK,CAAC,QAAQ,EAAM,AAAz6B,SAAqC,CAAI,EAAE,OAAO,GAAM,IAAI,SAAS,OAAO,CAAe,KAAI,QAAQ,OAAO,CAAc,KAAI,QAAQ,MAAv9J,OAA4+J,KAAI,WAAW,OAAO,CAAiB,KAAI,UAAU,OAAO,CAAgB,SAAQ,OAAO,CAAc,CAAC,EAA8rB,GAAM,EAAQ,AAA+B,IAA/B,EAAe,GAAO,MAAM,CAAK,EAAM,KAAK,EAAK,CAAW,CAAC,OAAO,EAAc,CAAC,KAAK,EAAiB,MAAA,EAAM,QAAA,EAAQ,KAAA,EAAK,aAAa,CAAI,EAAE,CAA05B,SAAS,GAAS,CAAE,EAAE,MAAO,CAAC,SAAS,EAAE,EAAG,CAAC,CAAC,AAAA,CAAy9C,SAAS,GAA2B,CAAK,CAAC,CAAO,CAAC,CAAI,EAAE,OAAO,EAAc,CAAC,KAAK,UAAU,MAAjJ,CAAC,EAAiK,EAA5J,EAAE,CAAC,CAAgK,QAAQ,AAAS,MAAT,EAAvI,CAAC,CAAC,EAA+J,EAA1J,CAAC,CAAC,CAAiK,KAAK,KAAK,GAApL,CAAC,CAAC,EAAoM,EAA/L,CAAC,CAAC,AAAkM,EAAE,CAAwY,SAAS,GAAa,CAAI,CAAC,CAAa,EAAE,GAAG,CAAC,OAAO,EAAK,IAAI,EAAE,IAAI,SAAS,OAAO,AAA/jG,SAAwB,CAAC,IAAA,CAAG,CAAC,EAAE,OAAO,AAAK,MAAL,EAAU,EAAuB,EAAI,UAAU,EAAc,CAAC,KAAK,SAAS,MAAM,EAAe,QAAQ,CAAc,EAAE,EAA+6F,EAAM,KAAI,OAAO,OAAO,AAAt8F,SAAsB,CAAa,EAAE,GAAG,CAAC,UAAA,CAAS,CAAC,CAAC,EAAc,OAAO,AAAW,MAAX,GAAkB,CAAA,AAAkB,MAAlB,EAAU,MAAM,EAAQ,AAAmB,MAAnB,EAAU,OAAO,AAAE,EAAM,EAAc,CAAC,KAAK,OAAO,MAAM,AAD93L,SAAoC,CAAM,CAAC,CAAO,EAAE,IAAI,EAAU,AAAQ,MAAR,EAAa,EAAW,AAAS,MAAT,EAAc,GAAG,CAAC,GAAW,CAAC,EAAW,MAAO,GAAG,IAAI,EAAU,EAAE,CAAC,OAAO,EAAU,EAAU,IAAI,CAAC,WAAW,EAAU,IAAI,CAAC,MAAM,GAAY,EAAU,IAAI,CAAC,CAAC,GAAG,EAAE,EAAQ,WAAW,GAAG,CAAC,EAAE,EAAU,IAAI,CAAC,IAAI,EAC8mL,EAAU,MAAM,CAAC,EAAU,OAAO,EAAE,QAAQ,KAAK,KAAK,AAD36M,SAA+B,CAAM,CAAC,CAAO,EAAE,IAAI,EAAU,AAAQ,MAAR,EAAa,EAAW,AAAS,MAAT,EAAc,GAAG,CAAC,GAAW,CAAC,EAAW,MAAO,GAAG,IAAI,EAAU,EAAE,CAAC,GAAG,EAAU,CAAC,IAAI,EAAW,EAAO,GAAG,CAAC,AAAA,IAAI,IAAI,EAAW,EAAE,aAAa,GAAG,EAAS,EAAE,WAAW,GAAG,OAAO,AAAU,MAAV,EAAe,CAAC,EAAE,EAAW,EAAE,EAAE,EAAS,CAAC,CAAC,CAAU,GAAG,EAAU,IAAI,CAAC,CAAC,CAAC,EAAE,EAAW,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,MAAM,EAAU,IAAI,CAAC,MAAM,OAAO,GAAY,EAAU,IAAI,CAAC,CAAC,GAAG,EAAE,EAAQ,WAAW,GAAG,CAAC,EAAE,EAAU,IAAI,CAAC,IAAI,EACs+L,EAAU,MAAM,CAAC,EAAU,OAAO,CAAC,GAAG,EAAc,CAAC,KAAK,OAAO,MAAM,EAAiB,QAAQ,CAAgB,EAAE,EAA6kF,EAAe,KAAI,QAAQ,OAAO,AAA9mF,SAAuB,CAAI,CAAC,CAAa,EAAE,IAAI,EAAO,OAAO,IAAI,CAAC,EAAK,KAAK,EAAE,GAAG,CAAC,AAAA,GAAK,CAAC,EAAE,EAAI,EAAE,EAAE,GAAa,EAAK,KAAK,CAAC,EAAI,CAAC,GAAe,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,aAAA,CAAY,CAAC,IAAA,CAAG,CAAC,CAAC,EAAa,CAAC,EAAE,EAAE,EAAO,EAAE,CAAC,EAAE,CAAC,MAAA,CAAK,CAAC,CAAC,EAAa,OAAO,EAAc,CAAC,KAAK,QAAQ,MAAM,EAAe,QAAQ,AAAQ,IAAR,GAAW,EAAI,EAAa,EAAI,CAAC,GAAG,KAAK,KAAK,EAAI,EAAa,GAAK,IAAI,EAAE,EAA2wE,EAAK,EAAe,KAAI,aAAa,OAAO,EAAc,CAAC,KAAK,aAAa,MAAM,EAAK,KAAK,CAAC,QAAQ,EAAK,KAAK,AAAA,EAAG,KAAI,WAAW,OAAO,AAAp2E,SAA0B,CAAI,CAAC,CAAa,EAAE,GAAG,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,CAAC,GAAa,EAAK,KAAK,CAAC,GAAe,OAAO,EAAc,CAAC,KAAK,WAAW,MAAM,GAAS,GAAO,QAAQ,AAAS,MAAT,EAAc,GAAS,GAAS,KAAK,KAAK,GAAM,GAAS,EAAK,EAAE,EAAooE,EAAK,EAAe,KAAI,QAAQ,OAAO,AAA1qE,SAAuB,CAAI,CAAC,CAAa,EAAE,GAAG,MAAM,OAAO,CAAC,EAAK,KAAK,EAAE,CAAC,IAAI,EAAO,EAAK,KAAK,CAAC,MAAM,CAAC,CAAC,EAAI,KAAK,GAAG,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,CAAC,GAAa,EAAE,GAAe,OAAO,EAAI,KAAK,CAAC,IAAI,CAAC,GAAO,EAAI,OAAO,CAAC,IAAI,CAAC,GAAS,EAAI,IAAI,CAAC,IAAI,CAAC,GAAM,CAAG,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,AAAA,GAAG,OAAO,EAAc,CAAC,KAAK,QAAQ,MAAM,EAAO,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,EAAO,OAAO,CAAC,KAAK,CAAC,AAAA,GAAG,AAAG,MAAH,GAAS,EAAO,OAAO,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK,EAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,OAAO,EAAc,CAAC,KAAK,QAAQ,MAAM,EAAK,KAAK,CAAC,QAAQ,IAAI,EAAE,EAAurD,EAAK,EAAe,KAAI,OAAO,OAAO,AAAzjD,SAAsB,CAAI,EAAE,GAAG,MAAM,OAAO,CAAC,EAAK,KAAK,EAAE,CAAC,IAAI,EAAO,EAAK,KAAK,CAAC,MAAM,CAAC,CAAC,EAAI,KAAK,GAAG,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,CAAC,AAA5R,SAA2B,CAAC,MAAA,CAAK,CAAC,SAAA,CAAQ,CAAC,EAAE,OAAO,EAAS,EAAuB,EAAM,aAAa,EAAc,CAAC,KAAK,YAAY,MAAM,EAAM,QAAQ,CAAK,EAAE,EAA4I,GAAG,OAAO,EAAI,KAAK,CAAC,IAAI,CAAC,GAAO,EAAI,OAAO,CAAC,IAAI,CAAC,GAAS,EAAI,IAAI,CAAC,IAAI,CAAC,GAAM,CAAG,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,AAAA,GAAG,OAAO,EAAc,CAAC,KAAK,OAAO,MAAM,EAAO,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,EAAO,OAAO,CAAC,KAAK,CAAC,AAAA,GAAG,AAAG,MAAH,GAAS,EAAO,OAAO,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK,EAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,OAAO,EAAc,CAAC,KAAK,OAAO,MAAM,EAAK,KAAK,CAAC,QAAQ,EAAK,KAAK,AAAA,EAAE,EAAylC,EAAM,KAAI,UAAU,OAAO,AAA51B,SAAuB,CAAI,CAAC,CAAa,EAAE,GAAG,CAAC,KAAA,CAAI,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,aAAA,CAAY,CAAC,CAAC,GAAa,EAAK,KAAK,CAAC,GAAe,GAAG,AAAO,WAAP,EAAiB,CAAA,GAAG,AAAe,WAAf,EAAwB,OAAO,GAA2B,EAAM,EAAQ,EAA3E,MAAsF,GAAG,AAAO,UAAP,EAAe,OAAO,GAA2B,EAAM,EAAQ,GAAM,OAAO,EAAc,CAAC,KAAK,UAAU,MAA3kB,CAAC,EAA2lB,EAAtlB,EAAE,CAAC,CAA0lB,QAAnmB,CAAC,EAAqnB,EAAhnB,EAAE,CAAC,AAAmnB,EAAE,EAAoe,EAAK,EAAe,SAAQ,OAAO,EAAc,CAAC,KAAK,EAAK,IAAI,CAAC,MAAM,EAAK,IAAI,CAAC,QAAQ,EAAK,IAAI,AAAA,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,KAAK,CAAC,EAAG,CAAC,OAAO,EAAc,CAAC,KAAK,UAAU,MAAM,UAAU,QAAQ,SAAS,EAAE,CAAkrB,SAAS,GAAe,CAAC,aAAA,CAAY,CAAC,IAAA,CAAG,CAAC,EAAE,GAAG,CAAC,MAAA,CAAK,CAAC,CAAC,EAAa,GAAG,AAAQ,IAAR,EAAU,CAAC,IAAI,EAAc,EAAmB,EAAI,CAAC,GAAG,GAAG,CAAC,AAAA,CAAA,EAAA,EAAA,+BAA+B,AAA/B,EAAgC,GAAe,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAc,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAe,EAAmB,GAAK,CAAC,SAAS,GAAe,CAAC,aAAA,CAAY,CAAC,IAAA,CAAG,CAAC,EAAE,GAAG,CAAC,MAAA,CAAK,CAAC,CAAC,EAAa,GAAG,GAAO,EAAE,CAAC,IAAI,EAAa,EAAkB,EAAI,CAAC,GAAG,GAAG,CAAC,AAAA,CAAA,EAAA,EAAA,+BAA+B,AAA/B,EAAgC,GAAc,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAa,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAc,EAAkB,GAAK,CAAC,SAAS,GAAwB,CAAU,CAAC,CAAY,EAAE,OAAO,EAAa,CAAC,EAAE,EAAW,OAAO,CAAC,CAAC,CAAC,EAAE,EAAW,EAAE,CAAC,AAAA,CAAC,SAAS,GAA2B,CAAU,EAAE,MAAO,CAAC,CAAC,EAAE,EAAW,GAAG,CAAC,AAAA,CAAC,SAAS,GAAoB,CAAY,EAAE,GAAG,CAAC,KAAA,CAAI,CAAC,WAAA,CAAU,CAAC,CAAC,EAAa,OAAO,GAAM,IAAI,WAAW,OAAO,GAAwB,EAAW,EAAa,SAAS,CAAE,KAAI,UAAU,OAAO,GAA2B,EAAY,SAAQ,OAAO,CAAU,CAAC,CAA2vB,SAAS,GAAmB,CAAY,EAAE,GAAG,CAAC,IAAI,EAAiB,EAAa,GAAc,OAAO,EAAiB,YAAY,CAAC,IAAI,EAAE,IAAI,SAAS,OAAO,GAAe,EAAkB,KAAI,WAAW,OAAO,AAA98B,SAAuB,CAAC,aAAA,CAAY,CAAC,IAAA,CAAG,CAAC,EAAE,GAAG,CAAC,WAAA,CAAU,CAAC,CAAC,EAAa,GAAG,AAAY,MAAZ,EAAiB,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,GAAoB,GAAc,EAAa,IAAM,IAAI,EAAc,EAAa,EAAI,CAAC,GAAG,MAAO,AAAA,CAAA,EAAA,EAAA,+BAA8B,AAA9B,EAAgC,GAAe,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAiB,EAAa,IAAM,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAc,EAA4nB,EAAkB,KAAI,UAAU,OAAO,AAAlqB,SAAyB,CAAY,CAAC,CAAgB,EAAE,GAAG,CAAC,aAAA,CAAY,CAAC,CAAC,EAAiB,CAAC,WAAA,CAAU,CAAC,CAAC,EAAa,GAAG,AAAY,MAAZ,GAAkB,CAAC,EAAU,GAAY,CAAC,IAAI,EAAiB,GAAoB,GAAc,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAiB,EAAa,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,+BAA8B,AAA9B,EAAgC,GAAc,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAgB,GAAc,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAa,EAA0R,EAAa,EAAkB,KAAI,QAAQ,OAAO,GAAe,EAAqC,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,KAAK,CAAC,EAAG,CAAC,OAAO,IAAI,CAAC,SAAS,GAAe,CAAO,EAAE,OAAO,AAAkB,MAAlB,EAAQ,QAAQ,AAAM,CAAC,SAAS,GAAoB,CAAI,CAAC,CAAQ,EAAE,GAAG,CAAC,KAAA,CAAI,CAAC,CAAC,EAAK,MAAO,AAAO,KAAP,GAAW,AAAO,cAAP,GAAoB,IAAO,EAAS,EAAK,IAAI,CAA2mB,IAA2/C,GAAuB,CAAC,OAA1mE,AAAA,GAAgB,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,KAAK,SAAS,CAAC,IAA8kE,OAAthD,AAAA,GAAiB,AAAG,GAAe,IAAiB,AAAqB,MAArB,EAAe,IAAI,CAAc,AAA5nB,SAA6B,CAAc,EAAE,GAAG,CAAC,KAAA,CAAI,CAAC,CAAC,EAAe,CAAC,YAAA,CAAW,CAAC,CAAC,EAAK,EAAK,AAAA,CAAA,EAAA,EAAA,OAAwB,AAAxB,EAAyB,EAAe,CAAC,GAAG,GAAG,AAAa,MAAb,EAAkB,CAAC,IAAI,EAAiB,GAA2B,GAAa,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAiB,EAAK,CAAC,GAAG,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,IAAO,EAAU,GAAM,CAAC,IAAI,EAAW,AAAA,CAAA,EAAA,EAAA,OAAuB,AAAvB,EAAyB,EAAe,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,YAAY,IAAI,GAAG,CAAC,AAAA,CAAA,EAAA,EAAA,+BAA+B,AAA/B,EAAgC,GAAY,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAW,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAgB,EAAK,EAA6H,GAAmB,AAAA,CAAA,EAAA,EAAA,OAAa,AAAb,EAAc,GAA0F,GAApD,EAAa,KAAK,SAAS,CAAC,KAA4D,MAAM,OAAO,CAAC,GAA0F,GAApD,EAAa,KAAK,SAAS,CAAC,KAAgE,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,GAAioC,SAA/lC,CAAC,EAAe,KAAW,IAAI,EAAU,CAAC,EAAE,EAAiB,GAAG,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAe,MAAM,EAAE,EAAU,CAAC,OAAO,GAAG,AAA0B,MAA1B,EAAe,SAAS,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAe,SAAS,CAAC,MAAM,EAAE,EAAU,CAAC,MAAO,CAAC,IAAI,EAAa,GAAG,CAA0D,GAAG,CAAC,UAAA,CAAS,CAAC,OAAA,CAAM,CAAC,CAAC,AAA/E,CAAA,EAAiB,EAAa,EAAe,QAAQ,GAArD,EAAgG,YAAY,AAAC,CAAA,EAAU,AAAgB,IAAhB,EAAO,MAAM,EAAM,AAAiB,kBAAjB,CAAM,CAAC,EAAE,CAAC,IAAI,EAAqB,CAAA,EAAa,EAAe,CAAC,EAAA,EAAI,EAAa,IAAiB,AAAc,MAAd,GAAoB,GAAe,IAAgB,CAAA,EAAU,CAAC,CAAA,CAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAS,GAAoB,EAAe,EAAQ,IAAI,EAAE,GAAG,AAAU,MAAV,EAAe,CAAC,GAAG,EAAU,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,GAA2B,GAAW,AAAkB,OAAlB,GAAyB,CAAA,EAAiB,EAAa,EAAe,QAAQ,GAAA,EAAK,GAAG,CAAC,UAAA,CAAS,CAAC,CAAC,EAAiB,YAAY,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,GAAwB,EAAS,GAAW,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAU,EAAgB,EAAiB,EAA8K,QAA5J,AAAA,GAAgB,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAe,QAAQ,GAAyH,EAA2sC,GAA4B,AAAruC,SAA6B,EAAgB,CAAC,CAAC,EAAE,MAAO,CAAC,GAAG,EAAsB,CAAC,GAAG,CAAe,AAAA,CAAC,EAAmpC,CAAC,SAAzf,CAAC,EAAe,CAAC,KAAA,CAAI,CAAC,KAAA,CAAI,CAAC,IAAI,IAAI,EAAU,AAAe,YAAf,EAAK,OAAO,EAAc,AAAe,gBAAf,EAAK,OAAO,CAAiB,EAAS,GAAoB,EAAe,GAAM,GAAG,AAAU,MAAV,EAAe,CAAC,GAAG,EAAU,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,GAA2B,IAAW,GAAG,CAAC,UAAA,CAAS,CAAC,CAAC,EAAa,EAAe,QAAQ,IAAI,YAAY,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,GAAwB,EAAS,GAAW,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAU,EAAgB,EAAiB,CAAwE,GAAu8C,GAAa,IAAI,IAAI,OAAO,IAAI,CAAC,EAAA,OAAS,EAAE,OAAO,CAAC,AAAA,IAAW,IAAI,EAAK,AAAA,EAAA,OAAS,AAAA,CAAC,EAAS,AAAC,CAAA,GAAa,GAAG,CAAC,EAAK,GAAU,GAAa,GAAG,CAAC,EAAK,UAAU,CAAC,EAAU,GAA6gB,IAAI,GAAa,AAAA,GAAY,CAAA,CAAC,KAAK,AAA7iB,SAAqB,CAAS,CAAC,CAAO,EAAE,IAAI,EAAmB,CAAU,EAAC,AAAA,CAAA,EAAA,EAAA,SAAS,AAAT,EAAU,IAAY,CAAC,EAAU,SAAS,EAAE,EAAO,IAAa,CAAA,EAAmB,EAAU,IAAI,AAAJ,EAAM,IAAI,EAAe,AAAA,CAAA,EAAA,EAAA,qBAAoB,AAApB,EAAsB,EAAmB,GAAS,GAAG,AAAwB,IAAxB,EAAe,MAAM,CAAK,MAAO,EAAE,CAAC,OAAO,CAAc,CAAC,EAAE,CAAC,UAAU,EAAE,KAAK,AAAA,EAAA,UAAU,CAAC,UAAU,KAA3zC,EAA4zC,OAA5zC,EAAgB,AAAwB,MAAxB,AAAw1C,EAA90C,YAAY,CAAO,AAA2zC,EAAjzC,YAAY,CAAC,CAAC,EAAsG,AAAxiD,SAAqC,CAAc,CAAC,CAAS,EAAE,GAAG,CAAC,UAAA,CAAS,CAAC,CAAC,EAAU,OAAO,AAAW,MAAX,EAAgB,OAAO,IAAI,CAAC,GAAW,GAAG,CAAC,AAAA,GAAG,EAAe,IAAI,CAAC,AAAA,GAAG,EAAE,IAAI,GAAG,IAAI,MAAM,CAAC,SAAS,CAAc,EAAmwC,AAAowC,EAArvC,GAAG,CAAC,AAAA,GAAG,AAAtvB,CAAA,SAA8B,CAAa,CAAC,CAAc,EAAE,GAAG,CAAC,QAAA,CAAO,CAAC,CAAC,EAAc,EAAQ,AAAjlN,SAAoB,CAAa,EAAE,GAAG,CAAC,KAAA,CAAI,CAAC,CAAC,EAAc,UAAU,CAAC,GAAG,AAAM,MAAN,EAAW,OAAO,KAAK,GAAG,CAAC,OAAO,EAAK,IAAI,EAAE,IAAI,SAAS,IAAI,QAAQ,IAAI,aAAa,IAAI,WAAW,IAAI,QAAQ,IAAI,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,MAAA,CAAK,CAAC,QAAA,CAAO,CAAC,KAAA,CAAI,CAAC,CAAC,GAAa,EAAK,GAAe,OAAO,AAAS,MAAT,GAAgB,AAAA,CAAA,EAAA,EAAA,uBAAuB,AAAvB,EAAwB,GAAqC,EAAK,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAM,GAAM,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,GAAnF,AAAA,CAAA,EAAA,EAAA,kBAAkB,AAAlB,EAAmB,EAAsE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAA,CAAK,CAAC,KAAA,CAAI,CAAC,CAAC,GAAa,EAAK,GAAe,EAAQ,EAAM,EAAO,OAAO,GAAM,EAAK,MAAM,CAAjtL,IAAkuL,EAAQ,EAAK,GAAO,CAAA,EAD55S,AACw7S,EAD96S,OAAO,CAAC,KAAK,CAAC;AACh1B,CAAC,CAA+uU,EAAO,AAAA,CAAA,EAAA,EAAA,kBAAiB,AAAjB,EAAmB,EAAQ,EAAO,CAAoB,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,KAAK,CAAC,EAAG,CAAC,OAAO,IAAI,EAA46L,EAAe,AAAS,OAAT,GAAgB,CAAA,EAAQ,IAAI,CAAC,CAAA,EAAS,GAAG,CAAC,aAAA,CAAY,CAAC,CAAC,EAAc,UAAU,CAAC,GAAG,AAAc,MAAd,GAAoB,AAAoB,MAApB,EAAa,KAAK,CAAO,CAAC,IAAI,EAAgB,GAAmB,EAAa,KAAK,CAAE,AAAiB,OAAjB,GAAwB,CAAA,EAAQ,YAAY,CAAC,CAAA,CAAiB,MAAM,GAAG,AAAgB,MAAhB,EAAqB,CAAC,IAAI,EAAgB,AAAllD,SAA8C,CAAc,CAAC,CAAO,CAAC,EAAc,EAAsB,EAAE,GAAG,CAAC,OAAO,OAAO,GAAgB,IAAI,SAAS,OAAO,EAAc,MAAM,CAAC,EAAe,EAAS,KAAI,SAAS,OAAO,EAAc,MAAM,CAAC,EAAe,EAAS,KAAI,WAAW,OAAO,EAAc,QAAQ,CAAC,EAAe,EAAS,SAAQ,OAAO,EAAc,OAAO,CAAC,EAAe,EAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,KAAK,CAAC,EAAG,CAAC,OAAO,IAAI,EAA+rC,EAAe,EAAQ,GAA6B,AAAiB,OAAjB,GAAwB,CAAA,EAAQ,YAAY,CAAC,CAAA,CAAiB,CAAC,OAAO,CAAO,CAAA,EAA8L,EAAE,CAAe,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,GAAusC,EAAW,MAAK,AAAA,EAAA,UAAU,CAAC,UAAU,CAAC,OAA/oB,AAA6qB,EAA9pB,GAAG,CAAC,AAAA,GAAM,AAAxjB,CAAA,SAA+B,CAAa,CAAC,CAAc,EAAE,GAAG,CAAC,QAAA,CAAO,CAAC,CAAC,EAAc,CAAC,aAAA,CAAY,CAAC,CAAC,EAAc,UAAU,CAAC,GAAG,AAAc,MAAd,GAAoB,AAAoB,MAApB,EAAa,KAAK,CAAO,CAAC,IAAI,EAAgB,GAAmB,EAAa,KAAK,CAAE,AAAiB,OAAjB,GAAwB,CAAA,EAAQ,YAAY,CAAC,CAAA,CAAiB,CAA+K,OAAO,CAAO,CAAA,EAAuG,GAA8oB,SAAQ,OAAO,EAAe,GAAG,CAAC,AAAA,GAAG,EAAE,OAAO,CAAC,CAAC,EAAgD,EAAU,QAAQ,CAAA,EAAknB,GAAU,CAAC,EAAK,KAAW,GAAG,OAAO,EAAK,IAAI,MAAO,AAAA,CAAA,EAAA,EAAA,MAAK,AAAL,EAAO,IAAI,CAAC,wCAAwC,KAAK,IAAI,EAAY,EAAK,EAAK,EAAY,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,EAAQ,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,EAAY,IAAI,MAAO,AAAA,CAAA,EAAA,EAAA,MAAK,AAAL,EAAO,IAAI,CAAC,iCAAiC,KAAK,GAAG,AAAA,CAAA,EAAA,EAAA,OAAI,AAAJ,EAAM,QAAQ,CAAC,KAAK,CAAC,GAAa,EAAE,MAAO,AAAA,CAAA,EAAA,EAAA,MAAK,AAAL,EAAO,IAAI,CAAC,uCAAuC,IAAK,QAAO,EAAY,KAAK,CAAC,QAAQ,CAAC,IAAK,CAAA,AAAA,CAAA,EAAA,EAAA,MAAK,AAAL,EAAO,IAAI,CAAC,yCAAyC,AAAyB,YAAzB,OAAO,EAAY,IAAI,EAAc,AAAwB,KAAxB,EAAY,IAAI,CAAC,IAAI,EAAQ,CAAA,EAAY,AAAA,CAAA,EAAA,EAAA,OAAK,AAAL,EAAM,aAAa,CAAC,EAAK,CAAC,GAAG,EAAY,KAAK,AAAA,EAAA,CAAC,EAAkD,EAA9C,AAAmC,YAAnC,OAAO,EAAY,KAAK,CAAC,QAAQ,CAAyB,EAAY,KAAK,CAAC,QAAQ,GAAe,EAAY,KAAK,CAAC,QAAQ,AAAC,CAAC,IAAI,EAAK,CAAC,GAAG,AAA4B,UAA5B,OAAO,EAAQ,WAAW,CAAW,CAAC,cAAc,CAAC,EAAE,YAAY,IAAI,EAAQ,WAAW,AAAA,EAAE,CAAC,YAAY,AAAA,GAAI,EAAG,IAAI,CAAC,WAAW,EAAG,CAAA,EAAG,IAAI,GAAG,OAAO,GAAG,CAAC,kBAAkB,WAAW,IAAA,GAAO,AAAA,CAAA,EAAA,EAAA,gBAAe,AAAf,EAAiB,EAAG,IAAI,CAAC,gBAAiB,CAAA,AAAe,aAAf,EAAG,IAAI,CAAC,IAAI,CAAc,EAAG,IAAI,CAAC,IAAI,CAAC,IAAA,GAAQ,CAAA,AAAgB,YAAhB,OAAO,EAAG,IAAI,CAAa,kBAAkB,IAAA,GAAQ,CAAA,EAAa,EAAG,IAAI,EAAE,EAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAA,GAAQ,CAAA,EAAO,EAAG,IAAI,EAAE,EAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAA,GAAO,EAAG,IAAI,AAAA,CAAC,CAAK,YAAY,CAAC,EAAM,IAAM,AAAQ,KAAK,IAAb,EAAgB,GAAG,CAAO,AAAA,EAAE,MAAO,AAAA,CAAA,EAAA,EAAA,OAAI,AAAJ,EAAM,QAAQ,CAAC,GAAG,CAAC,EAAK,AAAA,IAAI,IAAI,EAAM,AAAU,UAAV,OAAO,EAAY,EAAE,QAAQ,GAAG,EAAE,EAAQ,AAAA,CAAA,AAAiC,YAAjC,MAAO,CAAA,EAAA,EAAA,OAAuB,AAAvB,EAAqC,CAAA,EAAA,EAAA,OAAwB,AAAxB,EAAyB,AAAA,CAAA,EAAA,EAAA,OAAuB,AAAvB,EAAyB,OAAM,AAAN,EAAS,AAA7pD,SAAS,EAAyB,CAAI,EAAE,GAAG,AAAA,CAAA,EAAA,EAAA,cAAc,AAAd,EAAe,GAAM,CAAC,IAAI,EAAM,OAAO,IAAI,CAAC,EAAK,KAAK,EAAE,MAAM,CAAC,CAAC,EAAI,IAAO,CAAA,CAAG,CAAC,EAAI,CAAC,EAAyB,EAAK,KAAK,CAAC,EAAI,EAAE,CAAA,EAAK,CAAC,GAAG,MAAO,CAAC,GAAG,CAAI,CAAC,MAAA,EAAM,OAAO,IAAI,CAAC,CAAC,OAAO,MAAM,OAAO,CAAC,GAAM,EAAK,GAAG,CAAC,GAA0B,CAAI,EAA+5C,GAAO,GAAM,GAAG,EAAO,OAAO,CAAC,UAAU,GAAG,CAAC,IAAI,EAAQ,EAAO,KAAK,CAAC,qBAAsB,CAAA,GAAS,EAAQ,OAAO,CAAC,AAAA,IAAQ,EAAO,EAAO,OAAO,CAAC,EAAM,EAAM,OAAO,CAAC,UAAU,KAAM,EAAG,CAAC,OAAO,CAAM,GAAG,IAAI,CAAC,CAAC;AAC7ipB,CAAC,EAAE,OAAO,CAAC,oCAAoC,WAAW,EAAE,GAAY,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,eAAe,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,GAAc,AAAA,IAAU,IAAI,EAAa,GAAS,WAAW,MAAM,OAAO,EAAY,GAAS,WAAW,cAAc,OAAO,GAAc,OAAO,AAAA,EAAA,UAAU,CAAC,OAAO,EAAI,CAAA,CAAC,GAAa,GAAc,MAAM,GAAc,OAAO,AAAA,EAAA,UAAS,CAAE,IAAI,AAAJ,CAAI,EAAE,GAAM,AAAA,GAAM,EAAK,IAAI,EAAE,cAAc,oBAAoB,CAAC,CAAC,EAAK,KAAK,EAAE,QAAQ,GAAS,AAAA,IAAO,GAAG,CAAC,GAAM,GAAM,OAAO,EAAK,GAAG,CAAC,QAAA,CAAO,CAAC,aAAA,CAAY,CAAC,SAAA,CAAQ,CAAC,GAAG,EAAK,CAAC,EAAK,KAAK,CAAC,EAAY,EAAE,CAAC,OAAO,GAAW,CAAA,EAAa,AAAA,CAAA,MAAM,OAAO,CAAC,GAAU,EAAS,CAAC,EAAQ,AAAC,EAAE,GAAG,CAAC,GAAA,EAAW,AAAA,CAAA,EAAA,EAAA,aAAa,AAAb,EAAc,EAAa,KAAQ,EAAY,EAAE,GAAa,CAAC,EAAQ,KAAW,IAAI,EAAQ,AAAA,CAAA,EAAA,EAAA,MAAM,AAAN,EAAO,UAAU,GAAG,EAAK,GAAc,GAAS,EAAK,GAAG,AAAA,CAAA,EAAA,EAAA,SAAS,AAAT,EAAU,KAAK,GAAG,CAAC,EAAK,CAAC,GAAG,CAAC,GAAA,CAAE,CAAC,aAAA,CAAY,CAAC,CAAC,EAAQ,EAAQ,IAAI,CAAC,EAAA,gBAAe,CAAE,CAAC,GAAA,EAAG,OAAO,EAAK,KAAK,CAAY,EAAG,CAAC,GAAG,IAAI,EAAM,IAAU,GAAG,EAAK,OAAO,EAAM,IAAI,EAAQ,CAAC,GAAG,EAAW,CAAC,GAAG,GAAS,WAAW,KAAK,CAAC,CAAC,AAAA,EAAgJ,EAAS,GAA5B,GAAlH,GAAS,WAAW,MAAM,QAAQ,kBAAkB,EAAQ,eAAe,CAAC,EAAQ,IAAI,CAAC,GAAS,GAAgE,GAAS,OAAO,GAAW,CAAA,EAAK,CAAA,EAAU,CAAK,EAAM,GAAgB,CAAC,EAAQ,KAAe,IAAI,EAAS,EAAY,SAAS,CAAC,AAAA,GAAG,EAAE,UAAU,GAAG,IAAc,EAAoB,AAAW,KAAX,EAAc,EAAY,IAAI,EAAY,MAAM,CAAC,EAAS,MAAM,EAAY,CAAC,MAAO,AAAA,CAAA,EAAA,EAAA,oBAAoB,AAApB,EAAqB,EAAQ,EAAoB,EAAM,GAAW,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,gBAD60hB,AAAA,IAAY,GAAG,EAAU,CAAC,GAAG,CAAC,KAAA,CAAI,CAAC,CAAC,GAAa,GAAW,GAAG,EAAK,OAAO,EAAK,MAAM,CAAC,CAAC,EAAI,KAAO,GAAG,CAAC,KAAA,CAAI,CAAC,YAAA,CAAW,CAAC,KAAA,CAAI,CAAC,OAAA,CAAM,CAAC,aAAa,CAAc,CAAC,UAAA,CAAS,CAAC,SAAA,CAAQ,CAAC,CAAC,EAAI,OAAO,CAAG,CAAC,EAAK,CAAC,CAAC,KAAA,EAAK,YAAA,EAAY,KAAK,CAAC,SAAA,EAAS,GAAG,CAAM,AAAA,EAAE,MAAM,CAAC,KAAA,EAAK,UAAA,EAAU,aAAa,CAAc,CAAC,EAAE,CAAG,EAAE,CAAC,EAAE,CAAC,OAAO,IAAI,EAC1niB,4BAAA,EAAA,2BAA0B,AAAC,CAAC,EAAE,GAAW,CAAC,GAAa,CAAC,GAAkB,CAAC,EAAA,eAAc,CAAE,A,E,C,wB,Q,a,Q,Y,Q,U,Q,Y,Q,M,Q,Y,Q,a,Q,0B,Q,uB,Q,qB,Q,8B,Q,M,Q,yB,Q,2B,Q,iD,O,E,C,M,C,S,C,C,C,C,C,ECVnoD,IAAI,EAAU,EAAQ,mBAKtB,CAAA,EAAO,OAAO,CAAG,EAAQ,oBAA6B,EAAQ,SAAS,CAD7C,CAAA,E,E,C,mB,Q,iB,O,E,C,M,C,S,C,C,C,C,C,ECP1B,EAAO,OAAO,CAAG,EAAQ,mB,E,C,mB,O,E,C,M,C,S,C,C,C,C,C,GCSxB,AAAA,WAKH,IAAI,EAAY,AAAkB,YAAlB,OAAO,QAAyB,OAAO,GAAG,CACtD,EAAqB,EAAY,OAAO,GAAG,CAAC,iBAAmB,MAC/D,EAAoB,EAAY,OAAO,GAAG,CAAC,gBAAkB,MAC7D,EAAsB,EAAY,OAAO,GAAG,CAAC,kBAAoB,MACjE,EAAyB,EAAY,OAAO,GAAG,CAAC,qBAAuB,MACvE,EAAsB,EAAY,OAAO,GAAG,CAAC,kBAAoB,MACjE,EAAsB,EAAY,OAAO,GAAG,CAAC,kBAAoB,MACjE,EAAqB,EAAY,OAAO,GAAG,CAAC,iBAAmB,MAG/D,EAAwB,EAAY,OAAO,GAAG,CAAC,oBAAsB,MACrE,EAA6B,EAAY,OAAO,GAAG,CAAC,yBAA2B,MAC/E,EAAyB,EAAY,OAAO,GAAG,CAAC,qBAAuB,MACvE,EAAsB,EAAY,OAAO,GAAG,CAAC,kBAAoB,MACjE,EAA2B,EAAY,OAAO,GAAG,CAAC,uBAAyB,MAC3E,EAAkB,EAAY,OAAO,GAAG,CAAC,cAAgB,MACzD,EAAkB,EAAY,OAAO,GAAG,CAAC,cAAgB,MACzD,EAAmB,EAAY,OAAO,GAAG,CAAC,eAAiB,MAC3D,EAAyB,EAAY,OAAO,GAAG,CAAC,qBAAuB,MACvE,EAAuB,EAAY,OAAO,GAAG,CAAC,mBAAqB,MACnE,EAAmB,EAAY,OAAO,GAAG,CAAC,eAAiB,MAO/D,SAAS,EAAO,CAAM,EACpB,GAAI,AAAkB,UAAlB,OAAO,GAAuB,AAAW,OAAX,EAAiB,CACjD,IAAI,EAAW,EAAO,QAAQ,CAE9B,OAAQ,GACN,KAAK,EACH,IAAI,EAAO,EAAO,IAAI,CAEtB,OAAQ,GACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACH,OAAO,CAET,SACE,IAAI,EAAe,GAAQ,EAAK,QAAQ,CAExC,OAAQ,GACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACH,OAAO,CAET,SACE,OAAO,CACX,CAEJ,CAEF,KAAK,EACH,OAAO,CACX,CACF,CAGF,CAeA,IAAI,EAAsC,CAAA,EAa1C,SAAS,EAAiB,CAAM,EAC9B,OAAO,EAAO,KAAY,CAC5B,CAmCA,EAAQ,SAAS,CA/DD,EAgEhB,EAAQ,cAAc,CA/DD,EAgErB,EAAQ,eAAe,CA/DD,EAgEtB,EAAQ,eAAe,CA/DD,EAgEtB,EAAQ,OAAO,CA/DD,EAgEd,EAAQ,UAAU,CA/DD,EAgEjB,EAAQ,QAAQ,CA/DD,EAgEf,EAAQ,IAAI,CA/DD,EAgEX,EAAQ,IAAI,CA/DD,EAgEX,EAAQ,MAAM,CA/DD,EAgEb,EAAQ,QAAQ,CA/DD,EAgEf,EAAQ,UAAU,CA/DD,EAgEjB,EAAQ,QAAQ,CA/DD,EAgEf,EAAQ,WAAW,CA7DnB,SAAqB,CAAM,EASzB,OAPO,IACH,EAAsC,CAAA,EAEtC,QAAQ,IAAO,CAAC,kLAIb,EAAiB,IAAW,EAAO,KAAY,CACxD,EAoDA,EAAQ,gBAAgB,CAAG,EAC3B,EAAQ,iBAAiB,CAjDzB,SAA2B,CAAM,EAC/B,OAAO,EAAO,KAAY,CAC5B,EAgDA,EAAQ,iBAAiB,CA/CzB,SAA2B,CAAM,EAC/B,OAAO,EAAO,KAAY,CAC5B,EA8CA,EAAQ,SAAS,CA7CjB,SAAmB,CAAM,EACvB,MAAO,AAAkB,UAAlB,OAAO,GAAuB,AAAW,OAAX,GAAmB,EAAO,QAAQ,GAAK,CAC9E,EA4CA,EAAQ,YAAY,CA3CpB,SAAsB,CAAM,EAC1B,OAAO,EAAO,KAAY,CAC5B,EA0CA,EAAQ,UAAU,CAzClB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EAwCA,EAAQ,MAAM,CAvCd,SAAgB,CAAM,EACpB,OAAO,EAAO,KAAY,CAC5B,EAsCA,EAAQ,MAAM,CArCd,SAAgB,CAAM,EACpB,OAAO,EAAO,KAAY,CAC5B,EAoCA,EAAQ,QAAQ,CAnChB,SAAkB,CAAM,EACtB,OAAO,EAAO,KAAY,CAC5B,EAkCA,EAAQ,UAAU,CAjClB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EAgCA,EAAQ,YAAY,CA/BpB,SAAsB,CAAM,EAC1B,OAAO,EAAO,KAAY,CAC5B,EA8BA,EAAQ,UAAU,CA7BlB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EA4BA,EAAQ,kBAAkB,CAxI1B,SAA4B,CAAI,EAC9B,MAAO,AAAgB,UAAhB,OAAO,GAAqB,AAAgB,YAAhB,OAAO,GAC1C,IAAS,GAAuB,IAAS,GAA8B,IAAS,GAAuB,IAAS,GAA0B,IAAS,GAAuB,IAAS,GAA4B,AAAgB,UAAhB,OAAO,GAAqB,AAAS,OAAT,GAAkB,CAAA,EAAK,QAAQ,GAAK,GAAmB,EAAK,QAAQ,GAAK,GAAmB,EAAK,QAAQ,GAAK,GAAuB,EAAK,QAAQ,GAAK,GAAsB,EAAK,QAAQ,GAAK,GAA0B,EAAK,QAAQ,GAAK,GAA0B,EAAK,QAAQ,GAAK,GAAwB,EAAK,QAAQ,GAAK,GAAoB,EAAK,QAAQ,GAAK,CAAA,CACplB,EAsIA,EAAQ,MAAM,CAAG,CACf,G,E,C,E,C,M,C,S,C,C,C,C,C,EC1KF,IAAI,EAAU,EAAQ,oBAClB,EAAS,EAAQ,oBAEjB,EAAuB,EAAQ,oBAC/B,EAAM,EAAQ,mBACd,EAAiB,EAAQ,oBAEzB,EAAe,WAAY,EAiB/B,SAAS,IACP,OAAO,IACT,CAhBE,EAAe,SAAS,CAAI,EAC1B,IAAI,EAAU,YAAc,CACL,CAAA,aAAnB,OAAO,SACT,QAAQ,KAAK,CAAC,GAEhB,GAAI,CAIF,MAAM,AAAI,MAAM,EAClB,CAAE,MAAO,EAAG,CAAC,CACf,EAOF,EAAO,OAAO,CAAG,SAAS,CAAc,CAAE,CAAmB,EAE3D,IAAI,EAAkB,AAAkB,YAAlB,OAAO,QAAyB,OAAO,QAAQ,CAuEjE,EAAY,gBAIZ,EAAiB,CACnB,MAAO,EAA2B,SAClC,OAAQ,EAA2B,UACnC,KAAM,EAA2B,WACjC,KAAM,EAA2B,YACjC,OAAQ,EAA2B,UACnC,OAAQ,EAA2B,UACnC,OAAQ,EAA2B,UACnC,OAAQ,EAA2B,UAEnC,IA6HO,EAA2B,GA5HlC,QA+HF,SAAkC,CAAW,EAkB3C,OAAO,EAjBP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,GAAI,AAAuB,YAAvB,OAAO,EACT,OAAO,IAAI,EAAc,aAAe,EAAe,mBAAqB,EAAgB,mDAE9F,IAAI,EAAY,CAAK,CAAC,EAAS,CAC/B,GAAI,CAAC,MAAM,OAAO,CAAC,GAEjB,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IADxE,EAAY,EACkE,EAAW,kBAAoB,EAAgB,yBAE9I,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,MAAM,CAAE,IAAK,CACzC,IAAI,EAAQ,EAAY,EAAW,EAAG,EAAe,EAAU,EAAe,IAAM,EAAI,IAAK,GAC7F,GAAI,aAAiB,MACnB,OAAO,CAEX,CACA,OAAO,IACT,EAEF,EAjJE,QA4JO,EARP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,IAAI,EAAY,CAAK,CAAC,EAAS,QAC/B,AAAK,EAAe,GAIb,KAFE,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IADxE,EAAY,EACkE,EAAW,kBAAoB,EAAgB,qCAGhJ,GA1JA,YAuKO,EARP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,IAAI,EAAY,CAAK,CAAC,EAAS,QAC/B,AAAK,EAAQ,kBAAkB,CAAC,GAIzB,KAFE,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IADxE,EAAY,EACkE,EAAW,kBAAoB,EAAgB,0CAGhJ,GArKA,WAyKF,SAAmC,CAAa,EAS9C,OAAO,EARP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,GAAI,CAAE,CAAA,CAAK,CAAC,EAAS,WAAY,CAAA,EAAgB,CAC/C,IAySgB,EAzSZ,EAAoB,EAAc,IAAI,EAAI,EAE9C,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IAwS3F,CAAA,AAAI,AAAC,CADe,EAxSmB,CAAK,CAAC,EAAS,EAySvC,WAAW,EAAK,EAAU,WAAW,CAAC,IAAI,CAGlD,EAAU,WAAW,CAAC,IAAI,CAFxB,CADT,CAxSiG,EAAkB,kBAAoB,EAA1G,4BAA+J,EAAoB,KAC9M,CACA,OAAO,IACT,EAEF,EAlLE,KAwRO,EANP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,QACtE,AAAI,CAAC,AAqET,SAAS,EAAO,CAAS,EACvB,OAAQ,OAAO,GACb,IAAK,SACL,IAAK,SACL,IAAK,YACH,MAAO,CAAA,CACT,KAAK,UACH,MAAO,CAAC,CACV,KAAK,SACH,GAAI,MAAM,OAAO,CAAC,GAChB,OAAO,EAAU,KAAK,CAAC,GAEzB,GAAI,AAAc,OAAd,GAAsB,EAAe,GACvC,MAAO,CAAA,EAGT,IAAI,EAAa,AAjbvB,SAAuB,CAAa,EAClC,IAAI,EAAa,GAAkB,CAAA,GAAmB,CAAa,CAAC,EAAgB,EAAI,CAAa,CAjB5E,aAiBiG,AAApB,EACtG,GAAI,AAAsB,YAAtB,OAAO,EACT,OAAO,CAEX,EA4aqC,GAC/B,IAAI,EAqBF,MAAO,CAAA,EApBP,IACI,EADA,EAAW,EAAW,IAAI,CAAC,GAE/B,GAAI,IAAe,EAAU,OAAO,CAClC,CAAA,KAAO,CAAE,AAAA,CAAA,EAAO,EAAS,IAAI,EAAA,EAAI,IAAI,EACnC,GAAI,CAAC,EAAO,EAAK,KAAK,EACpB,MAAO,CAAA,CAEX,MAGA,KAAO,CAAE,AAAA,CAAA,EAAO,EAAS,IAAI,EAAA,EAAI,IAAI,EAAE,CACrC,IAAI,EAAQ,EAAK,KAAK,CACtB,GAAI,GACE,CAAC,EAAO,CAAK,CAAC,EAAE,EAClB,MAAO,CAAA,CAGb,CAMJ,MAAO,CAAA,CACT,SACE,MAAO,CAAA,CACX,CACF,EAlHgB,CAAK,CAAC,EAAS,EAClB,IAAI,EAAc,WAAa,EAAW,KAAO,EAA/B,kBAAwE,EAAgB,4BAE5G,IACT,GAtRA,SAsNF,SAAmC,CAAW,EAoB5C,OAAO,EAnBP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,GAAI,AAAuB,YAAvB,OAAO,EACT,OAAO,IAAI,EAAc,aAAe,EAAe,mBAAqB,EAAgB,oDAE9F,IAAI,EAAY,CAAK,CAAC,EAAS,CAC3B,EAAW,EAAY,GAC3B,GAAI,AAAa,WAAb,EACF,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IAAM,CAAA,EAAW,kBAAoB,EAAgB,0BAE9I,IAAK,IAAI,KAAO,EACd,GAAI,EAAI,EAAW,GAAM,CACvB,IAAI,EAAQ,EAAY,EAAW,EAAK,EAAe,EAAU,EAAe,IAAM,EAAK,GAC3F,GAAI,aAAiB,MACnB,OAAO,CAEX,CAEF,OAAO,IACT,EAEF,EA1OE,MAkLF,SAA+B,CAAc,SAC3C,AAAK,MAAM,OAAO,CAAC,GA+BZ,EAjBP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EAEtE,IAAK,IAxLM,EAuLP,EAAY,CAAK,CAAC,EAAS,CACtB,EAAI,EAAG,EAAI,EAAe,MAAM,CAAE,IACzC,GAvLJ,AAAI,AAuLO,KAzLE,EAyLS,CAAc,CAAC,EAAE,EApL9B,AAAM,IAoLJ,GApLS,EAoLT,GApLmB,EAAI,EAGzB,AAiLE,GAAA,GAjLS,GAAM,EAkLpB,OAAO,KAHX,IAOI,EAAe,KAAK,SAAS,CAAC,EAAgB,SAAkB,CAAG,CAAE,CAAK,QAE5E,AAAI,AAAS,WADF,EAAe,GAEjB,OAAO,GAET,CACT,GACA,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,eAAiB,OAAO,GAAa,KAAQ,CAAA,gBAAkB,CAAA,EAAgB,sBAAwB,EAAe,IAC/L,IA5BQ,UAAU,MAAM,CAAG,EACrB,EACE,+DAAiE,UAAU,MAAM,CAAjF,wFAIF,EAAa,0DAGV,EAqBX,EAlNE,UA2OF,SAAgC,CAAmB,EACjD,GAAI,CAAC,MAAM,OAAO,CAAC,GAEjB,OADwC,EAAa,0EAC9C,EAGT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAoB,MAAM,CAAE,IAAK,CACnD,IAAI,EAAU,CAAmB,CAAC,EAAE,CACpC,GAAI,AAAmB,YAAnB,OAAO,EAKT,OAJA,EACE,8FACc,AA2MtB,SAAkC,CAAK,EACrC,IAAI,EAAO,EAAe,GAC1B,OAAQ,GACN,IAAK,QACL,IAAK,SACH,MAAO,MAAQ,CACjB,KAAK,UACL,IAAK,OACL,IAAK,SACH,MAAO,KAAO,CAChB,SACE,OAAO,CACX,CACF,EAxN+C,GAAW,aAAe,EAAI,KAEhE,CAEX,CAiBA,OAAO,EAfP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EAEtE,IAAK,IADD,EAAgB,EAAE,CACb,EAAI,EAAG,EAAI,EAAoB,MAAM,CAAE,IAAK,CAEnD,IAAI,EAAgB,AADN,CAAA,EAAA,CAAmB,CAAC,EAAE,AAAF,EACN,EAAO,EAAU,EAAe,EAAU,EAAc,GACpF,GAAI,AAAiB,MAAjB,EACF,OAAO,IAEL,CAAA,EAAc,IAAI,EAAI,EAAI,EAAc,IAAI,CAAE,iBAChD,EAAc,IAAI,CAAC,EAAc,IAAI,CAAC,YAAY,CAEtD,CAEA,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,iBAAoB,CAAA,IAAM,CAAA,EAAgB,IADrF,CAAA,EAAc,MAAM,CAAG,EAAK,2BAA6B,EAAc,IAAI,CAAC,MAAQ,IAAK,EAArH,EAC8I,IAChJ,EAEF,EA3QE,MA8RF,SAAgC,CAAU,EAmBxC,OAAO,EAlBP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,IAAI,EAAY,CAAK,CAAC,EAAS,CAC3B,EAAW,EAAY,GAC3B,GAAI,AAAa,WAAb,EACF,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,cAAgB,EAA9D,kBAAmG,EAAgB,yBAE9I,IAAK,IAAI,KAAO,EAAY,CAC1B,IAAI,EAAU,CAAU,CAAC,EAAI,CAC7B,GAAI,AAAmB,YAAnB,OAAO,EACT,OAAO,EAAsB,EAAe,EAAU,EAAc,EAAK,EAAe,IAE1F,IAAI,EAAQ,EAAQ,EAAW,EAAK,EAAe,EAAU,EAAe,IAAM,EAAK,GACvF,GAAI,EACF,OAAO,CAEX,CACA,OAAO,IACT,EAEF,EAjTE,MAmTF,SAAsC,CAAU,EA6B9C,OAAO,EA5BP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,EACtE,IAAI,EAAY,CAAK,CAAC,EAAS,CAC3B,EAAW,EAAY,GAC3B,GAAI,AAAa,WAAb,EACF,OAAO,IAAI,EAAc,WAAa,EAAW,KAAO,EAAe,cAAgB,EAA9D,kBAAmG,EAAgB,yBAG9I,IAAI,EAAU,EAAO,CAAC,EAAG,CAAK,CAAC,EAAS,CAAE,GAC1C,IAAK,IAAI,KAAO,EAAS,CACvB,IAAI,EAAU,CAAU,CAAC,EAAI,CAC7B,GAAI,EAAI,EAAY,IAAQ,AAAmB,YAAnB,OAAO,EACjC,OAAO,EAAsB,EAAe,EAAU,EAAc,EAAK,EAAe,IAE1F,GAAI,CAAC,EACH,OAAO,IAAI,EACT,WAAa,EAAW,KAAO,EAAe,UAAY,EAAM,kBAAoB,EAApF,mBACmB,KAAK,SAAS,CAAC,CAAK,CAAC,EAAS,CAAE,KAAM,MACzD,iBAAmB,KAAK,SAAS,CAAC,OAAO,IAAI,CAAC,GAAa,KAAM,OAGrE,IAAI,EAAQ,EAAQ,EAAW,EAAK,EAAe,EAAU,EAAe,IAAM,EAAK,GACvF,GAAI,EACF,OAAO,CAEX,CACA,OAAO,IACT,EAGF,CAhVA,EA2BA,SAAS,EAAc,CAAO,CAAE,CAAI,EAClC,IAAI,CAAC,OAAO,CAAG,EACf,IAAI,CAAC,IAAI,CAAG,GAAQ,AAAgB,UAAhB,OAAO,EAAoB,EAAM,CAAC,EACtD,IAAI,CAAC,KAAK,CAAG,EACf,CAIA,SAAS,EAA2B,CAAQ,EAExC,IAAI,EAA0B,CAAC,EAC3B,EAA6B,EAEnC,SAAS,EAAU,CAAU,CAAE,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,CAAE,CAAM,EAI3F,GAHA,EAAgB,GAAiB,EACjC,EAAe,GAAgB,EAE3B,IAAW,EAAsB,CACnC,GAAI,EAAqB,CAEvB,IAAI,EAAM,AAAI,MACZ,oLAKF,OADA,EAAI,IAAI,CAAG,sBACL,CACR,CAAO,GAA6C,AAAmB,aAAnB,OAAO,QAAyB,CAElF,IAAI,EAAW,EAAgB,IAAM,CAEnC,EAAC,CAAuB,CAAC,EAAS,EAElC,EAA6B,IAE7B,EACE,2EACuB,EAAe,cAAgB,EADtD,wNAMF,CAAuB,CAAC,EAAS,CAAG,CAAA,EACpC,IAEJ,CACF,QACA,AAAI,AAAmB,MAAnB,CAAK,CAAC,EAAS,CASV,EAAS,EAAO,EAAU,EAAe,EAAU,GARtD,MAEW,EADT,AAAoB,OAApB,CAAK,CAAC,EAAS,CACQ,OAAS,EAAW,KAAO,EAA3B,+BAAiF,EAAgB,8BAEnG,OAAS,EAAW,KAAO,EAA3B,+BAAiF,EAAgB,oCAErH,IAIX,CAEA,IAAI,EAAmB,EAAU,IAAI,CAAC,KAAM,CAAA,GAG5C,OAFA,EAAiB,UAAU,CAAG,EAAU,IAAI,CAAC,KAAM,CAAA,GAE5C,CACT,CAEA,SAAS,EAA2B,CAAY,EAiB9C,OAAO,EAhBP,SAAkB,CAAK,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAY,CAAE,CAAM,EAC9E,IAAI,EAAY,CAAK,CAAC,EAAS,QAE/B,AAAI,AADW,EAAY,KACV,EAMR,IAAI,EACT,WAAa,EAAW,KAAO,EAAe,aAAgB,CAAA,IAH9C,EAAe,EAGqC,EAAc,kBAAoB,EAAtG,gBAA+I,EAAe,KAC9J,CAAC,aAAc,CAAY,GAGxB,IACT,EAEF,CAsKA,SAAS,EAAsB,CAAa,CAAE,CAAQ,CAAE,CAAY,CAAE,CAAG,CAAE,CAAI,EAC7E,OAAO,IAAI,EACR,AAAA,CAAA,GAAiB,aAAA,EAAiB,KAAO,EAAW,UAAY,EAAe,IAAM,EAArF,6FACgF,EAAO,KAE5F,CAgIA,SAAS,EAAY,CAAS,EAC5B,IAAI,EAAW,OAAO,SACtB,AAAI,MAAM,OAAO,CAAC,GACT,QAEL,aAAqB,OAIhB,SAET,AAlCA,AAAiB,WAkCJ,GAAU,IAxBY,WAA/B,AAwBmB,CAxBV,CAAC,gBAAgB,EAK1B,AAAkB,YAAlB,OAAO,QAAyB,AAmBb,aAnBkC,QAoBhD,SAEF,CACT,CAIA,SAAS,EAAe,CAAS,EAC/B,GAAI,MAAO,EACT,MAAO,GAAK,EAEd,IAAI,EAAW,EAAY,GAC3B,GAAI,AAAa,WAAb,EAAuB,CACzB,GAAI,aAAqB,KACvB,MAAO,OACF,GAAI,aAAqB,OAC9B,MAAO,QAEX,CACA,OAAO,CACT,CA+BA,OAxbA,EAAc,SAAS,CAAG,MAAM,SAAS,CAobzC,EAAe,cAAc,CAAG,EAChC,EAAe,iBAAiB,CAAG,EAAe,iBAAiB,CACnE,EAAe,SAAS,CAAG,EAEpB,CACT,C,E,C,iB,Q,iB,Q,mB,Q,kB,Q,iB,O,E,C,M,C,S,C,C,C,C,C,ECzlBA,IAAI,EAAwB,OAAO,qBAAqB,CACpD,EAAiB,OAAO,SAAS,CAAC,cAAc,CAChD,EAAmB,OAAO,SAAS,CAAC,oBAAoB,AAsD5D,CAAA,EAAO,OAAO,CAAG,CAAA,AA5CjB,WACC,GAAI,CACH,GAAI,CAAC,OAAO,MAAM,CACjB,MAAO,CAAA,EAMR,IAAI,EAAQ,IAAI,OAAO,OAEvB,GADA,CAAK,CAAC,EAAE,CAAG,KACP,AAAyC,MAAzC,OAAO,mBAAmB,CAAC,EAAM,CAAC,EAAE,CACvC,MAAO,CAAA,EAKR,IAAK,IADD,EAAQ,CAAC,EACJ,EAAI,EAAG,EAAI,GAAI,IACvB,CAAK,CAAC,IAAM,OAAO,YAAY,CAAC,GAAG,CAAG,EAFvC,IAII,EAAS,OAAO,mBAAmB,CAAC,GAAO,GAAG,CAAC,SAAU,CAAC,EAC7D,OAAO,CAAK,CAAC,EAAE,AAChB,GACA,GAAI,AAAoB,eAApB,EAAO,IAAI,CAAC,IACf,MAAO,CAAA,EAIR,IAAI,EAAQ,CAAC,EAIb,GAHA,uBAAuB,KAAK,CAAC,IAAI,OAAO,CAAC,SAAU,CAAM,EACxD,CAAK,CAAC,EAAO,CAAG,CACjB,GACI,AACF,yBADE,OAAO,IAAI,CAAC,OAAO,MAAM,CAAC,CAAC,EAAG,IAAQ,IAAI,CAAC,IAE9C,MAAO,CAAA,EAGR,MAAO,CAAA,CACR,CAAE,MAAO,EAAK,CAEb,MAAO,CAAA,CACR,CACD,IAEqD,SAAU,CAAM,CAAE,CAAM,EAK5E,IAAK,IAJD,EAEA,EADA,EAAK,AAtDV,SAAkB,CAAG,EACpB,GAAI,MAAA,EACH,MAAM,AAAI,UAAU,yDAGrB,OAAO,OAAO,EACf,EAgDmB,GAGT,EAAI,EAAG,EAAI,UAAU,MAAM,CAAE,IAAK,CAG1C,IAAK,IAAI,KAFT,EAAO,OAAO,SAAS,CAAC,EAAE,EAGrB,EAAe,IAAI,CAAC,EAAM,IAC7B,CAAA,CAAE,CAAC,EAAI,CAAG,CAAI,CAAC,EAAI,AAAJ,EAIjB,GAAI,EAAuB,CAC1B,EAAU,EAAsB,GAChC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,MAAM,CAAE,IAC/B,EAAiB,IAAI,CAAC,EAAM,CAAO,CAAC,EAAE,GACzC,CAAA,CAAE,CAAC,CAAO,CAAC,EAAE,CAAC,CAAG,CAAI,CAAC,CAAO,CAAC,EAAE,CAAC,AAAD,CAGnC,CACD,CAEA,OAAO,CACR,EAzBqC,OAAO,MAAM,A,E,C,E,C,Q,C,S,C,C,C,C,C,ECrDlD,EAAO,OAAO,CAFa,8C,E,C,E,C,Q,C,S,C,C,C,C,C,ECT3B,EAAO,OAAO,CAAG,SAAS,IAAI,CAAC,IAAI,CAAC,OAAO,SAAS,CAAC,cAAc,C,E,C,E,C,M,C,S,C,C,C,C,C,ECSnE,IAAI,EAAe,WAAY,EAGzB,EAAuB,EAAQ,oBAC/B,EAAqB,CAAC,EACtB,EAAM,EAAQ,oBA2BpB,SAAS,EAAe,CAAS,CAAE,CAAM,CAAE,CAAQ,CAAE,CAAa,CAAE,CAAQ,EAExE,IAAK,IAAI,KAAgB,EACvB,GAAI,EAAI,EAAW,GAAe,CAChC,IAAI,EAIJ,GAAI,CAGF,GAAI,AAAmC,YAAnC,OAAO,CAAS,CAAC,EAAa,CAAiB,CACjD,IAAI,EAAM,MACP,AAAA,CAAA,GAAiB,aAAA,EAAiB,KAAO,EAAW,UAAY,EAAhE,6FACgF,OAAO,CAAS,CAAC,EAAa,CAD9G,kGAKH,OADA,EAAI,IAAI,CAAG,sBACL,CACR,CACA,EAAQ,CAAS,CAAC,EAAa,CAAC,EAAQ,EAAc,EAAe,EAAU,KAAM,EACvF,CAAE,MAAO,EAAI,CACX,EAAQ,CACV,CAWA,IAVI,GAAW,aAAiB,OAC9B,EACG,AAAA,CAAA,GAAiB,aAAA,EAAiB,2BACnC,EAAW,KAAO,EADjB,2FAE6D,OAAO,EAFpE,kKAQD,aAAiB,OAAS,CAAE,CAAA,EAAM,OAAO,IAAI,CAAA,EAAqB,CAGpE,CAAkB,CAAC,EAAM,OAAO,CAAC,CAAG,CAAA,EAEpC,IAAI,EAAQ,EAAW,IAAa,GAEpC,EACE,UAAY,EAAW,UAAY,EAAM,OAAO,CAAI,CAAA,AAAS,MAAT,EAAgB,EAAQ,EAAA,EAEhF,CACF,CAGN,CAzEE,EAAe,SAAS,CAAI,EAC1B,IAAI,EAAU,YAAc,CACL,CAAA,aAAnB,OAAO,SACT,QAAQ,KAAK,CAAC,GAEhB,GAAI,CAIF,MAAM,AAAI,MAAM,EAClB,CAAE,MAAO,EAAG,CAAO,CACrB,EAqEF,EAAe,iBAAiB,CAAG,WAE/B,EAAqB,CAAC,CAE1B,EAEA,EAAO,OAAO,CAAG,C,E,C,mB,Q,mB,O,E,C,M,C,S,C,C,C,C,C,ECrGjB,EAAO,OAAO,CAAG,EAAQ,mB,E,C,mB,O,E,C,M,C,S,C,C,C,C,C,ECDzB,EAAO,OAAO,CAAG,KAAK,KAAK,CAAC,21B,E,C,E,C,M,C,S,C,C,C,C,C,E,I,E,S,C,E,ECqC3B,AAAA,eAGO,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAaJ,SAAS,EAAY,CAAI,EACrB,OAAO,EAAc,SAAS,CAAC,cAAc,CAAC,EAAK,IAAI,CAC3D,CA8FA,SAAS,IAEL,MAAO,CACH,OAAQ,KACR,KAAM,KACN,MAAO,KACP,QAAS,CAAA,EACT,OAAQ,CACJ,OAAQ,CACJ,MAAO,OACP,KAAM,EACN,uBAAwB,CAAA,CAC5B,EACA,QAAS,KACT,MAAO,IACP,KAAM,CAAA,EACN,SAAU,CAAA,EACV,YAAa,CAAA,EACb,OAAQ,SACR,WAAY,CAAA,EACZ,QAAS,CAAA,EACT,YAAa,CAAA,EACb,WAAY,CAAA,EACZ,kBAAmB,CAAA,EACnB,mBAAoB,CAAA,CACxB,EACA,IAAK,CACD,4CAA6C,CAAA,EAC7C,kBAAmB,CAAA,CACvB,EACA,UAAW,KACX,cAAe,KACf,kBAAmB,CAAA,EACnB,UAAW,CAAA,EACX,IAAK,CAAA,EACL,SAAU,KACV,WAAY,IAChB,CACJ,CAEA,SAAS,EAAa,CAAG,CAAE,CAAG,EAC1B,IAAI,EAAS,GAEb,IAAK,GAAO,EAAG,EAAM,EAAG,KAAS,EAAG,GAAO,EAC7B,EAAN,GACA,CAAA,GAAU,CAFlB,EAMA,OAAO,CACX,CAMA,SAAS,EAAuB,CAAG,EAC/B,IAAI,EAAM,EAAI,MAAM,CACpB,OAAO,GAAO,EAAQ,IAAI,CAAC,gBAAgB,CAAC,EAAI,UAAU,CAAC,EAAM,GACrE,CAEA,SAAS,EAAM,CAAM,CAAE,CAAQ,EAC3B,IAAI,EACJ,IAAK,KAAO,EACJ,EAAS,cAAc,CAAC,IACxB,CAAA,CAAM,CAAC,EAAI,CAAG,CAAQ,CAAC,EAAI,AAAJ,EAG/B,OAAO,CACX,CAEA,SAAS,EAAa,CAAM,CAAE,CAAQ,EAClC,IAAI,EAAK,EAET,SAAS,EAAa,CAAM,EACxB,MAAO,AAAkB,UAAlB,OAAO,GAAuB,aAAkB,QAAU,CAAE,CAAA,aAAkB,MAAA,CACzF,CAEA,IAAK,KAAO,EACJ,EAAS,cAAc,CAAC,KAEpB,EADJ,EAAM,CAAQ,CAAC,EAAI,EAEX,EAAa,CAAM,CAAC,EAAI,EACxB,EAAa,CAAM,CAAC,EAAI,CAAE,GAE1B,CAAM,CAAC,EAAI,CAAG,EAAa,CAAC,EAAG,GAGnC,CAAM,CAAC,EAAI,CAAG,GAI1B,OAAO,CACX,CA4DA,SAAS,EAAsB,CAAE,CAAE,CAAmB,QAElD,AAAK,AAAA,CAAA,AAAK,GAAL,CAAK,GAAQ,KACP,AAAC,CAAA,EAAsB,IAAM,KAAA,EAAW,CAAA,AAAO,OAAP,EAAiB,OAAS,MAAA,EAClE,AAAO,KAAP,GAAa,AAAO,KAAP,EACZ,AAAA,CAAA,EAAsB,GAAK,IAAA,EAAU,CAAA,AAAO,KAAP,EAAa,IAAM,GAAA,EAE7D,OAAO,YAAY,CAAC,EAC/B,CAmLA,SAAS,EAAuB,CAAS,CAAE,CAAI,EAC3C,GAAI,CAAC,SAID,AAAI,MAAM,OAAO,CAAC,GACP,AAlBnB,SAAS,EAAgB,CAAG,EACxB,IAAI,EAAG,EAAI,EAAM,EAAS,GAC1B,IAAK,EAAI,EAAG,EAAK,EAAI,MAAM,CAAE,EAAI,EAAI,EAAE,EAEnC,GAAU,MAAM,OAAO,CADvB,EAAO,CAAG,CAAC,EAAE,EACmB,EAAgB,GAAQ,EAE5D,OAAO,CACX,EAWmC,GAEhB,EAGf,GAAI,AAAQ,MAAR,EAAc,CACd,GAAI,aAAqB,EACrB,OAAO,EAEP,EAAO,CAAC,CAEhB,QACA,AAAI,AAAY,MAAZ,EAAK,GAAG,CACD,IAAI,EAAW,KAAM,KAAM,EAAW,EAAW,EAAK,IAAI,EAAI,MAElE,IAAI,EAAW,EAAK,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,EAAK,GAAG,CAAC,KAAK,CAAC,MAAM,CAAG,AAAc,CAAA,IAAd,EAAqB,EAAK,GAAG,CAAC,MAAM,EAAI,KAAO,EAAY,EAAW,EAAK,IAAI,EAAI,KAC1J,CAEA,SAAS,IACL,OAAQ,GAAiB,GAC7B,CAEA,SAAS,EAAK,CAAI,CAAE,CAAK,EACrB,IAAI,EACA,EACA,EACA,SAGJ,AAAI,AAAsB,IAAtB,AADJ,CAAA,EAAa,EAAuB,GAAM,QAAQ,EAAlD,EACe,MAAM,CACV,CAAC,EAAM,CAId,AAAuB,IAAvB,AADJ,CAAA,EAAc,EAAuB,GAAO,QAAQ,EAApD,EACgB,MAAM,CACX,CAAC,EAAK,EAGjB,EAAe,EAAW,UAAU,CAAC,EAAW,MAAM,CAAG,GACzD,EAAgB,EAAY,UAAU,CAAC,GAElC,AAAA,CAAA,AAAiB,KAAjB,GAAkC,AAAiB,KAAjB,CAAiB,GAAkB,IAAiB,GACvF,EAAQ,IAAI,CAAC,mBAAmB,CAAC,IAAiB,EAAQ,IAAI,CAAC,mBAAmB,CAAC,IACnF,AAAiB,KAAjB,GAAkC,AAAkB,MAAlB,GAC3B,CAAC,EAAM,IAAgB,EAAM,CAC7B,EAAQ,IAAI,CAAC,YAAY,CAAC,IAAiB,EAAQ,IAAI,CAAC,gBAAgB,CAAC,IAC5E,EAAQ,IAAI,CAAC,YAAY,CAAC,IAAkB,EAAQ,IAAI,CAAC,gBAAgB,CAAC,GACvE,CAAC,EAAM,EAAM,CAEjB,CAAC,EAAM,EAAO,EAAM,AAC/B,CAEA,SAAS,EAAU,CAAI,EACnB,MAAO,CAAC,EAAM,EAAK,AACvB,CAEA,SAAS,EAAW,CAAE,EAClB,IAAI,EACJ,EAAe,EAEf,EADA,GAAQ,GAER,EAAO,CACX,CAgEA,SAAS,EAAgB,CAAO,CAAE,CAAW,EACzC,GAAI,AAAiB,SAAjB,EAAQ,IAAI,CAAa,CACzB,GAAI,EAAuB,EAAQ,KAAK,EACpC,MAAO,KAAO,EAAQ,KAAK,CAG3B,IAAI,EAAS,KAAO,EAAQ,KAAK,CAIjC,OAHK,GACD,CAAA,GAAU,IADd,EAGO,CAEf,QACA,AAAI,EAAM,MAAM,CAAC,MAAM,CAAC,sBAAsB,EAAI,SAAS,IAAI,CAAC,EAAQ,KAAK,EAClE,AAlEf,SAAgC,CAAK,CAAE,CAAW,EAC9C,IAAI,EAAO,EAAG,EAAK,EAAM,EAAG,EAAQ,EAAc,EAMlD,IAAK,EAAI,EAJT,EAAQ,EAAM,KAAK,CAAC,eACpB,EAAS,OAAO,SAAS,CAGb,EAAM,EAAM,MAAM,CAAE,EAAI,EAAK,EAAE,EAAG,CAG1C,IAFA,EAAO,CAAK,CAAC,EAAE,CACf,EAAI,EACG,EAAI,EAAK,MAAM,EAAI,EAAQ,IAAI,CAAC,YAAY,CAAC,EAAK,UAAU,CAAC,KAChE,EAAE,EAEF,EAAS,GACT,CAAA,EAAS,CAAA,CAEjB,CA0BA,IAAK,AAxBD,AAAuB,KAAA,IAAhB,GAOP,EAAe,EACU,MAArB,CAAK,CAAC,EAAE,CAAC,EAAO,EAChB,CAAA,GAAe,GADnB,EAGA,EAAO,IAEM,EAAT,GAMA,EAAE,EAEN,EAAe,GAGd,EAAI,EAAG,EAAM,EAAM,MAAM,CAAE,EAAI,EAAK,EAAE,EACvC,EAAK,EAAuB,EAAU,CAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KACrD,CAAK,CAAC,EAAE,CAAG,EAAY,EAAG,IAAI,CAAC,IAAM,EAKzC,OAFA,EAAO,EAEA,EAAM,IAAI,CAAC,KACtB,EAgBsC,KAAO,EAAQ,KAAK,CAAG,KAAM,GAExD,KAAO,EAAQ,KAAK,CAAG,IAClC,CAEA,SAAS,EAAY,CAAI,CAAE,CAAM,EAC7B,IAAI,EAAG,EAAK,EAAS,EAAM,EAAoB,EAAa,EACxD,EAAU,EAAO,EAAW,EAAuB,EAEvD,GAAI,EAAK,eAAe,EAAI,EAAK,eAAe,CAAC,MAAM,CAAG,EAAG,CAGzD,GAFA,EAAO,EAEH,EAAoB,CAmBpB,IAAK,AAlBL,EAAU,EAAK,eAAe,CAAC,EAAE,CACjC,EAAS,EAAE,CAEX,EAAW,EAAQ,aAAa,CAChC,EAAQ,EAAQ,KAAK,CAIjB,AADJ,CAAA,EAAQ,AAAC,CAAA,AADT,CAAA,EAAS,EAAW,SAAS,CAAC,CAAQ,CAAC,EAAE,CAAE,CAAK,CAAC,EAAE,CAAA,EACnC,KAAK,CAAC,QAAU,EAAC,AAAD,EAAI,MAAM,AAAN,EACxB,GACR,EAAO,IAAI,CAAC,EAAa,KAAM,IAC/B,EAAO,IAAI,CAAC,EAAU,EAAgB,OAEtC,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAgB,KAGhC,EAAY,EAEP,EAAI,EAAG,EAAM,EAAK,eAAe,CAAC,MAAM,CAAE,EAAI,EAAK,IAEpD,EAAQ,AADR,CAAA,EAAU,EAAK,eAAe,CAAC,EAAE,AAAF,EACf,KAAK,CAGrB,EAAQ,AAAC,CAAA,AADD,EAAW,SAAS,CAAC,CAAS,CAAC,EAAE,CAAE,CAAK,CAAC,EAAE,EACpC,KAAK,CAAC,QAAU,EAAC,AAAD,EAAI,MAAM,CACzC,EAAO,IAAI,CAAC,EAAa,KAAM,IAC/B,EAAO,IAAI,CAAC,EAAU,EAAgB,KAEtC,EAAY,EAIhB,EAAQ,AAAC,CAAA,AADA,EAAW,SAAS,CAAC,CAAK,CAAC,EAAE,CAAE,CAAQ,CAAC,EAAE,EACnC,KAAK,CAAC,QAAU,EAAC,AAAD,EAAI,MAAM,CAC1C,EAAO,IAAI,CAAC,EAAa,KAAM,GACnC,MAWI,IAAK,AAVL,EAAU,EAAK,eAAe,CAAC,EAAE,CACjC,EAAS,EAAE,CACP,GAAqB,EAAK,IAAI,GAAK,EAAO,OAAO,EAAI,AAAqB,IAArB,EAAK,IAAI,CAAC,MAAM,EACrE,EAAO,IAAI,CAAC,MAEhB,EAAO,IAAI,CAAC,EAAgB,IACvB,EAAuB,EAAuB,GAAQ,QAAQ,KAC/D,EAAO,IAAI,CAAC,MAGX,EAAI,EAAG,EAAM,EAAK,eAAe,CAAC,MAAM,CAAE,EAAI,EAAK,EAAE,EAGjD,EAAuB,EAD5B,EAAW,CAAC,EADZ,EAAU,EAAK,eAAe,CAAC,EAAE,EACI,EACwB,QAAQ,KACjE,EAAS,IAAI,CAAC,MAElB,EAAO,IAAI,CAAC,EAAU,IAI9B,EAAO,IAAI,CAAC,EAAU,GAC1B,CAEA,GAAI,EAAK,gBAAgB,EAErB,GAAI,EAEA,EAAW,AADX,CAAA,EAAU,EAAK,gBAAgB,CAAC,EAAE,AAAF,EACb,aAAa,CAChC,EAAQ,EAAQ,KAAK,CAKjB,AAFJ,CAAA,EAAQ,AAAC,CAAA,AADT,CAAA,EAAS,EAAW,SAAS,CAAC,CAAQ,CAAC,EAAE,CAAE,CAAK,CAAC,EAAE,CAAA,EACnC,KAAK,CAAC,QAAU,EAAC,AAAD,EAAI,MAAM,AAAN,EAExB,GACR,EAAO,IAAI,CAAC,EAAa,KAAM,IAC/B,EAAO,IAAI,CAAC,EAAU,EAAgB,OAEtC,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAgB,UAKhC,IAAK,EAAI,EAFT,EAAqB,CAAC,EAAuB,EAAuB,GAAQ,QAAQ,IACpF,EAAc,EAAa,IAAK,AArK5C,SAAyB,CAAG,EACxB,IAAI,EACJ,IAAK,EAAI,EAAI,MAAM,CAAG,EAClB,AADqB,GAAK,IACtB,EAAQ,IAAI,CAAC,gBAAgB,CAAC,EAAI,UAAU,CAAC,IADpB,EAAE,GAKnC,OAAO,EAAK,MAAM,CAAG,EAAK,CAC9B,EA6J4D,EAAuB,CAAC,EAAM,EAAQ,EAAO,EAAE,QAAQ,KAC3F,EAAM,EAAK,gBAAgB,CAAC,MAAM,CAAE,EAAI,EAAK,EAAE,EACvD,EAAU,EAAK,gBAAgB,CAAC,EAAE,CAC9B,EAYA,CAJI,EAFA,AAAM,IAAN,EAES,CAAC,EAAQ,EAAO,CAEhB,CAAC,EAAQ,EAAY,EAE3B,IAAI,CAAC,EAAgB,EAAS,IAErC,EAAS,CAAC,EAAQ,EAAU,EAAgB,IAAU,CAEtD,IAAM,EAAM,GAAM,EAAuB,EAAuB,GAAQ,QAAQ,KAChF,CAAA,EAAS,CAAC,EAAQ,KAAK,AAAA,EAMvC,OAAO,CACX,CAEA,SAAS,EAAmB,CAAK,CAAE,CAAG,CAAE,CAAM,EAC1C,IAAI,EAAG,EAAe,EAEtB,IAAK,EAAI,EAAO,EAAI,EAAK,IACC,OAAlB,CAAU,CAAC,EAAE,EACb,IAIR,IAAK,EAAI,EAAG,EAAI,EAAc,IAC1B,EAAO,IAAI,CAAC,EAEpB,CAEA,SAAS,EAAa,CAAI,CAAE,CAAO,CAAE,CAAM,SACvC,AAAI,EAAU,EACH,CAAC,IAAK,EAAM,IAAI,CAEpB,CACX,CAEA,SAAS,EAAuB,CAAM,EAClC,IAAI,EAAG,EAAI,EAEX,IAAK,EAAI,EAAG,EAAK,AADjB,CAAA,EAAS,EAAO,KAAK,CAAC,UAAtB,EACwB,MAAM,CAAE,EAAI,EAAI,IACpC,CAAM,CAAC,EAAE,CAAG,EAAU,EAAO,CAAM,CAAC,EAAE,CAE1C,OAAO,CACX,CAkBA,SAAS,IACT,CAsCA,SAAS,EAAmB,CAAI,EAC5B,OAAO,EAAuB,EAAK,IAAI,CAAE,EAC7C,CAEA,SAAS,EAAoB,CAAI,CAAE,CAAa,EAC5C,OAAO,EAAK,KAAK,CAAG,QAAW,CAAA,EAAgB,IAAiB,CAAA,EAAS,EAC7E,CAEA,SAAS,EAAmB,CAAI,EAE5B,OAAO,AADW,EAAK,SAAS,EAAI,CAAC,EAAM,GAAG,CAAC,iBAAiB,CAC3C,IAAM,EAAQ,EACvC,CAEA,SAAS,EAAqB,CAAI,EAC9B,IAAI,EAAO,EAAK,KAAK,CAAE,EAAS,GAQhC,OAPI,EAAK,KAAK,EACV,CAAA,GAAU,EAAoB,EAAM,CAAC,EAAK,QAAQ,CAAA,EAElD,EAAK,SAAS,EAEd,CAAA,GAAU,EAAmB,GAAQ,IAAM,EAA3C,EAEG,CACX,CAnzBA,EAAa,EAAQ,oBACrB,EAAU,EAAQ,oBAElB,EAAS,EAAW,MAAM,CAyC1B,EAAmB,CACf,KAAM,AA9BV,CAAA,EAAa,CACT,SAAU,EACV,MAAO,EACP,WAAY,EACZ,YAAa,EACb,cAAe,EACf,SAAU,EACV,UAAW,EACX,WAAY,EACZ,UAAW,EACX,WAAY,EACZ,WAAY,EACZ,SAAU,EACV,WAAY,GACZ,aAAc,GACd,SAAU,GACV,eAAgB,GAChB,eAAgB,GAChB,MAAO,GACP,MAAO,GACP,QAAS,GACT,iBAAkB,GAClB,KAAM,GACN,IAAK,GACL,eAAgB,GAChB,OAAQ,GACR,QAAS,EACb,CAAA,EAGqB,QAAQ,CACzB,KAAM,EAAW,SAAS,CAC1B,KAAM,EAAW,UAAU,CAC3B,IAAK,EAAW,SAAS,CACzB,IAAK,EAAW,UAAU,CAC1B,IAAK,EAAW,UAAU,CAC1B,KAAM,EAAW,QAAQ,CACzB,KAAM,EAAW,QAAQ,CACzB,MAAO,EAAW,QAAQ,CAC1B,MAAO,EAAW,QAAQ,CAC1B,GAAM,EAAW,QAAQ,CACzB,KAAQ,EAAW,QAAQ,CAC3B,IAAK,EAAW,UAAU,CAC1B,IAAK,EAAW,UAAU,CAC1B,KAAM,EAAW,UAAU,CAC3B,KAAM,EAAW,UAAU,CAC3B,GAAM,EAAW,UAAU,CAC3B,WAAc,EAAW,UAAU,CACnC,KAAM,EAAW,YAAY,CAC7B,KAAM,EAAW,YAAY,CAC7B,MAAO,EAAW,YAAY,CAC9B,IAAK,EAAW,QAAQ,CACxB,IAAK,EAAW,QAAQ,CACxB,IAAK,EAAW,cAAc,CAC9B,IAAK,EAAW,cAAc,CAC9B,IAAK,EAAW,cAAc,CAC9B,KAAM,EAAW,cAAc,AACnC,EAkrBA,EAAc,SAAS,CAAC,UAAU,CAAG,SAAS,CAAI,CAAE,CAAK,EACrD,IAAI,EAAQ,EAAkB,EAAO,IAAI,OAIzC,CAFA,EAAmB,CAAC,EAAM,OAAO,EAAI,CAAC,EAAK,eAAe,CAEtD,EAAK,IAAI,GAAK,EAAO,cAAc,EAAI,GAChC,CAAC,EAAO,IAAI,CAAC,iBAAiB,CAAC,EAAM,GAAO,CAGnD,EAAK,IAAI,GAAK,EAAO,cAAc,EAAI,EAChC,KAGX,EAAW,WACP,EAAS,CACL,EACA,EAAU,EAAK,iBAAiB,CAAC,EAAM,IAC1C,AACL,GAEO,EACX,EAEA,EAAc,SAAS,CAAC,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAM,EAC7D,IAAI,EAAO,EAAuB,EAAuB,GAAQ,QAAQ,WACzE,AAAI,EAAK,IAAI,GAAK,EAAO,cAAc,EAAK,AAAC,EAAM,OAAO,EAAK,EAAK,eAAc,EAAO,EAGrF,EACO,CAAC,EAAQ,EAAK,CAElB,CAAC,EAAQ,EAAS,EAAK,CALnB,CAAC,EAAQ,EAAM,AAM9B,EA2BA,EAAc,SAAS,CAAC,eAAe,CAAG,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,SACvE,AAAI,EAAK,IAAI,GAAK,EAAO,UAAU,CACxB,EAAmB,GAEvB,IAAI,CAAC,kBAAkB,CAAC,EAAM,EAAY,EACrD,EAEA,EAAc,SAAS,CAAC,sBAAsB,CAAG,SAAU,CAAI,EAC3D,IAAI,EAAG,EAAI,EAAQ,EAInB,GAFA,EAAa,CAAA,EAET,EAAK,IAAI,GAAK,EAAO,uBAAuB,EACvC,EAAK,IAAI,EAAK,AAAC,EAAK,QAAQ,EAAI,AAAyB,IAAzB,EAAK,QAAQ,CAAC,MAAM,EACrD,AAAuB,IAAvB,EAAK,MAAM,CAAC,MAAM,EAAU,EAAK,MAAM,CAAC,EAAE,CAAC,IAAI,GAAK,EAAO,UAAU,CAGtE,CAMH,IAAK,AAJL,AADA,CAAA,EAAS,EAAK,IAAI,GAAK,EAAO,uBAAuB,CAAG,CAAC,EAAoB,EAAM,CAAA,GAAO,CAAG,EAAE,AAAF,EACtF,IAAI,CAAC,KACR,EAAK,QAAQ,EACb,CAAA,EAAa,CAAA,CADjB,EAGK,EAAI,EAAG,EAAK,EAAK,MAAM,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACvC,GAAc,EAAK,QAAQ,CAAC,EAAE,CAE9B,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAC,EAAE,CAAE,EAAK,QAAQ,CAAC,EAAE,CAAE,IAAK,EAAW,UAAU,CArvBpG,IAuvBI,EAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,EAAK,MAAM,CAAC,EAAE,CAAE,EAAW,UAAU,CAvvB1E,IAyvBI,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,EAItB,CAAA,EAAK,IAAI,GACL,EAAK,MAAM,CAAC,MAAM,EAClB,EAAO,IAAI,CAAC,IAAM,GAEtB,EAAO,IAAI,CAAC,OACZ,EAAO,IAAI,CAAC,EAAmB,EAAK,IAAI,IAG5C,EAAO,IAAI,CAAC,IAChB,MA5BI,EAAS,CAAC,EAAoB,EAAM,CAAA,GAAO,EAAmB,EAAK,MAAM,CAAC,EAAE,EAAE,CA8BlF,OAAO,CACX,EAEA,EAAc,SAAS,CAAC,oBAAoB,CAAG,SAAU,CAAI,EACzD,IAAI,EAAQ,EAoBZ,OAlBA,EAAS,IAAI,CAAC,sBAAsB,CAAC,GAEjC,EAAK,IAAI,GAAK,EAAO,uBAAuB,GAC5C,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,OAGZ,EAAK,UAAU,EACf,EAAO,IAAI,CAAC,GAEsB,MAA9B,AADJ,CAAA,EAAO,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,UAAU,CAxxB3D,EAwxBJ,EACS,QAAQ,GAAG,MAAM,CAAC,IACvB,CAAA,EAAO,CAAC,IAAK,EAAM,IAAI,AAAA,EAE3B,EAAO,IAAI,CAAC,IAEZ,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CA/wBhC,IAkxBF,CACX,EAEA,EAAc,SAAS,CAAC,6BAA6B,CAAG,SAAU,CAAQ,CAAE,CAAI,CAAE,CAAK,EACnF,IAAI,EAAS,CAAC,MAAS,CAAA,EAAK,KAAK,CAAG,IAAiB,QAAU,EAAA,EAAM,EAAQ,IAAI,CAAE,EAAO,IAAI,CAkB9F,OAjBA,EAAW,WACH,EAAK,IAAI,CAAC,IAAI,GAAK,EAAO,mBAAmB,CAC7C,EAAW,WACP,EAAO,IAAI,CAAC,EAAK,IAAI,CAAC,IAAI,CAAG,KAC7B,EAAO,IAAI,CAAC,EAAK,iBAAiB,CAAC,EAAK,IAAI,CAAC,YAAY,CAAC,EAAE,CA7xB/D,GA8xBD,GAEA,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,IAAI,CA7yB9D,IAgzBJ,EAAS,EAAK,EAAQ,GACtB,EAAS,CAAC,EACN,EACA,EAAK,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,UAAU,CAnzBzD,IAozBD,IAAI,AACX,GACA,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAAE,IAChC,CACX,EAEA,EAAc,SAAS,CAAC,mBAAmB,CAAG,SAAU,CAAI,CAAE,CAAQ,EAClE,IAAI,EAAS,EAAE,CAYf,OAVI,GACA,EAAO,IAAI,CAAC,KAGhB,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAM,EAAW,UAAU,CAj0BvD,IAm0BJ,GACA,EAAO,IAAI,CAAC,KAGT,CACX,EAEA,EAAc,SAAS,CAAC,kBAAkB,CAAG,SAAU,CAAI,CAAE,CAAK,CAAE,CAAQ,CAAE,CAAU,CAAE,CAAK,EAK3F,OAJI,EAAW,UAAU,CAAG,GACxB,CAAA,GA31BS,CA01Bb,EAIO,EACH,CACI,IAAI,CAAC,kBAAkB,CAAC,EAAM,EAAW,IAAI,CAAE,GAC/C,EAAQ,EAAW,EACnB,IAAI,CAAC,kBAAkB,CAAC,EAAO,EAAW,UAAU,CAAE,GACzD,CACD,EAAW,UAAU,CACrB,EAER,EAEA,EAAc,SAAS,CAAC,SAAS,CAAG,SAAU,CAAK,QAC/C,AAAI,CAAC,GAAc,AAr2BD,GAq2BC,EACR,GAEJ,GACX,EAIA,EAAc,SAAS,CAAG,CAEtB,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,IAAI,EAAO,EAAS,EAAS,CAAC,IAAK,EAAQ,CAAE,EAAO,IAAI,CAgFxD,OA9EA,EAAW,eAaH,EAAG,EAAI,EAAU,EAMrB,IAAK,AAjBoB,IAArB,EAAK,IAAI,CAAC,MAAM,EAAU,GAEtB,AADJ,CAAA,EAAQ,EAAK,KAAK,AAAL,CACJ,CAAC,EAAE,CAAG,CAAK,CAAC,EAAE,CAAG,IAEH,OAAf,AADJ,CAAA,EAAU,EAAW,SAAS,CAAC,CAAK,CAAC,EAAE,CAAG,EAAG,CAAK,CAAC,EAAE,CAAG,EAAxD,CACW,CAAC,EAAE,EACV,CAAA,EAAS,CAAC,IAAI,AAAA,EAElB,EAAO,IAAI,CAAC,IAKpB,EAr4BK,EAGC,EAm4BF,GACA,CAAA,GAn4BM,EAk4BV,EAIK,EAAI,EAAG,EAAK,EAAK,IAAI,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACrC,IAEU,IAAN,IACI,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,GAC5B,EAAQ,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,aAAa,CAElC,OAAf,AADJ,CAAA,EAAU,EAAW,SAAS,CAAC,CAAK,CAAC,EAAE,CAAE,CAAK,CAAC,EAAE,CAAA,CACtC,CAAC,EAAE,EACV,CAAA,EAAS,CAAC,IAAI,AAAA,GAGjB,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,EAC7B,EAAmB,EAAK,KAAK,CAAC,EAAE,CAAE,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,KAK7D,CAAA,EAAI,CAAA,GACC,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,gBAAgB,EAAM,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,EACpE,EAAmB,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,IAK7E,IAAM,EAAK,GACX,CAAA,GA95BE,EA65BN,EAKI,EADA,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,EAAI,EACrB,EAAK,iBAAiB,CAAC,EAAK,IAAI,CAAC,EAAE,CAAE,GAErC,EAAU,EAAK,iBAAiB,CAAC,EAAK,IAAI,CAAC,EAAE,CAAE,IAG9D,EAAO,IAAI,CAAC,GACP,EAAuB,EAAuB,GAAU,QAAQ,KAC7D,GAAsB,EAAI,EAAK,GAG1B,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,eAAe,EACjC,EAAO,IAAI,CAAC,GAOpB,GAEI,IAAM,EAAK,GACP,CAAC,EAAK,IAAI,CAAC,EAAE,CAAC,gBAAgB,EAC9B,EAAmB,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,EAAK,KAAK,CAAC,EAAE,CAAE,EAK7E,GAEA,EAAO,IAAI,CAAC,EAAU,MACf,CACX,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,SACjC,AAAI,EAAK,KAAK,CACH,SAAW,EAAK,KAAK,CAAC,IAAI,CAAG,IAAI,CAAC,SAAS,CAAC,GAEhD,QAAU,IAAI,CAAC,SAAS,CAAC,EACpC,EAEA,kBAAmB,SAAU,CAAI,CAAE,CAAK,SACpC,AAAI,EAAK,KAAK,CACH,YAAc,EAAK,KAAK,CAAC,IAAI,CAAG,IAAI,CAAC,SAAS,CAAC,GAEnD,WAAa,IAAI,CAAC,SAAS,CAAC,EACvC,EAEA,UAAW,SAAU,CAAI,CAAE,CAAK,EAC5B,IAAI,EAAS,CAAE,IAAK,EAAQ,CAAE,EAAO,IAAI,CAmBzC,OAjBA,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EAEP,IAAK,EAAI,EAAG,EAAK,EAAK,IAAI,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACzC,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAC,EAAE,CAAE,EAAW,QAAQ,CA/8BzE,IAg9BQ,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,EAGxB,GAEK,EAAuB,EAAuB,GAAQ,QAAQ,KAC/D,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,KACL,CACX,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAK,EACnC,IAAI,EAAQ,EAWZ,OAVA,EAAU,CAAC,QAAQ,CACf,EAAK,EAAE,EACP,CAAA,EAAS,EAAK,EAAQ,IAAI,CAAC,kBAAkB,CAAC,EAAK,EAAE,CAAE,EAAW,QAAQ,CAl+B1E,GAi+BJ,EAGI,EAAK,UAAU,GACf,EAAW,EAAK,UAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAE,EAAW,KAAK,CAr+BpF,IAs+BA,EAAS,EAAK,EAAQ,IAE1B,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAK,IAAI,CA79BvC,KA89BE,CACX,EAEA,mBAAoB,SAAU,CAAI,CAAE,CAAK,SACrC,AAAI,EAAM,GAAG,EAAI,EAAK,GAAG,CACd,EAAK,GAAG,CAAG,IAAI,CAAC,SAAS,CAAC,GAE9B,AA1tBf,SAAyB,CAAG,EACxB,IAAI,EAAG,EAAI,EAAM,EAGjB,IAAK,EAAI,EADT,EAAQ,AAAW,WAAX,EAAsB,IAAM,IACxB,EAAK,EAAI,MAAM,CAAE,EAAI,EAAI,EAAE,EAAG,CAEtC,GAAI,AAAS,KADb,CAAA,EAAO,EAAI,UAAU,CAAC,EAAtB,EAC4B,CACxB,EAAQ,IACR,KACJ,CAAO,GAAI,AAAS,KAAT,EAAwB,CAC/B,EAAQ,IACR,KACJ,CAAoB,KAAT,GACP,EAAE,CAEV,CAEA,OAAO,EAAQ,EAAM,CACzB,EAwsB+B,EAAK,SAAS,EAAI,IAAI,CAAC,SAAS,CAAC,EAC5D,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAK,EAEnC,IAAI,EAAS,EAAK,KAAM,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CArgCxC,IAugCT,OAAO,EADP,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,IAAI,CAAE,GACtB,CAChB,QAAU,EAAQ,IAClB,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CA1/BtD,GA2/BA,IAAM,IAAI,CAAC,SAAS,CAAC,GACxB,CACL,EAEA,YAAa,SAAU,CAAI,CAAE,CAAK,EAC9B,IAAI,EAAQ,EAAO,IAAI,CAoBvB,OAnBA,EAAW,WACP,IAAI,CAEA,CAAA,EAAK,KAAK,EACV,EAAS,CACL,QAAU,EAAQ,IAClB,EAAK,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,QAAQ,CAvgC/D,GAwgCQ,IACH,CAEG,EAAK,KAAK,GACV,EAAQ,EAAK,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,QAAQ,CA5gCvE,GA6gCQ,EAAO,MAAM,CAAC,EAAG,EAAG,OAAQ,KAGhC,EAAS,CAAC,QAAQ,AAE1B,GACA,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAliC5B,IAmiCF,CACX,EAEA,kBAAmB,SAAU,CAAI,CAAE,CAAK,EACpC,MAAO,WAAa,IAAI,CAAC,SAAS,CAAC,EACvC,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,MAAO,GACX,EAEA,yBAA0B,SAAU,CAAI,CAAE,CAAK,EAC3C,IAA2B,EAAvB,EAAS,CAAE,SAAU,CAYzB,OAVA,EAAY,AA5iCE,GA4iCF,EAthCP,GA3BI,EAqjCT,EAAS,EAAK,EAAQ,WAElB,EADA,EAAY,EAAK,WAAW,EACnB,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,EAAK,WAAW,CAAE,IAEtD,EAAK,EAAQ,IAAI,CAAC,kBAAkB,CAAC,EAAK,WAAW,CAAE,EAAW,UAAU,CA1iCrF,GA0iCgG,IAAI,CAAC,SAAS,CAAC,GAGvH,EAEA,uBAAwB,SAAU,CAAI,CAAE,CAAK,EACzC,IAA2B,EAAvB,EAAS,CAAE,SAAU,CAAa,EAAO,IAAI,OAMjD,CAJA,EAAY,AA5jCE,GA4jCF,EAtiCP,GA3BI,EAqkCL,EAAK,WAAW,EACT,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,EAAK,WAAW,CAAE,KAK7D,EAAK,UAAU,GACX,AAA2B,IAA3B,EAAK,UAAU,CAAC,MAAM,CACtB,EAAS,EAAK,EAAQ,IAAM,EAAQ,KAC7B,EAAK,UAAU,CAAC,EAAE,CAAC,IAAI,GAAK,EAAO,oBAAoB,CAC9D,EAAS,EAAK,EAAQ,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CAhkCzF,KAkkCI,EAAS,EAAK,EAAQ,KACtB,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EAEP,IAAK,AADL,EAAO,IAAI,CAAC,GACP,EAAI,EAAG,EAAK,EAAK,UAAU,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC/C,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CAxkCvF,IAykCgB,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,EAG9B,GACK,EAAuB,EAAuB,GAAQ,QAAQ,KAC/D,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,EAAO,MAGnB,EAAK,MAAM,CACX,EAAS,EAAK,EAAQ,CAClB,OAAS,EAET,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAxlChE,GAylCQ,IAAI,CAAC,SAAS,CAAC,GAClB,EAED,EAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAG5B,EACX,EAEA,qBAAsB,SAAU,CAAI,CAAE,CAAK,EAEvC,MAAO,CACH,SAAW,EACX,IAAM,EACN,OAAS,EAET,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAzmCxD,GA0mCA,IAAI,CAAC,SAAS,CAAC,GAClB,AACL,EAEA,oBAAqB,SAAU,CAAI,CAAE,CAAK,MAClC,EAAQ,EAGJ,EASA,EA4CR,OATI,AAA2B,MAA3B,AADJ,CAAA,EAAW,EAHX,EAAS,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAE,EAAW,QAAQ,CA1pClE,GA0pC2E,EAGrC,QAAQ,EAAlD,EACa,UAAU,CAAC,IA3CpB,AAA6B,UAAzB,AA4CgB,EA5CP,KAAK,CAAC,EAAG,IAIf,CAAA,AAAS,MADhB,CAAA,EAAO,AAyCa,EAzCJ,UAAU,CAAC,EAA3B,GACmC,EAAQ,IAAI,CAAC,YAAY,CAAC,IAAS,EAAQ,IAAI,CAAC,gBAAgB,CAAC,EAApG,GAKA,AAA6B,aAAzB,AAoCmB,EApCV,KAAK,CAAC,EAAG,IAIf,CAAA,AAAS,KADhB,CAAA,EAAO,AAiCgB,EAjCP,UAAU,CAAC,EAA3B,GACkC,EAAQ,IAAI,CAAC,YAAY,CAAC,IAAS,AAAS,KAAT,GAA4B,EAAQ,IAAI,CAAC,gBAAgB,CAAC,EAA/H,GAiCI,AA9BR,SAAyB,CAAQ,EAC7B,IAAI,EAAM,EAAG,EACb,GAA6B,UAAzB,EAAS,KAAK,CAAC,EAAG,IAGlB,CAAC,EAAQ,IAAI,CAAC,YAAY,CAAC,EAAS,UAAU,CAAC,IAF/C,MAAO,CAAA,EAKX,IAAK,EAAI,EAAG,EAAK,EAAS,MAAM,CAC5B,AAD8B,EAAI,GAC7B,EAAQ,IAAI,CAAC,YAAY,CAAC,EAAS,UAAU,CAAC,IADb,EAAE,UAK5C,AAAI,IAAM,GAGN,AAA6B,aAA7B,EAAS,KAAK,CAAC,EAAG,EAAI,IAInB,CAAA,AAAS,KADhB,CAAA,EAAO,EAAS,UAAU,CAAC,EAAI,EAA/B,GACkC,EAAQ,IAAI,CAAC,YAAY,CAAC,IAAS,AAAS,KAAT,GAA4B,EAAQ,IAAI,CAAC,gBAAgB,CAAC,EAA/H,CACJ,EASwB,IACf,GAAc,AA7qCT,GA6qCS,GAA4B,EAAK,UAAU,CAAC,IAAI,GAAK,EAAO,OAAO,EAAI,AAAiC,UAAjC,OAAO,EAAK,UAAU,CAAC,KAAK,CACtH,EAAS,CAAC,IAAK,EAAQ,IAAM,IAAI,CAAC,SAAS,CAAC,GAAO,CAEnD,EAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAExB,CACX,EAEA,kBAAmB,SAAU,CAAI,CAAE,CAAK,EAIpC,IAAI,EAAQ,EAAQ,EAAO,IAAI,QAK/B,AAAI,AAA2B,IAA3B,EAAK,UAAU,CAAC,MAAM,CAEf,CACH,SACA,EAEA,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAzrC5D,GA0rCI,IAAI,CAAC,SAAS,CAAC,GAClB,EAIL,EAAS,CACL,SACH,CACD,EAAS,EAGL,EAAK,UAAU,CAAC,EAAO,CAAC,IAAI,GAAK,EAAO,sBAAsB,GAC9D,EAAS,EAAK,EAAQ,CACd,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAO,CAAE,EAAW,QAAQ,CAvsC5E,GAwsCC,EACD,EAAE,GAGF,EAAK,UAAU,CAAC,EAAO,GACR,IAAX,GACA,EAAO,IAAI,CAAC,KAGZ,EAAK,UAAU,CAAC,EAAO,CAAC,IAAI,GAAK,EAAO,wBAAwB,CAEhE,EAAS,EAAK,EAAQ,CACd,EACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAO,CAAE,EAAW,QAAQ,CArtChF,GAstCK,GAGD,EAAO,IAAI,CAAC,EAAQ,KAEf,EAAK,UAAU,CAAC,MAAM,CAAG,GAAY,GAEtC,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAO,CAAE,EAAW,QAAQ,CA9tCxF,IA+tCQ,EAAO,IAAI,CAAC,EAAQ,IAAM,KAM1B,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EAEP,IAAK,AADL,EAAO,IAAI,CAAC,GACP,EAAI,EAAQ,EAAK,EAAK,UAAU,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACpD,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CA1uC3F,IA2uCoB,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,EAG9B,GACK,EAAuB,EAAuB,GAAQ,QAAQ,KAC/D,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,EAAO,IAAM,MAKrC,EAAS,EAAK,EAAQ,CAClB,OAAS,EAET,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CA3vCxD,GA4vCA,IAAI,CAAC,SAAS,CAAC,GAClB,EAEL,EAEA,mBAAoB,SAAU,CAAI,CAAE,CAAK,EACrC,IAAI,EAAa,AAjxCR,EAixCQ,EAlwCb,EAFA,SAqwCJ,AAAI,EAAK,IAAI,CACF,CACH,IAAI,CAAC,kBAAkB,CAAC,EAAK,EAAE,CAAE,EAAW,UAAU,CAAE,GACxD,EACA,IACA,EACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,UAAU,CAAE,GAC7D,CAEE,IAAI,CAAC,eAAe,CAAC,EAAK,EAAE,CAAE,EAAW,UAAU,CAAE,EAChE,EAEA,oBAAqB,SAAU,CAAI,CAAE,CAAK,EAItC,IAAI,EAAQ,EAAG,EAAI,EAAM,EAAW,EAAO,IAAI,CAM/C,SAAS,IAUL,IAAK,AATL,EAAO,EAAK,YAAY,CAAC,EAAE,CACvB,EAAM,OAAO,EAAI,EAAK,eAAe,EACrC,EAAO,IAAI,CAAC,MACZ,EAAO,IAAI,CAAC,EAAU,EAAK,iBAAiB,CAAC,EAAM,OAEnD,EAAO,IAAI,CAAC,KACZ,EAAO,IAAI,CAAC,EAAK,iBAAiB,CAAC,EAAM,KAGxC,EAAI,EAAG,EAAK,EAAK,YAAY,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACjD,EAAO,EAAK,YAAY,CAAC,EAAE,CACvB,EAAM,OAAO,EAAI,EAAK,eAAe,EACrC,EAAO,IAAI,CAAC,IAAM,GAClB,EAAO,IAAI,CAAC,EAAU,EAAK,iBAAiB,CAAC,EAAM,OAEnD,EAAO,IAAI,CAAC,IAAM,GAClB,EAAO,IAAI,CAAC,EAAK,iBAAiB,CAAC,EAAM,IAGrD,CAUA,OAlCA,EAAS,CAAE,EAAK,IAAI,CAAE,CAEtB,EAAY,AAtyCH,EAsyCG,EAtyCH,EA4BJ,EAkyCD,EAAK,YAAY,CAAC,MAAM,CAAG,EAC3B,EAAW,GAEX,IAGJ,EAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAEpB,CACX,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,MAAO,CAAC,EACJ,QACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,QAAQ,CA7zC1D,IA8zCD,IAAI,CAAC,SAAS,CAAC,GAAO,AAC7B,EAEA,aAAc,SAAU,CAAI,CAAE,CAAK,EAC/B,IAAI,EAAQ,EAAG,EAAI,EAKnB,GAHA,EAAS,CAAC,MAAO,IAAI,CAAC,UAAU,CAAC,EAAK,KAAK,CAn1ClC,GAm1C4C,CACrD,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,GAEvC,EAAK,QAAQ,CAEb,IAAK,EAAI,EAAG,EAAK,EAAK,QAAQ,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC7C,EAAS,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,EAAK,QAAQ,CAAC,EAAE,CAz1C5D,IA01CG,CAAA,EAAK,SAAS,EAAI,EAAI,IAAM,CAAA,GAC5B,CAAA,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAE,EAD1D,MAID,CAGH,IAAK,EAAI,EAAG,EAAK,AAFjB,CAAA,EAAkB,EAAK,eAAe,EAAI,EAAE,AAAF,EAET,MAAM,CAAE,EAAI,EAAI,EAAE,EAC/C,EAAS,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,CAAe,CAAC,EAAE,CAl2C9D,IAm2CG,CAAA,EAAK,SAAS,EAAI,EAAI,IAAM,CAAA,GAC5B,CAAA,EAAS,IAAI,CAAC,gBAAgB,CAAC,CAAe,CAAC,EAAE,CAAC,IAAI,CAAE,EAD5D,EAMJ,GAAI,EAAK,OAAO,EACZ,GAAI,MAAM,OAAO,CAAC,EAAK,OAAO,EAC1B,IAAK,EAAI,EAAG,EAAK,EAAK,OAAO,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC5C,EAAS,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,EAAK,OAAO,CAAC,EAAE,CA52CnE,IA62CW,CAAA,EAAK,SAAS,EAAI,EAAI,IAAM,CAAA,GAC5B,CAAA,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,OAAO,CAAC,EAAE,CAAC,IAAI,CAAE,EADzD,OAKJ,EAAS,EAAK,EAAQ,IAAI,CAAC,iBAAiB,CAAC,EAAK,OAAO,CAl3C5D,IAm3CO,EAAK,SAAS,EACd,CAAA,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,OAAO,CAAC,IAAI,CAAE,EADtD,EAKZ,CAIA,OAHI,EAAK,SAAS,EACd,CAAA,EAAS,EAAK,EAAQ,CAAC,UAAW,IAAI,CAAC,UAAU,CAAC,EAAK,SAAS,CA13C3D,GA03CqE,CAAA,EAEvE,CACX,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAK,EAClC,IAAI,EAAQ,EAAU,EAAG,EAAI,EAAW,EAAO,IAAI,CAQnD,GAPA,EAAW,WACP,EAAS,CACL,SAAW,EAAQ,IACnB,EAAK,kBAAkB,CAAC,EAAK,YAAY,CAAE,EAAW,QAAQ,CAr3ClE,GAs3CI,IAAM,EAAQ,IAAM,EACvB,AACL,GACI,EAAK,KAAK,CAEV,IAAK,EAAI,EADT,EAz4CK,EA04CO,EAAK,EAAK,KAAK,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACtC,IAAM,EAAK,GACX,CAAA,GAv4CE,EAs4CN,EAGA,EAAW,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAK,KAAK,CAAC,EAAE,CAAE,IAC3D,EAAO,IAAI,CAAC,GACP,EAAuB,EAAuB,GAAU,QAAQ,KACjE,EAAO,IAAI,CAAC,GAKxB,OADA,EAAO,IAAI,CAAC,EAAU,MACf,CACX,EAEA,WAAY,SAAU,CAAI,CAAE,CAAK,EAC7B,IAAI,EAAQ,EAAU,EAAG,EAAI,EAAW,EAAO,IAAI,CAmCnD,OAlCA,EAAW,WAuBP,IArBI,EADA,EAAK,IAAI,CACA,CACL,EAAK,OAAQ,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CA/4C3E,IAg5CQ,IACH,CAEQ,CAAC,WAAW,CAGzB,EAAI,EACJ,CAAA,EAAK,EAAK,UAAU,CAAC,MAAM,AAAN,GACX,EAAK,UAAU,CAAC,EAAE,CAAC,IAAI,GAAK,EAAO,cAAc,GACvD,EAAW,EAAK,UAAU,CAAC,EAAK,UAAU,CAAC,EAAE,CAx6C5C,GAy6CD,EAAO,IAAI,CAAC,GACZ,EAAI,GAGJ,IAAM,GAAO,EAAuB,EAAuB,GAAQ,QAAQ,KAC3E,EAAO,IAAI,CAAC,GAGhB,EAj7CK,EAk7CE,EAAI,EAAI,EAAE,EACT,IAAM,EAAK,GAAK,AA96Cd,GA86Cc,GAChB,CAAA,GA/6CE,EA86CN,EAGA,EAAW,EAAU,EAAK,iBAAiB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,IAChE,EAAO,IAAI,CAAC,GACR,EAAI,IAAM,GAAO,EAAuB,EAAuB,GAAU,QAAQ,KACjF,EAAO,IAAI,CAAC,EAGxB,GACO,CACX,EAEA,YAAa,SAAU,CAAI,CAAE,CAAK,EAC9B,IAAI,EAAQ,EAA8B,EAAO,IAAI,CAwBrD,OAvBA,EAAW,WACP,EAAS,CACL,KAAO,EAAQ,IACf,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CAt7C1D,GAu7CI,IACH,AACL,GAEA,EA18CS,EAKK,GAo8CM,GAGhB,CAAA,GAv8CU,EAs8Cd,EAGI,EAAK,SAAS,EACd,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,UAAU,CA/8CtC,IAg9CL,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,UAAU,CAAE,GAE5C,EADA,EAAK,SAAS,CAAC,IAAI,GAAK,EAAO,WAAW,CACjC,EAAK,EAAQ,CAAC,QAAS,IAAI,CAAC,iBAAiB,CAAC,EAAK,SAAS,CAAE,GAAW,EAEzE,EAAK,EAAQ,EAAK,OAAQ,IAAI,CAAC,UAAU,CAAC,EAAK,SAAS,CAAE,MAGvE,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,UAAU,CAAE,IAE1C,CACX,EAEA,aAAc,SAAU,CAAI,CAAE,CAAK,EAC/B,IAAI,EAAQ,EAAO,IAAI,CAiCvB,OAhCA,EAAW,WACP,EAAS,CAAC,MAAQ,EAAQ,IAAI,CAC1B,EAAK,IAAI,CACL,EAAK,IAAI,CAAC,IAAI,GAAK,EAAO,mBAAmB,CAC7C,EAAO,IAAI,CAAC,EAAK,iBAAiB,CAAC,EAAK,IAAI,CAt8CnD,KAy8CO,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CAx9C1E,IAy9CQ,EAAO,IAAI,CAAC,MAGhB,EAAO,IAAI,CAAC,KAGZ,EAAK,IAAI,GACT,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CA/9CtE,KAk+CI,EAAO,IAAI,CAAC,KAGZ,EAAK,MAAM,GACX,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAv+CxE,KA0+CI,EAAO,IAAI,CAAC,IAEpB,GAEA,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAAE,AAx/CzB,GAw/CyB,EAl+ClC,GA3BI,IA8/CF,CACX,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,OAAO,IAAI,CAAC,6BAA6B,CAAC,KAAM,EAAM,AA7/CxC,GA6/CwC,EAv+CjD,GA3BI,EAmgDb,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,OAAO,IAAI,CAAC,6BAA6B,CAAC,KAAM,EAAM,AAjgDxC,GAigDwC,EA3+CjD,GA3BI,EAugDb,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAK,EACnC,MAAO,CAAC,EAAK,KAAK,CAAC,IAAI,CAAG,IAAK,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAAE,AArgD5C,GAqgD4C,EA/+CrD,GA3BI,GA0gD4F,AACzG,EAEA,QAAS,SAAU,CAAI,CAAE,CAAK,EAC1B,IAAI,EAAQ,EAAU,EAAG,EAAI,EAI7B,IAAK,EAAI,EAHT,EAAK,EAAK,IAAI,CAAC,MAAM,CACrB,EAAS,CAAC,GAAqB,EAAK,EAAI,KAAO,GAAG,CAClD,EAp/CK,GAq/CO,EAAI,EAAI,EAAE,EACb,GAAqB,IAAM,EAAK,GACjC,CAAA,GA/gDM,EA8gDV,EAII,IAEU,IAAN,GACK,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,EAC7B,EAAmB,EAAK,KAAK,CAAC,EAAE,CAAE,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,IAK7D,CAAA,EAAI,CAAA,GACC,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,gBAAgB,EAAK,EAAK,IAAI,CAAC,EAAE,CAAC,eAAe,EACnE,EAAmB,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,IAKjF,EAAW,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAK,IAAI,CAAC,EAAE,CAAE,IAC1D,EAAO,IAAI,CAAC,IACR,CAAA,EAAI,EAAI,CAAA,GAAO,EAAuB,EAAuB,GAAU,QAAQ,KAC3E,GACK,EAAK,IAAI,CAAC,EAAI,EAAE,CAAC,eAAe,EACjC,EAAO,IAAI,CAAC,GAOpB,GAEI,IAAM,EAAK,GACP,CAAC,EAAK,IAAI,CAAC,EAAE,CAAC,gBAAgB,EAC9B,EAAmB,EAAK,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAE,EAAK,KAAK,CAAC,EAAE,CAAE,GAKzE,OAAO,CACX,EAEA,oBAAqB,SAAU,CAAI,CAAE,CAAK,EACtC,MAAO,CACH,EAAoB,EAAM,CAAA,GAC1B,WACA,EAAmB,IAAS,IAC5B,EAAK,EAAE,CAAG,EAAmB,EAAK,EAAE,EAAI,GACxC,IAAI,CAAC,oBAAoB,CAAC,GAC7B,AACL,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAK,SAClC,AAAI,EAAK,QAAQ,CACN,CAAC,EACJ,SACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,QAAQ,CA9jD9D,IA+jDG,IAAI,CAAC,SAAS,CAAC,GAAO,CAEtB,CAAC,SAAW,IAAI,CAAC,SAAS,CAAC,GAAO,AAC7C,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAK,EACjC,IAAI,EAAQ,EAAO,IAAI,CASvB,OARA,EAAW,WACP,EAAS,CACL,QAAU,EAAQ,IAClB,EAAK,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CAzkD1D,GA0kDI,IACH,AACL,GACA,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAAE,AAvlDzB,GAulDyB,EAjkDlC,GA3BI,IA6lDF,CACX,EAEA,cAAe,SAAU,CAAI,CAAE,CAAK,EAChC,IAAI,EAAQ,EAAO,IAAI,CASvB,OARA,EAAW,WACP,EAAS,CACL,OAAS,EAAQ,IACjB,EAAK,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAtlD5D,GAulDI,IACH,AACL,GACA,EAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAK,IAAI,CAAE,AApmDzB,GAomDyB,EA9kDlC,GA3BI,IA0mDF,CACX,CAEJ,EAEA,EAAM,EAAc,SAAS,CAAE,EAAc,SAAS,EAItD,EAAc,UAAU,CAAG,CAEvB,mBAAoB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACjD,IAAI,EAAQ,EAAG,EAKf,IAAK,AAJD,EAAW,QAAQ,CAAG,GACtB,CAAA,GAxnDK,CAunDT,EAGA,EAAS,EAAE,CACN,EAAI,EAAG,EAAK,EAAK,WAAW,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAChD,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,WAAW,CAAC,EAAE,CAAE,EAAW,UAAU,CAAE,IAC5E,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,GAG1B,OAAO,EAAa,EAAQ,EAAW,QAAQ,CAAE,EACrD,EAEA,qBAAsB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACnD,OAAO,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAK,KAAK,CAAE,EAAK,QAAQ,CAAE,EAAY,EACrF,EAEA,wBAAyB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACtD,OAAO,EAAa,IAAI,CAAC,oBAAoB,CAAC,GAAO,EAAW,aAAa,CAAE,EACnF,EAEA,sBAAuB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAIpD,OAHI,EAAW,WAAW,CAAG,GACzB,CAAA,GA9oDK,CA6oDT,EAGO,EACH,CACI,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,QAAQ,CAAE,GACxD,EAAQ,IAAM,EACd,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAE,EAAW,UAAU,CAAE,GAChE,EAAQ,IAAM,EACd,IAAI,CAAC,kBAAkB,CAAC,EAAK,SAAS,CAAE,EAAW,UAAU,CAAE,GAClE,CACD,EAAW,WAAW,CACtB,EAER,EAEA,kBAAmB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAIhD,MAHsB,OAAlB,EAAK,QAAQ,EACb,CAAA,GAzpDW,EAwpDf,EAGO,IAAI,CAAC,gBAAgB,CAAC,EAAM,EAAY,EACnD,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC/C,IAAI,EAAQ,EAAgB,EAAiB,EAAmB,EAAU,QA8B1E,CA7BA,EAAoB,CAAgB,CAAC,EAAK,QAAQ,CAAC,CACnD,EAAiB,AAAkB,OAAlB,EAAK,QAAQ,CAAY,EAAW,OAAO,CAAG,EAC/D,EAAkB,AAAkB,OAAlB,EAAK,QAAQ,CAAY,EAAoB,EAAoB,EAE/E,EAAoB,GACpB,CAAA,GA3qDK,CA0qDT,EASI,EADA,AAAiD,KAAjD,AAFJ,CAAA,EAAa,AAFb,CAAA,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAgB,EAA9D,EAEsB,QAAQ,EAA9B,EAEe,UAAU,CAAC,EAAW,MAAM,CAAG,IAAuB,EAAQ,IAAI,CAAC,mBAAmB,CAAC,EAAK,QAAQ,CAAC,UAAU,CAAC,IAClH,CAAC,EAAU,IAAgB,EAAK,QAAQ,CAAC,CAEzC,EAAK,EAAU,EAAK,QAAQ,EAGzC,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAiB,GAE5D,AAAkB,MAAlB,EAAK,QAAQ,EAAY,AAAkC,MAAlC,EAAS,QAAQ,GAAG,MAAM,CAAC,IACxD,AAA4B,MAA5B,EAAK,QAAQ,CAAC,KAAK,CAAC,KAAe,AAAoC,QAApC,EAAS,QAAQ,GAAG,KAAK,CAAC,EAAG,IAE5D,EAAO,IAAI,CAAC,KACZ,EAAO,IAAI,CAAC,IAEZ,EAAS,EAAK,EAAQ,GAGJ,OAAlB,EAAK,QAAQ,EAAa,CAAE,CAAA,AAnsDvB,EAmsDuB,CAAQ,GAGnC,AAAA,CAAA,AAAkB,OAAlB,EAAK,QAAQ,EAAa,AAAkB,OAAlB,EAAK,QAAQ,AAAK,GAAU,AAhsD5C,GAgsD4C,GAFhD,CAAC,IAAK,EAAQ,IAAI,CAKtB,EAAa,EAAQ,EAAmB,EACnD,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC7C,IAAI,EAAQ,EAAG,EAUf,IAAK,AAPL,EAAS,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,IAAI,CAlsD1D,GAksDmE,CAEnE,EAAK,QAAQ,EACb,EAAO,IAAI,CAAC,MAGhB,EAAO,IAAI,CAAC,KACP,EAAI,EAAG,EAAK,EAAK,SAAY,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACjD,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,SAAY,CAAC,EAAE,CAAE,EAAW,UAAU,CAzsD/E,IA0sDI,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,SAK1B,CAFA,EAAO,IAAI,CAAC,KAEN,AA9tDK,EA8tDL,GAIC,EAAa,EAAQ,EAAW,IAAI,CAAE,GAHlC,CAAC,IAAK,EAAQ,IAAI,AAIjC,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAO9C,OANI,EAAW,gBAAgB,CAAG,GAC9B,CAAA,GAvuDO,CAsuDX,EAMO,EAFM,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAE,EAAW,gBAAgB,CAAE,GAEvD,EAAW,gBAAgB,CAAE,EAC7D,EAEA,cAAe,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC5C,IAAI,EAAQ,EAAQ,EAAO,EAY3B,GAXA,EAAS,EAAK,SAAY,CAAC,MAAM,CAIjC,EAAa,AApvDM,EAovDN,GAAgC,CAAC,GAAe,AAAW,IAAX,EApuDzD,EAlBK,EAwvDT,EAAS,EACL,MACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,GAAG,CAAE,IAGrD,CAAE,CAAA,AA3vDa,EA2vDb,CAAQ,GAAyB,GAAe,EAAS,EAAG,CAE9D,IADA,EAAO,IAAI,CAAC,KACP,EAAI,EAAgB,EAAR,EAAgB,EAAE,EAC/B,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,SAAY,CAAC,EAAE,CAAE,EAAW,UAAU,CAjvDnF,IAkvDQ,EAAI,EAFK,GAGT,EAAO,IAAI,CAAC,IAAM,GAG1B,EAAO,IAAI,CAAC,IAChB,CAEA,OAAO,EAAa,EAAQ,EAAW,GAAG,CAAE,EAChD,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC/C,IAAI,EAAQ,EAmCZ,OAhCA,EAAS,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,IAAI,CAAG,AA9wDtD,EA8wDsD,EAjwD7D,EAdK,GA+wD+F,CAEpG,EAAK,QAAQ,EACT,EAAK,QAAQ,EACb,EAAO,IAAI,CAAC,MAGhB,EAAO,IAAI,CAAC,KACZ,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,QAAQ,CAAE,AAtxDjE,EAsxDiE,EAxwDxE,EAGA,IAswDA,EAAO,IAAI,CAAC,OAER,CAAC,EAAK,QAAQ,EAAI,EAAK,MAAM,CAAC,IAAI,GAAK,EAAO,OAAO,EAAI,AAA6B,UAA7B,OAAO,EAAK,MAAM,CAAC,KAAK,EASzE,AAAwB,EAAxB,AARR,CAAA,EAAW,EAAuB,GAAQ,QAAQ,EAAlD,EAQiB,OAAO,CAAC,MACjB,CAAC,SAAS,IAAI,CAAC,IACf,EAAQ,IAAI,CAAC,cAAc,CAAC,EAAS,UAAU,CAAC,EAAS,MAAM,CAAG,KAClE,CAAE,CAAA,EAAS,MAAM,EAAI,GAAK,AAA2B,KAA3B,EAAS,UAAU,CAAC,EAAO,GAEzD,EAAO,IAAI,CAAC,KAGpB,EAAO,IAAI,CAAC,EAAK,QAAQ,CAAG,KAAO,KACnC,EAAO,IAAI,CAAC,EAAmB,EAAK,QAAQ,IAGzC,EAAa,EAAQ,EAAW,MAAM,CAAE,EACnD,EAEA,aAAc,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC3C,IAAI,EAKJ,MAHA,AADA,CAAA,EAAS,EAAE,AAAF,EACF,IAAI,CAAC,AAAqB,UAArB,OAAO,EAAK,IAAI,CAAgB,EAAK,IAAI,CAAG,EAAmB,EAAK,IAAI,GACpF,EAAO,IAAI,CAAC,KACZ,EAAO,IAAI,CAAC,AAAyB,UAAzB,OAAO,EAAK,QAAQ,CAAgB,EAAK,QAAQ,CAAG,EAAmB,EAAK,QAAQ,GACzF,EAAa,EAAQ,EAAW,MAAM,CAAE,EACnD,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAAQ,EAAU,EAAe,EAAY,EA2BjD,OA1BA,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,KAAK,CA9yD9D,GAgzDA,AAAU,KAAV,EACA,EAAS,EAAK,EAAK,QAAQ,CAAE,IAE7B,EAAS,CAAC,EAAK,QAAQ,CAAC,CACpB,EAAK,QAAQ,CAAC,MAAM,CAAG,EAGvB,EAAS,EAAK,EAAQ,IAKtB,EAAe,AADf,CAAA,EAAa,EAAuB,GAAQ,QAAQ,EAApD,EAC0B,UAAU,CAAC,EAAW,MAAM,CAAG,GACzD,EAAgB,EAAS,QAAQ,GAAG,UAAU,CAAC,GAE3C,CAAA,AAAE,CAAA,AAAiB,KAAjB,GAAkC,AAAiB,KAAjB,CAAiB,GAAkB,IAAiB,GACnF,EAAQ,IAAI,CAAC,mBAAmB,CAAC,IAAiB,EAAQ,IAAI,CAAC,mBAAmB,CAAC,EAAA,GACxF,EAAO,IAAI,CAAC,KAGZ,EAAO,IAAI,CAAC,KAIjB,EAAa,EAAQ,EAAW,KAAK,CAAE,EAClD,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAYJ,OAVI,EADA,EAAK,QAAQ,CACJ,SAEA,QAET,EAAK,QAAQ,EACb,CAAA,EAAS,EACL,EACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,KAAK,CAr1D3D,GAk1DJ,EAMO,EAAa,EAAQ,EAAW,KAAK,CAAE,EAClD,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAK9C,OAAO,EAJM,EACT,EAAK,GAAG,CAAG,SAAW,QACtB,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,KAAK,CA91DvD,IAg2DwB,EAAW,KAAK,CAAE,EAClD,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,SAC/C,AAAI,EAAK,MAAM,CACJ,EACH,CACI,EAAK,QAAQ,CACb,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,KAAK,CAx2D/D,GAy2DK,CACD,EAAW,KAAK,CAChB,GAGD,EACH,CACI,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,OAAO,CAh3D7D,GAi3DI,EAAK,QAAQ,CAChB,CACD,EAAW,OAAO,CAClB,EAER,EAEA,mBAAoB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACjD,IAAI,EAAS,CACT,EAAoB,EAAM,CAAA,GAC1B,WACH,CAQD,OAPI,EAAK,EAAE,EACP,EAAO,IAAI,CAAC,EAAmB,IAAS,KACxC,EAAO,IAAI,CAAC,EAAmB,EAAK,EAAE,IAEtC,EAAO,IAAI,CAAC,EAAmB,IAAS,GAE5C,EAAO,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAC/B,CACX,EAEA,aAAc,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC3C,OAAO,IAAI,CAAC,eAAe,CAAC,EAAM,EAAY,EAAO,CAAA,EACzD,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,CAAE,CAAS,EACzD,IAAI,EAAQ,EAAW,EAAO,IAAI,QAClC,AAAK,EAAK,QAAQ,CAAC,MAAM,EAIzB,EAAS,CAAC,IAAK,AADf,CAAA,EAAY,CAAA,GAAoB,EAAK,QAAQ,CAAC,MAAM,CAAG,CAAA,EAC5B,EAAU,GAAG,CACxC,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EACP,IAAK,EAAI,EAAG,EAAK,EAAK,QAAQ,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EACxC,EAAK,QAAQ,CAAC,EAAE,EAQjB,EAAO,IAAI,CAAC,EAAY,EAAS,IACjC,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,QAAQ,CAAC,EAAE,CAAE,EAAW,UAAU,CA95DnF,MAs5DY,GACA,EAAO,IAAI,CAAC,GAEZ,EAAI,IAAM,GACV,EAAO,IAAI,CAAC,MAMhB,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAO,CAAA,EAAY,EAAU,CAAA,EAGrD,GACI,GAAa,CAAC,EAAuB,EAAuB,GAAQ,QAAQ,KAC5E,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,EAAY,EAAO,IAC/B,EAAO,IAAI,CAAC,KACL,GA5BI,IA6Bf,EAEA,YAAa,SAAS,CAAI,CAAE,CAAU,CAAE,CAAK,EACzC,MAAO,MAAQ,IAAI,CAAC,eAAe,CAAC,EAAK,QAAQ,CACrD,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAAQ,EAWZ,OAVA,EAAS,CAAC,QAAQ,CACd,EAAK,EAAE,EACP,CAAA,EAAS,EAAK,EAAQ,IAAI,CAAC,kBAAkB,CAAC,EAAK,EAAE,CAAE,EAAW,QAAQ,CAr7D1E,GAo7DJ,EAGI,EAAK,UAAU,GACf,EAAW,EAAK,UAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,UAAU,CAAE,EAAW,KAAK,CAx7DpF,IAy7DA,EAAS,EAAK,EAAQ,IAE1B,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAK,IAAI,CAh7DvC,KAi7DE,CACX,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC/C,IAAI,EAAQ,EAkBZ,OAhBI,EADA,EAAK,MAAS,CACL,CAAC,SAAW,EAAM,CAElB,EAAE,CAGX,EADA,AAAc,QAAd,EAAK,IAAI,EAAc,AAAc,QAAd,EAAK,IAAI,CACrB,CACP,EAAK,EAAK,IAAI,CAAE,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,GAChE,IAAI,CAAC,oBAAoB,CAAC,EAAK,KAAK,EACvC,CAEU,CACP,EAAqB,GACrB,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,EAChD,IAAI,CAAC,oBAAoB,CAAC,EAAK,KAAK,EACvC,CAEE,EAAK,EAAQ,EACxB,EAEA,SAAU,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,QACvC,AAAI,AAAc,QAAd,EAAK,IAAI,EAAc,AAAc,QAAd,EAAK,IAAI,CACzB,CACH,EAAK,IAAI,CAAE,IACX,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,EAChD,IAAI,CAAC,oBAAoB,CAAC,EAAK,KAAK,EACvC,CAGD,EAAK,SAAS,CACd,AAAI,AAAoB,sBAApB,EAAK,KAAK,CAAC,IAAI,CACR,IAAI,CAAC,iBAAiB,CAAC,EAAK,KAAK,CAAE,EAAW,QAAQ,CAj+DjE,GAm+DO,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,EAG3D,AAAI,EAAK,MAAM,CACJ,CACH,EAAqB,GACrB,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,EAChD,IAAI,CAAC,oBAAoB,CAAC,EAAK,KAAK,EACvC,CAGE,CACH,IAAI,CAAC,mBAAmB,CAAC,EAAK,GAAG,CAAE,EAAK,QAAQ,EAChD,IAAM,EACN,IAAI,CAAC,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,UAAU,CAj/DzD,GAk/DH,AACL,EAEA,iBAAkB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC/C,IAj7DmB,EAi7Df,EAAW,EAAQ,EAAU,EAAO,IAAI,QAE5C,AAAK,EAAK,UAAU,CAAC,MAAM,EAG3B,EAAY,EAAK,UAAU,CAAC,MAAM,CAAG,EAErC,EAAW,WACP,EAAW,EAAK,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CA9/D1E,EA+/DJ,GAEK,IA57Dc,EAq8DQ,EAAuB,GAAU,QAAQ,GAp8DjE,UAAY,IAAI,CAAC,MAy8DpB,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EAGP,GAFA,EAAS,CAAE,IAAK,EAAS,EAAQ,EAAU,CAEvC,EAEA,IAAK,AADL,EAAO,IAAI,CAAC,IAAM,GACb,EAAI,EAAG,EAAK,EAAK,UAAU,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC/C,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CAvhEnF,IAwhEY,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAM,EAIlC,GAEK,EAAuB,EAAuB,GAAQ,QAAQ,KAC/D,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,GACZ,EAAO,IAAI,CAAC,KACL,GAzBQ,CAAE,IAAK,EAAO,EAAU,EAAO,IAAK,CAlBxC,IA4Cf,EAEA,kBAAmB,SAAS,CAAI,CAAE,CAAU,CAAE,CAAK,EAC/C,OAAO,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAK,KAAK,CAAE,IAAK,EAAY,EAC3E,EAEA,cAAe,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC5C,IAAI,EAAQ,EAAG,EAAI,EAAW,EAAU,EAAO,IAAI,CACnD,GAAI,CAAC,EAAK,UAAU,CAAC,MAAM,CACvB,MAAO,KAIX,GADA,EAAY,CAAA,EACR,AAA2B,IAA3B,EAAK,UAAU,CAAC,MAAM,CAGlB,AAFJ,CAAA,EAAW,EAAK,UAAU,CAAC,EAAE,AAAF,EAEd,IAAI,GAAK,EAAO,QAAQ,EAC9B,EAAS,KAAK,CAAC,IAAI,GAAK,EAAO,UAAU,EAE5C,CAAA,EAAY,CAAA,CAJhB,OAOA,IAAK,EAAI,EAAG,EAAK,EAAK,UAAU,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAE/C,GACI,AAFJ,CAAA,EAAW,EAAK,UAAU,CAAC,EAAE,AAAF,EAEd,IAAI,GAAK,EAAO,QAAQ,EAC9B,CAAC,EAAS,SAAS,CACxB,CACE,EAAY,CAAA,EACZ,KACJ,CAqBR,OAlBA,EAAS,CAAC,IAAK,EAAY,EAAU,GAAI,CAEzC,EAAW,SAAU,CAAM,EACvB,IAAI,EAAG,EACP,IAAK,EAAI,EAAG,EAAK,EAAK,UAAU,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC/C,EAAO,IAAI,CAAC,EAAY,EAAS,IACjC,EAAO,IAAI,CAAC,EAAK,kBAAkB,CAAC,EAAK,UAAU,CAAC,EAAE,CAAE,EAAW,QAAQ,CA5kE/E,IA6kEQ,EAAI,EAAI,GACR,EAAO,IAAI,CAAC,IAAO,CAAA,EAAY,EAAU,CAAA,EAGrD,GAEI,GAAa,CAAC,EAAuB,EAAuB,GAAQ,QAAQ,KAC5E,EAAO,IAAI,CAAC,GAEhB,EAAO,IAAI,CAAC,EAAY,EAAO,IAC/B,EAAO,IAAI,CAAC,KACL,CACX,EAEA,eAAgB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC7C,MAAO,MACX,EAEA,MAAO,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACpC,MAAO,OACX,EAEA,WAAY,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACzC,OAAO,EAAmB,EAC9B,EAEA,uBAAwB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACrD,OAAO,EAAmB,EAAK,EAAE,EAAI,EAAK,KAAK,CACnD,EAEA,yBAA0B,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACvD,IAAI,EAAS,CAAC,IAAI,CACd,EAAK,EAAK,EAAE,EAAI,EAAK,KAAK,CAI9B,OAHI,GACA,EAAO,IAAI,CAAC,EAAQ,KAAO,IAAiB,EAAmB,IAE5D,CACX,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAAW,EAAK,QAAQ,CACxB,EAAS,CAAE,EAAS,IAAI,CAAE,CAC1B,EAAQ,EAAK,KAAK,CAItB,OAHI,GAAS,EAAM,IAAI,GAAK,EAAS,IAAI,EACrC,EAAO,IAAI,CAAC,IAAiB,KAAO,IAAiB,EAAmB,IAErE,CACX,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAAQ,EAAK,KAAK,CAClB,EAAS,CAAE,EAAM,IAAI,CAAE,CACvB,EAAW,EAAK,QAAQ,CAI5B,OAHI,GAAY,EAAS,IAAI,GAAK,EAAM,IAAI,EACxC,EAAO,IAAI,CAAC,IAAiB,KAAO,IAAiB,EAAmB,IAErE,CACX,EAEA,QAAS,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACtC,IAAI,EACJ,GAAI,EAAK,cAAc,CAAC,QAAU,GAAS,EAAM,GAAG,CAChD,GAAI,CAEA,GAAI,AADJ,CAAA,EAAM,EAAM,EAAK,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,UAAU,AAAV,EACtB,IAAI,GAAK,EAAO,OAAO,EACvB,EAAI,KAAK,GAAK,EAAK,KAAK,CACxB,OAAO,EAAK,GAAG,AAG3B,CAAE,MAAO,EAAG,CAEZ,QAGJ,AAAI,EAAK,KAAK,CACL,IAAM,EAAK,KAAK,CAAC,OAAO,CAAG,IAAM,EAAK,KAAK,CAAC,KAAK,CAGtD,AAAsB,UAAtB,OAAO,EAAK,KAAK,CACV,EAAK,KAAK,CAAC,QAAQ,GAAK,IAK/B,EAAK,MAAM,CACJ,EAAK,MAAM,CAAG,IAGrB,AAAe,OAAf,EAAK,KAAK,CACH,OAGP,AAAsB,UAAtB,OAAO,EAAK,KAAK,CACV,AA/3DnB,SAAsB,CAAG,EACrB,IAAiB,EAAG,EAAK,EAA0C,EAAQ,EAAvE,EAAS,GAAkB,EAAe,EAAG,EAAe,EAEhE,IAAK,EAAI,EAAG,EAAM,EAAI,MAAM,CAAE,EAAI,EAAK,EAAE,EAAG,CAExC,GAAI,AAAS,KADb,CAAA,EAAO,EAAI,UAAU,CAAC,EAAtB,EAEI,EAAE,OACC,GAAI,AAAS,KAAT,EACP,EAAE,OACC,GAAI,AAAS,KAAT,GAA0B,EACjC,GAAU,UACP,GAAI,EAAQ,IAAI,CAAC,gBAAgB,CAAC,IAAS,AAAS,KAAT,EAAwB,CACtE,GAAU,AAxDtB,SAAmC,CAAI,EACnC,GAAI,AAAS,KAAT,EACA,MAAO,OAGX,GAAI,AAAS,KAAT,EACA,MAAO,MAGX,GAAI,AAAS,KAAT,EACA,MAAO,MAGX,GAAI,AAAS,OAAT,EACA,MAAO,UAGX,GAAI,AAAS,OAAT,EACA,MAAO,SAGX,OAAM,AAAI,MAAM,mCACpB,EAkCgD,GACpC,QACJ,MAAO,GAAI,CAAC,EAAQ,IAAI,CAAC,mBAAmB,CAAC,IAAU,CAAA,GAAQ,EAAO,IAAkB,CAAC,GAAQ,CAAC,GAAe,CAAA,EAAO,IAAkB,EAAO,GAAA,CAAG,EAAc,CAC9J,GAAU,AAtFtB,SAAgC,CAAI,CAAE,CAAI,EACtC,IAAI,SAEJ,AAAI,AAAS,IAAT,EACO,MAGP,AAAS,KAAT,EACO,MAGP,AAAS,IAAT,EACO,OAGX,EAAM,EAAK,QAAQ,CAAC,IAAI,WAAW,GAC/B,GAAQ,EAAO,KACR,MAAQ,OAAO,KAAK,CAAC,EAAI,MAAM,EAAI,EACnC,AAAS,IAAT,GAAoB,EAAQ,IAAI,CAAC,cAAc,CAAC,GAEhD,AAAS,KAAT,EACA,QAEA,MAAQ,KAAK,KAAK,CAAC,EAAI,MAAM,EAAI,EAJjC,KAMf,EA6D6C,EAAM,EAAI,UAAU,CAAC,EAAI,IAC1D,QACJ,CACA,GAAU,OAAO,YAAY,CAAC,EAClC,CAKA,GAFA,EAAQ,AADR,CAAA,EAAS,CAAE,CAAA,AAAW,WAAX,GAAwB,AAAW,SAAX,GAAqB,EAAe,CAAA,CAAY,EAClE,IAAO,IAEpB,CAAE,CAAA,EAAS,EAAe,CAAA,EAC1B,OAAO,EAAQ,EAAS,EAM5B,IAAK,EAAI,EAHT,EAAM,EACN,EAAS,EAEG,EAAM,EAAI,MAAM,CAAE,EAAI,EAAK,EAAE,EAEjC,CAAA,AAAU,KADd,CAAA,EAAO,EAAI,UAAU,CAAC,EAAtB,GAC+B,GAAY,AAAS,KAAT,GAA0B,CAAC,CAAA,GAClE,CAAA,GAAU,IADd,EAGA,GAAU,OAAO,YAAY,CAAC,GAGlC,OAAO,EAAS,CACpB,EAu1DgC,EAAK,KAAK,EAG9B,AAAsB,UAAtB,OAAO,EAAK,KAAK,CACV,AA9jEnB,SAAwB,CAAK,EACzB,IAAI,EAAQ,EAAO,EAAM,EAAU,EAEnC,GAAI,GAAU,EACV,MAAM,AAAI,MAAM,sCAEpB,GAAI,EAAQ,GAAM,AAAU,IAAV,GAAe,EAAI,EAAQ,EACzC,MAAM,AAAI,MAAM,2CAGpB,GAAI,IAAU,EAAI,EACd,OAAO,EAAO,OAAS,EAAW,QAAU,SAIhD,GADA,EAAS,GAAK,EACV,CAAC,GAAY,EAAO,MAAM,CAAG,EAC7B,OAAO,EAoBX,IAjBA,EAAQ,EAAO,OAAO,CAAC,KAClB,GAAQ,AAAyB,KAAzB,EAAO,UAAU,CAAC,IAAwB,AAAU,IAAV,IACnD,EAAQ,EACR,EAAS,EAAO,KAAK,CAAC,IAE1B,EAAO,EACP,EAAS,EAAO,OAAO,CAAC,KAAM,KAC9B,EAAW,EACN,CAAA,EAAM,EAAK,OAAO,CAAC,IAAA,EAAQ,IAC5B,EAAW,CAAC,EAAK,KAAK,CAAC,EAAM,GAC7B,EAAO,EAAK,KAAK,CAAC,EAAG,IAErB,GAAS,IACT,GAAY,EAAK,MAAM,CAAG,EAAQ,EAClC,EAAO,CAAE,CAAA,EAAK,KAAK,CAAC,EAAG,GAAS,EAAK,KAAK,CAAC,EAAQ,EAAA,EAAM,IAE7D,EAAM,EACC,AAA2C,KAA3C,EAAK,UAAU,CAAC,EAAK,MAAM,CAAG,EAAM,IACvC,EAAE,EAeN,OAbY,IAAR,IACA,GAAY,EACZ,EAAO,EAAK,KAAK,CAAC,EAAG,IAER,IAAb,GACA,CAAA,GAAQ,IAAM,CADlB,EAGK,CAAA,EAAK,MAAM,CAAG,EAAO,MAAM,EACnB,GAAe,EAAQ,MAAQ,KAAK,KAAK,CAAC,KAAW,GAAU,AAAA,CAAA,EAAO,KAAO,EAAM,QAAQ,CAAC,GAAA,EAAK,MAAM,CAAG,EAAO,MAAM,AAAN,GACtH,CAAC,IAAS,GACd,CAAA,EAAS,CAHb,EAMO,CACX,EAygEkC,EAAK,KAAK,EAGhC,AAAsB,WAAtB,OAAO,EAAK,KAAK,CACV,EAAK,KAAK,CAAG,OAAS,QAG1B,AAjgEf,SAAwB,CAAG,EACvB,IAAI,EAAO,EAAQ,EAAO,EAAG,EAAI,EAAI,EAAkB,EAIvD,GAFA,EAAS,EAAI,QAAQ,GAEjB,EAAI,MAAM,CAAE,CAGZ,GAAI,CADJ,CAAA,EAAQ,EAAO,KAAK,CAAC,aAArB,EAEI,OAAO,EAQX,IAAK,EAAI,EALT,EAAQ,CAAK,CAAC,EAAE,CAChB,EAAS,GAET,EAAmB,CAAA,EACnB,EAAsB,CAAA,EACV,EAAK,EAAI,MAAM,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC1C,EAAK,EAAI,MAAM,CAAC,UAAU,CAAC,GAEtB,GAgBD,GAAU,EAAsB,EAAI,GAEpC,EAAsB,CAAA,IAjBlB,EACW,KAAP,GACA,CAAA,EAAmB,CAAA,CADvB,EAII,AAAO,KAAP,EACA,GAAU,KACI,KAAP,GACP,CAAA,EAAmB,CAAA,CADhB,EAIX,GAAU,EAAsB,EAAI,GACpC,EAAsB,AAAO,KAAP,GAS9B,MAAO,IAAM,EAAS,IAAM,CAChC,CAEA,OAAO,CACX,EAm9D8B,EAAK,KAAK,CACpC,EAEA,oBAAqB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAClD,OAAO,IAAI,CAAC,uBAAuB,CAAC,EAAM,EAAY,EAC1D,EAEA,wBAAyB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAItD,IAAI,EAAQ,EAAG,EAAI,EAAU,EAAO,IAAI,CAkCxC,OAjCA,EAAU,EAAK,IAAI,GAAK,EAAO,mBAAmB,CAAI,CAAC,IAAI,CAAG,CAAC,IAAI,CAE/D,EAAM,GAAG,CAAC,2CAA2C,GACrD,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,UAAU,CApsEnE,GAqsEA,EAAO,IAAI,CAAC,IAGZ,EAAK,MAAM,EACX,EAAW,WACP,IAAK,EAAI,EAAG,EAAK,EAAK,MAAM,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC3C,EAAW,EAAK,kBAAkB,CAAC,EAAK,MAAM,CAAC,EAAE,CAAE,EAAW,QAAQ,CA3sE9E,GA4sEY,EAAI,GAAK,EAAM,GAAG,CAAC,2CAA2C,CAC9D,EAAS,EAAK,EAAQ,GAEtB,EAAO,IAAI,CAAC,EAGxB,GAGA,EAAK,MAAM,GACX,EAAS,EAAK,EAAQ,KAAO,GAC7B,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,QAAQ,CAvtEnE,GAwtEA,EAAS,EAAK,EAAQ,CAAE,IAAK,EAAU,IAAK,GAG3C,EAAM,GAAG,CAAC,2CAA2C,GACtD,EAAW,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,UAAU,CA5tEnE,GA8tEA,EAAS,EAAK,EAAQ,IAG1B,EAAO,IAAI,CAAC,EAAM,IAAI,GAAK,EAAO,mBAAmB,CAAI,IAAM,KACxD,CACX,EAEA,mBAAoB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACjD,IAAI,EAaJ,OAHA,EAAW,EARP,EADA,EAAK,IAAI,CAAC,IAAI,GAAK,EAAO,mBAAmB,CAClC,CACP,EAAK,IAAI,CAAC,IAAI,CAAE,IAChB,IAAI,CAAC,iBAAiB,CAAC,EAAK,IAAI,CAAC,YAAY,CAAC,EAAE,CA7tEnD,GA8tEA,CAEU,IAAI,CAAC,kBAAkB,CAAC,EAAK,IAAI,CAAE,EAAW,IAAI,CA7uE7D,GAgvEsB,EAAK,EAAE,CAAG,KAAO,MAC3C,EAAW,EAAK,EAAU,IAAI,CAAC,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,QAAQ,CAjvE7E,IAmvEG,CAAE,MAAQ,EAAQ,IAAK,EAAU,IAAK,AACjD,EAEA,cAAe,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC5C,MAAO,CACH,MACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,QAAQ,CAAE,EAAW,UAAU,CAzvE5D,GA0vEH,AACL,EAEA,yBAA0B,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EACvD,IAAI,EA/vEA,EAuwEJ,OApxEW,EA6wEL,GACF,CAAA,EA/wEK,CA8wET,EAOO,EAJM,CACT,IAAI,CAAC,kBAAkB,CAAC,EAAK,GAAG,CAAE,EAAW,IAAI,CAAE,GACnD,IAAI,CAAC,kBAAkB,CAAC,EAAK,KAAK,CAAE,EAAW,OAAO,CAjxEvC,GAkxElB,CAC2B,EAAW,cAAc,CAAE,EAC3D,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAG9C,OAAO,EAAK,KAAK,CAAC,GAAG,AACzB,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,IAAI,EAAQ,EAAG,EAEf,IAAK,EAAI,EADT,EAAS,CAAE,IAAK,CACJ,EAAK,EAAK,MAAM,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAC3C,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAC,EAAE,CAAE,EAAW,OAAO,CAnxEtE,IAoxEI,EAAI,EAAI,IACR,EAAO,IAAI,CAAC,KAAO,GACnB,EAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAK,WAAW,CAAC,EAAE,CAAE,EAAW,QAAQ,CAtxEhF,IAuxEI,EAAO,IAAI,CAAC,EAAQ,MAI5B,OADA,EAAO,IAAI,CAAC,KACL,CACX,EAEA,gBAAiB,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,EAC9C,OAAO,IAAI,CAAC,OAAO,CAAC,EAAM,EAAY,EAC1C,EAEA,iBAAkB,SAAS,CAAI,CAAE,CAAU,CAAE,CAAI,EAC7C,OAAO,EAAa,CAChB,UACA,IAAI,CAAC,kBAAkB,CAAC,EAAK,MAAM,CAAE,EAAW,UAAU,CAryE1D,GAsyEA,IACH,CAAE,EAAW,IAAI,CAAE,EACxB,CACJ,EAEA,EAAM,EAAc,SAAS,CAAE,EAAc,UAAU,EAEvD,EAAc,SAAS,CAAC,kBAAkB,CAAG,SAAU,CAAI,CAAE,CAAU,CAAE,CAAK,MACtE,EAAQ,EAlqDR,EAAU,QAsqDd,CAFA,EAAO,EAAK,IAAI,EAAI,EAAO,QAAQ,CAE/B,EAAM,QAAQ,EAAI,EAAK,cAAc,CAAC,EAAM,QAAQ,GA1pDjD,EATH,AAAoB,UAApB,MAFJ,CAAA,EAAW,AAsqDiB,CAtqDb,CAAC,EAAM,QAAQ,CAAC,AAAD,EAGjB,EAAa,EAAuB,GAAW,EAAW,QAAQ,CAmqD7C,GA9pDrB,EAFA,EAAuB,EAAS,OAAO,EACzC,AAAwB,MAAxB,EAAU,UAAU,CAAY,EAAS,UAAU,CAAG,EAAW,QAAQ,CA+pDlD,GAAN,IAG5B,EAAS,IAAI,CAAC,EAAK,CAAC,EAAM,EAAY,GAGlC,EAAM,OAAO,EACb,CAAA,EAAS,EAAY,EAAM,EAD/B,EAGO,EAAuB,EAAQ,GAC1C,EAEA,EAAc,SAAS,CAAC,iBAAiB,CAAG,SAAU,CAAI,CAAE,CAAK,EAC7D,IAAI,EACA,EAeJ,OAbA,EAAS,IAAI,CAAC,EAAK,IAAI,CAAC,CAAC,EAAM,GAI3B,EAAM,OAAO,EACb,CAAA,EAAS,EAAY,EAAM,EAD/B,EAIA,EAAW,EAAuB,GAAQ,QAAQ,GAC9C,EAAK,IAAI,GAAK,EAAO,OAAO,EAAK,GAAqB,AAAY,KAAZ,GAAmB,AAAyC,OAAzC,EAAS,MAAM,CAAC,EAAS,MAAM,CAAG,IAC3G,CAAA,EAAS,EAAY,EAAuB,GAAQ,YAAY,CAAC,OAAQ,IAAM,EAAS,OAAO,CAAC,OAAQ,GAD5G,EAIO,EAAuB,EAAQ,EAC1C,EAoGA,EAAgB,CACZ,OAAQ,CACJ,MAAO,GACP,KAAM,CACV,EACA,SAAU,CAAA,EACV,YAAa,CAAA,EACb,OAAQ,OACR,WAAY,CAAA,EACZ,QAAS,CAAA,EACT,YAAa,CAAA,EACb,WAAY,CAAA,CAChB,EAEA,EAAkB,IAAoB,MAAM,CAE5C,EAAQ,OAAO,CAAG,EAAQ,oBAAkB,OAAO,CACnD,EAAQ,QAAQ,CApGhB,SAAkB,CAAI,CAAE,CAAO,EAC3B,IAA0C,EAAQ,EAA9C,EAAiB,UA2DrB,CAzDI,AAAW,MAAX,GAO8B,UAA1B,OAAO,EAAQ,MAAM,EACrB,CAAA,EAAe,MAAM,CAAC,MAAM,CAAC,KAAK,CAAG,EAAQ,MAAM,AAAN,EAErB,UAAxB,OAAO,EAAQ,IAAI,EACnB,CAAA,EAAe,MAAM,CAAC,MAAM,CAAC,IAAI,CAAG,EAAQ,IAAI,AAAJ,EAGhD,EAAS,AADT,CAAA,EAAU,EAAa,EAAgB,EAAvC,EACiB,MAAM,CAAC,MAAM,CAAC,KAAK,CAEhC,EADA,AAAwB,UAAxB,OAAO,EAAQ,IAAI,CACZ,EAAQ,IAAI,CAEZ,EAAa,EAAQ,EAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,GAK1D,EAAO,EADP,EAAS,AADT,CAAA,EAAU,CAAV,EACiB,MAAM,CAAC,MAAM,CAAC,KAAK,CACR,EAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,EAE1D,EAAO,EAAQ,MAAM,CAAC,IAAI,CAC1B,EAAW,EAAQ,MAAM,CAAC,QAAQ,CAClC,EAAc,CAAA,GAAe,EAAQ,MAAM,CAAC,WAAW,CACvD,EAAS,EAAO,SAAW,EAAQ,MAAM,CAAC,MAAM,CAChD,EAAa,EAAQ,MAAM,CAAC,UAAU,CACtC,EAAU,EAAQ,MAAM,CAAC,OAAO,CAChC,EAAQ,EAAQ,MAAM,CAAC,KAAK,CACxB,EAAQ,MAAM,CAAC,OAAO,EACtB,CAAA,EAAU,EAAQ,EAAS,EAAO,EADtC,EAGA,EAAc,EAAQ,MAAM,CAAC,WAAW,CACxC,EAAa,EAAQ,MAAM,CAAC,UAAU,CACtC,EAAoB,EAAQ,MAAM,CAAC,iBAAiB,CACpD,EAAY,EAAQ,SAAS,CAC7B,EAAQ,EAAO,KAAO,EAAQ,KAAK,CACnC,EAAY,EAAQ,SAAS,CAC7B,EAAa,EAAQ,UAAU,CAC/B,EAAqB,EAAQ,MAAM,CAAC,kBAAkB,EAAI,AAAe,OAAf,EAC1D,EAAQ,EAEJ,IAMI,EALC,EAAQ,OAAO,CAKH,EAAO,SAAS,CAAC,UAAU,CAF3B,EAAQ,mBAAc,UAAU,EAMrD,EAAS,AAzEb,SAA0B,CAAI,MACtB,EAGJ,GADA,EAAU,IAAI,EACV,EAAY,GACZ,OAAO,EAAQ,iBAAiB,CAAC,EAv2ExB,GA02Eb,GA96EO,EAAc,UAAU,CAAC,cAAc,CAAC,AA86E9B,EA96EmC,IAAI,EA+6EpD,OAAO,EAAQ,kBAAkB,CAAC,EAAM,EAAW,QAAQ,CA51EvD,EA+1ER,OAAM,AAAI,MAAM,sBAAwB,EAAK,IAAI,CACrD,EA4D8B,GAErB,IAML,EAAO,EAAO,qBAAqB,CAAC,CAChC,KAAM,EAAQ,IAAI,CAClB,WAAY,EAAQ,aAAa,AACrC,GAEI,EAAQ,aAAa,EACrB,EAAK,GAAG,CAAC,gBAAgB,CAAC,EAAQ,SAAS,CACjB,EAAQ,aAAa,EAG/C,EAAQ,iBAAiB,EAClB,EAGJ,EAAK,GAAG,CAAC,QAAQ,IAnBpB,EAAO,CAAC,KAAM,EAAO,QAAQ,GAAI,IAAK,IAAI,EACnC,EAAQ,iBAAiB,CAAG,EAAO,EAAK,IAAI,CAmB3D,EAoBA,EAAQ,cAAc,CAAG,EAAW,cAAc,CAClD,EAAQ,UAAU,CAAG,EAAa,CAAC,EAAG,GACtC,EAAQ,OAAO,CAAG,CAAA,EAClB,EAAQ,aAAa,CAAG,EACxB,EAAQ,eAAe,CAAG,CAC9B,G,E,C,mB,Q,mB,Q,gB,Q,mB,O,E,C,M,C,S,C,C,C,C,C,GC9kFC,AAAA,SAAS,EAAM,CAAO,EAGnB,IAAI,EACA,EACA,EACA,EACA,EACA,EAEJ,SAAS,EAAS,CAAG,EACjB,IAAc,EAAK,EAAf,EAAM,CAAC,EACX,IAAK,KAAO,EACJ,EAAI,cAAc,CAAC,KAEf,AAAe,UAAf,MADJ,CAAA,EAAM,CAAG,CAAC,EAAI,AAAJ,GACqB,AAAQ,OAAR,EAC3B,CAAG,CAAC,EAAI,CAAG,EAAS,GAEpB,CAAG,CAAC,EAAI,CAAG,GAIvB,OAAO,CACX,CA+LA,SAAS,EAAU,CAAM,CAAE,CAAG,EAC1B,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,GAAG,CAAG,CACf,CAgBA,SAAS,EAAQ,CAAI,CAAE,CAAI,CAAE,CAAI,CAAE,CAAG,EAClC,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,GAAG,CAAG,CACf,CAEA,SAAS,IAAe,CAuHxB,SAAS,EAAO,CAAI,SAChB,AAAY,MAAR,GAGG,AAAgB,UAAhB,OAAO,GAAqB,AAAqB,UAArB,OAAO,EAAK,IAAI,AACvD,CAEA,SAAS,EAAW,CAAQ,CAAE,CAAG,EAC7B,MAAO,AAAC,CAAA,IAAa,EAAO,gBAAgB,EAAI,IAAa,EAAO,aAAY,AAAZ,GAAkB,eAAiB,CAC3G,CAEA,SAAS,EAA2B,CAAS,CAAE,CAAS,EACpD,IAAK,IAAI,EAAI,EAAU,MAAM,CAAG,EAAG,GAAK,EAAG,EAAE,EACzC,GAAI,CAAS,CAAC,EAAE,CAAC,IAAI,GAAK,EACtB,MAAO,CAAA,EAGf,MAAO,CAAA,CACX,CAuQA,SAAS,EAAS,CAAI,CAAE,CAAO,EAE3B,OAAO,AADU,IAAI,IACH,QAAQ,CAAC,EAAM,EACrC,QAplBA,EAAS,CACL,qBAAsB,uBACtB,kBAAmB,oBACnB,gBAAiB,kBACjB,aAAc,eACd,wBAAyB,0BACzB,gBAAiB,kBACjB,eAAgB,iBAChB,iBAAkB,mBAClB,eAAgB,iBAChB,eAAgB,iBAChB,YAAa,cACb,gBAAiB,kBACjB,UAAW,YACX,iBAAkB,mBAClB,gBAAiB,kBACjB,mBAAoB,qBACpB,wBAAyB,0BACzB,sBAAuB,wBACvB,kBAAmB,oBACnB,kBAAmB,oBACnB,mBAAoB,qBACpB,iBAAkB,mBAClB,eAAgB,iBAChB,qBAAsB,uBACtB,yBAA0B,2BAC1B,uBAAwB,yBACxB,gBAAiB,kBACjB,oBAAqB,sBACrB,aAAc,eACd,eAAgB,iBAChB,eAAgB,iBAChB,oBAAqB,sBACrB,mBAAoB,qBACpB,oBAAqB,sBACrB,WAAY,aACZ,YAAa,cACb,iBAAkB,mBAClB,kBAAmB,oBACnB,uBAAwB,yBACxB,yBAA0B,2BAC1B,gBAAiB,kBACjB,QAAS,UACT,iBAAkB,mBAClB,kBAAmB,oBACnB,iBAAkB,mBAClB,aAAc,eACd,iBAAkB,mBAClB,gBAAiB,kBACjB,cAAe,gBACf,iBAAkB,mBAClB,cAAe,gBACf,kBAAmB,oBACnB,QAAS,UACT,SAAU,WACV,mBAAoB,qBACpB,YAAa,cACb,gBAAiB,kBACjB,mBAAoB,qBACpB,cAAe,gBACf,MAAO,QACP,gBAAiB,kBACjB,WAAY,aACZ,yBAA0B,2BAC1B,gBAAiB,kBACjB,gBAAiB,kBACjB,eAAgB,iBAChB,eAAgB,iBAChB,aAAc,eACd,gBAAiB,kBACjB,iBAAkB,mBAClB,oBAAqB,sBACrB,mBAAoB,qBACpB,eAAgB,iBAChB,cAAe,gBACf,gBAAiB,iBACrB,EAEA,EAAc,CACV,qBAAsB,CAAC,OAAQ,QAAQ,CACvC,kBAAmB,CAAC,OAAQ,QAAQ,CACpC,gBAAiB,CAAC,WAAW,CAC7B,aAAc,CAAC,WAAW,CAC1B,wBAAyB,CAAC,SAAU,OAAO,CAC3C,gBAAiB,CAAC,WAAW,CAC7B,eAAgB,CAAC,OAAO,CACxB,iBAAkB,CAAC,OAAQ,QAAQ,CACnC,eAAgB,CAAC,QAAQ,CACzB,eAAgB,CAAC,SAAU,YAAY,CACvC,YAAa,CAAC,QAAS,OAAO,CAC9B,gBAAiB,CAAC,aAAa,CAC/B,UAAW,CAAC,OAAO,CACnB,iBAAkB,CAAC,KAAM,aAAc,OAAO,CAC9C,gBAAiB,CAAC,KAAM,aAAc,OAAO,CAC7C,mBAAoB,CAAC,OAAQ,QAAQ,CACrC,wBAAyB,CAAC,SAAU,SAAU,OAAO,CACrD,sBAAuB,CAAC,OAAQ,aAAc,YAAY,CAC1D,kBAAmB,CAAC,QAAQ,CAC5B,kBAAmB,EAAE,CACrB,mBAAoB,EAAE,CACtB,iBAAkB,CAAC,OAAQ,OAAO,CAClC,eAAgB,EAAE,CAClB,qBAAsB,CAAC,SAAS,CAChC,yBAA0B,CAAC,cAAc,CACzC,uBAAwB,CAAC,cAAe,aAAc,SAAS,CAC/D,gBAAiB,CAAC,WAAY,QAAQ,CACtC,oBAAqB,CAAC,aAAa,CACnC,aAAc,CAAC,OAAQ,OAAQ,SAAU,OAAO,CAChD,eAAgB,CAAC,OAAQ,QAAS,OAAO,CACzC,eAAgB,CAAC,OAAQ,QAAS,OAAO,CACzC,oBAAqB,CAAC,KAAM,SAAU,OAAO,CAC7C,mBAAoB,CAAC,KAAM,SAAU,OAAO,CAC5C,oBAAqB,CAAC,SAAU,SAAU,OAAO,CACjD,WAAY,EAAE,CACd,YAAa,CAAC,OAAQ,aAAc,YAAY,CAChD,iBAAkB,CAAC,SAAS,CAC5B,kBAAmB,CAAC,aAAc,SAAS,CAC3C,uBAAwB,CAAC,QAAQ,CACjC,yBAA0B,CAAC,QAAQ,CACnC,gBAAiB,CAAC,WAAY,QAAQ,CACtC,QAAS,EAAE,CACX,iBAAkB,CAAC,QAAS,OAAO,CACnC,kBAAmB,CAAC,OAAQ,QAAQ,CACpC,iBAAkB,CAAC,SAAU,WAAW,CACxC,aAAc,CAAC,OAAQ,WAAW,CAClC,iBAAkB,CAAC,MAAO,QAAQ,CAClC,gBAAiB,EAAE,CACnB,cAAe,CAAC,SAAU,YAAY,CACtC,iBAAkB,CAAC,aAAa,CAChC,cAAe,CAAC,aAAa,CAC7B,kBAAmB,EAAE,CACrB,QAAS,CAAC,OAAO,CACjB,SAAU,CAAC,MAAO,QAAQ,CAC1B,mBAAoB,CAAC,MAAO,QAAQ,CACpC,YAAa,CAAE,WAAY,CAC3B,gBAAiB,CAAC,WAAW,CAC7B,mBAAoB,CAAC,cAAc,CACnC,cAAe,CAAC,WAAW,CAC3B,MAAO,EAAE,CACT,gBAAiB,CAAC,eAAgB,QAAQ,CAC1C,WAAY,CAAC,OAAQ,aAAa,CAClC,yBAA0B,CAAC,MAAO,QAAQ,CAC1C,gBAAiB,EAAE,CACnB,gBAAiB,CAAC,SAAU,cAAc,CAC1C,eAAgB,EAAE,CAClB,eAAgB,CAAC,WAAW,CAC5B,aAAc,CAAC,QAAS,UAAW,YAAY,CAC/C,gBAAiB,CAAC,WAAW,CAC7B,iBAAkB,CAAC,WAAW,CAC9B,oBAAqB,CAAC,eAAe,CACrC,mBAAoB,CAAC,KAAM,OAAO,CAClC,eAAgB,CAAC,OAAQ,OAAO,CAChC,cAAe,CAAC,SAAU,OAAO,CACjC,gBAAiB,CAAC,WAAW,AACjC,EAOA,EAAgB,CACZ,MALJ,EAAQ,CAAC,EAML,KALJ,EAAO,CAAC,EAMJ,OALJ,EAAS,CAAC,CAMV,EAOA,EAAU,SAAS,CAAC,OAAO,CAAG,SAAiB,CAAI,EAC/C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAG,CAC5B,EAEA,EAAU,SAAS,CAAC,MAAM,CAAG,kBACzB,AAAI,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,GACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAE,GACtB,CAAA,IAEP,IAAI,CAAC,OAAO,CAAC,MACN,CAAA,EAEf,EAaA,EAAW,SAAS,CAAC,IAAI,CAAG,WACxB,IAAI,EAAG,EAAI,EAAG,EAAI,EAElB,SAAS,EAAU,CAAM,CAAE,CAAI,EAC3B,GAAI,MAAM,OAAO,CAAC,GACd,IAAK,EAAI,EAAG,EAAK,EAAK,MAAM,CAAE,EAAI,EAAI,EAAE,EACpC,EAAO,IAAI,CAAC,CAAI,CAAC,EAAE,OAGvB,EAAO,IAAI,CAAC,EAEpB,CAGA,GAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CACpB,OAAO,KAKX,IAAK,EAAI,EADT,EAAS,EAAE,CACC,EAAK,IAAI,CAAC,WAAW,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAEhD,EAAU,EAAQ,AADR,IAAI,CAAC,WAAW,CAAC,EAAE,CACH,IAAI,EAGlC,OADA,EAAU,EAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,EAC9B,CACX,EAIA,EAAW,SAAS,CAAC,IAAI,CAAG,WAExB,OAAO,AADI,IAAI,CAAC,OAAO,GACX,IAAI,EAAI,IAAI,CAAC,SAAS,CAAC,IAAI,AAC3C,EAIA,EAAW,SAAS,CAAC,OAAO,CAAG,WAC3B,IAAI,EAAG,EAAI,EAIX,IAAK,EAAI,EADT,EAAS,EAAE,CACC,EAAK,IAAI,CAAC,WAAW,CAAC,MAAM,CAAE,EAAI,EAAI,EAAE,EAChD,EAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAGxC,OAAO,CACX,EAIA,EAAW,SAAS,CAAC,OAAO,CAAG,WAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,AAC9B,EAEA,EAAW,SAAS,CAAC,SAAS,CAAG,SAAmB,CAAQ,CAAE,CAAO,EACjE,IAAI,EAAU,EAYd,OAVA,EAAS,KAAA,EAET,EAAY,IAAI,CAAC,SAAS,CAC1B,IAAI,CAAC,SAAS,CAAG,EACjB,IAAI,CAAC,OAAO,CAAG,KACX,GACA,CAAA,EAAS,EAAS,IAAI,CAAC,IAAI,CAAE,EAAQ,IAAI,CAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAG,EAAE,CAAC,IAAI,CAAA,EAEjG,IAAI,CAAC,SAAS,CAAG,EAEV,CACX,EAIA,EAAW,SAAS,CAAC,MAAM,CAAG,SAAgB,CAAI,EAC9C,IAAI,CAAC,OAAO,CAAG,CACnB,EAIA,EAAW,SAAS,CAAC,IAAI,CAAG,WACxB,IAAI,CAAC,MAAM,CAAC,EAChB,EAIA,EAAW,SAAS,CAAC,KAAQ,CAAG,WAC5B,IAAI,CAAC,MAAM,CAAC,EAChB,EAIA,EAAW,SAAS,CAAC,MAAM,CAAG,WAC1B,IAAI,CAAC,MAAM,CAAC,EAChB,EAEA,EAAW,SAAS,CAAC,YAAY,CAAG,SAAS,CAAI,CAAE,CAAO,EACtD,IAAI,CAAC,OAAO,CAAG,EACf,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,UAAU,CAAG,EAAE,CACpB,IAAI,CAAC,WAAW,CAAG,EAAE,CACrB,IAAI,CAAC,SAAS,CAAG,KACjB,IAAI,CAAC,OAAO,CAAG,KACf,IAAI,CAAC,UAAU,CAAG,KACd,AAAqB,cAArB,EAAQ,QAAQ,CAChB,IAAI,CAAC,UAAU,CAAG,OAAO,IAAI,CACM,YAA5B,OAAO,EAAQ,QAAQ,EAC9B,CAAA,IAAI,CAAC,UAAU,CAAG,EAAQ,QAAQ,AAAR,EAG9B,IAAI,CAAC,MAAM,CAAG,EACV,EAAQ,IAAI,EACZ,CAAA,IAAI,CAAC,MAAM,CAAG,OAAO,MAAM,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,EAAG,EAAQ,IAAI,CAAA,CAE5E,EAsBA,EAAW,SAAS,CAAC,QAAQ,CAAG,SAAkB,CAAI,CAAE,CAAO,EAC3D,IAAI,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAcJ,IAZA,IAAI,CAAC,YAAY,CAAC,EAAM,GAExB,EAAW,CAAC,EAGZ,EAAW,IAAI,CAAC,UAAU,CAC1B,EAAY,IAAI,CAAC,WAAW,CAG5B,EAAS,IAAI,CAAC,IAAI,EAAQ,EAAM,KAAM,KAAM,OAC5C,EAAU,IAAI,CAAC,IAAI,EAAQ,KAAM,KAAM,KAAM,OAEtC,EAAS,MAAM,EAAE,CAGpB,GAAI,AAFJ,CAAA,EAAU,EAAS,GAAG,EAAtB,IAEgB,EAAU,CAKtB,GAJA,EAAU,EAAU,GAAG,GAEvB,EAAM,IAAI,CAAC,SAAS,CAAC,EAAQ,KAAK,CAAE,GAEhC,IAAI,CAAC,OAAO,GAAK,GAAS,IAAQ,EAClC,OAEJ,QACJ,CAEA,GAAI,EAAQ,IAAI,CAAE,CAId,GAFA,EAAM,IAAI,CAAC,SAAS,CAAC,EAAQ,KAAK,CAAE,GAEhC,IAAI,CAAC,OAAO,GAAK,GAAS,IAAQ,EAClC,OAMJ,GAHA,EAAS,IAAI,CAAC,GACd,EAAU,IAAI,CAAC,GAEX,IAAI,CAAC,OAAO,GAAK,GAAQ,IAAQ,EACjC,SAMJ,GAFA,EAAW,AADX,CAAA,EAAO,EAAQ,IAAI,AAAJ,EACC,IAAI,EAAI,EAAQ,IAAI,CAEhC,CADJ,CAAA,EAAa,IAAI,CAAC,MAAM,CAAC,EAAS,AAAT,GAErB,GAAI,IAAI,CAAC,UAAU,CACf,EAAa,IAAI,CAAC,UAAU,CAAC,QAE7B,MAAM,AAAI,MAAM,qBAAuB,EAAW,KAK1D,IADA,EAAU,EAAW,MAAM,CACnB,AAAA,CAAA,GAAW,CAAA,GAAM,GAGrB,GADA,EAAY,CAAI,CADhB,EAAM,CAAU,CAAC,EAAQ,CACJ,EAKrB,GAAI,MAAM,OAAO,CAAC,GAEd,CAAA,IADA,EAAW,EAAU,MAAM,CACnB,AAAA,CAAA,GAAY,CAAA,GAAM,GACtB,KAAI,CAAC,CAAS,CAAC,EAAS,EAIpB,EAA2B,EAAW,CAAS,CAAC,EAAS,IAI7D,GAAI,EAAW,EAAU,CAAU,CAAC,EAAQ,EACxC,EAAU,IAAI,EAAQ,CAAS,CAAC,EAAS,CAAE,CAAC,EAAK,EAAS,CAAE,WAAY,WACrE,IAAI,EAAO,CAAS,CAAC,EAAS,EAGjC,SAFA,EAAU,IAAI,EAAQ,CAAS,CAAC,EAAS,CAAE,CAAC,EAAK,EAAS,CAAE,KAAM,MAItE,EAAS,IAAI,CAAC,GAClB,MACG,GAAI,EAAO,GAAY,CAC1B,GAAI,EAA2B,EAAW,GACxC,SAGF,EAAS,IAAI,CAAC,IAAI,EAAQ,EAAW,EAAK,KAAM,MACpD,EAER,CACJ,CACJ,EAEA,EAAW,SAAS,CAAC,OAAO,CAAG,SAAiB,CAAI,CAAE,CAAO,EACzD,IAAI,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAEJ,SAAS,EAAW,CAAO,EACvB,IAAI,EACA,EACA,EACA,EAEJ,GAAI,EAAQ,GAAG,CAAC,MAAM,GAOlB,CAAA,IALA,EAAM,EAAQ,GAAG,CAAC,GAAG,CACrB,EAAS,EAAQ,GAAG,CAAC,MAAM,CAG3B,EAAI,EAAS,MAAM,CACZ,KAEH,GAAI,AADJ,CAAA,EAAW,CAAQ,CAAC,EAAE,AAAF,EACP,GAAG,EAAI,EAAS,GAAG,CAAC,MAAM,GAAK,EAAQ,CAChD,GAAK,EAAS,GAAG,CAAC,GAAG,CAAG,EACpB,KAEJ,GAAE,EAAS,GAAG,CAAC,GAAG,AACtB,CACJ,CAER,CAkBA,IAhBA,IAAI,CAAC,YAAY,CAAC,EAAM,GAExB,EAAW,CAAC,EAGZ,EAAW,IAAI,CAAC,UAAU,CAC1B,EAAY,IAAI,CAAC,WAAW,CAG5B,EAAQ,CACJ,KAAM,CACV,EACA,EAAU,IAAI,EAAQ,EAAM,KAAM,KAAM,IAAI,EAAU,EAAO,SAC7D,EAAS,IAAI,CAAC,GACd,EAAU,IAAI,CAAC,GAER,EAAS,MAAM,EAAE,CAGpB,GAAI,AAFJ,CAAA,EAAU,EAAS,GAAG,EAAtB,IAEgB,EAAU,CAgBtB,GAfA,EAAU,EAAU,GAAG,GAMR,KAAA,IAJf,CAAA,EAAS,IAAI,CAAC,SAAS,CAAC,EAAQ,KAAK,CAAE,EAAvC,GAI4B,IAAW,GAAS,IAAW,GAAQ,IAAW,GAE1E,EAAQ,GAAG,CAAC,OAAO,CAAC,GAGpB,CAAA,IAAI,CAAC,OAAO,GAAK,GAAU,IAAW,CAAA,GACtC,EAAW,GAGX,IAAI,CAAC,OAAO,GAAK,GAAS,IAAW,EACrC,OAAO,EAAM,IAAI,CAErB,QACJ,CAiBA,GAXe,KAAA,IAJf,CAAA,EAAS,IAAI,CAAC,SAAS,CAAC,EAAQ,KAAK,CAAE,EAAvC,GAI4B,IAAW,GAAS,IAAW,GAAQ,IAAW,IAE1E,EAAQ,GAAG,CAAC,OAAO,CAAC,GACpB,EAAQ,IAAI,CAAG,GAGf,CAAA,IAAI,CAAC,OAAO,GAAK,GAAU,IAAW,CAAA,IACtC,EAAW,GACX,EAAQ,IAAI,CAAG,MAGf,IAAI,CAAC,OAAO,GAAK,GAAS,IAAW,EACrC,MAKJ,GADA,CAAA,EAAO,EAAQ,IAAI,AAAJ,IAKf,EAAS,IAAI,CAAC,GACd,EAAU,IAAI,CAAC,GAEX,IAAI,CAAC,OAAO,GAAK,GAAQ,IAAW,IAMxC,GAFA,EAAW,EAAK,IAAI,EAAI,EAAQ,IAAI,CAEhC,CADJ,CAAA,EAAa,IAAI,CAAC,MAAM,CAAC,EAAS,AAAT,GAErB,GAAI,IAAI,CAAC,UAAU,CACf,EAAa,IAAI,CAAC,UAAU,CAAC,QAE7B,MAAM,AAAI,MAAM,qBAAuB,EAAW,KAK1D,IADA,EAAU,EAAW,MAAM,CACnB,AAAA,CAAA,GAAW,CAAA,GAAM,GAGrB,GADA,EAAY,CAAI,CADhB,EAAM,CAAU,CAAC,EAAQ,CACJ,EAKrB,GAAI,MAAM,OAAO,CAAC,GAEd,CAAA,IADA,EAAW,EAAU,MAAM,CACnB,AAAA,CAAA,GAAY,CAAA,GAAM,GACtB,GAAK,CAAS,CAAC,EAAS,EAGxB,GAAI,EAAW,EAAU,CAAU,CAAC,EAAQ,EACxC,EAAU,IAAI,EAAQ,CAAS,CAAC,EAAS,CAAE,CAAC,EAAK,EAAS,CAAE,WAAY,IAAI,EAAU,EAAW,SAC9F,IAAI,EAAO,CAAS,CAAC,EAAS,EAGjC,SAFA,EAAU,IAAI,EAAQ,CAAS,CAAC,EAAS,CAAE,CAAC,EAAK,EAAS,CAAE,KAAM,IAAI,EAAU,EAAW,IAI/F,EAAS,IAAI,CAAC,GAClB,MACO,EAAO,IACd,EAAS,IAAI,CAAC,IAAI,EAAQ,EAAW,EAAK,KAAM,IAAI,EAAU,EAAM,MAGhF,CAEA,OAAO,EAAM,IAAI,AACrB,EAgIA,EAAQ,MAAM,CAAG,EACjB,EAAQ,QAAQ,CAAG,EACnB,EAAQ,OAAO,CA3Hf,SAAiB,CAAI,CAAE,CAAO,EAE1B,OAAO,AADU,IAAI,IACH,OAAO,CAAC,EAAM,EACpC,EAyHA,EAAQ,cAAc,CAlGtB,SAAwB,CAAI,CAAE,CAAgB,CAAE,CAAM,EAElD,IAAmB,EAAS,EAAK,EAAG,EAAhC,EAAW,EAAE,CAEjB,GAAI,CAAC,EAAK,KAAK,CACX,MAAM,AAAI,MAAM,0CAIpB,GAAI,CAAC,EAAO,MAAM,CAAE,CAChB,GAAI,EAAiB,MAAM,CAAE,CACzB,IAAK,EAAI,EAAG,EAAM,EAAiB,MAAM,CAAE,EAAI,EAAK,GAAK,EAErD,AADA,CAAA,EAAU,EAAS,CAAgB,CAAC,EAAE,CAAA,EAC9B,aAAa,CAAG,CAAC,EAAG,EAAK,KAAK,CAAC,EAAE,CAAC,CAC1C,EAAS,IAAI,CAAC,EAElB,CAAA,EAAK,eAAe,CAAG,CAC3B,CACA,OAAO,CACX,CAEA,IAAK,EAAI,EAAG,EAAM,EAAiB,MAAM,CAAE,EAAI,EAAK,GAAK,EACrD,EAAS,IAAI,CAAC,AA3CtB,SAA4B,CAAO,CAAE,CAAM,EACvC,IAAI,EAiBJ,OAfA,EAAS,AAjnBb,SAAoB,CAAK,CAAE,CAAI,EAC3B,IAAI,EAAM,EAAK,EAAG,EAKlB,IAHA,EAAM,EAAM,MAAM,CAClB,EAAI,EAEG,GAGC,EAAK,CAAK,CADd,EAAU,EADV,CAAA,EAAO,IAAQ,CAAA,EAEQ,EACnB,EAAM,GAEN,EAAI,EAAU,EACd,GAAO,EAAO,GAGtB,OAAO,CACX,EAgmBwB,EAAQ,SAAS,EAAO,CAAK,EAC7C,OAAO,EAAM,KAAK,CAAC,EAAE,CAAG,EAAQ,KAAK,CAAC,EAAE,AAC5C,GAEA,EAAQ,aAAa,CAAG,CAAC,EAAQ,KAAK,CAAC,EAAE,CAAE,EAAQ,KAAK,CAAC,EAAE,CAAC,CAExD,IAAW,EAAO,MAAM,EACxB,CAAA,EAAQ,aAAa,CAAC,EAAE,CAAG,CAAM,CAAC,EAAO,CAAC,KAAK,CAAC,EAAE,AAAF,EAGpD,CAAA,GAAU,CAAA,GACI,GACV,CAAA,EAAQ,aAAa,CAAC,EAAE,CAAG,CAAM,CAAC,EAAO,CAAC,KAAK,CAAC,EAAE,AAAF,EAG7C,CACX,EAwByC,EAAS,CAAgB,CAAC,EAAE,EAAG,IAsEpE,OAlEA,EAAS,EACT,EAAS,EAAM,CACX,MAAO,SAAU,CAAI,EAGjB,IAFA,IAAI,EAIA,AAFG,EAAS,EAAS,MAAM,GAEvB,CAAA,AADJ,CAAA,EAAU,CAAQ,CAAC,EAAO,AAAP,EACP,aAAa,CAAC,EAAE,CAAG,EAAK,KAAK,CAAC,EAAE,AAAF,GAItC,EAAQ,aAAa,CAAC,EAAE,GAAK,EAAK,KAAK,CAAC,EAAE,EACrC,EAAK,eAAe,EACrB,CAAA,EAAK,eAAe,CAAG,EAAE,AAAF,EAE3B,EAAK,eAAe,CAAC,IAAI,CAAC,GAC1B,EAAS,MAAM,CAAC,EAAQ,IAExB,GAAU,SAKlB,AAAI,IAAW,EAAS,MAAM,CACnB,EAAc,KAAK,CAG1B,CAAQ,CAAC,EAAO,CAAC,aAAa,CAAC,EAAE,CAAG,EAAK,KAAK,CAAC,EAAE,CAC1C,EAAc,IAAI,OAEjC,CACJ,GAEA,EAAS,EACT,EAAS,EAAM,CACX,MAAO,SAAU,CAAI,EAGjB,IAFA,IAAI,EAIA,AAFG,EAAS,EAAS,MAAM,GAC3B,EAAU,CAAQ,CAAC,EAAO,EACtB,CAAA,EAAK,KAAK,CAAC,EAAE,CAAG,EAAQ,aAAa,CAAC,EAAE,AAAF,IAItC,EAAK,KAAK,CAAC,EAAE,GAAK,EAAQ,aAAa,CAAC,EAAE,EACrC,EAAK,gBAAgB,EACtB,CAAA,EAAK,gBAAgB,CAAG,EAAE,AAAF,EAE5B,EAAK,gBAAgB,CAAC,IAAI,CAAC,GAC3B,EAAS,MAAM,CAAC,EAAQ,IAExB,GAAU,SAKlB,AAAI,IAAW,EAAS,MAAM,CACnB,EAAc,KAAK,CAG1B,CAAQ,CAAC,EAAO,CAAC,aAAa,CAAC,EAAE,CAAG,EAAK,KAAK,CAAC,EAAE,CAC1C,EAAc,IAAI,OAEjC,CACJ,GAEO,CACX,EAMA,EAAQ,WAAW,CAAG,EACtB,EAAQ,aAAa,CAAG,EACxB,EAAQ,UAAU,CAAG,EACrB,EAAQ,gBAAgB,CAAG,WAAc,OAAO,EAAM,CAAC,EAAI,EAEpD,CACX,EAAE,E,E,C,E,C,Q,C,S,C,C,C,C,C,EC9xBF,EAAQ,kBAAkB,CAAG,EAAQ,mBAA8B,kBAAkB,CACrF,EAAQ,iBAAiB,CAAG,EAAQ,kBAA6B,iBAAiB,CAClF,EAAQ,UAAU,CAAG,EAAQ,oBAAqB,UAAU,A,E,C,kB,Q,iB,Q,mB,O,E,C,Q,C,S,C,C,C,C,C,ECA5D,IAAI,EAAY,EAAQ,oBACpB,EAAO,EAAQ,oBACf,EAAW,EAAQ,oBAAe,QAAQ,CAC1C,EAAc,EAAQ,oBAAkB,WAAW,CAUvD,SAAS,EAAmB,CAAK,EAC1B,GACH,CAAA,EAAQ,CAAC,CAAA,EAEX,IAAI,CAAC,KAAK,CAAG,EAAK,MAAM,CAAC,EAAO,OAAQ,MACxC,IAAI,CAAC,WAAW,CAAG,EAAK,MAAM,CAAC,EAAO,aAAc,MACpD,IAAI,CAAC,eAAe,CAAG,EAAK,MAAM,CAAC,EAAO,iBAAkB,CAAA,GAC5D,IAAI,CAAC,QAAQ,CAAG,IAAI,EACpB,IAAI,CAAC,MAAM,CAAG,IAAI,EAClB,IAAI,CAAC,SAAS,CAAG,IAAI,EACrB,IAAI,CAAC,gBAAgB,CAAG,IAC1B,CAEA,EAAmB,SAAS,CAAC,QAAQ,CAAG,EAOxC,EAAmB,aAAa,CAC9B,SAA0C,CAAkB,EAC1D,IAAI,EAAa,EAAmB,UAAU,CAC1C,EAAY,IAAI,EAAmB,CACrC,KAAM,EAAmB,IAAI,CAC7B,WAAY,CACd,GA0CA,OAzCA,EAAmB,WAAW,CAAC,SAAU,CAAO,EAC9C,IAAI,EAAa,CACf,UAAW,CACT,KAAM,EAAQ,aAAa,CAC3B,OAAQ,EAAQ,eAAe,AACjC,CACF,CAEsB,OAAlB,EAAQ,MAAM,GAChB,EAAW,MAAM,CAAG,EAAQ,MAAM,CAChB,MAAd,GACF,CAAA,EAAW,MAAM,CAAG,EAAK,QAAQ,CAAC,EAAY,EAAW,MAAM,CAAA,EAGjE,EAAW,QAAQ,CAAG,CACpB,KAAM,EAAQ,YAAY,CAC1B,OAAQ,EAAQ,cAAc,AAChC,EAEoB,MAAhB,EAAQ,IAAI,EACd,CAAA,EAAW,IAAI,CAAG,EAAQ,IAAI,AAAJ,GAI9B,EAAU,UAAU,CAAC,EACvB,GACA,EAAmB,OAAO,CAAC,OAAO,CAAC,SAAU,CAAU,EACrD,IAAI,EAAiB,CACF,QAAf,GACF,CAAA,EAAiB,EAAK,QAAQ,CAAC,EAAY,EAD7C,EAIK,EAAU,QAAQ,CAAC,GAAG,CAAC,IAC1B,EAAU,QAAQ,CAAC,GAAG,CAAC,GAGzB,IAAI,EAAU,EAAmB,gBAAgB,CAAC,EACnC,OAAX,GACF,EAAU,gBAAgB,CAAC,EAAY,EAE3C,GACO,CACT,EAYF,EAAmB,SAAS,CAAC,UAAU,CACrC,SAAuC,CAAK,EAC1C,IAAI,EAAY,EAAK,MAAM,CAAC,EAAO,aAC/B,EAAW,EAAK,MAAM,CAAC,EAAO,WAAY,MAC1C,EAAS,EAAK,MAAM,CAAC,EAAO,SAAU,MACtC,EAAO,EAAK,MAAM,CAAC,EAAO,OAAQ,KAEjC,CAAA,IAAI,CAAC,eAAe,EACvB,IAAI,CAAC,gBAAgB,CAAC,EAAW,EAAU,EAAQ,GAGvC,MAAV,IACF,EAAS,OAAO,GACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAIV,MAAR,IACF,EAAO,OAAO,GACT,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IACnB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAIpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CACjB,cAAe,EAAU,IAAI,CAC7B,gBAAiB,EAAU,MAAM,CACjC,aAAc,AAAY,MAAZ,GAAoB,EAAS,IAAI,CAC/C,eAAgB,AAAY,MAAZ,GAAoB,EAAS,MAAM,CACnD,OAAQ,EACR,KAAM,CACR,EACF,EAKF,EAAmB,SAAS,CAAC,gBAAgB,CAC3C,SAA6C,CAAW,CAAE,CAAc,EACtE,IAAI,EAAS,CACW,OAApB,IAAI,CAAC,WAAW,EAClB,CAAA,EAAS,EAAK,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAE,EAD3C,EAII,AAAkB,MAAlB,GAGG,IAAI,CAAC,gBAAgB,EACxB,CAAA,IAAI,CAAC,gBAAgB,CAAG,OAAO,MAAM,CAAC,KADxC,EAGA,IAAI,CAAC,gBAAgB,CAAC,EAAK,WAAW,CAAC,GAAQ,CAAG,GACzC,IAAI,CAAC,gBAAgB,GAG9B,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAK,WAAW,CAAC,GAAQ,CACJ,IAA9C,OAAO,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,MAAM,EAC3C,CAAA,IAAI,CAAC,gBAAgB,CAAG,IAD1B,EAIJ,EAkBF,EAAmB,SAAS,CAAC,cAAc,CACzC,SAA2C,CAAkB,CAAE,CAAW,CAAE,CAAc,EACxF,IAAI,EAAa,EAEjB,GAAI,AAAe,MAAf,EAAqB,CACvB,GAAI,AAA2B,MAA3B,EAAmB,IAAI,CACzB,MAAM,AAAI,MACR,iJAIJ,EAAa,EAAmB,IAAI,AACtC,CACA,IAAI,EAAa,IAAI,CAAC,WAAW,AAEf,OAAd,GACF,CAAA,EAAa,EAAK,QAAQ,CAAC,EAAY,EADzC,EAKA,IAAI,EAAa,IAAI,EACjB,EAAW,IAAI,EAGnB,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,SAAU,CAAO,EAC9C,GAAI,EAAQ,MAAM,GAAK,GAAc,AAAwB,MAAxB,EAAQ,YAAY,CAAU,CAEjE,IAAI,EAAW,EAAmB,mBAAmB,CAAC,CACpD,KAAM,EAAQ,YAAY,CAC1B,OAAQ,EAAQ,cAAc,AAChC,EACuB,OAAnB,EAAS,MAAM,GAEjB,EAAQ,MAAM,CAAG,EAAS,MAAM,CACV,MAAlB,GACF,CAAA,EAAQ,MAAM,CAAG,EAAK,IAAI,CAAC,EAAgB,EAAQ,MAAM,CAAA,EAEzC,MAAd,GACF,CAAA,EAAQ,MAAM,CAAG,EAAK,QAAQ,CAAC,EAAY,EAAQ,MAAM,CAAA,EAE3D,EAAQ,YAAY,CAAG,EAAS,IAAI,CACpC,EAAQ,cAAc,CAAG,EAAS,MAAM,CACnB,MAAjB,EAAS,IAAI,EACf,CAAA,EAAQ,IAAI,CAAG,EAAS,IAAI,AAAJ,EAG9B,CAEA,IAAI,EAAS,EAAQ,MAAM,AACb,OAAV,GAAmB,EAAW,GAAG,CAAC,IACpC,EAAW,GAAG,CAAC,GAGjB,IAAI,EAAO,EAAQ,IAAI,AACX,OAAR,GAAiB,EAAS,GAAG,CAAC,IAChC,EAAS,GAAG,CAAC,EAGjB,EAAG,IAAI,EACP,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,MAAM,CAAG,EAGd,EAAmB,OAAO,CAAC,OAAO,CAAC,SAAU,CAAU,EACrD,IAAI,EAAU,EAAmB,gBAAgB,CAAC,EACnC,OAAX,IACoB,MAAlB,GACF,CAAA,EAAa,EAAK,IAAI,CAAC,EAAgB,EADzC,EAGkB,MAAd,GACF,CAAA,EAAa,EAAK,QAAQ,CAAC,EAAY,EADzC,EAGA,IAAI,CAAC,gBAAgB,CAAC,EAAY,GAEtC,EAAG,IAAI,CACT,EAaF,EAAmB,SAAS,CAAC,gBAAgB,CAC3C,SAA4C,CAAU,CAAE,CAAS,CAAE,CAAO,CAC9B,CAAK,EAK/C,GAAI,GAAa,AAA0B,UAA1B,OAAO,EAAU,IAAI,EAAiB,AAA4B,UAA5B,OAAO,EAAU,MAAM,CAC1E,MAAM,AAAI,MACN,gPAMR,GAAI,CAAA,CAAA,IAAc,CAAA,SAAU,CAAA,IAAc,CAAA,WAAY,CAAA,IAC/C,CAAA,EAAW,IAAI,CAAG,CAAA,IAAK,CAAA,EAAW,MAAM,EAAI,CAAA,GAC3C,GAAc,GAAY,CAAA,GAIzB,CAAA,CAAA,IAAc,CAAA,SAAU,CAAA,IAAc,CAAA,WAAY,CAAA,IAC/C,IAAa,CAAA,SAAU,CAAA,IAAa,CAAA,WAAY,CAAA,IAChD,CAAA,EAAW,IAAI,CAAG,CAAA,IAAK,CAAA,EAAW,MAAM,EAAI,CAAA,IAC5C,CAAA,EAAU,IAAI,CAAG,CAAA,IAAK,CAAA,EAAU,MAAM,EAAI,CAAA,IAC1C,CAAA,EAKV,MAAM,AAAI,MAAM,oBAAsB,KAAK,SAAS,CAAC,CACnD,UAAW,EACX,OAAQ,EACR,SAAU,EACV,KAAM,CACR,GAEJ,EAMF,EAAmB,SAAS,CAAC,kBAAkB,CAC7C,WAcE,IAAK,IAND,EACA,EACA,EACA,EAVA,EAA0B,EAC1B,EAAwB,EACxB,EAAyB,EACzB,EAAuB,EACvB,EAAe,EACf,EAAiB,EACjB,EAAS,GAMT,EAAW,IAAI,CAAC,SAAS,CAAC,OAAO,GAC5B,EAAI,EAAG,EAAM,EAAS,MAAM,CAAE,EAAI,EAAK,IAAK,CAInD,GAHA,EAAU,CAAQ,CAAC,EAAE,CACrB,EAAO,GAEH,EAAQ,aAAa,GAAK,EAE5B,IADA,EAA0B,EACnB,EAAQ,aAAa,GAAK,GAC/B,GAAQ,IACR,SAIF,GAAI,EAAI,EAAG,CACT,GAAI,CAAC,EAAK,mCAAmC,CAAC,EAAS,CAAQ,CAAC,EAAI,EAAE,EACpE,SAEF,GAAQ,GACV,CAGF,GAAQ,EAAU,MAAM,CAAC,EAAQ,eAAe,CACnB,GAC7B,EAA0B,EAAQ,eAAe,CAE3B,MAAlB,EAAQ,MAAM,GAChB,EAAY,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAQ,MAAM,EAChD,GAAQ,EAAU,MAAM,CAAC,EAAY,GACrC,EAAiB,EAGjB,GAAQ,EAAU,MAAM,CAAC,EAAQ,YAAY,CAAG,EACnB,GAC7B,EAAuB,EAAQ,YAAY,CAAG,EAE9C,GAAQ,EAAU,MAAM,CAAC,EAAQ,cAAc,CAClB,GAC7B,EAAyB,EAAQ,cAAc,CAE3B,MAAhB,EAAQ,IAAI,GACd,EAAU,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAQ,IAAI,EAC1C,GAAQ,EAAU,MAAM,CAAC,EAAU,GACnC,EAAe,IAInB,GAAU,CACZ,CAEA,OAAO,CACT,EAEF,EAAmB,SAAS,CAAC,uBAAuB,CAClD,SAAmD,CAAQ,CAAE,CAAW,EACtE,OAAO,EAAS,GAAG,CAAC,SAAU,CAAM,EAClC,GAAI,CAAC,IAAI,CAAC,gBAAgB,CACxB,OAAO,IAEU,OAAf,GACF,CAAA,EAAS,EAAK,QAAQ,CAAC,EAAa,EADtC,EAGA,IAAI,EAAM,EAAK,WAAW,CAAC,GAC3B,OAAO,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAE,GAC/D,IAAI,CAAC,gBAAgB,CAAC,EAAI,CAC1B,IACN,EAAG,IAAI,CACT,EAKF,EAAmB,SAAS,CAAC,MAAM,CACjC,WACE,IAAI,EAAM,CACR,QAAS,IAAI,CAAC,QAAQ,CACtB,QAAS,IAAI,CAAC,QAAQ,CAAC,OAAO,GAC9B,MAAO,IAAI,CAAC,MAAM,CAAC,OAAO,GAC1B,SAAU,IAAI,CAAC,kBAAkB,EACnC,EAWA,OAVkB,MAAd,IAAI,CAAC,KAAK,EACZ,CAAA,EAAI,IAAI,CAAG,IAAI,CAAC,KAAK,AAAL,EAEM,MAApB,IAAI,CAAC,WAAW,EAClB,CAAA,EAAI,UAAU,CAAG,IAAI,CAAC,WAAW,AAAX,EAEpB,IAAI,CAAC,gBAAgB,EACvB,CAAA,EAAI,cAAc,CAAG,IAAI,CAAC,uBAAuB,CAAC,EAAI,OAAO,CAAE,EAAI,UAAU,CAAA,EAGxE,CACT,EAKF,EAAmB,SAAS,CAAC,QAAQ,CACnC,WACE,OAAO,KAAK,SAAS,CAAC,IAAI,CAAC,MAAM,GACnC,EAEF,EAAQ,kBAAkB,CAAG,C,E,C,iB,Q,iB,Q,iB,Q,mB,O,E,C,M,C,S,C,C,C,C,C,ECnY7B,IAAI,EAAS,EAAQ,mBAsDrB,CAAA,EAAQ,MAAM,CAAG,SAA0B,CAAM,EAC/C,IACI,EADA,EAAU,GAGV,EA1BG,AA0Be,EA1BN,EACX,AAAC,CAAA,CAyBgB,GAzBJ,CAAA,EAAK,EACnB,AAAC,CAAA,AAwBiB,GAxBP,CAAA,EAAK,EA0BpB,GACE,EAAQ,AAzCQ,GAyCR,EACR,CAAA,KAhDiB,CAgDjB,EACU,GAGR,CAAA,GAjDS,EAiDT,EAEF,GAAW,EAAO,MAAM,CAAC,SAClB,EAAM,EAAG,AAElB,OAAO,CACT,EAMA,EAAQ,MAAM,CAAG,SAA0B,CAAI,CAAE,CAAM,CAAE,CAAS,EAChE,IApCqB,EAEjB,EAqCA,EAAc,EAHd,EAAS,EAAK,MAAM,CACpB,EAAS,EACT,EAAQ,EAGZ,EAAG,CACD,GAAI,GAAU,EACZ,MAAM,AAAI,MAAM,8CAIlB,GAAI,AAAU,KADd,CAAA,EAAQ,EAAO,MAAM,CAAC,EAAK,UAAU,CAAC,KAAtC,EAEE,MAAM,AAAI,MAAM,yBAA2B,EAAK,MAAM,CAAC,EAAS,IAGlE,EAAe,CAAC,CAAE,CAAA,AA7EP,GA6EO,CAAQ,EAC1B,GA3EgB,GA4EhB,GAAmB,GAAS,EAC5B,GAnFiB,CAoFnB,OAAS,EAAc,AAEvB,EAAU,KAAK,EAvDX,EAAU,CAFO,EAyDW,IAvDR,EACjB,AAFU,AAAC,CAAA,AAAS,EAAT,CAAS,GAAO,EAG9B,CAAC,EACD,GAqDJ,EAAU,IAAI,CAAG,CACnB,C,E,C,mB,O,E,C,M,C,S,C,C,C,C,C,ECpIA,IAAI,EAAe,mEAAmE,KAAK,CAAC,GAK5F,CAAA,EAAQ,MAAM,CAAG,SAAU,CAAM,EAC/B,GAAI,GAAK,GAAU,EAAS,EAAa,MAAM,CAC7C,OAAO,CAAY,CAAC,EAAO,AAE7B,OAAM,AAAI,UAAU,6BAA+B,EACrD,EAMA,EAAQ,MAAM,CAAG,SAAU,CAAQ,SAiBjC,AAAI,AAhBO,IAgBC,GAAY,GAfb,GAgBD,EAjBC,GAqBP,AAlBU,IAkBC,GAAY,GAjBb,IAkBJ,EAnBI,GASK,GAcf,AApBO,IAoBC,GAAY,GAnBb,GAoBD,EArBC,GAOQ,GAkBf,AAtBO,IAsBP,EACK,GAIL,AA1BQ,IA0BR,EACK,GAIF,EACT,C,E,C,E,C,M,C,S,C,C,C,C,C,ECxCA,EAAQ,MAAM,CATd,SAAgB,CAAK,CAAE,CAAK,CAAE,CAAa,EACzC,GAAI,KAAS,EACX,OAAO,CAAK,CAAC,EAAM,CACd,GAAI,AAAqB,GAArB,UAAU,MAAM,CACzB,OAAO,CAEP,OAAM,AAAI,MAAM,IAAM,EAAQ,4BAElC,EAGA,IAAI,EAAY,iEACZ,EAAgB,gBAEpB,SAAS,EAAS,CAAI,EACpB,IAAI,EAAQ,EAAK,KAAK,CAAC,UACvB,AAAK,EAGE,CACL,OAAQ,CAAK,CAAC,EAAE,CAChB,KAAM,CAAK,CAAC,EAAE,CACd,KAAM,CAAK,CAAC,EAAE,CACd,KAAM,CAAK,CAAC,EAAE,CACd,KAAM,CAAK,CAAC,EAAE,AAChB,EARS,IASX,CAGA,SAAS,EAAY,CAAU,EAC7B,IAAI,EAAM,GAiBV,OAhBI,EAAW,MAAM,EACnB,CAAA,GAAO,EAAW,MAAM,CAAG,GAD7B,EAGA,GAAO,KACH,EAAW,IAAI,EACjB,CAAA,GAAO,EAAW,IAAI,CAAG,GAD3B,EAGI,EAAW,IAAI,EACjB,CAAA,GAAO,EAAW,IAAI,AAAJ,EAEhB,EAAW,IAAI,EACjB,CAAA,GAAO,IAAM,EAAW,IAAI,AAAJ,EAEtB,EAAW,IAAI,EACjB,CAAA,GAAO,EAAW,IAAI,AAAJ,EAEb,CACT,CAcA,SAAS,EAAU,CAAK,EACtB,IAAI,EAAO,EACP,EAAM,EAAS,GACnB,GAAI,EAAK,CACP,GAAI,CAAC,EAAI,IAAI,CACX,OAAO,EAET,EAAO,EAAI,IAAI,AACjB,CAIA,IAAK,IAAI,EAHL,EAAa,EAAQ,UAAU,CAAC,GAEhC,EAAQ,EAAK,KAAK,CAAC,OACR,EAAK,EAAG,EAAI,EAAM,MAAM,CAAG,EAAG,GAAK,EAAG,IAE/C,AAAS,MADb,CAAA,EAAO,CAAK,CAAC,EAAE,AAAF,EAEX,EAAM,MAAM,CAAC,EAAG,GACP,AAAS,OAAT,EACT,IACS,EAAK,IACV,AAAS,KAAT,GAIF,EAAM,MAAM,CAAC,EAAI,EAAG,GACpB,EAAK,IAEL,EAAM,MAAM,CAAC,EAAG,GAChB,YAUN,CAJa,KAFb,CAAA,EAAO,EAAM,IAAI,CAAC,IAAlB,GAGE,CAAA,EAAO,EAAa,IAAM,GAD5B,EAII,IACF,EAAI,IAAI,CAAG,EACJ,EAAY,IAEd,CACT,CAmBA,SAAS,EAAK,CAAK,CAAE,CAAK,EACV,KAAV,GACF,CAAA,EAAQ,GADV,EAGc,KAAV,GACF,CAAA,EAAQ,GADV,EAGA,IAAI,EAAW,EAAS,GACpB,EAAW,EAAS,GAMxB,GALI,GACF,CAAA,EAAQ,EAAS,IAAI,EAAI,GAD3B,EAKI,GAAY,CAAC,EAAS,MAAM,CAI9B,OAHI,GACF,CAAA,EAAS,MAAM,CAAG,EAAS,MAAM,AAAN,EAEtB,EAAY,GAGrB,GAAI,GAAY,EAAM,KAAK,CAAC,GAC1B,OAAO,EAIT,GAAI,GAAY,CAAC,EAAS,IAAI,EAAI,CAAC,EAAS,IAAI,CAE9C,OADA,EAAS,IAAI,CAAG,EACT,EAAY,GAGrB,IAAI,EAAS,AAAoB,MAApB,EAAM,MAAM,CAAC,GACtB,EACA,EAAU,EAAM,OAAO,CAAC,OAAQ,IAAM,IAAM,UAEhD,AAAI,GACF,EAAS,IAAI,CAAG,EACT,EAAY,IAEd,CACT,CAxIA,EAAQ,QAAQ,CAAG,EAsBnB,EAAQ,WAAW,CAAG,EAwDtB,EAAQ,SAAS,CAAG,EA2DpB,EAAQ,IAAI,CAAG,EAEf,EAAQ,UAAU,CAAG,SAAU,CAAK,EAClC,MAAO,AAAoB,MAApB,EAAM,MAAM,CAAC,IAAc,EAAU,IAAI,CAAC,EACnD,EAwCA,EAAQ,QAAQ,CAhChB,SAAkB,CAAK,CAAE,CAAK,EACd,KAAV,GACF,CAAA,EAAQ,GADV,EAIA,EAAQ,EAAM,OAAO,CAAC,MAAO,IAO7B,IADA,IAAI,EAAQ,EACL,AAA+B,IAA/B,EAAM,OAAO,CAAC,EAAQ,MAAY,CACvC,IAAI,EAAQ,EAAM,WAAW,CAAC,KAC9B,GAAI,EAAQ,GAQR,AADJ,CAAA,EAAQ,EAAM,KAAK,CAAC,EAAG,EAAvB,EACU,KAAK,CAAC,qBAPd,OAAO,CAWT,GAAE,CACJ,CAGA,OAAO,MAAM,EAAQ,GAAG,IAAI,CAAC,OAAS,EAAM,MAAM,CAAC,EAAM,MAAM,CAAG,EACpE,EAGA,IAAI,EAEK,CAAE,CAAA,cADC,OAAO,MAAM,CAAC,KACA,EAG1B,SAAS,EAAU,CAAC,EAClB,OAAO,CACT,CA6BA,SAAS,EAAc,CAAC,EACtB,GAAI,CAAC,EACH,MAAO,CAAA,EAGT,IAAI,EAAS,EAAE,MAAM,CAErB,GAAI,EAAS,GAIT,AAA6B,KAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,KAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,MAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,MAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,MAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,MAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,MAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,KAA7B,EAAE,UAAU,CAAC,EAAS,IACtB,AAA6B,KAA7B,EAAE,UAAU,CAAC,EAAS,GAXxB,MAAO,CAAA,EAeT,IAAK,IAAI,EAAI,EAAS,GAAI,GAAK,EAAG,IAChC,GAAI,AAAoB,KAApB,EAAE,UAAU,CAAC,GACf,MAAO,CAAA,EAIX,MAAO,CAAA,CACT,CA+EA,SAAS,EAAO,CAAK,CAAE,CAAK,SAC1B,AAAI,IAAU,EACL,EAGL,AAAU,OAAV,EACK,EAGL,AAAU,OAAV,EACK,GAGL,EAAQ,EACH,EAGF,EACT,CA1IA,EAAQ,WAAW,CAAG,EAAoB,EAP1C,SAAqB,CAAI,SACvB,AAAI,EAAc,GACT,IAAM,EAGR,CACT,EAUA,EAAQ,aAAa,CAAG,EAAoB,EAP5C,SAAuB,CAAI,SACzB,AAAI,EAAc,GACT,EAAK,KAAK,CAAC,GAGb,CACT,EAuEA,EAAQ,0BAA0B,CA5BlC,SAAoC,CAAQ,CAAE,CAAQ,CAAE,CAAmB,EACzE,IAAI,EAAM,EAAO,EAAS,MAAM,CAAE,EAAS,MAAM,SACjD,AAAY,IAAR,GAKA,AAAQ,GADZ,CAAA,EAAM,EAAS,YAAY,CAAG,EAAS,YAAY,AAAZ,GAMnC,AAAQ,GADZ,CAAA,EAAM,EAAS,cAAc,CAAG,EAAS,cAAc,AAAd,GACxB,GAKb,AAAQ,GADZ,CAAA,EAAM,EAAS,eAAe,CAAG,EAAS,eAAe,AAAf,GAMtC,AAAQ,GADZ,CAAA,EAAM,EAAS,aAAa,CAAG,EAAS,aAAa,AAAb,EAlB/B,EAuBF,EAAO,EAAS,IAAI,CAAE,EAAS,IAAI,CAC5C,EAwCA,EAAQ,mCAAmC,CA5B3C,SAA6C,CAAQ,CAAE,CAAQ,CAAE,CAAoB,EACnF,IAAI,EAAM,EAAS,aAAa,CAAG,EAAS,aAAa,QACzD,AAAY,IAAR,GAKA,AAAQ,GADZ,CAAA,EAAM,EAAS,eAAe,CAAG,EAAS,eAAe,AAAf,GACzB,GAKb,AAAQ,IADZ,CAAA,EAAM,EAAO,EAAS,MAAM,CAAE,EAAS,MAAM,CAAA,GAMzC,AAAQ,GADZ,CAAA,EAAM,EAAS,YAAY,CAAG,EAAS,YAAY,AAAZ,GAMnC,AAAQ,GADZ,CAAA,EAAM,EAAS,cAAc,CAAG,EAAS,cAAc,AAAd,EAlBhC,EAuBF,EAAO,EAAS,IAAI,CAAE,EAAS,IAAI,CAC5C,EAuDA,EAAQ,mCAAmC,CA5B3C,SAA6C,CAAQ,CAAE,CAAQ,EAC7D,IAAI,EAAM,EAAS,aAAa,CAAG,EAAS,aAAa,QACzD,AAAY,IAAR,GAKA,AAAQ,GADZ,CAAA,EAAM,EAAS,eAAe,CAAG,EAAS,eAAe,AAAf,GAMtC,AAAQ,IADZ,CAAA,EAAM,EAAO,EAAS,MAAM,CAAE,EAAS,MAAM,CAAA,GAMzC,AAAQ,GADZ,CAAA,EAAM,EAAS,YAAY,CAAG,EAAS,YAAY,AAAZ,GAMnC,AAAQ,GADZ,CAAA,EAAM,EAAS,cAAc,CAAG,EAAS,cAAc,AAAd,EAlBhC,EAuBF,EAAO,EAAS,IAAI,CAAE,EAAS,IAAI,CAC5C,EAWA,EAAQ,mBAAmB,CAH3B,SAA6B,CAAG,EAC9B,OAAO,KAAK,KAAK,CAAC,EAAI,OAAO,CAAC,iBAAkB,IAClD,EAsDA,EAAQ,gBAAgB,CA/CxB,SAA0B,CAAU,CAAE,CAAS,CAAE,CAAY,EA8B3D,GA7BA,EAAY,GAAa,GAErB,IAEwC,MAAtC,CAAU,CAAC,EAAW,MAAM,CAAG,EAAE,EAAY,AAAiB,MAAjB,CAAS,CAAC,EAAE,EAC3D,CAAA,GAAc,GADhB,EAQA,EAAY,EAAa,GAiBvB,EAAc,CAChB,IAAI,EAAS,EAAS,GACtB,GAAI,CAAC,EACH,MAAM,AAAI,MAAM,oCAElB,GAAI,EAAO,IAAI,CAAE,CAEf,IAAI,EAAQ,EAAO,IAAI,CAAC,WAAW,CAAC,KAChC,GAAS,GACX,CAAA,EAAO,IAAI,CAAG,EAAO,IAAI,CAAC,SAAS,CAAC,EAAG,EAAQ,EADjD,CAGF,CACA,EAAY,EAAK,EAAY,GAAS,EACxC,CAEA,OAAO,EAAU,EACnB,C,E,C,E,C,M,C,S,C,C,C,C,C,EC/dA,IAAI,EAAO,EAAQ,oBACf,EAAM,OAAO,SAAS,CAAC,cAAc,CACrC,EAAe,AAAe,aAAf,OAAO,IAQ1B,SAAS,IACP,IAAI,CAAC,MAAM,CAAG,EAAE,CAChB,IAAI,CAAC,IAAI,CAAG,EAAe,IAAI,IAAQ,OAAO,MAAM,CAAC,KACvD,CAKA,EAAS,SAAS,CAAG,SAA4B,CAAM,CAAE,CAAgB,EAEvE,IAAK,IADD,EAAM,IAAI,EACL,EAAI,EAAG,EAAM,EAAO,MAAM,CAAE,EAAI,EAAK,IAC5C,EAAI,GAAG,CAAC,CAAM,CAAC,EAAE,CAAE,GAErB,OAAO,CACT,EAQA,EAAS,SAAS,CAAC,IAAI,CAAG,WACxB,OAAO,EAAe,IAAI,CAAC,IAAI,CAAC,IAAI,CAAG,OAAO,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,AACrF,EAOA,EAAS,SAAS,CAAC,GAAG,CAAG,SAAsB,CAAI,CAAE,CAAgB,EACnE,IAAI,EAAO,EAAe,EAAO,EAAK,WAAW,CAAC,GAC9C,EAAc,EAAe,IAAI,CAAC,GAAG,CAAC,GAAQ,EAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAE,GAClE,EAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CACxB,CAAA,CAAC,GAAe,CAAA,GAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAEd,IACC,EACF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,GAEpB,IAAI,CAAC,IAAI,CAAC,EAAK,CAAG,EAGxB,EAOA,EAAS,SAAS,CAAC,GAAG,CAAG,SAAsB,CAAI,EACjD,GAAI,EACF,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAErB,IAAI,EAAO,EAAK,WAAW,CAAC,GAC5B,OAAO,EAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAE,EAE/B,EAOA,EAAS,SAAS,CAAC,OAAO,CAAG,SAA0B,CAAI,EACzD,GAAI,EAAc,CAChB,IAAI,EAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GACxB,GAAI,GAAO,EACP,OAAO,CAEb,KAAO,CACL,IAAI,EAAO,EAAK,WAAW,CAAC,GAC5B,GAAI,EAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAE,GACtB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAK,AAE1B,CAEA,MAAM,AAAI,MAAM,IAAM,EAAO,uBAC/B,EAOA,EAAS,SAAS,CAAC,EAAE,CAAG,SAAqB,CAAI,EAC/C,GAAI,GAAQ,GAAK,EAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CACxC,OAAO,IAAI,CAAC,MAAM,CAAC,EAAK,AAE1B,OAAM,AAAI,MAAM,yBAA2B,EAC7C,EAOA,EAAS,SAAS,CAAC,OAAO,CAAG,WAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAC1B,EAEA,EAAQ,QAAQ,CAAG,C,E,C,iB,O,E,C,Q,C,S,C,C,C,C,C,ECjHnB,IAAI,EAAO,EAAQ,oBAqBnB,SAAS,IACP,IAAI,CAAC,MAAM,CAAG,EAAE,CAChB,IAAI,CAAC,OAAO,CAAG,CAAA,EAEf,IAAI,CAAC,KAAK,CAAG,CAAC,cAAe,GAAI,gBAAiB,CAAC,CACrD,CAQA,EAAY,SAAS,CAAC,eAAe,CACnC,SAA6B,CAAS,CAAE,CAAQ,EAC9C,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAW,EACjC,EAOF,EAAY,SAAS,CAAC,GAAG,CAAG,SAAyB,CAAQ,MAtC7B,EAE1B,EACA,EACA,EACA,GAHA,EAAQ,CAFkB,EAuCH,IAAI,CAAC,KAAK,EArChB,aAAa,CAC9B,EAAQ,AAoC2B,EApClB,aAAa,CAC9B,EAAU,EAAS,eAAe,CAClC,EAAU,AAkCyB,EAlChB,eAAe,CAC/B,EAAQ,GAAS,GAAS,GAAS,GAAW,GAC9C,AAAgE,GAAhE,EAAK,mCAAmC,CAAC,EAgCT,IACrC,IAAI,CAAC,KAAK,CAAG,EAGb,IAAI,CAAC,OAAO,CAAG,CAAA,EACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAErB,EAWA,EAAY,SAAS,CAAC,OAAO,CAAG,WAK9B,OAJK,IAAI,CAAC,OAAO,GACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAK,mCAAmC,EACzD,IAAI,CAAC,OAAO,CAAG,CAAA,GAEV,IAAI,CAAC,MAAM,AACpB,EAEA,EAAQ,WAAW,CAAG,C,E,C,iB,O,E,C,M,C,S,C,C,C,C,C,ECvEtB,IAAI,EAAO,EAAQ,oBACf,EAAe,EAAQ,oBACvB,EAAW,EAAQ,oBAAe,QAAQ,CAC1C,EAAY,EAAQ,oBACpB,EAAY,EAAQ,oBAAgB,SAAS,CAEjD,SAAS,EAAkB,CAAU,CAAE,CAAa,EAClD,IAAI,EAAY,EAKhB,MAJ0B,UAAtB,OAAO,GACT,CAAA,EAAY,EAAK,mBAAmB,CAAC,EADvC,EAIO,AAAsB,MAAtB,EAAU,QAAQ,CACrB,IAAI,EAAyB,EAAW,GACxC,IAAI,EAAuB,EAAW,EAC5C,CAyQA,SAAS,EAAuB,CAAU,CAAE,CAAa,EACvD,IAAI,EAAY,CACU,CAAA,UAAtB,OAAO,GACT,CAAA,EAAY,EAAK,mBAAmB,CAAC,EADvC,EAIA,IAAI,EAAU,EAAK,MAAM,CAAC,EAAW,WACjC,EAAU,EAAK,MAAM,CAAC,EAAW,WAGjC,EAAQ,EAAK,MAAM,CAAC,EAAW,QAAS,EAAE,EAC1C,EAAa,EAAK,MAAM,CAAC,EAAW,aAAc,MAClD,EAAiB,EAAK,MAAM,CAAC,EAAW,iBAAkB,MAC1D,EAAW,EAAK,MAAM,CAAC,EAAW,YAClC,EAAO,EAAK,MAAM,CAAC,EAAW,OAAQ,MAI1C,GAAI,GAAW,IAAI,CAAC,QAAQ,CAC1B,MAAM,AAAI,MAAM,wBAA0B,GAGxC,GACF,CAAA,EAAa,EAAK,SAAS,CAAC,EAD9B,EAIA,EAAU,EACP,GAAG,CAAC,QAIJ,GAAG,CAAC,EAAK,SAAS,EAKlB,GAAG,CAAC,SAAU,CAAM,EACnB,OAAO,GAAc,EAAK,UAAU,CAAC,IAAe,EAAK,UAAU,CAAC,GAChE,EAAK,QAAQ,CAAC,EAAY,GAC1B,CACN,GAMF,IAAI,CAAC,MAAM,CAAG,EAAS,SAAS,CAAC,EAAM,GAAG,CAAC,QAAS,CAAA,GACpD,IAAI,CAAC,QAAQ,CAAG,EAAS,SAAS,CAAC,EAAS,CAAA,GAE5C,IAAI,CAAC,gBAAgB,CAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC,SAAU,CAAC,EAC7D,OAAO,EAAK,gBAAgB,CAAC,EAAY,EAAG,EAC9C,GAEA,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,cAAc,CAAG,EACtB,IAAI,CAAC,SAAS,CAAG,EACjB,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,IAAI,CAAG,CACd,CA2GA,SAAS,IACP,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,eAAe,CAAG,EACvB,IAAI,CAAC,MAAM,CAAG,KACd,IAAI,CAAC,YAAY,CAAG,KACpB,IAAI,CAAC,cAAc,CAAG,KACtB,IAAI,CAAC,IAAI,CAAG,IACd,CAiaA,SAAS,EAAyB,CAAU,CAAE,CAAa,EACzD,IAAI,EAAY,CACU,CAAA,UAAtB,OAAO,GACT,CAAA,EAAY,EAAK,mBAAmB,CAAC,EADvC,EAIA,IAAI,EAAU,EAAK,MAAM,CAAC,EAAW,WACjC,EAAW,EAAK,MAAM,CAAC,EAAW,YAEtC,GAAI,GAAW,IAAI,CAAC,QAAQ,CAC1B,MAAM,AAAI,MAAM,wBAA0B,EAG5C,CAAA,IAAI,CAAC,QAAQ,CAAG,IAAI,EACpB,IAAI,CAAC,MAAM,CAAG,IAAI,EAElB,IAAI,EAAa,CACf,KAAM,GACN,OAAQ,CACV,CACA,CAAA,IAAI,CAAC,SAAS,CAAG,EAAS,GAAG,CAAC,SAAU,CAAC,EACvC,GAAI,EAAE,GAAG,CAGP,MAAM,AAAI,MAAM,sDAElB,IAAI,EAAS,EAAK,MAAM,CAAC,EAAG,UACxB,EAAa,EAAK,MAAM,CAAC,EAAQ,QACjC,EAAe,EAAK,MAAM,CAAC,EAAQ,UAEvC,GAAI,EAAa,EAAW,IAAI,EAC3B,IAAe,EAAW,IAAI,EAAI,EAAe,EAAW,MAAM,CACrE,MAAM,AAAI,MAAM,wDAIlB,OAFA,EAAa,EAEN,CACL,gBAAiB,CAGf,cAAe,EAAa,EAC5B,gBAAiB,EAAe,CAClC,EACA,SAAU,IAAI,EAAkB,EAAK,MAAM,CAAC,EAAG,OAAQ,EACzD,CACF,EACF,CAl4BA,EAAkB,aAAa,CAAG,SAAS,CAAU,CAAE,CAAa,EAClE,OAAO,EAAuB,aAAa,CAAC,EAAY,EAC1D,EAKA,EAAkB,SAAS,CAAC,QAAQ,CAAG,EAgCvC,EAAkB,SAAS,CAAC,mBAAmB,CAAG,KAClD,OAAO,cAAc,CAAC,EAAkB,SAAS,CAAE,qBAAsB,CACvE,aAAc,CAAA,EACd,WAAY,CAAA,EACZ,IAAK,WAKH,OAJK,IAAI,CAAC,mBAAmB,EAC3B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAE,IAAI,CAAC,UAAU,EAG9C,IAAI,CAAC,mBAAmB,AACjC,CACF,GAEA,EAAkB,SAAS,CAAC,kBAAkB,CAAG,KACjD,OAAO,cAAc,CAAC,EAAkB,SAAS,CAAE,oBAAqB,CACtE,aAAc,CAAA,EACd,WAAY,CAAA,EACZ,IAAK,WAKH,OAJK,IAAI,CAAC,kBAAkB,EAC1B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAE,IAAI,CAAC,UAAU,EAG9C,IAAI,CAAC,kBAAkB,AAChC,CACF,GAEA,EAAkB,SAAS,CAAC,uBAAuB,CACjD,SAAkD,CAAI,CAAE,CAAK,EAC3D,IAAI,EAAI,EAAK,MAAM,CAAC,GACpB,MAAO,AAAM,MAAN,GAAa,AAAM,MAAN,CACtB,EAOF,EAAkB,SAAS,CAAC,cAAc,CACxC,SAAyC,CAAI,CAAE,CAAW,EACxD,MAAM,AAAI,MAAM,2CAClB,EAEF,EAAkB,eAAe,CAAG,EACpC,EAAkB,cAAc,CAAG,EAEnC,EAAkB,oBAAoB,CAAG,EACzC,EAAkB,iBAAiB,CAAG,EAkBtC,EAAkB,SAAS,CAAC,WAAW,CACrC,SAAuC,CAAS,CAAE,CAAQ,CAAE,CAAM,EAKhE,OAHY,GAAU,EAAkB,eAAe,EAIvD,KAAK,EAAkB,eAAe,CACpC,EAAW,IAAI,CAAC,kBAAkB,CAClC,KACF,MAAK,EAAkB,cAAc,CACnC,EAAW,IAAI,CAAC,iBAAiB,CACjC,KACF,SACE,MAAM,AAAI,MAAM,8BAClB,CAEA,IAZI,EAYA,EAAa,IAAI,CAAC,UAAU,CAChC,EAAS,GAAG,CAAC,SAAU,CAAO,EAC5B,IAAI,EAAS,AAAmB,OAAnB,EAAQ,MAAM,CAAY,KAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAQ,MAAM,EAE7E,MAAO,CACL,OAFF,EAAS,EAAK,gBAAgB,CAAC,EAAY,EAAQ,IAAI,CAAC,aAAa,EAGnE,cAAe,EAAQ,aAAa,CACpC,gBAAiB,EAAQ,eAAe,CACxC,aAAc,EAAQ,YAAY,CAClC,eAAgB,EAAQ,cAAc,CACtC,KAAM,AAAiB,OAAjB,EAAQ,IAAI,CAAY,KAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAQ,IAAI,CAClE,CACF,EAAG,IAAI,EAAE,OAAO,CAAC,EA3BH,GAAY,KA4B5B,EAwBF,EAAkB,SAAS,CAAC,wBAAwB,CAClD,SAAoD,CAAK,EACvD,IAAI,EAAO,EAAK,MAAM,CAAC,EAAO,QAM1B,EAAS,CACX,OAAQ,EAAK,MAAM,CAAC,EAAO,UAC3B,aAAc,EACd,eAAgB,EAAK,MAAM,CAAC,EAAO,SAAU,EAC/C,EAGA,GADA,EAAO,MAAM,CAAG,IAAI,CAAC,gBAAgB,CAAC,EAAO,MAAM,EAC/C,EAAO,MAAM,CAAG,EAClB,MAAO,EAAE,CAGX,IAAI,EAAW,EAAE,CAEb,EAAQ,IAAI,CAAC,YAAY,CAAC,EACA,IAAI,CAAC,iBAAiB,CACtB,eACA,iBACA,EAAK,0BAA0B,CAC/B,EAAa,iBAAiB,EAC5D,GAAI,GAAS,EAAG,CACd,IAAI,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAM,CAE3C,GAAI,AAAiB,KAAA,IAAjB,EAAM,MAAM,CAOd,IANA,IAAI,EAAe,EAAQ,YAAY,CAMhC,GAAW,EAAQ,YAAY,GAAK,GACzC,EAAS,IAAI,CAAC,CACZ,KAAM,EAAK,MAAM,CAAC,EAAS,gBAAiB,MAC5C,OAAQ,EAAK,MAAM,CAAC,EAAS,kBAAmB,MAChD,WAAY,EAAK,MAAM,CAAC,EAAS,sBAAuB,KAC1D,GAEA,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAM,MAS3C,IANA,IAAI,EAAiB,EAAQ,cAAc,CAMpC,GACA,EAAQ,YAAY,GAAK,GACzB,EAAQ,cAAc,EAAI,GAC/B,EAAS,IAAI,CAAC,CACZ,KAAM,EAAK,MAAM,CAAC,EAAS,gBAAiB,MAC5C,OAAQ,EAAK,MAAM,CAAC,EAAS,kBAAmB,MAChD,WAAY,EAAK,MAAM,CAAC,EAAS,sBAAuB,KAC1D,GAEA,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAM,AAG/C,CAEA,OAAO,CACT,EAEF,EAAQ,iBAAiB,CAAG,EAgG5B,EAAuB,SAAS,CAAG,OAAO,MAAM,CAAC,EAAkB,SAAS,EAC5E,EAAuB,SAAS,CAAC,QAAQ,CAAG,EAM5C,EAAuB,SAAS,CAAC,gBAAgB,CAAG,SAAS,CAAO,EAClE,IAWI,EAXA,EAAiB,EAKrB,GAJuB,MAAnB,IAAI,CAAC,UAAU,EACjB,CAAA,EAAiB,EAAK,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAE,EADlD,EAII,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAM/B,IAAK,EAAI,EAAG,EAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAE,EAAE,EAC9C,GAAI,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAI,EAC9B,OAAO,EAIX,OAAO,EACT,EAWA,EAAuB,aAAa,CAClC,SAAyC,CAAU,CAAE,CAAa,EAChE,IAAI,EAAM,OAAO,MAAM,CAAC,EAAuB,SAAS,EAEpD,EAAQ,EAAI,MAAM,CAAG,EAAS,SAAS,CAAC,EAAW,MAAM,CAAC,OAAO,GAAI,CAAA,GACrE,EAAU,EAAI,QAAQ,CAAG,EAAS,SAAS,CAAC,EAAW,QAAQ,CAAC,OAAO,GAAI,CAAA,EAC/E,CAAA,EAAI,UAAU,CAAG,EAAW,WAAW,CACvC,EAAI,cAAc,CAAG,EAAW,uBAAuB,CAAC,EAAI,QAAQ,CAAC,OAAO,GACpB,EAAI,UAAU,EACtE,EAAI,IAAI,CAAG,EAAW,KAAK,CAC3B,EAAI,aAAa,CAAG,EACpB,EAAI,gBAAgB,CAAG,EAAI,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC,SAAU,CAAC,EAC3D,OAAO,EAAK,gBAAgB,CAAC,EAAI,UAAU,CAAE,EAAG,EAClD,GAWA,IAAK,IAJD,EAAoB,EAAW,SAAS,CAAC,OAAO,GAAG,KAAK,GACxD,EAAwB,EAAI,mBAAmB,CAAG,EAAE,CACpD,EAAuB,EAAI,kBAAkB,CAAG,EAAE,CAE7C,EAAI,EAAG,EAAS,EAAkB,MAAM,CAAE,EAAI,EAAQ,IAAK,CAClE,IAAI,EAAa,CAAiB,CAAC,EAAE,CACjC,EAAc,IAAI,CACtB,CAAA,EAAY,aAAa,CAAG,EAAW,aAAa,CACpD,EAAY,eAAe,CAAG,EAAW,eAAe,CAEpD,EAAW,MAAM,GACnB,EAAY,MAAM,CAAG,EAAQ,OAAO,CAAC,EAAW,MAAM,EACtD,EAAY,YAAY,CAAG,EAAW,YAAY,CAClD,EAAY,cAAc,CAAG,EAAW,cAAc,CAElD,EAAW,IAAI,EACjB,CAAA,EAAY,IAAI,CAAG,EAAM,OAAO,CAAC,EAAW,IAAI,CAAA,EAGlD,EAAqB,IAAI,CAAC,IAG5B,EAAsB,IAAI,CAAC,EAC7B,CAIA,OAFA,EAAU,EAAI,kBAAkB,CAAE,EAAK,0BAA0B,EAE1D,CACT,EAKF,EAAuB,SAAS,CAAC,QAAQ,CAAG,EAK5C,OAAO,cAAc,CAAC,EAAuB,SAAS,CAAE,UAAW,CACjE,IAAK,WACH,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EACpC,CACF,GAmBA,EAAuB,SAAS,CAAC,cAAc,CAC7C,SAAyC,CAAI,CAAE,CAAW,EAexD,IAdA,IAYI,EAAS,EAAK,EAAS,EAAK,EAZ5B,EAAgB,EAChB,EAA0B,EAC1B,EAAuB,EACvB,EAAyB,EACzB,EAAiB,EACjB,EAAe,EACf,EAAS,EAAK,MAAM,CACpB,EAAQ,EACR,EAAiB,CAAC,EAClB,EAAO,CAAC,EACR,EAAmB,EAAE,CACrB,EAAoB,EAAE,CAGnB,EAAQ,GACb,GAAI,AAAuB,MAAvB,EAAK,MAAM,CAAC,GACd,IACA,IACA,EAA0B,OAEvB,GAAI,AAAuB,MAAvB,EAAK,MAAM,CAAC,GACnB,QAEG,CASH,IAPA,AADA,CAAA,EAAU,IAAI,CAAd,EACQ,aAAa,CAAG,EAOnB,EAAM,EACT,AADgB,EAAM,IAClB,IAAI,CAAC,uBAAuB,CAAC,EAAM,GADT,KAQhC,GADA,EAAU,CAAc,CAFxB,EAAM,EAAK,KAAK,CAAC,EAAO,GAEK,CAE3B,GAAS,EAAI,MAAM,KACd,CAEL,IADA,EAAU,EAAE,CACL,EAAQ,GACb,EAAU,MAAM,CAAC,EAAM,EAAO,GAC9B,EAAQ,EAAK,KAAK,CAClB,EAAQ,EAAK,IAAI,CACjB,EAAQ,IAAI,CAAC,GAGf,GAAI,AAAmB,IAAnB,EAAQ,MAAM,CAChB,MAAM,AAAI,MAAM,0CAGlB,GAAI,AAAmB,IAAnB,EAAQ,MAAM,CAChB,MAAM,AAAI,MAAM,yCAGlB,CAAA,CAAc,CAAC,EAAI,CAAG,CACxB,CAGA,EAAQ,eAAe,CAAG,EAA0B,CAAO,CAAC,EAAE,CAC9D,EAA0B,EAAQ,eAAe,CAE7C,EAAQ,MAAM,CAAG,IAEnB,EAAQ,MAAM,CAAG,EAAiB,CAAO,CAAC,EAAE,CAC5C,GAAkB,CAAO,CAAC,EAAE,CAG5B,EAAQ,YAAY,CAAG,EAAuB,CAAO,CAAC,EAAE,CACxD,EAAuB,EAAQ,YAAY,CAE3C,EAAQ,YAAY,EAAI,EAGxB,EAAQ,cAAc,CAAG,EAAyB,CAAO,CAAC,EAAE,CAC5D,EAAyB,EAAQ,cAAc,CAE3C,EAAQ,MAAM,CAAG,IAEnB,EAAQ,IAAI,CAAG,EAAe,CAAO,CAAC,EAAE,CACxC,GAAgB,CAAO,CAAC,EAAE,GAI9B,EAAkB,IAAI,CAAC,GACa,UAAhC,OAAO,EAAQ,YAAY,EAC7B,EAAiB,IAAI,CAAC,EAE1B,CAGF,EAAU,EAAmB,EAAK,mCAAmC,EACrE,IAAI,CAAC,mBAAmB,CAAG,EAE3B,EAAU,EAAkB,EAAK,0BAA0B,EAC3D,IAAI,CAAC,kBAAkB,CAAG,CAC5B,EAMF,EAAuB,SAAS,CAAC,YAAY,CAC3C,SAAuC,CAAO,CAAE,CAAS,CAAE,CAAS,CAC7B,CAAW,CAAE,CAAW,CAAE,CAAK,EAMpE,GAAI,CAAO,CAAC,EAAU,EAAI,EACxB,MAAM,AAAI,UAAU,gDACE,CAAO,CAAC,EAAU,EAE1C,GAAI,CAAO,CAAC,EAAY,CAAG,EACzB,MAAM,AAAI,UAAU,kDACE,CAAO,CAAC,EAAY,EAG5C,OAAO,EAAa,MAAM,CAAC,EAAS,EAAW,EAAa,EAC9D,EAMF,EAAuB,SAAS,CAAC,kBAAkB,CACjD,WACE,IAAK,IAAI,EAAQ,EAAG,EAAQ,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAE,EAAE,EAAO,CACnE,IAAI,EAAU,IAAI,CAAC,kBAAkB,CAAC,EAAM,CAM5C,GAAI,EAAQ,EAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAE,CAC9C,IAAI,EAAc,IAAI,CAAC,kBAAkB,CAAC,EAAQ,EAAE,CAEpD,GAAI,EAAQ,aAAa,GAAK,EAAY,aAAa,CAAE,CACvD,EAAQ,mBAAmB,CAAG,EAAY,eAAe,CAAG,EAC5D,QACF,CACF,CAGA,EAAQ,mBAAmB,CAAG,GAChC,CACF,EA0BF,EAAuB,SAAS,CAAC,mBAAmB,CAClD,SAA+C,CAAK,EAClD,IAAI,EAAS,CACX,cAAe,EAAK,MAAM,CAAC,EAAO,QAClC,gBAAiB,EAAK,MAAM,CAAC,EAAO,SACtC,EAEI,EAAQ,IAAI,CAAC,YAAY,CAC3B,EACA,IAAI,CAAC,kBAAkB,CACvB,gBACA,kBACA,EAAK,mCAAmC,CACxC,EAAK,MAAM,CAAC,EAAO,OAAQ,EAAkB,oBAAoB,GAGnE,GAAI,GAAS,EAAG,CACd,IAAI,EAAU,IAAI,CAAC,kBAAkB,CAAC,EAAM,CAE5C,GAAI,EAAQ,aAAa,GAAK,EAAO,aAAa,CAAE,CAClD,IAAI,EAAS,EAAK,MAAM,CAAC,EAAS,SAAU,KAC7B,QAAX,IACF,EAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAC1B,EAAS,EAAK,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAE,EAAQ,IAAI,CAAC,aAAa,GAE5E,IAAI,EAAO,EAAK,MAAM,CAAC,EAAS,OAAQ,MAIxC,OAHa,OAAT,GACF,CAAA,EAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EADxB,EAGO,CACL,OAAQ,EACR,KAAM,EAAK,MAAM,CAAC,EAAS,eAAgB,MAC3C,OAAQ,EAAK,MAAM,CAAC,EAAS,iBAAkB,MAC/C,KAAM,CACR,CACF,CACF,CAEA,MAAO,CACL,OAAQ,KACR,KAAM,KACN,OAAQ,KACR,KAAM,IACR,CACF,EAMF,EAAuB,SAAS,CAAC,uBAAuB,CACtD,iBACE,EAAK,IAAI,CAAC,cAAc,EAGjB,IAAI,CAAC,cAAc,CAAC,MAAM,EAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IACrD,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAU,CAAE,EAAI,OAAO,AAAM,MAAN,CAAY,EACjE,EAOF,EAAuB,SAAS,CAAC,gBAAgB,CAC/C,SAA4C,CAAO,CAAE,CAAa,EAChE,GAAI,CAAC,IAAI,CAAC,cAAc,CACtB,OAAO,KAGT,IAUI,EAVA,EAAQ,IAAI,CAAC,gBAAgB,CAAC,GAClC,GAAI,GAAS,EACX,OAAO,IAAI,CAAC,cAAc,CAAC,EAAM,CAGnC,IAAI,EAAiB,EAMrB,GALuB,MAAnB,IAAI,CAAC,UAAU,EACjB,CAAA,EAAiB,EAAK,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAE,EADlD,EAKI,AAAmB,MAAnB,IAAI,CAAC,UAAU,EACX,CAAA,EAAM,EAAK,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAA,EAAI,CAK7C,IAAI,EAAiB,EAAe,OAAO,CAAC,aAAc,IAC1D,GAAI,AAAc,QAAd,EAAI,MAAM,EACP,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GACvB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAgB,CAGnE,GAAK,AAAA,CAAA,CAAC,EAAI,IAAI,EAAI,AAAY,KAAZ,EAAI,IAAI,AAAI,GACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAM,GAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAM,GAAgB,AAE3E,CAMA,GAAI,EACF,OAAO,IAGP,OAAM,AAAI,MAAM,IAAM,EAAiB,6BAE3C,EAyBF,EAAuB,SAAS,CAAC,oBAAoB,CACnD,SAAgD,CAAK,EACnD,IAAI,EAAS,EAAK,MAAM,CAAC,EAAO,UAEhC,GAAI,AADJ,CAAA,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAA/B,EACa,EACX,MAAO,CACL,KAAM,KACN,OAAQ,KACR,WAAY,IACd,EAGF,IAAI,EAAS,CACX,OAAQ,EACR,aAAc,EAAK,MAAM,CAAC,EAAO,QACjC,eAAgB,EAAK,MAAM,CAAC,EAAO,SACrC,EAEI,EAAQ,IAAI,CAAC,YAAY,CAC3B,EACA,IAAI,CAAC,iBAAiB,CACtB,eACA,iBACA,EAAK,0BAA0B,CAC/B,EAAK,MAAM,CAAC,EAAO,OAAQ,EAAkB,oBAAoB,GAGnE,GAAI,GAAS,EAAG,CACd,IAAI,EAAU,IAAI,CAAC,iBAAiB,CAAC,EAAM,CAE3C,GAAI,EAAQ,MAAM,GAAK,EAAO,MAAM,CAClC,MAAO,CACL,KAAM,EAAK,MAAM,CAAC,EAAS,gBAAiB,MAC5C,OAAQ,EAAK,MAAM,CAAC,EAAS,kBAAmB,MAChD,WAAY,EAAK,MAAM,CAAC,EAAS,sBAAuB,KAC1D,CAEJ,CAEA,MAAO,CACL,KAAM,KACN,OAAQ,KACR,WAAY,IACd,CACF,EAEF,EAAQ,sBAAsB,CAAG,EAmGjC,EAAyB,SAAS,CAAG,OAAO,MAAM,CAAC,EAAkB,SAAS,EAC9E,EAAyB,SAAS,CAAC,WAAW,CAAG,EAKjD,EAAyB,SAAS,CAAC,QAAQ,CAAG,EAK9C,OAAO,cAAc,CAAC,EAAyB,SAAS,CAAE,UAAW,CACnE,IAAK,WAEH,IAAK,IADD,EAAU,EAAE,CACP,EAAI,EAAG,EAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,IACzC,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAE,IAC7D,EAAQ,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAGtD,OAAO,CACT,CACF,GAqBA,EAAyB,SAAS,CAAC,mBAAmB,CACpD,SAAsD,CAAK,EACzD,IAAI,EAAS,CACX,cAAe,EAAK,MAAM,CAAC,EAAO,QAClC,gBAAiB,EAAK,MAAM,CAAC,EAAO,SACtC,EAII,EAAe,EAAa,MAAM,CAAC,EAAQ,IAAI,CAAC,SAAS,CAC3D,SAAS,CAAM,CAAE,CAAO,SAEtB,AADU,EAAO,aAAa,CAAG,EAAQ,eAAe,CAAC,aAAa,EAK9D,EAAO,eAAe,CACtB,EAAQ,eAAe,CAAC,eAAe,AACjD,GACE,EAAU,IAAI,CAAC,SAAS,CAAC,EAAa,QAE1C,AAAK,EASE,EAAQ,QAAQ,CAAC,mBAAmB,CAAC,CAC1C,KAAM,EAAO,aAAa,CACvB,CAAA,EAAQ,eAAe,CAAC,aAAa,CAAG,CAAA,EAC3C,OAAQ,EAAO,eAAe,CAC3B,CAAA,EAAQ,eAAe,CAAC,aAAa,GAAK,EAAO,aAAa,CAC5D,EAAQ,eAAe,CAAC,eAAe,CAAG,EAC1C,CAAA,EACL,KAAM,EAAM,IAAI,AAClB,GAhBS,CACL,OAAQ,KACR,KAAM,KACN,OAAQ,KACR,KAAM,IACR,CAYJ,EAMF,EAAyB,SAAS,CAAC,uBAAuB,CACxD,WACE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAU,CAAC,EACrC,OAAO,EAAE,QAAQ,CAAC,uBAAuB,EAC3C,EACF,EAOF,EAAyB,SAAS,CAAC,gBAAgB,CACjD,SAAmD,CAAO,CAAE,CAAa,EACvE,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,IAAK,CAG9C,IAAI,EAAU,AAFA,IAAI,CAAC,SAAS,CAAC,EAAE,CAET,QAAQ,CAAC,gBAAgB,CAAC,EAAS,CAAA,GACzD,GAAI,EACF,OAAO,CAEX,CACA,GAAI,EACF,OAAO,IAGP,OAAM,AAAI,MAAM,IAAM,EAAU,6BAEpC,EAoBF,EAAyB,SAAS,CAAC,oBAAoB,CACrD,SAAuD,CAAK,EAC1D,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,IAAK,CAC9C,IAAI,EAAU,IAAI,CAAC,SAAS,CAAC,EAAE,CAI/B,GAAI,AAAoE,KAApE,EAAQ,QAAQ,CAAC,gBAAgB,CAAC,EAAK,MAAM,CAAC,EAAO,YAGzD,IAAI,EAAoB,EAAQ,QAAQ,CAAC,oBAAoB,CAAC,GAC9D,GAAI,EASF,MARU,CACR,KAAM,EAAkB,IAAI,CACzB,CAAA,EAAQ,eAAe,CAAC,aAAa,CAAG,CAAA,EAC3C,OAAQ,EAAkB,MAAM,CAC7B,CAAA,EAAQ,eAAe,CAAC,aAAa,GAAK,EAAkB,IAAI,CAC9D,EAAQ,eAAe,CAAC,eAAe,CAAG,EAC1C,CAAA,CACP,EAGJ,CAEA,MAAO,CACL,KAAM,KACN,OAAQ,IACV,CACF,EAOF,EAAyB,SAAS,CAAC,cAAc,CAC/C,SAAgD,CAAI,CAAE,CAAW,EAC/D,IAAI,CAAC,mBAAmB,CAAG,EAAE,CAC7B,IAAI,CAAC,kBAAkB,CAAG,EAAE,CAC5B,IAAK,IAAI,EAAI,EAAG,EAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,IAGzC,IAAK,IAFD,EAAU,IAAI,CAAC,SAAS,CAAC,EAAE,CAC3B,EAAkB,EAAQ,QAAQ,CAAC,kBAAkB,CAChD,EAAI,EAAG,EAAI,EAAgB,MAAM,CAAE,IAAK,CAC/C,IAAI,EAAU,CAAe,CAAC,EAAE,CAE5B,EAAS,EAAQ,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAQ,MAAM,EACxD,EAAS,EAAK,gBAAgB,CAAC,EAAQ,QAAQ,CAAC,UAAU,CAAE,EAAQ,IAAI,CAAC,aAAa,EACtF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAClB,EAAS,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAE/B,IAAI,EAAO,IACP,CAAA,EAAQ,IAAI,GACd,EAAO,EAAQ,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAQ,IAAI,EAC9C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAChB,EAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAO7B,IAAI,EAAkB,CACpB,OAAQ,EACR,cAAe,EAAQ,aAAa,CACjC,CAAA,EAAQ,eAAe,CAAC,aAAa,CAAG,CAAA,EAC3C,gBAAiB,EAAQ,eAAe,CACrC,CAAA,EAAQ,eAAe,CAAC,aAAa,GAAK,EAAQ,aAAa,CAC9D,EAAQ,eAAe,CAAC,eAAe,CAAG,EAC1C,CAAA,EACJ,aAAc,EAAQ,YAAY,CAClC,eAAgB,EAAQ,cAAc,CACtC,KAAM,CACR,EAEA,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,GACc,UAAxC,OAAO,EAAgB,YAAY,EACrC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAEjC,CAGF,EAAU,IAAI,CAAC,mBAAmB,CAAE,EAAK,mCAAmC,EAC5E,EAAU,IAAI,CAAC,kBAAkB,CAAE,EAAK,0BAA0B,CACpE,EAEF,EAAQ,wBAAwB,CAAG,C,E,C,iB,Q,mB,Q,mB,Q,mB,Q,mB,O,E,C,Q,C,S,C,C,C,C,C,ECjnCnC,EAAQ,oBAAoB,CAAG,EAC/B,EAAQ,iBAAiB,CAAG,EAgF5B,EAAQ,MAAM,CAAG,SAAgB,CAAO,CAAE,CAAS,CAAE,CAAQ,CAAE,CAAK,EAClE,GAAI,AAAqB,IAArB,EAAU,MAAM,CAClB,OAAO,GAGT,IAAI,EAAQ,AAtEd,SAAS,EAAgB,CAAI,CAAE,CAAK,CAAE,CAAO,CAAE,CAAS,CAAE,CAAQ,CAAE,CAAK,EAUvE,IAAI,EAAM,KAAK,KAAK,CAAE,AAAA,CAAA,EAAQ,CAAA,EAAQ,GAAK,EACvC,EAAM,EAAS,EAAS,CAAS,CAAC,EAAI,CAAE,CAAA,UAC5C,AAAI,AAAQ,IAAR,EAEK,EAEA,EAAM,EAEb,AAAI,EAAQ,EAAM,EAET,EAAgB,EAAK,EAAO,EAAS,EAAW,EAAU,GAK/D,GAAS,EAAQ,iBAAiB,CAC7B,EAAQ,EAAU,MAAM,CAAG,EAAQ,GAEnC,EAKT,AAAI,EAAM,EAAO,EAER,EAAgB,EAAM,EAAK,EAAS,EAAW,EAAU,GAI9D,GAAS,EAAQ,iBAAiB,CAC7B,EAEA,EAAO,EAAI,GAAK,CAG7B,EAyB8B,GAAI,EAAU,MAAM,CAAE,EAAS,EAC/B,EAAU,GAAS,EAAQ,oBAAoB,EAC3E,GAAI,EAAQ,EACV,OAAO,GAMT,KACE,AADK,EAAQ,GAAK,GACd,AAA2D,IAA3D,EAAS,CAAS,CAAC,EAAM,CAAE,CAAS,CAAC,EAAQ,EAAE,CAAE,CAAA,IAGrD,EAAE,EAGJ,OAAO,CACT,C,E,C,E,C,Q,C,S,C,C,C,C,C,ECnFA,SAAS,EAAK,CAAG,CAAE,CAAC,CAAE,CAAC,EACrB,IAAI,EAAO,CAAG,CAAC,EAAE,AACjB,CAAA,CAAG,CAAC,EAAE,CAAG,CAAG,CAAC,EAAE,CACf,CAAG,CAAC,EAAE,CAAG,CACX,CAgFA,EAAQ,SAAS,CAAG,SAAU,CAAG,CAAE,CAAU,GAC3C,AAvDF,SAAS,EAAY,CAAG,CAAE,CAAU,CAAE,CAAC,CAAE,CAAC,EAKxC,GAAI,EAAI,EAAG,CAYT,IAAI,EAhCC,KAAK,KAAK,CAAC,AAgCkB,EAhCX,KAAK,MAAM,GAAM,CAAA,AAgCH,EAAH,CAhCa,GAiC3C,EAAI,EAAI,EAEZ,EAAK,EAAK,EAAY,GAStB,IAAK,IARD,EAAQ,CAAG,CAAC,EAAE,CAQT,EAAI,EAAG,EAAI,EAAG,IACY,GAA7B,EAAW,CAAG,CAAC,EAAE,CAAE,IAErB,EAAK,EADL,GAAK,EACQ,GAIjB,EAAK,EAAK,EAAI,EAAG,GACjB,IAAI,EAAI,EAAI,EAIZ,EAAY,EAAK,EAAY,EAAG,EAAI,GACpC,EAAY,EAAK,EAAY,EAAI,EAAG,EACtC,CACF,EAWc,EAAK,EAAY,EAAG,EAAI,MAAM,CAAG,EAC/C,C,E,C,E,C,M,C,S,C,C,C,C,C,EC1GA,IAAI,EAAqB,EAAQ,oBAA0B,kBAAkB,CACzE,EAAO,EAAQ,oBAIf,EAAgB,UAQhB,EAAe,qBAcnB,SAAS,EAAW,CAAK,CAAE,CAAO,CAAE,CAAO,CAAE,CAAO,CAAE,CAAK,EACzD,IAAI,CAAC,QAAQ,CAAG,EAAE,CAClB,IAAI,CAAC,cAAc,CAAG,CAAC,EACvB,IAAI,CAAC,IAAI,CAAG,AAAS,MAAT,EAAgB,KAAO,EACnC,IAAI,CAAC,MAAM,CAAG,AAAW,MAAX,EAAkB,KAAO,EACvC,IAAI,CAAC,MAAM,CAAG,AAAW,MAAX,EAAkB,KAAO,EACvC,IAAI,CAAC,IAAI,CAAG,AAAS,MAAT,EAAgB,KAAO,EACnC,IAAI,CAAC,EAAa,CAAG,CAAA,EACN,MAAX,GAAiB,IAAI,CAAC,GAAG,CAAC,EAChC,CAUA,EAAW,uBAAuB,CAChC,SAA4C,CAAc,CAAE,CAAkB,CAAE,CAAa,EAG3F,IAAI,EAAO,IAAI,EAMX,EAAiB,EAAe,KAAK,CAAC,GACtC,EAAsB,EACtB,EAAgB,WAIlB,OAAO,AAHY,IAEL,CAAA,KAAiB,EAA/B,EAGA,SAAS,IACP,OAAO,EAAsB,EAAe,MAAM,CAC9C,CAAc,CAAC,IAAsB,CAAG,KAAA,CAC9C,CACF,EAGI,EAAoB,EAAG,EAAsB,EAK7C,EAAc,KAgElB,OA9DA,EAAmB,WAAW,CAAC,SAAU,CAAO,EAC9C,GAAI,AAAgB,OAAhB,GAGF,GAAI,EAAoB,EAAQ,aAAa,CAE3C,EAAmB,EAAa,KAChC,IACA,EAAsB,MAEjB,CAIL,IAAI,EAAW,CAAc,CAAC,EAAoB,EAAI,GAClD,EAAO,EAAS,MAAM,CAAC,EAAG,EAAQ,eAAe,CACvB,EAC9B,CAAA,CAAc,CAAC,EAAoB,CAAG,EAAS,MAAM,CAAC,EAAQ,eAAe,CACzC,GACpC,EAAsB,EAAQ,eAAe,CAC7C,EAAmB,EAAa,GAEhC,EAAc,EACd,MACF,EAKF,KAAO,EAAoB,EAAQ,aAAa,EAC9C,EAAK,GAAG,CAAC,KACT,IAEF,GAAI,EAAsB,EAAQ,eAAe,CAAE,CACjD,IAAI,EAAW,CAAc,CAAC,EAAoB,EAAI,GACtD,EAAK,GAAG,CAAC,EAAS,MAAM,CAAC,EAAG,EAAQ,eAAe,GACnD,CAAc,CAAC,EAAoB,CAAG,EAAS,MAAM,CAAC,EAAQ,eAAe,EAC7E,EAAsB,EAAQ,eAAe,AAC/C,CACA,EAAc,CAChB,EAAG,IAAI,EAEH,EAAsB,EAAe,MAAM,GACzC,GAEF,EAAmB,EAAa,KAGlC,EAAK,GAAG,CAAC,EAAe,MAAM,CAAC,GAAqB,IAAI,CAAC,MAI3D,EAAmB,OAAO,CAAC,OAAO,CAAC,SAAU,CAAU,EACrD,IAAI,EAAU,EAAmB,gBAAgB,CAAC,EACnC,OAAX,IACmB,MAAjB,GACF,CAAA,EAAa,EAAK,IAAI,CAAC,EAAe,EADxC,EAGA,EAAK,gBAAgB,CAAC,EAAY,GAEtC,GAEO,EAEP,SAAS,EAAmB,CAAO,CAAE,CAAI,EACvC,GAAI,AAAY,OAAZ,GAAoB,AAAmB,KAAA,IAAnB,EAAQ,MAAM,CACpC,EAAK,GAAG,CAAC,OACJ,CACL,IAAI,EAAS,EACT,EAAK,IAAI,CAAC,EAAe,EAAQ,MAAM,EACvC,EAAQ,MAAM,CAClB,EAAK,GAAG,CAAC,IAAI,EAAW,EAAQ,YAAY,CACpB,EAAQ,cAAc,CACtB,EACA,EACA,EAAQ,IAAI,EACtC,CACF,CACF,EAQF,EAAW,SAAS,CAAC,GAAG,CAAG,SAAwB,CAAM,EACvD,GAAI,MAAM,OAAO,CAAC,GAChB,EAAO,OAAO,CAAC,SAAU,CAAK,EAC5B,IAAI,CAAC,GAAG,CAAC,EACX,EAAG,IAAI,OAEJ,GAAI,CAAM,CAAC,EAAa,EAAI,AAAkB,UAAlB,OAAO,EAClC,GACF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAIrB,MAAM,AAAI,UACR,8EAAgF,GAGpF,OAAO,IAAI,AACb,EAQA,EAAW,SAAS,CAAC,OAAO,CAAG,SAA4B,CAAM,EAC/D,GAAI,MAAM,OAAO,CAAC,GAChB,IAAK,IAAI,EAAI,EAAO,MAAM,CAAC,EAAG,GAAK,EAAG,IACpC,IAAI,CAAC,OAAO,CAAC,CAAM,CAAC,EAAE,OAGrB,GAAI,CAAM,CAAC,EAAa,EAAI,AAAkB,UAAlB,OAAO,EACtC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAGtB,MAAM,AAAI,UACR,8EAAgF,GAGpF,OAAO,IAAI,AACb,EASA,EAAW,SAAS,CAAC,IAAI,CAAG,SAAyB,CAAG,EAEtD,IAAK,IADD,EACK,EAAI,EAAG,EAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAE,EAAI,EAAK,IAE/C,AADJ,CAAA,EAAQ,IAAI,CAAC,QAAQ,CAAC,EAAE,AAAF,CACb,CAAC,EAAa,CACrB,EAAM,IAAI,CAAC,GAGG,KAAV,GACF,EAAI,EAAO,CAAE,OAAQ,IAAI,CAAC,MAAM,CACnB,KAAM,IAAI,CAAC,IAAI,CACf,OAAQ,IAAI,CAAC,MAAM,CACnB,KAAM,IAAI,CAAC,IAAI,AAAC,EAIrC,EAQA,EAAW,SAAS,CAAC,IAAI,CAAG,SAAyB,CAAI,EAGvD,IAFI,EACA,EACA,EAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAC9B,GAAI,EAAM,EAAG,CAEX,IAAK,EAAI,EADT,EAAc,EAAE,CACJ,EAAI,EAAI,EAAG,IACrB,EAAY,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EACjC,EAAY,IAAI,CAAC,GAEnB,EAAY,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EACjC,IAAI,CAAC,QAAQ,CAAG,CAClB,CACA,OAAO,IAAI,AACb,EASA,EAAW,SAAS,CAAC,YAAY,CAAG,SAAiC,CAAQ,CAAE,CAAY,EACzF,IAAI,EAAY,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAG,EAAE,CAUvD,OATI,CAAS,CAAC,EAAa,CACzB,EAAU,YAAY,CAAC,EAAU,GAE1B,AAAqB,UAArB,OAAO,EACd,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAG,EAAE,CAAG,EAAU,OAAO,CAAC,EAAU,GAGtE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,EAAU,IAEnC,IAAI,AACb,EASA,EAAW,SAAS,CAAC,gBAAgB,CACnC,SAAqC,CAAW,CAAE,CAAc,EAC9D,IAAI,CAAC,cAAc,CAAC,EAAK,WAAW,CAAC,GAAa,CAAG,CACvD,EAQF,EAAW,SAAS,CAAC,kBAAkB,CACrC,SAAuC,CAAG,EACxC,IAAK,IAAI,EAAI,EAAG,EAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAE,EAAI,EAAK,IAC/C,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAa,EAChC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,kBAAkB,CAAC,GAKxC,IAAK,IADD,EAAU,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,EACpC,EAAI,EAAG,EAAM,EAAQ,MAAM,CAAE,EAAI,EAAK,IAC7C,EAAI,EAAK,aAAa,CAAC,CAAO,CAAC,EAAE,EAAG,IAAI,CAAC,cAAc,CAAC,CAAO,CAAC,EAAE,CAAC,CAEvE,EAMF,EAAW,SAAS,CAAC,QAAQ,CAAG,WAC9B,IAAI,EAAM,GAIV,OAHA,IAAI,CAAC,IAAI,CAAC,SAAU,CAAK,EACvB,GAAO,CACT,GACO,CACT,EAMA,EAAW,SAAS,CAAC,qBAAqB,CAAG,SAA0C,CAAK,EAC1F,IAAI,EAAY,CACd,KAAM,GACN,KAAM,EACN,OAAQ,CACV,EACI,EAAM,IAAI,EAAmB,GAC7B,EAAsB,CAAA,EACtB,EAAqB,KACrB,EAAmB,KACnB,EAAqB,KACrB,EAAmB,KAqEvB,OApEA,IAAI,CAAC,IAAI,CAAC,SAAU,CAAK,CAAE,CAAQ,EACjC,EAAU,IAAI,EAAI,EACd,AAAoB,OAApB,EAAS,MAAM,EACZ,AAAkB,OAAlB,EAAS,IAAI,EACb,AAAoB,OAApB,EAAS,MAAM,EACjB,CAAA,IAAuB,EAAS,MAAM,EACnC,IAAqB,EAAS,IAAI,EAClC,IAAuB,EAAS,MAAM,EACtC,IAAqB,EAAS,IAAI,AAAJ,GAClC,EAAI,UAAU,CAAC,CACb,OAAQ,EAAS,MAAM,CACvB,SAAU,CACR,KAAM,EAAS,IAAI,CACnB,OAAQ,EAAS,MAAM,AACzB,EACA,UAAW,CACT,KAAM,EAAU,IAAI,CACpB,OAAQ,EAAU,MAAM,AAC1B,EACA,KAAM,EAAS,IAAI,AACrB,GAEF,EAAqB,EAAS,MAAM,CACpC,EAAmB,EAAS,IAAI,CAChC,EAAqB,EAAS,MAAM,CACpC,EAAmB,EAAS,IAAI,CAChC,EAAsB,CAAA,GACb,IACT,EAAI,UAAU,CAAC,CACb,UAAW,CACT,KAAM,EAAU,IAAI,CACpB,OAAQ,EAAU,MAAM,AAC1B,CACF,GACA,EAAqB,KACrB,EAAsB,CAAA,GAExB,IAAK,IAAI,EAAM,EAAG,EAAS,EAAM,MAAM,CAAE,EAAM,EAAQ,IACjD,AA5WS,KA4WT,EAAM,UAAU,CAAC,IACnB,EAAU,IAAI,GACd,EAAU,MAAM,CAAG,EAEf,EAAM,IAAM,GACd,EAAqB,KACrB,EAAsB,CAAA,GACb,GACT,EAAI,UAAU,CAAC,CACb,OAAQ,EAAS,MAAM,CACvB,SAAU,CACR,KAAM,EAAS,IAAI,CACnB,OAAQ,EAAS,MAAM,AACzB,EACA,UAAW,CACT,KAAM,EAAU,IAAI,CACpB,OAAQ,EAAU,MAAM,AAC1B,EACA,KAAM,EAAS,IAAI,AACrB,IAGF,EAAU,MAAM,EAGtB,GACA,IAAI,CAAC,kBAAkB,CAAC,SAAU,CAAU,CAAE,CAAa,EACzD,EAAI,gBAAgB,CAAC,EAAY,EACnC,GAEO,CAAE,KAAM,EAAU,IAAI,CAAE,IAAK,CAAI,CAC1C,EAEA,EAAQ,UAAU,CAAG,C,E,C,iB,Q,mB,O,E,C,M,C,S,C,C,C,C,C,EC5ZrB,EAAO,OAAO,CAAG,KAAK,KAAK,CAAC,guC,E,C,E,C,M,C,S,C,C,C,C,C,E,I,E,E,kD,E,iB,C,GCkiK5B,EAAA,MAAA,CAAA,EAAA,OAAA,IAAS,IAAT,EAAA,MAAA,CAAA,EAAA,SAAA,IAAe,GAAf,EAAA,MAAA,CAAA,EAAA,WAAA,IAAuB,GAAvB,EAAA,MAAA,CAAA,EAAA,iBAAA,IAAiC,GAAjC,EAAA,MAAA,CAAA,EAAA,aAAA,IAAiD,IAAjD,EAAA,MAAA,CAAA,EAAA,QAAA,IAA6D,IAA7D,EAAA,MAAA,CAAA,EAAA,YAAA,IAAoE,GAApE,EAAA,MAAA,CAAA,EAAA,iBAAA,IAA+E,GAA/E,EAAA,MAAA,CAAA,EAAA,cAAA,IAA+F,GAA/F,EAAA,MAAA,CAAA,EAAA,mBAAA,IAA4G,GAA5G,EAAA,MAAA,CAAA,EAAA,oBAAA,IAA8H,GAA9H,EAAA,MAAA,CAAA,EAAA,YAAA,IAAiJ,GAAjJ,EAAA,MAAA,CAAA,EAAA,eAAA,IAA4J,GAA5J,EAAA,MAAA,CAAA,EAAA,YAAA,IAAwL,GAAxL,EAAA,MAAA,CAAA,EAAA,aAAA,IAAmM,GAAnM,EAAA,MAAA,CAAA,EAAA,qBAAA,IAA+M,GAA/M,EAAA,MAAA,CAAA,EAAA,QAAA,IAAmO,IAAnO,EAAA,MAAA,CAAA,EAAA,oBAAA,IAA0O,IAA1O,EAAA,MAAA,CAAA,EAAA,cAAA,IAA6P,IAA7P,EAAA,MAAA,CAAA,EAAA,WAAA,IAAqR,GAArR,EAAA,MAAA,CAAA,EAAA,YAAA,IAAwS,IAAxS,EAAA,MAAA,CAAA,EAAA,UAAA,IAAmT,IAhiKnT,IAAI,EAAgB,CAClB,EAAG,sNACH,EAAG,+CACH,EAAG,OACH,OAAQ,yEACR,WAAY,gBACd,EAII,EAAuB,8KAEvB,EAAW,CACb,EAAG,EACH,UAAW,EAAuB,iBAClC,EAAG,EAAuB,0CAC5B,EAEI,EAA4B,kBAS5B,EAA+B,w6BAC/B,EAA0B,kjBAE1B,EAA0B,AAAI,OAAO,IAAM,EAA+B,KAC1E,EAAqB,AAAI,OAAO,IAAM,EAA+B,EAA0B,KAEnG,EAA+B,EAA0B,KASzD,IAAI,EAA6B,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,KAAK,IAAI,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,CAGzyC,EAAwB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,IAAI,CAKrqB,SAAS,EAAc,CAAI,CAAE,CAAG,EAE9B,IAAK,IADD,EAAM,MACD,EAAI,EAAG,EAAI,EAAI,MAAM,CAAE,GAAK,EAAG,CAEtC,GAAI,AADJ,CAAA,GAAO,CAAG,CAAC,EAAE,AAAF,EACD,EAAQ,MAAO,CAAA,EAEzB,GAAI,AADJ,CAAA,GAAO,CAAG,CAAC,EAAI,EAAE,AAAF,GACJ,EAAQ,MAAO,CAAA,CAC5B,CACF,CAIA,SAAS,EAAkB,CAAI,CAAE,CAAM,SACrC,AAAI,EAAO,GAAa,AAAS,KAAT,EACpB,EAAO,KACP,EAAO,GAAa,AAAS,KAAT,EACpB,EAAO,MACP,GAAQ,MAAiB,GAAQ,KAAQ,EAAwB,IAAI,CAAC,OAAO,YAAY,CAAC,IAC/E,CAAA,IAAX,GACG,EAAc,EAAM,IAC7B,CAIA,SAAS,EAAiB,CAAI,CAAE,CAAM,SACpC,AAAI,EAAO,GAAa,AAAS,KAAT,EACpB,EAAO,KACP,CAAA,EAAO,EAAA,IACP,EAAO,KACP,EAAO,GAAa,AAAS,KAAT,EACpB,EAAO,MACP,GAAQ,MAAiB,GAAQ,KAAQ,EAAmB,IAAI,CAAC,OAAO,YAAY,CAAC,IAC1E,CAAA,IAAX,GACG,CAAA,EAAc,EAAM,IAA+B,EAAc,EAAM,EAA9E,IACF,CAyBA,IAAI,EAAY,SAAmB,CAAK,CAAE,CAAI,EAC9B,KAAK,IAAd,GAAkB,CAAA,EAAO,CAAC,CAAA,EAE/B,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,OAAO,CAAG,EAAK,OAAO,CAC3B,IAAI,CAAC,UAAU,CAAG,CAAC,CAAC,EAAK,UAAU,CACnC,IAAI,CAAC,UAAU,CAAG,CAAC,CAAC,EAAK,UAAU,CACnC,IAAI,CAAC,MAAM,CAAG,CAAC,CAAC,EAAK,MAAM,CAC3B,IAAI,CAAC,QAAQ,CAAG,CAAC,CAAC,EAAK,QAAQ,CAC/B,IAAI,CAAC,MAAM,CAAG,CAAC,CAAC,EAAK,MAAM,CAC3B,IAAI,CAAC,OAAO,CAAG,CAAC,CAAC,EAAK,OAAO,CAC7B,IAAI,CAAC,KAAK,CAAG,EAAK,KAAK,EAAI,KAC3B,IAAI,CAAC,aAAa,CAAG,IACvB,EAEA,SAAS,EAAM,CAAI,CAAE,CAAI,EACvB,OAAO,IAAI,EAAU,EAAM,CAAC,WAAY,CAAA,EAAM,MAAO,CAAI,EAC3D,CACA,IAAI,EAAa,CAAC,WAAY,CAAA,CAAI,EAAG,EAAa,CAAC,WAAY,CAAA,CAAI,EAI/D,EAAa,CAAC,EAGlB,SAAS,EAAG,CAAI,CAAE,CAAO,EAIvB,OAHiB,KAAK,IAAjB,GAAqB,CAAA,EAAU,CAAC,CAAA,EAErC,EAAQ,OAAO,CAAG,EACX,CAAU,CAAC,EAAK,CAAG,IAAI,EAAU,EAAM,EAChD,CAEA,IAAI,EAAQ,CACV,IAAK,IAAI,EAAU,MAAO,GAC1B,OAAQ,IAAI,EAAU,SAAU,GAChC,OAAQ,IAAI,EAAU,SAAU,GAChC,KAAM,IAAI,EAAU,OAAQ,GAC5B,IAAK,IAAI,EAAU,OAGnB,SAAU,IAAI,EAAU,IAAK,CAAC,WAAY,CAAA,EAAM,WAAY,CAAA,CAAI,GAChE,SAAU,IAAI,EAAU,KACxB,OAAQ,IAAI,EAAU,IAAK,CAAC,WAAY,CAAA,EAAM,WAAY,CAAA,CAAI,GAC9D,OAAQ,IAAI,EAAU,KACtB,OAAQ,IAAI,EAAU,IAAK,CAAC,WAAY,CAAA,EAAM,WAAY,CAAA,CAAI,GAC9D,OAAQ,IAAI,EAAU,KACtB,MAAO,IAAI,EAAU,IAAK,GAC1B,KAAM,IAAI,EAAU,IAAK,GACzB,MAAO,IAAI,EAAU,IAAK,GAC1B,IAAK,IAAI,EAAU,KACnB,SAAU,IAAI,EAAU,IAAK,GAC7B,YAAa,IAAI,EAAU,MAC3B,MAAO,IAAI,EAAU,KAAM,GAC3B,SAAU,IAAI,EAAU,YACxB,gBAAiB,IAAI,EAAU,mBAC/B,SAAU,IAAI,EAAU,MAAO,GAC/B,UAAW,IAAI,EAAU,IAAK,GAC9B,aAAc,IAAI,EAAU,KAAM,CAAC,WAAY,CAAA,EAAM,WAAY,CAAA,CAAI,GAgBrE,GAAI,IAAI,EAAU,IAAK,CAAC,WAAY,CAAA,EAAM,SAAU,CAAA,CAAI,GACxD,OAAQ,IAAI,EAAU,KAAM,CAAC,WAAY,CAAA,EAAM,SAAU,CAAA,CAAI,GAC7D,OAAQ,IAAI,EAAU,QAAS,CAAC,OAAQ,CAAA,EAAM,QAAS,CAAA,EAAM,WAAY,CAAA,CAAI,GAC7E,OAAQ,IAAI,EAAU,MAAO,CAAC,WAAY,CAAA,EAAM,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,GAC9E,UAAW,EAAM,KAAM,GACvB,WAAY,EAAM,KAAM,GACxB,UAAW,EAAM,IAAK,GACtB,WAAY,EAAM,IAAK,GACvB,WAAY,EAAM,IAAK,GACvB,SAAU,EAAM,gBAAiB,GACjC,WAAY,EAAM,YAAa,GAC/B,SAAU,EAAM,YAAa,GAC7B,QAAS,IAAI,EAAU,MAAO,CAAC,WAAY,CAAA,EAAM,MAAO,EAAG,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,GACzF,OAAQ,EAAM,IAAK,IACnB,KAAM,EAAM,IAAK,IACjB,MAAO,EAAM,IAAK,IAClB,SAAU,IAAI,EAAU,KAAM,CAAC,WAAY,CAAA,CAAI,GAC/C,SAAU,EAAM,KAAM,GAGtB,OAAQ,EAAG,SACX,MAAO,EAAG,OAAQ,GAClB,OAAQ,EAAG,SACX,UAAW,EAAG,YACd,UAAW,EAAG,YACd,SAAU,EAAG,UAAW,GACxB,IAAK,EAAG,KAAM,CAAC,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,GAC7C,MAAO,EAAG,OAAQ,GAClB,SAAU,EAAG,WACb,KAAM,EAAG,MAAO,CAAC,OAAQ,CAAA,CAAI,GAC7B,UAAW,EAAG,WAAY,GAC1B,IAAK,EAAG,MACR,QAAS,EAAG,SAAU,GACtB,QAAS,EAAG,UACZ,OAAQ,EAAG,QAAS,GACpB,KAAM,EAAG,OACT,KAAM,EAAG,OACT,OAAQ,EAAG,SACX,OAAQ,EAAG,QAAS,CAAC,OAAQ,CAAA,CAAI,GACjC,MAAO,EAAG,QACV,KAAM,EAAG,MAAO,CAAC,WAAY,CAAA,EAAM,WAAY,CAAA,CAAI,GACnD,MAAO,EAAG,OAAQ,GAClB,OAAQ,EAAG,QAAS,GACpB,OAAQ,EAAG,QAAS,GACpB,SAAU,EAAG,UAAW,GACxB,QAAS,EAAG,UACZ,QAAS,EAAG,SAAU,GACtB,MAAO,EAAG,OAAQ,GAClB,MAAO,EAAG,OAAQ,GAClB,OAAQ,EAAG,QAAS,GACpB,IAAK,EAAG,KAAM,CAAC,WAAY,CAAA,EAAM,MAAO,CAAC,GACzC,YAAa,EAAG,aAAc,CAAC,WAAY,CAAA,EAAM,MAAO,CAAC,GACzD,QAAS,EAAG,SAAU,CAAC,WAAY,CAAA,EAAM,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,GACvE,MAAO,EAAG,OAAQ,CAAC,WAAY,CAAA,EAAM,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,GACnE,QAAS,EAAG,SAAU,CAAC,WAAY,CAAA,EAAM,OAAQ,CAAA,EAAM,WAAY,CAAA,CAAI,EACzE,EAKI,EAAY,yBACZ,EAAa,AAAI,OAAO,EAAU,MAAM,CAAE,KAE9C,SAAS,EAAU,CAAI,CAAE,CAAc,EACrC,OAAO,AAAS,KAAT,GAAe,AAAS,KAAT,GAAgB,CAAC,GAAmB,CAAA,AAAS,OAAT,GAAmB,AAAS,OAAT,CAAS,CACxF,CAEA,IAAI,EAAqB,gDAErB,EAAiB,gCAEjB,EAAM,OAAO,SAAS,CACtB,EAAiB,EAAI,cAAc,CACnC,EAAW,EAAI,QAAQ,CAI3B,SAAS,EAAI,CAAG,CAAE,CAAQ,EACxB,OAAO,EAAe,IAAI,CAAC,EAAK,EAClC,CAEA,IAAI,EAAU,MAAM,OAAO,EAAK,SAAU,CAAG,EAAI,MAC/C,AAAuB,mBAAvB,EAAS,IAAI,CAAC,EACb,EAEH,SAAS,EAAY,CAAK,EACxB,OAAO,AAAI,OAAO,OAAS,EAAM,OAAO,CAAC,KAAM,KAAO,KACxD,CAKA,IAAI,EAAW,SAAkB,CAAI,CAAE,CAAG,EACxC,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,MAAM,CAAG,CAChB,CAEA,CAAA,EAAS,SAAS,CAAC,MAAM,CAAG,SAAiB,CAAC,EAC5C,OAAO,IAAI,EAAS,IAAI,CAAC,IAAI,CAAE,IAAI,CAAC,MAAM,CAAG,EAC/C,EAEA,IAAI,EAAiB,SAAwB,CAAC,CAAE,CAAK,CAAE,CAAG,EACxD,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,GAAG,CAAG,EACU,OAAjB,EAAE,UAAU,EAAa,CAAA,IAAI,CAAC,MAAM,CAAG,EAAE,UAAU,AAAV,CAC/C,EAQA,SAAS,EAAY,CAAK,CAAE,CAAM,EAChC,IAAK,IAAI,EAAO,EAAG,EAAM,IAAK,CAC5B,EAAW,SAAS,CAAG,EACvB,IAAI,EAAQ,EAAW,IAAI,CAAC,GAC5B,GAAI,CAAA,IAAS,CAAA,EAAM,KAAK,CAAG,CAAA,EAIzB,OAAO,IAAI,EAAS,EAAM,EAAS,EAHnC,GAAE,EACF,EAAM,EAAM,KAAK,CAAG,CAAK,CAAC,EAAE,CAAC,MAAM,AAIvC,CACF,CAKA,IAAI,EAAiB,CAMnB,YAAa,GAIb,WAAY,SAMZ,oBAAqB,KAGrB,gBAAiB,KAKjB,cAAe,KAGf,2BAA4B,CAAA,EAG5B,4BAA6B,CAAA,EAG7B,0BAA2B,CAAA,EAG3B,cAAe,CAAA,EAKf,UAAW,CAAA,EAMX,QAAS,KAWT,UAAW,KASX,OAAQ,CAAA,EAMR,QAAS,KAGT,WAAY,KAGZ,iBAAkB,KAGlB,eAAgB,CAAA,CAClB,EAsDA,SAAS,EAAc,CAAK,CAAE,CAAS,EACrC,OAAO,AAVY,EAUM,CAAA,EART,EAQ+B,CAAA,EAAM,CAAA,EAPjC,EAO+D,CAAA,CACrF,CAWA,IAAI,EAAS,SAAgB,CAAO,CAAE,CAAK,CAAE,CAAQ,EACnD,IAAI,CAAC,OAAO,CAAG,EAAU,AAhE3B,SAAoB,CAAI,EACtB,IAqB4B,EArBxB,EAAU,CAAC,EAEf,IAAK,IAAI,KAAO,EACZ,CAAO,CAAC,EAAI,CAAG,GAAQ,EAAI,EAAM,GAAO,CAAI,CAAC,EAAI,CAAG,CAAc,CAAC,EAAI,CAQ3E,GANI,EAAQ,WAAW,EAAI,MACvB,CAAA,EAAQ,WAAW,EAAI,IAD3B,EAG6B,MAAzB,EAAQ,aAAa,EACrB,CAAA,EAAQ,aAAa,CAAG,EAAQ,WAAW,CAAG,CAAA,EAE9C,EAAQ,EAAQ,OAAO,EAAG,CAC5B,IAAI,EAAS,EAAQ,OAAO,AAC5B,CAAA,EAAQ,OAAO,CAAG,SAAU,CAAK,EAAI,OAAO,EAAO,IAAI,CAAC,EAAQ,CAClE,CAIA,OAHI,EAAQ,EAAQ,SAAS,GACzB,CAAA,EAAQ,SAAS,EAKO,EALiB,EAAQ,SAAS,CAMvD,SAAS,CAAK,CAAE,CAAI,CAAE,CAAK,CAAE,CAAG,CAAE,CAAQ,CAAE,CAAM,EACvD,IAAI,EAAU,CACZ,KAAM,EAAQ,QAAU,OACxB,MAAO,EACP,MAAO,EACP,IAAK,CACP,CACI,CAb8B,EAatB,SAAS,EACjB,CAAA,EAAQ,GAAG,CAAG,IAAI,EAAe,IAAI,CAAE,EAAU,EADrD,EAEI,AAf8B,EAetB,MAAM,EACd,CAAA,EAAQ,KAAK,CAAG,CAAC,EAAO,EAAI,AAAA,EAChC,EAAM,IAAI,CAAC,EACb,EAlB8D,EAEvD,CACT,EA4CsC,GACpC,IAAI,CAAC,UAAU,CAAG,EAAQ,UAAU,CACpC,IAAI,CAAC,QAAQ,CAAG,EAAY,CAAQ,CAAC,EAAQ,WAAW,EAAI,EAAI,EAAI,AAAuB,WAAvB,EAAQ,UAAU,CAAgB,UAAY,EAAE,EACpH,IAAI,EAAW,GACf,GAAI,AAA0B,CAAA,IAA1B,EAAQ,aAAa,CAAW,CAClC,IAAK,IAAI,EAAI,EAAQ,WAAW,EACxB,CAAA,EAAW,CAAa,CAAC,EAAE,AAAF,EADE,KAER,WAAvB,EAAQ,UAAU,EAAiB,CAAA,GAAY,QAAnD,CACF,CACA,IAAI,CAAC,aAAa,CAAG,EAAY,GACjC,IAAI,EAAkB,AAAA,CAAA,EAAW,EAAW,IAAM,EAAA,EAAM,EAAc,MAAM,AAC5E,CAAA,IAAI,CAAC,mBAAmB,CAAG,EAAY,GACvC,IAAI,CAAC,uBAAuB,CAAG,EAAY,EAAiB,IAAM,EAAc,UAAU,EAC1F,IAAI,CAAC,KAAK,CAAG,OAAO,GAKpB,IAAI,CAAC,WAAW,CAAG,CAAA,EAKf,GACF,IAAI,CAAC,GAAG,CAAG,EACX,IAAI,CAAC,SAAS,CAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAM,EAAW,GAAK,EAC9D,IAAI,CAAC,OAAO,CAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAG,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,GAAW,MAAM,GAE1E,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,SAAS,CAAG,EAC5B,IAAI,CAAC,OAAO,CAAG,GAKjB,IAAI,CAAC,IAAI,CAAG,EAAM,GAAG,CAErB,IAAI,CAAC,KAAK,CAAG,KAEb,IAAI,CAAC,KAAK,CAAG,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,GAAG,CAGhC,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,MAAM,CAAG,IAAI,CAAC,WAAW,GAG9C,IAAI,CAAC,aAAa,CAAG,IAAI,CAAC,eAAe,CAAG,KAC5C,IAAI,CAAC,YAAY,CAAG,IAAI,CAAC,UAAU,CAAG,IAAI,CAAC,GAAG,CAK9C,IAAI,CAAC,OAAO,CAAG,IAAI,CAAC,cAAc,GAClC,IAAI,CAAC,WAAW,CAAG,CAAA,EAGnB,IAAI,CAAC,QAAQ,CAAG,AAAuB,WAAvB,EAAQ,UAAU,CAClC,IAAI,CAAC,MAAM,CAAG,IAAI,CAAC,QAAQ,EAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAG5D,IAAI,CAAC,gBAAgB,CAAG,GAGxB,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,aAAa,CAAG,EAErD,IAAI,CAAC,MAAM,CAAG,EAAE,CAEhB,IAAI,CAAC,gBAAgB,CAAG,CAAC,EAGR,IAAb,IAAI,CAAC,GAAG,EAAU,EAAQ,aAAa,EAAI,AAA2B,OAA3B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAG,IAC/D,IAAI,CAAC,eAAe,CAAC,GAGzB,IAAI,CAAC,UAAU,CAAG,EAAE,CACpB,IAAI,CAAC,UAAU,CAjGD,GAoGd,IAAI,CAAC,WAAW,CAAG,IACrB,EAEI,EAAqB,CAAE,WAAY,CAAE,aAAc,CAAA,CAAK,EAAE,YAAa,CAAE,aAAc,CAAA,CAAK,EAAE,QAAS,CAAE,aAAc,CAAA,CAAK,EAAE,WAAY,CAAE,aAAc,CAAA,CAAK,EAAE,iBAAkB,CAAE,aAAc,CAAA,CAAK,EAAE,oBAAqB,CAAE,aAAc,CAAA,CAAK,CAAE,CAE1P,CAAA,EAAO,SAAS,CAAC,KAAK,CAAG,WACvB,IAAI,EAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAI,IAAI,CAAC,SAAS,GAEjD,OADA,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,aAAa,CAAC,EAC5B,EAEA,EAAmB,UAAU,CAAC,GAAG,CAAG,WAAc,MAAO,AAAC,CAAA,AA9GrC,EA8GqC,IAAI,CAAC,eAAe,GAAG,KAAK,AAAG,EAAkB,CAAE,EAC7G,EAAmB,WAAW,CAAC,GAAG,CAAG,WAAc,MAAO,AAAC,CAAA,AA5GrC,EA4GqC,IAAI,CAAC,eAAe,GAAG,KAAK,AAAG,EAAmB,CAAE,EAC/G,EAAmB,OAAO,CAAC,GAAG,CAAG,WAAc,MAAO,AAAC,CAAA,AA9GrC,EA8GqC,IAAI,CAAC,eAAe,GAAG,KAAK,AAAG,EAAe,CAAE,EACvG,EAAmB,UAAU,CAAC,GAAG,CAAG,WAAc,MAAO,AAAC,CAAA,AA3GxC,GA2GwC,IAAI,CAAC,gBAAgB,GAAG,KAAK,AAAG,EAAe,CAAE,EAC3G,EAAmB,gBAAgB,CAAC,GAAG,CAAG,WAAc,MAAO,AAAC,CAAA,AA3GvC,IA2GuC,IAAI,CAAC,gBAAgB,GAAG,KAAK,AAAG,EAAsB,CAAE,EACxH,EAAmB,mBAAmB,CAAC,GAAG,CAAG,WAAc,OAAO,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,YAAY,GAAI,EAGvH,EAAO,SAAS,CAAC,kBAAkB,CAAG,WAAiC,MAAO,AAAC,CAAA,AAtH1D,EAsH0D,IAAI,CAAC,gBAAgB,GAAG,KAAK,AAAG,EAAkB,CAAE,EAEnI,EAAO,MAAM,CAAG,WAEZ,IADA,IAAI,EAAU,EAAE,CAAE,EAAM,UAAU,MAAM,CAChC,KAAQ,CAAO,CAAE,EAAK,CAAG,SAAS,CAAE,EAAK,CAGnD,IAAK,IADD,EAAM,IAAI,CACL,EAAI,EAAG,EAAI,EAAQ,MAAM,CAAE,IAAO,EAAM,CAAO,CAAC,EAAE,CAAC,GAC5D,OAAO,CACT,EAEA,EAAO,KAAK,CAAG,SAAgB,CAAK,CAAE,CAAO,EAC3C,OAAO,IAAI,IAAI,CAAC,EAAS,GAAO,KAAK,EACvC,EAEA,EAAO,iBAAiB,CAAG,SAA4B,CAAK,CAAE,CAAG,CAAE,CAAO,EACxE,IAAI,EAAS,IAAI,IAAI,CAAC,EAAS,EAAO,GAEtC,OADA,EAAO,SAAS,GACT,EAAO,eAAe,EAC/B,EAEA,EAAO,SAAS,CAAG,SAAoB,CAAK,CAAE,CAAO,EACnD,OAAO,IAAI,IAAI,CAAC,EAAS,EAC3B,EAEA,OAAO,gBAAgB,CAAE,EAAO,SAAS,CAAE,GAE3C,IAAI,EAAK,EAAO,SAAS,CAIrB,EAAU,iDAwGd,SAAS,IACP,IAAI,CAAC,eAAe,CACpB,IAAI,CAAC,aAAa,CAClB,IAAI,CAAC,mBAAmB,CACxB,IAAI,CAAC,iBAAiB,CACtB,IAAI,CAAC,WAAW,CACd,EACJ,CA9GA,EAAG,eAAe,CAAG,SAAS,CAAK,EACjC,OAAS,CAEP,EAAe,SAAS,CAAG,EAC3B,GAAS,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,CAClD,IAAI,EAAQ,EAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAC1C,GAAI,CAAC,EAAS,MAAO,CAAA,EACrB,GAAI,AAA2B,eAA1B,CAAA,CAAK,CAAC,EAAE,EAAI,CAAK,CAAC,EAAC,AAAD,EAAsB,CAC3C,EAAe,SAAS,CAAG,EAAQ,CAAK,CAAC,EAAE,CAAC,MAAM,CAClD,IAAI,EAAa,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,EAAG,EAAM,EAAW,KAAK,CAAG,CAAU,CAAC,EAAE,CAAC,MAAM,CAC3F,EAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAC7B,MAAO,AAAS,MAAT,GAAgB,AAAS,MAAT,GACpB,EAAU,IAAI,CAAC,CAAU,CAAC,EAAE,GAC5B,CAAE,CAAA,sBAAsB,IAAI,CAAC,IAAS,AAAS,MAAT,GAAgB,AAA+B,MAA/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAM,EAAO,CAC1F,CACA,GAAS,CAAK,CAAC,EAAE,CAAC,MAAM,CAGxB,EAAe,SAAS,CAAG,EAC3B,GAAS,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,CACxB,MAAtB,IAAI,CAAC,KAAK,CAAC,EAAM,EACjB,GACN,CACF,EAKA,EAAG,GAAG,CAAG,SAAS,CAAI,SACpB,AAAI,IAAI,CAAC,IAAI,GAAK,IAChB,IAAI,CAAC,IAAI,GACF,CAAA,EAIX,EAIA,EAAG,YAAY,CAAG,SAAS,CAAI,EAC7B,OAAO,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,IAAI,CAAC,KAAK,GAAK,GAAQ,CAAC,IAAI,CAAC,WAAW,AAC7E,EAIA,EAAG,aAAa,CAAG,SAAS,CAAI,QAC9B,EAAK,IAAI,CAAC,YAAY,CAAC,KACvB,IAAI,CAAC,IAAI,GACF,CAAA,EACT,EAIA,EAAG,gBAAgB,CAAG,SAAS,CAAI,EAC5B,IAAI,CAAC,aAAa,CAAC,IAAS,IAAI,CAAC,UAAU,EAClD,EAIA,EAAG,kBAAkB,CAAG,WACtB,OAAO,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAC5B,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAC1B,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,KAAK,EAC/D,EAEA,EAAG,eAAe,CAAG,WACnB,GAAI,IAAI,CAAC,kBAAkB,GAGzB,OAFI,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAChC,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,aAAa,EACjE,CAAA,CAEX,EAKA,EAAG,SAAS,CAAG,WACR,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,GAAM,IAAI,CAAC,eAAe,IAAM,IAAI,CAAC,UAAU,EACzE,EAEA,EAAG,kBAAkB,CAAG,SAAS,CAAO,CAAE,CAAO,EAC/C,GAAI,IAAI,CAAC,IAAI,GAAK,EAKhB,OAJI,IAAI,CAAC,OAAO,CAAC,eAAe,EAC5B,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,YAAY,CAAE,IAAI,CAAC,eAAe,EACnE,GACD,IAAI,CAAC,IAAI,GACN,CAAA,CAEX,EAKA,EAAG,MAAM,CAAG,SAAS,CAAI,EACvB,IAAI,CAAC,GAAG,CAAC,IAAS,IAAI,CAAC,UAAU,EACnC,EAIA,EAAG,UAAU,CAAG,SAAS,CAAG,EAC1B,IAAI,CAAC,KAAK,CAAC,AAAO,MAAP,EAAc,EAAM,IAAI,CAAC,KAAK,CAAE,mBAC7C,EAWA,EAAG,kBAAkB,CAAG,SAAS,CAAsB,CAAE,CAAQ,EAC/D,GAAK,GACD,EAAuB,aAAa,CAAG,IACvC,IAAI,CAAC,gBAAgB,CAAC,EAAuB,aAAa,CAAE,iDAChE,IAAI,EAAS,EAAW,EAAuB,mBAAmB,CAAG,EAAuB,iBAAiB,CACzG,EAAS,IAAM,IAAI,CAAC,gBAAgB,CAAC,EAAQ,yBACnD,EAEA,EAAG,qBAAqB,CAAG,SAAS,CAAsB,CAAE,CAAQ,EAClE,GAAI,CAAC,EAA0B,MAAO,CAAA,EACtC,IAAI,EAAkB,EAAuB,eAAe,CACxD,EAAc,EAAuB,WAAW,CACpD,GAAI,CAAC,EAAY,OAAO,GAAmB,GAAK,GAAe,EAC3D,GAAmB,GACnB,IAAI,CAAC,KAAK,CAAC,EAAiB,2EAC5B,GAAe,GACf,IAAI,CAAC,gBAAgB,CAAC,EAAa,qCACzC,EAEA,EAAG,8BAA8B,CAAG,WAC9B,IAAI,CAAC,QAAQ,EAAK,CAAA,CAAC,IAAI,CAAC,QAAQ,EAAI,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,QAAQ,AAAR,GACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAE,8CAC1B,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAE,6CAChC,EAEA,EAAG,oBAAoB,CAAG,SAAS,CAAI,QACrC,AAAI,AAAc,4BAAd,EAAK,IAAI,CACF,IAAI,CAAC,oBAAoB,CAAC,EAAK,UAAU,EAC7C,AAAc,eAAd,EAAK,IAAI,EAAqB,AAAc,qBAAd,EAAK,IAAI,AAChD,EAEA,IAAI,EAAO,EAAO,SAAS,AAS3B,CAAA,EAAK,aAAa,CAAG,SAAS,CAAI,EAChC,IAAI,EAAU,CAAC,EAEf,IADK,EAAK,IAAI,EAAI,CAAA,EAAK,IAAI,CAAG,EAAE,AAAF,EACvB,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAE,CAC9B,IAAI,EAAO,IAAI,CAAC,cAAc,CAAC,KAAM,CAAA,EAAM,GAC3C,EAAK,IAAI,CAAC,IAAI,CAAC,EACjB,CACA,GAAI,IAAI,CAAC,QAAQ,CACb,IAAK,IAAI,EAAI,EAAG,EAAO,OAAO,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAG,EAAI,EAAK,MAAM,CAAE,GAAK,EACjF,CACE,IAAI,EAAO,CAAI,CAAC,EAAE,CAElB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAK,CAAC,KAAK,CAAG,WAAa,EAAO,mBAChF,CAIJ,OAHA,IAAI,CAAC,sBAAsB,CAAC,EAAK,IAAI,EACrC,IAAI,CAAC,IAAI,GACT,EAAK,UAAU,CAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAClC,IAAI,CAAC,UAAU,CAAC,EAAM,UAC/B,EAEA,IAAI,EAAY,CAAC,KAAM,MAAM,EAAG,EAAc,CAAC,KAAM,QAAQ,CAE7D,CAAA,EAAK,KAAK,CAAG,SAAS,CAAO,EAC3B,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,GAAK,CAAC,IAAI,CAAC,YAAY,CAAC,OAAU,MAAO,CAAA,CACxE,CAAA,EAAe,SAAS,CAAG,IAAI,CAAC,GAAG,CACnC,IAAI,EAAO,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,EACrC,EAAO,IAAI,CAAC,GAAG,CAAG,CAAI,CAAC,EAAE,CAAC,MAAM,CAAE,EAAS,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAKrE,GAAI,AAAW,KAAX,EAAiB,MAAO,CAAA,EAC5B,GAAI,EAAW,MAAO,CAAA,EAEtB,GAAI,AAAW,MAAX,EAAkB,MAAO,CAAA,EAC7B,GAAI,EAAkB,EAAQ,CAAA,GAAO,CAEnC,IADA,IAAI,EAAM,EAAO,EACV,EAAiB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAM,CAAA,IAAS,EAAE,EAC/D,IAAI,EAAQ,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAM,GACnC,GAAI,CAAC,EAA0B,IAAI,CAAC,GAAU,MAAO,CAAA,CACvD,CACA,MAAO,CAAA,CACT,EAKA,EAAK,eAAe,CAAG,WACrB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,GAAK,CAAC,IAAI,CAAC,YAAY,CAAC,SACnD,MAAO,CAAA,CAEX,CAAA,EAAe,SAAS,CAAG,IAAI,CAAC,GAAG,CACnC,IAAI,EAAO,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,EACrC,EAAO,IAAI,CAAC,GAAG,CAAG,CAAI,CAAC,EAAE,CAAC,MAAM,CACpC,MAAO,CAAC,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,KAChD,AAAqC,aAArC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAM,EAAO,IAC7B,CAAA,EAAO,IAAM,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,CAAC,EAAiB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAO,GAAA,CAClF,EASA,EAAK,cAAc,CAAG,SAAS,CAAO,CAAE,CAAQ,CAAE,CAAO,EACvD,IAAoD,EAAhD,EAAY,IAAI,CAAC,IAAI,CAAE,EAAO,IAAI,CAAC,SAAS,GAWhD,OATI,IAAI,CAAC,KAAK,CAAC,KACb,EAAY,EAAM,IAAI,CACtB,EAAO,OAOD,GACR,KAAK,EAAM,MAAM,CAAE,KAAK,EAAM,SAAS,CAAE,OAAO,IAAI,CAAC,2BAA2B,CAAC,EAAM,EAAU,OAAO,CACxG,MAAK,EAAM,SAAS,CAAE,OAAO,IAAI,CAAC,sBAAsB,CAAC,EACzD,MAAK,EAAM,GAAG,CAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAC7C,MAAK,EAAM,IAAI,CAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,EAC/C,MAAK,EAAM,SAAS,CAKlB,OADI,GAAa,CAAA,IAAI,CAAC,MAAM,EAAI,AAAY,OAAZ,GAAoB,AAAY,UAAZ,CAAY,GAAa,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,UAAU,GACtH,IAAI,CAAC,sBAAsB,CAAC,EAAM,CAAA,EAAO,CAAC,EACnD,MAAK,EAAM,MAAM,CAEf,OADI,GAAW,IAAI,CAAC,UAAU,GACvB,IAAI,CAAC,UAAU,CAAC,EAAM,CAAA,EAC/B,MAAK,EAAM,GAAG,CAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAC7C,MAAK,EAAM,OAAO,CAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,EACrD,MAAK,EAAM,OAAO,CAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,EACrD,MAAK,EAAM,MAAM,CAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,EACnD,MAAK,EAAM,IAAI,CAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,EAC/C,MAAK,EAAM,MAAM,CAAE,KAAK,EAAM,IAAI,CAGhC,OAFA,EAAO,GAAQ,IAAI,CAAC,KAAK,CACrB,GAAW,AAAS,QAAT,GAAkB,IAAI,CAAC,UAAU,GACzC,IAAI,CAAC,iBAAiB,CAAC,EAAM,EACtC,MAAK,EAAM,MAAM,CAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,EACnD,MAAK,EAAM,KAAK,CAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,EACjD,MAAK,EAAM,MAAM,CAAE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAA,EAAM,EAChD,MAAK,EAAM,IAAI,CAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,EACjD,MAAK,EAAM,OAAO,CAClB,KAAK,EAAM,OAAO,CAChB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,IAAM,IAAc,EAAM,OAAO,CAAE,CAChE,EAAe,SAAS,CAAG,IAAI,CAAC,GAAG,CACnC,IAAI,EAAO,EAAe,IAAI,CAAC,IAAI,CAAC,KAAK,EACrC,EAAO,IAAI,CAAC,GAAG,CAAG,CAAI,CAAC,EAAE,CAAC,MAAM,CAAE,EAAS,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GACrE,GAAI,AAAW,KAAX,GAAiB,AAAW,KAAX,EACjB,OAAO,IAAI,CAAC,wBAAwB,CAAC,EAAM,IAAI,CAAC,eAAe,GACrE,CAQA,OANK,IAAI,CAAC,OAAO,CAAC,2BAA2B,GACtC,GACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,0DACtB,IAAI,CAAC,QAAQ,EACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,oEAEtB,IAAc,EAAM,OAAO,CAAG,IAAI,CAAC,WAAW,CAAC,GAAQ,IAAI,CAAC,WAAW,CAAC,EAAM,EAOvF,SACE,GAAI,IAAI,CAAC,eAAe,GAGtB,OAFI,GAAW,IAAI,CAAC,UAAU,GAC9B,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,sBAAsB,CAAC,EAAM,CAAA,EAAM,CAAC,GAGlD,IAAI,EAAY,IAAI,CAAC,KAAK,CAAE,EAAO,IAAI,CAAC,eAAe,GACvD,GAAI,IAAc,EAAM,IAAI,EAAI,AAAc,eAAd,EAAK,IAAI,EAAqB,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAC9E,OAAO,IAAI,CAAC,qBAAqB,CAAC,EAAM,EAAW,EAAM,GACtD,OAAO,IAAI,CAAC,wBAAwB,CAAC,EAAM,EACpD,CACF,EAEA,EAAK,2BAA2B,CAAG,SAAS,CAAI,CAAE,CAAO,EACvD,IAAI,EAAU,AAAY,UAAZ,EACd,IAAI,CAAC,IAAI,GACL,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,GAAK,IAAI,CAAC,eAAe,GAAM,EAAK,KAAK,CAAG,KAC1D,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAI,IAAI,CAAC,UAAU,IAElD,EAAK,KAAK,CAAG,IAAI,CAAC,UAAU,GAC5B,IAAI,CAAC,SAAS,IAMhB,IADA,IAAI,EAAI,EACD,EAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAE,EAAE,EAAG,CAClC,IAAI,EAAM,IAAI,CAAC,MAAM,CAAC,EAAE,CACxB,GAAI,CAAA,AAAc,MAAd,EAAK,KAAK,EAAY,EAAI,IAAI,GAAK,EAAK,KAAK,CAAC,IAAI,AAAJ,IAChC,MAAZ,EAAI,IAAI,EAAa,CAAA,GAAW,AAAa,SAAb,EAAI,IAAI,AAAK,GAC7C,EAAK,KAAK,EAAI,GAD0C,KAGhE,CAEA,OADI,IAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,eAAiB,GACjE,IAAI,CAAC,UAAU,CAAC,EAAM,EAAU,iBAAmB,oBAC5D,EAEA,EAAK,sBAAsB,CAAG,SAAS,CAAI,EAGzC,OAFA,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,oBAC/B,EAEA,EAAK,gBAAgB,CAAG,SAAS,CAAI,EAWnC,OAVA,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GACjB,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,MAChC,IAAI,CAAC,MAAM,CAAC,GAAG,GACf,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,IAAI,CAAG,IAAI,CAAC,oBAAoB,GACjC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAC5B,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EAEnB,IAAI,CAAC,SAAS,GACX,IAAI,CAAC,UAAU,CAAC,EAAM,mBAC/B,EAUA,EAAK,iBAAiB,CAAG,SAAS,CAAI,EACpC,IAAI,CAAC,IAAI,GACT,IAAI,EAAU,IAAK,CAAC,OAAO,CAAC,WAAW,EAAI,GAAM,CAAA,IAAI,CAAC,OAAO,EAAK,CAAC,IAAI,CAAC,UAAU,EAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,AAAzB,GAA+B,IAAI,CAAC,aAAa,CAAC,SAAY,IAAI,CAAC,YAAY,CAAG,GAIrL,GAHA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GACjB,IAAI,CAAC,UAAU,CAAC,GAChB,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACpB,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAE1B,OADI,EAAU,IAAM,IAAI,CAAC,UAAU,CAAC,GAC7B,IAAI,CAAC,QAAQ,CAAC,EAAM,MAE7B,IAAI,EAAQ,IAAI,CAAC,KAAK,GACtB,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,EAAO,CACnE,IAAI,EAAS,IAAI,CAAC,SAAS,GAAI,EAAO,EAAQ,MAAQ,IAAI,CAAC,KAAK,OAIhE,CAHA,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,QAAQ,CAAC,EAAQ,CAAA,EAAM,GAC5B,IAAI,CAAC,UAAU,CAAC,EAAQ,uBACpB,AAAC,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAK,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,YAAY,CAAC,KAAA,GAAW,AAA+B,IAA/B,EAAO,YAAY,CAAC,MAAM,GACnH,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAC1B,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,CACrB,EAAU,IAAM,IAAI,CAAC,UAAU,CAAC,GAC7B,EAAK,KAAK,CAAG,EAAU,IAE3B,IAAI,CAAC,UAAU,CAAC,EAAM,KAE3B,EAAU,IAAM,IAAI,CAAC,UAAU,CAAC,GAC7B,IAAI,CAAC,QAAQ,CAAC,EAAM,GAC7B,CACA,IAAI,EAAyB,IAAI,EAC7B,EAAO,IAAI,CAAC,eAAe,CAAC,CAAA,EAAM,UACtC,AAAI,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAK,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,YAAY,CAAC,OAC7E,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAC1B,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,CACrB,EAAU,IAAM,IAAI,CAAC,UAAU,CAAC,GAC7B,EAAK,KAAK,CAAG,EAAU,IAElC,IAAI,CAAC,YAAY,CAAC,EAAM,CAAA,EAAO,GAC/B,IAAI,CAAC,SAAS,CAAC,GACR,IAAI,CAAC,UAAU,CAAC,EAAM,KAE7B,IAAI,CAAC,qBAAqB,CAAC,EAAwB,CAAA,GAEjD,EAAU,IAAM,IAAI,CAAC,UAAU,CAAC,GAC7B,IAAI,CAAC,QAAQ,CAAC,EAAM,GAC7B,EAEA,EAAK,sBAAsB,CAAG,SAAS,CAAI,CAAE,CAAO,CAAE,CAAmB,EAEvE,OADA,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,aAAa,CAAC,EAAM,EAAkB,CAAA,EAAsB,EAAI,CAAA,EAAyB,CAAA,EAAO,EAC9G,EAEA,EAAK,gBAAgB,CAAG,SAAS,CAAI,EAMnC,OALA,IAAI,CAAC,IAAI,GACT,EAAK,IAAI,CAAG,IAAI,CAAC,oBAAoB,GAErC,EAAK,UAAU,CAAG,IAAI,CAAC,cAAc,CAAC,MACtC,EAAK,SAAS,CAAG,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAAI,IAAI,CAAC,cAAc,CAAC,MAAQ,KAC9D,IAAI,CAAC,UAAU,CAAC,EAAM,cAC/B,EAEA,EAAK,oBAAoB,CAAG,SAAS,CAAI,EAWvC,OAVK,IAAI,CAAC,UAAU,EAAK,IAAI,CAAC,OAAO,CAAC,0BAA0B,EAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,gCAC3B,IAAI,CAAC,IAAI,GAML,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,GAAK,IAAI,CAAC,eAAe,GAAM,EAAK,QAAQ,CAAG,MAC/D,EAAK,QAAQ,CAAG,IAAI,CAAC,eAAe,GAAI,IAAI,CAAC,SAAS,IACtD,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,EAAK,oBAAoB,CAAG,SAAS,CAAI,EACvC,IAAI,CAAC,IAAI,GACT,EAAK,YAAY,CAAG,IAAI,CAAC,oBAAoB,GAC7C,EAAK,KAAK,CAAG,EAAE,CACf,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GACjB,IAAI,CAAC,UAAU,CAAC,GAOhB,IAAK,IADD,EACK,EAAa,CAAA,EAAO,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EACrD,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,CAAE,CAC7D,IAAI,EAAS,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CAClC,GAAO,IAAI,CAAC,UAAU,CAAC,EAAK,cAChC,EAAK,KAAK,CAAC,IAAI,CAAC,EAAM,IAAI,CAAC,SAAS,IACpC,EAAI,UAAU,CAAG,EAAE,CACnB,IAAI,CAAC,IAAI,GACL,EACF,EAAI,IAAI,CAAG,IAAI,CAAC,eAAe,IAE3B,GAAc,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAE,4BAC3D,EAAa,CAAA,EACb,EAAI,IAAI,CAAG,MAEb,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,CACzB,MACO,GAAO,IAAI,CAAC,UAAU,GAC3B,EAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAO5C,OAJA,IAAI,CAAC,SAAS,GACV,GAAO,IAAI,CAAC,UAAU,CAAC,EAAK,cAChC,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,MAAM,CAAC,GAAG,GACR,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAI,EAMtC,OALA,IAAI,CAAC,IAAI,GACL,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,KAAK,IAC3D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,+BAChC,EAAK,QAAQ,CAAG,IAAI,CAAC,eAAe,GACpC,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,iBAC/B,EAIA,IAAI,EAAQ,EAAE,AAEd,CAAA,EAAK,iBAAiB,CAAG,SAAS,CAAI,EAIpC,GAHA,IAAI,CAAC,IAAI,GACT,EAAK,KAAK,CAAG,IAAI,CAAC,UAAU,GAC5B,EAAK,OAAO,CAAG,KACX,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAAE,CAC9B,IAAI,EAAS,IAAI,CAAC,SAAS,GAE3B,GADA,IAAI,CAAC,IAAI,GACL,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,EAAG,CAC1B,EAAO,KAAK,CAAG,IAAI,CAAC,gBAAgB,GACpC,IAAI,EAAS,AAAsB,eAAtB,EAAO,KAAK,CAAC,IAAI,CAC9B,IAAI,CAAC,UAAU,CAAC,EApnBG,GAonB2B,GAC9C,IAAI,CAAC,SAAS,CAAC,EAAO,KAAK,CAAE,EAvmBX,EAFL,GA0mBb,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,CAC1B,MACM,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,IAAM,IAAI,CAAC,UAAU,GACpD,EAAO,KAAK,CAAG,KACf,IAAI,CAAC,UAAU,CAAC,EAElB,CAAA,EAAO,IAAI,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAC9B,IAAI,CAAC,SAAS,GACd,EAAK,OAAO,CAAG,IAAI,CAAC,UAAU,CAAC,EAAQ,cACzC,CAIA,OAHA,EAAK,SAAS,CAAG,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAAI,IAAI,CAAC,UAAU,GAAK,KAC3D,EAAK,OAAO,EAAK,EAAK,SAAS,EAChC,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,mCACpB,IAAI,CAAC,UAAU,CAAC,EAAM,eAC/B,EAEA,EAAK,iBAAiB,CAAG,SAAS,CAAI,CAAE,CAAI,EAI1C,OAHA,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,QAAQ,CAAC,EAAM,CAAA,EAAO,GAC3B,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,sBAC/B,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAI,EAMtC,OALA,IAAI,CAAC,IAAI,GACT,EAAK,IAAI,CAAG,IAAI,CAAC,oBAAoB,GACrC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GACjB,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,SAChC,IAAI,CAAC,MAAM,CAAC,GAAG,GACR,IAAI,CAAC,UAAU,CAAC,EAAM,iBAC/B,EAEA,EAAK,kBAAkB,CAAG,SAAS,CAAI,EAKrC,OAJI,IAAI,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,yBAC1C,IAAI,CAAC,IAAI,GACT,EAAK,MAAM,CAAG,IAAI,CAAC,oBAAoB,GACvC,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,QACzB,IAAI,CAAC,UAAU,CAAC,EAAM,gBAC/B,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAI,EAEtC,OADA,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,iBAC/B,EAEA,EAAK,qBAAqB,CAAG,SAAS,CAAI,CAAE,CAAS,CAAE,CAAI,CAAE,CAAO,EAClE,IAAK,IAAI,EAAM,EAAG,EAAO,IAAI,CAAC,MAAM,CAAE,EAAM,EAAK,MAAM,CAAE,GAAO,EAI1D,AAFQ,CAAI,CAAC,EAAI,CAEX,IAAI,GAAK,GACf,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,UAAY,EAAY,yBAGrD,IAAK,IADD,EAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAG,OAAS,IAAI,CAAC,IAAI,GAAK,EAAM,OAAO,CAAG,SAAW,KACvE,EAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAG,EAAG,GAAK,EAAG,IAAK,CAChD,IAAI,EAAU,IAAI,CAAC,MAAM,CAAC,EAAE,CAC5B,GAAI,EAAQ,cAAc,GAAK,EAAK,KAAK,CAEvC,EAAQ,cAAc,CAAG,IAAI,CAAC,KAAK,CACnC,EAAQ,IAAI,CAAG,OACR,KACX,CAKA,OAJA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAM,EAAW,KAAM,EAAM,eAAgB,IAAI,CAAC,KAAK,AAAA,GACzE,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,EAAU,AAA6B,KAA7B,EAAQ,OAAO,CAAC,SAAkB,EAAU,QAAU,EAAU,SAC1G,IAAI,CAAC,MAAM,CAAC,GAAG,GACf,EAAK,KAAK,CAAG,EACN,IAAI,CAAC,UAAU,CAAC,EAAM,mBAC/B,EAEA,EAAK,wBAAwB,CAAG,SAAS,CAAI,CAAE,CAAI,EAGjD,OAFA,EAAK,UAAU,CAAG,EAClB,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,sBAC/B,EAMA,EAAK,UAAU,CAAG,SAAS,CAAqB,CAAE,CAAI,CAAE,CAAU,EAOhE,IAN+B,KAAK,IAA/B,GAAmC,CAAA,EAAwB,CAAA,CAAhE,EACc,KAAK,IAAd,GAAkB,CAAA,EAAO,IAAI,CAAC,SAAS,EAA5C,EAEA,EAAK,IAAI,CAAG,EAAE,CACd,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACpB,GAAyB,IAAI,CAAC,UAAU,CAAC,GACtC,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAE,CACjC,IAAI,EAAO,IAAI,CAAC,cAAc,CAAC,MAC/B,EAAK,IAAI,CAAC,IAAI,CAAC,EACjB,CAIA,OAHI,GAAc,CAAA,IAAI,CAAC,MAAM,CAAG,CAAA,CAAhC,EACA,IAAI,CAAC,IAAI,GACL,GAAyB,IAAI,CAAC,SAAS,GACpC,IAAI,CAAC,UAAU,CAAC,EAAM,iBAC/B,EAMA,EAAK,QAAQ,CAAG,SAAS,CAAI,CAAE,CAAI,EAUjC,OATA,EAAK,IAAI,CAAG,EACZ,IAAI,CAAC,MAAM,CAAC,EAAM,IAAI,EACtB,EAAK,IAAI,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAG,KAAO,IAAI,CAAC,eAAe,GAClE,IAAI,CAAC,MAAM,CAAC,EAAM,IAAI,EACtB,EAAK,MAAM,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAAG,KAAO,IAAI,CAAC,eAAe,GACtE,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,OAChC,IAAI,CAAC,SAAS,GACd,IAAI,CAAC,MAAM,CAAC,GAAG,GACR,IAAI,CAAC,UAAU,CAAC,EAAM,eAC/B,EAKA,EAAK,UAAU,CAAG,SAAS,CAAI,CAAE,CAAI,EACnC,IAAI,EAAU,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,CA2BrC,OA1BA,IAAI,CAAC,IAAI,GAGP,AAAc,wBAAd,EAAK,IAAI,EACT,AAA6B,MAA7B,EAAK,YAAY,CAAC,EAAE,CAAC,IAAI,EAEvB,CAAA,CAAC,GACD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,GAC3B,IAAI,CAAC,MAAM,EACX,AAAc,QAAd,EAAK,IAAI,EACT,AAAiC,eAAjC,EAAK,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,AAAK,EAGnC,IAAI,CAAC,KAAK,CACR,EAAK,KAAK,CACT,AAAC,CAAA,EAAU,SAAW,QAAA,EAAY,0DAEd,sBAAd,EAAK,IAAI,EAClB,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,sCAEzB,EAAK,IAAI,CAAG,EACZ,EAAK,KAAK,CAAG,EAAU,IAAI,CAAC,eAAe,GAAK,IAAI,CAAC,gBAAgB,GACrE,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,IAAI,CAAG,IAAI,CAAC,cAAc,CAAC,OAChC,IAAI,CAAC,SAAS,GACd,IAAI,CAAC,MAAM,CAAC,GAAG,GACR,IAAI,CAAC,UAAU,CAAC,EAAM,EAAU,iBAAmB,iBAC5D,EAIA,EAAK,QAAQ,CAAG,SAAS,CAAI,CAAE,CAAK,CAAE,CAAI,EAGxC,IAFA,EAAK,YAAY,CAAG,EAAE,CACtB,EAAK,IAAI,CAAG,IACH,CACP,IAAI,EAAO,IAAI,CAAC,SAAS,GAYzB,GAXA,IAAI,CAAC,UAAU,CAAC,EAAM,GAClB,IAAI,CAAC,GAAG,CAAC,EAAM,EAAE,EACnB,EAAK,IAAI,CAAG,IAAI,CAAC,gBAAgB,CAAC,GACzB,AAAS,UAAT,GAAsB,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAK,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,YAAY,CAAC,MAErG,AAAiB,eAAjB,EAAK,EAAE,CAAC,IAAI,EAAuB,GAAU,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAI,IAAI,CAAC,YAAY,CAAC,KAAA,EAGnG,EAAK,IAAI,CAAG,KAFZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,4DAF5B,IAAI,CAAC,UAAU,GAMjB,EAAK,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAM,uBACzC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAAK,KAChC,CACA,OAAO,CACT,EAEA,EAAK,UAAU,CAAG,SAAS,CAAI,CAAE,CAAI,EACnC,EAAK,EAAE,CAAG,IAAI,CAAC,gBAAgB,GAC/B,IAAI,CAAC,SAAS,CAAC,EAAK,EAAE,CAAE,AAAS,QAAT,EAvxBX,EACI,EAsxBiD,CAAA,EACpE,EAEA,IAAI,EAAiB,EAAG,EAAyB,CAMjD,CAAA,EAAK,aAAa,CAAG,SAAS,CAAI,CAAE,CAAS,CAAE,CAAmB,CAAE,CAAO,EACzE,IAAI,CAAC,YAAY,CAAC,GACd,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAC,CAAA,IACjE,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAK,EAAY,GACzC,IAAI,CAAC,UAAU,GACnB,EAAK,SAAS,CAAG,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,GAElC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC5B,CAAA,EAAK,KAAK,CAAG,CAAC,CAAC,CADnB,EAGI,EAAY,IACd,EAAK,EAAE,CAAI,AAjBwD,EAiBxD,GAAiC,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAG,KAAO,IAAI,CAAC,UAAU,GACzF,EAAK,EAAE,EAAI,CAAE,CAAA,EAAY,CAAA,GAKzB,IAAI,CAAC,SAAS,CAAC,EAAK,EAAE,CAAG,IAAI,CAAC,MAAM,EAAI,EAAK,SAAS,EAAI,EAAK,KAAK,CAAI,IAAI,CAAC,mBAAmB,CAjzBzF,EACI,EACC,IAkzBlB,IAAI,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAmB,IAAI,CAAC,aAAa,CAenG,OAdA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,UAAU,CAAC,EAAc,EAAK,KAAK,CAAE,EAAK,SAAS,GAElD,EAAY,GACd,CAAA,EAAK,EAAE,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAG,IAAI,CAAC,UAAU,GAAK,IAD7D,EAGA,IAAI,CAAC,mBAAmB,CAAC,GACzB,IAAI,CAAC,iBAAiB,CAAC,EAAM,EAAqB,CAAA,GAElD,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACd,IAAI,CAAC,UAAU,CAAC,EAAO,EAAY,EAAkB,sBAAwB,qBACtF,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAI,EACtC,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,MAAM,CAAG,IAAI,CAAC,gBAAgB,CAAC,EAAM,MAAM,CAAE,CAAA,EAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GACrF,IAAI,CAAC,8BAA8B,EACrC,EAKA,EAAK,UAAU,CAAG,SAAS,CAAI,CAAE,CAAW,EAC1C,IAAI,CAAC,IAAI,GAIT,IAAI,EAAY,IAAI,CAAC,MAAM,AAC3B,CAAA,IAAI,CAAC,MAAM,CAAG,CAAA,EAEd,IAAI,CAAC,YAAY,CAAC,EAAM,GACxB,IAAI,CAAC,eAAe,CAAC,GACrB,IAAI,EAAY,IAAI,CAAC,SAAS,GAC1B,EAAiB,CAAA,EAGrB,IAFA,EAAU,IAAI,CAAG,EAAE,CACnB,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACjB,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAE,CACjC,IAAI,EAAU,IAAI,CAAC,iBAAiB,CAAC,AAAoB,OAApB,EAAK,UAAU,EAChD,IACF,EAAU,IAAI,CAAC,IAAI,CAAC,GACC,qBAAjB,EAAQ,IAAI,EAA2B,AAAiB,gBAAjB,EAAQ,IAAI,GACjD,GAAkB,IAAI,CAAC,KAAK,CAAC,EAAQ,KAAK,CAAE,2CAChD,EAAiB,CAAA,GAGvB,CAIA,OAHA,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,IAAI,GACT,EAAK,IAAI,CAAG,IAAI,CAAC,UAAU,CAAC,EAAW,aAChC,IAAI,CAAC,UAAU,CAAC,EAAM,EAAc,mBAAqB,kBAClE,EAEA,EAAK,iBAAiB,CAAG,SAAS,CAAsB,EACtD,IAAI,EAAS,IAAI,CAEjB,GAAI,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EAAK,OAAO,KAEnC,IAAI,EAAS,IAAI,CAAC,SAAS,GACvB,EAAgB,SAAU,CAAC,CAAE,CAAW,EACrB,KAAK,IAArB,GAAyB,CAAA,EAAc,CAAA,CAA5C,EAEA,IAAI,EAAQ,EAAO,KAAK,CAAE,EAAW,EAAO,QAAQ,OACpD,EAAK,EAAO,aAAa,CAAC,MACtB,CAAA,EAAO,IAAI,GAAK,EAAM,MAAM,EAAK,AAAC,GAAgB,EAAO,kBAAkB,EAAC,IAC5E,EAAO,GAAG,EAAI,EAAO,UAAU,GACnC,EAAO,QAAQ,CAAG,CAAA,EAClB,EAAO,GAAG,CAAG,EAAO,WAAW,CAAC,EAAO,GACvC,EAAO,GAAG,CAAC,IAAI,CAAG,EAClB,EAAO,UAAU,CAAC,EAAO,GAAG,CAAE,cACvB,CAAA,GACT,CAEA,CAAA,EAAO,IAAI,CAAG,SACd,EAAO,MAAM,CAAG,EAAc,UAC9B,IAAI,EAAc,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EACjC,EAAU,CAAA,CACV,EAAC,IACC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,EAAc,QAAS,CAAA,IAC1D,EAAU,CAAA,EACV,EAAc,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,GACzD,EAAc,OACvB,EAAO,IAAI,CAAG,MACL,EAAc,QACvB,CAAA,EAAO,IAAI,CAAG,KADT,GAIJ,EAAO,GAAG,EAAI,IAAI,CAAC,iBAAiB,CAAC,GAC1C,IAAI,EAAM,EAAO,GAAG,CAChB,EAAoB,CAAA,EAkBxB,OAjBI,AAAC,EAAO,QAAQ,EAAK,EAAO,MAAM,EAAK,CAAA,AAAa,eAAb,EAAI,IAAI,EAAqB,AAAa,gBAAb,EAAI,IAAI,AAAK,GACjF,CAAA,AAAa,YAAb,EAAI,IAAI,EAAkB,AAAc,gBAAd,EAAI,KAAK,AAAK,EAMjC,EAAO,MAAM,EAAI,AAAa,eAAb,EAAI,IAAI,EAAqB,AAAa,cAAb,EAAI,IAAI,EAC/D,IAAI,CAAC,KAAK,CAAC,EAAI,KAAK,CAAE,2DANF,WAAhB,EAAO,IAAI,EAAiB,IAAI,CAAC,KAAK,CAAC,EAAI,KAAK,CAAE,2CAClD,GAAe,IAAI,CAAC,KAAK,CAAC,EAAI,KAAK,CAAE,oCACrC,GAAW,IAAI,CAAC,KAAK,CAAC,EAAI,KAAK,CAAE,wCACrC,EAAO,IAAI,CAAG,cACd,EAAoB,GAItB,IAAI,CAAC,gBAAgB,CAAC,EAAQ,EAAa,EAAS,GAChC,QAAhB,EAAO,IAAI,EAAc,AAA+B,IAA/B,EAAO,KAAK,CAAC,MAAM,CAAC,MAAM,EACnD,IAAI,CAAC,gBAAgB,CAAC,EAAO,KAAK,CAAC,KAAK,CAAE,gCAC1B,QAAhB,EAAO,IAAI,EAAc,AAA+B,IAA/B,EAAO,KAAK,CAAC,MAAM,CAAC,MAAM,EACnD,IAAI,CAAC,gBAAgB,CAAC,EAAO,KAAK,CAAC,KAAK,CAAE,wCAC1B,QAAhB,EAAO,IAAI,EAAc,AAAgC,gBAAhC,EAAO,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EACpD,IAAI,CAAC,gBAAgB,CAAC,EAAO,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAE,iCACjD,CACT,EAEA,EAAK,gBAAgB,CAAG,SAAS,CAAM,CAAE,CAAW,CAAE,CAAO,CAAE,CAAiB,EAE9E,OADA,EAAO,KAAK,CAAG,IAAI,CAAC,WAAW,CAAC,EAAa,EAAS,GAC/C,IAAI,CAAC,UAAU,CAAC,EAAQ,mBACjC,EAEA,EAAK,YAAY,CAAG,SAAS,CAAI,CAAE,CAAW,EACxC,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAC1B,EAAK,EAAE,CAAG,IAAI,CAAC,UAAU,GACrB,GACA,IAAI,CAAC,SAAS,CAAC,EAAK,EAAE,CA96BX,EA86B2B,CAAA,KAEtB,CAAA,IAAhB,GACA,IAAI,CAAC,UAAU,GACnB,EAAK,EAAE,CAAG,KAEd,EAEA,EAAK,eAAe,CAAG,SAAS,CAAI,EAClC,EAAK,UAAU,CAAG,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAAI,IAAI,CAAC,mBAAmB,GAAK,IAC5E,EAIA,EAAK,WAAW,CAAG,SAAS,CAAI,CAAE,CAAO,EAGvC,GAFA,IAAI,CAAC,IAAI,GAEL,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EAarB,OAZI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,KAC1B,IAAI,CAAC,aAAa,CAAC,OACrB,EAAK,QAAQ,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAChC,IAAI,CAAC,WAAW,CAAC,EAAS,EAAK,QAAQ,CAAC,IAAI,CAAE,IAAI,CAAC,YAAY,GAE/D,EAAK,QAAQ,CAAG,MAGpB,IAAI,CAAC,gBAAgB,CAAC,QAClB,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,UAAU,GACjD,EAAK,MAAM,CAAG,IAAI,CAAC,aAAa,GAChC,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,wBAE/B,GAAI,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAAG,CAG5B,GAFA,IAAI,CAAC,WAAW,CAAC,EAAS,UAAW,IAAI,CAAC,YAAY,EAElD,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,EAAK,CAAA,EAAU,IAAI,CAAC,eAAe,EAAA,EAAK,CACvE,IAFE,EAEE,EAAQ,IAAI,CAAC,SAAS,GAC1B,IAAI,CAAC,IAAI,GACL,GAAW,IAAI,CAAC,IAAI,GACxB,EAAK,WAAW,CAAG,IAAI,CAAC,aAAa,CAAC,EAAO,AA5LoB,EA4LpB,EAAmC,CAAA,EAAO,EACzF,MAAO,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAAE,CACrC,IAAI,EAAQ,IAAI,CAAC,SAAS,EAC1B,CAAA,EAAK,WAAW,CAAG,IAAI,CAAC,UAAU,CAAC,EAAO,aAC5C,MACE,EAAK,WAAW,CAAG,IAAI,CAAC,gBAAgB,GACxC,IAAI,CAAC,SAAS,GAEhB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAM,2BAC/B,CAEA,GAAI,IAAI,CAAC,0BAA0B,GACjC,EAAK,WAAW,CAAG,IAAI,CAAC,cAAc,CAAC,MACnC,AAA0B,wBAA1B,EAAK,WAAW,CAAC,IAAI,CACrB,IAAI,CAAC,mBAAmB,CAAC,EAAS,EAAK,WAAW,CAAC,YAAY,EAE/D,IAAI,CAAC,WAAW,CAAC,EAAS,EAAK,WAAW,CAAC,EAAE,CAAC,IAAI,CAAE,EAAK,WAAW,CAAC,EAAE,CAAC,KAAK,EACjF,EAAK,UAAU,CAAG,EAAE,CACpB,EAAK,MAAM,CAAG,SACT,CAGL,GAFA,EAAK,WAAW,CAAG,KACnB,EAAK,UAAU,CAAG,IAAI,CAAC,qBAAqB,CAAC,GACzC,IAAI,CAAC,aAAa,CAAC,QACjB,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,UAAU,GACjD,EAAK,MAAM,CAAG,IAAI,CAAC,aAAa,OAC3B,CACL,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CAE/D,IAAI,EAAO,CAAI,CAAC,EAAE,CAElB,IAAI,CAAC,eAAe,CAAC,EAAK,KAAK,EAE/B,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAClC,CAEA,EAAK,MAAM,CAAG,IAChB,CACA,IAAI,CAAC,SAAS,EAChB,CACA,OAAO,IAAI,CAAC,UAAU,CAAC,EAAM,yBAC/B,EAEA,EAAK,WAAW,CAAG,SAAS,CAAO,CAAE,CAAI,CAAE,CAAG,EACvC,IACD,EAAI,EAAS,IACb,IAAI,CAAC,gBAAgB,CAAC,EAAK,qBAAuB,EAAO,KAC7D,CAAO,CAAC,EAAK,CAAG,CAAA,EAClB,EAEA,EAAK,kBAAkB,CAAG,SAAS,CAAO,CAAE,CAAG,EAC7C,IAAI,EAAO,EAAI,IAAI,CACnB,GAAI,AAAS,eAAT,EACA,IAAI,CAAC,WAAW,CAAC,EAAS,EAAI,IAAI,CAAE,EAAI,KAAK,OAC5C,GAAI,AAAS,kBAAT,EACL,IAAK,IAAI,EAAI,EAAG,EAAO,EAAI,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAC7D,CACE,IAAI,EAAO,CAAI,CAAC,EAAE,CAElB,IAAI,CAAC,kBAAkB,CAAC,EAAS,EACnC,MACC,GAAI,AAAS,iBAAT,EACL,IAAK,IAAI,EAAM,EAAG,EAAS,EAAI,QAAQ,CAAE,EAAM,EAAO,MAAM,CAAE,GAAO,EAAG,CACxE,IAAI,EAAM,CAAM,CAAC,EAAI,CAEf,GAAO,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAChD,KACO,AAAS,aAAT,EACL,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAAI,KAAK,EACrC,AAAS,sBAAT,EACL,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAAI,IAAI,EACpC,AAAS,gBAAT,EACL,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAAI,QAAQ,EAC/B,4BAAT,GACL,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAAI,UAAU,CACrD,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAO,CAAE,CAAK,EAChD,GAAK,EACL,IAAK,IAAI,EAAI,EAAiB,EAAI,AAAX,EAAgB,MAAM,CAAE,GAAK,EAClD,CACA,IAAI,EAAO,AAFU,CAEN,CAAC,EAAE,CAElB,IAAI,CAAC,kBAAkB,CAAC,EAAS,EAAK,EAAE,CAC1C,CACF,EAEA,EAAK,0BAA0B,CAAG,WAChC,MAAO,AAAsB,QAAtB,IAAI,CAAC,IAAI,CAAC,OAAO,EACtB,AAAsB,UAAtB,IAAI,CAAC,IAAI,CAAC,OAAO,EACjB,AAAsB,UAAtB,IAAI,CAAC,IAAI,CAAC,OAAO,EACjB,AAAsB,aAAtB,IAAI,CAAC,IAAI,CAAC,OAAO,EACjB,IAAI,CAAC,KAAK,IACV,IAAI,CAAC,eAAe,EACxB,EAIA,EAAK,qBAAqB,CAAG,SAAS,CAAO,EAC3C,IAAI,EAAQ,EAAE,CAAE,EAAQ,CAAA,EAGxB,IADA,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACjB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,GAAG,CAC9B,GAAK,EAGI,EAAQ,CAAA,OADf,GADA,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EACnB,IAAI,CAAC,kBAAkB,CAAC,EAAM,MAAM,EAAK,MAG/C,IAAI,EAAO,IAAI,CAAC,SAAS,EACzB,CAAA,EAAK,KAAK,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAC7B,EAAK,QAAQ,CAAG,IAAI,CAAC,aAAa,CAAC,MAAQ,IAAI,CAAC,UAAU,CAAC,CAAA,GAAQ,EAAK,KAAK,CAC7E,IAAI,CAAC,WAAW,CAAC,EAAS,EAAK,QAAQ,CAAC,IAAI,CAAE,EAAK,QAAQ,CAAC,KAAK,EACjE,EAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAM,mBACnC,CACA,OAAO,CACT,EAIA,EAAK,WAAW,CAAG,SAAS,CAAI,EAY9B,OAXA,IAAI,CAAC,IAAI,GAEL,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAC5B,EAAK,UAAU,CAAG,EAClB,EAAK,MAAM,CAAG,IAAI,CAAC,aAAa,KAEhC,EAAK,UAAU,CAAG,IAAI,CAAC,qBAAqB,GAC5C,IAAI,CAAC,gBAAgB,CAAC,QACtB,EAAK,MAAM,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAAG,IAAI,CAAC,aAAa,GAAK,IAAI,CAAC,UAAU,IAEnF,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,UAAU,CAAC,EAAM,oBAC/B,EAIA,EAAK,qBAAqB,CAAG,WAC3B,IAAI,EAAQ,EAAE,CAAE,EAAQ,CAAA,EACxB,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAE,CAE5B,IAAI,EAAO,IAAI,CAAC,SAAS,GAIzB,GAHA,EAAK,KAAK,CAAG,IAAI,CAAC,UAAU,GAC5B,IAAI,CAAC,SAAS,CAAC,EAAK,KAAK,CAlmCV,GAmmCf,EAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAM,2BAC7B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAAK,OAAO,CACvC,CACA,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAAE,CAC5B,IAAI,EAAS,IAAI,CAAC,SAAS,GAM3B,OALA,IAAI,CAAC,IAAI,GACT,IAAI,CAAC,gBAAgB,CAAC,MACtB,EAAO,KAAK,CAAG,IAAI,CAAC,UAAU,GAC9B,IAAI,CAAC,SAAS,CAAC,EAAO,KAAK,CA3mCZ,GA4mCf,EAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAQ,6BAC5B,CACT,CAEA,IADA,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACjB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,GAAG,CAC9B,GAAK,EAGI,EAAQ,CAAA,OADf,GADA,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EACnB,IAAI,CAAC,kBAAkB,CAAC,EAAM,MAAM,EAAK,MAG/C,IAAI,EAAS,IAAI,CAAC,SAAS,EAC3B,CAAA,EAAO,QAAQ,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAC9B,IAAI,CAAC,aAAa,CAAC,MACrB,EAAO,KAAK,CAAG,IAAI,CAAC,UAAU,IAE9B,IAAI,CAAC,eAAe,CAAC,EAAO,QAAQ,EACpC,EAAO,KAAK,CAAG,EAAO,QAAQ,EAEhC,IAAI,CAAC,SAAS,CAAC,EAAO,KAAK,CA9nCZ,GA+nCf,EAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAQ,mBACrC,CACA,OAAO,CACT,EAGA,EAAK,sBAAsB,CAAG,SAAS,CAAU,EAC/C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,MAAM,EAAI,IAAI,CAAC,oBAAoB,CAAC,CAAU,CAAC,EAAE,EAAG,EAAE,EACnF,CAAU,CAAC,EAAE,CAAC,SAAS,CAAG,CAAU,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAG,GAEpE,EACA,EAAK,oBAAoB,CAAG,SAAS,CAAS,EAC5C,MACE,AAAmB,wBAAnB,EAAU,IAAI,EACd,AAA8B,YAA9B,EAAU,UAAU,CAAC,IAAI,EACzB,AAAsC,UAAtC,OAAO,EAAU,UAAU,CAAC,KAAK,EAEhC,CAAA,AAAgC,MAAhC,IAAI,CAAC,KAAK,CAAC,EAAU,KAAK,CAAC,EAAa,AAAgC,MAAhC,IAAI,CAAC,KAAK,CAAC,EAAU,KAAK,CAAC,AAAK,CAE7E,EAEA,IAAI,EAAO,EAAO,SAAS,AAK3B,CAAA,EAAK,YAAY,CAAG,SAAS,CAAI,CAAE,CAAS,CAAE,CAAsB,EAClE,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,EACnC,OAAQ,EAAK,IAAI,EACjB,IAAK,aACC,IAAI,CAAC,OAAO,EAAI,AAAc,UAAd,EAAK,IAAI,EACzB,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,6DAC3B,KAEF,KAAK,gBACL,IAAK,eACL,IAAK,cACH,KAEF,KAAK,mBACH,EAAK,IAAI,CAAG,gBACR,GAA0B,IAAI,CAAC,kBAAkB,CAAC,EAAwB,CAAA,GAC9E,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CAC/D,IAAI,EAAO,CAAI,CAAC,EAAE,CAEpB,IAAI,CAAC,YAAY,CAAC,EAAM,GAON,gBAAd,EAAK,IAAI,EACR,CAAA,AAAuB,iBAAvB,EAAK,QAAQ,CAAC,IAAI,EAAuB,AAAuB,kBAAvB,EAAK,QAAQ,CAAC,IAAI,AAAK,GAEjE,IAAI,CAAC,KAAK,CAAC,EAAK,QAAQ,CAAC,KAAK,CAAE,mBAEpC,CACA,KAEF,KAAK,WAEe,SAAd,EAAK,IAAI,EAAe,IAAI,CAAC,KAAK,CAAC,EAAK,GAAG,CAAC,KAAK,CAAE,iDACvD,IAAI,CAAC,YAAY,CAAC,EAAK,KAAK,CAAE,GAC9B,KAEF,KAAK,kBACH,EAAK,IAAI,CAAG,eACR,GAA0B,IAAI,CAAC,kBAAkB,CAAC,EAAwB,CAAA,GAC9E,IAAI,CAAC,gBAAgB,CAAC,EAAK,QAAQ,CAAE,GACrC,KAEF,KAAK,gBACH,EAAK,IAAI,CAAG,cACZ,IAAI,CAAC,YAAY,CAAC,EAAK,QAAQ,CAAE,GACN,sBAAvB,EAAK,QAAQ,CAAC,IAAI,EAClB,IAAI,CAAC,KAAK,CAAC,EAAK,QAAQ,CAAC,KAAK,CAAE,6CACpC,KAEF,KAAK,uBACmB,MAAlB,EAAK,QAAQ,EAAY,IAAI,CAAC,KAAK,CAAC,EAAK,IAAI,CAAC,GAAG,CAAE,+DACvD,EAAK,IAAI,CAAG,oBACZ,OAAO,EAAK,QAAQ,CACpB,IAAI,CAAC,YAAY,CAAC,EAAK,IAAI,CAAE,EAG/B,KAAK,oBACH,KAEF,KAAK,0BACH,IAAI,CAAC,YAAY,CAAC,EAAK,UAAU,CAAE,EAAW,GAC9C,KAEF,KAAK,kBACH,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,qDAClC,KAEF,KAAK,mBACH,GAAI,CAAC,EAAa,KAEpB,SACE,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,sBACzB,MACS,GAA0B,IAAI,CAAC,kBAAkB,CAAC,EAAwB,CAAA,GACrF,OAAO,CACT,EAIA,EAAK,gBAAgB,CAAG,SAAS,CAAQ,CAAE,CAAS,EAElD,IAAK,IADD,EAAM,EAAS,MAAM,CAChB,EAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,IAAI,EAAM,CAAQ,CAAC,EAAE,CACjB,GAAO,IAAI,CAAC,YAAY,CAAC,EAAK,EACpC,CACA,GAAI,EAAK,CACP,IAAI,EAAO,CAAQ,CAAC,EAAM,EAAE,AACK,CAAA,IAA7B,IAAI,CAAC,OAAO,CAAC,WAAW,EAAU,GAAa,GAAQ,AAAc,gBAAd,EAAK,IAAI,EAAsB,AAAuB,eAAvB,EAAK,QAAQ,CAAC,IAAI,EACxG,IAAI,CAAC,UAAU,CAAC,EAAK,QAAQ,CAAC,KAAK,CACzC,CACA,OAAO,CACT,EAIA,EAAK,WAAW,CAAG,SAAS,CAAsB,EAChD,IAAI,EAAO,IAAI,CAAC,SAAS,GAGzB,OAFA,IAAI,CAAC,IAAI,GACT,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,CAAC,CAAA,EAAO,GACtC,IAAI,CAAC,UAAU,CAAC,EAAM,gBAC/B,EAEA,EAAK,gBAAgB,CAAG,WACtB,IAAI,EAAO,IAAI,CAAC,SAAS,GASzB,OARA,IAAI,CAAC,IAAI,GAGwB,IAA7B,IAAI,CAAC,OAAO,CAAC,WAAW,EAAU,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAC1D,IAAI,CAAC,UAAU,GAEnB,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,GAE9B,IAAI,CAAC,UAAU,CAAC,EAAM,cAC/B,EAIA,EAAK,gBAAgB,CAAG,WACtB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAC9B,OAAQ,IAAI,CAAC,IAAI,EACjB,KAAK,EAAM,QAAQ,CACjB,IAAI,EAAO,IAAI,CAAC,SAAS,GAGzB,OAFA,IAAI,CAAC,IAAI,GACT,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,CAAC,EAAM,QAAQ,CAAE,CAAA,EAAM,CAAA,GACrD,IAAI,CAAC,UAAU,CAAC,EAAM,eAE/B,MAAK,EAAM,MAAM,CACf,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAA,EACvB,CAEF,OAAO,IAAI,CAAC,UAAU,EACxB,EAEA,EAAK,gBAAgB,CAAG,SAAS,CAAK,CAAE,CAAU,CAAE,CAAkB,EAEpE,IADA,IAAI,EAAO,EAAE,CAAE,EAAQ,CAAA,EAChB,CAAC,IAAI,CAAC,GAAG,CAAC,IAGf,GAFI,EAAS,EAAQ,CAAA,EACd,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EAC1B,GAAc,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CACzC,EAAK,IAAI,CAAC,WACL,GAAI,GAAsB,IAAI,CAAC,kBAAkB,CAAC,GACvD,WACK,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,CAAE,CACvC,IAAI,EAAO,IAAI,CAAC,gBAAgB,GAChC,IAAI,CAAC,oBAAoB,CAAC,GAC1B,EAAK,IAAI,CAAC,GACN,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,iDACxD,IAAI,CAAC,MAAM,CAAC,GACZ,KACF,KAAO,CACL,IAAI,EAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,QAAQ,EAC3D,IAAI,CAAC,oBAAoB,CAAC,GAC1B,EAAK,IAAI,CAAC,EACZ,CAEF,OAAO,CACT,EAEA,EAAK,oBAAoB,CAAG,SAAS,CAAK,EACxC,OAAO,CACT,EAIA,EAAK,iBAAiB,CAAG,SAAS,CAAQ,CAAE,CAAQ,CAAE,CAAI,EAExD,GADA,EAAO,GAAQ,IAAI,CAAC,gBAAgB,GAChC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,GAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,EAAE,EAAK,OAAO,EAClE,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAGtC,OAFA,EAAK,IAAI,CAAG,EACZ,EAAK,KAAK,CAAG,IAAI,CAAC,gBAAgB,GAC3B,IAAI,CAAC,UAAU,CAAC,EAAM,oBAC/B,EASA,EAAK,SAAS,CAAG,SAAS,CAAI,CAAE,CAAW,CAAE,CAAY,EAGvD,OAFqB,KAAK,IAArB,GAAyB,CAAA,EAp1ChB,CAo1Cd,EAEQ,EAAK,IAAI,EACjB,IAAK,aAr1CY,IAs1CX,GAAgC,AAAc,QAAd,EAAK,IAAI,EACzC,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,+CAClC,IAAI,CAAC,MAAM,EAAI,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAK,IAAI,GAC1D,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,AAAC,CAAA,EAAc,WAAa,eAAA,EAAmB,EAAK,IAAI,CAAG,mBAC7F,IACE,EAAI,EAAc,EAAK,IAAI,GAC3B,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,uBACtC,CAAY,CAAC,EAAK,IAAI,CAAC,CAAG,CAAA,GA/1ChB,IAi2CR,GAA6B,AA51ClB,IA41CkB,GAAgC,IAAI,CAAC,WAAW,CAAC,EAAK,IAAI,CAAE,EAAa,EAAK,KAAK,EACpH,KAEF,KAAK,kBACH,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,qDAClC,KAEF,KAAK,mBACC,GAAe,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,6BACrD,KAEF,KAAK,gBACH,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAC5D,CACF,IAAI,EAAO,CAAI,CAAC,EAAE,CAElB,IAAI,CAAC,SAAS,CAAC,EAAM,EAAa,EACpC,CACE,KAEF,KAAK,WAEH,IAAI,CAAC,SAAS,CAAC,EAAK,KAAK,CAAE,EAAa,GACxC,KAEF,KAAK,eACH,IAAK,IAAI,EAAM,EAAG,EAAS,EAAK,QAAQ,CAAE,EAAM,EAAO,MAAM,CAAE,GAAO,EAAG,CACvE,IAAI,EAAO,CAAM,CAAC,EAAI,CAEpB,GAAQ,IAAI,CAAC,SAAS,CAAC,EAAM,EAAa,EAC9C,CACA,KAEF,KAAK,oBACH,IAAI,CAAC,SAAS,CAAC,EAAK,IAAI,CAAE,EAAa,GACvC,KAEF,KAAK,cACH,IAAI,CAAC,SAAS,CAAC,EAAK,QAAQ,CAAE,EAAa,GAC3C,KAEF,KAAK,0BACH,IAAI,CAAC,SAAS,CAAC,EAAK,UAAU,CAAE,EAAa,GAC7C,KAEF,SACE,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,AAAC,CAAA,EAAc,UAAY,cAAA,EAAkB,UACtE,CACF,EAIA,IAAI,EAAO,EAAO,SAAS,AAO3B,CAAA,EAAK,cAAc,CAAG,SAAS,CAAI,CAAE,CAAQ,CAAE,CAAsB,EACnE,GAAI,CAAA,CAAA,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,CAAA,GAAK,AAAc,kBAAd,EAAK,IAAI,AAAK,GAE/C,CAAA,CAAA,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,CAAA,GAAM,CAAA,EAAK,QAAQ,GAAI,EAAK,MAAM,GAAI,EAAK,SAAQ,GAEnF,IACI,EADA,EAAM,EAAK,GAAG,CAElB,OAAQ,EAAI,IAAI,EAChB,IAAK,aAAc,EAAO,EAAI,IAAI,CAAE,KACpC,KAAK,UAAW,EAAO,OAAO,EAAI,KAAK,EAAG,KAC1C,SAAS,MACT,CACA,IAAI,EAAO,EAAK,IAAI,CACpB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAG,CACpB,cAAT,GAAwB,AAAS,SAAT,IACtB,EAAS,KAAK,GACZ,EACE,EAAuB,WAAW,CAAG,GACrC,CAAA,EAAuB,WAAW,CAAG,EAAI,KAAK,AAAL,EAEtC,IAAI,CAAC,gBAAgB,CAAC,EAAI,KAAK,CAAE,uCAE5C,EAAS,KAAK,CAAG,CAAA,GAEnB,MACF,CAEA,IAAI,EAAQ,CAAQ,CADpB,EAAO,IAAM,EACa,CACtB,GAEE,AAAS,SAAT,EACa,IAAI,CAAC,MAAM,EAAI,EAAM,IAAI,EAAI,EAAM,GAAG,EAAI,EAAM,GAAG,CAEnD,EAAM,IAAI,EAAI,CAAK,CAAC,EAAK,GAGtC,IAAI,CAAC,gBAAgB,CAAC,EAAI,KAAK,CAAE,4BAErC,EAAQ,CAAQ,CAAC,EAAK,CAAG,CACvB,KAAM,CAAA,EACN,IAAK,CAAA,EACL,IAAK,CAAA,CACP,EAEF,CAAK,CAAC,EAAK,CAAG,CAAA,EAChB,EAiBA,EAAK,eAAe,CAAG,SAAS,CAAI,CAAE,CAAsB,EAC1D,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,gBAAgB,CAAC,EAAM,GACvC,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CAAE,CAC7B,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAEtC,IADA,EAAK,WAAW,CAAG,CAAC,EAAK,CAClB,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,GAAK,EAAK,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAM,IAClF,OAAO,IAAI,CAAC,UAAU,CAAC,EAAM,qBAC/B,CACA,OAAO,CACT,EAKA,EAAK,gBAAgB,CAAG,SAAS,CAAI,CAAE,CAAsB,CAAE,CAAc,EAC3E,GAAI,IAAI,CAAC,YAAY,CAAC,SAAU,CAC9B,GAAI,IAAI,CAAC,WAAW,CAAI,OAAO,IAAI,CAAC,UAAU,CAAC,EAGxC,CAAA,IAAI,CAAC,WAAW,CAAG,CAAA,CAC5B,CAEA,IAAI,EAAyB,CAAA,EAAO,EAAiB,GAAI,EAAmB,GACxE,GACF,EAAiB,EAAuB,mBAAmB,CAC3D,EAAmB,EAAuB,aAAa,CACvD,EAAuB,mBAAmB,CAAG,EAAuB,aAAa,CAAG,KAEpF,EAAyB,IAAI,EAC7B,EAAyB,CAAA,GAG3B,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,AAAJ,GAClD,CAAA,IAAI,CAAC,gBAAgB,CAAG,IAAI,CAAC,KAAK,AAAL,EACjC,IAAI,EAAO,IAAI,CAAC,qBAAqB,CAAC,EAAM,GAE5C,GADI,GAAkB,CAAA,EAAO,EAAe,IAAI,CAAC,IAAI,CAAE,EAAM,EAAU,EAAvE,EACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAE,CACtB,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAWtC,OAVA,EAAK,QAAQ,CAAG,IAAI,CAAC,KAAK,CAC1B,EAAK,IAAI,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,EAAE,CAAG,IAAI,CAAC,YAAY,CAAC,EAAM,CAAA,EAAO,GAA0B,EACzF,GACH,CAAA,EAAuB,mBAAmB,CAAG,EAAuB,aAAa,CAAG,EAAuB,WAAW,CAAG,EAD3H,EAGI,EAAuB,eAAe,EAAI,EAAK,IAAI,CAAC,KAAK,EACzD,CAAA,EAAuB,eAAe,CAAG,EAD7C,EAEA,IAAI,CAAC,SAAS,CAAC,GACf,IAAI,CAAC,IAAI,GACT,EAAK,KAAK,CAAG,IAAI,CAAC,gBAAgB,CAAC,GAC5B,IAAI,CAAC,UAAU,CAAC,EAAM,uBAC/B,QACM,GAA0B,IAAI,CAAC,qBAAqB,CAAC,EAAwB,CAAA,GAE/E,EAAiB,IAAM,CAAA,EAAuB,mBAAmB,CAAG,CAAxE,EACI,EAAmB,IAAM,CAAA,EAAuB,aAAa,CAAG,CAApE,EACO,CACT,EAIA,EAAK,qBAAqB,CAAG,SAAS,CAAI,CAAE,CAAsB,EAChE,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,YAAY,CAAC,EAAM,GACnC,GAAI,IAAI,CAAC,qBAAqB,CAAC,GAA2B,OAAO,EACjE,GAAI,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAAG,CAC5B,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAKtC,OAJA,EAAK,IAAI,CAAG,EACZ,EAAK,UAAU,CAAG,IAAI,CAAC,gBAAgB,GACvC,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EACvB,EAAK,SAAS,CAAG,IAAI,CAAC,gBAAgB,CAAC,GAChC,IAAI,CAAC,UAAU,CAAC,EAAM,wBAC/B,CACA,OAAO,CACT,EAIA,EAAK,YAAY,CAAG,SAAS,CAAI,CAAE,CAAsB,EACvD,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,eAAe,CAAC,EAAwB,CAAA,UACxD,AAAI,IAAI,CAAC,qBAAqB,CAAC,GAAkC,EAC1D,EAAK,KAAK,GAAK,GAAY,AAAc,4BAAd,EAAK,IAAI,CAAiC,EAAO,IAAI,CAAC,WAAW,CAAC,EAAM,EAAU,EAAU,GAAI,EACpI,EAQA,EAAK,WAAW,CAAG,SAAS,CAAI,CAAE,CAAY,CAAE,CAAY,CAAE,CAAO,CAAE,CAAI,EACzE,IAAI,EAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAC1B,GAAI,AAAQ,MAAR,GAAiB,CAAA,CAAC,GAAQ,IAAI,CAAC,IAAI,GAAK,EAAM,GAAE,AAAF,GAC5C,EAAO,EAAS,CAClB,IAAI,EAAU,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,UAAU,CACzE,EAAW,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,CACvC,GAGF,CAAA,EAAO,EAAM,UAAU,CAAC,KAAK,AAAL,EAE1B,IAAI,EAAK,IAAI,CAAC,KAAK,CACnB,IAAI,CAAC,IAAI,GACT,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAQ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,KAAM,CAAA,GAAQ,EAAU,EAAU,EAAM,GACtF,EAAO,IAAI,CAAC,WAAW,CAAC,EAAc,EAAc,EAAM,EAAO,EAAI,GAAW,GAIpF,MAHK,CAAA,GAAW,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,EAAM,GAAa,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,UAAU,AAAV,CAAU,GAC5H,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAE,4FAE7B,IAAI,CAAC,WAAW,CAAC,EAAM,EAAc,EAAc,EAAS,EACrE,CAEF,OAAO,CACT,EAEA,EAAK,WAAW,CAAG,SAAS,CAAQ,CAAE,CAAQ,CAAE,CAAI,CAAE,CAAK,CAAE,CAAE,CAAE,CAAO,EACtE,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAItC,OAHA,EAAK,IAAI,CAAG,EACZ,EAAK,QAAQ,CAAG,EAChB,EAAK,KAAK,CAAG,EACN,IAAI,CAAC,UAAU,CAAC,EAAM,EAAU,oBAAsB,mBAC/D,EAIA,EAAK,eAAe,CAAG,SAAS,CAAsB,CAAE,CAAQ,EAC9D,IAAqD,EAAjD,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CACnD,GAAI,IAAI,CAAC,YAAY,CAAC,UAAa,CAAA,IAAI,CAAC,OAAO,EAAK,CAAC,IAAI,CAAC,UAAU,EAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,AAAzB,EACnF,EAAO,IAAI,CAAC,UAAU,GACtB,EAAW,CAAA,OACN,GAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAE,CAC3B,IAAI,EAAO,IAAI,CAAC,SAAS,GAAI,EAAS,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,AAChE,CAAA,EAAK,QAAQ,CAAG,IAAI,CAAC,KAAK,CAC1B,EAAK,MAAM,CAAG,CAAA,EACd,IAAI,CAAC,IAAI,GACT,EAAK,QAAQ,CAAG,IAAI,CAAC,eAAe,CAAC,KAAM,CAAA,GAC3C,IAAI,CAAC,qBAAqB,CAAC,EAAwB,CAAA,GAC/C,EAAU,IAAI,CAAC,SAAS,CAAC,EAAK,QAAQ,EACjC,IAAI,CAAC,MAAM,EAAI,AAAkB,WAAlB,EAAK,QAAQ,EAC5B,AAAuB,eAAvB,EAAK,QAAQ,CAAC,IAAI,CACvB,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,0CAC/B,EAAW,CAAA,EAClB,EAAO,IAAI,CAAC,UAAU,CAAC,EAAM,EAAS,mBAAqB,kBAC7D,KAAO,CAEL,GADA,EAAO,IAAI,CAAC,mBAAmB,CAAC,GAC5B,IAAI,CAAC,qBAAqB,CAAC,GAA2B,OAAO,EACjE,KAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,CACtD,IAAI,EAAS,IAAI,CAAC,WAAW,CAAC,EAAU,EACxC,CAAA,EAAO,QAAQ,CAAG,IAAI,CAAC,KAAK,CAC5B,EAAO,MAAM,CAAG,CAAA,EAChB,EAAO,QAAQ,CAAG,EAClB,IAAI,CAAC,SAAS,CAAC,GACf,IAAI,CAAC,IAAI,GACT,EAAO,IAAI,CAAC,UAAU,CAAC,EAAQ,mBACjC,CACF,OAEA,AAAI,CAAC,GAAY,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAC7B,IAAI,CAAC,WAAW,CAAC,EAAU,EAAU,EAAM,IAAI,CAAC,eAAe,CAAC,KAAM,CAAA,GAAQ,KAAM,CAAA,GAEpF,CACb,EAIA,EAAK,mBAAmB,CAAG,SAAS,CAAsB,EACxD,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,aAAa,CAAC,GAC9B,GAAI,AAAc,4BAAd,EAAK,IAAI,EAAkC,AAAyD,MAAzD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAE,IAAI,CAAC,UAAU,EAC9F,OAAO,EACX,IAAI,EAAS,IAAI,CAAC,eAAe,CAAC,EAAM,EAAU,GAKlD,OAJI,GAA0B,AAAgB,qBAAhB,EAAO,IAAI,GACnC,EAAuB,mBAAmB,EAAI,EAAO,KAAK,EAAI,CAAA,EAAuB,mBAAmB,CAAG,EAA/G,EACI,EAAuB,iBAAiB,EAAI,EAAO,KAAK,EAAI,CAAA,EAAuB,iBAAiB,CAAG,EAA3G,GAEK,CACT,EAEA,EAAK,eAAe,CAAG,SAAS,CAAI,CAAE,CAAQ,CAAE,CAAQ,CAAE,CAAO,EAM/D,IALA,IAAI,EAAkB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,AAAc,eAAd,EAAK,IAAI,EAAqB,AAAc,UAAd,EAAK,IAAI,EAC1F,IAAI,CAAC,UAAU,GAAK,EAAK,GAAG,EAAI,CAAC,IAAI,CAAC,kBAAkB,IAAM,EAAK,GAAG,CAAG,EAAK,KAAK,EAAK,GACxF,IAAI,CAAC,gBAAgB,GAAK,EAAK,KAAK,CACpC,EAAkB,CAAA,IAET,CACX,IAAI,EAAU,IAAI,CAAC,cAAc,CAAC,EAAM,EAAU,EAAU,EAAS,EAAiB,GAGtF,GADI,EAAQ,QAAQ,EAAI,CAAA,EAAkB,CAAA,CAA1C,EACI,IAAY,GAAQ,AAAiB,4BAAjB,EAAQ,IAAI,CAAgC,CAClE,GAAI,EAAiB,CACnB,IAAI,EAAY,IAAI,CAAC,WAAW,CAAC,EAAU,EAC3C,CAAA,EAAU,UAAU,CAAG,EACvB,EAAU,IAAI,CAAC,UAAU,CAAC,EAAW,kBACvC,CACA,OAAO,CACT,CAEA,EAAO,CACT,CACF,EAEA,EAAK,cAAc,CAAG,SAAS,CAAI,CAAE,CAAQ,CAAE,CAAQ,CAAE,CAAO,CAAE,CAAe,CAAE,CAAe,EAChG,IAAI,EAAoB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAChD,EAAW,GAAqB,IAAI,CAAC,GAAG,CAAC,EAAM,WAAW,EAC1D,GAAW,GAAY,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAE,oEAEzD,IAAI,EAAW,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EACtC,GAAI,GAAa,GAAY,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,EAAK,IAAI,CAAC,GAAG,CAAC,EAAM,GAAG,EAAG,CAChH,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,EACtC,CAAA,EAAK,MAAM,CAAG,EACd,EAAK,QAAQ,CAAG,EAAW,IAAI,CAAC,eAAe,GAAK,IAAI,CAAC,UAAU,CAAC,AAA+B,UAA/B,IAAI,CAAC,OAAO,CAAC,aAAa,EAC9F,EAAK,QAAQ,CAAG,CAAC,CAAC,EACd,GAAY,IAAI,CAAC,MAAM,CAAC,EAAM,QAAQ,EACtC,GACF,CAAA,EAAK,QAAQ,CAAG,CADlB,EAGA,EAAO,IAAI,CAAC,UAAU,CAAC,EAAM,mBAC/B,MAAO,GAAI,CAAC,GAAW,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,EAAG,CAC7C,IAAI,EAAyB,IAAI,EAAqB,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAmB,IAAI,CAAC,aAAa,AACrJ,CAAA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,EAAW,IAAI,CAAC,aAAa,CAAC,EAAM,MAAM,CAAE,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAG,CAAA,EAAO,GACtF,GAAI,GAAmB,CAAC,GAAY,CAAC,IAAI,CAAC,kBAAkB,IAAM,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAQpF,OAPA,IAAI,CAAC,kBAAkB,CAAC,EAAwB,CAAA,GAChD,IAAI,CAAC,8BAA8B,GAC/B,IAAI,CAAC,aAAa,CAAG,GACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAE,6DACnC,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACd,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAU,GAAW,EAAU,CAAA,GAEnF,IAAI,CAAC,qBAAqB,CAAC,EAAwB,CAAA,GACnD,IAAI,CAAC,QAAQ,CAAG,GAAe,IAAI,CAAC,QAAQ,CAC5C,IAAI,CAAC,QAAQ,CAAG,GAAe,IAAI,CAAC,QAAQ,CAC5C,IAAI,CAAC,aAAa,CAAG,GAAoB,IAAI,CAAC,aAAa,CAC3D,IAAI,EAAS,IAAI,CAAC,WAAW,CAAC,EAAU,EACxC,CAAA,EAAO,MAAM,CAAG,EAChB,EAAO,SAAS,CAAG,EACf,GACF,CAAA,EAAO,QAAQ,CAAG,CADpB,EAGA,EAAO,IAAI,CAAC,UAAU,CAAC,EAAQ,iBACjC,MAAO,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,CAAE,CACpC,CAAA,GAAY,CAAA,GACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,6EAEzB,IAAI,EAAS,IAAI,CAAC,WAAW,CAAC,EAAU,EACxC,CAAA,EAAO,GAAG,CAAG,EACb,EAAO,KAAK,CAAG,IAAI,CAAC,aAAa,CAAC,CAAC,SAAU,CAAA,CAAI,GACjD,EAAO,IAAI,CAAC,UAAU,CAAC,EAAQ,2BACjC,CACA,OAAO,CACT,EAOA,EAAK,aAAa,CAAG,SAAS,CAAsB,EAG9C,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,IAAI,CAAC,UAAU,GAEhD,IAAI,EAAM,EAAa,IAAI,CAAC,gBAAgB,GAAK,IAAI,CAAC,KAAK,CAC3D,OAAQ,IAAI,CAAC,IAAI,EACjB,KAAK,EAAM,MAAM,CAef,OAdK,IAAI,CAAC,UAAU,EAChB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,oCAC3B,EAAO,IAAI,CAAC,SAAS,GACrB,IAAI,CAAC,IAAI,GACL,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAK,IAAI,CAAC,gBAAgB,EACpD,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,kDAOvB,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EACrF,IAAI,CAAC,UAAU,GACZ,IAAI,CAAC,UAAU,CAAC,EAAM,QAE/B,MAAK,EAAM,KAAK,CAGd,OAFA,EAAO,IAAI,CAAC,SAAS,GACrB,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,iBAE/B,MAAK,EAAM,IAAI,CACb,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,WAAW,CAC/E,EAAK,IAAI,CAAC,UAAU,CAAC,CAAA,GACzB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAC,GAAe,AAAY,UAAZ,EAAG,IAAI,EAAgB,CAAC,IAAI,CAAC,kBAAkB,IAAM,IAAI,CAAC,GAAG,CAAC,EAAM,SAAS,EAC9H,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,EAAU,GAAW,EAAG,CAAA,EAAO,CAAA,GAC9E,GAAI,GAAc,CAAC,IAAI,CAAC,kBAAkB,GAAI,CAC5C,GAAI,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EACpB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAU,GAAW,CAAC,EAAG,CAAE,CAAA,GACjF,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,AAAY,UAAZ,EAAG,IAAI,EAAgB,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,CAAC,EAIvF,OAHA,EAAK,IAAI,CAAC,UAAU,CAAC,CAAA,GACjB,CAAA,IAAI,CAAC,kBAAkB,IAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,CAAA,GAClD,IAAI,CAAC,UAAU,GACZ,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAU,GAAW,CAAC,EAAG,CAAE,CAAA,EAEjF,CACA,OAAO,CAET,MAAK,EAAM,MAAM,CACf,IAAI,EAAQ,IAAI,CAAC,KAAK,CAGtB,MADA,AADA,CAAA,EAAO,IAAI,CAAC,YAAY,CAAC,EAAM,KAAK,CAAA,EAC/B,KAAK,CAAG,CAAC,QAAS,EAAM,OAAO,CAAE,MAAO,EAAM,KAAK,AAAA,EACjD,CAET,MAAK,EAAM,GAAG,CAAE,KAAK,EAAM,MAAM,CAC/B,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAErC,MAAK,EAAM,KAAK,CAAE,KAAK,EAAM,KAAK,CAAE,KAAK,EAAM,MAAM,CAKnD,MAHA,AADA,CAAA,EAAO,IAAI,CAAC,SAAS,EAArB,EACK,KAAK,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CAAG,KAAO,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CACzE,EAAK,GAAG,CAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAC5B,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,UAE/B,MAAK,EAAM,MAAM,CACf,IAAI,EAAQ,IAAI,CAAC,KAAK,CAAE,EAAO,IAAI,CAAC,kCAAkC,CAAC,GAOvE,OANI,IACE,EAAuB,mBAAmB,CAAG,GAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAC7E,CAAA,EAAuB,mBAAmB,CAAG,CADjD,EAEI,EAAuB,iBAAiB,CAAG,GAC3C,CAAA,EAAuB,iBAAiB,CAAG,CAD/C,GAGK,CAET,MAAK,EAAM,QAAQ,CAIjB,OAHA,EAAO,IAAI,CAAC,SAAS,GACrB,IAAI,CAAC,IAAI,GACT,EAAK,QAAQ,CAAG,IAAI,CAAC,aAAa,CAAC,EAAM,QAAQ,CAAE,CAAA,EAAM,CAAA,EAAM,GACxD,IAAI,CAAC,UAAU,CAAC,EAAM,kBAE/B,MAAK,EAAM,MAAM,CACf,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAA,EAAO,EAE9B,MAAK,EAAM,SAAS,CAGlB,OAFA,EAAO,IAAI,CAAC,SAAS,GACrB,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,aAAa,CAAC,EAAM,EAElC,MAAK,EAAM,MAAM,CACf,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,GAAI,CAAA,EAE3C,MAAK,EAAM,IAAI,CACb,OAAO,IAAI,CAAC,QAAQ,EAEtB,MAAK,EAAM,SAAS,CAClB,OAAO,IAAI,CAAC,aAAa,EAE3B,MAAK,EAAM,OAAO,CAChB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC9B,OAAO,IAAI,CAAC,eAAe,GAE3B,OAAO,IAAI,CAAC,UAAU,EAG1B,SACE,IAAI,CAAC,UAAU,EACjB,CACF,EAEA,EAAK,eAAe,CAAG,WACrB,IAAI,EAAO,IAAI,CAAC,SAAS,EAIrB,CAAA,IAAI,CAAC,WAAW,EAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAE,qCAC1D,IAAI,EAAO,IAAI,CAAC,UAAU,CAAC,CAAA,GAE3B,OAAQ,IAAI,CAAC,IAAI,EACjB,KAAK,EAAM,MAAM,CACf,OAAO,IAAI,CAAC,kBAAkB,CAAC,EACjC,MAAK,EAAM,GAAG,CAEZ,OADA,EAAK,IAAI,CAAG,EACL,IAAI,CAAC,eAAe,CAAC,EAC9B,SACE,IAAI,CAAC,UAAU,EACjB,CACF,EAEA,EAAK,kBAAkB,CAAG,SAAS,CAAI,EAOrC,GANA,IAAI,CAAC,IAAI,GAGT,EAAK,MAAM,CAAG,IAAI,CAAC,gBAAgB,GAG/B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,EAAG,CAC3B,IAAI,EAAW,IAAI,CAAC,KAAK,AACrB,CAAA,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,GAAK,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,EAChD,IAAI,CAAC,gBAAgB,CAAC,EAAU,6CAEhC,IAAI,CAAC,UAAU,CAAC,EAEpB,CAEA,OAAO,IAAI,CAAC,UAAU,CAAC,EAAM,mBAC/B,EAEA,EAAK,eAAe,CAAG,SAAS,CAAI,EAClC,IAAI,CAAC,IAAI,GAET,IAAI,EAAc,IAAI,CAAC,WAAW,CAUlC,OATA,EAAK,QAAQ,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAEL,SAAvB,EAAK,QAAQ,CAAC,IAAI,EAClB,IAAI,CAAC,gBAAgB,CAAC,EAAK,QAAQ,CAAC,KAAK,CAAE,4DAC3C,GACA,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,qDACN,WAA5B,IAAI,CAAC,OAAO,CAAC,UAAU,EACvB,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,6CAE/B,IAAI,CAAC,UAAU,CAAC,EAAM,eAC/B,EAEA,EAAK,YAAY,CAAG,SAAS,CAAK,EAChC,IAAI,EAAO,IAAI,CAAC,SAAS,GAKzB,OAJA,EAAK,KAAK,CAAG,EACb,EAAK,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,GAAG,EACC,MAA7C,EAAK,GAAG,CAAC,UAAU,CAAC,EAAK,GAAG,CAAC,MAAM,CAAG,IAAc,CAAA,EAAK,MAAM,CAAG,EAAK,GAAG,CAAC,KAAK,CAAC,EAAG,IAAI,OAAO,CAAC,KAAM,GAA1G,EACA,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,UAC/B,EAEA,EAAK,oBAAoB,CAAG,WAC1B,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,IAAI,EAAM,IAAI,CAAC,eAAe,GAE9B,OADA,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACjB,CACT,EAEA,EAAK,kCAAkC,CAAG,SAAS,CAAU,EAC3D,IAAqD,EAAjD,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAAO,EAAqB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAC3G,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAG,CACjC,IAAI,CAAC,IAAI,GAET,IAEgH,EAF5G,EAAgB,IAAI,CAAC,KAAK,CAAE,EAAgB,IAAI,CAAC,QAAQ,CACzD,EAAW,EAAE,CAAE,EAAQ,CAAA,EAAM,EAAc,CAAA,EAC3C,EAAyB,IAAI,EAAqB,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,QAAQ,CAI9G,IAHA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAET,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAE,CAEjC,GADA,EAAQ,EAAQ,CAAA,EAAQ,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EAC3C,GAAsB,IAAI,CAAC,kBAAkB,CAAC,EAAM,MAAM,CAAE,CAAA,GAAO,CACrE,EAAc,CAAA,EACd,KACF,CAAO,GAAI,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,CAAE,CACvC,EAAc,IAAI,CAAC,KAAK,CACxB,EAAS,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,KACnD,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,iDACxD,KACF,CACE,EAAS,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAA,EAAO,EAAwB,IAAI,CAAC,cAAc,EAE1F,CACA,IAAI,EAAc,IAAI,CAAC,KAAK,CAAE,EAAc,IAAI,CAAC,QAAQ,CAGzD,GAFA,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EAEpB,GAAc,CAAC,IAAI,CAAC,kBAAkB,IAAM,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EAKlE,OAJA,IAAI,CAAC,kBAAkB,CAAC,EAAwB,CAAA,GAChD,IAAI,CAAC,8BAA8B,GACnC,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EACT,IAAI,CAAC,mBAAmB,CAAC,EAAU,EAAU,GAGlD,CAAA,CAAC,EAAS,MAAM,EAAI,CAAA,GAAe,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,EACpE,GAAe,IAAI,CAAC,UAAU,CAAC,GACnC,IAAI,CAAC,qBAAqB,CAAC,EAAwB,CAAA,GACnD,IAAI,CAAC,QAAQ,CAAG,GAAe,IAAI,CAAC,QAAQ,CAC5C,IAAI,CAAC,QAAQ,CAAG,GAAe,IAAI,CAAC,QAAQ,CAExC,EAAS,MAAM,CAAG,GAEpB,AADA,CAAA,EAAM,IAAI,CAAC,WAAW,CAAC,EAAe,EAAtC,EACI,WAAW,CAAG,EAClB,IAAI,CAAC,YAAY,CAAC,EAAK,qBAAsB,EAAa,IAE1D,EAAM,CAAQ,CAAC,EAAE,AAErB,MACE,EAAM,IAAI,CAAC,oBAAoB,GAGjC,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,CAK7B,OAAO,EAJP,IAAI,EAAM,IAAI,CAAC,WAAW,CAAC,EAAU,GAErC,OADA,EAAI,UAAU,CAAG,EACV,IAAI,CAAC,UAAU,CAAC,EAAK,0BAIhC,EAEA,EAAK,cAAc,CAAG,SAAS,CAAI,EACjC,OAAO,CACT,EAEA,EAAK,mBAAmB,CAAG,SAAS,CAAQ,CAAE,CAAQ,CAAE,CAAQ,EAC9D,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAU,GAAW,EACzE,EAQA,IAAI,EAAU,EAAE,AAEhB,CAAA,EAAK,QAAQ,CAAG,WACV,IAAI,CAAC,WAAW,EAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAE,kCAC1D,IAAI,EAAO,IAAI,CAAC,SAAS,GACrB,EAAO,IAAI,CAAC,UAAU,CAAC,CAAA,GAC3B,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,GAAG,CAAC,EAAM,GAAG,EAAG,CACxD,EAAK,IAAI,CAAG,EACZ,IAAI,EAAc,IAAI,CAAC,WAAW,CAQlC,OAPA,EAAK,QAAQ,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GACL,WAAvB,EAAK,QAAQ,CAAC,IAAI,EAClB,IAAI,CAAC,gBAAgB,CAAC,EAAK,QAAQ,CAAC,KAAK,CAAE,wDAC3C,GACA,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,oDACjC,IAAI,CAAC,kBAAkB,IACxB,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,8CAC/B,IAAI,CAAC,UAAU,CAAC,EAAM,eAC/B,CACA,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAAE,EAAW,IAAI,CAAC,IAAI,GAAK,EAAM,OAAO,CAO3F,OANA,EAAK,MAAM,CAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,GAAI,EAAU,EAAU,CAAA,GACzE,GAAY,AAAqB,qBAArB,EAAK,MAAM,CAAC,IAAI,EAC9B,IAAI,CAAC,KAAK,CAAC,EAAU,gCAEnB,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,EAAK,EAAK,SAAS,CAAG,IAAI,CAAC,aAAa,CAAC,EAAM,MAAM,CAAE,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAG,CAAA,GACxG,EAAK,SAAS,CAAG,EACjB,IAAI,CAAC,UAAU,CAAC,EAAM,gBAC/B,EAIA,EAAK,oBAAoB,CAAG,SAAS,CAAG,EACtC,IAAI,EAAW,EAAI,QAAQ,CAEvB,EAAO,IAAI,CAAC,SAAS,GAiBzB,OAhBI,IAAI,CAAC,IAAI,GAAK,EAAM,eAAe,EAChC,GACH,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAE,oDAEpC,EAAK,KAAK,CAAG,CACX,IAAK,IAAI,CAAC,KAAK,CACf,OAAQ,IACV,GAEA,EAAK,KAAK,CAAG,CACX,IAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,SAAU,MAC9D,OAAQ,IAAI,CAAC,KAAK,AACpB,EAEF,IAAI,CAAC,IAAI,GACT,EAAK,IAAI,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,SAAS,CAClC,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,EAAK,aAAa,CAAG,SAAS,CAAG,EAClB,KAAK,IAAb,GAAiB,CAAA,EAAM,CAAC,CAAA,EAC7B,IAAI,EAAW,EAAI,QAAQ,AAAoB,MAAK,IAAlB,GAAsB,CAAA,EAAW,CAAA,CAAtC,EAE7B,IAAI,EAAO,IAAI,CAAC,SAAS,GACzB,IAAI,CAAC,IAAI,GACT,EAAK,WAAW,CAAG,EAAE,CACrB,IAAI,EAAS,IAAI,CAAC,oBAAoB,CAAC,CAAC,SAAU,CAAQ,GAE1D,IADA,EAAK,MAAM,CAAG,CAAC,EAAO,CACf,CAAC,EAAO,IAAI,EACb,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,iCACpD,IAAI,CAAC,MAAM,CAAC,EAAM,YAAY,EAC9B,EAAK,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,IAC1C,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,MAAM,CAAC,IAAI,CAAC,EAAS,IAAI,CAAC,oBAAoB,CAAC,CAAC,SAAU,CAAQ,IAGzE,OADA,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,EAAK,WAAW,CAAG,SAAS,CAAI,EAC9B,MAAO,CAAC,EAAK,QAAQ,EAAI,AAAkB,eAAlB,EAAK,GAAG,CAAC,IAAI,EAAqB,AAAkB,UAAlB,EAAK,GAAG,CAAC,IAAI,EACrE,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,EAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAK,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,AAAJ,GACjM,CAAC,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,KAAK,EAChE,EAIA,EAAK,QAAQ,CAAG,SAAS,CAAS,CAAE,CAAsB,EACxD,IAAI,EAAO,IAAI,CAAC,SAAS,GAAI,EAAQ,CAAA,EAAM,EAAW,CAAC,EAGvD,IAFA,EAAK,UAAU,CAAG,EAAE,CACpB,IAAI,CAAC,IAAI,GACF,CAAC,IAAI,CAAC,GAAG,CAAC,EAAM,MAAM,GAAG,CAC9B,GAAK,EAGI,EAAQ,CAAA,OADf,GADA,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EACnB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,kBAAkB,CAAC,EAAM,MAAM,EAAK,MAGhF,IAAI,EAAO,IAAI,CAAC,aAAa,CAAC,EAAW,GACpC,GAAa,IAAI,CAAC,cAAc,CAAC,EAAM,EAAU,GACtD,EAAK,UAAU,CAAC,IAAI,CAAC,EACvB,CACA,OAAO,IAAI,CAAC,UAAU,CAAC,EAAM,EAAY,gBAAkB,mBAC7D,EAEA,EAAK,aAAa,CAAG,SAAS,CAAS,CAAE,CAAsB,EAC7D,IAA6B,EAAa,EAAS,EAAU,EAAzD,EAAO,IAAI,CAAC,SAAS,GACzB,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,SAC1D,AAAI,GACF,EAAK,QAAQ,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,GAC5B,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,iDAElB,IAAI,CAAC,UAAU,CAAC,EAAM,iBAG3B,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAC5B,EAAuB,mBAAmB,CAAG,GAC/C,CAAA,EAAuB,mBAAmB,CAAG,IAAI,CAAC,KAAK,AAAL,EAEhD,EAAuB,iBAAiB,CAAG,GAC7C,CAAA,EAAuB,iBAAiB,CAAG,IAAI,CAAC,KAAK,AAAL,GAIpD,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,CAAC,CAAA,EAAO,GAEzC,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,GAA0B,EAAuB,aAAa,CAAG,GAChG,CAAA,EAAuB,aAAa,CAAG,IAAI,CAAC,KAAK,AAAL,EAGvC,IAAI,CAAC,UAAU,CAAC,EAAM,iBAE3B,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAC9B,EAAK,MAAM,CAAG,CAAA,EACd,EAAK,SAAS,CAAG,CAAA,EACb,CAAA,GAAa,CAAA,IACf,EAAW,IAAI,CAAC,KAAK,CACrB,EAAW,IAAI,CAAC,QAAQ,EAErB,GACD,CAAA,EAAc,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,CAAA,GAEvC,IAAI,EAAc,IAAI,CAAC,WAAW,CAUlC,OATA,IAAI,CAAC,iBAAiB,CAAC,GACnB,CAAC,GAAa,CAAC,GAAe,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAC,GAAe,IAAI,CAAC,WAAW,CAAC,IAClG,EAAU,CAAA,EACV,EAAc,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EAClE,IAAI,CAAC,iBAAiB,CAAC,EAAM,IAE7B,EAAU,CAAA,EAEZ,IAAI,CAAC,kBAAkB,CAAC,EAAM,EAAW,EAAa,EAAS,EAAU,EAAU,EAAwB,GACpG,IAAI,CAAC,UAAU,CAAC,EAAM,WAC/B,EAEA,EAAK,kBAAkB,CAAG,SAAS,CAAI,CAAE,CAAS,CAAE,CAAW,CAAE,CAAO,CAAE,CAAQ,CAAE,CAAQ,CAAE,CAAsB,CAAE,CAAW,EAI/H,GAHK,CAAA,GAAe,CAAA,GAAY,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EACrD,IAAI,CAAC,UAAU,GAEf,IAAI,CAAC,GAAG,CAAC,EAAM,KAAK,EACtB,EAAK,KAAK,CAAG,EAAY,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,QAAQ,EAAI,IAAI,CAAC,gBAAgB,CAAC,CAAA,EAAO,GAC1G,EAAK,IAAI,CAAG,YACP,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAChE,GAAa,IAAI,CAAC,UAAU,GAChC,EAAK,IAAI,CAAG,OACZ,EAAK,MAAM,CAAG,CAAA,EACd,EAAK,KAAK,CAAG,IAAI,CAAC,WAAW,CAAC,EAAa,QACtC,GAAI,AAAC,GAAc,IACf,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,CAAA,GAAM,EAAK,QAAQ,EAAI,AAAkB,eAAlB,EAAK,GAAG,CAAC,IAAI,EAC/D,AAAkB,QAAlB,EAAK,GAAG,CAAC,IAAI,EAAc,AAAkB,QAAlB,EAAK,GAAG,CAAC,IAAI,EACxC,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,EAAE,CAgBlF,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAC,EAAK,QAAQ,EAAI,AAAkB,eAAlB,EAAK,GAAG,CAAC,IAAI,EACrE,CAAA,GAAe,CAAA,GAAW,IAAI,CAAC,UAAU,GAC7C,IAAI,CAAC,eAAe,CAAC,EAAK,GAAG,EACP,UAAlB,EAAK,GAAG,CAAC,IAAI,EAAiB,IAAI,CAAC,aAAa,EAChD,CAAA,IAAI,CAAC,aAAa,CAAG,CADzB,EAEA,EAAK,IAAI,CAAG,OACR,EACF,EAAK,KAAK,CAAG,IAAI,CAAC,iBAAiB,CAAC,EAAU,EAAU,EAAK,GAAG,EACvD,IAAI,CAAC,IAAI,GAAK,EAAM,EAAE,EAAI,GAC/B,EAAuB,eAAe,CAAG,GACzC,CAAA,EAAuB,eAAe,CAAG,IAAI,CAAC,KAAK,AAAL,EAClD,EAAK,KAAK,CAAG,IAAI,CAAC,iBAAiB,CAAC,EAAU,EAAU,EAAK,GAAG,GAEhE,EAAK,KAAK,CAAG,EAAK,GAAG,CAEvB,EAAK,SAAS,CAAG,CAAA,GACV,IAAI,CAAC,UAAU,OAhCwE,CAC1F,CAAA,GAAe,CAAA,GAAW,IAAI,CAAC,UAAU,GAC7C,EAAK,IAAI,CAAG,EAAK,GAAG,CAAC,IAAI,CACzB,IAAI,CAAC,iBAAiB,CAAC,GACvB,EAAK,KAAK,CAAG,IAAI,CAAC,WAAW,CAAC,CAAA,GAC9B,IAAI,EAAa,AAAc,QAAd,EAAK,IAAI,CAAa,EAAI,EAC3C,GAAI,EAAK,KAAK,CAAC,MAAM,CAAC,MAAM,GAAK,EAAY,CAC3C,IAAI,EAAQ,EAAK,KAAK,CAAC,KAAK,AACxB,AAAc,CAAA,QAAd,EAAK,IAAI,CACT,IAAI,CAAC,gBAAgB,CAAC,EAAO,gCAE7B,IAAI,CAAC,gBAAgB,CAAC,EAAO,uCACnC,KACoB,QAAd,EAAK,IAAI,EAAc,AAA8B,gBAA9B,EAAK,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAChD,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAE,gCAE1D,CAiBF,EAEA,EAAK,iBAAiB,CAAG,SAAS,CAAI,EACpC,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAhC,CACE,GAAI,IAAI,CAAC,GAAG,CAAC,EAAM,QAAQ,EAIzB,OAHA,EAAK,QAAQ,CAAG,CAAA,EAChB,EAAK,GAAG,CAAG,IAAI,CAAC,gBAAgB,GAChC,IAAI,CAAC,MAAM,CAAC,EAAM,QAAQ,EACnB,EAAK,GAAG,AAEf,CAAA,EAAK,QAAQ,CAAG,CAAA,C,CAGpB,OAAO,EAAK,GAAG,CAAG,IAAI,CAAC,IAAI,GAAK,EAAM,GAAG,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAAG,IAAI,CAAC,aAAa,GAAK,IAAI,CAAC,UAAU,CAAC,AAA+B,UAA/B,IAAI,CAAC,OAAO,CAAC,aAAa,CAC7I,EAIA,EAAK,YAAY,CAAG,SAAS,CAAI,EAC/B,EAAK,EAAE,CAAG,KACN,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAA,EAAK,SAAS,CAAG,EAAK,UAAU,CAAG,CAAA,CAAxE,EACI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAA,EAAK,KAAK,CAAG,CAAA,CAAlD,CACF,EAIA,EAAK,WAAW,CAAG,SAAS,CAAW,CAAE,CAAO,CAAE,CAAgB,EAChE,IAAI,EAAO,IAAI,CAAC,SAAS,GAAI,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAmB,IAAI,CAAC,aAAa,CAqB5H,OAnBA,IAAI,CAAC,YAAY,CAAC,GACd,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC5B,CAAA,EAAK,SAAS,CAAG,CADrB,EAEI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC5B,CAAA,EAAK,KAAK,CAAG,CAAC,CAAC,CADnB,EAGA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACrB,IAAI,CAAC,UAAU,CAAC,AAjtEA,GAitEA,EAAc,EAAS,EAAK,SAAS,EAAmB,CAAA,EAhtEjD,IAgtEyF,CAAA,GAEhH,IAAI,CAAC,MAAM,CAAC,EAAM,MAAM,EACxB,EAAK,MAAM,CAAG,IAAI,CAAC,gBAAgB,CAAC,EAAM,MAAM,CAAE,CAAA,EAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GACrF,IAAI,CAAC,8BAA8B,GACnC,IAAI,CAAC,iBAAiB,CAAC,EAAM,CAAA,EAAO,CAAA,GAEpC,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACd,IAAI,CAAC,UAAU,CAAC,EAAM,qBAC/B,EAIA,EAAK,oBAAoB,CAAG,SAAS,CAAI,CAAE,CAAM,CAAE,CAAO,EACxD,IAAI,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAc,IAAI,CAAC,QAAQ,CAAE,EAAmB,IAAI,CAAC,aAAa,CAgBnG,OAdA,IAAI,CAAC,UAAU,CAAC,AAruEA,GAquEA,EAAc,EAAS,CAAA,IACvC,IAAI,CAAC,YAAY,CAAC,GACd,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAA,EAAK,KAAK,CAAG,CAAC,CAAC,CAApD,EAEA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EAErB,EAAK,MAAM,CAAG,IAAI,CAAC,gBAAgB,CAAC,EAAQ,CAAA,GAC5C,IAAI,CAAC,iBAAiB,CAAC,EAAM,CAAA,EAAM,CAAA,GAEnC,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,aAAa,CAAG,EACd,IAAI,CAAC,UAAU,CAAC,EAAM,0BAC/B,EAIA,EAAK,iBAAiB,CAAG,SAAS,CAAI,CAAE,CAAe,CAAE,CAAQ,EAC/D,IAAI,EAAe,GAAmB,IAAI,CAAC,IAAI,GAAK,EAAM,MAAM,CAC5D,EAAY,IAAI,CAAC,MAAM,CAAE,EAAY,CAAA,EAEzC,GAAI,EACF,EAAK,IAAI,CAAG,IAAI,CAAC,gBAAgB,GACjC,EAAK,UAAU,CAAG,CAAA,EAClB,IAAI,CAAC,WAAW,CAAC,EAAM,CAAA,OAClB,CACL,IAAI,EAAY,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAK,MAAM,EAChF,CAAA,CAAC,GAAa,CAAA,GAChB,CAAA,EAAY,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAA,GAIxB,GACb,IAAI,CAAC,gBAAgB,CAAC,EAAK,KAAK,CAAE,6EAIxC,IAAI,EAAY,IAAI,CAAC,MAAM,AAC3B,CAAA,IAAI,CAAC,MAAM,CAAG,EAAE,CACZ,GAAa,CAAA,IAAI,CAAC,MAAM,CAAG,CAAA,CAA/B,EAIA,IAAI,CAAC,WAAW,CAAC,EAAM,CAAC,GAAa,CAAC,GAAa,CAAC,GAAmB,CAAC,GAAY,IAAI,CAAC,iBAAiB,CAAC,EAAK,MAAM,GAElH,IAAI,CAAC,MAAM,EAAI,EAAK,EAAE,EAAI,IAAI,CAAC,SAAS,CAAC,EAAK,EAAE,CApwErC,GAqwEf,EAAK,IAAI,CAAG,IAAI,CAAC,UAAU,CAAC,CAAA,EAAO,KAAA,EAAW,GAAa,CAAC,GAC5D,EAAK,UAAU,CAAG,CAAA,EAClB,IAAI,CAAC,sBAAsB,CAAC,EAAK,IAAI,CAAC,IAAI,EAC1C,IAAI,CAAC,MAAM,CAAG,CAChB,CACA,IAAI,CAAC,SAAS,EAChB,EAEA,EAAK,iBAAiB,CAAG,SAAS,CAAM,EACtC,IAAK,IAAI,EAAI,EAAkB,EAAI,AAAZ,EAAiB,MAAM,CAAE,GAAK,EAInD,GAAI,AAAe,eAAf,AAFQ,AAFS,CAEL,CAAC,EAAE,CAET,IAAI,CAAqB,MAAO,CAAA,EAE5C,MAAO,CAAA,CACT,EAKA,EAAK,WAAW,CAAG,SAAS,CAAI,CAAE,CAAe,EAE/C,IAAK,IADD,EAAW,CAAC,EACP,EAAI,EAAG,EAAO,EAAK,MAAM,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EACxD,CACA,IAAI,EAAQ,CAAI,CAAC,EAAE,CAEnB,IAAI,CAAC,SAAS,CAAC,EApyEJ,EAoyEqB,EAAkB,KAAO,EAC3D,CACF,EAQA,EAAK,aAAa,CAAG,SAAS,CAAK,CAAE,CAAkB,CAAE,CAAU,CAAE,CAAsB,EAEzF,IADA,IAAI,EAAO,EAAE,CAAE,EAAQ,CAAA,EAChB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAQ,CACvB,GAAK,EAGI,EAAQ,CAAA,OADf,GADA,IAAI,CAAC,MAAM,CAAC,EAAM,KAAK,EACnB,GAAsB,IAAI,CAAC,kBAAkB,CAAC,GAAU,MAG9D,IAAI,EAAO,KAAK,CACZ,CAAA,GAAc,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,CACvC,EAAM,KACD,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,EACnC,EAAM,IAAI,CAAC,WAAW,CAAC,GACnB,GAA0B,IAAI,CAAC,IAAI,GAAK,EAAM,KAAK,EAAI,EAAuB,aAAa,CAAG,GAC9F,CAAA,EAAuB,aAAa,CAAG,IAAI,CAAC,KAAK,AAAL,GAEhD,EAAM,IAAI,CAAC,gBAAgB,CAAC,CAAA,EAAO,GAErC,EAAK,IAAI,CAAC,EACZ,CACA,OAAO,CACT,EAEA,EAAK,eAAe,CAAG,SAAS,CAAG,EACjC,IAAI,EAAQ,EAAI,KAAK,CACjB,EAAM,EAAI,GAAG,CACb,EAAO,EAAI,IAAI,AAEf,CAAA,IAAI,CAAC,WAAW,EAAI,AAAS,UAAT,GACpB,IAAI,CAAC,gBAAgB,CAAC,EAAO,uDAC7B,IAAI,CAAC,OAAO,EAAI,AAAS,UAAT,GAChB,IAAI,CAAC,gBAAgB,CAAC,EAAO,6DAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IACnB,IAAI,CAAC,KAAK,CAAC,EAAQ,uBAAyB,EAAO,KACnD,CAAA,CAAA,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,CAAA,GAC7B,AAA+C,KAA/C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,GAAK,OAAO,CAAC,KAAU,GAE7C,AADK,CAAA,IAAI,CAAC,MAAM,CAAG,IAAI,CAAC,mBAAmB,CAAG,IAAI,CAAC,aAAa,AAAb,EAChD,IAAI,CAAC,KACL,IAAI,CAAC,OAAO,EAAI,AAAS,UAAT,GACjB,IAAI,CAAC,gBAAgB,CAAC,EAAO,wDACjC,IAAI,CAAC,gBAAgB,CAAC,EAAQ,gBAAkB,EAAO,iBAE3D,EAMA,EAAK,UAAU,CAAG,SAAS,CAAO,CAAE,CAAS,EAC3C,IAAI,EAAO,IAAI,CAAC,SAAS,GAwBzB,OAvBI,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,CAC1B,EAAK,IAAI,CAAG,IAAI,CAAC,KAAK,CACb,IAAI,CAAC,IAAI,CAAC,OAAO,EAC1B,EAAK,IAAI,CAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAMxB,CAAA,AAAc,UAAd,EAAK,IAAI,EAAgB,AAAc,aAAd,EAAK,IAAI,AAAK,GACvC,CAAA,IAAI,CAAC,UAAU,GAAK,IAAI,CAAC,YAAY,CAAG,GAAK,AAA6C,KAA7C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAM,GAC7F,IAAI,CAAC,OAAO,CAAC,GAAG,IAGlB,IAAI,CAAC,UAAU,GAEjB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GACZ,IAAI,CAAC,UAAU,CAAC,EAAM,cACjB,IACH,IAAI,CAAC,eAAe,CAAC,GACH,UAAd,EAAK,IAAI,EAAiB,IAAI,CAAC,aAAa,EAC5C,CAAA,IAAI,CAAC,aAAa,CAAG,EAAK,KAAK,AAAL,GAEzB,CACT,EAIA,EAAK,UAAU,CAAG,SAAS,CAAI,EACxB,IAAI,CAAC,QAAQ,EAAI,CAAA,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,KAAK,AAAL,EAE3C,IAAI,EAAO,IAAI,CAAC,SAAS,GASzB,OARA,IAAI,CAAC,IAAI,GACL,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,IAAI,CAAC,kBAAkB,IAAO,IAAI,CAAC,IAAI,GAAK,EAAM,IAAI,EAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAC7G,EAAK,QAAQ,CAAG,CAAA,EAChB,EAAK,QAAQ,CAAG,OAEhB,EAAK,QAAQ,CAAG,IAAI,CAAC,GAAG,CAAC,EAAM,IAAI,EACnC,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,CAAC,IAEjC,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,EAAK,UAAU,CAAG,WACX,IAAI,CAAC,QAAQ,EAAI,CAAA,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,KAAK,AAAL,EAE3C,IAAI,EAAO,IAAI,CAAC,SAAS,GAGzB,OAFA,IAAI,CAAC,IAAI,GACT,EAAK,QAAQ,CAAG,IAAI,CAAC,eAAe,CAAC,KAAM,CAAA,GACpC,IAAI,CAAC,UAAU,CAAC,EAAM,kBAC/B,EAEA,IAAI,GAAO,EAAO,SAAS,AAQ3B,CAAA,GAAK,KAAK,CAAG,SAAS,CAAG,CAAE,CAAO,EAChC,IAAI,EAAM,EAAY,IAAI,CAAC,KAAK,CAAE,GAE9B,EAAM,AAAI,YADd,GAAW,KAAO,EAAI,IAAI,CAAG,IAAM,EAAI,MAAM,CAAG,IAGhD,OADA,EAAI,GAAG,CAAG,EAAK,EAAI,GAAG,CAAG,EAAK,EAAI,QAAQ,CAAG,IAAI,CAAC,GAAG,CAC/C,CACR,EAEA,GAAK,gBAAgB,CAAG,GAAK,KAAK,CAElC,GAAK,WAAW,CAAG,WACjB,GAAI,IAAI,CAAC,OAAO,CAAC,SAAS,CACxB,OAAO,IAAI,EAAS,IAAI,CAAC,OAAO,CAAE,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,SAAS,CAE/D,EAEA,IAAI,GAAO,EAAO,SAAS,CAEvB,GAAQ,SAAe,CAAK,EAC9B,IAAI,CAAC,KAAK,CAAG,EAEb,IAAI,CAAC,GAAG,CAAG,EAAE,CAEb,IAAI,CAAC,OAAO,CAAG,EAAE,CAEjB,IAAI,CAAC,SAAS,CAAG,EAAE,AACrB,CAIA,CAAA,GAAK,UAAU,CAAG,SAAS,CAAK,EAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAM,GACjC,EAEA,GAAK,SAAS,CAAG,WACf,IAAI,CAAC,UAAU,CAAC,GAAG,EACrB,EAKA,GAAK,0BAA0B,CAAG,SAAS,CAAK,EAC9C,OAAO,AAt9EY,EAs9EZ,EAAO,KAAK,EAAsB,CAAC,IAAI,CAAC,QAAQ,EAAK,AAv9E9C,EAu9E8C,EAAM,KAAK,AACzE,EAEA,GAAK,WAAW,CAAG,SAAS,CAAI,CAAE,CAAW,CAAE,CAAG,EAChD,IAAI,EAAa,CAAA,EACjB,GAAI,AA18Ea,IA08Eb,EAA8B,CAChC,IAAI,EAAQ,IAAI,CAAC,YAAY,GAC7B,EAAa,EAAM,OAAO,CAAC,OAAO,CAAC,GAAQ,IAAM,EAAM,SAAS,CAAC,OAAO,CAAC,GAAQ,IAAM,EAAM,GAAG,CAAC,OAAO,CAAC,GAAQ,GACjH,EAAM,OAAO,CAAC,IAAI,CAAC,GACf,IAAI,CAAC,QAAQ,EAAK,AAh+EV,EAg+EU,EAAM,KAAK,EAC7B,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAK,AACxC,MAAO,GAAI,AA98EW,IA88EX,EAET,AADc,IAAI,CAAC,YAAY,GACvB,OAAO,CAAC,IAAI,CAAC,QAChB,GAAI,AAl9EO,IAk9EP,EAA+B,CACxC,IAAI,EAAU,IAAI,CAAC,YAAY,GAE3B,EADA,IAAI,CAAC,mBAAmB,CACX,EAAQ,OAAO,CAAC,OAAO,CAAC,GAAQ,GAEhC,EAAQ,OAAO,CAAC,OAAO,CAAC,GAAQ,IAAM,EAAQ,GAAG,CAAC,OAAO,CAAC,GAAQ,GACnF,EAAQ,SAAS,CAAC,IAAI,CAAC,EACzB,MACE,IAAK,IAAI,EAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAG,EAAG,GAAK,EAAG,EAAE,EAAG,CACpD,IAAI,EAAU,IAAI,CAAC,UAAU,CAAC,EAAE,CAChC,GAAI,EAAQ,OAAO,CAAC,OAAO,CAAC,GAAQ,IAAM,CAAG,CAAA,AAz+E1B,GAy+E0B,EAAQ,KAAK,EAA0B,EAAQ,OAAO,CAAC,EAAE,GAAK,CAAA,GACvG,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAY,EAAQ,SAAS,CAAC,OAAO,CAAC,GAAQ,GAAI,CACrF,EAAa,CAAA,EACb,KACF,CAIA,GAHA,EAAQ,GAAG,CAAC,IAAI,CAAC,GACb,IAAI,CAAC,QAAQ,EAAK,AAr/EZ,EAq/EY,EAAQ,KAAK,EAC/B,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAK,CAClC,AAr/EM,EAq/EN,EAAQ,KAAK,CAAgB,KACnC,CAEE,GAAc,IAAI,CAAC,gBAAgB,CAAC,EAAM,eAAiB,EAAO,8BACxE,EAEA,GAAK,gBAAgB,CAAG,SAAS,CAAE,EAEmB,KAAhD,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAG,IAAI,GAC1C,AAA4C,KAA5C,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,EAAG,IAAI,GACxC,CAAA,IAAI,CAAC,gBAAgB,CAAC,EAAG,IAAI,CAAC,CAAG,CAFnC,CAIF,EAEA,GAAK,YAAY,CAAG,WAClB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAG,EAAE,AACpD,EAEA,GAAK,eAAe,CAAG,WACrB,IAAK,IAAI,EAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAG,GAAI,IAAK,CAC7C,IAAI,EAAQ,IAAI,CAAC,UAAU,CAAC,EAAE,CAC9B,GAAI,AA1gFQ,EA0gFR,EAAM,KAAK,CAAgB,OAAO,CACxC,CACF,EAGA,GAAK,gBAAgB,CAAG,WACtB,IAAK,IAAI,EAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAG,GAAI,IAAK,CAC7C,IAAI,EAAQ,IAAI,CAAC,UAAU,CAAC,EAAE,CAC9B,GAAI,AAlhFQ,EAkhFR,EAAM,KAAK,EAAgB,CAAE,CAAA,AA/gFnB,GA+gFmB,EAAM,KAAK,AAAG,EAAgB,OAAO,CACxE,CACF,EAEA,IAAI,GAAO,SAAc,CAAM,CAAE,CAAG,CAAE,CAAG,EACvC,IAAI,CAAC,IAAI,CAAG,GACZ,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,GAAG,CAAG,EACP,EAAO,OAAO,CAAC,SAAS,EACxB,CAAA,IAAI,CAAC,GAAG,CAAG,IAAI,EAAe,EAAQ,EAD1C,EAEI,EAAO,OAAO,CAAC,gBAAgB,EAC/B,CAAA,IAAI,CAAC,UAAU,CAAG,EAAO,OAAO,CAAC,gBAAgB,AAAhB,EACjC,EAAO,OAAO,CAAC,MAAM,EACrB,CAAA,IAAI,CAAC,KAAK,CAAG,CAAC,EAAK,EAAE,AAAA,CAC3B,EAII,GAAO,EAAO,SAAS,CAY3B,SAAS,GAAa,CAAI,CAAE,CAAI,CAAE,CAAG,CAAE,CAAG,EAOxC,OANA,EAAK,IAAI,CAAG,EACZ,EAAK,GAAG,CAAG,EACP,IAAI,CAAC,OAAO,CAAC,SAAS,EACtB,CAAA,EAAK,GAAG,CAAC,GAAG,CAAG,CADnB,EAEI,IAAI,CAAC,OAAO,CAAC,MAAM,EACnB,CAAA,EAAK,KAAK,CAAC,EAAE,CAAG,CADpB,EAEO,CACT,CAlBA,GAAK,SAAS,CAAG,WACf,OAAO,IAAI,GAAK,IAAI,CAAE,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,QAAQ,CACjD,EAEA,GAAK,WAAW,CAAG,SAAS,CAAG,CAAE,CAAG,EAClC,OAAO,IAAI,GAAK,IAAI,CAAE,EAAK,EAC7B,EAcA,GAAK,UAAU,CAAG,SAAS,CAAI,CAAE,CAAI,EACnC,OAAO,GAAa,IAAI,CAAC,IAAI,CAAE,EAAM,EAAM,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,aAAa,CAChF,EAIA,GAAK,YAAY,CAAG,SAAS,CAAI,CAAE,CAAI,CAAE,CAAG,CAAE,CAAG,EAC/C,OAAO,GAAa,IAAI,CAAC,IAAI,CAAE,EAAM,EAAM,EAAK,EAClD,EAIA,IAAI,GAAa,SAAoB,CAAK,CAAE,CAAM,CAAE,CAAa,CAAE,CAAQ,CAAE,CAAS,EACpF,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,MAAM,CAAG,CAAC,CAAC,EAChB,IAAI,CAAC,aAAa,CAAG,CAAC,CAAC,EACvB,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,SAAS,CAAG,CAAC,CAAC,CACrB,EAEI,GAAU,CACZ,OAAQ,IAAI,GAAW,IAAK,CAAA,GAC5B,OAAQ,IAAI,GAAW,IAAK,CAAA,GAC5B,OAAQ,IAAI,GAAW,KAAM,CAAA,GAC7B,OAAQ,IAAI,GAAW,IAAK,CAAA,GAC5B,OAAQ,IAAI,GAAW,IAAK,CAAA,GAC5B,OAAQ,IAAI,GAAW,IAAK,CAAA,EAAM,CAAA,EAAM,SAAU,CAAC,EAAI,OAAO,EAAE,oBAAoB,EAAI,GACxF,OAAQ,IAAI,GAAW,WAAY,CAAA,GACnC,OAAQ,IAAI,GAAW,WAAY,CAAA,GACnC,WAAY,IAAI,GAAW,WAAY,CAAA,EAAM,CAAA,EAAO,KAAM,CAAA,GAC1D,MAAO,IAAI,GAAW,WAAY,CAAA,EAAO,CAAA,EAAO,KAAM,CAAA,EACxD,EAEI,GAAO,EAAO,SAAS,AAE3B,CAAA,GAAK,cAAc,CAAG,WACpB,MAAO,CAAC,GAAQ,MAAM,CAAC,AACzB,EAEA,GAAK,YAAY,CAAG,SAAS,CAAQ,EACnC,IAAI,EAAS,IAAI,CAAC,UAAU,UAC5B,AAAI,IAAW,GAAQ,MAAM,EAAI,IAAW,GAAQ,MAAM,GAEtD,IAAa,EAAM,KAAK,EAAK,CAAA,IAAW,GAAQ,MAAM,EAAI,IAAW,GAAQ,MAAM,AAAN,EACtE,CAAC,EAAO,MAAM,CAKrB,IAAa,EAAM,OAAO,EAAI,IAAa,EAAM,IAAI,EAAI,IAAI,CAAC,WAAW,CAClE,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,KAAK,GAClE,IAAa,EAAM,KAAK,EAAI,IAAa,EAAM,IAAI,EAAI,IAAa,EAAM,GAAG,EAAI,IAAa,EAAM,MAAM,EAAI,IAAa,EAAM,KAAK,GAEtI,IAAa,EAAM,MAAM,CAClB,IAAW,GAAQ,MAAM,CAChC,IAAa,EAAM,IAAI,EAAI,IAAa,EAAM,MAAM,EAAI,IAAa,EAAM,IAAI,EAE5E,CAAC,IAAI,CAAC,WAAW,EAC1B,EAEA,GAAK,kBAAkB,CAAG,WACxB,IAAK,IAAI,EAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAG,EAAG,GAAK,EAAG,IAAK,CACjD,IAAI,EAAU,IAAI,CAAC,OAAO,CAAC,EAAE,CAC7B,GAAI,AAAkB,aAAlB,EAAQ,KAAK,CACb,OAAO,EAAQ,SAAS,AAC9B,CACA,MAAO,CAAA,CACT,EAEA,GAAK,aAAa,CAAG,SAAS,CAAQ,EACpC,IAAI,EAAQ,EAAO,IAAI,CAAC,IAAI,AACxB,CAAA,EAAK,OAAO,EAAI,IAAa,EAAM,GAAG,CACtC,IAAI,CAAC,WAAW,CAAG,CAAA,EACd,CAAA,EAAS,EAAK,aAAa,AAAb,EACnB,EAAO,IAAI,CAAC,IAAI,CAAE,GAElB,IAAI,CAAC,WAAW,CAAG,EAAK,UAAU,AACxC,EAIA,EAAM,MAAM,CAAC,aAAa,CAAG,EAAM,MAAM,CAAC,aAAa,CAAG,WACxD,GAAI,AAAwB,IAAxB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAQ,CAC7B,IAAI,CAAC,WAAW,CAAG,CAAA,EACnB,MACF,CACA,IAAI,EAAM,IAAI,CAAC,OAAO,CAAC,GAAG,GACtB,IAAQ,GAAQ,MAAM,EAAI,AAA4B,aAA5B,IAAI,CAAC,UAAU,GAAG,KAAK,EACnD,CAAA,EAAM,IAAI,CAAC,OAAO,CAAC,GAAG,EADxB,EAGA,IAAI,CAAC,WAAW,CAAG,CAAC,EAAI,MAAM,AAChC,EAEA,EAAM,MAAM,CAAC,aAAa,CAAG,SAAS,CAAQ,EAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAY,GAAQ,MAAM,CAAG,GAAQ,MAAM,EAC/E,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,YAAY,CAAC,aAAa,CAAG,WACjC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAQ,MAAM,EAChC,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,MAAM,CAAC,aAAa,CAAG,SAAS,CAAQ,EAC5C,IAAI,EAAkB,IAAa,EAAM,GAAG,EAAI,IAAa,EAAM,IAAI,EAAI,IAAa,EAAM,KAAK,EAAI,IAAa,EAAM,MAAM,CAChI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAkB,GAAQ,MAAM,CAAG,GAAQ,MAAM,EACnE,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,MAAM,CAAC,aAAa,CAAG,WAE7B,EAEA,EAAM,SAAS,CAAC,aAAa,CAAG,EAAM,MAAM,CAAC,aAAa,CAAG,SAAS,CAAQ,EACxE,CAAA,EAAS,UAAU,EAAI,IAAa,EAAM,IAAI,EAAI,IAAa,EAAM,KAAK,EACxE,IAAa,EAAM,OAAO,EAAI,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,KAAK,IACzF,AAAC,CAAA,IAAa,EAAM,KAAK,EAAI,IAAa,EAAM,MAAK,AAAL,GAAW,IAAI,CAAC,UAAU,KAAO,GAAQ,MAAK,CAGhG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAQ,MAAM,EAFhC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAQ,MAAM,EAGpC,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,SAAS,CAAC,aAAa,CAAG,WAC1B,IAAI,CAAC,UAAU,KAAO,GAAQ,MAAM,CACpC,IAAI,CAAC,OAAO,CAAC,GAAG,GAEhB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAQ,MAAM,EACpC,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,IAAI,CAAC,aAAa,CAAG,SAAS,CAAQ,EAC1C,GAAI,IAAa,EAAM,SAAS,CAAE,CAChC,IAAI,EAAQ,IAAI,CAAC,OAAO,CAAC,MAAM,CAAG,CAC9B,CAAA,IAAI,CAAC,OAAO,CAAC,EAAM,GAAK,GAAQ,MAAM,CACtC,IAAI,CAAC,OAAO,CAAC,EAAM,CAAG,GAAQ,UAAU,CAExC,IAAI,CAAC,OAAO,CAAC,EAAM,CAAG,GAAQ,KAAK,AACzC,CACA,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EAEA,EAAM,IAAI,CAAC,aAAa,CAAG,SAAS,CAAQ,EAC1C,IAAI,EAAU,CAAA,CACV,CAAA,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,IAAa,EAAM,GAAG,EACrD,CAAA,AAAe,OAAf,IAAI,CAAC,KAAK,EAAa,CAAC,IAAI,CAAC,WAAW,EACxC,AAAe,UAAf,IAAI,CAAC,KAAK,EAAgB,IAAI,CAAC,kBAAkB,EAAA,GACjD,CAAA,EAAU,CAAA,CAFd,EAIF,IAAI,CAAC,WAAW,CAAG,CACrB,EAOA,IAAI,GAAwB,89BACxB,GAAyB,GAAwB,yBAEjD,GAA0B,CAC5B,EAAG,GACH,GAAI,GACJ,GAJ2B,EAK7B,EAGI,GAA+B,qpBAG/B,GAAoB,2+DACpB,GAAqB,GAAoB,kHAEzC,GAAsB,CACxB,EAAG,GACH,GAAI,GACJ,GAJuB,GAAqB,wEAK9C,EAEI,GAAO,CAAC,EACZ,SAAS,GAAiB,CAAW,EACnC,IAAI,EAAI,EAAI,CAAC,EAAY,CAAG,CAC1B,OAAQ,EAAY,EAAuB,CAAC,EAAY,CAAG,IAAM,IACjE,UAAW,CACT,iBAAkB,EAAY,IAC9B,OAAQ,EAAY,EAAmB,CAAC,EAAY,CACtD,CACF,CACA,CAAA,EAAE,SAAS,CAAC,iBAAiB,CAAG,EAAE,SAAS,CAAC,MAAM,CAElD,EAAE,SAAS,CAAC,EAAE,CAAG,EAAE,SAAS,CAAC,gBAAgB,CAC7C,EAAE,SAAS,CAAC,EAAE,CAAG,EAAE,SAAS,CAAC,MAAM,CACnC,EAAE,SAAS,CAAC,GAAG,CAAG,EAAE,SAAS,CAAC,iBAAiB,AACjD,CACA,GAAiB,GACjB,GAAiB,IACjB,GAAiB,IAEjB,IAAI,GAAO,EAAO,SAAS,CAEvB,GAAwB,SAA+B,CAAM,EAC/D,IAAI,CAAC,MAAM,CAAG,EACd,IAAI,CAAC,UAAU,CAAG,MAAS,CAAA,EAAO,OAAO,CAAC,WAAW,EAAI,EAAI,KAAO,EAAA,EAAO,CAAA,EAAO,OAAO,CAAC,WAAW,EAAI,EAAI,IAAM,EAAA,EACnH,IAAI,CAAC,iBAAiB,CAAG,EAAI,CAAC,EAAO,OAAO,CAAC,WAAW,EAAI,GAAK,GAAK,EAAO,OAAO,CAAC,WAAW,CAAC,CACjG,IAAI,CAAC,MAAM,CAAG,GACd,IAAI,CAAC,KAAK,CAAG,GACb,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,OAAO,CAAG,CAAA,EACf,IAAI,CAAC,OAAO,CAAG,CAAA,EACf,IAAI,CAAC,GAAG,CAAG,EACX,IAAI,CAAC,YAAY,CAAG,EACpB,IAAI,CAAC,eAAe,CAAG,GACvB,IAAI,CAAC,2BAA2B,CAAG,CAAA,EACnC,IAAI,CAAC,kBAAkB,CAAG,EAC1B,IAAI,CAAC,gBAAgB,CAAG,EACxB,IAAI,CAAC,UAAU,CAAG,EAAE,CACpB,IAAI,CAAC,kBAAkB,CAAG,EAAE,AAC9B,EA6EA,SAAS,GAAkB,CAAE,SAC3B,AAAI,GAAM,MAAiB,OAAO,YAAY,CAAC,GAExC,OAAO,YAAY,CAAC,AAAC,CAAA,AAD5B,CAAA,GAAM,KAAN,GACkC,EAAA,EAAM,MAAQ,AAAC,CAAA,AAAK,KAAL,CAAK,EAAU,MAClE,CAgSA,SAAS,GAAkB,CAAE,EAC3B,OACE,AAAO,KAAP,GACA,GAAM,IAAgB,GAAM,IAC5B,AAAO,KAAP,GACA,AAAO,KAAP,GACA,GAAM,IAAgB,GAAM,IAC5B,GAAM,KAAgB,GAAM,GAEhC,CA4PA,SAAS,GAAgB,CAAE,EACzB,OACG,GAAM,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,GAEjC,CA2KA,SAAS,GAA+B,CAAE,EACxC,OAAO,GAAgB,IAAO,AAAO,KAAP,CAChC,CAqJA,SAAS,GAAe,CAAE,EACxB,OAAO,GAAM,IAAgB,GAAM,EACrC,CAaA,SAAS,GAAW,CAAE,EACpB,OACE,GAAO,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,GAEjC,CACA,SAAS,GAAS,CAAE,SAClB,AAAI,GAAM,IAAgB,GAAM,GACvB,GAAM,CAAA,EAAK,EAAA,EAEhB,GAAM,IAAgB,GAAM,IACvB,GAAM,CAAA,EAAK,EAAA,EAEb,EAAK,EACd,CAiCA,SAAS,GAAa,CAAE,EACtB,OAAO,GAAM,IAAgB,GAAM,EACrC,CA5/BA,GAAsB,SAAS,CAAC,KAAK,CAAG,SAAgB,CAAK,CAAE,CAAO,CAAE,CAAK,EAC3E,IAAI,EAAU,AAAuB,KAAvB,EAAM,OAAO,CAAC,IAC5B,CAAA,IAAI,CAAC,KAAK,CAAG,AAAQ,EAAR,EACb,IAAI,CAAC,MAAM,CAAG,EAAU,GACxB,IAAI,CAAC,KAAK,CAAG,EACb,IAAI,CAAC,OAAO,CAAG,GAAW,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,EAAI,EAC7D,IAAI,CAAC,OAAO,CAAG,GAAW,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,EAAI,CAC/D,EAEA,GAAsB,SAAS,CAAC,KAAK,CAAG,SAAgB,CAAO,EAC7D,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAG,gCAAmC,IAAI,CAAC,MAAM,CAAI,MAAQ,EACtG,EAIA,GAAsB,SAAS,CAAC,EAAE,CAAG,SAAa,CAAC,CAAE,CAAM,EACvC,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEF,IAAI,EAAI,IAAI,CAAC,MAAM,CACf,EAAI,EAAE,MAAM,CAChB,GAAI,GAAK,EACP,OAAO,GAET,IAAI,EAAI,EAAE,UAAU,CAAC,GACrB,GAAI,CAAE,CAAA,GAAU,IAAI,CAAC,OAAO,AAAP,GAAY,GAAK,OAAU,GAAK,OAAU,EAAI,GAAK,EACtE,OAAO,EAET,IAAI,EAAO,EAAE,UAAU,CAAC,EAAI,GAC5B,OAAO,GAAQ,OAAU,GAAQ,MAAU,AAAA,CAAA,GAAK,EAAA,EAAM,EAAO,SAAY,CAC3E,EAEA,GAAsB,SAAS,CAAC,SAAS,CAAG,SAAoB,CAAC,CAAE,CAAM,EACrD,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEF,IAAI,EAAI,IAAI,CAAC,MAAM,CACf,EAAI,EAAE,MAAM,CAChB,GAAI,GAAK,EACP,OAAO,EAET,IAAyB,EAArB,EAAI,EAAE,UAAU,CAAC,SACrB,AAAI,CAAE,CAAA,GAAU,IAAI,CAAC,OAAO,AAAP,GAAY,GAAK,OAAU,GAAK,OAAU,EAAI,GAAK,GACnE,AAAA,CAAA,EAAO,EAAE,UAAU,CAAC,EAAI,EAAA,EAAM,OAAU,EAAO,MAC3C,EAAI,EAEN,EAAI,CACb,EAEA,GAAsB,SAAS,CAAC,OAAO,CAAG,SAAkB,CAAM,EAGhE,OAFkB,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEK,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAE,EAC3B,EAEA,GAAsB,SAAS,CAAC,SAAS,CAAG,SAAoB,CAAM,EAGpE,OAFkB,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEK,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAE,GAAS,EACnD,EAEA,GAAsB,SAAS,CAAC,OAAO,CAAG,SAAkB,CAAM,EAC9C,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEF,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAE,EACtC,EAEA,GAAsB,SAAS,CAAC,GAAG,CAAG,SAAc,CAAE,CAAE,CAAM,SAG5D,AAFkB,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEE,IAAI,CAAC,OAAO,CAAC,KAAY,IAC3B,IAAI,CAAC,OAAO,CAAC,GACN,CAAA,EAGX,EAcA,GAAK,mBAAmB,CAAG,SAAS,CAAK,EAIvC,IAAK,IAHD,EAAa,EAAM,UAAU,CAC7B,EAAQ,EAAM,KAAK,CAEd,EAAI,EAAG,EAAI,EAAM,MAAM,CAAE,IAAK,CACrC,IAAI,EAAO,EAAM,MAAM,CAAC,EACS,CAAA,KAA7B,EAAW,OAAO,CAAC,IACrB,IAAI,CAAC,KAAK,CAAC,EAAM,KAAK,CAAE,mCAEtB,EAAM,OAAO,CAAC,EAAM,EAAI,GAAK,IAC/B,IAAI,CAAC,KAAK,CAAC,EAAM,KAAK,CAAE,oCAE5B,CACF,EAQA,GAAK,qBAAqB,CAAG,SAAS,CAAK,EACzC,IAAI,CAAC,cAAc,CAAC,GAOhB,CAAC,EAAM,OAAO,EAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,EAAM,UAAU,CAAC,MAAM,CAAG,IAC/E,EAAM,OAAO,CAAG,CAAA,EAChB,IAAI,CAAC,cAAc,CAAC,GAExB,EAGA,GAAK,cAAc,CAAG,SAAS,CAAK,EAClC,EAAM,GAAG,CAAG,EACZ,EAAM,YAAY,CAAG,EACrB,EAAM,eAAe,CAAG,GACxB,EAAM,2BAA2B,CAAG,CAAA,EACpC,EAAM,kBAAkB,CAAG,EAC3B,EAAM,gBAAgB,CAAG,EACzB,EAAM,UAAU,CAAC,MAAM,CAAG,EAC1B,EAAM,kBAAkB,CAAC,MAAM,CAAG,EAElC,IAAI,CAAC,kBAAkB,CAAC,GAEpB,EAAM,GAAG,GAAK,EAAM,MAAM,CAAC,MAAM,GAE/B,EAAM,GAAG,CAAC,KACZ,EAAM,KAAK,CAAC,iBAEV,CAAA,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IAAU,GACjD,EAAM,KAAK,CAAC,6BAGZ,EAAM,gBAAgB,CAAG,EAAM,kBAAkB,EACnD,EAAM,KAAK,CAAC,kBAEd,IAAK,IAAI,EAAI,EAAG,EAAO,EAAM,kBAAkB,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CACxE,IAAI,EAAO,CAAI,CAAC,EAAE,AAEqB,CAAA,KAAnC,EAAM,UAAU,CAAC,OAAO,CAAC,IAC3B,EAAM,KAAK,CAAC,mCAEhB,CACF,EAGA,GAAK,kBAAkB,CAAG,SAAS,CAAK,EAEtC,IADA,IAAI,CAAC,kBAAkB,CAAC,GACjB,EAAM,GAAG,CAAC,MACf,IAAI,CAAC,kBAAkB,CAAC,GAItB,IAAI,CAAC,oBAAoB,CAAC,EAAO,CAAA,IACnC,EAAM,KAAK,CAAC,qBAEV,EAAM,GAAG,CAAC,MACZ,EAAM,KAAK,CAAC,2BAEhB,EAGA,GAAK,kBAAkB,CAAG,SAAS,CAAK,EACtC,KAAO,EAAM,GAAG,CAAG,EAAM,MAAM,CAAC,MAAM,EAAI,IAAI,CAAC,cAAc,CAAC,KAEhE,EAGA,GAAK,cAAc,CAAG,SAAS,CAAK,SAClC,AAAI,IAAI,CAAC,mBAAmB,CAAC,IAIvB,EAAM,2BAA2B,EAAI,IAAI,CAAC,oBAAoB,CAAC,IAE7D,EAAM,OAAO,EACf,EAAM,KAAK,CAAC,sBAGT,CAAA,GAGL,CAAA,EAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,KAAS,IAAI,CAAC,sBAAsB,CAAC,EAAA,IAC3E,IAAI,CAAC,oBAAoB,CAAC,GACnB,CAAA,EAIX,EAGA,GAAK,mBAAmB,CAAG,SAAS,CAAK,EACvC,IAAI,EAAQ,EAAM,GAAG,CAIrB,GAHA,EAAM,2BAA2B,CAAG,CAAA,EAGhC,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IACvC,MAAO,CAAA,EAIT,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IACvC,MAAO,CAAA,CAET,CAAA,EAAM,GAAG,CAAG,CACd,CAGA,GAAI,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IAAe,CACtD,IAAI,EAAa,CAAA,EAIjB,GAHI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC9B,CAAA,EAAa,EAAM,GAAG,CAAC,GADzB,EAGI,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IAMvC,OALA,IAAI,CAAC,kBAAkB,CAAC,GACnB,EAAM,GAAG,CAAC,KACb,EAAM,KAAK,CAAC,sBAEd,EAAM,2BAA2B,CAAG,CAAC,EAC9B,CAAA,CAEX,CAGA,OADA,EAAM,GAAG,CAAG,EACL,CAAA,CACT,EAGA,GAAK,oBAAoB,CAAG,SAAS,CAAK,CAAE,CAAO,SAGjD,AAFiB,KAAK,IAAjB,GAAqB,CAAA,EAAU,CAAA,CAApC,IAEI,IAAI,CAAC,0BAA0B,CAAC,EAAO,KACzC,EAAM,GAAG,CAAC,IACH,CAAA,EAGX,EAGA,GAAK,0BAA0B,CAAG,SAAS,CAAK,CAAE,CAAO,EACvD,OACE,EAAM,GAAG,CAAC,KACV,EAAM,GAAG,CAAC,KACV,EAAM,GAAG,CAAC,KACV,IAAI,CAAC,0BAA0B,CAAC,EAAO,EAE3C,EACA,GAAK,0BAA0B,CAAG,SAAS,CAAK,CAAE,CAAO,EACvD,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,EAAM,GAAG,CAAC,KAAe,CAC3B,IAAI,EAAM,EAAG,EAAM,GACnB,GAAI,IAAI,CAAC,uBAAuB,CAAC,KAC/B,EAAM,EAAM,YAAY,CACpB,EAAM,GAAG,CAAC,KAAiB,IAAI,CAAC,uBAAuB,CAAC,IAC1D,CAAA,EAAM,EAAM,YAAY,AAAZ,EAEV,EAAM,GAAG,CAAC,MAKZ,OAHY,KAAR,GAAc,EAAM,GAAO,CAAC,GAC9B,EAAM,KAAK,CAAC,yCAEP,CAAA,CAGP,CAAA,EAAM,OAAO,EAAI,CAAC,GACpB,EAAM,KAAK,CAAC,yBAEd,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EAGA,GAAK,cAAc,CAAG,SAAS,CAAK,EAClC,OACE,IAAI,CAAC,2BAA2B,CAAC,IACjC,EAAM,GAAG,CAAC,KACV,IAAI,CAAC,kCAAkC,CAAC,IACxC,IAAI,CAAC,wBAAwB,CAAC,IAC9B,IAAI,CAAC,0BAA0B,CAAC,IAChC,IAAI,CAAC,wBAAwB,CAAC,EAElC,EACA,GAAK,kCAAkC,CAAG,SAAS,CAAK,EACtD,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,IAAI,CAAC,oBAAoB,CAAC,GAC5B,MAAO,CAAA,CAET,CAAA,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EACA,GAAK,0BAA0B,CAAG,SAAS,CAAK,EAC9C,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,IAAe,CAEtD,GADA,IAAI,CAAC,kBAAkB,CAAC,GACpB,EAAM,GAAG,CAAC,IACZ,MAAO,CAAA,EAET,EAAM,KAAK,CAAC,qBACd,CACA,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EACA,GAAK,wBAAwB,CAAG,SAAS,CAAK,EAC5C,GAAI,EAAM,GAAG,CAAC,IAAe,CAO3B,GANI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAC9B,IAAI,CAAC,qBAAqB,CAAC,GACE,KAApB,EAAM,OAAO,IACtB,EAAM,KAAK,CAAC,iBAEd,IAAI,CAAC,kBAAkB,CAAC,GACpB,EAAM,GAAG,CAAC,IAEZ,OADA,EAAM,kBAAkB,EAAI,EACrB,CAAA,EAET,EAAM,KAAK,CAAC,qBACd,CACA,MAAO,CAAA,CACT,EAGA,GAAK,sBAAsB,CAAG,SAAS,CAAK,EAC1C,OACE,EAAM,GAAG,CAAC,KACV,IAAI,CAAC,kCAAkC,CAAC,IACxC,IAAI,CAAC,wBAAwB,CAAC,IAC9B,IAAI,CAAC,0BAA0B,CAAC,IAChC,IAAI,CAAC,wBAAwB,CAAC,IAC9B,IAAI,CAAC,iCAAiC,CAAC,IACvC,IAAI,CAAC,kCAAkC,CAAC,EAE5C,EAGA,GAAK,iCAAiC,CAAG,SAAS,CAAK,EAIrD,OAHI,IAAI,CAAC,0BAA0B,CAAC,EAAO,CAAA,IACzC,EAAM,KAAK,CAAC,qBAEP,CAAA,CACT,EAGA,GAAK,yBAAyB,CAAG,SAAS,CAAK,EAC7C,IAAI,EAAK,EAAM,OAAO,SACtB,EAAI,GAAkB,KACpB,EAAM,YAAY,CAAG,EACrB,EAAM,OAAO,GACN,CAAA,EAGX,EAcA,GAAK,2BAA2B,CAAG,SAAS,CAAK,EAG/C,IAFA,IAAI,EAAQ,EAAM,GAAG,CACjB,EAAK,EACF,AAA2B,KAA1B,CAAA,EAAK,EAAM,OAAO,EAAA,GAAc,CAAC,GAAkB,IACzD,EAAM,OAAO,GAEf,OAAO,EAAM,GAAG,GAAK,CACvB,EAGA,GAAK,kCAAkC,CAAG,SAAS,CAAK,EACtD,IAAI,EAAK,EAAM,OAAO,UACtB,AACS,KAAP,GACA,AAAO,KAAP,GACE,CAAA,CAAA,CAAA,GAAM,EAAA,IAAgB,CAAA,GAAM,EAAA,CAAA,GAC9B,AAAO,KAAP,GACA,AAAO,KAAP,GACA,AAAO,KAAP,GACA,AAAO,KAAP,GACA,AAAO,MAAP,IAEA,EAAM,OAAO,GACN,CAAA,EAGX,EAKA,GAAK,qBAAqB,CAAG,SAAS,CAAK,EACzC,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,IAAI,CAAC,mBAAmB,CAAC,GAAQ,CACqB,KAApD,EAAM,UAAU,CAAC,OAAO,CAAC,EAAM,eAAe,GAChD,EAAM,KAAK,CAAC,gCAEd,EAAM,UAAU,CAAC,IAAI,CAAC,EAAM,eAAe,EAC3C,MACF,CACA,EAAM,KAAK,CAAC,gBACd,CACF,EAKA,GAAK,mBAAmB,CAAG,SAAS,CAAK,EAEvC,GADA,EAAM,eAAe,CAAG,GACpB,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,IAAI,CAAC,8BAA8B,CAAC,IAAU,EAAM,GAAG,CAAC,IAC1D,MAAO,CAAA,EAET,EAAM,KAAK,CAAC,6BACd,CACA,MAAO,CAAA,CACT,EAMA,GAAK,8BAA8B,CAAG,SAAS,CAAK,EAElD,GADA,EAAM,eAAe,CAAG,GACpB,IAAI,CAAC,+BAA+B,CAAC,GAAQ,CAE/C,IADA,EAAM,eAAe,EAAI,GAAkB,EAAM,YAAY,EACtD,IAAI,CAAC,8BAA8B,CAAC,IACzC,EAAM,eAAe,EAAI,GAAkB,EAAM,YAAY,EAE/D,MAAO,CAAA,CACT,CACA,MAAO,CAAA,CACT,EAOA,GAAK,+BAA+B,CAAG,SAAS,CAAK,EACnD,IAgB+B,EAhB3B,EAAQ,EAAM,GAAG,CACjB,EAAS,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GACrC,EAAK,EAAM,OAAO,CAAC,SAMvB,CALA,EAAM,OAAO,CAAC,GAEH,KAAP,GAAuB,IAAI,CAAC,qCAAqC,CAAC,EAAO,IAC3E,CAAA,EAAK,EAAM,YAAY,AAAZ,EAWN,EADwB,EARH,EASC,CAAA,IAAS,AAAO,KAAP,GAAuB,AAAO,KAAP,IAR3D,EAAM,YAAY,CAAG,EACd,CAAA,IAGT,EAAM,GAAG,CAAG,EACL,CAAA,EACT,EAYA,GAAK,8BAA8B,CAAG,SAAS,CAAK,EAClD,IAgB8B,EAhB1B,EAAQ,EAAM,GAAG,CACjB,EAAS,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GACrC,EAAK,EAAM,OAAO,CAAC,SAMvB,CALA,EAAM,OAAO,CAAC,GAEH,KAAP,GAAuB,IAAI,CAAC,qCAAqC,CAAC,EAAO,IAC3E,CAAA,EAAK,EAAM,YAAY,AAAZ,EAWN,EADuB,EARH,EASC,CAAA,IAAS,AAAO,KAAP,GAAuB,AAAO,KAAP,GAAuB,AAAO,OAAP,GAA8B,AAAO,OAAP,IAR/G,EAAM,YAAY,CAAG,EACd,CAAA,IAGT,EAAM,GAAG,CAAG,EACL,CAAA,EACT,EAMA,GAAK,oBAAoB,CAAG,SAAS,CAAK,QACxC,EACE,CAAA,IAAI,CAAC,uBAAuB,CAAC,IAC7B,IAAI,CAAC,8BAA8B,CAAC,IACpC,IAAI,CAAC,yBAAyB,CAAC,IAC9B,EAAM,OAAO,EAAI,IAAI,CAAC,oBAAoB,CAAC,EAAA,IAI1C,EAAM,OAAO,GAES,KAApB,EAAM,OAAO,IACf,EAAM,KAAK,CAAC,0BAEd,EAAM,KAAK,CAAC,mBAEP,CAAA,EACT,EACA,GAAK,uBAAuB,CAAG,SAAS,CAAK,EAC3C,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,IAAI,CAAC,uBAAuB,CAAC,GAAQ,CACvC,IAAI,EAAI,EAAM,YAAY,CAC1B,GAAI,EAAM,OAAO,CAKf,OAHI,EAAI,EAAM,gBAAgB,EAC5B,CAAA,EAAM,gBAAgB,CAAG,CAAA,EAEpB,CAAA,EAET,GAAI,GAAK,EAAM,kBAAkB,CAC/B,MAAO,CAAA,CAET,CAAA,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EACA,GAAK,oBAAoB,CAAG,SAAS,CAAK,EACxC,GAAI,EAAM,GAAG,CAAC,KAAe,CAC3B,GAAI,IAAI,CAAC,mBAAmB,CAAC,GAE3B,OADA,EAAM,kBAAkB,CAAC,IAAI,CAAC,EAAM,eAAe,EAC5C,CAAA,EAET,EAAM,KAAK,CAAC,0BACd,CACA,MAAO,CAAA,CACT,EAGA,GAAK,yBAAyB,CAAG,SAAS,CAAK,EAC7C,OACE,IAAI,CAAC,uBAAuB,CAAC,IAC7B,IAAI,CAAC,wBAAwB,CAAC,IAC9B,IAAI,CAAC,cAAc,CAAC,IACpB,IAAI,CAAC,2BAA2B,CAAC,IACjC,IAAI,CAAC,qCAAqC,CAAC,EAAO,CAAA,IACjD,CAAC,EAAM,OAAO,EAAI,IAAI,CAAC,mCAAmC,CAAC,IAC5D,IAAI,CAAC,wBAAwB,CAAC,EAElC,EACA,GAAK,wBAAwB,CAAG,SAAS,CAAK,EAC5C,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,IAAI,CAAC,uBAAuB,CAAC,GAC/B,MAAO,CAAA,CAET,CAAA,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EACA,GAAK,cAAc,CAAG,SAAS,CAAK,QAClC,CAAI,CAAA,AAAoB,KAApB,EAAM,OAAO,IAAwB,GAAe,EAAM,SAAS,GAAA,IACrE,EAAM,YAAY,CAAG,EACrB,EAAM,OAAO,GACN,CAAA,EAGX,EAGA,GAAK,uBAAuB,CAAG,SAAS,CAAK,EAC3C,IAAI,EAAK,EAAM,OAAO,UACtB,AAAI,AAAO,MAAP,GACF,EAAM,YAAY,CAAG,EACrB,EAAM,OAAO,GACN,CAAA,GAEL,AAAO,MAAP,GACF,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GACN,CAAA,GAEL,AAAO,MAAP,GACF,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GACN,CAAA,GAEL,AAAO,MAAP,GACF,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GACN,CAAA,GAEE,MAAP,IACF,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GACN,CAAA,EAGX,EAGA,GAAK,uBAAuB,CAAG,SAAS,CAAK,EAC3C,IAAI,EAAK,EAAM,OAAO,SACtB,EAAI,GAAgB,KAClB,EAAM,YAAY,CAAG,EAAK,GAC1B,EAAM,OAAO,GACN,CAAA,EAGX,EASA,GAAK,qCAAqC,CAAG,SAAS,CAAK,CAAE,CAAM,EACjD,KAAK,IAAhB,GAAoB,CAAA,EAAS,CAAA,CAAlC,EAEA,IAAI,EAAQ,EAAM,GAAG,CACjB,EAAU,GAAU,EAAM,OAAO,CAErC,GAAI,EAAM,GAAG,CAAC,KAAe,CAC3B,GAAI,IAAI,CAAC,wBAAwB,CAAC,EAAO,GAAI,CAC3C,IAgCkB,EAhCd,EAAO,EAAM,YAAY,CAC7B,GAAI,GAAW,GAAQ,OAAU,GAAQ,MAAQ,CAC/C,IAAI,EAAmB,EAAM,GAAG,CAChC,GAAI,EAAM,GAAG,CAAC,KAAiB,EAAM,GAAG,CAAC,MAAiB,IAAI,CAAC,wBAAwB,CAAC,EAAO,GAAI,CACjG,IAAI,EAAQ,EAAM,YAAY,CAC9B,GAAI,GAAS,OAAU,GAAS,MAE9B,OADA,EAAM,YAAY,CAAG,AAAC,CAAA,EAAO,KAAA,EAAU,KAAS,CAAA,EAAQ,KAAA,EAAU,MAC3D,CAAA,CAEX,CACA,EAAM,GAAG,CAAG,EACZ,EAAM,YAAY,CAAG,CACvB,CACA,MAAO,CAAA,CACT,CACA,GACE,GACA,EAAM,GAAG,CAAC,MACV,IAAI,CAAC,mBAAmB,CAAC,IACzB,EAAM,GAAG,CAAC,MAcP,CADe,EAZH,EAAM,YAAY,GAaxB,GAAK,GAAM,QAXpB,MAAO,CAAA,EAEL,GACF,EAAM,KAAK,CAAC,0BAEd,EAAM,GAAG,CAAG,CACd,CAEA,MAAO,CAAA,CACT,EAMA,GAAK,wBAAwB,CAAG,SAAS,CAAK,EAC5C,GAAI,EAAM,OAAO,OACf,EAAI,IAAI,CAAC,yBAAyB,CAAC,MAG/B,EAAM,GAAG,CAAC,MACZ,EAAM,YAAY,CAAG,GACd,CAAA,GAKX,IAAI,EAAK,EAAM,OAAO,UACtB,AAAW,KAAP,GAAwB,CAAA,CAAC,EAAM,OAAO,EAAI,AAAO,MAAP,CAAO,IACnD,EAAM,YAAY,CAAG,EACrB,EAAM,OAAO,GACN,CAAA,EAIX,EAGA,GAAK,uBAAuB,CAAG,SAAS,CAAK,EAC3C,EAAM,YAAY,CAAG,EACrB,IAAI,EAAK,EAAM,OAAO,GACtB,GAAI,GAAM,IAAgB,GAAM,GAAc,CAC5C,GACE,EAAM,YAAY,CAAG,GAAK,EAAM,YAAY,CAAI,CAAA,EAAK,EAAA,EACrD,EAAM,OAAO,SACL,AAAA,CAAA,EAAK,EAAM,OAAO,EAAA,GAAO,IAAgB,GAAM,GAAa,AACtE,MAAO,CAAA,CACT,CACA,MAAO,CAAA,CACT,EAGA,GAAK,8BAA8B,CAAG,SAAS,CAAK,EAClD,IAAI,EAAK,EAAM,OAAO,GAEtB,GA2BE,AAAO,MA3BkB,GA4BzB,AAAO,KA5BkB,GA6BzB,AAAO,MA7BkB,GA8BzB,AAAO,KA9BkB,GA+BzB,AAAO,MA/BkB,GAgCzB,AAAO,KAhCkB,EAGzB,OAFA,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GACN,CAAA,EAGT,GACE,EAAM,OAAO,EACb,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC3B,CAAA,AAAO,KAAP,GAAuB,AAAO,MAAP,CAAO,EAC/B,CAGA,GAFA,EAAM,YAAY,CAAG,GACrB,EAAM,OAAO,GAEX,EAAM,GAAG,CAAC,MACV,IAAI,CAAC,wCAAwC,CAAC,IAC9C,EAAM,GAAG,CAAC,KAEV,MAAO,CAAA,EAET,EAAM,KAAK,CAAC,wBACd,CAEA,MAAO,CAAA,CACT,EAeA,GAAK,wCAAwC,CAAG,SAAS,CAAK,EAC5D,IAAI,EAAQ,EAAM,GAAG,CAGrB,GAAI,IAAI,CAAC,6BAA6B,CAAC,IAAU,EAAM,GAAG,CAAC,IAAe,CACxE,IAAI,EAAO,EAAM,eAAe,CAChC,GAAI,IAAI,CAAC,8BAA8B,CAAC,GAAQ,CAC9C,IAAI,EAAQ,EAAM,eAAe,CAEjC,OADA,IAAI,CAAC,0CAA0C,CAAC,EAAO,EAAM,GACtD,CAAA,CACT,CACF,CAIA,GAHA,EAAM,GAAG,CAAG,EAGR,IAAI,CAAC,wCAAwC,CAAC,GAAQ,CACxD,IAAI,EAAc,EAAM,eAAe,CAEvC,OADA,IAAI,CAAC,yCAAyC,CAAC,EAAO,GAC/C,CAAA,CACT,CACA,MAAO,CAAA,CACT,EACA,GAAK,0CAA0C,CAAG,SAAS,CAAK,CAAE,CAAI,CAAE,CAAK,EACtE,EAAI,EAAM,iBAAiB,CAAC,SAAS,CAAE,IACxC,EAAM,KAAK,CAAC,yBACX,EAAM,iBAAiB,CAAC,SAAS,CAAC,EAAK,CAAC,IAAI,CAAC,IAC9C,EAAM,KAAK,CAAC,yBAClB,EACA,GAAK,yCAAyC,CAAG,SAAS,CAAK,CAAE,CAAW,EACrE,EAAM,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,IACrC,EAAM,KAAK,CAAC,wBAClB,EAIA,GAAK,6BAA6B,CAAG,SAAS,CAAK,EACjD,IAAI,EAAK,EAET,IADA,EAAM,eAAe,CAAG,GACjB,GAA+B,EAAK,EAAM,OAAO,KACtD,EAAM,eAAe,EAAI,GAAkB,GAC3C,EAAM,OAAO,GAEf,MAAO,AAA0B,KAA1B,EAAM,eAAe,AAC9B,EAOA,GAAK,8BAA8B,CAAG,SAAS,CAAK,EAClD,IAQuC,EARnC,EAAK,EAET,IADA,EAAM,eAAe,CAAG,GAQjB,GADgC,EANA,EAAK,EAAM,OAAO,KAOZ,GAAe,IAN1D,EAAM,eAAe,EAAI,GAAkB,GAC3C,EAAM,OAAO,GAEf,MAAO,AAA0B,KAA1B,EAAM,eAAe,AAC9B,EAOA,GAAK,wCAAwC,CAAG,SAAS,CAAK,EAC5D,OAAO,IAAI,CAAC,8BAA8B,CAAC,EAC7C,EAGA,GAAK,wBAAwB,CAAG,SAAS,CAAK,EAC5C,GAAI,EAAM,GAAG,CAAC,IAAe,CAG3B,GAFA,EAAM,GAAG,CAAC,IACV,IAAI,CAAC,kBAAkB,CAAC,GACpB,EAAM,GAAG,CAAC,IACZ,MAAO,CAAA,EAGT,EAAM,KAAK,CAAC,+BACd,CACA,MAAO,CAAA,CACT,EAKA,GAAK,kBAAkB,CAAG,SAAS,CAAK,EACtC,KAAO,IAAI,CAAC,mBAAmB,CAAC,IAAQ,CACtC,IAAI,EAAO,EAAM,YAAY,CAC7B,GAAI,EAAM,GAAG,CAAC,KAAiB,IAAI,CAAC,mBAAmB,CAAC,GAAQ,CAC9D,IAAI,EAAQ,EAAM,YAAY,AAC1B,CAAA,EAAM,OAAO,EAAK,CAAA,AAAS,KAAT,GAAe,AAAU,KAAV,CAAU,GAC7C,EAAM,KAAK,CAAC,2BAED,KAAT,GAAe,AAAU,KAAV,GAAgB,EAAO,GACxC,EAAM,KAAK,CAAC,wCAEhB,CACF,CACF,EAIA,GAAK,mBAAmB,CAAG,SAAS,CAAK,EACvC,IAAI,EAAQ,EAAM,GAAG,CAErB,GAAI,EAAM,GAAG,CAAC,IAAe,CAC3B,GAAI,IAAI,CAAC,qBAAqB,CAAC,GAC7B,MAAO,CAAA,EAET,GAAI,EAAM,OAAO,CAAE,CAEjB,IAAI,EAAO,EAAM,OAAO,GACpB,CAAA,AAAS,KAAT,GAAyB,GAAa,EAAA,GACxC,EAAM,KAAK,CAAC,wBAEd,EAAM,KAAK,CAAC,iBACd,CACA,EAAM,GAAG,CAAG,CACd,CAEA,IAAI,EAAK,EAAM,OAAO,UACtB,AAAW,KAAP,IACF,EAAM,YAAY,CAAG,EACrB,EAAM,OAAO,GACN,CAAA,EAIX,EAGA,GAAK,qBAAqB,CAAG,SAAS,CAAK,EACzC,IAAI,EAAQ,EAAM,GAAG,CAErB,GAAI,EAAM,GAAG,CAAC,IAEZ,OADA,EAAM,YAAY,CAAG,EACd,CAAA,EAGT,GAAI,EAAM,OAAO,EAAI,EAAM,GAAG,CAAC,IAE7B,OADA,EAAM,YAAY,CAAG,GACd,CAAA,EAGT,GAAI,CAAC,EAAM,OAAO,EAAI,EAAM,GAAG,CAAC,IAAe,CAC7C,GAAI,IAAI,CAAC,4BAA4B,CAAC,GACpC,MAAO,CAAA,CAET,CAAA,EAAM,GAAG,CAAG,CACd,CAEA,OACE,IAAI,CAAC,8BAA8B,CAAC,IACpC,IAAI,CAAC,yBAAyB,CAAC,EAEnC,EAGA,GAAK,4BAA4B,CAAG,SAAS,CAAK,EAChD,IAAI,EAAK,EAAM,OAAO,SACtB,AAAI,CAAA,EAAA,GAAe,IAAO,AAAO,KAAP,CAAO,IAC/B,EAAM,YAAY,CAAG,EAAK,GAC1B,EAAM,OAAO,GACN,CAAA,EAGX,EAGA,GAAK,2BAA2B,CAAG,SAAS,CAAK,EAC/C,IAAI,EAAQ,EAAM,GAAG,CACrB,GAAI,EAAM,GAAG,CAAC,KAAe,CAC3B,GAAI,IAAI,CAAC,wBAAwB,CAAC,EAAO,GACvC,MAAO,CAAA,CAEL,CAAA,EAAM,OAAO,EACf,EAAM,KAAK,CAAC,kBAEd,EAAM,GAAG,CAAG,CACd,CACA,MAAO,CAAA,CACT,EAGA,GAAK,uBAAuB,CAAG,SAAS,CAAK,EAC3C,IAAI,EAAQ,EAAM,GAAG,CACjB,EAAK,EAET,IADA,EAAM,YAAY,CAAG,EACd,GAAe,EAAK,EAAM,OAAO,KACtC,EAAM,YAAY,CAAG,GAAK,EAAM,YAAY,CAAI,CAAA,EAAK,EAAA,EACrD,EAAM,OAAO,GAEf,OAAO,EAAM,GAAG,GAAK,CACvB,EAMA,GAAK,mBAAmB,CAAG,SAAS,CAAK,EACvC,IAAI,EAAQ,EAAM,GAAG,CACjB,EAAK,EAET,IADA,EAAM,YAAY,CAAG,EACd,GAAW,EAAK,EAAM,OAAO,KAClC,EAAM,YAAY,CAAG,GAAK,EAAM,YAAY,CAAG,GAAS,GACxD,EAAM,OAAO,GAEf,OAAO,EAAM,GAAG,GAAK,CACvB,EAoBA,GAAK,mCAAmC,CAAG,SAAS,CAAK,EACvD,GAAI,IAAI,CAAC,oBAAoB,CAAC,GAAQ,CACpC,IAAI,EAAK,EAAM,YAAY,CAC3B,GAAI,IAAI,CAAC,oBAAoB,CAAC,GAAQ,CACpC,IAAI,EAAK,EAAM,YAAY,AACvB,CAAA,GAAM,GAAK,IAAI,CAAC,oBAAoB,CAAC,GACvC,EAAM,YAAY,CAAG,AAAK,GAAL,EAAU,AAAK,EAAL,EAAS,EAAM,YAAY,CAE1D,EAAM,YAAY,CAAG,AAAK,EAAL,EAAS,CAElC,MACE,EAAM,YAAY,CAAG,EAEvB,MAAO,CAAA,CACT,CACA,MAAO,CAAA,CACT,EAGA,GAAK,oBAAoB,CAAG,SAAS,CAAK,EACxC,IAAI,EAAK,EAAM,OAAO,UACtB,AAAI,GAAa,IACf,EAAM,YAAY,CAAG,EAAK,GAC1B,EAAM,OAAO,GACN,CAAA,IAET,EAAM,YAAY,CAAG,EACd,CAAA,EACT,EAQA,GAAK,wBAAwB,CAAG,SAAS,CAAK,CAAE,CAAM,EACpD,IAAI,EAAQ,EAAM,GAAG,AACrB,CAAA,EAAM,YAAY,CAAG,EACrB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC/B,IAAI,EAAK,EAAM,OAAO,GACtB,GAAI,CAAC,GAAW,GAEd,OADA,EAAM,GAAG,CAAG,EACL,CAAA,CAET,CAAA,EAAM,YAAY,CAAG,GAAK,EAAM,YAAY,CAAG,GAAS,GACxD,EAAM,OAAO,EACf,CACA,MAAO,CAAA,CACT,EAMA,IAAI,GAAQ,SAAe,CAAC,EAC1B,IAAI,CAAC,IAAI,CAAG,EAAE,IAAI,CAClB,IAAI,CAAC,KAAK,CAAG,EAAE,KAAK,CACpB,IAAI,CAAC,KAAK,CAAG,EAAE,KAAK,CACpB,IAAI,CAAC,GAAG,CAAG,EAAE,GAAG,CACZ,EAAE,OAAO,CAAC,SAAS,EACnB,CAAA,IAAI,CAAC,GAAG,CAAG,IAAI,EAAe,EAAG,EAAE,QAAQ,CAAE,EAAE,MAAM,CAAA,EACrD,EAAE,OAAO,CAAC,MAAM,EAChB,CAAA,IAAI,CAAC,KAAK,CAAG,CAAC,EAAE,KAAK,CAAE,EAAE,GAAG,CAAC,AAAA,CACnC,EAII,GAAO,EAAO,SAAS,CA6c3B,SAAS,GAAe,CAAG,QACzB,AAAI,AAAkB,YAAlB,OAAO,OACF,KAIF,OAAO,EAAI,OAAO,CAAC,KAAM,IAClC,CA8DA,SAAS,GAAoB,CAAI,SAE/B,AAAI,GAAQ,MAAiB,OAAO,YAAY,CAAC,GAE1C,OAAO,YAAY,CAAC,AAAC,CAAA,AAD5B,CAAA,GAAQ,KAAR,GACoC,EAAA,EAAM,MAAQ,AAAC,CAAA,AAAO,KAAP,CAAO,EAAQ,MACpE,CAnhBA,GAAK,IAAI,CAAG,SAAS,CAA6B,EAC5C,CAAC,GAAiC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAI,IAAI,CAAC,WAAW,EACvE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAE,8BAAgC,IAAI,CAAC,IAAI,CAAC,OAAO,EACnF,IAAI,CAAC,OAAO,CAAC,OAAO,EACpB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,GAAM,IAAI,GAEvC,IAAI,CAAC,UAAU,CAAG,IAAI,CAAC,GAAG,CAC1B,IAAI,CAAC,YAAY,CAAG,IAAI,CAAC,KAAK,CAC9B,IAAI,CAAC,aAAa,CAAG,IAAI,CAAC,MAAM,CAChC,IAAI,CAAC,eAAe,CAAG,IAAI,CAAC,QAAQ,CACpC,IAAI,CAAC,SAAS,EAChB,EAEA,GAAK,QAAQ,CAAG,WAEd,OADA,IAAI,CAAC,IAAI,GACF,IAAI,GAAM,IAAI,CACvB,EAGsB,aAAlB,OAAO,QACP,CAAA,EAAI,CAAC,OAAO,QAAQ,CAAC,CAAG,WACxB,IAAI,EAAS,IAAI,CAEjB,MAAO,CACL,KAAM,WACJ,IAAI,EAAQ,EAAO,QAAQ,GAC3B,MAAO,CACL,KAAM,EAAM,IAAI,GAAK,EAAM,GAAG,CAC9B,MAAO,CACT,CACF,CACF,CACF,CAAA,EAKF,GAAK,UAAU,CAAG,WAChB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAG,EAAE,AAC9C,EAKA,GAAK,SAAS,CAAG,WACf,IAAI,EAAa,IAAI,CAAC,UAAU,SAKhC,CAJK,GAAe,EAAW,aAAa,EAAI,IAAI,CAAC,SAAS,GAE9D,IAAI,CAAC,KAAK,CAAG,IAAI,CAAC,GAAG,CACjB,IAAI,CAAC,OAAO,CAAC,SAAS,EAAI,CAAA,IAAI,CAAC,QAAQ,CAAG,IAAI,CAAC,WAAW,EAA9D,EACI,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAW,IAAI,CAAC,WAAW,CAAC,EAAM,GAAG,EAElE,EAAW,QAAQ,CAAW,EAAW,QAAQ,CAAC,IAAI,OACnD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,GAC9C,EAEA,GAAK,SAAS,CAAG,SAAS,CAAI,SAG5B,AAAI,EAAkB,EAAM,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAAM,AAAS,KAAT,EACnD,IAAI,CAAC,QAAQ,GAEjB,IAAI,CAAC,gBAAgB,CAAC,EAC/B,EAEA,GAAK,iBAAiB,CAAG,WACvB,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,SACzC,AAAI,GAAQ,OAAU,GAAQ,MAAiB,EAEvC,AAAA,CAAA,GAAQ,EAAA,EADL,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GACf,QAC/B,EAEA,GAAK,gBAAgB,CAAG,WACtB,IAMM,EANF,EAAW,IAAI,CAAC,OAAO,CAAC,SAAS,EAAI,IAAI,CAAC,WAAW,GACrD,EAAQ,IAAI,CAAC,GAAG,CAAE,EAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAM,IAAI,CAAC,GAAG,EAAI,GAGjE,GAFY,KAAR,GAAc,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAG,EAAG,wBAC3C,IAAI,CAAC,GAAG,CAAG,EAAM,EACb,IAAI,CAAC,OAAO,CAAC,SAAS,CAGxB,IAFA,EAAW,SAAS,CAAG,EAEf,AAAA,CAAA,EAAQ,EAAW,IAAI,CAAC,IAAI,CAAC,KAAK,CAAA,GAAM,EAAM,KAAK,CAAG,IAAI,CAAC,GAAG,EACpE,EAAE,IAAI,CAAC,OAAO,CACd,IAAI,CAAC,SAAS,CAAG,EAAM,KAAK,CAAG,CAAK,CAAC,EAAE,CAAC,MAAM,AAG9C,CAAA,IAAI,CAAC,OAAO,CAAC,SAAS,EACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA,EAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAQ,EAAG,GAAM,EAAO,IAAI,CAAC,GAAG,CACzD,EAAU,IAAI,CAAC,WAAW,GACrD,EAEA,GAAK,eAAe,CAAG,SAAS,CAAS,EAIvC,IAHA,IAAI,EAAQ,IAAI,CAAC,GAAG,CAChB,EAAW,IAAI,CAAC,OAAO,CAAC,SAAS,EAAI,IAAI,CAAC,WAAW,GACrD,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAI,GACpC,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,CAAC,EAAU,IAChD,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,CAEnC,CAAA,IAAI,CAAC,OAAO,CAAC,SAAS,EACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA,EAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAQ,EAAW,IAAI,CAAC,GAAG,EAAG,EAAO,IAAI,CAAC,GAAG,CACvE,EAAU,IAAI,CAAC,WAAW,GACrD,EAKA,GAAK,SAAS,CAAG,WACf,EAAM,KAAO,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CACzC,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EACvC,OAAQ,GACR,KAAK,GAAI,KAAK,IACZ,EAAE,IAAI,CAAC,GAAG,CACV,KACF,MAAK,GACyC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IACnC,EAAE,IAAI,CAAC,GAAG,AAEd,MAAK,GAAI,KAAK,KAAM,KAAK,KACvB,EAAE,IAAI,CAAC,GAAG,CACN,IAAI,CAAC,OAAO,CAAC,SAAS,GACxB,EAAE,IAAI,CAAC,OAAO,CACd,IAAI,CAAC,SAAS,CAAG,IAAI,CAAC,GAAG,EAE3B,KACF,MAAK,GACH,OAAQ,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IACzC,KAAK,GACH,IAAI,CAAC,gBAAgB,GACrB,KACF,MAAK,GACH,IAAI,CAAC,eAAe,CAAC,GACrB,KACF,SACE,MAAM,CACR,CACA,KACF,SACE,GAAI,EAAK,GAAK,EAAK,IAAM,GAAM,MAAQ,EAAmB,IAAI,CAAC,OAAO,YAAY,CAAC,IACjF,EAAE,IAAI,CAAC,GAAG,MAEV,MAAM,CAEV,CACF,CACF,EAOA,GAAK,WAAW,CAAG,SAAS,CAAI,CAAE,CAAG,EACnC,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,GAAG,CACf,IAAI,CAAC,OAAO,CAAC,SAAS,EAAI,CAAA,IAAI,CAAC,MAAM,CAAG,IAAI,CAAC,WAAW,EAA5D,EACA,IAAI,EAAW,IAAI,CAAC,IAAI,AACxB,CAAA,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,KAAK,CAAG,EAEb,IAAI,CAAC,aAAa,CAAC,EACrB,EAWA,GAAK,aAAa,CAAG,WACnB,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAC5C,GAAI,GAAQ,IAAM,GAAQ,GAAM,OAAO,IAAI,CAAC,UAAU,CAAC,CAAA,GACvD,IAAI,EAAQ,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,UAC7C,AAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,AAAS,KAAT,GAAe,AAAU,KAAV,GAClD,IAAI,CAAC,GAAG,EAAI,EACL,IAAI,CAAC,WAAW,CAAC,EAAM,QAAQ,IAEtC,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAM,GAAG,EAErC,EAEA,GAAK,eAAe,CAAG,WACrB,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,UAC5C,AAAI,IAAI,CAAC,WAAW,EAAI,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,UAAU,IACtD,AAAS,KAAT,EAAsB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAC/C,IAAI,CAAC,QAAQ,CAAC,EAAM,KAAK,CAAE,EACpC,EAEA,GAAK,yBAAyB,CAAG,SAAS,CAAI,EAC5C,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GACxC,EAAO,EACP,EAAY,AAAS,KAAT,EAAc,EAAM,IAAI,CAAG,EAAM,MAAM,OASvD,CANI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAAK,AAAS,KAAT,GAAe,AAAS,KAAT,IAClD,EAAE,EACF,EAAY,EAAM,QAAQ,CAC1B,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IAGtC,AAAS,KAAT,GAAsB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,EAAO,GACtD,IAAI,CAAC,QAAQ,CAAC,EAAW,EAClC,EAEA,GAAK,kBAAkB,CAAG,SAAS,CAAI,EACrC,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,UAC5C,AAAI,IAAS,EACX,AAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAE1B,AAAU,KADF,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAClB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAElD,IAAI,CAAC,QAAQ,CAAC,AAAS,MAAT,EAAe,EAAM,SAAS,CAAG,EAAM,UAAU,CAAE,GAE1E,AAAI,AAAS,KAAT,EAAsB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAC/C,IAAI,CAAC,QAAQ,CAAC,AAAS,MAAT,EAAe,EAAM,SAAS,CAAG,EAAM,UAAU,CAAE,EAC1E,EAEA,GAAK,eAAe,CAAG,kBAErB,AAAI,AAAS,KADF,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAClB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAC/C,IAAI,CAAC,QAAQ,CAAC,EAAM,UAAU,CAAE,EACzC,EAEA,GAAK,kBAAkB,CAAG,SAAS,CAAI,EACrC,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,UAC5C,AAAI,IAAS,EACX,AAAI,AAAS,KAAT,GAAe,CAAC,IAAI,CAAC,QAAQ,EAAI,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IACjE,CAAA,AAAoB,IAApB,IAAI,CAAC,UAAU,EAAU,EAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,GAAG,EAAA,GAErF,IAAI,CAAC,eAAe,CAAC,GACrB,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,SAAS,IAEhB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAErC,AAAI,AAAS,KAAT,EAAsB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAC/C,IAAI,CAAC,QAAQ,CAAC,EAAM,OAAO,CAAE,EACtC,EAEA,GAAK,eAAe,CAAG,SAAS,CAAI,EAClC,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GACxC,EAAO,SACX,AAAI,IAAS,EAEX,CADA,EAAO,AAAS,KAAT,GAAe,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAAY,EAAI,EACnE,AAA2C,KAA3C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IAAuB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,EAAO,GACxF,IAAI,CAAC,QAAQ,CAAC,EAAM,QAAQ,CAAE,GAEvC,AAAI,AAAS,KAAT,GAAe,AAAS,KAAT,GAAgB,IAAI,CAAC,QAAQ,EAAI,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IACjF,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IAMxB,KAAT,GAAe,CAAA,EAAO,CAAA,EACnB,IAAI,CAAC,QAAQ,CAAC,EAAM,UAAU,CAAE,KALrC,IAAI,CAAC,eAAe,CAAC,GACrB,IAAI,CAAC,SAAS,GACP,IAAI,CAAC,SAAS,GAIzB,EAEA,GAAK,iBAAiB,CAAG,SAAS,CAAI,EACpC,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,UAC5C,AAAI,AAAS,KAAT,EAAsB,IAAI,CAAC,QAAQ,CAAC,EAAM,QAAQ,CAAE,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAAY,EAAI,GACrG,AAAS,KAAT,GAAe,AAAS,KAAT,GAAe,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,GAC5D,IAAI,CAAC,GAAG,EAAI,EACL,IAAI,CAAC,WAAW,CAAC,EAAM,KAAK,GAE9B,IAAI,CAAC,QAAQ,CAAC,AAAS,KAAT,EAAc,EAAM,EAAE,CAAG,EAAM,MAAM,CAAE,EAC9D,EAEA,GAAK,kBAAkB,CAAG,WACxB,IAAI,EAAc,IAAI,CAAC,OAAO,CAAC,WAAW,CAC1C,GAAI,GAAe,GAAI,CACrB,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAC5C,GAAI,AAAS,KAAT,EAAa,CACf,IAAI,EAAQ,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAC7C,GAAI,EAAQ,IAAM,EAAQ,GAAM,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAM,WAAW,CAAE,EAC1E,CACA,GAAI,AAAS,KAAT,SACF,AAAI,GAAe,IAEb,AAAY,KADF,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAClB,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,GAEpD,IAAI,CAAC,QAAQ,CAAC,EAAM,QAAQ,CAAE,EAEzC,CACA,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAM,QAAQ,CAAE,EACvC,EAEA,GAAK,gBAAgB,CAAG,SAAS,CAAI,EACnC,OAAQ,GAGR,KAAK,GACH,OAAO,IAAI,CAAC,aAAa,EAG3B,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CACzD,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CACzD,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,IAAI,CACvD,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,KAAK,CACxD,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,QAAQ,CAC3D,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,QAAQ,CAC3D,MAAK,IAAiB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CAC1D,MAAK,IAAiB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CAC1D,MAAK,GAAgB,MAAZ,EAAE,IAAI,CAAC,GAAG,CAAS,IAAI,CAAC,WAAW,CAAC,EAAM,KAAK,CAExD,MAAK,GACH,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,EAAK,MAEpC,MADA,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAM,SAAS,CAEzC,MAAK,GACH,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAC5C,GAAI,AAAS,MAAT,GAAgB,AAAS,KAAT,EAAe,OAAO,IAAI,CAAC,eAAe,CAAC,IAC/D,GAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAAG,CACjC,GAAI,AAAS,MAAT,GAAgB,AAAS,KAAT,EAAe,OAAO,IAAI,CAAC,eAAe,CAAC,GAC/D,GAAI,AAAS,KAAT,GAAe,AAAS,KAAT,EAAe,OAAO,IAAI,CAAC,eAAe,CAAC,EAChE,CAIF,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAAI,KAAK,GAC3E,OAAO,IAAI,CAAC,UAAU,CAAC,CAAA,EAGzB,MAAK,GAAI,KAAK,GACZ,OAAO,IAAI,CAAC,UAAU,CAAC,EAOzB,MAAK,GACH,OAAO,IAAI,CAAC,eAAe,EAE7B,MAAK,GAAI,KAAK,GACZ,OAAO,IAAI,CAAC,yBAAyB,CAAC,EAExC,MAAK,IAAK,KAAK,GACb,OAAO,IAAI,CAAC,kBAAkB,CAAC,EAEjC,MAAK,GACH,OAAO,IAAI,CAAC,eAAe,EAE7B,MAAK,GAAI,KAAK,GACZ,OAAO,IAAI,CAAC,kBAAkB,CAAC,EAEjC,MAAK,GAAI,KAAK,GACZ,OAAO,IAAI,CAAC,eAAe,CAAC,EAE9B,MAAK,GAAI,KAAK,GACZ,OAAO,IAAI,CAAC,iBAAiB,CAAC,EAEhC,MAAK,GACH,OAAO,IAAI,CAAC,kBAAkB,EAEhC,MAAK,IACH,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAM,MAAM,CAAE,EACrC,CAEA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,yBAA2B,GAAoB,GAAQ,IAC9E,EAEA,GAAK,QAAQ,CAAG,SAAS,CAAI,CAAE,CAAI,EACjC,IAAI,EAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,IAAI,CAAC,GAAG,CAAG,GAEhD,OADA,IAAI,CAAC,GAAG,EAAI,EACL,IAAI,CAAC,WAAW,CAAC,EAAM,EAChC,EAEA,GAAK,UAAU,CAAG,WAEhB,IADA,IAAI,EAAS,EAAS,EAAQ,IAAI,CAAC,GAAG,GAC7B,CACH,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,EAAO,mCACvD,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAEnC,GADI,EAAU,IAAI,CAAC,IAAO,IAAI,CAAC,KAAK,CAAC,EAAO,mCACvC,EAKI,EAAU,CAAA,MALL,CACZ,GAAI,AAAO,MAAP,EAAc,EAAU,CAAA,OACvB,GAAI,AAAO,MAAP,GAAc,EAAW,EAAU,CAAA,OACvC,GAAI,AAAO,MAAP,GAAc,CAAC,EAAW,MACnC,EAAU,AAAO,OAAP,CACZ,CACA,EAAE,IAAI,CAAC,GAAG,AACZ,CACA,IAAI,EAAU,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,CAC9C,GAAE,IAAI,CAAC,GAAG,CACV,IAAI,EAAa,IAAI,CAAC,GAAG,CACrB,EAAQ,IAAI,CAAC,SAAS,EACtB,CAAA,IAAI,CAAC,WAAW,EAAI,IAAI,CAAC,UAAU,CAAC,GAGxC,IAAI,EAAQ,IAAI,CAAC,WAAW,EAAK,CAAA,IAAI,CAAC,WAAW,CAAG,IAAI,GAAsB,IAAI,CAAA,EAClF,EAAM,KAAK,CAAC,EAAO,EAAS,GAC5B,IAAI,CAAC,mBAAmB,CAAC,GACzB,IAAI,CAAC,qBAAqB,CAAC,GAG3B,IAAI,EAAQ,KACZ,GAAI,CACF,EAAQ,IAAI,OAAO,EAAS,EAC9B,CAAE,MAAO,EAAG,CAGZ,CAEA,OAAO,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CAAE,CAAC,QAAS,EAAS,MAAO,EAAO,MAAO,CAAK,EACrF,EAMA,GAAK,OAAO,CAAG,SAAS,CAAK,CAAE,CAAG,CAAE,CAA8B,EAUhE,IAAK,IARD,EAAkB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAAM,AAAQ,KAAA,IAAR,EAKpD,EAA8B,GAAkC,AAAoC,KAApC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAE9F,EAAQ,IAAI,CAAC,GAAG,CAAE,EAAQ,EAAG,EAAW,EACnC,EAAI,EAAG,EAAI,AAAO,MAAP,EAAc,IAAW,EAAK,EAAI,EAAG,EAAE,EAAG,EAAE,IAAI,CAAC,GAAG,CAAE,CACxE,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAG,EAAO,KAAK,EAExD,GAAI,GAAmB,AAAS,KAAT,EAAa,CAC9B,GAA+B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAE,qEAClD,KAAb,GAAmB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAE,oDAC7C,IAAN,GAAW,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAE,2DAC/C,EAAW,EACX,QACF,CAMA,GAAI,CAJc,EAAd,GAAQ,GAAY,EAAO,GAAK,GAC3B,GAAQ,GAAY,EAAO,GAAK,GAChC,GAAQ,IAAM,GAAQ,GAAY,EAAO,GACrC,MACF,EAAS,MACpB,EAAW,EACX,EAAQ,EAAQ,EAAQ,CAC1B,OAGA,CADI,GAAmB,AAAa,KAAb,GAAmB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAG,EAAG,0DAC1E,IAAI,CAAC,GAAG,GAAK,GAAS,AAAO,MAAP,GAAe,IAAI,CAAC,GAAG,CAAG,IAAU,GAAc,KAErE,CACT,EAoBA,GAAK,eAAe,CAAG,SAAS,CAAK,EACnC,IAAI,EAAQ,IAAI,CAAC,GAAG,AACpB,CAAA,IAAI,CAAC,GAAG,EAAI,EACZ,IAAI,EAAM,IAAI,CAAC,OAAO,CAAC,GAMvB,OALW,MAAP,GAAe,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAG,EAAG,4BAA8B,GACxE,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAAM,AAAoC,MAApC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAClE,EAAM,GAAe,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,GACrD,EAAE,IAAI,CAAC,GAAG,EACD,EAAkB,IAAI,CAAC,iBAAiB,KAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,oCACxE,IAAI,CAAC,WAAW,CAAC,EAAM,GAAG,CAAE,EACrC,EAIA,GAAK,UAAU,CAAG,SAAS,CAAa,EACtC,IAjCsB,EAiClB,EAAQ,IAAI,CAAC,GAAG,CACf,GAAiB,AAAsC,OAAtC,IAAI,CAAC,OAAO,CAAC,GAAI,KAAA,EAAW,CAAA,IAAkB,IAAI,CAAC,KAAK,CAAC,EAAO,kBACtF,IAAI,EAAQ,IAAI,CAAC,GAAG,CAAG,GAAS,GAAK,AAAiC,KAAjC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GACvD,GAAS,IAAI,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,EAAO,kBAC9C,IAAI,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EACzC,GAAI,CAAC,GAAS,CAAC,GAAiB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,IAAM,AAAS,MAAT,EAAc,CAC9E,IAAI,EAAQ,GAAe,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,GAG3D,MAFA,EAAE,IAAI,CAAC,GAAG,CACN,EAAkB,IAAI,CAAC,iBAAiB,KAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,oCACjE,IAAI,CAAC,WAAW,CAAC,EAAM,GAAG,CAAE,EACrC,CACI,GAAS,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,IAAM,CAAA,EAAQ,CAAA,CAAvE,EACa,KAAT,GAAgB,IAClB,EAAE,IAAI,CAAC,GAAG,CACV,IAAI,CAAC,OAAO,CAAC,IACb,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAEzB,KAAT,GAAe,AAAS,MAAT,GAAkB,IAEhC,CAAA,AAAS,KADb,CAAA,EAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,CAAA,GACpB,AAAS,KAAT,CAAS,GAAM,EAAE,IAAI,CAAC,GAAG,CACnB,OAArB,IAAI,CAAC,OAAO,CAAC,KAAgB,IAAI,CAAC,KAAK,CAAC,EAAO,mBAEjD,EAAkB,IAAI,CAAC,iBAAiB,KAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,oCAExE,IAAI,GAzDkB,EAyDG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,EAxDzD,AAwD4D,EAvDnD,SAAS,EAAK,GAIhB,WAAW,EAAI,OAAO,CAAC,KAAM,MAoDpC,OAAO,IAAI,CAAC,WAAW,CAAC,EAAM,GAAG,CAAE,EACrC,EAIA,GAAK,aAAa,CAAG,WACnB,IAA0C,EAE1C,GAAI,AAAO,MAFF,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAEvB,CACV,IAAI,CAAC,OAAO,CAAC,WAAW,CAAG,GAAK,IAAI,CAAC,UAAU,GACnD,IAAI,EAAU,EAAE,IAAI,CAAC,GAAG,CACxB,EAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAK,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,GAAG,EACpE,EAAE,IAAI,CAAC,GAAG,CACN,EAAO,SAAY,IAAI,CAAC,kBAAkB,CAAC,EAAS,2BAC1D,MACE,EAAO,IAAI,CAAC,WAAW,CAAC,GAE1B,OAAO,CACT,EASA,GAAK,UAAU,CAAG,SAAS,CAAK,EAE9B,IADA,IAAI,EAAM,GAAI,EAAa,EAAE,IAAI,CAAC,GAAG,GAC5B,CACH,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,gCAC5D,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EACvC,GAAI,IAAO,EAAS,KAChB,AAAO,CAAA,KAAP,GAEF,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,eAAe,CAAC,CAAA,GAC5B,EAAa,IAAI,CAAC,GAAG,GAEjB,EAAU,EAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,KAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,gCAC5E,EAAE,IAAI,CAAC,GAAG,CAEd,CAEA,OADA,GAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,IACrC,IAAI,CAAC,WAAW,CAAC,EAAM,MAAM,CAAE,EACxC,EAIA,IAAI,GAAgC,CAAC,CAErC,CAAA,GAAK,oBAAoB,CAAG,WAC1B,IAAI,CAAC,iBAAiB,CAAG,CAAA,EACzB,GAAI,CACF,IAAI,CAAC,aAAa,EACpB,CAAE,MAAO,EAAK,CACZ,GAAI,IAAQ,GACV,IAAI,CAAC,wBAAwB,QAE7B,MAAM,CAEV,CAEA,IAAI,CAAC,iBAAiB,CAAG,CAAA,CAC3B,EAEA,GAAK,kBAAkB,CAAG,SAAS,CAAQ,CAAE,CAAO,EAClD,GAAI,IAAI,CAAC,iBAAiB,EAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EACxD,MAAM,GAEN,IAAI,CAAC,KAAK,CAAC,EAAU,EAEzB,EAEA,GAAK,aAAa,CAAG,WAEnB,IADA,IAAI,EAAM,GAAI,EAAa,IAAI,CAAC,GAAG,GAC1B,CACH,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,yBAC5D,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EACvC,GAAI,AAAO,KAAP,GAAa,AAAO,KAAP,GAAa,AAAwC,MAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,GAAY,CACzE,GAAI,IAAI,CAAC,GAAG,GAAK,IAAI,CAAC,KAAK,EAAK,CAAA,IAAI,CAAC,IAAI,GAAK,EAAM,QAAQ,EAAI,IAAI,CAAC,IAAI,GAAK,EAAM,eAAc,AAAd,EAApF,CACE,GAAI,AAAO,KAAP,EAEF,OADA,IAAI,CAAC,GAAG,EAAI,EACL,IAAI,CAAC,WAAW,CAAC,EAAM,YAAY,EAG1C,MADA,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAM,SAAS,C,CAI3C,OADA,GAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,WAAW,CAAC,EAAM,QAAQ,CAAE,EAC1C,CACA,GAAI,AAAO,KAAP,EAEF,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,eAAe,CAAC,CAAA,GAC5B,EAAa,IAAI,CAAC,GAAG,MAChB,GAAI,EAAU,GAAK,CAGxB,OAFA,GAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EAC5C,EAAE,IAAI,CAAC,GAAG,CACF,GACR,KAAK,GACqC,KAApC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAY,EAAE,IAAI,CAAC,GAAG,AAC1D,MAAK,GACH,GAAO,KACP,KACF,SACE,GAAO,OAAO,YAAY,CAAC,EAE7B,CACI,IAAI,CAAC,OAAO,CAAC,SAAS,GACxB,EAAE,IAAI,CAAC,OAAO,CACd,IAAI,CAAC,SAAS,CAAG,IAAI,CAAC,GAAG,EAE3B,EAAa,IAAI,CAAC,GAAG,AACvB,KACE,EAAE,IAAI,CAAC,GAAG,AAEd,CACF,EAGA,GAAK,wBAAwB,CAAG,WAC9B,KAAO,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAE,IAAI,CAAC,GAAG,GAC3C,OAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAC5B,IAAK,KACH,EAAE,IAAI,CAAC,GAAG,CACV,KAEF,KAAK,IACH,GAAI,AAA6B,MAA7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAG,EAAE,CAC1B,KAIJ,KAAK,IACH,OAAO,IAAI,CAAC,WAAW,CAAC,EAAM,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,GAAG,EAGtF,CAEF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,wBACzB,EAIA,GAAK,eAAe,CAAG,SAAS,CAAU,EACxC,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,EAEzC,OADA,EAAE,IAAI,CAAC,GAAG,CACF,GACR,KAAK,IAAK,MAAO,IACjB,MAAK,IAAK,MAAO,IACjB,MAAK,IAAK,OAAO,OAAO,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,GACtD,MAAK,IAAK,OAAO,GAAoB,IAAI,CAAC,aAAa,GACvD,MAAK,IAAK,MAAO,GACjB,MAAK,GAAI,MAAO,IAChB,MAAK,IAAK,MAAO,IACjB,MAAK,IAAK,MAAO,IACjB,MAAK,GAA4C,KAApC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAY,EAAE,IAAI,CAAC,GAAG,AACjE,MAAK,GAEH,OADI,IAAI,CAAC,OAAO,CAAC,SAAS,GAAI,IAAI,CAAC,SAAS,CAAG,IAAI,CAAC,GAAG,CAAE,EAAE,IAAI,CAAC,OAAO,EAChE,EACT,MAAK,GACL,KAAK,GACH,GAAI,EAAY,CACd,IAAI,EAAU,IAAI,CAAC,GAAG,CAAG,EAOzB,OALA,IAAI,CAAC,kBAAkB,CACrB,EACA,8CAGK,IACT,CACF,QACE,GAAI,GAAM,IAAM,GAAM,GAAI,CACxB,IAAI,EAAW,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAG,EAAG,GAAG,KAAK,CAAC,UAAU,CAAC,EAAE,CACjE,EAAQ,SAAS,EAAU,GAe/B,OAdI,EAAQ,KAEV,CAAA,EAAQ,SADR,EAAW,EAAS,KAAK,CAAC,EAAG,IACF,EAA3B,EAEF,IAAI,CAAC,GAAG,EAAI,EAAS,MAAM,CAAG,EAC9B,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAC9B,CAAA,AAAa,MAAb,GAAoB,AAAO,KAAP,GAAa,AAAO,KAAP,CAAO,GAAQ,CAAA,IAAI,CAAC,MAAM,EAAI,CAAA,GAClE,IAAI,CAAC,kBAAkB,CACrB,IAAI,CAAC,GAAG,CAAG,EAAI,EAAS,MAAM,CAC9B,EACI,mCACA,gCAGD,OAAO,YAAY,CAAC,EAC7B,CACA,GAAI,EAAU,GAGZ,MAAO,GAET,OAAO,OAAO,YAAY,CAAC,EAC7B,CACF,EAIA,GAAK,WAAW,CAAG,SAAS,CAAG,EAC7B,IAAI,EAAU,IAAI,CAAC,GAAG,CAClB,EAAI,IAAI,CAAC,OAAO,CAAC,GAAI,GAEzB,OADU,OAAN,GAAc,IAAI,CAAC,kBAAkB,CAAC,EAAS,iCAC5C,CACT,EAQA,GAAK,SAAS,CAAG,WACf,IAAI,CAAC,WAAW,CAAG,CAAA,EAGnB,IAFA,IAAI,EAAO,GAAI,EAAQ,CAAA,EAAM,EAAa,IAAI,CAAC,GAAG,CAC9C,EAAS,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,EAClC,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CACnC,IAAI,EAAK,IAAI,CAAC,iBAAiB,GAC/B,GAAI,EAAiB,EAAI,GACvB,IAAI,CAAC,GAAG,EAAI,GAAM,MAAS,EAAI,OAC1B,GAAI,AAAO,KAAP,EAAW,CACpB,IAAI,CAAC,WAAW,CAAG,CAAA,EACnB,GAAQ,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EAC7C,IAAI,EAAW,IAAI,CAAC,GAAG,AACmB,CAAA,MAAtC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,GAChC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAE,6CACtC,EAAE,IAAI,CAAC,GAAG,CACV,IAAI,EAAM,IAAI,CAAC,aAAa,GACvB,AAAC,CAAA,EAAQ,EAAoB,CAAA,EAAkB,EAAK,IACrD,IAAI,CAAC,kBAAkB,CAAC,EAAU,0BACtC,GAAQ,GAAoB,GAC5B,EAAa,IAAI,CAAC,GAAG,AACvB,MACE,MAEF,EAAQ,CAAA,CACV,CACA,OAAO,EAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,CACrD,EAKA,GAAK,QAAQ,CAAG,WACd,IAAI,EAAO,IAAI,CAAC,SAAS,GACrB,EAAO,EAAM,IAAI,CAIrB,OAHI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IACrB,CAAA,EAAO,CAAU,CAAC,EAAK,AAAL,EAEb,IAAI,CAAC,WAAW,CAAC,EAAM,EAChC,EAIA,IAAI,GAAU,QA+Bd,SAAS,GAAM,CAAK,CAAE,CAAO,EAC3B,OAAO,EAAO,KAAK,CAAC,EAAO,EAC7B,CAMA,SAAS,GAAkB,CAAK,CAAE,CAAG,CAAE,CAAO,EAC5C,OAAO,EAAO,iBAAiB,CAAC,EAAO,EAAK,EAC9C,CAKA,SAAS,GAAU,CAAK,CAAE,CAAO,EAC/B,OAAO,EAAO,SAAS,CAAC,EAAO,EACjC,CA9CA,EAAO,KAAK,CAAG,CACb,OAAQ,EACR,QAAS,GACT,eAAgB,EAChB,SAAU,EACV,eAAgB,EAChB,YAAa,EACb,KAAM,GACN,UAAW,EACX,SAAU,EACV,aAAc,EACd,WAAY,GACZ,YAAa,GACb,iBAAkB,EAClB,kBAAmB,EACnB,MAAO,GACP,UAAW,EACX,UAAW,EACX,WAAY,EACZ,mBAAoB,CACtB,C,E,C,iD,O,E,C,M,C,S,C,C,C,C,C,ECpgKA,IAAM,EAAgB,EAAQ,oBAExB,EAAY,gBACZ,EAAgB,QAGhB,EAAc,IAAI,QAGxB,SAAS,EAAa,CAAK,EACzB,EAAQ,EAAM,MAAM,CAAC,KAAK,EAAI,EAC9B,IAAI,EAAW,EAAY,GAAG,CAAC,GAC/B,GAAI,CAAC,EAAU,CACb,IAAM,EAAK,EAAM,QAAQ,CACnB,EAAa,EAAM,UAAU,CAC7B,EAAY,EAAM,SAAS,CAC3B,EAAU,IAAI,EAAW,OAAQ,CAAA,GACjC,EAAU,IAAI,EAAW,QAAS,CAAA,GAClC,EAAU,IAAI,EAAW,iBAAkB,CAAA,EAAM,CAAA,GAMjD,EAAW,CACf,QAAS,IAAI,EAAU,WACvB,QAAS,IAAI,EAAU,UAAW,CAAC,WAAY,CAAA,CAAI,GACnD,YAAa,IAAI,EAAU,cAAe,CAAC,WAAY,CAAA,CAAI,GAC3D,UAAW,IAAI,EAAU,YAC3B,CAEA,CAAA,EAAS,WAAW,CAAC,aAAa,CAAG,WACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAClB,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,EACA,EAAS,SAAS,CAAC,aAAa,CAAG,SAAS,CAAQ,EAClD,IAAI,EAAM,IAAI,CAAC,OAAO,CAAC,GAAG,EACtB,CAAA,IAAQ,GAAW,IAAa,EAAG,KAAK,EAAI,IAAQ,GACtD,IAAI,CAAC,OAAO,CAAC,GAAG,GAChB,IAAI,CAAC,WAAW,CAAG,IAAI,CAAC,UAAU,KAAO,GAEzC,IAAI,CAAC,WAAW,CAAG,CAAA,CAEvB,EAEA,EAAW,CAAE,YA3BO,CAClB,QAAS,EACT,QAAS,EACT,QAAS,CACX,EAuBuC,SAAU,CAAS,EAC1D,EAAY,GAAG,CAAC,EAAO,EACzB,CAEA,OAAO,CACT,CAIA,SAAS,EAAoB,CAAM,SACjC,AAAK,EAGD,AAAgB,kBAAhB,EAAO,IAAI,CACN,EAAO,IAAI,CAEhB,AAAgB,sBAAhB,EAAO,IAAI,CACN,EAAO,SAAS,CAAC,IAAI,CAAG,IAAM,EAAO,IAAI,CAAC,IAAI,CAEnD,AAAgB,wBAAhB,EAAO,IAAI,CACN,EAAoB,EAAO,MAAM,EAAI,IAC5C,EAAoB,EAAO,QAAQ,SAV5B,CAWX,CAEA,EAAO,OAAO,CAAG,SAAS,CAAO,EAE/B,OADA,EAAU,GAAW,CAAC,EACf,SAAS,CAAM,EACpB,OAAO,AAiBX,SAAgB,CAAO,CAAE,CAAM,EAC7B,IAAM,EAAQ,EAAO,KAAK,EAAI,EAAQ,oBAChC,EAAW,EAAa,GACxB,EAAK,EAAM,QAAQ,CACnB,EAAM,EAAS,QAAQ,CACvB,EAAc,EAAM,WAAW,CAC/B,EAAU,EAAS,WAAW,CAAC,OAAO,CACtC,EAAU,EAAS,WAAW,CAAC,OAAO,CACtC,EAAU,EAAS,WAAW,CAAC,OAAO,CACtC,EAAY,EAAM,SAAS,CAC3B,EAAoB,EAAM,iBAAiB,CAC3C,EAAmB,EAAM,gBAAgB,CAE/C,OAAO,cAAc,EAEnB,WAAW,UAAW,CACpB,OAAO,CACT,CAGA,eAAgB,CACd,IAAI,EAAM,GAAI,EAAa,IAAI,CAAC,GAAG,CACnC,OAAS,CACH,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,6BACzB,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAEvC,OAAQ,GACR,KAAK,GACL,KAAK,IACH,GAAI,IAAI,CAAC,GAAG,GAAK,IAAI,CAAC,KAAK,CAAE,CAC3B,GAAI,AAAO,KAAP,GAAa,IAAI,CAAC,WAAW,CAE/B,MADA,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAI,WAAW,EAEzC,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAC/B,CAEA,OADA,GAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,WAAW,CAAC,EAAI,OAAO,CAAE,EAEvC,MAAK,GAEH,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,cAAc,GAC1B,EAAa,IAAI,CAAC,GAAG,CACrB,KAEF,MAAK,GACL,KAAK,IACH,IAAI,CAAC,KAAK,CACR,IAAI,CAAC,GAAG,CACR,qBAAuB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAG,oBAC3C,CAAA,AAAO,KAAP,EAAY,OAAS,UAAA,EADxB,WACyD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAD7E,OAIJ,SACM,EAAU,IAEZ,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,eAAe,CAAC,CAAA,GAC5B,EAAa,IAAI,CAAC,GAAG,EAErB,EAAE,IAAI,CAAC,GAAG,AAEd,CACF,CACF,CAEA,gBAAgB,CAAa,CAAE,CAC7B,IACI,EADA,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAcvC,MAZA,EAAE,IAAI,CAAC,GAAG,CACN,AAAO,KAAP,GAAa,AAAoC,KAApC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAC7C,EAAE,IAAI,CAAC,GAAG,CACV,EAAM,EAAgB,KAAO,QAE7B,EAAM,OAAO,YAAY,CAAC,GAExB,IAAI,CAAC,OAAO,CAAC,SAAS,GACxB,EAAE,IAAI,CAAC,OAAO,CACd,IAAI,CAAC,SAAS,CAAG,IAAI,CAAC,GAAG,EAGpB,CACT,CAEA,eAAe,CAAK,CAAE,CACpB,IAAI,EAAM,GAAI,EAAa,EAAE,IAAI,CAAC,GAAG,CACrC,OAAS,CACH,IAAI,CAAC,GAAG,EAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,gCACzB,IAAI,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EACvC,GAAI,IAAO,EAAO,KACd,AAAO,CAAA,KAAP,GAEF,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,cAAc,GAC1B,EAAa,IAAI,CAAC,GAAG,EACZ,EAAU,IAEnB,GADO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,EACrC,IAAI,CAAC,eAAe,CAAC,CAAA,GAC5B,EAAa,IAAI,CAAC,GAAG,EAErB,EAAE,IAAI,CAAC,GAAG,AAEd,CAEA,OADA,GAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAY,IAAI,CAAC,GAAG,IACrC,IAAI,CAAC,WAAW,CAAC,EAAG,MAAM,CAAE,EACrC,CAEA,gBAAiB,CACf,IAAI,EAAM,GAAI,EAAQ,EAAG,EACrB,EAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,AAClB,CAAA,MAAP,GACF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAE,uCACvB,IAAI,EAAW,EAAE,IAAI,CAAC,GAAG,CACzB,KAAO,IAAI,CAAC,GAAG,CAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAI,IAAU,IAAI,CAEnD,GAAI,AAAO,MADX,CAAA,EAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,AAAH,EACR,CACV,AAAW,MAAX,CAAG,CAAC,EAAE,CACJ,AAAW,MAAX,CAAG,CAAC,EAAE,EACR,EAAM,EAAI,MAAM,CAAC,GACb,EAAU,IAAI,CAAC,IACjB,CAAA,EAAS,OAAO,YAAY,CAAC,SAAS,EAAK,IAD7C,IAGA,EAAM,EAAI,MAAM,CAAC,GACb,EAAc,IAAI,CAAC,IACrB,CAAA,EAAS,OAAO,YAAY,CAAC,SAAS,EAAK,IAD7C,GAIF,EAAS,CAAa,CAAC,EAAI,CAE7B,KACF,CACA,GAAO,CACT,QACA,AAAK,IACH,IAAI,CAAC,GAAG,CAAG,EACJ,IAGX,CASA,cAAe,CACb,IAAI,EAAI,EAAQ,IAAI,CAAC,GAAG,CACxB,GACE,EAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,QAC9B,EAAiB,IAAO,AAAO,KAAP,EAAW,AAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,EAAI,OAAO,CAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAO,IAAI,CAAC,GAAG,EACvE,CAIA,qBAAsB,CACpB,IAAI,EAAO,IAAI,CAAC,SAAS,GAQzB,OAPI,IAAI,CAAC,IAAI,GAAK,EAAI,OAAO,CAC3B,EAAK,IAAI,CAAG,IAAI,CAAC,KAAK,CACf,IAAI,CAAC,IAAI,CAAC,OAAO,CACxB,EAAK,IAAI,CAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAE7B,IAAI,CAAC,UAAU,GACjB,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,UAAU,CAAC,EAAM,gBAC/B,CAIA,yBAA0B,CACxB,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,mBAAmB,GACnC,GAAI,CAAC,EAAQ,eAAe,EAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,KAAK,EAAG,OAAO,EAC5D,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAGtC,OAFA,EAAK,SAAS,CAAG,EACjB,EAAK,IAAI,CAAG,IAAI,CAAC,mBAAmB,GAC7B,IAAI,CAAC,UAAU,CAAC,EAAM,oBAC/B,CAKA,sBAAuB,CACrB,GAAI,IAAI,CAAC,IAAI,GAAK,EAAI,SAAS,CAAE,MAAO,GACxC,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,EAAO,IAAI,CAAC,uBAAuB,GAIvC,IAHI,IAAI,CAAC,IAAI,GAAK,EAAG,GAAG,EAAI,AAAc,sBAAd,EAAK,IAAI,EAA6B,EAAQ,sBAAsB,EAC9F,IAAI,CAAC,UAAU,GAEV,IAAI,CAAC,GAAG,CAAC,EAAG,GAAG,GAAG,CACvB,IAAI,EAAU,IAAI,CAAC,WAAW,CAAC,EAAU,EACzC,CAAA,EAAQ,MAAM,CAAG,EACjB,EAAQ,QAAQ,CAAG,IAAI,CAAC,mBAAmB,GAC3C,EAAO,IAAI,CAAC,UAAU,CAAC,EAAS,sBAClC,CACA,OAAO,CACT,CAIA,yBAA0B,CACxB,OAAQ,IAAI,CAAC,IAAI,EACjB,KAAK,EAAG,MAAM,CACZ,IAAI,EAAO,IAAI,CAAC,4BAA4B,GAG5C,MAF6B,uBAAzB,EAAK,UAAU,CAAC,IAAI,EACtB,IAAI,CAAC,KAAK,CAAC,EAAK,KAAK,CAAE,+DAClB,CAET,MAAK,EAAI,WAAW,CACpB,KAAK,EAAG,MAAM,CACZ,OAAO,IAAI,CAAC,aAAa,EAE3B,SACE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,gEACzB,CACF,CAMA,0BAA2B,CACzB,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAE,IAAI,CAAC,aAAa,EAC/D,OAAO,IAAI,CAAC,YAAY,CAAC,EAAM,qBAAsB,IAAI,CAAC,KAAK,CAAE,IAAI,CAAC,QAAQ,CAChF,CAIA,8BAA+B,CAC7B,IAAI,EAAO,IAAI,CAAC,SAAS,GAMzB,OALA,IAAI,CAAC,IAAI,GACT,EAAK,UAAU,CAAG,IAAI,CAAC,IAAI,GAAK,EAAG,MAAM,CACrC,IAAI,CAAC,wBAAwB,GAC7B,IAAI,CAAC,eAAe,GACxB,IAAI,CAAC,MAAM,CAAC,EAAG,MAAM,EACd,IAAI,CAAC,UAAU,CAAC,EAAM,yBAC/B,CAIA,oBAAqB,CACnB,IAAI,EAAO,IAAI,CAAC,SAAS,UACzB,AAAI,IAAI,CAAC,GAAG,CAAC,EAAG,MAAM,GACpB,IAAI,CAAC,MAAM,CAAC,EAAG,QAAQ,EACvB,EAAK,QAAQ,CAAG,IAAI,CAAC,gBAAgB,GACrC,IAAI,CAAC,MAAM,CAAC,EAAG,MAAM,EACd,IAAI,CAAC,UAAU,CAAC,EAAM,wBAE/B,EAAK,IAAI,CAAG,IAAI,CAAC,uBAAuB,GACxC,EAAK,KAAK,CAAG,IAAI,CAAC,GAAG,CAAC,EAAG,EAAE,EAAI,IAAI,CAAC,uBAAuB,GAAK,KACzD,IAAI,CAAC,UAAU,CAAC,EAAM,gBAC/B,CAIA,0BAA0B,CAAQ,CAAE,CAAQ,CAAE,CAC5C,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,EACtC,CAAA,EAAK,UAAU,CAAG,EAAE,CACpB,IAAI,EAAW,IAAI,CAAC,oBAAoB,GAExC,IADI,GAAU,CAAA,EAAK,IAAI,CAAG,CAA1B,EACO,IAAI,CAAC,IAAI,GAAK,EAAG,KAAK,EAAI,IAAI,CAAC,IAAI,GAAK,EAAI,SAAS,EAC1D,EAAK,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAG9C,OAFA,EAAK,WAAW,CAAG,IAAI,CAAC,GAAG,CAAC,EAAG,KAAK,EACpC,IAAI,CAAC,MAAM,CAAC,EAAI,SAAS,EAClB,IAAI,CAAC,UAAU,CAAC,EAAM,EAAW,oBAAsB,qBAChE,CAIA,0BAA0B,CAAQ,CAAE,CAAQ,CAAE,CAC5C,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAClC,EAAW,IAAI,CAAC,oBAAoB,GAGxC,OAFI,GAAU,CAAA,EAAK,IAAI,CAAG,CAA1B,EACA,IAAI,CAAC,MAAM,CAAC,EAAI,SAAS,EAClB,IAAI,CAAC,UAAU,CAAC,EAAM,EAAW,oBAAsB,qBAChE,CAKA,mBAAmB,CAAQ,CAAE,CAAQ,CAAE,CACrC,IAAI,EAAO,IAAI,CAAC,WAAW,CAAC,EAAU,GAClC,EAAW,EAAE,CACb,EAAiB,IAAI,CAAC,yBAAyB,CAAC,EAAU,GAC1D,EAAiB,KAErB,GAAI,CAAC,EAAe,WAAW,CAAE,CAC/B,EAAU,OACR,OAAQ,IAAI,CAAC,IAAI,EACjB,KAAK,EAAI,WAAW,CAGlB,GAFA,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAC/C,IAAI,CAAC,IAAI,GACL,IAAI,CAAC,GAAG,CAAC,EAAG,KAAK,EAAG,CACtB,EAAiB,IAAI,CAAC,yBAAyB,CAAC,EAAU,GAC1D,MAAM,CACR,CACA,EAAS,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAU,IAChD,KAEF,MAAK,EAAI,OAAO,CACd,EAAS,IAAI,CAAC,IAAI,CAAC,aAAa,IAChC,KAEF,MAAK,EAAG,MAAM,CACZ,EAAS,IAAI,CAAC,IAAI,CAAC,4BAA4B,IAC/C,KAEF,SACE,IAAI,CAAC,UAAU,EACjB,CAEE,EAAoB,EAAe,IAAI,IAAM,EAAoB,EAAe,IAAI,GACtF,IAAI,CAAC,KAAK,CACR,EAAe,KAAK,CACpB,+CAAiD,EAAoB,EAAe,IAAI,EAAI,IAElG,CACA,IAAI,EAAoB,EAAe,IAAI,CAAG,UAAY,WAQ1D,OANA,CAAI,CAAC,UAAY,EAAkB,CAAG,EACtC,CAAI,CAAC,UAAY,EAAkB,CAAG,EACtC,EAAK,QAAQ,CAAG,EACZ,IAAI,CAAC,IAAI,GAAK,EAAG,UAAU,EAAI,AAAe,MAAf,IAAI,CAAC,KAAK,EAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,6DAElB,IAAI,CAAC,UAAU,CAAC,EAAM,MAAQ,EACvC,CAIA,eAAgB,CACd,IAAI,EAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAEvC,OADA,EAAK,IAAI,CAAG,UACL,CACT,CAIA,kBAAmB,CACjB,IAAI,EAAW,IAAI,CAAC,KAAK,CAAE,EAAW,IAAI,CAAC,QAAQ,CAEnD,OADA,IAAI,CAAC,IAAI,GACF,IAAI,CAAC,kBAAkB,CAAC,EAAU,EAC3C,CAEA,cAAc,CAAsB,CAAE,QACpC,AAAI,IAAI,CAAC,IAAI,GAAK,EAAI,OAAO,CACpB,IAAI,CAAC,aAAa,GAClB,IAAI,CAAC,IAAI,GAAK,EAAI,WAAW,CAC7B,IAAI,CAAC,gBAAgB,GAErB,KAAK,CAAC,cAAc,EAC/B,CAEA,UAAU,CAAI,CAAE,CACd,IAAI,EAAU,IAAI,CAAC,UAAU,GAE7B,GAAI,IAAY,EAAS,OAAO,IAAI,CAAC,aAAa,GAElD,GAAI,IAAY,GAAW,IAAY,EAAS,CAC9C,GAAI,EAAkB,GAAO,OAAO,IAAI,CAAC,YAAY,GAErD,GAAI,AAAQ,IAAR,EAEF,MADA,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAI,SAAS,EAGvC,GAAK,AAAA,CAAA,AAAS,KAAT,GAAe,AAAS,KAAT,CAAS,GAAO,GAAW,EAC7C,OAAO,IAAI,CAAC,cAAc,CAAC,EAC/B,QAEA,AAAI,AAAS,KAAT,GAAe,IAAI,CAAC,WAAW,EAAI,AAAwC,KAAxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAG,IACtE,EAAE,IAAI,CAAC,GAAG,CACH,IAAI,CAAC,WAAW,CAAC,EAAI,WAAW,GAElC,KAAK,CAAC,UAAU,EACzB,CAEA,cAAc,CAAQ,CAAE,CACtB,GAAI,IAAI,CAAC,IAAI,EAAI,EAAG,MAAM,CAAE,CAC1B,IAAI,EAAa,IAAI,CAAC,UAAU,EAC5B,CAAA,GAAc,EAAS,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAY,MAAM,EACtD,GAAc,EAAS,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAY,MAAM,EAC/D,KAAK,CAAC,cAAc,GACzB,IAAI,CAAC,WAAW,CAAG,CAAA,CACrB,MAAO,GAAI,IAAI,CAAC,IAAI,GAAK,EAAG,KAAK,EAAI,IAAa,EAAI,WAAW,CAK/D,OAAO,KAAK,CAAC,cAAc,EAJ3B,CAAA,IAAI,CAAC,OAAO,CAAC,MAAM,EAAI,EACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAClB,IAAI,CAAC,WAAW,CAAG,CAAA,EAIvB,CACF,CACF,EA5ZkB,CACZ,gBAAiB,AAA4B,CAAA,IAA5B,EAAQ,eAAe,CACxC,uBAAwB,CAAC,CAAC,EAAQ,sBAAsB,AAC1D,EAAG,EACL,CACF,EAIA,OAAO,cAAc,CAAC,EAAO,OAAO,CAAE,WAAY,CAChD,IAAK,WACH,OAAO,EAAa,EAAQ,qBAAU,QAAQ,AAChD,EACA,aAAc,CAAA,EACd,WAAY,CAAA,CACd,E,E,C,iB,Q,mB,O,E,C,Q,C,S,C,C,C,C,C,EC1FA,EAAO,OAAO,CAAG,CACf,KAAM,IACN,IAAK,IACL,KAAM,IACN,GAAI,IACJ,GAAI,IACJ,KAAM,IACN,MAAO,IACP,KAAM,IACN,MAAO,IACP,OAAQ,IACR,IAAK,IACL,OAAQ,IACR,KAAM,IACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,MAAO,IACP,IAAK,IACL,IAAK,IACL,IAAK,IACL,KAAM,IACN,IAAK,IACL,OAAQ,IACR,KAAM,IACN,KAAM,IACN,MAAO,IACP,MAAO,IACP,KAAM,IACN,OAAQ,IACR,MAAO,IACP,KAAM,IACN,KAAM,IACN,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,OAAQ,IACR,KAAM,IACN,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,IAAK,IACL,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,OAAQ,IACR,KAAM,IACN,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,OAAQ,IACR,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,OAAQ,IACR,KAAM,IACN,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,IAAK,IACL,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,OAAQ,IACR,KAAM,IACN,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,KAAM,IACN,OAAQ,IACR,MAAO,IACP,KAAM,IACN,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,KAAM,IACN,KAAM,IACN,KAAM,IACN,MAAO,IACP,MAAO,IACP,KAAM,IACN,MAAO,IACP,MAAO,IACP,QAAS,IACT,KAAM,IACN,IAAK,IACL,MAAO,IACP,KAAM,IACN,MAAO,IACP,OAAQ,IACR,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,QAAS,IACT,GAAI,IACJ,IAAK,IACL,MAAO,IACP,IAAK,IACL,QAAS,IACT,IAAK,IACL,IAAK,IACL,IAAK,IACL,MAAO,IACP,MAAO,IACP,KAAM,IACN,MAAO,IACP,MAAO,IACP,QAAS,IACT,KAAM,IACN,IAAK,IACL,MAAO,IACP,KAAM,IACN,MAAO,IACP,OAAQ,IACR,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,QAAS,IACT,GAAI,IACJ,IAAK,IACL,OAAQ,IACR,MAAO,IACP,IAAK,IACL,QAAS,IACT,IAAK,IACL,IAAK,IACL,IAAK,IACL,MAAO,IACP,SAAU,IACV,MAAO,IACP,IAAK,IACL,KAAM,IACN,KAAM,IACN,OAAQ,IACR,KAAM,IACN,IAAK,IACL,IAAK,IACL,IAAK,IACL,MAAO,IACP,MAAO,IACP,MAAO,IACP,MAAO,IACP,MAAO,IACP,MAAO,IACP,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,KAAM,IACN,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,MAAO,IACP,MAAO,IACP,KAAM,IACN,MAAO,IACP,OAAQ,IACR,KAAM,IACN,MAAO,IACP,QAAS,IACT,KAAM,IACN,KAAM,IACN,KAAM,IACN,KAAM,IACN,KAAM,IACN,MAAO,IACP,KAAM,IACN,KAAM,IACN,KAAM,IACN,KAAM,IACN,KAAM,IACN,OAAQ,IACR,KAAM,IACN,MAAO,IACP,MAAO,IACP,MAAO,IACP,KAAM,IACN,MAAO,IACP,GAAI,IACJ,KAAM,IACN,IAAK,IACL,MAAO,IACP,OAAQ,IACR,MAAO,IACP,KAAM,IACN,MAAO,IACP,IAAK,IACL,IAAK,IACL,GAAI,IACJ,IAAK,IACL,IAAK,IACL,IAAO,IACP,OAAQ,IACR,IAAK,IACL,KAAM,IACN,MAAO,IACP,GAAI,IACJ,MAAO,IACP,GAAI,IACJ,GAAI,IACJ,IAAK,IACL,IAAK,IACL,KAAM,IACN,KAAM,IACN,KAAM,IACN,MAAO,IACP,OAAQ,IACR,KAAM,IACN,KAAM,IACN,MAAO,IACP,MAAO,IACP,OAAQ,IACR,OAAQ,IACR,KAAM,IACN,KAAM,IACN,IAAK,IACL,OAAQ,IACR,MAAO,IACP,OAAQ,IACR,MAAO,GACT,C,E,C,E,C,Q,C,S,C,C,C,C,C,E,I,E,E,kDC5OA,SAAS,EAAO,CAAI,CAAE,CAAQ,CAAE,CAAW,CAAE,CAAK,CAAE,CAAQ,EACrD,GAAe,CAAA,EAAc,CAAlC,EACI,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC/B,IAAI,EAAO,GAAY,EAAK,IAAI,CAAE,EAAQ,CAAQ,CAAC,EAAK,CACxD,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GACxB,GAAS,EAAM,EAAM,EAC3B,EAAG,EAAM,EAAO,EAClB,CAKA,SAAS,EAAS,CAAI,CAAE,CAAQ,CAAE,CAAW,CAAE,CAAK,CAAE,CAAQ,EAC5D,IAAI,EAAY,EAAE,CACb,GAAe,CAAA,EAAc,CAAlC,EACI,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC/B,IAAI,EAAO,GAAY,EAAK,IAAI,CAAE,EAAQ,CAAQ,CAAC,EAAK,CACpD,EAAQ,IAAS,CAAS,CAAC,EAAU,MAAM,CAAG,EAAE,CAChD,GAAS,EAAU,IAAI,CAAC,GAC5B,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GACxB,GAAS,EAAM,EAAM,GAAM,EAAW,GACtC,GAAS,EAAU,GAAG,EAC5B,EAAG,EAAM,EAAO,EAClB,CAOA,SAAS,EAAU,CAAI,CAAE,CAAK,CAAE,CAAK,CAAE,CAAW,CAAE,CAAQ,EAC1D,IAAI,EAAU,EAAQ,EAAK,EAAO,GAAe,KAAA,GAAa,GAC5D,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC7B,CAAO,CAAC,GAAY,EAAK,IAAI,CAAC,CAAC,EAAM,EAAI,EAC3C,EAAG,EAAM,EAAO,EAClB,CAEA,SAAS,EAAS,CAAI,QACpB,AAAI,AAAgB,UAAhB,OAAO,EACA,SAAU,CAAI,EAAI,OAAO,IAAS,CAAM,EACzC,GACC,WAAc,MAAO,CAAA,CAAM,CAGxC,C,E,iB,C,GA4XA,EAAA,MAAA,CAAA,EAAA,WAAA,IAAS,GAAT,EAAA,MAAA,CAAA,EAAA,OAAA,IAAmB,GAAnB,EAAA,MAAA,CAAA,EAAA,gBAAA,IAAyB,GAAzB,EAAA,MAAA,CAAA,EAAA,iBAAA,IAAwC,GAAxC,EAAA,MAAA,CAAA,EAAA,aAAA,IAAwD,GAAxD,EAAA,MAAA,CAAA,EAAA,iBAAA,IAAoE,GAApE,EAAA,MAAA,CAAA,EAAA,OAAA,IAAoF,GAApF,EAAA,MAAA,CAAA,EAAA,eAAA,IAA0F,GAA1F,EAAA,MAAA,CAAA,EAAA,OAAA,IAAwG,GAAxG,EAAA,MAAA,CAAA,EAAA,YAAA,IAA8G,GAA9G,EAAA,MAAA,CAAA,EAAA,SAAA,IAAyH,GA1XzH,IAAI,EAAQ,SAAe,CAAI,CAAE,CAAK,EAAI,IAAI,CAAC,IAAI,CAAG,EAAM,IAAI,CAAC,KAAK,CAAG,CAAO,EAGhF,SAAS,EAAK,CAAI,CAAE,CAAQ,CAAE,CAAW,CAAE,CAAK,CAAE,CAAQ,EACnD,GAAe,CAAA,EAAc,CAAlC,EACI,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC/B,IAAI,EAAO,GAAY,EAAK,IAAI,CAChC,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GACvB,GAAY,EAAS,EAAM,EAAI,EACtC,EAAG,EAAM,EAAO,EAClB,CAIA,SAAS,EAAa,CAAI,CAAE,CAAQ,CAAE,CAAW,CAAE,CAAK,EACjD,GAAe,CAAA,EAAc,CAAlC,EACA,IAAI,EAAY,EAAE,EAChB,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC7B,IAAI,EAAO,GAAY,EAAK,IAAI,CAC5B,EAAQ,IAAS,CAAS,CAAC,EAAU,MAAM,CAAG,EAAE,CAChD,GAAS,EAAU,IAAI,CAAC,GAC5B,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GACvB,GAAY,EAAS,EAAM,GAAM,EAAW,EAAW,GACxD,GAAS,EAAU,GAAG,EAC5B,EAAG,EAAM,EACX,CAKA,SAAS,EAAW,CAAI,CAAE,CAAK,CAAE,CAAG,CAAE,CAAI,CAAE,CAAW,CAAE,CAAK,EACvD,GAAe,CAAA,EAAc,CAAlC,EACA,EAAO,EAAS,GAChB,GAAI,EACD,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC5B,IAAI,EAAO,GAAY,EAAK,IAAI,CAIhC,GAHK,CAAA,AAAS,MAAT,GAAiB,EAAK,KAAK,EAAI,CAAA,GAC/B,CAAA,AAAO,MAAP,GAAe,EAAK,GAAG,EAAI,CAAA,GAC5B,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GAC5B,AAAC,CAAA,AAAS,MAAT,GAAiB,EAAK,KAAK,GAAK,CAAA,GAChC,CAAA,AAAO,MAAP,GAAe,EAAK,GAAG,GAAK,CAAA,GAC7B,EAAK,EAAM,GACX,MAAM,IAAI,EAAM,EAAM,EAC5B,EAAG,EAAM,EACX,CAAE,MAAO,EAAG,CACV,GAAI,aAAa,EAAS,OAAO,CACjC,OAAM,CACR,CACF,CAIA,SAAS,EAAe,CAAI,CAAE,CAAG,CAAE,CAAI,CAAE,CAAW,CAAE,CAAK,EACzD,EAAO,EAAS,GACX,GAAe,CAAA,EAAc,CAAlC,EACA,GAAI,EACD,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC5B,IAAI,EAAO,GAAY,EAAK,IAAI,CAChC,GAAI,CAAA,CAAA,EAAK,KAAK,CAAG,CAAA,IAAO,CAAA,EAAK,GAAG,CAAG,CAAA,IACnC,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GACxB,EAAK,EAAM,IAAS,MAAM,IAAI,EAAM,EAAM,EAChD,EAAG,EAAM,EACX,CAAE,MAAO,EAAG,CACV,GAAI,aAAa,EAAS,OAAO,CACjC,OAAM,CACR,CACF,CAGA,SAAS,EAAc,CAAI,CAAE,CAAG,CAAE,CAAI,CAAE,CAAW,CAAE,CAAK,EACxD,EAAO,EAAS,GACX,GAAe,CAAA,EAAc,CAAlC,EACA,GAAI,EACD,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC5B,IAAI,CAAA,EAAK,GAAG,CAAG,CAAA,GACf,IAAI,EAAO,GAAY,EAAK,IAAI,CAChC,GAAI,EAAK,KAAK,EAAI,GAAO,EAAK,EAAM,GAAS,MAAM,IAAI,EAAM,EAAM,GACnE,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GAC9B,EAAG,EAAM,EACX,CAAE,MAAO,EAAG,CACV,GAAI,aAAa,EAAS,OAAO,CACjC,OAAM,CACR,CACF,CAGA,SAAS,EAAe,CAAI,CAAE,CAAG,CAAE,CAAI,CAAE,CAAW,CAAE,CAAK,MAGrD,EAQJ,OAVA,EAAO,EAAS,GACX,GAAe,CAAA,EAAc,CAAlC,GAEE,AAAA,SAAS,EAAE,CAAI,CAAE,CAAE,CAAE,CAAQ,EAC7B,IAAI,CAAA,EAAK,KAAK,CAAG,CAAA,GACjB,IAAI,EAAO,GAAY,EAAK,IAAI,AAC5B,CAAA,EAAK,GAAG,EAAI,GAAQ,CAAA,CAAC,GAAO,EAAI,IAAI,CAAC,GAAG,CAAG,EAAK,GAAE,AAAF,GAAQ,EAAK,EAAM,IACnE,CAAA,EAAM,IAAI,EAAM,EAAM,EAD1B,EAEA,CAAW,CAAC,EAAK,CAAC,EAAM,EAAI,GAC9B,EAAG,EAAM,GACF,CACT,CAGA,IAAI,EAAS,OAAO,MAAM,EAAI,SAAS,CAAK,EAC1C,SAAS,IAAQ,CAEjB,OADA,EAAK,SAAS,CAAG,EACV,IAAI,CACb,EAIA,SAAS,EAAK,CAAK,CAAE,CAAW,EAC9B,IAAI,EAAU,EAAO,GAAe,GACpC,IAAK,IAAI,KAAQ,EAAS,CAAO,CAAC,EAAK,CAAG,CAAK,CAAC,EAAK,CACrD,OAAO,CACT,CAEA,SAAS,EAAY,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,EAAE,EAAM,EAAK,CACjD,SAAS,EAAO,CAAK,CAAE,CAAG,CAAE,CAAE,EAAG,CAIjC,IAAI,EAAO,CAAC,CAEZ,CAAA,EAAK,OAAO,CAAG,EAAK,cAAc,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACxD,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,IAAI,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAItD,EAFW,CAAI,CAAC,EAAE,CAEV,EAAI,YAEhB,EACA,EAAK,SAAS,CAAG,EACjB,EAAK,cAAc,CAAG,EACtB,EAAK,mBAAmB,CAAG,EAAK,uBAAuB,CAAG,EAAK,eAAe,CAC5E,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAK,UAAU,CAAE,EAAI,aAAe,EACxE,EAAK,WAAW,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACtC,EAAE,EAAK,IAAI,CAAE,EAAI,cACjB,EAAE,EAAK,UAAU,CAAE,EAAI,aACnB,EAAK,SAAS,EAAI,EAAE,EAAK,SAAS,CAAE,EAAI,YAC9C,EACA,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAK,IAAI,CAAE,EAAI,YAAc,EACvF,EAAK,cAAc,CAAG,EAAK,iBAAiB,CAAG,EAC/C,EAAK,aAAa,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACxC,EAAE,EAAK,MAAM,CAAE,EAAI,cACnB,EAAE,EAAK,IAAI,CAAE,EAAI,YACnB,EACA,EAAK,eAAe,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC1C,EAAE,EAAK,YAAY,CAAE,EAAI,cACzB,IAAK,IAAI,EAAM,EAAG,EAAS,EAAK,KAAK,CAAE,EAAM,EAAO,MAAM,CAAE,GAAO,EAAG,CACpE,IAAI,EAAK,CAAM,CAAC,EAAI,AAEhB,CAAA,EAAG,IAAI,EAAI,EAAE,EAAG,IAAI,CAAE,EAAI,cAC9B,IAAK,IAAI,EAAI,EAAG,EAAO,EAAG,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI1D,EAFW,CAAI,CAAC,EAAE,CAEV,EAAI,YAEhB,CACF,EACA,EAAK,UAAU,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACjC,EAAK,IAAI,EAAI,EAAE,EAAK,IAAI,CAAE,EAAI,cAClC,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI5D,EAFW,CAAI,CAAC,EAAE,CAEV,EAAI,YAEhB,EACA,EAAK,eAAe,CAAG,EAAK,eAAe,CAAG,EAAK,eAAe,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACpF,EAAK,QAAQ,EAAI,EAAE,EAAK,QAAQ,CAAE,EAAI,aAC5C,EACA,EAAK,cAAc,CAAG,EAAK,aAAa,CACtC,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAK,QAAQ,CAAE,EAAI,aAAe,EACtE,EAAK,YAAY,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACvC,EAAE,EAAK,KAAK,CAAE,EAAI,aACd,EAAK,OAAO,EAAI,EAAE,EAAK,OAAO,CAAE,GAChC,EAAK,SAAS,EAAI,EAAE,EAAK,SAAS,CAAE,EAAI,YAC9C,EACA,EAAK,WAAW,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAClC,EAAK,KAAK,EAAI,EAAE,EAAK,KAAK,CAAE,EAAI,WACpC,EAAE,EAAK,IAAI,CAAE,EAAI,YACnB,EACA,EAAK,cAAc,CAAG,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACjE,EAAE,EAAK,IAAI,CAAE,EAAI,cACjB,EAAE,EAAK,IAAI,CAAE,EAAI,YACnB,EACA,EAAK,YAAY,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACnC,EAAK,IAAI,EAAI,EAAE,EAAK,IAAI,CAAE,EAAI,WAC9B,EAAK,IAAI,EAAI,EAAE,EAAK,IAAI,CAAE,EAAI,cAC9B,EAAK,MAAM,EAAI,EAAE,EAAK,MAAM,CAAE,EAAI,cACtC,EAAE,EAAK,IAAI,CAAE,EAAI,YACnB,EACA,EAAK,cAAc,CAAG,EAAK,cAAc,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC/D,EAAE,EAAK,IAAI,CAAE,EAAI,WACjB,EAAE,EAAK,KAAK,CAAE,EAAI,cAClB,EAAE,EAAK,IAAI,CAAE,EAAI,YACnB,EACA,EAAK,OAAO,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC9B,AAAc,wBAAd,EAAK,IAAI,CAA8B,EAAE,EAAM,GAC5C,EAAE,EAAM,EAAI,aACrB,EACA,EAAK,iBAAiB,CAAG,EAEzB,EAAK,mBAAmB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAM,EAAI,WAAa,EACpF,EAAK,mBAAmB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC9C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,YAAY,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI9D,EAFW,CAAI,CAAC,EAAE,CAEV,EAEZ,EACA,EAAK,kBAAkB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC7C,EAAE,EAAK,EAAE,CAAE,EAAI,WACX,EAAK,IAAI,EAAI,EAAE,EAAK,IAAI,CAAE,EAAI,aACpC,EAEA,EAAK,QAAQ,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC/B,EAAK,EAAE,EAAI,EAAE,EAAK,EAAE,CAAE,EAAI,WAC9B,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,MAAM,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAIxD,EAFY,CAAI,CAAC,EAAE,CAEV,EAAI,WAEf,EAAE,EAAK,IAAI,CAAE,EAAI,EAAK,UAAU,CAAG,aAAe,YACpD,EAEA,EAAK,OAAO,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC9B,AAAc,eAAd,EAAK,IAAI,CACT,EAAE,EAAM,EAAI,mBACP,AAAc,qBAAd,EAAK,IAAI,CACd,EAAE,EAAM,EAAI,iBAEZ,EAAE,EAAM,EACd,EACA,EAAK,eAAe,CAAG,EACvB,EAAK,aAAa,CAAG,EACrB,EAAK,WAAW,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAK,QAAQ,CAAE,EAAI,UAAY,EACpF,EAAK,YAAY,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACvC,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,QAAQ,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CAC7D,IAAI,EAAM,CAAI,CAAC,EAAE,CAEb,GAAO,EAAE,EAAK,EAAI,UACxB,CACF,EACA,EAAK,aAAa,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACxC,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CAC/D,IAAI,EAAO,CAAI,CAAC,EAAE,AAEd,AAAc,CAAA,aAAd,EAAK,IAAI,EACP,EAAK,QAAQ,EAAI,EAAE,EAAK,GAAG,CAAE,EAAI,cACrC,EAAE,EAAK,KAAK,CAAE,EAAI,YACK,gBAAd,EAAK,IAAI,EAClB,EAAE,EAAK,QAAQ,CAAE,EAAI,UAEzB,CACF,EAEA,EAAK,UAAU,CAAG,EAClB,EAAK,cAAc,CAAG,EAAK,KAAK,CAAG,EAAK,YAAY,CAAG,EACvD,EAAK,eAAe,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC1C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,QAAQ,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAAG,CAC7D,IAAI,EAAM,CAAI,CAAC,EAAE,CAEb,GAAO,EAAE,EAAK,EAAI,aACxB,CACF,EACA,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC3C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI5D,EAFW,CAAI,CAAC,EAAE,CAEV,EAEZ,EACA,EAAK,kBAAkB,CAAG,EAAK,uBAAuB,CAAG,EAAK,mBAAmB,CACjF,EAAK,kBAAkB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC7C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,WAAW,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI7D,EAFW,CAAI,CAAC,EAAE,CAEV,EAAI,aAEhB,EACA,EAAK,eAAe,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC1C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,MAAM,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAIxD,EAFY,CAAI,CAAC,EAAE,CAEV,GAGX,IAAK,IAAI,EAAM,EAAG,EAAS,EAAK,WAAW,CAAE,EAAM,EAAO,MAAM,CAAE,GAAO,EAIvE,EAFW,CAAM,CAAC,EAAI,CAEd,EAAI,aAEhB,EACA,EAAK,eAAe,CAAG,EACvB,EAAK,eAAe,CAAG,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAClE,EAAE,EAAK,QAAQ,CAAE,EAAI,aACvB,EACA,EAAK,gBAAgB,CAAG,EAAK,iBAAiB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACpE,EAAE,EAAK,IAAI,CAAE,EAAI,cACjB,EAAE,EAAK,KAAK,CAAE,EAAI,aACpB,EACA,EAAK,oBAAoB,CAAG,EAAK,iBAAiB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACxE,EAAE,EAAK,IAAI,CAAE,EAAI,WACjB,EAAE,EAAK,KAAK,CAAE,EAAI,aACpB,EACA,EAAK,qBAAqB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAChD,EAAE,EAAK,IAAI,CAAE,EAAI,cACjB,EAAE,EAAK,UAAU,CAAE,EAAI,cACvB,EAAE,EAAK,SAAS,CAAE,EAAI,aACxB,EACA,EAAK,aAAa,CAAG,EAAK,cAAc,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAE9D,GADA,EAAE,EAAK,MAAM,CAAE,EAAI,cACf,EAAK,SAAS,CACd,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,SAAS,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI3D,EAFU,CAAI,CAAC,EAAE,CAEV,EAAI,aAEnB,EACA,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC3C,EAAE,EAAK,MAAM,CAAE,EAAI,cACf,EAAK,QAAQ,EAAI,EAAE,EAAK,QAAQ,CAAE,EAAI,aAC5C,EACA,EAAK,sBAAsB,CAAG,EAAK,wBAAwB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC7E,EAAK,WAAW,EAChB,EAAE,EAAK,WAAW,CAAE,EAAI,AAAc,2BAAd,EAAK,IAAI,EAAiC,EAAK,WAAW,CAAC,EAAE,CAAG,YAAc,cACtG,EAAK,MAAM,EAAI,EAAE,EAAK,MAAM,CAAE,EAAI,aACxC,EACA,EAAK,oBAAoB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC3C,EAAK,QAAQ,EACb,EAAE,EAAK,QAAQ,CAAE,GACrB,EAAE,EAAK,MAAM,CAAE,EAAI,aACrB,EACA,EAAK,iBAAiB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC5C,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,UAAU,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAI5D,EAFW,CAAI,CAAC,EAAE,CAEV,GAEV,EAAE,EAAK,MAAM,CAAE,EAAI,aACrB,EACA,EAAK,gBAAgB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC3C,EAAE,EAAK,MAAM,CAAE,EAAI,aACrB,EACA,EAAK,eAAe,CAAG,EAAK,sBAAsB,CAAG,EAAK,wBAAwB,CAAG,EAAK,UAAU,CAAG,EAAK,OAAO,CAAG,EAEtH,EAAK,wBAAwB,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACnD,EAAE,EAAK,GAAG,CAAE,EAAI,cAChB,EAAE,EAAK,KAAK,CAAE,EAAI,aACpB,EACA,EAAK,gBAAgB,CAAG,EAAK,eAAe,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAAI,OAAO,EAAE,EAAM,EAAI,QAAU,EACrG,EAAK,KAAK,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EAC5B,EAAK,EAAE,EAAI,EAAE,EAAK,EAAE,CAAE,EAAI,WAC1B,EAAK,UAAU,EAAI,EAAE,EAAK,UAAU,CAAE,EAAI,cAC9C,EAAE,EAAK,IAAI,CAAE,EACf,EACA,EAAK,SAAS,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACpC,IAAK,IAAI,EAAI,EAAG,EAAO,EAAK,IAAI,CAAE,EAAI,EAAK,MAAM,CAAE,GAAK,EAItD,EAFU,CAAI,CAAC,EAAE,CAEV,EAEX,EACA,EAAK,gBAAgB,CAAG,EAAK,QAAQ,CAAG,SAAU,CAAI,CAAE,CAAE,CAAE,CAAC,EACvD,EAAK,QAAQ,EAAI,EAAE,EAAK,GAAG,CAAE,EAAI,cACrC,EAAE,EAAK,KAAK,CAAE,EAAI,aACpB,C,E,C,iD,O,E,C,M,C,S,C,C,C,C,C,ECxbA,IAAI,EAAa,EAAQ,oBACrB,EAAU,EAAQ,oBAClB,EAAe,EAAQ,mBA2B3B,CAAA,EAAO,OAAO,CALd,SAAkB,CAAK,EACrB,MAAO,AAAgB,UAAhB,OAAO,GACX,CAAC,EAAQ,IAAU,EAAa,IAAU,AArB/B,mBAqB+B,EAAW,EAC1D,C,E,C,iB,Q,mB,Q,mB,O,E,C,Q,C,S,C,C,C,C,C,E,O,c,C,E,a,C,M,C,C,G,I,E,E,oB,E,E,oB,E,E,oB,E,E,oB,E,A,S,C,E,G,G,E,U,C,O,E,I,E,O,M,C,M,O,G,O,I,C,G,O,C,S,C,E,G,A,Y,E,C,I,E,O,wB,C,E,G,O,c,C,E,E,E,G,C,E,C,W,C,E,I,W,O,C,C,E,A,C,E,C,G,E,O,C,E,O,M,C,E,E,G,E,A,G,A,U,O,G,Y,E,E,C,Q,C,EEzBA,EAAe,SAACy3D,CAAD,CAAgBvoD,CAAhB,SACTuoD,AAAAA,AAAU,IAAVA,EACK,GAGF,AAAIrrD,MAAMqrD,EAAQvoD,GAAS62D,IAA3B,CAAgC,KAAKx6D,IAArC,CAA0C,GAClD,E,S,E,C,E,M,A,C,E,Y,O,Q,U,O,O,Q,C,S,C,E,O,O,C,E,S,C,E,O,G,Y,O,Q,E,W,G,Q,I,O,S,C,S,O,C,C,E,E,C,S,E,C,E,O,A,S,C,E,G,M,O,C,G,O,E,E,E,I,A,S,C,E,G,A,a,O,Q,A,M,C,C,O,Q,C,E,A,M,C,C,a,C,O,M,I,C,E,E,I,A,S,C,C,C,E,G,G,G,A,U,O,E,O,E,E,K,G,I,E,O,S,C,Q,C,I,C,G,K,C,E,I,G,W,G,E,W,E,C,E,E,W,C,I,A,E,A,Q,G,A,Q,E,O,M,I,C,G,G,A,c,G,2C,I,C,G,O,E,E,K,G,E,I,A,W,M,A,U,uI,G,C,S,E,C,C,C,E,C,A,M,G,E,E,M,A,G,C,E,E,M,A,E,I,I,E,E,E,A,M,G,E,E,I,C,C,E,C,C,C,E,C,O,C,CE8BM,IAAMm7D,EAAuB,SAACn+D,CAAD,EAAoC,MAAA,CACtEhB,KAAM,SACNgB,MAAAA,CAFsE,CAApC,ECd9Bo+D,EAAkBt1D,CAAAA,CAAQ0H,EAAAA,QAAD,CAEzB6tD,EAAsB,SAACC,CAAD,SACtB,AAAA,AAACA,EAAa5lE,IAAd,EAAsB4lE,AAAsB,aAAtBA,EAAa5lE,IAAb,CAGnB4lE,EAAa5lE,IAApB,CAFS,iBAGV,EAEK6lE,EAAiC,SAAjCA,EAAkCC,CAAD,EACrC,OAAQ,CAAA,GACN,IAAK11D,CAAAA,CAAQ01D,EAAUh4D,WAAX,CACHg4D,OAAAA,EAAUh4D,WAAjB,AACF,MAAKg4D,EAAUvgE,QAAV,GAAuByS,EAAAA,IAA5B,CACE,OAAO6tD,EAA+BC,EAAUx/D,IAAX,CACvC,MAAKw/D,EAAUvgE,QAAV,GAAuBsS,EAAAA,UAA5B,CACE,OAAOguD,EAA+BC,EAAUz3D,MAAX,CACvC,SACSs3D,OAAAA,EAAoBG,EAR/B,CAUD,EAIKC,EAA6B,SAAC54D,CAAD,EACjC,OAAQ,CAAA,GACN,IAAK,AAAwB,UAAxB,OAAOA,EAAQ7G,IAAf,CACI6G,OAAAA,EAAQ7G,IAAf,AACF,KAAK,AAAwB,YAAxB,OAAO6G,EAAQ7G,IAAf,CACH,GAAI6G,EAAQ7G,IAAR,CAAawH,WAAjB,CACE,OAAOX,EAAQ7G,IAAR,CAAawH,WAApB,CAEF,OAAO63D,EAAoBx4D,EAAQ7G,IAAT,CACvBZ,MAAAA,EAAAA,YAAY,CAACyH,GACb9H,KAAAA,EAAAA,MAAM,CAAC8H,GACV,OAAO04D,EAA+B14D,EAAQ7G,IAAT,CAClCgS,MAAAA,EAAAA,iBAAiB,CAACnL,GACXA,MAAAA,GAAAA,MAAAA,CAAAA,EAAQ7G,IAAR,CAAa2/D,QAAb,CAAsBn4D,WAAtB,EAAqC,UAA/C,YACGyK,MAAAA,EAAAA,iBAAiB,CAACpL,GACXA,MAAAA,GAAAA,MAAAA,CAAAA,EAAQ7G,IAAR,CAAa2/D,QAAb,CAAsBn4D,WAAtB,EAAqC,UAA/C,YACG2K,MAAAA,EAAAA,MAAM,CAACtL,GACV,MAAO,MACJwL,MAAAA,EAAAA,UAAU,CAACxL,GACd,MAAO,UACJyL,MAAAA,EAAAA,YAAY,CAACzL,GAChB,MAAO,YACJ0L,MAAAA,EAAAA,UAAU,CAAC1L,GACd,MAAO,UACT,SACE,MAAO,oBAxBX,CA0BD,EAEK+4D,EAAa,SAACC,CAAD,CAAa74D,CAAb,EAA0BA,MAAAA,AAAa,aAAbA,CAA1B,EAEb84D,EAAyB,SAACx0D,CAAD,EAAA,MAC7BA,AAAa,CAAA,IAAbA,GACAA,AAAa,CAAA,IAAbA,GACAA,AAAa,OAAbA,GACAA,AAAa,KAAbA,CAJ6B,EAMzBM,EAAc,SAACm0D,CAAD,CAAoBC,CAApB,EACZC,IAAAA,EAAgB,CAAA,EAMtB,OAJAplE,OAAO4J,IAAP,CAAYs7D,GACThgE,MADH,CACU,SAAA2E,CAAG,EAAIs7D,OAAAA,EAAGD,CAAa,CAACr7D,EAAf,CAAqBA,EAA3B,GACVgE,OAFH,CAEW,SAAAhE,CAAG,EAAKu7D,OAAAA,CAAa,CAACv7D,EAAd,CAAqBq7D,CAAa,CAACr7D,EAAxC,AAAA,GAEPu7D,CACR,EAEKC,EAAoB,SAApBA,EACJr5D,CADwB,CAExBgE,CAFwB,EAI4CA,IAAAA,EAAAA,EAA5DrD,WAAR,CAEA,GAAI,AAAmB,UAAnB,OAAOX,EACFs4D,OAAAA,EAAqBt4D,GACvB,GAAI,AAAmB,UAAnB,OAAOA,EACT+iE,MD7D6D,CACtE5pE,KAAM,SACNgB,MC2D8B6F,CD7DwC,EC8D/D,GAAI,CAACi3D,EAAAA,OAAK,CAAC9xD,cAAN,CAAqBnF,GAC/B,MAAM,AAAI/M,MAC+D+M,+DAAAA,MAAAA,CAAAA,EAAAA,GADzE,MAKF,IAAMW,EAAc44D,AAZpB,CAAA,AAAA,KAAA,IAAA,EAAqCX,EAArC,CAAoE50D,EAYlChE,GAE5BwE,EAAQO,EAAY/E,EAAQwE,KAAT,CAAgBu0D,EACrB,QAAhB/4D,EAAQumB,GAAR,EACF/hB,CAAAA,EAAM+hB,GAAN,CAAYvmB,EAAQumB,GAApB,AAAoBA,EAGtB,IAAM1oB,EAAMmC,EAAQnC,GAApB,AACmB,CAAA,UAAf,OAAOA,GAAoBA,EAAI6rB,MAAJ,CAAW,QAExCllB,CAAAA,EAAM3G,GAAN,CAAYA,CAAZ2G,EAGF,IAAM3B,EAAekC,EAAY/E,EAAQ7G,IAAR,CAAa0J,YAAb,EAA6B,CAAA,EAAIk2D,GAC5DS,EAAYvC,EAAAA,OAAK,CAAC3yD,QAAN,CAAegpB,OAAf,CAAuBttB,EAAQwE,KAAR,CAAcC,QAArC,EACfvL,MADe,CACR+/D,GACP37D,GAFe,CAEX,SAAA2H,CAAK,EAAA,OAAIo0D,EAAkBp0D,EAAOjB,EAA7B,UAEZ,AAAIu0D,GAAmBv4D,EAAQ7G,IAAR,GAAiBwR,EAAAA,QAAxC,CDjE2B,CAC3BxR,KAAM,gBACN0E,ICgEqCA,ED/DrC27D,UC+D0CA,CDlEf,EAXD,CAC1BrgE,KAAM,eACNwH,YC+EEA,ED9EF6D,MC+EEA,ED9EF3B,aC+EEA,ED9EF22D,UC+EEA,CDpFwB,CCsF3B,ECzID,SAASC,IAAa,CAETC,IAAAA,EAAiB,SAACrjD,CAAD,EAC5BA,OAAAA,EACGhV,QADH,GAEGtF,KAFH,CAES,MACNuB,GAHH,CAGO,SAAAiY,CAAI,EAAIA,OAAAA,EAAKokD,IAAL,EAAJ,GACRx8D,IAJH,CAIQ,GALoB,EAW9B,EAAe,SAACkZ,CAAD,CAAerS,CAAf,EACmDA,IAAAA,EAAAA,EAAxD81D,aAAR,CAAQA,EAAR,AAAA,KAAA,IAAA,EAH2BJ,EAG3B,SACA,AAAI,AAD4D11D,EAAlBY,aAA9C,EACsBk1D,IAJKJ,EAQpBI,EAAczjD,GAHZyjD,EAAcL,EAIxB,ECXD,EAAe,SACbt/D,CADa,CAEbgO,CAFa,CAGb6xD,CAHa,CAIbh2D,CAJa,EAMb,IAAMi2D,EJ2BCC,AAzCT,SAASA,EAAe//D,CAAxB,CAAoCggE,CAApC,SAEMhgE,AAAU,OAAVA,GAAkB,AAAiB,WAAjB,EAAOA,IAM3BA,aAAiB+V,MACjB/V,aAAiB8V,QACjBgnD,EAAM9xD,cAAN,CAAqBhL,GAPdA,GAYTggE,EAAKvuC,GAAL,CAASzxB,GAGL6D,MAAMC,OAAN,CAAc9D,IACTA,EAAMmD,GAAN,CAAU,SAAAe,CAAC,EAAA,OAAI67D,EAAe77D,EAAG87D,EAAtB,GAIbnmE,OAAO4J,IAAP,CAAYzD,GAChBk5B,IADI,GAEJl1B,MAFI,CAEG,SAACxG,CAAD,CAASkG,CAAT,QACM,WAARA,IAGAA,AAAQ,YAARA,GAAqBs8D,EAAKruD,GAAL,CAAS3R,CAAK,CAAC0D,EAAf,EAEvBlG,CAAM,CAACkG,EAAP,CAAc,aAGdlG,CAAM,CAACkG,EAAP,CAAcq8D,EAAe//D,CAAK,CAAC0D,EAAP,CAAas8D,IAPlCxiE,CAUV,EAAE,CAAA,EACN,EIxBoCwC,EJ2BN,IAAIigE,SIzB3BC,EAAmBC,EAAAA,WAAW,CAACL,EAAiB,CACpDM,UAAW,SAACC,CAAD,CAAa32D,CAAb,CAAmB42D,CAAnB,EACT,IAAMC,EAAeF,CAAU,CAAC32D,EAAhC,QAEA,AAAI62D,GAAgBv1D,EAAAA,cAAc,CAACu1D,GAC1BC,EACLtB,EAAkBqB,EAAc12D,GAChC,CAAA,EACAg2D,EACAh2D,GAIA,AAAwB,YAAxB,OAAO02D,EACFd,EAAec,EAAc12D,GAG/By2D,CACR,CAlBmD,UAqBtD,AAAItyD,EACKkyD,EACJriE,OADI,CACI,OAAQ,KAChBA,OAFI,CAEI,MAAO,KACfA,OAHI,CAGI,MAAO,KACfA,OAJI,CAII,OAAQ,KAChBA,OALI,CAKI,MAAO,KAIbqiE,EACJriE,OADI,CACI,MAAO0/D,EAAO,EAAG1zD,EAAQlD,OAAZ,GACrB9I,OAFI,CAEI,YAAkB0/D,KAAAA,MAAAA,CAAAA,EAAOsC,EAAM,EAAGh2D,EAAQlD,OAAlB,EAFnC,MAGD,ECzCK85D,EAAkB,SACtBrtD,CADsB,CAEtBpF,CAFsB,CAGtB6xD,CAHsB,CAItBh2D,CAJsB,EAMtB,GAAI,AAAqB,UAArB,OAAOuJ,EACEoB,MAAAA,IAAAA,MAAAA,CAAAA,OAAOpB,GAAlB,KAGF,GAAI,AAAqB,UAArB,OAAOA,EACE41D,MAAAA,IAAAA,MAAAA,CAbuB1xD,AAahBlE,EAbkBvV,OAAF,CAAU,KAAM,UAalD,KAMF,GAAI,AAAqB,WAArB,EAAOuV,GAAwB,CACjC,IAAMstD,EAAoBttD,EACvButD,OADuB,GAEvBz5D,QAFuB,GAGvBrJ,OAHuB,CAGf,iBAAkB,aAEzB,AAAC6iE,EAIL,YAAA,MAAA,CAAmBA,EAAnB,OAHE,YAIH,OAED,AAAI,AAAqB,YAArB,OAAOttD,EACT,IAAA,MAAA,CAAWqsD,EAAersD,EAAWvJ,GAArC,KAGEmB,EAAAA,cAAc,CAACoI,GACjB,IAAA,MAAA,CAAWotD,EACTtB,EAAkB9rD,EAAWvJ,GAC7B,CAAA,EACAg2D,EACAh2D,GAJF,KAQEuJ,aAAqB2C,KACvB,AAAI6qD,MAAMxtD,EAAUutD,OAAV,IACR,kBAEmBvtD,cAAAA,MAAAA,CAAAA,EAAUytD,WAAV,GAArB,OAGEhE,AAAAA,EAAAA,aAAa,CAACzpD,IAAcvP,MAAMC,OAAN,CAAcsP,GACjCwsD,IAAAA,MAAAA,CAAAA,EAA2BxsD,EAAWpF,EAAQ6xD,EAAKh2D,GAA9D,KAGS2K,IAAAA,MAAAA,CAAAA,OAAOpB,GAAlB,IACD,EC7DD,EAAe,SACb1a,CADa,CAEbqoE,CAFa,CAGb/gE,CAHa,CAIbghE,CAJa,CAKb17D,CALa,CAMb0I,CANa,CAOb6xD,CAPa,CAQbh2D,CARa,EAcb,GAAI,CAACk3D,GAAY,CAACC,EAChB,MAAM,AAAIloE,MACKJ,aAAAA,MAAAA,CAAAA,EADf,0DAOF,IAAQuoE,EAAuCp3D,EAAvCo3D,yBAAR,CAAmCt6D,EAAYkD,EAAZlD,OAAnC,CAEMu6D,EAAqBT,EAJTM,EAAW/gE,EAAQsF,EAIiB0I,EAAQ6xD,EAAKh2D,GAE/Ds3D,EAA2B,IAC3BC,EAAmC7D,KAAAA,MAAAA,CAAAA,EAAOsC,EAAM,EAAGl5D,IACjD06D,EAAuBH,EAAmBzkE,QAAnB,CAA4B,MAkBlD,OAfLwkE,GACAC,AAAuB,YAAvBA,GACA,CAACF,GAGDG,EAA2B,GAC3BC,EAA8B,IACrBH,GAA6BC,AAAuB,WAAvBA,GACtCC,GAA+BzoE,GAAAA,MAAAA,CAAAA,GAC/B0oE,GAAkC1oE,GAAAA,MAAAA,CAAAA,KAElCyoE,GAAwB,GAAA,MAAA,CAAOzoE,EAAP,KAAA,MAAA,CAAewoE,GACvCE,GAA2B,GAAA,MAAA,CAAO1oE,EAAP,KAAA,MAAA,CAAewoE,IAGrC,CACLC,yBAAAA,EACAC,4BAAAA,EACAC,qBAAAA,CAHK,CAKR,ECpDD,EAAe,SACbE,CADa,CAEbC,CAFa,EAIPtsB,IAAAA,EAAQqsB,EAAc7jE,KAAd,CACZ,EACA6jE,EAActnE,MAAd,CAAuB,EAAIsnE,EAActnE,MAAd,CAAuB,EAAI,GAElDwnE,EAAeF,CAAa,CAACA,EAActnE,MAAd,CAAuB,EAA1D,CAoBA,OAjBEwnE,GACCD,CAAAA,AAAqB,WAArBA,EAAYxiE,IAAZ,EAAiCwiE,AAAqB,WAArBA,EAAYxiE,IAAZ,AAAqB,GACtDyiE,CAAAA,AAAsB,WAAtBA,EAAaziE,IAAb,EAAkCyiE,AAAsB,WAAtBA,EAAaziE,IAAb,AAAsB,EAEzDk2C,EAAM31C,IAAN,CACE4+D,EACE3pD,OAAOitD,EAAazhE,KAAd,EAAuBwU,OAAOgtD,EAAYxhE,KAAb,KAInCyhE,GACFvsB,EAAM31C,IAAN,CAAWkiE,GAGbvsB,EAAM31C,IAAN,CAAWiiE,IAGNtsB,CACR,EGvBKwsB,EAA8C,SAClD77D,CADkD,CAElD87D,CAFkD,CAGlD3zD,CAHkD,CAIlD6xD,CAJkD,CAKlDh2D,CALkD,EAOlD,IAAQlD,EAAYkD,EAAZlD,OAAR,OAEA,AAAId,AAAiB,WAAjBA,EAAQ7G,IAAR,CACK2iE,EACJ//D,KADI,CACE,MACNuB,GAFI,CAEA,SAACiY,CAAD,CAAO2e,CAAP,SACCA,AAAAA,AAAW,IAAXA,EACK3e,EAGT,GAAA,MAAA,CAAUmiD,EAAOsC,EAAKl5D,IAAtB,MAAA,CAAiCyU,EAClC,GACApY,IATI,CASC,MAGH2+D,CACR,EAuBKC,EAA2B,SAC/BhX,CAD+B,CAE/BiX,CAF+B,CAG/BhC,CAH+B,CAI/Bl5D,CAJ+B,CAK/Bm7D,CAL+B,SAO3B,AAACA,EAKHvE,EAAOsC,EAAKl5D,GAAS1M,MAArB,CAA8B4nE,EAAsB5nE,MAApD,CACA6nE,EALOlX,EAAW3wD,MAAX,CAAoB,CAO9B,EAqBD,EAAe,SACbiF,CADa,CAEb8O,CAFa,CAGb6xD,CAHa,CAIbh2D,CAJa,EAMb,IACE7K,EAKEE,EALFF,IADF,CAMIE,EAAAA,EAJFsH,WAFF,CAEEA,EAFF,AAAA,KAAA,IAAA,EAEgB,GAFhB,EAGE64D,EAGEngE,EAHFmgE,SAHF,CAMIngE,EAAAA,EAFFmL,KAJF,CAIEA,EAJF,AAAA,KAAA,IAAA,EAIU,CAAA,EAJV,EAMInL,EAAAA,EADFwJ,YALF,CAKEA,EALF,AAAA,KAAA,IAAA,EAKiB,CAAA,EALjB,EAQI1J,GAAAA,AAAS,iBAATA,EACF,MAAM,AAAIlG,MACwFkG,gGAAAA,MAAAA,CAAAA,IAIpG,IACE4L,EAKEf,EALFe,WADF,CAEEk3D,EAIEj4D,EAJFi4D,6BAFF,CAGEt2D,EAGE3B,EAHF2B,gBAHF,CAIE22D,EAEEt4D,EAFFs4D,SAJF,CAKEx7D,EACEkD,EADFlD,OALF,CAQI42C,EAAU/2C,IAAAA,MAAAA,CAAAA,GAEV47D,EAAgB7kB,EAChB8kB,EAAmB9kB,EACnB+kB,EAAwB,CAAA,EAEtBC,EAAwB,EAA9B,CAEMC,ED3HN,AAAI3+D,MAAMC,OAAN,CC2HuC8G,GD1HlC,SAAClH,CAAD,EAAA,OAAiB3E,AAAwB,KAAxBA,AC0HiB6L,ED1HVO,OAAP,CAAezH,EAAhC,EAEA,SAACA,CAAD,EAAiB3E,OAAAA,ACwHiB6L,EDxHVP,ACwHGA,CDxHE,CAAC3G,EAAP,CAAaA,EAApC,EC0HT7J,OAAO4J,IAAP,CAAY4G,GACTtL,MADH,CACUyjE,GACPzjE,MAFH,CAlF0D,SAAAiH,CAAQ,EAC5Dy8D,IAAAA,EAAmB5oE,OAAO4J,IAAP,CAmFYiF,GAnFcjM,QAA1B,CAAmCuJ,GAC5D,MACE,CAACy8D,GACAA,GAAoB/5D,AAgFcA,CAhFF,CAAC1C,EAAb,GAA2BqE,AAgFCA,CAhFI,CAACrE,EAFxD,AAID,GA+EI0B,OAHH,CAGW,SAAA1B,CAAQ,EAAA,OAAIu8D,EAAsBhjE,IAAtB,CAA2ByG,EAA/B,GAEnBnM,OAAO4J,IAAP,CAAYiF,GACT3J,MADH,CACUyjE,GACPzjE,MAFH,CAEU,WAAA,OAAMyM,CAAN,GACPzM,MAHH,CAGU,SAAA2jE,CAAe,EAAA,MAAI,CAACH,EAAsB9lE,QAAtB,CAA+BimE,EAApC,GACtBh7D,OAJH,CAIW,SAAAg7D,CAAe,EAAA,OAAIH,EAAsBhjE,IAAtB,CAA2BmjE,EAA/B,GAEpB9X,IAAAA,GFvIA+X,EAAct4D,AEuI2Bk4D,EFvIrB9lE,QAAN,CAAe,OAC7BmmE,EAAcv4D,AEsI2Bk4D,EFtIrB9lE,QAAN,CAAe,OAE7BomE,EAAgBx4D,AEoIyBk4D,EFpInBxjE,MAAN,CAAa,SAAA+jE,CAAO,EAAA,MAAI,CARF,CAAC,MAAO,MAAR,CAAermE,QAAf,CAQmBqmE,EAArB,GAEpCC,EAAcC,AEkIgBb,EFlIG,EAC/BU,EAAc3pC,IAAd,IAD+B,EAE/B2pC,GAEJD,GACFG,EAAYjjC,OAAZ,CAAoB,OAGlB6iC,GACFI,EAAYjjC,OAAZ,CAAoB,OAGfijC,GEkKP,GA1CAnY,EAAWljD,OAAX,CAAmB,SAAAu7D,CAAa,EAC9B,IAAA,EAIInC,EACFmC,EACAppE,OAAO4J,IAAP,CAAY4G,GAAO5N,QAAnB,CAA4BwmE,GAC5B54D,CAAK,CAAC44D,EAHM,CAIZppE,OAAO4J,IAAP,CAAYiF,GAAcjM,QAA1B,CAAmCwmE,GACnCv6D,CAAY,CAACu6D,EALD,CAMZj1D,EACA6xD,EACAh2D,GAXAs3D,EADF,EACEA,wBADF,CAEEC,EAFF,EAEEA,2BAFF,AAAA,CAAA,EAGEC,oBAHF,EAgBEiB,CAAAA,EAAwB,CAAA,CAD1B,EAIAF,GAAiBjB,EACjBkB,GAAoBjB,CACrB,GAEDiB,GAAgB,KAAA,MAAA,CAAS9E,EAAOsC,EAAKl5D,IA5FrCk7D,EAiGIO,EAhGJE,EAiGIA,EAOF/kB,EAlGF,AAACqkB,CAAAA,EAyFGhX,EAvFFiX,EA2FEhC,EACAl5D,EACAm7D,IAxFFQ,CAAAA,GACF,CAoFIt0D,EAMIq0D,EAEAD,EAGJ/C,GAAaA,EAAUplE,MAAV,CAAmB,EAAG,CACrC,IFpLI0oE,EACAC,EAEAC,EAEAE,EEgENlB,EACAS,EA8GQa,EAAStD,EAAM,EAErBtiB,GAAO,IAEFvvC,GAEHuvC,CAAAA,GADO,KACAggB,EAAO4F,EAAQx8D,EAAtB42C,EAGFA,GAAO8hB,EACJr7D,MADI,CACGs9D,EAAwC,EAD3C,EAEJn+D,GAFI,CA5JN,SAAA0C,CAAO,EACV67D,OAAAA,EACE77D,EACA26D,EAAe36D,EA2JUmI,EAAQm1D,EAAQt5D,GAAhBmE,EAAQm1D,EAAQt5D,EA9JjC,GA+JL7G,IAHI,CAGC,AAACgL,EAA0C,GAA3C,KAAA,MAAA,CAAeuvD,EAAO4F,EAAQx8D,KAEjCqH,GAEHuvC,CAAAA,GADO,KACAggB,EAAO4F,EAAS,EAAGx8D,EAA1B42C,EAEFA,GAAY/2C,KAAAA,MAAAA,CAAAA,EAAZ,IACD,MAEIo7D,EACChX,EACAwX,EACAvC,EACAl5D,EACAm7D,IAGFvkB,CAAAA,GAAO,GATT,EAYAA,GAAO,KAGT,OAAOA,CACR,ECnNK6lB,EAA0C,iBAE1CC,EAAyB,SAC7B78D,CAD6B,CAE7B9C,CAF6B,CAG7B27D,CAH6B,EAKzBh1D,IAAAA,EAAQ,CAAA,EAKL,OAJH3G,GACF2G,CAAAA,EAAQ,CAAE3G,IAAAA,CAAF,CAAA,EAGH,CACL1E,KAAM,eACNwH,YAAAA,EACA6D,MAAAA,EACA3B,aAAc,CAAA,EACd22D,UAAAA,CALK,CAOR,EAMD,EAAe,SACbngE,CADa,CAEb8O,CAFa,CAGb6xD,CAHa,CAIbh2D,CAJa,EAMb,IAUIrD,EAVIxH,EAAyBE,EAAzBF,IAAR,CAAc0E,EAAmBxE,EAAnBwE,GAAd,CAAmB27D,EAAcngE,EAAdmgE,SAAnB,CAEIrgE,GAAAA,AAAS,kBAATA,EACF,MAAM,AAAIlG,MACyFkG,iGAAAA,MAAAA,CAAAA,IAiBrG,OAAO+iE,EACLsB,EAdiCx5D,EAA3B05D,sBAAR,CAIMC,AApBe,IAArBnE,AADoB,AAqBAngE,EArBGmgE,SAAH,CACVplE,MAAV,EAFsB,AAsBuBiF,EAtBpBwE,GAAH,CAuBJ0/D,EA7CyB,GAkD3BA,EAIsB1/D,EAAK27D,GACzCrxD,EACA6xD,EACAh2D,EAEH,EC/DK85D,EAAe,CAAC,IAAK,IAAK,IAAK,IAArC,CAYMC,EAAwB,SAACtsD,CAAD,EACxB9Z,IAAAA,EAAS8Z,EASb,OARI9Z,EAAOC,QAAP,CAAgB,MAClBD,CAAAA,EAASA,EAAOK,OAAP,CAAe,eAAgB,WAD1C,EAIIL,EAAOI,UAAP,CAAkB,MACpBJ,CAAAA,EAASA,EAAOK,OAAP,CAAe,cAAe,WADzC,EAIOL,CACR,EAED,EAAe,SACb0B,CADa,CAEb8O,CAFa,CAGb6xD,CAHa,CAIbh2D,CAJa,EAMb,GAAI3K,AAAc,WAAdA,EAAKF,IAAL,CACF,OAAOwV,OAAOtV,EAAKc,KAAN,EAGf,GAAId,AAAc,WAAdA,EAAKF,IAAL,CACF,KAhCYsY,EAgCZ,OAAOpY,EAAKc,KAAL,CACA4jE,GAAAA,MAAAA,CAAAA,GAjCKtsD,EAiCwB9C,OAAOtV,EAAKc,KAAN,EAhC5C,AAHA2jE,EAAa/mC,IAAb,CAAkB,SAAAinC,CAAW,EAAA,OAAIvsD,AAGZA,EAHc7a,QAAF,CAAWonE,EAAf,GAO7B,KAAA,MAAA,CAAavsD,EAAb,MAHSA,KAgCH,EAHN,CAMA,GAAIpY,AAAc,iBAAdA,EAAKF,IAAL,CACK+iE,OAAAA,EAAuB7iE,EAAM8O,EAAQ6xD,EAAKh2D,GAGnD,GAAI3K,AAAc,kBAAdA,EAAKF,IAAL,CACKskE,OAAAA,EAAwBpkE,EAAM8O,EAAQ6xD,EAAKh2D,EAGpD,OAAM,AAAIwN,UAAJ,uBAAA,MAAA,CAAqCnY,EAAKF,IAA1C,CAAN,KACD,C,C,E,O,CElD+B,SAC9B6G,CAD8B,EAc3B,IAAA,EAAA,UAAA,MAAA,CAAA,GAAA,AAAA,KAAA,IAAA,SAAA,CAAA,EAAA,CAAA,SAAA,CAAA,EAAA,CADU,CAAA,EACV,EAAA,EAXD+E,WAWC,CAAA,EAAA,EAVDY,gBAUC,CAAA,EAAA,EATDf,aASC,CARDk1D,EAQC,EARDA,aAQC,CAAA,EAAA,EAPDh5D,OAOC,CAAA,EAAA,EANDs6D,yBAMC,CAAA,EAAA,EALDsC,sBAKC,CAAA,EAAA,EAJDpB,SAIC,CAHDL,EAGC,EAHDA,6BAGC,CAFDt7D,EAEC,EAFDA,WAEC,CACC,GAAA,CAACX,EACH,MAAM,AAAI/M,MAAM,wDAGlB,IAAM+Q,EAAU,CACde,YANC,AAAA,KAAA,IAAA,EAXa,EAWb,CAAA,EAODY,iBAPC,AAAA,KAAA,IAAA,GAAA,EAQDf,cARC,AAAA,KAAA,IAAA,GAAA,EASDk1D,cAAAA,EACAh5D,QAVC,AAAA,KAAA,IAAA,EAPS,EAOT,EAWDs6D,0BAXC,AAAA,KAAA,IAAA,GAAA,EAYDsC,uBAZC,AAAA,KAAA,IAAA,GAAA,EAaDpB,UAbC,AAAA,KAAA,IAAA,GAAA,EAcDL,8BAAAA,EACAt7D,YAAAA,CAVc,EAaTojE,ODhCPpJ,ECgCkBtB,EAAkBr5D,EAASgE,GDhCxB,CAAA,EAAO,ECgC2BA,EACxD,E,E,c,C,E,E,yB,CX7BwC,SAACqS,CAAD,EAAqBA,OAAAA,EAAGhV,QAAH,EAArB,C,E,C,mB,Q,mB,Q,iB,Q,mB,O,E,C,Q,C,S,C,C,C,C,C,EYXzC;;;;;CAKC,EAAA,IAAA,EAAA,EAAA,kDAED,SAAS,EAAS,CAAC,EACjB,MAAO,AAAsC,oBAAtC,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EACxC,CAEA,SAAS,EAAc,CAAC,EACtB,IAAI,EAAK,QAET,AAAoB,CAAA,IAAhB,EAAS,KAIA,KAAA,IADb,CAAA,EAAO,EAAE,WAAW,AAAX,GAKc,CAAA,IAAnB,EADJ,EAAO,EAAK,SAAS,GAIjB,AAAyC,CAAA,IAAzC,EAAK,cAAc,CAAC,iBAM1B,C,E,iB,C,GAEA,EAAA,MAAA,CAAA,EAAA,gBAAA,IAAS,E,E,C,iD,O,E,C,Q,C,S,C,C,C,C,C,E,I,E,I,E,I,C,Q,E,W,M,A,C,E,O,M,E,S,C,E,I,I,E,E,E,E,U,M,C,E,E,I,I,I,K,E,S,C,E,C,O,S,C,c,C,I,C,E,I,C,C,C,E,C,C,C,E,A,E,O,C,C,E,K,C,I,C,U,E,E,I,E,I,C,c,E,W,I,I,E,E,E,E,E,U,M,C,E,E,I,G,S,C,E,C,M,C,I,I,E,M,G,E,E,E,E,E,E,I,I,I,E,S,C,E,C,E,E,E,E,M,C,E,E,I,I,C,C,E,C,C,C,E,C,O,C,E,O,c,C,E,a,C,M,C,C,GEOT,IAAM,EAAc,EAAE,AA2CtB,CAAA,EAAA,WAAA,CAAA,SAAgB,EAAY,CAAU,CAAE,CAA4B,CAAE,CAAgB,EAAhB,KAAA,IAAA,GAAA,CAAA,EAAA,EAAA,EAQlE,IAAM,EAAe,EAAA,EAAA,CAAA,EALsB,CACvC,OAAQ,IACR,aAAc,CAAA,CACjB,GAE8C,GAK3C,EADA,AAAyC,KAAA,IAAzC,EAAgB,oBAAoB,CAC3B,CACL,QAAgB,KAChB,eAAgB,KAChB,IAAgB,EAChB,OAAgB,EAAM,EAAgB,MAAM,AAC/C,EAEQ,CACL,QAAgB,gCAChB,eAAgB,yCAChB,IAAgB,2BAChB,OAAgB,6BACnB,EAGL,IAAM,EAAmB,SAAC,CAAc,EACpC,GAAI,AAAyC,KAAA,IAAzC,EAAgB,oBAAoB,CACpC,OAAO,EAGX,IAAM,EAAW,EACZ,OAAO,CAAC,AAAI,OAAO,EAAO,OAAO,CAAE,KAAM,IACzC,OAAO,CAAC,AAAI,OAAO,EAAO,cAAc,CAAE,KAAM,KAChD,OAAO,CAAC,AAAI,OAAO,EAAO,GAAG,CAAG,IAAM,EAAO,MAAM,CAAE,KAAM,WAEhE,AAAI,EAAS,MAAM,EAAI,EAAgB,oBAAoB,CAChD,EAGJ,EACF,OAAO,CAAC,AAAI,OAAO,EAAO,OAAO,CAAG,IAAM,EAAO,cAAc,CAAE,KAAM,MACvE,OAAO,CAAC,AAAI,OAAO,EAAO,GAAG,CAAE,KAAM,GACrC,OAAO,CAAC,AAAI,OAAO,EAAO,MAAM,CAAE,KAAM,EAAM,EAAgB,MAAM,CAC7E,EAEA,GAAI,AAAwB,KAAxB,EAAK,OAAO,CAAC,GACb,MAAO,eAGX,GAAI,MAAA,GAEA,AAAiB,UAAjB,OAAO,GACP,AAAiB,WAAjB,OAAO,GACP,AAAiB,YAAjB,OAAO,GACP,AAAiB,UAAjB,OAAO,IAjFG,EAkFD,EAjFN,AAA0C,oBAA1C,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAmFlC,OAAO,OAAO,GAGlB,GAAI,aAAiB,KACjB,MAAO,aAAa,EAAM,WAAW,GAAE,KAG3C,GAAI,MAAM,OAAO,CAAC,GAAQ,CACtB,GAAI,AAAiB,IAAjB,EAAM,MAAM,CACZ,MAAO,KAGX,EAAK,IAAI,CAAC,GAEV,IAAM,EAAM,IAAM,EAAO,OAAO,CAAG,EAAM,GAAG,CAAC,SAAC,CAAE,CAAE,CAAC,EAC/C,IAAM,EAAM,EAAM,MAAM,CAAG,IAAM,EAAI,EAAO,OAAO,CAAG,IAAM,EAAO,cAAc,CAE7E,EAAQ,EAAY,EAAI,EAAiB,EAAM,EAAgB,MAAM,EAKzE,OAJI,EAAgB,SAAS,EACzB,CAAA,EAAQ,EAAgB,SAAS,CAAC,EAAO,EAAG,EADhD,EAIO,EAAO,MAAM,CAAG,EAAQ,CACnC,GAAG,IAAI,CAAC,IAAM,EAAO,GAAG,CAAG,IAI3B,OAFA,EAAK,GAAG,GAED,EAAiB,EAC3B,CAED,GA5HM,EAAO,OADF,EA6HD,GA3HH,AAAU,OAAV,GAAmB,CAAA,AAAS,WAAT,GAAqB,AAAS,aAAT,CAAS,EA2HtC,CACd,IAjFA,EAlCU,EAXH,EACL,EAmBqB,EA0GnB,EAAO,EAAO,OAAO,IAAI,CAAC,GAzG3B,OAAO,qBAAqB,CADR,EA0GyC,GAzGxB,MAAM,CAAC,SAAC,CAAS,EAAc,OAAA,OAAO,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAQ,EAAnD,IA+GvE,GAJI,EAAgB,MAAM,EACtB,CAAA,EAAU,EAAQ,MAAM,CAAC,SAAA,CAAE,EAAI,OAAA,EAAgB,MAAM,EAAI,EAAgB,MAAM,CAAC,EAAO,EAAxD,EAAA,EAG/B,AAAmB,IAAnB,EAAQ,MAAM,CACd,MAAO,KAGX,EAAK,IAAI,CAAC,GAEV,IAAM,EAAM,IAAM,EAAO,OAAO,CAAG,EAAQ,GAAG,CAAC,SAAC,CAAE,CAAE,CAAC,EACjD,IAAM,EAAM,EAAQ,MAAM,CAAG,IAAM,EAAI,EAAO,OAAO,CAAG,IAAM,EAAO,cAAc,CAC7E,EAAW,AAAc,UAAd,OAAO,EAClB,EAAY,CAAC,GAAY,wBAAwB,IAAI,CAAC,EAAG,QAAQ,IACjE,EAAM,GAAY,EAAY,EAAK,EAAY,EAAI,GAErD,EAAQ,EAAY,CAAK,CAAC,EAAG,CAAE,EAAiB,EAAM,EAAgB,MAAM,EAKhF,OAJI,EAAgB,SAAS,EACzB,CAAA,EAAQ,EAAgB,SAAS,CAAC,EAAO,EAAI,EADjD,EAIO,EAAO,MAAM,CAAG,OAAO,GAAO,KAAO,EAAQ,CACxD,GAAG,IAAI,CAAC,IAAM,EAAO,GAAG,CAAG,IAI3B,OAFA,EAAK,GAAG,GAED,EAAiB,EAC3B,OAID,CAFA,EAAQ,OAAO,GAAO,OAAO,CAAC,UAAW,SAAA,CAAC,EAAI,MAAA,AAAM,OAAN,EAAa,MAAQ,KAArB,GAEzC,EAAgB,YAAY,EAM1B,IADP,CAAA,EAAQ,EAAM,OAAO,CAAC,QAAS,MAA/B,EACgB,IAJL,IADP,CAAA,EAAQ,EAAM,OAAO,CAAC,KAAM,MAA5B,EACgB,GAKxB,C,E,C,E,C,M,C,S,C,C,C,C,C,ECjNE,EAAO,OAAO,CAAG,EAAQ,mB,E,C,iB,O,E,C,Q,C,S,C,C,C,C,C,GCQxB,AAAA,WAiBH,IAeI,EAfA,EAAsB,OAAO,GAAG,CAAC,iBACjC,EAAqB,OAAO,GAAG,CAAC,gBAChC,EAAuB,OAAO,GAAG,CAAC,kBAClC,EAA0B,OAAO,GAAG,CAAC,qBACrC,EAAuB,OAAO,GAAG,CAAC,kBAClC,EAAuB,OAAO,GAAG,CAAC,kBAClC,EAAsB,OAAO,GAAG,CAAC,iBACjC,EAA6B,OAAO,GAAG,CAAC,wBACxC,EAA0B,OAAO,GAAG,CAAC,qBACrC,EAAuB,OAAO,GAAG,CAAC,kBAClC,EAA4B,OAAO,GAAG,CAAC,uBACvC,EAAmB,OAAO,GAAG,CAAC,cAC9B,EAAmB,OAAO,GAAG,CAAC,cAC9B,EAAwB,OAAO,GAAG,CAAC,mBA+BvC,SAAS,EAAO,CAAM,EACpB,GAAI,AAAkB,UAAlB,OAAO,GAAuB,AAAW,OAAX,EAAiB,CACjD,IAAI,EAAW,EAAO,QAAQ,CAE9B,OAAQ,GACN,KAAK,EACH,IAAI,EAAO,EAAO,IAAI,CAEtB,OAAQ,GACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACH,OAAO,CAET,SACE,IAAI,EAAe,GAAQ,EAAK,QAAQ,CAExC,OAAQ,GACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACH,OAAO,CAET,SACE,OAAO,CACX,CAEJ,CAEF,KAAK,EACH,OAAO,CACX,CACF,CAGF,CAlEE,EAAyB,OAAO,GAAG,CAAC,0BA+EtC,IAAI,EAAsC,CAAA,EACtC,EAA2C,CAAA,CA6D/C,CAAA,EAAQ,eAAe,CA1ED,EA2EtB,EAAQ,eAAe,CA1ED,EA2EtB,EAAQ,OAAO,CA1ED,EA2Ed,EAAQ,UAAU,CA1ED,EA2EjB,EAAQ,QAAQ,CA1ED,EA2Ef,EAAQ,IAAI,CA1ED,EA2EX,EAAQ,IAAI,CA1ED,EA2EX,EAAQ,MAAM,CA1ED,EA2Eb,EAAQ,QAAQ,CA1ED,EA2Ef,EAAQ,UAAU,CA1ED,EA2EjB,EAAQ,QAAQ,CA1ED,EA2Ef,EAAQ,YAAY,CA1ED,EA2EnB,EAAQ,WAAW,CAvEnB,SAAqB,CAAM,EASzB,OAPO,IACH,EAAsC,CAAA,EAEtC,QAAQ,IAAO,CAAC,2FAIb,CAAA,CACT,EA8DA,EAAQ,gBAAgB,CA7DxB,SAA0B,CAAM,EAS9B,OAPO,IACH,EAA2C,CAAA,EAE3C,QAAQ,IAAO,CAAC,gGAIb,CAAA,CACT,EAoDA,EAAQ,iBAAiB,CAnDzB,SAA2B,CAAM,EAC/B,OAAO,EAAO,KAAY,CAC5B,EAkDA,EAAQ,iBAAiB,CAjDzB,SAA2B,CAAM,EAC/B,OAAO,EAAO,KAAY,CAC5B,EAgDA,EAAQ,SAAS,CA/CjB,SAAmB,CAAM,EACvB,MAAO,AAAkB,UAAlB,OAAO,GAAuB,AAAW,OAAX,GAAmB,EAAO,QAAQ,GAAK,CAC9E,EA8CA,EAAQ,YAAY,CA7CpB,SAAsB,CAAM,EAC1B,OAAO,EAAO,KAAY,CAC5B,EA4CA,EAAQ,UAAU,CA3ClB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EA0CA,EAAQ,MAAM,CAzCd,SAAgB,CAAM,EACpB,OAAO,EAAO,KAAY,CAC5B,EAwCA,EAAQ,MAAM,CAvCd,SAAgB,CAAM,EACpB,OAAO,EAAO,KAAY,CAC5B,EAsCA,EAAQ,QAAQ,CArChB,SAAkB,CAAM,EACtB,OAAO,EAAO,KAAY,CAC5B,EAoCA,EAAQ,UAAU,CAnClB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EAkCA,EAAQ,YAAY,CAjCpB,SAAsB,CAAM,EAC1B,OAAO,EAAO,KAAY,CAC5B,EAgCA,EAAQ,UAAU,CA/BlB,SAAoB,CAAM,EACxB,OAAO,EAAO,KAAY,CAC5B,EA8BA,EAAQ,cAAc,CA7BtB,SAAwB,CAAM,EAC5B,OAAO,EAAO,KAAY,CAC5B,EA4BA,EAAQ,kBAAkB,CApK1B,SAA4B,CAAI,QACV,UAAhB,OAAO,GAAqB,AAAgB,YAAhB,OAAO,GAKnC,IAAS,GAAuB,IAAS,GAA8C,IAAS,GAA0B,IAAS,GAAuB,IAAS,GAAmD,IAAS,GAI/N,AAAgB,UAAhB,OAAO,GAAqB,AAAS,OAAT,GAC1B,CAAA,EAAK,QAAQ,GAAK,GAAmB,EAAK,QAAQ,GAAK,GAAmB,EAAK,QAAQ,GAAK,GAAuB,EAAK,QAAQ,GAAK,GAAsB,EAAK,QAAQ,GAAK,GAIjL,EAAK,QAAQ,GAAK,GAA0B,AAAqB,KAAA,IAArB,EAAK,WAAW,AAAK,CAMrE,EAgJA,EAAQ,MAAM,CAAG,CACf,G,E,C,E,C,M,C,S,C,C,C,C,C,ECxNF,IAOI,EACA,EAkFA,EA1FA,EAAU,EAAO,OAAO,CAAG,CAAC,EAUhC,SAAS,IACL,MAAM,AAAI,MAAM,kCACpB,CACA,SAAS,IACL,MAAM,AAAI,MAAM,oCACpB,CAqBA,SAAS,EAAW,CAAG,EACnB,GAAI,IAAqB,WAErB,OAAO,WAAW,EAAK,GAG3B,GAAK,AAAA,CAAA,IAAqB,GAAoB,CAAC,CAAA,GAAqB,WAEhE,OADA,EAAmB,WACZ,WAAW,EAAK,GAE3B,GAAI,CAEA,OAAO,EAAiB,EAAK,EACjC,CAAE,MAAM,EAAE,CACN,GAAI,CAEA,OAAO,EAAiB,IAAI,CAAC,KAAM,EAAK,EAC5C,CAAE,MAAM,EAAE,CAEN,OAAO,EAAiB,IAAI,CAAC,IAAI,CAAE,EAAK,EAC5C,CACJ,CAGJ,EA5CC,AAAA,WACG,GAAI,CAEI,EADA,AAAsB,YAAtB,OAAO,WACY,WAEA,CAE3B,CAAE,MAAO,EAAG,CACR,EAAmB,CACvB,CACA,GAAI,CAEI,EADA,AAAwB,YAAxB,OAAO,aACc,aAEA,CAE7B,CAAE,MAAO,EAAG,CACR,EAAqB,CACzB,CACJ,IAqDA,IAAI,EAAQ,EAAE,CACV,EAAW,CAAA,EAEX,EAAa,GAEjB,SAAS,IACA,GAAa,IAGlB,EAAW,CAAA,EACP,EAAa,MAAM,CACnB,EAAQ,EAAa,MAAM,CAAC,GAE5B,EAAa,GAEb,EAAM,MAAM,EACZ,IAER,CAEA,SAAS,IACL,IAAI,GAGJ,IAAI,EAAU,EAAW,GACzB,EAAW,CAAA,EAGX,IADA,IAAI,EAAM,EAAM,MAAM,CAChB,GAAK,CAGP,IAFA,EAAe,EACf,EAAQ,EAAE,CACH,EAAE,EAAa,GACd,GACA,CAAY,CAAC,EAAW,CAAC,GAAG,GAGpC,EAAa,GACb,EAAM,EAAM,MAAM,AACtB,CACA,EAAe,KACf,EAAW,CAAA,EACX,AApEJ,SAAyB,CAAM,EAC3B,GAAI,IAAuB,aAEvB,OAAO,aAAa,GAGxB,GAAK,AAAA,CAAA,IAAuB,GAAuB,CAAC,CAAA,GAAuB,aAEvE,OADA,EAAqB,aACd,aAAa,GAExB,GAAI,CAEO,EAAmB,EAC9B,CAAE,MAAO,EAAE,CACP,GAAI,CAEA,OAAO,EAAmB,IAAI,CAAC,KAAM,EACzC,CAAE,MAAO,EAAE,CAGP,OAAO,EAAmB,IAAI,CAAC,IAAI,CAAE,EACzC,CACJ,CAIJ,EA0CoB,GACpB,CAgBA,SAAS,EAAK,CAAG,CAAE,CAAK,EACpB,IAAI,CAAC,GAAG,CAAG,EACX,IAAI,CAAC,KAAK,CAAG,CACjB,CAWA,SAAS,IAAQ,CA5BjB,EAAQ,QAAQ,CAAG,SAAU,CAAG,EAC5B,IAAI,EAAO,AAAI,MAAM,UAAU,MAAM,CAAG,GACxC,GAAI,UAAU,MAAM,CAAG,EACnB,IAAK,IAAI,EAAI,EAAG,EAAI,UAAU,MAAM,CAAE,IAClC,CAAI,CAAC,EAAI,EAAE,CAAG,SAAS,CAAC,EAAE,CAGlC,EAAM,IAAI,CAAC,IAAI,EAAK,EAAK,IACJ,IAAjB,EAAM,MAAM,EAAW,GACvB,EAAW,EAEnB,EAOA,EAAK,SAAS,CAAC,GAAG,CAAG,WACjB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAM,IAAI,CAAC,KAAK,CACnC,EACA,EAAQ,KAAK,CAAG,UAChB,EAAQ,OAAO,CAAG,CAAA,EAClB,EAAQ,GAAG,CAAG,CAAC,EACf,EAAQ,IAAI,CAAG,EAAE,CACjB,EAAQ,OAAO,CAAG,GAClB,EAAQ,QAAQ,CAAG,CAAC,EAIpB,EAAQ,EAAE,CAAG,EACb,EAAQ,WAAW,CAAG,EACtB,EAAQ,IAAI,CAAG,EACf,EAAQ,GAAG,CAAG,EACd,EAAQ,cAAc,CAAG,EACzB,EAAQ,kBAAkB,CAAG,EAC7B,EAAQ,IAAI,CAAG,EACf,EAAQ,eAAe,CAAG,EAC1B,EAAQ,mBAAmB,CAAG,EAE9B,EAAQ,SAAS,CAAG,SAAU,CAAI,EAAI,MAAO,EAAE,AAAC,EAEhD,EAAQ,OAAO,CAAG,SAAU,CAAI,EAC5B,MAAM,AAAI,MAAM,mCACpB,EAEA,EAAQ,GAAG,CAAG,WAAc,MAAO,GAAI,EACvC,EAAQ,KAAK,CAAG,SAAU,CAAG,EACzB,MAAM,AAAI,MAAM,iCACpB,EACA,EAAQ,KAAK,CAAG,WAAa,OAAO,CAAG,C,E,C,E,E,E,C,E","sources":["<anon>","node_modules/@storybook/react/dist/entry-preview-docs.mjs","node_modules/prop-types/index.js","node_modules/react-is/index.js","node_modules/react-is/cjs/react-is.development.js","node_modules/prop-types/factoryWithTypeCheckers.js","node_modules/object-assign/index.js","node_modules/prop-types/lib/ReactPropTypesSecret.js","node_modules/prop-types/lib/has.js","node_modules/prop-types/checkPropTypes.js","node_modules/html-tags/index.js","node_modules/html-tags/html-tags.json","node_modules/escodegen/escodegen.js","node_modules/estraverse/estraverse.js","node_modules/source-map/source-map.js","node_modules/source-map/lib/source-map-generator.js","node_modules/source-map/lib/base64-vlq.js","node_modules/source-map/lib/base64.js","node_modules/source-map/lib/util.js","node_modules/source-map/lib/array-set.js","node_modules/source-map/lib/mapping-list.js","node_modules/source-map/lib/source-map-consumer.js","node_modules/source-map/lib/binary-search.js","node_modules/source-map/lib/quick-sort.js","node_modules/source-map/lib/source-node.js","node_modules/escodegen/package.json","node_modules/@storybook/react/node_modules/acorn/dist/acorn.mjs","node_modules/@storybook/react/node_modules/acorn-jsx/index.js","node_modules/@storybook/react/node_modules/acorn-jsx/xhtml.js","node_modules/@storybook/react/node_modules/acorn-walk/dist/walk.mjs","node_modules/lodash/isString.js","node_modules/react-element-to-jsx-string/dist/cjs/index.js","node_modules/react-element-to-jsx-string/src/formatter/spacer.js","node_modules/react-element-to-jsx-string/src/formatter/sortObject.js","node_modules/react-element-to-jsx-string/src/tree.js","node_modules/react-element-to-jsx-string/src/parser/parseReactElement.js","node_modules/react-element-to-jsx-string/src/formatter/formatFunction.js","node_modules/react-element-to-jsx-string/src/formatter/formatComplexDataStructure.js","node_modules/react-element-to-jsx-string/src/formatter/formatPropValue.js","node_modules/react-element-to-jsx-string/src/formatter/formatProp.js","node_modules/react-element-to-jsx-string/src/formatter/mergeSiblingPlainStringChildrenReducer.js","node_modules/react-element-to-jsx-string/src/formatter/sortPropsByNames.js","node_modules/react-element-to-jsx-string/src/formatter/createPropFilter.js","node_modules/react-element-to-jsx-string/src/formatter/formatReactElementNode.js","node_modules/react-element-to-jsx-string/src/formatter/formatReactFragmentNode.js","node_modules/react-element-to-jsx-string/src/formatter/formatTreeNode.js","node_modules/react-element-to-jsx-string/src/formatter/formatTree.js","node_modules/react-element-to-jsx-string/src/index.js","node_modules/react-element-to-jsx-string/node_modules/is-plain-object/dist/is-plain-object.mjs","node_modules/@base2/pretty-print-object/dist/index.js","node_modules/@base2/pretty-print-object/src/index.ts","node_modules/react-element-to-jsx-string/node_modules/react-is/index.js","node_modules/react-element-to-jsx-string/node_modules/react-is/cjs/react-is.development.js","node_modules/process/browser.js"],"sourcesContent":["// modules are defined as an array\n// [ module function, map of requires ]\n//\n// map of requires is short require name -> numeric require\n//\n// anything defined in a previous bundle is accessed via the\n// orig method which is the require for previous bundles\n\n(function (modules, entry, mainEntry, parcelRequireName, globalName) {\n  /* eslint-disable no-undef */\n  var globalObject =\n    typeof globalThis !== 'undefined'\n      ? globalThis\n      : typeof self !== 'undefined'\n      ? self\n      : typeof window !== 'undefined'\n      ? window\n      : typeof global !== 'undefined'\n      ? global\n      : {};\n  /* eslint-enable no-undef */\n\n  // Save the require from previous bundle to this closure if any\n  var previousRequire =\n    typeof globalObject[parcelRequireName] === 'function' &&\n    globalObject[parcelRequireName];\n\n  var cache = previousRequire.cache || {};\n  // Do not use `require` to prevent Webpack from trying to bundle this call\n  var nodeRequire =\n    typeof module !== 'undefined' &&\n    typeof module.require === 'function' &&\n    module.require.bind(module);\n\n  function newRequire(name, jumped) {\n    if (!cache[name]) {\n      if (!modules[name]) {\n        // if we cannot find the module within our internal map or\n        // cache jump to the current global require ie. the last bundle\n        // that was added to the page.\n        var currentRequire =\n          typeof globalObject[parcelRequireName] === 'function' &&\n          globalObject[parcelRequireName];\n        if (!jumped && currentRequire) {\n          return currentRequire(name, true);\n        }\n\n        // If there are other bundles on this page the require from the\n        // previous one is saved to 'previousRequire'. Repeat this as\n        // many times as there are bundles until the module is found or\n        // we exhaust the require chain.\n        if (previousRequire) {\n          return previousRequire(name, true);\n        }\n\n        // Try the node require function if it exists.\n        if (nodeRequire && typeof name === 'string') {\n          return nodeRequire(name);\n        }\n\n        var err = new Error(\"Cannot find module '\" + name + \"'\");\n        err.code = 'MODULE_NOT_FOUND';\n        throw err;\n      }\n\n      localRequire.resolve = resolve;\n      localRequire.cache = {};\n\n      var module = (cache[name] = new newRequire.Module(name));\n\n      modules[name][0].call(\n        module.exports,\n        localRequire,\n        module,\n        module.exports,\n        this\n      );\n    }\n\n    return cache[name].exports;\n\n    function localRequire(x) {\n      var res = localRequire.resolve(x);\n      return res === false ? {} : newRequire(res);\n    }\n\n    function resolve(x) {\n      var id = modules[name][1][x];\n      return id != null ? id : x;\n    }\n  }\n\n  function Module(moduleName) {\n    this.id = moduleName;\n    this.bundle = newRequire;\n    this.exports = {};\n  }\n\n  newRequire.isParcelRequire = true;\n  newRequire.Module = Module;\n  newRequire.modules = modules;\n  newRequire.cache = cache;\n  newRequire.parent = previousRequire;\n  newRequire.register = function (id, exports) {\n    modules[id] = [\n      function (require, module) {\n        module.exports = exports;\n      },\n      {},\n    ];\n  };\n\n  Object.defineProperty(newRequire, 'root', {\n    get: function () {\n      return globalObject[parcelRequireName];\n    },\n  });\n\n  globalObject[parcelRequireName] = newRequire;\n\n  for (var i = 0; i < entry.length; i++) {\n    newRequire(entry[i]);\n  }\n\n  if (mainEntry) {\n    // Expose entry point to Node, AMD or browser globals\n    // Based on https://github.com/ForbesLindesay/umd/blob/master/template.js\n    var mainExports = newRequire(mainEntry);\n\n    // CommonJS\n    if (typeof exports === 'object' && typeof module !== 'undefined') {\n      module.exports = mainExports;\n\n      // RequireJS\n    } else if (typeof define === 'function' && define.amd) {\n      define(function () {\n        return mainExports;\n      });\n\n      // <script>\n    } else if (globalName) {\n      this[globalName] = mainExports;\n    }\n  }\n})({\"djE3o\":[function(require,module,exports) {\nvar parcelHelpers = require(\"@parcel/transformer-js/src/esmodule-helpers.js\");\nparcelHelpers.defineInteropFlag(exports);\nparcelHelpers.export(exports, \"applyDecorators\", ()=>applyDecorators);\nparcelHelpers.export(exports, \"argTypesEnhancers\", ()=>argTypesEnhancers);\nparcelHelpers.export(exports, \"decorators\", ()=>decorators);\nparcelHelpers.export(exports, \"parameters\", ()=>parameters);\nvar _docsTools = require(\"@storybook/docs-tools\");\nvar _propTypes = require(\"prop-types\");\nvar _propTypesDefault = parcelHelpers.interopDefault(_propTypes);\nvar _htmlTags = require(\"html-tags\");\nvar _htmlTagsDefault = parcelHelpers.interopDefault(_htmlTags);\nvar _escodegen = require(\"escodegen\");\nvar _tsDedent = require(\"ts-dedent\");\nvar _acorn = require(\"acorn\");\nvar _acornJsx = require(\"acorn-jsx\");\nvar _acornJsxDefault = parcelHelpers.interopDefault(_acornJsx);\nvar _acornWalk = require(\"acorn-walk\");\nvar _isPlainObjectJs = require(\"lodash/isPlainObject.js\");\nvar _isPlainObjectJsDefault = parcelHelpers.interopDefault(_isPlainObjectJs);\nvar _isFunctionJs = require(\"lodash/isFunction.js\");\nvar _isFunctionJsDefault = parcelHelpers.interopDefault(_isFunctionJs);\nvar _isStringJs = require(\"lodash/isString.js\");\nvar _isStringJsDefault = parcelHelpers.interopDefault(_isStringJs);\nvar _reactElementToJsxString = require(\"react-element-to-jsx-string\");\nvar _reactElementToJsxStringDefault = parcelHelpers.interopDefault(_reactElementToJsxString);\nvar _react = require(\"react\");\nvar _reactDefault = parcelHelpers.interopDefault(_react);\nvar _previewApi = require(\"@storybook/preview-api\");\nvar _clientLogger = require(\"@storybook/client-logger\");\nfunction generateFuncSignature(params, returns) {\n    let hasParams = params != null, hasReturns = returns != null;\n    if (!hasParams && !hasReturns) return \"\";\n    let funcParts = [];\n    if (hasParams) {\n        let funcParams = params.map((x)=>{\n            let prettyName = x.getPrettyName(), typeName = x.getTypeName();\n            return typeName != null ? `${prettyName}: ${typeName}` : prettyName;\n        });\n        funcParts.push(`(${funcParams.join(\", \")})`);\n    } else funcParts.push(\"()\");\n    return hasReturns && funcParts.push(`=> ${returns.getTypeName()}`), funcParts.join(\" \");\n}\nfunction generateShortFuncSignature(params, returns) {\n    let hasParams = params != null, hasReturns = returns != null;\n    if (!hasParams && !hasReturns) return \"\";\n    let funcParts = [];\n    return hasParams ? funcParts.push(\"( ... )\") : funcParts.push(\"()\"), hasReturns && funcParts.push(`=> ${returns.getTypeName()}`), funcParts.join(\" \");\n}\nfunction toMultilineSignature(signature) {\n    return signature.replace(/,/g, `,\\r\n`);\n}\nvar CUSTOM_CAPTION = \"custom\", OBJECT_CAPTION = \"object\", ARRAY_CAPTION = \"array\", CLASS_CAPTION = \"class\", FUNCTION_CAPTION = \"func\", ELEMENT_CAPTION = \"element\";\nfunction isHtmlTag(tagName) {\n    return (0, _htmlTagsDefault.default).includes(tagName.toLowerCase());\n}\nvar BASIC_OPTIONS = {\n    format: {\n        indent: {\n            style: \"  \"\n        },\n        semicolons: !1\n    }\n}, COMPACT_OPTIONS = {\n    ...BASIC_OPTIONS,\n    format: {\n        newline: \"\"\n    }\n}, PRETTY_OPTIONS = {\n    ...BASIC_OPTIONS\n};\nfunction generateCode(ast, compact = !1) {\n    return (0, _escodegen.generate)(ast, compact ? COMPACT_OPTIONS : PRETTY_OPTIONS);\n}\nfunction generateObjectCode(ast, compact = !1) {\n    return compact ? generateCompactObjectCode(ast) : generateCode(ast);\n}\nfunction generateCompactObjectCode(ast) {\n    let result = generateCode(ast, !0);\n    return result.endsWith(\" }\") || (result = `${result.slice(0, -1)} }`), result;\n}\nfunction generateArrayCode(ast, compact = !1) {\n    return compact ? generateCompactArrayCode(ast) : generateMultilineArrayCode(ast);\n}\nfunction generateMultilineArrayCode(ast) {\n    let result = generateCode(ast);\n    return result.endsWith(\"  }]\") && (result = (0, _tsDedent.dedent)(result)), result;\n}\nfunction generateCompactArrayCode(ast) {\n    let result = generateCode(ast, !0);\n    return result.startsWith(\"[    \") && (result = result.replace(\"[    \", \"[\")), result;\n}\nvar isMemo = (component)=>component.$$typeof === Symbol.for(\"react.memo\"), isForwardRef = (component)=>component.$$typeof === Symbol.for(\"react.forward_ref\");\nvar ACORN_WALK_VISITORS = {\n    ..._acornWalk.base,\n    JSXElement: ()=>{}\n}, acornParser = (0, _acorn.Parser).extend((0, _acornJsxDefault.default)());\nfunction extractIdentifierName(identifierNode) {\n    return identifierNode != null ? identifierNode.name : null;\n}\nfunction filterAncestors(ancestors) {\n    return ancestors.filter((x)=>x.type === \"ObjectExpression\" || x.type === \"ArrayExpression\");\n}\nfunction calculateNodeDepth(node) {\n    let depths = [];\n    return _acornWalk.ancestor(node, {\n        ObjectExpression (_, ancestors) {\n            depths.push(filterAncestors(ancestors).length);\n        },\n        ArrayExpression (_, ancestors) {\n            depths.push(filterAncestors(ancestors).length);\n        }\n    }, ACORN_WALK_VISITORS), Math.max(...depths);\n}\nfunction parseIdentifier(identifierNode) {\n    return {\n        inferredType: {\n            type: \"Identifier\",\n            identifier: extractIdentifierName(identifierNode)\n        },\n        ast: identifierNode\n    };\n}\nfunction parseLiteral(literalNode) {\n    return {\n        inferredType: {\n            type: \"Literal\"\n        },\n        ast: literalNode\n    };\n}\nfunction parseFunction(funcNode) {\n    let innerJsxElementNode;\n    _acornWalk.simple(funcNode.body, {\n        JSXElement (node) {\n            innerJsxElementNode = node;\n        }\n    }, ACORN_WALK_VISITORS);\n    let inferredType = {\n        type: innerJsxElementNode != null ? \"Element\" : \"Function\",\n        params: funcNode.params,\n        hasParams: funcNode.params.length !== 0\n    }, identifierName = extractIdentifierName(funcNode.id);\n    return identifierName != null && (inferredType.identifier = identifierName), {\n        inferredType,\n        ast: funcNode\n    };\n}\nfunction parseClass(classNode) {\n    let innerJsxElementNode;\n    return _acornWalk.simple(classNode.body, {\n        JSXElement (node) {\n            innerJsxElementNode = node;\n        }\n    }, ACORN_WALK_VISITORS), {\n        inferredType: {\n            type: innerJsxElementNode != null ? \"Element\" : \"Class\",\n            identifier: extractIdentifierName(classNode.id)\n        },\n        ast: classNode\n    };\n}\nfunction parseJsxElement(jsxElementNode) {\n    let inferredType = {\n        type: \"Element\"\n    }, identifierName = extractIdentifierName(jsxElementNode.openingElement.name);\n    return identifierName != null && (inferredType.identifier = identifierName), {\n        inferredType,\n        ast: jsxElementNode\n    };\n}\nfunction parseCall(callNode) {\n    let identifierNode = callNode.callee.type === \"MemberExpression\" ? callNode.callee.property : callNode.callee;\n    return extractIdentifierName(identifierNode) === \"shape\" ? parseObject(callNode.arguments[0]) : null;\n}\nfunction parseObject(objectNode) {\n    return {\n        inferredType: {\n            type: \"Object\",\n            depth: calculateNodeDepth(objectNode)\n        },\n        ast: objectNode\n    };\n}\nfunction parseArray(arrayNode) {\n    return {\n        inferredType: {\n            type: \"Array\",\n            depth: calculateNodeDepth(arrayNode)\n        },\n        ast: arrayNode\n    };\n}\nfunction parseExpression(expression) {\n    switch(expression.type){\n        case \"Identifier\":\n            return parseIdentifier(expression);\n        case \"Literal\":\n            return parseLiteral(expression);\n        case \"FunctionExpression\":\n        case \"ArrowFunctionExpression\":\n            return parseFunction(expression);\n        case \"ClassExpression\":\n            return parseClass(expression);\n        case \"JSXElement\":\n            return parseJsxElement(expression);\n        case \"CallExpression\":\n            return parseCall(expression);\n        case \"ObjectExpression\":\n            return parseObject(expression);\n        case \"ArrayExpression\":\n            return parseArray(expression);\n        default:\n            return null;\n    }\n}\nfunction parse(value) {\n    let ast = acornParser.parse(`(${value})`, {\n        ecmaVersion: 2020\n    }), parsingResult = {\n        inferredType: {\n            type: \"Unknown\"\n        },\n        ast\n    };\n    if (ast.body[0] != null) {\n        let rootNode = ast.body[0];\n        switch(rootNode.type){\n            case \"ExpressionStatement\":\n                {\n                    let expressionResult = parseExpression(rootNode.expression);\n                    expressionResult != null && (parsingResult = expressionResult);\n                    break;\n                }\n        }\n    }\n    return parsingResult;\n}\nfunction inspectValue(value) {\n    try {\n        return {\n            ...parse(value)\n        };\n    } catch  {}\n    return {\n        inferredType: {\n            type: \"Unknown\"\n        }\n    };\n}\nvar MAX_FUNC_LENGTH = 150;\nfunction createTypeDef({ name, short, compact, full, inferredType }) {\n    return {\n        name,\n        short,\n        compact,\n        full: full ?? short,\n        inferredType\n    };\n}\nfunction cleanPropTypes(value) {\n    return value.replace(/PropTypes./g, \"\").replace(/.isRequired/g, \"\");\n}\nfunction splitIntoLines(value) {\n    return value.split(/\\r?\\n/);\n}\nfunction prettyObject(ast, compact = !1) {\n    return cleanPropTypes(generateObjectCode(ast, compact));\n}\nfunction prettyArray(ast, compact = !1) {\n    return cleanPropTypes(generateCode(ast, compact));\n}\nfunction getCaptionForInspectionType(type) {\n    switch(type){\n        case \"Object\":\n            return OBJECT_CAPTION;\n        case \"Array\":\n            return ARRAY_CAPTION;\n        case \"Class\":\n            return CLASS_CAPTION;\n        case \"Function\":\n            return FUNCTION_CAPTION;\n        case \"Element\":\n            return ELEMENT_CAPTION;\n        default:\n            return CUSTOM_CAPTION;\n    }\n}\nfunction generateTypeFromString(value, originalTypeName) {\n    let { inferredType, ast } = inspectValue(value), { type } = inferredType, short, compact, full;\n    switch(type){\n        case \"Identifier\":\n        case \"Literal\":\n            short = value, compact = value;\n            break;\n        case \"Object\":\n            {\n                let { depth } = inferredType;\n                short = OBJECT_CAPTION, compact = depth === 1 ? prettyObject(ast, !0) : null, full = prettyObject(ast);\n                break;\n            }\n        case \"Element\":\n            {\n                let { identifier } = inferredType;\n                short = identifier != null && !isHtmlTag(identifier) ? identifier : ELEMENT_CAPTION, compact = splitIntoLines(value).length === 1 ? value : null, full = value;\n                break;\n            }\n        case \"Array\":\n            {\n                let { depth } = inferredType;\n                short = ARRAY_CAPTION, compact = depth <= 2 ? prettyArray(ast, !0) : null, full = prettyArray(ast);\n                break;\n            }\n        default:\n            short = getCaptionForInspectionType(type), compact = splitIntoLines(value).length === 1 ? value : null, full = value;\n            break;\n    }\n    return createTypeDef({\n        name: originalTypeName,\n        short,\n        compact,\n        full,\n        inferredType: type\n    });\n}\nfunction generateCustom({ raw }) {\n    return raw != null ? generateTypeFromString(raw, \"custom\") : createTypeDef({\n        name: \"custom\",\n        short: CUSTOM_CAPTION,\n        compact: CUSTOM_CAPTION\n    });\n}\nfunction generateFunc(extractedProp) {\n    let { jsDocTags } = extractedProp;\n    return jsDocTags != null && (jsDocTags.params != null || jsDocTags.returns != null) ? createTypeDef({\n        name: \"func\",\n        short: generateShortFuncSignature(jsDocTags.params, jsDocTags.returns),\n        compact: null,\n        full: generateFuncSignature(jsDocTags.params, jsDocTags.returns)\n    }) : createTypeDef({\n        name: \"func\",\n        short: FUNCTION_CAPTION,\n        compact: FUNCTION_CAPTION\n    });\n}\nfunction generateShape(type, extractedProp) {\n    let fields = Object.keys(type.value).map((key)=>`${key}: ${generateType(type.value[key], extractedProp).full}`).join(\", \"), { inferredType, ast } = inspectValue(`{ ${fields} }`), { depth } = inferredType;\n    return createTypeDef({\n        name: \"shape\",\n        short: OBJECT_CAPTION,\n        compact: depth === 1 && ast ? prettyObject(ast, !0) : null,\n        full: ast ? prettyObject(ast) : null\n    });\n}\nfunction objectOf(of) {\n    return `objectOf(${of})`;\n}\nfunction generateObjectOf(type, extractedProp) {\n    let { short, compact, full } = generateType(type.value, extractedProp);\n    return createTypeDef({\n        name: \"objectOf\",\n        short: objectOf(short),\n        compact: compact != null ? objectOf(compact) : null,\n        full: full && objectOf(full)\n    });\n}\nfunction generateUnion(type, extractedProp) {\n    if (Array.isArray(type.value)) {\n        let values = type.value.reduce((acc, v)=>{\n            let { short, compact, full } = generateType(v, extractedProp);\n            return acc.short.push(short), acc.compact.push(compact), acc.full.push(full), acc;\n        }, {\n            short: [],\n            compact: [],\n            full: []\n        });\n        return createTypeDef({\n            name: \"union\",\n            short: values.short.join(\" | \"),\n            compact: values.compact.every((x)=>x != null) ? values.compact.join(\" | \") : null,\n            full: values.full.join(\" | \")\n        });\n    }\n    return createTypeDef({\n        name: \"union\",\n        short: type.value,\n        compact: null\n    });\n}\nfunction generateEnumValue({ value, computed }) {\n    return computed ? generateTypeFromString(value, \"enumvalue\") : createTypeDef({\n        name: \"enumvalue\",\n        short: value,\n        compact: value\n    });\n}\nfunction generateEnum(type) {\n    if (Array.isArray(type.value)) {\n        let values = type.value.reduce((acc, v)=>{\n            let { short, compact, full } = generateEnumValue(v);\n            return acc.short.push(short), acc.compact.push(compact), acc.full.push(full), acc;\n        }, {\n            short: [],\n            compact: [],\n            full: []\n        });\n        return createTypeDef({\n            name: \"enum\",\n            short: values.short.join(\" | \"),\n            compact: values.compact.every((x)=>x != null) ? values.compact.join(\" | \") : null,\n            full: values.full.join(\" | \")\n        });\n    }\n    return createTypeDef({\n        name: \"enum\",\n        short: type.value,\n        compact: type.value\n    });\n}\nfunction braceAfter(of) {\n    return `${of}[]`;\n}\nfunction braceAround(of) {\n    return `[${of}]`;\n}\nfunction createArrayOfObjectTypeDef(short, compact, full) {\n    return createTypeDef({\n        name: \"arrayOf\",\n        short: braceAfter(short),\n        compact: compact != null ? braceAround(compact) : null,\n        full: full && braceAround(full)\n    });\n}\nfunction generateArray(type, extractedProp) {\n    let { name, short, compact, full, inferredType } = generateType(type.value, extractedProp);\n    if (name === \"custom\") {\n        if (inferredType === \"Object\") return createArrayOfObjectTypeDef(short, compact, full);\n    } else if (name === \"shape\") return createArrayOfObjectTypeDef(short, compact, full);\n    return createTypeDef({\n        name: \"arrayOf\",\n        short: braceAfter(short),\n        compact: braceAfter(short)\n    });\n}\nfunction generateType(type, extractedProp) {\n    try {\n        switch(type.name){\n            case \"custom\":\n                return generateCustom(type);\n            case \"func\":\n                return generateFunc(extractedProp);\n            case \"shape\":\n                return generateShape(type, extractedProp);\n            case \"instanceOf\":\n                return createTypeDef({\n                    name: \"instanceOf\",\n                    short: type.value,\n                    compact: type.value\n                });\n            case \"objectOf\":\n                return generateObjectOf(type, extractedProp);\n            case \"union\":\n                return generateUnion(type, extractedProp);\n            case \"enum\":\n                return generateEnum(type);\n            case \"arrayOf\":\n                return generateArray(type, extractedProp);\n            default:\n                return createTypeDef({\n                    name: type.name,\n                    short: type.name,\n                    compact: type.name\n                });\n        }\n    } catch (e) {\n        console.error(e);\n    }\n    return createTypeDef({\n        name: \"unknown\",\n        short: \"unknown\",\n        compact: \"unknown\"\n    });\n}\nfunction createType(extractedProp) {\n    let { type } = extractedProp.docgenInfo;\n    if (type == null) return null;\n    try {\n        switch(type.name){\n            case \"custom\":\n            case \"shape\":\n            case \"instanceOf\":\n            case \"objectOf\":\n            case \"union\":\n            case \"enum\":\n            case \"arrayOf\":\n                {\n                    let { short, compact, full } = generateType(type, extractedProp);\n                    return compact != null && !(0, _docsTools.isTooLongForTypeSummary)(compact) ? (0, _docsTools.createSummaryValue)(compact) : full ? (0, _docsTools.createSummaryValue)(short, full) : (0, _docsTools.createSummaryValue)(short);\n                }\n            case \"func\":\n                {\n                    let { short, full } = generateType(type, extractedProp), summary = short, detail;\n                    return full && full.length < MAX_FUNC_LENGTH ? summary = full : full && (detail = toMultilineSignature(full)), (0, _docsTools.createSummaryValue)(summary, detail);\n                }\n            default:\n                return null;\n        }\n    } catch (e) {\n        console.error(e);\n    }\n    return null;\n}\nfunction generateObject({ inferredType, ast }) {\n    let { depth } = inferredType;\n    if (depth === 1) {\n        let compactObject = generateObjectCode(ast, !0);\n        if (!(0, _docsTools.isTooLongForDefaultValueSummary)(compactObject)) return (0, _docsTools.createSummaryValue)(compactObject);\n    }\n    return (0, _docsTools.createSummaryValue)(OBJECT_CAPTION, generateObjectCode(ast));\n}\nfunction generateArray2({ inferredType, ast }) {\n    let { depth } = inferredType;\n    if (depth <= 2) {\n        let compactArray = generateArrayCode(ast, !0);\n        if (!(0, _docsTools.isTooLongForDefaultValueSummary)(compactArray)) return (0, _docsTools.createSummaryValue)(compactArray);\n    }\n    return (0, _docsTools.createSummaryValue)(ARRAY_CAPTION, generateArrayCode(ast));\n}\nfunction getPrettyFuncIdentifier(identifier, hasArguments) {\n    return hasArguments ? `${identifier}( ... )` : `${identifier}()`;\n}\nfunction getPrettyElementIdentifier(identifier) {\n    return `<${identifier} />`;\n}\nfunction getPrettyIdentifier(inferredType) {\n    let { type, identifier } = inferredType;\n    switch(type){\n        case \"Function\":\n            return getPrettyFuncIdentifier(identifier, inferredType.hasParams);\n        case \"Element\":\n            return getPrettyElementIdentifier(identifier);\n        default:\n            return identifier;\n    }\n}\nfunction generateFunc2({ inferredType, ast }) {\n    let { identifier } = inferredType;\n    if (identifier != null) return (0, _docsTools.createSummaryValue)(getPrettyIdentifier(inferredType), generateCode(ast));\n    let prettyCaption = generateCode(ast, !0);\n    return (0, _docsTools.isTooLongForDefaultValueSummary)(prettyCaption) ? (0, _docsTools.createSummaryValue)(FUNCTION_CAPTION, generateCode(ast)) : (0, _docsTools.createSummaryValue)(prettyCaption);\n}\nfunction generateElement(defaultValue, inspectionResult) {\n    let { inferredType } = inspectionResult, { identifier } = inferredType;\n    if (identifier != null && !isHtmlTag(identifier)) {\n        let prettyIdentifier = getPrettyIdentifier(inferredType);\n        return (0, _docsTools.createSummaryValue)(prettyIdentifier, defaultValue);\n    }\n    return (0, _docsTools.isTooLongForDefaultValueSummary)(defaultValue) ? (0, _docsTools.createSummaryValue)(ELEMENT_CAPTION, defaultValue) : (0, _docsTools.createSummaryValue)(defaultValue);\n}\nfunction createDefaultValue(defaultValue) {\n    try {\n        let inspectionResult = inspectValue(defaultValue);\n        switch(inspectionResult.inferredType.type){\n            case \"Object\":\n                return generateObject(inspectionResult);\n            case \"Function\":\n                return generateFunc2(inspectionResult);\n            case \"Element\":\n                return generateElement(defaultValue, inspectionResult);\n            case \"Array\":\n                return generateArray2(inspectionResult);\n            default:\n                return null;\n        }\n    } catch (e) {\n        console.error(e);\n    }\n    return null;\n}\nfunction isReactElement(element) {\n    return element.$$typeof != null;\n}\nfunction extractFunctionName(func, propName) {\n    let { name } = func;\n    return name !== \"\" && name !== \"anonymous\" && name !== propName ? name : null;\n}\nvar stringResolver = (rawDefaultProp)=>(0, _docsTools.createSummaryValue)(JSON.stringify(rawDefaultProp));\nfunction generateReactObject(rawDefaultProp) {\n    let { type } = rawDefaultProp, { displayName } = type, jsx2 = (0, _reactElementToJsxStringDefault.default)(rawDefaultProp, {});\n    if (displayName != null) {\n        let prettyIdentifier = getPrettyElementIdentifier(displayName);\n        return (0, _docsTools.createSummaryValue)(prettyIdentifier, jsx2);\n    }\n    if ((0, _isStringJsDefault.default)(type) && isHtmlTag(type)) {\n        let jsxSummary = (0, _reactElementToJsxStringDefault.default)(rawDefaultProp, {\n            tabStop: 0\n        }).replace(/\\r?\\n|\\r/g, \"\");\n        if (!(0, _docsTools.isTooLongForDefaultValueSummary)(jsxSummary)) return (0, _docsTools.createSummaryValue)(jsxSummary);\n    }\n    return (0, _docsTools.createSummaryValue)(ELEMENT_CAPTION, jsx2);\n}\nvar objectResolver = (rawDefaultProp)=>{\n    if (isReactElement(rawDefaultProp) && rawDefaultProp.type != null) return generateReactObject(rawDefaultProp);\n    if ((0, _isPlainObjectJsDefault.default)(rawDefaultProp)) {\n        let inspectionResult = inspectValue(JSON.stringify(rawDefaultProp));\n        return generateObject(inspectionResult);\n    }\n    if (Array.isArray(rawDefaultProp)) {\n        let inspectionResult = inspectValue(JSON.stringify(rawDefaultProp));\n        return generateArray2(inspectionResult);\n    }\n    return (0, _docsTools.createSummaryValue)(OBJECT_CAPTION);\n}, functionResolver = (rawDefaultProp, propDef)=>{\n    let isElement = !1, inspectionResult;\n    if ((0, _isFunctionJsDefault.default)(rawDefaultProp.render)) isElement = !0;\n    else if (rawDefaultProp.prototype != null && (0, _isFunctionJsDefault.default)(rawDefaultProp.prototype.render)) isElement = !0;\n    else {\n        let innerElement;\n        try {\n            inspectionResult = inspectValue(rawDefaultProp.toString());\n            let { hasParams, params } = inspectionResult.inferredType;\n            hasParams ? params.length === 1 && params[0].type === \"ObjectPattern\" && (innerElement = rawDefaultProp({})) : innerElement = rawDefaultProp(), innerElement != null && isReactElement(innerElement) && (isElement = !0);\n        } catch  {}\n    }\n    let funcName = extractFunctionName(rawDefaultProp, propDef.name);\n    if (funcName != null) {\n        if (isElement) return (0, _docsTools.createSummaryValue)(getPrettyElementIdentifier(funcName));\n        inspectionResult != null && (inspectionResult = inspectValue(rawDefaultProp.toString()));\n        let { hasParams } = inspectionResult.inferredType;\n        return (0, _docsTools.createSummaryValue)(getPrettyFuncIdentifier(funcName, hasParams));\n    }\n    return (0, _docsTools.createSummaryValue)(isElement ? ELEMENT_CAPTION : FUNCTION_CAPTION);\n}, defaultResolver = (rawDefaultProp)=>(0, _docsTools.createSummaryValue)(rawDefaultProp.toString()), DEFAULT_TYPE_RESOLVERS = {\n    string: stringResolver,\n    object: objectResolver,\n    function: functionResolver,\n    default: defaultResolver\n};\nfunction createTypeResolvers(customResolvers = {}) {\n    return {\n        ...DEFAULT_TYPE_RESOLVERS,\n        ...customResolvers\n    };\n}\nfunction createDefaultValueFromRawDefaultProp(rawDefaultProp, propDef, typeResolvers = DEFAULT_TYPE_RESOLVERS) {\n    try {\n        switch(typeof rawDefaultProp){\n            case \"string\":\n                return typeResolvers.string(rawDefaultProp, propDef);\n            case \"object\":\n                return typeResolvers.object(rawDefaultProp, propDef);\n            case \"function\":\n                return typeResolvers.function(rawDefaultProp, propDef);\n            default:\n                return typeResolvers.default(rawDefaultProp, propDef);\n        }\n    } catch (e) {\n        console.error(e);\n    }\n    return null;\n}\nfunction keepOriginalDefinitionOrder(extractedProps, component) {\n    let { propTypes } = component;\n    return propTypes != null ? Object.keys(propTypes).map((x)=>extractedProps.find((y)=>y.name === x)).filter(Boolean) : extractedProps;\n}\nvar funcResolver = (rawDefaultProp, { name, type })=>{\n    let isElement = type.summary === \"element\" || type.summary === \"elementType\", funcName = extractFunctionName(rawDefaultProp, name);\n    if (funcName != null) {\n        if (isElement) return (0, _docsTools.createSummaryValue)(getPrettyElementIdentifier(funcName));\n        let { hasParams } = inspectValue(rawDefaultProp.toString()).inferredType;\n        return (0, _docsTools.createSummaryValue)(getPrettyFuncIdentifier(funcName, hasParams));\n    }\n    return (0, _docsTools.createSummaryValue)(isElement ? ELEMENT_CAPTION : FUNCTION_CAPTION);\n}, rawDefaultPropTypeResolvers = createTypeResolvers({\n    function: funcResolver\n});\nfunction enhancePropTypesProp(extractedProp, rawDefaultProp) {\n    let { propDef } = extractedProp, newtype = createType(extractedProp);\n    newtype != null && (propDef.type = newtype);\n    let { defaultValue } = extractedProp.docgenInfo;\n    if (defaultValue != null && defaultValue.value != null) {\n        let newDefaultValue = createDefaultValue(defaultValue.value);\n        newDefaultValue != null && (propDef.defaultValue = newDefaultValue);\n    } else if (rawDefaultProp != null) {\n        let newDefaultValue = createDefaultValueFromRawDefaultProp(rawDefaultProp, propDef, rawDefaultPropTypeResolvers);\n        newDefaultValue != null && (propDef.defaultValue = newDefaultValue);\n    }\n    return propDef;\n}\nfunction enhancePropTypesProps(extractedProps, component) {\n    let rawDefaultProps = component.defaultProps != null ? component.defaultProps : {}, enhancedProps = extractedProps.map((x)=>enhancePropTypesProp(x, rawDefaultProps[x.propDef.name]));\n    return keepOriginalDefinitionOrder(enhancedProps, component);\n}\nfunction enhanceTypeScriptProp(extractedProp, rawDefaultProp) {\n    let { propDef } = extractedProp, { defaultValue } = extractedProp.docgenInfo;\n    if (defaultValue != null && defaultValue.value != null) {\n        let newDefaultValue = createDefaultValue(defaultValue.value);\n        newDefaultValue != null && (propDef.defaultValue = newDefaultValue);\n    } else if (rawDefaultProp != null) {\n        let newDefaultValue = createDefaultValueFromRawDefaultProp(rawDefaultProp, propDef);\n        newDefaultValue != null && (propDef.defaultValue = newDefaultValue);\n    }\n    return propDef;\n}\nfunction enhanceTypeScriptProps(extractedProps) {\n    return extractedProps.map((prop)=>enhanceTypeScriptProp(prop));\n}\nvar propTypesMap = new Map;\nObject.keys((0, _propTypesDefault.default)).forEach((typeName)=>{\n    let type = (0, _propTypesDefault.default)[typeName];\n    propTypesMap.set(type, typeName), propTypesMap.set(type.isRequired, typeName);\n});\nfunction getPropDefs(component, section) {\n    let processedComponent = component;\n    !(0, _docsTools.hasDocgen)(component) && !component.propTypes && isMemo(component) && (processedComponent = component.type);\n    let extractedProps = (0, _docsTools.extractComponentProps)(processedComponent, section);\n    if (extractedProps.length === 0) return [];\n    switch(extractedProps[0].typeSystem){\n        case (0, _docsTools.TypeSystem).JAVASCRIPT:\n            return enhancePropTypesProps(extractedProps, component);\n        case (0, _docsTools.TypeSystem).TYPESCRIPT:\n            return enhanceTypeScriptProps(extractedProps);\n        default:\n            return extractedProps.map((x)=>x.propDef);\n    }\n}\nvar extractProps = (component)=>({\n        rows: getPropDefs(component, \"props\")\n    });\nvar extractArgTypes = (component)=>{\n    if (component) {\n        let { rows } = extractProps(component);\n        if (rows) return rows.reduce((acc, row)=>{\n            let { name, description, type, sbType, defaultValue: defaultSummary, jsDocTags, required } = row;\n            return acc[name] = {\n                name,\n                description,\n                type: {\n                    required,\n                    ...sbType\n                },\n                table: {\n                    type,\n                    jsDocTags,\n                    defaultValue: defaultSummary\n                }\n            }, acc;\n        }, {});\n    }\n    return null;\n};\nfunction simplifyNodeForStringify(node) {\n    if ((0, _react.isValidElement)(node)) {\n        let props = Object.keys(node.props).reduce((acc, cur)=>(acc[cur] = simplifyNodeForStringify(node.props[cur]), acc), {});\n        return {\n            ...node,\n            props,\n            _owner: null\n        };\n    }\n    return Array.isArray(node) ? node.map(simplifyNodeForStringify) : node;\n}\nvar renderJsx = (code, options)=>{\n    if (typeof code > \"u\") return (0, _clientLogger.logger).warn(\"Too many skip or undefined component\"), null;\n    let renderedJSX = code, Type = renderedJSX.type;\n    for(let i = 0; i < options.skip; i += 1){\n        if (typeof renderedJSX > \"u\") return (0, _clientLogger.logger).warn(\"Cannot skip undefined element\"), null;\n        if ((0, _reactDefault.default).Children.count(renderedJSX) > 1) return (0, _clientLogger.logger).warn(\"Trying to skip an array of elements\"), null;\n        typeof renderedJSX.props.children > \"u\" ? ((0, _clientLogger.logger).warn(\"Not enough children to skip elements.\"), typeof renderedJSX.type == \"function\" && renderedJSX.type.name === \"\" && (renderedJSX = (0, _reactDefault.default).createElement(Type, {\n            ...renderedJSX.props\n        }))) : typeof renderedJSX.props.children == \"function\" ? renderedJSX = renderedJSX.props.children() : renderedJSX = renderedJSX.props.children;\n    }\n    let opts = {\n        ...typeof options.displayName == \"string\" ? {\n            showFunctions: !0,\n            displayName: ()=>options.displayName\n        } : {\n            displayName: (el)=>el.type.displayName || (el.type === Symbol.for(\"react.profiler\") ? \"Profiler\" : null) || (0, _docsTools.getDocgenSection)(el.type, \"displayName\") || (el.type.name !== \"_default\" ? el.type.name : null) || (typeof el.type == \"function\" ? \"No Display Name\" : null) || (isForwardRef(el.type) ? el.type.render.name : null) || (isMemo(el.type) ? el.type.type.name : null) || el.type\n        },\n        filterProps: (value, key)=>value !== void 0,\n        ...options\n    };\n    return (0, _reactDefault.default).Children.map(code, (c)=>{\n        let child = typeof c == \"number\" ? c.toString() : c, string = (typeof (0, _reactElementToJsxStringDefault.default) == \"function\" ? (0, _reactElementToJsxStringDefault.default) : (0, _reactElementToJsxStringDefault.default).default)(simplifyNodeForStringify(child), opts);\n        if (string.indexOf(\"&quot;\") > -1) {\n            let matches = string.match(/\\S+=\\\\\"([^\"]*)\\\\\"/g);\n            matches && matches.forEach((match)=>{\n                string = string.replace(match, match.replace(/&quot;/g, \"'\"));\n            });\n        }\n        return string;\n    }).join(`\n`).replace(/function\\s+noRefCheck\\(\\)\\s+\\{\\}/g, \"() => {}\");\n}, defaultOpts = {\n    skip: 0,\n    showFunctions: !1,\n    enableBeautify: !0,\n    showDefaultProps: !1\n}, skipJsxRender = (context)=>{\n    let sourceParams = context?.parameters.docs?.source, isArgsStory = context?.parameters.__isArgsStory;\n    return sourceParams?.type === (0, _docsTools.SourceType).DYNAMIC ? !1 : !isArgsStory || sourceParams?.code || sourceParams?.type === (0, _docsTools.SourceType).CODE;\n}, isMdx = (node)=>node.type?.displayName === \"MDXCreateElement\" && !!node.props?.mdxType, mdxToJsx = (node)=>{\n    if (!isMdx(node)) return node;\n    let { mdxType, originalType, children, ...rest } = node.props, jsxChildren = [];\n    return children && (jsxChildren = (Array.isArray(children) ? children : [\n        children\n    ]).map(mdxToJsx)), (0, _react.createElement)(originalType, rest, ...jsxChildren);\n}, jsxDecorator = (storyFn, context)=>{\n    let channel = (0, _previewApi.addons).getChannel(), skip = skipJsxRender(context), jsx2 = \"\";\n    (0, _previewApi.useEffect)(()=>{\n        if (!skip) {\n            let { id, unmappedArgs } = context;\n            channel.emit((0, _docsTools.SNIPPET_RENDERED), {\n                id,\n                source: jsx2,\n                args: unmappedArgs\n            });\n        }\n    });\n    let story = storyFn();\n    if (skip) return story;\n    let options = {\n        ...defaultOpts,\n        ...context?.parameters.jsx || {}\n    }, storyJsx = context?.parameters.docs?.source?.excludeDecorators ? context.originalStoryFn(context.args, context) : story, sourceJsx = mdxToJsx(storyJsx), rendered = renderJsx(sourceJsx, options);\n    return rendered && (jsx2 = rendered), story;\n};\nvar applyDecorators = (storyFn, decorators2)=>{\n    let jsxIndex = decorators2.findIndex((d)=>d.originalFn === jsxDecorator), reorderedDecorators = jsxIndex === -1 ? decorators2 : [\n        ...decorators2.splice(jsxIndex, 1),\n        ...decorators2\n    ];\n    return (0, _previewApi.defaultDecorateStory)(storyFn, reorderedDecorators);\n};\nvar parameters = {\n    docs: {\n        story: {\n            inline: !0\n        },\n        extractArgTypes,\n        extractComponentDescription: (0, _docsTools.extractComponentDescription)\n    }\n}, decorators = [\n    jsxDecorator\n], argTypesEnhancers = [\n    (0, _docsTools.enhanceArgTypes)\n];\n\n},{\"@storybook/docs-tools\":\"ccjkZ\",\"prop-types\":\"f6rr3\",\"html-tags\":\"bZjia\",\"escodegen\":\"Caaa2\",\"ts-dedent\":\"lKwH2\",\"acorn\":\"awzSd\",\"acorn-jsx\":\"lztd4\",\"acorn-walk\":\"6DKmE\",\"lodash/isPlainObject.js\":\"dl7P5\",\"lodash/isFunction.js\":\"fZ818\",\"lodash/isString.js\":\"fvQhs\",\"react-element-to-jsx-string\":\"2PLUZ\",\"react\":\"jEiK2\",\"@storybook/preview-api\":\"uDWyg\",\"@storybook/client-logger\":\"7OFBO\",\"@parcel/transformer-js/src/esmodule-helpers.js\":\"diccK\"}],\"f6rr3\":[function(require,module,exports) {\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ var ReactIs = require(\"96e34ae03f5a2631\");\n// By explicitly using `prop-types` you are opting into new development behavior.\n// http://fb.me/prop-types-in-prod\nvar throwOnDirectAccess = true;\nmodule.exports = require(\"cb216452e2171041\")(ReactIs.isElement, throwOnDirectAccess);\n\n},{\"96e34ae03f5a2631\":\"dQThK\",\"cb216452e2171041\":\"av6ZP\"}],\"dQThK\":[function(require,module,exports) {\n'use strict';\nmodule.exports = require(\"2255125a8e8b1051\");\n\n},{\"2255125a8e8b1051\":\"aSKOF\"}],\"aSKOF\":[function(require,module,exports) {\n/** @license React v16.13.1\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ 'use strict';\n(function() {\n    'use strict';\n    // The Symbol used to tag the ReactElement-like types. If there is no native Symbol\n    // nor polyfill, then a plain number is used for performance.\n    var hasSymbol = typeof Symbol === 'function' && Symbol.for;\n    var REACT_ELEMENT_TYPE = hasSymbol ? Symbol.for('react.element') : 0xeac7;\n    var REACT_PORTAL_TYPE = hasSymbol ? Symbol.for('react.portal') : 0xeaca;\n    var REACT_FRAGMENT_TYPE = hasSymbol ? Symbol.for('react.fragment') : 0xeacb;\n    var REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol.for('react.strict_mode') : 0xeacc;\n    var REACT_PROFILER_TYPE = hasSymbol ? Symbol.for('react.profiler') : 0xead2;\n    var REACT_PROVIDER_TYPE = hasSymbol ? Symbol.for('react.provider') : 0xeacd;\n    var REACT_CONTEXT_TYPE = hasSymbol ? Symbol.for('react.context') : 0xeace; // TODO: We don't use AsyncMode or ConcurrentMode anymore. They were temporary\n    // (unstable) APIs that have been removed. Can we remove the symbols?\n    var REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol.for('react.async_mode') : 0xeacf;\n    var REACT_CONCURRENT_MODE_TYPE = hasSymbol ? Symbol.for('react.concurrent_mode') : 0xeacf;\n    var REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol.for('react.forward_ref') : 0xead0;\n    var REACT_SUSPENSE_TYPE = hasSymbol ? Symbol.for('react.suspense') : 0xead1;\n    var REACT_SUSPENSE_LIST_TYPE = hasSymbol ? Symbol.for('react.suspense_list') : 0xead8;\n    var REACT_MEMO_TYPE = hasSymbol ? Symbol.for('react.memo') : 0xead3;\n    var REACT_LAZY_TYPE = hasSymbol ? Symbol.for('react.lazy') : 0xead4;\n    var REACT_BLOCK_TYPE = hasSymbol ? Symbol.for('react.block') : 0xead9;\n    var REACT_FUNDAMENTAL_TYPE = hasSymbol ? Symbol.for('react.fundamental') : 0xead5;\n    var REACT_RESPONDER_TYPE = hasSymbol ? Symbol.for('react.responder') : 0xead6;\n    var REACT_SCOPE_TYPE = hasSymbol ? Symbol.for('react.scope') : 0xead7;\n    function isValidElementType(type) {\n        return typeof type === 'string' || typeof type === 'function' || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.\n        type === REACT_FRAGMENT_TYPE || type === REACT_CONCURRENT_MODE_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_FUNDAMENTAL_TYPE || type.$$typeof === REACT_RESPONDER_TYPE || type.$$typeof === REACT_SCOPE_TYPE || type.$$typeof === REACT_BLOCK_TYPE);\n    }\n    function typeOf(object) {\n        if (typeof object === 'object' && object !== null) {\n            var $$typeof = object.$$typeof;\n            switch($$typeof){\n                case REACT_ELEMENT_TYPE:\n                    var type = object.type;\n                    switch(type){\n                        case REACT_ASYNC_MODE_TYPE:\n                        case REACT_CONCURRENT_MODE_TYPE:\n                        case REACT_FRAGMENT_TYPE:\n                        case REACT_PROFILER_TYPE:\n                        case REACT_STRICT_MODE_TYPE:\n                        case REACT_SUSPENSE_TYPE:\n                            return type;\n                        default:\n                            var $$typeofType = type && type.$$typeof;\n                            switch($$typeofType){\n                                case REACT_CONTEXT_TYPE:\n                                case REACT_FORWARD_REF_TYPE:\n                                case REACT_LAZY_TYPE:\n                                case REACT_MEMO_TYPE:\n                                case REACT_PROVIDER_TYPE:\n                                    return $$typeofType;\n                                default:\n                                    return $$typeof;\n                            }\n                    }\n                case REACT_PORTAL_TYPE:\n                    return $$typeof;\n            }\n        }\n        return undefined;\n    } // AsyncMode is deprecated along with isAsyncMode\n    var AsyncMode = REACT_ASYNC_MODE_TYPE;\n    var ConcurrentMode = REACT_CONCURRENT_MODE_TYPE;\n    var ContextConsumer = REACT_CONTEXT_TYPE;\n    var ContextProvider = REACT_PROVIDER_TYPE;\n    var Element = REACT_ELEMENT_TYPE;\n    var ForwardRef = REACT_FORWARD_REF_TYPE;\n    var Fragment = REACT_FRAGMENT_TYPE;\n    var Lazy = REACT_LAZY_TYPE;\n    var Memo = REACT_MEMO_TYPE;\n    var Portal = REACT_PORTAL_TYPE;\n    var Profiler = REACT_PROFILER_TYPE;\n    var StrictMode = REACT_STRICT_MODE_TYPE;\n    var Suspense = REACT_SUSPENSE_TYPE;\n    var hasWarnedAboutDeprecatedIsAsyncMode = false; // AsyncMode should be deprecated\n    function isAsyncMode(object) {\n        if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n            hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n            console['warn'](\"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.\");\n        }\n        return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n    }\n    function isConcurrentMode(object) {\n        return typeOf(object) === REACT_CONCURRENT_MODE_TYPE;\n    }\n    function isContextConsumer(object) {\n        return typeOf(object) === REACT_CONTEXT_TYPE;\n    }\n    function isContextProvider(object) {\n        return typeOf(object) === REACT_PROVIDER_TYPE;\n    }\n    function isElement(object) {\n        return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n    }\n    function isForwardRef(object) {\n        return typeOf(object) === REACT_FORWARD_REF_TYPE;\n    }\n    function isFragment(object) {\n        return typeOf(object) === REACT_FRAGMENT_TYPE;\n    }\n    function isLazy(object) {\n        return typeOf(object) === REACT_LAZY_TYPE;\n    }\n    function isMemo(object) {\n        return typeOf(object) === REACT_MEMO_TYPE;\n    }\n    function isPortal(object) {\n        return typeOf(object) === REACT_PORTAL_TYPE;\n    }\n    function isProfiler(object) {\n        return typeOf(object) === REACT_PROFILER_TYPE;\n    }\n    function isStrictMode(object) {\n        return typeOf(object) === REACT_STRICT_MODE_TYPE;\n    }\n    function isSuspense(object) {\n        return typeOf(object) === REACT_SUSPENSE_TYPE;\n    }\n    exports.AsyncMode = AsyncMode;\n    exports.ConcurrentMode = ConcurrentMode;\n    exports.ContextConsumer = ContextConsumer;\n    exports.ContextProvider = ContextProvider;\n    exports.Element = Element;\n    exports.ForwardRef = ForwardRef;\n    exports.Fragment = Fragment;\n    exports.Lazy = Lazy;\n    exports.Memo = Memo;\n    exports.Portal = Portal;\n    exports.Profiler = Profiler;\n    exports.StrictMode = StrictMode;\n    exports.Suspense = Suspense;\n    exports.isAsyncMode = isAsyncMode;\n    exports.isConcurrentMode = isConcurrentMode;\n    exports.isContextConsumer = isContextConsumer;\n    exports.isContextProvider = isContextProvider;\n    exports.isElement = isElement;\n    exports.isForwardRef = isForwardRef;\n    exports.isFragment = isFragment;\n    exports.isLazy = isLazy;\n    exports.isMemo = isMemo;\n    exports.isPortal = isPortal;\n    exports.isProfiler = isProfiler;\n    exports.isStrictMode = isStrictMode;\n    exports.isSuspense = isSuspense;\n    exports.isValidElementType = isValidElementType;\n    exports.typeOf = typeOf;\n})();\n\n},{}],\"av6ZP\":[function(require,module,exports) {\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ 'use strict';\nvar ReactIs = require(\"c437388b089702c3\");\nvar assign = require(\"c067a60101d8520c\");\nvar ReactPropTypesSecret = require(\"74a0f89a70b9f3c2\");\nvar has = require(\"18441b11647bc78\");\nvar checkPropTypes = require(\"bec3f6ff89f0b072\");\nvar printWarning = function() {};\nprintWarning = function(text) {\n    var message = 'Warning: ' + text;\n    if (typeof console !== 'undefined') console.error(message);\n    try {\n        // --- Welcome to debugging React ---\n        // This error was thrown as a convenience so that you can use this stack\n        // to find the callsite that caused this warning to fire.\n        throw new Error(message);\n    } catch (x) {}\n};\nfunction emptyFunctionThatReturnsNull() {\n    return null;\n}\nmodule.exports = function(isValidElement, throwOnDirectAccess) {\n    /* global Symbol */ var ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n    var FAUX_ITERATOR_SYMBOL = '@@iterator'; // Before Symbol spec.\n    /**\n   * Returns the iterator method function contained on the iterable object.\n   *\n   * Be sure to invoke the function with the iterable as context:\n   *\n   *     var iteratorFn = getIteratorFn(myIterable);\n   *     if (iteratorFn) {\n   *       var iterator = iteratorFn.call(myIterable);\n   *       ...\n   *     }\n   *\n   * @param {?object} maybeIterable\n   * @return {?function}\n   */ function getIteratorFn(maybeIterable) {\n        var iteratorFn = maybeIterable && (ITERATOR_SYMBOL && maybeIterable[ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL]);\n        if (typeof iteratorFn === 'function') return iteratorFn;\n    }\n    /**\n   * Collection of methods that allow declaration and validation of props that are\n   * supplied to React components. Example usage:\n   *\n   *   var Props = require('ReactPropTypes');\n   *   var MyArticle = React.createClass({\n   *     propTypes: {\n   *       // An optional string prop named \"description\".\n   *       description: Props.string,\n   *\n   *       // A required enum prop named \"category\".\n   *       category: Props.oneOf(['News','Photos']).isRequired,\n   *\n   *       // A prop named \"dialog\" that requires an instance of Dialog.\n   *       dialog: Props.instanceOf(Dialog).isRequired\n   *     },\n   *     render: function() { ... }\n   *   });\n   *\n   * A more formal specification of how these methods are used:\n   *\n   *   type := array|bool|func|object|number|string|oneOf([...])|instanceOf(...)\n   *   decl := ReactPropTypes.{type}(.isRequired)?\n   *\n   * Each and every declaration produces a function with the same signature. This\n   * allows the creation of custom validation functions. For example:\n   *\n   *  var MyLink = React.createClass({\n   *    propTypes: {\n   *      // An optional string or URI prop named \"href\".\n   *      href: function(props, propName, componentName) {\n   *        var propValue = props[propName];\n   *        if (propValue != null && typeof propValue !== 'string' &&\n   *            !(propValue instanceof URI)) {\n   *          return new Error(\n   *            'Expected a string or an URI for ' + propName + ' in ' +\n   *            componentName\n   *          );\n   *        }\n   *      }\n   *    },\n   *    render: function() {...}\n   *  });\n   *\n   * @internal\n   */ var ANONYMOUS = '<<anonymous>>';\n    // Important!\n    // Keep this list in sync with production version in `./factoryWithThrowingShims.js`.\n    var ReactPropTypes = {\n        array: createPrimitiveTypeChecker('array'),\n        bigint: createPrimitiveTypeChecker('bigint'),\n        bool: createPrimitiveTypeChecker('boolean'),\n        func: createPrimitiveTypeChecker('function'),\n        number: createPrimitiveTypeChecker('number'),\n        object: createPrimitiveTypeChecker('object'),\n        string: createPrimitiveTypeChecker('string'),\n        symbol: createPrimitiveTypeChecker('symbol'),\n        any: createAnyTypeChecker(),\n        arrayOf: createArrayOfTypeChecker,\n        element: createElementTypeChecker(),\n        elementType: createElementTypeTypeChecker(),\n        instanceOf: createInstanceTypeChecker,\n        node: createNodeChecker(),\n        objectOf: createObjectOfTypeChecker,\n        oneOf: createEnumTypeChecker,\n        oneOfType: createUnionTypeChecker,\n        shape: createShapeTypeChecker,\n        exact: createStrictShapeTypeChecker\n    };\n    /**\n   * inlined Object.is polyfill to avoid requiring consumers ship their own\n   * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n   */ /*eslint-disable no-self-compare*/ function is(x, y) {\n        // SameValue algorithm\n        if (x === y) // Steps 1-5, 7-10\n        // Steps 6.b-6.e: +0 != -0\n        return x !== 0 || 1 / x === 1 / y;\n        else // Step 6.a: NaN == NaN\n        return x !== x && y !== y;\n    }\n    /*eslint-enable no-self-compare*/ /**\n   * We use an Error-like object for backward compatibility as people may call\n   * PropTypes directly and inspect their output. However, we don't use real\n   * Errors anymore. We don't inspect their stack anyway, and creating them\n   * is prohibitively expensive if they are created too often, such as what\n   * happens in oneOfType() for any type before the one that matched.\n   */ function PropTypeError(message, data) {\n        this.message = message;\n        this.data = data && typeof data === 'object' ? data : {};\n        this.stack = '';\n    }\n    // Make `instanceof Error` still work for returned errors.\n    PropTypeError.prototype = Error.prototype;\n    function createChainableTypeChecker(validate) {\n        var manualPropTypeCallCache = {};\n        var manualPropTypeWarningCount = 0;\n        function checkType(isRequired, props, propName, componentName, location, propFullName, secret) {\n            componentName = componentName || ANONYMOUS;\n            propFullName = propFullName || propName;\n            if (secret !== ReactPropTypesSecret) {\n                if (throwOnDirectAccess) {\n                    // New behavior only for users of `prop-types` package\n                    var err = new Error(\"Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types\");\n                    err.name = 'Invariant Violation';\n                    throw err;\n                } else if (typeof console !== 'undefined') {\n                    // Old behavior for people using React.PropTypes\n                    var cacheKey = componentName + ':' + propName;\n                    if (!manualPropTypeCallCache[cacheKey] && // Avoid spamming the console because they are often not actionable except for lib authors\n                    manualPropTypeWarningCount < 3) {\n                        printWarning(\"You are manually calling a React.PropTypes validation function for the `\" + propFullName + '` prop on `' + componentName + '`. This is deprecated ' + 'and will throw in the standalone `prop-types` package. ' + 'You may be seeing this warning due to a third-party PropTypes ' + 'library. See https://fb.me/react-warning-dont-call-proptypes ' + 'for details.');\n                        manualPropTypeCallCache[cacheKey] = true;\n                        manualPropTypeWarningCount++;\n                    }\n                }\n            }\n            if (props[propName] == null) {\n                if (isRequired) {\n                    if (props[propName] === null) return new PropTypeError('The ' + location + ' `' + propFullName + '` is marked as required ' + ('in `' + componentName + '`, but its value is `null`.'));\n                    return new PropTypeError('The ' + location + ' `' + propFullName + '` is marked as required in ' + ('`' + componentName + '`, but its value is `undefined`.'));\n                }\n                return null;\n            } else return validate(props, propName, componentName, location, propFullName);\n        }\n        var chainedCheckType = checkType.bind(null, false);\n        chainedCheckType.isRequired = checkType.bind(null, true);\n        return chainedCheckType;\n    }\n    function createPrimitiveTypeChecker(expectedType) {\n        function validate(props, propName, componentName, location, propFullName, secret) {\n            var propValue = props[propName];\n            var propType = getPropType(propValue);\n            if (propType !== expectedType) {\n                // `propValue` being instance of, say, date/regexp, pass the 'object'\n                // check, but we can offer a more precise error message here rather than\n                // 'of type `object`'.\n                var preciseType = getPreciseType(propValue);\n                return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + preciseType + '` supplied to `' + componentName + '`, expected ') + ('`' + expectedType + '`.'), {\n                    expectedType: expectedType\n                });\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createAnyTypeChecker() {\n        return createChainableTypeChecker(emptyFunctionThatReturnsNull);\n    }\n    function createArrayOfTypeChecker(typeChecker) {\n        function validate(props, propName, componentName, location, propFullName) {\n            if (typeof typeChecker !== 'function') return new PropTypeError('Property `' + propFullName + '` of component `' + componentName + '` has invalid PropType notation inside arrayOf.');\n            var propValue = props[propName];\n            if (!Array.isArray(propValue)) {\n                var propType = getPropType(propValue);\n                return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected an array.'));\n            }\n            for(var i = 0; i < propValue.length; i++){\n                var error = typeChecker(propValue, i, componentName, location, propFullName + '[' + i + ']', ReactPropTypesSecret);\n                if (error instanceof Error) return error;\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createElementTypeChecker() {\n        function validate(props, propName, componentName, location, propFullName) {\n            var propValue = props[propName];\n            if (!isValidElement(propValue)) {\n                var propType = getPropType(propValue);\n                return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected a single ReactElement.'));\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createElementTypeTypeChecker() {\n        function validate(props, propName, componentName, location, propFullName) {\n            var propValue = props[propName];\n            if (!ReactIs.isValidElementType(propValue)) {\n                var propType = getPropType(propValue);\n                return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected a single ReactElement type.'));\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createInstanceTypeChecker(expectedClass) {\n        function validate(props, propName, componentName, location, propFullName) {\n            if (!(props[propName] instanceof expectedClass)) {\n                var expectedClassName = expectedClass.name || ANONYMOUS;\n                var actualClassName = getClassName(props[propName]);\n                return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + actualClassName + '` supplied to `' + componentName + '`, expected ') + ('instance of `' + expectedClassName + '`.'));\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createEnumTypeChecker(expectedValues) {\n        if (!Array.isArray(expectedValues)) {\n            {\n                if (arguments.length > 1) printWarning('Invalid arguments supplied to oneOf, expected an array, got ' + arguments.length + ' arguments. ' + 'A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z]).');\n                else printWarning('Invalid argument supplied to oneOf, expected an array.');\n            }\n            return emptyFunctionThatReturnsNull;\n        }\n        function validate(props, propName, componentName, location, propFullName) {\n            var propValue = props[propName];\n            for(var i = 0; i < expectedValues.length; i++){\n                if (is(propValue, expectedValues[i])) return null;\n            }\n            var valuesString = JSON.stringify(expectedValues, function replacer(key, value) {\n                var type = getPreciseType(value);\n                if (type === 'symbol') return String(value);\n                return value;\n            });\n            return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of value `' + String(propValue) + '` ' + ('supplied to `' + componentName + '`, expected one of ' + valuesString + '.'));\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createObjectOfTypeChecker(typeChecker) {\n        function validate(props, propName, componentName, location, propFullName) {\n            if (typeof typeChecker !== 'function') return new PropTypeError('Property `' + propFullName + '` of component `' + componentName + '` has invalid PropType notation inside objectOf.');\n            var propValue = props[propName];\n            var propType = getPropType(propValue);\n            if (propType !== 'object') return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected an object.'));\n            for(var key in propValue)if (has(propValue, key)) {\n                var error = typeChecker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n                if (error instanceof Error) return error;\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createUnionTypeChecker(arrayOfTypeCheckers) {\n        if (!Array.isArray(arrayOfTypeCheckers)) {\n            printWarning('Invalid argument supplied to oneOfType, expected an instance of array.');\n            return emptyFunctionThatReturnsNull;\n        }\n        for(var i = 0; i < arrayOfTypeCheckers.length; i++){\n            var checker = arrayOfTypeCheckers[i];\n            if (typeof checker !== 'function') {\n                printWarning(\"Invalid argument supplied to oneOfType. Expected an array of check functions, but received \" + getPostfixForTypeWarning(checker) + ' at index ' + i + '.');\n                return emptyFunctionThatReturnsNull;\n            }\n        }\n        function validate(props, propName, componentName, location, propFullName) {\n            var expectedTypes = [];\n            for(var i = 0; i < arrayOfTypeCheckers.length; i++){\n                var checker = arrayOfTypeCheckers[i];\n                var checkerResult = checker(props, propName, componentName, location, propFullName, ReactPropTypesSecret);\n                if (checkerResult == null) return null;\n                if (checkerResult.data && has(checkerResult.data, 'expectedType')) expectedTypes.push(checkerResult.data.expectedType);\n            }\n            var expectedTypesMessage = expectedTypes.length > 0 ? ', expected one of type [' + expectedTypes.join(', ') + ']' : '';\n            return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` supplied to ' + ('`' + componentName + '`' + expectedTypesMessage + '.'));\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createNodeChecker() {\n        function validate(props, propName, componentName, location, propFullName) {\n            if (!isNode(props[propName])) return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` supplied to ' + ('`' + componentName + '`, expected a ReactNode.'));\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function invalidValidatorError(componentName, location, propFullName, key, type) {\n        return new PropTypeError((componentName || 'React class') + ': ' + location + ' type `' + propFullName + '.' + key + '` is invalid; ' + 'it must be a function, usually from the `prop-types` package, but received `' + type + '`.');\n    }\n    function createShapeTypeChecker(shapeTypes) {\n        function validate(props, propName, componentName, location, propFullName) {\n            var propValue = props[propName];\n            var propType = getPropType(propValue);\n            if (propType !== 'object') return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type `' + propType + '` ' + ('supplied to `' + componentName + '`, expected `object`.'));\n            for(var key in shapeTypes){\n                var checker = shapeTypes[key];\n                if (typeof checker !== 'function') return invalidValidatorError(componentName, location, propFullName, key, getPreciseType(checker));\n                var error = checker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n                if (error) return error;\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function createStrictShapeTypeChecker(shapeTypes) {\n        function validate(props, propName, componentName, location, propFullName) {\n            var propValue = props[propName];\n            var propType = getPropType(propValue);\n            if (propType !== 'object') return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type `' + propType + '` ' + ('supplied to `' + componentName + '`, expected `object`.'));\n            // We need to check all keys in case some are required but missing from props.\n            var allKeys = assign({}, props[propName], shapeTypes);\n            for(var key in allKeys){\n                var checker = shapeTypes[key];\n                if (has(shapeTypes, key) && typeof checker !== 'function') return invalidValidatorError(componentName, location, propFullName, key, getPreciseType(checker));\n                if (!checker) return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` key `' + key + '` supplied to `' + componentName + '`.' + '\\nBad object: ' + JSON.stringify(props[propName], null, '  ') + '\\nValid keys: ' + JSON.stringify(Object.keys(shapeTypes), null, '  '));\n                var error = checker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n                if (error) return error;\n            }\n            return null;\n        }\n        return createChainableTypeChecker(validate);\n    }\n    function isNode(propValue) {\n        switch(typeof propValue){\n            case 'number':\n            case 'string':\n            case 'undefined':\n                return true;\n            case 'boolean':\n                return !propValue;\n            case 'object':\n                if (Array.isArray(propValue)) return propValue.every(isNode);\n                if (propValue === null || isValidElement(propValue)) return true;\n                var iteratorFn = getIteratorFn(propValue);\n                if (iteratorFn) {\n                    var iterator = iteratorFn.call(propValue);\n                    var step;\n                    if (iteratorFn !== propValue.entries) while(!(step = iterator.next()).done){\n                        if (!isNode(step.value)) return false;\n                    }\n                    else // Iterator will provide entry [k,v] tuples rather than values.\n                    while(!(step = iterator.next()).done){\n                        var entry = step.value;\n                        if (entry) {\n                            if (!isNode(entry[1])) return false;\n                        }\n                    }\n                } else return false;\n                return true;\n            default:\n                return false;\n        }\n    }\n    function isSymbol(propType, propValue) {\n        // Native Symbol.\n        if (propType === 'symbol') return true;\n        // falsy value can't be a Symbol\n        if (!propValue) return false;\n        // 19.4.3.5 Symbol.prototype[@@toStringTag] === 'Symbol'\n        if (propValue['@@toStringTag'] === 'Symbol') return true;\n        // Fallback for non-spec compliant Symbols which are polyfilled.\n        if (typeof Symbol === 'function' && propValue instanceof Symbol) return true;\n        return false;\n    }\n    // Equivalent of `typeof` but with special handling for array and regexp.\n    function getPropType(propValue) {\n        var propType = typeof propValue;\n        if (Array.isArray(propValue)) return 'array';\n        if (propValue instanceof RegExp) // Old webkits (at least until Android 4.0) return 'function' rather than\n        // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n        // passes PropTypes.object.\n        return 'object';\n        if (isSymbol(propType, propValue)) return 'symbol';\n        return propType;\n    }\n    // This handles more types than `getPropType`. Only used for error messages.\n    // See `createPrimitiveTypeChecker`.\n    function getPreciseType(propValue) {\n        if (typeof propValue === 'undefined' || propValue === null) return '' + propValue;\n        var propType = getPropType(propValue);\n        if (propType === 'object') {\n            if (propValue instanceof Date) return 'date';\n            else if (propValue instanceof RegExp) return 'regexp';\n        }\n        return propType;\n    }\n    // Returns a string that is postfixed to a warning about an invalid type.\n    // For example, \"undefined\" or \"of type array\"\n    function getPostfixForTypeWarning(value) {\n        var type = getPreciseType(value);\n        switch(type){\n            case 'array':\n            case 'object':\n                return 'an ' + type;\n            case 'boolean':\n            case 'date':\n            case 'regexp':\n                return 'a ' + type;\n            default:\n                return type;\n        }\n    }\n    // Returns class name of the object, if any.\n    function getClassName(propValue) {\n        if (!propValue.constructor || !propValue.constructor.name) return ANONYMOUS;\n        return propValue.constructor.name;\n    }\n    ReactPropTypes.checkPropTypes = checkPropTypes;\n    ReactPropTypes.resetWarningCache = checkPropTypes.resetWarningCache;\n    ReactPropTypes.PropTypes = ReactPropTypes;\n    return ReactPropTypes;\n};\n\n},{\"c437388b089702c3\":\"dQThK\",\"c067a60101d8520c\":\"aTCxf\",\"74a0f89a70b9f3c2\":\"5lXdw\",\"18441b11647bc78\":\"236ta\",\"bec3f6ff89f0b072\":\"lDud4\"}],\"aTCxf\":[function(require,module,exports) {\n/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/ 'use strict';\n/* eslint-disable no-unused-vars */ var getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\nfunction toObject(val) {\n    if (val === null || val === undefined) throw new TypeError('Object.assign cannot be called with null or undefined');\n    return Object(val);\n}\nfunction shouldUseNative() {\n    try {\n        if (!Object.assign) return false;\n        // Detect buggy property enumeration order in older V8 versions.\n        // https://bugs.chromium.org/p/v8/issues/detail?id=4118\n        var test1 = new String('abc'); // eslint-disable-line no-new-wrappers\n        test1[5] = 'de';\n        if (Object.getOwnPropertyNames(test1)[0] === '5') return false;\n        // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n        var test2 = {};\n        for(var i = 0; i < 10; i++)test2['_' + String.fromCharCode(i)] = i;\n        var order2 = Object.getOwnPropertyNames(test2).map(function(n) {\n            return test2[n];\n        });\n        if (order2.join('') !== '0123456789') return false;\n        // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n        var test3 = {};\n        'abcdefghijklmnopqrst'.split('').forEach(function(letter) {\n            test3[letter] = letter;\n        });\n        if (Object.keys(Object.assign({}, test3)).join('') !== 'abcdefghijklmnopqrst') return false;\n        return true;\n    } catch (err) {\n        // We don't expect any of the above to throw, but better to be safe.\n        return false;\n    }\n}\nmodule.exports = shouldUseNative() ? Object.assign : function(target, source) {\n    var from;\n    var to = toObject(target);\n    var symbols;\n    for(var s = 1; s < arguments.length; s++){\n        from = Object(arguments[s]);\n        for(var key in from)if (hasOwnProperty.call(from, key)) to[key] = from[key];\n        if (getOwnPropertySymbols) {\n            symbols = getOwnPropertySymbols(from);\n            for(var i = 0; i < symbols.length; i++)if (propIsEnumerable.call(from, symbols[i])) to[symbols[i]] = from[symbols[i]];\n        }\n    }\n    return to;\n};\n\n},{}],\"5lXdw\":[function(require,module,exports) {\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ 'use strict';\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\nmodule.exports = ReactPropTypesSecret;\n\n},{}],\"236ta\":[function(require,module,exports) {\nmodule.exports = Function.call.bind(Object.prototype.hasOwnProperty);\n\n},{}],\"lDud4\":[function(require,module,exports) {\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ 'use strict';\nvar printWarning = function() {};\nvar ReactPropTypesSecret = require(\"24ba1e58d167a82c\");\nvar loggedTypeFailures = {};\nvar has = require(\"898bc82f39d83f7c\");\nprintWarning = function(text) {\n    var message = 'Warning: ' + text;\n    if (typeof console !== 'undefined') console.error(message);\n    try {\n        // --- Welcome to debugging React ---\n        // This error was thrown as a convenience so that you can use this stack\n        // to find the callsite that caused this warning to fire.\n        throw new Error(message);\n    } catch (x) {}\n};\n/**\n * Assert that the values match with the type specs.\n * Error messages are memorized and will only be shown once.\n *\n * @param {object} typeSpecs Map of name to a ReactPropType\n * @param {object} values Runtime values that need to be type-checked\n * @param {string} location e.g. \"prop\", \"context\", \"child context\"\n * @param {string} componentName Name of the component for error messages.\n * @param {?Function} getStack Returns the component stack.\n * @private\n */ function checkPropTypes(typeSpecs, values, location, componentName, getStack) {\n    for(var typeSpecName in typeSpecs)if (has(typeSpecs, typeSpecName)) {\n        var error;\n        // Prop type validation may throw. In case they do, we don't want to\n        // fail the render phase where it didn't fail before. So we log it.\n        // After these have been cleaned up, we'll let them throw.\n        try {\n            // This is intentionally an invariant that gets caught. It's the same\n            // behavior as without this statement except with a better message.\n            if (typeof typeSpecs[typeSpecName] !== 'function') {\n                var err = Error((componentName || 'React class') + ': ' + location + ' type `' + typeSpecName + '` is invalid; ' + 'it must be a function, usually from the `prop-types` package, but received `' + typeof typeSpecs[typeSpecName] + '`.' + 'This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.');\n                err.name = 'Invariant Violation';\n                throw err;\n            }\n            error = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, ReactPropTypesSecret);\n        } catch (ex) {\n            error = ex;\n        }\n        if (error && !(error instanceof Error)) printWarning((componentName || 'React class') + ': type specification of ' + location + ' `' + typeSpecName + '` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a ' + typeof error + '. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).');\n        if (error instanceof Error && !(error.message in loggedTypeFailures)) {\n            // Only monitor this failure once because there tends to be a lot of the\n            // same error.\n            loggedTypeFailures[error.message] = true;\n            var stack = getStack ? getStack() : '';\n            printWarning('Failed ' + location + ' type: ' + error.message + (stack != null ? stack : ''));\n        }\n    }\n}\n/**\n * Resets warning cache when testing.\n *\n * @private\n */ checkPropTypes.resetWarningCache = function() {\n    loggedTypeFailures = {};\n};\nmodule.exports = checkPropTypes;\n\n},{\"24ba1e58d167a82c\":\"5lXdw\",\"898bc82f39d83f7c\":\"236ta\"}],\"bZjia\":[function(require,module,exports) {\n'use strict';\nmodule.exports = require(\"6c9bf1ded7f8a5a1\");\n\n},{\"6c9bf1ded7f8a5a1\":\"bdHlp\"}],\"bdHlp\":[function(require,module,exports) {\nmodule.exports = JSON.parse(\"[\\\"a\\\",\\\"abbr\\\",\\\"address\\\",\\\"area\\\",\\\"article\\\",\\\"aside\\\",\\\"audio\\\",\\\"b\\\",\\\"base\\\",\\\"bdi\\\",\\\"bdo\\\",\\\"blockquote\\\",\\\"body\\\",\\\"br\\\",\\\"button\\\",\\\"canvas\\\",\\\"caption\\\",\\\"cite\\\",\\\"code\\\",\\\"col\\\",\\\"colgroup\\\",\\\"data\\\",\\\"datalist\\\",\\\"dd\\\",\\\"del\\\",\\\"details\\\",\\\"dfn\\\",\\\"dialog\\\",\\\"div\\\",\\\"dl\\\",\\\"dt\\\",\\\"em\\\",\\\"embed\\\",\\\"fieldset\\\",\\\"figcaption\\\",\\\"figure\\\",\\\"footer\\\",\\\"form\\\",\\\"h1\\\",\\\"h2\\\",\\\"h3\\\",\\\"h4\\\",\\\"h5\\\",\\\"h6\\\",\\\"head\\\",\\\"header\\\",\\\"hgroup\\\",\\\"hr\\\",\\\"html\\\",\\\"i\\\",\\\"iframe\\\",\\\"img\\\",\\\"input\\\",\\\"ins\\\",\\\"kbd\\\",\\\"label\\\",\\\"legend\\\",\\\"li\\\",\\\"link\\\",\\\"main\\\",\\\"map\\\",\\\"mark\\\",\\\"math\\\",\\\"menu\\\",\\\"menuitem\\\",\\\"meta\\\",\\\"meter\\\",\\\"nav\\\",\\\"noscript\\\",\\\"object\\\",\\\"ol\\\",\\\"optgroup\\\",\\\"option\\\",\\\"output\\\",\\\"p\\\",\\\"param\\\",\\\"picture\\\",\\\"pre\\\",\\\"progress\\\",\\\"q\\\",\\\"rb\\\",\\\"rp\\\",\\\"rt\\\",\\\"rtc\\\",\\\"ruby\\\",\\\"s\\\",\\\"samp\\\",\\\"script\\\",\\\"section\\\",\\\"select\\\",\\\"slot\\\",\\\"small\\\",\\\"source\\\",\\\"span\\\",\\\"strong\\\",\\\"style\\\",\\\"sub\\\",\\\"summary\\\",\\\"sup\\\",\\\"svg\\\",\\\"table\\\",\\\"tbody\\\",\\\"td\\\",\\\"template\\\",\\\"textarea\\\",\\\"tfoot\\\",\\\"th\\\",\\\"thead\\\",\\\"time\\\",\\\"title\\\",\\\"tr\\\",\\\"track\\\",\\\"u\\\",\\\"ul\\\",\\\"var\\\",\\\"video\\\",\\\"wbr\\\"]\");\n\n},{}],\"Caaa2\":[function(require,module,exports) {\nvar global = arguments[3];\n/*\n  Copyright (C) 2012-2014 Yusuke Suzuki <utatane.tea@gmail.com>\n  Copyright (C) 2015 Ingvar Stepanyan <me@rreverser.com>\n  Copyright (C) 2014 Ivan Nikulin <ifaaan@gmail.com>\n  Copyright (C) 2012-2013 Michael Ficarra <escodegen.copyright@michael.ficarra.me>\n  Copyright (C) 2012-2013 Mathias Bynens <mathias@qiwi.be>\n  Copyright (C) 2013 Irakli Gozalishvili <rfobic@gmail.com>\n  Copyright (C) 2012 Robert Gust-Bardon <donate@robert.gust-bardon.org>\n  Copyright (C) 2012 John Freeman <jfreeman08@gmail.com>\n  Copyright (C) 2011-2012 Ariya Hidayat <ariya.hidayat@gmail.com>\n  Copyright (C) 2012 Joost-Wim Boekesteijn <joost-wim@boekesteijn.nl>\n  Copyright (C) 2012 Kris Kowal <kris.kowal@cixar.com>\n  Copyright (C) 2012 Arpad Borsos <arpad.borsos@googlemail.com>\n  Copyright (C) 2020 Apple Inc. All rights reserved.\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and/or other materials provided with the distribution.\n\n  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/ /*global exports:true, require:true, global:true*/ (function() {\n    'use strict';\n    var Syntax, Precedence, BinaryPrecedence, SourceNode, estraverse, esutils, base, indent, json, renumber, hexadecimal, quotes, escapeless, newline, space, parentheses, semicolons, safeConcatenation, directive, extra, parse, sourceMap, sourceCode, preserveBlankLines, FORMAT_MINIFY, FORMAT_DEFAULTS;\n    estraverse = require(\"799f69c44c76494b\");\n    esutils = require(\"860044db75801fad\");\n    Syntax = estraverse.Syntax;\n    // Generation is done by generateExpression.\n    function isExpression(node) {\n        return CodeGenerator.Expression.hasOwnProperty(node.type);\n    }\n    // Generation is done by generateStatement.\n    function isStatement(node) {\n        return CodeGenerator.Statement.hasOwnProperty(node.type);\n    }\n    Precedence = {\n        Sequence: 0,\n        Yield: 1,\n        Assignment: 1,\n        Conditional: 2,\n        ArrowFunction: 2,\n        Coalesce: 3,\n        LogicalOR: 4,\n        LogicalAND: 5,\n        BitwiseOR: 6,\n        BitwiseXOR: 7,\n        BitwiseAND: 8,\n        Equality: 9,\n        Relational: 10,\n        BitwiseSHIFT: 11,\n        Additive: 12,\n        Multiplicative: 13,\n        Exponentiation: 14,\n        Await: 15,\n        Unary: 15,\n        Postfix: 16,\n        OptionalChaining: 17,\n        Call: 18,\n        New: 19,\n        TaggedTemplate: 20,\n        Member: 21,\n        Primary: 22\n    };\n    BinaryPrecedence = {\n        '??': Precedence.Coalesce,\n        '||': Precedence.LogicalOR,\n        '&&': Precedence.LogicalAND,\n        '|': Precedence.BitwiseOR,\n        '^': Precedence.BitwiseXOR,\n        '&': Precedence.BitwiseAND,\n        '==': Precedence.Equality,\n        '!=': Precedence.Equality,\n        '===': Precedence.Equality,\n        '!==': Precedence.Equality,\n        'is': Precedence.Equality,\n        'isnt': Precedence.Equality,\n        '<': Precedence.Relational,\n        '>': Precedence.Relational,\n        '<=': Precedence.Relational,\n        '>=': Precedence.Relational,\n        'in': Precedence.Relational,\n        'instanceof': Precedence.Relational,\n        '<<': Precedence.BitwiseSHIFT,\n        '>>': Precedence.BitwiseSHIFT,\n        '>>>': Precedence.BitwiseSHIFT,\n        '+': Precedence.Additive,\n        '-': Precedence.Additive,\n        '*': Precedence.Multiplicative,\n        '%': Precedence.Multiplicative,\n        '/': Precedence.Multiplicative,\n        '**': Precedence.Exponentiation\n    };\n    //Flags\n    var F_ALLOW_IN = 1, F_ALLOW_CALL = 2, F_ALLOW_UNPARATH_NEW = 4, F_FUNC_BODY = 8, F_DIRECTIVE_CTX = 16, F_SEMICOLON_OPT = 32, F_FOUND_COALESCE = 64;\n    //Expression flag sets\n    //NOTE: Flag order:\n    // F_ALLOW_IN\n    // F_ALLOW_CALL\n    // F_ALLOW_UNPARATH_NEW\n    var E_FTT = F_ALLOW_CALL | F_ALLOW_UNPARATH_NEW, E_TTF = F_ALLOW_IN | F_ALLOW_CALL, E_TTT = F_ALLOW_IN | F_ALLOW_CALL | F_ALLOW_UNPARATH_NEW, E_TFF = F_ALLOW_IN, E_FFT = F_ALLOW_UNPARATH_NEW, E_TFT = F_ALLOW_IN | F_ALLOW_UNPARATH_NEW;\n    //Statement flag sets\n    //NOTE: Flag order:\n    // F_ALLOW_IN\n    // F_FUNC_BODY\n    // F_DIRECTIVE_CTX\n    // F_SEMICOLON_OPT\n    var S_TFFF = F_ALLOW_IN, S_TFFT = F_ALLOW_IN | F_SEMICOLON_OPT, S_FFFF = 0x00, S_TFTF = F_ALLOW_IN | F_DIRECTIVE_CTX, S_TTFF = F_ALLOW_IN | F_FUNC_BODY;\n    function getDefaultOptions() {\n        // default options\n        return {\n            indent: null,\n            base: null,\n            parse: null,\n            comment: false,\n            format: {\n                indent: {\n                    style: '    ',\n                    base: 0,\n                    adjustMultilineComment: false\n                },\n                newline: '\\n',\n                space: ' ',\n                json: false,\n                renumber: false,\n                hexadecimal: false,\n                quotes: 'single',\n                escapeless: false,\n                compact: false,\n                parentheses: true,\n                semicolons: true,\n                safeConcatenation: false,\n                preserveBlankLines: false\n            },\n            moz: {\n                comprehensionExpressionStartsWithAssignment: false,\n                starlessGenerator: false\n            },\n            sourceMap: null,\n            sourceMapRoot: null,\n            sourceMapWithCode: false,\n            directive: false,\n            raw: true,\n            verbatim: null,\n            sourceCode: null\n        };\n    }\n    function stringRepeat(str, num) {\n        var result = '';\n        for(num |= 0; num > 0; num >>>= 1, str += str)if (num & 1) result += str;\n        return result;\n    }\n    function hasLineTerminator(str) {\n        return /[\\r\\n]/g.test(str);\n    }\n    function endsWithLineTerminator(str) {\n        var len = str.length;\n        return len && esutils.code.isLineTerminator(str.charCodeAt(len - 1));\n    }\n    function merge(target, override) {\n        var key;\n        for(key in override)if (override.hasOwnProperty(key)) target[key] = override[key];\n        return target;\n    }\n    function updateDeeply(target, override) {\n        var key, val;\n        function isHashObject(target) {\n            return typeof target === 'object' && target instanceof Object && !(target instanceof RegExp);\n        }\n        for(key in override)if (override.hasOwnProperty(key)) {\n            val = override[key];\n            if (isHashObject(val)) {\n                if (isHashObject(target[key])) updateDeeply(target[key], val);\n                else target[key] = updateDeeply({}, val);\n            } else target[key] = val;\n        }\n        return target;\n    }\n    function generateNumber(value) {\n        var result, point, temp, exponent, pos;\n        if (value !== value) throw new Error('Numeric literal whose value is NaN');\n        if (value < 0 || value === 0 && 1 / value < 0) throw new Error('Numeric literal whose value is negative');\n        if (value === 1 / 0) return json ? 'null' : renumber ? '1e400' : '1e+400';\n        result = '' + value;\n        if (!renumber || result.length < 3) return result;\n        point = result.indexOf('.');\n        if (!json && result.charCodeAt(0) === 0x30 /* 0 */  && point === 1) {\n            point = 0;\n            result = result.slice(1);\n        }\n        temp = result;\n        result = result.replace('e+', 'e');\n        exponent = 0;\n        if ((pos = temp.indexOf('e')) > 0) {\n            exponent = +temp.slice(pos + 1);\n            temp = temp.slice(0, pos);\n        }\n        if (point >= 0) {\n            exponent -= temp.length - point - 1;\n            temp = +(temp.slice(0, point) + temp.slice(point + 1)) + '';\n        }\n        pos = 0;\n        while(temp.charCodeAt(temp.length + pos - 1) === 0x30 /* 0 */ )--pos;\n        if (pos !== 0) {\n            exponent -= pos;\n            temp = temp.slice(0, pos);\n        }\n        if (exponent !== 0) temp += 'e' + exponent;\n        if ((temp.length < result.length || hexadecimal && value > 1e12 && Math.floor(value) === value && (temp = '0x' + value.toString(16)).length < result.length) && +temp === value) result = temp;\n        return result;\n    }\n    // Generate valid RegExp expression.\n    // This function is based on https://github.com/Constellation/iv Engine\n    function escapeRegExpCharacter(ch, previousIsBackslash) {\n        // not handling '\\' and handling \\u2028 or \\u2029 to unicode escape sequence\n        if ((ch & -2) === 0x2028) return (previousIsBackslash ? 'u' : '\\\\u') + (ch === 0x2028 ? '2028' : '2029');\n        else if (ch === 10 || ch === 13) return (previousIsBackslash ? '' : '\\\\') + (ch === 10 ? 'n' : 'r');\n        return String.fromCharCode(ch);\n    }\n    function generateRegExp(reg) {\n        var match, result, flags, i, iz, ch, characterInBrack, previousIsBackslash;\n        result = reg.toString();\n        if (reg.source) {\n            // extract flag from toString result\n            match = result.match(/\\/([^/]*)$/);\n            if (!match) return result;\n            flags = match[1];\n            result = '';\n            characterInBrack = false;\n            previousIsBackslash = false;\n            for(i = 0, iz = reg.source.length; i < iz; ++i){\n                ch = reg.source.charCodeAt(i);\n                if (!previousIsBackslash) {\n                    if (characterInBrack) {\n                        if (ch === 93) characterInBrack = false;\n                    } else {\n                        if (ch === 47) result += '\\\\';\n                        else if (ch === 91) characterInBrack = true;\n                    }\n                    result += escapeRegExpCharacter(ch, previousIsBackslash);\n                    previousIsBackslash = ch === 92; // \\\n                } else {\n                    // if new RegExp(\"\\\\\\n') is provided, create /\\n/\n                    result += escapeRegExpCharacter(ch, previousIsBackslash);\n                    // prevent like /\\\\[/]/\n                    previousIsBackslash = false;\n                }\n            }\n            return '/' + result + '/' + flags;\n        }\n        return result;\n    }\n    function escapeAllowedCharacter(code, next) {\n        var hex;\n        if (code === 0x08 /* \\b */ ) return '\\\\b';\n        if (code === 0x0C /* \\f */ ) return '\\\\f';\n        if (code === 0x09 /* \\t */ ) return '\\\\t';\n        hex = code.toString(16).toUpperCase();\n        if (json || code > 0xFF) return '\\\\u' + '0000'.slice(hex.length) + hex;\n        else if (code === 0x0000 && !esutils.code.isDecimalDigit(next)) return '\\\\0';\n        else if (code === 0x000B /* \\v */ ) return '\\\\x0B';\n        else return '\\\\x' + '00'.slice(hex.length) + hex;\n    }\n    function escapeDisallowedCharacter(code) {\n        if (code === 0x5C /* \\ */ ) return '\\\\\\\\';\n        if (code === 0x0A /* \\n */ ) return '\\\\n';\n        if (code === 0x0D /* \\r */ ) return '\\\\r';\n        if (code === 0x2028) return '\\\\u2028';\n        if (code === 0x2029) return '\\\\u2029';\n        throw new Error('Incorrectly classified character');\n    }\n    function escapeDirective(str) {\n        var i, iz, code, quote;\n        quote = quotes === 'double' ? '\"' : '\\'';\n        for(i = 0, iz = str.length; i < iz; ++i){\n            code = str.charCodeAt(i);\n            if (code === 0x27 /* ' */ ) {\n                quote = '\"';\n                break;\n            } else if (code === 0x22 /* \" */ ) {\n                quote = '\\'';\n                break;\n            } else if (code === 0x5C /* \\ */ ) ++i;\n        }\n        return quote + str + quote;\n    }\n    function escapeString(str) {\n        var result = '', i, len, code, singleQuotes = 0, doubleQuotes = 0, single, quote;\n        for(i = 0, len = str.length; i < len; ++i){\n            code = str.charCodeAt(i);\n            if (code === 0x27 /* ' */ ) ++singleQuotes;\n            else if (code === 0x22 /* \" */ ) ++doubleQuotes;\n            else if (code === 0x2F /* / */  && json) result += '\\\\';\n            else if (esutils.code.isLineTerminator(code) || code === 0x5C /* \\ */ ) {\n                result += escapeDisallowedCharacter(code);\n                continue;\n            } else if (!esutils.code.isIdentifierPartES5(code) && (json && code < 0x20 /* SP */  || !json && !escapeless && (code < 0x20 /* SP */  || code > 0x7E /* ~ */ ))) {\n                result += escapeAllowedCharacter(code, str.charCodeAt(i + 1));\n                continue;\n            }\n            result += String.fromCharCode(code);\n        }\n        single = !(quotes === 'double' || quotes === 'auto' && doubleQuotes < singleQuotes);\n        quote = single ? '\\'' : '\"';\n        if (!(single ? singleQuotes : doubleQuotes)) return quote + result + quote;\n        str = result;\n        result = quote;\n        for(i = 0, len = str.length; i < len; ++i){\n            code = str.charCodeAt(i);\n            if (code === 0x27 /* ' */  && single || code === 0x22 /* \" */  && !single) result += '\\\\';\n            result += String.fromCharCode(code);\n        }\n        return result + quote;\n    }\n    /**\n     * flatten an array to a string, where the array can contain\n     * either strings or nested arrays\n     */ function flattenToString(arr) {\n        var i, iz, elem, result = '';\n        for(i = 0, iz = arr.length; i < iz; ++i){\n            elem = arr[i];\n            result += Array.isArray(elem) ? flattenToString(elem) : elem;\n        }\n        return result;\n    }\n    /**\n     * convert generated to a SourceNode when source maps are enabled.\n     */ function toSourceNodeWhenNeeded(generated, node) {\n        if (!sourceMap) {\n            // with no source maps, generated is either an\n            // array or a string.  if an array, flatten it.\n            // if a string, just return it\n            if (Array.isArray(generated)) return flattenToString(generated);\n            else return generated;\n        }\n        if (node == null) {\n            if (generated instanceof SourceNode) return generated;\n            else node = {};\n        }\n        if (node.loc == null) return new SourceNode(null, null, sourceMap, generated, node.name || null);\n        return new SourceNode(node.loc.start.line, node.loc.start.column, sourceMap === true ? node.loc.source || null : sourceMap, generated, node.name || null);\n    }\n    function noEmptySpace() {\n        return space ? space : ' ';\n    }\n    function join(left, right) {\n        var leftSource, rightSource, leftCharCode, rightCharCode;\n        leftSource = toSourceNodeWhenNeeded(left).toString();\n        if (leftSource.length === 0) return [\n            right\n        ];\n        rightSource = toSourceNodeWhenNeeded(right).toString();\n        if (rightSource.length === 0) return [\n            left\n        ];\n        leftCharCode = leftSource.charCodeAt(leftSource.length - 1);\n        rightCharCode = rightSource.charCodeAt(0);\n        if ((leftCharCode === 0x2B /* + */  || leftCharCode === 0x2D /* - */ ) && leftCharCode === rightCharCode || esutils.code.isIdentifierPartES5(leftCharCode) && esutils.code.isIdentifierPartES5(rightCharCode) || leftCharCode === 0x2F /* / */  && rightCharCode === 0x69 /* i */ ) return [\n            left,\n            noEmptySpace(),\n            right\n        ];\n        else if (esutils.code.isWhiteSpace(leftCharCode) || esutils.code.isLineTerminator(leftCharCode) || esutils.code.isWhiteSpace(rightCharCode) || esutils.code.isLineTerminator(rightCharCode)) return [\n            left,\n            right\n        ];\n        return [\n            left,\n            space,\n            right\n        ];\n    }\n    function addIndent(stmt) {\n        return [\n            base,\n            stmt\n        ];\n    }\n    function withIndent(fn) {\n        var previousBase;\n        previousBase = base;\n        base += indent;\n        fn(base);\n        base = previousBase;\n    }\n    function calculateSpaces(str) {\n        var i;\n        for(i = str.length - 1; i >= 0; --i){\n            if (esutils.code.isLineTerminator(str.charCodeAt(i))) break;\n        }\n        return str.length - 1 - i;\n    }\n    function adjustMultilineComment(value, specialBase) {\n        var array, i, len, line, j, spaces, previousBase, sn;\n        array = value.split(/\\r\\n|[\\r\\n]/);\n        spaces = Number.MAX_VALUE;\n        // first line doesn't have indentation\n        for(i = 1, len = array.length; i < len; ++i){\n            line = array[i];\n            j = 0;\n            while(j < line.length && esutils.code.isWhiteSpace(line.charCodeAt(j)))++j;\n            if (spaces > j) spaces = j;\n        }\n        if (typeof specialBase !== 'undefined') {\n            // pattern like\n            // {\n            //   var t = 20;  /*\n            //                 * this is comment\n            //                 */\n            // }\n            previousBase = base;\n            if (array[1][spaces] === '*') specialBase += ' ';\n            base = specialBase;\n        } else {\n            if (spaces & 1) // /*\n            //  *\n            //  */\n            // If spaces are odd number, above pattern is considered.\n            // We waste 1 space.\n            --spaces;\n            previousBase = base;\n        }\n        for(i = 1, len = array.length; i < len; ++i){\n            sn = toSourceNodeWhenNeeded(addIndent(array[i].slice(spaces)));\n            array[i] = sourceMap ? sn.join('') : sn;\n        }\n        base = previousBase;\n        return array.join('\\n');\n    }\n    function generateComment(comment, specialBase) {\n        if (comment.type === 'Line') {\n            if (endsWithLineTerminator(comment.value)) return '//' + comment.value;\n            else {\n                // Always use LineTerminator\n                var result = '//' + comment.value;\n                if (!preserveBlankLines) result += '\\n';\n                return result;\n            }\n        }\n        if (extra.format.indent.adjustMultilineComment && /[\\n\\r]/.test(comment.value)) return adjustMultilineComment('/*' + comment.value + '*/', specialBase);\n        return '/*' + comment.value + '*/';\n    }\n    function addComments(stmt, result) {\n        var i, len, comment, save, tailingToStatement, specialBase, fragment, extRange, range, prevRange, prefix, infix, suffix, count;\n        if (stmt.leadingComments && stmt.leadingComments.length > 0) {\n            save = result;\n            if (preserveBlankLines) {\n                comment = stmt.leadingComments[0];\n                result = [];\n                extRange = comment.extendedRange;\n                range = comment.range;\n                prefix = sourceCode.substring(extRange[0], range[0]);\n                count = (prefix.match(/\\n/g) || []).length;\n                if (count > 0) {\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n                } else {\n                    result.push(prefix);\n                    result.push(generateComment(comment));\n                }\n                prevRange = range;\n                for(i = 1, len = stmt.leadingComments.length; i < len; i++){\n                    comment = stmt.leadingComments[i];\n                    range = comment.range;\n                    infix = sourceCode.substring(prevRange[1], range[0]);\n                    count = (infix.match(/\\n/g) || []).length;\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n                    prevRange = range;\n                }\n                suffix = sourceCode.substring(range[1], extRange[1]);\n                count = (suffix.match(/\\n/g) || []).length;\n                result.push(stringRepeat('\\n', count));\n            } else {\n                comment = stmt.leadingComments[0];\n                result = [];\n                if (safeConcatenation && stmt.type === Syntax.Program && stmt.body.length === 0) result.push('\\n');\n                result.push(generateComment(comment));\n                if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push('\\n');\n                for(i = 1, len = stmt.leadingComments.length; i < len; ++i){\n                    comment = stmt.leadingComments[i];\n                    fragment = [\n                        generateComment(comment)\n                    ];\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) fragment.push('\\n');\n                    result.push(addIndent(fragment));\n                }\n            }\n            result.push(addIndent(save));\n        }\n        if (stmt.trailingComments) {\n            if (preserveBlankLines) {\n                comment = stmt.trailingComments[0];\n                extRange = comment.extendedRange;\n                range = comment.range;\n                prefix = sourceCode.substring(extRange[0], range[0]);\n                count = (prefix.match(/\\n/g) || []).length;\n                if (count > 0) {\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n                } else {\n                    result.push(prefix);\n                    result.push(generateComment(comment));\n                }\n            } else {\n                tailingToStatement = !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString());\n                specialBase = stringRepeat(' ', calculateSpaces(toSourceNodeWhenNeeded([\n                    base,\n                    result,\n                    indent\n                ]).toString()));\n                for(i = 0, len = stmt.trailingComments.length; i < len; ++i){\n                    comment = stmt.trailingComments[i];\n                    if (tailingToStatement) {\n                        // We assume target like following script\n                        //\n                        // var t = 20;  /**\n                        //               * This is comment of t\n                        //               */\n                        if (i === 0) // first case\n                        result = [\n                            result,\n                            indent\n                        ];\n                        else result = [\n                            result,\n                            specialBase\n                        ];\n                        result.push(generateComment(comment, specialBase));\n                    } else result = [\n                        result,\n                        addIndent(generateComment(comment))\n                    ];\n                    if (i !== len - 1 && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result = [\n                        result,\n                        '\\n'\n                    ];\n                }\n            }\n        }\n        return result;\n    }\n    function generateBlankLines(start, end, result) {\n        var j, newlineCount = 0;\n        for(j = start; j < end; j++)if (sourceCode[j] === '\\n') newlineCount++;\n        for(j = 1; j < newlineCount; j++)result.push(newline);\n    }\n    function parenthesize(text, current, should) {\n        if (current < should) return [\n            '(',\n            text,\n            ')'\n        ];\n        return text;\n    }\n    function generateVerbatimString(string) {\n        var i, iz, result;\n        result = string.split(/\\r\\n|\\n/);\n        for(i = 1, iz = result.length; i < iz; i++)result[i] = newline + base + result[i];\n        return result;\n    }\n    function generateVerbatim(expr, precedence) {\n        var verbatim, result, prec;\n        verbatim = expr[extra.verbatim];\n        if (typeof verbatim === 'string') result = parenthesize(generateVerbatimString(verbatim), Precedence.Sequence, precedence);\n        else {\n            // verbatim is object\n            result = generateVerbatimString(verbatim.content);\n            prec = verbatim.precedence != null ? verbatim.precedence : Precedence.Sequence;\n            result = parenthesize(result, prec, precedence);\n        }\n        return toSourceNodeWhenNeeded(result, expr);\n    }\n    function CodeGenerator() {}\n    // Helpers.\n    CodeGenerator.prototype.maybeBlock = function(stmt, flags) {\n        var result, noLeadingComment, that = this;\n        noLeadingComment = !extra.comment || !stmt.leadingComments;\n        if (stmt.type === Syntax.BlockStatement && noLeadingComment) return [\n            space,\n            this.generateStatement(stmt, flags)\n        ];\n        if (stmt.type === Syntax.EmptyStatement && noLeadingComment) return ';';\n        withIndent(function() {\n            result = [\n                newline,\n                addIndent(that.generateStatement(stmt, flags))\n            ];\n        });\n        return result;\n    };\n    CodeGenerator.prototype.maybeBlockSuffix = function(stmt, result) {\n        var ends = endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString());\n        if (stmt.type === Syntax.BlockStatement && (!extra.comment || !stmt.leadingComments) && !ends) return [\n            result,\n            space\n        ];\n        if (ends) return [\n            result,\n            base\n        ];\n        return [\n            result,\n            newline,\n            base\n        ];\n    };\n    function generateIdentifier(node) {\n        return toSourceNodeWhenNeeded(node.name, node);\n    }\n    function generateAsyncPrefix(node, spaceRequired) {\n        return node.async ? 'async' + (spaceRequired ? noEmptySpace() : space) : '';\n    }\n    function generateStarSuffix(node) {\n        var isGenerator = node.generator && !extra.moz.starlessGenerator;\n        return isGenerator ? '*' + space : '';\n    }\n    function generateMethodPrefix(prop) {\n        var func = prop.value, prefix = '';\n        if (func.async) prefix += generateAsyncPrefix(func, !prop.computed);\n        if (func.generator) // avoid space before method name\n        prefix += generateStarSuffix(func) ? '*' : '';\n        return prefix;\n    }\n    CodeGenerator.prototype.generatePattern = function(node, precedence, flags) {\n        if (node.type === Syntax.Identifier) return generateIdentifier(node);\n        return this.generateExpression(node, precedence, flags);\n    };\n    CodeGenerator.prototype.generateFunctionParams = function(node) {\n        var i, iz, result, hasDefault;\n        hasDefault = false;\n        if (node.type === Syntax.ArrowFunctionExpression && !node.rest && (!node.defaults || node.defaults.length === 0) && node.params.length === 1 && node.params[0].type === Syntax.Identifier) // arg => { } case\n        result = [\n            generateAsyncPrefix(node, true),\n            generateIdentifier(node.params[0])\n        ];\n        else {\n            result = node.type === Syntax.ArrowFunctionExpression ? [\n                generateAsyncPrefix(node, false)\n            ] : [];\n            result.push('(');\n            if (node.defaults) hasDefault = true;\n            for(i = 0, iz = node.params.length; i < iz; ++i){\n                if (hasDefault && node.defaults[i]) // Handle default values.\n                result.push(this.generateAssignment(node.params[i], node.defaults[i], '=', Precedence.Assignment, E_TTT));\n                else result.push(this.generatePattern(node.params[i], Precedence.Assignment, E_TTT));\n                if (i + 1 < iz) result.push(',' + space);\n            }\n            if (node.rest) {\n                if (node.params.length) result.push(',' + space);\n                result.push('...');\n                result.push(generateIdentifier(node.rest));\n            }\n            result.push(')');\n        }\n        return result;\n    };\n    CodeGenerator.prototype.generateFunctionBody = function(node) {\n        var result, expr;\n        result = this.generateFunctionParams(node);\n        if (node.type === Syntax.ArrowFunctionExpression) {\n            result.push(space);\n            result.push('=>');\n        }\n        if (node.expression) {\n            result.push(space);\n            expr = this.generateExpression(node.body, Precedence.Assignment, E_TTT);\n            if (expr.toString().charAt(0) === '{') expr = [\n                '(',\n                expr,\n                ')'\n            ];\n            result.push(expr);\n        } else result.push(this.maybeBlock(node.body, S_TTFF));\n        return result;\n    };\n    CodeGenerator.prototype.generateIterationForStatement = function(operator, stmt, flags) {\n        var result = [\n            'for' + (stmt.await ? noEmptySpace() + 'await' : '') + space + '('\n        ], that = this;\n        withIndent(function() {\n            if (stmt.left.type === Syntax.VariableDeclaration) withIndent(function() {\n                result.push(stmt.left.kind + noEmptySpace());\n                result.push(that.generateStatement(stmt.left.declarations[0], S_FFFF));\n            });\n            else result.push(that.generateExpression(stmt.left, Precedence.Call, E_TTT));\n            result = join(result, operator);\n            result = [\n                join(result, that.generateExpression(stmt.right, Precedence.Assignment, E_TTT)),\n                ')'\n            ];\n        });\n        result.push(this.maybeBlock(stmt.body, flags));\n        return result;\n    };\n    CodeGenerator.prototype.generatePropertyKey = function(expr, computed) {\n        var result = [];\n        if (computed) result.push('[');\n        result.push(this.generateExpression(expr, Precedence.Assignment, E_TTT));\n        if (computed) result.push(']');\n        return result;\n    };\n    CodeGenerator.prototype.generateAssignment = function(left, right, operator, precedence, flags) {\n        if (Precedence.Assignment < precedence) flags |= F_ALLOW_IN;\n        return parenthesize([\n            this.generateExpression(left, Precedence.Call, flags),\n            space + operator + space,\n            this.generateExpression(right, Precedence.Assignment, flags)\n        ], Precedence.Assignment, precedence);\n    };\n    CodeGenerator.prototype.semicolon = function(flags) {\n        if (!semicolons && flags & F_SEMICOLON_OPT) return '';\n        return ';';\n    };\n    // Statements.\n    CodeGenerator.Statement = {\n        BlockStatement: function(stmt, flags) {\n            var range, content, result = [\n                '{',\n                newline\n            ], that = this;\n            withIndent(function() {\n                // handle functions without any code\n                if (stmt.body.length === 0 && preserveBlankLines) {\n                    range = stmt.range;\n                    if (range[1] - range[0] > 2) {\n                        content = sourceCode.substring(range[0] + 1, range[1] - 1);\n                        if (content[0] === '\\n') result = [\n                            '{'\n                        ];\n                        result.push(content);\n                    }\n                }\n                var i, iz, fragment, bodyFlags;\n                bodyFlags = S_TFFF;\n                if (flags & F_FUNC_BODY) bodyFlags |= F_DIRECTIVE_CTX;\n                for(i = 0, iz = stmt.body.length; i < iz; ++i){\n                    if (preserveBlankLines) {\n                        // handle spaces before the first line\n                        if (i === 0) {\n                            if (stmt.body[0].leadingComments) {\n                                range = stmt.body[0].leadingComments[0].extendedRange;\n                                content = sourceCode.substring(range[0], range[1]);\n                                if (content[0] === '\\n') result = [\n                                    '{'\n                                ];\n                            }\n                            if (!stmt.body[0].leadingComments) generateBlankLines(stmt.range[0], stmt.body[0].range[0], result);\n                        }\n                        // handle spaces between lines\n                        if (i > 0) {\n                            if (!stmt.body[i - 1].trailingComments && !stmt.body[i].leadingComments) generateBlankLines(stmt.body[i - 1].range[1], stmt.body[i].range[0], result);\n                        }\n                    }\n                    if (i === iz - 1) bodyFlags |= F_SEMICOLON_OPT;\n                    if (stmt.body[i].leadingComments && preserveBlankLines) fragment = that.generateStatement(stmt.body[i], bodyFlags);\n                    else fragment = addIndent(that.generateStatement(stmt.body[i], bodyFlags));\n                    result.push(fragment);\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                        if (preserveBlankLines && i < iz - 1) // don't add a new line if there are leading coments\n                        // in the next statement\n                        {\n                            if (!stmt.body[i + 1].leadingComments) result.push(newline);\n                        } else result.push(newline);\n                    }\n                    if (preserveBlankLines) {\n                        // handle spaces after the last line\n                        if (i === iz - 1) {\n                            if (!stmt.body[i].trailingComments) generateBlankLines(stmt.body[i].range[1], stmt.range[1], result);\n                        }\n                    }\n                }\n            });\n            result.push(addIndent('}'));\n            return result;\n        },\n        BreakStatement: function(stmt, flags) {\n            if (stmt.label) return 'break ' + stmt.label.name + this.semicolon(flags);\n            return 'break' + this.semicolon(flags);\n        },\n        ContinueStatement: function(stmt, flags) {\n            if (stmt.label) return 'continue ' + stmt.label.name + this.semicolon(flags);\n            return 'continue' + this.semicolon(flags);\n        },\n        ClassBody: function(stmt, flags) {\n            var result = [\n                '{',\n                newline\n            ], that = this;\n            withIndent(function(indent) {\n                var i, iz;\n                for(i = 0, iz = stmt.body.length; i < iz; ++i){\n                    result.push(indent);\n                    result.push(that.generateExpression(stmt.body[i], Precedence.Sequence, E_TTT));\n                    if (i + 1 < iz) result.push(newline);\n                }\n            });\n            if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n            result.push(base);\n            result.push('}');\n            return result;\n        },\n        ClassDeclaration: function(stmt, flags) {\n            var result, fragment;\n            result = [\n                'class'\n            ];\n            if (stmt.id) result = join(result, this.generateExpression(stmt.id, Precedence.Sequence, E_TTT));\n            if (stmt.superClass) {\n                fragment = join('extends', this.generateExpression(stmt.superClass, Precedence.Unary, E_TTT));\n                result = join(result, fragment);\n            }\n            result.push(space);\n            result.push(this.generateStatement(stmt.body, S_TFFT));\n            return result;\n        },\n        DirectiveStatement: function(stmt, flags) {\n            if (extra.raw && stmt.raw) return stmt.raw + this.semicolon(flags);\n            return escapeDirective(stmt.directive) + this.semicolon(flags);\n        },\n        DoWhileStatement: function(stmt, flags) {\n            // Because `do 42 while (cond)` is Syntax Error. We need semicolon.\n            var result = join('do', this.maybeBlock(stmt.body, S_TFFF));\n            result = this.maybeBlockSuffix(stmt.body, result);\n            return join(result, [\n                'while' + space + '(',\n                this.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                ')' + this.semicolon(flags)\n            ]);\n        },\n        CatchClause: function(stmt, flags) {\n            var result, that = this;\n            withIndent(function() {\n                var guard;\n                if (stmt.param) {\n                    result = [\n                        'catch' + space + '(',\n                        that.generateExpression(stmt.param, Precedence.Sequence, E_TTT),\n                        ')'\n                    ];\n                    if (stmt.guard) {\n                        guard = that.generateExpression(stmt.guard, Precedence.Sequence, E_TTT);\n                        result.splice(2, 0, ' if ', guard);\n                    }\n                } else result = [\n                    'catch'\n                ];\n            });\n            result.push(this.maybeBlock(stmt.body, S_TFFF));\n            return result;\n        },\n        DebuggerStatement: function(stmt, flags) {\n            return 'debugger' + this.semicolon(flags);\n        },\n        EmptyStatement: function(stmt, flags) {\n            return ';';\n        },\n        ExportDefaultDeclaration: function(stmt, flags) {\n            var result = [\n                'export'\n            ], bodyFlags;\n            bodyFlags = flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF;\n            // export default HoistableDeclaration[Default]\n            // export default AssignmentExpression[In] ;\n            result = join(result, 'default');\n            if (isStatement(stmt.declaration)) result = join(result, this.generateStatement(stmt.declaration, bodyFlags));\n            else result = join(result, this.generateExpression(stmt.declaration, Precedence.Assignment, E_TTT) + this.semicolon(flags));\n            return result;\n        },\n        ExportNamedDeclaration: function(stmt, flags) {\n            var result = [\n                'export'\n            ], bodyFlags, that = this;\n            bodyFlags = flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF;\n            // export VariableStatement\n            // export Declaration[Default]\n            if (stmt.declaration) return join(result, this.generateStatement(stmt.declaration, bodyFlags));\n            // export ExportClause[NoReference] FromClause ;\n            // export ExportClause ;\n            if (stmt.specifiers) {\n                if (stmt.specifiers.length === 0) result = join(result, '{' + space + '}');\n                else if (stmt.specifiers[0].type === Syntax.ExportBatchSpecifier) result = join(result, this.generateExpression(stmt.specifiers[0], Precedence.Sequence, E_TTT));\n                else {\n                    result = join(result, '{');\n                    withIndent(function(indent) {\n                        var i, iz;\n                        result.push(newline);\n                        for(i = 0, iz = stmt.specifiers.length; i < iz; ++i){\n                            result.push(indent);\n                            result.push(that.generateExpression(stmt.specifiers[i], Precedence.Sequence, E_TTT));\n                            if (i + 1 < iz) result.push(',' + newline);\n                        }\n                    });\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n                    result.push(base + '}');\n                }\n                if (stmt.source) result = join(result, [\n                    'from' + space,\n                    // ModuleSpecifier\n                    this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                    this.semicolon(flags)\n                ]);\n                else result.push(this.semicolon(flags));\n            }\n            return result;\n        },\n        ExportAllDeclaration: function(stmt, flags) {\n            // export * FromClause ;\n            return [\n                'export' + space,\n                '*' + space,\n                'from' + space,\n                // ModuleSpecifier\n                this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                this.semicolon(flags)\n            ];\n        },\n        ExpressionStatement: function(stmt, flags) {\n            var result, fragment;\n            function isClassPrefixed(fragment) {\n                var code;\n                if (fragment.slice(0, 5) !== 'class') return false;\n                code = fragment.charCodeAt(5);\n                return code === 0x7B /* '{' */  || esutils.code.isWhiteSpace(code) || esutils.code.isLineTerminator(code);\n            }\n            function isFunctionPrefixed(fragment) {\n                var code;\n                if (fragment.slice(0, 8) !== 'function') return false;\n                code = fragment.charCodeAt(8);\n                return code === 0x28 /* '(' */  || esutils.code.isWhiteSpace(code) || code === 0x2A /* '*' */  || esutils.code.isLineTerminator(code);\n            }\n            function isAsyncPrefixed(fragment) {\n                var code, i, iz;\n                if (fragment.slice(0, 5) !== 'async') return false;\n                if (!esutils.code.isWhiteSpace(fragment.charCodeAt(5))) return false;\n                for(i = 6, iz = fragment.length; i < iz; ++i){\n                    if (!esutils.code.isWhiteSpace(fragment.charCodeAt(i))) break;\n                }\n                if (i === iz) return false;\n                if (fragment.slice(i, i + 8) !== 'function') return false;\n                code = fragment.charCodeAt(i + 8);\n                return code === 0x28 /* '(' */  || esutils.code.isWhiteSpace(code) || code === 0x2A /* '*' */  || esutils.code.isLineTerminator(code);\n            }\n            result = [\n                this.generateExpression(stmt.expression, Precedence.Sequence, E_TTT)\n            ];\n            // 12.4 '{', 'function', 'class' is not allowed in this position.\n            // wrap expression with parentheses\n            fragment = toSourceNodeWhenNeeded(result).toString();\n            if (fragment.charCodeAt(0) === 0x7B /* '{' */  || // ObjectExpression\n            isClassPrefixed(fragment) || isFunctionPrefixed(fragment) || isAsyncPrefixed(fragment) || directive && flags & F_DIRECTIVE_CTX && stmt.expression.type === Syntax.Literal && typeof stmt.expression.value === 'string') result = [\n                '(',\n                result,\n                ')' + this.semicolon(flags)\n            ];\n            else result.push(this.semicolon(flags));\n            return result;\n        },\n        ImportDeclaration: function(stmt, flags) {\n            // ES6: 15.2.1 valid import declarations:\n            //     - import ImportClause FromClause ;\n            //     - import ModuleSpecifier ;\n            var result, cursor, that = this;\n            // If no ImportClause is present,\n            // this should be `import ModuleSpecifier` so skip `from`\n            // ModuleSpecifier is StringLiteral.\n            if (stmt.specifiers.length === 0) // import ModuleSpecifier ;\n            return [\n                'import',\n                space,\n                // ModuleSpecifier\n                this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                this.semicolon(flags)\n            ];\n            // import ImportClause FromClause ;\n            result = [\n                'import'\n            ];\n            cursor = 0;\n            // ImportedBinding\n            if (stmt.specifiers[cursor].type === Syntax.ImportDefaultSpecifier) {\n                result = join(result, [\n                    this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT)\n                ]);\n                ++cursor;\n            }\n            if (stmt.specifiers[cursor]) {\n                if (cursor !== 0) result.push(',');\n                if (stmt.specifiers[cursor].type === Syntax.ImportNamespaceSpecifier) // NameSpaceImport\n                result = join(result, [\n                    space,\n                    this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT)\n                ]);\n                else {\n                    // NamedImports\n                    result.push(space + '{');\n                    if (stmt.specifiers.length - cursor === 1) {\n                        // import { ... } from \"...\";\n                        result.push(space);\n                        result.push(this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT));\n                        result.push(space + '}' + space);\n                    } else {\n                        // import {\n                        //    ...,\n                        //    ...,\n                        // } from \"...\";\n                        withIndent(function(indent) {\n                            var i, iz;\n                            result.push(newline);\n                            for(i = cursor, iz = stmt.specifiers.length; i < iz; ++i){\n                                result.push(indent);\n                                result.push(that.generateExpression(stmt.specifiers[i], Precedence.Sequence, E_TTT));\n                                if (i + 1 < iz) result.push(',' + newline);\n                            }\n                        });\n                        if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n                        result.push(base + '}' + space);\n                    }\n                }\n            }\n            result = join(result, [\n                'from' + space,\n                // ModuleSpecifier\n                this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                this.semicolon(flags)\n            ]);\n            return result;\n        },\n        VariableDeclarator: function(stmt, flags) {\n            var itemFlags = flags & F_ALLOW_IN ? E_TTT : E_FTT;\n            if (stmt.init) return [\n                this.generateExpression(stmt.id, Precedence.Assignment, itemFlags),\n                space,\n                '=',\n                space,\n                this.generateExpression(stmt.init, Precedence.Assignment, itemFlags)\n            ];\n            return this.generatePattern(stmt.id, Precedence.Assignment, itemFlags);\n        },\n        VariableDeclaration: function(stmt, flags) {\n            // VariableDeclarator is typed as Statement,\n            // but joined with comma (not LineTerminator).\n            // So if comment is attached to target node, we should specialize.\n            var result, i, iz, node, bodyFlags, that = this;\n            result = [\n                stmt.kind\n            ];\n            bodyFlags = flags & F_ALLOW_IN ? S_TFFF : S_FFFF;\n            function block() {\n                node = stmt.declarations[0];\n                if (extra.comment && node.leadingComments) {\n                    result.push('\\n');\n                    result.push(addIndent(that.generateStatement(node, bodyFlags)));\n                } else {\n                    result.push(noEmptySpace());\n                    result.push(that.generateStatement(node, bodyFlags));\n                }\n                for(i = 1, iz = stmt.declarations.length; i < iz; ++i){\n                    node = stmt.declarations[i];\n                    if (extra.comment && node.leadingComments) {\n                        result.push(',' + newline);\n                        result.push(addIndent(that.generateStatement(node, bodyFlags)));\n                    } else {\n                        result.push(',' + space);\n                        result.push(that.generateStatement(node, bodyFlags));\n                    }\n                }\n            }\n            if (stmt.declarations.length > 1) withIndent(block);\n            else block();\n            result.push(this.semicolon(flags));\n            return result;\n        },\n        ThrowStatement: function(stmt, flags) {\n            return [\n                join('throw', this.generateExpression(stmt.argument, Precedence.Sequence, E_TTT)),\n                this.semicolon(flags)\n            ];\n        },\n        TryStatement: function(stmt, flags) {\n            var result, i, iz, guardedHandlers;\n            result = [\n                'try',\n                this.maybeBlock(stmt.block, S_TFFF)\n            ];\n            result = this.maybeBlockSuffix(stmt.block, result);\n            if (stmt.handlers) // old interface\n            for(i = 0, iz = stmt.handlers.length; i < iz; ++i){\n                result = join(result, this.generateStatement(stmt.handlers[i], S_TFFF));\n                if (stmt.finalizer || i + 1 !== iz) result = this.maybeBlockSuffix(stmt.handlers[i].body, result);\n            }\n            else {\n                guardedHandlers = stmt.guardedHandlers || [];\n                for(i = 0, iz = guardedHandlers.length; i < iz; ++i){\n                    result = join(result, this.generateStatement(guardedHandlers[i], S_TFFF));\n                    if (stmt.finalizer || i + 1 !== iz) result = this.maybeBlockSuffix(guardedHandlers[i].body, result);\n                }\n                // new interface\n                if (stmt.handler) {\n                    if (Array.isArray(stmt.handler)) for(i = 0, iz = stmt.handler.length; i < iz; ++i){\n                        result = join(result, this.generateStatement(stmt.handler[i], S_TFFF));\n                        if (stmt.finalizer || i + 1 !== iz) result = this.maybeBlockSuffix(stmt.handler[i].body, result);\n                    }\n                    else {\n                        result = join(result, this.generateStatement(stmt.handler, S_TFFF));\n                        if (stmt.finalizer) result = this.maybeBlockSuffix(stmt.handler.body, result);\n                    }\n                }\n            }\n            if (stmt.finalizer) result = join(result, [\n                'finally',\n                this.maybeBlock(stmt.finalizer, S_TFFF)\n            ]);\n            return result;\n        },\n        SwitchStatement: function(stmt, flags) {\n            var result, fragment, i, iz, bodyFlags, that = this;\n            withIndent(function() {\n                result = [\n                    'switch' + space + '(',\n                    that.generateExpression(stmt.discriminant, Precedence.Sequence, E_TTT),\n                    ')' + space + '{' + newline\n                ];\n            });\n            if (stmt.cases) {\n                bodyFlags = S_TFFF;\n                for(i = 0, iz = stmt.cases.length; i < iz; ++i){\n                    if (i === iz - 1) bodyFlags |= F_SEMICOLON_OPT;\n                    fragment = addIndent(this.generateStatement(stmt.cases[i], bodyFlags));\n                    result.push(fragment);\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) result.push(newline);\n                }\n            }\n            result.push(addIndent('}'));\n            return result;\n        },\n        SwitchCase: function(stmt, flags) {\n            var result, fragment, i, iz, bodyFlags, that = this;\n            withIndent(function() {\n                if (stmt.test) result = [\n                    join('case', that.generateExpression(stmt.test, Precedence.Sequence, E_TTT)),\n                    ':'\n                ];\n                else result = [\n                    'default:'\n                ];\n                i = 0;\n                iz = stmt.consequent.length;\n                if (iz && stmt.consequent[0].type === Syntax.BlockStatement) {\n                    fragment = that.maybeBlock(stmt.consequent[0], S_TFFF);\n                    result.push(fragment);\n                    i = 1;\n                }\n                if (i !== iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n                bodyFlags = S_TFFF;\n                for(; i < iz; ++i){\n                    if (i === iz - 1 && flags & F_SEMICOLON_OPT) bodyFlags |= F_SEMICOLON_OPT;\n                    fragment = addIndent(that.generateStatement(stmt.consequent[i], bodyFlags));\n                    result.push(fragment);\n                    if (i + 1 !== iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) result.push(newline);\n                }\n            });\n            return result;\n        },\n        IfStatement: function(stmt, flags) {\n            var result, bodyFlags, semicolonOptional, that = this;\n            withIndent(function() {\n                result = [\n                    'if' + space + '(',\n                    that.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            semicolonOptional = flags & F_SEMICOLON_OPT;\n            bodyFlags = S_TFFF;\n            if (semicolonOptional) bodyFlags |= F_SEMICOLON_OPT;\n            if (stmt.alternate) {\n                result.push(this.maybeBlock(stmt.consequent, S_TFFF));\n                result = this.maybeBlockSuffix(stmt.consequent, result);\n                if (stmt.alternate.type === Syntax.IfStatement) result = join(result, [\n                    'else ',\n                    this.generateStatement(stmt.alternate, bodyFlags)\n                ]);\n                else result = join(result, join('else', this.maybeBlock(stmt.alternate, bodyFlags)));\n            } else result.push(this.maybeBlock(stmt.consequent, bodyFlags));\n            return result;\n        },\n        ForStatement: function(stmt, flags) {\n            var result, that = this;\n            withIndent(function() {\n                result = [\n                    'for' + space + '('\n                ];\n                if (stmt.init) {\n                    if (stmt.init.type === Syntax.VariableDeclaration) result.push(that.generateStatement(stmt.init, S_FFFF));\n                    else {\n                        // F_ALLOW_IN becomes false.\n                        result.push(that.generateExpression(stmt.init, Precedence.Sequence, E_FTT));\n                        result.push(';');\n                    }\n                } else result.push(';');\n                if (stmt.test) {\n                    result.push(space);\n                    result.push(that.generateExpression(stmt.test, Precedence.Sequence, E_TTT));\n                    result.push(';');\n                } else result.push(';');\n                if (stmt.update) {\n                    result.push(space);\n                    result.push(that.generateExpression(stmt.update, Precedence.Sequence, E_TTT));\n                    result.push(')');\n                } else result.push(')');\n            });\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        },\n        ForInStatement: function(stmt, flags) {\n            return this.generateIterationForStatement('in', stmt, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF);\n        },\n        ForOfStatement: function(stmt, flags) {\n            return this.generateIterationForStatement('of', stmt, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF);\n        },\n        LabeledStatement: function(stmt, flags) {\n            return [\n                stmt.label.name + ':',\n                this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF)\n            ];\n        },\n        Program: function(stmt, flags) {\n            var result, fragment, i, iz, bodyFlags;\n            iz = stmt.body.length;\n            result = [\n                safeConcatenation && iz > 0 ? '\\n' : ''\n            ];\n            bodyFlags = S_TFTF;\n            for(i = 0; i < iz; ++i){\n                if (!safeConcatenation && i === iz - 1) bodyFlags |= F_SEMICOLON_OPT;\n                if (preserveBlankLines) {\n                    // handle spaces before the first line\n                    if (i === 0) {\n                        if (!stmt.body[0].leadingComments) generateBlankLines(stmt.range[0], stmt.body[i].range[0], result);\n                    }\n                    // handle spaces between lines\n                    if (i > 0) {\n                        if (!stmt.body[i - 1].trailingComments && !stmt.body[i].leadingComments) generateBlankLines(stmt.body[i - 1].range[1], stmt.body[i].range[0], result);\n                    }\n                }\n                fragment = addIndent(this.generateStatement(stmt.body[i], bodyFlags));\n                result.push(fragment);\n                if (i + 1 < iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                    if (preserveBlankLines) {\n                        if (!stmt.body[i + 1].leadingComments) result.push(newline);\n                    } else result.push(newline);\n                }\n                if (preserveBlankLines) {\n                    // handle spaces after the last line\n                    if (i === iz - 1) {\n                        if (!stmt.body[i].trailingComments) generateBlankLines(stmt.body[i].range[1], stmt.range[1], result);\n                    }\n                }\n            }\n            return result;\n        },\n        FunctionDeclaration: function(stmt, flags) {\n            return [\n                generateAsyncPrefix(stmt, true),\n                'function',\n                generateStarSuffix(stmt) || noEmptySpace(),\n                stmt.id ? generateIdentifier(stmt.id) : '',\n                this.generateFunctionBody(stmt)\n            ];\n        },\n        ReturnStatement: function(stmt, flags) {\n            if (stmt.argument) return [\n                join('return', this.generateExpression(stmt.argument, Precedence.Sequence, E_TTT)),\n                this.semicolon(flags)\n            ];\n            return [\n                'return' + this.semicolon(flags)\n            ];\n        },\n        WhileStatement: function(stmt, flags) {\n            var result, that = this;\n            withIndent(function() {\n                result = [\n                    'while' + space + '(',\n                    that.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        },\n        WithStatement: function(stmt, flags) {\n            var result, that = this;\n            withIndent(function() {\n                result = [\n                    'with' + space + '(',\n                    that.generateExpression(stmt.object, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        }\n    };\n    merge(CodeGenerator.prototype, CodeGenerator.Statement);\n    // Expressions.\n    CodeGenerator.Expression = {\n        SequenceExpression: function(expr, precedence, flags) {\n            var result, i, iz;\n            if (Precedence.Sequence < precedence) flags |= F_ALLOW_IN;\n            result = [];\n            for(i = 0, iz = expr.expressions.length; i < iz; ++i){\n                result.push(this.generateExpression(expr.expressions[i], Precedence.Assignment, flags));\n                if (i + 1 < iz) result.push(',' + space);\n            }\n            return parenthesize(result, Precedence.Sequence, precedence);\n        },\n        AssignmentExpression: function(expr, precedence, flags) {\n            return this.generateAssignment(expr.left, expr.right, expr.operator, precedence, flags);\n        },\n        ArrowFunctionExpression: function(expr, precedence, flags) {\n            return parenthesize(this.generateFunctionBody(expr), Precedence.ArrowFunction, precedence);\n        },\n        ConditionalExpression: function(expr, precedence, flags) {\n            if (Precedence.Conditional < precedence) flags |= F_ALLOW_IN;\n            return parenthesize([\n                this.generateExpression(expr.test, Precedence.Coalesce, flags),\n                space + '?' + space,\n                this.generateExpression(expr.consequent, Precedence.Assignment, flags),\n                space + ':' + space,\n                this.generateExpression(expr.alternate, Precedence.Assignment, flags)\n            ], Precedence.Conditional, precedence);\n        },\n        LogicalExpression: function(expr, precedence, flags) {\n            if (expr.operator === '??') flags |= F_FOUND_COALESCE;\n            return this.BinaryExpression(expr, precedence, flags);\n        },\n        BinaryExpression: function(expr, precedence, flags) {\n            var result, leftPrecedence, rightPrecedence, currentPrecedence, fragment, leftSource;\n            currentPrecedence = BinaryPrecedence[expr.operator];\n            leftPrecedence = expr.operator === '**' ? Precedence.Postfix : currentPrecedence;\n            rightPrecedence = expr.operator === '**' ? currentPrecedence : currentPrecedence + 1;\n            if (currentPrecedence < precedence) flags |= F_ALLOW_IN;\n            fragment = this.generateExpression(expr.left, leftPrecedence, flags);\n            leftSource = fragment.toString();\n            if (leftSource.charCodeAt(leftSource.length - 1) === 0x2F /* / */  && esutils.code.isIdentifierPartES5(expr.operator.charCodeAt(0))) result = [\n                fragment,\n                noEmptySpace(),\n                expr.operator\n            ];\n            else result = join(fragment, expr.operator);\n            fragment = this.generateExpression(expr.right, rightPrecedence, flags);\n            if (expr.operator === '/' && fragment.toString().charAt(0) === '/' || expr.operator.slice(-1) === '<' && fragment.toString().slice(0, 3) === '!--') {\n                // If '/' concats with '/' or `<` concats with `!--`, it is interpreted as comment start\n                result.push(noEmptySpace());\n                result.push(fragment);\n            } else result = join(result, fragment);\n            if (expr.operator === 'in' && !(flags & F_ALLOW_IN)) return [\n                '(',\n                result,\n                ')'\n            ];\n            if ((expr.operator === '||' || expr.operator === '&&') && flags & F_FOUND_COALESCE) return [\n                '(',\n                result,\n                ')'\n            ];\n            return parenthesize(result, currentPrecedence, precedence);\n        },\n        CallExpression: function(expr, precedence, flags) {\n            var result, i, iz;\n            // F_ALLOW_UNPARATH_NEW becomes false.\n            result = [\n                this.generateExpression(expr.callee, Precedence.Call, E_TTF)\n            ];\n            if (expr.optional) result.push('?.');\n            result.push('(');\n            for(i = 0, iz = expr['arguments'].length; i < iz; ++i){\n                result.push(this.generateExpression(expr['arguments'][i], Precedence.Assignment, E_TTT));\n                if (i + 1 < iz) result.push(',' + space);\n            }\n            result.push(')');\n            if (!(flags & F_ALLOW_CALL)) return [\n                '(',\n                result,\n                ')'\n            ];\n            return parenthesize(result, Precedence.Call, precedence);\n        },\n        ChainExpression: function(expr, precedence, flags) {\n            if (Precedence.OptionalChaining < precedence) flags |= F_ALLOW_CALL;\n            var result = this.generateExpression(expr.expression, Precedence.OptionalChaining, flags);\n            return parenthesize(result, Precedence.OptionalChaining, precedence);\n        },\n        NewExpression: function(expr, precedence, flags) {\n            var result, length, i, iz, itemFlags;\n            length = expr['arguments'].length;\n            // F_ALLOW_CALL becomes false.\n            // F_ALLOW_UNPARATH_NEW may become false.\n            itemFlags = flags & F_ALLOW_UNPARATH_NEW && !parentheses && length === 0 ? E_TFT : E_TFF;\n            result = join('new', this.generateExpression(expr.callee, Precedence.New, itemFlags));\n            if (!(flags & F_ALLOW_UNPARATH_NEW) || parentheses || length > 0) {\n                result.push('(');\n                for(i = 0, iz = length; i < iz; ++i){\n                    result.push(this.generateExpression(expr['arguments'][i], Precedence.Assignment, E_TTT));\n                    if (i + 1 < iz) result.push(',' + space);\n                }\n                result.push(')');\n            }\n            return parenthesize(result, Precedence.New, precedence);\n        },\n        MemberExpression: function(expr, precedence, flags) {\n            var result, fragment;\n            // F_ALLOW_UNPARATH_NEW becomes false.\n            result = [\n                this.generateExpression(expr.object, Precedence.Call, flags & F_ALLOW_CALL ? E_TTF : E_TFF)\n            ];\n            if (expr.computed) {\n                if (expr.optional) result.push('?.');\n                result.push('[');\n                result.push(this.generateExpression(expr.property, Precedence.Sequence, flags & F_ALLOW_CALL ? E_TTT : E_TFT));\n                result.push(']');\n            } else {\n                if (!expr.optional && expr.object.type === Syntax.Literal && typeof expr.object.value === 'number') {\n                    fragment = toSourceNodeWhenNeeded(result).toString();\n                    // When the following conditions are all true,\n                    //   1. No floating point\n                    //   2. Don't have exponents\n                    //   3. The last character is a decimal digit\n                    //   4. Not hexadecimal OR octal number literal\n                    // we should add a floating point.\n                    if (fragment.indexOf('.') < 0 && !/[eExX]/.test(fragment) && esutils.code.isDecimalDigit(fragment.charCodeAt(fragment.length - 1)) && !(fragment.length >= 2 && fragment.charCodeAt(0) === 48 // '0'\n                    )) result.push(' ');\n                }\n                result.push(expr.optional ? '?.' : '.');\n                result.push(generateIdentifier(expr.property));\n            }\n            return parenthesize(result, Precedence.Member, precedence);\n        },\n        MetaProperty: function(expr, precedence, flags) {\n            var result;\n            result = [];\n            result.push(typeof expr.meta === \"string\" ? expr.meta : generateIdentifier(expr.meta));\n            result.push('.');\n            result.push(typeof expr.property === \"string\" ? expr.property : generateIdentifier(expr.property));\n            return parenthesize(result, Precedence.Member, precedence);\n        },\n        UnaryExpression: function(expr, precedence, flags) {\n            var result, fragment, rightCharCode, leftSource, leftCharCode;\n            fragment = this.generateExpression(expr.argument, Precedence.Unary, E_TTT);\n            if (space === '') result = join(expr.operator, fragment);\n            else {\n                result = [\n                    expr.operator\n                ];\n                if (expr.operator.length > 2) // delete, void, typeof\n                // get `typeof []`, not `typeof[]`\n                result = join(result, fragment);\n                else {\n                    // Prevent inserting spaces between operator and argument if it is unnecessary\n                    // like, `!cond`\n                    leftSource = toSourceNodeWhenNeeded(result).toString();\n                    leftCharCode = leftSource.charCodeAt(leftSource.length - 1);\n                    rightCharCode = fragment.toString().charCodeAt(0);\n                    if ((leftCharCode === 0x2B /* + */  || leftCharCode === 0x2D /* - */ ) && leftCharCode === rightCharCode || esutils.code.isIdentifierPartES5(leftCharCode) && esutils.code.isIdentifierPartES5(rightCharCode)) {\n                        result.push(noEmptySpace());\n                        result.push(fragment);\n                    } else result.push(fragment);\n                }\n            }\n            return parenthesize(result, Precedence.Unary, precedence);\n        },\n        YieldExpression: function(expr, precedence, flags) {\n            var result;\n            if (expr.delegate) result = 'yield*';\n            else result = 'yield';\n            if (expr.argument) result = join(result, this.generateExpression(expr.argument, Precedence.Yield, E_TTT));\n            return parenthesize(result, Precedence.Yield, precedence);\n        },\n        AwaitExpression: function(expr, precedence, flags) {\n            var result = join(expr.all ? 'await*' : 'await', this.generateExpression(expr.argument, Precedence.Await, E_TTT));\n            return parenthesize(result, Precedence.Await, precedence);\n        },\n        UpdateExpression: function(expr, precedence, flags) {\n            if (expr.prefix) return parenthesize([\n                expr.operator,\n                this.generateExpression(expr.argument, Precedence.Unary, E_TTT)\n            ], Precedence.Unary, precedence);\n            return parenthesize([\n                this.generateExpression(expr.argument, Precedence.Postfix, E_TTT),\n                expr.operator\n            ], Precedence.Postfix, precedence);\n        },\n        FunctionExpression: function(expr, precedence, flags) {\n            var result = [\n                generateAsyncPrefix(expr, true),\n                'function'\n            ];\n            if (expr.id) {\n                result.push(generateStarSuffix(expr) || noEmptySpace());\n                result.push(generateIdentifier(expr.id));\n            } else result.push(generateStarSuffix(expr) || space);\n            result.push(this.generateFunctionBody(expr));\n            return result;\n        },\n        ArrayPattern: function(expr, precedence, flags) {\n            return this.ArrayExpression(expr, precedence, flags, true);\n        },\n        ArrayExpression: function(expr, precedence, flags, isPattern) {\n            var result, multiline, that = this;\n            if (!expr.elements.length) return '[]';\n            multiline = isPattern ? false : expr.elements.length > 1;\n            result = [\n                '[',\n                multiline ? newline : ''\n            ];\n            withIndent(function(indent) {\n                var i, iz;\n                for(i = 0, iz = expr.elements.length; i < iz; ++i){\n                    if (!expr.elements[i]) {\n                        if (multiline) result.push(indent);\n                        if (i + 1 === iz) result.push(',');\n                    } else {\n                        result.push(multiline ? indent : '');\n                        result.push(that.generateExpression(expr.elements[i], Precedence.Assignment, E_TTT));\n                    }\n                    if (i + 1 < iz) result.push(',' + (multiline ? newline : space));\n                }\n            });\n            if (multiline && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n            result.push(multiline ? base : '');\n            result.push(']');\n            return result;\n        },\n        RestElement: function(expr, precedence, flags) {\n            return '...' + this.generatePattern(expr.argument);\n        },\n        ClassExpression: function(expr, precedence, flags) {\n            var result, fragment;\n            result = [\n                'class'\n            ];\n            if (expr.id) result = join(result, this.generateExpression(expr.id, Precedence.Sequence, E_TTT));\n            if (expr.superClass) {\n                fragment = join('extends', this.generateExpression(expr.superClass, Precedence.Unary, E_TTT));\n                result = join(result, fragment);\n            }\n            result.push(space);\n            result.push(this.generateStatement(expr.body, S_TFFT));\n            return result;\n        },\n        MethodDefinition: function(expr, precedence, flags) {\n            var result, fragment;\n            if (expr['static']) result = [\n                'static' + space\n            ];\n            else result = [];\n            if (expr.kind === 'get' || expr.kind === 'set') fragment = [\n                join(expr.kind, this.generatePropertyKey(expr.key, expr.computed)),\n                this.generateFunctionBody(expr.value)\n            ];\n            else fragment = [\n                generateMethodPrefix(expr),\n                this.generatePropertyKey(expr.key, expr.computed),\n                this.generateFunctionBody(expr.value)\n            ];\n            return join(result, fragment);\n        },\n        Property: function(expr, precedence, flags) {\n            if (expr.kind === 'get' || expr.kind === 'set') return [\n                expr.kind,\n                noEmptySpace(),\n                this.generatePropertyKey(expr.key, expr.computed),\n                this.generateFunctionBody(expr.value)\n            ];\n            if (expr.shorthand) {\n                if (expr.value.type === \"AssignmentPattern\") return this.AssignmentPattern(expr.value, Precedence.Sequence, E_TTT);\n                return this.generatePropertyKey(expr.key, expr.computed);\n            }\n            if (expr.method) return [\n                generateMethodPrefix(expr),\n                this.generatePropertyKey(expr.key, expr.computed),\n                this.generateFunctionBody(expr.value)\n            ];\n            return [\n                this.generatePropertyKey(expr.key, expr.computed),\n                ':' + space,\n                this.generateExpression(expr.value, Precedence.Assignment, E_TTT)\n            ];\n        },\n        ObjectExpression: function(expr, precedence, flags) {\n            var multiline, result, fragment, that = this;\n            if (!expr.properties.length) return '{}';\n            multiline = expr.properties.length > 1;\n            withIndent(function() {\n                fragment = that.generateExpression(expr.properties[0], Precedence.Sequence, E_TTT);\n            });\n            if (!multiline) {\n                // issues 4\n                // Do not transform from\n                //   dejavu.Class.declare({\n                //       method2: function () {}\n                //   });\n                // to\n                //   dejavu.Class.declare({method2: function () {\n                //       }});\n                if (!hasLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) return [\n                    '{',\n                    space,\n                    fragment,\n                    space,\n                    '}'\n                ];\n            }\n            withIndent(function(indent) {\n                var i, iz;\n                result = [\n                    '{',\n                    newline,\n                    indent,\n                    fragment\n                ];\n                if (multiline) {\n                    result.push(',' + newline);\n                    for(i = 1, iz = expr.properties.length; i < iz; ++i){\n                        result.push(indent);\n                        result.push(that.generateExpression(expr.properties[i], Precedence.Sequence, E_TTT));\n                        if (i + 1 < iz) result.push(',' + newline);\n                    }\n                }\n            });\n            if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n            result.push(base);\n            result.push('}');\n            return result;\n        },\n        AssignmentPattern: function(expr, precedence, flags) {\n            return this.generateAssignment(expr.left, expr.right, '=', precedence, flags);\n        },\n        ObjectPattern: function(expr, precedence, flags) {\n            var result, i, iz, multiline, property, that = this;\n            if (!expr.properties.length) return '{}';\n            multiline = false;\n            if (expr.properties.length === 1) {\n                property = expr.properties[0];\n                if (property.type === Syntax.Property && property.value.type !== Syntax.Identifier) multiline = true;\n            } else for(i = 0, iz = expr.properties.length; i < iz; ++i){\n                property = expr.properties[i];\n                if (property.type === Syntax.Property && !property.shorthand) {\n                    multiline = true;\n                    break;\n                }\n            }\n            result = [\n                '{',\n                multiline ? newline : ''\n            ];\n            withIndent(function(indent) {\n                var i, iz;\n                for(i = 0, iz = expr.properties.length; i < iz; ++i){\n                    result.push(multiline ? indent : '');\n                    result.push(that.generateExpression(expr.properties[i], Precedence.Sequence, E_TTT));\n                    if (i + 1 < iz) result.push(',' + (multiline ? newline : space));\n                }\n            });\n            if (multiline && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) result.push(newline);\n            result.push(multiline ? base : '');\n            result.push('}');\n            return result;\n        },\n        ThisExpression: function(expr, precedence, flags) {\n            return 'this';\n        },\n        Super: function(expr, precedence, flags) {\n            return 'super';\n        },\n        Identifier: function(expr, precedence, flags) {\n            return generateIdentifier(expr);\n        },\n        ImportDefaultSpecifier: function(expr, precedence, flags) {\n            return generateIdentifier(expr.id || expr.local);\n        },\n        ImportNamespaceSpecifier: function(expr, precedence, flags) {\n            var result = [\n                '*'\n            ];\n            var id = expr.id || expr.local;\n            if (id) result.push(space + 'as' + noEmptySpace() + generateIdentifier(id));\n            return result;\n        },\n        ImportSpecifier: function(expr, precedence, flags) {\n            var imported = expr.imported;\n            var result = [\n                imported.name\n            ];\n            var local = expr.local;\n            if (local && local.name !== imported.name) result.push(noEmptySpace() + 'as' + noEmptySpace() + generateIdentifier(local));\n            return result;\n        },\n        ExportSpecifier: function(expr, precedence, flags) {\n            var local = expr.local;\n            var result = [\n                local.name\n            ];\n            var exported = expr.exported;\n            if (exported && exported.name !== local.name) result.push(noEmptySpace() + 'as' + noEmptySpace() + generateIdentifier(exported));\n            return result;\n        },\n        Literal: function(expr, precedence, flags) {\n            var raw;\n            if (expr.hasOwnProperty('raw') && parse && extra.raw) try {\n                raw = parse(expr.raw).body[0].expression;\n                if (raw.type === Syntax.Literal) {\n                    if (raw.value === expr.value) return expr.raw;\n                }\n            } catch (e) {\n            // not use raw property\n            }\n            if (expr.regex) return '/' + expr.regex.pattern + '/' + expr.regex.flags;\n            if (typeof expr.value === 'bigint') return expr.value.toString() + 'n';\n            // `expr.value` can be null if `expr.bigint` exists. We need to check\n            // `expr.bigint` first.\n            if (expr.bigint) return expr.bigint + 'n';\n            if (expr.value === null) return 'null';\n            if (typeof expr.value === 'string') return escapeString(expr.value);\n            if (typeof expr.value === 'number') return generateNumber(expr.value);\n            if (typeof expr.value === 'boolean') return expr.value ? 'true' : 'false';\n            return generateRegExp(expr.value);\n        },\n        GeneratorExpression: function(expr, precedence, flags) {\n            return this.ComprehensionExpression(expr, precedence, flags);\n        },\n        ComprehensionExpression: function(expr, precedence, flags) {\n            // GeneratorExpression should be parenthesized with (...), ComprehensionExpression with [...]\n            // Due to https://bugzilla.mozilla.org/show_bug.cgi?id=883468 position of expr.body can differ in Spidermonkey and ES6\n            var result, i, iz, fragment, that = this;\n            result = expr.type === Syntax.GeneratorExpression ? [\n                '('\n            ] : [\n                '['\n            ];\n            if (extra.moz.comprehensionExpressionStartsWithAssignment) {\n                fragment = this.generateExpression(expr.body, Precedence.Assignment, E_TTT);\n                result.push(fragment);\n            }\n            if (expr.blocks) withIndent(function() {\n                for(i = 0, iz = expr.blocks.length; i < iz; ++i){\n                    fragment = that.generateExpression(expr.blocks[i], Precedence.Sequence, E_TTT);\n                    if (i > 0 || extra.moz.comprehensionExpressionStartsWithAssignment) result = join(result, fragment);\n                    else result.push(fragment);\n                }\n            });\n            if (expr.filter) {\n                result = join(result, 'if' + space);\n                fragment = this.generateExpression(expr.filter, Precedence.Sequence, E_TTT);\n                result = join(result, [\n                    '(',\n                    fragment,\n                    ')'\n                ]);\n            }\n            if (!extra.moz.comprehensionExpressionStartsWithAssignment) {\n                fragment = this.generateExpression(expr.body, Precedence.Assignment, E_TTT);\n                result = join(result, fragment);\n            }\n            result.push(expr.type === Syntax.GeneratorExpression ? ')' : ']');\n            return result;\n        },\n        ComprehensionBlock: function(expr, precedence, flags) {\n            var fragment;\n            if (expr.left.type === Syntax.VariableDeclaration) fragment = [\n                expr.left.kind,\n                noEmptySpace(),\n                this.generateStatement(expr.left.declarations[0], S_FFFF)\n            ];\n            else fragment = this.generateExpression(expr.left, Precedence.Call, E_TTT);\n            fragment = join(fragment, expr.of ? 'of' : 'in');\n            fragment = join(fragment, this.generateExpression(expr.right, Precedence.Sequence, E_TTT));\n            return [\n                'for' + space + '(',\n                fragment,\n                ')'\n            ];\n        },\n        SpreadElement: function(expr, precedence, flags) {\n            return [\n                '...',\n                this.generateExpression(expr.argument, Precedence.Assignment, E_TTT)\n            ];\n        },\n        TaggedTemplateExpression: function(expr, precedence, flags) {\n            var itemFlags = E_TTF;\n            if (!(flags & F_ALLOW_CALL)) itemFlags = E_TFF;\n            var result = [\n                this.generateExpression(expr.tag, Precedence.Call, itemFlags),\n                this.generateExpression(expr.quasi, Precedence.Primary, E_FFT)\n            ];\n            return parenthesize(result, Precedence.TaggedTemplate, precedence);\n        },\n        TemplateElement: function(expr, precedence, flags) {\n            // Don't use \"cooked\". Since tagged template can use raw template\n            // representation. So if we do so, it breaks the script semantics.\n            return expr.value.raw;\n        },\n        TemplateLiteral: function(expr, precedence, flags) {\n            var result, i, iz;\n            result = [\n                '`'\n            ];\n            for(i = 0, iz = expr.quasis.length; i < iz; ++i){\n                result.push(this.generateExpression(expr.quasis[i], Precedence.Primary, E_TTT));\n                if (i + 1 < iz) {\n                    result.push('${' + space);\n                    result.push(this.generateExpression(expr.expressions[i], Precedence.Sequence, E_TTT));\n                    result.push(space + '}');\n                }\n            }\n            result.push('`');\n            return result;\n        },\n        ModuleSpecifier: function(expr, precedence, flags) {\n            return this.Literal(expr, precedence, flags);\n        },\n        ImportExpression: function(expr, precedence, flag) {\n            return parenthesize([\n                'import(',\n                this.generateExpression(expr.source, Precedence.Assignment, E_TTT),\n                ')'\n            ], Precedence.Call, precedence);\n        }\n    };\n    merge(CodeGenerator.prototype, CodeGenerator.Expression);\n    CodeGenerator.prototype.generateExpression = function(expr, precedence, flags) {\n        var result, type;\n        type = expr.type || Syntax.Property;\n        if (extra.verbatim && expr.hasOwnProperty(extra.verbatim)) return generateVerbatim(expr, precedence);\n        result = this[type](expr, precedence, flags);\n        if (extra.comment) result = addComments(expr, result);\n        return toSourceNodeWhenNeeded(result, expr);\n    };\n    CodeGenerator.prototype.generateStatement = function(stmt, flags) {\n        var result, fragment;\n        result = this[stmt.type](stmt, flags);\n        // Attach comments\n        if (extra.comment) result = addComments(stmt, result);\n        fragment = toSourceNodeWhenNeeded(result).toString();\n        if (stmt.type === Syntax.Program && !safeConcatenation && newline === '' && fragment.charAt(fragment.length - 1) === '\\n') result = sourceMap ? toSourceNodeWhenNeeded(result).replaceRight(/\\s+$/, '') : fragment.replace(/\\s+$/, '');\n        return toSourceNodeWhenNeeded(result, stmt);\n    };\n    function generateInternal(node) {\n        var codegen;\n        codegen = new CodeGenerator();\n        if (isStatement(node)) return codegen.generateStatement(node, S_TFFF);\n        if (isExpression(node)) return codegen.generateExpression(node, Precedence.Sequence, E_TTT);\n        throw new Error('Unknown node type: ' + node.type);\n    }\n    function generate(node, options) {\n        var defaultOptions = getDefaultOptions(), result, pair;\n        if (options != null) {\n            // Obsolete options\n            //\n            //   `options.indent`\n            //   `options.base`\n            //\n            // Instead of them, we can use `option.format.indent`.\n            if (typeof options.indent === 'string') defaultOptions.format.indent.style = options.indent;\n            if (typeof options.base === 'number') defaultOptions.format.indent.base = options.base;\n            options = updateDeeply(defaultOptions, options);\n            indent = options.format.indent.style;\n            if (typeof options.base === 'string') base = options.base;\n            else base = stringRepeat(indent, options.format.indent.base);\n        } else {\n            options = defaultOptions;\n            indent = options.format.indent.style;\n            base = stringRepeat(indent, options.format.indent.base);\n        }\n        json = options.format.json;\n        renumber = options.format.renumber;\n        hexadecimal = json ? false : options.format.hexadecimal;\n        quotes = json ? 'double' : options.format.quotes;\n        escapeless = options.format.escapeless;\n        newline = options.format.newline;\n        space = options.format.space;\n        if (options.format.compact) newline = space = indent = base = '';\n        parentheses = options.format.parentheses;\n        semicolons = options.format.semicolons;\n        safeConcatenation = options.format.safeConcatenation;\n        directive = options.directive;\n        parse = json ? null : options.parse;\n        sourceMap = options.sourceMap;\n        sourceCode = options.sourceCode;\n        preserveBlankLines = options.format.preserveBlankLines && sourceCode !== null;\n        extra = options;\n        if (sourceMap) {\n            if (!exports.browser) // We assume environment is node.js\n            // And prevent from including source-map by browserify\n            SourceNode = require(\"c5f9fc72858fa13\").SourceNode;\n            else SourceNode = global.sourceMap.SourceNode;\n        }\n        result = generateInternal(node);\n        if (!sourceMap) {\n            pair = {\n                code: result.toString(),\n                map: null\n            };\n            return options.sourceMapWithCode ? pair : pair.code;\n        }\n        pair = result.toStringWithSourceMap({\n            file: options.file,\n            sourceRoot: options.sourceMapRoot\n        });\n        if (options.sourceContent) pair.map.setSourceContent(options.sourceMap, options.sourceContent);\n        if (options.sourceMapWithCode) return pair;\n        return pair.map.toString();\n    }\n    FORMAT_MINIFY = {\n        indent: {\n            style: '',\n            base: 0\n        },\n        renumber: true,\n        hexadecimal: true,\n        quotes: 'auto',\n        escapeless: true,\n        compact: true,\n        parentheses: false,\n        semicolons: false\n    };\n    FORMAT_DEFAULTS = getDefaultOptions().format;\n    exports.version = require(\"5a6225acf72ec9cb\").version;\n    exports.generate = generate;\n    exports.attachComments = estraverse.attachComments;\n    exports.Precedence = updateDeeply({}, Precedence);\n    exports.browser = false;\n    exports.FORMAT_MINIFY = FORMAT_MINIFY;\n    exports.FORMAT_DEFAULTS = FORMAT_DEFAULTS;\n})(); /* vim: set sw=4 ts=4 et tw=80 : */ \n\n},{\"799f69c44c76494b\":\"dIysw\",\"860044db75801fad\":\"iqPHv\",\"c5f9fc72858fa13\":\"5xh3B\",\"5a6225acf72ec9cb\":\"hL24S\"}],\"dIysw\":[function(require,module,exports) {\n/*\n  Copyright (C) 2012-2013 Yusuke Suzuki <utatane.tea@gmail.com>\n  Copyright (C) 2012 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and/or other materials provided with the distribution.\n\n  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/ /*jslint vars:false, bitwise:true*/ /*jshint indent:4*/ /*global exports:true*/ (function clone(exports1) {\n    'use strict';\n    var Syntax, VisitorOption, VisitorKeys, BREAK, SKIP, REMOVE;\n    function deepCopy(obj) {\n        var ret = {}, key, val;\n        for(key in obj)if (obj.hasOwnProperty(key)) {\n            val = obj[key];\n            if (typeof val === 'object' && val !== null) ret[key] = deepCopy(val);\n            else ret[key] = val;\n        }\n        return ret;\n    }\n    // based on LLVM libc++ upper_bound / lower_bound\n    // MIT License\n    function upperBound(array, func) {\n        var diff, len, i, current;\n        len = array.length;\n        i = 0;\n        while(len){\n            diff = len >>> 1;\n            current = i + diff;\n            if (func(array[current])) len = diff;\n            else {\n                i = current + 1;\n                len -= diff + 1;\n            }\n        }\n        return i;\n    }\n    Syntax = {\n        AssignmentExpression: 'AssignmentExpression',\n        AssignmentPattern: 'AssignmentPattern',\n        ArrayExpression: 'ArrayExpression',\n        ArrayPattern: 'ArrayPattern',\n        ArrowFunctionExpression: 'ArrowFunctionExpression',\n        AwaitExpression: 'AwaitExpression',\n        BlockStatement: 'BlockStatement',\n        BinaryExpression: 'BinaryExpression',\n        BreakStatement: 'BreakStatement',\n        CallExpression: 'CallExpression',\n        CatchClause: 'CatchClause',\n        ChainExpression: 'ChainExpression',\n        ClassBody: 'ClassBody',\n        ClassDeclaration: 'ClassDeclaration',\n        ClassExpression: 'ClassExpression',\n        ComprehensionBlock: 'ComprehensionBlock',\n        ComprehensionExpression: 'ComprehensionExpression',\n        ConditionalExpression: 'ConditionalExpression',\n        ContinueStatement: 'ContinueStatement',\n        DebuggerStatement: 'DebuggerStatement',\n        DirectiveStatement: 'DirectiveStatement',\n        DoWhileStatement: 'DoWhileStatement',\n        EmptyStatement: 'EmptyStatement',\n        ExportAllDeclaration: 'ExportAllDeclaration',\n        ExportDefaultDeclaration: 'ExportDefaultDeclaration',\n        ExportNamedDeclaration: 'ExportNamedDeclaration',\n        ExportSpecifier: 'ExportSpecifier',\n        ExpressionStatement: 'ExpressionStatement',\n        ForStatement: 'ForStatement',\n        ForInStatement: 'ForInStatement',\n        ForOfStatement: 'ForOfStatement',\n        FunctionDeclaration: 'FunctionDeclaration',\n        FunctionExpression: 'FunctionExpression',\n        GeneratorExpression: 'GeneratorExpression',\n        Identifier: 'Identifier',\n        IfStatement: 'IfStatement',\n        ImportExpression: 'ImportExpression',\n        ImportDeclaration: 'ImportDeclaration',\n        ImportDefaultSpecifier: 'ImportDefaultSpecifier',\n        ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',\n        ImportSpecifier: 'ImportSpecifier',\n        Literal: 'Literal',\n        LabeledStatement: 'LabeledStatement',\n        LogicalExpression: 'LogicalExpression',\n        MemberExpression: 'MemberExpression',\n        MetaProperty: 'MetaProperty',\n        MethodDefinition: 'MethodDefinition',\n        ModuleSpecifier: 'ModuleSpecifier',\n        NewExpression: 'NewExpression',\n        ObjectExpression: 'ObjectExpression',\n        ObjectPattern: 'ObjectPattern',\n        PrivateIdentifier: 'PrivateIdentifier',\n        Program: 'Program',\n        Property: 'Property',\n        PropertyDefinition: 'PropertyDefinition',\n        RestElement: 'RestElement',\n        ReturnStatement: 'ReturnStatement',\n        SequenceExpression: 'SequenceExpression',\n        SpreadElement: 'SpreadElement',\n        Super: 'Super',\n        SwitchStatement: 'SwitchStatement',\n        SwitchCase: 'SwitchCase',\n        TaggedTemplateExpression: 'TaggedTemplateExpression',\n        TemplateElement: 'TemplateElement',\n        TemplateLiteral: 'TemplateLiteral',\n        ThisExpression: 'ThisExpression',\n        ThrowStatement: 'ThrowStatement',\n        TryStatement: 'TryStatement',\n        UnaryExpression: 'UnaryExpression',\n        UpdateExpression: 'UpdateExpression',\n        VariableDeclaration: 'VariableDeclaration',\n        VariableDeclarator: 'VariableDeclarator',\n        WhileStatement: 'WhileStatement',\n        WithStatement: 'WithStatement',\n        YieldExpression: 'YieldExpression'\n    };\n    VisitorKeys = {\n        AssignmentExpression: [\n            'left',\n            'right'\n        ],\n        AssignmentPattern: [\n            'left',\n            'right'\n        ],\n        ArrayExpression: [\n            'elements'\n        ],\n        ArrayPattern: [\n            'elements'\n        ],\n        ArrowFunctionExpression: [\n            'params',\n            'body'\n        ],\n        AwaitExpression: [\n            'argument'\n        ],\n        BlockStatement: [\n            'body'\n        ],\n        BinaryExpression: [\n            'left',\n            'right'\n        ],\n        BreakStatement: [\n            'label'\n        ],\n        CallExpression: [\n            'callee',\n            'arguments'\n        ],\n        CatchClause: [\n            'param',\n            'body'\n        ],\n        ChainExpression: [\n            'expression'\n        ],\n        ClassBody: [\n            'body'\n        ],\n        ClassDeclaration: [\n            'id',\n            'superClass',\n            'body'\n        ],\n        ClassExpression: [\n            'id',\n            'superClass',\n            'body'\n        ],\n        ComprehensionBlock: [\n            'left',\n            'right'\n        ],\n        ComprehensionExpression: [\n            'blocks',\n            'filter',\n            'body'\n        ],\n        ConditionalExpression: [\n            'test',\n            'consequent',\n            'alternate'\n        ],\n        ContinueStatement: [\n            'label'\n        ],\n        DebuggerStatement: [],\n        DirectiveStatement: [],\n        DoWhileStatement: [\n            'body',\n            'test'\n        ],\n        EmptyStatement: [],\n        ExportAllDeclaration: [\n            'source'\n        ],\n        ExportDefaultDeclaration: [\n            'declaration'\n        ],\n        ExportNamedDeclaration: [\n            'declaration',\n            'specifiers',\n            'source'\n        ],\n        ExportSpecifier: [\n            'exported',\n            'local'\n        ],\n        ExpressionStatement: [\n            'expression'\n        ],\n        ForStatement: [\n            'init',\n            'test',\n            'update',\n            'body'\n        ],\n        ForInStatement: [\n            'left',\n            'right',\n            'body'\n        ],\n        ForOfStatement: [\n            'left',\n            'right',\n            'body'\n        ],\n        FunctionDeclaration: [\n            'id',\n            'params',\n            'body'\n        ],\n        FunctionExpression: [\n            'id',\n            'params',\n            'body'\n        ],\n        GeneratorExpression: [\n            'blocks',\n            'filter',\n            'body'\n        ],\n        Identifier: [],\n        IfStatement: [\n            'test',\n            'consequent',\n            'alternate'\n        ],\n        ImportExpression: [\n            'source'\n        ],\n        ImportDeclaration: [\n            'specifiers',\n            'source'\n        ],\n        ImportDefaultSpecifier: [\n            'local'\n        ],\n        ImportNamespaceSpecifier: [\n            'local'\n        ],\n        ImportSpecifier: [\n            'imported',\n            'local'\n        ],\n        Literal: [],\n        LabeledStatement: [\n            'label',\n            'body'\n        ],\n        LogicalExpression: [\n            'left',\n            'right'\n        ],\n        MemberExpression: [\n            'object',\n            'property'\n        ],\n        MetaProperty: [\n            'meta',\n            'property'\n        ],\n        MethodDefinition: [\n            'key',\n            'value'\n        ],\n        ModuleSpecifier: [],\n        NewExpression: [\n            'callee',\n            'arguments'\n        ],\n        ObjectExpression: [\n            'properties'\n        ],\n        ObjectPattern: [\n            'properties'\n        ],\n        PrivateIdentifier: [],\n        Program: [\n            'body'\n        ],\n        Property: [\n            'key',\n            'value'\n        ],\n        PropertyDefinition: [\n            'key',\n            'value'\n        ],\n        RestElement: [\n            'argument'\n        ],\n        ReturnStatement: [\n            'argument'\n        ],\n        SequenceExpression: [\n            'expressions'\n        ],\n        SpreadElement: [\n            'argument'\n        ],\n        Super: [],\n        SwitchStatement: [\n            'discriminant',\n            'cases'\n        ],\n        SwitchCase: [\n            'test',\n            'consequent'\n        ],\n        TaggedTemplateExpression: [\n            'tag',\n            'quasi'\n        ],\n        TemplateElement: [],\n        TemplateLiteral: [\n            'quasis',\n            'expressions'\n        ],\n        ThisExpression: [],\n        ThrowStatement: [\n            'argument'\n        ],\n        TryStatement: [\n            'block',\n            'handler',\n            'finalizer'\n        ],\n        UnaryExpression: [\n            'argument'\n        ],\n        UpdateExpression: [\n            'argument'\n        ],\n        VariableDeclaration: [\n            'declarations'\n        ],\n        VariableDeclarator: [\n            'id',\n            'init'\n        ],\n        WhileStatement: [\n            'test',\n            'body'\n        ],\n        WithStatement: [\n            'object',\n            'body'\n        ],\n        YieldExpression: [\n            'argument'\n        ]\n    };\n    // unique id\n    BREAK = {};\n    SKIP = {};\n    REMOVE = {};\n    VisitorOption = {\n        Break: BREAK,\n        Skip: SKIP,\n        Remove: REMOVE\n    };\n    function Reference(parent, key) {\n        this.parent = parent;\n        this.key = key;\n    }\n    Reference.prototype.replace = function replace(node) {\n        this.parent[this.key] = node;\n    };\n    Reference.prototype.remove = function remove() {\n        if (Array.isArray(this.parent)) {\n            this.parent.splice(this.key, 1);\n            return true;\n        } else {\n            this.replace(null);\n            return false;\n        }\n    };\n    function Element(node, path, wrap, ref) {\n        this.node = node;\n        this.path = path;\n        this.wrap = wrap;\n        this.ref = ref;\n    }\n    function Controller() {}\n    // API:\n    // return property path array from root to current node\n    Controller.prototype.path = function path() {\n        var i, iz, j, jz, result, element;\n        function addToPath(result, path) {\n            if (Array.isArray(path)) for(j = 0, jz = path.length; j < jz; ++j)result.push(path[j]);\n            else result.push(path);\n        }\n        // root node\n        if (!this.__current.path) return null;\n        // first node is sentinel, second node is root element\n        result = [];\n        for(i = 2, iz = this.__leavelist.length; i < iz; ++i){\n            element = this.__leavelist[i];\n            addToPath(result, element.path);\n        }\n        addToPath(result, this.__current.path);\n        return result;\n    };\n    // API:\n    // return type of current node\n    Controller.prototype.type = function() {\n        var node = this.current();\n        return node.type || this.__current.wrap;\n    };\n    // API:\n    // return array of parent elements\n    Controller.prototype.parents = function parents() {\n        var i, iz, result;\n        // first node is sentinel\n        result = [];\n        for(i = 1, iz = this.__leavelist.length; i < iz; ++i)result.push(this.__leavelist[i].node);\n        return result;\n    };\n    // API:\n    // return current node\n    Controller.prototype.current = function current() {\n        return this.__current.node;\n    };\n    Controller.prototype.__execute = function __execute(callback, element) {\n        var previous, result;\n        result = undefined;\n        previous = this.__current;\n        this.__current = element;\n        this.__state = null;\n        if (callback) result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node);\n        this.__current = previous;\n        return result;\n    };\n    // API:\n    // notify control skip / break\n    Controller.prototype.notify = function notify(flag) {\n        this.__state = flag;\n    };\n    // API:\n    // skip child nodes of current node\n    Controller.prototype.skip = function() {\n        this.notify(SKIP);\n    };\n    // API:\n    // break traversals\n    Controller.prototype['break'] = function() {\n        this.notify(BREAK);\n    };\n    // API:\n    // remove node\n    Controller.prototype.remove = function() {\n        this.notify(REMOVE);\n    };\n    Controller.prototype.__initialize = function(root, visitor) {\n        this.visitor = visitor;\n        this.root = root;\n        this.__worklist = [];\n        this.__leavelist = [];\n        this.__current = null;\n        this.__state = null;\n        this.__fallback = null;\n        if (visitor.fallback === 'iteration') this.__fallback = Object.keys;\n        else if (typeof visitor.fallback === 'function') this.__fallback = visitor.fallback;\n        this.__keys = VisitorKeys;\n        if (visitor.keys) this.__keys = Object.assign(Object.create(this.__keys), visitor.keys);\n    };\n    function isNode(node) {\n        if (node == null) return false;\n        return typeof node === 'object' && typeof node.type === 'string';\n    }\n    function isProperty(nodeType, key) {\n        return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key;\n    }\n    function candidateExistsInLeaveList(leavelist, candidate) {\n        for(var i = leavelist.length - 1; i >= 0; --i){\n            if (leavelist[i].node === candidate) return true;\n        }\n        return false;\n    }\n    Controller.prototype.traverse = function traverse(root, visitor) {\n        var worklist, leavelist, element, node, nodeType, ret, key, current, current2, candidates, candidate, sentinel;\n        this.__initialize(root, visitor);\n        sentinel = {};\n        // reference\n        worklist = this.__worklist;\n        leavelist = this.__leavelist;\n        // initialize\n        worklist.push(new Element(root, null, null, null));\n        leavelist.push(new Element(null, null, null, null));\n        while(worklist.length){\n            element = worklist.pop();\n            if (element === sentinel) {\n                element = leavelist.pop();\n                ret = this.__execute(visitor.leave, element);\n                if (this.__state === BREAK || ret === BREAK) return;\n                continue;\n            }\n            if (element.node) {\n                ret = this.__execute(visitor.enter, element);\n                if (this.__state === BREAK || ret === BREAK) return;\n                worklist.push(sentinel);\n                leavelist.push(element);\n                if (this.__state === SKIP || ret === SKIP) continue;\n                node = element.node;\n                nodeType = node.type || element.wrap;\n                candidates = this.__keys[nodeType];\n                if (!candidates) {\n                    if (this.__fallback) candidates = this.__fallback(node);\n                    else throw new Error('Unknown node type ' + nodeType + '.');\n                }\n                current = candidates.length;\n                while((current -= 1) >= 0){\n                    key = candidates[current];\n                    candidate = node[key];\n                    if (!candidate) continue;\n                    if (Array.isArray(candidate)) {\n                        current2 = candidate.length;\n                        while((current2 -= 1) >= 0){\n                            if (!candidate[current2]) continue;\n                            if (candidateExistsInLeaveList(leavelist, candidate[current2])) continue;\n                            if (isProperty(nodeType, candidates[current])) element = new Element(candidate[current2], [\n                                key,\n                                current2\n                            ], 'Property', null);\n                            else if (isNode(candidate[current2])) element = new Element(candidate[current2], [\n                                key,\n                                current2\n                            ], null, null);\n                            else continue;\n                            worklist.push(element);\n                        }\n                    } else if (isNode(candidate)) {\n                        if (candidateExistsInLeaveList(leavelist, candidate)) continue;\n                        worklist.push(new Element(candidate, key, null, null));\n                    }\n                }\n            }\n        }\n    };\n    Controller.prototype.replace = function replace(root, visitor) {\n        var worklist, leavelist, node, nodeType, target, element, current, current2, candidates, candidate, sentinel, outer, key;\n        function removeElem(element) {\n            var i, key, nextElem, parent;\n            if (element.ref.remove()) {\n                // When the reference is an element of an array.\n                key = element.ref.key;\n                parent = element.ref.parent;\n                // If removed from array, then decrease following items' keys.\n                i = worklist.length;\n                while(i--){\n                    nextElem = worklist[i];\n                    if (nextElem.ref && nextElem.ref.parent === parent) {\n                        if (nextElem.ref.key < key) break;\n                        --nextElem.ref.key;\n                    }\n                }\n            }\n        }\n        this.__initialize(root, visitor);\n        sentinel = {};\n        // reference\n        worklist = this.__worklist;\n        leavelist = this.__leavelist;\n        // initialize\n        outer = {\n            root: root\n        };\n        element = new Element(root, null, null, new Reference(outer, 'root'));\n        worklist.push(element);\n        leavelist.push(element);\n        while(worklist.length){\n            element = worklist.pop();\n            if (element === sentinel) {\n                element = leavelist.pop();\n                target = this.__execute(visitor.leave, element);\n                // node may be replaced with null,\n                // so distinguish between undefined and null in this place\n                if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) // replace\n                element.ref.replace(target);\n                if (this.__state === REMOVE || target === REMOVE) removeElem(element);\n                if (this.__state === BREAK || target === BREAK) return outer.root;\n                continue;\n            }\n            target = this.__execute(visitor.enter, element);\n            // node may be replaced with null,\n            // so distinguish between undefined and null in this place\n            if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {\n                // replace\n                element.ref.replace(target);\n                element.node = target;\n            }\n            if (this.__state === REMOVE || target === REMOVE) {\n                removeElem(element);\n                element.node = null;\n            }\n            if (this.__state === BREAK || target === BREAK) return outer.root;\n            // node may be null\n            node = element.node;\n            if (!node) continue;\n            worklist.push(sentinel);\n            leavelist.push(element);\n            if (this.__state === SKIP || target === SKIP) continue;\n            nodeType = node.type || element.wrap;\n            candidates = this.__keys[nodeType];\n            if (!candidates) {\n                if (this.__fallback) candidates = this.__fallback(node);\n                else throw new Error('Unknown node type ' + nodeType + '.');\n            }\n            current = candidates.length;\n            while((current -= 1) >= 0){\n                key = candidates[current];\n                candidate = node[key];\n                if (!candidate) continue;\n                if (Array.isArray(candidate)) {\n                    current2 = candidate.length;\n                    while((current2 -= 1) >= 0){\n                        if (!candidate[current2]) continue;\n                        if (isProperty(nodeType, candidates[current])) element = new Element(candidate[current2], [\n                            key,\n                            current2\n                        ], 'Property', new Reference(candidate, current2));\n                        else if (isNode(candidate[current2])) element = new Element(candidate[current2], [\n                            key,\n                            current2\n                        ], null, new Reference(candidate, current2));\n                        else continue;\n                        worklist.push(element);\n                    }\n                } else if (isNode(candidate)) worklist.push(new Element(candidate, key, null, new Reference(node, key)));\n            }\n        }\n        return outer.root;\n    };\n    function traverse(root, visitor) {\n        var controller = new Controller();\n        return controller.traverse(root, visitor);\n    }\n    function replace(root, visitor) {\n        var controller = new Controller();\n        return controller.replace(root, visitor);\n    }\n    function extendCommentRange(comment, tokens) {\n        var target;\n        target = upperBound(tokens, function search(token) {\n            return token.range[0] > comment.range[0];\n        });\n        comment.extendedRange = [\n            comment.range[0],\n            comment.range[1]\n        ];\n        if (target !== tokens.length) comment.extendedRange[1] = tokens[target].range[0];\n        target -= 1;\n        if (target >= 0) comment.extendedRange[0] = tokens[target].range[1];\n        return comment;\n    }\n    function attachComments(tree, providedComments, tokens) {\n        // At first, we should calculate extended comment ranges.\n        var comments = [], comment, len, i, cursor;\n        if (!tree.range) throw new Error('attachComments needs range information');\n        // tokens array is empty, we attach comments to tree as 'leadingComments'\n        if (!tokens.length) {\n            if (providedComments.length) {\n                for(i = 0, len = providedComments.length; i < len; i += 1){\n                    comment = deepCopy(providedComments[i]);\n                    comment.extendedRange = [\n                        0,\n                        tree.range[0]\n                    ];\n                    comments.push(comment);\n                }\n                tree.leadingComments = comments;\n            }\n            return tree;\n        }\n        for(i = 0, len = providedComments.length; i < len; i += 1)comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens));\n        // This is based on John Freeman's implementation.\n        cursor = 0;\n        traverse(tree, {\n            enter: function(node) {\n                var comment;\n                while(cursor < comments.length){\n                    comment = comments[cursor];\n                    if (comment.extendedRange[1] > node.range[0]) break;\n                    if (comment.extendedRange[1] === node.range[0]) {\n                        if (!node.leadingComments) node.leadingComments = [];\n                        node.leadingComments.push(comment);\n                        comments.splice(cursor, 1);\n                    } else cursor += 1;\n                }\n                // already out of owned node\n                if (cursor === comments.length) return VisitorOption.Break;\n                if (comments[cursor].extendedRange[0] > node.range[1]) return VisitorOption.Skip;\n            }\n        });\n        cursor = 0;\n        traverse(tree, {\n            leave: function(node) {\n                var comment;\n                while(cursor < comments.length){\n                    comment = comments[cursor];\n                    if (node.range[1] < comment.extendedRange[0]) break;\n                    if (node.range[1] === comment.extendedRange[0]) {\n                        if (!node.trailingComments) node.trailingComments = [];\n                        node.trailingComments.push(comment);\n                        comments.splice(cursor, 1);\n                    } else cursor += 1;\n                }\n                // already out of owned node\n                if (cursor === comments.length) return VisitorOption.Break;\n                if (comments[cursor].extendedRange[0] > node.range[1]) return VisitorOption.Skip;\n            }\n        });\n        return tree;\n    }\n    exports1.Syntax = Syntax;\n    exports1.traverse = traverse;\n    exports1.replace = replace;\n    exports1.attachComments = attachComments;\n    exports1.VisitorKeys = VisitorKeys;\n    exports1.VisitorOption = VisitorOption;\n    exports1.Controller = Controller;\n    exports1.cloneEnvironment = function() {\n        return clone({});\n    };\n    return exports1;\n})(exports); /* vim: set sw=4 ts=4 et tw=80 : */ \n\n},{}],\"5xh3B\":[function(require,module,exports) {\n/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ exports.SourceMapGenerator = require(\"4f3489f7a4aa86a\").SourceMapGenerator;\nexports.SourceMapConsumer = require(\"74f5da57ddba8e\").SourceMapConsumer;\nexports.SourceNode = require(\"24e5bc41542c0363\").SourceNode;\n\n},{\"4f3489f7a4aa86a\":\"8kYuK\",\"74f5da57ddba8e\":\"ccRYo\",\"24e5bc41542c0363\":\"iEM9Y\"}],\"8kYuK\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var base64VLQ = require(\"c40e1500640cbc22\");\nvar util = require(\"c65fbfec2259bb0f\");\nvar ArraySet = require(\"fce2ada3f2269665\").ArraySet;\nvar MappingList = require(\"2ae94379d5b0c785\").MappingList;\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */ function SourceMapGenerator(aArgs) {\n    if (!aArgs) aArgs = {};\n    this._file = util.getArg(aArgs, 'file', null);\n    this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n    this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n    this._sources = new ArraySet();\n    this._names = new ArraySet();\n    this._mappings = new MappingList();\n    this._sourcesContents = null;\n}\nSourceMapGenerator.prototype._version = 3;\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */ SourceMapGenerator.fromSourceMap = function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n        file: aSourceMapConsumer.file,\n        sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function(mapping) {\n        var newMapping = {\n            generated: {\n                line: mapping.generatedLine,\n                column: mapping.generatedColumn\n            }\n        };\n        if (mapping.source != null) {\n            newMapping.source = mapping.source;\n            if (sourceRoot != null) newMapping.source = util.relative(sourceRoot, newMapping.source);\n            newMapping.original = {\n                line: mapping.originalLine,\n                column: mapping.originalColumn\n            };\n            if (mapping.name != null) newMapping.name = mapping.name;\n        }\n        generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function(sourceFile) {\n        var sourceRelative = sourceFile;\n        if (sourceRoot !== null) sourceRelative = util.relative(sourceRoot, sourceFile);\n        if (!generator._sources.has(sourceRelative)) generator._sources.add(sourceRelative);\n        var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n        if (content != null) generator.setSourceContent(sourceFile, content);\n    });\n    return generator;\n};\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */ SourceMapGenerator.prototype.addMapping = function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n    if (!this._skipValidation) this._validateMapping(generated, original, source, name);\n    if (source != null) {\n        source = String(source);\n        if (!this._sources.has(source)) this._sources.add(source);\n    }\n    if (name != null) {\n        name = String(name);\n        if (!this._names.has(name)) this._names.add(name);\n    }\n    this._mappings.add({\n        generatedLine: generated.line,\n        generatedColumn: generated.column,\n        originalLine: original != null && original.line,\n        originalColumn: original != null && original.column,\n        source: source,\n        name: name\n    });\n};\n/**\n * Set the source content for a source file.\n */ SourceMapGenerator.prototype.setSourceContent = function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) source = util.relative(this._sourceRoot, source);\n    if (aSourceContent != null) {\n        // Add the source content to the _sourcesContents map.\n        // Create a new _sourcesContents map if the property is null.\n        if (!this._sourcesContents) this._sourcesContents = Object.create(null);\n        this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n        // Remove the source file from the _sourcesContents map.\n        // If the _sourcesContents map is empty, set the property to null.\n        delete this._sourcesContents[util.toSetString(source)];\n        if (Object.keys(this._sourcesContents).length === 0) this._sourcesContents = null;\n    }\n};\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */ SourceMapGenerator.prototype.applySourceMap = function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n        if (aSourceMapConsumer.file == null) throw new Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map\\'s \"file\" property. Both were omitted.');\n        sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) sourceFile = util.relative(sourceRoot, sourceFile);\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function(mapping) {\n        if (mapping.source === sourceFile && mapping.originalLine != null) {\n            // Check if it can be mapped by the source map, then update the mapping.\n            var original = aSourceMapConsumer.originalPositionFor({\n                line: mapping.originalLine,\n                column: mapping.originalColumn\n            });\n            if (original.source != null) {\n                // Copy mapping\n                mapping.source = original.source;\n                if (aSourceMapPath != null) mapping.source = util.join(aSourceMapPath, mapping.source);\n                if (sourceRoot != null) mapping.source = util.relative(sourceRoot, mapping.source);\n                mapping.originalLine = original.line;\n                mapping.originalColumn = original.column;\n                if (original.name != null) mapping.name = original.name;\n            }\n        }\n        var source = mapping.source;\n        if (source != null && !newSources.has(source)) newSources.add(source);\n        var name = mapping.name;\n        if (name != null && !newNames.has(name)) newNames.add(name);\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function(sourceFile) {\n        var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n        if (content != null) {\n            if (aSourceMapPath != null) sourceFile = util.join(aSourceMapPath, sourceFile);\n            if (sourceRoot != null) sourceFile = util.relative(sourceRoot, sourceFile);\n            this.setSourceContent(sourceFile, content);\n        }\n    }, this);\n};\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */ SourceMapGenerator.prototype._validateMapping = function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource, aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') throw new Error(\"original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.\");\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated && aGenerated.line > 0 && aGenerated.column >= 0 && !aOriginal && !aSource && !aName) // Case 1.\n    return;\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated && aOriginal && 'line' in aOriginal && 'column' in aOriginal && aGenerated.line > 0 && aGenerated.column >= 0 && aOriginal.line > 0 && aOriginal.column >= 0 && aSource) // Cases 2 and 3.\n    return;\n    else throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n    }));\n};\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */ SourceMapGenerator.prototype._serializeMappings = function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n    var mappings = this._mappings.toArray();\n    for(var i = 0, len = mappings.length; i < len; i++){\n        mapping = mappings[i];\n        next = '';\n        if (mapping.generatedLine !== previousGeneratedLine) {\n            previousGeneratedColumn = 0;\n            while(mapping.generatedLine !== previousGeneratedLine){\n                next += ';';\n                previousGeneratedLine++;\n            }\n        } else if (i > 0) {\n            if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) continue;\n            next += ',';\n        }\n        next += base64VLQ.encode(mapping.generatedColumn - previousGeneratedColumn);\n        previousGeneratedColumn = mapping.generatedColumn;\n        if (mapping.source != null) {\n            sourceIdx = this._sources.indexOf(mapping.source);\n            next += base64VLQ.encode(sourceIdx - previousSource);\n            previousSource = sourceIdx;\n            // lines are stored 0-based in SourceMap spec version 3\n            next += base64VLQ.encode(mapping.originalLine - 1 - previousOriginalLine);\n            previousOriginalLine = mapping.originalLine - 1;\n            next += base64VLQ.encode(mapping.originalColumn - previousOriginalColumn);\n            previousOriginalColumn = mapping.originalColumn;\n            if (mapping.name != null) {\n                nameIdx = this._names.indexOf(mapping.name);\n                next += base64VLQ.encode(nameIdx - previousName);\n                previousName = nameIdx;\n            }\n        }\n        result += next;\n    }\n    return result;\n};\nSourceMapGenerator.prototype._generateSourcesContent = function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function(source) {\n        if (!this._sourcesContents) return null;\n        if (aSourceRoot != null) source = util.relative(aSourceRoot, source);\n        var key = util.toSetString(source);\n        return Object.prototype.hasOwnProperty.call(this._sourcesContents, key) ? this._sourcesContents[key] : null;\n    }, this);\n};\n/**\n * Externalize the source map.\n */ SourceMapGenerator.prototype.toJSON = function SourceMapGenerator_toJSON() {\n    var map = {\n        version: this._version,\n        sources: this._sources.toArray(),\n        names: this._names.toArray(),\n        mappings: this._serializeMappings()\n    };\n    if (this._file != null) map.file = this._file;\n    if (this._sourceRoot != null) map.sourceRoot = this._sourceRoot;\n    if (this._sourcesContents) map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    return map;\n};\n/**\n * Render the source map being generated to a string.\n */ SourceMapGenerator.prototype.toString = function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n};\nexports.SourceMapGenerator = SourceMapGenerator;\n\n},{\"c40e1500640cbc22\":\"hChUp\",\"c65fbfec2259bb0f\":\"lD9JL\",\"fce2ada3f2269665\":\"agOsa\",\"2ae94379d5b0c785\":\"98NIM\"}],\"hChUp\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */ var base64 = require(\"9fcf0c64c293678d\");\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\nvar VLQ_BASE_SHIFT = 5;\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */ function toVLQSigned(aValue) {\n    return aValue < 0 ? (-aValue << 1) + 1 : (aValue << 1) + 0;\n}\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */ function fromVLQSigned(aValue) {\n    var isNegative = (aValue & 1) === 1;\n    var shifted = aValue >> 1;\n    return isNegative ? -shifted : shifted;\n}\n/**\n * Returns the base 64 VLQ encoded value.\n */ exports.encode = function base64VLQ_encode(aValue) {\n    var encoded = \"\";\n    var digit;\n    var vlq = toVLQSigned(aValue);\n    do {\n        digit = vlq & VLQ_BASE_MASK;\n        vlq >>>= VLQ_BASE_SHIFT;\n        if (vlq > 0) // There are still more digits in this value, so we must make sure the\n        // continuation bit is marked.\n        digit |= VLQ_CONTINUATION_BIT;\n        encoded += base64.encode(digit);\n    }while (vlq > 0);\n    return encoded;\n};\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */ exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n    var strLen = aStr.length;\n    var result = 0;\n    var shift = 0;\n    var continuation, digit;\n    do {\n        if (aIndex >= strLen) throw new Error(\"Expected more digits in base 64 VLQ value.\");\n        digit = base64.decode(aStr.charCodeAt(aIndex++));\n        if (digit === -1) throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n        continuation = !!(digit & VLQ_CONTINUATION_BIT);\n        digit &= VLQ_BASE_MASK;\n        result = result + (digit << shift);\n        shift += VLQ_BASE_SHIFT;\n    }while (continuation);\n    aOutParam.value = fromVLQSigned(result);\n    aOutParam.rest = aIndex;\n};\n\n},{\"9fcf0c64c293678d\":\"lgQgT\"}],\"lgQgT\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */ exports.encode = function(number) {\n    if (0 <= number && number < intToCharMap.length) return intToCharMap[number];\n    throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */ exports.decode = function(charCode) {\n    var bigA = 65; // 'A'\n    var bigZ = 90; // 'Z'\n    var littleA = 97; // 'a'\n    var littleZ = 122; // 'z'\n    var zero = 48; // '0'\n    var nine = 57; // '9'\n    var plus = 43; // '+'\n    var slash = 47; // '/'\n    var littleOffset = 26;\n    var numberOffset = 52;\n    // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n    if (bigA <= charCode && charCode <= bigZ) return charCode - bigA;\n    // 26 - 51: abcdefghijklmnopqrstuvwxyz\n    if (littleA <= charCode && charCode <= littleZ) return charCode - littleA + littleOffset;\n    // 52 - 61: 0123456789\n    if (zero <= charCode && charCode <= nine) return charCode - zero + numberOffset;\n    // 62: +\n    if (charCode == plus) return 62;\n    // 63: /\n    if (charCode == slash) return 63;\n    // Invalid base64 digit.\n    return -1;\n};\n\n},{}],\"lD9JL\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ /**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */ function getArg(aArgs, aName, aDefaultValue) {\n    if (aName in aArgs) return aArgs[aName];\n    else if (arguments.length === 3) return aDefaultValue;\n    else throw new Error('\"' + aName + '\" is a required argument.');\n}\nexports.getArg = getArg;\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\nfunction urlParse(aUrl) {\n    var match = aUrl.match(urlRegexp);\n    if (!match) return null;\n    return {\n        scheme: match[1],\n        auth: match[2],\n        host: match[3],\n        port: match[4],\n        path: match[5]\n    };\n}\nexports.urlParse = urlParse;\nfunction urlGenerate(aParsedUrl) {\n    var url = '';\n    if (aParsedUrl.scheme) url += aParsedUrl.scheme + ':';\n    url += '//';\n    if (aParsedUrl.auth) url += aParsedUrl.auth + '@';\n    if (aParsedUrl.host) url += aParsedUrl.host;\n    if (aParsedUrl.port) url += \":\" + aParsedUrl.port;\n    if (aParsedUrl.path) url += aParsedUrl.path;\n    return url;\n}\nexports.urlGenerate = urlGenerate;\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */ function normalize(aPath) {\n    var path = aPath;\n    var url = urlParse(aPath);\n    if (url) {\n        if (!url.path) return aPath;\n        path = url.path;\n    }\n    var isAbsolute = exports.isAbsolute(path);\n    var parts = path.split(/\\/+/);\n    for(var part, up = 0, i = parts.length - 1; i >= 0; i--){\n        part = parts[i];\n        if (part === '.') parts.splice(i, 1);\n        else if (part === '..') up++;\n        else if (up > 0) {\n            if (part === '') {\n                // The first part is blank if the path is absolute. Trying to go\n                // above the root is a no-op. Therefore we can remove all '..' parts\n                // directly after the root.\n                parts.splice(i + 1, up);\n                up = 0;\n            } else {\n                parts.splice(i, 2);\n                up--;\n            }\n        }\n    }\n    path = parts.join('/');\n    if (path === '') path = isAbsolute ? '/' : '.';\n    if (url) {\n        url.path = path;\n        return urlGenerate(url);\n    }\n    return path;\n}\nexports.normalize = normalize;\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */ function join(aRoot, aPath) {\n    if (aRoot === \"\") aRoot = \".\";\n    if (aPath === \"\") aPath = \".\";\n    var aPathUrl = urlParse(aPath);\n    var aRootUrl = urlParse(aRoot);\n    if (aRootUrl) aRoot = aRootUrl.path || '/';\n    // `join(foo, '//www.example.org')`\n    if (aPathUrl && !aPathUrl.scheme) {\n        if (aRootUrl) aPathUrl.scheme = aRootUrl.scheme;\n        return urlGenerate(aPathUrl);\n    }\n    if (aPathUrl || aPath.match(dataUrlRegexp)) return aPath;\n    // `join('http://', 'www.example.com')`\n    if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n        aRootUrl.host = aPath;\n        return urlGenerate(aRootUrl);\n    }\n    var joined = aPath.charAt(0) === '/' ? aPath : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n    if (aRootUrl) {\n        aRootUrl.path = joined;\n        return urlGenerate(aRootUrl);\n    }\n    return joined;\n}\nexports.join = join;\nexports.isAbsolute = function(aPath) {\n    return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */ function relative(aRoot, aPath) {\n    if (aRoot === \"\") aRoot = \".\";\n    aRoot = aRoot.replace(/\\/$/, '');\n    // It is possible for the path to be above the root. In this case, simply\n    // checking whether the root is a prefix of the path won't work. Instead, we\n    // need to remove components from the root one by one, until either we find\n    // a prefix that fits, or we run out of components to remove.\n    var level = 0;\n    while(aPath.indexOf(aRoot + '/') !== 0){\n        var index = aRoot.lastIndexOf(\"/\");\n        if (index < 0) return aPath;\n        // If the only part of the root that is left is the scheme (i.e. http://,\n        // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n        // have exhausted all components, so the path is not relative to the root.\n        aRoot = aRoot.slice(0, index);\n        if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) return aPath;\n        ++level;\n    }\n    // Make sure we add a \"../\" for each component we removed from the root.\n    return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\nvar supportsNullProto = function() {\n    var obj = Object.create(null);\n    return !('__proto__' in obj);\n}();\nfunction identity(s) {\n    return s;\n}\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */ function toSetString(aStr) {\n    if (isProtoString(aStr)) return '$' + aStr;\n    return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\nfunction fromSetString(aStr) {\n    if (isProtoString(aStr)) return aStr.slice(1);\n    return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\nfunction isProtoString(s) {\n    if (!s) return false;\n    var length = s.length;\n    if (length < 9 /* \"__proto__\".length */ ) return false;\n    if (s.charCodeAt(length - 1) !== 95 /* '_' */  || s.charCodeAt(length - 2) !== 95 /* '_' */  || s.charCodeAt(length - 3) !== 111 /* 'o' */  || s.charCodeAt(length - 4) !== 116 /* 't' */  || s.charCodeAt(length - 5) !== 111 /* 'o' */  || s.charCodeAt(length - 6) !== 114 /* 'r' */  || s.charCodeAt(length - 7) !== 112 /* 'p' */  || s.charCodeAt(length - 8) !== 95 /* '_' */  || s.charCodeAt(length - 9) !== 95 /* '_' */ ) return false;\n    for(var i = length - 10; i >= 0; i--){\n        if (s.charCodeAt(i) !== 36 /* '$' */ ) return false;\n    }\n    return true;\n}\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */ function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n    var cmp = strcmp(mappingA.source, mappingB.source);\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalLine - mappingB.originalLine;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalColumn - mappingB.originalColumn;\n    if (cmp !== 0 || onlyCompareOriginal) return cmp;\n    cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.generatedLine - mappingB.generatedLine;\n    if (cmp !== 0) return cmp;\n    return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */ function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n    var cmp = mappingA.generatedLine - mappingB.generatedLine;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n    if (cmp !== 0 || onlyCompareGenerated) return cmp;\n    cmp = strcmp(mappingA.source, mappingB.source);\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalLine - mappingB.originalLine;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalColumn - mappingB.originalColumn;\n    if (cmp !== 0) return cmp;\n    return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\nfunction strcmp(aStr1, aStr2) {\n    if (aStr1 === aStr2) return 0;\n    if (aStr1 === null) return 1; // aStr2 !== null\n    if (aStr2 === null) return -1; // aStr1 !== null\n    if (aStr1 > aStr2) return 1;\n    return -1;\n}\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */ function compareByGeneratedPositionsInflated(mappingA, mappingB) {\n    var cmp = mappingA.generatedLine - mappingB.generatedLine;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n    if (cmp !== 0) return cmp;\n    cmp = strcmp(mappingA.source, mappingB.source);\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalLine - mappingB.originalLine;\n    if (cmp !== 0) return cmp;\n    cmp = mappingA.originalColumn - mappingB.originalColumn;\n    if (cmp !== 0) return cmp;\n    return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */ function parseSourceMapInput(str) {\n    return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */ function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n    sourceURL = sourceURL || '';\n    if (sourceRoot) {\n        // This follows what Chrome does.\n        if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') sourceRoot += '/';\n        // The spec says:\n        //   Line 4: An optional source root, useful for relocating source\n        //   files on a server or removing repeated values in the\n        //   “sources” entry.  This value is prepended to the individual\n        //   entries in the “source” field.\n        sourceURL = sourceRoot + sourceURL;\n    }\n    // Historically, SourceMapConsumer did not take the sourceMapURL as\n    // a parameter.  This mode is still somewhat supported, which is why\n    // this code block is conditional.  However, it's preferable to pass\n    // the source map URL to SourceMapConsumer, so that this function\n    // can implement the source URL resolution algorithm as outlined in\n    // the spec.  This block is basically the equivalent of:\n    //    new URL(sourceURL, sourceMapURL).toString()\n    // ... except it avoids using URL, which wasn't available in the\n    // older releases of node still supported by this library.\n    //\n    // The spec says:\n    //   If the sources are not absolute URLs after prepending of the\n    //   “sourceRoot”, the sources are resolved relative to the\n    //   SourceMap (like resolving script src in a html document).\n    if (sourceMapURL) {\n        var parsed = urlParse(sourceMapURL);\n        if (!parsed) throw new Error(\"sourceMapURL could not be parsed\");\n        if (parsed.path) {\n            // Strip the last path component, but keep the \"/\".\n            var index = parsed.path.lastIndexOf('/');\n            if (index >= 0) parsed.path = parsed.path.substring(0, index + 1);\n        }\n        sourceURL = join(urlGenerate(parsed), sourceURL);\n    }\n    return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n\n},{}],\"agOsa\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var util = require(\"f4001388f67ef757\");\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */ function ArraySet() {\n    this._array = [];\n    this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n/**\n * Static method for creating ArraySet instances from an existing array.\n */ ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n    var set = new ArraySet();\n    for(var i = 0, len = aArray.length; i < len; i++)set.add(aArray[i], aAllowDuplicates);\n    return set;\n};\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */ ArraySet.prototype.size = function ArraySet_size() {\n    return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */ ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n    var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n    var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n    var idx = this._array.length;\n    if (!isDuplicate || aAllowDuplicates) this._array.push(aStr);\n    if (!isDuplicate) {\n        if (hasNativeMap) this._set.set(aStr, idx);\n        else this._set[sStr] = idx;\n    }\n};\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */ ArraySet.prototype.has = function ArraySet_has(aStr) {\n    if (hasNativeMap) return this._set.has(aStr);\n    else {\n        var sStr = util.toSetString(aStr);\n        return has.call(this._set, sStr);\n    }\n};\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */ ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n    if (hasNativeMap) {\n        var idx = this._set.get(aStr);\n        if (idx >= 0) return idx;\n    } else {\n        var sStr = util.toSetString(aStr);\n        if (has.call(this._set, sStr)) return this._set[sStr];\n    }\n    throw new Error('\"' + aStr + '\" is not in the set.');\n};\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */ ArraySet.prototype.at = function ArraySet_at(aIdx) {\n    if (aIdx >= 0 && aIdx < this._array.length) return this._array[aIdx];\n    throw new Error('No element indexed by ' + aIdx);\n};\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */ ArraySet.prototype.toArray = function ArraySet_toArray() {\n    return this._array.slice();\n};\nexports.ArraySet = ArraySet;\n\n},{\"f4001388f67ef757\":\"lD9JL\"}],\"98NIM\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var util = require(\"a70191b97ba376d4\");\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */ function generatedPositionAfter(mappingA, mappingB) {\n    // Optimized for most common case\n    var lineA = mappingA.generatedLine;\n    var lineB = mappingB.generatedLine;\n    var columnA = mappingA.generatedColumn;\n    var columnB = mappingB.generatedColumn;\n    return lineB > lineA || lineB == lineA && columnB >= columnA || util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */ function MappingList() {\n    this._array = [];\n    this._sorted = true;\n    // Serves as infimum\n    this._last = {\n        generatedLine: -1,\n        generatedColumn: 0\n    };\n}\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */ MappingList.prototype.unsortedForEach = function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n};\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */ MappingList.prototype.add = function MappingList_add(aMapping) {\n    if (generatedPositionAfter(this._last, aMapping)) {\n        this._last = aMapping;\n        this._array.push(aMapping);\n    } else {\n        this._sorted = false;\n        this._array.push(aMapping);\n    }\n};\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */ MappingList.prototype.toArray = function MappingList_toArray() {\n    if (!this._sorted) {\n        this._array.sort(util.compareByGeneratedPositionsInflated);\n        this._sorted = true;\n    }\n    return this._array;\n};\nexports.MappingList = MappingList;\n\n},{\"a70191b97ba376d4\":\"lD9JL\"}],\"ccRYo\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var util = require(\"b22324b13f72201b\");\nvar binarySearch = require(\"129ba2b16e81db9e\");\nvar ArraySet = require(\"832bf56bf6a231e4\").ArraySet;\nvar base64VLQ = require(\"95d11d359ee56491\");\nvar quickSort = require(\"7076e0beb1aa0cfd\").quickSort;\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n    var sourceMap = aSourceMap;\n    if (typeof aSourceMap === 'string') sourceMap = util.parseSourceMapInput(aSourceMap);\n    return sourceMap.sections != null ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL) : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n    return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n};\n/**\n * The version of the source mapping spec that we are consuming.\n */ SourceMapConsumer.prototype._version = 3;\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n    configurable: true,\n    enumerable: true,\n    get: function() {\n        if (!this.__generatedMappings) this._parseMappings(this._mappings, this.sourceRoot);\n        return this.__generatedMappings;\n    }\n});\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n    configurable: true,\n    enumerable: true,\n    get: function() {\n        if (!this.__originalMappings) this._parseMappings(this._mappings, this.sourceRoot);\n        return this.__originalMappings;\n    }\n});\nSourceMapConsumer.prototype._charIsMappingSeparator = function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n};\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */ SourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n};\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */ SourceMapConsumer.prototype.eachMapping = function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n    var mappings;\n    switch(order){\n        case SourceMapConsumer.GENERATED_ORDER:\n            mappings = this._generatedMappings;\n            break;\n        case SourceMapConsumer.ORIGINAL_ORDER:\n            mappings = this._originalMappings;\n            break;\n        default:\n            throw new Error(\"Unknown order of iteration.\");\n    }\n    var sourceRoot = this.sourceRoot;\n    mappings.map(function(mapping) {\n        var source = mapping.source === null ? null : this._sources.at(mapping.source);\n        source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n        return {\n            source: source,\n            generatedLine: mapping.generatedLine,\n            generatedColumn: mapping.generatedColumn,\n            originalLine: mapping.originalLine,\n            originalColumn: mapping.originalColumn,\n            name: mapping.name === null ? null : this._names.at(mapping.name)\n        };\n    }, this).forEach(aCallback, context);\n};\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */ SourceMapConsumer.prototype.allGeneratedPositionsFor = function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n        source: util.getArg(aArgs, 'source'),\n        originalLine: line,\n        originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) return [];\n    var mappings = [];\n    var index = this._findMapping(needle, this._originalMappings, \"originalLine\", \"originalColumn\", util.compareByOriginalPositions, binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n        var mapping = this._originalMappings[index];\n        if (aArgs.column === undefined) {\n            var originalLine = mapping.originalLine;\n            // Iterate until either we run out of mappings, or we run into\n            // a mapping for a different line than the one we found. Since\n            // mappings are sorted, this is guaranteed to find all mappings for\n            // the line we found.\n            while(mapping && mapping.originalLine === originalLine){\n                mappings.push({\n                    line: util.getArg(mapping, 'generatedLine', null),\n                    column: util.getArg(mapping, 'generatedColumn', null),\n                    lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n                });\n                mapping = this._originalMappings[++index];\n            }\n        } else {\n            var originalColumn = mapping.originalColumn;\n            // Iterate until either we run out of mappings, or we run into\n            // a mapping for a different line than the one we were searching for.\n            // Since mappings are sorted, this is guaranteed to find all mappings for\n            // the line we are searching for.\n            while(mapping && mapping.originalLine === line && mapping.originalColumn == originalColumn){\n                mappings.push({\n                    line: util.getArg(mapping, 'generatedLine', null),\n                    column: util.getArg(mapping, 'generatedColumn', null),\n                    lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n                });\n                mapping = this._originalMappings[++index];\n            }\n        }\n    }\n    return mappings;\n};\nexports.SourceMapConsumer = SourceMapConsumer;\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */ function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n    var sourceMap = aSourceMap;\n    if (typeof aSourceMap === 'string') sourceMap = util.parseSourceMapInput(aSourceMap);\n    var version = util.getArg(sourceMap, 'version');\n    var sources = util.getArg(sourceMap, 'sources');\n    // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n    // requires the array) to play nice here.\n    var names = util.getArg(sourceMap, 'names', []);\n    var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n    var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n    var mappings = util.getArg(sourceMap, 'mappings');\n    var file = util.getArg(sourceMap, 'file', null);\n    // Once again, Sass deviates from the spec and supplies the version as a\n    // string rather than a number, so we use loose equality checking here.\n    if (version != this._version) throw new Error('Unsupported version: ' + version);\n    if (sourceRoot) sourceRoot = util.normalize(sourceRoot);\n    sources = sources.map(String)// Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)// Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function(source) {\n        return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source) ? util.relative(sourceRoot, source) : source;\n    });\n    // Pass `true` below to allow duplicate names and sources. While source maps\n    // are intended to be compressed and deduplicated, the TypeScript compiler\n    // sometimes generates source maps with duplicates in them. See Github issue\n    // #72 and bugzil.la/889492.\n    this._names = ArraySet.fromArray(names.map(String), true);\n    this._sources = ArraySet.fromArray(sources, true);\n    this._absoluteSources = this._sources.toArray().map(function(s) {\n        return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n    });\n    this.sourceRoot = sourceRoot;\n    this.sourcesContent = sourcesContent;\n    this._mappings = mappings;\n    this._sourceMapURL = aSourceMapURL;\n    this.file = file;\n}\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */ BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) relativeSource = util.relative(this.sourceRoot, relativeSource);\n    if (this._sources.has(relativeSource)) return this._sources.indexOf(relativeSource);\n    // Maybe aSource is an absolute URL as returned by |sources|.  In\n    // this case we can't simply undo the transform.\n    var i;\n    for(i = 0; i < this._absoluteSources.length; ++i){\n        if (this._absoluteSources[i] == aSource) return i;\n    }\n    return -1;\n};\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */ BasicSourceMapConsumer.fromSourceMap = function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(), smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function(s) {\n        return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n    for(var i = 0, length = generatedMappings.length; i < length; i++){\n        var srcMapping = generatedMappings[i];\n        var destMapping = new Mapping;\n        destMapping.generatedLine = srcMapping.generatedLine;\n        destMapping.generatedColumn = srcMapping.generatedColumn;\n        if (srcMapping.source) {\n            destMapping.source = sources.indexOf(srcMapping.source);\n            destMapping.originalLine = srcMapping.originalLine;\n            destMapping.originalColumn = srcMapping.originalColumn;\n            if (srcMapping.name) destMapping.name = names.indexOf(srcMapping.name);\n            destOriginalMappings.push(destMapping);\n        }\n        destGeneratedMappings.push(destMapping);\n    }\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n    return smc;\n};\n/**\n * The version of the source mapping spec that we are consuming.\n */ BasicSourceMapConsumer.prototype._version = 3;\n/**\n * The list of original sources.\n */ Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n    get: function() {\n        return this._absoluteSources.slice();\n    }\n});\n/**\n * Provide the JIT with a nice shape / hidden class.\n */ function Mapping() {\n    this.generatedLine = 0;\n    this.generatedColumn = 0;\n    this.source = null;\n    this.originalLine = null;\n    this.originalColumn = null;\n    this.name = null;\n}\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */ BasicSourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n    while(index < length){\n        if (aStr.charAt(index) === ';') {\n            generatedLine++;\n            index++;\n            previousGeneratedColumn = 0;\n        } else if (aStr.charAt(index) === ',') index++;\n        else {\n            mapping = new Mapping();\n            mapping.generatedLine = generatedLine;\n            // Because each offset is encoded relative to the previous one,\n            // many segments often have the same encoding. We can exploit this\n            // fact by caching the parsed variable length fields of each segment,\n            // allowing us to avoid a second parse if we encounter the same\n            // segment again.\n            for(end = index; end < length; end++){\n                if (this._charIsMappingSeparator(aStr, end)) break;\n            }\n            str = aStr.slice(index, end);\n            segment = cachedSegments[str];\n            if (segment) index += str.length;\n            else {\n                segment = [];\n                while(index < end){\n                    base64VLQ.decode(aStr, index, temp);\n                    value = temp.value;\n                    index = temp.rest;\n                    segment.push(value);\n                }\n                if (segment.length === 2) throw new Error('Found a source, but no line and column');\n                if (segment.length === 3) throw new Error('Found a source and line, but no column');\n                cachedSegments[str] = segment;\n            }\n            // Generated column.\n            mapping.generatedColumn = previousGeneratedColumn + segment[0];\n            previousGeneratedColumn = mapping.generatedColumn;\n            if (segment.length > 1) {\n                // Original source.\n                mapping.source = previousSource + segment[1];\n                previousSource += segment[1];\n                // Original line.\n                mapping.originalLine = previousOriginalLine + segment[2];\n                previousOriginalLine = mapping.originalLine;\n                // Lines are stored 0-based\n                mapping.originalLine += 1;\n                // Original column.\n                mapping.originalColumn = previousOriginalColumn + segment[3];\n                previousOriginalColumn = mapping.originalColumn;\n                if (segment.length > 4) {\n                    // Original name.\n                    mapping.name = previousName + segment[4];\n                    previousName += segment[4];\n                }\n            }\n            generatedMappings.push(mapping);\n            if (typeof mapping.originalLine === 'number') originalMappings.push(mapping);\n        }\n    }\n    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n    this.__generatedMappings = generatedMappings;\n    quickSort(originalMappings, util.compareByOriginalPositions);\n    this.__originalMappings = originalMappings;\n};\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */ BasicSourceMapConsumer.prototype._findMapping = function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName, aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n    if (aNeedle[aLineName] <= 0) throw new TypeError('Line must be greater than or equal to 1, got ' + aNeedle[aLineName]);\n    if (aNeedle[aColumnName] < 0) throw new TypeError('Column must be greater than or equal to 0, got ' + aNeedle[aColumnName]);\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n};\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */ BasicSourceMapConsumer.prototype.computeColumnSpans = function SourceMapConsumer_computeColumnSpans() {\n    for(var index = 0; index < this._generatedMappings.length; ++index){\n        var mapping = this._generatedMappings[index];\n        // Mappings do not contain a field for the last generated columnt. We\n        // can come up with an optimistic estimate, however, by assuming that\n        // mappings are contiguous (i.e. given two consecutive mappings, the\n        // first mapping ends where the second one starts).\n        if (index + 1 < this._generatedMappings.length) {\n            var nextMapping = this._generatedMappings[index + 1];\n            if (mapping.generatedLine === nextMapping.generatedLine) {\n                mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n                continue;\n            }\n        }\n        // The last mapping for each line spans the entire line.\n        mapping.lastGeneratedColumn = Infinity;\n    }\n};\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */ BasicSourceMapConsumer.prototype.originalPositionFor = function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n        generatedLine: util.getArg(aArgs, 'line'),\n        generatedColumn: util.getArg(aArgs, 'column')\n    };\n    var index = this._findMapping(needle, this._generatedMappings, \"generatedLine\", \"generatedColumn\", util.compareByGeneratedPositionsDeflated, util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND));\n    if (index >= 0) {\n        var mapping = this._generatedMappings[index];\n        if (mapping.generatedLine === needle.generatedLine) {\n            var source = util.getArg(mapping, 'source', null);\n            if (source !== null) {\n                source = this._sources.at(source);\n                source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n            }\n            var name = util.getArg(mapping, 'name', null);\n            if (name !== null) name = this._names.at(name);\n            return {\n                source: source,\n                line: util.getArg(mapping, 'originalLine', null),\n                column: util.getArg(mapping, 'originalColumn', null),\n                name: name\n            };\n        }\n    }\n    return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n    };\n};\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */ BasicSourceMapConsumer.prototype.hasContentsOfAllSources = function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) return false;\n    return this.sourcesContent.length >= this._sources.size() && !this.sourcesContent.some(function(sc) {\n        return sc == null;\n    });\n};\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */ BasicSourceMapConsumer.prototype.sourceContentFor = function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) return null;\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) return this.sourcesContent[index];\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) relativeSource = util.relative(this.sourceRoot, relativeSource);\n    var url;\n    if (this.sourceRoot != null && (url = util.urlParse(this.sourceRoot))) {\n        // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n        // many users. We can help them out when they expect file:// URIs to\n        // behave like it would if they were running a local HTTP server. See\n        // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n        var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n        if (url.scheme == \"file\" && this._sources.has(fileUriAbsPath)) return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];\n        if ((!url.path || url.path == \"/\") && this._sources.has(\"/\" + relativeSource)) return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n    }\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) return null;\n    else throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n};\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */ BasicSourceMapConsumer.prototype.generatedPositionFor = function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) return {\n        line: null,\n        column: null,\n        lastColumn: null\n    };\n    var needle = {\n        source: source,\n        originalLine: util.getArg(aArgs, 'line'),\n        originalColumn: util.getArg(aArgs, 'column')\n    };\n    var index = this._findMapping(needle, this._originalMappings, \"originalLine\", \"originalColumn\", util.compareByOriginalPositions, util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND));\n    if (index >= 0) {\n        var mapping = this._originalMappings[index];\n        if (mapping.source === needle.source) return {\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n    }\n    return {\n        line: null,\n        column: null,\n        lastColumn: null\n    };\n};\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */ function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n    var sourceMap = aSourceMap;\n    if (typeof aSourceMap === 'string') sourceMap = util.parseSourceMapInput(aSourceMap);\n    var version = util.getArg(sourceMap, 'version');\n    var sections = util.getArg(sourceMap, 'sections');\n    if (version != this._version) throw new Error('Unsupported version: ' + version);\n    this._sources = new ArraySet();\n    this._names = new ArraySet();\n    var lastOffset = {\n        line: -1,\n        column: 0\n    };\n    this._sections = sections.map(function(s) {\n        if (s.url) // The url field will require support for asynchronicity.\n        // See https://github.com/mozilla/source-map/issues/16\n        throw new Error('Support for url field in sections not implemented.');\n        var offset = util.getArg(s, 'offset');\n        var offsetLine = util.getArg(offset, 'line');\n        var offsetColumn = util.getArg(offset, 'column');\n        if (offsetLine < lastOffset.line || offsetLine === lastOffset.line && offsetColumn < lastOffset.column) throw new Error('Section offsets must be ordered and non-overlapping.');\n        lastOffset = offset;\n        return {\n            generatedOffset: {\n                // The offset fields are 0-based, but we use 1-based indices when\n                // encoding/decoding from VLQ.\n                generatedLine: offsetLine + 1,\n                generatedColumn: offsetColumn + 1\n            },\n            consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n        };\n    });\n}\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n/**\n * The version of the source mapping spec that we are consuming.\n */ IndexedSourceMapConsumer.prototype._version = 3;\n/**\n * The list of original sources.\n */ Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n    get: function() {\n        var sources = [];\n        for(var i = 0; i < this._sections.length; i++)for(var j = 0; j < this._sections[i].consumer.sources.length; j++)sources.push(this._sections[i].consumer.sources[j]);\n        return sources;\n    }\n});\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */ IndexedSourceMapConsumer.prototype.originalPositionFor = function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n        generatedLine: util.getArg(aArgs, 'line'),\n        generatedColumn: util.getArg(aArgs, 'column')\n    };\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections, function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) return cmp;\n        return needle.generatedColumn - section.generatedOffset.generatedColumn;\n    });\n    var section = this._sections[sectionIndex];\n    if (!section) return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n    };\n    return section.consumer.originalPositionFor({\n        line: needle.generatedLine - (section.generatedOffset.generatedLine - 1),\n        column: needle.generatedColumn - (section.generatedOffset.generatedLine === needle.generatedLine ? section.generatedOffset.generatedColumn - 1 : 0),\n        bias: aArgs.bias\n    });\n};\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */ IndexedSourceMapConsumer.prototype.hasContentsOfAllSources = function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function(s) {\n        return s.consumer.hasContentsOfAllSources();\n    });\n};\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */ IndexedSourceMapConsumer.prototype.sourceContentFor = function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for(var i = 0; i < this._sections.length; i++){\n        var section = this._sections[i];\n        var content = section.consumer.sourceContentFor(aSource, true);\n        if (content) return content;\n    }\n    if (nullOnMissing) return null;\n    else throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n};\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */ IndexedSourceMapConsumer.prototype.generatedPositionFor = function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for(var i = 0; i < this._sections.length; i++){\n        var section = this._sections[i];\n        // Only consider this section if the requested source is in the list of\n        // sources of the consumer.\n        if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) continue;\n        var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n        if (generatedPosition) {\n            var ret = {\n                line: generatedPosition.line + (section.generatedOffset.generatedLine - 1),\n                column: generatedPosition.column + (section.generatedOffset.generatedLine === generatedPosition.line ? section.generatedOffset.generatedColumn - 1 : 0)\n            };\n            return ret;\n        }\n    }\n    return {\n        line: null,\n        column: null\n    };\n};\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */ IndexedSourceMapConsumer.prototype._parseMappings = function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for(var i = 0; i < this._sections.length; i++){\n        var section = this._sections[i];\n        var sectionMappings = section.consumer._generatedMappings;\n        for(var j = 0; j < sectionMappings.length; j++){\n            var mapping = sectionMappings[j];\n            var source = section.consumer._sources.at(mapping.source);\n            source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n            this._sources.add(source);\n            source = this._sources.indexOf(source);\n            var name = null;\n            if (mapping.name) {\n                name = section.consumer._names.at(mapping.name);\n                this._names.add(name);\n                name = this._names.indexOf(name);\n            }\n            // The mappings coming from the consumer for the section have\n            // generated positions relative to the start of the section, so we\n            // need to offset them to be relative to the start of the concatenated\n            // generated file.\n            var adjustedMapping = {\n                source: source,\n                generatedLine: mapping.generatedLine + (section.generatedOffset.generatedLine - 1),\n                generatedColumn: mapping.generatedColumn + (section.generatedOffset.generatedLine === mapping.generatedLine ? section.generatedOffset.generatedColumn - 1 : 0),\n                originalLine: mapping.originalLine,\n                originalColumn: mapping.originalColumn,\n                name: name\n            };\n            this.__generatedMappings.push(adjustedMapping);\n            if (typeof adjustedMapping.originalLine === 'number') this.__originalMappings.push(adjustedMapping);\n        }\n    }\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n};\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n},{\"b22324b13f72201b\":\"lD9JL\",\"129ba2b16e81db9e\":\"4dQ6u\",\"832bf56bf6a231e4\":\"agOsa\",\"95d11d359ee56491\":\"hChUp\",\"7076e0beb1aa0cfd\":\"7YWtH\"}],\"4dQ6u\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ exports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n */ function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n    // This function terminates when one of the following is true:\n    //\n    //   1. We find the exact element we are looking for.\n    //\n    //   2. We did not find the exact element, but we can return the index of\n    //      the next-closest element.\n    //\n    //   3. We did not find the exact element, and there is no next-closest\n    //      element than the one we are searching for, so we return -1.\n    var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n    var cmp = aCompare(aNeedle, aHaystack[mid], true);\n    if (cmp === 0) // Found the element we are looking for.\n    return mid;\n    else if (cmp > 0) {\n        // Our needle is greater than aHaystack[mid].\n        if (aHigh - mid > 1) // The element is in the upper half.\n        return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n        // The exact needle element was not found in this haystack. Determine if\n        // we are in termination case (3) or (2) and return the appropriate thing.\n        if (aBias == exports.LEAST_UPPER_BOUND) return aHigh < aHaystack.length ? aHigh : -1;\n        else return mid;\n    } else {\n        // Our needle is less than aHaystack[mid].\n        if (mid - aLow > 1) // The element is in the lower half.\n        return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n        // we are in termination case (3) or (2) and return the appropriate thing.\n        if (aBias == exports.LEAST_UPPER_BOUND) return mid;\n        else return aLow < 0 ? -1 : aLow;\n    }\n}\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n *     array and returns -1, 0, or 1 depending on whether the needle is less\n *     than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */ exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n    if (aHaystack.length === 0) return -1;\n    var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack, aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n    if (index < 0) return -1;\n    // We have found either the exact element, or the next-closest element than\n    // the one we are searching for. However, there may be more than one such\n    // element. Make sure we always return the smallest of these.\n    while(index - 1 >= 0){\n        if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) break;\n        --index;\n    }\n    return index;\n};\n\n},{}],\"7YWtH\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ // It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n *        The array.\n * @param {Number} x\n *        The index of the first item.\n * @param {Number} y\n *        The index of the second item.\n */ function swap(ary, x, y) {\n    var temp = ary[x];\n    ary[x] = ary[y];\n    ary[y] = temp;\n}\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n *        The lower bound on the range.\n * @param {Number} high\n *        The upper bound on the range.\n */ function randomIntInRange(low, high) {\n    return Math.round(low + Math.random() * (high - low));\n}\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n * @param {Number} p\n *        Start index of the array\n * @param {Number} r\n *        End index of the array\n */ function doQuickSort(ary, comparator, p, r) {\n    // If our lower bound is less than our upper bound, we (1) partition the\n    // array into two pieces and (2) recurse on each half. If it is not, this is\n    // the empty array and our base case.\n    if (p < r) {\n        // (1) Partitioning.\n        //\n        // The partitioning chooses a pivot between `p` and `r` and moves all\n        // elements that are less than or equal to the pivot to the before it, and\n        // all the elements that are greater than it after it. The effect is that\n        // once partition is done, the pivot is in the exact place it will be when\n        // the array is put in sorted order, and it will not need to be moved\n        // again. This runs in O(n) time.\n        // Always choose a random pivot so that an input array which is reverse\n        // sorted does not cause O(n^2) running time.\n        var pivotIndex = randomIntInRange(p, r);\n        var i = p - 1;\n        swap(ary, pivotIndex, r);\n        var pivot = ary[r];\n        // Immediately after `j` is incremented in this loop, the following hold\n        // true:\n        //\n        //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n        //\n        //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n        for(var j = p; j < r; j++)if (comparator(ary[j], pivot) <= 0) {\n            i += 1;\n            swap(ary, i, j);\n        }\n        swap(ary, i + 1, j);\n        var q = i + 1;\n        // (2) Recurse on each half.\n        doQuickSort(ary, comparator, p, q - 1);\n        doQuickSort(ary, comparator, q + 1, r);\n    }\n}\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n */ exports.quickSort = function(ary, comparator) {\n    doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n},{}],\"iEM9Y\":[function(require,module,exports) {\n/* -*- Mode: js; js-indent-level: 2; -*- */ /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */ var SourceMapGenerator = require(\"a07d2c2c4b11c39f\").SourceMapGenerator;\nvar util = require(\"18d5ff036a08fa06\");\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */ function SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n    this.children = [];\n    this.sourceContents = {};\n    this.line = aLine == null ? null : aLine;\n    this.column = aColumn == null ? null : aColumn;\n    this.source = aSource == null ? null : aSource;\n    this.name = aName == null ? null : aName;\n    this[isSourceNode] = true;\n    if (aChunks != null) this.add(aChunks);\n}\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */ SourceNode.fromStringWithSourceMap = function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n        var lineContents = getNextLine();\n        // The last line of a file might not have a newline.\n        var newLine = getNextLine() || \"\";\n        return lineContents + newLine;\n        function getNextLine() {\n            return remainingLinesIndex < remainingLines.length ? remainingLines[remainingLinesIndex++] : undefined;\n        }\n    };\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n    aSourceMapConsumer.eachMapping(function(mapping) {\n        if (lastMapping !== null) {\n            // We add the code from \"lastMapping\" to \"mapping\":\n            // First check if there is a new line in between.\n            if (lastGeneratedLine < mapping.generatedLine) {\n                // Associate first line with \"lastMapping\"\n                addMappingWithCode(lastMapping, shiftNextLine());\n                lastGeneratedLine++;\n                lastGeneratedColumn = 0;\n            // The remaining code is added without mapping\n            } else {\n                // There is no new line in between.\n                // Associate the code between \"lastGeneratedColumn\" and\n                // \"mapping.generatedColumn\" with \"lastMapping\"\n                var nextLine = remainingLines[remainingLinesIndex] || '';\n                var code = nextLine.substr(0, mapping.generatedColumn - lastGeneratedColumn);\n                remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn - lastGeneratedColumn);\n                lastGeneratedColumn = mapping.generatedColumn;\n                addMappingWithCode(lastMapping, code);\n                // No more remaining code, continue\n                lastMapping = mapping;\n                return;\n            }\n        }\n        // We add the generated code until the first mapping\n        // to the SourceNode without any mapping.\n        // Each line is added as separate string.\n        while(lastGeneratedLine < mapping.generatedLine){\n            node.add(shiftNextLine());\n            lastGeneratedLine++;\n        }\n        if (lastGeneratedColumn < mapping.generatedColumn) {\n            var nextLine = remainingLines[remainingLinesIndex] || '';\n            node.add(nextLine.substr(0, mapping.generatedColumn));\n            remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n            lastGeneratedColumn = mapping.generatedColumn;\n        }\n        lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n        if (lastMapping) // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n        // and add the remaining lines without any mapping\n        node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function(sourceFile) {\n        var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n        if (content != null) {\n            if (aRelativePath != null) sourceFile = util.join(aRelativePath, sourceFile);\n            node.setSourceContent(sourceFile, content);\n        }\n    });\n    return node;\n    function addMappingWithCode(mapping, code) {\n        if (mapping === null || mapping.source === undefined) node.add(code);\n        else {\n            var source = aRelativePath ? util.join(aRelativePath, mapping.source) : mapping.source;\n            node.add(new SourceNode(mapping.originalLine, mapping.originalColumn, source, code, mapping.name));\n        }\n    }\n};\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */ SourceNode.prototype.add = function SourceNode_add(aChunk) {\n    if (Array.isArray(aChunk)) aChunk.forEach(function(chunk) {\n        this.add(chunk);\n    }, this);\n    else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n        if (aChunk) this.children.push(aChunk);\n    } else throw new TypeError(\"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk);\n    return this;\n};\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */ SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n    if (Array.isArray(aChunk)) for(var i = aChunk.length - 1; i >= 0; i--)this.prepend(aChunk[i]);\n    else if (aChunk[isSourceNode] || typeof aChunk === \"string\") this.children.unshift(aChunk);\n    else throw new TypeError(\"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk);\n    return this;\n};\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */ SourceNode.prototype.walk = function SourceNode_walk(aFn) {\n    var chunk;\n    for(var i = 0, len = this.children.length; i < len; i++){\n        chunk = this.children[i];\n        if (chunk[isSourceNode]) chunk.walk(aFn);\n        else if (chunk !== '') aFn(chunk, {\n            source: this.source,\n            line: this.line,\n            column: this.column,\n            name: this.name\n        });\n    }\n};\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */ SourceNode.prototype.join = function SourceNode_join(aSep) {\n    var newChildren;\n    var i;\n    var len = this.children.length;\n    if (len > 0) {\n        newChildren = [];\n        for(i = 0; i < len - 1; i++){\n            newChildren.push(this.children[i]);\n            newChildren.push(aSep);\n        }\n        newChildren.push(this.children[i]);\n        this.children = newChildren;\n    }\n    return this;\n};\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */ SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n    var lastChild = this.children[this.children.length - 1];\n    if (lastChild[isSourceNode]) lastChild.replaceRight(aPattern, aReplacement);\n    else if (typeof lastChild === 'string') this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n    else this.children.push(''.replace(aPattern, aReplacement));\n    return this;\n};\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */ SourceNode.prototype.setSourceContent = function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n};\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */ SourceNode.prototype.walkSourceContents = function SourceNode_walkSourceContents(aFn) {\n    for(var i = 0, len = this.children.length; i < len; i++)if (this.children[i][isSourceNode]) this.children[i].walkSourceContents(aFn);\n    var sources = Object.keys(this.sourceContents);\n    for(var i = 0, len = sources.length; i < len; i++)aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n};\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */ SourceNode.prototype.toString = function SourceNode_toString() {\n    var str = \"\";\n    this.walk(function(chunk) {\n        str += chunk;\n    });\n    return str;\n};\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */ SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n    var generated = {\n        code: \"\",\n        line: 1,\n        column: 0\n    };\n    var map = new SourceMapGenerator(aArgs);\n    var sourceMappingActive = false;\n    var lastOriginalSource = null;\n    var lastOriginalLine = null;\n    var lastOriginalColumn = null;\n    var lastOriginalName = null;\n    this.walk(function(chunk, original) {\n        generated.code += chunk;\n        if (original.source !== null && original.line !== null && original.column !== null) {\n            if (lastOriginalSource !== original.source || lastOriginalLine !== original.line || lastOriginalColumn !== original.column || lastOriginalName !== original.name) map.addMapping({\n                source: original.source,\n                original: {\n                    line: original.line,\n                    column: original.column\n                },\n                generated: {\n                    line: generated.line,\n                    column: generated.column\n                },\n                name: original.name\n            });\n            lastOriginalSource = original.source;\n            lastOriginalLine = original.line;\n            lastOriginalColumn = original.column;\n            lastOriginalName = original.name;\n            sourceMappingActive = true;\n        } else if (sourceMappingActive) {\n            map.addMapping({\n                generated: {\n                    line: generated.line,\n                    column: generated.column\n                }\n            });\n            lastOriginalSource = null;\n            sourceMappingActive = false;\n        }\n        for(var idx = 0, length = chunk.length; idx < length; idx++)if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n            generated.line++;\n            generated.column = 0;\n            // Mappings end at eol\n            if (idx + 1 === length) {\n                lastOriginalSource = null;\n                sourceMappingActive = false;\n            } else if (sourceMappingActive) map.addMapping({\n                source: original.source,\n                original: {\n                    line: original.line,\n                    column: original.column\n                },\n                generated: {\n                    line: generated.line,\n                    column: generated.column\n                },\n                name: original.name\n            });\n        } else generated.column++;\n    });\n    this.walkSourceContents(function(sourceFile, sourceContent) {\n        map.setSourceContent(sourceFile, sourceContent);\n    });\n    return {\n        code: generated.code,\n        map: map\n    };\n};\nexports.SourceNode = SourceNode;\n\n},{\"a07d2c2c4b11c39f\":\"8kYuK\",\"18d5ff036a08fa06\":\"lD9JL\"}],\"hL24S\":[function(require,module,exports) {\nmodule.exports = JSON.parse(\"{\\\"name\\\":\\\"escodegen\\\",\\\"description\\\":\\\"ECMAScript code generator\\\",\\\"homepage\\\":\\\"http://github.com/estools/escodegen\\\",\\\"main\\\":\\\"escodegen.js\\\",\\\"bin\\\":{\\\"esgenerate\\\":\\\"./bin/esgenerate.js\\\",\\\"escodegen\\\":\\\"./bin/escodegen.js\\\"},\\\"files\\\":[\\\"LICENSE.BSD\\\",\\\"README.md\\\",\\\"bin\\\",\\\"escodegen.js\\\",\\\"package.json\\\"],\\\"version\\\":\\\"2.1.0\\\",\\\"engines\\\":{\\\"node\\\":\\\">=6.0\\\"},\\\"maintainers\\\":[{\\\"name\\\":\\\"Yusuke Suzuki\\\",\\\"email\\\":\\\"utatane.tea@gmail.com\\\",\\\"web\\\":\\\"http://github.com/Constellation\\\"}],\\\"repository\\\":{\\\"type\\\":\\\"git\\\",\\\"url\\\":\\\"http://github.com/estools/escodegen.git\\\"},\\\"dependencies\\\":{\\\"estraverse\\\":\\\"^5.2.0\\\",\\\"esutils\\\":\\\"^2.0.2\\\",\\\"esprima\\\":\\\"^4.0.1\\\"},\\\"optionalDependencies\\\":{\\\"source-map\\\":\\\"~0.6.1\\\"},\\\"devDependencies\\\":{\\\"acorn\\\":\\\"^8.0.4\\\",\\\"bluebird\\\":\\\"^3.4.7\\\",\\\"bower-registry-client\\\":\\\"^1.0.0\\\",\\\"chai\\\":\\\"^4.2.0\\\",\\\"chai-exclude\\\":\\\"^2.0.2\\\",\\\"commonjs-everywhere\\\":\\\"^0.9.7\\\",\\\"gulp\\\":\\\"^4.0.2\\\",\\\"gulp-eslint\\\":\\\"^6.0.0\\\",\\\"gulp-mocha\\\":\\\"^7.0.2\\\",\\\"minimist\\\":\\\"^1.2.5\\\",\\\"optionator\\\":\\\"^0.9.1\\\",\\\"semver\\\":\\\"^7.3.4\\\"},\\\"license\\\":\\\"BSD-2-Clause\\\",\\\"scripts\\\":{\\\"test\\\":\\\"gulp travis\\\",\\\"unit-test\\\":\\\"gulp test\\\",\\\"lint\\\":\\\"gulp lint\\\",\\\"release\\\":\\\"node tools/release.js\\\",\\\"build-min\\\":\\\"./node_modules/.bin/cjsify -ma path: tools/entry-point.js > escodegen.browser.min.js\\\",\\\"build\\\":\\\"./node_modules/.bin/cjsify -a path: tools/entry-point.js > escodegen.browser.js\\\"}}\");\n\n},{}],\"awzSd\":[function(require,module,exports) {\n// Reserved word lists for various dialects of the language\nvar parcelHelpers = require(\"@parcel/transformer-js/src/esmodule-helpers.js\");\nparcelHelpers.defineInteropFlag(exports);\nparcelHelpers.export(exports, \"Node\", ()=>Node);\nparcelHelpers.export(exports, \"Parser\", ()=>Parser);\nparcelHelpers.export(exports, \"Position\", ()=>Position);\nparcelHelpers.export(exports, \"SourceLocation\", ()=>SourceLocation);\nparcelHelpers.export(exports, \"TokContext\", ()=>TokContext);\nparcelHelpers.export(exports, \"Token\", ()=>Token);\nparcelHelpers.export(exports, \"TokenType\", ()=>TokenType);\nparcelHelpers.export(exports, \"defaultOptions\", ()=>defaultOptions);\nparcelHelpers.export(exports, \"getLineInfo\", ()=>getLineInfo);\nparcelHelpers.export(exports, \"isIdentifierChar\", ()=>isIdentifierChar);\nparcelHelpers.export(exports, \"isIdentifierStart\", ()=>isIdentifierStart);\nparcelHelpers.export(exports, \"isNewLine\", ()=>isNewLine);\nparcelHelpers.export(exports, \"keywordTypes\", ()=>keywords$1);\nparcelHelpers.export(exports, \"lineBreak\", ()=>lineBreak);\nparcelHelpers.export(exports, \"lineBreakG\", ()=>lineBreakG);\nparcelHelpers.export(exports, \"nonASCIIwhitespace\", ()=>nonASCIIwhitespace);\nparcelHelpers.export(exports, \"parse\", ()=>parse);\nparcelHelpers.export(exports, \"parseExpressionAt\", ()=>parseExpressionAt);\nparcelHelpers.export(exports, \"tokContexts\", ()=>types$1);\nparcelHelpers.export(exports, \"tokTypes\", ()=>types);\nparcelHelpers.export(exports, \"tokenizer\", ()=>tokenizer);\nparcelHelpers.export(exports, \"version\", ()=>version);\nvar reservedWords = {\n    3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n    5: \"class enum extends super const export import\",\n    6: \"enum\",\n    strict: \"implements interface let package private protected public static yield\",\n    strictBind: \"eval arguments\"\n};\n// And the keywords\nvar ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\";\nvar keywords = {\n    5: ecma5AndLessKeywords,\n    \"5module\": ecma5AndLessKeywords + \" export import\",\n    6: ecma5AndLessKeywords + \" const class extends export import super\"\n};\nvar keywordRelationalOperator = /^in(stanceof)?$/;\n// ## Character categories\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point above 128.\n// Generated by `bin/generate-identifier-regex.js`.\nvar nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u08a0-\\u08b4\\u08b6-\\u08c7\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u170c\\u170e-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4b\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2c2e\\u2c30-\\u2c5e\\u2c60-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\u9ffc\\ua000-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7bf\\ua7c2-\\ua7ca\\ua7f5-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\nvar nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u08d3-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u1810-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf\\u1ac0\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1df9\\u1dfb-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\";\nvar nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\");\nvar nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\");\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null;\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by bin/generate-identifier-regex.js\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierStartCodes = [\n    0,\n    11,\n    2,\n    25,\n    2,\n    18,\n    2,\n    1,\n    2,\n    14,\n    3,\n    13,\n    35,\n    122,\n    70,\n    52,\n    268,\n    28,\n    4,\n    48,\n    48,\n    31,\n    14,\n    29,\n    6,\n    37,\n    11,\n    29,\n    3,\n    35,\n    5,\n    7,\n    2,\n    4,\n    43,\n    157,\n    19,\n    35,\n    5,\n    35,\n    5,\n    39,\n    9,\n    51,\n    157,\n    310,\n    10,\n    21,\n    11,\n    7,\n    153,\n    5,\n    3,\n    0,\n    2,\n    43,\n    2,\n    1,\n    4,\n    0,\n    3,\n    22,\n    11,\n    22,\n    10,\n    30,\n    66,\n    18,\n    2,\n    1,\n    11,\n    21,\n    11,\n    25,\n    71,\n    55,\n    7,\n    1,\n    65,\n    0,\n    16,\n    3,\n    2,\n    2,\n    2,\n    28,\n    43,\n    28,\n    4,\n    28,\n    36,\n    7,\n    2,\n    27,\n    28,\n    53,\n    11,\n    21,\n    11,\n    18,\n    14,\n    17,\n    111,\n    72,\n    56,\n    50,\n    14,\n    50,\n    14,\n    35,\n    349,\n    41,\n    7,\n    1,\n    79,\n    28,\n    11,\n    0,\n    9,\n    21,\n    107,\n    20,\n    28,\n    22,\n    13,\n    52,\n    76,\n    44,\n    33,\n    24,\n    27,\n    35,\n    30,\n    0,\n    3,\n    0,\n    9,\n    34,\n    4,\n    0,\n    13,\n    47,\n    15,\n    3,\n    22,\n    0,\n    2,\n    0,\n    36,\n    17,\n    2,\n    24,\n    85,\n    6,\n    2,\n    0,\n    2,\n    3,\n    2,\n    14,\n    2,\n    9,\n    8,\n    46,\n    39,\n    7,\n    3,\n    1,\n    3,\n    21,\n    2,\n    6,\n    2,\n    1,\n    2,\n    4,\n    4,\n    0,\n    19,\n    0,\n    13,\n    4,\n    159,\n    52,\n    19,\n    3,\n    21,\n    2,\n    31,\n    47,\n    21,\n    1,\n    2,\n    0,\n    185,\n    46,\n    42,\n    3,\n    37,\n    47,\n    21,\n    0,\n    60,\n    42,\n    14,\n    0,\n    72,\n    26,\n    230,\n    43,\n    117,\n    63,\n    32,\n    7,\n    3,\n    0,\n    3,\n    7,\n    2,\n    1,\n    2,\n    23,\n    16,\n    0,\n    2,\n    0,\n    95,\n    7,\n    3,\n    38,\n    17,\n    0,\n    2,\n    0,\n    29,\n    0,\n    11,\n    39,\n    8,\n    0,\n    22,\n    0,\n    12,\n    45,\n    20,\n    0,\n    35,\n    56,\n    264,\n    8,\n    2,\n    36,\n    18,\n    0,\n    50,\n    29,\n    113,\n    6,\n    2,\n    1,\n    2,\n    37,\n    22,\n    0,\n    26,\n    5,\n    2,\n    1,\n    2,\n    31,\n    15,\n    0,\n    328,\n    18,\n    190,\n    0,\n    80,\n    921,\n    103,\n    110,\n    18,\n    195,\n    2749,\n    1070,\n    4050,\n    582,\n    8634,\n    568,\n    8,\n    30,\n    114,\n    29,\n    19,\n    47,\n    17,\n    3,\n    32,\n    20,\n    6,\n    18,\n    689,\n    63,\n    129,\n    74,\n    6,\n    0,\n    67,\n    12,\n    65,\n    1,\n    2,\n    0,\n    29,\n    6135,\n    9,\n    1237,\n    43,\n    8,\n    8952,\n    286,\n    50,\n    2,\n    18,\n    3,\n    9,\n    395,\n    2309,\n    106,\n    6,\n    12,\n    4,\n    8,\n    8,\n    9,\n    5991,\n    84,\n    2,\n    70,\n    2,\n    1,\n    3,\n    0,\n    3,\n    1,\n    3,\n    3,\n    2,\n    11,\n    2,\n    0,\n    2,\n    6,\n    2,\n    64,\n    2,\n    3,\n    3,\n    7,\n    2,\n    6,\n    2,\n    27,\n    2,\n    3,\n    2,\n    4,\n    2,\n    0,\n    4,\n    6,\n    2,\n    339,\n    3,\n    24,\n    2,\n    24,\n    2,\n    30,\n    2,\n    24,\n    2,\n    30,\n    2,\n    24,\n    2,\n    30,\n    2,\n    24,\n    2,\n    30,\n    2,\n    24,\n    2,\n    7,\n    2357,\n    44,\n    11,\n    6,\n    17,\n    0,\n    370,\n    43,\n    1301,\n    196,\n    60,\n    67,\n    8,\n    0,\n    1205,\n    3,\n    2,\n    26,\n    2,\n    1,\n    2,\n    0,\n    3,\n    0,\n    2,\n    9,\n    2,\n    3,\n    2,\n    0,\n    2,\n    0,\n    7,\n    0,\n    5,\n    0,\n    2,\n    0,\n    2,\n    0,\n    2,\n    2,\n    2,\n    1,\n    2,\n    0,\n    3,\n    0,\n    2,\n    0,\n    2,\n    0,\n    2,\n    0,\n    2,\n    0,\n    2,\n    1,\n    2,\n    0,\n    3,\n    3,\n    2,\n    6,\n    2,\n    3,\n    2,\n    3,\n    2,\n    0,\n    2,\n    9,\n    2,\n    16,\n    6,\n    2,\n    2,\n    4,\n    2,\n    16,\n    4421,\n    42717,\n    35,\n    4148,\n    12,\n    221,\n    3,\n    5761,\n    15,\n    7472,\n    3104,\n    541,\n    1507,\n    4938\n];\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierCodes = [\n    509,\n    0,\n    227,\n    0,\n    150,\n    4,\n    294,\n    9,\n    1368,\n    2,\n    2,\n    1,\n    6,\n    3,\n    41,\n    2,\n    5,\n    0,\n    166,\n    1,\n    574,\n    3,\n    9,\n    9,\n    370,\n    1,\n    154,\n    10,\n    176,\n    2,\n    54,\n    14,\n    32,\n    9,\n    16,\n    3,\n    46,\n    10,\n    54,\n    9,\n    7,\n    2,\n    37,\n    13,\n    2,\n    9,\n    6,\n    1,\n    45,\n    0,\n    13,\n    2,\n    49,\n    13,\n    9,\n    3,\n    2,\n    11,\n    83,\n    11,\n    7,\n    0,\n    161,\n    11,\n    6,\n    9,\n    7,\n    3,\n    56,\n    1,\n    2,\n    6,\n    3,\n    1,\n    3,\n    2,\n    10,\n    0,\n    11,\n    1,\n    3,\n    6,\n    4,\n    4,\n    193,\n    17,\n    10,\n    9,\n    5,\n    0,\n    82,\n    19,\n    13,\n    9,\n    214,\n    6,\n    3,\n    8,\n    28,\n    1,\n    83,\n    16,\n    16,\n    9,\n    82,\n    12,\n    9,\n    9,\n    84,\n    14,\n    5,\n    9,\n    243,\n    14,\n    166,\n    9,\n    71,\n    5,\n    2,\n    1,\n    3,\n    3,\n    2,\n    0,\n    2,\n    1,\n    13,\n    9,\n    120,\n    6,\n    3,\n    6,\n    4,\n    0,\n    29,\n    9,\n    41,\n    6,\n    2,\n    3,\n    9,\n    0,\n    10,\n    10,\n    47,\n    15,\n    406,\n    7,\n    2,\n    7,\n    17,\n    9,\n    57,\n    21,\n    2,\n    13,\n    123,\n    5,\n    4,\n    0,\n    2,\n    1,\n    2,\n    6,\n    2,\n    0,\n    9,\n    9,\n    49,\n    4,\n    2,\n    1,\n    2,\n    4,\n    9,\n    9,\n    330,\n    3,\n    19306,\n    9,\n    135,\n    4,\n    60,\n    6,\n    26,\n    9,\n    1014,\n    0,\n    2,\n    54,\n    8,\n    3,\n    82,\n    0,\n    12,\n    1,\n    19628,\n    1,\n    5319,\n    4,\n    4,\n    5,\n    9,\n    7,\n    3,\n    6,\n    31,\n    3,\n    149,\n    2,\n    1418,\n    49,\n    513,\n    54,\n    5,\n    49,\n    9,\n    0,\n    15,\n    0,\n    23,\n    4,\n    2,\n    14,\n    1361,\n    6,\n    2,\n    16,\n    3,\n    6,\n    2,\n    1,\n    2,\n    4,\n    262,\n    6,\n    10,\n    9,\n    419,\n    13,\n    1495,\n    6,\n    110,\n    6,\n    6,\n    9,\n    4759,\n    9,\n    787719,\n    239\n];\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n    var pos = 0x10000;\n    for(var i = 0; i < set.length; i += 2){\n        pos += set[i];\n        if (pos > code) return false;\n        pos += set[i + 1];\n        if (pos >= code) return true;\n    }\n}\n// Test whether a given character code starts an identifier.\nfunction isIdentifierStart(code, astral) {\n    if (code < 65) return code === 36;\n    if (code < 91) return true;\n    if (code < 97) return code === 95;\n    if (code < 123) return true;\n    if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code));\n    if (astral === false) return false;\n    return isInAstralSet(code, astralIdentifierStartCodes);\n}\n// Test whether a given character is part of an identifier.\nfunction isIdentifierChar(code, astral) {\n    if (code < 48) return code === 36;\n    if (code < 58) return true;\n    if (code < 65) return false;\n    if (code < 91) return true;\n    if (code < 97) return code === 95;\n    if (code < 123) return true;\n    if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code));\n    if (astral === false) return false;\n    return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes);\n}\n// ## Token types\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\nvar TokenType = function TokenType(label, conf) {\n    if (conf === void 0) conf = {};\n    this.label = label;\n    this.keyword = conf.keyword;\n    this.beforeExpr = !!conf.beforeExpr;\n    this.startsExpr = !!conf.startsExpr;\n    this.isLoop = !!conf.isLoop;\n    this.isAssign = !!conf.isAssign;\n    this.prefix = !!conf.prefix;\n    this.postfix = !!conf.postfix;\n    this.binop = conf.binop || null;\n    this.updateContext = null;\n};\nfunction binop(name, prec) {\n    return new TokenType(name, {\n        beforeExpr: true,\n        binop: prec\n    });\n}\nvar beforeExpr = {\n    beforeExpr: true\n}, startsExpr = {\n    startsExpr: true\n};\n// Map keyword names to token types.\nvar keywords$1 = {};\n// Succinct definitions of keyword token types\nfunction kw(name, options) {\n    if (options === void 0) options = {};\n    options.keyword = name;\n    return keywords$1[name] = new TokenType(name, options);\n}\nvar types = {\n    num: new TokenType(\"num\", startsExpr),\n    regexp: new TokenType(\"regexp\", startsExpr),\n    string: new TokenType(\"string\", startsExpr),\n    name: new TokenType(\"name\", startsExpr),\n    eof: new TokenType(\"eof\"),\n    // Punctuation token types.\n    bracketL: new TokenType(\"[\", {\n        beforeExpr: true,\n        startsExpr: true\n    }),\n    bracketR: new TokenType(\"]\"),\n    braceL: new TokenType(\"{\", {\n        beforeExpr: true,\n        startsExpr: true\n    }),\n    braceR: new TokenType(\"}\"),\n    parenL: new TokenType(\"(\", {\n        beforeExpr: true,\n        startsExpr: true\n    }),\n    parenR: new TokenType(\")\"),\n    comma: new TokenType(\",\", beforeExpr),\n    semi: new TokenType(\";\", beforeExpr),\n    colon: new TokenType(\":\", beforeExpr),\n    dot: new TokenType(\".\"),\n    question: new TokenType(\"?\", beforeExpr),\n    questionDot: new TokenType(\"?.\"),\n    arrow: new TokenType(\"=>\", beforeExpr),\n    template: new TokenType(\"template\"),\n    invalidTemplate: new TokenType(\"invalidTemplate\"),\n    ellipsis: new TokenType(\"...\", beforeExpr),\n    backQuote: new TokenType(\"`\", startsExpr),\n    dollarBraceL: new TokenType(\"${\", {\n        beforeExpr: true,\n        startsExpr: true\n    }),\n    // Operators. These carry several kinds of properties to help the\n    // parser use them properly (the presence of these properties is\n    // what categorizes them as operators).\n    //\n    // `binop`, when present, specifies that this operator is a binary\n    // operator, and will refer to its precedence.\n    //\n    // `prefix` and `postfix` mark the operator as a prefix or postfix\n    // unary operator.\n    //\n    // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n    // binary operators with a very low precedence, that should result\n    // in AssignmentExpression nodes.\n    eq: new TokenType(\"=\", {\n        beforeExpr: true,\n        isAssign: true\n    }),\n    assign: new TokenType(\"_=\", {\n        beforeExpr: true,\n        isAssign: true\n    }),\n    incDec: new TokenType(\"++/--\", {\n        prefix: true,\n        postfix: true,\n        startsExpr: true\n    }),\n    prefix: new TokenType(\"!/~\", {\n        beforeExpr: true,\n        prefix: true,\n        startsExpr: true\n    }),\n    logicalOR: binop(\"||\", 1),\n    logicalAND: binop(\"&&\", 2),\n    bitwiseOR: binop(\"|\", 3),\n    bitwiseXOR: binop(\"^\", 4),\n    bitwiseAND: binop(\"&\", 5),\n    equality: binop(\"==/!=/===/!==\", 6),\n    relational: binop(\"</>/<=/>=\", 7),\n    bitShift: binop(\"<</>>/>>>\", 8),\n    plusMin: new TokenType(\"+/-\", {\n        beforeExpr: true,\n        binop: 9,\n        prefix: true,\n        startsExpr: true\n    }),\n    modulo: binop(\"%\", 10),\n    star: binop(\"*\", 10),\n    slash: binop(\"/\", 10),\n    starstar: new TokenType(\"**\", {\n        beforeExpr: true\n    }),\n    coalesce: binop(\"??\", 1),\n    // Keyword token types.\n    _break: kw(\"break\"),\n    _case: kw(\"case\", beforeExpr),\n    _catch: kw(\"catch\"),\n    _continue: kw(\"continue\"),\n    _debugger: kw(\"debugger\"),\n    _default: kw(\"default\", beforeExpr),\n    _do: kw(\"do\", {\n        isLoop: true,\n        beforeExpr: true\n    }),\n    _else: kw(\"else\", beforeExpr),\n    _finally: kw(\"finally\"),\n    _for: kw(\"for\", {\n        isLoop: true\n    }),\n    _function: kw(\"function\", startsExpr),\n    _if: kw(\"if\"),\n    _return: kw(\"return\", beforeExpr),\n    _switch: kw(\"switch\"),\n    _throw: kw(\"throw\", beforeExpr),\n    _try: kw(\"try\"),\n    _var: kw(\"var\"),\n    _const: kw(\"const\"),\n    _while: kw(\"while\", {\n        isLoop: true\n    }),\n    _with: kw(\"with\"),\n    _new: kw(\"new\", {\n        beforeExpr: true,\n        startsExpr: true\n    }),\n    _this: kw(\"this\", startsExpr),\n    _super: kw(\"super\", startsExpr),\n    _class: kw(\"class\", startsExpr),\n    _extends: kw(\"extends\", beforeExpr),\n    _export: kw(\"export\"),\n    _import: kw(\"import\", startsExpr),\n    _null: kw(\"null\", startsExpr),\n    _true: kw(\"true\", startsExpr),\n    _false: kw(\"false\", startsExpr),\n    _in: kw(\"in\", {\n        beforeExpr: true,\n        binop: 7\n    }),\n    _instanceof: kw(\"instanceof\", {\n        beforeExpr: true,\n        binop: 7\n    }),\n    _typeof: kw(\"typeof\", {\n        beforeExpr: true,\n        prefix: true,\n        startsExpr: true\n    }),\n    _void: kw(\"void\", {\n        beforeExpr: true,\n        prefix: true,\n        startsExpr: true\n    }),\n    _delete: kw(\"delete\", {\n        beforeExpr: true,\n        prefix: true,\n        startsExpr: true\n    })\n};\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\nvar lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/;\nvar lineBreakG = new RegExp(lineBreak.source, \"g\");\nfunction isNewLine(code, ecma2019String) {\n    return code === 10 || code === 13 || !ecma2019String && (code === 0x2028 || code === 0x2029);\n}\nvar nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/;\nvar skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\nvar ref = Object.prototype;\nvar hasOwnProperty = ref.hasOwnProperty;\nvar toString = ref.toString;\n// Checks if an object has a property.\nfunction has(obj, propName) {\n    return hasOwnProperty.call(obj, propName);\n}\nvar isArray = Array.isArray || function(obj) {\n    return toString.call(obj) === \"[object Array]\";\n};\nfunction wordsRegexp(words) {\n    return new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\");\n}\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\nvar Position = function Position(line, col) {\n    this.line = line;\n    this.column = col;\n};\nPosition.prototype.offset = function offset(n) {\n    return new Position(this.line, this.column + n);\n};\nvar SourceLocation = function SourceLocation(p, start, end) {\n    this.start = start;\n    this.end = end;\n    if (p.sourceFile !== null) this.source = p.sourceFile;\n};\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\nfunction getLineInfo(input, offset) {\n    for(var line = 1, cur = 0;;){\n        lineBreakG.lastIndex = cur;\n        var match = lineBreakG.exec(input);\n        if (match && match.index < offset) {\n            ++line;\n            cur = match.index + match[0].length;\n        } else return new Position(line, offset - cur);\n    }\n}\n// A second optional argument can be given to further configure\n// the parser process. These options are recognized:\nvar defaultOptions = {\n    // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n    // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10\n    // (2019). This influences support for strict mode, the set of\n    // reserved words, and support for new syntax features. The default\n    // is 10.\n    ecmaVersion: 10,\n    // `sourceType` indicates the mode the code should be parsed in.\n    // Can be either `\"script\"` or `\"module\"`. This influences global\n    // strict mode and parsing of `import` and `export` declarations.\n    sourceType: \"script\",\n    // `onInsertedSemicolon` can be a callback that will be called\n    // when a semicolon is automatically inserted. It will be passed\n    // the position of the comma as an offset, and if `locations` is\n    // enabled, it is given the location as a `{line, column}` object\n    // as second argument.\n    onInsertedSemicolon: null,\n    // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n    // trailing commas.\n    onTrailingComma: null,\n    // By default, reserved words are only enforced if ecmaVersion >= 5.\n    // Set `allowReserved` to a boolean value to explicitly turn this on\n    // an off. When this option has the value \"never\", reserved words\n    // and keywords can also not be used as property names.\n    allowReserved: null,\n    // When enabled, a return at the top level is not considered an\n    // error.\n    allowReturnOutsideFunction: false,\n    // When enabled, import/export statements are not constrained to\n    // appearing at the top of the program.\n    allowImportExportEverywhere: false,\n    // When enabled, await identifiers are allowed to appear at the top-level scope,\n    // but they are still not allowed in non-async functions.\n    allowAwaitOutsideFunction: false,\n    // When enabled, hashbang directive in the beginning of file\n    // is allowed and treated as a line comment.\n    allowHashBang: false,\n    // When `locations` is on, `loc` properties holding objects with\n    // `start` and `end` properties in `{line, column}` form (with\n    // line being 1-based and column 0-based) will be attached to the\n    // nodes.\n    locations: false,\n    // A function can be passed as `onToken` option, which will\n    // cause Acorn to call that function with object in the same\n    // format as tokens returned from `tokenizer().getToken()`. Note\n    // that you are not allowed to call the parser from the\n    // callback—that will corrupt its internal state.\n    onToken: null,\n    // A function can be passed as `onComment` option, which will\n    // cause Acorn to call that function with `(block, text, start,\n    // end)` parameters whenever a comment is skipped. `block` is a\n    // boolean indicating whether this is a block (`/* */`) comment,\n    // `text` is the content of the comment, and `start` and `end` are\n    // character offsets that denote the start and end of the comment.\n    // When the `locations` option is on, two more parameters are\n    // passed, the full `{line, column}` locations of the start and\n    // end of the comments. Note that you are not allowed to call the\n    // parser from the callback—that will corrupt its internal state.\n    onComment: null,\n    // Nodes have their start and end characters offsets recorded in\n    // `start` and `end` properties (directly on the node, rather than\n    // the `loc` object, which holds line/column data. To also add a\n    // [semi-standardized][range] `range` property holding a `[start,\n    // end]` array with the same numbers, set the `ranges` option to\n    // `true`.\n    //\n    // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n    ranges: false,\n    // It is possible to parse multiple files into a single AST by\n    // passing the tree produced by parsing the first file as\n    // `program` option in subsequent parses. This will add the\n    // toplevel forms of the parsed file to the `Program` (top) node\n    // of an existing parse tree.\n    program: null,\n    // When `locations` is on, you can pass this to record the source\n    // file in every node's `loc` object.\n    sourceFile: null,\n    // This value, if given, is stored in every node, whether\n    // `locations` is on or off.\n    directSourceFile: null,\n    // When enabled, parenthesized expressions are represented by\n    // (non-standard) ParenthesizedExpression nodes\n    preserveParens: false\n};\n// Interpret and default an options object\nfunction getOptions(opts) {\n    var options = {};\n    for(var opt in defaultOptions)options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt];\n    if (options.ecmaVersion >= 2015) options.ecmaVersion -= 2009;\n    if (options.allowReserved == null) options.allowReserved = options.ecmaVersion < 5;\n    if (isArray(options.onToken)) {\n        var tokens = options.onToken;\n        options.onToken = function(token) {\n            return tokens.push(token);\n        };\n    }\n    if (isArray(options.onComment)) options.onComment = pushComment(options, options.onComment);\n    return options;\n}\nfunction pushComment(options, array) {\n    return function(block, text, start, end, startLoc, endLoc) {\n        var comment = {\n            type: block ? \"Block\" : \"Line\",\n            value: text,\n            start: start,\n            end: end\n        };\n        if (options.locations) comment.loc = new SourceLocation(this, startLoc, endLoc);\n        if (options.ranges) comment.range = [\n            start,\n            end\n        ];\n        array.push(comment);\n    };\n}\n// Each scope gets a bitset that may contain these flags\nvar SCOPE_TOP = 1, SCOPE_FUNCTION = 2, SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION, SCOPE_ASYNC = 4, SCOPE_GENERATOR = 8, SCOPE_ARROW = 16, SCOPE_SIMPLE_CATCH = 32, SCOPE_SUPER = 64, SCOPE_DIRECT_SUPER = 128;\nfunction functionFlags(async, generator) {\n    return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0);\n}\n// Used in checkLVal and declareName to determine the type of a binding\nvar BIND_NONE = 0, BIND_VAR = 1, BIND_LEXICAL = 2, BIND_FUNCTION = 3, BIND_SIMPLE_CATCH = 4, BIND_OUTSIDE = 5; // Special case for function names as bound inside the function\nvar Parser = function Parser(options, input, startPos) {\n    this.options = options = getOptions(options);\n    this.sourceFile = options.sourceFile;\n    this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : options.sourceType === \"module\" ? \"5module\" : 5]);\n    var reserved = \"\";\n    if (options.allowReserved !== true) {\n        for(var v = options.ecmaVersion;; v--){\n            if (reserved = reservedWords[v]) break;\n        }\n        if (options.sourceType === \"module\") reserved += \" await\";\n    }\n    this.reservedWords = wordsRegexp(reserved);\n    var reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict;\n    this.reservedWordsStrict = wordsRegexp(reservedStrict);\n    this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind);\n    this.input = String(input);\n    // Used to signal to callers of `readWord1` whether the word\n    // contained any escape sequences. This is needed because words with\n    // escape sequences must not be interpreted as keywords.\n    this.containsEsc = false;\n    // Set up token state\n    // The current position of the tokenizer in the input.\n    if (startPos) {\n        this.pos = startPos;\n        this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1;\n        this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;\n    } else {\n        this.pos = this.lineStart = 0;\n        this.curLine = 1;\n    }\n    // Properties of the current token:\n    // Its type\n    this.type = types.eof;\n    // For tokens that include more information than their type, the value\n    this.value = null;\n    // Its start and end offset\n    this.start = this.end = this.pos;\n    // And, if locations are used, the {line, column} object\n    // corresponding to those offsets\n    this.startLoc = this.endLoc = this.curPosition();\n    // Position information for the previous token\n    this.lastTokEndLoc = this.lastTokStartLoc = null;\n    this.lastTokStart = this.lastTokEnd = this.pos;\n    // The context stack is used to superficially track syntactic\n    // context to predict whether a regular expression is allowed in a\n    // given position.\n    this.context = this.initialContext();\n    this.exprAllowed = true;\n    // Figure out if it's a module code.\n    this.inModule = options.sourceType === \"module\";\n    this.strict = this.inModule || this.strictDirective(this.pos);\n    // Used to signify the start of a potential arrow function\n    this.potentialArrowAt = -1;\n    // Positions to delayed-check that yield/await does not exist in default parameters.\n    this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;\n    // Labels in scope.\n    this.labels = [];\n    // Thus-far undefined exports.\n    this.undefinedExports = {};\n    // If enabled, skip leading hashbang line.\n    if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\") this.skipLineComment(2);\n    // Scope tracking for duplicate variable names (see scope.js)\n    this.scopeStack = [];\n    this.enterScope(SCOPE_TOP);\n    // For RegExp validation\n    this.regexpState = null;\n};\nvar prototypeAccessors = {\n    inFunction: {\n        configurable: true\n    },\n    inGenerator: {\n        configurable: true\n    },\n    inAsync: {\n        configurable: true\n    },\n    allowSuper: {\n        configurable: true\n    },\n    allowDirectSuper: {\n        configurable: true\n    },\n    treatFunctionsAsVar: {\n        configurable: true\n    }\n};\nParser.prototype.parse = function parse() {\n    var node = this.options.program || this.startNode();\n    this.nextToken();\n    return this.parseTopLevel(node);\n};\nprototypeAccessors.inFunction.get = function() {\n    return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0;\n};\nprototypeAccessors.inGenerator.get = function() {\n    return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0;\n};\nprototypeAccessors.inAsync.get = function() {\n    return (this.currentVarScope().flags & SCOPE_ASYNC) > 0;\n};\nprototypeAccessors.allowSuper.get = function() {\n    return (this.currentThisScope().flags & SCOPE_SUPER) > 0;\n};\nprototypeAccessors.allowDirectSuper.get = function() {\n    return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0;\n};\nprototypeAccessors.treatFunctionsAsVar.get = function() {\n    return this.treatFunctionsAsVarInScope(this.currentScope());\n};\n// Switch to a getter for 7.0.0.\nParser.prototype.inNonArrowFunction = function inNonArrowFunction() {\n    return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0;\n};\nParser.extend = function extend() {\n    var plugins = [], len = arguments.length;\n    while(len--)plugins[len] = arguments[len];\n    var cls = this;\n    for(var i = 0; i < plugins.length; i++)cls = plugins[i](cls);\n    return cls;\n};\nParser.parse = function parse(input, options) {\n    return new this(options, input).parse();\n};\nParser.parseExpressionAt = function parseExpressionAt(input, pos, options) {\n    var parser = new this(options, input, pos);\n    parser.nextToken();\n    return parser.parseExpression();\n};\nParser.tokenizer = function tokenizer(input, options) {\n    return new this(options, input);\n};\nObject.defineProperties(Parser.prototype, prototypeAccessors);\nvar pp = Parser.prototype;\n// ## Parser utilities\nvar literal = /^(?:'((?:\\\\.|[^'\\\\])*?)'|\"((?:\\\\.|[^\"\\\\])*?)\")/;\npp.strictDirective = function(start) {\n    for(;;){\n        // Try to find string literal.\n        skipWhiteSpace.lastIndex = start;\n        start += skipWhiteSpace.exec(this.input)[0].length;\n        var match = literal.exec(this.input.slice(start));\n        if (!match) return false;\n        if ((match[1] || match[2]) === \"use strict\") {\n            skipWhiteSpace.lastIndex = start + match[0].length;\n            var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;\n            var next = this.input.charAt(end);\n            return next === \";\" || next === \"}\" || lineBreak.test(spaceAfter[0]) && !(/[(`.[+\\-/*%<>=,?^&]/.test(next) || next === \"!\" && this.input.charAt(end + 1) === \"=\");\n        }\n        start += match[0].length;\n        // Skip semicolon, if any.\n        skipWhiteSpace.lastIndex = start;\n        start += skipWhiteSpace.exec(this.input)[0].length;\n        if (this.input[start] === \";\") start++;\n    }\n};\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\npp.eat = function(type) {\n    if (this.type === type) {\n        this.next();\n        return true;\n    } else return false;\n};\n// Tests whether parsed token is a contextual keyword.\npp.isContextual = function(name) {\n    return this.type === types.name && this.value === name && !this.containsEsc;\n};\n// Consumes contextual keyword if possible.\npp.eatContextual = function(name) {\n    if (!this.isContextual(name)) return false;\n    this.next();\n    return true;\n};\n// Asserts that following token is given contextual keyword.\npp.expectContextual = function(name) {\n    if (!this.eatContextual(name)) this.unexpected();\n};\n// Test whether a semicolon can be inserted at the current position.\npp.canInsertSemicolon = function() {\n    return this.type === types.eof || this.type === types.braceR || lineBreak.test(this.input.slice(this.lastTokEnd, this.start));\n};\npp.insertSemicolon = function() {\n    if (this.canInsertSemicolon()) {\n        if (this.options.onInsertedSemicolon) this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc);\n        return true;\n    }\n};\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\npp.semicolon = function() {\n    if (!this.eat(types.semi) && !this.insertSemicolon()) this.unexpected();\n};\npp.afterTrailingComma = function(tokType, notNext) {\n    if (this.type === tokType) {\n        if (this.options.onTrailingComma) this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc);\n        if (!notNext) this.next();\n        return true;\n    }\n};\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\npp.expect = function(type) {\n    this.eat(type) || this.unexpected();\n};\n// Raise an unexpected token error.\npp.unexpected = function(pos) {\n    this.raise(pos != null ? pos : this.start, \"Unexpected token\");\n};\nfunction DestructuringErrors() {\n    this.shorthandAssign = this.trailingComma = this.parenthesizedAssign = this.parenthesizedBind = this.doubleProto = -1;\n}\npp.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n    if (!refDestructuringErrors) return;\n    if (refDestructuringErrors.trailingComma > -1) this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\");\n    var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;\n    if (parens > -1) this.raiseRecoverable(parens, \"Parenthesized pattern\");\n};\npp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n    if (!refDestructuringErrors) return false;\n    var shorthandAssign = refDestructuringErrors.shorthandAssign;\n    var doubleProto = refDestructuringErrors.doubleProto;\n    if (!andThrow) return shorthandAssign >= 0 || doubleProto >= 0;\n    if (shorthandAssign >= 0) this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\");\n    if (doubleProto >= 0) this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\");\n};\npp.checkYieldAwaitInDefaultParams = function() {\n    if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos)) this.raise(this.yieldPos, \"Yield expression cannot be a default value\");\n    if (this.awaitPos) this.raise(this.awaitPos, \"Await expression cannot be a default value\");\n};\npp.isSimpleAssignTarget = function(expr) {\n    if (expr.type === \"ParenthesizedExpression\") return this.isSimpleAssignTarget(expr.expression);\n    return expr.type === \"Identifier\" || expr.type === \"MemberExpression\";\n};\nvar pp$1 = Parser.prototype;\n// ### Statement parsing\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\npp$1.parseTopLevel = function(node) {\n    var exports = {};\n    if (!node.body) node.body = [];\n    while(this.type !== types.eof){\n        var stmt = this.parseStatement(null, true, exports);\n        node.body.push(stmt);\n    }\n    if (this.inModule) for(var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1){\n        var name = list[i];\n        this.raiseRecoverable(this.undefinedExports[name].start, \"Export '\" + name + \"' is not defined\");\n    }\n    this.adaptDirectivePrologue(node.body);\n    this.next();\n    node.sourceType = this.options.sourceType;\n    return this.finishNode(node, \"Program\");\n};\nvar loopLabel = {\n    kind: \"loop\"\n}, switchLabel = {\n    kind: \"switch\"\n};\npp$1.isLet = function(context) {\n    if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) return false;\n    skipWhiteSpace.lastIndex = this.pos;\n    var skip = skipWhiteSpace.exec(this.input);\n    var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n    // For ambiguous cases, determine if a LexicalDeclaration (or only a\n    // Statement) is allowed here. If context is not empty then only a Statement\n    // is allowed. However, `let [` is an explicit negative lookahead for\n    // ExpressionStatement, so special-case it first.\n    if (nextCh === 91) return true;\n     // '['\n    if (context) return false;\n    if (nextCh === 123) return true;\n     // '{'\n    if (isIdentifierStart(nextCh, true)) {\n        var pos = next + 1;\n        while(isIdentifierChar(this.input.charCodeAt(pos), true))++pos;\n        var ident = this.input.slice(next, pos);\n        if (!keywordRelationalOperator.test(ident)) return true;\n    }\n    return false;\n};\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp$1.isAsyncFunction = function() {\n    if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\")) return false;\n    skipWhiteSpace.lastIndex = this.pos;\n    var skip = skipWhiteSpace.exec(this.input);\n    var next = this.pos + skip[0].length;\n    return !lineBreak.test(this.input.slice(this.pos, next)) && this.input.slice(next, next + 8) === \"function\" && (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)));\n};\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\npp$1.parseStatement = function(context, topLevel, exports) {\n    var starttype = this.type, node = this.startNode(), kind;\n    if (this.isLet(context)) {\n        starttype = types._var;\n        kind = \"let\";\n    }\n    // Most types of statements are recognized by the keyword they\n    // start with. Many are trivial to parse, some require a bit of\n    // complexity.\n    switch(starttype){\n        case types._break:\n        case types._continue:\n            return this.parseBreakContinueStatement(node, starttype.keyword);\n        case types._debugger:\n            return this.parseDebuggerStatement(node);\n        case types._do:\n            return this.parseDoStatement(node);\n        case types._for:\n            return this.parseForStatement(node);\n        case types._function:\n            // Function as sole body of either an if statement or a labeled statement\n            // works, but not when it is part of a labeled statement that is the sole\n            // body of an if statement.\n            if (context && (this.strict || context !== \"if\" && context !== \"label\") && this.options.ecmaVersion >= 6) this.unexpected();\n            return this.parseFunctionStatement(node, false, !context);\n        case types._class:\n            if (context) this.unexpected();\n            return this.parseClass(node, true);\n        case types._if:\n            return this.parseIfStatement(node);\n        case types._return:\n            return this.parseReturnStatement(node);\n        case types._switch:\n            return this.parseSwitchStatement(node);\n        case types._throw:\n            return this.parseThrowStatement(node);\n        case types._try:\n            return this.parseTryStatement(node);\n        case types._const:\n        case types._var:\n            kind = kind || this.value;\n            if (context && kind !== \"var\") this.unexpected();\n            return this.parseVarStatement(node, kind);\n        case types._while:\n            return this.parseWhileStatement(node);\n        case types._with:\n            return this.parseWithStatement(node);\n        case types.braceL:\n            return this.parseBlock(true, node);\n        case types.semi:\n            return this.parseEmptyStatement(node);\n        case types._export:\n        case types._import:\n            if (this.options.ecmaVersion > 10 && starttype === types._import) {\n                skipWhiteSpace.lastIndex = this.pos;\n                var skip = skipWhiteSpace.exec(this.input);\n                var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n                if (nextCh === 40 || nextCh === 46) return this.parseExpressionStatement(node, this.parseExpression());\n            }\n            if (!this.options.allowImportExportEverywhere) {\n                if (!topLevel) this.raise(this.start, \"'import' and 'export' may only appear at the top level\");\n                if (!this.inModule) this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\");\n            }\n            return starttype === types._import ? this.parseImport(node) : this.parseExport(node, exports);\n        // If the statement does not start with a statement keyword or a\n        // brace, it's an ExpressionStatement or LabeledStatement. We\n        // simply start parsing an expression, and afterwards, if the\n        // next token is a colon and the expression was a simple\n        // Identifier node, we switch to interpreting it as a label.\n        default:\n            if (this.isAsyncFunction()) {\n                if (context) this.unexpected();\n                this.next();\n                return this.parseFunctionStatement(node, true, !context);\n            }\n            var maybeName = this.value, expr = this.parseExpression();\n            if (starttype === types.name && expr.type === \"Identifier\" && this.eat(types.colon)) return this.parseLabeledStatement(node, maybeName, expr, context);\n            else return this.parseExpressionStatement(node, expr);\n    }\n};\npp$1.parseBreakContinueStatement = function(node, keyword) {\n    var isBreak = keyword === \"break\";\n    this.next();\n    if (this.eat(types.semi) || this.insertSemicolon()) node.label = null;\n    else if (this.type !== types.name) this.unexpected();\n    else {\n        node.label = this.parseIdent();\n        this.semicolon();\n    }\n    // Verify that there is an actual destination to break or\n    // continue to.\n    var i = 0;\n    for(; i < this.labels.length; ++i){\n        var lab = this.labels[i];\n        if (node.label == null || lab.name === node.label.name) {\n            if (lab.kind != null && (isBreak || lab.kind === \"loop\")) break;\n            if (node.label && isBreak) break;\n        }\n    }\n    if (i === this.labels.length) this.raise(node.start, \"Unsyntactic \" + keyword);\n    return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\");\n};\npp$1.parseDebuggerStatement = function(node) {\n    this.next();\n    this.semicolon();\n    return this.finishNode(node, \"DebuggerStatement\");\n};\npp$1.parseDoStatement = function(node) {\n    this.next();\n    this.labels.push(loopLabel);\n    node.body = this.parseStatement(\"do\");\n    this.labels.pop();\n    this.expect(types._while);\n    node.test = this.parseParenExpression();\n    if (this.options.ecmaVersion >= 6) this.eat(types.semi);\n    else this.semicolon();\n    return this.finishNode(node, \"DoWhileStatement\");\n};\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\npp$1.parseForStatement = function(node) {\n    this.next();\n    var awaitAt = this.options.ecmaVersion >= 9 && (this.inAsync || !this.inFunction && this.options.allowAwaitOutsideFunction) && this.eatContextual(\"await\") ? this.lastTokStart : -1;\n    this.labels.push(loopLabel);\n    this.enterScope(0);\n    this.expect(types.parenL);\n    if (this.type === types.semi) {\n        if (awaitAt > -1) this.unexpected(awaitAt);\n        return this.parseFor(node, null);\n    }\n    var isLet = this.isLet();\n    if (this.type === types._var || this.type === types._const || isLet) {\n        var init$1 = this.startNode(), kind = isLet ? \"let\" : this.value;\n        this.next();\n        this.parseVar(init$1, true, kind);\n        this.finishNode(init$1, \"VariableDeclaration\");\n        if ((this.type === types._in || this.options.ecmaVersion >= 6 && this.isContextual(\"of\")) && init$1.declarations.length === 1) {\n            if (this.options.ecmaVersion >= 9) {\n                if (this.type === types._in) {\n                    if (awaitAt > -1) this.unexpected(awaitAt);\n                } else node.await = awaitAt > -1;\n            }\n            return this.parseForIn(node, init$1);\n        }\n        if (awaitAt > -1) this.unexpected(awaitAt);\n        return this.parseFor(node, init$1);\n    }\n    var refDestructuringErrors = new DestructuringErrors;\n    var init = this.parseExpression(true, refDestructuringErrors);\n    if (this.type === types._in || this.options.ecmaVersion >= 6 && this.isContextual(\"of\")) {\n        if (this.options.ecmaVersion >= 9) {\n            if (this.type === types._in) {\n                if (awaitAt > -1) this.unexpected(awaitAt);\n            } else node.await = awaitAt > -1;\n        }\n        this.toAssignable(init, false, refDestructuringErrors);\n        this.checkLVal(init);\n        return this.parseForIn(node, init);\n    } else this.checkExpressionErrors(refDestructuringErrors, true);\n    if (awaitAt > -1) this.unexpected(awaitAt);\n    return this.parseFor(node, init);\n};\npp$1.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n    this.next();\n    return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync);\n};\npp$1.parseIfStatement = function(node) {\n    this.next();\n    node.test = this.parseParenExpression();\n    // allow function declarations in branches, but only in non-strict mode\n    node.consequent = this.parseStatement(\"if\");\n    node.alternate = this.eat(types._else) ? this.parseStatement(\"if\") : null;\n    return this.finishNode(node, \"IfStatement\");\n};\npp$1.parseReturnStatement = function(node) {\n    if (!this.inFunction && !this.options.allowReturnOutsideFunction) this.raise(this.start, \"'return' outside of function\");\n    this.next();\n    // In `return` (and `break`/`continue`), the keywords with\n    // optional arguments, we eagerly look for a semicolon or the\n    // possibility to insert one.\n    if (this.eat(types.semi) || this.insertSemicolon()) node.argument = null;\n    else {\n        node.argument = this.parseExpression();\n        this.semicolon();\n    }\n    return this.finishNode(node, \"ReturnStatement\");\n};\npp$1.parseSwitchStatement = function(node) {\n    this.next();\n    node.discriminant = this.parseParenExpression();\n    node.cases = [];\n    this.expect(types.braceL);\n    this.labels.push(switchLabel);\n    this.enterScope(0);\n    // Statements under must be grouped (by label) in SwitchCase\n    // nodes. `cur` is used to keep the node that we are currently\n    // adding statements to.\n    var cur;\n    for(var sawDefault = false; this.type !== types.braceR;)if (this.type === types._case || this.type === types._default) {\n        var isCase = this.type === types._case;\n        if (cur) this.finishNode(cur, \"SwitchCase\");\n        node.cases.push(cur = this.startNode());\n        cur.consequent = [];\n        this.next();\n        if (isCase) cur.test = this.parseExpression();\n        else {\n            if (sawDefault) this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\");\n            sawDefault = true;\n            cur.test = null;\n        }\n        this.expect(types.colon);\n    } else {\n        if (!cur) this.unexpected();\n        cur.consequent.push(this.parseStatement(null));\n    }\n    this.exitScope();\n    if (cur) this.finishNode(cur, \"SwitchCase\");\n    this.next(); // Closing brace\n    this.labels.pop();\n    return this.finishNode(node, \"SwitchStatement\");\n};\npp$1.parseThrowStatement = function(node) {\n    this.next();\n    if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) this.raise(this.lastTokEnd, \"Illegal newline after throw\");\n    node.argument = this.parseExpression();\n    this.semicolon();\n    return this.finishNode(node, \"ThrowStatement\");\n};\n// Reused empty array added for node fields that are always empty.\nvar empty = [];\npp$1.parseTryStatement = function(node) {\n    this.next();\n    node.block = this.parseBlock();\n    node.handler = null;\n    if (this.type === types._catch) {\n        var clause = this.startNode();\n        this.next();\n        if (this.eat(types.parenL)) {\n            clause.param = this.parseBindingAtom();\n            var simple = clause.param.type === \"Identifier\";\n            this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);\n            this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);\n            this.expect(types.parenR);\n        } else {\n            if (this.options.ecmaVersion < 10) this.unexpected();\n            clause.param = null;\n            this.enterScope(0);\n        }\n        clause.body = this.parseBlock(false);\n        this.exitScope();\n        node.handler = this.finishNode(clause, \"CatchClause\");\n    }\n    node.finalizer = this.eat(types._finally) ? this.parseBlock() : null;\n    if (!node.handler && !node.finalizer) this.raise(node.start, \"Missing catch or finally clause\");\n    return this.finishNode(node, \"TryStatement\");\n};\npp$1.parseVarStatement = function(node, kind) {\n    this.next();\n    this.parseVar(node, false, kind);\n    this.semicolon();\n    return this.finishNode(node, \"VariableDeclaration\");\n};\npp$1.parseWhileStatement = function(node) {\n    this.next();\n    node.test = this.parseParenExpression();\n    this.labels.push(loopLabel);\n    node.body = this.parseStatement(\"while\");\n    this.labels.pop();\n    return this.finishNode(node, \"WhileStatement\");\n};\npp$1.parseWithStatement = function(node) {\n    if (this.strict) this.raise(this.start, \"'with' in strict mode\");\n    this.next();\n    node.object = this.parseParenExpression();\n    node.body = this.parseStatement(\"with\");\n    return this.finishNode(node, \"WithStatement\");\n};\npp$1.parseEmptyStatement = function(node) {\n    this.next();\n    return this.finishNode(node, \"EmptyStatement\");\n};\npp$1.parseLabeledStatement = function(node, maybeName, expr, context) {\n    for(var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1){\n        var label = list[i$1];\n        if (label.name === maybeName) this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\");\n    }\n    var kind = this.type.isLoop ? \"loop\" : this.type === types._switch ? \"switch\" : null;\n    for(var i = this.labels.length - 1; i >= 0; i--){\n        var label$1 = this.labels[i];\n        if (label$1.statementStart === node.start) {\n            // Update information about previous labels on this node\n            label$1.statementStart = this.start;\n            label$1.kind = kind;\n        } else break;\n    }\n    this.labels.push({\n        name: maybeName,\n        kind: kind,\n        statementStart: this.start\n    });\n    node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\");\n    this.labels.pop();\n    node.label = expr;\n    return this.finishNode(node, \"LabeledStatement\");\n};\npp$1.parseExpressionStatement = function(node, expr) {\n    node.expression = expr;\n    this.semicolon();\n    return this.finishNode(node, \"ExpressionStatement\");\n};\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\npp$1.parseBlock = function(createNewLexicalScope, node, exitStrict) {\n    if (createNewLexicalScope === void 0) createNewLexicalScope = true;\n    if (node === void 0) node = this.startNode();\n    node.body = [];\n    this.expect(types.braceL);\n    if (createNewLexicalScope) this.enterScope(0);\n    while(this.type !== types.braceR){\n        var stmt = this.parseStatement(null);\n        node.body.push(stmt);\n    }\n    if (exitStrict) this.strict = false;\n    this.next();\n    if (createNewLexicalScope) this.exitScope();\n    return this.finishNode(node, \"BlockStatement\");\n};\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\npp$1.parseFor = function(node, init) {\n    node.init = init;\n    this.expect(types.semi);\n    node.test = this.type === types.semi ? null : this.parseExpression();\n    this.expect(types.semi);\n    node.update = this.type === types.parenR ? null : this.parseExpression();\n    this.expect(types.parenR);\n    node.body = this.parseStatement(\"for\");\n    this.exitScope();\n    this.labels.pop();\n    return this.finishNode(node, \"ForStatement\");\n};\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\npp$1.parseForIn = function(node, init) {\n    var isForIn = this.type === types._in;\n    this.next();\n    if (init.type === \"VariableDeclaration\" && init.declarations[0].init != null && (!isForIn || this.options.ecmaVersion < 8 || this.strict || init.kind !== \"var\" || init.declarations[0].id.type !== \"Identifier\")) this.raise(init.start, (isForIn ? \"for-in\" : \"for-of\") + \" loop variable declaration may not have an initializer\");\n    else if (init.type === \"AssignmentPattern\") this.raise(init.start, \"Invalid left-hand side in for-loop\");\n    node.left = init;\n    node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();\n    this.expect(types.parenR);\n    node.body = this.parseStatement(\"for\");\n    this.exitScope();\n    this.labels.pop();\n    return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\");\n};\n// Parse a list of variable declarations.\npp$1.parseVar = function(node, isFor, kind) {\n    node.declarations = [];\n    node.kind = kind;\n    for(;;){\n        var decl = this.startNode();\n        this.parseVarId(decl, kind);\n        if (this.eat(types.eq)) decl.init = this.parseMaybeAssign(isFor);\n        else if (kind === \"const\" && !(this.type === types._in || this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) this.unexpected();\n        else if (decl.id.type !== \"Identifier\" && !(isFor && (this.type === types._in || this.isContextual(\"of\")))) this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\");\n        else decl.init = null;\n        node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n        if (!this.eat(types.comma)) break;\n    }\n    return node;\n};\npp$1.parseVarId = function(decl, kind) {\n    decl.id = this.parseBindingAtom();\n    this.checkLVal(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false);\n};\nvar FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp$1.parseFunction = function(node, statement, allowExpressionBody, isAsync) {\n    this.initFunction(node);\n    if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n        if (this.type === types.star && statement & FUNC_HANGING_STATEMENT) this.unexpected();\n        node.generator = this.eat(types.star);\n    }\n    if (this.options.ecmaVersion >= 8) node.async = !!isAsync;\n    if (statement & FUNC_STATEMENT) {\n        node.id = statement & FUNC_NULLABLE_ID && this.type !== types.name ? null : this.parseIdent();\n        if (node.id && !(statement & FUNC_HANGING_STATEMENT)) this.checkLVal(node.id, this.strict || node.generator || node.async ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION);\n    }\n    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    this.enterScope(functionFlags(node.async, node.generator));\n    if (!(statement & FUNC_STATEMENT)) node.id = this.type === types.name ? this.parseIdent() : null;\n    this.parseFunctionParams(node);\n    this.parseFunctionBody(node, allowExpressionBody, false);\n    this.yieldPos = oldYieldPos;\n    this.awaitPos = oldAwaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos;\n    return this.finishNode(node, statement & FUNC_STATEMENT ? \"FunctionDeclaration\" : \"FunctionExpression\");\n};\npp$1.parseFunctionParams = function(node) {\n    this.expect(types.parenL);\n    node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);\n    this.checkYieldAwaitInDefaultParams();\n};\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\npp$1.parseClass = function(node, isStatement) {\n    this.next();\n    // ecma-262 14.6 Class Definitions\n    // A class definition is always strict mode code.\n    var oldStrict = this.strict;\n    this.strict = true;\n    this.parseClassId(node, isStatement);\n    this.parseClassSuper(node);\n    var classBody = this.startNode();\n    var hadConstructor = false;\n    classBody.body = [];\n    this.expect(types.braceL);\n    while(this.type !== types.braceR){\n        var element = this.parseClassElement(node.superClass !== null);\n        if (element) {\n            classBody.body.push(element);\n            if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n                if (hadConstructor) this.raise(element.start, \"Duplicate constructor in the same class\");\n                hadConstructor = true;\n            }\n        }\n    }\n    this.strict = oldStrict;\n    this.next();\n    node.body = this.finishNode(classBody, \"ClassBody\");\n    return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\");\n};\npp$1.parseClassElement = function(constructorAllowsSuper) {\n    var this$1 = this;\n    if (this.eat(types.semi)) return null;\n    var method = this.startNode();\n    var tryContextual = function(k, noLineBreak) {\n        if (noLineBreak === void 0) noLineBreak = false;\n        var start = this$1.start, startLoc = this$1.startLoc;\n        if (!this$1.eatContextual(k)) return false;\n        if (this$1.type !== types.parenL && (!noLineBreak || !this$1.canInsertSemicolon())) return true;\n        if (method.key) this$1.unexpected();\n        method.computed = false;\n        method.key = this$1.startNodeAt(start, startLoc);\n        method.key.name = k;\n        this$1.finishNode(method.key, \"Identifier\");\n        return false;\n    };\n    method.kind = \"method\";\n    method.static = tryContextual(\"static\");\n    var isGenerator = this.eat(types.star);\n    var isAsync = false;\n    if (!isGenerator) {\n        if (this.options.ecmaVersion >= 8 && tryContextual(\"async\", true)) {\n            isAsync = true;\n            isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);\n        } else if (tryContextual(\"get\")) method.kind = \"get\";\n        else if (tryContextual(\"set\")) method.kind = \"set\";\n    }\n    if (!method.key) this.parsePropertyName(method);\n    var key = method.key;\n    var allowsDirectSuper = false;\n    if (!method.computed && !method.static && (key.type === \"Identifier\" && key.name === \"constructor\" || key.type === \"Literal\" && key.value === \"constructor\")) {\n        if (method.kind !== \"method\") this.raise(key.start, \"Constructor can't have get/set modifier\");\n        if (isGenerator) this.raise(key.start, \"Constructor can't be a generator\");\n        if (isAsync) this.raise(key.start, \"Constructor can't be an async method\");\n        method.kind = \"constructor\";\n        allowsDirectSuper = constructorAllowsSuper;\n    } else if (method.static && key.type === \"Identifier\" && key.name === \"prototype\") this.raise(key.start, \"Classes may not have a static property named prototype\");\n    this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper);\n    if (method.kind === \"get\" && method.value.params.length !== 0) this.raiseRecoverable(method.value.start, \"getter should have no params\");\n    if (method.kind === \"set\" && method.value.params.length !== 1) this.raiseRecoverable(method.value.start, \"setter should have exactly one param\");\n    if (method.kind === \"set\" && method.value.params[0].type === \"RestElement\") this.raiseRecoverable(method.value.params[0].start, \"Setter cannot use rest params\");\n    return method;\n};\npp$1.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n    method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);\n    return this.finishNode(method, \"MethodDefinition\");\n};\npp$1.parseClassId = function(node, isStatement) {\n    if (this.type === types.name) {\n        node.id = this.parseIdent();\n        if (isStatement) this.checkLVal(node.id, BIND_LEXICAL, false);\n    } else {\n        if (isStatement === true) this.unexpected();\n        node.id = null;\n    }\n};\npp$1.parseClassSuper = function(node) {\n    node.superClass = this.eat(types._extends) ? this.parseExprSubscripts() : null;\n};\n// Parses module export declaration.\npp$1.parseExport = function(node, exports) {\n    this.next();\n    // export * from '...'\n    if (this.eat(types.star)) {\n        if (this.options.ecmaVersion >= 11) {\n            if (this.eatContextual(\"as\")) {\n                node.exported = this.parseIdent(true);\n                this.checkExport(exports, node.exported.name, this.lastTokStart);\n            } else node.exported = null;\n        }\n        this.expectContextual(\"from\");\n        if (this.type !== types.string) this.unexpected();\n        node.source = this.parseExprAtom();\n        this.semicolon();\n        return this.finishNode(node, \"ExportAllDeclaration\");\n    }\n    if (this.eat(types._default)) {\n        this.checkExport(exports, \"default\", this.lastTokStart);\n        var isAsync;\n        if (this.type === types._function || (isAsync = this.isAsyncFunction())) {\n            var fNode = this.startNode();\n            this.next();\n            if (isAsync) this.next();\n            node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);\n        } else if (this.type === types._class) {\n            var cNode = this.startNode();\n            node.declaration = this.parseClass(cNode, \"nullableID\");\n        } else {\n            node.declaration = this.parseMaybeAssign();\n            this.semicolon();\n        }\n        return this.finishNode(node, \"ExportDefaultDeclaration\");\n    }\n    // export var|const|let|function|class ...\n    if (this.shouldParseExportStatement()) {\n        node.declaration = this.parseStatement(null);\n        if (node.declaration.type === \"VariableDeclaration\") this.checkVariableExport(exports, node.declaration.declarations);\n        else this.checkExport(exports, node.declaration.id.name, node.declaration.id.start);\n        node.specifiers = [];\n        node.source = null;\n    } else {\n        node.declaration = null;\n        node.specifiers = this.parseExportSpecifiers(exports);\n        if (this.eatContextual(\"from\")) {\n            if (this.type !== types.string) this.unexpected();\n            node.source = this.parseExprAtom();\n        } else {\n            for(var i = 0, list = node.specifiers; i < list.length; i += 1){\n                // check for keywords used as local names\n                var spec = list[i];\n                this.checkUnreserved(spec.local);\n                // check if export is defined\n                this.checkLocalExport(spec.local);\n            }\n            node.source = null;\n        }\n        this.semicolon();\n    }\n    return this.finishNode(node, \"ExportNamedDeclaration\");\n};\npp$1.checkExport = function(exports, name, pos) {\n    if (!exports) return;\n    if (has(exports, name)) this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\");\n    exports[name] = true;\n};\npp$1.checkPatternExport = function(exports, pat) {\n    var type = pat.type;\n    if (type === \"Identifier\") this.checkExport(exports, pat.name, pat.start);\n    else if (type === \"ObjectPattern\") for(var i = 0, list = pat.properties; i < list.length; i += 1){\n        var prop = list[i];\n        this.checkPatternExport(exports, prop);\n    }\n    else if (type === \"ArrayPattern\") for(var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1){\n        var elt = list$1[i$1];\n        if (elt) this.checkPatternExport(exports, elt);\n    }\n    else if (type === \"Property\") this.checkPatternExport(exports, pat.value);\n    else if (type === \"AssignmentPattern\") this.checkPatternExport(exports, pat.left);\n    else if (type === \"RestElement\") this.checkPatternExport(exports, pat.argument);\n    else if (type === \"ParenthesizedExpression\") this.checkPatternExport(exports, pat.expression);\n};\npp$1.checkVariableExport = function(exports, decls) {\n    if (!exports) return;\n    for(var i = 0, list = decls; i < list.length; i += 1){\n        var decl = list[i];\n        this.checkPatternExport(exports, decl.id);\n    }\n};\npp$1.shouldParseExportStatement = function() {\n    return this.type.keyword === \"var\" || this.type.keyword === \"const\" || this.type.keyword === \"class\" || this.type.keyword === \"function\" || this.isLet() || this.isAsyncFunction();\n};\n// Parses a comma-separated list of module exports.\npp$1.parseExportSpecifiers = function(exports) {\n    var nodes = [], first = true;\n    // export { x, y as z } [from '...']\n    this.expect(types.braceL);\n    while(!this.eat(types.braceR)){\n        if (!first) {\n            this.expect(types.comma);\n            if (this.afterTrailingComma(types.braceR)) break;\n        } else first = false;\n        var node = this.startNode();\n        node.local = this.parseIdent(true);\n        node.exported = this.eatContextual(\"as\") ? this.parseIdent(true) : node.local;\n        this.checkExport(exports, node.exported.name, node.exported.start);\n        nodes.push(this.finishNode(node, \"ExportSpecifier\"));\n    }\n    return nodes;\n};\n// Parses import declaration.\npp$1.parseImport = function(node) {\n    this.next();\n    // import '...'\n    if (this.type === types.string) {\n        node.specifiers = empty;\n        node.source = this.parseExprAtom();\n    } else {\n        node.specifiers = this.parseImportSpecifiers();\n        this.expectContextual(\"from\");\n        node.source = this.type === types.string ? this.parseExprAtom() : this.unexpected();\n    }\n    this.semicolon();\n    return this.finishNode(node, \"ImportDeclaration\");\n};\n// Parses a comma-separated list of module imports.\npp$1.parseImportSpecifiers = function() {\n    var nodes = [], first = true;\n    if (this.type === types.name) {\n        // import defaultObj, { x, y as z } from '...'\n        var node = this.startNode();\n        node.local = this.parseIdent();\n        this.checkLVal(node.local, BIND_LEXICAL);\n        nodes.push(this.finishNode(node, \"ImportDefaultSpecifier\"));\n        if (!this.eat(types.comma)) return nodes;\n    }\n    if (this.type === types.star) {\n        var node$1 = this.startNode();\n        this.next();\n        this.expectContextual(\"as\");\n        node$1.local = this.parseIdent();\n        this.checkLVal(node$1.local, BIND_LEXICAL);\n        nodes.push(this.finishNode(node$1, \"ImportNamespaceSpecifier\"));\n        return nodes;\n    }\n    this.expect(types.braceL);\n    while(!this.eat(types.braceR)){\n        if (!first) {\n            this.expect(types.comma);\n            if (this.afterTrailingComma(types.braceR)) break;\n        } else first = false;\n        var node$2 = this.startNode();\n        node$2.imported = this.parseIdent(true);\n        if (this.eatContextual(\"as\")) node$2.local = this.parseIdent();\n        else {\n            this.checkUnreserved(node$2.imported);\n            node$2.local = node$2.imported;\n        }\n        this.checkLVal(node$2.local, BIND_LEXICAL);\n        nodes.push(this.finishNode(node$2, \"ImportSpecifier\"));\n    }\n    return nodes;\n};\n// Set `ExpressionStatement#directive` property for directive prologues.\npp$1.adaptDirectivePrologue = function(statements) {\n    for(var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i)statements[i].directive = statements[i].expression.raw.slice(1, -1);\n};\npp$1.isDirectiveCandidate = function(statement) {\n    return statement.type === \"ExpressionStatement\" && statement.expression.type === \"Literal\" && typeof statement.expression.value === \"string\" && // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\");\n};\nvar pp$2 = Parser.prototype;\n// Convert existing expression atom to assignable pattern\n// if possible.\npp$2.toAssignable = function(node, isBinding, refDestructuringErrors) {\n    if (this.options.ecmaVersion >= 6 && node) switch(node.type){\n        case \"Identifier\":\n            if (this.inAsync && node.name === \"await\") this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\");\n            break;\n        case \"ObjectPattern\":\n        case \"ArrayPattern\":\n        case \"RestElement\":\n            break;\n        case \"ObjectExpression\":\n            node.type = \"ObjectPattern\";\n            if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true);\n            for(var i = 0, list = node.properties; i < list.length; i += 1){\n                var prop = list[i];\n                this.toAssignable(prop, isBinding);\n                // Early error:\n                //   AssignmentRestProperty[Yield, Await] :\n                //     `...` DestructuringAssignmentTarget[Yield, Await]\n                //\n                //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n                if (prop.type === \"RestElement\" && (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")) this.raise(prop.argument.start, \"Unexpected token\");\n            }\n            break;\n        case \"Property\":\n            // AssignmentProperty has type === \"Property\"\n            if (node.kind !== \"init\") this.raise(node.key.start, \"Object pattern can't contain getter or setter\");\n            this.toAssignable(node.value, isBinding);\n            break;\n        case \"ArrayExpression\":\n            node.type = \"ArrayPattern\";\n            if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true);\n            this.toAssignableList(node.elements, isBinding);\n            break;\n        case \"SpreadElement\":\n            node.type = \"RestElement\";\n            this.toAssignable(node.argument, isBinding);\n            if (node.argument.type === \"AssignmentPattern\") this.raise(node.argument.start, \"Rest elements cannot have a default value\");\n            break;\n        case \"AssignmentExpression\":\n            if (node.operator !== \"=\") this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\");\n            node.type = \"AssignmentPattern\";\n            delete node.operator;\n            this.toAssignable(node.left, isBinding);\n        // falls through to AssignmentPattern\n        case \"AssignmentPattern\":\n            break;\n        case \"ParenthesizedExpression\":\n            this.toAssignable(node.expression, isBinding, refDestructuringErrors);\n            break;\n        case \"ChainExpression\":\n            this.raiseRecoverable(node.start, \"Optional chaining cannot appear in left-hand side\");\n            break;\n        case \"MemberExpression\":\n            if (!isBinding) break;\n        default:\n            this.raise(node.start, \"Assigning to rvalue\");\n    }\n    else if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true);\n    return node;\n};\n// Convert list of expression atoms to binding list.\npp$2.toAssignableList = function(exprList, isBinding) {\n    var end = exprList.length;\n    for(var i = 0; i < end; i++){\n        var elt = exprList[i];\n        if (elt) this.toAssignable(elt, isBinding);\n    }\n    if (end) {\n        var last = exprList[end - 1];\n        if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\") this.unexpected(last.argument.start);\n    }\n    return exprList;\n};\n// Parses spread element.\npp$2.parseSpread = function(refDestructuringErrors) {\n    var node = this.startNode();\n    this.next();\n    node.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n    return this.finishNode(node, \"SpreadElement\");\n};\npp$2.parseRestBinding = function() {\n    var node = this.startNode();\n    this.next();\n    // RestElement inside of a function parameter must be an identifier\n    if (this.options.ecmaVersion === 6 && this.type !== types.name) this.unexpected();\n    node.argument = this.parseBindingAtom();\n    return this.finishNode(node, \"RestElement\");\n};\n// Parses lvalue (assignable) atom.\npp$2.parseBindingAtom = function() {\n    if (this.options.ecmaVersion >= 6) switch(this.type){\n        case types.bracketL:\n            var node = this.startNode();\n            this.next();\n            node.elements = this.parseBindingList(types.bracketR, true, true);\n            return this.finishNode(node, \"ArrayPattern\");\n        case types.braceL:\n            return this.parseObj(true);\n    }\n    return this.parseIdent();\n};\npp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma) {\n    var elts = [], first = true;\n    while(!this.eat(close)){\n        if (first) first = false;\n        else this.expect(types.comma);\n        if (allowEmpty && this.type === types.comma) elts.push(null);\n        else if (allowTrailingComma && this.afterTrailingComma(close)) break;\n        else if (this.type === types.ellipsis) {\n            var rest = this.parseRestBinding();\n            this.parseBindingListItem(rest);\n            elts.push(rest);\n            if (this.type === types.comma) this.raise(this.start, \"Comma is not permitted after the rest element\");\n            this.expect(close);\n            break;\n        } else {\n            var elem = this.parseMaybeDefault(this.start, this.startLoc);\n            this.parseBindingListItem(elem);\n            elts.push(elem);\n        }\n    }\n    return elts;\n};\npp$2.parseBindingListItem = function(param) {\n    return param;\n};\n// Parses assignment pattern around given atom if possible.\npp$2.parseMaybeDefault = function(startPos, startLoc, left) {\n    left = left || this.parseBindingAtom();\n    if (this.options.ecmaVersion < 6 || !this.eat(types.eq)) return left;\n    var node = this.startNodeAt(startPos, startLoc);\n    node.left = left;\n    node.right = this.parseMaybeAssign();\n    return this.finishNode(node, \"AssignmentPattern\");\n};\n// Verify that a node is an lval — something that can be assigned\n// to.\n// bindingType can be either:\n// 'var' indicating that the lval creates a 'var' binding\n// 'let' indicating that the lval creates a lexical ('let' or 'const') binding\n// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references\npp$2.checkLVal = function(expr, bindingType, checkClashes) {\n    if (bindingType === void 0) bindingType = BIND_NONE;\n    switch(expr.type){\n        case \"Identifier\":\n            if (bindingType === BIND_LEXICAL && expr.name === \"let\") this.raiseRecoverable(expr.start, \"let is disallowed as a lexically bound name\");\n            if (this.strict && this.reservedWordsStrictBind.test(expr.name)) this.raiseRecoverable(expr.start, (bindingType ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\");\n            if (checkClashes) {\n                if (has(checkClashes, expr.name)) this.raiseRecoverable(expr.start, \"Argument name clash\");\n                checkClashes[expr.name] = true;\n            }\n            if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) this.declareName(expr.name, bindingType, expr.start);\n            break;\n        case \"ChainExpression\":\n            this.raiseRecoverable(expr.start, \"Optional chaining cannot appear in left-hand side\");\n            break;\n        case \"MemberExpression\":\n            if (bindingType) this.raiseRecoverable(expr.start, \"Binding member expression\");\n            break;\n        case \"ObjectPattern\":\n            for(var i = 0, list = expr.properties; i < list.length; i += 1){\n                var prop = list[i];\n                this.checkLVal(prop, bindingType, checkClashes);\n            }\n            break;\n        case \"Property\":\n            // AssignmentProperty has type === \"Property\"\n            this.checkLVal(expr.value, bindingType, checkClashes);\n            break;\n        case \"ArrayPattern\":\n            for(var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1){\n                var elem = list$1[i$1];\n                if (elem) this.checkLVal(elem, bindingType, checkClashes);\n            }\n            break;\n        case \"AssignmentPattern\":\n            this.checkLVal(expr.left, bindingType, checkClashes);\n            break;\n        case \"RestElement\":\n            this.checkLVal(expr.argument, bindingType, checkClashes);\n            break;\n        case \"ParenthesizedExpression\":\n            this.checkLVal(expr.expression, bindingType, checkClashes);\n            break;\n        default:\n            this.raise(expr.start, (bindingType ? \"Binding\" : \"Assigning to\") + \" rvalue\");\n    }\n};\n// A recursive descent parser operates by defining functions for all\nvar pp$3 = Parser.prototype;\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\npp$3.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n    if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\") return;\n    if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand)) return;\n    var key = prop.key;\n    var name;\n    switch(key.type){\n        case \"Identifier\":\n            name = key.name;\n            break;\n        case \"Literal\":\n            name = String(key.value);\n            break;\n        default:\n            return;\n    }\n    var kind = prop.kind;\n    if (this.options.ecmaVersion >= 6) {\n        if (name === \"__proto__\" && kind === \"init\") {\n            if (propHash.proto) {\n                if (refDestructuringErrors) {\n                    if (refDestructuringErrors.doubleProto < 0) refDestructuringErrors.doubleProto = key.start;\n                } else this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\");\n            }\n            propHash.proto = true;\n        }\n        return;\n    }\n    name = \"$\" + name;\n    var other = propHash[name];\n    if (other) {\n        var redefinition;\n        if (kind === \"init\") redefinition = this.strict && other.init || other.get || other.set;\n        else redefinition = other.init || other[kind];\n        if (redefinition) this.raiseRecoverable(key.start, \"Redefinition of property\");\n    } else other = propHash[name] = {\n        init: false,\n        get: false,\n        set: false\n    };\n    other[kind] = true;\n};\n// ### Expression parsing\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\npp$3.parseExpression = function(noIn, refDestructuringErrors) {\n    var startPos = this.start, startLoc = this.startLoc;\n    var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);\n    if (this.type === types.comma) {\n        var node = this.startNodeAt(startPos, startLoc);\n        node.expressions = [\n            expr\n        ];\n        while(this.eat(types.comma))node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors));\n        return this.finishNode(node, \"SequenceExpression\");\n    }\n    return expr;\n};\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\npp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {\n    if (this.isContextual(\"yield\")) {\n        if (this.inGenerator) return this.parseYield(noIn);\n        else this.exprAllowed = false;\n    }\n    var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1;\n    if (refDestructuringErrors) {\n        oldParenAssign = refDestructuringErrors.parenthesizedAssign;\n        oldTrailingComma = refDestructuringErrors.trailingComma;\n        refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;\n    } else {\n        refDestructuringErrors = new DestructuringErrors;\n        ownDestructuringErrors = true;\n    }\n    var startPos = this.start, startLoc = this.startLoc;\n    if (this.type === types.parenL || this.type === types.name) this.potentialArrowAt = this.start;\n    var left = this.parseMaybeConditional(noIn, refDestructuringErrors);\n    if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc);\n    if (this.type.isAssign) {\n        var node = this.startNodeAt(startPos, startLoc);\n        node.operator = this.value;\n        node.left = this.type === types.eq ? this.toAssignable(left, false, refDestructuringErrors) : left;\n        if (!ownDestructuringErrors) refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;\n        if (refDestructuringErrors.shorthandAssign >= node.left.start) refDestructuringErrors.shorthandAssign = -1;\n         // reset because shorthand default was used correctly\n        this.checkLVal(left);\n        this.next();\n        node.right = this.parseMaybeAssign(noIn);\n        return this.finishNode(node, \"AssignmentExpression\");\n    } else if (ownDestructuringErrors) this.checkExpressionErrors(refDestructuringErrors, true);\n    if (oldParenAssign > -1) refDestructuringErrors.parenthesizedAssign = oldParenAssign;\n    if (oldTrailingComma > -1) refDestructuringErrors.trailingComma = oldTrailingComma;\n    return left;\n};\n// Parse a ternary conditional (`?:`) operator.\npp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) {\n    var startPos = this.start, startLoc = this.startLoc;\n    var expr = this.parseExprOps(noIn, refDestructuringErrors);\n    if (this.checkExpressionErrors(refDestructuringErrors)) return expr;\n    if (this.eat(types.question)) {\n        var node = this.startNodeAt(startPos, startLoc);\n        node.test = expr;\n        node.consequent = this.parseMaybeAssign();\n        this.expect(types.colon);\n        node.alternate = this.parseMaybeAssign(noIn);\n        return this.finishNode(node, \"ConditionalExpression\");\n    }\n    return expr;\n};\n// Start the precedence parser.\npp$3.parseExprOps = function(noIn, refDestructuringErrors) {\n    var startPos = this.start, startLoc = this.startLoc;\n    var expr = this.parseMaybeUnary(refDestructuringErrors, false);\n    if (this.checkExpressionErrors(refDestructuringErrors)) return expr;\n    return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn);\n};\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\npp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {\n    var prec = this.type.binop;\n    if (prec != null && (!noIn || this.type !== types._in)) {\n        if (prec > minPrec) {\n            var logical = this.type === types.logicalOR || this.type === types.logicalAND;\n            var coalesce = this.type === types.coalesce;\n            if (coalesce) // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n            // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n            prec = types.logicalAND.binop;\n            var op = this.value;\n            this.next();\n            var startPos = this.start, startLoc = this.startLoc;\n            var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);\n            var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);\n            if (logical && this.type === types.coalesce || coalesce && (this.type === types.logicalOR || this.type === types.logicalAND)) this.raiseRecoverable(this.start, \"Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses\");\n            return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn);\n        }\n    }\n    return left;\n};\npp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.left = left;\n    node.operator = op;\n    node.right = right;\n    return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\");\n};\n// Parse unary operators, both prefix and postfix.\npp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {\n    var startPos = this.start, startLoc = this.startLoc, expr;\n    if (this.isContextual(\"await\") && (this.inAsync || !this.inFunction && this.options.allowAwaitOutsideFunction)) {\n        expr = this.parseAwait();\n        sawUnary = true;\n    } else if (this.type.prefix) {\n        var node = this.startNode(), update = this.type === types.incDec;\n        node.operator = this.value;\n        node.prefix = true;\n        this.next();\n        node.argument = this.parseMaybeUnary(null, true);\n        this.checkExpressionErrors(refDestructuringErrors, true);\n        if (update) this.checkLVal(node.argument);\n        else if (this.strict && node.operator === \"delete\" && node.argument.type === \"Identifier\") this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\");\n        else sawUnary = true;\n        expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\");\n    } else {\n        expr = this.parseExprSubscripts(refDestructuringErrors);\n        if (this.checkExpressionErrors(refDestructuringErrors)) return expr;\n        while(this.type.postfix && !this.canInsertSemicolon()){\n            var node$1 = this.startNodeAt(startPos, startLoc);\n            node$1.operator = this.value;\n            node$1.prefix = false;\n            node$1.argument = expr;\n            this.checkLVal(expr);\n            this.next();\n            expr = this.finishNode(node$1, \"UpdateExpression\");\n        }\n    }\n    if (!sawUnary && this.eat(types.starstar)) return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), \"**\", false);\n    else return expr;\n};\n// Parse call, dot, and `[]`-subscript expressions.\npp$3.parseExprSubscripts = function(refDestructuringErrors) {\n    var startPos = this.start, startLoc = this.startLoc;\n    var expr = this.parseExprAtom(refDestructuringErrors);\n    if (expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\") return expr;\n    var result = this.parseSubscripts(expr, startPos, startLoc);\n    if (refDestructuringErrors && result.type === \"MemberExpression\") {\n        if (refDestructuringErrors.parenthesizedAssign >= result.start) refDestructuringErrors.parenthesizedAssign = -1;\n        if (refDestructuringErrors.parenthesizedBind >= result.start) refDestructuringErrors.parenthesizedBind = -1;\n    }\n    return result;\n};\npp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) {\n    var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" && this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 && this.potentialArrowAt === base.start;\n    var optionalChained = false;\n    while(true){\n        var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained);\n        if (element.optional) optionalChained = true;\n        if (element === base || element.type === \"ArrowFunctionExpression\") {\n            if (optionalChained) {\n                var chainNode = this.startNodeAt(startPos, startLoc);\n                chainNode.expression = element;\n                element = this.finishNode(chainNode, \"ChainExpression\");\n            }\n            return element;\n        }\n        base = element;\n    }\n};\npp$3.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained) {\n    var optionalSupported = this.options.ecmaVersion >= 11;\n    var optional = optionalSupported && this.eat(types.questionDot);\n    if (noCalls && optional) this.raise(this.lastTokStart, \"Optional chaining cannot appear in the callee of new expressions\");\n    var computed = this.eat(types.bracketL);\n    if (computed || optional && this.type !== types.parenL && this.type !== types.backQuote || this.eat(types.dot)) {\n        var node = this.startNodeAt(startPos, startLoc);\n        node.object = base;\n        node.property = computed ? this.parseExpression() : this.parseIdent(this.options.allowReserved !== \"never\");\n        node.computed = !!computed;\n        if (computed) this.expect(types.bracketR);\n        if (optionalSupported) node.optional = optional;\n        base = this.finishNode(node, \"MemberExpression\");\n    } else if (!noCalls && this.eat(types.parenL)) {\n        var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n        this.yieldPos = 0;\n        this.awaitPos = 0;\n        this.awaitIdentPos = 0;\n        var exprList = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);\n        if (maybeAsyncArrow && !optional && !this.canInsertSemicolon() && this.eat(types.arrow)) {\n            this.checkPatternErrors(refDestructuringErrors, false);\n            this.checkYieldAwaitInDefaultParams();\n            if (this.awaitIdentPos > 0) this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\");\n            this.yieldPos = oldYieldPos;\n            this.awaitPos = oldAwaitPos;\n            this.awaitIdentPos = oldAwaitIdentPos;\n            return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true);\n        }\n        this.checkExpressionErrors(refDestructuringErrors, true);\n        this.yieldPos = oldYieldPos || this.yieldPos;\n        this.awaitPos = oldAwaitPos || this.awaitPos;\n        this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;\n        var node$1 = this.startNodeAt(startPos, startLoc);\n        node$1.callee = base;\n        node$1.arguments = exprList;\n        if (optionalSupported) node$1.optional = optional;\n        base = this.finishNode(node$1, \"CallExpression\");\n    } else if (this.type === types.backQuote) {\n        if (optional || optionalChained) this.raise(this.start, \"Optional chaining cannot appear in the tag of tagged template expressions\");\n        var node$2 = this.startNodeAt(startPos, startLoc);\n        node$2.tag = base;\n        node$2.quasi = this.parseTemplate({\n            isTagged: true\n        });\n        base = this.finishNode(node$2, \"TaggedTemplateExpression\");\n    }\n    return base;\n};\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\npp$3.parseExprAtom = function(refDestructuringErrors) {\n    // If a division operator appears in an expression position, the\n    // tokenizer got confused, and we force it to read a regexp instead.\n    if (this.type === types.slash) this.readRegexp();\n    var node, canBeArrow = this.potentialArrowAt === this.start;\n    switch(this.type){\n        case types._super:\n            if (!this.allowSuper) this.raise(this.start, \"'super' keyword outside a method\");\n            node = this.startNode();\n            this.next();\n            if (this.type === types.parenL && !this.allowDirectSuper) this.raise(node.start, \"super() call outside constructor of a subclass\");\n            // The `super` keyword can appear at below:\n            // SuperProperty:\n            //     super [ Expression ]\n            //     super . IdentifierName\n            // SuperCall:\n            //     super ( Arguments )\n            if (this.type !== types.dot && this.type !== types.bracketL && this.type !== types.parenL) this.unexpected();\n            return this.finishNode(node, \"Super\");\n        case types._this:\n            node = this.startNode();\n            this.next();\n            return this.finishNode(node, \"ThisExpression\");\n        case types.name:\n            var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;\n            var id = this.parseIdent(false);\n            if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(types._function)) return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true);\n            if (canBeArrow && !this.canInsertSemicolon()) {\n                if (this.eat(types.arrow)) return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [\n                    id\n                ], false);\n                if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === types.name && !containsEsc) {\n                    id = this.parseIdent(false);\n                    if (this.canInsertSemicolon() || !this.eat(types.arrow)) this.unexpected();\n                    return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [\n                        id\n                    ], true);\n                }\n            }\n            return id;\n        case types.regexp:\n            var value = this.value;\n            node = this.parseLiteral(value.value);\n            node.regex = {\n                pattern: value.pattern,\n                flags: value.flags\n            };\n            return node;\n        case types.num:\n        case types.string:\n            return this.parseLiteral(this.value);\n        case types._null:\n        case types._true:\n        case types._false:\n            node = this.startNode();\n            node.value = this.type === types._null ? null : this.type === types._true;\n            node.raw = this.type.keyword;\n            this.next();\n            return this.finishNode(node, \"Literal\");\n        case types.parenL:\n            var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow);\n            if (refDestructuringErrors) {\n                if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr)) refDestructuringErrors.parenthesizedAssign = start;\n                if (refDestructuringErrors.parenthesizedBind < 0) refDestructuringErrors.parenthesizedBind = start;\n            }\n            return expr;\n        case types.bracketL:\n            node = this.startNode();\n            this.next();\n            node.elements = this.parseExprList(types.bracketR, true, true, refDestructuringErrors);\n            return this.finishNode(node, \"ArrayExpression\");\n        case types.braceL:\n            return this.parseObj(false, refDestructuringErrors);\n        case types._function:\n            node = this.startNode();\n            this.next();\n            return this.parseFunction(node, 0);\n        case types._class:\n            return this.parseClass(this.startNode(), false);\n        case types._new:\n            return this.parseNew();\n        case types.backQuote:\n            return this.parseTemplate();\n        case types._import:\n            if (this.options.ecmaVersion >= 11) return this.parseExprImport();\n            else return this.unexpected();\n        default:\n            this.unexpected();\n    }\n};\npp$3.parseExprImport = function() {\n    var node = this.startNode();\n    // Consume `import` as an identifier for `import.meta`.\n    // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.\n    if (this.containsEsc) this.raiseRecoverable(this.start, \"Escape sequence in keyword import\");\n    var meta = this.parseIdent(true);\n    switch(this.type){\n        case types.parenL:\n            return this.parseDynamicImport(node);\n        case types.dot:\n            node.meta = meta;\n            return this.parseImportMeta(node);\n        default:\n            this.unexpected();\n    }\n};\npp$3.parseDynamicImport = function(node) {\n    this.next(); // skip `(`\n    // Parse node.source.\n    node.source = this.parseMaybeAssign();\n    // Verify ending.\n    if (!this.eat(types.parenR)) {\n        var errorPos = this.start;\n        if (this.eat(types.comma) && this.eat(types.parenR)) this.raiseRecoverable(errorPos, \"Trailing comma is not allowed in import()\");\n        else this.unexpected(errorPos);\n    }\n    return this.finishNode(node, \"ImportExpression\");\n};\npp$3.parseImportMeta = function(node) {\n    this.next(); // skip `.`\n    var containsEsc = this.containsEsc;\n    node.property = this.parseIdent(true);\n    if (node.property.name !== \"meta\") this.raiseRecoverable(node.property.start, \"The only valid meta property for import is 'import.meta'\");\n    if (containsEsc) this.raiseRecoverable(node.start, \"'import.meta' must not contain escaped characters\");\n    if (this.options.sourceType !== \"module\") this.raiseRecoverable(node.start, \"Cannot use 'import.meta' outside a module\");\n    return this.finishNode(node, \"MetaProperty\");\n};\npp$3.parseLiteral = function(value) {\n    var node = this.startNode();\n    node.value = value;\n    node.raw = this.input.slice(this.start, this.end);\n    if (node.raw.charCodeAt(node.raw.length - 1) === 110) node.bigint = node.raw.slice(0, -1).replace(/_/g, \"\");\n    this.next();\n    return this.finishNode(node, \"Literal\");\n};\npp$3.parseParenExpression = function() {\n    this.expect(types.parenL);\n    var val = this.parseExpression();\n    this.expect(types.parenR);\n    return val;\n};\npp$3.parseParenAndDistinguishExpression = function(canBeArrow) {\n    var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;\n    if (this.options.ecmaVersion >= 6) {\n        this.next();\n        var innerStartPos = this.start, innerStartLoc = this.startLoc;\n        var exprList = [], first = true, lastIsComma = false;\n        var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;\n        this.yieldPos = 0;\n        this.awaitPos = 0;\n        // Do not save awaitIdentPos to allow checking awaits nested in parameters\n        while(this.type !== types.parenR){\n            first ? first = false : this.expect(types.comma);\n            if (allowTrailingComma && this.afterTrailingComma(types.parenR, true)) {\n                lastIsComma = true;\n                break;\n            } else if (this.type === types.ellipsis) {\n                spreadStart = this.start;\n                exprList.push(this.parseParenItem(this.parseRestBinding()));\n                if (this.type === types.comma) this.raise(this.start, \"Comma is not permitted after the rest element\");\n                break;\n            } else exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));\n        }\n        var innerEndPos = this.start, innerEndLoc = this.startLoc;\n        this.expect(types.parenR);\n        if (canBeArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {\n            this.checkPatternErrors(refDestructuringErrors, false);\n            this.checkYieldAwaitInDefaultParams();\n            this.yieldPos = oldYieldPos;\n            this.awaitPos = oldAwaitPos;\n            return this.parseParenArrowList(startPos, startLoc, exprList);\n        }\n        if (!exprList.length || lastIsComma) this.unexpected(this.lastTokStart);\n        if (spreadStart) this.unexpected(spreadStart);\n        this.checkExpressionErrors(refDestructuringErrors, true);\n        this.yieldPos = oldYieldPos || this.yieldPos;\n        this.awaitPos = oldAwaitPos || this.awaitPos;\n        if (exprList.length > 1) {\n            val = this.startNodeAt(innerStartPos, innerStartLoc);\n            val.expressions = exprList;\n            this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n        } else val = exprList[0];\n    } else val = this.parseParenExpression();\n    if (this.options.preserveParens) {\n        var par = this.startNodeAt(startPos, startLoc);\n        par.expression = val;\n        return this.finishNode(par, \"ParenthesizedExpression\");\n    } else return val;\n};\npp$3.parseParenItem = function(item) {\n    return item;\n};\npp$3.parseParenArrowList = function(startPos, startLoc, exprList) {\n    return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList);\n};\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\nvar empty$1 = [];\npp$3.parseNew = function() {\n    if (this.containsEsc) this.raiseRecoverable(this.start, \"Escape sequence in keyword new\");\n    var node = this.startNode();\n    var meta = this.parseIdent(true);\n    if (this.options.ecmaVersion >= 6 && this.eat(types.dot)) {\n        node.meta = meta;\n        var containsEsc = this.containsEsc;\n        node.property = this.parseIdent(true);\n        if (node.property.name !== \"target\") this.raiseRecoverable(node.property.start, \"The only valid meta property for new is 'new.target'\");\n        if (containsEsc) this.raiseRecoverable(node.start, \"'new.target' must not contain escaped characters\");\n        if (!this.inNonArrowFunction()) this.raiseRecoverable(node.start, \"'new.target' can only be used in functions\");\n        return this.finishNode(node, \"MetaProperty\");\n    }\n    var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types._import;\n    node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);\n    if (isImport && node.callee.type === \"ImportExpression\") this.raise(startPos, \"Cannot use new with import()\");\n    if (this.eat(types.parenL)) node.arguments = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false);\n    else node.arguments = empty$1;\n    return this.finishNode(node, \"NewExpression\");\n};\n// Parse template expression.\npp$3.parseTemplateElement = function(ref) {\n    var isTagged = ref.isTagged;\n    var elem = this.startNode();\n    if (this.type === types.invalidTemplate) {\n        if (!isTagged) this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\");\n        elem.value = {\n            raw: this.value,\n            cooked: null\n        };\n    } else elem.value = {\n        raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n        cooked: this.value\n    };\n    this.next();\n    elem.tail = this.type === types.backQuote;\n    return this.finishNode(elem, \"TemplateElement\");\n};\npp$3.parseTemplate = function(ref) {\n    if (ref === void 0) ref = {};\n    var isTagged = ref.isTagged;\n    if (isTagged === void 0) isTagged = false;\n    var node = this.startNode();\n    this.next();\n    node.expressions = [];\n    var curElt = this.parseTemplateElement({\n        isTagged: isTagged\n    });\n    node.quasis = [\n        curElt\n    ];\n    while(!curElt.tail){\n        if (this.type === types.eof) this.raise(this.pos, \"Unterminated template literal\");\n        this.expect(types.dollarBraceL);\n        node.expressions.push(this.parseExpression());\n        this.expect(types.braceR);\n        node.quasis.push(curElt = this.parseTemplateElement({\n            isTagged: isTagged\n        }));\n    }\n    this.next();\n    return this.finishNode(node, \"TemplateLiteral\");\n};\npp$3.isAsyncProp = function(prop) {\n    return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" && (this.type === types.name || this.type === types.num || this.type === types.string || this.type === types.bracketL || this.type.keyword || this.options.ecmaVersion >= 9 && this.type === types.star) && !lineBreak.test(this.input.slice(this.lastTokEnd, this.start));\n};\n// Parse an object literal or binding pattern.\npp$3.parseObj = function(isPattern, refDestructuringErrors) {\n    var node = this.startNode(), first = true, propHash = {};\n    node.properties = [];\n    this.next();\n    while(!this.eat(types.braceR)){\n        if (!first) {\n            this.expect(types.comma);\n            if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types.braceR)) break;\n        } else first = false;\n        var prop = this.parseProperty(isPattern, refDestructuringErrors);\n        if (!isPattern) this.checkPropClash(prop, propHash, refDestructuringErrors);\n        node.properties.push(prop);\n    }\n    return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\");\n};\npp$3.parseProperty = function(isPattern, refDestructuringErrors) {\n    var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;\n    if (this.options.ecmaVersion >= 9 && this.eat(types.ellipsis)) {\n        if (isPattern) {\n            prop.argument = this.parseIdent(false);\n            if (this.type === types.comma) this.raise(this.start, \"Comma is not permitted after the rest element\");\n            return this.finishNode(prop, \"RestElement\");\n        }\n        // To disallow parenthesized identifier via `this.toAssignable()`.\n        if (this.type === types.parenL && refDestructuringErrors) {\n            if (refDestructuringErrors.parenthesizedAssign < 0) refDestructuringErrors.parenthesizedAssign = this.start;\n            if (refDestructuringErrors.parenthesizedBind < 0) refDestructuringErrors.parenthesizedBind = this.start;\n        }\n        // Parse argument.\n        prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n        // To disallow trailing comma via `this.toAssignable()`.\n        if (this.type === types.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) refDestructuringErrors.trailingComma = this.start;\n        // Finish\n        return this.finishNode(prop, \"SpreadElement\");\n    }\n    if (this.options.ecmaVersion >= 6) {\n        prop.method = false;\n        prop.shorthand = false;\n        if (isPattern || refDestructuringErrors) {\n            startPos = this.start;\n            startLoc = this.startLoc;\n        }\n        if (!isPattern) isGenerator = this.eat(types.star);\n    }\n    var containsEsc = this.containsEsc;\n    this.parsePropertyName(prop);\n    if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n        isAsync = true;\n        isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);\n        this.parsePropertyName(prop, refDestructuringErrors);\n    } else isAsync = false;\n    this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);\n    return this.finishNode(prop, \"Property\");\n};\npp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n    if ((isGenerator || isAsync) && this.type === types.colon) this.unexpected();\n    if (this.eat(types.colon)) {\n        prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);\n        prop.kind = \"init\";\n    } else if (this.options.ecmaVersion >= 6 && this.type === types.parenL) {\n        if (isPattern) this.unexpected();\n        prop.kind = \"init\";\n        prop.method = true;\n        prop.value = this.parseMethod(isGenerator, isAsync);\n    } else if (!isPattern && !containsEsc && this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" && (prop.key.name === \"get\" || prop.key.name === \"set\") && this.type !== types.comma && this.type !== types.braceR && this.type !== types.eq) {\n        if (isGenerator || isAsync) this.unexpected();\n        prop.kind = prop.key.name;\n        this.parsePropertyName(prop);\n        prop.value = this.parseMethod(false);\n        var paramCount = prop.kind === \"get\" ? 0 : 1;\n        if (prop.value.params.length !== paramCount) {\n            var start = prop.value.start;\n            if (prop.kind === \"get\") this.raiseRecoverable(start, \"getter should have no params\");\n            else this.raiseRecoverable(start, \"setter should have exactly one param\");\n        } else if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\") this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\");\n    } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n        if (isGenerator || isAsync) this.unexpected();\n        this.checkUnreserved(prop.key);\n        if (prop.key.name === \"await\" && !this.awaitIdentPos) this.awaitIdentPos = startPos;\n        prop.kind = \"init\";\n        if (isPattern) prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);\n        else if (this.type === types.eq && refDestructuringErrors) {\n            if (refDestructuringErrors.shorthandAssign < 0) refDestructuringErrors.shorthandAssign = this.start;\n            prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);\n        } else prop.value = prop.key;\n        prop.shorthand = true;\n    } else this.unexpected();\n};\npp$3.parsePropertyName = function(prop) {\n    if (this.options.ecmaVersion >= 6) {\n        if (this.eat(types.bracketL)) {\n            prop.computed = true;\n            prop.key = this.parseMaybeAssign();\n            this.expect(types.bracketR);\n            return prop.key;\n        } else prop.computed = false;\n    }\n    return prop.key = this.type === types.num || this.type === types.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\");\n};\n// Initialize empty function node.\npp$3.initFunction = function(node) {\n    node.id = null;\n    if (this.options.ecmaVersion >= 6) node.generator = node.expression = false;\n    if (this.options.ecmaVersion >= 8) node.async = false;\n};\n// Parse object or class method.\npp$3.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n    var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.initFunction(node);\n    if (this.options.ecmaVersion >= 6) node.generator = isGenerator;\n    if (this.options.ecmaVersion >= 8) node.async = !!isAsync;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));\n    this.expect(types.parenL);\n    node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);\n    this.checkYieldAwaitInDefaultParams();\n    this.parseFunctionBody(node, false, true);\n    this.yieldPos = oldYieldPos;\n    this.awaitPos = oldAwaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos;\n    return this.finishNode(node, \"FunctionExpression\");\n};\n// Parse arrow function expression with given parameters.\npp$3.parseArrowExpression = function(node, params, isAsync) {\n    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);\n    this.initFunction(node);\n    if (this.options.ecmaVersion >= 8) node.async = !!isAsync;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    node.params = this.toAssignableList(params, true);\n    this.parseFunctionBody(node, true, false);\n    this.yieldPos = oldYieldPos;\n    this.awaitPos = oldAwaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos;\n    return this.finishNode(node, \"ArrowFunctionExpression\");\n};\n// Parse function body and check parameters.\npp$3.parseFunctionBody = function(node, isArrowFunction, isMethod) {\n    var isExpression = isArrowFunction && this.type !== types.braceL;\n    var oldStrict = this.strict, useStrict = false;\n    if (isExpression) {\n        node.body = this.parseMaybeAssign();\n        node.expression = true;\n        this.checkParams(node, false);\n    } else {\n        var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);\n        if (!oldStrict || nonSimple) {\n            useStrict = this.strictDirective(this.end);\n            // If this is a strict mode function, verify that argument names\n            // are not repeated, and it does not try to bind the words `eval`\n            // or `arguments`.\n            if (useStrict && nonSimple) this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\");\n        }\n        // Start a new scope with regard to labels and the `inFunction`\n        // flag (restore them to their old value afterwards).\n        var oldLabels = this.labels;\n        this.labels = [];\n        if (useStrict) this.strict = true;\n        // Add the params to varDeclaredNames to ensure that an error is thrown\n        // if a let/const declaration in the function clashes with one of the params.\n        this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));\n        // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n        if (this.strict && node.id) this.checkLVal(node.id, BIND_OUTSIDE);\n        node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);\n        node.expression = false;\n        this.adaptDirectivePrologue(node.body.body);\n        this.labels = oldLabels;\n    }\n    this.exitScope();\n};\npp$3.isSimpleParamList = function(params) {\n    for(var i = 0, list = params; i < list.length; i += 1){\n        var param = list[i];\n        if (param.type !== \"Identifier\") return false;\n    }\n    return true;\n};\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\npp$3.checkParams = function(node, allowDuplicates) {\n    var nameHash = {};\n    for(var i = 0, list = node.params; i < list.length; i += 1){\n        var param = list[i];\n        this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash);\n    }\n};\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\npp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n    var elts = [], first = true;\n    while(!this.eat(close)){\n        if (!first) {\n            this.expect(types.comma);\n            if (allowTrailingComma && this.afterTrailingComma(close)) break;\n        } else first = false;\n        var elt = void 0;\n        if (allowEmpty && this.type === types.comma) elt = null;\n        else if (this.type === types.ellipsis) {\n            elt = this.parseSpread(refDestructuringErrors);\n            if (refDestructuringErrors && this.type === types.comma && refDestructuringErrors.trailingComma < 0) refDestructuringErrors.trailingComma = this.start;\n        } else elt = this.parseMaybeAssign(false, refDestructuringErrors);\n        elts.push(elt);\n    }\n    return elts;\n};\npp$3.checkUnreserved = function(ref) {\n    var start = ref.start;\n    var end = ref.end;\n    var name = ref.name;\n    if (this.inGenerator && name === \"yield\") this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\");\n    if (this.inAsync && name === \"await\") this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\");\n    if (this.keywords.test(name)) this.raise(start, \"Unexpected keyword '\" + name + \"'\");\n    if (this.options.ecmaVersion < 6 && this.input.slice(start, end).indexOf(\"\\\\\") !== -1) return;\n    var re = this.strict ? this.reservedWordsStrict : this.reservedWords;\n    if (re.test(name)) {\n        if (!this.inAsync && name === \"await\") this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\");\n        this.raiseRecoverable(start, \"The keyword '\" + name + \"' is reserved\");\n    }\n};\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\npp$3.parseIdent = function(liberal, isBinding) {\n    var node = this.startNode();\n    if (this.type === types.name) node.name = this.value;\n    else if (this.type.keyword) {\n        node.name = this.type.keyword;\n        // To fix https://github.com/acornjs/acorn/issues/575\n        // `class` and `function` keywords push new context into this.context.\n        // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n        // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n        if ((node.name === \"class\" || node.name === \"function\") && (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) this.context.pop();\n    } else this.unexpected();\n    this.next(!!liberal);\n    this.finishNode(node, \"Identifier\");\n    if (!liberal) {\n        this.checkUnreserved(node);\n        if (node.name === \"await\" && !this.awaitIdentPos) this.awaitIdentPos = node.start;\n    }\n    return node;\n};\n// Parses yield expression inside generator.\npp$3.parseYield = function(noIn) {\n    if (!this.yieldPos) this.yieldPos = this.start;\n    var node = this.startNode();\n    this.next();\n    if (this.type === types.semi || this.canInsertSemicolon() || this.type !== types.star && !this.type.startsExpr) {\n        node.delegate = false;\n        node.argument = null;\n    } else {\n        node.delegate = this.eat(types.star);\n        node.argument = this.parseMaybeAssign(noIn);\n    }\n    return this.finishNode(node, \"YieldExpression\");\n};\npp$3.parseAwait = function() {\n    if (!this.awaitPos) this.awaitPos = this.start;\n    var node = this.startNode();\n    this.next();\n    node.argument = this.parseMaybeUnary(null, false);\n    return this.finishNode(node, \"AwaitExpression\");\n};\nvar pp$4 = Parser.prototype;\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\npp$4.raise = function(pos, message) {\n    var loc = getLineInfo(this.input, pos);\n    message += \" (\" + loc.line + \":\" + loc.column + \")\";\n    var err = new SyntaxError(message);\n    err.pos = pos;\n    err.loc = loc;\n    err.raisedAt = this.pos;\n    throw err;\n};\npp$4.raiseRecoverable = pp$4.raise;\npp$4.curPosition = function() {\n    if (this.options.locations) return new Position(this.curLine, this.pos - this.lineStart);\n};\nvar pp$5 = Parser.prototype;\nvar Scope = function Scope(flags) {\n    this.flags = flags;\n    // A list of var-declared names in the current lexical scope\n    this.var = [];\n    // A list of lexically-declared names in the current lexical scope\n    this.lexical = [];\n    // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n    this.functions = [];\n};\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\npp$5.enterScope = function(flags) {\n    this.scopeStack.push(new Scope(flags));\n};\npp$5.exitScope = function() {\n    this.scopeStack.pop();\n};\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp$5.treatFunctionsAsVarInScope = function(scope) {\n    return scope.flags & SCOPE_FUNCTION || !this.inModule && scope.flags & SCOPE_TOP;\n};\npp$5.declareName = function(name, bindingType, pos) {\n    var redeclared = false;\n    if (bindingType === BIND_LEXICAL) {\n        var scope = this.currentScope();\n        redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;\n        scope.lexical.push(name);\n        if (this.inModule && scope.flags & SCOPE_TOP) delete this.undefinedExports[name];\n    } else if (bindingType === BIND_SIMPLE_CATCH) {\n        var scope$1 = this.currentScope();\n        scope$1.lexical.push(name);\n    } else if (bindingType === BIND_FUNCTION) {\n        var scope$2 = this.currentScope();\n        if (this.treatFunctionsAsVar) redeclared = scope$2.lexical.indexOf(name) > -1;\n        else redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1;\n        scope$2.functions.push(name);\n    } else for(var i = this.scopeStack.length - 1; i >= 0; --i){\n        var scope$3 = this.scopeStack[i];\n        if (scope$3.lexical.indexOf(name) > -1 && !(scope$3.flags & SCOPE_SIMPLE_CATCH && scope$3.lexical[0] === name) || !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {\n            redeclared = true;\n            break;\n        }\n        scope$3.var.push(name);\n        if (this.inModule && scope$3.flags & SCOPE_TOP) delete this.undefinedExports[name];\n        if (scope$3.flags & SCOPE_VAR) break;\n    }\n    if (redeclared) this.raiseRecoverable(pos, \"Identifier '\" + name + \"' has already been declared\");\n};\npp$5.checkLocalExport = function(id) {\n    // scope.functions must be empty as Module code is always strict.\n    if (this.scopeStack[0].lexical.indexOf(id.name) === -1 && this.scopeStack[0].var.indexOf(id.name) === -1) this.undefinedExports[id.name] = id;\n};\npp$5.currentScope = function() {\n    return this.scopeStack[this.scopeStack.length - 1];\n};\npp$5.currentVarScope = function() {\n    for(var i = this.scopeStack.length - 1;; i--){\n        var scope = this.scopeStack[i];\n        if (scope.flags & SCOPE_VAR) return scope;\n    }\n};\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp$5.currentThisScope = function() {\n    for(var i = this.scopeStack.length - 1;; i--){\n        var scope = this.scopeStack[i];\n        if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) return scope;\n    }\n};\nvar Node = function Node(parser, pos, loc) {\n    this.type = \"\";\n    this.start = pos;\n    this.end = 0;\n    if (parser.options.locations) this.loc = new SourceLocation(parser, loc);\n    if (parser.options.directSourceFile) this.sourceFile = parser.options.directSourceFile;\n    if (parser.options.ranges) this.range = [\n        pos,\n        0\n    ];\n};\n// Start an AST node, attaching a start offset.\nvar pp$6 = Parser.prototype;\npp$6.startNode = function() {\n    return new Node(this, this.start, this.startLoc);\n};\npp$6.startNodeAt = function(pos, loc) {\n    return new Node(this, pos, loc);\n};\n// Finish an AST node, adding `type` and `end` properties.\nfunction finishNodeAt(node, type, pos, loc) {\n    node.type = type;\n    node.end = pos;\n    if (this.options.locations) node.loc.end = loc;\n    if (this.options.ranges) node.range[1] = pos;\n    return node;\n}\npp$6.finishNode = function(node, type) {\n    return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc);\n};\n// Finish node at given position\npp$6.finishNodeAt = function(node, type, pos, loc) {\n    return finishNodeAt.call(this, node, type, pos, loc);\n};\n// The algorithm used to determine whether a regexp can appear at a\nvar TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {\n    this.token = token;\n    this.isExpr = !!isExpr;\n    this.preserveSpace = !!preserveSpace;\n    this.override = override;\n    this.generator = !!generator;\n};\nvar types$1 = {\n    b_stat: new TokContext(\"{\", false),\n    b_expr: new TokContext(\"{\", true),\n    b_tmpl: new TokContext(\"${\", false),\n    p_stat: new TokContext(\"(\", false),\n    p_expr: new TokContext(\"(\", true),\n    q_tmpl: new TokContext(\"`\", true, true, function(p) {\n        return p.tryReadTemplateToken();\n    }),\n    f_stat: new TokContext(\"function\", false),\n    f_expr: new TokContext(\"function\", true),\n    f_expr_gen: new TokContext(\"function\", true, false, null, true),\n    f_gen: new TokContext(\"function\", false, false, null, true)\n};\nvar pp$7 = Parser.prototype;\npp$7.initialContext = function() {\n    return [\n        types$1.b_stat\n    ];\n};\npp$7.braceIsBlock = function(prevType) {\n    var parent = this.curContext();\n    if (parent === types$1.f_expr || parent === types$1.f_stat) return true;\n    if (prevType === types.colon && (parent === types$1.b_stat || parent === types$1.b_expr)) return !parent.isExpr;\n    // The check for `tt.name && exprAllowed` detects whether we are\n    // after a `yield` or `of` construct. See the `updateContext` for\n    // `tt.name`.\n    if (prevType === types._return || prevType === types.name && this.exprAllowed) return lineBreak.test(this.input.slice(this.lastTokEnd, this.start));\n    if (prevType === types._else || prevType === types.semi || prevType === types.eof || prevType === types.parenR || prevType === types.arrow) return true;\n    if (prevType === types.braceL) return parent === types$1.b_stat;\n    if (prevType === types._var || prevType === types._const || prevType === types.name) return false;\n    return !this.exprAllowed;\n};\npp$7.inGeneratorContext = function() {\n    for(var i = this.context.length - 1; i >= 1; i--){\n        var context = this.context[i];\n        if (context.token === \"function\") return context.generator;\n    }\n    return false;\n};\npp$7.updateContext = function(prevType) {\n    var update, type = this.type;\n    if (type.keyword && prevType === types.dot) this.exprAllowed = false;\n    else if (update = type.updateContext) update.call(this, prevType);\n    else this.exprAllowed = type.beforeExpr;\n};\n// Token-specific context update code\ntypes.parenR.updateContext = types.braceR.updateContext = function() {\n    if (this.context.length === 1) {\n        this.exprAllowed = true;\n        return;\n    }\n    var out = this.context.pop();\n    if (out === types$1.b_stat && this.curContext().token === \"function\") out = this.context.pop();\n    this.exprAllowed = !out.isExpr;\n};\ntypes.braceL.updateContext = function(prevType) {\n    this.context.push(this.braceIsBlock(prevType) ? types$1.b_stat : types$1.b_expr);\n    this.exprAllowed = true;\n};\ntypes.dollarBraceL.updateContext = function() {\n    this.context.push(types$1.b_tmpl);\n    this.exprAllowed = true;\n};\ntypes.parenL.updateContext = function(prevType) {\n    var statementParens = prevType === types._if || prevType === types._for || prevType === types._with || prevType === types._while;\n    this.context.push(statementParens ? types$1.p_stat : types$1.p_expr);\n    this.exprAllowed = true;\n};\ntypes.incDec.updateContext = function() {\n// tokExprAllowed stays unchanged\n};\ntypes._function.updateContext = types._class.updateContext = function(prevType) {\n    if (prevType.beforeExpr && prevType !== types.semi && prevType !== types._else && !(prevType === types._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) && !((prevType === types.colon || prevType === types.braceL) && this.curContext() === types$1.b_stat)) this.context.push(types$1.f_expr);\n    else this.context.push(types$1.f_stat);\n    this.exprAllowed = false;\n};\ntypes.backQuote.updateContext = function() {\n    if (this.curContext() === types$1.q_tmpl) this.context.pop();\n    else this.context.push(types$1.q_tmpl);\n    this.exprAllowed = false;\n};\ntypes.star.updateContext = function(prevType) {\n    if (prevType === types._function) {\n        var index = this.context.length - 1;\n        if (this.context[index] === types$1.f_expr) this.context[index] = types$1.f_expr_gen;\n        else this.context[index] = types$1.f_gen;\n    }\n    this.exprAllowed = true;\n};\ntypes.name.updateContext = function(prevType) {\n    var allowed = false;\n    if (this.options.ecmaVersion >= 6 && prevType !== types.dot) {\n        if (this.value === \"of\" && !this.exprAllowed || this.value === \"yield\" && this.inGeneratorContext()) allowed = true;\n    }\n    this.exprAllowed = allowed;\n};\n// This file contains Unicode properties extracted from the ECMAScript\n// specification. The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n// #table-binary-unicode-properties\nvar ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\";\nvar ecma10BinaryProperties = ecma9BinaryProperties + \" Extended_Pictographic\";\nvar ecma11BinaryProperties = ecma10BinaryProperties;\nvar unicodeBinaryProperties = {\n    9: ecma9BinaryProperties,\n    10: ecma10BinaryProperties,\n    11: ecma11BinaryProperties\n};\n// #table-unicode-general-category-values\nvar unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\";\n// #table-unicode-script-values\nvar ecma9ScriptValues = \"Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\";\nvar ecma10ScriptValues = ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\";\nvar ecma11ScriptValues = ecma10ScriptValues + \" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho\";\nvar unicodeScriptValues = {\n    9: ecma9ScriptValues,\n    10: ecma10ScriptValues,\n    11: ecma11ScriptValues\n};\nvar data = {};\nfunction buildUnicodeData(ecmaVersion) {\n    var d = data[ecmaVersion] = {\n        binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n        nonBinary: {\n            General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n            Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n        }\n    };\n    d.nonBinary.Script_Extensions = d.nonBinary.Script;\n    d.nonBinary.gc = d.nonBinary.General_Category;\n    d.nonBinary.sc = d.nonBinary.Script;\n    d.nonBinary.scx = d.nonBinary.Script_Extensions;\n}\nbuildUnicodeData(9);\nbuildUnicodeData(10);\nbuildUnicodeData(11);\nvar pp$8 = Parser.prototype;\nvar RegExpValidationState = function RegExpValidationState(parser) {\n    this.parser = parser;\n    this.validFlags = \"gim\" + (parser.options.ecmaVersion >= 6 ? \"uy\" : \"\") + (parser.options.ecmaVersion >= 9 ? \"s\" : \"\");\n    this.unicodeProperties = data[parser.options.ecmaVersion >= 11 ? 11 : parser.options.ecmaVersion];\n    this.source = \"\";\n    this.flags = \"\";\n    this.start = 0;\n    this.switchU = false;\n    this.switchN = false;\n    this.pos = 0;\n    this.lastIntValue = 0;\n    this.lastStringValue = \"\";\n    this.lastAssertionIsQuantifiable = false;\n    this.numCapturingParens = 0;\n    this.maxBackReference = 0;\n    this.groupNames = [];\n    this.backReferenceNames = [];\n};\nRegExpValidationState.prototype.reset = function reset(start, pattern, flags) {\n    var unicode = flags.indexOf(\"u\") !== -1;\n    this.start = start | 0;\n    this.source = pattern + \"\";\n    this.flags = flags;\n    this.switchU = unicode && this.parser.options.ecmaVersion >= 6;\n    this.switchN = unicode && this.parser.options.ecmaVersion >= 9;\n};\nRegExpValidationState.prototype.raise = function raise(message) {\n    this.parser.raiseRecoverable(this.start, \"Invalid regular expression: /\" + this.source + \"/: \" + message);\n};\n// If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\nRegExpValidationState.prototype.at = function at(i, forceU) {\n    if (forceU === void 0) forceU = false;\n    var s = this.source;\n    var l = s.length;\n    if (i >= l) return -1;\n    var c = s.charCodeAt(i);\n    if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) return c;\n    var next = s.charCodeAt(i + 1);\n    return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c;\n};\nRegExpValidationState.prototype.nextIndex = function nextIndex(i, forceU) {\n    if (forceU === void 0) forceU = false;\n    var s = this.source;\n    var l = s.length;\n    if (i >= l) return l;\n    var c = s.charCodeAt(i), next;\n    if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l || (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) return i + 1;\n    return i + 2;\n};\nRegExpValidationState.prototype.current = function current(forceU) {\n    if (forceU === void 0) forceU = false;\n    return this.at(this.pos, forceU);\n};\nRegExpValidationState.prototype.lookahead = function lookahead(forceU) {\n    if (forceU === void 0) forceU = false;\n    return this.at(this.nextIndex(this.pos, forceU), forceU);\n};\nRegExpValidationState.prototype.advance = function advance(forceU) {\n    if (forceU === void 0) forceU = false;\n    this.pos = this.nextIndex(this.pos, forceU);\n};\nRegExpValidationState.prototype.eat = function eat(ch, forceU) {\n    if (forceU === void 0) forceU = false;\n    if (this.current(forceU) === ch) {\n        this.advance(forceU);\n        return true;\n    }\n    return false;\n};\nfunction codePointToString(ch) {\n    if (ch <= 0xFFFF) return String.fromCharCode(ch);\n    ch -= 0x10000;\n    return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00);\n}\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */ pp$8.validateRegExpFlags = function(state) {\n    var validFlags = state.validFlags;\n    var flags = state.flags;\n    for(var i = 0; i < flags.length; i++){\n        var flag = flags.charAt(i);\n        if (validFlags.indexOf(flag) === -1) this.raise(state.start, \"Invalid regular expression flag\");\n        if (flags.indexOf(flag, i + 1) > -1) this.raise(state.start, \"Duplicate regular expression flag\");\n    }\n};\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */ pp$8.validateRegExpPattern = function(state) {\n    this.regexp_pattern(state);\n    // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n    // parsing contains a |GroupName|, reparse with the goal symbol\n    // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n    // exception if _P_ did not conform to the grammar, if any elements of _P_\n    // were not matched by the parse, or if any Early Error conditions exist.\n    if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {\n        state.switchN = true;\n        this.regexp_pattern(state);\n    }\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp$8.regexp_pattern = function(state) {\n    state.pos = 0;\n    state.lastIntValue = 0;\n    state.lastStringValue = \"\";\n    state.lastAssertionIsQuantifiable = false;\n    state.numCapturingParens = 0;\n    state.maxBackReference = 0;\n    state.groupNames.length = 0;\n    state.backReferenceNames.length = 0;\n    this.regexp_disjunction(state);\n    if (state.pos !== state.source.length) {\n        // Make the same messages as V8.\n        if (state.eat(0x29 /* ) */ )) state.raise(\"Unmatched ')'\");\n        if (state.eat(0x5D /* ] */ ) || state.eat(0x7D /* } */ )) state.raise(\"Lone quantifier brackets\");\n    }\n    if (state.maxBackReference > state.numCapturingParens) state.raise(\"Invalid escape\");\n    for(var i = 0, list = state.backReferenceNames; i < list.length; i += 1){\n        var name = list[i];\n        if (state.groupNames.indexOf(name) === -1) state.raise(\"Invalid named capture referenced\");\n    }\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp$8.regexp_disjunction = function(state) {\n    this.regexp_alternative(state);\n    while(state.eat(0x7C /* | */ ))this.regexp_alternative(state);\n    // Make the same message as V8.\n    if (this.regexp_eatQuantifier(state, true)) state.raise(\"Nothing to repeat\");\n    if (state.eat(0x7B /* { */ )) state.raise(\"Lone quantifier brackets\");\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp$8.regexp_alternative = function(state) {\n    while(state.pos < state.source.length && this.regexp_eatTerm(state));\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp$8.regexp_eatTerm = function(state) {\n    if (this.regexp_eatAssertion(state)) {\n        // Handle `QuantifiableAssertion Quantifier` alternative.\n        // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n        // is a QuantifiableAssertion.\n        if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) // Make the same message as V8.\n        {\n            if (state.switchU) state.raise(\"Invalid quantifier\");\n        }\n        return true;\n    }\n    if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n        this.regexp_eatQuantifier(state);\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp$8.regexp_eatAssertion = function(state) {\n    var start = state.pos;\n    state.lastAssertionIsQuantifiable = false;\n    // ^, $\n    if (state.eat(0x5E /* ^ */ ) || state.eat(0x24 /* $ */ )) return true;\n    // \\b \\B\n    if (state.eat(0x5C /* \\ */ )) {\n        if (state.eat(0x42 /* B */ ) || state.eat(0x62 /* b */ )) return true;\n        state.pos = start;\n    }\n    // Lookahead / Lookbehind\n    if (state.eat(0x28 /* ( */ ) && state.eat(0x3F /* ? */ )) {\n        var lookbehind = false;\n        if (this.options.ecmaVersion >= 9) lookbehind = state.eat(0x3C /* < */ );\n        if (state.eat(0x3D /* = */ ) || state.eat(0x21 /* ! */ )) {\n            this.regexp_disjunction(state);\n            if (!state.eat(0x29 /* ) */ )) state.raise(\"Unterminated group\");\n            state.lastAssertionIsQuantifiable = !lookbehind;\n            return true;\n        }\n    }\n    state.pos = start;\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp$8.regexp_eatQuantifier = function(state, noError) {\n    if (noError === void 0) noError = false;\n    if (this.regexp_eatQuantifierPrefix(state, noError)) {\n        state.eat(0x3F /* ? */ );\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp$8.regexp_eatQuantifierPrefix = function(state, noError) {\n    return state.eat(0x2A /* * */ ) || state.eat(0x2B /* + */ ) || state.eat(0x3F /* ? */ ) || this.regexp_eatBracedQuantifier(state, noError);\n};\npp$8.regexp_eatBracedQuantifier = function(state, noError) {\n    var start = state.pos;\n    if (state.eat(0x7B /* { */ )) {\n        var min = 0, max = -1;\n        if (this.regexp_eatDecimalDigits(state)) {\n            min = state.lastIntValue;\n            if (state.eat(0x2C /* , */ ) && this.regexp_eatDecimalDigits(state)) max = state.lastIntValue;\n            if (state.eat(0x7D /* } */ )) {\n                // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n                if (max !== -1 && max < min && !noError) state.raise(\"numbers out of order in {} quantifier\");\n                return true;\n            }\n        }\n        if (state.switchU && !noError) state.raise(\"Incomplete quantifier\");\n        state.pos = start;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp$8.regexp_eatAtom = function(state) {\n    return this.regexp_eatPatternCharacters(state) || state.eat(0x2E /* . */ ) || this.regexp_eatReverseSolidusAtomEscape(state) || this.regexp_eatCharacterClass(state) || this.regexp_eatUncapturingGroup(state) || this.regexp_eatCapturingGroup(state);\n};\npp$8.regexp_eatReverseSolidusAtomEscape = function(state) {\n    var start = state.pos;\n    if (state.eat(0x5C /* \\ */ )) {\n        if (this.regexp_eatAtomEscape(state)) return true;\n        state.pos = start;\n    }\n    return false;\n};\npp$8.regexp_eatUncapturingGroup = function(state) {\n    var start = state.pos;\n    if (state.eat(0x28 /* ( */ )) {\n        if (state.eat(0x3F /* ? */ ) && state.eat(0x3A /* : */ )) {\n            this.regexp_disjunction(state);\n            if (state.eat(0x29 /* ) */ )) return true;\n            state.raise(\"Unterminated group\");\n        }\n        state.pos = start;\n    }\n    return false;\n};\npp$8.regexp_eatCapturingGroup = function(state) {\n    if (state.eat(0x28 /* ( */ )) {\n        if (this.options.ecmaVersion >= 9) this.regexp_groupSpecifier(state);\n        else if (state.current() === 0x3F /* ? */ ) state.raise(\"Invalid group\");\n        this.regexp_disjunction(state);\n        if (state.eat(0x29 /* ) */ )) {\n            state.numCapturingParens += 1;\n            return true;\n        }\n        state.raise(\"Unterminated group\");\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp$8.regexp_eatExtendedAtom = function(state) {\n    return state.eat(0x2E /* . */ ) || this.regexp_eatReverseSolidusAtomEscape(state) || this.regexp_eatCharacterClass(state) || this.regexp_eatUncapturingGroup(state) || this.regexp_eatCapturingGroup(state) || this.regexp_eatInvalidBracedQuantifier(state) || this.regexp_eatExtendedPatternCharacter(state);\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp$8.regexp_eatInvalidBracedQuantifier = function(state) {\n    if (this.regexp_eatBracedQuantifier(state, true)) state.raise(\"Nothing to repeat\");\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp$8.regexp_eatSyntaxCharacter = function(state) {\n    var ch = state.current();\n    if (isSyntaxCharacter(ch)) {\n        state.lastIntValue = ch;\n        state.advance();\n        return true;\n    }\n    return false;\n};\nfunction isSyntaxCharacter(ch) {\n    return ch === 0x24 /* $ */  || ch >= 0x28 /* ( */  && ch <= 0x2B /* + */  || ch === 0x2E /* . */  || ch === 0x3F /* ? */  || ch >= 0x5B /* [ */  && ch <= 0x5E /* ^ */  || ch >= 0x7B /* { */  && ch <= 0x7D /* } */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp$8.regexp_eatPatternCharacters = function(state) {\n    var start = state.pos;\n    var ch = 0;\n    while((ch = state.current()) !== -1 && !isSyntaxCharacter(ch))state.advance();\n    return state.pos !== start;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp$8.regexp_eatExtendedPatternCharacter = function(state) {\n    var ch = state.current();\n    if (ch !== -1 && ch !== 0x24 /* $ */  && !(ch >= 0x28 /* ( */  && ch <= 0x2B /* + */ ) && ch !== 0x2E /* . */  && ch !== 0x3F /* ? */  && ch !== 0x5B /* [ */  && ch !== 0x5E /* ^ */  && ch !== 0x7C /* | */ ) {\n        state.advance();\n        return true;\n    }\n    return false;\n};\n// GroupSpecifier ::\n//   [empty]\n//   `?` GroupName\npp$8.regexp_groupSpecifier = function(state) {\n    if (state.eat(0x3F /* ? */ )) {\n        if (this.regexp_eatGroupName(state)) {\n            if (state.groupNames.indexOf(state.lastStringValue) !== -1) state.raise(\"Duplicate capture group name\");\n            state.groupNames.push(state.lastStringValue);\n            return;\n        }\n        state.raise(\"Invalid group\");\n    }\n};\n// GroupName ::\n//   `<` RegExpIdentifierName `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$8.regexp_eatGroupName = function(state) {\n    state.lastStringValue = \"\";\n    if (state.eat(0x3C /* < */ )) {\n        if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */ )) return true;\n        state.raise(\"Invalid capture group name\");\n    }\n    return false;\n};\n// RegExpIdentifierName ::\n//   RegExpIdentifierStart\n//   RegExpIdentifierName RegExpIdentifierPart\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$8.regexp_eatRegExpIdentifierName = function(state) {\n    state.lastStringValue = \"\";\n    if (this.regexp_eatRegExpIdentifierStart(state)) {\n        state.lastStringValue += codePointToString(state.lastIntValue);\n        while(this.regexp_eatRegExpIdentifierPart(state))state.lastStringValue += codePointToString(state.lastIntValue);\n        return true;\n    }\n    return false;\n};\n// RegExpIdentifierStart ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\npp$8.regexp_eatRegExpIdentifierStart = function(state) {\n    var start = state.pos;\n    var forceU = this.options.ecmaVersion >= 11;\n    var ch = state.current(forceU);\n    state.advance(forceU);\n    if (ch === 0x5C /* \\ */  && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) ch = state.lastIntValue;\n    if (isRegExpIdentifierStart(ch)) {\n        state.lastIntValue = ch;\n        return true;\n    }\n    state.pos = start;\n    return false;\n};\nfunction isRegExpIdentifierStart(ch) {\n    return isIdentifierStart(ch, true) || ch === 0x24 /* $ */  || ch === 0x5F /* _ */ ;\n}\n// RegExpIdentifierPart ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\n//   <ZWNJ>\n//   <ZWJ>\npp$8.regexp_eatRegExpIdentifierPart = function(state) {\n    var start = state.pos;\n    var forceU = this.options.ecmaVersion >= 11;\n    var ch = state.current(forceU);\n    state.advance(forceU);\n    if (ch === 0x5C /* \\ */  && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) ch = state.lastIntValue;\n    if (isRegExpIdentifierPart(ch)) {\n        state.lastIntValue = ch;\n        return true;\n    }\n    state.pos = start;\n    return false;\n};\nfunction isRegExpIdentifierPart(ch) {\n    return isIdentifierChar(ch, true) || ch === 0x24 /* $ */  || ch === 0x5F /* _ */  || ch === 0x200C /* <ZWNJ> */  || ch === 0x200D /* <ZWJ> */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp$8.regexp_eatAtomEscape = function(state) {\n    if (this.regexp_eatBackReference(state) || this.regexp_eatCharacterClassEscape(state) || this.regexp_eatCharacterEscape(state) || state.switchN && this.regexp_eatKGroupName(state)) return true;\n    if (state.switchU) {\n        // Make the same message as V8.\n        if (state.current() === 0x63 /* c */ ) state.raise(\"Invalid unicode escape\");\n        state.raise(\"Invalid escape\");\n    }\n    return false;\n};\npp$8.regexp_eatBackReference = function(state) {\n    var start = state.pos;\n    if (this.regexp_eatDecimalEscape(state)) {\n        var n = state.lastIntValue;\n        if (state.switchU) {\n            // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n            if (n > state.maxBackReference) state.maxBackReference = n;\n            return true;\n        }\n        if (n <= state.numCapturingParens) return true;\n        state.pos = start;\n    }\n    return false;\n};\npp$8.regexp_eatKGroupName = function(state) {\n    if (state.eat(0x6B /* k */ )) {\n        if (this.regexp_eatGroupName(state)) {\n            state.backReferenceNames.push(state.lastStringValue);\n            return true;\n        }\n        state.raise(\"Invalid named reference\");\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp$8.regexp_eatCharacterEscape = function(state) {\n    return this.regexp_eatControlEscape(state) || this.regexp_eatCControlLetter(state) || this.regexp_eatZero(state) || this.regexp_eatHexEscapeSequence(state) || this.regexp_eatRegExpUnicodeEscapeSequence(state, false) || !state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state) || this.regexp_eatIdentityEscape(state);\n};\npp$8.regexp_eatCControlLetter = function(state) {\n    var start = state.pos;\n    if (state.eat(0x63 /* c */ )) {\n        if (this.regexp_eatControlLetter(state)) return true;\n        state.pos = start;\n    }\n    return false;\n};\npp$8.regexp_eatZero = function(state) {\n    if (state.current() === 0x30 /* 0 */  && !isDecimalDigit(state.lookahead())) {\n        state.lastIntValue = 0;\n        state.advance();\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp$8.regexp_eatControlEscape = function(state) {\n    var ch = state.current();\n    if (ch === 0x74 /* t */ ) {\n        state.lastIntValue = 0x09; /* \\t */ \n        state.advance();\n        return true;\n    }\n    if (ch === 0x6E /* n */ ) {\n        state.lastIntValue = 0x0A; /* \\n */ \n        state.advance();\n        return true;\n    }\n    if (ch === 0x76 /* v */ ) {\n        state.lastIntValue = 0x0B; /* \\v */ \n        state.advance();\n        return true;\n    }\n    if (ch === 0x66 /* f */ ) {\n        state.lastIntValue = 0x0C; /* \\f */ \n        state.advance();\n        return true;\n    }\n    if (ch === 0x72 /* r */ ) {\n        state.lastIntValue = 0x0D; /* \\r */ \n        state.advance();\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp$8.regexp_eatControlLetter = function(state) {\n    var ch = state.current();\n    if (isControlLetter(ch)) {\n        state.lastIntValue = ch % 0x20;\n        state.advance();\n        return true;\n    }\n    return false;\n};\nfunction isControlLetter(ch) {\n    return ch >= 0x41 /* A */  && ch <= 0x5A /* Z */  || ch >= 0x61 /* a */  && ch <= 0x7A /* z */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp$8.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {\n    if (forceU === void 0) forceU = false;\n    var start = state.pos;\n    var switchU = forceU || state.switchU;\n    if (state.eat(0x75 /* u */ )) {\n        if (this.regexp_eatFixedHexDigits(state, 4)) {\n            var lead = state.lastIntValue;\n            if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n                var leadSurrogateEnd = state.pos;\n                if (state.eat(0x5C /* \\ */ ) && state.eat(0x75 /* u */ ) && this.regexp_eatFixedHexDigits(state, 4)) {\n                    var trail = state.lastIntValue;\n                    if (trail >= 0xDC00 && trail <= 0xDFFF) {\n                        state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;\n                        return true;\n                    }\n                }\n                state.pos = leadSurrogateEnd;\n                state.lastIntValue = lead;\n            }\n            return true;\n        }\n        if (switchU && state.eat(0x7B /* { */ ) && this.regexp_eatHexDigits(state) && state.eat(0x7D /* } */ ) && isValidUnicode(state.lastIntValue)) return true;\n        if (switchU) state.raise(\"Invalid unicode escape\");\n        state.pos = start;\n    }\n    return false;\n};\nfunction isValidUnicode(ch) {\n    return ch >= 0 && ch <= 0x10FFFF;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp$8.regexp_eatIdentityEscape = function(state) {\n    if (state.switchU) {\n        if (this.regexp_eatSyntaxCharacter(state)) return true;\n        if (state.eat(0x2F /* / */ )) {\n            state.lastIntValue = 0x2F; /* / */ \n            return true;\n        }\n        return false;\n    }\n    var ch = state.current();\n    if (ch !== 0x63 /* c */  && (!state.switchN || ch !== 0x6B /* k */ )) {\n        state.lastIntValue = ch;\n        state.advance();\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp$8.regexp_eatDecimalEscape = function(state) {\n    state.lastIntValue = 0;\n    var ch = state.current();\n    if (ch >= 0x31 /* 1 */  && ch <= 0x39 /* 9 */ ) {\n        do {\n            state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */ );\n            state.advance();\n        }while ((ch = state.current()) >= 0x30 /* 0 */  && ch <= 0x39 /* 9 */ );\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp$8.regexp_eatCharacterClassEscape = function(state) {\n    var ch = state.current();\n    if (isCharacterClassEscape(ch)) {\n        state.lastIntValue = -1;\n        state.advance();\n        return true;\n    }\n    if (state.switchU && this.options.ecmaVersion >= 9 && (ch === 0x50 /* P */  || ch === 0x70 /* p */ )) {\n        state.lastIntValue = -1;\n        state.advance();\n        if (state.eat(0x7B /* { */ ) && this.regexp_eatUnicodePropertyValueExpression(state) && state.eat(0x7D /* } */ )) return true;\n        state.raise(\"Invalid property name\");\n    }\n    return false;\n};\nfunction isCharacterClassEscape(ch) {\n    return ch === 0x64 /* d */  || ch === 0x44 /* D */  || ch === 0x73 /* s */  || ch === 0x53 /* S */  || ch === 0x77 /* w */  || ch === 0x57 /* W */ ;\n}\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp$8.regexp_eatUnicodePropertyValueExpression = function(state) {\n    var start = state.pos;\n    // UnicodePropertyName `=` UnicodePropertyValue\n    if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */ )) {\n        var name = state.lastStringValue;\n        if (this.regexp_eatUnicodePropertyValue(state)) {\n            var value = state.lastStringValue;\n            this.regexp_validateUnicodePropertyNameAndValue(state, name, value);\n            return true;\n        }\n    }\n    state.pos = start;\n    // LoneUnicodePropertyNameOrValue\n    if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n        var nameOrValue = state.lastStringValue;\n        this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);\n        return true;\n    }\n    return false;\n};\npp$8.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n    if (!has(state.unicodeProperties.nonBinary, name)) state.raise(\"Invalid property name\");\n    if (!state.unicodeProperties.nonBinary[name].test(value)) state.raise(\"Invalid property value\");\n};\npp$8.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n    if (!state.unicodeProperties.binary.test(nameOrValue)) state.raise(\"Invalid property name\");\n};\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp$8.regexp_eatUnicodePropertyName = function(state) {\n    var ch = 0;\n    state.lastStringValue = \"\";\n    while(isUnicodePropertyNameCharacter(ch = state.current())){\n        state.lastStringValue += codePointToString(ch);\n        state.advance();\n    }\n    return state.lastStringValue !== \"\";\n};\nfunction isUnicodePropertyNameCharacter(ch) {\n    return isControlLetter(ch) || ch === 0x5F /* _ */ ;\n}\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp$8.regexp_eatUnicodePropertyValue = function(state) {\n    var ch = 0;\n    state.lastStringValue = \"\";\n    while(isUnicodePropertyValueCharacter(ch = state.current())){\n        state.lastStringValue += codePointToString(ch);\n        state.advance();\n    }\n    return state.lastStringValue !== \"\";\n};\nfunction isUnicodePropertyValueCharacter(ch) {\n    return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch);\n}\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp$8.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n    return this.regexp_eatUnicodePropertyValue(state);\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp$8.regexp_eatCharacterClass = function(state) {\n    if (state.eat(0x5B /* [ */ )) {\n        state.eat(0x5E /* ^ */ );\n        this.regexp_classRanges(state);\n        if (state.eat(0x5D /* ] */ )) return true;\n        // Unreachable since it threw \"unterminated regular expression\" error before.\n        state.raise(\"Unterminated character class\");\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp$8.regexp_classRanges = function(state) {\n    while(this.regexp_eatClassAtom(state)){\n        var left = state.lastIntValue;\n        if (state.eat(0x2D /* - */ ) && this.regexp_eatClassAtom(state)) {\n            var right = state.lastIntValue;\n            if (state.switchU && (left === -1 || right === -1)) state.raise(\"Invalid character class\");\n            if (left !== -1 && right !== -1 && left > right) state.raise(\"Range out of order in character class\");\n        }\n    }\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp$8.regexp_eatClassAtom = function(state) {\n    var start = state.pos;\n    if (state.eat(0x5C /* \\ */ )) {\n        if (this.regexp_eatClassEscape(state)) return true;\n        if (state.switchU) {\n            // Make the same message as V8.\n            var ch$1 = state.current();\n            if (ch$1 === 0x63 /* c */  || isOctalDigit(ch$1)) state.raise(\"Invalid class escape\");\n            state.raise(\"Invalid escape\");\n        }\n        state.pos = start;\n    }\n    var ch = state.current();\n    if (ch !== 0x5D /* ] */ ) {\n        state.lastIntValue = ch;\n        state.advance();\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp$8.regexp_eatClassEscape = function(state) {\n    var start = state.pos;\n    if (state.eat(0x62 /* b */ )) {\n        state.lastIntValue = 0x08; /* <BS> */ \n        return true;\n    }\n    if (state.switchU && state.eat(0x2D /* - */ )) {\n        state.lastIntValue = 0x2D; /* - */ \n        return true;\n    }\n    if (!state.switchU && state.eat(0x63 /* c */ )) {\n        if (this.regexp_eatClassControlLetter(state)) return true;\n        state.pos = start;\n    }\n    return this.regexp_eatCharacterClassEscape(state) || this.regexp_eatCharacterEscape(state);\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp$8.regexp_eatClassControlLetter = function(state) {\n    var ch = state.current();\n    if (isDecimalDigit(ch) || ch === 0x5F /* _ */ ) {\n        state.lastIntValue = ch % 0x20;\n        state.advance();\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$8.regexp_eatHexEscapeSequence = function(state) {\n    var start = state.pos;\n    if (state.eat(0x78 /* x */ )) {\n        if (this.regexp_eatFixedHexDigits(state, 2)) return true;\n        if (state.switchU) state.raise(\"Invalid escape\");\n        state.pos = start;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp$8.regexp_eatDecimalDigits = function(state) {\n    var start = state.pos;\n    var ch = 0;\n    state.lastIntValue = 0;\n    while(isDecimalDigit(ch = state.current())){\n        state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */ );\n        state.advance();\n    }\n    return state.pos !== start;\n};\nfunction isDecimalDigit(ch) {\n    return ch >= 0x30 /* 0 */  && ch <= 0x39 /* 9 */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp$8.regexp_eatHexDigits = function(state) {\n    var start = state.pos;\n    var ch = 0;\n    state.lastIntValue = 0;\n    while(isHexDigit(ch = state.current())){\n        state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n        state.advance();\n    }\n    return state.pos !== start;\n};\nfunction isHexDigit(ch) {\n    return ch >= 0x30 /* 0 */  && ch <= 0x39 /* 9 */  || ch >= 0x41 /* A */  && ch <= 0x46 /* F */  || ch >= 0x61 /* a */  && ch <= 0x66 /* f */ ;\n}\nfunction hexToInt(ch) {\n    if (ch >= 0x41 /* A */  && ch <= 0x46 /* F */ ) return 10 + (ch - 0x41 /* A */ );\n    if (ch >= 0x61 /* a */  && ch <= 0x66 /* f */ ) return 10 + (ch - 0x61 /* a */ );\n    return ch - 0x30 /* 0 */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp$8.regexp_eatLegacyOctalEscapeSequence = function(state) {\n    if (this.regexp_eatOctalDigit(state)) {\n        var n1 = state.lastIntValue;\n        if (this.regexp_eatOctalDigit(state)) {\n            var n2 = state.lastIntValue;\n            if (n1 <= 3 && this.regexp_eatOctalDigit(state)) state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;\n            else state.lastIntValue = n1 * 8 + n2;\n        } else state.lastIntValue = n1;\n        return true;\n    }\n    return false;\n};\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp$8.regexp_eatOctalDigit = function(state) {\n    var ch = state.current();\n    if (isOctalDigit(ch)) {\n        state.lastIntValue = ch - 0x30; /* 0 */ \n        state.advance();\n        return true;\n    }\n    state.lastIntValue = 0;\n    return false;\n};\nfunction isOctalDigit(ch) {\n    return ch >= 0x30 /* 0 */  && ch <= 0x37 /* 7 */ ;\n}\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$8.regexp_eatFixedHexDigits = function(state, length) {\n    var start = state.pos;\n    state.lastIntValue = 0;\n    for(var i = 0; i < length; ++i){\n        var ch = state.current();\n        if (!isHexDigit(ch)) {\n            state.pos = start;\n            return false;\n        }\n        state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n        state.advance();\n    }\n    return true;\n};\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\nvar Token = function Token(p) {\n    this.type = p.type;\n    this.value = p.value;\n    this.start = p.start;\n    this.end = p.end;\n    if (p.options.locations) this.loc = new SourceLocation(p, p.startLoc, p.endLoc);\n    if (p.options.ranges) this.range = [\n        p.start,\n        p.end\n    ];\n};\n// ## Tokenizer\nvar pp$9 = Parser.prototype;\n// Move to the next token\npp$9.next = function(ignoreEscapeSequenceInKeyword) {\n    if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc) this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + this.type.keyword);\n    if (this.options.onToken) this.options.onToken(new Token(this));\n    this.lastTokEnd = this.end;\n    this.lastTokStart = this.start;\n    this.lastTokEndLoc = this.endLoc;\n    this.lastTokStartLoc = this.startLoc;\n    this.nextToken();\n};\npp$9.getToken = function() {\n    this.next();\n    return new Token(this);\n};\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\") pp$9[Symbol.iterator] = function() {\n    var this$1 = this;\n    return {\n        next: function() {\n            var token = this$1.getToken();\n            return {\n                done: token.type === types.eof,\n                value: token\n            };\n        }\n    };\n};\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\npp$9.curContext = function() {\n    return this.context[this.context.length - 1];\n};\n// Read a single token, updating the parser object's token-related\n// properties.\npp$9.nextToken = function() {\n    var curContext = this.curContext();\n    if (!curContext || !curContext.preserveSpace) this.skipSpace();\n    this.start = this.pos;\n    if (this.options.locations) this.startLoc = this.curPosition();\n    if (this.pos >= this.input.length) return this.finishToken(types.eof);\n    if (curContext.override) return curContext.override(this);\n    else this.readToken(this.fullCharCodeAtPos());\n};\npp$9.readToken = function(code) {\n    // Identifier or keyword. '\\uXXXX' sequences are allowed in\n    // identifiers, so '\\' also dispatches to that.\n    if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */ ) return this.readWord();\n    return this.getTokenFromCode(code);\n};\npp$9.fullCharCodeAtPos = function() {\n    var code = this.input.charCodeAt(this.pos);\n    if (code <= 0xd7ff || code >= 0xe000) return code;\n    var next = this.input.charCodeAt(this.pos + 1);\n    return (code << 10) + next - 0x35fdc00;\n};\npp$9.skipBlockComment = function() {\n    var startLoc = this.options.onComment && this.curPosition();\n    var start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2);\n    if (end === -1) this.raise(this.pos - 2, \"Unterminated comment\");\n    this.pos = end + 2;\n    if (this.options.locations) {\n        lineBreakG.lastIndex = start;\n        var match;\n        while((match = lineBreakG.exec(this.input)) && match.index < this.pos){\n            ++this.curLine;\n            this.lineStart = match.index + match[0].length;\n        }\n    }\n    if (this.options.onComment) this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos, startLoc, this.curPosition());\n};\npp$9.skipLineComment = function(startSkip) {\n    var start = this.pos;\n    var startLoc = this.options.onComment && this.curPosition();\n    var ch = this.input.charCodeAt(this.pos += startSkip);\n    while(this.pos < this.input.length && !isNewLine(ch))ch = this.input.charCodeAt(++this.pos);\n    if (this.options.onComment) this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos, startLoc, this.curPosition());\n};\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\npp$9.skipSpace = function() {\n    loop: while(this.pos < this.input.length){\n        var ch = this.input.charCodeAt(this.pos);\n        switch(ch){\n            case 32:\n            case 160:\n                ++this.pos;\n                break;\n            case 13:\n                if (this.input.charCodeAt(this.pos + 1) === 10) ++this.pos;\n            case 10:\n            case 8232:\n            case 8233:\n                ++this.pos;\n                if (this.options.locations) {\n                    ++this.curLine;\n                    this.lineStart = this.pos;\n                }\n                break;\n            case 47:\n                switch(this.input.charCodeAt(this.pos + 1)){\n                    case 42:\n                        this.skipBlockComment();\n                        break;\n                    case 47:\n                        this.skipLineComment(2);\n                        break;\n                    default:\n                        break loop;\n                }\n                break;\n            default:\n                if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) ++this.pos;\n                else break loop;\n        }\n    }\n};\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\npp$9.finishToken = function(type, val) {\n    this.end = this.pos;\n    if (this.options.locations) this.endLoc = this.curPosition();\n    var prevType = this.type;\n    this.type = type;\n    this.value = val;\n    this.updateContext(prevType);\n};\n// ### Token reading\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp$9.readToken_dot = function() {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next >= 48 && next <= 57) return this.readNumber(true);\n    var next2 = this.input.charCodeAt(this.pos + 2);\n    if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) {\n        this.pos += 3;\n        return this.finishToken(types.ellipsis);\n    } else {\n        ++this.pos;\n        return this.finishToken(types.dot);\n    }\n};\npp$9.readToken_slash = function() {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (this.exprAllowed) {\n        ++this.pos;\n        return this.readRegexp();\n    }\n    if (next === 61) return this.finishOp(types.assign, 2);\n    return this.finishOp(types.slash, 1);\n};\npp$9.readToken_mult_modulo_exp = function(code) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    var size = 1;\n    var tokentype = code === 42 ? types.star : types.modulo;\n    // exponentiation operator ** and **=\n    if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n        ++size;\n        tokentype = types.starstar;\n        next = this.input.charCodeAt(this.pos + 2);\n    }\n    if (next === 61) return this.finishOp(types.assign, size + 1);\n    return this.finishOp(tokentype, size);\n};\npp$9.readToken_pipe_amp = function(code) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === code) {\n        if (this.options.ecmaVersion >= 12) {\n            var next2 = this.input.charCodeAt(this.pos + 2);\n            if (next2 === 61) return this.finishOp(types.assign, 3);\n        }\n        return this.finishOp(code === 124 ? types.logicalOR : types.logicalAND, 2);\n    }\n    if (next === 61) return this.finishOp(types.assign, 2);\n    return this.finishOp(code === 124 ? types.bitwiseOR : types.bitwiseAND, 1);\n};\npp$9.readToken_caret = function() {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 61) return this.finishOp(types.assign, 2);\n    return this.finishOp(types.bitwiseXOR, 1);\n};\npp$9.readToken_plus_min = function(code) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === code) {\n        if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 && (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n            // A `-->` line comment\n            this.skipLineComment(3);\n            this.skipSpace();\n            return this.nextToken();\n        }\n        return this.finishOp(types.incDec, 2);\n    }\n    if (next === 61) return this.finishOp(types.assign, 2);\n    return this.finishOp(types.plusMin, 1);\n};\npp$9.readToken_lt_gt = function(code) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    var size = 1;\n    if (next === code) {\n        size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;\n        if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(types.assign, size + 1);\n        return this.finishOp(types.bitShift, size);\n    }\n    if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 && this.input.charCodeAt(this.pos + 3) === 45) {\n        // `<!--`, an XML-style comment that should be interpreted as a line comment\n        this.skipLineComment(4);\n        this.skipSpace();\n        return this.nextToken();\n    }\n    if (next === 61) size = 2;\n    return this.finishOp(types.relational, size);\n};\npp$9.readToken_eq_excl = function(code) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 61) return this.finishOp(types.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2);\n    if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) {\n        this.pos += 2;\n        return this.finishToken(types.arrow);\n    }\n    return this.finishOp(code === 61 ? types.eq : types.prefix, 1);\n};\npp$9.readToken_question = function() {\n    var ecmaVersion = this.options.ecmaVersion;\n    if (ecmaVersion >= 11) {\n        var next = this.input.charCodeAt(this.pos + 1);\n        if (next === 46) {\n            var next2 = this.input.charCodeAt(this.pos + 2);\n            if (next2 < 48 || next2 > 57) return this.finishOp(types.questionDot, 2);\n        }\n        if (next === 63) {\n            if (ecmaVersion >= 12) {\n                var next2$1 = this.input.charCodeAt(this.pos + 2);\n                if (next2$1 === 61) return this.finishOp(types.assign, 3);\n            }\n            return this.finishOp(types.coalesce, 2);\n        }\n    }\n    return this.finishOp(types.question, 1);\n};\npp$9.getTokenFromCode = function(code) {\n    switch(code){\n        // The interpretation of a dot depends on whether it is followed\n        // by a digit or another two dots.\n        case 46:\n            return this.readToken_dot();\n        // Punctuation tokens.\n        case 40:\n            ++this.pos;\n            return this.finishToken(types.parenL);\n        case 41:\n            ++this.pos;\n            return this.finishToken(types.parenR);\n        case 59:\n            ++this.pos;\n            return this.finishToken(types.semi);\n        case 44:\n            ++this.pos;\n            return this.finishToken(types.comma);\n        case 91:\n            ++this.pos;\n            return this.finishToken(types.bracketL);\n        case 93:\n            ++this.pos;\n            return this.finishToken(types.bracketR);\n        case 123:\n            ++this.pos;\n            return this.finishToken(types.braceL);\n        case 125:\n            ++this.pos;\n            return this.finishToken(types.braceR);\n        case 58:\n            ++this.pos;\n            return this.finishToken(types.colon);\n        case 96:\n            if (this.options.ecmaVersion < 6) break;\n            ++this.pos;\n            return this.finishToken(types.backQuote);\n        case 48:\n            var next = this.input.charCodeAt(this.pos + 1);\n            if (next === 120 || next === 88) return this.readRadixNumber(16);\n             // '0x', '0X' - hex number\n            if (this.options.ecmaVersion >= 6) {\n                if (next === 111 || next === 79) return this.readRadixNumber(8);\n                 // '0o', '0O' - octal number\n                if (next === 98 || next === 66) return this.readRadixNumber(2);\n                 // '0b', '0B' - binary number\n            }\n        // Anything else beginning with a digit is an integer, octal\n        // number, or float.\n        case 49:\n        case 50:\n        case 51:\n        case 52:\n        case 53:\n        case 54:\n        case 55:\n        case 56:\n        case 57:\n            return this.readNumber(false);\n        // Quotes produce strings.\n        case 34:\n        case 39:\n            return this.readString(code);\n        // Operators are parsed inline in tiny state machines. '=' (61) is\n        // often referred to. `finishOp` simply skips the amount of\n        // characters it is given as second argument, and returns a token\n        // of the type given by its first argument.\n        case 47:\n            return this.readToken_slash();\n        case 37:\n        case 42:\n            return this.readToken_mult_modulo_exp(code);\n        case 124:\n        case 38:\n            return this.readToken_pipe_amp(code);\n        case 94:\n            return this.readToken_caret();\n        case 43:\n        case 45:\n            return this.readToken_plus_min(code);\n        case 60:\n        case 62:\n            return this.readToken_lt_gt(code);\n        case 61:\n        case 33:\n            return this.readToken_eq_excl(code);\n        case 63:\n            return this.readToken_question();\n        case 126:\n            return this.finishOp(types.prefix, 1);\n    }\n    this.raise(this.pos, \"Unexpected character '\" + codePointToString$1(code) + \"'\");\n};\npp$9.finishOp = function(type, size) {\n    var str = this.input.slice(this.pos, this.pos + size);\n    this.pos += size;\n    return this.finishToken(type, str);\n};\npp$9.readRegexp = function() {\n    var escaped, inClass, start = this.pos;\n    for(;;){\n        if (this.pos >= this.input.length) this.raise(start, \"Unterminated regular expression\");\n        var ch = this.input.charAt(this.pos);\n        if (lineBreak.test(ch)) this.raise(start, \"Unterminated regular expression\");\n        if (!escaped) {\n            if (ch === \"[\") inClass = true;\n            else if (ch === \"]\" && inClass) inClass = false;\n            else if (ch === \"/\" && !inClass) break;\n            escaped = ch === \"\\\\\";\n        } else escaped = false;\n        ++this.pos;\n    }\n    var pattern = this.input.slice(start, this.pos);\n    ++this.pos;\n    var flagsStart = this.pos;\n    var flags = this.readWord1();\n    if (this.containsEsc) this.unexpected(flagsStart);\n    // Validate pattern\n    var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));\n    state.reset(start, pattern, flags);\n    this.validateRegExpFlags(state);\n    this.validateRegExpPattern(state);\n    // Create Literal#value property value.\n    var value = null;\n    try {\n        value = new RegExp(pattern, flags);\n    } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n    }\n    return this.finishToken(types.regexp, {\n        pattern: pattern,\n        flags: flags,\n        value: value\n    });\n};\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\npp$9.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {\n    // `len` is used for character escape sequences. In that case, disallow separators.\n    var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;\n    // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)\n    // and isn't fraction part nor exponent part. In that case, if the first digit\n    // is zero then disallow separators.\n    var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;\n    var start = this.pos, total = 0, lastCode = 0;\n    for(var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos){\n        var code = this.input.charCodeAt(this.pos), val = void 0;\n        if (allowSeparators && code === 95) {\n            if (isLegacyOctalNumericLiteral) this.raiseRecoverable(this.pos, \"Numeric separator is not allowed in legacy octal numeric literals\");\n            if (lastCode === 95) this.raiseRecoverable(this.pos, \"Numeric separator must be exactly one underscore\");\n            if (i === 0) this.raiseRecoverable(this.pos, \"Numeric separator is not allowed at the first of digits\");\n            lastCode = code;\n            continue;\n        }\n        if (code >= 97) val = code - 97 + 10;\n        else if (code >= 65) val = code - 65 + 10;\n        else if (code >= 48 && code <= 57) val = code - 48;\n        else val = Infinity;\n        if (val >= radix) break;\n        lastCode = code;\n        total = total * radix + val;\n    }\n    if (allowSeparators && lastCode === 95) this.raiseRecoverable(this.pos - 1, \"Numeric separator is not allowed at the last of digits\");\n    if (this.pos === start || len != null && this.pos - start !== len) return null;\n    return total;\n};\nfunction stringToNumber(str, isLegacyOctalNumericLiteral) {\n    if (isLegacyOctalNumericLiteral) return parseInt(str, 8);\n    // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.\n    return parseFloat(str.replace(/_/g, \"\"));\n}\nfunction stringToBigInt(str) {\n    if (typeof BigInt !== \"function\") return null;\n    // `BigInt(value)` throws syntax error if the string contains numeric separators.\n    return BigInt(str.replace(/_/g, \"\"));\n}\npp$9.readRadixNumber = function(radix) {\n    var start = this.pos;\n    this.pos += 2; // 0x\n    var val = this.readInt(radix);\n    if (val == null) this.raise(this.start + 2, \"Expected number in radix \" + radix);\n    if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {\n        val = stringToBigInt(this.input.slice(start, this.pos));\n        ++this.pos;\n    } else if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\");\n    return this.finishToken(types.num, val);\n};\n// Read an integer, octal integer, or floating-point number.\npp$9.readNumber = function(startsWithDot) {\n    var start = this.pos;\n    if (!startsWithDot && this.readInt(10, undefined, true) === null) this.raise(start, \"Invalid number\");\n    var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;\n    if (octal && this.strict) this.raise(start, \"Invalid number\");\n    var next = this.input.charCodeAt(this.pos);\n    if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {\n        var val$1 = stringToBigInt(this.input.slice(start, this.pos));\n        ++this.pos;\n        if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\");\n        return this.finishToken(types.num, val$1);\n    }\n    if (octal && /[89]/.test(this.input.slice(start, this.pos))) octal = false;\n    if (next === 46 && !octal) {\n        ++this.pos;\n        this.readInt(10);\n        next = this.input.charCodeAt(this.pos);\n    }\n    if ((next === 69 || next === 101) && !octal) {\n        next = this.input.charCodeAt(++this.pos);\n        if (next === 43 || next === 45) ++this.pos;\n         // '+-'\n        if (this.readInt(10) === null) this.raise(start, \"Invalid number\");\n    }\n    if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\");\n    var val = stringToNumber(this.input.slice(start, this.pos), octal);\n    return this.finishToken(types.num, val);\n};\n// Read a string value, interpreting backslash-escapes.\npp$9.readCodePoint = function() {\n    var ch = this.input.charCodeAt(this.pos), code;\n    if (ch === 123) {\n        if (this.options.ecmaVersion < 6) this.unexpected();\n        var codePos = ++this.pos;\n        code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos);\n        ++this.pos;\n        if (code > 0x10FFFF) this.invalidStringToken(codePos, \"Code point out of bounds\");\n    } else code = this.readHexChar(4);\n    return code;\n};\nfunction codePointToString$1(code) {\n    // UTF-16 Decoding\n    if (code <= 0xFFFF) return String.fromCharCode(code);\n    code -= 0x10000;\n    return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00);\n}\npp$9.readString = function(quote) {\n    var out = \"\", chunkStart = ++this.pos;\n    for(;;){\n        if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated string constant\");\n        var ch = this.input.charCodeAt(this.pos);\n        if (ch === quote) break;\n        if (ch === 92) {\n            out += this.input.slice(chunkStart, this.pos);\n            out += this.readEscapedChar(false);\n            chunkStart = this.pos;\n        } else {\n            if (isNewLine(ch, this.options.ecmaVersion >= 10)) this.raise(this.start, \"Unterminated string constant\");\n            ++this.pos;\n        }\n    }\n    out += this.input.slice(chunkStart, this.pos++);\n    return this.finishToken(types.string, out);\n};\n// Reads template string tokens.\nvar INVALID_TEMPLATE_ESCAPE_ERROR = {};\npp$9.tryReadTemplateToken = function() {\n    this.inTemplateElement = true;\n    try {\n        this.readTmplToken();\n    } catch (err) {\n        if (err === INVALID_TEMPLATE_ESCAPE_ERROR) this.readInvalidTemplateToken();\n        else throw err;\n    }\n    this.inTemplateElement = false;\n};\npp$9.invalidStringToken = function(position, message) {\n    if (this.inTemplateElement && this.options.ecmaVersion >= 9) throw INVALID_TEMPLATE_ESCAPE_ERROR;\n    else this.raise(position, message);\n};\npp$9.readTmplToken = function() {\n    var out = \"\", chunkStart = this.pos;\n    for(;;){\n        if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated template\");\n        var ch = this.input.charCodeAt(this.pos);\n        if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) {\n            if (this.pos === this.start && (this.type === types.template || this.type === types.invalidTemplate)) {\n                if (ch === 36) {\n                    this.pos += 2;\n                    return this.finishToken(types.dollarBraceL);\n                } else {\n                    ++this.pos;\n                    return this.finishToken(types.backQuote);\n                }\n            }\n            out += this.input.slice(chunkStart, this.pos);\n            return this.finishToken(types.template, out);\n        }\n        if (ch === 92) {\n            out += this.input.slice(chunkStart, this.pos);\n            out += this.readEscapedChar(true);\n            chunkStart = this.pos;\n        } else if (isNewLine(ch)) {\n            out += this.input.slice(chunkStart, this.pos);\n            ++this.pos;\n            switch(ch){\n                case 13:\n                    if (this.input.charCodeAt(this.pos) === 10) ++this.pos;\n                case 10:\n                    out += \"\\n\";\n                    break;\n                default:\n                    out += String.fromCharCode(ch);\n                    break;\n            }\n            if (this.options.locations) {\n                ++this.curLine;\n                this.lineStart = this.pos;\n            }\n            chunkStart = this.pos;\n        } else ++this.pos;\n    }\n};\n// Reads a template token to search for the end, without validating any escape sequences\npp$9.readInvalidTemplateToken = function() {\n    for(; this.pos < this.input.length; this.pos++)switch(this.input[this.pos]){\n        case \"\\\\\":\n            ++this.pos;\n            break;\n        case \"$\":\n            if (this.input[this.pos + 1] !== \"{\") break;\n        // falls through\n        case \"`\":\n            return this.finishToken(types.invalidTemplate, this.input.slice(this.start, this.pos));\n    }\n    this.raise(this.start, \"Unterminated template\");\n};\n// Used to read escaped characters\npp$9.readEscapedChar = function(inTemplate) {\n    var ch = this.input.charCodeAt(++this.pos);\n    ++this.pos;\n    switch(ch){\n        case 110:\n            return \"\\n\" // 'n' -> '\\n'\n            ;\n        case 114:\n            return \"\\r\" // 'r' -> '\\r'\n            ;\n        case 120:\n            return String.fromCharCode(this.readHexChar(2)) // 'x'\n            ;\n        case 117:\n            return codePointToString$1(this.readCodePoint()) // 'u'\n            ;\n        case 116:\n            return \"\\t\" // 't' -> '\\t'\n            ;\n        case 98:\n            return \"\\b\" // 'b' -> '\\b'\n            ;\n        case 118:\n            return \"\\u000b\" // 'v' -> '\\u000b'\n            ;\n        case 102:\n            return \"\\f\" // 'f' -> '\\f'\n            ;\n        case 13:\n            if (this.input.charCodeAt(this.pos) === 10) ++this.pos;\n             // '\\r\\n'\n        case 10:\n            if (this.options.locations) {\n                this.lineStart = this.pos;\n                ++this.curLine;\n            }\n            return \"\";\n        case 56:\n        case 57:\n            if (inTemplate) {\n                var codePos = this.pos - 1;\n                this.invalidStringToken(codePos, \"Invalid escape sequence in template string\");\n                return null;\n            }\n        default:\n            if (ch >= 48 && ch <= 55) {\n                var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];\n                var octal = parseInt(octalStr, 8);\n                if (octal > 255) {\n                    octalStr = octalStr.slice(0, -1);\n                    octal = parseInt(octalStr, 8);\n                }\n                this.pos += octalStr.length - 1;\n                ch = this.input.charCodeAt(this.pos);\n                if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) this.invalidStringToken(this.pos - 1 - octalStr.length, inTemplate ? \"Octal literal in template string\" : \"Octal literal in strict mode\");\n                return String.fromCharCode(octal);\n            }\n            if (isNewLine(ch)) // Unicode new line characters after \\ get removed from output in both\n            // template literals and strings\n            return \"\";\n            return String.fromCharCode(ch);\n    }\n};\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\npp$9.readHexChar = function(len) {\n    var codePos = this.pos;\n    var n = this.readInt(16, len);\n    if (n === null) this.invalidStringToken(codePos, \"Bad character escape sequence\");\n    return n;\n};\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\npp$9.readWord1 = function() {\n    this.containsEsc = false;\n    var word = \"\", first = true, chunkStart = this.pos;\n    var astral = this.options.ecmaVersion >= 6;\n    while(this.pos < this.input.length){\n        var ch = this.fullCharCodeAtPos();\n        if (isIdentifierChar(ch, astral)) this.pos += ch <= 0xffff ? 1 : 2;\n        else if (ch === 92) {\n            this.containsEsc = true;\n            word += this.input.slice(chunkStart, this.pos);\n            var escStart = this.pos;\n            if (this.input.charCodeAt(++this.pos) !== 117) this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\");\n            ++this.pos;\n            var esc = this.readCodePoint();\n            if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral)) this.invalidStringToken(escStart, \"Invalid Unicode escape\");\n            word += codePointToString$1(esc);\n            chunkStart = this.pos;\n        } else break;\n        first = false;\n    }\n    return word + this.input.slice(chunkStart, this.pos);\n};\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\npp$9.readWord = function() {\n    var word = this.readWord1();\n    var type = types.name;\n    if (this.keywords.test(word)) type = keywords$1[word];\n    return this.finishToken(type, word);\n};\n// Acorn is a tiny, fast JavaScript parser written in JavaScript.\nvar version = \"7.4.1\";\nParser.acorn = {\n    Parser: Parser,\n    version: version,\n    defaultOptions: defaultOptions,\n    Position: Position,\n    SourceLocation: SourceLocation,\n    getLineInfo: getLineInfo,\n    Node: Node,\n    TokenType: TokenType,\n    tokTypes: types,\n    keywordTypes: keywords$1,\n    TokContext: TokContext,\n    tokContexts: types$1,\n    isIdentifierChar: isIdentifierChar,\n    isIdentifierStart: isIdentifierStart,\n    Token: Token,\n    isNewLine: isNewLine,\n    lineBreak: lineBreak,\n    lineBreakG: lineBreakG,\n    nonASCIIwhitespace: nonASCIIwhitespace\n};\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and\n// returns an abstract syntax tree as specified by [Mozilla parser\n// API][api].\n//\n// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API\nfunction parse(input, options) {\n    return Parser.parse(input, options);\n}\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\nfunction parseExpressionAt(input, pos, options) {\n    return Parser.parseExpressionAt(input, pos, options);\n}\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\nfunction tokenizer(input, options) {\n    return Parser.tokenizer(input, options);\n}\n\n},{\"@parcel/transformer-js/src/esmodule-helpers.js\":\"diccK\"}],\"lztd4\":[function(require,module,exports) {\n'use strict';\nconst XHTMLEntities = require(\"eba3d9b5ddb210bc\");\nconst hexNumber = /^[\\da-fA-F]+$/;\nconst decimalNumber = /^\\d+$/;\n// The map to `acorn-jsx` tokens from `acorn` namespace objects.\nconst acornJsxMap = new WeakMap();\n// Get the original tokens for the given `acorn` namespace object.\nfunction getJsxTokens(acorn) {\n    acorn = acorn.Parser.acorn || acorn;\n    let acornJsx = acornJsxMap.get(acorn);\n    if (!acornJsx) {\n        const tt = acorn.tokTypes;\n        const TokContext = acorn.TokContext;\n        const TokenType = acorn.TokenType;\n        const tc_oTag = new TokContext('<tag', false);\n        const tc_cTag = new TokContext('</tag', false);\n        const tc_expr = new TokContext('<tag>...</tag>', true, true);\n        const tokContexts = {\n            tc_oTag: tc_oTag,\n            tc_cTag: tc_cTag,\n            tc_expr: tc_expr\n        };\n        const tokTypes = {\n            jsxName: new TokenType('jsxName'),\n            jsxText: new TokenType('jsxText', {\n                beforeExpr: true\n            }),\n            jsxTagStart: new TokenType('jsxTagStart', {\n                startsExpr: true\n            }),\n            jsxTagEnd: new TokenType('jsxTagEnd')\n        };\n        tokTypes.jsxTagStart.updateContext = function() {\n            this.context.push(tc_expr); // treat as beginning of JSX expression\n            this.context.push(tc_oTag); // start opening tag context\n            this.exprAllowed = false;\n        };\n        tokTypes.jsxTagEnd.updateContext = function(prevType) {\n            let out = this.context.pop();\n            if (out === tc_oTag && prevType === tt.slash || out === tc_cTag) {\n                this.context.pop();\n                this.exprAllowed = this.curContext() === tc_expr;\n            } else this.exprAllowed = true;\n        };\n        acornJsx = {\n            tokContexts: tokContexts,\n            tokTypes: tokTypes\n        };\n        acornJsxMap.set(acorn, acornJsx);\n    }\n    return acornJsx;\n}\n// Transforms JSX element name to string.\nfunction getQualifiedJSXName(object) {\n    if (!object) return object;\n    if (object.type === 'JSXIdentifier') return object.name;\n    if (object.type === 'JSXNamespacedName') return object.namespace.name + ':' + object.name.name;\n    if (object.type === 'JSXMemberExpression') return getQualifiedJSXName(object.object) + '.' + getQualifiedJSXName(object.property);\n}\nmodule.exports = function(options) {\n    options = options || {};\n    return function(Parser) {\n        return plugin({\n            allowNamespaces: options.allowNamespaces !== false,\n            allowNamespacedObjects: !!options.allowNamespacedObjects\n        }, Parser);\n    };\n};\n// This is `tokTypes` of the peer dep.\n// This can be different instances from the actual `tokTypes` this plugin uses.\nObject.defineProperty(module.exports, \"tokTypes\", {\n    get: function get_tokTypes() {\n        return getJsxTokens(require(\"4e792332624af360\")).tokTypes;\n    },\n    configurable: true,\n    enumerable: true\n});\nfunction plugin(options, Parser) {\n    const acorn = Parser.acorn || require(\"4e792332624af360\");\n    const acornJsx = getJsxTokens(acorn);\n    const tt = acorn.tokTypes;\n    const tok = acornJsx.tokTypes;\n    const tokContexts = acorn.tokContexts;\n    const tc_oTag = acornJsx.tokContexts.tc_oTag;\n    const tc_cTag = acornJsx.tokContexts.tc_cTag;\n    const tc_expr = acornJsx.tokContexts.tc_expr;\n    const isNewLine = acorn.isNewLine;\n    const isIdentifierStart = acorn.isIdentifierStart;\n    const isIdentifierChar = acorn.isIdentifierChar;\n    return class extends Parser {\n        // Expose actual `tokTypes` and `tokContexts` to other plugins.\n        static get acornJsx() {\n            return acornJsx;\n        }\n        // Reads inline JSX contents token.\n        jsx_readToken() {\n            let out = '', chunkStart = this.pos;\n            for(;;){\n                if (this.pos >= this.input.length) this.raise(this.start, 'Unterminated JSX contents');\n                let ch = this.input.charCodeAt(this.pos);\n                switch(ch){\n                    case 60:\n                    case 123:\n                        if (this.pos === this.start) {\n                            if (ch === 60 && this.exprAllowed) {\n                                ++this.pos;\n                                return this.finishToken(tok.jsxTagStart);\n                            }\n                            return this.getTokenFromCode(ch);\n                        }\n                        out += this.input.slice(chunkStart, this.pos);\n                        return this.finishToken(tok.jsxText, out);\n                    case 38:\n                        out += this.input.slice(chunkStart, this.pos);\n                        out += this.jsx_readEntity();\n                        chunkStart = this.pos;\n                        break;\n                    case 62:\n                    case 125:\n                        this.raise(this.pos, \"Unexpected token `\" + this.input[this.pos] + \"`. Did you mean `\" + (ch === 62 ? \"&gt;\" : \"&rbrace;\") + \"` or \" + \"`{\\\"\" + this.input[this.pos] + \"\\\"}\" + \"`?\");\n                    default:\n                        if (isNewLine(ch)) {\n                            out += this.input.slice(chunkStart, this.pos);\n                            out += this.jsx_readNewLine(true);\n                            chunkStart = this.pos;\n                        } else ++this.pos;\n                }\n            }\n        }\n        jsx_readNewLine(normalizeCRLF) {\n            let ch = this.input.charCodeAt(this.pos);\n            let out;\n            ++this.pos;\n            if (ch === 13 && this.input.charCodeAt(this.pos) === 10) {\n                ++this.pos;\n                out = normalizeCRLF ? '\\n' : '\\r\\n';\n            } else out = String.fromCharCode(ch);\n            if (this.options.locations) {\n                ++this.curLine;\n                this.lineStart = this.pos;\n            }\n            return out;\n        }\n        jsx_readString(quote) {\n            let out = '', chunkStart = ++this.pos;\n            for(;;){\n                if (this.pos >= this.input.length) this.raise(this.start, 'Unterminated string constant');\n                let ch = this.input.charCodeAt(this.pos);\n                if (ch === quote) break;\n                if (ch === 38) {\n                    out += this.input.slice(chunkStart, this.pos);\n                    out += this.jsx_readEntity();\n                    chunkStart = this.pos;\n                } else if (isNewLine(ch)) {\n                    out += this.input.slice(chunkStart, this.pos);\n                    out += this.jsx_readNewLine(false);\n                    chunkStart = this.pos;\n                } else ++this.pos;\n            }\n            out += this.input.slice(chunkStart, this.pos++);\n            return this.finishToken(tt.string, out);\n        }\n        jsx_readEntity() {\n            let str = '', count = 0, entity;\n            let ch = this.input[this.pos];\n            if (ch !== '&') this.raise(this.pos, 'Entity must start with an ampersand');\n            let startPos = ++this.pos;\n            while(this.pos < this.input.length && count++ < 10){\n                ch = this.input[this.pos++];\n                if (ch === ';') {\n                    if (str[0] === '#') {\n                        if (str[1] === 'x') {\n                            str = str.substr(2);\n                            if (hexNumber.test(str)) entity = String.fromCharCode(parseInt(str, 16));\n                        } else {\n                            str = str.substr(1);\n                            if (decimalNumber.test(str)) entity = String.fromCharCode(parseInt(str, 10));\n                        }\n                    } else entity = XHTMLEntities[str];\n                    break;\n                }\n                str += ch;\n            }\n            if (!entity) {\n                this.pos = startPos;\n                return '&';\n            }\n            return entity;\n        }\n        // Read a JSX identifier (valid tag or attribute name).\n        //\n        // Optimized version since JSX identifiers can't contain\n        // escape characters and so can be read as single slice.\n        // Also assumes that first character was already checked\n        // by isIdentifierStart in readToken.\n        jsx_readWord() {\n            let ch, start = this.pos;\n            do ch = this.input.charCodeAt(++this.pos);\n            while (isIdentifierChar(ch) || ch === 45); // '-'\n            return this.finishToken(tok.jsxName, this.input.slice(start, this.pos));\n        }\n        // Parse next token as JSX identifier\n        jsx_parseIdentifier() {\n            let node = this.startNode();\n            if (this.type === tok.jsxName) node.name = this.value;\n            else if (this.type.keyword) node.name = this.type.keyword;\n            else this.unexpected();\n            this.next();\n            return this.finishNode(node, 'JSXIdentifier');\n        }\n        // Parse namespaced identifier.\n        jsx_parseNamespacedName() {\n            let startPos = this.start, startLoc = this.startLoc;\n            let name = this.jsx_parseIdentifier();\n            if (!options.allowNamespaces || !this.eat(tt.colon)) return name;\n            var node = this.startNodeAt(startPos, startLoc);\n            node.namespace = name;\n            node.name = this.jsx_parseIdentifier();\n            return this.finishNode(node, 'JSXNamespacedName');\n        }\n        // Parses element name in any form - namespaced, member\n        // or single identifier.\n        jsx_parseElementName() {\n            if (this.type === tok.jsxTagEnd) return '';\n            let startPos = this.start, startLoc = this.startLoc;\n            let node = this.jsx_parseNamespacedName();\n            if (this.type === tt.dot && node.type === 'JSXNamespacedName' && !options.allowNamespacedObjects) this.unexpected();\n            while(this.eat(tt.dot)){\n                let newNode = this.startNodeAt(startPos, startLoc);\n                newNode.object = node;\n                newNode.property = this.jsx_parseIdentifier();\n                node = this.finishNode(newNode, 'JSXMemberExpression');\n            }\n            return node;\n        }\n        // Parses any type of JSX attribute value.\n        jsx_parseAttributeValue() {\n            switch(this.type){\n                case tt.braceL:\n                    let node = this.jsx_parseExpressionContainer();\n                    if (node.expression.type === 'JSXEmptyExpression') this.raise(node.start, 'JSX attributes must only be assigned a non-empty expression');\n                    return node;\n                case tok.jsxTagStart:\n                case tt.string:\n                    return this.parseExprAtom();\n                default:\n                    this.raise(this.start, 'JSX value should be either an expression or a quoted JSX text');\n            }\n        }\n        // JSXEmptyExpression is unique type since it doesn't actually parse anything,\n        // and so it should start at the end of last read token (left brace) and finish\n        // at the beginning of the next one (right brace).\n        jsx_parseEmptyExpression() {\n            let node = this.startNodeAt(this.lastTokEnd, this.lastTokEndLoc);\n            return this.finishNodeAt(node, 'JSXEmptyExpression', this.start, this.startLoc);\n        }\n        // Parses JSX expression enclosed into curly brackets.\n        jsx_parseExpressionContainer() {\n            let node = this.startNode();\n            this.next();\n            node.expression = this.type === tt.braceR ? this.jsx_parseEmptyExpression() : this.parseExpression();\n            this.expect(tt.braceR);\n            return this.finishNode(node, 'JSXExpressionContainer');\n        }\n        // Parses following JSX attribute name-value pair.\n        jsx_parseAttribute() {\n            let node = this.startNode();\n            if (this.eat(tt.braceL)) {\n                this.expect(tt.ellipsis);\n                node.argument = this.parseMaybeAssign();\n                this.expect(tt.braceR);\n                return this.finishNode(node, 'JSXSpreadAttribute');\n            }\n            node.name = this.jsx_parseNamespacedName();\n            node.value = this.eat(tt.eq) ? this.jsx_parseAttributeValue() : null;\n            return this.finishNode(node, 'JSXAttribute');\n        }\n        // Parses JSX opening tag starting after '<'.\n        jsx_parseOpeningElementAt(startPos, startLoc) {\n            let node = this.startNodeAt(startPos, startLoc);\n            node.attributes = [];\n            let nodeName = this.jsx_parseElementName();\n            if (nodeName) node.name = nodeName;\n            while(this.type !== tt.slash && this.type !== tok.jsxTagEnd)node.attributes.push(this.jsx_parseAttribute());\n            node.selfClosing = this.eat(tt.slash);\n            this.expect(tok.jsxTagEnd);\n            return this.finishNode(node, nodeName ? 'JSXOpeningElement' : 'JSXOpeningFragment');\n        }\n        // Parses JSX closing tag starting after '</'.\n        jsx_parseClosingElementAt(startPos, startLoc) {\n            let node = this.startNodeAt(startPos, startLoc);\n            let nodeName = this.jsx_parseElementName();\n            if (nodeName) node.name = nodeName;\n            this.expect(tok.jsxTagEnd);\n            return this.finishNode(node, nodeName ? 'JSXClosingElement' : 'JSXClosingFragment');\n        }\n        // Parses entire JSX element, including it's opening tag\n        // (starting after '<'), attributes, contents and closing tag.\n        jsx_parseElementAt(startPos, startLoc) {\n            let node = this.startNodeAt(startPos, startLoc);\n            let children = [];\n            let openingElement = this.jsx_parseOpeningElementAt(startPos, startLoc);\n            let closingElement = null;\n            if (!openingElement.selfClosing) {\n                contents: for(;;)switch(this.type){\n                    case tok.jsxTagStart:\n                        startPos = this.start;\n                        startLoc = this.startLoc;\n                        this.next();\n                        if (this.eat(tt.slash)) {\n                            closingElement = this.jsx_parseClosingElementAt(startPos, startLoc);\n                            break contents;\n                        }\n                        children.push(this.jsx_parseElementAt(startPos, startLoc));\n                        break;\n                    case tok.jsxText:\n                        children.push(this.parseExprAtom());\n                        break;\n                    case tt.braceL:\n                        children.push(this.jsx_parseExpressionContainer());\n                        break;\n                    default:\n                        this.unexpected();\n                }\n                if (getQualifiedJSXName(closingElement.name) !== getQualifiedJSXName(openingElement.name)) this.raise(closingElement.start, 'Expected corresponding JSX closing tag for <' + getQualifiedJSXName(openingElement.name) + '>');\n            }\n            let fragmentOrElement = openingElement.name ? 'Element' : 'Fragment';\n            node['opening' + fragmentOrElement] = openingElement;\n            node['closing' + fragmentOrElement] = closingElement;\n            node.children = children;\n            if (this.type === tt.relational && this.value === \"<\") this.raise(this.start, \"Adjacent JSX elements must be wrapped in an enclosing tag\");\n            return this.finishNode(node, 'JSX' + fragmentOrElement);\n        }\n        // Parse JSX text\n        jsx_parseText() {\n            let node = this.parseLiteral(this.value);\n            node.type = \"JSXText\";\n            return node;\n        }\n        // Parses entire JSX element from current position.\n        jsx_parseElement() {\n            let startPos = this.start, startLoc = this.startLoc;\n            this.next();\n            return this.jsx_parseElementAt(startPos, startLoc);\n        }\n        parseExprAtom(refShortHandDefaultPos) {\n            if (this.type === tok.jsxText) return this.jsx_parseText();\n            else if (this.type === tok.jsxTagStart) return this.jsx_parseElement();\n            else return super.parseExprAtom(refShortHandDefaultPos);\n        }\n        readToken(code) {\n            let context = this.curContext();\n            if (context === tc_expr) return this.jsx_readToken();\n            if (context === tc_oTag || context === tc_cTag) {\n                if (isIdentifierStart(code)) return this.jsx_readWord();\n                if (code == 62) {\n                    ++this.pos;\n                    return this.finishToken(tok.jsxTagEnd);\n                }\n                if ((code === 34 || code === 39) && context == tc_oTag) return this.jsx_readString(code);\n            }\n            if (code === 60 && this.exprAllowed && this.input.charCodeAt(this.pos + 1) !== 33) {\n                ++this.pos;\n                return this.finishToken(tok.jsxTagStart);\n            }\n            return super.readToken(code);\n        }\n        updateContext(prevType) {\n            if (this.type == tt.braceL) {\n                var curContext = this.curContext();\n                if (curContext == tc_oTag) this.context.push(tokContexts.b_expr);\n                else if (curContext == tc_expr) this.context.push(tokContexts.b_tmpl);\n                else super.updateContext(prevType);\n                this.exprAllowed = true;\n            } else if (this.type === tt.slash && prevType === tok.jsxTagStart) {\n                this.context.length -= 2; // do not consider JSX expr -> JSX open tag -> ... anymore\n                this.context.push(tc_cTag); // reconsider as closing tag context\n                this.exprAllowed = false;\n            } else return super.updateContext(prevType);\n        }\n    };\n}\n\n},{\"eba3d9b5ddb210bc\":\"3zcXM\",\"4e792332624af360\":\"awzSd\"}],\"3zcXM\":[function(require,module,exports) {\nmodule.exports = {\n    quot: '\\u0022',\n    amp: '&',\n    apos: '\\u0027',\n    lt: '<',\n    gt: '>',\n    nbsp: '\\u00A0',\n    iexcl: '\\u00A1',\n    cent: '\\u00A2',\n    pound: '\\u00A3',\n    curren: '\\u00A4',\n    yen: '\\u00A5',\n    brvbar: '\\u00A6',\n    sect: '\\u00A7',\n    uml: '\\u00A8',\n    copy: '\\u00A9',\n    ordf: '\\u00AA',\n    laquo: '\\u00AB',\n    not: '\\u00AC',\n    shy: '\\u00AD',\n    reg: '\\u00AE',\n    macr: '\\u00AF',\n    deg: '\\u00B0',\n    plusmn: '\\u00B1',\n    sup2: '\\u00B2',\n    sup3: '\\u00B3',\n    acute: '\\u00B4',\n    micro: '\\u00B5',\n    para: '\\u00B6',\n    middot: '\\u00B7',\n    cedil: '\\u00B8',\n    sup1: '\\u00B9',\n    ordm: '\\u00BA',\n    raquo: '\\u00BB',\n    frac14: '\\u00BC',\n    frac12: '\\u00BD',\n    frac34: '\\u00BE',\n    iquest: '\\u00BF',\n    Agrave: '\\u00C0',\n    Aacute: '\\u00C1',\n    Acirc: '\\u00C2',\n    Atilde: '\\u00C3',\n    Auml: '\\u00C4',\n    Aring: '\\u00C5',\n    AElig: '\\u00C6',\n    Ccedil: '\\u00C7',\n    Egrave: '\\u00C8',\n    Eacute: '\\u00C9',\n    Ecirc: '\\u00CA',\n    Euml: '\\u00CB',\n    Igrave: '\\u00CC',\n    Iacute: '\\u00CD',\n    Icirc: '\\u00CE',\n    Iuml: '\\u00CF',\n    ETH: '\\u00D0',\n    Ntilde: '\\u00D1',\n    Ograve: '\\u00D2',\n    Oacute: '\\u00D3',\n    Ocirc: '\\u00D4',\n    Otilde: '\\u00D5',\n    Ouml: '\\u00D6',\n    times: '\\u00D7',\n    Oslash: '\\u00D8',\n    Ugrave: '\\u00D9',\n    Uacute: '\\u00DA',\n    Ucirc: '\\u00DB',\n    Uuml: '\\u00DC',\n    Yacute: '\\u00DD',\n    THORN: '\\u00DE',\n    szlig: '\\u00DF',\n    agrave: '\\u00E0',\n    aacute: '\\u00E1',\n    acirc: '\\u00E2',\n    atilde: '\\u00E3',\n    auml: '\\u00E4',\n    aring: '\\u00E5',\n    aelig: '\\u00E6',\n    ccedil: '\\u00E7',\n    egrave: '\\u00E8',\n    eacute: '\\u00E9',\n    ecirc: '\\u00EA',\n    euml: '\\u00EB',\n    igrave: '\\u00EC',\n    iacute: '\\u00ED',\n    icirc: '\\u00EE',\n    iuml: '\\u00EF',\n    eth: '\\u00F0',\n    ntilde: '\\u00F1',\n    ograve: '\\u00F2',\n    oacute: '\\u00F3',\n    ocirc: '\\u00F4',\n    otilde: '\\u00F5',\n    ouml: '\\u00F6',\n    divide: '\\u00F7',\n    oslash: '\\u00F8',\n    ugrave: '\\u00F9',\n    uacute: '\\u00FA',\n    ucirc: '\\u00FB',\n    uuml: '\\u00FC',\n    yacute: '\\u00FD',\n    thorn: '\\u00FE',\n    yuml: '\\u00FF',\n    OElig: '\\u0152',\n    oelig: '\\u0153',\n    Scaron: '\\u0160',\n    scaron: '\\u0161',\n    Yuml: '\\u0178',\n    fnof: '\\u0192',\n    circ: '\\u02C6',\n    tilde: '\\u02DC',\n    Alpha: '\\u0391',\n    Beta: '\\u0392',\n    Gamma: '\\u0393',\n    Delta: '\\u0394',\n    Epsilon: '\\u0395',\n    Zeta: '\\u0396',\n    Eta: '\\u0397',\n    Theta: '\\u0398',\n    Iota: '\\u0399',\n    Kappa: '\\u039A',\n    Lambda: '\\u039B',\n    Mu: '\\u039C',\n    Nu: '\\u039D',\n    Xi: '\\u039E',\n    Omicron: '\\u039F',\n    Pi: '\\u03A0',\n    Rho: '\\u03A1',\n    Sigma: '\\u03A3',\n    Tau: '\\u03A4',\n    Upsilon: '\\u03A5',\n    Phi: '\\u03A6',\n    Chi: '\\u03A7',\n    Psi: '\\u03A8',\n    Omega: '\\u03A9',\n    alpha: '\\u03B1',\n    beta: '\\u03B2',\n    gamma: '\\u03B3',\n    delta: '\\u03B4',\n    epsilon: '\\u03B5',\n    zeta: '\\u03B6',\n    eta: '\\u03B7',\n    theta: '\\u03B8',\n    iota: '\\u03B9',\n    kappa: '\\u03BA',\n    lambda: '\\u03BB',\n    mu: '\\u03BC',\n    nu: '\\u03BD',\n    xi: '\\u03BE',\n    omicron: '\\u03BF',\n    pi: '\\u03C0',\n    rho: '\\u03C1',\n    sigmaf: '\\u03C2',\n    sigma: '\\u03C3',\n    tau: '\\u03C4',\n    upsilon: '\\u03C5',\n    phi: '\\u03C6',\n    chi: '\\u03C7',\n    psi: '\\u03C8',\n    omega: '\\u03C9',\n    thetasym: '\\u03D1',\n    upsih: '\\u03D2',\n    piv: '\\u03D6',\n    ensp: '\\u2002',\n    emsp: '\\u2003',\n    thinsp: '\\u2009',\n    zwnj: '\\u200C',\n    zwj: '\\u200D',\n    lrm: '\\u200E',\n    rlm: '\\u200F',\n    ndash: '\\u2013',\n    mdash: '\\u2014',\n    lsquo: '\\u2018',\n    rsquo: '\\u2019',\n    sbquo: '\\u201A',\n    ldquo: '\\u201C',\n    rdquo: '\\u201D',\n    bdquo: '\\u201E',\n    dagger: '\\u2020',\n    Dagger: '\\u2021',\n    bull: '\\u2022',\n    hellip: '\\u2026',\n    permil: '\\u2030',\n    prime: '\\u2032',\n    Prime: '\\u2033',\n    lsaquo: '\\u2039',\n    rsaquo: '\\u203A',\n    oline: '\\u203E',\n    frasl: '\\u2044',\n    euro: '\\u20AC',\n    image: '\\u2111',\n    weierp: '\\u2118',\n    real: '\\u211C',\n    trade: '\\u2122',\n    alefsym: '\\u2135',\n    larr: '\\u2190',\n    uarr: '\\u2191',\n    rarr: '\\u2192',\n    darr: '\\u2193',\n    harr: '\\u2194',\n    crarr: '\\u21B5',\n    lArr: '\\u21D0',\n    uArr: '\\u21D1',\n    rArr: '\\u21D2',\n    dArr: '\\u21D3',\n    hArr: '\\u21D4',\n    forall: '\\u2200',\n    part: '\\u2202',\n    exist: '\\u2203',\n    empty: '\\u2205',\n    nabla: '\\u2207',\n    isin: '\\u2208',\n    notin: '\\u2209',\n    ni: '\\u220B',\n    prod: '\\u220F',\n    sum: '\\u2211',\n    minus: '\\u2212',\n    lowast: '\\u2217',\n    radic: '\\u221A',\n    prop: '\\u221D',\n    infin: '\\u221E',\n    ang: '\\u2220',\n    and: '\\u2227',\n    or: '\\u2228',\n    cap: '\\u2229',\n    cup: '\\u222A',\n    'int': '\\u222B',\n    there4: '\\u2234',\n    sim: '\\u223C',\n    cong: '\\u2245',\n    asymp: '\\u2248',\n    ne: '\\u2260',\n    equiv: '\\u2261',\n    le: '\\u2264',\n    ge: '\\u2265',\n    sub: '\\u2282',\n    sup: '\\u2283',\n    nsub: '\\u2284',\n    sube: '\\u2286',\n    supe: '\\u2287',\n    oplus: '\\u2295',\n    otimes: '\\u2297',\n    perp: '\\u22A5',\n    sdot: '\\u22C5',\n    lceil: '\\u2308',\n    rceil: '\\u2309',\n    lfloor: '\\u230A',\n    rfloor: '\\u230B',\n    lang: '\\u2329',\n    rang: '\\u232A',\n    loz: '\\u25CA',\n    spades: '\\u2660',\n    clubs: '\\u2663',\n    hearts: '\\u2665',\n    diams: '\\u2666'\n};\n\n},{}],\"6DKmE\":[function(require,module,exports) {\n// AST walker module for Mozilla Parser API compatible trees\n// A simple walk is one where you simply specify callbacks to be\n// called on specific nodes. The last two arguments are optional. A\n// simple use would be\n//\n//     walk.simple(myTree, {\n//         Expression: function(node) { ... }\n//     });\n//\n// to do something with all expressions. All Parser API node types\n// can be used to identify node types, as well as Expression and\n// Statement, which denote categories of nodes.\n//\n// The base argument can be used to pass a custom (recursive)\n// walker, and state can be used to give this walked an initial\n// state.\nvar parcelHelpers = require(\"@parcel/transformer-js/src/esmodule-helpers.js\");\nparcelHelpers.defineInteropFlag(exports);\nparcelHelpers.export(exports, \"ancestor\", ()=>ancestor);\nparcelHelpers.export(exports, \"base\", ()=>base);\nparcelHelpers.export(exports, \"findNodeAfter\", ()=>findNodeAfter);\nparcelHelpers.export(exports, \"findNodeAround\", ()=>findNodeAround);\nparcelHelpers.export(exports, \"findNodeAt\", ()=>findNodeAt);\nparcelHelpers.export(exports, \"findNodeBefore\", ()=>findNodeBefore);\nparcelHelpers.export(exports, \"full\", ()=>full);\nparcelHelpers.export(exports, \"fullAncestor\", ()=>fullAncestor);\nparcelHelpers.export(exports, \"make\", ()=>make);\nparcelHelpers.export(exports, \"recursive\", ()=>recursive);\nparcelHelpers.export(exports, \"simple\", ()=>simple);\nfunction simple(node, visitors, baseVisitor, state, override) {\n    if (!baseVisitor) baseVisitor = base;\n    (function c(node, st, override) {\n        var type = override || node.type, found = visitors[type];\n        baseVisitor[type](node, st, c);\n        if (found) found(node, st);\n    })(node, state, override);\n}\n// An ancestor walk keeps an array of ancestor nodes (including the\n// current node) and passes them to the callback as third parameter\n// (and also as state parameter when no other state is present).\nfunction ancestor(node, visitors, baseVisitor, state, override) {\n    var ancestors = [];\n    if (!baseVisitor) baseVisitor = base;\n    (function c(node, st, override) {\n        var type = override || node.type, found = visitors[type];\n        var isNew = node !== ancestors[ancestors.length - 1];\n        if (isNew) ancestors.push(node);\n        baseVisitor[type](node, st, c);\n        if (found) found(node, st || ancestors, ancestors);\n        if (isNew) ancestors.pop();\n    })(node, state, override);\n}\n// A recursive walk is one where your functions override the default\n// walkers. They can modify and replace the state parameter that's\n// threaded through the walk, and can opt how and whether to walk\n// their child nodes (by calling their third argument on these\n// nodes).\nfunction recursive(node, state, funcs, baseVisitor, override) {\n    var visitor = funcs ? make(funcs, baseVisitor || undefined) : baseVisitor;\n    (function c(node, st, override) {\n        visitor[override || node.type](node, st, c);\n    })(node, state, override);\n}\nfunction makeTest(test) {\n    if (typeof test === \"string\") return function(type) {\n        return type === test;\n    };\n    else if (!test) return function() {\n        return true;\n    };\n    else return test;\n}\nvar Found = function Found(node, state) {\n    this.node = node;\n    this.state = state;\n};\n// A full walk triggers the callback on each node\nfunction full(node, callback, baseVisitor, state, override) {\n    if (!baseVisitor) baseVisitor = base;\n    (function c(node, st, override) {\n        var type = override || node.type;\n        baseVisitor[type](node, st, c);\n        if (!override) callback(node, st, type);\n    })(node, state, override);\n}\n// An fullAncestor walk is like an ancestor walk, but triggers\n// the callback on each node\nfunction fullAncestor(node, callback, baseVisitor, state) {\n    if (!baseVisitor) baseVisitor = base;\n    var ancestors = [];\n    (function c(node, st, override) {\n        var type = override || node.type;\n        var isNew = node !== ancestors[ancestors.length - 1];\n        if (isNew) ancestors.push(node);\n        baseVisitor[type](node, st, c);\n        if (!override) callback(node, st || ancestors, ancestors, type);\n        if (isNew) ancestors.pop();\n    })(node, state);\n}\n// Find a node with a given start, end, and type (all are optional,\n// null can be used as wildcard). Returns a {node, state} object, or\n// undefined when it doesn't find a matching node.\nfunction findNodeAt(node, start, end, test, baseVisitor, state) {\n    if (!baseVisitor) baseVisitor = base;\n    test = makeTest(test);\n    try {\n        (function c(node, st, override) {\n            var type = override || node.type;\n            if ((start == null || node.start <= start) && (end == null || node.end >= end)) baseVisitor[type](node, st, c);\n            if ((start == null || node.start === start) && (end == null || node.end === end) && test(type, node)) throw new Found(node, st);\n        })(node, state);\n    } catch (e) {\n        if (e instanceof Found) return e;\n        throw e;\n    }\n}\n// Find the innermost node of a given type that contains the given\n// position. Interface similar to findNodeAt.\nfunction findNodeAround(node, pos, test, baseVisitor, state) {\n    test = makeTest(test);\n    if (!baseVisitor) baseVisitor = base;\n    try {\n        (function c(node, st, override) {\n            var type = override || node.type;\n            if (node.start > pos || node.end < pos) return;\n            baseVisitor[type](node, st, c);\n            if (test(type, node)) throw new Found(node, st);\n        })(node, state);\n    } catch (e) {\n        if (e instanceof Found) return e;\n        throw e;\n    }\n}\n// Find the outermost matching node after a given position.\nfunction findNodeAfter(node, pos, test, baseVisitor, state) {\n    test = makeTest(test);\n    if (!baseVisitor) baseVisitor = base;\n    try {\n        (function c(node, st, override) {\n            if (node.end < pos) return;\n            var type = override || node.type;\n            if (node.start >= pos && test(type, node)) throw new Found(node, st);\n            baseVisitor[type](node, st, c);\n        })(node, state);\n    } catch (e) {\n        if (e instanceof Found) return e;\n        throw e;\n    }\n}\n// Find the outermost matching node before a given position.\nfunction findNodeBefore(node, pos, test, baseVisitor, state) {\n    test = makeTest(test);\n    if (!baseVisitor) baseVisitor = base;\n    var max;\n    (function c(node, st, override) {\n        if (node.start > pos) return;\n        var type = override || node.type;\n        if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node)) max = new Found(node, st);\n        baseVisitor[type](node, st, c);\n    })(node, state);\n    return max;\n}\n// Fallback to an Object.create polyfill for older environments.\nvar create = Object.create || function(proto) {\n    function Ctor() {}\n    Ctor.prototype = proto;\n    return new Ctor;\n};\n// Used to create a custom walker. Will fill in all missing node\n// type properties with the defaults.\nfunction make(funcs, baseVisitor) {\n    var visitor = create(baseVisitor || base);\n    for(var type in funcs)visitor[type] = funcs[type];\n    return visitor;\n}\nfunction skipThrough(node, st, c) {\n    c(node, st);\n}\nfunction ignore(_node, _st, _c) {}\n// Node walkers.\nvar base = {};\nbase.Program = base.BlockStatement = function(node, st, c) {\n    for(var i = 0, list = node.body; i < list.length; i += 1){\n        var stmt = list[i];\n        c(stmt, st, \"Statement\");\n    }\n};\nbase.Statement = skipThrough;\nbase.EmptyStatement = ignore;\nbase.ExpressionStatement = base.ParenthesizedExpression = base.ChainExpression = function(node, st, c) {\n    return c(node.expression, st, \"Expression\");\n};\nbase.IfStatement = function(node, st, c) {\n    c(node.test, st, \"Expression\");\n    c(node.consequent, st, \"Statement\");\n    if (node.alternate) c(node.alternate, st, \"Statement\");\n};\nbase.LabeledStatement = function(node, st, c) {\n    return c(node.body, st, \"Statement\");\n};\nbase.BreakStatement = base.ContinueStatement = ignore;\nbase.WithStatement = function(node, st, c) {\n    c(node.object, st, \"Expression\");\n    c(node.body, st, \"Statement\");\n};\nbase.SwitchStatement = function(node, st, c) {\n    c(node.discriminant, st, \"Expression\");\n    for(var i$1 = 0, list$1 = node.cases; i$1 < list$1.length; i$1 += 1){\n        var cs = list$1[i$1];\n        if (cs.test) c(cs.test, st, \"Expression\");\n        for(var i = 0, list = cs.consequent; i < list.length; i += 1){\n            var cons = list[i];\n            c(cons, st, \"Statement\");\n        }\n    }\n};\nbase.SwitchCase = function(node, st, c) {\n    if (node.test) c(node.test, st, \"Expression\");\n    for(var i = 0, list = node.consequent; i < list.length; i += 1){\n        var cons = list[i];\n        c(cons, st, \"Statement\");\n    }\n};\nbase.ReturnStatement = base.YieldExpression = base.AwaitExpression = function(node, st, c) {\n    if (node.argument) c(node.argument, st, \"Expression\");\n};\nbase.ThrowStatement = base.SpreadElement = function(node, st, c) {\n    return c(node.argument, st, \"Expression\");\n};\nbase.TryStatement = function(node, st, c) {\n    c(node.block, st, \"Statement\");\n    if (node.handler) c(node.handler, st);\n    if (node.finalizer) c(node.finalizer, st, \"Statement\");\n};\nbase.CatchClause = function(node, st, c) {\n    if (node.param) c(node.param, st, \"Pattern\");\n    c(node.body, st, \"Statement\");\n};\nbase.WhileStatement = base.DoWhileStatement = function(node, st, c) {\n    c(node.test, st, \"Expression\");\n    c(node.body, st, \"Statement\");\n};\nbase.ForStatement = function(node, st, c) {\n    if (node.init) c(node.init, st, \"ForInit\");\n    if (node.test) c(node.test, st, \"Expression\");\n    if (node.update) c(node.update, st, \"Expression\");\n    c(node.body, st, \"Statement\");\n};\nbase.ForInStatement = base.ForOfStatement = function(node, st, c) {\n    c(node.left, st, \"ForInit\");\n    c(node.right, st, \"Expression\");\n    c(node.body, st, \"Statement\");\n};\nbase.ForInit = function(node, st, c) {\n    if (node.type === \"VariableDeclaration\") c(node, st);\n    else c(node, st, \"Expression\");\n};\nbase.DebuggerStatement = ignore;\nbase.FunctionDeclaration = function(node, st, c) {\n    return c(node, st, \"Function\");\n};\nbase.VariableDeclaration = function(node, st, c) {\n    for(var i = 0, list = node.declarations; i < list.length; i += 1){\n        var decl = list[i];\n        c(decl, st);\n    }\n};\nbase.VariableDeclarator = function(node, st, c) {\n    c(node.id, st, \"Pattern\");\n    if (node.init) c(node.init, st, \"Expression\");\n};\nbase.Function = function(node, st, c) {\n    if (node.id) c(node.id, st, \"Pattern\");\n    for(var i = 0, list = node.params; i < list.length; i += 1){\n        var param = list[i];\n        c(param, st, \"Pattern\");\n    }\n    c(node.body, st, node.expression ? \"Expression\" : \"Statement\");\n};\nbase.Pattern = function(node, st, c) {\n    if (node.type === \"Identifier\") c(node, st, \"VariablePattern\");\n    else if (node.type === \"MemberExpression\") c(node, st, \"MemberPattern\");\n    else c(node, st);\n};\nbase.VariablePattern = ignore;\nbase.MemberPattern = skipThrough;\nbase.RestElement = function(node, st, c) {\n    return c(node.argument, st, \"Pattern\");\n};\nbase.ArrayPattern = function(node, st, c) {\n    for(var i = 0, list = node.elements; i < list.length; i += 1){\n        var elt = list[i];\n        if (elt) c(elt, st, \"Pattern\");\n    }\n};\nbase.ObjectPattern = function(node, st, c) {\n    for(var i = 0, list = node.properties; i < list.length; i += 1){\n        var prop = list[i];\n        if (prop.type === \"Property\") {\n            if (prop.computed) c(prop.key, st, \"Expression\");\n            c(prop.value, st, \"Pattern\");\n        } else if (prop.type === \"RestElement\") c(prop.argument, st, \"Pattern\");\n    }\n};\nbase.Expression = skipThrough;\nbase.ThisExpression = base.Super = base.MetaProperty = ignore;\nbase.ArrayExpression = function(node, st, c) {\n    for(var i = 0, list = node.elements; i < list.length; i += 1){\n        var elt = list[i];\n        if (elt) c(elt, st, \"Expression\");\n    }\n};\nbase.ObjectExpression = function(node, st, c) {\n    for(var i = 0, list = node.properties; i < list.length; i += 1){\n        var prop = list[i];\n        c(prop, st);\n    }\n};\nbase.FunctionExpression = base.ArrowFunctionExpression = base.FunctionDeclaration;\nbase.SequenceExpression = function(node, st, c) {\n    for(var i = 0, list = node.expressions; i < list.length; i += 1){\n        var expr = list[i];\n        c(expr, st, \"Expression\");\n    }\n};\nbase.TemplateLiteral = function(node, st, c) {\n    for(var i = 0, list = node.quasis; i < list.length; i += 1){\n        var quasi = list[i];\n        c(quasi, st);\n    }\n    for(var i$1 = 0, list$1 = node.expressions; i$1 < list$1.length; i$1 += 1){\n        var expr = list$1[i$1];\n        c(expr, st, \"Expression\");\n    }\n};\nbase.TemplateElement = ignore;\nbase.UnaryExpression = base.UpdateExpression = function(node, st, c) {\n    c(node.argument, st, \"Expression\");\n};\nbase.BinaryExpression = base.LogicalExpression = function(node, st, c) {\n    c(node.left, st, \"Expression\");\n    c(node.right, st, \"Expression\");\n};\nbase.AssignmentExpression = base.AssignmentPattern = function(node, st, c) {\n    c(node.left, st, \"Pattern\");\n    c(node.right, st, \"Expression\");\n};\nbase.ConditionalExpression = function(node, st, c) {\n    c(node.test, st, \"Expression\");\n    c(node.consequent, st, \"Expression\");\n    c(node.alternate, st, \"Expression\");\n};\nbase.NewExpression = base.CallExpression = function(node, st, c) {\n    c(node.callee, st, \"Expression\");\n    if (node.arguments) for(var i = 0, list = node.arguments; i < list.length; i += 1){\n        var arg = list[i];\n        c(arg, st, \"Expression\");\n    }\n};\nbase.MemberExpression = function(node, st, c) {\n    c(node.object, st, \"Expression\");\n    if (node.computed) c(node.property, st, \"Expression\");\n};\nbase.ExportNamedDeclaration = base.ExportDefaultDeclaration = function(node, st, c) {\n    if (node.declaration) c(node.declaration, st, node.type === \"ExportNamedDeclaration\" || node.declaration.id ? \"Statement\" : \"Expression\");\n    if (node.source) c(node.source, st, \"Expression\");\n};\nbase.ExportAllDeclaration = function(node, st, c) {\n    if (node.exported) c(node.exported, st);\n    c(node.source, st, \"Expression\");\n};\nbase.ImportDeclaration = function(node, st, c) {\n    for(var i = 0, list = node.specifiers; i < list.length; i += 1){\n        var spec = list[i];\n        c(spec, st);\n    }\n    c(node.source, st, \"Expression\");\n};\nbase.ImportExpression = function(node, st, c) {\n    c(node.source, st, \"Expression\");\n};\nbase.ImportSpecifier = base.ImportDefaultSpecifier = base.ImportNamespaceSpecifier = base.Identifier = base.Literal = ignore;\nbase.TaggedTemplateExpression = function(node, st, c) {\n    c(node.tag, st, \"Expression\");\n    c(node.quasi, st, \"Expression\");\n};\nbase.ClassDeclaration = base.ClassExpression = function(node, st, c) {\n    return c(node, st, \"Class\");\n};\nbase.Class = function(node, st, c) {\n    if (node.id) c(node.id, st, \"Pattern\");\n    if (node.superClass) c(node.superClass, st, \"Expression\");\n    c(node.body, st);\n};\nbase.ClassBody = function(node, st, c) {\n    for(var i = 0, list = node.body; i < list.length; i += 1){\n        var elt = list[i];\n        c(elt, st);\n    }\n};\nbase.MethodDefinition = base.Property = function(node, st, c) {\n    if (node.computed) c(node.key, st, \"Expression\");\n    c(node.value, st, \"Expression\");\n};\n\n},{\"@parcel/transformer-js/src/esmodule-helpers.js\":\"diccK\"}],\"fvQhs\":[function(require,module,exports) {\nvar baseGetTag = require(\"b4b8a393acf14901\"), isArray = require(\"46fdd4d2c5d7b4ab\"), isObjectLike = require(\"36ebbb6a9d8b3fe4\");\n/** `Object#toString` result references. */ var stringTag = '[object String]';\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */ function isString(value) {\n    return typeof value == 'string' || !isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag;\n}\nmodule.exports = isString;\n\n},{\"b4b8a393acf14901\":\"lOZcz\",\"46fdd4d2c5d7b4ab\":\"dwcs0\",\"36ebbb6a9d8b3fe4\":\"kcpfl\"}],\"2PLUZ\":[function(require,module,exports) {\n'use strict';\nObject.defineProperty(exports, '__esModule', {\n    value: true\n});\nvar isPlainObject = require(\"1d245530f3f4b629\");\nvar React = require(\"945717012d748ed1\");\nvar prettyPrintObject = require(\"e85dec79cec9b05c\");\nvar reactIs = require(\"49959fad3465d5db\");\nfunction _interopDefaultLegacy(e) {\n    return e && typeof e === 'object' && 'default' in e ? e : {\n        'default': e\n    };\n}\nfunction _interopNamespace(e) {\n    if (e && e.__esModule) return e;\n    var n = Object.create(null);\n    if (e) Object.keys(e).forEach(function(k) {\n        if (k !== 'default') {\n            var d = Object.getOwnPropertyDescriptor(e, k);\n            Object.defineProperty(n, k, d.get ? d : {\n                enumerable: true,\n                get: function() {\n                    return e[k];\n                }\n            });\n        }\n    });\n    n[\"default\"] = e;\n    return Object.freeze(n);\n}\nvar React__namespace = /*#__PURE__*/ _interopNamespace(React);\nvar React__default = /*#__PURE__*/ _interopDefaultLegacy(React);\nvar spacer = function(times, tabStop) {\n    if (times === 0) return '';\n    return new Array(times * tabStop).fill(' ').join('');\n};\nfunction _typeof(obj) {\n    \"@babel/helpers - typeof\";\n    return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(obj) {\n        return typeof obj;\n    } : function(obj) {\n        return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    }, _typeof(obj);\n}\nfunction _toConsumableArray(arr) {\n    return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();\n}\nfunction _arrayWithoutHoles(arr) {\n    if (Array.isArray(arr)) return _arrayLikeToArray(arr);\n}\nfunction _iterableToArray(iter) {\n    if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}\nfunction _unsupportedIterableToArray(o, minLen) {\n    if (!o) return;\n    if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n    var n = Object.prototype.toString.call(o).slice(8, -1);\n    if (n === \"Object\" && o.constructor) n = o.constructor.name;\n    if (n === \"Map\" || n === \"Set\") return Array.from(o);\n    if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\nfunction _arrayLikeToArray(arr, len) {\n    if (len == null || len > arr.length) len = arr.length;\n    for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];\n    return arr2;\n}\nfunction _nonIterableSpread() {\n    throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nfunction safeSortObject(value, seen) {\n    // return non-object value as is\n    if (value === null || _typeof(value) !== 'object') return value;\n     // return date, regexp and react element values as is\n    if (value instanceof Date || value instanceof RegExp || /*#__PURE__*/ React__namespace.isValidElement(value)) return value;\n    seen.add(value); // make a copy of array with each item passed through the sorting algorithm\n    if (Array.isArray(value)) return value.map(function(v) {\n        return safeSortObject(v, seen);\n    });\n     // make a copy of object with key sorted\n    return Object.keys(value).sort().reduce(function(result, key) {\n        if (key === '_owner') return result;\n        if (key === 'current' || seen.has(value[key])) // eslint-disable-next-line no-param-reassign\n        result[key] = '[Circular]';\n        else // eslint-disable-next-line no-param-reassign\n        result[key] = safeSortObject(value[key], seen);\n        return result;\n    }, {});\n}\nfunction sortObject(value) {\n    return safeSortObject(value, new WeakSet());\n}\n/* eslint-disable no-use-before-define */ var createStringTreeNode = function createStringTreeNode(value) {\n    return {\n        type: 'string',\n        value: value\n    };\n};\nvar createNumberTreeNode = function createNumberTreeNode(value) {\n    return {\n        type: 'number',\n        value: value\n    };\n};\nvar createReactElementTreeNode = function createReactElementTreeNode(displayName, props, defaultProps, childrens) {\n    return {\n        type: 'ReactElement',\n        displayName: displayName,\n        props: props,\n        defaultProps: defaultProps,\n        childrens: childrens\n    };\n};\nvar createReactFragmentTreeNode = function createReactFragmentTreeNode(key, childrens) {\n    return {\n        type: 'ReactFragment',\n        key: key,\n        childrens: childrens\n    };\n};\nvar supportFragment = Boolean(React.Fragment);\nvar getFunctionTypeName = function getFunctionTypeName(functionType) {\n    if (!functionType.name || functionType.name === '_default') return 'No Display Name';\n    return functionType.name;\n};\nvar getWrappedComponentDisplayName = function getWrappedComponentDisplayName(Component) {\n    switch(true){\n        case Boolean(Component.displayName):\n            return Component.displayName;\n        case Component.$$typeof === reactIs.Memo:\n            return getWrappedComponentDisplayName(Component.type);\n        case Component.$$typeof === reactIs.ForwardRef:\n            return getWrappedComponentDisplayName(Component.render);\n        default:\n            return getFunctionTypeName(Component);\n    }\n}; // heavily inspired by:\n// https://github.com/facebook/react/blob/3746eaf985dd92f8aa5f5658941d07b6b855e9d9/packages/react-devtools-shared/src/backend/renderer.js#L399-L496\nvar getReactElementDisplayName = function getReactElementDisplayName(element) {\n    switch(true){\n        case typeof element.type === 'string':\n            return element.type;\n        case typeof element.type === 'function':\n            if (element.type.displayName) return element.type.displayName;\n            return getFunctionTypeName(element.type);\n        case reactIs.isForwardRef(element):\n        case reactIs.isMemo(element):\n            return getWrappedComponentDisplayName(element.type);\n        case reactIs.isContextConsumer(element):\n            return \"\".concat(element.type._context.displayName || 'Context', \".Consumer\");\n        case reactIs.isContextProvider(element):\n            return \"\".concat(element.type._context.displayName || 'Context', \".Provider\");\n        case reactIs.isLazy(element):\n            return 'Lazy';\n        case reactIs.isProfiler(element):\n            return 'Profiler';\n        case reactIs.isStrictMode(element):\n            return 'StrictMode';\n        case reactIs.isSuspense(element):\n            return 'Suspense';\n        default:\n            return 'UnknownElementType';\n    }\n};\nvar noChildren = function noChildren(propsValue, propName) {\n    return propName !== 'children';\n};\nvar onlyMeaningfulChildren = function onlyMeaningfulChildren(children) {\n    return children !== true && children !== false && children !== null && children !== '';\n};\nvar filterProps = function filterProps(originalProps, cb) {\n    var filteredProps = {};\n    Object.keys(originalProps).filter(function(key) {\n        return cb(originalProps[key], key);\n    }).forEach(function(key) {\n        return filteredProps[key] = originalProps[key];\n    });\n    return filteredProps;\n};\nvar parseReactElement = function parseReactElement(element, options) {\n    var _options$displayName = options.displayName, displayNameFn = _options$displayName === void 0 ? getReactElementDisplayName : _options$displayName;\n    if (typeof element === 'string') return createStringTreeNode(element);\n    else if (typeof element === 'number') return createNumberTreeNode(element);\n    else if (!/*#__PURE__*/ React__default[\"default\"].isValidElement(element)) throw new Error(\"react-element-to-jsx-string: Expected a React.Element, got `\".concat(_typeof(element), \"`\"));\n    var displayName = displayNameFn(element);\n    var props = filterProps(element.props, noChildren);\n    if (element.ref !== null) props.ref = element.ref;\n    var key = element.key;\n    if (typeof key === 'string' && key.search(/^\\./)) // React automatically add key=\".X\" when there are some children\n    props.key = key;\n    var defaultProps = filterProps(element.type.defaultProps || {}, noChildren);\n    var childrens = React__default[\"default\"].Children.toArray(element.props.children).filter(onlyMeaningfulChildren).map(function(child) {\n        return parseReactElement(child, options);\n    });\n    if (supportFragment && element.type === React.Fragment) return createReactFragmentTreeNode(key, childrens);\n    return createReactElementTreeNode(displayName, props, defaultProps, childrens);\n};\nfunction noRefCheck() {}\nvar inlineFunction = function inlineFunction(fn) {\n    return fn.toString().split('\\n').map(function(line) {\n        return line.trim();\n    }).join('');\n};\nvar preserveFunctionLineBreak = function preserveFunctionLineBreak(fn) {\n    return fn.toString();\n};\nvar defaultFunctionValue = inlineFunction;\nvar formatFunction = function(fn, options) {\n    var _options$functionValu = options.functionValue, functionValue = _options$functionValu === void 0 ? defaultFunctionValue : _options$functionValu, showFunctions = options.showFunctions;\n    if (!showFunctions && functionValue === defaultFunctionValue) return functionValue(noRefCheck);\n    return functionValue(fn);\n};\nvar formatComplexDataStructure = function(value, inline, lvl, options) {\n    var normalizedValue = sortObject(value);\n    var stringifiedValue = prettyPrintObject.prettyPrint(normalizedValue, {\n        transform: function transform(currentObj, prop, originalResult) {\n            var currentValue = currentObj[prop];\n            if (currentValue && /*#__PURE__*/ React.isValidElement(currentValue)) return formatTreeNode(parseReactElement(currentValue, options), true, lvl, options);\n            if (typeof currentValue === 'function') return formatFunction(currentValue, options);\n            return originalResult;\n        }\n    });\n    if (inline) return stringifiedValue.replace(/\\s+/g, ' ').replace(/{ /g, '{').replace(/ }/g, '}').replace(/\\[ /g, '[').replace(/ ]/g, ']');\n     // Replace tabs with spaces, and add necessary indentation in front of each new line\n    return stringifiedValue.replace(/\\t/g, spacer(1, options.tabStop)).replace(/\\n([^$])/g, \"\\n\".concat(spacer(lvl + 1, options.tabStop), \"$1\"));\n};\nvar escape$1 = function escape(s) {\n    return s.replace(/\"/g, '&quot;');\n};\nvar formatPropValue = function formatPropValue(propValue, inline, lvl, options) {\n    if (typeof propValue === 'number') return \"{\".concat(String(propValue), \"}\");\n    if (typeof propValue === 'string') return \"\\\"\".concat(escape$1(propValue), \"\\\"\");\n     // > \"Symbols (new in ECMAScript 2015, not yet supported in Flow)\"\n    // @see: https://flow.org/en/docs/types/primitives/\n    // $FlowFixMe: Flow does not support Symbol\n    if (_typeof(propValue) === 'symbol') {\n        var symbolDescription = propValue.valueOf().toString().replace(/Symbol\\((.*)\\)/, '$1');\n        if (!symbolDescription) return \"{Symbol()}\";\n        return \"{Symbol('\".concat(symbolDescription, \"')}\");\n    }\n    if (typeof propValue === 'function') return \"{\".concat(formatFunction(propValue, options), \"}\");\n    if (/*#__PURE__*/ React.isValidElement(propValue)) return \"{\".concat(formatTreeNode(parseReactElement(propValue, options), true, lvl, options), \"}\");\n    if (propValue instanceof Date) {\n        if (isNaN(propValue.valueOf())) return \"{new Date(NaN)}\";\n        return \"{new Date(\\\"\".concat(propValue.toISOString(), \"\\\")}\");\n    }\n    if (isPlainObject.isPlainObject(propValue) || Array.isArray(propValue)) return \"{\".concat(formatComplexDataStructure(propValue, inline, lvl, options), \"}\");\n    return \"{\".concat(String(propValue), \"}\");\n};\nvar formatProp = function(name, hasValue, value, hasDefaultValue, defaultValue, inline, lvl, options) {\n    if (!hasValue && !hasDefaultValue) throw new Error(\"The prop \\\"\".concat(name, \"\\\" has no value and no default: could not be formatted\"));\n    var usedValue = hasValue ? value : defaultValue;\n    var useBooleanShorthandSyntax = options.useBooleanShorthandSyntax, tabStop = options.tabStop;\n    var formattedPropValue = formatPropValue(usedValue, inline, lvl, options);\n    var attributeFormattedInline = ' ';\n    var attributeFormattedMultiline = \"\\n\".concat(spacer(lvl + 1, tabStop));\n    var isMultilineAttribute = formattedPropValue.includes('\\n');\n    if (useBooleanShorthandSyntax && formattedPropValue === '{false}' && !hasDefaultValue) {\n        // If a boolean is false and not different from it's default, we do not render the attribute\n        attributeFormattedInline = '';\n        attributeFormattedMultiline = '';\n    } else if (useBooleanShorthandSyntax && formattedPropValue === '{true}') {\n        attributeFormattedInline += \"\".concat(name);\n        attributeFormattedMultiline += \"\".concat(name);\n    } else {\n        attributeFormattedInline += \"\".concat(name, \"=\").concat(formattedPropValue);\n        attributeFormattedMultiline += \"\".concat(name, \"=\").concat(formattedPropValue);\n    }\n    return {\n        attributeFormattedInline: attributeFormattedInline,\n        attributeFormattedMultiline: attributeFormattedMultiline,\n        isMultilineAttribute: isMultilineAttribute\n    };\n};\nvar mergeSiblingPlainStringChildrenReducer = function(previousNodes, currentNode) {\n    var nodes = previousNodes.slice(0, previousNodes.length > 0 ? previousNodes.length - 1 : 0);\n    var previousNode = previousNodes[previousNodes.length - 1];\n    if (previousNode && (currentNode.type === 'string' || currentNode.type === 'number') && (previousNode.type === 'string' || previousNode.type === 'number')) nodes.push(createStringTreeNode(String(previousNode.value) + String(currentNode.value)));\n    else {\n        if (previousNode) nodes.push(previousNode);\n        nodes.push(currentNode);\n    }\n    return nodes;\n};\nvar isKeyOrRefProps = function isKeyOrRefProps(propName) {\n    return [\n        'key',\n        'ref'\n    ].includes(propName);\n};\nvar sortPropsByNames = function(shouldSortUserProps) {\n    return function(props) {\n        var haveKeyProp = props.includes('key');\n        var haveRefProp = props.includes('ref');\n        var userPropsOnly = props.filter(function(oneProp) {\n            return !isKeyOrRefProps(oneProp);\n        });\n        var sortedProps = shouldSortUserProps ? _toConsumableArray(userPropsOnly.sort()) // We use basic lexical order\n         : _toConsumableArray(userPropsOnly);\n        if (haveRefProp) sortedProps.unshift('ref');\n        if (haveKeyProp) sortedProps.unshift('key');\n        return sortedProps;\n    };\n};\nfunction createPropFilter(props, filter) {\n    if (Array.isArray(filter)) return function(key) {\n        return filter.indexOf(key) === -1;\n    };\n    else return function(key) {\n        return filter(props[key], key);\n    };\n}\nvar compensateMultilineStringElementIndentation = function compensateMultilineStringElementIndentation(element, formattedElement, inline, lvl, options) {\n    var tabStop = options.tabStop;\n    if (element.type === 'string') return formattedElement.split('\\n').map(function(line, offset) {\n        if (offset === 0) return line;\n        return \"\".concat(spacer(lvl, tabStop)).concat(line);\n    }).join('\\n');\n    return formattedElement;\n};\nvar formatOneChildren = function formatOneChildren(inline, lvl, options) {\n    return function(element) {\n        return compensateMultilineStringElementIndentation(element, formatTreeNode(element, inline, lvl, options), inline, lvl, options);\n    };\n};\nvar onlyPropsWithOriginalValue = function onlyPropsWithOriginalValue(defaultProps, props) {\n    return function(propName) {\n        var haveDefaultValue = Object.keys(defaultProps).includes(propName);\n        return !haveDefaultValue || haveDefaultValue && defaultProps[propName] !== props[propName];\n    };\n};\nvar isInlineAttributeTooLong = function isInlineAttributeTooLong(attributes, inlineAttributeString, lvl, tabStop, maxInlineAttributesLineLength) {\n    if (!maxInlineAttributesLineLength) return attributes.length > 1;\n    return spacer(lvl, tabStop).length + inlineAttributeString.length > maxInlineAttributesLineLength;\n};\nvar shouldRenderMultilineAttr = function shouldRenderMultilineAttr(attributes, inlineAttributeString, containsMultilineAttr, inline, lvl, tabStop, maxInlineAttributesLineLength) {\n    return (isInlineAttributeTooLong(attributes, inlineAttributeString, lvl, tabStop, maxInlineAttributesLineLength) || containsMultilineAttr) && !inline;\n};\nvar formatReactElementNode = function(node, inline, lvl, options) {\n    var type = node.type, _node$displayName = node.displayName, displayName = _node$displayName === void 0 ? '' : _node$displayName, childrens = node.childrens, _node$props = node.props, props = _node$props === void 0 ? {} : _node$props, _node$defaultProps = node.defaultProps, defaultProps = _node$defaultProps === void 0 ? {} : _node$defaultProps;\n    if (type !== 'ReactElement') throw new Error(\"The \\\"formatReactElementNode\\\" function could only format node of type \\\"ReactElement\\\". Given:  \".concat(type));\n    var filterProps = options.filterProps, maxInlineAttributesLineLength = options.maxInlineAttributesLineLength, showDefaultProps = options.showDefaultProps, sortProps = options.sortProps, tabStop = options.tabStop;\n    var out = \"<\".concat(displayName);\n    var outInlineAttr = out;\n    var outMultilineAttr = out;\n    var containsMultilineAttr = false;\n    var visibleAttributeNames = [];\n    var propFilter = createPropFilter(props, filterProps);\n    Object.keys(props).filter(propFilter).filter(onlyPropsWithOriginalValue(defaultProps, props)).forEach(function(propName) {\n        return visibleAttributeNames.push(propName);\n    });\n    Object.keys(defaultProps).filter(propFilter).filter(function() {\n        return showDefaultProps;\n    }).filter(function(defaultPropName) {\n        return !visibleAttributeNames.includes(defaultPropName);\n    }).forEach(function(defaultPropName) {\n        return visibleAttributeNames.push(defaultPropName);\n    });\n    var attributes = sortPropsByNames(sortProps)(visibleAttributeNames);\n    attributes.forEach(function(attributeName) {\n        var _formatProp = formatProp(attributeName, Object.keys(props).includes(attributeName), props[attributeName], Object.keys(defaultProps).includes(attributeName), defaultProps[attributeName], inline, lvl, options), attributeFormattedInline = _formatProp.attributeFormattedInline, attributeFormattedMultiline = _formatProp.attributeFormattedMultiline, isMultilineAttribute = _formatProp.isMultilineAttribute;\n        if (isMultilineAttribute) containsMultilineAttr = true;\n        outInlineAttr += attributeFormattedInline;\n        outMultilineAttr += attributeFormattedMultiline;\n    });\n    outMultilineAttr += \"\\n\".concat(spacer(lvl, tabStop));\n    if (shouldRenderMultilineAttr(attributes, outInlineAttr, containsMultilineAttr, inline, lvl, tabStop, maxInlineAttributesLineLength)) out = outMultilineAttr;\n    else out = outInlineAttr;\n    if (childrens && childrens.length > 0) {\n        var newLvl = lvl + 1;\n        out += '>';\n        if (!inline) {\n            out += '\\n';\n            out += spacer(newLvl, tabStop);\n        }\n        out += childrens.reduce(mergeSiblingPlainStringChildrenReducer, []).map(formatOneChildren(inline, newLvl, options)).join(!inline ? \"\\n\".concat(spacer(newLvl, tabStop)) : '');\n        if (!inline) {\n            out += '\\n';\n            out += spacer(newLvl - 1, tabStop);\n        }\n        out += \"</\".concat(displayName, \">\");\n    } else {\n        if (!isInlineAttributeTooLong(attributes, outInlineAttr, lvl, tabStop, maxInlineAttributesLineLength)) out += ' ';\n        out += '/>';\n    }\n    return out;\n};\nvar REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX = '';\nvar REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX = 'React.Fragment';\nvar toReactElementTreeNode = function toReactElementTreeNode(displayName, key, childrens) {\n    var props = {};\n    if (key) props = {\n        key: key\n    };\n    return {\n        type: 'ReactElement',\n        displayName: displayName,\n        props: props,\n        defaultProps: {},\n        childrens: childrens\n    };\n};\nvar isKeyedFragment = function isKeyedFragment(_ref) {\n    var key = _ref.key;\n    return Boolean(key);\n};\nvar hasNoChildren = function hasNoChildren(_ref2) {\n    var childrens = _ref2.childrens;\n    return childrens.length === 0;\n};\nvar formatReactFragmentNode = function(node, inline, lvl, options) {\n    var type = node.type, key = node.key, childrens = node.childrens;\n    if (type !== 'ReactFragment') throw new Error(\"The \\\"formatReactFragmentNode\\\" function could only format node of type \\\"ReactFragment\\\". Given: \".concat(type));\n    var useFragmentShortSyntax = options.useFragmentShortSyntax;\n    var displayName;\n    if (useFragmentShortSyntax) {\n        if (hasNoChildren(node) || isKeyedFragment(node)) displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n        else displayName = REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX;\n    } else displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n    return formatReactElementNode(toReactElementTreeNode(displayName, key, childrens), inline, lvl, options);\n};\nvar jsxStopChars = [\n    '<',\n    '>',\n    '{',\n    '}'\n];\nvar shouldBeEscaped = function shouldBeEscaped(s) {\n    return jsxStopChars.some(function(jsxStopChar) {\n        return s.includes(jsxStopChar);\n    });\n};\nvar escape = function escape(s) {\n    if (!shouldBeEscaped(s)) return s;\n    return \"{`\".concat(s, \"`}\");\n};\nvar preserveTrailingSpace = function preserveTrailingSpace(s) {\n    var result = s;\n    if (result.endsWith(' ')) result = result.replace(/^(.*?)(\\s+)$/, \"$1{'$2'}\");\n    if (result.startsWith(' ')) result = result.replace(/^(\\s+)(.*)$/, \"{'$1'}$2\");\n    return result;\n};\nvar formatTreeNode = function(node, inline, lvl, options) {\n    if (node.type === 'number') return String(node.value);\n    if (node.type === 'string') return node.value ? \"\".concat(preserveTrailingSpace(escape(String(node.value)))) : '';\n    if (node.type === 'ReactElement') return formatReactElementNode(node, inline, lvl, options);\n    if (node.type === 'ReactFragment') return formatReactFragmentNode(node, inline, lvl, options);\n    throw new TypeError(\"Unknow format type \\\"\".concat(node.type, \"\\\"\"));\n};\nvar formatTree = function(node, options) {\n    return formatTreeNode(node, false, 0, options);\n};\nvar reactElementToJsxString = function reactElementToJsxString(element) {\n    var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}, _ref$filterProps = _ref.filterProps, filterProps = _ref$filterProps === void 0 ? [] : _ref$filterProps, _ref$showDefaultProps = _ref.showDefaultProps, showDefaultProps = _ref$showDefaultProps === void 0 ? true : _ref$showDefaultProps, _ref$showFunctions = _ref.showFunctions, showFunctions = _ref$showFunctions === void 0 ? false : _ref$showFunctions, functionValue = _ref.functionValue, _ref$tabStop = _ref.tabStop, tabStop = _ref$tabStop === void 0 ? 2 : _ref$tabStop, _ref$useBooleanShorth = _ref.useBooleanShorthandSyntax, useBooleanShorthandSyntax = _ref$useBooleanShorth === void 0 ? true : _ref$useBooleanShorth, _ref$useFragmentShort = _ref.useFragmentShortSyntax, useFragmentShortSyntax = _ref$useFragmentShort === void 0 ? true : _ref$useFragmentShort, _ref$sortProps = _ref.sortProps, sortProps = _ref$sortProps === void 0 ? true : _ref$sortProps, maxInlineAttributesLineLength = _ref.maxInlineAttributesLineLength, displayName = _ref.displayName;\n    if (!element) throw new Error('react-element-to-jsx-string: Expected a ReactElement');\n    var options = {\n        filterProps: filterProps,\n        showDefaultProps: showDefaultProps,\n        showFunctions: showFunctions,\n        functionValue: functionValue,\n        tabStop: tabStop,\n        useBooleanShorthandSyntax: useBooleanShorthandSyntax,\n        useFragmentShortSyntax: useFragmentShortSyntax,\n        sortProps: sortProps,\n        maxInlineAttributesLineLength: maxInlineAttributesLineLength,\n        displayName: displayName\n    };\n    return formatTree(parseReactElement(element, options), options);\n};\nexports[\"default\"] = reactElementToJsxString;\nexports.inlineFunction = inlineFunction;\nexports.preserveFunctionLineBreak = preserveFunctionLineBreak;\n\n},{\"1d245530f3f4b629\":\"1tkAV\",\"945717012d748ed1\":\"jEiK2\",\"e85dec79cec9b05c\":\"3n7u7\",\"49959fad3465d5db\":\"ghOeD\"}],\"1tkAV\":[function(require,module,exports) {\n/*!\n * is-plain-object <https://github.com/jonschlinkert/is-plain-object>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */ var parcelHelpers = require(\"@parcel/transformer-js/src/esmodule-helpers.js\");\nparcelHelpers.defineInteropFlag(exports);\nparcelHelpers.export(exports, \"isPlainObject\", ()=>isPlainObject);\nfunction isObject(o) {\n    return Object.prototype.toString.call(o) === '[object Object]';\n}\nfunction isPlainObject(o) {\n    var ctor, prot;\n    if (isObject(o) === false) return false;\n    // If has modified constructor\n    ctor = o.constructor;\n    if (ctor === undefined) return true;\n    // If has modified prototype\n    prot = ctor.prototype;\n    if (isObject(prot) === false) return false;\n    // If constructor does not have an Object-specific method\n    if (prot.hasOwnProperty('isPrototypeOf') === false) return false;\n    // Most likely a plain Object\n    return true;\n}\n\n},{\"@parcel/transformer-js/src/esmodule-helpers.js\":\"diccK\"}],\"3n7u7\":[function(require,module,exports) {\n\"use strict\";\nvar __assign = this && this.__assign || function() {\n    __assign = Object.assign || function(t) {\n        for(var s, i = 1, n = arguments.length; i < n; i++){\n            s = arguments[i];\n            for(var p in s)if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n        }\n        return t;\n    };\n    return __assign.apply(this, arguments);\n};\nvar __spreadArrays = this && this.__spreadArrays || function() {\n    for(var s = 0, i = 0, il = arguments.length; i < il; i++)s += arguments[i].length;\n    for(var r = Array(s), k = 0, i = 0; i < il; i++)for(var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)r[k] = a[j];\n    return r;\n};\nObject.defineProperty(exports, \"__esModule\", {\n    value: true\n});\nvar seen = [];\n/**\n * Check if a value is an object or a function. Keep in mind that array, function, regexp, etc, are objects in JavaScript.\n *\n * @param value the value to check\n * @return true if the value is an object or a function\n */ function isObj(value) {\n    var type = typeof value;\n    return value !== null && (type === 'object' || type === 'function');\n}\n/**\n * Check if a value is a regular expression.\n *\n * @param value the value to check\n * @return true if the value is a regular expression\n */ function isRegexp(value) {\n    return Object.prototype.toString.call(value) === '[object RegExp]';\n}\n/**\n * Get an array of all of the enumerable symbols for an object.\n *\n * @param object the object to get the enumerable symbols for\n */ function getOwnEnumPropSymbols(object) {\n    return Object.getOwnPropertySymbols(object).filter(function(keySymbol) {\n        return Object.prototype.propertyIsEnumerable.call(object, keySymbol);\n    });\n}\n/**\n * pretty print an object\n *\n * @param input the object to pretty print\n * @param options the formatting options, transforms, and filters\n * @param pad the padding string\n */ function prettyPrint(input, options, pad) {\n    if (pad === void 0) pad = '';\n    // sensible option defaults\n    var defaultOptions = {\n        indent: '\\t',\n        singleQuotes: true\n    };\n    var combinedOptions = __assign(__assign({}, defaultOptions), options);\n    var tokens;\n    if (combinedOptions.inlineCharacterLimit === undefined) tokens = {\n        newLine: '\\n',\n        newLineOrSpace: '\\n',\n        pad: pad,\n        indent: pad + combinedOptions.indent\n    };\n    else tokens = {\n        newLine: '@@__PRETTY_PRINT_NEW_LINE__@@',\n        newLineOrSpace: '@@__PRETTY_PRINT_NEW_LINE_OR_SPACE__@@',\n        pad: '@@__PRETTY_PRINT_PAD__@@',\n        indent: '@@__PRETTY_PRINT_INDENT__@@'\n    };\n    var expandWhiteSpace = function(string) {\n        if (combinedOptions.inlineCharacterLimit === undefined) return string;\n        var oneLined = string.replace(new RegExp(tokens.newLine, 'g'), '').replace(new RegExp(tokens.newLineOrSpace, 'g'), ' ').replace(new RegExp(tokens.pad + '|' + tokens.indent, 'g'), '');\n        if (oneLined.length <= combinedOptions.inlineCharacterLimit) return oneLined;\n        return string.replace(new RegExp(tokens.newLine + '|' + tokens.newLineOrSpace, 'g'), '\\n').replace(new RegExp(tokens.pad, 'g'), pad).replace(new RegExp(tokens.indent, 'g'), pad + combinedOptions.indent);\n    };\n    if (seen.indexOf(input) !== -1) return '\"[Circular]\"';\n    if (input === null || input === undefined || typeof input === 'number' || typeof input === 'boolean' || typeof input === 'function' || typeof input === 'symbol' || isRegexp(input)) return String(input);\n    if (input instanceof Date) return \"new Date('\" + input.toISOString() + \"')\";\n    if (Array.isArray(input)) {\n        if (input.length === 0) return '[]';\n        seen.push(input);\n        var ret = '[' + tokens.newLine + input.map(function(el, i) {\n            var eol = input.length - 1 === i ? tokens.newLine : ',' + tokens.newLineOrSpace;\n            var value = prettyPrint(el, combinedOptions, pad + combinedOptions.indent);\n            if (combinedOptions.transform) value = combinedOptions.transform(input, i, value);\n            return tokens.indent + value + eol;\n        }).join('') + tokens.pad + ']';\n        seen.pop();\n        return expandWhiteSpace(ret);\n    }\n    if (isObj(input)) {\n        var objKeys_1 = __spreadArrays(Object.keys(input), getOwnEnumPropSymbols(input));\n        if (combinedOptions.filter) objKeys_1 = objKeys_1.filter(function(el) {\n            return combinedOptions.filter && combinedOptions.filter(input, el);\n        });\n        if (objKeys_1.length === 0) return '{}';\n        seen.push(input);\n        var ret = '{' + tokens.newLine + objKeys_1.map(function(el, i) {\n            var eol = objKeys_1.length - 1 === i ? tokens.newLine : ',' + tokens.newLineOrSpace;\n            var isSymbol = typeof el === 'symbol';\n            var isClassic = !isSymbol && /^[a-z$_][a-z$_0-9]*$/i.test(el.toString());\n            var key = isSymbol || isClassic ? el : prettyPrint(el, combinedOptions);\n            var value = prettyPrint(input[el], combinedOptions, pad + combinedOptions.indent);\n            if (combinedOptions.transform) value = combinedOptions.transform(input, el, value);\n            return tokens.indent + String(key) + ': ' + value + eol;\n        }).join('') + tokens.pad + '}';\n        seen.pop();\n        return expandWhiteSpace(ret);\n    }\n    input = String(input).replace(/[\\r\\n]/g, function(x) {\n        return x === '\\n' ? '\\\\n' : '\\\\r';\n    });\n    if (!combinedOptions.singleQuotes) {\n        input = input.replace(/\"/g, '\\\\\"');\n        return \"\\\"\" + input + \"\\\"\";\n    }\n    input = input.replace(/\\\\?'/g, '\\\\\\'');\n    return \"'\" + input + \"'\";\n}\nexports.prettyPrint = prettyPrint;\n\n},{}],\"ghOeD\":[function(require,module,exports) {\n'use strict';\nmodule.exports = require(\"e46733a3c4411d3f\");\n\n},{\"e46733a3c4411d3f\":\"6J1lg\"}],\"6J1lg\":[function(require,module,exports) {\n/**\n * @license React\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */ 'use strict';\n(function() {\n    'use strict';\n    // -----------------------------------------------------------------------------\n    var enableScopeAPI = false; // Experimental Create Event Handle API.\n    var enableCacheElement = false;\n    var enableTransitionTracing = false; // No known bugs, but needs performance testing\n    var enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n    // stuff. Intended to enable React core members to more easily debug scheduling\n    // issues in DEV builds.\n    var enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n    // ATTENTION\n    var REACT_ELEMENT_TYPE = Symbol.for('react.element');\n    var REACT_PORTAL_TYPE = Symbol.for('react.portal');\n    var REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\n    var REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\n    var REACT_PROFILER_TYPE = Symbol.for('react.profiler');\n    var REACT_PROVIDER_TYPE = Symbol.for('react.provider');\n    var REACT_CONTEXT_TYPE = Symbol.for('react.context');\n    var REACT_SERVER_CONTEXT_TYPE = Symbol.for('react.server_context');\n    var REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\n    var REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\n    var REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\n    var REACT_MEMO_TYPE = Symbol.for('react.memo');\n    var REACT_LAZY_TYPE = Symbol.for('react.lazy');\n    var REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\n    var REACT_MODULE_REFERENCE;\n    REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\n    function isValidElementType(type) {\n        if (typeof type === 'string' || typeof type === 'function') return true;\n         // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n        if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden || type === REACT_OFFSCREEN_TYPE || enableScopeAPI || enableCacheElement || enableTransitionTracing) return true;\n        if (typeof type === 'object' && type !== null) {\n            if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n            // types supported by any Flight configuration anywhere since\n            // we don't know which Flight build this will end up being used\n            // with.\n            type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== undefined) return true;\n        }\n        return false;\n    }\n    function typeOf(object) {\n        if (typeof object === 'object' && object !== null) {\n            var $$typeof = object.$$typeof;\n            switch($$typeof){\n                case REACT_ELEMENT_TYPE:\n                    var type = object.type;\n                    switch(type){\n                        case REACT_FRAGMENT_TYPE:\n                        case REACT_PROFILER_TYPE:\n                        case REACT_STRICT_MODE_TYPE:\n                        case REACT_SUSPENSE_TYPE:\n                        case REACT_SUSPENSE_LIST_TYPE:\n                            return type;\n                        default:\n                            var $$typeofType = type && type.$$typeof;\n                            switch($$typeofType){\n                                case REACT_SERVER_CONTEXT_TYPE:\n                                case REACT_CONTEXT_TYPE:\n                                case REACT_FORWARD_REF_TYPE:\n                                case REACT_LAZY_TYPE:\n                                case REACT_MEMO_TYPE:\n                                case REACT_PROVIDER_TYPE:\n                                    return $$typeofType;\n                                default:\n                                    return $$typeof;\n                            }\n                    }\n                case REACT_PORTAL_TYPE:\n                    return $$typeof;\n            }\n        }\n        return undefined;\n    }\n    var ContextConsumer = REACT_CONTEXT_TYPE;\n    var ContextProvider = REACT_PROVIDER_TYPE;\n    var Element = REACT_ELEMENT_TYPE;\n    var ForwardRef = REACT_FORWARD_REF_TYPE;\n    var Fragment = REACT_FRAGMENT_TYPE;\n    var Lazy = REACT_LAZY_TYPE;\n    var Memo = REACT_MEMO_TYPE;\n    var Portal = REACT_PORTAL_TYPE;\n    var Profiler = REACT_PROFILER_TYPE;\n    var StrictMode = REACT_STRICT_MODE_TYPE;\n    var Suspense = REACT_SUSPENSE_TYPE;\n    var SuspenseList = REACT_SUSPENSE_LIST_TYPE;\n    var hasWarnedAboutDeprecatedIsAsyncMode = false;\n    var hasWarnedAboutDeprecatedIsConcurrentMode = false; // AsyncMode should be deprecated\n    function isAsyncMode(object) {\n        if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n            hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n            console['warn'](\"The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 18+.\");\n        }\n        return false;\n    }\n    function isConcurrentMode(object) {\n        if (!hasWarnedAboutDeprecatedIsConcurrentMode) {\n            hasWarnedAboutDeprecatedIsConcurrentMode = true; // Using console['warn'] to evade Babel and ESLint\n            console['warn'](\"The ReactIs.isConcurrentMode() alias has been deprecated, and will be removed in React 18+.\");\n        }\n        return false;\n    }\n    function isContextConsumer(object) {\n        return typeOf(object) === REACT_CONTEXT_TYPE;\n    }\n    function isContextProvider(object) {\n        return typeOf(object) === REACT_PROVIDER_TYPE;\n    }\n    function isElement(object) {\n        return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n    }\n    function isForwardRef(object) {\n        return typeOf(object) === REACT_FORWARD_REF_TYPE;\n    }\n    function isFragment(object) {\n        return typeOf(object) === REACT_FRAGMENT_TYPE;\n    }\n    function isLazy(object) {\n        return typeOf(object) === REACT_LAZY_TYPE;\n    }\n    function isMemo(object) {\n        return typeOf(object) === REACT_MEMO_TYPE;\n    }\n    function isPortal(object) {\n        return typeOf(object) === REACT_PORTAL_TYPE;\n    }\n    function isProfiler(object) {\n        return typeOf(object) === REACT_PROFILER_TYPE;\n    }\n    function isStrictMode(object) {\n        return typeOf(object) === REACT_STRICT_MODE_TYPE;\n    }\n    function isSuspense(object) {\n        return typeOf(object) === REACT_SUSPENSE_TYPE;\n    }\n    function isSuspenseList(object) {\n        return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n    }\n    exports.ContextConsumer = ContextConsumer;\n    exports.ContextProvider = ContextProvider;\n    exports.Element = Element;\n    exports.ForwardRef = ForwardRef;\n    exports.Fragment = Fragment;\n    exports.Lazy = Lazy;\n    exports.Memo = Memo;\n    exports.Portal = Portal;\n    exports.Profiler = Profiler;\n    exports.StrictMode = StrictMode;\n    exports.Suspense = Suspense;\n    exports.SuspenseList = SuspenseList;\n    exports.isAsyncMode = isAsyncMode;\n    exports.isConcurrentMode = isConcurrentMode;\n    exports.isContextConsumer = isContextConsumer;\n    exports.isContextProvider = isContextProvider;\n    exports.isElement = isElement;\n    exports.isForwardRef = isForwardRef;\n    exports.isFragment = isFragment;\n    exports.isLazy = isLazy;\n    exports.isMemo = isMemo;\n    exports.isPortal = isPortal;\n    exports.isProfiler = isProfiler;\n    exports.isStrictMode = isStrictMode;\n    exports.isSuspense = isSuspense;\n    exports.isSuspenseList = isSuspenseList;\n    exports.isValidElementType = isValidElementType;\n    exports.typeOf = typeOf;\n})();\n\n},{}],\"eG5no\":[function(require,module,exports) {\n// shim for using process in browser\nvar process = module.exports = {};\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\nvar cachedSetTimeout;\nvar cachedClearTimeout;\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout() {\n    throw new Error('clearTimeout has not been defined');\n}\n(function() {\n    try {\n        if (typeof setTimeout === 'function') cachedSetTimeout = setTimeout;\n        else cachedSetTimeout = defaultSetTimout;\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') cachedClearTimeout = clearTimeout;\n        else cachedClearTimeout = defaultClearTimeout;\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n})();\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) //normal enviroments in sane situations\n    return setTimeout(fun, 0);\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch (e) {\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch (e) {\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) //normal enviroments in sane situations\n    return clearTimeout(marker);\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e) {\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e) {\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) return;\n    draining = false;\n    if (currentQueue.length) queue = currentQueue.concat(queue);\n    else queueIndex = -1;\n    if (queue.length) drainQueue();\n}\nfunction drainQueue() {\n    if (draining) return;\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n    var len = queue.length;\n    while(len){\n        currentQueue = queue;\n        queue = [];\n        while(++queueIndex < len)if (currentQueue) currentQueue[queueIndex].run();\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\nprocess.nextTick = function(fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) for(var i = 1; i < arguments.length; i++)args[i - 1] = arguments[i];\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) runTimeout(drainQueue);\n};\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function() {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\nfunction noop() {}\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\nprocess.listeners = function(name) {\n    return [];\n};\nprocess.binding = function(name) {\n    throw new Error('process.binding is not supported');\n};\nprocess.cwd = function() {\n    return '/';\n};\nprocess.chdir = function(dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() {\n    return 0;\n};\n\n},{}]},[], null, \"parcelRequire94c2\")\n\n//# sourceMappingURL=entry-preview-docs.3c6b6684.js.map\n","import { extractComponentDescription, enhanceArgTypes, createSummaryValue, SNIPPET_RENDERED, getDocgenSection, SourceType, isTooLongForDefaultValueSummary, hasDocgen, extractComponentProps, TypeSystem, isTooLongForTypeSummary } from '@storybook/docs-tools';\nimport PropTypes from 'prop-types';\nimport htmlTags from 'html-tags';\nimport { generate } from 'escodegen';\nimport { dedent } from 'ts-dedent';\nimport { Parser } from 'acorn';\nimport jsx from 'acorn-jsx';\nimport * as acornWalk from 'acorn-walk';\nimport isPlainObject from 'lodash/isPlainObject.js';\nimport isFunction from 'lodash/isFunction.js';\nimport isString from 'lodash/isString.js';\nimport reactElementToJSXString2 from 'react-element-to-jsx-string';\nimport React, { createElement, isValidElement } from 'react';\nimport { defaultDecorateStory, addons, useEffect } from '@storybook/preview-api';\nimport { logger } from '@storybook/client-logger';\n\nfunction generateFuncSignature(params,returns){let hasParams=params!=null,hasReturns=returns!=null;if(!hasParams&&!hasReturns)return \"\";let funcParts=[];if(hasParams){let funcParams=params.map(x=>{let prettyName=x.getPrettyName(),typeName=x.getTypeName();return typeName!=null?`${prettyName}: ${typeName}`:prettyName});funcParts.push(`(${funcParams.join(\", \")})`);}else funcParts.push(\"()\");return hasReturns&&funcParts.push(`=> ${returns.getTypeName()}`),funcParts.join(\" \")}function generateShortFuncSignature(params,returns){let hasParams=params!=null,hasReturns=returns!=null;if(!hasParams&&!hasReturns)return \"\";let funcParts=[];return hasParams?funcParts.push(\"( ... )\"):funcParts.push(\"()\"),hasReturns&&funcParts.push(`=> ${returns.getTypeName()}`),funcParts.join(\" \")}function toMultilineSignature(signature){return signature.replace(/,/g,`,\\r\n`)}var CUSTOM_CAPTION=\"custom\",OBJECT_CAPTION=\"object\",ARRAY_CAPTION=\"array\",CLASS_CAPTION=\"class\",FUNCTION_CAPTION=\"func\",ELEMENT_CAPTION=\"element\";function isHtmlTag(tagName){return htmlTags.includes(tagName.toLowerCase())}var BASIC_OPTIONS={format:{indent:{style:\"  \"},semicolons:!1}},COMPACT_OPTIONS={...BASIC_OPTIONS,format:{newline:\"\"}},PRETTY_OPTIONS={...BASIC_OPTIONS};function generateCode(ast,compact=!1){return generate(ast,compact?COMPACT_OPTIONS:PRETTY_OPTIONS)}function generateObjectCode(ast,compact=!1){return compact?generateCompactObjectCode(ast):generateCode(ast)}function generateCompactObjectCode(ast){let result=generateCode(ast,!0);return result.endsWith(\" }\")||(result=`${result.slice(0,-1)} }`),result}function generateArrayCode(ast,compact=!1){return compact?generateCompactArrayCode(ast):generateMultilineArrayCode(ast)}function generateMultilineArrayCode(ast){let result=generateCode(ast);return result.endsWith(\"  }]\")&&(result=dedent(result)),result}function generateCompactArrayCode(ast){let result=generateCode(ast,!0);return result.startsWith(\"[    \")&&(result=result.replace(\"[    \",\"[\")),result}var isMemo=component=>component.$$typeof===Symbol.for(\"react.memo\"),isForwardRef=component=>component.$$typeof===Symbol.for(\"react.forward_ref\");var ACORN_WALK_VISITORS={...acornWalk.base,JSXElement:()=>{}},acornParser=Parser.extend(jsx());function extractIdentifierName(identifierNode){return identifierNode!=null?identifierNode.name:null}function filterAncestors(ancestors){return ancestors.filter(x=>x.type===\"ObjectExpression\"||x.type===\"ArrayExpression\")}function calculateNodeDepth(node){let depths=[];return acornWalk.ancestor(node,{ObjectExpression(_,ancestors){depths.push(filterAncestors(ancestors).length);},ArrayExpression(_,ancestors){depths.push(filterAncestors(ancestors).length);}},ACORN_WALK_VISITORS),Math.max(...depths)}function parseIdentifier(identifierNode){return {inferredType:{type:\"Identifier\",identifier:extractIdentifierName(identifierNode)},ast:identifierNode}}function parseLiteral(literalNode){return {inferredType:{type:\"Literal\"},ast:literalNode}}function parseFunction(funcNode){let innerJsxElementNode;acornWalk.simple(funcNode.body,{JSXElement(node){innerJsxElementNode=node;}},ACORN_WALK_VISITORS);let inferredType={type:innerJsxElementNode!=null?\"Element\":\"Function\",params:funcNode.params,hasParams:funcNode.params.length!==0},identifierName=extractIdentifierName(funcNode.id);return identifierName!=null&&(inferredType.identifier=identifierName),{inferredType,ast:funcNode}}function parseClass(classNode){let innerJsxElementNode;return acornWalk.simple(classNode.body,{JSXElement(node){innerJsxElementNode=node;}},ACORN_WALK_VISITORS),{inferredType:{type:innerJsxElementNode!=null?\"Element\":\"Class\",identifier:extractIdentifierName(classNode.id)},ast:classNode}}function parseJsxElement(jsxElementNode){let inferredType={type:\"Element\"},identifierName=extractIdentifierName(jsxElementNode.openingElement.name);return identifierName!=null&&(inferredType.identifier=identifierName),{inferredType,ast:jsxElementNode}}function parseCall(callNode){let identifierNode=callNode.callee.type===\"MemberExpression\"?callNode.callee.property:callNode.callee;return extractIdentifierName(identifierNode)===\"shape\"?parseObject(callNode.arguments[0]):null}function parseObject(objectNode){return {inferredType:{type:\"Object\",depth:calculateNodeDepth(objectNode)},ast:objectNode}}function parseArray(arrayNode){return {inferredType:{type:\"Array\",depth:calculateNodeDepth(arrayNode)},ast:arrayNode}}function parseExpression(expression){switch(expression.type){case\"Identifier\":return parseIdentifier(expression);case\"Literal\":return parseLiteral(expression);case\"FunctionExpression\":case\"ArrowFunctionExpression\":return parseFunction(expression);case\"ClassExpression\":return parseClass(expression);case\"JSXElement\":return parseJsxElement(expression);case\"CallExpression\":return parseCall(expression);case\"ObjectExpression\":return parseObject(expression);case\"ArrayExpression\":return parseArray(expression);default:return null}}function parse(value){let ast=acornParser.parse(`(${value})`,{ecmaVersion:2020}),parsingResult={inferredType:{type:\"Unknown\"},ast};if(ast.body[0]!=null){let rootNode=ast.body[0];switch(rootNode.type){case\"ExpressionStatement\":{let expressionResult=parseExpression(rootNode.expression);expressionResult!=null&&(parsingResult=expressionResult);break}}}return parsingResult}function inspectValue(value){try{return {...parse(value)}}catch{}return {inferredType:{type:\"Unknown\"}}}var MAX_FUNC_LENGTH=150;function createTypeDef({name,short,compact,full,inferredType}){return {name,short,compact,full:full??short,inferredType}}function cleanPropTypes(value){return value.replace(/PropTypes./g,\"\").replace(/.isRequired/g,\"\")}function splitIntoLines(value){return value.split(/\\r?\\n/)}function prettyObject(ast,compact=!1){return cleanPropTypes(generateObjectCode(ast,compact))}function prettyArray(ast,compact=!1){return cleanPropTypes(generateCode(ast,compact))}function getCaptionForInspectionType(type){switch(type){case\"Object\":return OBJECT_CAPTION;case\"Array\":return ARRAY_CAPTION;case\"Class\":return CLASS_CAPTION;case\"Function\":return FUNCTION_CAPTION;case\"Element\":return ELEMENT_CAPTION;default:return CUSTOM_CAPTION}}function generateTypeFromString(value,originalTypeName){let{inferredType,ast}=inspectValue(value),{type}=inferredType,short,compact,full;switch(type){case\"Identifier\":case\"Literal\":short=value,compact=value;break;case\"Object\":{let{depth}=inferredType;short=OBJECT_CAPTION,compact=depth===1?prettyObject(ast,!0):null,full=prettyObject(ast);break}case\"Element\":{let{identifier}=inferredType;short=identifier!=null&&!isHtmlTag(identifier)?identifier:ELEMENT_CAPTION,compact=splitIntoLines(value).length===1?value:null,full=value;break}case\"Array\":{let{depth}=inferredType;short=ARRAY_CAPTION,compact=depth<=2?prettyArray(ast,!0):null,full=prettyArray(ast);break}default:short=getCaptionForInspectionType(type),compact=splitIntoLines(value).length===1?value:null,full=value;break}return createTypeDef({name:originalTypeName,short,compact,full,inferredType:type})}function generateCustom({raw}){return raw!=null?generateTypeFromString(raw,\"custom\"):createTypeDef({name:\"custom\",short:CUSTOM_CAPTION,compact:CUSTOM_CAPTION})}function generateFunc(extractedProp){let{jsDocTags}=extractedProp;return jsDocTags!=null&&(jsDocTags.params!=null||jsDocTags.returns!=null)?createTypeDef({name:\"func\",short:generateShortFuncSignature(jsDocTags.params,jsDocTags.returns),compact:null,full:generateFuncSignature(jsDocTags.params,jsDocTags.returns)}):createTypeDef({name:\"func\",short:FUNCTION_CAPTION,compact:FUNCTION_CAPTION})}function generateShape(type,extractedProp){let fields=Object.keys(type.value).map(key=>`${key}: ${generateType(type.value[key],extractedProp).full}`).join(\", \"),{inferredType,ast}=inspectValue(`{ ${fields} }`),{depth}=inferredType;return createTypeDef({name:\"shape\",short:OBJECT_CAPTION,compact:depth===1&&ast?prettyObject(ast,!0):null,full:ast?prettyObject(ast):null})}function objectOf(of){return `objectOf(${of})`}function generateObjectOf(type,extractedProp){let{short,compact,full}=generateType(type.value,extractedProp);return createTypeDef({name:\"objectOf\",short:objectOf(short),compact:compact!=null?objectOf(compact):null,full:full&&objectOf(full)})}function generateUnion(type,extractedProp){if(Array.isArray(type.value)){let values=type.value.reduce((acc,v)=>{let{short,compact,full}=generateType(v,extractedProp);return acc.short.push(short),acc.compact.push(compact),acc.full.push(full),acc},{short:[],compact:[],full:[]});return createTypeDef({name:\"union\",short:values.short.join(\" | \"),compact:values.compact.every(x=>x!=null)?values.compact.join(\" | \"):null,full:values.full.join(\" | \")})}return createTypeDef({name:\"union\",short:type.value,compact:null})}function generateEnumValue({value,computed}){return computed?generateTypeFromString(value,\"enumvalue\"):createTypeDef({name:\"enumvalue\",short:value,compact:value})}function generateEnum(type){if(Array.isArray(type.value)){let values=type.value.reduce((acc,v)=>{let{short,compact,full}=generateEnumValue(v);return acc.short.push(short),acc.compact.push(compact),acc.full.push(full),acc},{short:[],compact:[],full:[]});return createTypeDef({name:\"enum\",short:values.short.join(\" | \"),compact:values.compact.every(x=>x!=null)?values.compact.join(\" | \"):null,full:values.full.join(\" | \")})}return createTypeDef({name:\"enum\",short:type.value,compact:type.value})}function braceAfter(of){return `${of}[]`}function braceAround(of){return `[${of}]`}function createArrayOfObjectTypeDef(short,compact,full){return createTypeDef({name:\"arrayOf\",short:braceAfter(short),compact:compact!=null?braceAround(compact):null,full:full&&braceAround(full)})}function generateArray(type,extractedProp){let{name,short,compact,full,inferredType}=generateType(type.value,extractedProp);if(name===\"custom\"){if(inferredType===\"Object\")return createArrayOfObjectTypeDef(short,compact,full)}else if(name===\"shape\")return createArrayOfObjectTypeDef(short,compact,full);return createTypeDef({name:\"arrayOf\",short:braceAfter(short),compact:braceAfter(short)})}function generateType(type,extractedProp){try{switch(type.name){case\"custom\":return generateCustom(type);case\"func\":return generateFunc(extractedProp);case\"shape\":return generateShape(type,extractedProp);case\"instanceOf\":return createTypeDef({name:\"instanceOf\",short:type.value,compact:type.value});case\"objectOf\":return generateObjectOf(type,extractedProp);case\"union\":return generateUnion(type,extractedProp);case\"enum\":return generateEnum(type);case\"arrayOf\":return generateArray(type,extractedProp);default:return createTypeDef({name:type.name,short:type.name,compact:type.name})}}catch(e){console.error(e);}return createTypeDef({name:\"unknown\",short:\"unknown\",compact:\"unknown\"})}function createType(extractedProp){let{type}=extractedProp.docgenInfo;if(type==null)return null;try{switch(type.name){case\"custom\":case\"shape\":case\"instanceOf\":case\"objectOf\":case\"union\":case\"enum\":case\"arrayOf\":{let{short,compact,full}=generateType(type,extractedProp);return compact!=null&&!isTooLongForTypeSummary(compact)?createSummaryValue(compact):full?createSummaryValue(short,full):createSummaryValue(short)}case\"func\":{let{short,full}=generateType(type,extractedProp),summary=short,detail;return full&&full.length<MAX_FUNC_LENGTH?summary=full:full&&(detail=toMultilineSignature(full)),createSummaryValue(summary,detail)}default:return null}}catch(e){console.error(e);}return null}function generateObject({inferredType,ast}){let{depth}=inferredType;if(depth===1){let compactObject=generateObjectCode(ast,!0);if(!isTooLongForDefaultValueSummary(compactObject))return createSummaryValue(compactObject)}return createSummaryValue(OBJECT_CAPTION,generateObjectCode(ast))}function generateArray2({inferredType,ast}){let{depth}=inferredType;if(depth<=2){let compactArray=generateArrayCode(ast,!0);if(!isTooLongForDefaultValueSummary(compactArray))return createSummaryValue(compactArray)}return createSummaryValue(ARRAY_CAPTION,generateArrayCode(ast))}function getPrettyFuncIdentifier(identifier,hasArguments){return hasArguments?`${identifier}( ... )`:`${identifier}()`}function getPrettyElementIdentifier(identifier){return `<${identifier} />`}function getPrettyIdentifier(inferredType){let{type,identifier}=inferredType;switch(type){case\"Function\":return getPrettyFuncIdentifier(identifier,inferredType.hasParams);case\"Element\":return getPrettyElementIdentifier(identifier);default:return identifier}}function generateFunc2({inferredType,ast}){let{identifier}=inferredType;if(identifier!=null)return createSummaryValue(getPrettyIdentifier(inferredType),generateCode(ast));let prettyCaption=generateCode(ast,!0);return isTooLongForDefaultValueSummary(prettyCaption)?createSummaryValue(FUNCTION_CAPTION,generateCode(ast)):createSummaryValue(prettyCaption)}function generateElement(defaultValue,inspectionResult){let{inferredType}=inspectionResult,{identifier}=inferredType;if(identifier!=null&&!isHtmlTag(identifier)){let prettyIdentifier=getPrettyIdentifier(inferredType);return createSummaryValue(prettyIdentifier,defaultValue)}return isTooLongForDefaultValueSummary(defaultValue)?createSummaryValue(ELEMENT_CAPTION,defaultValue):createSummaryValue(defaultValue)}function createDefaultValue(defaultValue){try{let inspectionResult=inspectValue(defaultValue);switch(inspectionResult.inferredType.type){case\"Object\":return generateObject(inspectionResult);case\"Function\":return generateFunc2(inspectionResult);case\"Element\":return generateElement(defaultValue,inspectionResult);case\"Array\":return generateArray2(inspectionResult);default:return null}}catch(e){console.error(e);}return null}function isReactElement(element){return element.$$typeof!=null}function extractFunctionName(func,propName){let{name}=func;return name!==\"\"&&name!==\"anonymous\"&&name!==propName?name:null}var stringResolver=rawDefaultProp=>createSummaryValue(JSON.stringify(rawDefaultProp));function generateReactObject(rawDefaultProp){let{type}=rawDefaultProp,{displayName}=type,jsx2=reactElementToJSXString2(rawDefaultProp,{});if(displayName!=null){let prettyIdentifier=getPrettyElementIdentifier(displayName);return createSummaryValue(prettyIdentifier,jsx2)}if(isString(type)&&isHtmlTag(type)){let jsxSummary=reactElementToJSXString2(rawDefaultProp,{tabStop:0}).replace(/\\r?\\n|\\r/g,\"\");if(!isTooLongForDefaultValueSummary(jsxSummary))return createSummaryValue(jsxSummary)}return createSummaryValue(ELEMENT_CAPTION,jsx2)}var objectResolver=rawDefaultProp=>{if(isReactElement(rawDefaultProp)&&rawDefaultProp.type!=null)return generateReactObject(rawDefaultProp);if(isPlainObject(rawDefaultProp)){let inspectionResult=inspectValue(JSON.stringify(rawDefaultProp));return generateObject(inspectionResult)}if(Array.isArray(rawDefaultProp)){let inspectionResult=inspectValue(JSON.stringify(rawDefaultProp));return generateArray2(inspectionResult)}return createSummaryValue(OBJECT_CAPTION)},functionResolver=(rawDefaultProp,propDef)=>{let isElement=!1,inspectionResult;if(isFunction(rawDefaultProp.render))isElement=!0;else if(rawDefaultProp.prototype!=null&&isFunction(rawDefaultProp.prototype.render))isElement=!0;else {let innerElement;try{inspectionResult=inspectValue(rawDefaultProp.toString());let{hasParams,params}=inspectionResult.inferredType;hasParams?params.length===1&&params[0].type===\"ObjectPattern\"&&(innerElement=rawDefaultProp({})):innerElement=rawDefaultProp(),innerElement!=null&&isReactElement(innerElement)&&(isElement=!0);}catch{}}let funcName=extractFunctionName(rawDefaultProp,propDef.name);if(funcName!=null){if(isElement)return createSummaryValue(getPrettyElementIdentifier(funcName));inspectionResult!=null&&(inspectionResult=inspectValue(rawDefaultProp.toString()));let{hasParams}=inspectionResult.inferredType;return createSummaryValue(getPrettyFuncIdentifier(funcName,hasParams))}return createSummaryValue(isElement?ELEMENT_CAPTION:FUNCTION_CAPTION)},defaultResolver=rawDefaultProp=>createSummaryValue(rawDefaultProp.toString()),DEFAULT_TYPE_RESOLVERS={string:stringResolver,object:objectResolver,function:functionResolver,default:defaultResolver};function createTypeResolvers(customResolvers={}){return {...DEFAULT_TYPE_RESOLVERS,...customResolvers}}function createDefaultValueFromRawDefaultProp(rawDefaultProp,propDef,typeResolvers=DEFAULT_TYPE_RESOLVERS){try{switch(typeof rawDefaultProp){case\"string\":return typeResolvers.string(rawDefaultProp,propDef);case\"object\":return typeResolvers.object(rawDefaultProp,propDef);case\"function\":return typeResolvers.function(rawDefaultProp,propDef);default:return typeResolvers.default(rawDefaultProp,propDef)}}catch(e){console.error(e);}return null}function keepOriginalDefinitionOrder(extractedProps,component){let{propTypes}=component;return propTypes!=null?Object.keys(propTypes).map(x=>extractedProps.find(y=>y.name===x)).filter(Boolean):extractedProps}var funcResolver=(rawDefaultProp,{name,type})=>{let isElement=type.summary===\"element\"||type.summary===\"elementType\",funcName=extractFunctionName(rawDefaultProp,name);if(funcName!=null){if(isElement)return createSummaryValue(getPrettyElementIdentifier(funcName));let{hasParams}=inspectValue(rawDefaultProp.toString()).inferredType;return createSummaryValue(getPrettyFuncIdentifier(funcName,hasParams))}return createSummaryValue(isElement?ELEMENT_CAPTION:FUNCTION_CAPTION)},rawDefaultPropTypeResolvers=createTypeResolvers({function:funcResolver});function enhancePropTypesProp(extractedProp,rawDefaultProp){let{propDef}=extractedProp,newtype=createType(extractedProp);newtype!=null&&(propDef.type=newtype);let{defaultValue}=extractedProp.docgenInfo;if(defaultValue!=null&&defaultValue.value!=null){let newDefaultValue=createDefaultValue(defaultValue.value);newDefaultValue!=null&&(propDef.defaultValue=newDefaultValue);}else if(rawDefaultProp!=null){let newDefaultValue=createDefaultValueFromRawDefaultProp(rawDefaultProp,propDef,rawDefaultPropTypeResolvers);newDefaultValue!=null&&(propDef.defaultValue=newDefaultValue);}return propDef}function enhancePropTypesProps(extractedProps,component){let rawDefaultProps=component.defaultProps!=null?component.defaultProps:{},enhancedProps=extractedProps.map(x=>enhancePropTypesProp(x,rawDefaultProps[x.propDef.name]));return keepOriginalDefinitionOrder(enhancedProps,component)}function enhanceTypeScriptProp(extractedProp,rawDefaultProp){let{propDef}=extractedProp,{defaultValue}=extractedProp.docgenInfo;if(defaultValue!=null&&defaultValue.value!=null){let newDefaultValue=createDefaultValue(defaultValue.value);newDefaultValue!=null&&(propDef.defaultValue=newDefaultValue);}else if(rawDefaultProp!=null){let newDefaultValue=createDefaultValueFromRawDefaultProp(rawDefaultProp,propDef);newDefaultValue!=null&&(propDef.defaultValue=newDefaultValue);}return propDef}function enhanceTypeScriptProps(extractedProps){return extractedProps.map(prop=>enhanceTypeScriptProp(prop))}var propTypesMap=new Map;Object.keys(PropTypes).forEach(typeName=>{let type=PropTypes[typeName];propTypesMap.set(type,typeName),propTypesMap.set(type.isRequired,typeName);});function getPropDefs(component,section){let processedComponent=component;!hasDocgen(component)&&!component.propTypes&&isMemo(component)&&(processedComponent=component.type);let extractedProps=extractComponentProps(processedComponent,section);if(extractedProps.length===0)return [];switch(extractedProps[0].typeSystem){case TypeSystem.JAVASCRIPT:return enhancePropTypesProps(extractedProps,component);case TypeSystem.TYPESCRIPT:return enhanceTypeScriptProps(extractedProps);default:return extractedProps.map(x=>x.propDef)}}var extractProps=component=>({rows:getPropDefs(component,\"props\")});var extractArgTypes=component=>{if(component){let{rows}=extractProps(component);if(rows)return rows.reduce((acc,row)=>{let{name,description,type,sbType,defaultValue:defaultSummary,jsDocTags,required}=row;return acc[name]={name,description,type:{required,...sbType},table:{type,jsDocTags,defaultValue:defaultSummary}},acc},{})}return null};function simplifyNodeForStringify(node){if(isValidElement(node)){let props=Object.keys(node.props).reduce((acc,cur)=>(acc[cur]=simplifyNodeForStringify(node.props[cur]),acc),{});return {...node,props,_owner:null}}return Array.isArray(node)?node.map(simplifyNodeForStringify):node}var renderJsx=(code,options)=>{if(typeof code>\"u\")return logger.warn(\"Too many skip or undefined component\"),null;let renderedJSX=code,Type=renderedJSX.type;for(let i=0;i<options.skip;i+=1){if(typeof renderedJSX>\"u\")return logger.warn(\"Cannot skip undefined element\"),null;if(React.Children.count(renderedJSX)>1)return logger.warn(\"Trying to skip an array of elements\"),null;typeof renderedJSX.props.children>\"u\"?(logger.warn(\"Not enough children to skip elements.\"),typeof renderedJSX.type==\"function\"&&renderedJSX.type.name===\"\"&&(renderedJSX=React.createElement(Type,{...renderedJSX.props}))):typeof renderedJSX.props.children==\"function\"?renderedJSX=renderedJSX.props.children():renderedJSX=renderedJSX.props.children;}let opts={...typeof options.displayName==\"string\"?{showFunctions:!0,displayName:()=>options.displayName}:{displayName:el=>el.type.displayName||(el.type===Symbol.for(\"react.profiler\")?\"Profiler\":null)||getDocgenSection(el.type,\"displayName\")||(el.type.name!==\"_default\"?el.type.name:null)||(typeof el.type==\"function\"?\"No Display Name\":null)||(isForwardRef(el.type)?el.type.render.name:null)||(isMemo(el.type)?el.type.type.name:null)||el.type},...{filterProps:(value,key)=>value!==void 0},...options};return React.Children.map(code,c=>{let child=typeof c==\"number\"?c.toString():c,string=(typeof reactElementToJSXString2==\"function\"?reactElementToJSXString2:reactElementToJSXString2.default)(simplifyNodeForStringify(child),opts);if(string.indexOf(\"&quot;\")>-1){let matches=string.match(/\\S+=\\\\\"([^\"]*)\\\\\"/g);matches&&matches.forEach(match=>{string=string.replace(match,match.replace(/&quot;/g,\"'\"));});}return string}).join(`\n`).replace(/function\\s+noRefCheck\\(\\)\\s+\\{\\}/g,\"() => {}\")},defaultOpts={skip:0,showFunctions:!1,enableBeautify:!0,showDefaultProps:!1},skipJsxRender=context=>{let sourceParams=context?.parameters.docs?.source,isArgsStory=context?.parameters.__isArgsStory;return sourceParams?.type===SourceType.DYNAMIC?!1:!isArgsStory||sourceParams?.code||sourceParams?.type===SourceType.CODE},isMdx=node=>node.type?.displayName===\"MDXCreateElement\"&&!!node.props?.mdxType,mdxToJsx=node=>{if(!isMdx(node))return node;let{mdxType,originalType,children,...rest}=node.props,jsxChildren=[];return children&&(jsxChildren=(Array.isArray(children)?children:[children]).map(mdxToJsx)),createElement(originalType,rest,...jsxChildren)},jsxDecorator=(storyFn,context)=>{let channel=addons.getChannel(),skip=skipJsxRender(context),jsx2=\"\";useEffect(()=>{if(!skip){let{id,unmappedArgs}=context;channel.emit(SNIPPET_RENDERED,{id,source:jsx2,args:unmappedArgs});}});let story=storyFn();if(skip)return story;let options={...defaultOpts,...context?.parameters.jsx||{}},storyJsx=context?.parameters.docs?.source?.excludeDecorators?context.originalStoryFn(context.args,context):story,sourceJsx=mdxToJsx(storyJsx),rendered=renderJsx(sourceJsx,options);return rendered&&(jsx2=rendered),story};var applyDecorators=(storyFn,decorators2)=>{let jsxIndex=decorators2.findIndex(d=>d.originalFn===jsxDecorator),reorderedDecorators=jsxIndex===-1?decorators2:[...decorators2.splice(jsxIndex,1),...decorators2];return defaultDecorateStory(storyFn,reorderedDecorators)};var parameters={docs:{story:{inline:!0},extractArgTypes,extractComponentDescription}},decorators=[jsxDecorator],argTypesEnhancers=[enhanceArgTypes];\n\nexport { applyDecorators, argTypesEnhancers, decorators, parameters };\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-is.production.min.js');\n} else {\n  module.exports = require('./cjs/react-is.development.js');\n}\n","/** @license React v16.13.1\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\n\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n'use strict';\n\n// The Symbol used to tag the ReactElement-like types. If there is no native Symbol\n// nor polyfill, then a plain number is used for performance.\nvar hasSymbol = typeof Symbol === 'function' && Symbol.for;\nvar REACT_ELEMENT_TYPE = hasSymbol ? Symbol.for('react.element') : 0xeac7;\nvar REACT_PORTAL_TYPE = hasSymbol ? Symbol.for('react.portal') : 0xeaca;\nvar REACT_FRAGMENT_TYPE = hasSymbol ? Symbol.for('react.fragment') : 0xeacb;\nvar REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol.for('react.strict_mode') : 0xeacc;\nvar REACT_PROFILER_TYPE = hasSymbol ? Symbol.for('react.profiler') : 0xead2;\nvar REACT_PROVIDER_TYPE = hasSymbol ? Symbol.for('react.provider') : 0xeacd;\nvar REACT_CONTEXT_TYPE = hasSymbol ? Symbol.for('react.context') : 0xeace; // TODO: We don't use AsyncMode or ConcurrentMode anymore. They were temporary\n// (unstable) APIs that have been removed. Can we remove the symbols?\n\nvar REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol.for('react.async_mode') : 0xeacf;\nvar REACT_CONCURRENT_MODE_TYPE = hasSymbol ? Symbol.for('react.concurrent_mode') : 0xeacf;\nvar REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol.for('react.forward_ref') : 0xead0;\nvar REACT_SUSPENSE_TYPE = hasSymbol ? Symbol.for('react.suspense') : 0xead1;\nvar REACT_SUSPENSE_LIST_TYPE = hasSymbol ? Symbol.for('react.suspense_list') : 0xead8;\nvar REACT_MEMO_TYPE = hasSymbol ? Symbol.for('react.memo') : 0xead3;\nvar REACT_LAZY_TYPE = hasSymbol ? Symbol.for('react.lazy') : 0xead4;\nvar REACT_BLOCK_TYPE = hasSymbol ? Symbol.for('react.block') : 0xead9;\nvar REACT_FUNDAMENTAL_TYPE = hasSymbol ? Symbol.for('react.fundamental') : 0xead5;\nvar REACT_RESPONDER_TYPE = hasSymbol ? Symbol.for('react.responder') : 0xead6;\nvar REACT_SCOPE_TYPE = hasSymbol ? Symbol.for('react.scope') : 0xead7;\n\nfunction isValidElementType(type) {\n  return typeof type === 'string' || typeof type === 'function' || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.\n  type === REACT_FRAGMENT_TYPE || type === REACT_CONCURRENT_MODE_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_FUNDAMENTAL_TYPE || type.$$typeof === REACT_RESPONDER_TYPE || type.$$typeof === REACT_SCOPE_TYPE || type.$$typeof === REACT_BLOCK_TYPE);\n}\n\nfunction typeOf(object) {\n  if (typeof object === 'object' && object !== null) {\n    var $$typeof = object.$$typeof;\n\n    switch ($$typeof) {\n      case REACT_ELEMENT_TYPE:\n        var type = object.type;\n\n        switch (type) {\n          case REACT_ASYNC_MODE_TYPE:\n          case REACT_CONCURRENT_MODE_TYPE:\n          case REACT_FRAGMENT_TYPE:\n          case REACT_PROFILER_TYPE:\n          case REACT_STRICT_MODE_TYPE:\n          case REACT_SUSPENSE_TYPE:\n            return type;\n\n          default:\n            var $$typeofType = type && type.$$typeof;\n\n            switch ($$typeofType) {\n              case REACT_CONTEXT_TYPE:\n              case REACT_FORWARD_REF_TYPE:\n              case REACT_LAZY_TYPE:\n              case REACT_MEMO_TYPE:\n              case REACT_PROVIDER_TYPE:\n                return $$typeofType;\n\n              default:\n                return $$typeof;\n            }\n\n        }\n\n      case REACT_PORTAL_TYPE:\n        return $$typeof;\n    }\n  }\n\n  return undefined;\n} // AsyncMode is deprecated along with isAsyncMode\n\nvar AsyncMode = REACT_ASYNC_MODE_TYPE;\nvar ConcurrentMode = REACT_CONCURRENT_MODE_TYPE;\nvar ContextConsumer = REACT_CONTEXT_TYPE;\nvar ContextProvider = REACT_PROVIDER_TYPE;\nvar Element = REACT_ELEMENT_TYPE;\nvar ForwardRef = REACT_FORWARD_REF_TYPE;\nvar Fragment = REACT_FRAGMENT_TYPE;\nvar Lazy = REACT_LAZY_TYPE;\nvar Memo = REACT_MEMO_TYPE;\nvar Portal = REACT_PORTAL_TYPE;\nvar Profiler = REACT_PROFILER_TYPE;\nvar StrictMode = REACT_STRICT_MODE_TYPE;\nvar Suspense = REACT_SUSPENSE_TYPE;\nvar hasWarnedAboutDeprecatedIsAsyncMode = false; // AsyncMode should be deprecated\n\nfunction isAsyncMode(object) {\n  {\n    if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n      hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n      console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n    }\n  }\n\n  return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}\nfunction isConcurrentMode(object) {\n  return typeOf(object) === REACT_CONCURRENT_MODE_TYPE;\n}\nfunction isContextConsumer(object) {\n  return typeOf(object) === REACT_CONTEXT_TYPE;\n}\nfunction isContextProvider(object) {\n  return typeOf(object) === REACT_PROVIDER_TYPE;\n}\nfunction isElement(object) {\n  return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\nfunction isForwardRef(object) {\n  return typeOf(object) === REACT_FORWARD_REF_TYPE;\n}\nfunction isFragment(object) {\n  return typeOf(object) === REACT_FRAGMENT_TYPE;\n}\nfunction isLazy(object) {\n  return typeOf(object) === REACT_LAZY_TYPE;\n}\nfunction isMemo(object) {\n  return typeOf(object) === REACT_MEMO_TYPE;\n}\nfunction isPortal(object) {\n  return typeOf(object) === REACT_PORTAL_TYPE;\n}\nfunction isProfiler(object) {\n  return typeOf(object) === REACT_PROFILER_TYPE;\n}\nfunction isStrictMode(object) {\n  return typeOf(object) === REACT_STRICT_MODE_TYPE;\n}\nfunction isSuspense(object) {\n  return typeOf(object) === REACT_SUSPENSE_TYPE;\n}\n\nexports.AsyncMode = AsyncMode;\nexports.ConcurrentMode = ConcurrentMode;\nexports.ContextConsumer = ContextConsumer;\nexports.ContextProvider = ContextProvider;\nexports.Element = Element;\nexports.ForwardRef = ForwardRef;\nexports.Fragment = Fragment;\nexports.Lazy = Lazy;\nexports.Memo = Memo;\nexports.Portal = Portal;\nexports.Profiler = Profiler;\nexports.StrictMode = StrictMode;\nexports.Suspense = Suspense;\nexports.isAsyncMode = isAsyncMode;\nexports.isConcurrentMode = isConcurrentMode;\nexports.isContextConsumer = isContextConsumer;\nexports.isContextProvider = isContextProvider;\nexports.isElement = isElement;\nexports.isForwardRef = isForwardRef;\nexports.isFragment = isFragment;\nexports.isLazy = isLazy;\nexports.isMemo = isMemo;\nexports.isPortal = isPortal;\nexports.isProfiler = isProfiler;\nexports.isStrictMode = isStrictMode;\nexports.isSuspense = isSuspense;\nexports.isValidElementType = isValidElementType;\nexports.typeOf = typeOf;\n  })();\n}\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactIs = require('react-is');\nvar assign = require('object-assign');\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\nvar has = require('./lib/has');\nvar checkPropTypes = require('./checkPropTypes');\n\nvar printWarning = function() {};\n\nif (process.env.NODE_ENV !== 'production') {\n  printWarning = function(text) {\n    var message = 'Warning: ' + text;\n    if (typeof console !== 'undefined') {\n      console.error(message);\n    }\n    try {\n      // --- Welcome to debugging React ---\n      // This error was thrown as a convenience so that you can use this stack\n      // to find the callsite that caused this warning to fire.\n      throw new Error(message);\n    } catch (x) {}\n  };\n}\n\nfunction emptyFunctionThatReturnsNull() {\n  return null;\n}\n\nmodule.exports = function(isValidElement, throwOnDirectAccess) {\n  /* global Symbol */\n  var ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n  var FAUX_ITERATOR_SYMBOL = '@@iterator'; // Before Symbol spec.\n\n  /**\n   * Returns the iterator method function contained on the iterable object.\n   *\n   * Be sure to invoke the function with the iterable as context:\n   *\n   *     var iteratorFn = getIteratorFn(myIterable);\n   *     if (iteratorFn) {\n   *       var iterator = iteratorFn.call(myIterable);\n   *       ...\n   *     }\n   *\n   * @param {?object} maybeIterable\n   * @return {?function}\n   */\n  function getIteratorFn(maybeIterable) {\n    var iteratorFn = maybeIterable && (ITERATOR_SYMBOL && maybeIterable[ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL]);\n    if (typeof iteratorFn === 'function') {\n      return iteratorFn;\n    }\n  }\n\n  /**\n   * Collection of methods that allow declaration and validation of props that are\n   * supplied to React components. Example usage:\n   *\n   *   var Props = require('ReactPropTypes');\n   *   var MyArticle = React.createClass({\n   *     propTypes: {\n   *       // An optional string prop named \"description\".\n   *       description: Props.string,\n   *\n   *       // A required enum prop named \"category\".\n   *       category: Props.oneOf(['News','Photos']).isRequired,\n   *\n   *       // A prop named \"dialog\" that requires an instance of Dialog.\n   *       dialog: Props.instanceOf(Dialog).isRequired\n   *     },\n   *     render: function() { ... }\n   *   });\n   *\n   * A more formal specification of how these methods are used:\n   *\n   *   type := array|bool|func|object|number|string|oneOf([...])|instanceOf(...)\n   *   decl := ReactPropTypes.{type}(.isRequired)?\n   *\n   * Each and every declaration produces a function with the same signature. This\n   * allows the creation of custom validation functions. For example:\n   *\n   *  var MyLink = React.createClass({\n   *    propTypes: {\n   *      // An optional string or URI prop named \"href\".\n   *      href: function(props, propName, componentName) {\n   *        var propValue = props[propName];\n   *        if (propValue != null && typeof propValue !== 'string' &&\n   *            !(propValue instanceof URI)) {\n   *          return new Error(\n   *            'Expected a string or an URI for ' + propName + ' in ' +\n   *            componentName\n   *          );\n   *        }\n   *      }\n   *    },\n   *    render: function() {...}\n   *  });\n   *\n   * @internal\n   */\n\n  var ANONYMOUS = '<<anonymous>>';\n\n  // Important!\n  // Keep this list in sync with production version in `./factoryWithThrowingShims.js`.\n  var ReactPropTypes = {\n    array: createPrimitiveTypeChecker('array'),\n    bigint: createPrimitiveTypeChecker('bigint'),\n    bool: createPrimitiveTypeChecker('boolean'),\n    func: createPrimitiveTypeChecker('function'),\n    number: createPrimitiveTypeChecker('number'),\n    object: createPrimitiveTypeChecker('object'),\n    string: createPrimitiveTypeChecker('string'),\n    symbol: createPrimitiveTypeChecker('symbol'),\n\n    any: createAnyTypeChecker(),\n    arrayOf: createArrayOfTypeChecker,\n    element: createElementTypeChecker(),\n    elementType: createElementTypeTypeChecker(),\n    instanceOf: createInstanceTypeChecker,\n    node: createNodeChecker(),\n    objectOf: createObjectOfTypeChecker,\n    oneOf: createEnumTypeChecker,\n    oneOfType: createUnionTypeChecker,\n    shape: createShapeTypeChecker,\n    exact: createStrictShapeTypeChecker,\n  };\n\n  /**\n   * inlined Object.is polyfill to avoid requiring consumers ship their own\n   * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n   */\n  /*eslint-disable no-self-compare*/\n  function is(x, y) {\n    // SameValue algorithm\n    if (x === y) {\n      // Steps 1-5, 7-10\n      // Steps 6.b-6.e: +0 != -0\n      return x !== 0 || 1 / x === 1 / y;\n    } else {\n      // Step 6.a: NaN == NaN\n      return x !== x && y !== y;\n    }\n  }\n  /*eslint-enable no-self-compare*/\n\n  /**\n   * We use an Error-like object for backward compatibility as people may call\n   * PropTypes directly and inspect their output. However, we don't use real\n   * Errors anymore. We don't inspect their stack anyway, and creating them\n   * is prohibitively expensive if they are created too often, such as what\n   * happens in oneOfType() for any type before the one that matched.\n   */\n  function PropTypeError(message, data) {\n    this.message = message;\n    this.data = data && typeof data === 'object' ? data: {};\n    this.stack = '';\n  }\n  // Make `instanceof Error` still work for returned errors.\n  PropTypeError.prototype = Error.prototype;\n\n  function createChainableTypeChecker(validate) {\n    if (process.env.NODE_ENV !== 'production') {\n      var manualPropTypeCallCache = {};\n      var manualPropTypeWarningCount = 0;\n    }\n    function checkType(isRequired, props, propName, componentName, location, propFullName, secret) {\n      componentName = componentName || ANONYMOUS;\n      propFullName = propFullName || propName;\n\n      if (secret !== ReactPropTypesSecret) {\n        if (throwOnDirectAccess) {\n          // New behavior only for users of `prop-types` package\n          var err = new Error(\n            'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n            'Use `PropTypes.checkPropTypes()` to call them. ' +\n            'Read more at http://fb.me/use-check-prop-types'\n          );\n          err.name = 'Invariant Violation';\n          throw err;\n        } else if (process.env.NODE_ENV !== 'production' && typeof console !== 'undefined') {\n          // Old behavior for people using React.PropTypes\n          var cacheKey = componentName + ':' + propName;\n          if (\n            !manualPropTypeCallCache[cacheKey] &&\n            // Avoid spamming the console because they are often not actionable except for lib authors\n            manualPropTypeWarningCount < 3\n          ) {\n            printWarning(\n              'You are manually calling a React.PropTypes validation ' +\n              'function for the `' + propFullName + '` prop on `' + componentName + '`. This is deprecated ' +\n              'and will throw in the standalone `prop-types` package. ' +\n              'You may be seeing this warning due to a third-party PropTypes ' +\n              'library. See https://fb.me/react-warning-dont-call-proptypes ' + 'for details.'\n            );\n            manualPropTypeCallCache[cacheKey] = true;\n            manualPropTypeWarningCount++;\n          }\n        }\n      }\n      if (props[propName] == null) {\n        if (isRequired) {\n          if (props[propName] === null) {\n            return new PropTypeError('The ' + location + ' `' + propFullName + '` is marked as required ' + ('in `' + componentName + '`, but its value is `null`.'));\n          }\n          return new PropTypeError('The ' + location + ' `' + propFullName + '` is marked as required in ' + ('`' + componentName + '`, but its value is `undefined`.'));\n        }\n        return null;\n      } else {\n        return validate(props, propName, componentName, location, propFullName);\n      }\n    }\n\n    var chainedCheckType = checkType.bind(null, false);\n    chainedCheckType.isRequired = checkType.bind(null, true);\n\n    return chainedCheckType;\n  }\n\n  function createPrimitiveTypeChecker(expectedType) {\n    function validate(props, propName, componentName, location, propFullName, secret) {\n      var propValue = props[propName];\n      var propType = getPropType(propValue);\n      if (propType !== expectedType) {\n        // `propValue` being instance of, say, date/regexp, pass the 'object'\n        // check, but we can offer a more precise error message here rather than\n        // 'of type `object`'.\n        var preciseType = getPreciseType(propValue);\n\n        return new PropTypeError(\n          'Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + preciseType + '` supplied to `' + componentName + '`, expected ') + ('`' + expectedType + '`.'),\n          {expectedType: expectedType}\n        );\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createAnyTypeChecker() {\n    return createChainableTypeChecker(emptyFunctionThatReturnsNull);\n  }\n\n  function createArrayOfTypeChecker(typeChecker) {\n    function validate(props, propName, componentName, location, propFullName) {\n      if (typeof typeChecker !== 'function') {\n        return new PropTypeError('Property `' + propFullName + '` of component `' + componentName + '` has invalid PropType notation inside arrayOf.');\n      }\n      var propValue = props[propName];\n      if (!Array.isArray(propValue)) {\n        var propType = getPropType(propValue);\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected an array.'));\n      }\n      for (var i = 0; i < propValue.length; i++) {\n        var error = typeChecker(propValue, i, componentName, location, propFullName + '[' + i + ']', ReactPropTypesSecret);\n        if (error instanceof Error) {\n          return error;\n        }\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createElementTypeChecker() {\n    function validate(props, propName, componentName, location, propFullName) {\n      var propValue = props[propName];\n      if (!isValidElement(propValue)) {\n        var propType = getPropType(propValue);\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected a single ReactElement.'));\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createElementTypeTypeChecker() {\n    function validate(props, propName, componentName, location, propFullName) {\n      var propValue = props[propName];\n      if (!ReactIs.isValidElementType(propValue)) {\n        var propType = getPropType(propValue);\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected a single ReactElement type.'));\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createInstanceTypeChecker(expectedClass) {\n    function validate(props, propName, componentName, location, propFullName) {\n      if (!(props[propName] instanceof expectedClass)) {\n        var expectedClassName = expectedClass.name || ANONYMOUS;\n        var actualClassName = getClassName(props[propName]);\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + actualClassName + '` supplied to `' + componentName + '`, expected ') + ('instance of `' + expectedClassName + '`.'));\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createEnumTypeChecker(expectedValues) {\n    if (!Array.isArray(expectedValues)) {\n      if (process.env.NODE_ENV !== 'production') {\n        if (arguments.length > 1) {\n          printWarning(\n            'Invalid arguments supplied to oneOf, expected an array, got ' + arguments.length + ' arguments. ' +\n            'A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z]).'\n          );\n        } else {\n          printWarning('Invalid argument supplied to oneOf, expected an array.');\n        }\n      }\n      return emptyFunctionThatReturnsNull;\n    }\n\n    function validate(props, propName, componentName, location, propFullName) {\n      var propValue = props[propName];\n      for (var i = 0; i < expectedValues.length; i++) {\n        if (is(propValue, expectedValues[i])) {\n          return null;\n        }\n      }\n\n      var valuesString = JSON.stringify(expectedValues, function replacer(key, value) {\n        var type = getPreciseType(value);\n        if (type === 'symbol') {\n          return String(value);\n        }\n        return value;\n      });\n      return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of value `' + String(propValue) + '` ' + ('supplied to `' + componentName + '`, expected one of ' + valuesString + '.'));\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createObjectOfTypeChecker(typeChecker) {\n    function validate(props, propName, componentName, location, propFullName) {\n      if (typeof typeChecker !== 'function') {\n        return new PropTypeError('Property `' + propFullName + '` of component `' + componentName + '` has invalid PropType notation inside objectOf.');\n      }\n      var propValue = props[propName];\n      var propType = getPropType(propValue);\n      if (propType !== 'object') {\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type ' + ('`' + propType + '` supplied to `' + componentName + '`, expected an object.'));\n      }\n      for (var key in propValue) {\n        if (has(propValue, key)) {\n          var error = typeChecker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n          if (error instanceof Error) {\n            return error;\n          }\n        }\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createUnionTypeChecker(arrayOfTypeCheckers) {\n    if (!Array.isArray(arrayOfTypeCheckers)) {\n      process.env.NODE_ENV !== 'production' ? printWarning('Invalid argument supplied to oneOfType, expected an instance of array.') : void 0;\n      return emptyFunctionThatReturnsNull;\n    }\n\n    for (var i = 0; i < arrayOfTypeCheckers.length; i++) {\n      var checker = arrayOfTypeCheckers[i];\n      if (typeof checker !== 'function') {\n        printWarning(\n          'Invalid argument supplied to oneOfType. Expected an array of check functions, but ' +\n          'received ' + getPostfixForTypeWarning(checker) + ' at index ' + i + '.'\n        );\n        return emptyFunctionThatReturnsNull;\n      }\n    }\n\n    function validate(props, propName, componentName, location, propFullName) {\n      var expectedTypes = [];\n      for (var i = 0; i < arrayOfTypeCheckers.length; i++) {\n        var checker = arrayOfTypeCheckers[i];\n        var checkerResult = checker(props, propName, componentName, location, propFullName, ReactPropTypesSecret);\n        if (checkerResult == null) {\n          return null;\n        }\n        if (checkerResult.data && has(checkerResult.data, 'expectedType')) {\n          expectedTypes.push(checkerResult.data.expectedType);\n        }\n      }\n      var expectedTypesMessage = (expectedTypes.length > 0) ? ', expected one of type [' + expectedTypes.join(', ') + ']': '';\n      return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` supplied to ' + ('`' + componentName + '`' + expectedTypesMessage + '.'));\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createNodeChecker() {\n    function validate(props, propName, componentName, location, propFullName) {\n      if (!isNode(props[propName])) {\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` supplied to ' + ('`' + componentName + '`, expected a ReactNode.'));\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function invalidValidatorError(componentName, location, propFullName, key, type) {\n    return new PropTypeError(\n      (componentName || 'React class') + ': ' + location + ' type `' + propFullName + '.' + key + '` is invalid; ' +\n      'it must be a function, usually from the `prop-types` package, but received `' + type + '`.'\n    );\n  }\n\n  function createShapeTypeChecker(shapeTypes) {\n    function validate(props, propName, componentName, location, propFullName) {\n      var propValue = props[propName];\n      var propType = getPropType(propValue);\n      if (propType !== 'object') {\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type `' + propType + '` ' + ('supplied to `' + componentName + '`, expected `object`.'));\n      }\n      for (var key in shapeTypes) {\n        var checker = shapeTypes[key];\n        if (typeof checker !== 'function') {\n          return invalidValidatorError(componentName, location, propFullName, key, getPreciseType(checker));\n        }\n        var error = checker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n        if (error) {\n          return error;\n        }\n      }\n      return null;\n    }\n    return createChainableTypeChecker(validate);\n  }\n\n  function createStrictShapeTypeChecker(shapeTypes) {\n    function validate(props, propName, componentName, location, propFullName) {\n      var propValue = props[propName];\n      var propType = getPropType(propValue);\n      if (propType !== 'object') {\n        return new PropTypeError('Invalid ' + location + ' `' + propFullName + '` of type `' + propType + '` ' + ('supplied to `' + componentName + '`, expected `object`.'));\n      }\n      // We need to check all keys in case some are required but missing from props.\n      var allKeys = assign({}, props[propName], shapeTypes);\n      for (var key in allKeys) {\n        var checker = shapeTypes[key];\n        if (has(shapeTypes, key) && typeof checker !== 'function') {\n          return invalidValidatorError(componentName, location, propFullName, key, getPreciseType(checker));\n        }\n        if (!checker) {\n          return new PropTypeError(\n            'Invalid ' + location + ' `' + propFullName + '` key `' + key + '` supplied to `' + componentName + '`.' +\n            '\\nBad object: ' + JSON.stringify(props[propName], null, '  ') +\n            '\\nValid keys: ' + JSON.stringify(Object.keys(shapeTypes), null, '  ')\n          );\n        }\n        var error = checker(propValue, key, componentName, location, propFullName + '.' + key, ReactPropTypesSecret);\n        if (error) {\n          return error;\n        }\n      }\n      return null;\n    }\n\n    return createChainableTypeChecker(validate);\n  }\n\n  function isNode(propValue) {\n    switch (typeof propValue) {\n      case 'number':\n      case 'string':\n      case 'undefined':\n        return true;\n      case 'boolean':\n        return !propValue;\n      case 'object':\n        if (Array.isArray(propValue)) {\n          return propValue.every(isNode);\n        }\n        if (propValue === null || isValidElement(propValue)) {\n          return true;\n        }\n\n        var iteratorFn = getIteratorFn(propValue);\n        if (iteratorFn) {\n          var iterator = iteratorFn.call(propValue);\n          var step;\n          if (iteratorFn !== propValue.entries) {\n            while (!(step = iterator.next()).done) {\n              if (!isNode(step.value)) {\n                return false;\n              }\n            }\n          } else {\n            // Iterator will provide entry [k,v] tuples rather than values.\n            while (!(step = iterator.next()).done) {\n              var entry = step.value;\n              if (entry) {\n                if (!isNode(entry[1])) {\n                  return false;\n                }\n              }\n            }\n          }\n        } else {\n          return false;\n        }\n\n        return true;\n      default:\n        return false;\n    }\n  }\n\n  function isSymbol(propType, propValue) {\n    // Native Symbol.\n    if (propType === 'symbol') {\n      return true;\n    }\n\n    // falsy value can't be a Symbol\n    if (!propValue) {\n      return false;\n    }\n\n    // 19.4.3.5 Symbol.prototype[@@toStringTag] === 'Symbol'\n    if (propValue['@@toStringTag'] === 'Symbol') {\n      return true;\n    }\n\n    // Fallback for non-spec compliant Symbols which are polyfilled.\n    if (typeof Symbol === 'function' && propValue instanceof Symbol) {\n      return true;\n    }\n\n    return false;\n  }\n\n  // Equivalent of `typeof` but with special handling for array and regexp.\n  function getPropType(propValue) {\n    var propType = typeof propValue;\n    if (Array.isArray(propValue)) {\n      return 'array';\n    }\n    if (propValue instanceof RegExp) {\n      // Old webkits (at least until Android 4.0) return 'function' rather than\n      // 'object' for typeof a RegExp. We'll normalize this here so that /bla/\n      // passes PropTypes.object.\n      return 'object';\n    }\n    if (isSymbol(propType, propValue)) {\n      return 'symbol';\n    }\n    return propType;\n  }\n\n  // This handles more types than `getPropType`. Only used for error messages.\n  // See `createPrimitiveTypeChecker`.\n  function getPreciseType(propValue) {\n    if (typeof propValue === 'undefined' || propValue === null) {\n      return '' + propValue;\n    }\n    var propType = getPropType(propValue);\n    if (propType === 'object') {\n      if (propValue instanceof Date) {\n        return 'date';\n      } else if (propValue instanceof RegExp) {\n        return 'regexp';\n      }\n    }\n    return propType;\n  }\n\n  // Returns a string that is postfixed to a warning about an invalid type.\n  // For example, \"undefined\" or \"of type array\"\n  function getPostfixForTypeWarning(value) {\n    var type = getPreciseType(value);\n    switch (type) {\n      case 'array':\n      case 'object':\n        return 'an ' + type;\n      case 'boolean':\n      case 'date':\n      case 'regexp':\n        return 'a ' + type;\n      default:\n        return type;\n    }\n  }\n\n  // Returns class name of the object, if any.\n  function getClassName(propValue) {\n    if (!propValue.constructor || !propValue.constructor.name) {\n      return ANONYMOUS;\n    }\n    return propValue.constructor.name;\n  }\n\n  ReactPropTypes.checkPropTypes = checkPropTypes;\n  ReactPropTypes.resetWarningCache = checkPropTypes.resetWarningCache;\n  ReactPropTypes.PropTypes = ReactPropTypes;\n\n  return ReactPropTypes;\n};\n","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n\n'use strict';\n/* eslint-disable no-unused-vars */\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n\tif (val === null || val === undefined) {\n\t\tthrow new TypeError('Object.assign cannot be called with null or undefined');\n\t}\n\n\treturn Object(val);\n}\n\nfunction shouldUseNative() {\n\ttry {\n\t\tif (!Object.assign) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Detect buggy property enumeration order in older V8 versions.\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\t\tvar test1 = new String('abc');  // eslint-disable-line no-new-wrappers\n\t\ttest1[5] = 'de';\n\t\tif (Object.getOwnPropertyNames(test1)[0] === '5') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test2 = {};\n\t\tfor (var i = 0; i < 10; i++) {\n\t\t\ttest2['_' + String.fromCharCode(i)] = i;\n\t\t}\n\t\tvar order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n\t\t\treturn test2[n];\n\t\t});\n\t\tif (order2.join('') !== '0123456789') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test3 = {};\n\t\t'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n\t\t\ttest3[letter] = letter;\n\t\t});\n\t\tif (Object.keys(Object.assign({}, test3)).join('') !==\n\t\t\t\t'abcdefghijklmnopqrst') {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t} catch (err) {\n\t\t// We don't expect any of the above to throw, but better to be safe.\n\t\treturn false;\n\t}\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n\tvar from;\n\tvar to = toObject(target);\n\tvar symbols;\n\n\tfor (var s = 1; s < arguments.length; s++) {\n\t\tfrom = Object(arguments[s]);\n\n\t\tfor (var key in from) {\n\t\t\tif (hasOwnProperty.call(from, key)) {\n\t\t\t\tto[key] = from[key];\n\t\t\t}\n\t\t}\n\n\t\tif (getOwnPropertySymbols) {\n\t\t\tsymbols = getOwnPropertySymbols(from);\n\t\t\tfor (var i = 0; i < symbols.length; i++) {\n\t\t\t\tif (propIsEnumerable.call(from, symbols[i])) {\n\t\t\t\t\tto[symbols[i]] = from[symbols[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn to;\n};\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n","module.exports = Function.call.bind(Object.prototype.hasOwnProperty);\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar printWarning = function() {};\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n  var loggedTypeFailures = {};\n  var has = require('./lib/has');\n\n  printWarning = function(text) {\n    var message = 'Warning: ' + text;\n    if (typeof console !== 'undefined') {\n      console.error(message);\n    }\n    try {\n      // --- Welcome to debugging React ---\n      // This error was thrown as a convenience so that you can use this stack\n      // to find the callsite that caused this warning to fire.\n      throw new Error(message);\n    } catch (x) { /**/ }\n  };\n}\n\n/**\n * Assert that the values match with the type specs.\n * Error messages are memorized and will only be shown once.\n *\n * @param {object} typeSpecs Map of name to a ReactPropType\n * @param {object} values Runtime values that need to be type-checked\n * @param {string} location e.g. \"prop\", \"context\", \"child context\"\n * @param {string} componentName Name of the component for error messages.\n * @param {?Function} getStack Returns the component stack.\n * @private\n */\nfunction checkPropTypes(typeSpecs, values, location, componentName, getStack) {\n  if (process.env.NODE_ENV !== 'production') {\n    for (var typeSpecName in typeSpecs) {\n      if (has(typeSpecs, typeSpecName)) {\n        var error;\n        // Prop type validation may throw. In case they do, we don't want to\n        // fail the render phase where it didn't fail before. So we log it.\n        // After these have been cleaned up, we'll let them throw.\n        try {\n          // This is intentionally an invariant that gets caught. It's the same\n          // behavior as without this statement except with a better message.\n          if (typeof typeSpecs[typeSpecName] !== 'function') {\n            var err = Error(\n              (componentName || 'React class') + ': ' + location + ' type `' + typeSpecName + '` is invalid; ' +\n              'it must be a function, usually from the `prop-types` package, but received `' + typeof typeSpecs[typeSpecName] + '`.' +\n              'This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.'\n            );\n            err.name = 'Invariant Violation';\n            throw err;\n          }\n          error = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, ReactPropTypesSecret);\n        } catch (ex) {\n          error = ex;\n        }\n        if (error && !(error instanceof Error)) {\n          printWarning(\n            (componentName || 'React class') + ': type specification of ' +\n            location + ' `' + typeSpecName + '` is invalid; the type checker ' +\n            'function must return `null` or an `Error` but returned a ' + typeof error + '. ' +\n            'You may have forgotten to pass an argument to the type checker ' +\n            'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' +\n            'shape all require an argument).'\n          );\n        }\n        if (error instanceof Error && !(error.message in loggedTypeFailures)) {\n          // Only monitor this failure once because there tends to be a lot of the\n          // same error.\n          loggedTypeFailures[error.message] = true;\n\n          var stack = getStack ? getStack() : '';\n\n          printWarning(\n            'Failed ' + location + ' type: ' + error.message + (stack != null ? stack : '')\n          );\n        }\n      }\n    }\n  }\n}\n\n/**\n * Resets warning cache when testing.\n *\n * @private\n */\ncheckPropTypes.resetWarningCache = function() {\n  if (process.env.NODE_ENV !== 'production') {\n    loggedTypeFailures = {};\n  }\n}\n\nmodule.exports = checkPropTypes;\n","'use strict';\nmodule.exports = require('./html-tags.json');\n","[\n\t\"a\",\n\t\"abbr\",\n\t\"address\",\n\t\"area\",\n\t\"article\",\n\t\"aside\",\n\t\"audio\",\n\t\"b\",\n\t\"base\",\n\t\"bdi\",\n\t\"bdo\",\n\t\"blockquote\",\n\t\"body\",\n\t\"br\",\n\t\"button\",\n\t\"canvas\",\n\t\"caption\",\n\t\"cite\",\n\t\"code\",\n\t\"col\",\n\t\"colgroup\",\n\t\"data\",\n\t\"datalist\",\n\t\"dd\",\n\t\"del\",\n\t\"details\",\n\t\"dfn\",\n\t\"dialog\",\n\t\"div\",\n\t\"dl\",\n\t\"dt\",\n\t\"em\",\n\t\"embed\",\n\t\"fieldset\",\n\t\"figcaption\",\n\t\"figure\",\n\t\"footer\",\n\t\"form\",\n\t\"h1\",\n\t\"h2\",\n\t\"h3\",\n\t\"h4\",\n\t\"h5\",\n\t\"h6\",\n\t\"head\",\n\t\"header\",\n\t\"hgroup\",\n\t\"hr\",\n\t\"html\",\n\t\"i\",\n\t\"iframe\",\n\t\"img\",\n\t\"input\",\n\t\"ins\",\n\t\"kbd\",\n\t\"label\",\n\t\"legend\",\n\t\"li\",\n\t\"link\",\n\t\"main\",\n\t\"map\",\n\t\"mark\",\n\t\"math\",\n\t\"menu\",\n\t\"menuitem\",\n\t\"meta\",\n\t\"meter\",\n\t\"nav\",\n\t\"noscript\",\n\t\"object\",\n\t\"ol\",\n\t\"optgroup\",\n\t\"option\",\n\t\"output\",\n\t\"p\",\n\t\"param\",\n\t\"picture\",\n\t\"pre\",\n\t\"progress\",\n\t\"q\",\n\t\"rb\",\n\t\"rp\",\n\t\"rt\",\n\t\"rtc\",\n\t\"ruby\",\n\t\"s\",\n\t\"samp\",\n\t\"script\",\n\t\"section\",\n\t\"select\",\n\t\"slot\",\n\t\"small\",\n\t\"source\",\n\t\"span\",\n\t\"strong\",\n\t\"style\",\n\t\"sub\",\n\t\"summary\",\n\t\"sup\",\n\t\"svg\",\n\t\"table\",\n\t\"tbody\",\n\t\"td\",\n\t\"template\",\n\t\"textarea\",\n\t\"tfoot\",\n\t\"th\",\n\t\"thead\",\n\t\"time\",\n\t\"title\",\n\t\"tr\",\n\t\"track\",\n\t\"u\",\n\t\"ul\",\n\t\"var\",\n\t\"video\",\n\t\"wbr\"\n]\n","/*\n  Copyright (C) 2012-2014 Yusuke Suzuki <utatane.tea@gmail.com>\n  Copyright (C) 2015 Ingvar Stepanyan <me@rreverser.com>\n  Copyright (C) 2014 Ivan Nikulin <ifaaan@gmail.com>\n  Copyright (C) 2012-2013 Michael Ficarra <escodegen.copyright@michael.ficarra.me>\n  Copyright (C) 2012-2013 Mathias Bynens <mathias@qiwi.be>\n  Copyright (C) 2013 Irakli Gozalishvili <rfobic@gmail.com>\n  Copyright (C) 2012 Robert Gust-Bardon <donate@robert.gust-bardon.org>\n  Copyright (C) 2012 John Freeman <jfreeman08@gmail.com>\n  Copyright (C) 2011-2012 Ariya Hidayat <ariya.hidayat@gmail.com>\n  Copyright (C) 2012 Joost-Wim Boekesteijn <joost-wim@boekesteijn.nl>\n  Copyright (C) 2012 Kris Kowal <kris.kowal@cixar.com>\n  Copyright (C) 2012 Arpad Borsos <arpad.borsos@googlemail.com>\n  Copyright (C) 2020 Apple Inc. All rights reserved.\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and/or other materials provided with the distribution.\n\n  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n/*global exports:true, require:true, global:true*/\n(function () {\n    'use strict';\n\n    var Syntax,\n        Precedence,\n        BinaryPrecedence,\n        SourceNode,\n        estraverse,\n        esutils,\n        base,\n        indent,\n        json,\n        renumber,\n        hexadecimal,\n        quotes,\n        escapeless,\n        newline,\n        space,\n        parentheses,\n        semicolons,\n        safeConcatenation,\n        directive,\n        extra,\n        parse,\n        sourceMap,\n        sourceCode,\n        preserveBlankLines,\n        FORMAT_MINIFY,\n        FORMAT_DEFAULTS;\n\n    estraverse = require('estraverse');\n    esutils = require('esutils');\n\n    Syntax = estraverse.Syntax;\n\n    // Generation is done by generateExpression.\n    function isExpression(node) {\n        return CodeGenerator.Expression.hasOwnProperty(node.type);\n    }\n\n    // Generation is done by generateStatement.\n    function isStatement(node) {\n        return CodeGenerator.Statement.hasOwnProperty(node.type);\n    }\n\n    Precedence = {\n        Sequence: 0,\n        Yield: 1,\n        Assignment: 1,\n        Conditional: 2,\n        ArrowFunction: 2,\n        Coalesce: 3,\n        LogicalOR: 4,\n        LogicalAND: 5,\n        BitwiseOR: 6,\n        BitwiseXOR: 7,\n        BitwiseAND: 8,\n        Equality: 9,\n        Relational: 10,\n        BitwiseSHIFT: 11,\n        Additive: 12,\n        Multiplicative: 13,\n        Exponentiation: 14,\n        Await: 15,\n        Unary: 15,\n        Postfix: 16,\n        OptionalChaining: 17,\n        Call: 18,\n        New: 19,\n        TaggedTemplate: 20,\n        Member: 21,\n        Primary: 22\n    };\n\n    BinaryPrecedence = {\n        '??': Precedence.Coalesce,\n        '||': Precedence.LogicalOR,\n        '&&': Precedence.LogicalAND,\n        '|': Precedence.BitwiseOR,\n        '^': Precedence.BitwiseXOR,\n        '&': Precedence.BitwiseAND,\n        '==': Precedence.Equality,\n        '!=': Precedence.Equality,\n        '===': Precedence.Equality,\n        '!==': Precedence.Equality,\n        'is': Precedence.Equality,\n        'isnt': Precedence.Equality,\n        '<': Precedence.Relational,\n        '>': Precedence.Relational,\n        '<=': Precedence.Relational,\n        '>=': Precedence.Relational,\n        'in': Precedence.Relational,\n        'instanceof': Precedence.Relational,\n        '<<': Precedence.BitwiseSHIFT,\n        '>>': Precedence.BitwiseSHIFT,\n        '>>>': Precedence.BitwiseSHIFT,\n        '+': Precedence.Additive,\n        '-': Precedence.Additive,\n        '*': Precedence.Multiplicative,\n        '%': Precedence.Multiplicative,\n        '/': Precedence.Multiplicative,\n        '**': Precedence.Exponentiation\n    };\n\n    //Flags\n    var F_ALLOW_IN = 1,\n        F_ALLOW_CALL = 1 << 1,\n        F_ALLOW_UNPARATH_NEW = 1 << 2,\n        F_FUNC_BODY = 1 << 3,\n        F_DIRECTIVE_CTX = 1 << 4,\n        F_SEMICOLON_OPT = 1 << 5,\n        F_FOUND_COALESCE = 1 << 6;\n\n    //Expression flag sets\n    //NOTE: Flag order:\n    // F_ALLOW_IN\n    // F_ALLOW_CALL\n    // F_ALLOW_UNPARATH_NEW\n    var E_FTT = F_ALLOW_CALL | F_ALLOW_UNPARATH_NEW,\n        E_TTF = F_ALLOW_IN | F_ALLOW_CALL,\n        E_TTT = F_ALLOW_IN | F_ALLOW_CALL | F_ALLOW_UNPARATH_NEW,\n        E_TFF = F_ALLOW_IN,\n        E_FFT = F_ALLOW_UNPARATH_NEW,\n        E_TFT = F_ALLOW_IN | F_ALLOW_UNPARATH_NEW;\n\n    //Statement flag sets\n    //NOTE: Flag order:\n    // F_ALLOW_IN\n    // F_FUNC_BODY\n    // F_DIRECTIVE_CTX\n    // F_SEMICOLON_OPT\n    var S_TFFF = F_ALLOW_IN,\n        S_TFFT = F_ALLOW_IN | F_SEMICOLON_OPT,\n        S_FFFF = 0x00,\n        S_TFTF = F_ALLOW_IN | F_DIRECTIVE_CTX,\n        S_TTFF = F_ALLOW_IN | F_FUNC_BODY;\n\n    function getDefaultOptions() {\n        // default options\n        return {\n            indent: null,\n            base: null,\n            parse: null,\n            comment: false,\n            format: {\n                indent: {\n                    style: '    ',\n                    base: 0,\n                    adjustMultilineComment: false\n                },\n                newline: '\\n',\n                space: ' ',\n                json: false,\n                renumber: false,\n                hexadecimal: false,\n                quotes: 'single',\n                escapeless: false,\n                compact: false,\n                parentheses: true,\n                semicolons: true,\n                safeConcatenation: false,\n                preserveBlankLines: false\n            },\n            moz: {\n                comprehensionExpressionStartsWithAssignment: false,\n                starlessGenerator: false\n            },\n            sourceMap: null,\n            sourceMapRoot: null,\n            sourceMapWithCode: false,\n            directive: false,\n            raw: true,\n            verbatim: null,\n            sourceCode: null\n        };\n    }\n\n    function stringRepeat(str, num) {\n        var result = '';\n\n        for (num |= 0; num > 0; num >>>= 1, str += str) {\n            if (num & 1) {\n                result += str;\n            }\n        }\n\n        return result;\n    }\n\n    function hasLineTerminator(str) {\n        return (/[\\r\\n]/g).test(str);\n    }\n\n    function endsWithLineTerminator(str) {\n        var len = str.length;\n        return len && esutils.code.isLineTerminator(str.charCodeAt(len - 1));\n    }\n\n    function merge(target, override) {\n        var key;\n        for (key in override) {\n            if (override.hasOwnProperty(key)) {\n                target[key] = override[key];\n            }\n        }\n        return target;\n    }\n\n    function updateDeeply(target, override) {\n        var key, val;\n\n        function isHashObject(target) {\n            return typeof target === 'object' && target instanceof Object && !(target instanceof RegExp);\n        }\n\n        for (key in override) {\n            if (override.hasOwnProperty(key)) {\n                val = override[key];\n                if (isHashObject(val)) {\n                    if (isHashObject(target[key])) {\n                        updateDeeply(target[key], val);\n                    } else {\n                        target[key] = updateDeeply({}, val);\n                    }\n                } else {\n                    target[key] = val;\n                }\n            }\n        }\n        return target;\n    }\n\n    function generateNumber(value) {\n        var result, point, temp, exponent, pos;\n\n        if (value !== value) {\n            throw new Error('Numeric literal whose value is NaN');\n        }\n        if (value < 0 || (value === 0 && 1 / value < 0)) {\n            throw new Error('Numeric literal whose value is negative');\n        }\n\n        if (value === 1 / 0) {\n            return json ? 'null' : renumber ? '1e400' : '1e+400';\n        }\n\n        result = '' + value;\n        if (!renumber || result.length < 3) {\n            return result;\n        }\n\n        point = result.indexOf('.');\n        if (!json && result.charCodeAt(0) === 0x30  /* 0 */ && point === 1) {\n            point = 0;\n            result = result.slice(1);\n        }\n        temp = result;\n        result = result.replace('e+', 'e');\n        exponent = 0;\n        if ((pos = temp.indexOf('e')) > 0) {\n            exponent = +temp.slice(pos + 1);\n            temp = temp.slice(0, pos);\n        }\n        if (point >= 0) {\n            exponent -= temp.length - point - 1;\n            temp = +(temp.slice(0, point) + temp.slice(point + 1)) + '';\n        }\n        pos = 0;\n        while (temp.charCodeAt(temp.length + pos - 1) === 0x30  /* 0 */) {\n            --pos;\n        }\n        if (pos !== 0) {\n            exponent -= pos;\n            temp = temp.slice(0, pos);\n        }\n        if (exponent !== 0) {\n            temp += 'e' + exponent;\n        }\n        if ((temp.length < result.length ||\n                    (hexadecimal && value > 1e12 && Math.floor(value) === value && (temp = '0x' + value.toString(16)).length < result.length)) &&\n                +temp === value) {\n            result = temp;\n        }\n\n        return result;\n    }\n\n    // Generate valid RegExp expression.\n    // This function is based on https://github.com/Constellation/iv Engine\n\n    function escapeRegExpCharacter(ch, previousIsBackslash) {\n        // not handling '\\' and handling \\u2028 or \\u2029 to unicode escape sequence\n        if ((ch & ~1) === 0x2028) {\n            return (previousIsBackslash ? 'u' : '\\\\u') + ((ch === 0x2028) ? '2028' : '2029');\n        } else if (ch === 10 || ch === 13) {  // \\n, \\r\n            return (previousIsBackslash ? '' : '\\\\') + ((ch === 10) ? 'n' : 'r');\n        }\n        return String.fromCharCode(ch);\n    }\n\n    function generateRegExp(reg) {\n        var match, result, flags, i, iz, ch, characterInBrack, previousIsBackslash;\n\n        result = reg.toString();\n\n        if (reg.source) {\n            // extract flag from toString result\n            match = result.match(/\\/([^/]*)$/);\n            if (!match) {\n                return result;\n            }\n\n            flags = match[1];\n            result = '';\n\n            characterInBrack = false;\n            previousIsBackslash = false;\n            for (i = 0, iz = reg.source.length; i < iz; ++i) {\n                ch = reg.source.charCodeAt(i);\n\n                if (!previousIsBackslash) {\n                    if (characterInBrack) {\n                        if (ch === 93) {  // ]\n                            characterInBrack = false;\n                        }\n                    } else {\n                        if (ch === 47) {  // /\n                            result += '\\\\';\n                        } else if (ch === 91) {  // [\n                            characterInBrack = true;\n                        }\n                    }\n                    result += escapeRegExpCharacter(ch, previousIsBackslash);\n                    previousIsBackslash = ch === 92;  // \\\n                } else {\n                    // if new RegExp(\"\\\\\\n') is provided, create /\\n/\n                    result += escapeRegExpCharacter(ch, previousIsBackslash);\n                    // prevent like /\\\\[/]/\n                    previousIsBackslash = false;\n                }\n            }\n\n            return '/' + result + '/' + flags;\n        }\n\n        return result;\n    }\n\n    function escapeAllowedCharacter(code, next) {\n        var hex;\n\n        if (code === 0x08  /* \\b */) {\n            return '\\\\b';\n        }\n\n        if (code === 0x0C  /* \\f */) {\n            return '\\\\f';\n        }\n\n        if (code === 0x09  /* \\t */) {\n            return '\\\\t';\n        }\n\n        hex = code.toString(16).toUpperCase();\n        if (json || code > 0xFF) {\n            return '\\\\u' + '0000'.slice(hex.length) + hex;\n        } else if (code === 0x0000 && !esutils.code.isDecimalDigit(next)) {\n            return '\\\\0';\n        } else if (code === 0x000B  /* \\v */) { // '\\v'\n            return '\\\\x0B';\n        } else {\n            return '\\\\x' + '00'.slice(hex.length) + hex;\n        }\n    }\n\n    function escapeDisallowedCharacter(code) {\n        if (code === 0x5C  /* \\ */) {\n            return '\\\\\\\\';\n        }\n\n        if (code === 0x0A  /* \\n */) {\n            return '\\\\n';\n        }\n\n        if (code === 0x0D  /* \\r */) {\n            return '\\\\r';\n        }\n\n        if (code === 0x2028) {\n            return '\\\\u2028';\n        }\n\n        if (code === 0x2029) {\n            return '\\\\u2029';\n        }\n\n        throw new Error('Incorrectly classified character');\n    }\n\n    function escapeDirective(str) {\n        var i, iz, code, quote;\n\n        quote = quotes === 'double' ? '\"' : '\\'';\n        for (i = 0, iz = str.length; i < iz; ++i) {\n            code = str.charCodeAt(i);\n            if (code === 0x27  /* ' */) {\n                quote = '\"';\n                break;\n            } else if (code === 0x22  /* \" */) {\n                quote = '\\'';\n                break;\n            } else if (code === 0x5C  /* \\ */) {\n                ++i;\n            }\n        }\n\n        return quote + str + quote;\n    }\n\n    function escapeString(str) {\n        var result = '', i, len, code, singleQuotes = 0, doubleQuotes = 0, single, quote;\n\n        for (i = 0, len = str.length; i < len; ++i) {\n            code = str.charCodeAt(i);\n            if (code === 0x27  /* ' */) {\n                ++singleQuotes;\n            } else if (code === 0x22  /* \" */) {\n                ++doubleQuotes;\n            } else if (code === 0x2F  /* / */ && json) {\n                result += '\\\\';\n            } else if (esutils.code.isLineTerminator(code) || code === 0x5C  /* \\ */) {\n                result += escapeDisallowedCharacter(code);\n                continue;\n            } else if (!esutils.code.isIdentifierPartES5(code) && (json && code < 0x20  /* SP */ || !json && !escapeless && (code < 0x20  /* SP */ || code > 0x7E  /* ~ */))) {\n                result += escapeAllowedCharacter(code, str.charCodeAt(i + 1));\n                continue;\n            }\n            result += String.fromCharCode(code);\n        }\n\n        single = !(quotes === 'double' || (quotes === 'auto' && doubleQuotes < singleQuotes));\n        quote = single ? '\\'' : '\"';\n\n        if (!(single ? singleQuotes : doubleQuotes)) {\n            return quote + result + quote;\n        }\n\n        str = result;\n        result = quote;\n\n        for (i = 0, len = str.length; i < len; ++i) {\n            code = str.charCodeAt(i);\n            if ((code === 0x27  /* ' */ && single) || (code === 0x22  /* \" */ && !single)) {\n                result += '\\\\';\n            }\n            result += String.fromCharCode(code);\n        }\n\n        return result + quote;\n    }\n\n    /**\n     * flatten an array to a string, where the array can contain\n     * either strings or nested arrays\n     */\n    function flattenToString(arr) {\n        var i, iz, elem, result = '';\n        for (i = 0, iz = arr.length; i < iz; ++i) {\n            elem = arr[i];\n            result += Array.isArray(elem) ? flattenToString(elem) : elem;\n        }\n        return result;\n    }\n\n    /**\n     * convert generated to a SourceNode when source maps are enabled.\n     */\n    function toSourceNodeWhenNeeded(generated, node) {\n        if (!sourceMap) {\n            // with no source maps, generated is either an\n            // array or a string.  if an array, flatten it.\n            // if a string, just return it\n            if (Array.isArray(generated)) {\n                return flattenToString(generated);\n            } else {\n                return generated;\n            }\n        }\n        if (node == null) {\n            if (generated instanceof SourceNode) {\n                return generated;\n            } else {\n                node = {};\n            }\n        }\n        if (node.loc == null) {\n            return new SourceNode(null, null, sourceMap, generated, node.name || null);\n        }\n        return new SourceNode(node.loc.start.line, node.loc.start.column, (sourceMap === true ? node.loc.source || null : sourceMap), generated, node.name || null);\n    }\n\n    function noEmptySpace() {\n        return (space) ? space : ' ';\n    }\n\n    function join(left, right) {\n        var leftSource,\n            rightSource,\n            leftCharCode,\n            rightCharCode;\n\n        leftSource = toSourceNodeWhenNeeded(left).toString();\n        if (leftSource.length === 0) {\n            return [right];\n        }\n\n        rightSource = toSourceNodeWhenNeeded(right).toString();\n        if (rightSource.length === 0) {\n            return [left];\n        }\n\n        leftCharCode = leftSource.charCodeAt(leftSource.length - 1);\n        rightCharCode = rightSource.charCodeAt(0);\n\n        if ((leftCharCode === 0x2B  /* + */ || leftCharCode === 0x2D  /* - */) && leftCharCode === rightCharCode ||\n            esutils.code.isIdentifierPartES5(leftCharCode) && esutils.code.isIdentifierPartES5(rightCharCode) ||\n            leftCharCode === 0x2F  /* / */ && rightCharCode === 0x69  /* i */) { // infix word operators all start with `i`\n            return [left, noEmptySpace(), right];\n        } else if (esutils.code.isWhiteSpace(leftCharCode) || esutils.code.isLineTerminator(leftCharCode) ||\n                esutils.code.isWhiteSpace(rightCharCode) || esutils.code.isLineTerminator(rightCharCode)) {\n            return [left, right];\n        }\n        return [left, space, right];\n    }\n\n    function addIndent(stmt) {\n        return [base, stmt];\n    }\n\n    function withIndent(fn) {\n        var previousBase;\n        previousBase = base;\n        base += indent;\n        fn(base);\n        base = previousBase;\n    }\n\n    function calculateSpaces(str) {\n        var i;\n        for (i = str.length - 1; i >= 0; --i) {\n            if (esutils.code.isLineTerminator(str.charCodeAt(i))) {\n                break;\n            }\n        }\n        return (str.length - 1) - i;\n    }\n\n    function adjustMultilineComment(value, specialBase) {\n        var array, i, len, line, j, spaces, previousBase, sn;\n\n        array = value.split(/\\r\\n|[\\r\\n]/);\n        spaces = Number.MAX_VALUE;\n\n        // first line doesn't have indentation\n        for (i = 1, len = array.length; i < len; ++i) {\n            line = array[i];\n            j = 0;\n            while (j < line.length && esutils.code.isWhiteSpace(line.charCodeAt(j))) {\n                ++j;\n            }\n            if (spaces > j) {\n                spaces = j;\n            }\n        }\n\n        if (typeof specialBase !== 'undefined') {\n            // pattern like\n            // {\n            //   var t = 20;  /*\n            //                 * this is comment\n            //                 */\n            // }\n            previousBase = base;\n            if (array[1][spaces] === '*') {\n                specialBase += ' ';\n            }\n            base = specialBase;\n        } else {\n            if (spaces & 1) {\n                // /*\n                //  *\n                //  */\n                // If spaces are odd number, above pattern is considered.\n                // We waste 1 space.\n                --spaces;\n            }\n            previousBase = base;\n        }\n\n        for (i = 1, len = array.length; i < len; ++i) {\n            sn = toSourceNodeWhenNeeded(addIndent(array[i].slice(spaces)));\n            array[i] = sourceMap ? sn.join('') : sn;\n        }\n\n        base = previousBase;\n\n        return array.join('\\n');\n    }\n\n    function generateComment(comment, specialBase) {\n        if (comment.type === 'Line') {\n            if (endsWithLineTerminator(comment.value)) {\n                return '//' + comment.value;\n            } else {\n                // Always use LineTerminator\n                var result = '//' + comment.value;\n                if (!preserveBlankLines) {\n                    result += '\\n';\n                }\n                return result;\n            }\n        }\n        if (extra.format.indent.adjustMultilineComment && /[\\n\\r]/.test(comment.value)) {\n            return adjustMultilineComment('/*' + comment.value + '*/', specialBase);\n        }\n        return '/*' + comment.value + '*/';\n    }\n\n    function addComments(stmt, result) {\n        var i, len, comment, save, tailingToStatement, specialBase, fragment,\n            extRange, range, prevRange, prefix, infix, suffix, count;\n\n        if (stmt.leadingComments && stmt.leadingComments.length > 0) {\n            save = result;\n\n            if (preserveBlankLines) {\n                comment = stmt.leadingComments[0];\n                result = [];\n\n                extRange = comment.extendedRange;\n                range = comment.range;\n\n                prefix = sourceCode.substring(extRange[0], range[0]);\n                count = (prefix.match(/\\n/g) || []).length;\n                if (count > 0) {\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n                } else {\n                    result.push(prefix);\n                    result.push(generateComment(comment));\n                }\n\n                prevRange = range;\n\n                for (i = 1, len = stmt.leadingComments.length; i < len; i++) {\n                    comment = stmt.leadingComments[i];\n                    range = comment.range;\n\n                    infix = sourceCode.substring(prevRange[1], range[0]);\n                    count = (infix.match(/\\n/g) || []).length;\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n\n                    prevRange = range;\n                }\n\n                suffix = sourceCode.substring(range[1], extRange[1]);\n                count = (suffix.match(/\\n/g) || []).length;\n                result.push(stringRepeat('\\n', count));\n            } else {\n                comment = stmt.leadingComments[0];\n                result = [];\n                if (safeConcatenation && stmt.type === Syntax.Program && stmt.body.length === 0) {\n                    result.push('\\n');\n                }\n                result.push(generateComment(comment));\n                if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                    result.push('\\n');\n                }\n\n                for (i = 1, len = stmt.leadingComments.length; i < len; ++i) {\n                    comment = stmt.leadingComments[i];\n                    fragment = [generateComment(comment)];\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                        fragment.push('\\n');\n                    }\n                    result.push(addIndent(fragment));\n                }\n            }\n\n            result.push(addIndent(save));\n        }\n\n        if (stmt.trailingComments) {\n\n            if (preserveBlankLines) {\n                comment = stmt.trailingComments[0];\n                extRange = comment.extendedRange;\n                range = comment.range;\n\n                prefix = sourceCode.substring(extRange[0], range[0]);\n                count = (prefix.match(/\\n/g) || []).length;\n\n                if (count > 0) {\n                    result.push(stringRepeat('\\n', count));\n                    result.push(addIndent(generateComment(comment)));\n                } else {\n                    result.push(prefix);\n                    result.push(generateComment(comment));\n                }\n            } else {\n                tailingToStatement = !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString());\n                specialBase = stringRepeat(' ', calculateSpaces(toSourceNodeWhenNeeded([base, result, indent]).toString()));\n                for (i = 0, len = stmt.trailingComments.length; i < len; ++i) {\n                    comment = stmt.trailingComments[i];\n                    if (tailingToStatement) {\n                        // We assume target like following script\n                        //\n                        // var t = 20;  /**\n                        //               * This is comment of t\n                        //               */\n                        if (i === 0) {\n                            // first case\n                            result = [result, indent];\n                        } else {\n                            result = [result, specialBase];\n                        }\n                        result.push(generateComment(comment, specialBase));\n                    } else {\n                        result = [result, addIndent(generateComment(comment))];\n                    }\n                    if (i !== len - 1 && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                        result = [result, '\\n'];\n                    }\n                }\n            }\n        }\n\n        return result;\n    }\n\n    function generateBlankLines(start, end, result) {\n        var j, newlineCount = 0;\n\n        for (j = start; j < end; j++) {\n            if (sourceCode[j] === '\\n') {\n                newlineCount++;\n            }\n        }\n\n        for (j = 1; j < newlineCount; j++) {\n            result.push(newline);\n        }\n    }\n\n    function parenthesize(text, current, should) {\n        if (current < should) {\n            return ['(', text, ')'];\n        }\n        return text;\n    }\n\n    function generateVerbatimString(string) {\n        var i, iz, result;\n        result = string.split(/\\r\\n|\\n/);\n        for (i = 1, iz = result.length; i < iz; i++) {\n            result[i] = newline + base + result[i];\n        }\n        return result;\n    }\n\n    function generateVerbatim(expr, precedence) {\n        var verbatim, result, prec;\n        verbatim = expr[extra.verbatim];\n\n        if (typeof verbatim === 'string') {\n            result = parenthesize(generateVerbatimString(verbatim), Precedence.Sequence, precedence);\n        } else {\n            // verbatim is object\n            result = generateVerbatimString(verbatim.content);\n            prec = (verbatim.precedence != null) ? verbatim.precedence : Precedence.Sequence;\n            result = parenthesize(result, prec, precedence);\n        }\n\n        return toSourceNodeWhenNeeded(result, expr);\n    }\n\n    function CodeGenerator() {\n    }\n\n    // Helpers.\n\n    CodeGenerator.prototype.maybeBlock = function(stmt, flags) {\n        var result, noLeadingComment, that = this;\n\n        noLeadingComment = !extra.comment || !stmt.leadingComments;\n\n        if (stmt.type === Syntax.BlockStatement && noLeadingComment) {\n            return [space, this.generateStatement(stmt, flags)];\n        }\n\n        if (stmt.type === Syntax.EmptyStatement && noLeadingComment) {\n            return ';';\n        }\n\n        withIndent(function () {\n            result = [\n                newline,\n                addIndent(that.generateStatement(stmt, flags))\n            ];\n        });\n\n        return result;\n    };\n\n    CodeGenerator.prototype.maybeBlockSuffix = function (stmt, result) {\n        var ends = endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString());\n        if (stmt.type === Syntax.BlockStatement && (!extra.comment || !stmt.leadingComments) && !ends) {\n            return [result, space];\n        }\n        if (ends) {\n            return [result, base];\n        }\n        return [result, newline, base];\n    };\n\n    function generateIdentifier(node) {\n        return toSourceNodeWhenNeeded(node.name, node);\n    }\n\n    function generateAsyncPrefix(node, spaceRequired) {\n        return node.async ? 'async' + (spaceRequired ? noEmptySpace() : space) : '';\n    }\n\n    function generateStarSuffix(node) {\n        var isGenerator = node.generator && !extra.moz.starlessGenerator;\n        return isGenerator ? '*' + space : '';\n    }\n\n    function generateMethodPrefix(prop) {\n        var func = prop.value, prefix = '';\n        if (func.async) {\n            prefix += generateAsyncPrefix(func, !prop.computed);\n        }\n        if (func.generator) {\n            // avoid space before method name\n            prefix += generateStarSuffix(func) ? '*' : '';\n        }\n        return prefix;\n    }\n\n    CodeGenerator.prototype.generatePattern = function (node, precedence, flags) {\n        if (node.type === Syntax.Identifier) {\n            return generateIdentifier(node);\n        }\n        return this.generateExpression(node, precedence, flags);\n    };\n\n    CodeGenerator.prototype.generateFunctionParams = function (node) {\n        var i, iz, result, hasDefault;\n\n        hasDefault = false;\n\n        if (node.type === Syntax.ArrowFunctionExpression &&\n                !node.rest && (!node.defaults || node.defaults.length === 0) &&\n                node.params.length === 1 && node.params[0].type === Syntax.Identifier) {\n            // arg => { } case\n            result = [generateAsyncPrefix(node, true), generateIdentifier(node.params[0])];\n        } else {\n            result = node.type === Syntax.ArrowFunctionExpression ? [generateAsyncPrefix(node, false)] : [];\n            result.push('(');\n            if (node.defaults) {\n                hasDefault = true;\n            }\n            for (i = 0, iz = node.params.length; i < iz; ++i) {\n                if (hasDefault && node.defaults[i]) {\n                    // Handle default values.\n                    result.push(this.generateAssignment(node.params[i], node.defaults[i], '=', Precedence.Assignment, E_TTT));\n                } else {\n                    result.push(this.generatePattern(node.params[i], Precedence.Assignment, E_TTT));\n                }\n                if (i + 1 < iz) {\n                    result.push(',' + space);\n                }\n            }\n\n            if (node.rest) {\n                if (node.params.length) {\n                    result.push(',' + space);\n                }\n                result.push('...');\n                result.push(generateIdentifier(node.rest));\n            }\n\n            result.push(')');\n        }\n\n        return result;\n    };\n\n    CodeGenerator.prototype.generateFunctionBody = function (node) {\n        var result, expr;\n\n        result = this.generateFunctionParams(node);\n\n        if (node.type === Syntax.ArrowFunctionExpression) {\n            result.push(space);\n            result.push('=>');\n        }\n\n        if (node.expression) {\n            result.push(space);\n            expr = this.generateExpression(node.body, Precedence.Assignment, E_TTT);\n            if (expr.toString().charAt(0) === '{') {\n                expr = ['(', expr, ')'];\n            }\n            result.push(expr);\n        } else {\n            result.push(this.maybeBlock(node.body, S_TTFF));\n        }\n\n        return result;\n    };\n\n    CodeGenerator.prototype.generateIterationForStatement = function (operator, stmt, flags) {\n        var result = ['for' + (stmt.await ? noEmptySpace() + 'await' : '') + space + '('], that = this;\n        withIndent(function () {\n            if (stmt.left.type === Syntax.VariableDeclaration) {\n                withIndent(function () {\n                    result.push(stmt.left.kind + noEmptySpace());\n                    result.push(that.generateStatement(stmt.left.declarations[0], S_FFFF));\n                });\n            } else {\n                result.push(that.generateExpression(stmt.left, Precedence.Call, E_TTT));\n            }\n\n            result = join(result, operator);\n            result = [join(\n                result,\n                that.generateExpression(stmt.right, Precedence.Assignment, E_TTT)\n            ), ')'];\n        });\n        result.push(this.maybeBlock(stmt.body, flags));\n        return result;\n    };\n\n    CodeGenerator.prototype.generatePropertyKey = function (expr, computed) {\n        var result = [];\n\n        if (computed) {\n            result.push('[');\n        }\n\n        result.push(this.generateExpression(expr, Precedence.Assignment, E_TTT));\n\n        if (computed) {\n            result.push(']');\n        }\n\n        return result;\n    };\n\n    CodeGenerator.prototype.generateAssignment = function (left, right, operator, precedence, flags) {\n        if (Precedence.Assignment < precedence) {\n            flags |= F_ALLOW_IN;\n        }\n\n        return parenthesize(\n            [\n                this.generateExpression(left, Precedence.Call, flags),\n                space + operator + space,\n                this.generateExpression(right, Precedence.Assignment, flags)\n            ],\n            Precedence.Assignment,\n            precedence\n        );\n    };\n\n    CodeGenerator.prototype.semicolon = function (flags) {\n        if (!semicolons && flags & F_SEMICOLON_OPT) {\n            return '';\n        }\n        return ';';\n    };\n\n    // Statements.\n\n    CodeGenerator.Statement = {\n\n        BlockStatement: function (stmt, flags) {\n            var range, content, result = ['{', newline], that = this;\n\n            withIndent(function () {\n                // handle functions without any code\n                if (stmt.body.length === 0 && preserveBlankLines) {\n                    range = stmt.range;\n                    if (range[1] - range[0] > 2) {\n                        content = sourceCode.substring(range[0] + 1, range[1] - 1);\n                        if (content[0] === '\\n') {\n                            result = ['{'];\n                        }\n                        result.push(content);\n                    }\n                }\n\n                var i, iz, fragment, bodyFlags;\n                bodyFlags = S_TFFF;\n                if (flags & F_FUNC_BODY) {\n                    bodyFlags |= F_DIRECTIVE_CTX;\n                }\n\n                for (i = 0, iz = stmt.body.length; i < iz; ++i) {\n                    if (preserveBlankLines) {\n                        // handle spaces before the first line\n                        if (i === 0) {\n                            if (stmt.body[0].leadingComments) {\n                                range = stmt.body[0].leadingComments[0].extendedRange;\n                                content = sourceCode.substring(range[0], range[1]);\n                                if (content[0] === '\\n') {\n                                    result = ['{'];\n                                }\n                            }\n                            if (!stmt.body[0].leadingComments) {\n                                generateBlankLines(stmt.range[0], stmt.body[0].range[0], result);\n                            }\n                        }\n\n                        // handle spaces between lines\n                        if (i > 0) {\n                            if (!stmt.body[i - 1].trailingComments  && !stmt.body[i].leadingComments) {\n                                generateBlankLines(stmt.body[i - 1].range[1], stmt.body[i].range[0], result);\n                            }\n                        }\n                    }\n\n                    if (i === iz - 1) {\n                        bodyFlags |= F_SEMICOLON_OPT;\n                    }\n\n                    if (stmt.body[i].leadingComments && preserveBlankLines) {\n                        fragment = that.generateStatement(stmt.body[i], bodyFlags);\n                    } else {\n                        fragment = addIndent(that.generateStatement(stmt.body[i], bodyFlags));\n                    }\n\n                    result.push(fragment);\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                        if (preserveBlankLines && i < iz - 1) {\n                            // don't add a new line if there are leading coments\n                            // in the next statement\n                            if (!stmt.body[i + 1].leadingComments) {\n                                result.push(newline);\n                            }\n                        } else {\n                            result.push(newline);\n                        }\n                    }\n\n                    if (preserveBlankLines) {\n                        // handle spaces after the last line\n                        if (i === iz - 1) {\n                            if (!stmt.body[i].trailingComments) {\n                                generateBlankLines(stmt.body[i].range[1], stmt.range[1], result);\n                            }\n                        }\n                    }\n                }\n            });\n\n            result.push(addIndent('}'));\n            return result;\n        },\n\n        BreakStatement: function (stmt, flags) {\n            if (stmt.label) {\n                return 'break ' + stmt.label.name + this.semicolon(flags);\n            }\n            return 'break' + this.semicolon(flags);\n        },\n\n        ContinueStatement: function (stmt, flags) {\n            if (stmt.label) {\n                return 'continue ' + stmt.label.name + this.semicolon(flags);\n            }\n            return 'continue' + this.semicolon(flags);\n        },\n\n        ClassBody: function (stmt, flags) {\n            var result = [ '{', newline], that = this;\n\n            withIndent(function (indent) {\n                var i, iz;\n\n                for (i = 0, iz = stmt.body.length; i < iz; ++i) {\n                    result.push(indent);\n                    result.push(that.generateExpression(stmt.body[i], Precedence.Sequence, E_TTT));\n                    if (i + 1 < iz) {\n                        result.push(newline);\n                    }\n                }\n            });\n\n            if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                result.push(newline);\n            }\n            result.push(base);\n            result.push('}');\n            return result;\n        },\n\n        ClassDeclaration: function (stmt, flags) {\n            var result, fragment;\n            result  = ['class'];\n            if (stmt.id) {\n                result = join(result, this.generateExpression(stmt.id, Precedence.Sequence, E_TTT));\n            }\n            if (stmt.superClass) {\n                fragment = join('extends', this.generateExpression(stmt.superClass, Precedence.Unary, E_TTT));\n                result = join(result, fragment);\n            }\n            result.push(space);\n            result.push(this.generateStatement(stmt.body, S_TFFT));\n            return result;\n        },\n\n        DirectiveStatement: function (stmt, flags) {\n            if (extra.raw && stmt.raw) {\n                return stmt.raw + this.semicolon(flags);\n            }\n            return escapeDirective(stmt.directive) + this.semicolon(flags);\n        },\n\n        DoWhileStatement: function (stmt, flags) {\n            // Because `do 42 while (cond)` is Syntax Error. We need semicolon.\n            var result = join('do', this.maybeBlock(stmt.body, S_TFFF));\n            result = this.maybeBlockSuffix(stmt.body, result);\n            return join(result, [\n                'while' + space + '(',\n                this.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                ')' + this.semicolon(flags)\n            ]);\n        },\n\n        CatchClause: function (stmt, flags) {\n            var result, that = this;\n            withIndent(function () {\n                var guard;\n\n                if (stmt.param) {\n                    result = [\n                        'catch' + space + '(',\n                        that.generateExpression(stmt.param, Precedence.Sequence, E_TTT),\n                        ')'\n                    ];\n\n                    if (stmt.guard) {\n                        guard = that.generateExpression(stmt.guard, Precedence.Sequence, E_TTT);\n                        result.splice(2, 0, ' if ', guard);\n                    }\n                } else {\n                    result = ['catch'];\n                }\n            });\n            result.push(this.maybeBlock(stmt.body, S_TFFF));\n            return result;\n        },\n\n        DebuggerStatement: function (stmt, flags) {\n            return 'debugger' + this.semicolon(flags);\n        },\n\n        EmptyStatement: function (stmt, flags) {\n            return ';';\n        },\n\n        ExportDefaultDeclaration: function (stmt, flags) {\n            var result = [ 'export' ], bodyFlags;\n\n            bodyFlags = (flags & F_SEMICOLON_OPT) ? S_TFFT : S_TFFF;\n\n            // export default HoistableDeclaration[Default]\n            // export default AssignmentExpression[In] ;\n            result = join(result, 'default');\n            if (isStatement(stmt.declaration)) {\n                result = join(result, this.generateStatement(stmt.declaration, bodyFlags));\n            } else {\n                result = join(result, this.generateExpression(stmt.declaration, Precedence.Assignment, E_TTT) + this.semicolon(flags));\n            }\n            return result;\n        },\n\n        ExportNamedDeclaration: function (stmt, flags) {\n            var result = [ 'export' ], bodyFlags, that = this;\n\n            bodyFlags = (flags & F_SEMICOLON_OPT) ? S_TFFT : S_TFFF;\n\n            // export VariableStatement\n            // export Declaration[Default]\n            if (stmt.declaration) {\n                return join(result, this.generateStatement(stmt.declaration, bodyFlags));\n            }\n\n            // export ExportClause[NoReference] FromClause ;\n            // export ExportClause ;\n            if (stmt.specifiers) {\n                if (stmt.specifiers.length === 0) {\n                    result = join(result, '{' + space + '}');\n                } else if (stmt.specifiers[0].type === Syntax.ExportBatchSpecifier) {\n                    result = join(result, this.generateExpression(stmt.specifiers[0], Precedence.Sequence, E_TTT));\n                } else {\n                    result = join(result, '{');\n                    withIndent(function (indent) {\n                        var i, iz;\n                        result.push(newline);\n                        for (i = 0, iz = stmt.specifiers.length; i < iz; ++i) {\n                            result.push(indent);\n                            result.push(that.generateExpression(stmt.specifiers[i], Precedence.Sequence, E_TTT));\n                            if (i + 1 < iz) {\n                                result.push(',' + newline);\n                            }\n                        }\n                    });\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                        result.push(newline);\n                    }\n                    result.push(base + '}');\n                }\n\n                if (stmt.source) {\n                    result = join(result, [\n                        'from' + space,\n                        // ModuleSpecifier\n                        this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                        this.semicolon(flags)\n                    ]);\n                } else {\n                    result.push(this.semicolon(flags));\n                }\n            }\n            return result;\n        },\n\n        ExportAllDeclaration: function (stmt, flags) {\n            // export * FromClause ;\n            return [\n                'export' + space,\n                '*' + space,\n                'from' + space,\n                // ModuleSpecifier\n                this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                this.semicolon(flags)\n            ];\n        },\n\n        ExpressionStatement: function (stmt, flags) {\n            var result, fragment;\n\n            function isClassPrefixed(fragment) {\n                var code;\n                if (fragment.slice(0, 5) !== 'class') {\n                    return false;\n                }\n                code = fragment.charCodeAt(5);\n                return code === 0x7B  /* '{' */ || esutils.code.isWhiteSpace(code) || esutils.code.isLineTerminator(code);\n            }\n\n            function isFunctionPrefixed(fragment) {\n                var code;\n                if (fragment.slice(0, 8) !== 'function') {\n                    return false;\n                }\n                code = fragment.charCodeAt(8);\n                return code === 0x28 /* '(' */ || esutils.code.isWhiteSpace(code) || code === 0x2A  /* '*' */ || esutils.code.isLineTerminator(code);\n            }\n\n            function isAsyncPrefixed(fragment) {\n                var code, i, iz;\n                if (fragment.slice(0, 5) !== 'async') {\n                    return false;\n                }\n                if (!esutils.code.isWhiteSpace(fragment.charCodeAt(5))) {\n                    return false;\n                }\n                for (i = 6, iz = fragment.length; i < iz; ++i) {\n                    if (!esutils.code.isWhiteSpace(fragment.charCodeAt(i))) {\n                        break;\n                    }\n                }\n                if (i === iz) {\n                    return false;\n                }\n                if (fragment.slice(i, i + 8) !== 'function') {\n                    return false;\n                }\n                code = fragment.charCodeAt(i + 8);\n                return code === 0x28 /* '(' */ || esutils.code.isWhiteSpace(code) || code === 0x2A  /* '*' */ || esutils.code.isLineTerminator(code);\n            }\n\n            result = [this.generateExpression(stmt.expression, Precedence.Sequence, E_TTT)];\n            // 12.4 '{', 'function', 'class' is not allowed in this position.\n            // wrap expression with parentheses\n            fragment = toSourceNodeWhenNeeded(result).toString();\n            if (fragment.charCodeAt(0) === 0x7B  /* '{' */ ||  // ObjectExpression\n                    isClassPrefixed(fragment) ||\n                    isFunctionPrefixed(fragment) ||\n                    isAsyncPrefixed(fragment) ||\n                    (directive && (flags & F_DIRECTIVE_CTX) && stmt.expression.type === Syntax.Literal && typeof stmt.expression.value === 'string')) {\n                result = ['(', result, ')' + this.semicolon(flags)];\n            } else {\n                result.push(this.semicolon(flags));\n            }\n            return result;\n        },\n\n        ImportDeclaration: function (stmt, flags) {\n            // ES6: 15.2.1 valid import declarations:\n            //     - import ImportClause FromClause ;\n            //     - import ModuleSpecifier ;\n            var result, cursor, that = this;\n\n            // If no ImportClause is present,\n            // this should be `import ModuleSpecifier` so skip `from`\n            // ModuleSpecifier is StringLiteral.\n            if (stmt.specifiers.length === 0) {\n                // import ModuleSpecifier ;\n                return [\n                    'import',\n                    space,\n                    // ModuleSpecifier\n                    this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                    this.semicolon(flags)\n                ];\n            }\n\n            // import ImportClause FromClause ;\n            result = [\n                'import'\n            ];\n            cursor = 0;\n\n            // ImportedBinding\n            if (stmt.specifiers[cursor].type === Syntax.ImportDefaultSpecifier) {\n                result = join(result, [\n                        this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT)\n                ]);\n                ++cursor;\n            }\n\n            if (stmt.specifiers[cursor]) {\n                if (cursor !== 0) {\n                    result.push(',');\n                }\n\n                if (stmt.specifiers[cursor].type === Syntax.ImportNamespaceSpecifier) {\n                    // NameSpaceImport\n                    result = join(result, [\n                            space,\n                            this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT)\n                    ]);\n                } else {\n                    // NamedImports\n                    result.push(space + '{');\n\n                    if ((stmt.specifiers.length - cursor) === 1) {\n                        // import { ... } from \"...\";\n                        result.push(space);\n                        result.push(this.generateExpression(stmt.specifiers[cursor], Precedence.Sequence, E_TTT));\n                        result.push(space + '}' + space);\n                    } else {\n                        // import {\n                        //    ...,\n                        //    ...,\n                        // } from \"...\";\n                        withIndent(function (indent) {\n                            var i, iz;\n                            result.push(newline);\n                            for (i = cursor, iz = stmt.specifiers.length; i < iz; ++i) {\n                                result.push(indent);\n                                result.push(that.generateExpression(stmt.specifiers[i], Precedence.Sequence, E_TTT));\n                                if (i + 1 < iz) {\n                                    result.push(',' + newline);\n                                }\n                            }\n                        });\n                        if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                            result.push(newline);\n                        }\n                        result.push(base + '}' + space);\n                    }\n                }\n            }\n\n            result = join(result, [\n                'from' + space,\n                // ModuleSpecifier\n                this.generateExpression(stmt.source, Precedence.Sequence, E_TTT),\n                this.semicolon(flags)\n            ]);\n            return result;\n        },\n\n        VariableDeclarator: function (stmt, flags) {\n            var itemFlags = (flags & F_ALLOW_IN) ? E_TTT : E_FTT;\n            if (stmt.init) {\n                return [\n                    this.generateExpression(stmt.id, Precedence.Assignment, itemFlags),\n                    space,\n                    '=',\n                    space,\n                    this.generateExpression(stmt.init, Precedence.Assignment, itemFlags)\n                ];\n            }\n            return this.generatePattern(stmt.id, Precedence.Assignment, itemFlags);\n        },\n\n        VariableDeclaration: function (stmt, flags) {\n            // VariableDeclarator is typed as Statement,\n            // but joined with comma (not LineTerminator).\n            // So if comment is attached to target node, we should specialize.\n            var result, i, iz, node, bodyFlags, that = this;\n\n            result = [ stmt.kind ];\n\n            bodyFlags = (flags & F_ALLOW_IN) ? S_TFFF : S_FFFF;\n\n            function block() {\n                node = stmt.declarations[0];\n                if (extra.comment && node.leadingComments) {\n                    result.push('\\n');\n                    result.push(addIndent(that.generateStatement(node, bodyFlags)));\n                } else {\n                    result.push(noEmptySpace());\n                    result.push(that.generateStatement(node, bodyFlags));\n                }\n\n                for (i = 1, iz = stmt.declarations.length; i < iz; ++i) {\n                    node = stmt.declarations[i];\n                    if (extra.comment && node.leadingComments) {\n                        result.push(',' + newline);\n                        result.push(addIndent(that.generateStatement(node, bodyFlags)));\n                    } else {\n                        result.push(',' + space);\n                        result.push(that.generateStatement(node, bodyFlags));\n                    }\n                }\n            }\n\n            if (stmt.declarations.length > 1) {\n                withIndent(block);\n            } else {\n                block();\n            }\n\n            result.push(this.semicolon(flags));\n\n            return result;\n        },\n\n        ThrowStatement: function (stmt, flags) {\n            return [join(\n                'throw',\n                this.generateExpression(stmt.argument, Precedence.Sequence, E_TTT)\n            ), this.semicolon(flags)];\n        },\n\n        TryStatement: function (stmt, flags) {\n            var result, i, iz, guardedHandlers;\n\n            result = ['try', this.maybeBlock(stmt.block, S_TFFF)];\n            result = this.maybeBlockSuffix(stmt.block, result);\n\n            if (stmt.handlers) {\n                // old interface\n                for (i = 0, iz = stmt.handlers.length; i < iz; ++i) {\n                    result = join(result, this.generateStatement(stmt.handlers[i], S_TFFF));\n                    if (stmt.finalizer || i + 1 !== iz) {\n                        result = this.maybeBlockSuffix(stmt.handlers[i].body, result);\n                    }\n                }\n            } else {\n                guardedHandlers = stmt.guardedHandlers || [];\n\n                for (i = 0, iz = guardedHandlers.length; i < iz; ++i) {\n                    result = join(result, this.generateStatement(guardedHandlers[i], S_TFFF));\n                    if (stmt.finalizer || i + 1 !== iz) {\n                        result = this.maybeBlockSuffix(guardedHandlers[i].body, result);\n                    }\n                }\n\n                // new interface\n                if (stmt.handler) {\n                    if (Array.isArray(stmt.handler)) {\n                        for (i = 0, iz = stmt.handler.length; i < iz; ++i) {\n                            result = join(result, this.generateStatement(stmt.handler[i], S_TFFF));\n                            if (stmt.finalizer || i + 1 !== iz) {\n                                result = this.maybeBlockSuffix(stmt.handler[i].body, result);\n                            }\n                        }\n                    } else {\n                        result = join(result, this.generateStatement(stmt.handler, S_TFFF));\n                        if (stmt.finalizer) {\n                            result = this.maybeBlockSuffix(stmt.handler.body, result);\n                        }\n                    }\n                }\n            }\n            if (stmt.finalizer) {\n                result = join(result, ['finally', this.maybeBlock(stmt.finalizer, S_TFFF)]);\n            }\n            return result;\n        },\n\n        SwitchStatement: function (stmt, flags) {\n            var result, fragment, i, iz, bodyFlags, that = this;\n            withIndent(function () {\n                result = [\n                    'switch' + space + '(',\n                    that.generateExpression(stmt.discriminant, Precedence.Sequence, E_TTT),\n                    ')' + space + '{' + newline\n                ];\n            });\n            if (stmt.cases) {\n                bodyFlags = S_TFFF;\n                for (i = 0, iz = stmt.cases.length; i < iz; ++i) {\n                    if (i === iz - 1) {\n                        bodyFlags |= F_SEMICOLON_OPT;\n                    }\n                    fragment = addIndent(this.generateStatement(stmt.cases[i], bodyFlags));\n                    result.push(fragment);\n                    if (!endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                        result.push(newline);\n                    }\n                }\n            }\n            result.push(addIndent('}'));\n            return result;\n        },\n\n        SwitchCase: function (stmt, flags) {\n            var result, fragment, i, iz, bodyFlags, that = this;\n            withIndent(function () {\n                if (stmt.test) {\n                    result = [\n                        join('case', that.generateExpression(stmt.test, Precedence.Sequence, E_TTT)),\n                        ':'\n                    ];\n                } else {\n                    result = ['default:'];\n                }\n\n                i = 0;\n                iz = stmt.consequent.length;\n                if (iz && stmt.consequent[0].type === Syntax.BlockStatement) {\n                    fragment = that.maybeBlock(stmt.consequent[0], S_TFFF);\n                    result.push(fragment);\n                    i = 1;\n                }\n\n                if (i !== iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                    result.push(newline);\n                }\n\n                bodyFlags = S_TFFF;\n                for (; i < iz; ++i) {\n                    if (i === iz - 1 && flags & F_SEMICOLON_OPT) {\n                        bodyFlags |= F_SEMICOLON_OPT;\n                    }\n                    fragment = addIndent(that.generateStatement(stmt.consequent[i], bodyFlags));\n                    result.push(fragment);\n                    if (i + 1 !== iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                        result.push(newline);\n                    }\n                }\n            });\n            return result;\n        },\n\n        IfStatement: function (stmt, flags) {\n            var result, bodyFlags, semicolonOptional, that = this;\n            withIndent(function () {\n                result = [\n                    'if' + space + '(',\n                    that.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            semicolonOptional = flags & F_SEMICOLON_OPT;\n            bodyFlags = S_TFFF;\n            if (semicolonOptional) {\n                bodyFlags |= F_SEMICOLON_OPT;\n            }\n            if (stmt.alternate) {\n                result.push(this.maybeBlock(stmt.consequent, S_TFFF));\n                result = this.maybeBlockSuffix(stmt.consequent, result);\n                if (stmt.alternate.type === Syntax.IfStatement) {\n                    result = join(result, ['else ', this.generateStatement(stmt.alternate, bodyFlags)]);\n                } else {\n                    result = join(result, join('else', this.maybeBlock(stmt.alternate, bodyFlags)));\n                }\n            } else {\n                result.push(this.maybeBlock(stmt.consequent, bodyFlags));\n            }\n            return result;\n        },\n\n        ForStatement: function (stmt, flags) {\n            var result, that = this;\n            withIndent(function () {\n                result = ['for' + space + '('];\n                if (stmt.init) {\n                    if (stmt.init.type === Syntax.VariableDeclaration) {\n                        result.push(that.generateStatement(stmt.init, S_FFFF));\n                    } else {\n                        // F_ALLOW_IN becomes false.\n                        result.push(that.generateExpression(stmt.init, Precedence.Sequence, E_FTT));\n                        result.push(';');\n                    }\n                } else {\n                    result.push(';');\n                }\n\n                if (stmt.test) {\n                    result.push(space);\n                    result.push(that.generateExpression(stmt.test, Precedence.Sequence, E_TTT));\n                    result.push(';');\n                } else {\n                    result.push(';');\n                }\n\n                if (stmt.update) {\n                    result.push(space);\n                    result.push(that.generateExpression(stmt.update, Precedence.Sequence, E_TTT));\n                    result.push(')');\n                } else {\n                    result.push(')');\n                }\n            });\n\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        },\n\n        ForInStatement: function (stmt, flags) {\n            return this.generateIterationForStatement('in', stmt, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF);\n        },\n\n        ForOfStatement: function (stmt, flags) {\n            return this.generateIterationForStatement('of', stmt, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF);\n        },\n\n        LabeledStatement: function (stmt, flags) {\n            return [stmt.label.name + ':', this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF)];\n        },\n\n        Program: function (stmt, flags) {\n            var result, fragment, i, iz, bodyFlags;\n            iz = stmt.body.length;\n            result = [safeConcatenation && iz > 0 ? '\\n' : ''];\n            bodyFlags = S_TFTF;\n            for (i = 0; i < iz; ++i) {\n                if (!safeConcatenation && i === iz - 1) {\n                    bodyFlags |= F_SEMICOLON_OPT;\n                }\n\n                if (preserveBlankLines) {\n                    // handle spaces before the first line\n                    if (i === 0) {\n                        if (!stmt.body[0].leadingComments) {\n                            generateBlankLines(stmt.range[0], stmt.body[i].range[0], result);\n                        }\n                    }\n\n                    // handle spaces between lines\n                    if (i > 0) {\n                        if (!stmt.body[i - 1].trailingComments && !stmt.body[i].leadingComments) {\n                            generateBlankLines(stmt.body[i - 1].range[1], stmt.body[i].range[0], result);\n                        }\n                    }\n                }\n\n                fragment = addIndent(this.generateStatement(stmt.body[i], bodyFlags));\n                result.push(fragment);\n                if (i + 1 < iz && !endsWithLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                    if (preserveBlankLines) {\n                        if (!stmt.body[i + 1].leadingComments) {\n                            result.push(newline);\n                        }\n                    } else {\n                        result.push(newline);\n                    }\n                }\n\n                if (preserveBlankLines) {\n                    // handle spaces after the last line\n                    if (i === iz - 1) {\n                        if (!stmt.body[i].trailingComments) {\n                            generateBlankLines(stmt.body[i].range[1], stmt.range[1], result);\n                        }\n                    }\n                }\n            }\n            return result;\n        },\n\n        FunctionDeclaration: function (stmt, flags) {\n            return [\n                generateAsyncPrefix(stmt, true),\n                'function',\n                generateStarSuffix(stmt) || noEmptySpace(),\n                stmt.id ? generateIdentifier(stmt.id) : '',\n                this.generateFunctionBody(stmt)\n            ];\n        },\n\n        ReturnStatement: function (stmt, flags) {\n            if (stmt.argument) {\n                return [join(\n                    'return',\n                    this.generateExpression(stmt.argument, Precedence.Sequence, E_TTT)\n                ), this.semicolon(flags)];\n            }\n            return ['return' + this.semicolon(flags)];\n        },\n\n        WhileStatement: function (stmt, flags) {\n            var result, that = this;\n            withIndent(function () {\n                result = [\n                    'while' + space + '(',\n                    that.generateExpression(stmt.test, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        },\n\n        WithStatement: function (stmt, flags) {\n            var result, that = this;\n            withIndent(function () {\n                result = [\n                    'with' + space + '(',\n                    that.generateExpression(stmt.object, Precedence.Sequence, E_TTT),\n                    ')'\n                ];\n            });\n            result.push(this.maybeBlock(stmt.body, flags & F_SEMICOLON_OPT ? S_TFFT : S_TFFF));\n            return result;\n        }\n\n    };\n\n    merge(CodeGenerator.prototype, CodeGenerator.Statement);\n\n    // Expressions.\n\n    CodeGenerator.Expression = {\n\n        SequenceExpression: function (expr, precedence, flags) {\n            var result, i, iz;\n            if (Precedence.Sequence < precedence) {\n                flags |= F_ALLOW_IN;\n            }\n            result = [];\n            for (i = 0, iz = expr.expressions.length; i < iz; ++i) {\n                result.push(this.generateExpression(expr.expressions[i], Precedence.Assignment, flags));\n                if (i + 1 < iz) {\n                    result.push(',' + space);\n                }\n            }\n            return parenthesize(result, Precedence.Sequence, precedence);\n        },\n\n        AssignmentExpression: function (expr, precedence, flags) {\n            return this.generateAssignment(expr.left, expr.right, expr.operator, precedence, flags);\n        },\n\n        ArrowFunctionExpression: function (expr, precedence, flags) {\n            return parenthesize(this.generateFunctionBody(expr), Precedence.ArrowFunction, precedence);\n        },\n\n        ConditionalExpression: function (expr, precedence, flags) {\n            if (Precedence.Conditional < precedence) {\n                flags |= F_ALLOW_IN;\n            }\n            return parenthesize(\n                [\n                    this.generateExpression(expr.test, Precedence.Coalesce, flags),\n                    space + '?' + space,\n                    this.generateExpression(expr.consequent, Precedence.Assignment, flags),\n                    space + ':' + space,\n                    this.generateExpression(expr.alternate, Precedence.Assignment, flags)\n                ],\n                Precedence.Conditional,\n                precedence\n            );\n        },\n\n        LogicalExpression: function (expr, precedence, flags) {\n            if (expr.operator === '??') {\n                flags |= F_FOUND_COALESCE;\n            }\n            return this.BinaryExpression(expr, precedence, flags);\n        },\n\n        BinaryExpression: function (expr, precedence, flags) {\n            var result, leftPrecedence, rightPrecedence, currentPrecedence, fragment, leftSource;\n            currentPrecedence = BinaryPrecedence[expr.operator];\n            leftPrecedence = expr.operator === '**' ? Precedence.Postfix : currentPrecedence;\n            rightPrecedence = expr.operator === '**' ? currentPrecedence : currentPrecedence + 1;\n\n            if (currentPrecedence < precedence) {\n                flags |= F_ALLOW_IN;\n            }\n\n            fragment = this.generateExpression(expr.left, leftPrecedence, flags);\n\n            leftSource = fragment.toString();\n\n            if (leftSource.charCodeAt(leftSource.length - 1) === 0x2F /* / */ && esutils.code.isIdentifierPartES5(expr.operator.charCodeAt(0))) {\n                result = [fragment, noEmptySpace(), expr.operator];\n            } else {\n                result = join(fragment, expr.operator);\n            }\n\n            fragment = this.generateExpression(expr.right, rightPrecedence, flags);\n\n            if (expr.operator === '/' && fragment.toString().charAt(0) === '/' ||\n            expr.operator.slice(-1) === '<' && fragment.toString().slice(0, 3) === '!--') {\n                // If '/' concats with '/' or `<` concats with `!--`, it is interpreted as comment start\n                result.push(noEmptySpace());\n                result.push(fragment);\n            } else {\n                result = join(result, fragment);\n            }\n\n            if (expr.operator === 'in' && !(flags & F_ALLOW_IN)) {\n                return ['(', result, ')'];\n            }\n            if ((expr.operator === '||' || expr.operator === '&&') && (flags & F_FOUND_COALESCE)) {\n                return ['(', result, ')'];\n            }\n            return parenthesize(result, currentPrecedence, precedence);\n        },\n\n        CallExpression: function (expr, precedence, flags) {\n            var result, i, iz;\n\n            // F_ALLOW_UNPARATH_NEW becomes false.\n            result = [this.generateExpression(expr.callee, Precedence.Call, E_TTF)];\n\n            if (expr.optional) {\n                result.push('?.');\n            }\n\n            result.push('(');\n            for (i = 0, iz = expr['arguments'].length; i < iz; ++i) {\n                result.push(this.generateExpression(expr['arguments'][i], Precedence.Assignment, E_TTT));\n                if (i + 1 < iz) {\n                    result.push(',' + space);\n                }\n            }\n            result.push(')');\n\n            if (!(flags & F_ALLOW_CALL)) {\n                return ['(', result, ')'];\n            }\n\n            return parenthesize(result, Precedence.Call, precedence);\n        },\n\n        ChainExpression: function (expr, precedence, flags) {\n            if (Precedence.OptionalChaining < precedence) {\n                flags |= F_ALLOW_CALL;\n            }\n\n            var result = this.generateExpression(expr.expression, Precedence.OptionalChaining, flags);\n\n            return parenthesize(result, Precedence.OptionalChaining, precedence);\n        },\n\n        NewExpression: function (expr, precedence, flags) {\n            var result, length, i, iz, itemFlags;\n            length = expr['arguments'].length;\n\n            // F_ALLOW_CALL becomes false.\n            // F_ALLOW_UNPARATH_NEW may become false.\n            itemFlags = (flags & F_ALLOW_UNPARATH_NEW && !parentheses && length === 0) ? E_TFT : E_TFF;\n\n            result = join(\n                'new',\n                this.generateExpression(expr.callee, Precedence.New, itemFlags)\n            );\n\n            if (!(flags & F_ALLOW_UNPARATH_NEW) || parentheses || length > 0) {\n                result.push('(');\n                for (i = 0, iz = length; i < iz; ++i) {\n                    result.push(this.generateExpression(expr['arguments'][i], Precedence.Assignment, E_TTT));\n                    if (i + 1 < iz) {\n                        result.push(',' + space);\n                    }\n                }\n                result.push(')');\n            }\n\n            return parenthesize(result, Precedence.New, precedence);\n        },\n\n        MemberExpression: function (expr, precedence, flags) {\n            var result, fragment;\n\n            // F_ALLOW_UNPARATH_NEW becomes false.\n            result = [this.generateExpression(expr.object, Precedence.Call, (flags & F_ALLOW_CALL) ? E_TTF : E_TFF)];\n\n            if (expr.computed) {\n                if (expr.optional) {\n                    result.push('?.');\n                }\n\n                result.push('[');\n                result.push(this.generateExpression(expr.property, Precedence.Sequence, flags & F_ALLOW_CALL ? E_TTT : E_TFT));\n                result.push(']');\n            } else {\n                if (!expr.optional && expr.object.type === Syntax.Literal && typeof expr.object.value === 'number') {\n                    fragment = toSourceNodeWhenNeeded(result).toString();\n                    // When the following conditions are all true,\n                    //   1. No floating point\n                    //   2. Don't have exponents\n                    //   3. The last character is a decimal digit\n                    //   4. Not hexadecimal OR octal number literal\n                    // we should add a floating point.\n                    if (\n                            fragment.indexOf('.') < 0 &&\n                            !/[eExX]/.test(fragment) &&\n                            esutils.code.isDecimalDigit(fragment.charCodeAt(fragment.length - 1)) &&\n                            !(fragment.length >= 2 && fragment.charCodeAt(0) === 48)  // '0'\n                            ) {\n                        result.push(' ');\n                    }\n                }\n                result.push(expr.optional ? '?.' : '.');\n                result.push(generateIdentifier(expr.property));\n            }\n\n            return parenthesize(result, Precedence.Member, precedence);\n        },\n\n        MetaProperty: function (expr, precedence, flags) {\n            var result;\n            result = [];\n            result.push(typeof expr.meta === \"string\" ? expr.meta : generateIdentifier(expr.meta));\n            result.push('.');\n            result.push(typeof expr.property === \"string\" ? expr.property : generateIdentifier(expr.property));\n            return parenthesize(result, Precedence.Member, precedence);\n        },\n\n        UnaryExpression: function (expr, precedence, flags) {\n            var result, fragment, rightCharCode, leftSource, leftCharCode;\n            fragment = this.generateExpression(expr.argument, Precedence.Unary, E_TTT);\n\n            if (space === '') {\n                result = join(expr.operator, fragment);\n            } else {\n                result = [expr.operator];\n                if (expr.operator.length > 2) {\n                    // delete, void, typeof\n                    // get `typeof []`, not `typeof[]`\n                    result = join(result, fragment);\n                } else {\n                    // Prevent inserting spaces between operator and argument if it is unnecessary\n                    // like, `!cond`\n                    leftSource = toSourceNodeWhenNeeded(result).toString();\n                    leftCharCode = leftSource.charCodeAt(leftSource.length - 1);\n                    rightCharCode = fragment.toString().charCodeAt(0);\n\n                    if (((leftCharCode === 0x2B  /* + */ || leftCharCode === 0x2D  /* - */) && leftCharCode === rightCharCode) ||\n                            (esutils.code.isIdentifierPartES5(leftCharCode) && esutils.code.isIdentifierPartES5(rightCharCode))) {\n                        result.push(noEmptySpace());\n                        result.push(fragment);\n                    } else {\n                        result.push(fragment);\n                    }\n                }\n            }\n            return parenthesize(result, Precedence.Unary, precedence);\n        },\n\n        YieldExpression: function (expr, precedence, flags) {\n            var result;\n            if (expr.delegate) {\n                result = 'yield*';\n            } else {\n                result = 'yield';\n            }\n            if (expr.argument) {\n                result = join(\n                    result,\n                    this.generateExpression(expr.argument, Precedence.Yield, E_TTT)\n                );\n            }\n            return parenthesize(result, Precedence.Yield, precedence);\n        },\n\n        AwaitExpression: function (expr, precedence, flags) {\n            var result = join(\n                expr.all ? 'await*' : 'await',\n                this.generateExpression(expr.argument, Precedence.Await, E_TTT)\n            );\n            return parenthesize(result, Precedence.Await, precedence);\n        },\n\n        UpdateExpression: function (expr, precedence, flags) {\n            if (expr.prefix) {\n                return parenthesize(\n                    [\n                        expr.operator,\n                        this.generateExpression(expr.argument, Precedence.Unary, E_TTT)\n                    ],\n                    Precedence.Unary,\n                    precedence\n                );\n            }\n            return parenthesize(\n                [\n                    this.generateExpression(expr.argument, Precedence.Postfix, E_TTT),\n                    expr.operator\n                ],\n                Precedence.Postfix,\n                precedence\n            );\n        },\n\n        FunctionExpression: function (expr, precedence, flags) {\n            var result = [\n                generateAsyncPrefix(expr, true),\n                'function'\n            ];\n            if (expr.id) {\n                result.push(generateStarSuffix(expr) || noEmptySpace());\n                result.push(generateIdentifier(expr.id));\n            } else {\n                result.push(generateStarSuffix(expr) || space);\n            }\n            result.push(this.generateFunctionBody(expr));\n            return result;\n        },\n\n        ArrayPattern: function (expr, precedence, flags) {\n            return this.ArrayExpression(expr, precedence, flags, true);\n        },\n\n        ArrayExpression: function (expr, precedence, flags, isPattern) {\n            var result, multiline, that = this;\n            if (!expr.elements.length) {\n                return '[]';\n            }\n            multiline = isPattern ? false : expr.elements.length > 1;\n            result = ['[', multiline ? newline : ''];\n            withIndent(function (indent) {\n                var i, iz;\n                for (i = 0, iz = expr.elements.length; i < iz; ++i) {\n                    if (!expr.elements[i]) {\n                        if (multiline) {\n                            result.push(indent);\n                        }\n                        if (i + 1 === iz) {\n                            result.push(',');\n                        }\n                    } else {\n                        result.push(multiline ? indent : '');\n                        result.push(that.generateExpression(expr.elements[i], Precedence.Assignment, E_TTT));\n                    }\n                    if (i + 1 < iz) {\n                        result.push(',' + (multiline ? newline : space));\n                    }\n                }\n            });\n            if (multiline && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                result.push(newline);\n            }\n            result.push(multiline ? base : '');\n            result.push(']');\n            return result;\n        },\n\n        RestElement: function(expr, precedence, flags) {\n            return '...' + this.generatePattern(expr.argument);\n        },\n\n        ClassExpression: function (expr, precedence, flags) {\n            var result, fragment;\n            result = ['class'];\n            if (expr.id) {\n                result = join(result, this.generateExpression(expr.id, Precedence.Sequence, E_TTT));\n            }\n            if (expr.superClass) {\n                fragment = join('extends', this.generateExpression(expr.superClass, Precedence.Unary, E_TTT));\n                result = join(result, fragment);\n            }\n            result.push(space);\n            result.push(this.generateStatement(expr.body, S_TFFT));\n            return result;\n        },\n\n        MethodDefinition: function (expr, precedence, flags) {\n            var result, fragment;\n            if (expr['static']) {\n                result = ['static' + space];\n            } else {\n                result = [];\n            }\n            if (expr.kind === 'get' || expr.kind === 'set') {\n                fragment = [\n                    join(expr.kind, this.generatePropertyKey(expr.key, expr.computed)),\n                    this.generateFunctionBody(expr.value)\n                ];\n            } else {\n                fragment = [\n                    generateMethodPrefix(expr),\n                    this.generatePropertyKey(expr.key, expr.computed),\n                    this.generateFunctionBody(expr.value)\n                ];\n            }\n            return join(result, fragment);\n        },\n\n        Property: function (expr, precedence, flags) {\n            if (expr.kind === 'get' || expr.kind === 'set') {\n                return [\n                    expr.kind, noEmptySpace(),\n                    this.generatePropertyKey(expr.key, expr.computed),\n                    this.generateFunctionBody(expr.value)\n                ];\n            }\n\n            if (expr.shorthand) {\n                if (expr.value.type === \"AssignmentPattern\") {\n                    return this.AssignmentPattern(expr.value, Precedence.Sequence, E_TTT);\n                }\n                return this.generatePropertyKey(expr.key, expr.computed);\n            }\n\n            if (expr.method) {\n                return [\n                    generateMethodPrefix(expr),\n                    this.generatePropertyKey(expr.key, expr.computed),\n                    this.generateFunctionBody(expr.value)\n                ];\n            }\n\n            return [\n                this.generatePropertyKey(expr.key, expr.computed),\n                ':' + space,\n                this.generateExpression(expr.value, Precedence.Assignment, E_TTT)\n            ];\n        },\n\n        ObjectExpression: function (expr, precedence, flags) {\n            var multiline, result, fragment, that = this;\n\n            if (!expr.properties.length) {\n                return '{}';\n            }\n            multiline = expr.properties.length > 1;\n\n            withIndent(function () {\n                fragment = that.generateExpression(expr.properties[0], Precedence.Sequence, E_TTT);\n            });\n\n            if (!multiline) {\n                // issues 4\n                // Do not transform from\n                //   dejavu.Class.declare({\n                //       method2: function () {}\n                //   });\n                // to\n                //   dejavu.Class.declare({method2: function () {\n                //       }});\n                if (!hasLineTerminator(toSourceNodeWhenNeeded(fragment).toString())) {\n                    return [ '{', space, fragment, space, '}' ];\n                }\n            }\n\n            withIndent(function (indent) {\n                var i, iz;\n                result = [ '{', newline, indent, fragment ];\n\n                if (multiline) {\n                    result.push(',' + newline);\n                    for (i = 1, iz = expr.properties.length; i < iz; ++i) {\n                        result.push(indent);\n                        result.push(that.generateExpression(expr.properties[i], Precedence.Sequence, E_TTT));\n                        if (i + 1 < iz) {\n                            result.push(',' + newline);\n                        }\n                    }\n                }\n            });\n\n            if (!endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                result.push(newline);\n            }\n            result.push(base);\n            result.push('}');\n            return result;\n        },\n\n        AssignmentPattern: function(expr, precedence, flags) {\n            return this.generateAssignment(expr.left, expr.right, '=', precedence, flags);\n        },\n\n        ObjectPattern: function (expr, precedence, flags) {\n            var result, i, iz, multiline, property, that = this;\n            if (!expr.properties.length) {\n                return '{}';\n            }\n\n            multiline = false;\n            if (expr.properties.length === 1) {\n                property = expr.properties[0];\n                if (\n                    property.type === Syntax.Property\n                    && property.value.type !== Syntax.Identifier\n                ) {\n                    multiline = true;\n                }\n            } else {\n                for (i = 0, iz = expr.properties.length; i < iz; ++i) {\n                    property = expr.properties[i];\n                    if (\n                        property.type === Syntax.Property\n                        && !property.shorthand\n                    ) {\n                        multiline = true;\n                        break;\n                    }\n                }\n            }\n            result = ['{', multiline ? newline : '' ];\n\n            withIndent(function (indent) {\n                var i, iz;\n                for (i = 0, iz = expr.properties.length; i < iz; ++i) {\n                    result.push(multiline ? indent : '');\n                    result.push(that.generateExpression(expr.properties[i], Precedence.Sequence, E_TTT));\n                    if (i + 1 < iz) {\n                        result.push(',' + (multiline ? newline : space));\n                    }\n                }\n            });\n\n            if (multiline && !endsWithLineTerminator(toSourceNodeWhenNeeded(result).toString())) {\n                result.push(newline);\n            }\n            result.push(multiline ? base : '');\n            result.push('}');\n            return result;\n        },\n\n        ThisExpression: function (expr, precedence, flags) {\n            return 'this';\n        },\n\n        Super: function (expr, precedence, flags) {\n            return 'super';\n        },\n\n        Identifier: function (expr, precedence, flags) {\n            return generateIdentifier(expr);\n        },\n\n        ImportDefaultSpecifier: function (expr, precedence, flags) {\n            return generateIdentifier(expr.id || expr.local);\n        },\n\n        ImportNamespaceSpecifier: function (expr, precedence, flags) {\n            var result = ['*'];\n            var id = expr.id || expr.local;\n            if (id) {\n                result.push(space + 'as' + noEmptySpace() + generateIdentifier(id));\n            }\n            return result;\n        },\n\n        ImportSpecifier: function (expr, precedence, flags) {\n            var imported = expr.imported;\n            var result = [ imported.name ];\n            var local = expr.local;\n            if (local && local.name !== imported.name) {\n                result.push(noEmptySpace() + 'as' + noEmptySpace() + generateIdentifier(local));\n            }\n            return result;\n        },\n\n        ExportSpecifier: function (expr, precedence, flags) {\n            var local = expr.local;\n            var result = [ local.name ];\n            var exported = expr.exported;\n            if (exported && exported.name !== local.name) {\n                result.push(noEmptySpace() + 'as' + noEmptySpace() + generateIdentifier(exported));\n            }\n            return result;\n        },\n\n        Literal: function (expr, precedence, flags) {\n            var raw;\n            if (expr.hasOwnProperty('raw') && parse && extra.raw) {\n                try {\n                    raw = parse(expr.raw).body[0].expression;\n                    if (raw.type === Syntax.Literal) {\n                        if (raw.value === expr.value) {\n                            return expr.raw;\n                        }\n                    }\n                } catch (e) {\n                    // not use raw property\n                }\n            }\n\n            if (expr.regex) {\n              return '/' + expr.regex.pattern + '/' + expr.regex.flags;\n            }\n\n            if (typeof expr.value === 'bigint') {\n                return expr.value.toString() + 'n';\n            }\n\n            // `expr.value` can be null if `expr.bigint` exists. We need to check\n            // `expr.bigint` first.\n            if (expr.bigint) {\n                return expr.bigint + 'n';\n            }\n\n            if (expr.value === null) {\n                return 'null';\n            }\n\n            if (typeof expr.value === 'string') {\n                return escapeString(expr.value);\n            }\n\n            if (typeof expr.value === 'number') {\n                return generateNumber(expr.value);\n            }\n\n            if (typeof expr.value === 'boolean') {\n                return expr.value ? 'true' : 'false';\n            }\n\n            return generateRegExp(expr.value);\n        },\n\n        GeneratorExpression: function (expr, precedence, flags) {\n            return this.ComprehensionExpression(expr, precedence, flags);\n        },\n\n        ComprehensionExpression: function (expr, precedence, flags) {\n            // GeneratorExpression should be parenthesized with (...), ComprehensionExpression with [...]\n            // Due to https://bugzilla.mozilla.org/show_bug.cgi?id=883468 position of expr.body can differ in Spidermonkey and ES6\n\n            var result, i, iz, fragment, that = this;\n            result = (expr.type === Syntax.GeneratorExpression) ? ['('] : ['['];\n\n            if (extra.moz.comprehensionExpressionStartsWithAssignment) {\n                fragment = this.generateExpression(expr.body, Precedence.Assignment, E_TTT);\n                result.push(fragment);\n            }\n\n            if (expr.blocks) {\n                withIndent(function () {\n                    for (i = 0, iz = expr.blocks.length; i < iz; ++i) {\n                        fragment = that.generateExpression(expr.blocks[i], Precedence.Sequence, E_TTT);\n                        if (i > 0 || extra.moz.comprehensionExpressionStartsWithAssignment) {\n                            result = join(result, fragment);\n                        } else {\n                            result.push(fragment);\n                        }\n                    }\n                });\n            }\n\n            if (expr.filter) {\n                result = join(result, 'if' + space);\n                fragment = this.generateExpression(expr.filter, Precedence.Sequence, E_TTT);\n                result = join(result, [ '(', fragment, ')' ]);\n            }\n\n            if (!extra.moz.comprehensionExpressionStartsWithAssignment) {\n                fragment = this.generateExpression(expr.body, Precedence.Assignment, E_TTT);\n\n                result = join(result, fragment);\n            }\n\n            result.push((expr.type === Syntax.GeneratorExpression) ? ')' : ']');\n            return result;\n        },\n\n        ComprehensionBlock: function (expr, precedence, flags) {\n            var fragment;\n            if (expr.left.type === Syntax.VariableDeclaration) {\n                fragment = [\n                    expr.left.kind, noEmptySpace(),\n                    this.generateStatement(expr.left.declarations[0], S_FFFF)\n                ];\n            } else {\n                fragment = this.generateExpression(expr.left, Precedence.Call, E_TTT);\n            }\n\n            fragment = join(fragment, expr.of ? 'of' : 'in');\n            fragment = join(fragment, this.generateExpression(expr.right, Precedence.Sequence, E_TTT));\n\n            return [ 'for' + space + '(', fragment, ')' ];\n        },\n\n        SpreadElement: function (expr, precedence, flags) {\n            return [\n                '...',\n                this.generateExpression(expr.argument, Precedence.Assignment, E_TTT)\n            ];\n        },\n\n        TaggedTemplateExpression: function (expr, precedence, flags) {\n            var itemFlags = E_TTF;\n            if (!(flags & F_ALLOW_CALL)) {\n                itemFlags = E_TFF;\n            }\n            var result = [\n                this.generateExpression(expr.tag, Precedence.Call, itemFlags),\n                this.generateExpression(expr.quasi, Precedence.Primary, E_FFT)\n            ];\n            return parenthesize(result, Precedence.TaggedTemplate, precedence);\n        },\n\n        TemplateElement: function (expr, precedence, flags) {\n            // Don't use \"cooked\". Since tagged template can use raw template\n            // representation. So if we do so, it breaks the script semantics.\n            return expr.value.raw;\n        },\n\n        TemplateLiteral: function (expr, precedence, flags) {\n            var result, i, iz;\n            result = [ '`' ];\n            for (i = 0, iz = expr.quasis.length; i < iz; ++i) {\n                result.push(this.generateExpression(expr.quasis[i], Precedence.Primary, E_TTT));\n                if (i + 1 < iz) {\n                    result.push('${' + space);\n                    result.push(this.generateExpression(expr.expressions[i], Precedence.Sequence, E_TTT));\n                    result.push(space + '}');\n                }\n            }\n            result.push('`');\n            return result;\n        },\n\n        ModuleSpecifier: function (expr, precedence, flags) {\n            return this.Literal(expr, precedence, flags);\n        },\n\n        ImportExpression: function(expr, precedence, flag) {\n            return parenthesize([\n                'import(',\n                this.generateExpression(expr.source, Precedence.Assignment, E_TTT),\n                ')'\n            ], Precedence.Call, precedence);\n        }\n    };\n\n    merge(CodeGenerator.prototype, CodeGenerator.Expression);\n\n    CodeGenerator.prototype.generateExpression = function (expr, precedence, flags) {\n        var result, type;\n\n        type = expr.type || Syntax.Property;\n\n        if (extra.verbatim && expr.hasOwnProperty(extra.verbatim)) {\n            return generateVerbatim(expr, precedence);\n        }\n\n        result = this[type](expr, precedence, flags);\n\n\n        if (extra.comment) {\n            result = addComments(expr, result);\n        }\n        return toSourceNodeWhenNeeded(result, expr);\n    };\n\n    CodeGenerator.prototype.generateStatement = function (stmt, flags) {\n        var result,\n            fragment;\n\n        result = this[stmt.type](stmt, flags);\n\n        // Attach comments\n\n        if (extra.comment) {\n            result = addComments(stmt, result);\n        }\n\n        fragment = toSourceNodeWhenNeeded(result).toString();\n        if (stmt.type === Syntax.Program && !safeConcatenation && newline === '' &&  fragment.charAt(fragment.length - 1) === '\\n') {\n            result = sourceMap ? toSourceNodeWhenNeeded(result).replaceRight(/\\s+$/, '') : fragment.replace(/\\s+$/, '');\n        }\n\n        return toSourceNodeWhenNeeded(result, stmt);\n    };\n\n    function generateInternal(node) {\n        var codegen;\n\n        codegen = new CodeGenerator();\n        if (isStatement(node)) {\n            return codegen.generateStatement(node, S_TFFF);\n        }\n\n        if (isExpression(node)) {\n            return codegen.generateExpression(node, Precedence.Sequence, E_TTT);\n        }\n\n        throw new Error('Unknown node type: ' + node.type);\n    }\n\n    function generate(node, options) {\n        var defaultOptions = getDefaultOptions(), result, pair;\n\n        if (options != null) {\n            // Obsolete options\n            //\n            //   `options.indent`\n            //   `options.base`\n            //\n            // Instead of them, we can use `option.format.indent`.\n            if (typeof options.indent === 'string') {\n                defaultOptions.format.indent.style = options.indent;\n            }\n            if (typeof options.base === 'number') {\n                defaultOptions.format.indent.base = options.base;\n            }\n            options = updateDeeply(defaultOptions, options);\n            indent = options.format.indent.style;\n            if (typeof options.base === 'string') {\n                base = options.base;\n            } else {\n                base = stringRepeat(indent, options.format.indent.base);\n            }\n        } else {\n            options = defaultOptions;\n            indent = options.format.indent.style;\n            base = stringRepeat(indent, options.format.indent.base);\n        }\n        json = options.format.json;\n        renumber = options.format.renumber;\n        hexadecimal = json ? false : options.format.hexadecimal;\n        quotes = json ? 'double' : options.format.quotes;\n        escapeless = options.format.escapeless;\n        newline = options.format.newline;\n        space = options.format.space;\n        if (options.format.compact) {\n            newline = space = indent = base = '';\n        }\n        parentheses = options.format.parentheses;\n        semicolons = options.format.semicolons;\n        safeConcatenation = options.format.safeConcatenation;\n        directive = options.directive;\n        parse = json ? null : options.parse;\n        sourceMap = options.sourceMap;\n        sourceCode = options.sourceCode;\n        preserveBlankLines = options.format.preserveBlankLines && sourceCode !== null;\n        extra = options;\n\n        if (sourceMap) {\n            if (!exports.browser) {\n                // We assume environment is node.js\n                // And prevent from including source-map by browserify\n                SourceNode = require('source-map').SourceNode;\n            } else {\n                SourceNode = global.sourceMap.SourceNode;\n            }\n        }\n\n        result = generateInternal(node);\n\n        if (!sourceMap) {\n            pair = {code: result.toString(), map: null};\n            return options.sourceMapWithCode ? pair : pair.code;\n        }\n\n\n        pair = result.toStringWithSourceMap({\n            file: options.file,\n            sourceRoot: options.sourceMapRoot\n        });\n\n        if (options.sourceContent) {\n            pair.map.setSourceContent(options.sourceMap,\n                                      options.sourceContent);\n        }\n\n        if (options.sourceMapWithCode) {\n            return pair;\n        }\n\n        return pair.map.toString();\n    }\n\n    FORMAT_MINIFY = {\n        indent: {\n            style: '',\n            base: 0\n        },\n        renumber: true,\n        hexadecimal: true,\n        quotes: 'auto',\n        escapeless: true,\n        compact: true,\n        parentheses: false,\n        semicolons: false\n    };\n\n    FORMAT_DEFAULTS = getDefaultOptions().format;\n\n    exports.version = require('./package.json').version;\n    exports.generate = generate;\n    exports.attachComments = estraverse.attachComments;\n    exports.Precedence = updateDeeply({}, Precedence);\n    exports.browser = false;\n    exports.FORMAT_MINIFY = FORMAT_MINIFY;\n    exports.FORMAT_DEFAULTS = FORMAT_DEFAULTS;\n}());\n/* vim: set sw=4 ts=4 et tw=80 : */\n","/*\n  Copyright (C) 2012-2013 Yusuke Suzuki <utatane.tea@gmail.com>\n  Copyright (C) 2012 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and/or other materials provided with the distribution.\n\n  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n/*jslint vars:false, bitwise:true*/\n/*jshint indent:4*/\n/*global exports:true*/\n(function clone(exports) {\n    'use strict';\n\n    var Syntax,\n        VisitorOption,\n        VisitorKeys,\n        BREAK,\n        SKIP,\n        REMOVE;\n\n    function deepCopy(obj) {\n        var ret = {}, key, val;\n        for (key in obj) {\n            if (obj.hasOwnProperty(key)) {\n                val = obj[key];\n                if (typeof val === 'object' && val !== null) {\n                    ret[key] = deepCopy(val);\n                } else {\n                    ret[key] = val;\n                }\n            }\n        }\n        return ret;\n    }\n\n    // based on LLVM libc++ upper_bound / lower_bound\n    // MIT License\n\n    function upperBound(array, func) {\n        var diff, len, i, current;\n\n        len = array.length;\n        i = 0;\n\n        while (len) {\n            diff = len >>> 1;\n            current = i + diff;\n            if (func(array[current])) {\n                len = diff;\n            } else {\n                i = current + 1;\n                len -= diff + 1;\n            }\n        }\n        return i;\n    }\n\n    Syntax = {\n        AssignmentExpression: 'AssignmentExpression',\n        AssignmentPattern: 'AssignmentPattern',\n        ArrayExpression: 'ArrayExpression',\n        ArrayPattern: 'ArrayPattern',\n        ArrowFunctionExpression: 'ArrowFunctionExpression',\n        AwaitExpression: 'AwaitExpression', // CAUTION: It's deferred to ES7.\n        BlockStatement: 'BlockStatement',\n        BinaryExpression: 'BinaryExpression',\n        BreakStatement: 'BreakStatement',\n        CallExpression: 'CallExpression',\n        CatchClause: 'CatchClause',\n        ChainExpression: 'ChainExpression',\n        ClassBody: 'ClassBody',\n        ClassDeclaration: 'ClassDeclaration',\n        ClassExpression: 'ClassExpression',\n        ComprehensionBlock: 'ComprehensionBlock',  // CAUTION: It's deferred to ES7.\n        ComprehensionExpression: 'ComprehensionExpression',  // CAUTION: It's deferred to ES7.\n        ConditionalExpression: 'ConditionalExpression',\n        ContinueStatement: 'ContinueStatement',\n        DebuggerStatement: 'DebuggerStatement',\n        DirectiveStatement: 'DirectiveStatement',\n        DoWhileStatement: 'DoWhileStatement',\n        EmptyStatement: 'EmptyStatement',\n        ExportAllDeclaration: 'ExportAllDeclaration',\n        ExportDefaultDeclaration: 'ExportDefaultDeclaration',\n        ExportNamedDeclaration: 'ExportNamedDeclaration',\n        ExportSpecifier: 'ExportSpecifier',\n        ExpressionStatement: 'ExpressionStatement',\n        ForStatement: 'ForStatement',\n        ForInStatement: 'ForInStatement',\n        ForOfStatement: 'ForOfStatement',\n        FunctionDeclaration: 'FunctionDeclaration',\n        FunctionExpression: 'FunctionExpression',\n        GeneratorExpression: 'GeneratorExpression',  // CAUTION: It's deferred to ES7.\n        Identifier: 'Identifier',\n        IfStatement: 'IfStatement',\n        ImportExpression: 'ImportExpression',\n        ImportDeclaration: 'ImportDeclaration',\n        ImportDefaultSpecifier: 'ImportDefaultSpecifier',\n        ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',\n        ImportSpecifier: 'ImportSpecifier',\n        Literal: 'Literal',\n        LabeledStatement: 'LabeledStatement',\n        LogicalExpression: 'LogicalExpression',\n        MemberExpression: 'MemberExpression',\n        MetaProperty: 'MetaProperty',\n        MethodDefinition: 'MethodDefinition',\n        ModuleSpecifier: 'ModuleSpecifier',\n        NewExpression: 'NewExpression',\n        ObjectExpression: 'ObjectExpression',\n        ObjectPattern: 'ObjectPattern',\n        PrivateIdentifier: 'PrivateIdentifier',\n        Program: 'Program',\n        Property: 'Property',\n        PropertyDefinition: 'PropertyDefinition',\n        RestElement: 'RestElement',\n        ReturnStatement: 'ReturnStatement',\n        SequenceExpression: 'SequenceExpression',\n        SpreadElement: 'SpreadElement',\n        Super: 'Super',\n        SwitchStatement: 'SwitchStatement',\n        SwitchCase: 'SwitchCase',\n        TaggedTemplateExpression: 'TaggedTemplateExpression',\n        TemplateElement: 'TemplateElement',\n        TemplateLiteral: 'TemplateLiteral',\n        ThisExpression: 'ThisExpression',\n        ThrowStatement: 'ThrowStatement',\n        TryStatement: 'TryStatement',\n        UnaryExpression: 'UnaryExpression',\n        UpdateExpression: 'UpdateExpression',\n        VariableDeclaration: 'VariableDeclaration',\n        VariableDeclarator: 'VariableDeclarator',\n        WhileStatement: 'WhileStatement',\n        WithStatement: 'WithStatement',\n        YieldExpression: 'YieldExpression'\n    };\n\n    VisitorKeys = {\n        AssignmentExpression: ['left', 'right'],\n        AssignmentPattern: ['left', 'right'],\n        ArrayExpression: ['elements'],\n        ArrayPattern: ['elements'],\n        ArrowFunctionExpression: ['params', 'body'],\n        AwaitExpression: ['argument'], // CAUTION: It's deferred to ES7.\n        BlockStatement: ['body'],\n        BinaryExpression: ['left', 'right'],\n        BreakStatement: ['label'],\n        CallExpression: ['callee', 'arguments'],\n        CatchClause: ['param', 'body'],\n        ChainExpression: ['expression'],\n        ClassBody: ['body'],\n        ClassDeclaration: ['id', 'superClass', 'body'],\n        ClassExpression: ['id', 'superClass', 'body'],\n        ComprehensionBlock: ['left', 'right'],  // CAUTION: It's deferred to ES7.\n        ComprehensionExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.\n        ConditionalExpression: ['test', 'consequent', 'alternate'],\n        ContinueStatement: ['label'],\n        DebuggerStatement: [],\n        DirectiveStatement: [],\n        DoWhileStatement: ['body', 'test'],\n        EmptyStatement: [],\n        ExportAllDeclaration: ['source'],\n        ExportDefaultDeclaration: ['declaration'],\n        ExportNamedDeclaration: ['declaration', 'specifiers', 'source'],\n        ExportSpecifier: ['exported', 'local'],\n        ExpressionStatement: ['expression'],\n        ForStatement: ['init', 'test', 'update', 'body'],\n        ForInStatement: ['left', 'right', 'body'],\n        ForOfStatement: ['left', 'right', 'body'],\n        FunctionDeclaration: ['id', 'params', 'body'],\n        FunctionExpression: ['id', 'params', 'body'],\n        GeneratorExpression: ['blocks', 'filter', 'body'],  // CAUTION: It's deferred to ES7.\n        Identifier: [],\n        IfStatement: ['test', 'consequent', 'alternate'],\n        ImportExpression: ['source'],\n        ImportDeclaration: ['specifiers', 'source'],\n        ImportDefaultSpecifier: ['local'],\n        ImportNamespaceSpecifier: ['local'],\n        ImportSpecifier: ['imported', 'local'],\n        Literal: [],\n        LabeledStatement: ['label', 'body'],\n        LogicalExpression: ['left', 'right'],\n        MemberExpression: ['object', 'property'],\n        MetaProperty: ['meta', 'property'],\n        MethodDefinition: ['key', 'value'],\n        ModuleSpecifier: [],\n        NewExpression: ['callee', 'arguments'],\n        ObjectExpression: ['properties'],\n        ObjectPattern: ['properties'],\n        PrivateIdentifier: [],\n        Program: ['body'],\n        Property: ['key', 'value'],\n        PropertyDefinition: ['key', 'value'],\n        RestElement: [ 'argument' ],\n        ReturnStatement: ['argument'],\n        SequenceExpression: ['expressions'],\n        SpreadElement: ['argument'],\n        Super: [],\n        SwitchStatement: ['discriminant', 'cases'],\n        SwitchCase: ['test', 'consequent'],\n        TaggedTemplateExpression: ['tag', 'quasi'],\n        TemplateElement: [],\n        TemplateLiteral: ['quasis', 'expressions'],\n        ThisExpression: [],\n        ThrowStatement: ['argument'],\n        TryStatement: ['block', 'handler', 'finalizer'],\n        UnaryExpression: ['argument'],\n        UpdateExpression: ['argument'],\n        VariableDeclaration: ['declarations'],\n        VariableDeclarator: ['id', 'init'],\n        WhileStatement: ['test', 'body'],\n        WithStatement: ['object', 'body'],\n        YieldExpression: ['argument']\n    };\n\n    // unique id\n    BREAK = {};\n    SKIP = {};\n    REMOVE = {};\n\n    VisitorOption = {\n        Break: BREAK,\n        Skip: SKIP,\n        Remove: REMOVE\n    };\n\n    function Reference(parent, key) {\n        this.parent = parent;\n        this.key = key;\n    }\n\n    Reference.prototype.replace = function replace(node) {\n        this.parent[this.key] = node;\n    };\n\n    Reference.prototype.remove = function remove() {\n        if (Array.isArray(this.parent)) {\n            this.parent.splice(this.key, 1);\n            return true;\n        } else {\n            this.replace(null);\n            return false;\n        }\n    };\n\n    function Element(node, path, wrap, ref) {\n        this.node = node;\n        this.path = path;\n        this.wrap = wrap;\n        this.ref = ref;\n    }\n\n    function Controller() { }\n\n    // API:\n    // return property path array from root to current node\n    Controller.prototype.path = function path() {\n        var i, iz, j, jz, result, element;\n\n        function addToPath(result, path) {\n            if (Array.isArray(path)) {\n                for (j = 0, jz = path.length; j < jz; ++j) {\n                    result.push(path[j]);\n                }\n            } else {\n                result.push(path);\n            }\n        }\n\n        // root node\n        if (!this.__current.path) {\n            return null;\n        }\n\n        // first node is sentinel, second node is root element\n        result = [];\n        for (i = 2, iz = this.__leavelist.length; i < iz; ++i) {\n            element = this.__leavelist[i];\n            addToPath(result, element.path);\n        }\n        addToPath(result, this.__current.path);\n        return result;\n    };\n\n    // API:\n    // return type of current node\n    Controller.prototype.type = function () {\n        var node = this.current();\n        return node.type || this.__current.wrap;\n    };\n\n    // API:\n    // return array of parent elements\n    Controller.prototype.parents = function parents() {\n        var i, iz, result;\n\n        // first node is sentinel\n        result = [];\n        for (i = 1, iz = this.__leavelist.length; i < iz; ++i) {\n            result.push(this.__leavelist[i].node);\n        }\n\n        return result;\n    };\n\n    // API:\n    // return current node\n    Controller.prototype.current = function current() {\n        return this.__current.node;\n    };\n\n    Controller.prototype.__execute = function __execute(callback, element) {\n        var previous, result;\n\n        result = undefined;\n\n        previous  = this.__current;\n        this.__current = element;\n        this.__state = null;\n        if (callback) {\n            result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node);\n        }\n        this.__current = previous;\n\n        return result;\n    };\n\n    // API:\n    // notify control skip / break\n    Controller.prototype.notify = function notify(flag) {\n        this.__state = flag;\n    };\n\n    // API:\n    // skip child nodes of current node\n    Controller.prototype.skip = function () {\n        this.notify(SKIP);\n    };\n\n    // API:\n    // break traversals\n    Controller.prototype['break'] = function () {\n        this.notify(BREAK);\n    };\n\n    // API:\n    // remove node\n    Controller.prototype.remove = function () {\n        this.notify(REMOVE);\n    };\n\n    Controller.prototype.__initialize = function(root, visitor) {\n        this.visitor = visitor;\n        this.root = root;\n        this.__worklist = [];\n        this.__leavelist = [];\n        this.__current = null;\n        this.__state = null;\n        this.__fallback = null;\n        if (visitor.fallback === 'iteration') {\n            this.__fallback = Object.keys;\n        } else if (typeof visitor.fallback === 'function') {\n            this.__fallback = visitor.fallback;\n        }\n\n        this.__keys = VisitorKeys;\n        if (visitor.keys) {\n            this.__keys = Object.assign(Object.create(this.__keys), visitor.keys);\n        }\n    };\n\n    function isNode(node) {\n        if (node == null) {\n            return false;\n        }\n        return typeof node === 'object' && typeof node.type === 'string';\n    }\n\n    function isProperty(nodeType, key) {\n        return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key;\n    }\n  \n    function candidateExistsInLeaveList(leavelist, candidate) {\n        for (var i = leavelist.length - 1; i >= 0; --i) {\n            if (leavelist[i].node === candidate) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    Controller.prototype.traverse = function traverse(root, visitor) {\n        var worklist,\n            leavelist,\n            element,\n            node,\n            nodeType,\n            ret,\n            key,\n            current,\n            current2,\n            candidates,\n            candidate,\n            sentinel;\n\n        this.__initialize(root, visitor);\n\n        sentinel = {};\n\n        // reference\n        worklist = this.__worklist;\n        leavelist = this.__leavelist;\n\n        // initialize\n        worklist.push(new Element(root, null, null, null));\n        leavelist.push(new Element(null, null, null, null));\n\n        while (worklist.length) {\n            element = worklist.pop();\n\n            if (element === sentinel) {\n                element = leavelist.pop();\n\n                ret = this.__execute(visitor.leave, element);\n\n                if (this.__state === BREAK || ret === BREAK) {\n                    return;\n                }\n                continue;\n            }\n\n            if (element.node) {\n\n                ret = this.__execute(visitor.enter, element);\n\n                if (this.__state === BREAK || ret === BREAK) {\n                    return;\n                }\n\n                worklist.push(sentinel);\n                leavelist.push(element);\n\n                if (this.__state === SKIP || ret === SKIP) {\n                    continue;\n                }\n\n                node = element.node;\n                nodeType = node.type || element.wrap;\n                candidates = this.__keys[nodeType];\n                if (!candidates) {\n                    if (this.__fallback) {\n                        candidates = this.__fallback(node);\n                    } else {\n                        throw new Error('Unknown node type ' + nodeType + '.');\n                    }\n                }\n\n                current = candidates.length;\n                while ((current -= 1) >= 0) {\n                    key = candidates[current];\n                    candidate = node[key];\n                    if (!candidate) {\n                        continue;\n                    }\n\n                    if (Array.isArray(candidate)) {\n                        current2 = candidate.length;\n                        while ((current2 -= 1) >= 0) {\n                            if (!candidate[current2]) {\n                                continue;\n                            }\n\n                            if (candidateExistsInLeaveList(leavelist, candidate[current2])) {\n                              continue;\n                            }\n\n                            if (isProperty(nodeType, candidates[current])) {\n                                element = new Element(candidate[current2], [key, current2], 'Property', null);\n                            } else if (isNode(candidate[current2])) {\n                                element = new Element(candidate[current2], [key, current2], null, null);\n                            } else {\n                                continue;\n                            }\n                            worklist.push(element);\n                        }\n                    } else if (isNode(candidate)) {\n                        if (candidateExistsInLeaveList(leavelist, candidate)) {\n                          continue;\n                        }\n\n                        worklist.push(new Element(candidate, key, null, null));\n                    }\n                }\n            }\n        }\n    };\n\n    Controller.prototype.replace = function replace(root, visitor) {\n        var worklist,\n            leavelist,\n            node,\n            nodeType,\n            target,\n            element,\n            current,\n            current2,\n            candidates,\n            candidate,\n            sentinel,\n            outer,\n            key;\n\n        function removeElem(element) {\n            var i,\n                key,\n                nextElem,\n                parent;\n\n            if (element.ref.remove()) {\n                // When the reference is an element of an array.\n                key = element.ref.key;\n                parent = element.ref.parent;\n\n                // If removed from array, then decrease following items' keys.\n                i = worklist.length;\n                while (i--) {\n                    nextElem = worklist[i];\n                    if (nextElem.ref && nextElem.ref.parent === parent) {\n                        if  (nextElem.ref.key < key) {\n                            break;\n                        }\n                        --nextElem.ref.key;\n                    }\n                }\n            }\n        }\n\n        this.__initialize(root, visitor);\n\n        sentinel = {};\n\n        // reference\n        worklist = this.__worklist;\n        leavelist = this.__leavelist;\n\n        // initialize\n        outer = {\n            root: root\n        };\n        element = new Element(root, null, null, new Reference(outer, 'root'));\n        worklist.push(element);\n        leavelist.push(element);\n\n        while (worklist.length) {\n            element = worklist.pop();\n\n            if (element === sentinel) {\n                element = leavelist.pop();\n\n                target = this.__execute(visitor.leave, element);\n\n                // node may be replaced with null,\n                // so distinguish between undefined and null in this place\n                if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {\n                    // replace\n                    element.ref.replace(target);\n                }\n\n                if (this.__state === REMOVE || target === REMOVE) {\n                    removeElem(element);\n                }\n\n                if (this.__state === BREAK || target === BREAK) {\n                    return outer.root;\n                }\n                continue;\n            }\n\n            target = this.__execute(visitor.enter, element);\n\n            // node may be replaced with null,\n            // so distinguish between undefined and null in this place\n            if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {\n                // replace\n                element.ref.replace(target);\n                element.node = target;\n            }\n\n            if (this.__state === REMOVE || target === REMOVE) {\n                removeElem(element);\n                element.node = null;\n            }\n\n            if (this.__state === BREAK || target === BREAK) {\n                return outer.root;\n            }\n\n            // node may be null\n            node = element.node;\n            if (!node) {\n                continue;\n            }\n\n            worklist.push(sentinel);\n            leavelist.push(element);\n\n            if (this.__state === SKIP || target === SKIP) {\n                continue;\n            }\n\n            nodeType = node.type || element.wrap;\n            candidates = this.__keys[nodeType];\n            if (!candidates) {\n                if (this.__fallback) {\n                    candidates = this.__fallback(node);\n                } else {\n                    throw new Error('Unknown node type ' + nodeType + '.');\n                }\n            }\n\n            current = candidates.length;\n            while ((current -= 1) >= 0) {\n                key = candidates[current];\n                candidate = node[key];\n                if (!candidate) {\n                    continue;\n                }\n\n                if (Array.isArray(candidate)) {\n                    current2 = candidate.length;\n                    while ((current2 -= 1) >= 0) {\n                        if (!candidate[current2]) {\n                            continue;\n                        }\n                        if (isProperty(nodeType, candidates[current])) {\n                            element = new Element(candidate[current2], [key, current2], 'Property', new Reference(candidate, current2));\n                        } else if (isNode(candidate[current2])) {\n                            element = new Element(candidate[current2], [key, current2], null, new Reference(candidate, current2));\n                        } else {\n                            continue;\n                        }\n                        worklist.push(element);\n                    }\n                } else if (isNode(candidate)) {\n                    worklist.push(new Element(candidate, key, null, new Reference(node, key)));\n                }\n            }\n        }\n\n        return outer.root;\n    };\n\n    function traverse(root, visitor) {\n        var controller = new Controller();\n        return controller.traverse(root, visitor);\n    }\n\n    function replace(root, visitor) {\n        var controller = new Controller();\n        return controller.replace(root, visitor);\n    }\n\n    function extendCommentRange(comment, tokens) {\n        var target;\n\n        target = upperBound(tokens, function search(token) {\n            return token.range[0] > comment.range[0];\n        });\n\n        comment.extendedRange = [comment.range[0], comment.range[1]];\n\n        if (target !== tokens.length) {\n            comment.extendedRange[1] = tokens[target].range[0];\n        }\n\n        target -= 1;\n        if (target >= 0) {\n            comment.extendedRange[0] = tokens[target].range[1];\n        }\n\n        return comment;\n    }\n\n    function attachComments(tree, providedComments, tokens) {\n        // At first, we should calculate extended comment ranges.\n        var comments = [], comment, len, i, cursor;\n\n        if (!tree.range) {\n            throw new Error('attachComments needs range information');\n        }\n\n        // tokens array is empty, we attach comments to tree as 'leadingComments'\n        if (!tokens.length) {\n            if (providedComments.length) {\n                for (i = 0, len = providedComments.length; i < len; i += 1) {\n                    comment = deepCopy(providedComments[i]);\n                    comment.extendedRange = [0, tree.range[0]];\n                    comments.push(comment);\n                }\n                tree.leadingComments = comments;\n            }\n            return tree;\n        }\n\n        for (i = 0, len = providedComments.length; i < len; i += 1) {\n            comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens));\n        }\n\n        // This is based on John Freeman's implementation.\n        cursor = 0;\n        traverse(tree, {\n            enter: function (node) {\n                var comment;\n\n                while (cursor < comments.length) {\n                    comment = comments[cursor];\n                    if (comment.extendedRange[1] > node.range[0]) {\n                        break;\n                    }\n\n                    if (comment.extendedRange[1] === node.range[0]) {\n                        if (!node.leadingComments) {\n                            node.leadingComments = [];\n                        }\n                        node.leadingComments.push(comment);\n                        comments.splice(cursor, 1);\n                    } else {\n                        cursor += 1;\n                    }\n                }\n\n                // already out of owned node\n                if (cursor === comments.length) {\n                    return VisitorOption.Break;\n                }\n\n                if (comments[cursor].extendedRange[0] > node.range[1]) {\n                    return VisitorOption.Skip;\n                }\n            }\n        });\n\n        cursor = 0;\n        traverse(tree, {\n            leave: function (node) {\n                var comment;\n\n                while (cursor < comments.length) {\n                    comment = comments[cursor];\n                    if (node.range[1] < comment.extendedRange[0]) {\n                        break;\n                    }\n\n                    if (node.range[1] === comment.extendedRange[0]) {\n                        if (!node.trailingComments) {\n                            node.trailingComments = [];\n                        }\n                        node.trailingComments.push(comment);\n                        comments.splice(cursor, 1);\n                    } else {\n                        cursor += 1;\n                    }\n                }\n\n                // already out of owned node\n                if (cursor === comments.length) {\n                    return VisitorOption.Break;\n                }\n\n                if (comments[cursor].extendedRange[0] > node.range[1]) {\n                    return VisitorOption.Skip;\n                }\n            }\n        });\n\n        return tree;\n    }\n\n    exports.Syntax = Syntax;\n    exports.traverse = traverse;\n    exports.replace = replace;\n    exports.attachComments = attachComments;\n    exports.VisitorKeys = VisitorKeys;\n    exports.VisitorOption = VisitorOption;\n    exports.Controller = Controller;\n    exports.cloneEnvironment = function () { return clone({}); };\n\n    return exports;\n}(exports));\n/* vim: set sw=4 ts=4 et tw=80 : */\n","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      this._validateMapping(generated, original, source, name);\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n        throw new Error(\n            'original.line and original.column are not numbers -- you probably meant to omit ' +\n            'the original mapping entirely and only map the generated position. If so, pass ' +\n            'null for the original mapping instead of an object with empty or null values.'\n        );\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      }));\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n  var encoded = \"\";\n  var digit;\n\n  var vlq = toVLQSigned(aValue);\n\n  do {\n    digit = vlq & VLQ_BASE_MASK;\n    vlq >>>= VLQ_BASE_SHIFT;\n    if (vlq > 0) {\n      // There are still more digits in this value, so we must make sure the\n      // continuation bit is marked.\n      digit |= VLQ_CONTINUATION_BIT;\n    }\n    encoded += base64.encode(digit);\n  } while (vlq > 0);\n\n  return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n  var strLen = aStr.length;\n  var result = 0;\n  var shift = 0;\n  var continuation, digit;\n\n  do {\n    if (aIndex >= strLen) {\n      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n    }\n\n    digit = base64.decode(aStr.charCodeAt(aIndex++));\n    if (digit === -1) {\n      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n    }\n\n    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n    digit &= VLQ_BASE_MASK;\n    result = result + (digit << shift);\n    shift += VLQ_BASE_SHIFT;\n  } while (continuation);\n\n  aOutParam.value = fromVLQSigned(result);\n  aOutParam.rest = aIndex;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n  if (0 <= number && number < intToCharMap.length) {\n    return intToCharMap[number];\n  }\n  throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n  var bigA = 65;     // 'A'\n  var bigZ = 90;     // 'Z'\n\n  var littleA = 97;  // 'a'\n  var littleZ = 122; // 'z'\n\n  var zero = 48;     // '0'\n  var nine = 57;     // '9'\n\n  var plus = 43;     // '+'\n  var slash = 47;    // '/'\n\n  var littleOffset = 26;\n  var numberOffset = 52;\n\n  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n  if (bigA <= charCode && charCode <= bigZ) {\n    return (charCode - bigA);\n  }\n\n  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n  if (littleA <= charCode && charCode <= littleZ) {\n    return (charCode - littleA + littleOffset);\n  }\n\n  // 52 - 61: 0123456789\n  if (zero <= charCode && charCode <= nine) {\n    return (charCode - zero + numberOffset);\n  }\n\n  // 62: +\n  if (charCode == plus) {\n    return 62;\n  }\n\n  // 63: /\n  if (charCode == slash) {\n    return 63;\n  }\n\n  // Invalid base64 digit.\n  return -1;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n\n  var parts = path.split(/\\/+/);\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n  this._array = [];\n  this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n  var set = new ArraySet();\n  for (var i = 0, len = aArray.length; i < len; i++) {\n    set.add(aArray[i], aAllowDuplicates);\n  }\n  return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n  var idx = this._array.length;\n  if (!isDuplicate || aAllowDuplicates) {\n    this._array.push(aStr);\n  }\n  if (!isDuplicate) {\n    if (hasNativeMap) {\n      this._set.set(aStr, idx);\n    } else {\n      this._set[sStr] = idx;\n    }\n  }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n  if (hasNativeMap) {\n    return this._set.has(aStr);\n  } else {\n    var sStr = util.toSetString(aStr);\n    return has.call(this._set, sStr);\n  }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n  if (hasNativeMap) {\n    var idx = this._set.get(aStr);\n    if (idx >= 0) {\n        return idx;\n    }\n  } else {\n    var sStr = util.toSetString(aStr);\n    if (has.call(this._set, sStr)) {\n      return this._set[sStr];\n    }\n  }\n\n  throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n  if (aIdx >= 0 && aIdx < this._array.length) {\n    return this._array[aIdx];\n  }\n  throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n  // Optimized for most common case\n  var lineA = mappingA.generatedLine;\n  var lineB = mappingB.generatedLine;\n  var columnA = mappingA.generatedColumn;\n  var columnB = mappingB.generatedColumn;\n  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n  this._array = [];\n  this._sorted = true;\n  // Serves as infimum\n  this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n  if (generatedPositionAfter(this._last, aMapping)) {\n    this._last = aMapping;\n    this._array.push(aMapping);\n  } else {\n    this._sorted = false;\n    this._array.push(aMapping);\n  }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n  if (!this._sorted) {\n    this._array.sort(util.compareByGeneratedPositionsInflated);\n    this._sorted = true;\n  }\n  return this._array;\n};\n\nexports.MappingList = MappingList;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  return sourceMap.sections != null\n    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__generatedMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__generatedMappings;\n  }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__originalMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__originalMappings;\n  }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n    var mappings;\n    switch (order) {\n    case SourceMapConsumer.GENERATED_ORDER:\n      mappings = this._generatedMappings;\n      break;\n    case SourceMapConsumer.ORIGINAL_ORDER:\n      mappings = this._originalMappings;\n      break;\n    default:\n      throw new Error(\"Unknown order of iteration.\");\n    }\n\n    var sourceRoot = this.sourceRoot;\n    mappings.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).forEach(aCallback, context);\n  };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n      source: util.getArg(aArgs, 'source'),\n      originalLine: line,\n      originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) {\n      return [];\n    }\n\n    var mappings = [];\n\n    var index = this._findMapping(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (aArgs.column === undefined) {\n        var originalLine = mapping.originalLine;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we found. Since\n        // mappings are sorted, this is guaranteed to find all mappings for\n        // the line we found.\n        while (mapping && mapping.originalLine === originalLine) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      } else {\n        var originalColumn = mapping.originalColumn;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we were searching for.\n        // Since mappings are sorted, this is guaranteed to find all mappings for\n        // the line we are searching for.\n        while (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      }\n    }\n\n    return mappings;\n  };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sources = util.getArg(sourceMap, 'sources');\n  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n  // requires the array) to play nice here.\n  var names = util.getArg(sourceMap, 'names', []);\n  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n  var mappings = util.getArg(sourceMap, 'mappings');\n  var file = util.getArg(sourceMap, 'file', null);\n\n  // Once again, Sass deviates from the spec and supplies the version as a\n  // string rather than a number, so we use loose equality checking here.\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  if (sourceRoot) {\n    sourceRoot = util.normalize(sourceRoot);\n  }\n\n  sources = sources\n    .map(String)\n    // Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)\n    // Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function (source) {\n      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n        ? util.relative(sourceRoot, source)\n        : source;\n    });\n\n  // Pass `true` below to allow duplicate names and sources. While source maps\n  // are intended to be compressed and deduplicated, the TypeScript compiler\n  // sometimes generates source maps with duplicates in them. See Github issue\n  // #72 and bugzil.la/889492.\n  this._names = ArraySet.fromArray(names.map(String), true);\n  this._sources = ArraySet.fromArray(sources, true);\n\n  this._absoluteSources = this._sources.toArray().map(function (s) {\n    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n  });\n\n  this.sourceRoot = sourceRoot;\n  this.sourcesContent = sourcesContent;\n  this._mappings = mappings;\n  this._sourceMapURL = aSourceMapURL;\n  this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n  var relativeSource = aSource;\n  if (this.sourceRoot != null) {\n    relativeSource = util.relative(this.sourceRoot, relativeSource);\n  }\n\n  if (this._sources.has(relativeSource)) {\n    return this._sources.indexOf(relativeSource);\n  }\n\n  // Maybe aSource is an absolute URL as returned by |sources|.  In\n  // this case we can't simply undo the transform.\n  var i;\n  for (i = 0; i < this._absoluteSources.length; ++i) {\n    if (this._absoluteSources[i] == aSource) {\n      return i;\n    }\n  }\n\n  return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n\n    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n      var srcMapping = generatedMappings[i];\n      var destMapping = new Mapping;\n      destMapping.generatedLine = srcMapping.generatedLine;\n      destMapping.generatedColumn = srcMapping.generatedColumn;\n\n      if (srcMapping.source) {\n        destMapping.source = sources.indexOf(srcMapping.source);\n        destMapping.originalLine = srcMapping.originalLine;\n        destMapping.originalColumn = srcMapping.originalColumn;\n\n        if (srcMapping.name) {\n          destMapping.name = names.indexOf(srcMapping.name);\n        }\n\n        destOriginalMappings.push(destMapping);\n      }\n\n      destGeneratedMappings.push(destMapping);\n    }\n\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n    return smc;\n  };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    return this._absoluteSources.slice();\n  }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n  this.generatedLine = 0;\n  this.generatedColumn = 0;\n  this.source = null;\n  this.originalLine = null;\n  this.originalColumn = null;\n  this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n\n    while (index < length) {\n      if (aStr.charAt(index) === ';') {\n        generatedLine++;\n        index++;\n        previousGeneratedColumn = 0;\n      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\n      else {\n        mapping = new Mapping();\n        mapping.generatedLine = generatedLine;\n\n        // Because each offset is encoded relative to the previous one,\n        // many segments often have the same encoding. We can exploit this\n        // fact by caching the parsed variable length fields of each segment,\n        // allowing us to avoid a second parse if we encounter the same\n        // segment again.\n        for (end = index; end < length; end++) {\n          if (this._charIsMappingSeparator(aStr, end)) {\n            break;\n          }\n        }\n        str = aStr.slice(index, end);\n\n        segment = cachedSegments[str];\n        if (segment) {\n          index += str.length;\n        } else {\n          segment = [];\n          while (index < end) {\n            base64VLQ.decode(aStr, index, temp);\n            value = temp.value;\n            index = temp.rest;\n            segment.push(value);\n          }\n\n          if (segment.length === 2) {\n            throw new Error('Found a source, but no line and column');\n          }\n\n          if (segment.length === 3) {\n            throw new Error('Found a source and line, but no column');\n          }\n\n          cachedSegments[str] = segment;\n        }\n\n        // Generated column.\n        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n        previousGeneratedColumn = mapping.generatedColumn;\n\n        if (segment.length > 1) {\n          // Original source.\n          mapping.source = previousSource + segment[1];\n          previousSource += segment[1];\n\n          // Original line.\n          mapping.originalLine = previousOriginalLine + segment[2];\n          previousOriginalLine = mapping.originalLine;\n          // Lines are stored 0-based\n          mapping.originalLine += 1;\n\n          // Original column.\n          mapping.originalColumn = previousOriginalColumn + segment[3];\n          previousOriginalColumn = mapping.originalColumn;\n\n          if (segment.length > 4) {\n            // Original name.\n            mapping.name = previousName + segment[4];\n            previousName += segment[4];\n          }\n        }\n\n        generatedMappings.push(mapping);\n        if (typeof mapping.originalLine === 'number') {\n          originalMappings.push(mapping);\n        }\n      }\n    }\n\n    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n    this.__generatedMappings = generatedMappings;\n\n    quickSort(originalMappings, util.compareByOriginalPositions);\n    this.__originalMappings = originalMappings;\n  };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n\n    if (aNeedle[aLineName] <= 0) {\n      throw new TypeError('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\n    }\n\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n  };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  function SourceMapConsumer_computeColumnSpans() {\n    for (var index = 0; index < this._generatedMappings.length; ++index) {\n      var mapping = this._generatedMappings[index];\n\n      // Mappings do not contain a field for the last generated columnt. We\n      // can come up with an optimistic estimate, however, by assuming that\n      // mappings are contiguous (i.e. given two consecutive mappings, the\n      // first mapping ends where the second one starts).\n      if (index + 1 < this._generatedMappings.length) {\n        var nextMapping = this._generatedMappings[index + 1];\n\n        if (mapping.generatedLine === nextMapping.generatedLine) {\n          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n          continue;\n        }\n      }\n\n      // The last mapping for each line spans the entire line.\n      mapping.lastGeneratedColumn = Infinity;\n    }\n  };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._generatedMappings,\n      \"generatedLine\",\n      \"generatedColumn\",\n      util.compareByGeneratedPositionsDeflated,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._generatedMappings[index];\n\n      if (mapping.generatedLine === needle.generatedLine) {\n        var source = util.getArg(mapping, 'source', null);\n        if (source !== null) {\n          source = this._sources.at(source);\n          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n        }\n        var name = util.getArg(mapping, 'name', null);\n        if (name !== null) {\n          name = this._names.at(name);\n        }\n        return {\n          source: source,\n          line: util.getArg(mapping, 'originalLine', null),\n          column: util.getArg(mapping, 'originalColumn', null),\n          name: name\n        };\n      }\n    }\n\n    return {\n      source: null,\n      line: null,\n      column: null,\n      name: null\n    };\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) {\n      return null;\n    }\n\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) {\n      return this.sourcesContent[index];\n    }\n\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) {\n      relativeSource = util.relative(this.sourceRoot, relativeSource);\n    }\n\n    var url;\n    if (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\n      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n      // many users. We can help them out when they expect file:// URIs to\n      // behave like it would if they were running a local HTTP server. See\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n      if (url.scheme == \"file\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n      }\n    }\n\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) {\n      return {\n        line: null,\n        column: null,\n        lastColumn: null\n      };\n    }\n\n    var needle = {\n      source: source,\n      originalLine: util.getArg(aArgs, 'line'),\n      originalColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._originalMappings,\n      \"originalLine\",\n      \"originalColumn\",\n      util.compareByOriginalPositions,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (mapping.source === needle.source) {\n        return {\n          line: util.getArg(mapping, 'generatedLine', null),\n          column: util.getArg(mapping, 'generatedColumn', null),\n          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n      }\n    }\n\n    return {\n      line: null,\n      column: null,\n      lastColumn: null\n    };\n  };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sections = util.getArg(sourceMap, 'sections');\n\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n\n  var lastOffset = {\n    line: -1,\n    column: 0\n  };\n  this._sections = sections.map(function (s) {\n    if (s.url) {\n      // The url field will require support for asynchronicity.\n      // See https://github.com/mozilla/source-map/issues/16\n      throw new Error('Support for url field in sections not implemented.');\n    }\n    var offset = util.getArg(s, 'offset');\n    var offsetLine = util.getArg(offset, 'line');\n    var offsetColumn = util.getArg(offset, 'column');\n\n    if (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\n    }\n    lastOffset = offset;\n\n    return {\n      generatedOffset: {\n        // The offset fields are 0-based, but we use 1-based indices when\n        // encoding/decoding from VLQ.\n        generatedLine: offsetLine + 1,\n        generatedColumn: offsetColumn + 1\n      },\n      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n        sources.push(this._sections[i].consumer.sources[j]);\n      }\n    }\n    return sources;\n  }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\n      });\n    var section = this._sections[sectionIndex];\n\n    if (!section) {\n      return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n      };\n    }\n\n    return section.consumer.originalPositionFor({\n      line: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: needle.generatedColumn -\n        (section.generatedOffset.generatedLine === needle.generatedLine\n         ? section.generatedOffset.generatedColumn - 1\n         : 0),\n      bias: aArgs.bias\n    });\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function (s) {\n      return s.consumer.hasContentsOfAllSources();\n    });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      var content = section.consumer.sourceContentFor(aSource, true);\n      if (content) {\n        return content;\n      }\n    }\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      // Only consider this section if the requested source is in the list of\n      // sources of the consumer.\n      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === generatedPosition.line\n             ? section.generatedOffset.generatedColumn - 1\n             : 0)\n        };\n        return ret;\n      }\n    }\n\n    return {\n      line: null,\n      column: null\n    };\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n      var sectionMappings = section.consumer._generatedMappings;\n      for (var j = 0; j < sectionMappings.length; j++) {\n        var mapping = sectionMappings[j];\n\n        var source = section.consumer._sources.at(mapping.source);\n        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n        this._sources.add(source);\n        source = this._sources.indexOf(source);\n\n        var name = null;\n        if (mapping.name) {\n          name = section.consumer._names.at(mapping.name);\n          this._names.add(name);\n          name = this._names.indexOf(name);\n        }\n\n        // The mappings coming from the consumer for the section have\n        // generated positions relative to the start of the section, so we\n        // need to offset them to be relative to the start of the concatenated\n        // generated file.\n        var adjustedMapping = {\n          source: source,\n          generatedLine: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === mapping.generatedLine\n            ? section.generatedOffset.generatedColumn - 1\n            : 0),\n          originalLine: mapping.originalLine,\n          originalColumn: mapping.originalColumn,\n          name: name\n        };\n\n        this.__generatedMappings.push(adjustedMapping);\n        if (typeof adjustedMapping.originalLine === 'number') {\n          this.__originalMappings.push(adjustedMapping);\n        }\n      }\n    }\n\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n  // This function terminates when one of the following is true:\n  //\n  //   1. We find the exact element we are looking for.\n  //\n  //   2. We did not find the exact element, but we can return the index of\n  //      the next-closest element.\n  //\n  //   3. We did not find the exact element, and there is no next-closest\n  //      element than the one we are searching for, so we return -1.\n  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n  if (cmp === 0) {\n    // Found the element we are looking for.\n    return mid;\n  }\n  else if (cmp > 0) {\n    // Our needle is greater than aHaystack[mid].\n    if (aHigh - mid > 1) {\n      // The element is in the upper half.\n      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // The exact needle element was not found in this haystack. Determine if\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return aHigh < aHaystack.length ? aHigh : -1;\n    } else {\n      return mid;\n    }\n  }\n  else {\n    // Our needle is less than aHaystack[mid].\n    if (mid - aLow > 1) {\n      // The element is in the lower half.\n      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return mid;\n    } else {\n      return aLow < 0 ? -1 : aLow;\n    }\n  }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n *     array and returns -1, 0, or 1 depending on whether the needle is less\n *     than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n  if (index < 0) {\n    return -1;\n  }\n\n  // We have found either the exact element, or the next-closest element than\n  // the one we are searching for. However, there may be more than one such\n  // element. Make sure we always return the smallest of these.\n  while (index - 1 >= 0) {\n    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n      break;\n    }\n    --index;\n  }\n\n  return index;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n *        The array.\n * @param {Number} x\n *        The index of the first item.\n * @param {Number} y\n *        The index of the second item.\n */\nfunction swap(ary, x, y) {\n  var temp = ary[x];\n  ary[x] = ary[y];\n  ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n *        The lower bound on the range.\n * @param {Number} high\n *        The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n  return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n * @param {Number} p\n *        Start index of the array\n * @param {Number} r\n *        End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n  // If our lower bound is less than our upper bound, we (1) partition the\n  // array into two pieces and (2) recurse on each half. If it is not, this is\n  // the empty array and our base case.\n\n  if (p < r) {\n    // (1) Partitioning.\n    //\n    // The partitioning chooses a pivot between `p` and `r` and moves all\n    // elements that are less than or equal to the pivot to the before it, and\n    // all the elements that are greater than it after it. The effect is that\n    // once partition is done, the pivot is in the exact place it will be when\n    // the array is put in sorted order, and it will not need to be moved\n    // again. This runs in O(n) time.\n\n    // Always choose a random pivot so that an input array which is reverse\n    // sorted does not cause O(n^2) running time.\n    var pivotIndex = randomIntInRange(p, r);\n    var i = p - 1;\n\n    swap(ary, pivotIndex, r);\n    var pivot = ary[r];\n\n    // Immediately after `j` is incremented in this loop, the following hold\n    // true:\n    //\n    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n    //\n    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n    for (var j = p; j < r; j++) {\n      if (comparator(ary[j], pivot) <= 0) {\n        i += 1;\n        swap(ary, i, j);\n      }\n    }\n\n    swap(ary, i + 1, j);\n    var q = i + 1;\n\n    // (2) Recurse on each half.\n\n    doQuickSort(ary, comparator, p, q - 1);\n    doQuickSort(ary, comparator, q + 1, r);\n  }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n  this.children = [];\n  this.sourceContents = {};\n  this.line = aLine == null ? null : aLine;\n  this.column = aColumn == null ? null : aColumn;\n  this.source = aSource == null ? null : aSource;\n  this.name = aName == null ? null : aName;\n  this[isSourceNode] = true;\n  if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n      var lineContents = getNextLine();\n      // The last line of a file might not have a newline.\n      var newLine = getNextLine() || \"\";\n      return lineContents + newLine;\n\n      function getNextLine() {\n        return remainingLinesIndex < remainingLines.length ?\n            remainingLines[remainingLinesIndex++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      if (lastMapping !== null) {\n        // We add the code from \"lastMapping\" to \"mapping\":\n        // First check if there is a new line in between.\n        if (lastGeneratedLine < mapping.generatedLine) {\n          // Associate first line with \"lastMapping\"\n          addMappingWithCode(lastMapping, shiftNextLine());\n          lastGeneratedLine++;\n          lastGeneratedColumn = 0;\n          // The remaining code is added without mapping\n        } else {\n          // There is no new line in between.\n          // Associate the code between \"lastGeneratedColumn\" and\n          // \"mapping.generatedColumn\" with \"lastMapping\"\n          var nextLine = remainingLines[remainingLinesIndex] || '';\n          var code = nextLine.substr(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\n          lastGeneratedColumn = mapping.generatedColumn;\n          addMappingWithCode(lastMapping, code);\n          // No more remaining code, continue\n          lastMapping = mapping;\n          return;\n        }\n      }\n      // We add the generated code until the first mapping\n      // to the SourceNode without any mapping.\n      // Each line is added as separate string.\n      while (lastGeneratedLine < mapping.generatedLine) {\n        node.add(shiftNextLine());\n        lastGeneratedLine++;\n      }\n      if (lastGeneratedColumn < mapping.generatedColumn) {\n        var nextLine = remainingLines[remainingLinesIndex] || '';\n        node.add(nextLine.substr(0, mapping.generatedColumn));\n        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n        lastGeneratedColumn = mapping.generatedColumn;\n      }\n      lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n      if (lastMapping) {\n        // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n      }\n      // and add the remaining lines without any mapping\n      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aRelativePath != null) {\n          sourceFile = util.join(aRelativePath, sourceFile);\n        }\n        node.setSourceContent(sourceFile, content);\n      }\n    });\n\n    return node;\n\n    function addMappingWithCode(mapping, code) {\n      if (mapping === null || mapping.source === undefined) {\n        node.add(code);\n      } else {\n        var source = aRelativePath\n          ? util.join(aRelativePath, mapping.source)\n          : mapping.source;\n        node.add(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\n      }\n    }\n  };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n  if (Array.isArray(aChunk)) {\n    for (var i = aChunk.length-1; i >= 0; i--) {\n      this.prepend(aChunk[i]);\n    }\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n  var chunk;\n  for (var i = 0, len = this.children.length; i < len; i++) {\n    chunk = this.children[i];\n    if (chunk[isSourceNode]) {\n      chunk.walk(aFn);\n    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\n      }\n    }\n  }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n  var newChildren;\n  var i;\n  var len = this.children.length;\n  if (len > 0) {\n    newChildren = [];\n    for (i = 0; i < len-1; i++) {\n      newChildren.push(this.children[i]);\n      newChildren.push(aSep);\n    }\n    newChildren.push(this.children[i]);\n    this.children = newChildren;\n  }\n  return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n  }\n  else {\n    this.children.push(''.replace(aPattern, aReplacement));\n  }\n  return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n  };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\n    for (var i = 0, len = this.children.length; i < len; i++) {\n      if (this.children[i][isSourceNode]) {\n        this.children[i].walkSourceContents(aFn);\n      }\n    }\n\n    var sources = Object.keys(this.sourceContents);\n    for (var i = 0, len = sources.length; i < len; i++) {\n      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n    }\n  };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n  var str = \"\";\n  this.walk(function (chunk) {\n    str += chunk;\n  });\n  return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n  var generated = {\n    code: \"\",\n    line: 1,\n    column: 0\n  };\n  var map = new SourceMapGenerator(aArgs);\n  var sourceMappingActive = false;\n  var lastOriginalSource = null;\n  var lastOriginalLine = null;\n  var lastOriginalColumn = null;\n  var lastOriginalName = null;\n  this.walk(function (chunk, original) {\n    generated.code += chunk;\n    if (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\n        map.addMapping({\n          source: original.source,\n          original: {\n            line: original.line,\n            column: original.column\n          },\n          generated: {\n            line: generated.line,\n            column: generated.column\n          },\n          name: original.name\n        });\n      }\n      lastOriginalSource = original.source;\n      lastOriginalLine = original.line;\n      lastOriginalColumn = original.column;\n      lastOriginalName = original.name;\n      sourceMappingActive = true;\n    } else if (sourceMappingActive) {\n      map.addMapping({\n        generated: {\n          line: generated.line,\n          column: generated.column\n        }\n      });\n      lastOriginalSource = null;\n      sourceMappingActive = false;\n    }\n    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n        generated.line++;\n        generated.column = 0;\n        // Mappings end at eol\n        if (idx + 1 === length) {\n          lastOriginalSource = null;\n          sourceMappingActive = false;\n        } else if (sourceMappingActive) {\n          map.addMapping({\n            source: original.source,\n            original: {\n              line: original.line,\n              column: original.column\n            },\n            generated: {\n              line: generated.line,\n              column: generated.column\n            },\n            name: original.name\n          });\n        }\n      } else {\n        generated.column++;\n      }\n    }\n  });\n  this.walkSourceContents(function (sourceFile, sourceContent) {\n    map.setSourceContent(sourceFile, sourceContent);\n  });\n\n  return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n","{\n    \"name\": \"escodegen\",\n    \"description\": \"ECMAScript code generator\",\n    \"homepage\": \"http://github.com/estools/escodegen\",\n    \"main\": \"escodegen.js\",\n    \"bin\": {\n        \"esgenerate\": \"./bin/esgenerate.js\",\n        \"escodegen\": \"./bin/escodegen.js\"\n    },\n    \"files\": [\n        \"LICENSE.BSD\",\n        \"README.md\",\n        \"bin\",\n        \"escodegen.js\",\n        \"package.json\"\n    ],\n    \"version\": \"2.1.0\",\n    \"engines\": {\n        \"node\": \">=6.0\"\n    },\n    \"maintainers\": [\n        {\n            \"name\": \"Yusuke Suzuki\",\n            \"email\": \"utatane.tea@gmail.com\",\n            \"web\": \"http://github.com/Constellation\"\n        }\n    ],\n    \"repository\": {\n        \"type\": \"git\",\n        \"url\": \"http://github.com/estools/escodegen.git\"\n    },\n    \"dependencies\": {\n        \"estraverse\": \"^5.2.0\",\n        \"esutils\": \"^2.0.2\",\n        \"esprima\": \"^4.0.1\"\n    },\n    \"optionalDependencies\": {\n        \"source-map\": \"~0.6.1\"\n    },\n    \"devDependencies\": {\n        \"acorn\": \"^8.0.4\",\n        \"bluebird\": \"^3.4.7\",\n        \"bower-registry-client\": \"^1.0.0\",\n        \"chai\": \"^4.2.0\",\n        \"chai-exclude\": \"^2.0.2\",\n        \"commonjs-everywhere\": \"^0.9.7\",\n        \"gulp\": \"^4.0.2\",\n        \"gulp-eslint\": \"^6.0.0\",\n        \"gulp-mocha\": \"^7.0.2\",\n        \"minimist\": \"^1.2.5\",\n        \"optionator\": \"^0.9.1\",\n        \"semver\": \"^7.3.4\"\n    },\n    \"license\": \"BSD-2-Clause\",\n    \"scripts\": {\n        \"test\": \"gulp travis\",\n        \"unit-test\": \"gulp test\",\n        \"lint\": \"gulp lint\",\n        \"release\": \"node tools/release.js\",\n        \"build-min\": \"./node_modules/.bin/cjsify -ma path: tools/entry-point.js > escodegen.browser.min.js\",\n        \"build\": \"./node_modules/.bin/cjsify -a path: tools/entry-point.js > escodegen.browser.js\"\n    }\n}\n","// Reserved word lists for various dialects of the language\n\nvar reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n};\n\n// And the keywords\n\nvar ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\";\n\nvar keywords = {\n  5: ecma5AndLessKeywords,\n  \"5module\": ecma5AndLessKeywords + \" export import\",\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n};\n\nvar keywordRelationalOperator = /^in(stanceof)?$/;\n\n// ## Character categories\n\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point above 128.\n// Generated by `bin/generate-identifier-regex.js`.\nvar nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u08a0-\\u08b4\\u08b6-\\u08c7\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u170c\\u170e-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4b\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2c2e\\u2c30-\\u2c5e\\u2c60-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\u9ffc\\ua000-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7bf\\ua7c2-\\ua7ca\\ua7f5-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\nvar nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u08d3-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u1810-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf\\u1ac0\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1df9\\u1dfb-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\";\n\nvar nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\");\nvar nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\");\n\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null;\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by bin/generate-identifier-regex.js\n\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,349,41,7,1,79,28,11,0,9,21,107,20,28,22,13,52,76,44,33,24,27,35,30,0,3,0,9,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,2,31,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,7,3,0,3,7,2,1,2,23,16,0,2,0,95,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,190,0,80,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,1237,43,8,8952,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42717,35,4148,12,221,3,5761,15,7472,3104,541,1507,4938];\n\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,370,1,154,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,2,11,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,71,5,2,1,3,3,2,0,2,1,13,9,120,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,82,0,12,1,19628,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,4759,9,787719,239];\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  var pos = 0x10000;\n  for (var i = 0; i < set.length; i += 2) {\n    pos += set[i];\n    if (pos > code) { return false }\n    pos += set[i + 1];\n    if (pos >= code) { return true }\n  }\n}\n\n// Test whether a given character code starts an identifier.\n\nfunction isIdentifierStart(code, astral) {\n  if (code < 65) { return code === 36 }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nfunction isIdentifierChar(code, astral) {\n  if (code < 48) { return code === 36 }\n  if (code < 58) { return true }\n  if (code < 65) { return false }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n\n// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nvar TokenType = function TokenType(label, conf) {\n  if ( conf === void 0 ) conf = {};\n\n  this.label = label;\n  this.keyword = conf.keyword;\n  this.beforeExpr = !!conf.beforeExpr;\n  this.startsExpr = !!conf.startsExpr;\n  this.isLoop = !!conf.isLoop;\n  this.isAssign = !!conf.isAssign;\n  this.prefix = !!conf.prefix;\n  this.postfix = !!conf.postfix;\n  this.binop = conf.binop || null;\n  this.updateContext = null;\n};\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nvar beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};\n\n// Map keyword names to token types.\n\nvar keywords$1 = {};\n\n// Succinct definitions of keyword token types\nfunction kw(name, options) {\n  if ( options === void 0 ) options = {};\n\n  options.keyword = name;\n  return keywords$1[name] = new TokenType(name, options)\n}\n\nvar types = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  questionDot: new TokenType(\"?.\"),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n  coalesce: binop(\"??\", 1),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\", startsExpr),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n};\n\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nvar lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/;\nvar lineBreakG = new RegExp(lineBreak.source, \"g\");\n\nfunction isNewLine(code, ecma2019String) {\n  return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))\n}\n\nvar nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/;\n\nvar skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\n\nvar ref = Object.prototype;\nvar hasOwnProperty = ref.hasOwnProperty;\nvar toString = ref.toString;\n\n// Checks if an object has a property.\n\nfunction has(obj, propName) {\n  return hasOwnProperty.call(obj, propName)\n}\n\nvar isArray = Array.isArray || (function (obj) { return (\n  toString.call(obj) === \"[object Array]\"\n); });\n\nfunction wordsRegexp(words) {\n  return new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\")\n}\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nvar Position = function Position(line, col) {\n  this.line = line;\n  this.column = col;\n};\n\nPosition.prototype.offset = function offset (n) {\n  return new Position(this.line, this.column + n)\n};\n\nvar SourceLocation = function SourceLocation(p, start, end) {\n  this.start = start;\n  this.end = end;\n  if (p.sourceFile !== null) { this.source = p.sourceFile; }\n};\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nfunction getLineInfo(input, offset) {\n  for (var line = 1, cur = 0;;) {\n    lineBreakG.lastIndex = cur;\n    var match = lineBreakG.exec(input);\n    if (match && match.index < offset) {\n      ++line;\n      cur = match.index + match[0].length;\n    } else {\n      return new Position(line, offset - cur)\n    }\n  }\n}\n\n// A second optional argument can be given to further configure\n// the parser process. These options are recognized:\n\nvar defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10\n  // (2019). This influences support for strict mode, the set of\n  // reserved words, and support for new syntax features. The default\n  // is 10.\n  ecmaVersion: 10,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called\n  // when a semicolon is automatically inserted. It will be passed\n  // the position of the comma as an offset, and if `locations` is\n  // enabled, it is given the location as a `{line, column}` object\n  // as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program.\n  allowImportExportEverywhere: false,\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: false,\n  // When enabled, hashbang directive in the beginning of file\n  // is allowed and treated as a line comment.\n  allowHashBang: false,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback—that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback—that will corrupt its internal state.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n};\n\n// Interpret and default an options object\n\nfunction getOptions(opts) {\n  var options = {};\n\n  for (var opt in defaultOptions)\n    { options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]; }\n\n  if (options.ecmaVersion >= 2015)\n    { options.ecmaVersion -= 2009; }\n\n  if (options.allowReserved == null)\n    { options.allowReserved = options.ecmaVersion < 5; }\n\n  if (isArray(options.onToken)) {\n    var tokens = options.onToken;\n    options.onToken = function (token) { return tokens.push(token); };\n  }\n  if (isArray(options.onComment))\n    { options.onComment = pushComment(options, options.onComment); }\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    var comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    };\n    if (options.locations)\n      { comment.loc = new SourceLocation(this, startLoc, endLoc); }\n    if (options.ranges)\n      { comment.range = [start, end]; }\n    array.push(comment);\n  }\n}\n\n// Each scope gets a bitset that may contain these flags\nvar\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128;\n\nfunction functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal and declareName to determine the type of a binding\nvar\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function\n\nvar Parser = function Parser(options, input, startPos) {\n  this.options = options = getOptions(options);\n  this.sourceFile = options.sourceFile;\n  this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : options.sourceType === \"module\" ? \"5module\" : 5]);\n  var reserved = \"\";\n  if (options.allowReserved !== true) {\n    for (var v = options.ecmaVersion;; v--)\n      { if (reserved = reservedWords[v]) { break } }\n    if (options.sourceType === \"module\") { reserved += \" await\"; }\n  }\n  this.reservedWords = wordsRegexp(reserved);\n  var reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict;\n  this.reservedWordsStrict = wordsRegexp(reservedStrict);\n  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind);\n  this.input = String(input);\n\n  // Used to signal to callers of `readWord1` whether the word\n  // contained any escape sequences. This is needed because words with\n  // escape sequences must not be interpreted as keywords.\n  this.containsEsc = false;\n\n  // Set up token state\n\n  // The current position of the tokenizer in the input.\n  if (startPos) {\n    this.pos = startPos;\n    this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1;\n    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;\n  } else {\n    this.pos = this.lineStart = 0;\n    this.curLine = 1;\n  }\n\n  // Properties of the current token:\n  // Its type\n  this.type = types.eof;\n  // For tokens that include more information than their type, the value\n  this.value = null;\n  // Its start and end offset\n  this.start = this.end = this.pos;\n  // And, if locations are used, the {line, column} object\n  // corresponding to those offsets\n  this.startLoc = this.endLoc = this.curPosition();\n\n  // Position information for the previous token\n  this.lastTokEndLoc = this.lastTokStartLoc = null;\n  this.lastTokStart = this.lastTokEnd = this.pos;\n\n  // The context stack is used to superficially track syntactic\n  // context to predict whether a regular expression is allowed in a\n  // given position.\n  this.context = this.initialContext();\n  this.exprAllowed = true;\n\n  // Figure out if it's a module code.\n  this.inModule = options.sourceType === \"module\";\n  this.strict = this.inModule || this.strictDirective(this.pos);\n\n  // Used to signify the start of a potential arrow function\n  this.potentialArrowAt = -1;\n\n  // Positions to delayed-check that yield/await does not exist in default parameters.\n  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;\n  // Labels in scope.\n  this.labels = [];\n  // Thus-far undefined exports.\n  this.undefinedExports = {};\n\n  // If enabled, skip leading hashbang line.\n  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n    { this.skipLineComment(2); }\n\n  // Scope tracking for duplicate variable names (see scope.js)\n  this.scopeStack = [];\n  this.enterScope(SCOPE_TOP);\n\n  // For RegExp validation\n  this.regexpState = null;\n};\n\nvar prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true } };\n\nParser.prototype.parse = function parse () {\n  var node = this.options.program || this.startNode();\n  this.nextToken();\n  return this.parseTopLevel(node)\n};\n\nprototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };\nprototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };\nprototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };\nprototypeAccessors.allowSuper.get = function () { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 };\nprototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };\nprototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };\n\n// Switch to a getter for 7.0.0.\nParser.prototype.inNonArrowFunction = function inNonArrowFunction () { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 };\n\nParser.extend = function extend () {\n    var plugins = [], len = arguments.length;\n    while ( len-- ) plugins[ len ] = arguments[ len ];\n\n  var cls = this;\n  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }\n  return cls\n};\n\nParser.parse = function parse (input, options) {\n  return new this(options, input).parse()\n};\n\nParser.parseExpressionAt = function parseExpressionAt (input, pos, options) {\n  var parser = new this(options, input, pos);\n  parser.nextToken();\n  return parser.parseExpression()\n};\n\nParser.tokenizer = function tokenizer (input, options) {\n  return new this(options, input)\n};\n\nObject.defineProperties( Parser.prototype, prototypeAccessors );\n\nvar pp = Parser.prototype;\n\n// ## Parser utilities\n\nvar literal = /^(?:'((?:\\\\.|[^'\\\\])*?)'|\"((?:\\\\.|[^\"\\\\])*?)\")/;\npp.strictDirective = function(start) {\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    var match = literal.exec(this.input.slice(start));\n    if (!match) { return false }\n    if ((match[1] || match[2]) === \"use strict\") {\n      skipWhiteSpace.lastIndex = start + match[0].length;\n      var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;\n      var next = this.input.charAt(end);\n      return next === \";\" || next === \"}\" ||\n        (lineBreak.test(spaceAfter[0]) &&\n         !(/[(`.[+\\-/*%<>=,?^&]/.test(next) || next === \"!\" && this.input.charAt(end + 1) === \"=\"))\n    }\n    start += match[0].length;\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    if (this.input[start] === \";\")\n      { start++; }\n  }\n};\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp.eat = function(type) {\n  if (this.type === type) {\n    this.next();\n    return true\n  } else {\n    return false\n  }\n};\n\n// Tests whether parsed token is a contextual keyword.\n\npp.isContextual = function(name) {\n  return this.type === types.name && this.value === name && !this.containsEsc\n};\n\n// Consumes contextual keyword if possible.\n\npp.eatContextual = function(name) {\n  if (!this.isContextual(name)) { return false }\n  this.next();\n  return true\n};\n\n// Asserts that following token is given contextual keyword.\n\npp.expectContextual = function(name) {\n  if (!this.eatContextual(name)) { this.unexpected(); }\n};\n\n// Test whether a semicolon can be inserted at the current position.\n\npp.canInsertSemicolon = function() {\n  return this.type === types.eof ||\n    this.type === types.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\npp.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }\n    return true\n  }\n};\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp.semicolon = function() {\n  if (!this.eat(types.semi) && !this.insertSemicolon()) { this.unexpected(); }\n};\n\npp.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }\n    if (!notNext)\n      { this.next(); }\n    return true\n  }\n};\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp.expect = function(type) {\n  this.eat(type) || this.unexpected();\n};\n\n// Raise an unexpected token error.\n\npp.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\");\n};\n\nfunction DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1;\n}\n\npp.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) { return }\n  if (refDestructuringErrors.trailingComma > -1)\n    { this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\"); }\n  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;\n  if (parens > -1) { this.raiseRecoverable(parens, \"Parenthesized pattern\"); }\n};\n\npp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) { return false }\n  var shorthandAssign = refDestructuringErrors.shorthandAssign;\n  var doubleProto = refDestructuringErrors.doubleProto;\n  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }\n  if (shorthandAssign >= 0)\n    { this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\"); }\n  if (doubleProto >= 0)\n    { this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\"); }\n};\n\npp.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    { this.raise(this.yieldPos, \"Yield expression cannot be a default value\"); }\n  if (this.awaitPos)\n    { this.raise(this.awaitPos, \"Await expression cannot be a default value\"); }\n};\n\npp.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    { return this.isSimpleAssignTarget(expr.expression) }\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n};\n\nvar pp$1 = Parser.prototype;\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp$1.parseTopLevel = function(node) {\n  var exports = {};\n  if (!node.body) { node.body = []; }\n  while (this.type !== types.eof) {\n    var stmt = this.parseStatement(null, true, exports);\n    node.body.push(stmt);\n  }\n  if (this.inModule)\n    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)\n      {\n        var name = list[i];\n\n        this.raiseRecoverable(this.undefinedExports[name].start, (\"Export '\" + name + \"' is not defined\"));\n      } }\n  this.adaptDirectivePrologue(node.body);\n  this.next();\n  node.sourceType = this.options.sourceType;\n  return this.finishNode(node, \"Program\")\n};\n\nvar loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"};\n\npp$1.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) { return false }\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91) { return true } // '['\n  if (context) { return false }\n\n  if (nextCh === 123) { return true } // '{'\n  if (isIdentifierStart(nextCh, true)) {\n    var pos = next + 1;\n    while (isIdentifierChar(this.input.charCodeAt(pos), true)) { ++pos; }\n    var ident = this.input.slice(next, pos);\n    if (!keywordRelationalOperator.test(ident)) { return true }\n  }\n  return false\n};\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp$1.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length;\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))\n};\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp$1.parseStatement = function(context, topLevel, exports) {\n  var starttype = this.type, node = this.startNode(), kind;\n\n  if (this.isLet(context)) {\n    starttype = types._var;\n    kind = \"let\";\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case types._break: case types._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case types._debugger: return this.parseDebuggerStatement(node)\n  case types._do: return this.parseDoStatement(node)\n  case types._for: return this.parseForStatement(node)\n  case types._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) { this.unexpected(); }\n    return this.parseFunctionStatement(node, false, !context)\n  case types._class:\n    if (context) { this.unexpected(); }\n    return this.parseClass(node, true)\n  case types._if: return this.parseIfStatement(node)\n  case types._return: return this.parseReturnStatement(node)\n  case types._switch: return this.parseSwitchStatement(node)\n  case types._throw: return this.parseThrowStatement(node)\n  case types._try: return this.parseTryStatement(node)\n  case types._const: case types._var:\n    kind = kind || this.value;\n    if (context && kind !== \"var\") { this.unexpected(); }\n    return this.parseVarStatement(node, kind)\n  case types._while: return this.parseWhileStatement(node)\n  case types._with: return this.parseWithStatement(node)\n  case types.braceL: return this.parseBlock(true, node)\n  case types.semi: return this.parseEmptyStatement(node)\n  case types._export:\n  case types._import:\n    if (this.options.ecmaVersion > 10 && starttype === types._import) {\n      skipWhiteSpace.lastIndex = this.pos;\n      var skip = skipWhiteSpace.exec(this.input);\n      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n      if (nextCh === 40 || nextCh === 46) // '(' or '.'\n        { return this.parseExpressionStatement(node, this.parseExpression()) }\n    }\n\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        { this.raise(this.start, \"'import' and 'export' may only appear at the top level\"); }\n      if (!this.inModule)\n        { this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\"); }\n    }\n    return starttype === types._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) { this.unexpected(); }\n      this.next();\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    var maybeName = this.value, expr = this.parseExpression();\n    if (starttype === types.name && expr.type === \"Identifier\" && this.eat(types.colon))\n      { return this.parseLabeledStatement(node, maybeName, expr, context) }\n    else { return this.parseExpressionStatement(node, expr) }\n  }\n};\n\npp$1.parseBreakContinueStatement = function(node, keyword) {\n  var isBreak = keyword === \"break\";\n  this.next();\n  if (this.eat(types.semi) || this.insertSemicolon()) { node.label = null; }\n  else if (this.type !== types.name) { this.unexpected(); }\n  else {\n    node.label = this.parseIdent();\n    this.semicolon();\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  var i = 0;\n  for (; i < this.labels.length; ++i) {\n    var lab = this.labels[i];\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) { break }\n      if (node.label && isBreak) { break }\n    }\n  }\n  if (i === this.labels.length) { this.raise(node.start, \"Unsyntactic \" + keyword); }\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n};\n\npp$1.parseDebuggerStatement = function(node) {\n  this.next();\n  this.semicolon();\n  return this.finishNode(node, \"DebuggerStatement\")\n};\n\npp$1.parseDoStatement = function(node) {\n  this.next();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"do\");\n  this.labels.pop();\n  this.expect(types._while);\n  node.test = this.parseParenExpression();\n  if (this.options.ecmaVersion >= 6)\n    { this.eat(types.semi); }\n  else\n    { this.semicolon(); }\n  return this.finishNode(node, \"DoWhileStatement\")\n};\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp$1.parseForStatement = function(node) {\n  this.next();\n  var awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual(\"await\")) ? this.lastTokStart : -1;\n  this.labels.push(loopLabel);\n  this.enterScope(0);\n  this.expect(types.parenL);\n  if (this.type === types.semi) {\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, null)\n  }\n  var isLet = this.isLet();\n  if (this.type === types._var || this.type === types._const || isLet) {\n    var init$1 = this.startNode(), kind = isLet ? \"let\" : this.value;\n    this.next();\n    this.parseVar(init$1, true, kind);\n    this.finishNode(init$1, \"VariableDeclaration\");\n    if ((this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init$1.declarations.length === 1) {\n      if (this.options.ecmaVersion >= 9) {\n        if (this.type === types._in) {\n          if (awaitAt > -1) { this.unexpected(awaitAt); }\n        } else { node.await = awaitAt > -1; }\n      }\n      return this.parseForIn(node, init$1)\n    }\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, init$1)\n  }\n  var refDestructuringErrors = new DestructuringErrors;\n  var init = this.parseExpression(true, refDestructuringErrors);\n  if (this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === types._in) {\n        if (awaitAt > -1) { this.unexpected(awaitAt); }\n      } else { node.await = awaitAt > -1; }\n    }\n    this.toAssignable(init, false, refDestructuringErrors);\n    this.checkLVal(init);\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true);\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\npp$1.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next();\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n};\n\npp$1.parseIfStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\");\n  node.alternate = this.eat(types._else) ? this.parseStatement(\"if\") : null;\n  return this.finishNode(node, \"IfStatement\")\n};\n\npp$1.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    { this.raise(this.start, \"'return' outside of function\"); }\n  this.next();\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(types.semi) || this.insertSemicolon()) { node.argument = null; }\n  else { node.argument = this.parseExpression(); this.semicolon(); }\n  return this.finishNode(node, \"ReturnStatement\")\n};\n\npp$1.parseSwitchStatement = function(node) {\n  this.next();\n  node.discriminant = this.parseParenExpression();\n  node.cases = [];\n  this.expect(types.braceL);\n  this.labels.push(switchLabel);\n  this.enterScope(0);\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  var cur;\n  for (var sawDefault = false; this.type !== types.braceR;) {\n    if (this.type === types._case || this.type === types._default) {\n      var isCase = this.type === types._case;\n      if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n      node.cases.push(cur = this.startNode());\n      cur.consequent = [];\n      this.next();\n      if (isCase) {\n        cur.test = this.parseExpression();\n      } else {\n        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\"); }\n        sawDefault = true;\n        cur.test = null;\n      }\n      this.expect(types.colon);\n    } else {\n      if (!cur) { this.unexpected(); }\n      cur.consequent.push(this.parseStatement(null));\n    }\n  }\n  this.exitScope();\n  if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n  this.next(); // Closing brace\n  this.labels.pop();\n  return this.finishNode(node, \"SwitchStatement\")\n};\n\npp$1.parseThrowStatement = function(node) {\n  this.next();\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    { this.raise(this.lastTokEnd, \"Illegal newline after throw\"); }\n  node.argument = this.parseExpression();\n  this.semicolon();\n  return this.finishNode(node, \"ThrowStatement\")\n};\n\n// Reused empty array added for node fields that are always empty.\n\nvar empty = [];\n\npp$1.parseTryStatement = function(node) {\n  this.next();\n  node.block = this.parseBlock();\n  node.handler = null;\n  if (this.type === types._catch) {\n    var clause = this.startNode();\n    this.next();\n    if (this.eat(types.parenL)) {\n      clause.param = this.parseBindingAtom();\n      var simple = clause.param.type === \"Identifier\";\n      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);\n      this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);\n      this.expect(types.parenR);\n    } else {\n      if (this.options.ecmaVersion < 10) { this.unexpected(); }\n      clause.param = null;\n      this.enterScope(0);\n    }\n    clause.body = this.parseBlock(false);\n    this.exitScope();\n    node.handler = this.finishNode(clause, \"CatchClause\");\n  }\n  node.finalizer = this.eat(types._finally) ? this.parseBlock() : null;\n  if (!node.handler && !node.finalizer)\n    { this.raise(node.start, \"Missing catch or finally clause\"); }\n  return this.finishNode(node, \"TryStatement\")\n};\n\npp$1.parseVarStatement = function(node, kind) {\n  this.next();\n  this.parseVar(node, false, kind);\n  this.semicolon();\n  return this.finishNode(node, \"VariableDeclaration\")\n};\n\npp$1.parseWhileStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"while\");\n  this.labels.pop();\n  return this.finishNode(node, \"WhileStatement\")\n};\n\npp$1.parseWithStatement = function(node) {\n  if (this.strict) { this.raise(this.start, \"'with' in strict mode\"); }\n  this.next();\n  node.object = this.parseParenExpression();\n  node.body = this.parseStatement(\"with\");\n  return this.finishNode(node, \"WithStatement\")\n};\n\npp$1.parseEmptyStatement = function(node) {\n  this.next();\n  return this.finishNode(node, \"EmptyStatement\")\n};\n\npp$1.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)\n    {\n    var label = list[i$1];\n\n    if (label.name === maybeName)\n      { this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\");\n  } }\n  var kind = this.type.isLoop ? \"loop\" : this.type === types._switch ? \"switch\" : null;\n  for (var i = this.labels.length - 1; i >= 0; i--) {\n    var label$1 = this.labels[i];\n    if (label$1.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label$1.statementStart = this.start;\n      label$1.kind = kind;\n    } else { break }\n  }\n  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\");\n  this.labels.pop();\n  node.label = expr;\n  return this.finishNode(node, \"LabeledStatement\")\n};\n\npp$1.parseExpressionStatement = function(node, expr) {\n  node.expression = expr;\n  this.semicolon();\n  return this.finishNode(node, \"ExpressionStatement\")\n};\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp$1.parseBlock = function(createNewLexicalScope, node, exitStrict) {\n  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;\n  if ( node === void 0 ) node = this.startNode();\n\n  node.body = [];\n  this.expect(types.braceL);\n  if (createNewLexicalScope) { this.enterScope(0); }\n  while (this.type !== types.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  if (exitStrict) { this.strict = false; }\n  this.next();\n  if (createNewLexicalScope) { this.exitScope(); }\n  return this.finishNode(node, \"BlockStatement\")\n};\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp$1.parseFor = function(node, init) {\n  node.init = init;\n  this.expect(types.semi);\n  node.test = this.type === types.semi ? null : this.parseExpression();\n  this.expect(types.semi);\n  node.update = this.type === types.parenR ? null : this.parseExpression();\n  this.expect(types.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, \"ForStatement\")\n};\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp$1.parseForIn = function(node, init) {\n  var isForIn = this.type === types._in;\n  this.next();\n\n  if (\n    init.type === \"VariableDeclaration\" &&\n    init.declarations[0].init != null &&\n    (\n      !isForIn ||\n      this.options.ecmaVersion < 8 ||\n      this.strict ||\n      init.kind !== \"var\" ||\n      init.declarations[0].id.type !== \"Identifier\"\n    )\n  ) {\n    this.raise(\n      init.start,\n      ((isForIn ? \"for-in\" : \"for-of\") + \" loop variable declaration may not have an initializer\")\n    );\n  } else if (init.type === \"AssignmentPattern\") {\n    this.raise(init.start, \"Invalid left-hand side in for-loop\");\n  }\n  node.left = init;\n  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();\n  this.expect(types.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\")\n};\n\n// Parse a list of variable declarations.\n\npp$1.parseVar = function(node, isFor, kind) {\n  node.declarations = [];\n  node.kind = kind;\n  for (;;) {\n    var decl = this.startNode();\n    this.parseVarId(decl, kind);\n    if (this.eat(types.eq)) {\n      decl.init = this.parseMaybeAssign(isFor);\n    } else if (kind === \"const\" && !(this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected();\n    } else if (decl.id.type !== \"Identifier\" && !(isFor && (this.type === types._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\");\n    } else {\n      decl.init = null;\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n    if (!this.eat(types.comma)) { break }\n  }\n  return node\n};\n\npp$1.parseVarId = function(decl, kind) {\n  decl.id = this.parseBindingAtom();\n  this.checkLVal(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false);\n};\n\nvar FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp$1.parseFunction = function(node, statement, allowExpressionBody, isAsync) {\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === types.star && (statement & FUNC_HANGING_STATEMENT))\n      { this.unexpected(); }\n    node.generator = this.eat(types.star);\n  }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types.name ? null : this.parseIdent();\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      { this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }\n  }\n\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(node.async, node.generator));\n\n  if (!(statement & FUNC_STATEMENT))\n    { node.id = this.type === types.name ? this.parseIdent() : null; }\n\n  this.parseFunctionParams(node);\n  this.parseFunctionBody(node, allowExpressionBody, false);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n};\n\npp$1.parseFunctionParams = function(node) {\n  this.expect(types.parenL);\n  node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n};\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp$1.parseClass = function(node, isStatement) {\n  this.next();\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  var oldStrict = this.strict;\n  this.strict = true;\n\n  this.parseClassId(node, isStatement);\n  this.parseClassSuper(node);\n  var classBody = this.startNode();\n  var hadConstructor = false;\n  classBody.body = [];\n  this.expect(types.braceL);\n  while (this.type !== types.braceR) {\n    var element = this.parseClassElement(node.superClass !== null);\n    if (element) {\n      classBody.body.push(element);\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) { this.raise(element.start, \"Duplicate constructor in the same class\"); }\n        hadConstructor = true;\n      }\n    }\n  }\n  this.strict = oldStrict;\n  this.next();\n  node.body = this.finishNode(classBody, \"ClassBody\");\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n};\n\npp$1.parseClassElement = function(constructorAllowsSuper) {\n  var this$1 = this;\n\n  if (this.eat(types.semi)) { return null }\n\n  var method = this.startNode();\n  var tryContextual = function (k, noLineBreak) {\n    if ( noLineBreak === void 0 ) noLineBreak = false;\n\n    var start = this$1.start, startLoc = this$1.startLoc;\n    if (!this$1.eatContextual(k)) { return false }\n    if (this$1.type !== types.parenL && (!noLineBreak || !this$1.canInsertSemicolon())) { return true }\n    if (method.key) { this$1.unexpected(); }\n    method.computed = false;\n    method.key = this$1.startNodeAt(start, startLoc);\n    method.key.name = k;\n    this$1.finishNode(method.key, \"Identifier\");\n    return false\n  };\n\n  method.kind = \"method\";\n  method.static = tryContextual(\"static\");\n  var isGenerator = this.eat(types.star);\n  var isAsync = false;\n  if (!isGenerator) {\n    if (this.options.ecmaVersion >= 8 && tryContextual(\"async\", true)) {\n      isAsync = true;\n      isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);\n    } else if (tryContextual(\"get\")) {\n      method.kind = \"get\";\n    } else if (tryContextual(\"set\")) {\n      method.kind = \"set\";\n    }\n  }\n  if (!method.key) { this.parsePropertyName(method); }\n  var key = method.key;\n  var allowsDirectSuper = false;\n  if (!method.computed && !method.static && (key.type === \"Identifier\" && key.name === \"constructor\" ||\n      key.type === \"Literal\" && key.value === \"constructor\")) {\n    if (method.kind !== \"method\") { this.raise(key.start, \"Constructor can't have get/set modifier\"); }\n    if (isGenerator) { this.raise(key.start, \"Constructor can't be a generator\"); }\n    if (isAsync) { this.raise(key.start, \"Constructor can't be an async method\"); }\n    method.kind = \"constructor\";\n    allowsDirectSuper = constructorAllowsSuper;\n  } else if (method.static && key.type === \"Identifier\" && key.name === \"prototype\") {\n    this.raise(key.start, \"Classes may not have a static property named prototype\");\n  }\n  this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper);\n  if (method.kind === \"get\" && method.value.params.length !== 0)\n    { this.raiseRecoverable(method.value.start, \"getter should have no params\"); }\n  if (method.kind === \"set\" && method.value.params.length !== 1)\n    { this.raiseRecoverable(method.value.start, \"setter should have exactly one param\"); }\n  if (method.kind === \"set\" && method.value.params[0].type === \"RestElement\")\n    { this.raiseRecoverable(method.value.params[0].start, \"Setter cannot use rest params\"); }\n  return method\n};\n\npp$1.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);\n  return this.finishNode(method, \"MethodDefinition\")\n};\n\npp$1.parseClassId = function(node, isStatement) {\n  if (this.type === types.name) {\n    node.id = this.parseIdent();\n    if (isStatement)\n      { this.checkLVal(node.id, BIND_LEXICAL, false); }\n  } else {\n    if (isStatement === true)\n      { this.unexpected(); }\n    node.id = null;\n  }\n};\n\npp$1.parseClassSuper = function(node) {\n  node.superClass = this.eat(types._extends) ? this.parseExprSubscripts() : null;\n};\n\n// Parses module export declaration.\n\npp$1.parseExport = function(node, exports) {\n  this.next();\n  // export * from '...'\n  if (this.eat(types.star)) {\n    if (this.options.ecmaVersion >= 11) {\n      if (this.eatContextual(\"as\")) {\n        node.exported = this.parseIdent(true);\n        this.checkExport(exports, node.exported.name, this.lastTokStart);\n      } else {\n        node.exported = null;\n      }\n    }\n    this.expectContextual(\"from\");\n    if (this.type !== types.string) { this.unexpected(); }\n    node.source = this.parseExprAtom();\n    this.semicolon();\n    return this.finishNode(node, \"ExportAllDeclaration\")\n  }\n  if (this.eat(types._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart);\n    var isAsync;\n    if (this.type === types._function || (isAsync = this.isAsyncFunction())) {\n      var fNode = this.startNode();\n      this.next();\n      if (isAsync) { this.next(); }\n      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);\n    } else if (this.type === types._class) {\n      var cNode = this.startNode();\n      node.declaration = this.parseClass(cNode, \"nullableID\");\n    } else {\n      node.declaration = this.parseMaybeAssign();\n      this.semicolon();\n    }\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseStatement(null);\n    if (node.declaration.type === \"VariableDeclaration\")\n      { this.checkVariableExport(exports, node.declaration.declarations); }\n    else\n      { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }\n    node.specifiers = [];\n    node.source = null;\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null;\n    node.specifiers = this.parseExportSpecifiers(exports);\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== types.string) { this.unexpected(); }\n      node.source = this.parseExprAtom();\n    } else {\n      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {\n        // check for keywords used as local names\n        var spec = list[i];\n\n        this.checkUnreserved(spec.local);\n        // check if export is defined\n        this.checkLocalExport(spec.local);\n      }\n\n      node.source = null;\n    }\n    this.semicolon();\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n};\n\npp$1.checkExport = function(exports, name, pos) {\n  if (!exports) { return }\n  if (has(exports, name))\n    { this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\"); }\n  exports[name] = true;\n};\n\npp$1.checkPatternExport = function(exports, pat) {\n  var type = pat.type;\n  if (type === \"Identifier\")\n    { this.checkExport(exports, pat.name, pat.start); }\n  else if (type === \"ObjectPattern\")\n    { for (var i = 0, list = pat.properties; i < list.length; i += 1)\n      {\n        var prop = list[i];\n\n        this.checkPatternExport(exports, prop);\n      } }\n  else if (type === \"ArrayPattern\")\n    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {\n      var elt = list$1[i$1];\n\n        if (elt) { this.checkPatternExport(exports, elt); }\n    } }\n  else if (type === \"Property\")\n    { this.checkPatternExport(exports, pat.value); }\n  else if (type === \"AssignmentPattern\")\n    { this.checkPatternExport(exports, pat.left); }\n  else if (type === \"RestElement\")\n    { this.checkPatternExport(exports, pat.argument); }\n  else if (type === \"ParenthesizedExpression\")\n    { this.checkPatternExport(exports, pat.expression); }\n};\n\npp$1.checkVariableExport = function(exports, decls) {\n  if (!exports) { return }\n  for (var i = 0, list = decls; i < list.length; i += 1)\n    {\n    var decl = list[i];\n\n    this.checkPatternExport(exports, decl.id);\n  }\n};\n\npp$1.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n};\n\n// Parses a comma-separated list of module exports.\n\npp$1.parseExportSpecifiers = function(exports) {\n  var nodes = [], first = true;\n  // export { x, y as z } [from '...']\n  this.expect(types.braceL);\n  while (!this.eat(types.braceR)) {\n    if (!first) {\n      this.expect(types.comma);\n      if (this.afterTrailingComma(types.braceR)) { break }\n    } else { first = false; }\n\n    var node = this.startNode();\n    node.local = this.parseIdent(true);\n    node.exported = this.eatContextual(\"as\") ? this.parseIdent(true) : node.local;\n    this.checkExport(exports, node.exported.name, node.exported.start);\n    nodes.push(this.finishNode(node, \"ExportSpecifier\"));\n  }\n  return nodes\n};\n\n// Parses import declaration.\n\npp$1.parseImport = function(node) {\n  this.next();\n  // import '...'\n  if (this.type === types.string) {\n    node.specifiers = empty;\n    node.source = this.parseExprAtom();\n  } else {\n    node.specifiers = this.parseImportSpecifiers();\n    this.expectContextual(\"from\");\n    node.source = this.type === types.string ? this.parseExprAtom() : this.unexpected();\n  }\n  this.semicolon();\n  return this.finishNode(node, \"ImportDeclaration\")\n};\n\n// Parses a comma-separated list of module imports.\n\npp$1.parseImportSpecifiers = function() {\n  var nodes = [], first = true;\n  if (this.type === types.name) {\n    // import defaultObj, { x, y as z } from '...'\n    var node = this.startNode();\n    node.local = this.parseIdent();\n    this.checkLVal(node.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node, \"ImportDefaultSpecifier\"));\n    if (!this.eat(types.comma)) { return nodes }\n  }\n  if (this.type === types.star) {\n    var node$1 = this.startNode();\n    this.next();\n    this.expectContextual(\"as\");\n    node$1.local = this.parseIdent();\n    this.checkLVal(node$1.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node$1, \"ImportNamespaceSpecifier\"));\n    return nodes\n  }\n  this.expect(types.braceL);\n  while (!this.eat(types.braceR)) {\n    if (!first) {\n      this.expect(types.comma);\n      if (this.afterTrailingComma(types.braceR)) { break }\n    } else { first = false; }\n\n    var node$2 = this.startNode();\n    node$2.imported = this.parseIdent(true);\n    if (this.eatContextual(\"as\")) {\n      node$2.local = this.parseIdent();\n    } else {\n      this.checkUnreserved(node$2.imported);\n      node$2.local = node$2.imported;\n    }\n    this.checkLVal(node$2.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node$2, \"ImportSpecifier\"));\n  }\n  return nodes\n};\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp$1.adaptDirectivePrologue = function(statements) {\n  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1);\n  }\n};\npp$1.isDirectiveCandidate = function(statement) {\n  return (\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n};\n\nvar pp$2 = Parser.prototype;\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp$2.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        { this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\"); }\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      for (var i = 0, list = node.properties; i < list.length; i += 1) {\n        var prop = list[i];\n\n      this.toAssignable(prop, isBinding);\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\");\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") { this.raise(node.key.start, \"Object pattern can't contain getter or setter\"); }\n      this.toAssignable(node.value, isBinding);\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      this.toAssignableList(node.elements, isBinding);\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\";\n      this.toAssignable(node.argument, isBinding);\n      if (node.argument.type === \"AssignmentPattern\")\n        { this.raise(node.argument.start, \"Rest elements cannot have a default value\"); }\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") { this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\"); }\n      node.type = \"AssignmentPattern\";\n      delete node.operator;\n      this.toAssignable(node.left, isBinding);\n      // falls through to AssignmentPattern\n\n    case \"AssignmentPattern\":\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors);\n      break\n\n    case \"ChainExpression\":\n      this.raiseRecoverable(node.start, \"Optional chaining cannot appear in left-hand side\");\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) { break }\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\");\n    }\n  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n  return node\n};\n\n// Convert list of expression atoms to binding list.\n\npp$2.toAssignableList = function(exprList, isBinding) {\n  var end = exprList.length;\n  for (var i = 0; i < end; i++) {\n    var elt = exprList[i];\n    if (elt) { this.toAssignable(elt, isBinding); }\n  }\n  if (end) {\n    var last = exprList[end - 1];\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      { this.unexpected(last.argument.start); }\n  }\n  return exprList\n};\n\n// Parses spread element.\n\npp$2.parseSpread = function(refDestructuringErrors) {\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n  return this.finishNode(node, \"SpreadElement\")\n};\n\npp$2.parseRestBinding = function() {\n  var node = this.startNode();\n  this.next();\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== types.name)\n    { this.unexpected(); }\n\n  node.argument = this.parseBindingAtom();\n\n  return this.finishNode(node, \"RestElement\")\n};\n\n// Parses lvalue (assignable) atom.\n\npp$2.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case types.bracketL:\n      var node = this.startNode();\n      this.next();\n      node.elements = this.parseBindingList(types.bracketR, true, true);\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case types.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n};\n\npp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (first) { first = false; }\n    else { this.expect(types.comma); }\n    if (allowEmpty && this.type === types.comma) {\n      elts.push(null);\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === types.ellipsis) {\n      var rest = this.parseRestBinding();\n      this.parseBindingListItem(rest);\n      elts.push(rest);\n      if (this.type === types.comma) { this.raise(this.start, \"Comma is not permitted after the rest element\"); }\n      this.expect(close);\n      break\n    } else {\n      var elem = this.parseMaybeDefault(this.start, this.startLoc);\n      this.parseBindingListItem(elem);\n      elts.push(elem);\n    }\n  }\n  return elts\n};\n\npp$2.parseBindingListItem = function(param) {\n  return param\n};\n\n// Parses assignment pattern around given atom if possible.\n\npp$2.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom();\n  if (this.options.ecmaVersion < 6 || !this.eat(types.eq)) { return left }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.right = this.parseMaybeAssign();\n  return this.finishNode(node, \"AssignmentPattern\")\n};\n\n// Verify that a node is an lval — something that can be assigned\n// to.\n// bindingType can be either:\n// 'var' indicating that the lval creates a 'var' binding\n// 'let' indicating that the lval creates a lexical ('let' or 'const') binding\n// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references\n\npp$2.checkLVal = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"Identifier\":\n    if (bindingType === BIND_LEXICAL && expr.name === \"let\")\n      { this.raiseRecoverable(expr.start, \"let is disallowed as a lexically bound name\"); }\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      { this.raiseRecoverable(expr.start, (bindingType ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\"); }\n    if (checkClashes) {\n      if (has(checkClashes, expr.name))\n        { this.raiseRecoverable(expr.start, \"Argument name clash\"); }\n      checkClashes[expr.name] = true;\n    }\n    if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }\n    break\n\n  case \"ChainExpression\":\n    this.raiseRecoverable(expr.start, \"Optional chaining cannot appear in left-hand side\");\n    break\n\n  case \"MemberExpression\":\n    if (bindingType) { this.raiseRecoverable(expr.start, \"Binding member expression\"); }\n    break\n\n  case \"ObjectPattern\":\n    for (var i = 0, list = expr.properties; i < list.length; i += 1)\n      {\n    var prop = list[i];\n\n    this.checkLVal(prop, bindingType, checkClashes);\n  }\n    break\n\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLVal(expr.value, bindingType, checkClashes);\n    break\n\n  case \"ArrayPattern\":\n    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {\n      var elem = list$1[i$1];\n\n    if (elem) { this.checkLVal(elem, bindingType, checkClashes); }\n    }\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLVal(expr.left, bindingType, checkClashes);\n    break\n\n  case \"RestElement\":\n    this.checkLVal(expr.argument, bindingType, checkClashes);\n    break\n\n  case \"ParenthesizedExpression\":\n    this.checkLVal(expr.expression, bindingType, checkClashes);\n    break\n\n  default:\n    this.raise(expr.start, (bindingType ? \"Binding\" : \"Assigning to\") + \" rvalue\");\n  }\n};\n\n// A recursive descent parser operates by defining functions for all\n\nvar pp$3 = Parser.prototype;\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp$3.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    { return }\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    { return }\n  var key = prop.key;\n  var name;\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  var kind = prop.kind;\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors) {\n          if (refDestructuringErrors.doubleProto < 0)\n            { refDestructuringErrors.doubleProto = key.start; }\n          // Backwards-compat kludge. Can be removed in version 6.0\n        } else { this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\"); }\n      }\n      propHash.proto = true;\n    }\n    return\n  }\n  name = \"$\" + name;\n  var other = propHash[name];\n  if (other) {\n    var redefinition;\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set;\n    } else {\n      redefinition = other.init || other[kind];\n    }\n    if (redefinition)\n      { this.raiseRecoverable(key.start, \"Redefinition of property\"); }\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    };\n  }\n  other[kind] = true;\n};\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp$3.parseExpression = function(noIn, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);\n  if (this.type === types.comma) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.expressions = [expr];\n    while (this.eat(types.comma)) { node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors)); }\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n};\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) { return this.parseYield(noIn) }\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else { this.exprAllowed = false; }\n  }\n\n  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1;\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign;\n    oldTrailingComma = refDestructuringErrors.trailingComma;\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;\n  } else {\n    refDestructuringErrors = new DestructuringErrors;\n    ownDestructuringErrors = true;\n  }\n\n  var startPos = this.start, startLoc = this.startLoc;\n  if (this.type === types.parenL || this.type === types.name)\n    { this.potentialArrowAt = this.start; }\n  var left = this.parseMaybeConditional(noIn, refDestructuringErrors);\n  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }\n  if (this.type.isAssign) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.operator = this.value;\n    node.left = this.type === types.eq ? this.toAssignable(left, false, refDestructuringErrors) : left;\n    if (!ownDestructuringErrors) {\n      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;\n    }\n    if (refDestructuringErrors.shorthandAssign >= node.left.start)\n      { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly\n    this.checkLVal(left);\n    this.next();\n    node.right = this.parseMaybeAssign(noIn);\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }\n  }\n  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }\n  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }\n  return left\n};\n\n// Parse a ternary conditional (`?:`) operator.\n\npp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprOps(noIn, refDestructuringErrors);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  if (this.eat(types.question)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.test = expr;\n    node.consequent = this.parseMaybeAssign();\n    this.expect(types.colon);\n    node.alternate = this.parseMaybeAssign(noIn);\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n};\n\n// Start the precedence parser.\n\npp$3.parseExprOps = function(noIn, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeUnary(refDestructuringErrors, false);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)\n};\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {\n  var prec = this.type.binop;\n  if (prec != null && (!noIn || this.type !== types._in)) {\n    if (prec > minPrec) {\n      var logical = this.type === types.logicalOR || this.type === types.logicalAND;\n      var coalesce = this.type === types.coalesce;\n      if (coalesce) {\n        // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n        // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n        prec = types.logicalAND.binop;\n      }\n      var op = this.value;\n      this.next();\n      var startPos = this.start, startLoc = this.startLoc;\n      var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);\n      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);\n      if ((logical && this.type === types.coalesce) || (coalesce && (this.type === types.logicalOR || this.type === types.logicalAND))) {\n        this.raiseRecoverable(this.start, \"Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses\");\n      }\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)\n    }\n  }\n  return left\n};\n\npp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.operator = op;\n  node.right = right;\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n};\n\n// Parse unary operators, both prefix and postfix.\n\npp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {\n  var startPos = this.start, startLoc = this.startLoc, expr;\n  if (this.isContextual(\"await\") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {\n    expr = this.parseAwait();\n    sawUnary = true;\n  } else if (this.type.prefix) {\n    var node = this.startNode(), update = this.type === types.incDec;\n    node.operator = this.value;\n    node.prefix = true;\n    this.next();\n    node.argument = this.parseMaybeUnary(null, true);\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    if (update) { this.checkLVal(node.argument); }\n    else if (this.strict && node.operator === \"delete\" &&\n             node.argument.type === \"Identifier\")\n      { this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\"); }\n    else { sawUnary = true; }\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\");\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors);\n    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      var node$1 = this.startNodeAt(startPos, startLoc);\n      node$1.operator = this.value;\n      node$1.prefix = false;\n      node$1.argument = expr;\n      this.checkLVal(expr);\n      this.next();\n      expr = this.finishNode(node$1, \"UpdateExpression\");\n    }\n  }\n\n  if (!sawUnary && this.eat(types.starstar))\n    { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), \"**\", false) }\n  else\n    { return expr }\n};\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp$3.parseExprSubscripts = function(refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprAtom(refDestructuringErrors);\n  if (expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\")\n    { return expr }\n  var result = this.parseSubscripts(expr, startPos, startLoc);\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }\n    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }\n  }\n  return result\n};\n\npp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) {\n  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&\n      this.potentialArrowAt === base.start;\n  var optionalChained = false;\n\n  while (true) {\n    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained);\n\n    if (element.optional) { optionalChained = true; }\n    if (element === base || element.type === \"ArrowFunctionExpression\") {\n      if (optionalChained) {\n        var chainNode = this.startNodeAt(startPos, startLoc);\n        chainNode.expression = element;\n        element = this.finishNode(chainNode, \"ChainExpression\");\n      }\n      return element\n    }\n\n    base = element;\n  }\n};\n\npp$3.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained) {\n  var optionalSupported = this.options.ecmaVersion >= 11;\n  var optional = optionalSupported && this.eat(types.questionDot);\n  if (noCalls && optional) { this.raise(this.lastTokStart, \"Optional chaining cannot appear in the callee of new expressions\"); }\n\n  var computed = this.eat(types.bracketL);\n  if (computed || (optional && this.type !== types.parenL && this.type !== types.backQuote) || this.eat(types.dot)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.object = base;\n    node.property = computed ? this.parseExpression() : this.parseIdent(this.options.allowReserved !== \"never\");\n    node.computed = !!computed;\n    if (computed) { this.expect(types.bracketR); }\n    if (optionalSupported) {\n      node.optional = optional;\n    }\n    base = this.finishNode(node, \"MemberExpression\");\n  } else if (!noCalls && this.eat(types.parenL)) {\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    var exprList = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);\n    if (maybeAsyncArrow && !optional && !this.canInsertSemicolon() && this.eat(types.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      if (this.awaitIdentPos > 0)\n        { this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\"); }\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      this.awaitIdentPos = oldAwaitIdentPos;\n      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;\n    var node$1 = this.startNodeAt(startPos, startLoc);\n    node$1.callee = base;\n    node$1.arguments = exprList;\n    if (optionalSupported) {\n      node$1.optional = optional;\n    }\n    base = this.finishNode(node$1, \"CallExpression\");\n  } else if (this.type === types.backQuote) {\n    if (optional || optionalChained) {\n      this.raise(this.start, \"Optional chaining cannot appear in the tag of tagged template expressions\");\n    }\n    var node$2 = this.startNodeAt(startPos, startLoc);\n    node$2.tag = base;\n    node$2.quasi = this.parseTemplate({isTagged: true});\n    base = this.finishNode(node$2, \"TaggedTemplateExpression\");\n  }\n  return base\n};\n\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp$3.parseExprAtom = function(refDestructuringErrors) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === types.slash) { this.readRegexp(); }\n\n  var node, canBeArrow = this.potentialArrowAt === this.start;\n  switch (this.type) {\n  case types._super:\n    if (!this.allowSuper)\n      { this.raise(this.start, \"'super' keyword outside a method\"); }\n    node = this.startNode();\n    this.next();\n    if (this.type === types.parenL && !this.allowDirectSuper)\n      { this.raise(node.start, \"super() call outside constructor of a subclass\"); }\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super ( Arguments )\n    if (this.type !== types.dot && this.type !== types.bracketL && this.type !== types.parenL)\n      { this.unexpected(); }\n    return this.finishNode(node, \"Super\")\n\n  case types._this:\n    node = this.startNode();\n    this.next();\n    return this.finishNode(node, \"ThisExpression\")\n\n  case types.name:\n    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;\n    var id = this.parseIdent(false);\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(types._function))\n      { return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true) }\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(types.arrow))\n        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false) }\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === types.name && !containsEsc) {\n        id = this.parseIdent(false);\n        if (this.canInsertSemicolon() || !this.eat(types.arrow))\n          { this.unexpected(); }\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)\n      }\n    }\n    return id\n\n  case types.regexp:\n    var value = this.value;\n    node = this.parseLiteral(value.value);\n    node.regex = {pattern: value.pattern, flags: value.flags};\n    return node\n\n  case types.num: case types.string:\n    return this.parseLiteral(this.value)\n\n  case types._null: case types._true: case types._false:\n    node = this.startNode();\n    node.value = this.type === types._null ? null : this.type === types._true;\n    node.raw = this.type.keyword;\n    this.next();\n    return this.finishNode(node, \"Literal\")\n\n  case types.parenL:\n    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow);\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        { refDestructuringErrors.parenthesizedAssign = start; }\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        { refDestructuringErrors.parenthesizedBind = start; }\n    }\n    return expr\n\n  case types.bracketL:\n    node = this.startNode();\n    this.next();\n    node.elements = this.parseExprList(types.bracketR, true, true, refDestructuringErrors);\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case types.braceL:\n    return this.parseObj(false, refDestructuringErrors)\n\n  case types._function:\n    node = this.startNode();\n    this.next();\n    return this.parseFunction(node, 0)\n\n  case types._class:\n    return this.parseClass(this.startNode(), false)\n\n  case types._new:\n    return this.parseNew()\n\n  case types.backQuote:\n    return this.parseTemplate()\n\n  case types._import:\n    if (this.options.ecmaVersion >= 11) {\n      return this.parseExprImport()\n    } else {\n      return this.unexpected()\n    }\n\n  default:\n    this.unexpected();\n  }\n};\n\npp$3.parseExprImport = function() {\n  var node = this.startNode();\n\n  // Consume `import` as an identifier for `import.meta`.\n  // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword import\"); }\n  var meta = this.parseIdent(true);\n\n  switch (this.type) {\n  case types.parenL:\n    return this.parseDynamicImport(node)\n  case types.dot:\n    node.meta = meta;\n    return this.parseImportMeta(node)\n  default:\n    this.unexpected();\n  }\n};\n\npp$3.parseDynamicImport = function(node) {\n  this.next(); // skip `(`\n\n  // Parse node.source.\n  node.source = this.parseMaybeAssign();\n\n  // Verify ending.\n  if (!this.eat(types.parenR)) {\n    var errorPos = this.start;\n    if (this.eat(types.comma) && this.eat(types.parenR)) {\n      this.raiseRecoverable(errorPos, \"Trailing comma is not allowed in import()\");\n    } else {\n      this.unexpected(errorPos);\n    }\n  }\n\n  return this.finishNode(node, \"ImportExpression\")\n};\n\npp$3.parseImportMeta = function(node) {\n  this.next(); // skip `.`\n\n  var containsEsc = this.containsEsc;\n  node.property = this.parseIdent(true);\n\n  if (node.property.name !== \"meta\")\n    { this.raiseRecoverable(node.property.start, \"The only valid meta property for import is 'import.meta'\"); }\n  if (containsEsc)\n    { this.raiseRecoverable(node.start, \"'import.meta' must not contain escaped characters\"); }\n  if (this.options.sourceType !== \"module\")\n    { this.raiseRecoverable(node.start, \"Cannot use 'import.meta' outside a module\"); }\n\n  return this.finishNode(node, \"MetaProperty\")\n};\n\npp$3.parseLiteral = function(value) {\n  var node = this.startNode();\n  node.value = value;\n  node.raw = this.input.slice(this.start, this.end);\n  if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1).replace(/_/g, \"\"); }\n  this.next();\n  return this.finishNode(node, \"Literal\")\n};\n\npp$3.parseParenExpression = function() {\n  this.expect(types.parenL);\n  var val = this.parseExpression();\n  this.expect(types.parenR);\n  return val\n};\n\npp$3.parseParenAndDistinguishExpression = function(canBeArrow) {\n  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;\n  if (this.options.ecmaVersion >= 6) {\n    this.next();\n\n    var innerStartPos = this.start, innerStartLoc = this.startLoc;\n    var exprList = [], first = true, lastIsComma = false;\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== types.parenR) {\n      first ? first = false : this.expect(types.comma);\n      if (allowTrailingComma && this.afterTrailingComma(types.parenR, true)) {\n        lastIsComma = true;\n        break\n      } else if (this.type === types.ellipsis) {\n        spreadStart = this.start;\n        exprList.push(this.parseParenItem(this.parseRestBinding()));\n        if (this.type === types.comma) { this.raise(this.start, \"Comma is not permitted after the rest element\"); }\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));\n      }\n    }\n    var innerEndPos = this.start, innerEndLoc = this.startLoc;\n    this.expect(types.parenR);\n\n    if (canBeArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      return this.parseParenArrowList(startPos, startLoc, exprList)\n    }\n\n    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }\n    if (spreadStart) { this.unexpected(spreadStart); }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc);\n      val.expressions = exprList;\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n    } else {\n      val = exprList[0];\n    }\n  } else {\n    val = this.parseParenExpression();\n  }\n\n  if (this.options.preserveParens) {\n    var par = this.startNodeAt(startPos, startLoc);\n    par.expression = val;\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n};\n\npp$3.parseParenItem = function(item) {\n  return item\n};\n\npp$3.parseParenArrowList = function(startPos, startLoc, exprList) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)\n};\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nvar empty$1 = [];\n\npp$3.parseNew = function() {\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword new\"); }\n  var node = this.startNode();\n  var meta = this.parseIdent(true);\n  if (this.options.ecmaVersion >= 6 && this.eat(types.dot)) {\n    node.meta = meta;\n    var containsEsc = this.containsEsc;\n    node.property = this.parseIdent(true);\n    if (node.property.name !== \"target\")\n      { this.raiseRecoverable(node.property.start, \"The only valid meta property for new is 'new.target'\"); }\n    if (containsEsc)\n      { this.raiseRecoverable(node.start, \"'new.target' must not contain escaped characters\"); }\n    if (!this.inNonArrowFunction())\n      { this.raiseRecoverable(node.start, \"'new.target' can only be used in functions\"); }\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types._import;\n  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);\n  if (isImport && node.callee.type === \"ImportExpression\") {\n    this.raise(startPos, \"Cannot use new with import()\");\n  }\n  if (this.eat(types.parenL)) { node.arguments = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false); }\n  else { node.arguments = empty$1; }\n  return this.finishNode(node, \"NewExpression\")\n};\n\n// Parse template expression.\n\npp$3.parseTemplateElement = function(ref) {\n  var isTagged = ref.isTagged;\n\n  var elem = this.startNode();\n  if (this.type === types.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\");\n    }\n    elem.value = {\n      raw: this.value,\n      cooked: null\n    };\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    };\n  }\n  this.next();\n  elem.tail = this.type === types.backQuote;\n  return this.finishNode(elem, \"TemplateElement\")\n};\n\npp$3.parseTemplate = function(ref) {\n  if ( ref === void 0 ) ref = {};\n  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;\n\n  var node = this.startNode();\n  this.next();\n  node.expressions = [];\n  var curElt = this.parseTemplateElement({isTagged: isTagged});\n  node.quasis = [curElt];\n  while (!curElt.tail) {\n    if (this.type === types.eof) { this.raise(this.pos, \"Unterminated template literal\"); }\n    this.expect(types.dollarBraceL);\n    node.expressions.push(this.parseExpression());\n    this.expect(types.braceR);\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));\n  }\n  this.next();\n  return this.finishNode(node, \"TemplateLiteral\")\n};\n\npp$3.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === types.name || this.type === types.num || this.type === types.string || this.type === types.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\n// Parse an object literal or binding pattern.\n\npp$3.parseObj = function(isPattern, refDestructuringErrors) {\n  var node = this.startNode(), first = true, propHash = {};\n  node.properties = [];\n  this.next();\n  while (!this.eat(types.braceR)) {\n    if (!first) {\n      this.expect(types.comma);\n      if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types.braceR)) { break }\n    } else { first = false; }\n\n    var prop = this.parseProperty(isPattern, refDestructuringErrors);\n    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }\n    node.properties.push(prop);\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n};\n\npp$3.parseProperty = function(isPattern, refDestructuringErrors) {\n  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;\n  if (this.options.ecmaVersion >= 9 && this.eat(types.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false);\n      if (this.type === types.comma) {\n        this.raise(this.start, \"Comma is not permitted after the rest element\");\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // To disallow parenthesized identifier via `this.toAssignable()`.\n    if (this.type === types.parenL && refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0) {\n        refDestructuringErrors.parenthesizedAssign = this.start;\n      }\n      if (refDestructuringErrors.parenthesizedBind < 0) {\n        refDestructuringErrors.parenthesizedBind = this.start;\n      }\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === types.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start;\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false;\n    prop.shorthand = false;\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start;\n      startLoc = this.startLoc;\n    }\n    if (!isPattern)\n      { isGenerator = this.eat(types.star); }\n  }\n  var containsEsc = this.containsEsc;\n  this.parsePropertyName(prop);\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true;\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);\n    this.parsePropertyName(prop, refDestructuringErrors);\n  } else {\n    isAsync = false;\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);\n  return this.finishNode(prop, \"Property\")\n};\n\npp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === types.colon)\n    { this.unexpected(); }\n\n  if (this.eat(types.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);\n    prop.kind = \"init\";\n  } else if (this.options.ecmaVersion >= 6 && this.type === types.parenL) {\n    if (isPattern) { this.unexpected(); }\n    prop.kind = \"init\";\n    prop.method = true;\n    prop.value = this.parseMethod(isGenerator, isAsync);\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== types.comma && this.type !== types.braceR && this.type !== types.eq)) {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    prop.kind = prop.key.name;\n    this.parsePropertyName(prop);\n    prop.value = this.parseMethod(false);\n    var paramCount = prop.kind === \"get\" ? 0 : 1;\n    if (prop.value.params.length !== paramCount) {\n      var start = prop.value.start;\n      if (prop.kind === \"get\")\n        { this.raiseRecoverable(start, \"getter should have no params\"); }\n      else\n        { this.raiseRecoverable(start, \"setter should have exactly one param\"); }\n    } else {\n      if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n        { this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\"); }\n    }\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.checkUnreserved(prop.key);\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = startPos; }\n    prop.kind = \"init\";\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);\n    } else if (this.type === types.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        { refDestructuringErrors.shorthandAssign = this.start; }\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);\n    } else {\n      prop.value = prop.key;\n    }\n    prop.shorthand = true;\n  } else { this.unexpected(); }\n};\n\npp$3.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(types.bracketL)) {\n      prop.computed = true;\n      prop.key = this.parseMaybeAssign();\n      this.expect(types.bracketR);\n      return prop.key\n    } else {\n      prop.computed = false;\n    }\n  }\n  return prop.key = this.type === types.num || this.type === types.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\")\n};\n\n// Initialize empty function node.\n\npp$3.initFunction = function(node) {\n  node.id = null;\n  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }\n  if (this.options.ecmaVersion >= 8) { node.async = false; }\n};\n\n// Parse object or class method.\n\npp$3.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 6)\n    { node.generator = isGenerator; }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));\n\n  this.expect(types.parenL);\n  node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n  this.parseFunctionBody(node, false, true);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"FunctionExpression\")\n};\n\n// Parse arrow function expression with given parameters.\n\npp$3.parseArrowExpression = function(node, params, isAsync) {\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n\n  node.params = this.toAssignableList(params, true);\n  this.parseFunctionBody(node, true, false);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n};\n\n// Parse function body and check parameters.\n\npp$3.parseFunctionBody = function(node, isArrowFunction, isMethod) {\n  var isExpression = isArrowFunction && this.type !== types.braceL;\n  var oldStrict = this.strict, useStrict = false;\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign();\n    node.expression = true;\n    this.checkParams(node, false);\n  } else {\n    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end);\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        { this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\"); }\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    var oldLabels = this.labels;\n    this.labels = [];\n    if (useStrict) { this.strict = true; }\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));\n    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n    if (this.strict && node.id) { this.checkLVal(node.id, BIND_OUTSIDE); }\n    node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);\n    node.expression = false;\n    this.adaptDirectivePrologue(node.body.body);\n    this.labels = oldLabels;\n  }\n  this.exitScope();\n};\n\npp$3.isSimpleParamList = function(params) {\n  for (var i = 0, list = params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    if (param.type !== \"Identifier\") { return false\n  } }\n  return true\n};\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp$3.checkParams = function(node, allowDuplicates) {\n  var nameHash = {};\n  for (var i = 0, list = node.params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash);\n  }\n};\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(types.comma);\n      if (allowTrailingComma && this.afterTrailingComma(close)) { break }\n    } else { first = false; }\n\n    var elt = (void 0);\n    if (allowEmpty && this.type === types.comma)\n      { elt = null; }\n    else if (this.type === types.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors);\n      if (refDestructuringErrors && this.type === types.comma && refDestructuringErrors.trailingComma < 0)\n        { refDestructuringErrors.trailingComma = this.start; }\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors);\n    }\n    elts.push(elt);\n  }\n  return elts\n};\n\npp$3.checkUnreserved = function(ref) {\n  var start = ref.start;\n  var end = ref.end;\n  var name = ref.name;\n\n  if (this.inGenerator && name === \"yield\")\n    { this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\"); }\n  if (this.inAsync && name === \"await\")\n    { this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\"); }\n  if (this.keywords.test(name))\n    { this.raise(start, (\"Unexpected keyword '\" + name + \"'\")); }\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) { return }\n  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      { this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\"); }\n    this.raiseRecoverable(start, (\"The keyword '\" + name + \"' is reserved\"));\n  }\n};\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp$3.parseIdent = function(liberal, isBinding) {\n  var node = this.startNode();\n  if (this.type === types.name) {\n    node.name = this.value;\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword;\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop();\n    }\n  } else {\n    this.unexpected();\n  }\n  this.next(!!liberal);\n  this.finishNode(node, \"Identifier\");\n  if (!liberal) {\n    this.checkUnreserved(node);\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = node.start; }\n  }\n  return node\n};\n\n// Parses yield expression inside generator.\n\npp$3.parseYield = function(noIn) {\n  if (!this.yieldPos) { this.yieldPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  if (this.type === types.semi || this.canInsertSemicolon() || (this.type !== types.star && !this.type.startsExpr)) {\n    node.delegate = false;\n    node.argument = null;\n  } else {\n    node.delegate = this.eat(types.star);\n    node.argument = this.parseMaybeAssign(noIn);\n  }\n  return this.finishNode(node, \"YieldExpression\")\n};\n\npp$3.parseAwait = function() {\n  if (!this.awaitPos) { this.awaitPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeUnary(null, false);\n  return this.finishNode(node, \"AwaitExpression\")\n};\n\nvar pp$4 = Parser.prototype;\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp$4.raise = function(pos, message) {\n  var loc = getLineInfo(this.input, pos);\n  message += \" (\" + loc.line + \":\" + loc.column + \")\";\n  var err = new SyntaxError(message);\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;\n  throw err\n};\n\npp$4.raiseRecoverable = pp$4.raise;\n\npp$4.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n};\n\nvar pp$5 = Parser.prototype;\n\nvar Scope = function Scope(flags) {\n  this.flags = flags;\n  // A list of var-declared names in the current lexical scope\n  this.var = [];\n  // A list of lexically-declared names in the current lexical scope\n  this.lexical = [];\n  // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n  this.functions = [];\n};\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp$5.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags));\n};\n\npp$5.exitScope = function() {\n  this.scopeStack.pop();\n};\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp$5.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n};\n\npp$5.declareName = function(name, bindingType, pos) {\n  var redeclared = false;\n  if (bindingType === BIND_LEXICAL) {\n    var scope = this.currentScope();\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;\n    scope.lexical.push(name);\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      { delete this.undefinedExports[name]; }\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    var scope$1 = this.currentScope();\n    scope$1.lexical.push(name);\n  } else if (bindingType === BIND_FUNCTION) {\n    var scope$2 = this.currentScope();\n    if (this.treatFunctionsAsVar)\n      { redeclared = scope$2.lexical.indexOf(name) > -1; }\n    else\n      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }\n    scope$2.functions.push(name);\n  } else {\n    for (var i = this.scopeStack.length - 1; i >= 0; --i) {\n      var scope$3 = this.scopeStack[i];\n      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {\n        redeclared = true;\n        break\n      }\n      scope$3.var.push(name);\n      if (this.inModule && (scope$3.flags & SCOPE_TOP))\n        { delete this.undefinedExports[name]; }\n      if (scope$3.flags & SCOPE_VAR) { break }\n    }\n  }\n  if (redeclared) { this.raiseRecoverable(pos, (\"Identifier '\" + name + \"' has already been declared\")); }\n};\n\npp$5.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id;\n  }\n};\n\npp$5.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n};\n\npp$5.currentVarScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & SCOPE_VAR) { return scope }\n  }\n};\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp$5.currentThisScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }\n  }\n};\n\nvar Node = function Node(parser, pos, loc) {\n  this.type = \"\";\n  this.start = pos;\n  this.end = 0;\n  if (parser.options.locations)\n    { this.loc = new SourceLocation(parser, loc); }\n  if (parser.options.directSourceFile)\n    { this.sourceFile = parser.options.directSourceFile; }\n  if (parser.options.ranges)\n    { this.range = [pos, 0]; }\n};\n\n// Start an AST node, attaching a start offset.\n\nvar pp$6 = Parser.prototype;\n\npp$6.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n};\n\npp$6.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n};\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type;\n  node.end = pos;\n  if (this.options.locations)\n    { node.loc.end = loc; }\n  if (this.options.ranges)\n    { node.range[1] = pos; }\n  return node\n}\n\npp$6.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n};\n\n// Finish node at given position\n\npp$6.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n};\n\n// The algorithm used to determine whether a regexp can appear at a\n\nvar TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {\n  this.token = token;\n  this.isExpr = !!isExpr;\n  this.preserveSpace = !!preserveSpace;\n  this.override = override;\n  this.generator = !!generator;\n};\n\nvar types$1 = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, function (p) { return p.tryReadTemplateToken(); }),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n};\n\nvar pp$7 = Parser.prototype;\n\npp$7.initialContext = function() {\n  return [types$1.b_stat]\n};\n\npp$7.braceIsBlock = function(prevType) {\n  var parent = this.curContext();\n  if (parent === types$1.f_expr || parent === types$1.f_stat)\n    { return true }\n  if (prevType === types.colon && (parent === types$1.b_stat || parent === types$1.b_expr))\n    { return !parent.isExpr }\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === types._return || prevType === types.name && this.exprAllowed)\n    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }\n  if (prevType === types._else || prevType === types.semi || prevType === types.eof || prevType === types.parenR || prevType === types.arrow)\n    { return true }\n  if (prevType === types.braceL)\n    { return parent === types$1.b_stat }\n  if (prevType === types._var || prevType === types._const || prevType === types.name)\n    { return false }\n  return !this.exprAllowed\n};\n\npp$7.inGeneratorContext = function() {\n  for (var i = this.context.length - 1; i >= 1; i--) {\n    var context = this.context[i];\n    if (context.token === \"function\")\n      { return context.generator }\n  }\n  return false\n};\n\npp$7.updateContext = function(prevType) {\n  var update, type = this.type;\n  if (type.keyword && prevType === types.dot)\n    { this.exprAllowed = false; }\n  else if (update = type.updateContext)\n    { update.call(this, prevType); }\n  else\n    { this.exprAllowed = type.beforeExpr; }\n};\n\n// Token-specific context update code\n\ntypes.parenR.updateContext = types.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true;\n    return\n  }\n  var out = this.context.pop();\n  if (out === types$1.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop();\n  }\n  this.exprAllowed = !out.isExpr;\n};\n\ntypes.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types$1.b_stat : types$1.b_expr);\n  this.exprAllowed = true;\n};\n\ntypes.dollarBraceL.updateContext = function() {\n  this.context.push(types$1.b_tmpl);\n  this.exprAllowed = true;\n};\n\ntypes.parenL.updateContext = function(prevType) {\n  var statementParens = prevType === types._if || prevType === types._for || prevType === types._with || prevType === types._while;\n  this.context.push(statementParens ? types$1.p_stat : types$1.p_expr);\n  this.exprAllowed = true;\n};\n\ntypes.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n};\n\ntypes._function.updateContext = types._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== types.semi && prevType !== types._else &&\n      !(prevType === types._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === types.colon || prevType === types.braceL) && this.curContext() === types$1.b_stat))\n    { this.context.push(types$1.f_expr); }\n  else\n    { this.context.push(types$1.f_stat); }\n  this.exprAllowed = false;\n};\n\ntypes.backQuote.updateContext = function() {\n  if (this.curContext() === types$1.q_tmpl)\n    { this.context.pop(); }\n  else\n    { this.context.push(types$1.q_tmpl); }\n  this.exprAllowed = false;\n};\n\ntypes.star.updateContext = function(prevType) {\n  if (prevType === types._function) {\n    var index = this.context.length - 1;\n    if (this.context[index] === types$1.f_expr)\n      { this.context[index] = types$1.f_expr_gen; }\n    else\n      { this.context[index] = types$1.f_gen; }\n  }\n  this.exprAllowed = true;\n};\n\ntypes.name.updateContext = function(prevType) {\n  var allowed = false;\n  if (this.options.ecmaVersion >= 6 && prevType !== types.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      { allowed = true; }\n  }\n  this.exprAllowed = allowed;\n};\n\n// This file contains Unicode properties extracted from the ECMAScript\n// specification. The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nvar ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\";\nvar ecma10BinaryProperties = ecma9BinaryProperties + \" Extended_Pictographic\";\nvar ecma11BinaryProperties = ecma10BinaryProperties;\nvar unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma10BinaryProperties,\n  11: ecma11BinaryProperties\n};\n\n// #table-unicode-general-category-values\nvar unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\";\n\n// #table-unicode-script-values\nvar ecma9ScriptValues = \"Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\";\nvar ecma10ScriptValues = ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\";\nvar ecma11ScriptValues = ecma10ScriptValues + \" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho\";\nvar unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma10ScriptValues,\n  11: ecma11ScriptValues\n};\n\nvar data = {};\nfunction buildUnicodeData(ecmaVersion) {\n  var d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  };\n  d.nonBinary.Script_Extensions = d.nonBinary.Script;\n\n  d.nonBinary.gc = d.nonBinary.General_Category;\n  d.nonBinary.sc = d.nonBinary.Script;\n  d.nonBinary.scx = d.nonBinary.Script_Extensions;\n}\nbuildUnicodeData(9);\nbuildUnicodeData(10);\nbuildUnicodeData(11);\n\nvar pp$8 = Parser.prototype;\n\nvar RegExpValidationState = function RegExpValidationState(parser) {\n  this.parser = parser;\n  this.validFlags = \"gim\" + (parser.options.ecmaVersion >= 6 ? \"uy\" : \"\") + (parser.options.ecmaVersion >= 9 ? \"s\" : \"\");\n  this.unicodeProperties = data[parser.options.ecmaVersion >= 11 ? 11 : parser.options.ecmaVersion];\n  this.source = \"\";\n  this.flags = \"\";\n  this.start = 0;\n  this.switchU = false;\n  this.switchN = false;\n  this.pos = 0;\n  this.lastIntValue = 0;\n  this.lastStringValue = \"\";\n  this.lastAssertionIsQuantifiable = false;\n  this.numCapturingParens = 0;\n  this.maxBackReference = 0;\n  this.groupNames = [];\n  this.backReferenceNames = [];\n};\n\nRegExpValidationState.prototype.reset = function reset (start, pattern, flags) {\n  var unicode = flags.indexOf(\"u\") !== -1;\n  this.start = start | 0;\n  this.source = pattern + \"\";\n  this.flags = flags;\n  this.switchU = unicode && this.parser.options.ecmaVersion >= 6;\n  this.switchN = unicode && this.parser.options.ecmaVersion >= 9;\n};\n\nRegExpValidationState.prototype.raise = function raise (message) {\n  this.parser.raiseRecoverable(this.start, (\"Invalid regular expression: /\" + (this.source) + \"/: \" + message));\n};\n\n// If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\nRegExpValidationState.prototype.at = function at (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return -1\n  }\n  var c = s.charCodeAt(i);\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n    return c\n  }\n  var next = s.charCodeAt(i + 1);\n  return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c\n};\n\nRegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return l\n  }\n  var c = s.charCodeAt(i), next;\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||\n      (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {\n    return i + 1\n  }\n  return i + 2\n};\n\nRegExpValidationState.prototype.current = function current (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.pos, forceU)\n};\n\nRegExpValidationState.prototype.lookahead = function lookahead (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.nextIndex(this.pos, forceU), forceU)\n};\n\nRegExpValidationState.prototype.advance = function advance (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  this.pos = this.nextIndex(this.pos, forceU);\n};\n\nRegExpValidationState.prototype.eat = function eat (ch, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  if (this.current(forceU) === ch) {\n    this.advance(forceU);\n    return true\n  }\n  return false\n};\n\nfunction codePointToString(ch) {\n  if (ch <= 0xFFFF) { return String.fromCharCode(ch) }\n  ch -= 0x10000;\n  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)\n}\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$8.validateRegExpFlags = function(state) {\n  var validFlags = state.validFlags;\n  var flags = state.flags;\n\n  for (var i = 0; i < flags.length; i++) {\n    var flag = flags.charAt(i);\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\");\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\");\n    }\n  }\n};\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$8.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state);\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {\n    state.switchN = true;\n    this.regexp_pattern(state);\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp$8.regexp_pattern = function(state) {\n  state.pos = 0;\n  state.lastIntValue = 0;\n  state.lastStringValue = \"\";\n  state.lastAssertionIsQuantifiable = false;\n  state.numCapturingParens = 0;\n  state.maxBackReference = 0;\n  state.groupNames.length = 0;\n  state.backReferenceNames.length = 0;\n\n  this.regexp_disjunction(state);\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\");\n    }\n    if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\");\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\");\n  }\n  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {\n    var name = list[i];\n\n    if (state.groupNames.indexOf(name) === -1) {\n      state.raise(\"Invalid named capture referenced\");\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp$8.regexp_disjunction = function(state) {\n  this.regexp_alternative(state);\n  while (state.eat(0x7C /* | */)) {\n    this.regexp_alternative(state);\n  }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\");\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp$8.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state))\n    { }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp$8.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\");\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state);\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp$8.regexp_eatAssertion = function(state) {\n  var start = state.pos;\n  state.lastAssertionIsQuantifiable = false;\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    var lookbehind = false;\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */);\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state);\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\");\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind;\n      return true\n    }\n  }\n\n  state.pos = start;\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp$8.regexp_eatQuantifier = function(state, noError) {\n  if ( noError === void 0 ) noError = false;\n\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */);\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp$8.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n};\npp$8.regexp_eatBracedQuantifier = function(state, noError) {\n  var start = state.pos;\n  if (state.eat(0x7B /* { */)) {\n    var min = 0, max = -1;\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue;\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue;\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\");\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp$8.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n};\npp$8.regexp_eatReverseSolidusAtomEscape = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$8.regexp_eatUncapturingGroup = function(state) {\n  var start = state.pos;\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {\n      this.regexp_disjunction(state);\n      if (state.eat(0x29 /* ) */)) {\n        return true\n      }\n      state.raise(\"Unterminated group\");\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$8.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state);\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\");\n    }\n    this.regexp_disjunction(state);\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1;\n      return true\n    }\n    state.raise(\"Unterminated group\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp$8.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp$8.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp$8.regexp_eatSyntaxCharacter = function(state) {\n  var ch = state.current();\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp$8.regexp_eatPatternCharacters = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance();\n  }\n  return state.pos !== start\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp$8.regexp_eatExtendedPatternCharacter = function(state) {\n  var ch = state.current();\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// GroupSpecifier ::\n//   [empty]\n//   `?` GroupName\npp$8.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (this.regexp_eatGroupName(state)) {\n      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {\n        state.raise(\"Duplicate capture group name\");\n      }\n      state.groupNames.push(state.lastStringValue);\n      return\n    }\n    state.raise(\"Invalid group\");\n  }\n};\n\n// GroupName ::\n//   `<` RegExpIdentifierName `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$8.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\";\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\");\n  }\n  return false\n};\n\n// RegExpIdentifierName ::\n//   RegExpIdentifierStart\n//   RegExpIdentifierName RegExpIdentifierPart\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$8.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\";\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString(state.lastIntValue);\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString(state.lastIntValue);\n    }\n    return true\n  }\n  return false\n};\n\n// RegExpIdentifierStart ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\npp$8.regexp_eatRegExpIdentifierStart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\n//   <ZWNJ>\n//   <ZWJ>\npp$8.regexp_eatRegExpIdentifierPart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp$8.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.raise(\"Invalid escape\");\n  }\n  return false\n};\npp$8.regexp_eatBackReference = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatDecimalEscape(state)) {\n    var n = state.lastIntValue;\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n;\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$8.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue);\n      return true\n    }\n    state.raise(\"Invalid named reference\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp$8.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n};\npp$8.regexp_eatCControlLetter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$8.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp$8.regexp_eatControlEscape = function(state) {\n  var ch = state.current();\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09; /* \\t */\n    state.advance();\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A; /* \\n */\n    state.advance();\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B; /* \\v */\n    state.advance();\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C; /* \\f */\n    state.advance();\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D; /* \\r */\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp$8.regexp_eatControlLetter = function(state) {\n  var ch = state.current();\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp$8.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {\n  if ( forceU === void 0 ) forceU = false;\n\n  var start = state.pos;\n  var switchU = forceU || state.switchU;\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      var lead = state.lastIntValue;\n      if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        var leadSurrogateEnd = state.pos;\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          var trail = state.lastIntValue;\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd;\n        state.lastIntValue = lead;\n      }\n      return true\n    }\n    if (\n      switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (switchU) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.pos = start;\n  }\n\n  return false\n};\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp$8.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F; /* / */\n      return true\n    }\n    return false\n  }\n\n  var ch = state.current();\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp$8.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0;\n  var ch = state.current();\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n      state.advance();\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp$8.regexp_eatCharacterClassEscape = function(state) {\n  var ch = state.current();\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1;\n    state.advance();\n    return true\n  }\n\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    (ch === 0x50 /* P */ || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1;\n    state.advance();\n    if (\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatUnicodePropertyValueExpression(state) &&\n      state.eat(0x7D /* } */)\n    ) {\n      return true\n    }\n    state.raise(\"Invalid property name\");\n  }\n\n  return false\n};\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp$8.regexp_eatUnicodePropertyValueExpression = function(state) {\n  var start = state.pos;\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    var name = state.lastStringValue;\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      var value = state.lastStringValue;\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);\n      return true\n    }\n  }\n  state.pos = start;\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    var nameOrValue = state.lastStringValue;\n    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);\n    return true\n  }\n  return false\n};\npp$8.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!has(state.unicodeProperties.nonBinary, name))\n    { state.raise(\"Invalid property name\"); }\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    { state.raise(\"Invalid property value\"); }\n};\npp$8.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (!state.unicodeProperties.binary.test(nameOrValue))\n    { state.raise(\"Invalid property name\"); }\n};\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp$8.regexp_eatUnicodePropertyName = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp$8.regexp_eatUnicodePropertyValue = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp$8.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp$8.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    state.eat(0x5E /* ^ */);\n    this.regexp_classRanges(state);\n    if (state.eat(0x5D /* ] */)) {\n      return true\n    }\n    // Unreachable since it threw \"unterminated regular expression\" error before.\n    state.raise(\"Unterminated character class\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp$8.regexp_classRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      var right = state.lastIntValue;\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\");\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp$8.regexp_eatClassAtom = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      var ch$1 = state.current();\n      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {\n        state.raise(\"Invalid class escape\");\n      }\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n\n  var ch = state.current();\n  if (ch !== 0x5D /* ] */) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp$8.regexp_eatClassEscape = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08; /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D; /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp$8.regexp_eatClassControlLetter = function(state) {\n  var ch = state.current();\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$8.regexp_eatHexEscapeSequence = function(state) {\n  var start = state.pos;\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp$8.regexp_eatDecimalDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp$8.regexp_eatHexDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp$8.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    var n1 = state.lastIntValue;\n    if (this.regexp_eatOctalDigit(state)) {\n      var n2 = state.lastIntValue;\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;\n      } else {\n        state.lastIntValue = n1 * 8 + n2;\n      }\n    } else {\n      state.lastIntValue = n1;\n    }\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp$8.regexp_eatOctalDigit = function(state) {\n  var ch = state.current();\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30; /* 0 */\n    state.advance();\n    return true\n  }\n  state.lastIntValue = 0;\n  return false\n};\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$8.regexp_eatFixedHexDigits = function(state, length) {\n  var start = state.pos;\n  state.lastIntValue = 0;\n  for (var i = 0; i < length; ++i) {\n    var ch = state.current();\n    if (!isHexDigit(ch)) {\n      state.pos = start;\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return true\n};\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nvar Token = function Token(p) {\n  this.type = p.type;\n  this.value = p.value;\n  this.start = p.start;\n  this.end = p.end;\n  if (p.options.locations)\n    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }\n  if (p.options.ranges)\n    { this.range = [p.start, p.end]; }\n};\n\n// ## Tokenizer\n\nvar pp$9 = Parser.prototype;\n\n// Move to the next token\n\npp$9.next = function(ignoreEscapeSequenceInKeyword) {\n  if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)\n    { this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + this.type.keyword); }\n  if (this.options.onToken)\n    { this.options.onToken(new Token(this)); }\n\n  this.lastTokEnd = this.end;\n  this.lastTokStart = this.start;\n  this.lastTokEndLoc = this.endLoc;\n  this.lastTokStartLoc = this.startLoc;\n  this.nextToken();\n};\n\npp$9.getToken = function() {\n  this.next();\n  return new Token(this)\n};\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  { pp$9[Symbol.iterator] = function() {\n    var this$1 = this;\n\n    return {\n      next: function () {\n        var token = this$1.getToken();\n        return {\n          done: token.type === types.eof,\n          value: token\n        }\n      }\n    }\n  }; }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\npp$9.curContext = function() {\n  return this.context[this.context.length - 1]\n};\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp$9.nextToken = function() {\n  var curContext = this.curContext();\n  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }\n\n  this.start = this.pos;\n  if (this.options.locations) { this.startLoc = this.curPosition(); }\n  if (this.pos >= this.input.length) { return this.finishToken(types.eof) }\n\n  if (curContext.override) { return curContext.override(this) }\n  else { this.readToken(this.fullCharCodeAtPos()); }\n};\n\npp$9.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    { return this.readWord() }\n\n  return this.getTokenFromCode(code)\n};\n\npp$9.fullCharCodeAtPos = function() {\n  var code = this.input.charCodeAt(this.pos);\n  if (code <= 0xd7ff || code >= 0xe000) { return code }\n  var next = this.input.charCodeAt(this.pos + 1);\n  return (code << 10) + next - 0x35fdc00\n};\n\npp$9.skipBlockComment = function() {\n  var startLoc = this.options.onComment && this.curPosition();\n  var start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2);\n  if (end === -1) { this.raise(this.pos - 2, \"Unterminated comment\"); }\n  this.pos = end + 2;\n  if (this.options.locations) {\n    lineBreakG.lastIndex = start;\n    var match;\n    while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {\n      ++this.curLine;\n      this.lineStart = match.index + match[0].length;\n    }\n  }\n  if (this.options.onComment)\n    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\npp$9.skipLineComment = function(startSkip) {\n  var start = this.pos;\n  var startLoc = this.options.onComment && this.curPosition();\n  var ch = this.input.charCodeAt(this.pos += startSkip);\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos);\n  }\n  if (this.options.onComment)\n    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp$9.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    var ch = this.input.charCodeAt(this.pos);\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos;\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos;\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos;\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment();\n        break\n      case 47:\n        this.skipLineComment(2);\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos;\n      } else {\n        break loop\n      }\n    }\n  }\n};\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp$9.finishToken = function(type, val) {\n  this.end = this.pos;\n  if (this.options.locations) { this.endLoc = this.curPosition(); }\n  var prevType = this.type;\n  this.type = type;\n  this.value = val;\n\n  this.updateContext(prevType);\n};\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp$9.readToken_dot = function() {\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next >= 48 && next <= 57) { return this.readNumber(true) }\n  var next2 = this.input.charCodeAt(this.pos + 2);\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3;\n    return this.finishToken(types.ellipsis)\n  } else {\n    ++this.pos;\n    return this.finishToken(types.dot)\n  }\n};\n\npp$9.readToken_slash = function() { // '/'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) { return this.finishOp(types.assign, 2) }\n  return this.finishOp(types.slash, 1)\n};\n\npp$9.readToken_mult_modulo_exp = function(code) { // '%*'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  var tokentype = code === 42 ? types.star : types.modulo;\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size;\n    tokentype = types.starstar;\n    next = this.input.charCodeAt(this.pos + 2);\n  }\n\n  if (next === 61) { return this.finishOp(types.assign, size + 1) }\n  return this.finishOp(tokentype, size)\n};\n\npp$9.readToken_pipe_amp = function(code) { // '|&'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (this.options.ecmaVersion >= 12) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 === 61) { return this.finishOp(types.assign, 3) }\n    }\n    return this.finishOp(code === 124 ? types.logicalOR : types.logicalAND, 2)\n  }\n  if (next === 61) { return this.finishOp(types.assign, 2) }\n  return this.finishOp(code === 124 ? types.bitwiseOR : types.bitwiseAND, 1)\n};\n\npp$9.readToken_caret = function() { // '^'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types.assign, 2) }\n  return this.finishOp(types.bitwiseXOR, 1)\n};\n\npp$9.readToken_plus_min = function(code) { // '+-'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3);\n      this.skipSpace();\n      return this.nextToken()\n    }\n    return this.finishOp(types.incDec, 2)\n  }\n  if (next === 61) { return this.finishOp(types.assign, 2) }\n  return this.finishOp(types.plusMin, 1)\n};\n\npp$9.readToken_lt_gt = function(code) { // '<>'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;\n    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types.assign, size + 1) }\n    return this.finishOp(types.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4);\n    this.skipSpace();\n    return this.nextToken()\n  }\n  if (next === 61) { size = 2; }\n  return this.finishOp(types.relational, size)\n};\n\npp$9.readToken_eq_excl = function(code) { // '=!'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2;\n    return this.finishToken(types.arrow)\n  }\n  return this.finishOp(code === 61 ? types.eq : types.prefix, 1)\n};\n\npp$9.readToken_question = function() { // '?'\n  var ecmaVersion = this.options.ecmaVersion;\n  if (ecmaVersion >= 11) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 46) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 < 48 || next2 > 57) { return this.finishOp(types.questionDot, 2) }\n    }\n    if (next === 63) {\n      if (ecmaVersion >= 12) {\n        var next2$1 = this.input.charCodeAt(this.pos + 2);\n        if (next2$1 === 61) { return this.finishOp(types.assign, 3) }\n      }\n      return this.finishOp(types.coalesce, 2)\n    }\n  }\n  return this.finishOp(types.question, 1)\n};\n\npp$9.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(types.parenL)\n  case 41: ++this.pos; return this.finishToken(types.parenR)\n  case 59: ++this.pos; return this.finishToken(types.semi)\n  case 44: ++this.pos; return this.finishToken(types.comma)\n  case 91: ++this.pos; return this.finishToken(types.bracketL)\n  case 93: ++this.pos; return this.finishToken(types.bracketR)\n  case 123: ++this.pos; return this.finishToken(types.braceL)\n  case 125: ++this.pos; return this.finishToken(types.braceR)\n  case 58: ++this.pos; return this.finishToken(types.colon)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) { break }\n    ++this.pos;\n    return this.finishToken(types.backQuote)\n\n  case 48: // '0'\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number\n      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 63: // '?'\n    return this.readToken_question()\n\n  case 126: // '~'\n    return this.finishOp(types.prefix, 1)\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString$1(code) + \"'\");\n};\n\npp$9.finishOp = function(type, size) {\n  var str = this.input.slice(this.pos, this.pos + size);\n  this.pos += size;\n  return this.finishToken(type, str)\n};\n\npp$9.readRegexp = function() {\n  var escaped, inClass, start = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(start, \"Unterminated regular expression\"); }\n    var ch = this.input.charAt(this.pos);\n    if (lineBreak.test(ch)) { this.raise(start, \"Unterminated regular expression\"); }\n    if (!escaped) {\n      if (ch === \"[\") { inClass = true; }\n      else if (ch === \"]\" && inClass) { inClass = false; }\n      else if (ch === \"/\" && !inClass) { break }\n      escaped = ch === \"\\\\\";\n    } else { escaped = false; }\n    ++this.pos;\n  }\n  var pattern = this.input.slice(start, this.pos);\n  ++this.pos;\n  var flagsStart = this.pos;\n  var flags = this.readWord1();\n  if (this.containsEsc) { this.unexpected(flagsStart); }\n\n  // Validate pattern\n  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));\n  state.reset(start, pattern, flags);\n  this.validateRegExpFlags(state);\n  this.validateRegExpPattern(state);\n\n  // Create Literal#value property value.\n  var value = null;\n  try {\n    value = new RegExp(pattern, flags);\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(types.regexp, {pattern: pattern, flags: flags, value: value})\n};\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp$9.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {\n  // `len` is used for character escape sequences. In that case, disallow separators.\n  var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;\n\n  // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)\n  // and isn't fraction part nor exponent part. In that case, if the first digit\n  // is zero then disallow separators.\n  var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;\n\n  var start = this.pos, total = 0, lastCode = 0;\n  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {\n    var code = this.input.charCodeAt(this.pos), val = (void 0);\n\n    if (allowSeparators && code === 95) {\n      if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed in legacy octal numeric literals\"); }\n      if (lastCode === 95) { this.raiseRecoverable(this.pos, \"Numeric separator must be exactly one underscore\"); }\n      if (i === 0) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed at the first of digits\"); }\n      lastCode = code;\n      continue\n    }\n\n    if (code >= 97) { val = code - 97 + 10; } // a\n    else if (code >= 65) { val = code - 65 + 10; } // A\n    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9\n    else { val = Infinity; }\n    if (val >= radix) { break }\n    lastCode = code;\n    total = total * radix + val;\n  }\n\n  if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, \"Numeric separator is not allowed at the last of digits\"); }\n  if (this.pos === start || len != null && this.pos - start !== len) { return null }\n\n  return total\n};\n\nfunction stringToNumber(str, isLegacyOctalNumericLiteral) {\n  if (isLegacyOctalNumericLiteral) {\n    return parseInt(str, 8)\n  }\n\n  // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.\n  return parseFloat(str.replace(/_/g, \"\"))\n}\n\nfunction stringToBigInt(str) {\n  if (typeof BigInt !== \"function\") {\n    return null\n  }\n\n  // `BigInt(value)` throws syntax error if the string contains numeric separators.\n  return BigInt(str.replace(/_/g, \"\"))\n}\n\npp$9.readRadixNumber = function(radix) {\n  var start = this.pos;\n  this.pos += 2; // 0x\n  var val = this.readInt(radix);\n  if (val == null) { this.raise(this.start + 2, \"Expected number in radix \" + radix); }\n  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {\n    val = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n  return this.finishToken(types.num, val)\n};\n\n// Read an integer, octal integer, or floating-point number.\n\npp$9.readNumber = function(startsWithDot) {\n  var start = this.pos;\n  if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, \"Invalid number\"); }\n  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;\n  if (octal && this.strict) { this.raise(start, \"Invalid number\"); }\n  var next = this.input.charCodeAt(this.pos);\n  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {\n    var val$1 = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n    return this.finishToken(types.num, val$1)\n  }\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }\n  if (next === 46 && !octal) { // '.'\n    ++this.pos;\n    this.readInt(10);\n    next = this.input.charCodeAt(this.pos);\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos);\n    if (next === 43 || next === 45) { ++this.pos; } // '+-'\n    if (this.readInt(10) === null) { this.raise(start, \"Invalid number\"); }\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n\n  var val = stringToNumber(this.input.slice(start, this.pos), octal);\n  return this.finishToken(types.num, val)\n};\n\n// Read a string value, interpreting backslash-escapes.\n\npp$9.readCodePoint = function() {\n  var ch = this.input.charCodeAt(this.pos), code;\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) { this.unexpected(); }\n    var codePos = ++this.pos;\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos);\n    ++this.pos;\n    if (code > 0x10FFFF) { this.invalidStringToken(codePos, \"Code point out of bounds\"); }\n  } else {\n    code = this.readHexChar(4);\n  }\n  return code\n};\n\nfunction codePointToString$1(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) { return String.fromCharCode(code) }\n  code -= 0x10000;\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\npp$9.readString = function(quote) {\n  var out = \"\", chunkStart = ++this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated string constant\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === quote) { break }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(false);\n      chunkStart = this.pos;\n    } else {\n      if (isNewLine(ch, this.options.ecmaVersion >= 10)) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++);\n  return this.finishToken(types.string, out)\n};\n\n// Reads template string tokens.\n\nvar INVALID_TEMPLATE_ESCAPE_ERROR = {};\n\npp$9.tryReadTemplateToken = function() {\n  this.inTemplateElement = true;\n  try {\n    this.readTmplToken();\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken();\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false;\n};\n\npp$9.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message);\n  }\n};\n\npp$9.readTmplToken = function() {\n  var out = \"\", chunkStart = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated template\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === types.template || this.type === types.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2;\n          return this.finishToken(types.dollarBraceL)\n        } else {\n          ++this.pos;\n          return this.finishToken(types.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos);\n      return this.finishToken(types.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(true);\n      chunkStart = this.pos;\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos);\n      ++this.pos;\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }\n      case 10:\n        out += \"\\n\";\n        break\n      default:\n        out += String.fromCharCode(ch);\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      chunkStart = this.pos;\n    } else {\n      ++this.pos;\n    }\n  }\n};\n\n// Reads a template token to search for the end, without validating any escape sequences\npp$9.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos;\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") {\n        break\n      }\n    // falls through\n\n    case \"`\":\n      return this.finishToken(types.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    // no default\n    }\n  }\n  this.raise(this.start, \"Unterminated template\");\n};\n\n// Used to read escaped characters\n\npp$9.readEscapedChar = function(inTemplate) {\n  var ch = this.input.charCodeAt(++this.pos);\n  ++this.pos;\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString$1(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n    return \"\"\n  case 56:\n  case 57:\n    if (inTemplate) {\n      var codePos = this.pos - 1;\n\n      this.invalidStringToken(\n        codePos,\n        \"Invalid escape sequence in template string\"\n      );\n\n      return null\n    }\n  default:\n    if (ch >= 48 && ch <= 55) {\n      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];\n      var octal = parseInt(octalStr, 8);\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1);\n        octal = parseInt(octalStr, 8);\n      }\n      this.pos += octalStr.length - 1;\n      ch = this.input.charCodeAt(this.pos);\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        );\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n};\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp$9.readHexChar = function(len) {\n  var codePos = this.pos;\n  var n = this.readInt(16, len);\n  if (n === null) { this.invalidStringToken(codePos, \"Bad character escape sequence\"); }\n  return n\n};\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp$9.readWord1 = function() {\n  this.containsEsc = false;\n  var word = \"\", first = true, chunkStart = this.pos;\n  var astral = this.options.ecmaVersion >= 6;\n  while (this.pos < this.input.length) {\n    var ch = this.fullCharCodeAtPos();\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2;\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true;\n      word += this.input.slice(chunkStart, this.pos);\n      var escStart = this.pos;\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        { this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\"); }\n      ++this.pos;\n      var esc = this.readCodePoint();\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        { this.invalidStringToken(escStart, \"Invalid Unicode escape\"); }\n      word += codePointToString$1(esc);\n      chunkStart = this.pos;\n    } else {\n      break\n    }\n    first = false;\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n};\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp$9.readWord = function() {\n  var word = this.readWord1();\n  var type = types.name;\n  if (this.keywords.test(word)) {\n    type = keywords$1[word];\n  }\n  return this.finishToken(type, word)\n};\n\n// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n\nvar version = \"7.4.1\";\n\nParser.acorn = {\n  Parser: Parser,\n  version: version,\n  defaultOptions: defaultOptions,\n  Position: Position,\n  SourceLocation: SourceLocation,\n  getLineInfo: getLineInfo,\n  Node: Node,\n  TokenType: TokenType,\n  tokTypes: types,\n  keywordTypes: keywords$1,\n  TokContext: TokContext,\n  tokContexts: types$1,\n  isIdentifierChar: isIdentifierChar,\n  isIdentifierStart: isIdentifierStart,\n  Token: Token,\n  isNewLine: isNewLine,\n  lineBreak: lineBreak,\n  lineBreakG: lineBreakG,\n  nonASCIIwhitespace: nonASCIIwhitespace\n};\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and\n// returns an abstract syntax tree as specified by [Mozilla parser\n// API][api].\n//\n// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API\n\nfunction parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nfunction parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nfunction tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n\nexport { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords$1 as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types$1 as tokContexts, types as tokTypes, tokenizer, version };\n","'use strict';\n\nconst XHTMLEntities = require('./xhtml');\n\nconst hexNumber = /^[\\da-fA-F]+$/;\nconst decimalNumber = /^\\d+$/;\n\n// The map to `acorn-jsx` tokens from `acorn` namespace objects.\nconst acornJsxMap = new WeakMap();\n\n// Get the original tokens for the given `acorn` namespace object.\nfunction getJsxTokens(acorn) {\n  acorn = acorn.Parser.acorn || acorn;\n  let acornJsx = acornJsxMap.get(acorn);\n  if (!acornJsx) {\n    const tt = acorn.tokTypes;\n    const TokContext = acorn.TokContext;\n    const TokenType = acorn.TokenType;\n    const tc_oTag = new TokContext('<tag', false);\n    const tc_cTag = new TokContext('</tag', false);\n    const tc_expr = new TokContext('<tag>...</tag>', true, true);\n    const tokContexts = {\n      tc_oTag: tc_oTag,\n      tc_cTag: tc_cTag,\n      tc_expr: tc_expr\n    };\n    const tokTypes = {\n      jsxName: new TokenType('jsxName'),\n      jsxText: new TokenType('jsxText', {beforeExpr: true}),\n      jsxTagStart: new TokenType('jsxTagStart', {startsExpr: true}),\n      jsxTagEnd: new TokenType('jsxTagEnd')\n    };\n\n    tokTypes.jsxTagStart.updateContext = function() {\n      this.context.push(tc_expr); // treat as beginning of JSX expression\n      this.context.push(tc_oTag); // start opening tag context\n      this.exprAllowed = false;\n    };\n    tokTypes.jsxTagEnd.updateContext = function(prevType) {\n      let out = this.context.pop();\n      if (out === tc_oTag && prevType === tt.slash || out === tc_cTag) {\n        this.context.pop();\n        this.exprAllowed = this.curContext() === tc_expr;\n      } else {\n        this.exprAllowed = true;\n      }\n    };\n\n    acornJsx = { tokContexts: tokContexts, tokTypes: tokTypes };\n    acornJsxMap.set(acorn, acornJsx);\n  }\n\n  return acornJsx;\n}\n\n// Transforms JSX element name to string.\n\nfunction getQualifiedJSXName(object) {\n  if (!object)\n    return object;\n\n  if (object.type === 'JSXIdentifier')\n    return object.name;\n\n  if (object.type === 'JSXNamespacedName')\n    return object.namespace.name + ':' + object.name.name;\n\n  if (object.type === 'JSXMemberExpression')\n    return getQualifiedJSXName(object.object) + '.' +\n    getQualifiedJSXName(object.property);\n}\n\nmodule.exports = function(options) {\n  options = options || {};\n  return function(Parser) {\n    return plugin({\n      allowNamespaces: options.allowNamespaces !== false,\n      allowNamespacedObjects: !!options.allowNamespacedObjects\n    }, Parser);\n  };\n};\n\n// This is `tokTypes` of the peer dep.\n// This can be different instances from the actual `tokTypes` this plugin uses.\nObject.defineProperty(module.exports, \"tokTypes\", {\n  get: function get_tokTypes() {\n    return getJsxTokens(require(\"acorn\")).tokTypes;\n  },\n  configurable: true,\n  enumerable: true\n});\n\nfunction plugin(options, Parser) {\n  const acorn = Parser.acorn || require(\"acorn\");\n  const acornJsx = getJsxTokens(acorn);\n  const tt = acorn.tokTypes;\n  const tok = acornJsx.tokTypes;\n  const tokContexts = acorn.tokContexts;\n  const tc_oTag = acornJsx.tokContexts.tc_oTag;\n  const tc_cTag = acornJsx.tokContexts.tc_cTag;\n  const tc_expr = acornJsx.tokContexts.tc_expr;\n  const isNewLine = acorn.isNewLine;\n  const isIdentifierStart = acorn.isIdentifierStart;\n  const isIdentifierChar = acorn.isIdentifierChar;\n\n  return class extends Parser {\n    // Expose actual `tokTypes` and `tokContexts` to other plugins.\n    static get acornJsx() {\n      return acornJsx;\n    }\n\n    // Reads inline JSX contents token.\n    jsx_readToken() {\n      let out = '', chunkStart = this.pos;\n      for (;;) {\n        if (this.pos >= this.input.length)\n          this.raise(this.start, 'Unterminated JSX contents');\n        let ch = this.input.charCodeAt(this.pos);\n\n        switch (ch) {\n        case 60: // '<'\n        case 123: // '{'\n          if (this.pos === this.start) {\n            if (ch === 60 && this.exprAllowed) {\n              ++this.pos;\n              return this.finishToken(tok.jsxTagStart);\n            }\n            return this.getTokenFromCode(ch);\n          }\n          out += this.input.slice(chunkStart, this.pos);\n          return this.finishToken(tok.jsxText, out);\n\n        case 38: // '&'\n          out += this.input.slice(chunkStart, this.pos);\n          out += this.jsx_readEntity();\n          chunkStart = this.pos;\n          break;\n\n        case 62: // '>'\n        case 125: // '}'\n          this.raise(\n            this.pos,\n            \"Unexpected token `\" + this.input[this.pos] + \"`. Did you mean `\" +\n              (ch === 62 ? \"&gt;\" : \"&rbrace;\") + \"` or \" + \"`{\\\"\" + this.input[this.pos] + \"\\\"}\" + \"`?\"\n          );\n\n        default:\n          if (isNewLine(ch)) {\n            out += this.input.slice(chunkStart, this.pos);\n            out += this.jsx_readNewLine(true);\n            chunkStart = this.pos;\n          } else {\n            ++this.pos;\n          }\n        }\n      }\n    }\n\n    jsx_readNewLine(normalizeCRLF) {\n      let ch = this.input.charCodeAt(this.pos);\n      let out;\n      ++this.pos;\n      if (ch === 13 && this.input.charCodeAt(this.pos) === 10) {\n        ++this.pos;\n        out = normalizeCRLF ? '\\n' : '\\r\\n';\n      } else {\n        out = String.fromCharCode(ch);\n      }\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n\n      return out;\n    }\n\n    jsx_readString(quote) {\n      let out = '', chunkStart = ++this.pos;\n      for (;;) {\n        if (this.pos >= this.input.length)\n          this.raise(this.start, 'Unterminated string constant');\n        let ch = this.input.charCodeAt(this.pos);\n        if (ch === quote) break;\n        if (ch === 38) { // '&'\n          out += this.input.slice(chunkStart, this.pos);\n          out += this.jsx_readEntity();\n          chunkStart = this.pos;\n        } else if (isNewLine(ch)) {\n          out += this.input.slice(chunkStart, this.pos);\n          out += this.jsx_readNewLine(false);\n          chunkStart = this.pos;\n        } else {\n          ++this.pos;\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos++);\n      return this.finishToken(tt.string, out);\n    }\n\n    jsx_readEntity() {\n      let str = '', count = 0, entity;\n      let ch = this.input[this.pos];\n      if (ch !== '&')\n        this.raise(this.pos, 'Entity must start with an ampersand');\n      let startPos = ++this.pos;\n      while (this.pos < this.input.length && count++ < 10) {\n        ch = this.input[this.pos++];\n        if (ch === ';') {\n          if (str[0] === '#') {\n            if (str[1] === 'x') {\n              str = str.substr(2);\n              if (hexNumber.test(str))\n                entity = String.fromCharCode(parseInt(str, 16));\n            } else {\n              str = str.substr(1);\n              if (decimalNumber.test(str))\n                entity = String.fromCharCode(parseInt(str, 10));\n            }\n          } else {\n            entity = XHTMLEntities[str];\n          }\n          break;\n        }\n        str += ch;\n      }\n      if (!entity) {\n        this.pos = startPos;\n        return '&';\n      }\n      return entity;\n    }\n\n    // Read a JSX identifier (valid tag or attribute name).\n    //\n    // Optimized version since JSX identifiers can't contain\n    // escape characters and so can be read as single slice.\n    // Also assumes that first character was already checked\n    // by isIdentifierStart in readToken.\n\n    jsx_readWord() {\n      let ch, start = this.pos;\n      do {\n        ch = this.input.charCodeAt(++this.pos);\n      } while (isIdentifierChar(ch) || ch === 45); // '-'\n      return this.finishToken(tok.jsxName, this.input.slice(start, this.pos));\n    }\n\n    // Parse next token as JSX identifier\n\n    jsx_parseIdentifier() {\n      let node = this.startNode();\n      if (this.type === tok.jsxName)\n        node.name = this.value;\n      else if (this.type.keyword)\n        node.name = this.type.keyword;\n      else\n        this.unexpected();\n      this.next();\n      return this.finishNode(node, 'JSXIdentifier');\n    }\n\n    // Parse namespaced identifier.\n\n    jsx_parseNamespacedName() {\n      let startPos = this.start, startLoc = this.startLoc;\n      let name = this.jsx_parseIdentifier();\n      if (!options.allowNamespaces || !this.eat(tt.colon)) return name;\n      var node = this.startNodeAt(startPos, startLoc);\n      node.namespace = name;\n      node.name = this.jsx_parseIdentifier();\n      return this.finishNode(node, 'JSXNamespacedName');\n    }\n\n    // Parses element name in any form - namespaced, member\n    // or single identifier.\n\n    jsx_parseElementName() {\n      if (this.type === tok.jsxTagEnd) return '';\n      let startPos = this.start, startLoc = this.startLoc;\n      let node = this.jsx_parseNamespacedName();\n      if (this.type === tt.dot && node.type === 'JSXNamespacedName' && !options.allowNamespacedObjects) {\n        this.unexpected();\n      }\n      while (this.eat(tt.dot)) {\n        let newNode = this.startNodeAt(startPos, startLoc);\n        newNode.object = node;\n        newNode.property = this.jsx_parseIdentifier();\n        node = this.finishNode(newNode, 'JSXMemberExpression');\n      }\n      return node;\n    }\n\n    // Parses any type of JSX attribute value.\n\n    jsx_parseAttributeValue() {\n      switch (this.type) {\n      case tt.braceL:\n        let node = this.jsx_parseExpressionContainer();\n        if (node.expression.type === 'JSXEmptyExpression')\n          this.raise(node.start, 'JSX attributes must only be assigned a non-empty expression');\n        return node;\n\n      case tok.jsxTagStart:\n      case tt.string:\n        return this.parseExprAtom();\n\n      default:\n        this.raise(this.start, 'JSX value should be either an expression or a quoted JSX text');\n      }\n    }\n\n    // JSXEmptyExpression is unique type since it doesn't actually parse anything,\n    // and so it should start at the end of last read token (left brace) and finish\n    // at the beginning of the next one (right brace).\n\n    jsx_parseEmptyExpression() {\n      let node = this.startNodeAt(this.lastTokEnd, this.lastTokEndLoc);\n      return this.finishNodeAt(node, 'JSXEmptyExpression', this.start, this.startLoc);\n    }\n\n    // Parses JSX expression enclosed into curly brackets.\n\n    jsx_parseExpressionContainer() {\n      let node = this.startNode();\n      this.next();\n      node.expression = this.type === tt.braceR\n        ? this.jsx_parseEmptyExpression()\n        : this.parseExpression();\n      this.expect(tt.braceR);\n      return this.finishNode(node, 'JSXExpressionContainer');\n    }\n\n    // Parses following JSX attribute name-value pair.\n\n    jsx_parseAttribute() {\n      let node = this.startNode();\n      if (this.eat(tt.braceL)) {\n        this.expect(tt.ellipsis);\n        node.argument = this.parseMaybeAssign();\n        this.expect(tt.braceR);\n        return this.finishNode(node, 'JSXSpreadAttribute');\n      }\n      node.name = this.jsx_parseNamespacedName();\n      node.value = this.eat(tt.eq) ? this.jsx_parseAttributeValue() : null;\n      return this.finishNode(node, 'JSXAttribute');\n    }\n\n    // Parses JSX opening tag starting after '<'.\n\n    jsx_parseOpeningElementAt(startPos, startLoc) {\n      let node = this.startNodeAt(startPos, startLoc);\n      node.attributes = [];\n      let nodeName = this.jsx_parseElementName();\n      if (nodeName) node.name = nodeName;\n      while (this.type !== tt.slash && this.type !== tok.jsxTagEnd)\n        node.attributes.push(this.jsx_parseAttribute());\n      node.selfClosing = this.eat(tt.slash);\n      this.expect(tok.jsxTagEnd);\n      return this.finishNode(node, nodeName ? 'JSXOpeningElement' : 'JSXOpeningFragment');\n    }\n\n    // Parses JSX closing tag starting after '</'.\n\n    jsx_parseClosingElementAt(startPos, startLoc) {\n      let node = this.startNodeAt(startPos, startLoc);\n      let nodeName = this.jsx_parseElementName();\n      if (nodeName) node.name = nodeName;\n      this.expect(tok.jsxTagEnd);\n      return this.finishNode(node, nodeName ? 'JSXClosingElement' : 'JSXClosingFragment');\n    }\n\n    // Parses entire JSX element, including it's opening tag\n    // (starting after '<'), attributes, contents and closing tag.\n\n    jsx_parseElementAt(startPos, startLoc) {\n      let node = this.startNodeAt(startPos, startLoc);\n      let children = [];\n      let openingElement = this.jsx_parseOpeningElementAt(startPos, startLoc);\n      let closingElement = null;\n\n      if (!openingElement.selfClosing) {\n        contents: for (;;) {\n          switch (this.type) {\n          case tok.jsxTagStart:\n            startPos = this.start; startLoc = this.startLoc;\n            this.next();\n            if (this.eat(tt.slash)) {\n              closingElement = this.jsx_parseClosingElementAt(startPos, startLoc);\n              break contents;\n            }\n            children.push(this.jsx_parseElementAt(startPos, startLoc));\n            break;\n\n          case tok.jsxText:\n            children.push(this.parseExprAtom());\n            break;\n\n          case tt.braceL:\n            children.push(this.jsx_parseExpressionContainer());\n            break;\n\n          default:\n            this.unexpected();\n          }\n        }\n        if (getQualifiedJSXName(closingElement.name) !== getQualifiedJSXName(openingElement.name)) {\n          this.raise(\n            closingElement.start,\n            'Expected corresponding JSX closing tag for <' + getQualifiedJSXName(openingElement.name) + '>');\n        }\n      }\n      let fragmentOrElement = openingElement.name ? 'Element' : 'Fragment';\n\n      node['opening' + fragmentOrElement] = openingElement;\n      node['closing' + fragmentOrElement] = closingElement;\n      node.children = children;\n      if (this.type === tt.relational && this.value === \"<\") {\n        this.raise(this.start, \"Adjacent JSX elements must be wrapped in an enclosing tag\");\n      }\n      return this.finishNode(node, 'JSX' + fragmentOrElement);\n    }\n\n    // Parse JSX text\n\n    jsx_parseText() {\n      let node = this.parseLiteral(this.value);\n      node.type = \"JSXText\";\n      return node;\n    }\n\n    // Parses entire JSX element from current position.\n\n    jsx_parseElement() {\n      let startPos = this.start, startLoc = this.startLoc;\n      this.next();\n      return this.jsx_parseElementAt(startPos, startLoc);\n    }\n\n    parseExprAtom(refShortHandDefaultPos) {\n      if (this.type === tok.jsxText)\n        return this.jsx_parseText();\n      else if (this.type === tok.jsxTagStart)\n        return this.jsx_parseElement();\n      else\n        return super.parseExprAtom(refShortHandDefaultPos);\n    }\n\n    readToken(code) {\n      let context = this.curContext();\n\n      if (context === tc_expr) return this.jsx_readToken();\n\n      if (context === tc_oTag || context === tc_cTag) {\n        if (isIdentifierStart(code)) return this.jsx_readWord();\n\n        if (code == 62) {\n          ++this.pos;\n          return this.finishToken(tok.jsxTagEnd);\n        }\n\n        if ((code === 34 || code === 39) && context == tc_oTag)\n          return this.jsx_readString(code);\n      }\n\n      if (code === 60 && this.exprAllowed && this.input.charCodeAt(this.pos + 1) !== 33) {\n        ++this.pos;\n        return this.finishToken(tok.jsxTagStart);\n      }\n      return super.readToken(code);\n    }\n\n    updateContext(prevType) {\n      if (this.type == tt.braceL) {\n        var curContext = this.curContext();\n        if (curContext == tc_oTag) this.context.push(tokContexts.b_expr);\n        else if (curContext == tc_expr) this.context.push(tokContexts.b_tmpl);\n        else super.updateContext(prevType);\n        this.exprAllowed = true;\n      } else if (this.type === tt.slash && prevType === tok.jsxTagStart) {\n        this.context.length -= 2; // do not consider JSX expr -> JSX open tag -> ... anymore\n        this.context.push(tc_cTag); // reconsider as closing tag context\n        this.exprAllowed = false;\n      } else {\n        return super.updateContext(prevType);\n      }\n    }\n  };\n}\n","module.exports = {\n  quot: '\\u0022',\n  amp: '&',\n  apos: '\\u0027',\n  lt: '<',\n  gt: '>',\n  nbsp: '\\u00A0',\n  iexcl: '\\u00A1',\n  cent: '\\u00A2',\n  pound: '\\u00A3',\n  curren: '\\u00A4',\n  yen: '\\u00A5',\n  brvbar: '\\u00A6',\n  sect: '\\u00A7',\n  uml: '\\u00A8',\n  copy: '\\u00A9',\n  ordf: '\\u00AA',\n  laquo: '\\u00AB',\n  not: '\\u00AC',\n  shy: '\\u00AD',\n  reg: '\\u00AE',\n  macr: '\\u00AF',\n  deg: '\\u00B0',\n  plusmn: '\\u00B1',\n  sup2: '\\u00B2',\n  sup3: '\\u00B3',\n  acute: '\\u00B4',\n  micro: '\\u00B5',\n  para: '\\u00B6',\n  middot: '\\u00B7',\n  cedil: '\\u00B8',\n  sup1: '\\u00B9',\n  ordm: '\\u00BA',\n  raquo: '\\u00BB',\n  frac14: '\\u00BC',\n  frac12: '\\u00BD',\n  frac34: '\\u00BE',\n  iquest: '\\u00BF',\n  Agrave: '\\u00C0',\n  Aacute: '\\u00C1',\n  Acirc: '\\u00C2',\n  Atilde: '\\u00C3',\n  Auml: '\\u00C4',\n  Aring: '\\u00C5',\n  AElig: '\\u00C6',\n  Ccedil: '\\u00C7',\n  Egrave: '\\u00C8',\n  Eacute: '\\u00C9',\n  Ecirc: '\\u00CA',\n  Euml: '\\u00CB',\n  Igrave: '\\u00CC',\n  Iacute: '\\u00CD',\n  Icirc: '\\u00CE',\n  Iuml: '\\u00CF',\n  ETH: '\\u00D0',\n  Ntilde: '\\u00D1',\n  Ograve: '\\u00D2',\n  Oacute: '\\u00D3',\n  Ocirc: '\\u00D4',\n  Otilde: '\\u00D5',\n  Ouml: '\\u00D6',\n  times: '\\u00D7',\n  Oslash: '\\u00D8',\n  Ugrave: '\\u00D9',\n  Uacute: '\\u00DA',\n  Ucirc: '\\u00DB',\n  Uuml: '\\u00DC',\n  Yacute: '\\u00DD',\n  THORN: '\\u00DE',\n  szlig: '\\u00DF',\n  agrave: '\\u00E0',\n  aacute: '\\u00E1',\n  acirc: '\\u00E2',\n  atilde: '\\u00E3',\n  auml: '\\u00E4',\n  aring: '\\u00E5',\n  aelig: '\\u00E6',\n  ccedil: '\\u00E7',\n  egrave: '\\u00E8',\n  eacute: '\\u00E9',\n  ecirc: '\\u00EA',\n  euml: '\\u00EB',\n  igrave: '\\u00EC',\n  iacute: '\\u00ED',\n  icirc: '\\u00EE',\n  iuml: '\\u00EF',\n  eth: '\\u00F0',\n  ntilde: '\\u00F1',\n  ograve: '\\u00F2',\n  oacute: '\\u00F3',\n  ocirc: '\\u00F4',\n  otilde: '\\u00F5',\n  ouml: '\\u00F6',\n  divide: '\\u00F7',\n  oslash: '\\u00F8',\n  ugrave: '\\u00F9',\n  uacute: '\\u00FA',\n  ucirc: '\\u00FB',\n  uuml: '\\u00FC',\n  yacute: '\\u00FD',\n  thorn: '\\u00FE',\n  yuml: '\\u00FF',\n  OElig: '\\u0152',\n  oelig: '\\u0153',\n  Scaron: '\\u0160',\n  scaron: '\\u0161',\n  Yuml: '\\u0178',\n  fnof: '\\u0192',\n  circ: '\\u02C6',\n  tilde: '\\u02DC',\n  Alpha: '\\u0391',\n  Beta: '\\u0392',\n  Gamma: '\\u0393',\n  Delta: '\\u0394',\n  Epsilon: '\\u0395',\n  Zeta: '\\u0396',\n  Eta: '\\u0397',\n  Theta: '\\u0398',\n  Iota: '\\u0399',\n  Kappa: '\\u039A',\n  Lambda: '\\u039B',\n  Mu: '\\u039C',\n  Nu: '\\u039D',\n  Xi: '\\u039E',\n  Omicron: '\\u039F',\n  Pi: '\\u03A0',\n  Rho: '\\u03A1',\n  Sigma: '\\u03A3',\n  Tau: '\\u03A4',\n  Upsilon: '\\u03A5',\n  Phi: '\\u03A6',\n  Chi: '\\u03A7',\n  Psi: '\\u03A8',\n  Omega: '\\u03A9',\n  alpha: '\\u03B1',\n  beta: '\\u03B2',\n  gamma: '\\u03B3',\n  delta: '\\u03B4',\n  epsilon: '\\u03B5',\n  zeta: '\\u03B6',\n  eta: '\\u03B7',\n  theta: '\\u03B8',\n  iota: '\\u03B9',\n  kappa: '\\u03BA',\n  lambda: '\\u03BB',\n  mu: '\\u03BC',\n  nu: '\\u03BD',\n  xi: '\\u03BE',\n  omicron: '\\u03BF',\n  pi: '\\u03C0',\n  rho: '\\u03C1',\n  sigmaf: '\\u03C2',\n  sigma: '\\u03C3',\n  tau: '\\u03C4',\n  upsilon: '\\u03C5',\n  phi: '\\u03C6',\n  chi: '\\u03C7',\n  psi: '\\u03C8',\n  omega: '\\u03C9',\n  thetasym: '\\u03D1',\n  upsih: '\\u03D2',\n  piv: '\\u03D6',\n  ensp: '\\u2002',\n  emsp: '\\u2003',\n  thinsp: '\\u2009',\n  zwnj: '\\u200C',\n  zwj: '\\u200D',\n  lrm: '\\u200E',\n  rlm: '\\u200F',\n  ndash: '\\u2013',\n  mdash: '\\u2014',\n  lsquo: '\\u2018',\n  rsquo: '\\u2019',\n  sbquo: '\\u201A',\n  ldquo: '\\u201C',\n  rdquo: '\\u201D',\n  bdquo: '\\u201E',\n  dagger: '\\u2020',\n  Dagger: '\\u2021',\n  bull: '\\u2022',\n  hellip: '\\u2026',\n  permil: '\\u2030',\n  prime: '\\u2032',\n  Prime: '\\u2033',\n  lsaquo: '\\u2039',\n  rsaquo: '\\u203A',\n  oline: '\\u203E',\n  frasl: '\\u2044',\n  euro: '\\u20AC',\n  image: '\\u2111',\n  weierp: '\\u2118',\n  real: '\\u211C',\n  trade: '\\u2122',\n  alefsym: '\\u2135',\n  larr: '\\u2190',\n  uarr: '\\u2191',\n  rarr: '\\u2192',\n  darr: '\\u2193',\n  harr: '\\u2194',\n  crarr: '\\u21B5',\n  lArr: '\\u21D0',\n  uArr: '\\u21D1',\n  rArr: '\\u21D2',\n  dArr: '\\u21D3',\n  hArr: '\\u21D4',\n  forall: '\\u2200',\n  part: '\\u2202',\n  exist: '\\u2203',\n  empty: '\\u2205',\n  nabla: '\\u2207',\n  isin: '\\u2208',\n  notin: '\\u2209',\n  ni: '\\u220B',\n  prod: '\\u220F',\n  sum: '\\u2211',\n  minus: '\\u2212',\n  lowast: '\\u2217',\n  radic: '\\u221A',\n  prop: '\\u221D',\n  infin: '\\u221E',\n  ang: '\\u2220',\n  and: '\\u2227',\n  or: '\\u2228',\n  cap: '\\u2229',\n  cup: '\\u222A',\n  'int': '\\u222B',\n  there4: '\\u2234',\n  sim: '\\u223C',\n  cong: '\\u2245',\n  asymp: '\\u2248',\n  ne: '\\u2260',\n  equiv: '\\u2261',\n  le: '\\u2264',\n  ge: '\\u2265',\n  sub: '\\u2282',\n  sup: '\\u2283',\n  nsub: '\\u2284',\n  sube: '\\u2286',\n  supe: '\\u2287',\n  oplus: '\\u2295',\n  otimes: '\\u2297',\n  perp: '\\u22A5',\n  sdot: '\\u22C5',\n  lceil: '\\u2308',\n  rceil: '\\u2309',\n  lfloor: '\\u230A',\n  rfloor: '\\u230B',\n  lang: '\\u2329',\n  rang: '\\u232A',\n  loz: '\\u25CA',\n  spades: '\\u2660',\n  clubs: '\\u2663',\n  hearts: '\\u2665',\n  diams: '\\u2666'\n};\n","// AST walker module for Mozilla Parser API compatible trees\n\n// A simple walk is one where you simply specify callbacks to be\n// called on specific nodes. The last two arguments are optional. A\n// simple use would be\n//\n//     walk.simple(myTree, {\n//         Expression: function(node) { ... }\n//     });\n//\n// to do something with all expressions. All Parser API node types\n// can be used to identify node types, as well as Expression and\n// Statement, which denote categories of nodes.\n//\n// The base argument can be used to pass a custom (recursive)\n// walker, and state can be used to give this walked an initial\n// state.\n\nfunction simple(node, visitors, baseVisitor, state, override) {\n  if (!baseVisitor) { baseVisitor = base\n  ; }(function c(node, st, override) {\n    var type = override || node.type, found = visitors[type];\n    baseVisitor[type](node, st, c);\n    if (found) { found(node, st); }\n  })(node, state, override);\n}\n\n// An ancestor walk keeps an array of ancestor nodes (including the\n// current node) and passes them to the callback as third parameter\n// (and also as state parameter when no other state is present).\nfunction ancestor(node, visitors, baseVisitor, state, override) {\n  var ancestors = [];\n  if (!baseVisitor) { baseVisitor = base\n  ; }(function c(node, st, override) {\n    var type = override || node.type, found = visitors[type];\n    var isNew = node !== ancestors[ancestors.length - 1];\n    if (isNew) { ancestors.push(node); }\n    baseVisitor[type](node, st, c);\n    if (found) { found(node, st || ancestors, ancestors); }\n    if (isNew) { ancestors.pop(); }\n  })(node, state, override);\n}\n\n// A recursive walk is one where your functions override the default\n// walkers. They can modify and replace the state parameter that's\n// threaded through the walk, and can opt how and whether to walk\n// their child nodes (by calling their third argument on these\n// nodes).\nfunction recursive(node, state, funcs, baseVisitor, override) {\n  var visitor = funcs ? make(funcs, baseVisitor || undefined) : baseVisitor\n  ;(function c(node, st, override) {\n    visitor[override || node.type](node, st, c);\n  })(node, state, override);\n}\n\nfunction makeTest(test) {\n  if (typeof test === \"string\")\n    { return function (type) { return type === test; } }\n  else if (!test)\n    { return function () { return true; } }\n  else\n    { return test }\n}\n\nvar Found = function Found(node, state) { this.node = node; this.state = state; };\n\n// A full walk triggers the callback on each node\nfunction full(node, callback, baseVisitor, state, override) {\n  if (!baseVisitor) { baseVisitor = base\n  ; }(function c(node, st, override) {\n    var type = override || node.type;\n    baseVisitor[type](node, st, c);\n    if (!override) { callback(node, st, type); }\n  })(node, state, override);\n}\n\n// An fullAncestor walk is like an ancestor walk, but triggers\n// the callback on each node\nfunction fullAncestor(node, callback, baseVisitor, state) {\n  if (!baseVisitor) { baseVisitor = base; }\n  var ancestors = []\n  ;(function c(node, st, override) {\n    var type = override || node.type;\n    var isNew = node !== ancestors[ancestors.length - 1];\n    if (isNew) { ancestors.push(node); }\n    baseVisitor[type](node, st, c);\n    if (!override) { callback(node, st || ancestors, ancestors, type); }\n    if (isNew) { ancestors.pop(); }\n  })(node, state);\n}\n\n// Find a node with a given start, end, and type (all are optional,\n// null can be used as wildcard). Returns a {node, state} object, or\n// undefined when it doesn't find a matching node.\nfunction findNodeAt(node, start, end, test, baseVisitor, state) {\n  if (!baseVisitor) { baseVisitor = base; }\n  test = makeTest(test);\n  try {\n    (function c(node, st, override) {\n      var type = override || node.type;\n      if ((start == null || node.start <= start) &&\n          (end == null || node.end >= end))\n        { baseVisitor[type](node, st, c); }\n      if ((start == null || node.start === start) &&\n          (end == null || node.end === end) &&\n          test(type, node))\n        { throw new Found(node, st) }\n    })(node, state);\n  } catch (e) {\n    if (e instanceof Found) { return e }\n    throw e\n  }\n}\n\n// Find the innermost node of a given type that contains the given\n// position. Interface similar to findNodeAt.\nfunction findNodeAround(node, pos, test, baseVisitor, state) {\n  test = makeTest(test);\n  if (!baseVisitor) { baseVisitor = base; }\n  try {\n    (function c(node, st, override) {\n      var type = override || node.type;\n      if (node.start > pos || node.end < pos) { return }\n      baseVisitor[type](node, st, c);\n      if (test(type, node)) { throw new Found(node, st) }\n    })(node, state);\n  } catch (e) {\n    if (e instanceof Found) { return e }\n    throw e\n  }\n}\n\n// Find the outermost matching node after a given position.\nfunction findNodeAfter(node, pos, test, baseVisitor, state) {\n  test = makeTest(test);\n  if (!baseVisitor) { baseVisitor = base; }\n  try {\n    (function c(node, st, override) {\n      if (node.end < pos) { return }\n      var type = override || node.type;\n      if (node.start >= pos && test(type, node)) { throw new Found(node, st) }\n      baseVisitor[type](node, st, c);\n    })(node, state);\n  } catch (e) {\n    if (e instanceof Found) { return e }\n    throw e\n  }\n}\n\n// Find the outermost matching node before a given position.\nfunction findNodeBefore(node, pos, test, baseVisitor, state) {\n  test = makeTest(test);\n  if (!baseVisitor) { baseVisitor = base; }\n  var max\n  ;(function c(node, st, override) {\n    if (node.start > pos) { return }\n    var type = override || node.type;\n    if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))\n      { max = new Found(node, st); }\n    baseVisitor[type](node, st, c);\n  })(node, state);\n  return max\n}\n\n// Fallback to an Object.create polyfill for older environments.\nvar create = Object.create || function(proto) {\n  function Ctor() {}\n  Ctor.prototype = proto;\n  return new Ctor\n};\n\n// Used to create a custom walker. Will fill in all missing node\n// type properties with the defaults.\nfunction make(funcs, baseVisitor) {\n  var visitor = create(baseVisitor || base);\n  for (var type in funcs) { visitor[type] = funcs[type]; }\n  return visitor\n}\n\nfunction skipThrough(node, st, c) { c(node, st); }\nfunction ignore(_node, _st, _c) {}\n\n// Node walkers.\n\nvar base = {};\n\nbase.Program = base.BlockStatement = function (node, st, c) {\n  for (var i = 0, list = node.body; i < list.length; i += 1)\n    {\n    var stmt = list[i];\n\n    c(stmt, st, \"Statement\");\n  }\n};\nbase.Statement = skipThrough;\nbase.EmptyStatement = ignore;\nbase.ExpressionStatement = base.ParenthesizedExpression = base.ChainExpression =\n  function (node, st, c) { return c(node.expression, st, \"Expression\"); };\nbase.IfStatement = function (node, st, c) {\n  c(node.test, st, \"Expression\");\n  c(node.consequent, st, \"Statement\");\n  if (node.alternate) { c(node.alternate, st, \"Statement\"); }\n};\nbase.LabeledStatement = function (node, st, c) { return c(node.body, st, \"Statement\"); };\nbase.BreakStatement = base.ContinueStatement = ignore;\nbase.WithStatement = function (node, st, c) {\n  c(node.object, st, \"Expression\");\n  c(node.body, st, \"Statement\");\n};\nbase.SwitchStatement = function (node, st, c) {\n  c(node.discriminant, st, \"Expression\");\n  for (var i$1 = 0, list$1 = node.cases; i$1 < list$1.length; i$1 += 1) {\n    var cs = list$1[i$1];\n\n    if (cs.test) { c(cs.test, st, \"Expression\"); }\n    for (var i = 0, list = cs.consequent; i < list.length; i += 1)\n      {\n      var cons = list[i];\n\n      c(cons, st, \"Statement\");\n    }\n  }\n};\nbase.SwitchCase = function (node, st, c) {\n  if (node.test) { c(node.test, st, \"Expression\"); }\n  for (var i = 0, list = node.consequent; i < list.length; i += 1)\n    {\n    var cons = list[i];\n\n    c(cons, st, \"Statement\");\n  }\n};\nbase.ReturnStatement = base.YieldExpression = base.AwaitExpression = function (node, st, c) {\n  if (node.argument) { c(node.argument, st, \"Expression\"); }\n};\nbase.ThrowStatement = base.SpreadElement =\n  function (node, st, c) { return c(node.argument, st, \"Expression\"); };\nbase.TryStatement = function (node, st, c) {\n  c(node.block, st, \"Statement\");\n  if (node.handler) { c(node.handler, st); }\n  if (node.finalizer) { c(node.finalizer, st, \"Statement\"); }\n};\nbase.CatchClause = function (node, st, c) {\n  if (node.param) { c(node.param, st, \"Pattern\"); }\n  c(node.body, st, \"Statement\");\n};\nbase.WhileStatement = base.DoWhileStatement = function (node, st, c) {\n  c(node.test, st, \"Expression\");\n  c(node.body, st, \"Statement\");\n};\nbase.ForStatement = function (node, st, c) {\n  if (node.init) { c(node.init, st, \"ForInit\"); }\n  if (node.test) { c(node.test, st, \"Expression\"); }\n  if (node.update) { c(node.update, st, \"Expression\"); }\n  c(node.body, st, \"Statement\");\n};\nbase.ForInStatement = base.ForOfStatement = function (node, st, c) {\n  c(node.left, st, \"ForInit\");\n  c(node.right, st, \"Expression\");\n  c(node.body, st, \"Statement\");\n};\nbase.ForInit = function (node, st, c) {\n  if (node.type === \"VariableDeclaration\") { c(node, st); }\n  else { c(node, st, \"Expression\"); }\n};\nbase.DebuggerStatement = ignore;\n\nbase.FunctionDeclaration = function (node, st, c) { return c(node, st, \"Function\"); };\nbase.VariableDeclaration = function (node, st, c) {\n  for (var i = 0, list = node.declarations; i < list.length; i += 1)\n    {\n    var decl = list[i];\n\n    c(decl, st);\n  }\n};\nbase.VariableDeclarator = function (node, st, c) {\n  c(node.id, st, \"Pattern\");\n  if (node.init) { c(node.init, st, \"Expression\"); }\n};\n\nbase.Function = function (node, st, c) {\n  if (node.id) { c(node.id, st, \"Pattern\"); }\n  for (var i = 0, list = node.params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    c(param, st, \"Pattern\");\n  }\n  c(node.body, st, node.expression ? \"Expression\" : \"Statement\");\n};\n\nbase.Pattern = function (node, st, c) {\n  if (node.type === \"Identifier\")\n    { c(node, st, \"VariablePattern\"); }\n  else if (node.type === \"MemberExpression\")\n    { c(node, st, \"MemberPattern\"); }\n  else\n    { c(node, st); }\n};\nbase.VariablePattern = ignore;\nbase.MemberPattern = skipThrough;\nbase.RestElement = function (node, st, c) { return c(node.argument, st, \"Pattern\"); };\nbase.ArrayPattern = function (node, st, c) {\n  for (var i = 0, list = node.elements; i < list.length; i += 1) {\n    var elt = list[i];\n\n    if (elt) { c(elt, st, \"Pattern\"); }\n  }\n};\nbase.ObjectPattern = function (node, st, c) {\n  for (var i = 0, list = node.properties; i < list.length; i += 1) {\n    var prop = list[i];\n\n    if (prop.type === \"Property\") {\n      if (prop.computed) { c(prop.key, st, \"Expression\"); }\n      c(prop.value, st, \"Pattern\");\n    } else if (prop.type === \"RestElement\") {\n      c(prop.argument, st, \"Pattern\");\n    }\n  }\n};\n\nbase.Expression = skipThrough;\nbase.ThisExpression = base.Super = base.MetaProperty = ignore;\nbase.ArrayExpression = function (node, st, c) {\n  for (var i = 0, list = node.elements; i < list.length; i += 1) {\n    var elt = list[i];\n\n    if (elt) { c(elt, st, \"Expression\"); }\n  }\n};\nbase.ObjectExpression = function (node, st, c) {\n  for (var i = 0, list = node.properties; i < list.length; i += 1)\n    {\n    var prop = list[i];\n\n    c(prop, st);\n  }\n};\nbase.FunctionExpression = base.ArrowFunctionExpression = base.FunctionDeclaration;\nbase.SequenceExpression = function (node, st, c) {\n  for (var i = 0, list = node.expressions; i < list.length; i += 1)\n    {\n    var expr = list[i];\n\n    c(expr, st, \"Expression\");\n  }\n};\nbase.TemplateLiteral = function (node, st, c) {\n  for (var i = 0, list = node.quasis; i < list.length; i += 1)\n    {\n    var quasi = list[i];\n\n    c(quasi, st);\n  }\n\n  for (var i$1 = 0, list$1 = node.expressions; i$1 < list$1.length; i$1 += 1)\n    {\n    var expr = list$1[i$1];\n\n    c(expr, st, \"Expression\");\n  }\n};\nbase.TemplateElement = ignore;\nbase.UnaryExpression = base.UpdateExpression = function (node, st, c) {\n  c(node.argument, st, \"Expression\");\n};\nbase.BinaryExpression = base.LogicalExpression = function (node, st, c) {\n  c(node.left, st, \"Expression\");\n  c(node.right, st, \"Expression\");\n};\nbase.AssignmentExpression = base.AssignmentPattern = function (node, st, c) {\n  c(node.left, st, \"Pattern\");\n  c(node.right, st, \"Expression\");\n};\nbase.ConditionalExpression = function (node, st, c) {\n  c(node.test, st, \"Expression\");\n  c(node.consequent, st, \"Expression\");\n  c(node.alternate, st, \"Expression\");\n};\nbase.NewExpression = base.CallExpression = function (node, st, c) {\n  c(node.callee, st, \"Expression\");\n  if (node.arguments)\n    { for (var i = 0, list = node.arguments; i < list.length; i += 1)\n      {\n        var arg = list[i];\n\n        c(arg, st, \"Expression\");\n      } }\n};\nbase.MemberExpression = function (node, st, c) {\n  c(node.object, st, \"Expression\");\n  if (node.computed) { c(node.property, st, \"Expression\"); }\n};\nbase.ExportNamedDeclaration = base.ExportDefaultDeclaration = function (node, st, c) {\n  if (node.declaration)\n    { c(node.declaration, st, node.type === \"ExportNamedDeclaration\" || node.declaration.id ? \"Statement\" : \"Expression\"); }\n  if (node.source) { c(node.source, st, \"Expression\"); }\n};\nbase.ExportAllDeclaration = function (node, st, c) {\n  if (node.exported)\n    { c(node.exported, st); }\n  c(node.source, st, \"Expression\");\n};\nbase.ImportDeclaration = function (node, st, c) {\n  for (var i = 0, list = node.specifiers; i < list.length; i += 1)\n    {\n    var spec = list[i];\n\n    c(spec, st);\n  }\n  c(node.source, st, \"Expression\");\n};\nbase.ImportExpression = function (node, st, c) {\n  c(node.source, st, \"Expression\");\n};\nbase.ImportSpecifier = base.ImportDefaultSpecifier = base.ImportNamespaceSpecifier = base.Identifier = base.Literal = ignore;\n\nbase.TaggedTemplateExpression = function (node, st, c) {\n  c(node.tag, st, \"Expression\");\n  c(node.quasi, st, \"Expression\");\n};\nbase.ClassDeclaration = base.ClassExpression = function (node, st, c) { return c(node, st, \"Class\"); };\nbase.Class = function (node, st, c) {\n  if (node.id) { c(node.id, st, \"Pattern\"); }\n  if (node.superClass) { c(node.superClass, st, \"Expression\"); }\n  c(node.body, st);\n};\nbase.ClassBody = function (node, st, c) {\n  for (var i = 0, list = node.body; i < list.length; i += 1)\n    {\n    var elt = list[i];\n\n    c(elt, st);\n  }\n};\nbase.MethodDefinition = base.Property = function (node, st, c) {\n  if (node.computed) { c(node.key, st, \"Expression\"); }\n  c(node.value, st, \"Expression\");\n};\n\nexport { ancestor, base, findNodeAfter, findNodeAround, findNodeAt, findNodeBefore, full, fullAncestor, make, recursive, simple };\n","var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar isPlainObject = require('is-plain-object');\nvar React = require('react');\nvar prettyPrintObject = require('@base2/pretty-print-object');\nvar reactIs = require('react-is');\n\nfunction _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }\n\nfunction _interopNamespace(e) {\n  if (e && e.__esModule) return e;\n  var n = Object.create(null);\n  if (e) {\n    Object.keys(e).forEach(function (k) {\n      if (k !== 'default') {\n        var d = Object.getOwnPropertyDescriptor(e, k);\n        Object.defineProperty(n, k, d.get ? d : {\n          enumerable: true,\n          get: function () { return e[k]; }\n        });\n      }\n    });\n  }\n  n[\"default\"] = e;\n  return Object.freeze(n);\n}\n\nvar React__namespace = /*#__PURE__*/_interopNamespace(React);\nvar React__default = /*#__PURE__*/_interopDefaultLegacy(React);\n\nvar spacer = (function (times, tabStop) {\n  if (times === 0) {\n    return '';\n  }\n\n  return new Array(times * tabStop).fill(' ').join('');\n});\n\nfunction _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, _typeof(obj);\n}\n\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();\n}\n\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return _arrayLikeToArray(arr);\n}\n\nfunction _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];\n\n  return arr2;\n}\n\nfunction _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction safeSortObject(value, seen) {\n  // return non-object value as is\n  if (value === null || _typeof(value) !== 'object') {\n    return value;\n  } // return date, regexp and react element values as is\n\n\n  if (value instanceof Date || value instanceof RegExp || /*#__PURE__*/React__namespace.isValidElement(value)) {\n    return value;\n  }\n\n  seen.add(value); // make a copy of array with each item passed through the sorting algorithm\n\n  if (Array.isArray(value)) {\n    return value.map(function (v) {\n      return safeSortObject(v, seen);\n    });\n  } // make a copy of object with key sorted\n\n\n  return Object.keys(value).sort().reduce(function (result, key) {\n    if (key === '_owner') {\n      return result;\n    }\n\n    if (key === 'current' || seen.has(value[key])) {\n      // eslint-disable-next-line no-param-reassign\n      result[key] = '[Circular]';\n    } else {\n      // eslint-disable-next-line no-param-reassign\n      result[key] = safeSortObject(value[key], seen);\n    }\n\n    return result;\n  }, {});\n}\n\nfunction sortObject(value) {\n  return safeSortObject(value, new WeakSet());\n}\n\n/* eslint-disable no-use-before-define */\nvar createStringTreeNode = function createStringTreeNode(value) {\n  return {\n    type: 'string',\n    value: value\n  };\n};\nvar createNumberTreeNode = function createNumberTreeNode(value) {\n  return {\n    type: 'number',\n    value: value\n  };\n};\nvar createReactElementTreeNode = function createReactElementTreeNode(displayName, props, defaultProps, childrens) {\n  return {\n    type: 'ReactElement',\n    displayName: displayName,\n    props: props,\n    defaultProps: defaultProps,\n    childrens: childrens\n  };\n};\nvar createReactFragmentTreeNode = function createReactFragmentTreeNode(key, childrens) {\n  return {\n    type: 'ReactFragment',\n    key: key,\n    childrens: childrens\n  };\n};\n\nvar supportFragment = Boolean(React.Fragment);\n\nvar getFunctionTypeName = function getFunctionTypeName(functionType) {\n  if (!functionType.name || functionType.name === '_default') {\n    return 'No Display Name';\n  }\n\n  return functionType.name;\n};\n\nvar getWrappedComponentDisplayName = function getWrappedComponentDisplayName(Component) {\n  switch (true) {\n    case Boolean(Component.displayName):\n      return Component.displayName;\n\n    case Component.$$typeof === reactIs.Memo:\n      return getWrappedComponentDisplayName(Component.type);\n\n    case Component.$$typeof === reactIs.ForwardRef:\n      return getWrappedComponentDisplayName(Component.render);\n\n    default:\n      return getFunctionTypeName(Component);\n  }\n}; // heavily inspired by:\n// https://github.com/facebook/react/blob/3746eaf985dd92f8aa5f5658941d07b6b855e9d9/packages/react-devtools-shared/src/backend/renderer.js#L399-L496\n\n\nvar getReactElementDisplayName = function getReactElementDisplayName(element) {\n  switch (true) {\n    case typeof element.type === 'string':\n      return element.type;\n\n    case typeof element.type === 'function':\n      if (element.type.displayName) {\n        return element.type.displayName;\n      }\n\n      return getFunctionTypeName(element.type);\n\n    case reactIs.isForwardRef(element):\n    case reactIs.isMemo(element):\n      return getWrappedComponentDisplayName(element.type);\n\n    case reactIs.isContextConsumer(element):\n      return \"\".concat(element.type._context.displayName || 'Context', \".Consumer\");\n\n    case reactIs.isContextProvider(element):\n      return \"\".concat(element.type._context.displayName || 'Context', \".Provider\");\n\n    case reactIs.isLazy(element):\n      return 'Lazy';\n\n    case reactIs.isProfiler(element):\n      return 'Profiler';\n\n    case reactIs.isStrictMode(element):\n      return 'StrictMode';\n\n    case reactIs.isSuspense(element):\n      return 'Suspense';\n\n    default:\n      return 'UnknownElementType';\n  }\n};\n\nvar noChildren = function noChildren(propsValue, propName) {\n  return propName !== 'children';\n};\n\nvar onlyMeaningfulChildren = function onlyMeaningfulChildren(children) {\n  return children !== true && children !== false && children !== null && children !== '';\n};\n\nvar filterProps = function filterProps(originalProps, cb) {\n  var filteredProps = {};\n  Object.keys(originalProps).filter(function (key) {\n    return cb(originalProps[key], key);\n  }).forEach(function (key) {\n    return filteredProps[key] = originalProps[key];\n  });\n  return filteredProps;\n};\n\nvar parseReactElement = function parseReactElement(element, options) {\n  var _options$displayName = options.displayName,\n      displayNameFn = _options$displayName === void 0 ? getReactElementDisplayName : _options$displayName;\n\n  if (typeof element === 'string') {\n    return createStringTreeNode(element);\n  } else if (typeof element === 'number') {\n    return createNumberTreeNode(element);\n  } else if (! /*#__PURE__*/React__default[\"default\"].isValidElement(element)) {\n    throw new Error(\"react-element-to-jsx-string: Expected a React.Element, got `\".concat(_typeof(element), \"`\"));\n  }\n\n  var displayName = displayNameFn(element);\n  var props = filterProps(element.props, noChildren);\n\n  if (element.ref !== null) {\n    props.ref = element.ref;\n  }\n\n  var key = element.key;\n\n  if (typeof key === 'string' && key.search(/^\\./)) {\n    // React automatically add key=\".X\" when there are some children\n    props.key = key;\n  }\n\n  var defaultProps = filterProps(element.type.defaultProps || {}, noChildren);\n  var childrens = React__default[\"default\"].Children.toArray(element.props.children).filter(onlyMeaningfulChildren).map(function (child) {\n    return parseReactElement(child, options);\n  });\n\n  if (supportFragment && element.type === React.Fragment) {\n    return createReactFragmentTreeNode(key, childrens);\n  }\n\n  return createReactElementTreeNode(displayName, props, defaultProps, childrens);\n};\n\nfunction noRefCheck() {}\n\nvar inlineFunction = function inlineFunction(fn) {\n  return fn.toString().split('\\n').map(function (line) {\n    return line.trim();\n  }).join('');\n};\nvar preserveFunctionLineBreak = function preserveFunctionLineBreak(fn) {\n  return fn.toString();\n};\nvar defaultFunctionValue = inlineFunction;\nvar formatFunction = (function (fn, options) {\n  var _options$functionValu = options.functionValue,\n      functionValue = _options$functionValu === void 0 ? defaultFunctionValue : _options$functionValu,\n      showFunctions = options.showFunctions;\n\n  if (!showFunctions && functionValue === defaultFunctionValue) {\n    return functionValue(noRefCheck);\n  }\n\n  return functionValue(fn);\n});\n\nvar formatComplexDataStructure = (function (value, inline, lvl, options) {\n  var normalizedValue = sortObject(value);\n  var stringifiedValue = prettyPrintObject.prettyPrint(normalizedValue, {\n    transform: function transform(currentObj, prop, originalResult) {\n      var currentValue = currentObj[prop];\n\n      if (currentValue && /*#__PURE__*/React.isValidElement(currentValue)) {\n        return formatTreeNode(parseReactElement(currentValue, options), true, lvl, options);\n      }\n\n      if (typeof currentValue === 'function') {\n        return formatFunction(currentValue, options);\n      }\n\n      return originalResult;\n    }\n  });\n\n  if (inline) {\n    return stringifiedValue.replace(/\\s+/g, ' ').replace(/{ /g, '{').replace(/ }/g, '}').replace(/\\[ /g, '[').replace(/ ]/g, ']');\n  } // Replace tabs with spaces, and add necessary indentation in front of each new line\n\n\n  return stringifiedValue.replace(/\\t/g, spacer(1, options.tabStop)).replace(/\\n([^$])/g, \"\\n\".concat(spacer(lvl + 1, options.tabStop), \"$1\"));\n});\n\nvar escape$1 = function escape(s) {\n  return s.replace(/\"/g, '&quot;');\n};\n\nvar formatPropValue = function formatPropValue(propValue, inline, lvl, options) {\n  if (typeof propValue === 'number') {\n    return \"{\".concat(String(propValue), \"}\");\n  }\n\n  if (typeof propValue === 'string') {\n    return \"\\\"\".concat(escape$1(propValue), \"\\\"\");\n  } // > \"Symbols (new in ECMAScript 2015, not yet supported in Flow)\"\n  // @see: https://flow.org/en/docs/types/primitives/\n  // $FlowFixMe: Flow does not support Symbol\n\n\n  if (_typeof(propValue) === 'symbol') {\n    var symbolDescription = propValue.valueOf().toString().replace(/Symbol\\((.*)\\)/, '$1');\n\n    if (!symbolDescription) {\n      return \"{Symbol()}\";\n    }\n\n    return \"{Symbol('\".concat(symbolDescription, \"')}\");\n  }\n\n  if (typeof propValue === 'function') {\n    return \"{\".concat(formatFunction(propValue, options), \"}\");\n  }\n\n  if ( /*#__PURE__*/React.isValidElement(propValue)) {\n    return \"{\".concat(formatTreeNode(parseReactElement(propValue, options), true, lvl, options), \"}\");\n  }\n\n  if (propValue instanceof Date) {\n    if (isNaN(propValue.valueOf())) {\n      return \"{new Date(NaN)}\";\n    }\n\n    return \"{new Date(\\\"\".concat(propValue.toISOString(), \"\\\")}\");\n  }\n\n  if (isPlainObject.isPlainObject(propValue) || Array.isArray(propValue)) {\n    return \"{\".concat(formatComplexDataStructure(propValue, inline, lvl, options), \"}\");\n  }\n\n  return \"{\".concat(String(propValue), \"}\");\n};\n\nvar formatProp = (function (name, hasValue, value, hasDefaultValue, defaultValue, inline, lvl, options) {\n  if (!hasValue && !hasDefaultValue) {\n    throw new Error(\"The prop \\\"\".concat(name, \"\\\" has no value and no default: could not be formatted\"));\n  }\n\n  var usedValue = hasValue ? value : defaultValue;\n  var useBooleanShorthandSyntax = options.useBooleanShorthandSyntax,\n      tabStop = options.tabStop;\n  var formattedPropValue = formatPropValue(usedValue, inline, lvl, options);\n  var attributeFormattedInline = ' ';\n  var attributeFormattedMultiline = \"\\n\".concat(spacer(lvl + 1, tabStop));\n  var isMultilineAttribute = formattedPropValue.includes('\\n');\n\n  if (useBooleanShorthandSyntax && formattedPropValue === '{false}' && !hasDefaultValue) {\n    // If a boolean is false and not different from it's default, we do not render the attribute\n    attributeFormattedInline = '';\n    attributeFormattedMultiline = '';\n  } else if (useBooleanShorthandSyntax && formattedPropValue === '{true}') {\n    attributeFormattedInline += \"\".concat(name);\n    attributeFormattedMultiline += \"\".concat(name);\n  } else {\n    attributeFormattedInline += \"\".concat(name, \"=\").concat(formattedPropValue);\n    attributeFormattedMultiline += \"\".concat(name, \"=\").concat(formattedPropValue);\n  }\n\n  return {\n    attributeFormattedInline: attributeFormattedInline,\n    attributeFormattedMultiline: attributeFormattedMultiline,\n    isMultilineAttribute: isMultilineAttribute\n  };\n});\n\nvar mergeSiblingPlainStringChildrenReducer = (function (previousNodes, currentNode) {\n  var nodes = previousNodes.slice(0, previousNodes.length > 0 ? previousNodes.length - 1 : 0);\n  var previousNode = previousNodes[previousNodes.length - 1];\n\n  if (previousNode && (currentNode.type === 'string' || currentNode.type === 'number') && (previousNode.type === 'string' || previousNode.type === 'number')) {\n    nodes.push(createStringTreeNode(String(previousNode.value) + String(currentNode.value)));\n  } else {\n    if (previousNode) {\n      nodes.push(previousNode);\n    }\n\n    nodes.push(currentNode);\n  }\n\n  return nodes;\n});\n\nvar isKeyOrRefProps = function isKeyOrRefProps(propName) {\n  return ['key', 'ref'].includes(propName);\n};\n\nvar sortPropsByNames = (function (shouldSortUserProps) {\n  return function (props) {\n    var haveKeyProp = props.includes('key');\n    var haveRefProp = props.includes('ref');\n    var userPropsOnly = props.filter(function (oneProp) {\n      return !isKeyOrRefProps(oneProp);\n    });\n    var sortedProps = shouldSortUserProps ? _toConsumableArray(userPropsOnly.sort()) // We use basic lexical order\n    : _toConsumableArray(userPropsOnly);\n\n    if (haveRefProp) {\n      sortedProps.unshift('ref');\n    }\n\n    if (haveKeyProp) {\n      sortedProps.unshift('key');\n    }\n\n    return sortedProps;\n  };\n});\n\nfunction createPropFilter(props, filter) {\n  if (Array.isArray(filter)) {\n    return function (key) {\n      return filter.indexOf(key) === -1;\n    };\n  } else {\n    return function (key) {\n      return filter(props[key], key);\n    };\n  }\n}\n\nvar compensateMultilineStringElementIndentation = function compensateMultilineStringElementIndentation(element, formattedElement, inline, lvl, options) {\n  var tabStop = options.tabStop;\n\n  if (element.type === 'string') {\n    return formattedElement.split('\\n').map(function (line, offset) {\n      if (offset === 0) {\n        return line;\n      }\n\n      return \"\".concat(spacer(lvl, tabStop)).concat(line);\n    }).join('\\n');\n  }\n\n  return formattedElement;\n};\n\nvar formatOneChildren = function formatOneChildren(inline, lvl, options) {\n  return function (element) {\n    return compensateMultilineStringElementIndentation(element, formatTreeNode(element, inline, lvl, options), inline, lvl, options);\n  };\n};\n\nvar onlyPropsWithOriginalValue = function onlyPropsWithOriginalValue(defaultProps, props) {\n  return function (propName) {\n    var haveDefaultValue = Object.keys(defaultProps).includes(propName);\n    return !haveDefaultValue || haveDefaultValue && defaultProps[propName] !== props[propName];\n  };\n};\n\nvar isInlineAttributeTooLong = function isInlineAttributeTooLong(attributes, inlineAttributeString, lvl, tabStop, maxInlineAttributesLineLength) {\n  if (!maxInlineAttributesLineLength) {\n    return attributes.length > 1;\n  }\n\n  return spacer(lvl, tabStop).length + inlineAttributeString.length > maxInlineAttributesLineLength;\n};\n\nvar shouldRenderMultilineAttr = function shouldRenderMultilineAttr(attributes, inlineAttributeString, containsMultilineAttr, inline, lvl, tabStop, maxInlineAttributesLineLength) {\n  return (isInlineAttributeTooLong(attributes, inlineAttributeString, lvl, tabStop, maxInlineAttributesLineLength) || containsMultilineAttr) && !inline;\n};\n\nvar formatReactElementNode = (function (node, inline, lvl, options) {\n  var type = node.type,\n      _node$displayName = node.displayName,\n      displayName = _node$displayName === void 0 ? '' : _node$displayName,\n      childrens = node.childrens,\n      _node$props = node.props,\n      props = _node$props === void 0 ? {} : _node$props,\n      _node$defaultProps = node.defaultProps,\n      defaultProps = _node$defaultProps === void 0 ? {} : _node$defaultProps;\n\n  if (type !== 'ReactElement') {\n    throw new Error(\"The \\\"formatReactElementNode\\\" function could only format node of type \\\"ReactElement\\\". Given:  \".concat(type));\n  }\n\n  var filterProps = options.filterProps,\n      maxInlineAttributesLineLength = options.maxInlineAttributesLineLength,\n      showDefaultProps = options.showDefaultProps,\n      sortProps = options.sortProps,\n      tabStop = options.tabStop;\n  var out = \"<\".concat(displayName);\n  var outInlineAttr = out;\n  var outMultilineAttr = out;\n  var containsMultilineAttr = false;\n  var visibleAttributeNames = [];\n  var propFilter = createPropFilter(props, filterProps);\n  Object.keys(props).filter(propFilter).filter(onlyPropsWithOriginalValue(defaultProps, props)).forEach(function (propName) {\n    return visibleAttributeNames.push(propName);\n  });\n  Object.keys(defaultProps).filter(propFilter).filter(function () {\n    return showDefaultProps;\n  }).filter(function (defaultPropName) {\n    return !visibleAttributeNames.includes(defaultPropName);\n  }).forEach(function (defaultPropName) {\n    return visibleAttributeNames.push(defaultPropName);\n  });\n  var attributes = sortPropsByNames(sortProps)(visibleAttributeNames);\n  attributes.forEach(function (attributeName) {\n    var _formatProp = formatProp(attributeName, Object.keys(props).includes(attributeName), props[attributeName], Object.keys(defaultProps).includes(attributeName), defaultProps[attributeName], inline, lvl, options),\n        attributeFormattedInline = _formatProp.attributeFormattedInline,\n        attributeFormattedMultiline = _formatProp.attributeFormattedMultiline,\n        isMultilineAttribute = _formatProp.isMultilineAttribute;\n\n    if (isMultilineAttribute) {\n      containsMultilineAttr = true;\n    }\n\n    outInlineAttr += attributeFormattedInline;\n    outMultilineAttr += attributeFormattedMultiline;\n  });\n  outMultilineAttr += \"\\n\".concat(spacer(lvl, tabStop));\n\n  if (shouldRenderMultilineAttr(attributes, outInlineAttr, containsMultilineAttr, inline, lvl, tabStop, maxInlineAttributesLineLength)) {\n    out = outMultilineAttr;\n  } else {\n    out = outInlineAttr;\n  }\n\n  if (childrens && childrens.length > 0) {\n    var newLvl = lvl + 1;\n    out += '>';\n\n    if (!inline) {\n      out += '\\n';\n      out += spacer(newLvl, tabStop);\n    }\n\n    out += childrens.reduce(mergeSiblingPlainStringChildrenReducer, []).map(formatOneChildren(inline, newLvl, options)).join(!inline ? \"\\n\".concat(spacer(newLvl, tabStop)) : '');\n\n    if (!inline) {\n      out += '\\n';\n      out += spacer(newLvl - 1, tabStop);\n    }\n\n    out += \"</\".concat(displayName, \">\");\n  } else {\n    if (!isInlineAttributeTooLong(attributes, outInlineAttr, lvl, tabStop, maxInlineAttributesLineLength)) {\n      out += ' ';\n    }\n\n    out += '/>';\n  }\n\n  return out;\n});\n\nvar REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX = '';\nvar REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX = 'React.Fragment';\n\nvar toReactElementTreeNode = function toReactElementTreeNode(displayName, key, childrens) {\n  var props = {};\n\n  if (key) {\n    props = {\n      key: key\n    };\n  }\n\n  return {\n    type: 'ReactElement',\n    displayName: displayName,\n    props: props,\n    defaultProps: {},\n    childrens: childrens\n  };\n};\n\nvar isKeyedFragment = function isKeyedFragment(_ref) {\n  var key = _ref.key;\n  return Boolean(key);\n};\n\nvar hasNoChildren = function hasNoChildren(_ref2) {\n  var childrens = _ref2.childrens;\n  return childrens.length === 0;\n};\n\nvar formatReactFragmentNode = (function (node, inline, lvl, options) {\n  var type = node.type,\n      key = node.key,\n      childrens = node.childrens;\n\n  if (type !== 'ReactFragment') {\n    throw new Error(\"The \\\"formatReactFragmentNode\\\" function could only format node of type \\\"ReactFragment\\\". Given: \".concat(type));\n  }\n\n  var useFragmentShortSyntax = options.useFragmentShortSyntax;\n  var displayName;\n\n  if (useFragmentShortSyntax) {\n    if (hasNoChildren(node) || isKeyedFragment(node)) {\n      displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n    } else {\n      displayName = REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX;\n    }\n  } else {\n    displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n  }\n\n  return formatReactElementNode(toReactElementTreeNode(displayName, key, childrens), inline, lvl, options);\n});\n\nvar jsxStopChars = ['<', '>', '{', '}'];\n\nvar shouldBeEscaped = function shouldBeEscaped(s) {\n  return jsxStopChars.some(function (jsxStopChar) {\n    return s.includes(jsxStopChar);\n  });\n};\n\nvar escape = function escape(s) {\n  if (!shouldBeEscaped(s)) {\n    return s;\n  }\n\n  return \"{`\".concat(s, \"`}\");\n};\n\nvar preserveTrailingSpace = function preserveTrailingSpace(s) {\n  var result = s;\n\n  if (result.endsWith(' ')) {\n    result = result.replace(/^(.*?)(\\s+)$/, \"$1{'$2'}\");\n  }\n\n  if (result.startsWith(' ')) {\n    result = result.replace(/^(\\s+)(.*)$/, \"{'$1'}$2\");\n  }\n\n  return result;\n};\n\nvar formatTreeNode = (function (node, inline, lvl, options) {\n  if (node.type === 'number') {\n    return String(node.value);\n  }\n\n  if (node.type === 'string') {\n    return node.value ? \"\".concat(preserveTrailingSpace(escape(String(node.value)))) : '';\n  }\n\n  if (node.type === 'ReactElement') {\n    return formatReactElementNode(node, inline, lvl, options);\n  }\n\n  if (node.type === 'ReactFragment') {\n    return formatReactFragmentNode(node, inline, lvl, options);\n  }\n\n  throw new TypeError(\"Unknow format type \\\"\".concat(node.type, \"\\\"\"));\n});\n\nvar formatTree = (function (node, options) {\n  return formatTreeNode(node, false, 0, options);\n});\n\nvar reactElementToJsxString = function reactElementToJsxString(element) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n      _ref$filterProps = _ref.filterProps,\n      filterProps = _ref$filterProps === void 0 ? [] : _ref$filterProps,\n      _ref$showDefaultProps = _ref.showDefaultProps,\n      showDefaultProps = _ref$showDefaultProps === void 0 ? true : _ref$showDefaultProps,\n      _ref$showFunctions = _ref.showFunctions,\n      showFunctions = _ref$showFunctions === void 0 ? false : _ref$showFunctions,\n      functionValue = _ref.functionValue,\n      _ref$tabStop = _ref.tabStop,\n      tabStop = _ref$tabStop === void 0 ? 2 : _ref$tabStop,\n      _ref$useBooleanShorth = _ref.useBooleanShorthandSyntax,\n      useBooleanShorthandSyntax = _ref$useBooleanShorth === void 0 ? true : _ref$useBooleanShorth,\n      _ref$useFragmentShort = _ref.useFragmentShortSyntax,\n      useFragmentShortSyntax = _ref$useFragmentShort === void 0 ? true : _ref$useFragmentShort,\n      _ref$sortProps = _ref.sortProps,\n      sortProps = _ref$sortProps === void 0 ? true : _ref$sortProps,\n      maxInlineAttributesLineLength = _ref.maxInlineAttributesLineLength,\n      displayName = _ref.displayName;\n\n  if (!element) {\n    throw new Error('react-element-to-jsx-string: Expected a ReactElement');\n  }\n\n  var options = {\n    filterProps: filterProps,\n    showDefaultProps: showDefaultProps,\n    showFunctions: showFunctions,\n    functionValue: functionValue,\n    tabStop: tabStop,\n    useBooleanShorthandSyntax: useBooleanShorthandSyntax,\n    useFragmentShortSyntax: useFragmentShortSyntax,\n    sortProps: sortProps,\n    maxInlineAttributesLineLength: maxInlineAttributesLineLength,\n    displayName: displayName\n  };\n  return formatTree(parseReactElement(element, options), options);\n};\n\nexports[\"default\"] = reactElementToJsxString;\nexports.inlineFunction = inlineFunction;\nexports.preserveFunctionLineBreak = preserveFunctionLineBreak;\n//# sourceMappingURL=index.js.map\n","/* @flow */\n\nexport default (times: number, tabStop: number): string => {\n  if (times === 0) {\n    return '';\n  }\n\n  return new Array(times * tabStop).fill(' ').join('');\n};\n","/* @flow */\nimport * as React from 'react';\n\nfunction safeSortObject(value: any, seen: WeakSet<any>): any {\n  // return non-object value as is\n  if (value === null || typeof value !== 'object') {\n    return value;\n  }\n\n  // return date, regexp and react element values as is\n  if (\n    value instanceof Date ||\n    value instanceof RegExp ||\n    React.isValidElement(value)\n  ) {\n    return value;\n  }\n\n  seen.add(value);\n\n  // make a copy of array with each item passed through the sorting algorithm\n  if (Array.isArray(value)) {\n    return value.map(v => safeSortObject(v, seen));\n  }\n\n  // make a copy of object with key sorted\n  return Object.keys(value)\n    .sort()\n    .reduce((result, key) => {\n      if (key === '_owner') {\n        return result;\n      }\n      if (key === 'current' || seen.has(value[key])) {\n        // eslint-disable-next-line no-param-reassign\n        result[key] = '[Circular]';\n      } else {\n        // eslint-disable-next-line no-param-reassign\n        result[key] = safeSortObject(value[key], seen);\n      }\n      return result;\n    }, {});\n}\n\nexport default function sortObject(value: any): any {\n  return safeSortObject(value, new WeakSet());\n}\n","/* @flow */\n/* eslint-disable no-use-before-define */\n\nimport type { Key } from 'react';\n\ntype PropsType = { [key: string]: any };\ntype DefaultPropsType = { [key: string]: any };\n\nexport type StringTreeNode = {|\n  type: 'string',\n  value: string,\n|};\n\nexport type NumberTreeNode = {|\n  type: 'number',\n  value: number,\n|};\n\nexport type ReactElementTreeNode = {|\n  type: 'ReactElement',\n  displayName: string,\n  props: PropsType,\n  defaultProps: DefaultPropsType,\n  childrens: TreeNode[],\n|};\n\nexport type ReactFragmentTreeNode = {|\n  type: 'ReactFragment',\n  key: ?Key,\n  childrens: TreeNode[],\n|};\n\nexport type TreeNode =\n  | StringTreeNode\n  | NumberTreeNode\n  | ReactElementTreeNode\n  | ReactFragmentTreeNode;\n\nexport const createStringTreeNode = (value: string): StringTreeNode => ({\n  type: 'string',\n  value,\n});\n\nexport const createNumberTreeNode = (value: number): NumberTreeNode => ({\n  type: 'number',\n  value,\n});\n\nexport const createReactElementTreeNode = (\n  displayName: string,\n  props: PropsType,\n  defaultProps: DefaultPropsType,\n  childrens: TreeNode[]\n): ReactElementTreeNode => ({\n  type: 'ReactElement',\n  displayName,\n  props,\n  defaultProps,\n  childrens,\n});\n\nexport const createReactFragmentTreeNode = (\n  key: ?Key,\n  childrens: TreeNode[]\n): ReactFragmentTreeNode => ({\n  type: 'ReactFragment',\n  key,\n  childrens,\n});\n","/* @flow */\n\nimport React, { type Element as ReactElement, Fragment } from 'react';\nimport {\n  ForwardRef,\n  isContextConsumer,\n  isContextProvider,\n  isForwardRef,\n  isLazy,\n  isMemo,\n  isProfiler,\n  isStrictMode,\n  isSuspense,\n  Memo,\n} from 'react-is';\nimport type { Options } from './../options';\nimport {\n  createStringTreeNode,\n  createNumberTreeNode,\n  createReactElementTreeNode,\n  createReactFragmentTreeNode,\n} from './../tree';\nimport type { TreeNode } from './../tree';\n\nconst supportFragment = Boolean(Fragment);\n\nconst getFunctionTypeName = (functionType): string => {\n  if (!functionType.name || functionType.name === '_default') {\n    return 'No Display Name';\n  }\n  return functionType.name;\n};\n\nconst getWrappedComponentDisplayName = (Component: *): string => {\n  switch (true) {\n    case Boolean(Component.displayName):\n      return Component.displayName;\n    case Component.$$typeof === Memo:\n      return getWrappedComponentDisplayName(Component.type);\n    case Component.$$typeof === ForwardRef:\n      return getWrappedComponentDisplayName(Component.render);\n    default:\n      return getFunctionTypeName(Component);\n  }\n};\n\n// heavily inspired by:\n// https://github.com/facebook/react/blob/3746eaf985dd92f8aa5f5658941d07b6b855e9d9/packages/react-devtools-shared/src/backend/renderer.js#L399-L496\nconst getReactElementDisplayName = (element: ReactElement<*>): string => {\n  switch (true) {\n    case typeof element.type === 'string':\n      return element.type;\n    case typeof element.type === 'function':\n      if (element.type.displayName) {\n        return element.type.displayName;\n      }\n      return getFunctionTypeName(element.type);\n    case isForwardRef(element):\n    case isMemo(element):\n      return getWrappedComponentDisplayName(element.type);\n    case isContextConsumer(element):\n      return `${element.type._context.displayName || 'Context'}.Consumer`;\n    case isContextProvider(element):\n      return `${element.type._context.displayName || 'Context'}.Provider`;\n    case isLazy(element):\n      return 'Lazy';\n    case isProfiler(element):\n      return 'Profiler';\n    case isStrictMode(element):\n      return 'StrictMode';\n    case isSuspense(element):\n      return 'Suspense';\n    default:\n      return 'UnknownElementType';\n  }\n};\n\nconst noChildren = (propsValue, propName) => propName !== 'children';\n\nconst onlyMeaningfulChildren = (children): boolean =>\n  children !== true &&\n  children !== false &&\n  children !== null &&\n  children !== '';\n\nconst filterProps = (originalProps: {}, cb: (any, string) => boolean) => {\n  const filteredProps = {};\n\n  Object.keys(originalProps)\n    .filter(key => cb(originalProps[key], key))\n    .forEach(key => (filteredProps[key] = originalProps[key]));\n\n  return filteredProps;\n};\n\nconst parseReactElement = (\n  element: ReactElement<*> | string | number,\n  options: Options\n): TreeNode => {\n  const { displayName: displayNameFn = getReactElementDisplayName } = options;\n\n  if (typeof element === 'string') {\n    return createStringTreeNode(element);\n  } else if (typeof element === 'number') {\n    return createNumberTreeNode(element);\n  } else if (!React.isValidElement(element)) {\n    throw new Error(\n      `react-element-to-jsx-string: Expected a React.Element, got \\`${typeof element}\\``\n    );\n  }\n\n  const displayName = displayNameFn(element);\n\n  const props = filterProps(element.props, noChildren);\n  if (element.ref !== null) {\n    props.ref = element.ref;\n  }\n\n  const key = element.key;\n  if (typeof key === 'string' && key.search(/^\\./)) {\n    // React automatically add key=\".X\" when there are some children\n    props.key = key;\n  }\n\n  const defaultProps = filterProps(element.type.defaultProps || {}, noChildren);\n  const childrens = React.Children.toArray(element.props.children)\n    .filter(onlyMeaningfulChildren)\n    .map(child => parseReactElement(child, options));\n\n  if (supportFragment && element.type === Fragment) {\n    return createReactFragmentTreeNode(key, childrens);\n  }\n\n  return createReactElementTreeNode(\n    displayName,\n    props,\n    defaultProps,\n    childrens\n  );\n};\n\nexport default parseReactElement;\n","import type { Options } from './../options';\n\nfunction noRefCheck() {}\n\nexport const inlineFunction = (fn: any): string =>\n  fn\n    .toString()\n    .split('\\n')\n    .map(line => line.trim())\n    .join('');\n\nexport const preserveFunctionLineBreak = (fn: any): string => fn.toString();\n\nconst defaultFunctionValue = inlineFunction;\n\nexport default (fn: Function, options: Options): string => {\n  const { functionValue = defaultFunctionValue, showFunctions } = options;\n  if (!showFunctions && functionValue === defaultFunctionValue) {\n    return functionValue(noRefCheck);\n  }\n\n  return functionValue(fn);\n};\n","/* @flow */\n\nimport { isValidElement } from 'react';\nimport { prettyPrint } from '@base2/pretty-print-object';\nimport sortObject from './sortObject';\nimport parseReactElement from './../parser/parseReactElement';\nimport formatTreeNode from './formatTreeNode';\nimport formatFunction from './formatFunction';\nimport spacer from './spacer';\nimport type { Options } from './../options';\n\nexport default (\n  value: Object | Array<any>,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): string => {\n  const normalizedValue = sortObject(value);\n\n  const stringifiedValue = prettyPrint(normalizedValue, {\n    transform: (currentObj, prop, originalResult) => {\n      const currentValue = currentObj[prop];\n\n      if (currentValue && isValidElement(currentValue)) {\n        return formatTreeNode(\n          parseReactElement(currentValue, options),\n          true,\n          lvl,\n          options\n        );\n      }\n\n      if (typeof currentValue === 'function') {\n        return formatFunction(currentValue, options);\n      }\n\n      return originalResult;\n    },\n  });\n\n  if (inline) {\n    return stringifiedValue\n      .replace(/\\s+/g, ' ')\n      .replace(/{ /g, '{')\n      .replace(/ }/g, '}')\n      .replace(/\\[ /g, '[')\n      .replace(/ ]/g, ']');\n  }\n\n  // Replace tabs with spaces, and add necessary indentation in front of each new line\n  return stringifiedValue\n    .replace(/\\t/g, spacer(1, options.tabStop))\n    .replace(/\\n([^$])/g, `\\n${spacer(lvl + 1, options.tabStop)}$1`);\n};\n","/* @flow */\n\nimport { isPlainObject } from 'is-plain-object';\nimport { isValidElement } from 'react';\nimport formatComplexDataStructure from './formatComplexDataStructure';\nimport formatFunction from './formatFunction';\nimport formatTreeNode from './formatTreeNode';\nimport type { Options } from './../options';\nimport parseReactElement from './../parser/parseReactElement';\n\nconst escape = (s: string): string => s.replace(/\"/g, '&quot;');\n\nconst formatPropValue = (\n  propValue: any,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): string => {\n  if (typeof propValue === 'number') {\n    return `{${String(propValue)}}`;\n  }\n\n  if (typeof propValue === 'string') {\n    return `\"${escape(propValue)}\"`;\n  }\n\n  // > \"Symbols (new in ECMAScript 2015, not yet supported in Flow)\"\n  // @see: https://flow.org/en/docs/types/primitives/\n  // $FlowFixMe: Flow does not support Symbol\n  if (typeof propValue === 'symbol') {\n    const symbolDescription = propValue\n      .valueOf()\n      .toString()\n      .replace(/Symbol\\((.*)\\)/, '$1');\n\n    if (!symbolDescription) {\n      return `{Symbol()}`;\n    }\n\n    return `{Symbol('${symbolDescription}')}`;\n  }\n\n  if (typeof propValue === 'function') {\n    return `{${formatFunction(propValue, options)}}`;\n  }\n\n  if (isValidElement(propValue)) {\n    return `{${formatTreeNode(\n      parseReactElement(propValue, options),\n      true,\n      lvl,\n      options\n    )}}`;\n  }\n\n  if (propValue instanceof Date) {\n    if (isNaN(propValue.valueOf())) {\n      return `{new Date(NaN)}`;\n    }\n    return `{new Date(\"${propValue.toISOString()}\")}`;\n  }\n\n  if (isPlainObject(propValue) || Array.isArray(propValue)) {\n    return `{${formatComplexDataStructure(propValue, inline, lvl, options)}}`;\n  }\n\n  return `{${String(propValue)}}`;\n};\n\nexport default formatPropValue;\n","/* @flow */\n\nimport spacer from './spacer';\nimport formatPropValue from './formatPropValue';\nimport type { Options } from './../options';\n\nexport default (\n  name: string,\n  hasValue: boolean,\n  value: any,\n  hasDefaultValue: boolean,\n  defaultValue: any,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): {\n  attributeFormattedInline: string,\n  attributeFormattedMultiline: string,\n  isMultilineAttribute: boolean,\n} => {\n  if (!hasValue && !hasDefaultValue) {\n    throw new Error(\n      `The prop \"${name}\" has no value and no default: could not be formatted`\n    );\n  }\n\n  const usedValue = hasValue ? value : defaultValue;\n\n  const { useBooleanShorthandSyntax, tabStop } = options;\n\n  const formattedPropValue = formatPropValue(usedValue, inline, lvl, options);\n\n  let attributeFormattedInline = ' ';\n  let attributeFormattedMultiline = `\\n${spacer(lvl + 1, tabStop)}`;\n  const isMultilineAttribute = formattedPropValue.includes('\\n');\n\n  if (\n    useBooleanShorthandSyntax &&\n    formattedPropValue === '{false}' &&\n    !hasDefaultValue\n  ) {\n    // If a boolean is false and not different from it's default, we do not render the attribute\n    attributeFormattedInline = '';\n    attributeFormattedMultiline = '';\n  } else if (useBooleanShorthandSyntax && formattedPropValue === '{true}') {\n    attributeFormattedInline += `${name}`;\n    attributeFormattedMultiline += `${name}`;\n  } else {\n    attributeFormattedInline += `${name}=${formattedPropValue}`;\n    attributeFormattedMultiline += `${name}=${formattedPropValue}`;\n  }\n\n  return {\n    attributeFormattedInline,\n    attributeFormattedMultiline,\n    isMultilineAttribute,\n  };\n};\n","/* @flow */\n\nimport { createStringTreeNode } from './../tree';\nimport type { TreeNode } from './../tree';\n\nexport default (\n  previousNodes: TreeNode[],\n  currentNode: TreeNode\n): TreeNode[] => {\n  const nodes = previousNodes.slice(\n    0,\n    previousNodes.length > 0 ? previousNodes.length - 1 : 0\n  );\n  const previousNode = previousNodes[previousNodes.length - 1];\n\n  if (\n    previousNode &&\n    (currentNode.type === 'string' || currentNode.type === 'number') &&\n    (previousNode.type === 'string' || previousNode.type === 'number')\n  ) {\n    nodes.push(\n      createStringTreeNode(\n        String(previousNode.value) + String(currentNode.value)\n      )\n    );\n  } else {\n    if (previousNode) {\n      nodes.push(previousNode);\n    }\n\n    nodes.push(currentNode);\n  }\n\n  return nodes;\n};\n","/* @flow */\n\nconst isKeyOrRefProps = (propName: string) => ['key', 'ref'].includes(propName);\n\nexport default (shouldSortUserProps: boolean) => (\n  props: string[]\n): string[] => {\n  const haveKeyProp = props.includes('key');\n  const haveRefProp = props.includes('ref');\n\n  const userPropsOnly = props.filter(oneProp => !isKeyOrRefProps(oneProp));\n\n  const sortedProps = shouldSortUserProps\n    ? [...userPropsOnly.sort()] // We use basic lexical order\n    : [...userPropsOnly];\n\n  if (haveRefProp) {\n    sortedProps.unshift('ref');\n  }\n\n  if (haveKeyProp) {\n    sortedProps.unshift('key');\n  }\n\n  return sortedProps;\n};\n","/* @flow */\n\nexport default function createPropFilter(\n  props: {},\n  filter: string[] | ((any, string) => boolean)\n) {\n  if (Array.isArray(filter)) {\n    return (key: string) => filter.indexOf(key) === -1;\n  } else {\n    return (key: string) => filter(props[key], key);\n  }\n}\n","/* @flow */\n\nimport spacer from './spacer';\nimport formatTreeNode from './formatTreeNode';\nimport formatProp from './formatProp';\nimport mergeSiblingPlainStringChildrenReducer from './mergeSiblingPlainStringChildrenReducer';\nimport sortPropsByNames from './sortPropsByNames';\nimport createPropFilter from './createPropFilter';\nimport type { Options } from './../options';\nimport type { ReactElementTreeNode } from './../tree';\n\nconst compensateMultilineStringElementIndentation = (\n  element,\n  formattedElement: string,\n  inline: boolean,\n  lvl: number,\n  options: Options\n) => {\n  const { tabStop } = options;\n\n  if (element.type === 'string') {\n    return formattedElement\n      .split('\\n')\n      .map((line, offset) => {\n        if (offset === 0) {\n          return line;\n        }\n\n        return `${spacer(lvl, tabStop)}${line}`;\n      })\n      .join('\\n');\n  }\n\n  return formattedElement;\n};\n\nconst formatOneChildren = (\n  inline: boolean,\n  lvl: number,\n  options: Options\n) => element =>\n  compensateMultilineStringElementIndentation(\n    element,\n    formatTreeNode(element, inline, lvl, options),\n    inline,\n    lvl,\n    options\n  );\n\nconst onlyPropsWithOriginalValue = (defaultProps, props) => propName => {\n  const haveDefaultValue = Object.keys(defaultProps).includes(propName);\n  return (\n    !haveDefaultValue ||\n    (haveDefaultValue && defaultProps[propName] !== props[propName])\n  );\n};\n\nconst isInlineAttributeTooLong = (\n  attributes: string[],\n  inlineAttributeString: string,\n  lvl: number,\n  tabStop: number,\n  maxInlineAttributesLineLength: ?number\n): boolean => {\n  if (!maxInlineAttributesLineLength) {\n    return attributes.length > 1;\n  }\n\n  return (\n    spacer(lvl, tabStop).length + inlineAttributeString.length >\n    maxInlineAttributesLineLength\n  );\n};\n\nconst shouldRenderMultilineAttr = (\n  attributes: string[],\n  inlineAttributeString: string,\n  containsMultilineAttr: boolean,\n  inline: boolean,\n  lvl: number,\n  tabStop: number,\n  maxInlineAttributesLineLength: ?number\n): boolean =>\n  (isInlineAttributeTooLong(\n    attributes,\n    inlineAttributeString,\n    lvl,\n    tabStop,\n    maxInlineAttributesLineLength\n  ) ||\n    containsMultilineAttr) &&\n  !inline;\n\nexport default (\n  node: ReactElementTreeNode,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): string => {\n  const {\n    type,\n    displayName = '',\n    childrens,\n    props = {},\n    defaultProps = {},\n  } = node;\n\n  if (type !== 'ReactElement') {\n    throw new Error(\n      `The \"formatReactElementNode\" function could only format node of type \"ReactElement\". Given:  ${type}`\n    );\n  }\n\n  const {\n    filterProps,\n    maxInlineAttributesLineLength,\n    showDefaultProps,\n    sortProps,\n    tabStop,\n  } = options;\n\n  let out = `<${displayName}`;\n\n  let outInlineAttr = out;\n  let outMultilineAttr = out;\n  let containsMultilineAttr = false;\n\n  const visibleAttributeNames = [];\n\n  const propFilter = createPropFilter(props, filterProps);\n\n  Object.keys(props)\n    .filter(propFilter)\n    .filter(onlyPropsWithOriginalValue(defaultProps, props))\n    .forEach(propName => visibleAttributeNames.push(propName));\n\n  Object.keys(defaultProps)\n    .filter(propFilter)\n    .filter(() => showDefaultProps)\n    .filter(defaultPropName => !visibleAttributeNames.includes(defaultPropName))\n    .forEach(defaultPropName => visibleAttributeNames.push(defaultPropName));\n\n  const attributes = sortPropsByNames(sortProps)(visibleAttributeNames);\n\n  attributes.forEach(attributeName => {\n    const {\n      attributeFormattedInline,\n      attributeFormattedMultiline,\n      isMultilineAttribute,\n    } = formatProp(\n      attributeName,\n      Object.keys(props).includes(attributeName),\n      props[attributeName],\n      Object.keys(defaultProps).includes(attributeName),\n      defaultProps[attributeName],\n      inline,\n      lvl,\n      options\n    );\n\n    if (isMultilineAttribute) {\n      containsMultilineAttr = true;\n    }\n\n    outInlineAttr += attributeFormattedInline;\n    outMultilineAttr += attributeFormattedMultiline;\n  });\n\n  outMultilineAttr += `\\n${spacer(lvl, tabStop)}`;\n\n  if (\n    shouldRenderMultilineAttr(\n      attributes,\n      outInlineAttr,\n      containsMultilineAttr,\n      inline,\n      lvl,\n      tabStop,\n      maxInlineAttributesLineLength\n    )\n  ) {\n    out = outMultilineAttr;\n  } else {\n    out = outInlineAttr;\n  }\n\n  if (childrens && childrens.length > 0) {\n    const newLvl = lvl + 1;\n\n    out += '>';\n\n    if (!inline) {\n      out += '\\n';\n      out += spacer(newLvl, tabStop);\n    }\n\n    out += childrens\n      .reduce(mergeSiblingPlainStringChildrenReducer, [])\n      .map(formatOneChildren(inline, newLvl, options))\n      .join(!inline ? `\\n${spacer(newLvl, tabStop)}` : '');\n\n    if (!inline) {\n      out += '\\n';\n      out += spacer(newLvl - 1, tabStop);\n    }\n    out += `</${displayName}>`;\n  } else {\n    if (\n      !isInlineAttributeTooLong(\n        attributes,\n        outInlineAttr,\n        lvl,\n        tabStop,\n        maxInlineAttributesLineLength\n      )\n    ) {\n      out += ' ';\n    }\n\n    out += '/>';\n  }\n\n  return out;\n};\n","/* @flow */\n\nimport type { Key } from 'react';\nimport formatReactElementNode from './formatReactElementNode';\nimport type { Options } from './../options';\nimport type {\n  ReactElementTreeNode,\n  ReactFragmentTreeNode,\n  TreeNode,\n} from './../tree';\n\nconst REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX = '';\nconst REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX = 'React.Fragment';\n\nconst toReactElementTreeNode = (\n  displayName: string,\n  key: ?Key,\n  childrens: TreeNode[]\n): ReactElementTreeNode => {\n  let props = {};\n  if (key) {\n    props = { key };\n  }\n\n  return {\n    type: 'ReactElement',\n    displayName,\n    props,\n    defaultProps: {},\n    childrens,\n  };\n};\n\nconst isKeyedFragment = ({ key }: ReactFragmentTreeNode) => Boolean(key);\nconst hasNoChildren = ({ childrens }: ReactFragmentTreeNode) =>\n  childrens.length === 0;\n\nexport default (\n  node: ReactFragmentTreeNode,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): string => {\n  const { type, key, childrens } = node;\n\n  if (type !== 'ReactFragment') {\n    throw new Error(\n      `The \"formatReactFragmentNode\" function could only format node of type \"ReactFragment\". Given: ${type}`\n    );\n  }\n\n  const { useFragmentShortSyntax } = options;\n\n  let displayName;\n  if (useFragmentShortSyntax) {\n    if (hasNoChildren(node) || isKeyedFragment(node)) {\n      displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n    } else {\n      displayName = REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX;\n    }\n  } else {\n    displayName = REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX;\n  }\n\n  return formatReactElementNode(\n    toReactElementTreeNode(displayName, key, childrens),\n    inline,\n    lvl,\n    options\n  );\n};\n","/* @flow */\n\nimport formatReactElementNode from './formatReactElementNode';\nimport formatReactFragmentNode from './formatReactFragmentNode';\nimport type { Options } from './../options';\nimport type { TreeNode } from './../tree';\n\nconst jsxStopChars = ['<', '>', '{', '}'];\nconst shouldBeEscaped = (s: string) =>\n  jsxStopChars.some(jsxStopChar => s.includes(jsxStopChar));\n\nconst escape = (s: string) => {\n  if (!shouldBeEscaped(s)) {\n    return s;\n  }\n\n  return `{\\`${s}\\`}`;\n};\n\nconst preserveTrailingSpace = (s: string) => {\n  let result = s;\n  if (result.endsWith(' ')) {\n    result = result.replace(/^(.*?)(\\s+)$/, \"$1{'$2'}\");\n  }\n\n  if (result.startsWith(' ')) {\n    result = result.replace(/^(\\s+)(.*)$/, \"{'$1'}$2\");\n  }\n\n  return result;\n};\n\nexport default (\n  node: TreeNode,\n  inline: boolean,\n  lvl: number,\n  options: Options\n): string => {\n  if (node.type === 'number') {\n    return String(node.value);\n  }\n\n  if (node.type === 'string') {\n    return node.value\n      ? `${preserveTrailingSpace(escape(String(node.value)))}`\n      : '';\n  }\n\n  if (node.type === 'ReactElement') {\n    return formatReactElementNode(node, inline, lvl, options);\n  }\n\n  if (node.type === 'ReactFragment') {\n    return formatReactFragmentNode(node, inline, lvl, options);\n  }\n\n  throw new TypeError(`Unknow format type \"${node.type}\"`);\n};\n","/* @flow */\n\nimport formatTreeNode from './formatTreeNode';\nimport type { Options } from './../options';\nimport type { TreeNode } from './../tree';\n\nexport default (node: TreeNode, options: Options): string =>\n  formatTreeNode(node, false, 0, options);\n","/* @flow */\n\nimport formatTree from './formatter/formatTree';\nimport parseReactElement from './parser/parseReactElement';\nimport type { Element as ReactElement } from 'react';\nimport type { Options } from './options';\n\nconst reactElementToJsxString = (\n  element: ReactElement<any>,\n  {\n    filterProps = [],\n    showDefaultProps = true,\n    showFunctions = false,\n    functionValue,\n    tabStop = 2,\n    useBooleanShorthandSyntax = true,\n    useFragmentShortSyntax = true,\n    sortProps = true,\n    maxInlineAttributesLineLength,\n    displayName,\n  }: Options = {}\n) => {\n  if (!element) {\n    throw new Error('react-element-to-jsx-string: Expected a ReactElement');\n  }\n\n  const options = {\n    filterProps,\n    showDefaultProps,\n    showFunctions,\n    functionValue,\n    tabStop,\n    useBooleanShorthandSyntax,\n    useFragmentShortSyntax,\n    sortProps,\n    maxInlineAttributesLineLength,\n    displayName,\n  };\n\n  return formatTree(parseReactElement(element, options), options);\n};\n\nexport default reactElementToJsxString;\n\nexport {\n  inlineFunction,\n  preserveFunctionLineBreak,\n} from './formatter/formatFunction';\n","/*!\n * is-plain-object <https://github.com/jonschlinkert/is-plain-object>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nfunction isObject(o) {\n  return Object.prototype.toString.call(o) === '[object Object]';\n}\n\nfunction isPlainObject(o) {\n  var ctor,prot;\n\n  if (isObject(o) === false) return false;\n\n  // If has modified constructor\n  ctor = o.constructor;\n  if (ctor === undefined) return true;\n\n  // If has modified prototype\n  prot = ctor.prototype;\n  if (isObject(prot) === false) return false;\n\n  // If constructor does not have an Object-specific method\n  if (prot.hasOwnProperty('isPrototypeOf') === false) {\n    return false;\n  }\n\n  // Most likely a plain Object\n  return true;\n}\n\nexport { isPlainObject };\n","\"use strict\";\nvar __assign = (this && this.__assign) || function () {\n    __assign = Object.assign || function(t) {\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\n            s = arguments[i];\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n                t[p] = s[p];\n        }\n        return t;\n    };\n    return __assign.apply(this, arguments);\n};\nvar __spreadArrays = (this && this.__spreadArrays) || function () {\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n            r[k] = a[j];\n    return r;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar seen = [];\n/**\n * Check if a value is an object or a function. Keep in mind that array, function, regexp, etc, are objects in JavaScript.\n *\n * @param value the value to check\n * @return true if the value is an object or a function\n */\nfunction isObj(value) {\n    var type = typeof value;\n    return value !== null && (type === 'object' || type === 'function');\n}\n/**\n * Check if a value is a regular expression.\n *\n * @param value the value to check\n * @return true if the value is a regular expression\n */\nfunction isRegexp(value) {\n    return Object.prototype.toString.call(value) === '[object RegExp]';\n}\n/**\n * Get an array of all of the enumerable symbols for an object.\n *\n * @param object the object to get the enumerable symbols for\n */\nfunction getOwnEnumPropSymbols(object) {\n    return Object.getOwnPropertySymbols(object).filter(function (keySymbol) { return Object.prototype.propertyIsEnumerable.call(object, keySymbol); });\n}\n/**\n * pretty print an object\n *\n * @param input the object to pretty print\n * @param options the formatting options, transforms, and filters\n * @param pad the padding string\n */\nfunction prettyPrint(input, options, pad) {\n    if (pad === void 0) { pad = ''; }\n    // sensible option defaults\n    var defaultOptions = {\n        indent: '\\t',\n        singleQuotes: true\n    };\n    var combinedOptions = __assign(__assign({}, defaultOptions), options);\n    var tokens;\n    if (combinedOptions.inlineCharacterLimit === undefined) {\n        tokens = {\n            newLine: '\\n',\n            newLineOrSpace: '\\n',\n            pad: pad,\n            indent: pad + combinedOptions.indent\n        };\n    }\n    else {\n        tokens = {\n            newLine: '@@__PRETTY_PRINT_NEW_LINE__@@',\n            newLineOrSpace: '@@__PRETTY_PRINT_NEW_LINE_OR_SPACE__@@',\n            pad: '@@__PRETTY_PRINT_PAD__@@',\n            indent: '@@__PRETTY_PRINT_INDENT__@@'\n        };\n    }\n    var expandWhiteSpace = function (string) {\n        if (combinedOptions.inlineCharacterLimit === undefined) {\n            return string;\n        }\n        var oneLined = string\n            .replace(new RegExp(tokens.newLine, 'g'), '')\n            .replace(new RegExp(tokens.newLineOrSpace, 'g'), ' ')\n            .replace(new RegExp(tokens.pad + '|' + tokens.indent, 'g'), '');\n        if (oneLined.length <= combinedOptions.inlineCharacterLimit) {\n            return oneLined;\n        }\n        return string\n            .replace(new RegExp(tokens.newLine + '|' + tokens.newLineOrSpace, 'g'), '\\n')\n            .replace(new RegExp(tokens.pad, 'g'), pad)\n            .replace(new RegExp(tokens.indent, 'g'), pad + combinedOptions.indent);\n    };\n    if (seen.indexOf(input) !== -1) {\n        return '\"[Circular]\"';\n    }\n    if (input === null ||\n        input === undefined ||\n        typeof input === 'number' ||\n        typeof input === 'boolean' ||\n        typeof input === 'function' ||\n        typeof input === 'symbol' ||\n        isRegexp(input)) {\n        return String(input);\n    }\n    if (input instanceof Date) {\n        return \"new Date('\" + input.toISOString() + \"')\";\n    }\n    if (Array.isArray(input)) {\n        if (input.length === 0) {\n            return '[]';\n        }\n        seen.push(input);\n        var ret = '[' + tokens.newLine + input.map(function (el, i) {\n            var eol = input.length - 1 === i ? tokens.newLine : ',' + tokens.newLineOrSpace;\n            var value = prettyPrint(el, combinedOptions, pad + combinedOptions.indent);\n            if (combinedOptions.transform) {\n                value = combinedOptions.transform(input, i, value);\n            }\n            return tokens.indent + value + eol;\n        }).join('') + tokens.pad + ']';\n        seen.pop();\n        return expandWhiteSpace(ret);\n    }\n    if (isObj(input)) {\n        var objKeys_1 = __spreadArrays(Object.keys(input), (getOwnEnumPropSymbols(input)));\n        if (combinedOptions.filter) {\n            objKeys_1 = objKeys_1.filter(function (el) { return combinedOptions.filter && combinedOptions.filter(input, el); });\n        }\n        if (objKeys_1.length === 0) {\n            return '{}';\n        }\n        seen.push(input);\n        var ret = '{' + tokens.newLine + objKeys_1.map(function (el, i) {\n            var eol = objKeys_1.length - 1 === i ? tokens.newLine : ',' + tokens.newLineOrSpace;\n            var isSymbol = typeof el === 'symbol';\n            var isClassic = !isSymbol && /^[a-z$_][a-z$_0-9]*$/i.test(el.toString());\n            var key = isSymbol || isClassic ? el : prettyPrint(el, combinedOptions);\n            var value = prettyPrint(input[el], combinedOptions, pad + combinedOptions.indent);\n            if (combinedOptions.transform) {\n                value = combinedOptions.transform(input, el, value);\n            }\n            return tokens.indent + String(key) + ': ' + value + eol;\n        }).join('') + tokens.pad + '}';\n        seen.pop();\n        return expandWhiteSpace(ret);\n    }\n    input = String(input).replace(/[\\r\\n]/g, function (x) { return x === '\\n' ? '\\\\n' : '\\\\r'; });\n    if (!combinedOptions.singleQuotes) {\n        input = input.replace(/\"/g, '\\\\\"');\n        return \"\\\"\" + input + \"\\\"\";\n    }\n    input = input.replace(/\\\\?'/g, '\\\\\\'');\n    return \"'\" + input + \"'\";\n}\nexports.prettyPrint = prettyPrint;\n//# sourceMappingURL=index.js.map",null,"'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-is.production.min.js');\n} else {\n  module.exports = require('./cjs/react-is.development.js');\n}\n","/**\n * @license React\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n'use strict';\n\n// -----------------------------------------------------------------------------\n\nvar enableScopeAPI = false; // Experimental Create Event Handle API.\nvar enableCacheElement = false;\nvar enableTransitionTracing = false; // No known bugs, but needs performance testing\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n// stuff. Intended to enable React core members to more easily debug scheduling\n// issues in DEV builds.\n\nvar enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n\n// ATTENTION\n\nvar REACT_ELEMENT_TYPE =  Symbol.for('react.element');\nvar REACT_PORTAL_TYPE =  Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE =  Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE =  Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE =  Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE =  Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE =  Symbol.for('react.context');\nvar REACT_SERVER_CONTEXT_TYPE =  Symbol.for('react.server_context');\nvar REACT_FORWARD_REF_TYPE =  Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE =  Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE =  Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE =  Symbol.for('react.memo');\nvar REACT_LAZY_TYPE =  Symbol.for('react.lazy');\nvar REACT_OFFSCREEN_TYPE =  Symbol.for('react.offscreen');\n\nvar REACT_MODULE_REFERENCE;\n\n{\n  REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\n}\n\nfunction isValidElementType(type) {\n  if (typeof type === 'string' || typeof type === 'function') {\n    return true;\n  } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n\n  if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing  || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden  || type === REACT_OFFSCREEN_TYPE || enableScopeAPI  || enableCacheElement  || enableTransitionTracing ) {\n    return true;\n  }\n\n  if (typeof type === 'object' && type !== null) {\n    if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n    // types supported by any Flight configuration anywhere since\n    // we don't know which Flight build this will end up being used\n    // with.\n    type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== undefined) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction typeOf(object) {\n  if (typeof object === 'object' && object !== null) {\n    var $$typeof = object.$$typeof;\n\n    switch ($$typeof) {\n      case REACT_ELEMENT_TYPE:\n        var type = object.type;\n\n        switch (type) {\n          case REACT_FRAGMENT_TYPE:\n          case REACT_PROFILER_TYPE:\n          case REACT_STRICT_MODE_TYPE:\n          case REACT_SUSPENSE_TYPE:\n          case REACT_SUSPENSE_LIST_TYPE:\n            return type;\n\n          default:\n            var $$typeofType = type && type.$$typeof;\n\n            switch ($$typeofType) {\n              case REACT_SERVER_CONTEXT_TYPE:\n              case REACT_CONTEXT_TYPE:\n              case REACT_FORWARD_REF_TYPE:\n              case REACT_LAZY_TYPE:\n              case REACT_MEMO_TYPE:\n              case REACT_PROVIDER_TYPE:\n                return $$typeofType;\n\n              default:\n                return $$typeof;\n            }\n\n        }\n\n      case REACT_PORTAL_TYPE:\n        return $$typeof;\n    }\n  }\n\n  return undefined;\n}\nvar ContextConsumer = REACT_CONTEXT_TYPE;\nvar ContextProvider = REACT_PROVIDER_TYPE;\nvar Element = REACT_ELEMENT_TYPE;\nvar ForwardRef = REACT_FORWARD_REF_TYPE;\nvar Fragment = REACT_FRAGMENT_TYPE;\nvar Lazy = REACT_LAZY_TYPE;\nvar Memo = REACT_MEMO_TYPE;\nvar Portal = REACT_PORTAL_TYPE;\nvar Profiler = REACT_PROFILER_TYPE;\nvar StrictMode = REACT_STRICT_MODE_TYPE;\nvar Suspense = REACT_SUSPENSE_TYPE;\nvar SuspenseList = REACT_SUSPENSE_LIST_TYPE;\nvar hasWarnedAboutDeprecatedIsAsyncMode = false;\nvar hasWarnedAboutDeprecatedIsConcurrentMode = false; // AsyncMode should be deprecated\n\nfunction isAsyncMode(object) {\n  {\n    if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n      hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n      console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n    }\n  }\n\n  return false;\n}\nfunction isConcurrentMode(object) {\n  {\n    if (!hasWarnedAboutDeprecatedIsConcurrentMode) {\n      hasWarnedAboutDeprecatedIsConcurrentMode = true; // Using console['warn'] to evade Babel and ESLint\n\n      console['warn']('The ReactIs.isConcurrentMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n    }\n  }\n\n  return false;\n}\nfunction isContextConsumer(object) {\n  return typeOf(object) === REACT_CONTEXT_TYPE;\n}\nfunction isContextProvider(object) {\n  return typeOf(object) === REACT_PROVIDER_TYPE;\n}\nfunction isElement(object) {\n  return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\nfunction isForwardRef(object) {\n  return typeOf(object) === REACT_FORWARD_REF_TYPE;\n}\nfunction isFragment(object) {\n  return typeOf(object) === REACT_FRAGMENT_TYPE;\n}\nfunction isLazy(object) {\n  return typeOf(object) === REACT_LAZY_TYPE;\n}\nfunction isMemo(object) {\n  return typeOf(object) === REACT_MEMO_TYPE;\n}\nfunction isPortal(object) {\n  return typeOf(object) === REACT_PORTAL_TYPE;\n}\nfunction isProfiler(object) {\n  return typeOf(object) === REACT_PROFILER_TYPE;\n}\nfunction isStrictMode(object) {\n  return typeOf(object) === REACT_STRICT_MODE_TYPE;\n}\nfunction isSuspense(object) {\n  return typeOf(object) === REACT_SUSPENSE_TYPE;\n}\nfunction isSuspenseList(object) {\n  return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n}\n\nexports.ContextConsumer = ContextConsumer;\nexports.ContextProvider = ContextProvider;\nexports.Element = Element;\nexports.ForwardRef = ForwardRef;\nexports.Fragment = Fragment;\nexports.Lazy = Lazy;\nexports.Memo = Memo;\nexports.Portal = Portal;\nexports.Profiler = Profiler;\nexports.StrictMode = StrictMode;\nexports.Suspense = Suspense;\nexports.SuspenseList = SuspenseList;\nexports.isAsyncMode = isAsyncMode;\nexports.isConcurrentMode = isConcurrentMode;\nexports.isContextConsumer = isContextConsumer;\nexports.isContextProvider = isContextProvider;\nexports.isElement = isElement;\nexports.isForwardRef = isForwardRef;\nexports.isFragment = isFragment;\nexports.isLazy = isLazy;\nexports.isMemo = isMemo;\nexports.isPortal = isPortal;\nexports.isProfiler = isProfiler;\nexports.isStrictMode = isStrictMode;\nexports.isSuspense = isSuspense;\nexports.isSuspenseList = isSuspenseList;\nexports.isValidElementType = isValidElementType;\nexports.typeOf = typeOf;\n  })();\n}\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n"],"names":["modules","entry","mainEntry","parcelRequireName","globalName","globalObject","globalThis","self","window","global","previousRequire","cache","nodeRequire","module","require","bind","newRequire","name","jumped","currentRequire","err","Error","code","localRequire","resolve","x","id","Module","call","exports","res","isParcelRequire","moduleName","bundle","parent","register","Object","defineProperty","get","i","length","parcelHelpers","defineInteropFlag","export","applyDecorators","argTypesEnhancers","decorators","parameters","_docsTools","_propTypes","_propTypesDefault","interopDefault","_htmlTags","_htmlTagsDefault","_escodegen","_tsDedent","_acorn","_acornJsx","_acornJsxDefault","_acornWalk","_isPlainObjectJs","_isPlainObjectJsDefault","_isFunctionJs","_isFunctionJsDefault","_isStringJs","_isStringJsDefault","_reactElementToJsxString","_reactElementToJsxStringDefault","_react","_reactDefault","_previewApi","_clientLogger","CUSTOM_CAPTION","OBJECT_CAPTION","ARRAY_CAPTION","FUNCTION_CAPTION","ELEMENT_CAPTION","isHtmlTag","tagName","default","includes","toLowerCase","BASIC_OPTIONS","format","indent","style","semicolons","COMPACT_OPTIONS","newline","PRETTY_OPTIONS","generateCode","ast","compact","generate","generateObjectCode","result","endsWith","slice","generateArrayCode","startsWith","replace","dedent","isMemo","component","$$typeof","Symbol","for","isForwardRef","ACORN_WALK_VISITORS","base","JSXElement","acornParser","Parser","extend","extractIdentifierName","identifierNode","filterAncestors","ancestors","filter","type","calculateNodeDepth","node","depths","ancestor","ObjectExpression","_","push","ArrayExpression","Math","max","parseObject","objectNode","inferredType","depth","inspectValue","value","parse","ecmaVersion","parsingResult","body","rootNode","expressionResult","parseExpression","expression","identifier","innerJsxElementNode","identifierName","simple","funcNode","params","hasParams","classNode","jsxElementNode","openingElement","callNode","callee","property","arguments","createTypeDef","short","full","cleanPropTypes","splitIntoLines","split","prettyObject","prettyArray","generateTypeFromString","originalTypeName","getCaptionForInspectionType","objectOf","of","createArrayOfObjectTypeDef","generateType","extractedProp","generateCustom","raw","generateFunc","jsDocTags","returns","generateShortFuncSignature","hasReturns","funcParts","getTypeName","join","generateFuncSignature","funcParams","map","prettyName","getPrettyName","typeName","generateShape","fields","keys","key","generateObjectOf","generateUnion","Array","isArray","values","reduce","acc","v","every","generateEnum","generateEnumValue","computed","generateArray","e","console","error","generateObject","compactObject","isTooLongForDefaultValueSummary","createSummaryValue","generateArray2","compactArray","getPrettyFuncIdentifier","hasArguments","getPrettyElementIdentifier","getPrettyIdentifier","createDefaultValue","defaultValue","inspectionResult","generateFunc2","prettyCaption","generateElement","prettyIdentifier","isReactElement","element","extractFunctionName","func","propName","DEFAULT_TYPE_RESOLVERS","string","rawDefaultProp","JSON","stringify","object","generateReactObject","displayName","jsx2","jsxSummary","tabStop","function","propDef","isElement","render","prototype","innerElement","toString","funcName","rawDefaultPropTypeResolvers","createTypeResolvers","customResolvers","summary","propTypesMap","Map","forEach","set","isRequired","extractProps","rows","getPropDefs","section","processedComponent","hasDocgen","propTypes","extractedProps","extractComponentProps","typeSystem","TypeSystem","JAVASCRIPT","rawDefaultProps","defaultProps","keepOriginalDefinitionOrder","find","y","Boolean","enhancePropTypesProp","newtype","createType","docgenInfo","isTooLongForTypeSummary","detail","signature","newDefaultValue","createDefaultValueFromRawDefaultProp","typeResolvers","TYPESCRIPT","prop","enhanceTypeScriptProp","renderJsx","options","logger","warn","renderedJSX","Type","skip","Children","count","props","children","createElement","opts","showFunctions","el","getDocgenSection","filterProps","c","child","simplifyNodeForStringify","isValidElement","cur","_owner","indexOf","matches","match","defaultOpts","enableBeautify","showDefaultProps","skipJsxRender","context","sourceParams","docs","source","isArgsStory","__isArgsStory","SourceType","DYNAMIC","CODE","isMdx","mdxType","mdxToJsx","originalType","rest","jsxChildren","jsxDecorator","storyFn","channel","addons","getChannel","useEffect","unmappedArgs","emit","SNIPPET_RENDERED","args","story","jsx","rendered","excludeDecorators","originalStoryFn","decorators2","jsxIndex","findIndex","d","originalFn","reorderedDecorators","splice","defaultDecorateStory","inline","extractArgTypes","row","description","sbType","defaultSummary","required","table","extractComponentDescription","enhanceArgTypes","ReactIs","hasSymbol","REACT_ELEMENT_TYPE","REACT_PORTAL_TYPE","REACT_FRAGMENT_TYPE","REACT_STRICT_MODE_TYPE","REACT_PROFILER_TYPE","REACT_PROVIDER_TYPE","REACT_CONTEXT_TYPE","REACT_ASYNC_MODE_TYPE","REACT_CONCURRENT_MODE_TYPE","REACT_FORWARD_REF_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_MEMO_TYPE","REACT_LAZY_TYPE","REACT_BLOCK_TYPE","REACT_FUNDAMENTAL_TYPE","REACT_RESPONDER_TYPE","REACT_SCOPE_TYPE","typeOf","$$typeofType","hasWarnedAboutDeprecatedIsAsyncMode","isConcurrentMode","AsyncMode","ConcurrentMode","ContextConsumer","ContextProvider","Element","ForwardRef","Fragment","Lazy","Memo","Portal","Profiler","StrictMode","Suspense","isAsyncMode","isContextConsumer","isContextProvider","isFragment","isLazy","isPortal","isProfiler","isStrictMode","isSuspense","isValidElementType","assign","ReactPropTypesSecret","has","checkPropTypes","printWarning","emptyFunctionThatReturnsNull","text","message","throwOnDirectAccess","ITERATOR_SYMBOL","iterator","ANONYMOUS","ReactPropTypes","array","createPrimitiveTypeChecker","bigint","bool","number","symbol","any","createChainableTypeChecker","arrayOf","typeChecker","componentName","location","propFullName","PropTypeError","propValue","getPropType","elementType","instanceOf","expectedClass","expectedClassName","constructor","isNode","iteratorFn","getIteratorFn","maybeIterable","step","entries","next","done","propType","oneOf","expectedValues","valuesString","getPreciseType","String","oneOfType","arrayOfTypeCheckers","checker","getPostfixForTypeWarning","expectedTypes","checkerResult","data","expectedType","shape","shapeTypes","invalidValidatorError","exact","allKeys","stack","validate","manualPropTypeCallCache","manualPropTypeWarningCount","checkType","secret","cacheKey","chainedCheckType","RegExp","Date","resetWarningCache","PropTypes","getOwnPropertySymbols","hasOwnProperty","propIsEnumerable","propertyIsEnumerable","shouldUseNative","test1","getOwnPropertyNames","test2","fromCharCode","order2","n","test3","letter","target","from","symbols","to","toObject","val","TypeError","s","Function","loggedTypeFailures","typeSpecs","getStack","typeSpecName","ex","Syntax","Precedence","BinaryPrecedence","SourceNode","estraverse","esutils","json","renumber","hexadecimal","quotes","escapeless","space","parentheses","safeConcatenation","directive","extra","sourceMap","sourceCode","preserveBlankLines","FORMAT_MINIFY","FORMAT_DEFAULTS","isStatement","CodeGenerator","Statement","getDefaultOptions","comment","adjustMultilineComment","moz","comprehensionExpressionStartsWithAssignment","starlessGenerator","sourceMapRoot","sourceMapWithCode","verbatim","stringRepeat","str","num","endsWithLineTerminator","len","isLineTerminator","charCodeAt","merge","override","updateDeeply","isHashObject","escapeRegExpCharacter","ch","previousIsBackslash","toSourceNodeWhenNeeded","generated","flattenToString","arr","iz","elem","loc","start","line","column","noEmptySpace","left","right","leftSource","rightSource","leftCharCode","rightCharCode","isIdentifierPartES5","isWhiteSpace","addIndent","stmt","withIndent","fn","previousBase","generateComment","specialBase","test","j","spaces","sn","Number","MAX_VALUE","addComments","save","tailingToStatement","fragment","extRange","range","prevRange","prefix","leadingComments","extendedRange","substring","infix","suffix","Program","trailingComments","calculateSpaces","generateBlankLines","end","newlineCount","parenthesize","current","should","generateVerbatimString","generateIdentifier","generateAsyncPrefix","spaceRequired","async","generateStarSuffix","isGenerator","generator","generateMethodPrefix","Sequence","Yield","Assignment","Conditional","ArrowFunction","Coalesce","LogicalOR","LogicalAND","BitwiseOR","BitwiseXOR","BitwiseAND","Equality","Relational","BitwiseSHIFT","Additive","Multiplicative","Exponentiation","Await","Unary","Postfix","OptionalChaining","Call","New","TaggedTemplate","Member","Primary","maybeBlock","flags","noLeadingComment","that","BlockStatement","generateStatement","EmptyStatement","maybeBlockSuffix","ends","generatePattern","precedence","Identifier","generateExpression","generateFunctionParams","hasDefault","ArrowFunctionExpression","defaults","generateAssignment","F_ALLOW_IN","generateFunctionBody","expr","charAt","generateIterationForStatement","operator","await","VariableDeclaration","kind","declarations","generatePropertyKey","semicolon","content","bodyFlags","BreakStatement","label","ContinueStatement","ClassBody","ClassDeclaration","superClass","DirectiveStatement","escapeDirective","quote","DoWhileStatement","CatchClause","guard","param","DebuggerStatement","ExportDefaultDeclaration","declaration","ExportNamedDeclaration","specifiers","ExportBatchSpecifier","ExportAllDeclaration","ExpressionStatement","isAsyncPrefixed","Literal","ImportDeclaration","cursor","ImportDefaultSpecifier","ImportNamespaceSpecifier","VariableDeclarator","itemFlags","F_ALLOW_CALL","init","block","ThrowStatement","argument","TryStatement","guardedHandlers","handlers","finalizer","handler","SwitchStatement","discriminant","cases","SwitchCase","consequent","IfStatement","alternate","ForStatement","update","ForInStatement","ForOfStatement","LabeledStatement","FunctionDeclaration","ReturnStatement","WhileStatement","WithStatement","Expression","SequenceExpression","expressions","AssignmentExpression","ConditionalExpression","LogicalExpression","BinaryExpression","leftPrecedence","rightPrecedence","currentPrecedence","CallExpression","optional","ChainExpression","NewExpression","MemberExpression","isDecimalDigit","MetaProperty","meta","UnaryExpression","YieldExpression","delegate","AwaitExpression","all","UpdateExpression","FunctionExpression","ArrayPattern","isPattern","multiline","elements","RestElement","ClassExpression","MethodDefinition","Property","shorthand","AssignmentPattern","method","properties","ObjectPattern","ThisExpression","Super","local","ImportSpecifier","imported","ExportSpecifier","exported","regex","pattern","escapeString","single","singleQuotes","doubleQuotes","escapeDisallowedCharacter","escapeAllowedCharacter","hex","toUpperCase","generateNumber","point","temp","exponent","pos","floor","generateRegExp","reg","characterInBrack","GeneratorExpression","ComprehensionExpression","blocks","ComprehensionBlock","SpreadElement","TaggedTemplateExpression","tag","quasi","TemplateElement","TemplateLiteral","quasis","ModuleSpecifier","ImportExpression","flag","replaceRight","version","pair","defaultOptions","browser","generateInternal","codegen","toStringWithSourceMap","file","sourceRoot","sourceContent","setSourceContent","attachComments","clone","exports1","VisitorOption","VisitorKeys","BREAK","SKIP","REMOVE","deepCopy","obj","ret","Reference","path","wrap","ref","Controller","isProperty","nodeType","candidateExistsInLeaveList","leavelist","candidate","traverse","root","visitor","controller","PrivateIdentifier","PropertyDefinition","Break","Skip","Remove","remove","jz","addToPath","__current","__leavelist","parents","__execute","callback","previous","undefined","__state","notify","__initialize","__worklist","__fallback","fallback","__keys","create","worklist","current2","candidates","sentinel","pop","leave","enter","outer","removeElem","nextElem","tree","providedComments","tokens","comments","extendCommentRange","upperBound","diff","search","token","cloneEnvironment","SourceMapGenerator","SourceMapConsumer","base64VLQ","util","ArraySet","MappingList","aArgs","_file","getArg","_sourceRoot","_skipValidation","_sources","_names","_mappings","_sourcesContents","_version","fromSourceMap","aSourceMapConsumer","eachMapping","mapping","newMapping","generatedLine","generatedColumn","relative","original","originalLine","originalColumn","addMapping","sources","sourceFile","sourceRelative","add","sourceContentFor","_validateMapping","aSourceFile","aSourceContent","toSetString","applySourceMap","aSourceMapPath","newSources","newNames","unsortedForEach","originalPositionFor","aGenerated","aOriginal","aSource","aName","_serializeMappings","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","mappings","toArray","compareByGeneratedPositionsInflated","encode","_generateSourcesContent","aSources","aSourceRoot","toJSON","names","sourcesContent","base64","aValue","digit","encoded","vlq","VLQ_BASE","decode","aStr","aIndex","aOutParam","shifted","continuation","strLen","shift","isNegative","intToCharMap","charCode","bigA","littleA","zero","aDefaultValue","urlRegexp","dataUrlRegexp","urlParse","aUrl","scheme","auth","host","port","urlGenerate","aParsedUrl","url","normalize","aPath","part","isAbsolute","parts","up","aRoot","aPathUrl","aRootUrl","joined","level","index","lastIndexOf","substr","supportsNullProto","identity","isProtoString","strcmp","aStr1","aStr2","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","compareByGeneratedPositionsDeflated","onlyCompareGenerated","parseSourceMapInput","computeSourceURL","sourceURL","sourceMapURL","parsed","hasNativeMap","_array","_set","fromArray","aArray","aAllowDuplicates","size","sStr","isDuplicate","idx","at","aIdx","_sorted","_last","aCallback","aThisArg","aMapping","lineA","lineB","columnA","columnB","sort","binarySearch","quickSort","aSourceMap","aSourceMapURL","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","_absoluteSources","_sourceMapURL","Mapping","lastOffset","_sections","offset","offsetLine","offsetColumn","generatedOffset","consumer","__generatedMappings","configurable","enumerable","_parseMappings","__originalMappings","_charIsMappingSeparator","GENERATED_ORDER","ORIGINAL_ORDER","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","aContext","aOrder","_generatedMappings","_originalMappings","allGeneratedPositionsFor","needle","_findSourceIndex","_findMapping","lastColumn","relativeSource","smc","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","segment","cachedSegments","originalMappings","aNeedle","aMappings","aLineName","aColumnName","aComparator","aBias","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","hasContentsOfAllSources","some","sc","nullOnMissing","fileUriAbsPath","generatedPositionFor","sectionIndex","bias","generatedPosition","sectionMappings","adjustedMapping","aHaystack","aCompare","recursiveSearch","aLow","aHigh","mid","swap","ary","comparator","doQuickSort","p","r","pivotIndex","round","low","random","high","pivot","q","REGEX_NEWLINE","isSourceNode","aLine","aColumn","aChunks","sourceContents","fromStringWithSourceMap","aGeneratedCode","aRelativePath","remainingLines","remainingLinesIndex","shiftNextLine","lineContents","getNextLine","lastGeneratedLine","lastMapping","addMappingWithCode","nextLine","aChunk","chunk","prepend","unshift","walk","aFn","aSep","newChildren","aPattern","aReplacement","lastChild","walkSourceContents","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","Node","Position","SourceLocation","TokContext","Token","TokenType","getLineInfo","isIdentifierChar","isIdentifierStart","isNewLine","keywords$1","lineBreak","lineBreakG","nonASCIIwhitespace","parseExpressionAt","types$1","types","tokenizer","reservedWords","strict","strictBind","ecma5AndLessKeywords","keywords","keywordRelationalOperator","nonASCIIidentifierStartChars","nonASCIIidentifierChars","nonASCIIidentifierStart","nonASCIIidentifier","astralIdentifierStartCodes","astralIdentifierCodes","isInAstralSet","astral","conf","keyword","beforeExpr","startsExpr","isLoop","isAssign","postfix","binop","updateContext","prec","kw","regexp","eof","bracketL","bracketR","braceL","braceR","parenL","parenR","comma","semi","colon","dot","question","questionDot","arrow","template","invalidTemplate","ellipsis","backQuote","dollarBraceL","eq","incDec","logicalOR","logicalAND","bitwiseOR","bitwiseXOR","bitwiseAND","equality","relational","bitShift","plusMin","modulo","star","slash","starstar","coalesce","_break","_case","_catch","_continue","_debugger","_default","_do","_else","_finally","_for","_function","_if","_return","_switch","_throw","_try","_var","_const","_while","_with","_new","_this","_super","_class","_extends","_export","_import","_null","_true","_false","_in","_instanceof","_typeof","_void","_delete","ecma2019String","skipWhiteSpace","wordsRegexp","words","col","input","lastIndex","exec","sourceType","onInsertedSemicolon","onTrailingComma","allowReserved","allowReturnOutsideFunction","allowImportExportEverywhere","allowAwaitOutsideFunction","allowHashBang","locations","onToken","onComment","ranges","program","directSourceFile","preserveParens","functionFlags","SCOPE_FUNCTION","startPos","getOptions","opt","startLoc","endLoc","reserved","reservedStrict","reservedWordsStrict","reservedWordsStrictBind","containsEsc","lineStart","curLine","curPosition","lastTokEndLoc","lastTokStartLoc","lastTokStart","lastTokEnd","initialContext","exprAllowed","inModule","strictDirective","potentialArrowAt","yieldPos","awaitPos","awaitIdentPos","labels","undefinedExports","skipLineComment","scopeStack","enterScope","regexpState","prototypeAccessors","inFunction","inGenerator","inAsync","allowSuper","allowDirectSuper","treatFunctionsAsVar","startNode","nextToken","parseTopLevel","currentVarScope","currentThisScope","treatFunctionsAsVarInScope","currentScope","inNonArrowFunction","plugins","cls","parser","defineProperties","pp","literal","DestructuringErrors","shorthandAssign","trailingComma","parenthesizedAssign","parenthesizedBind","doubleProto","spaceAfter","eat","isContextual","eatContextual","expectContextual","unexpected","canInsertSemicolon","insertSemicolon","afterTrailingComma","tokType","notNext","expect","raise","checkPatternErrors","refDestructuringErrors","raiseRecoverable","parens","checkExpressionErrors","andThrow","checkYieldAwaitInDefaultParams","isSimpleAssignTarget","pp$1","parseStatement","list","adaptDirectivePrologue","finishNode","loopLabel","switchLabel","isLet","nextCh","ident","isAsyncFunction","topLevel","starttype","parseBreakContinueStatement","parseDebuggerStatement","parseDoStatement","parseForStatement","parseFunctionStatement","parseClass","parseIfStatement","parseReturnStatement","parseSwitchStatement","parseThrowStatement","parseTryStatement","parseVarStatement","parseWhileStatement","parseWithStatement","parseBlock","parseEmptyStatement","parseExpressionStatement","parseImport","parseExport","maybeName","parseLabeledStatement","isBreak","parseIdent","lab","parseParenExpression","awaitAt","parseFor","init$1","parseVar","parseForIn","toAssignable","checkLVal","isAsync","declarationPosition","parseFunction","FUNC_STATEMENT","FUNC_HANGING_STATEMENT","sawDefault","isCase","exitScope","empty","clause","parseBindingAtom","i$1","label$1","statementStart","createNewLexicalScope","exitStrict","isForIn","parseMaybeAssign","isFor","decl","parseVarId","statement","allowExpressionBody","initFunction","oldYieldPos","oldAwaitPos","oldAwaitIdentPos","parseFunctionParams","parseFunctionBody","parseBindingList","oldStrict","parseClassId","parseClassSuper","classBody","hadConstructor","parseClassElement","constructorAllowsSuper","this$1","tryContextual","k","noLineBreak","startNodeAt","static","parsePropertyName","allowsDirectSuper","parseClassMethod","parseMethod","parseExprSubscripts","checkExport","parseExprAtom","fNode","cNode","shouldParseExportStatement","checkVariableExport","parseExportSpecifiers","spec","checkUnreserved","checkLocalExport","checkPatternExport","pat","list$1","elt","decls","nodes","first","parseImportSpecifiers","node$1","node$2","statements","isDirectiveCandidate","pp$2","isBinding","toAssignableList","exprList","last","parseSpread","parseRestBinding","parseObj","close","allowEmpty","allowTrailingComma","elts","parseBindingListItem","parseMaybeDefault","bindingType","checkClashes","declareName","pp$3","checkPropClash","propHash","proto","other","noIn","afterLeftParse","parseYield","ownDestructuringErrors","oldParenAssign","oldTrailingComma","parseMaybeConditional","parseExprOps","parseMaybeUnary","parseExprOp","leftStartPos","leftStartLoc","minPrec","logical","op","buildBinary","sawUnary","parseAwait","parseSubscripts","noCalls","maybeAsyncArrow","optionalChained","parseSubscript","chainNode","optionalSupported","parseExprList","parseArrowExpression","parseTemplate","isTagged","readRegexp","canBeArrow","parseLiteral","parseParenAndDistinguishExpression","parseNew","parseExprImport","parseDynamicImport","parseImportMeta","errorPos","spreadStart","innerStartPos","innerStartLoc","lastIsComma","parseParenItem","innerEndPos","innerEndLoc","parseParenArrowList","finishNodeAt","par","item","empty$1","isImport","parseTemplateElement","cooked","tail","curElt","isAsyncProp","parseProperty","parsePropertyValue","paramCount","isArrowFunction","isMethod","isExpression","useStrict","checkParams","nonSimple","isSimpleParamList","oldLabels","allowDuplicates","nameHash","re","liberal","pp$4","SyntaxError","raisedAt","pp$5","Scope","var","lexical","functions","scope","redeclared","scope$1","scope$2","scope$3","SCOPE_TOP","pp$6","isExpr","preserveSpace","b_stat","b_expr","b_tmpl","p_stat","p_expr","q_tmpl","tryReadTemplateToken","f_stat","f_expr","f_expr_gen","f_gen","pp$7","braceIsBlock","prevType","curContext","inGeneratorContext","out","statementParens","allowed","ecma9BinaryProperties","ecma10BinaryProperties","unicodeBinaryProperties","unicodeGeneralCategoryValues","ecma9ScriptValues","ecma10ScriptValues","unicodeScriptValues","buildUnicodeData","binary","nonBinary","General_Category","Script","Script_Extensions","gc","scx","pp$8","RegExpValidationState","validFlags","unicodeProperties","switchU","switchN","lastIntValue","lastStringValue","lastAssertionIsQuantifiable","numCapturingParens","maxBackReference","groupNames","backReferenceNames","codePointToString","isSyntaxCharacter","isControlLetter","isUnicodePropertyNameCharacter","isHexDigit","hexToInt","isOctalDigit","reset","unicode","forceU","l","nextIndex","lookahead","advance","validateRegExpFlags","state","validateRegExpPattern","regexp_pattern","regexp_disjunction","regexp_alternative","regexp_eatQuantifier","regexp_eatTerm","regexp_eatAssertion","regexp_eatAtom","regexp_eatExtendedAtom","lookbehind","noError","regexp_eatQuantifierPrefix","regexp_eatBracedQuantifier","min","regexp_eatDecimalDigits","regexp_eatPatternCharacters","regexp_eatReverseSolidusAtomEscape","regexp_eatCharacterClass","regexp_eatUncapturingGroup","regexp_eatCapturingGroup","regexp_eatAtomEscape","regexp_groupSpecifier","regexp_eatInvalidBracedQuantifier","regexp_eatExtendedPatternCharacter","regexp_eatSyntaxCharacter","regexp_eatGroupName","regexp_eatRegExpIdentifierName","regexp_eatRegExpIdentifierStart","regexp_eatRegExpIdentifierPart","regexp_eatRegExpUnicodeEscapeSequence","regexp_eatBackReference","regexp_eatCharacterClassEscape","regexp_eatCharacterEscape","regexp_eatKGroupName","regexp_eatDecimalEscape","regexp_eatControlEscape","regexp_eatCControlLetter","regexp_eatZero","regexp_eatHexEscapeSequence","regexp_eatLegacyOctalEscapeSequence","regexp_eatIdentityEscape","regexp_eatControlLetter","regexp_eatFixedHexDigits","lead","leadSurrogateEnd","trail","regexp_eatHexDigits","regexp_eatUnicodePropertyValueExpression","regexp_eatUnicodePropertyName","regexp_eatUnicodePropertyValue","regexp_validateUnicodePropertyNameAndValue","regexp_eatLoneUnicodePropertyNameOrValue","nameOrValue","regexp_validateUnicodePropertyNameOrValue","regexp_classRanges","regexp_eatClassAtom","regexp_eatClassEscape","ch$1","regexp_eatClassControlLetter","regexp_eatOctalDigit","n1","n2","pp$9","stringToBigInt","BigInt","codePointToString$1","ignoreEscapeSequenceInKeyword","getToken","skipSpace","finishToken","readToken","fullCharCodeAtPos","readWord","getTokenFromCode","skipBlockComment","startSkip","loop","readToken_dot","readNumber","next2","readToken_slash","finishOp","readToken_mult_modulo_exp","tokentype","readToken_pipe_amp","readToken_caret","readToken_plus_min","readToken_lt_gt","readToken_eq_excl","readToken_question","next2$1","readRadixNumber","readString","escaped","inClass","flagsStart","readWord1","readInt","radix","maybeLegacyOctalNumericLiteral","allowSeparators","isLegacyOctalNumericLiteral","total","lastCode","startsWithDot","octal","val$1","parseInt","parseFloat","readCodePoint","codePos","readHexChar","invalidStringToken","chunkStart","readEscapedChar","INVALID_TEMPLATE_ESCAPE_ERROR","inTemplateElement","readTmplToken","readInvalidTemplateToken","position","inTemplate","octalStr","word","escStart","esc","acorn","tokTypes","keywordTypes","tokContexts","XHTMLEntities","hexNumber","decimalNumber","acornJsxMap","WeakMap","getJsxTokens","acornJsx","tt","tc_oTag","tc_cTag","tc_expr","jsxName","jsxText","jsxTagStart","jsxTagEnd","getQualifiedJSXName","namespace","plugin","tok","jsx_readToken","jsx_readEntity","jsx_readNewLine","normalizeCRLF","jsx_readString","entity","jsx_readWord","jsx_parseIdentifier","jsx_parseNamespacedName","allowNamespaces","jsx_parseElementName","allowNamespacedObjects","newNode","jsx_parseAttributeValue","jsx_parseExpressionContainer","jsx_parseEmptyExpression","jsx_parseAttribute","jsx_parseOpeningElementAt","attributes","nodeName","selfClosing","jsx_parseClosingElementAt","jsx_parseElementAt","closingElement","contents","fragmentOrElement","jsx_parseText","jsx_parseElement","refShortHandDefaultPos","quot","amp","apos","lt","gt","nbsp","iexcl","cent","pound","curren","yen","brvbar","sect","uml","copy","ordf","laquo","not","shy","macr","deg","plusmn","sup2","sup3","acute","micro","para","middot","cedil","sup1","ordm","raquo","frac14","frac12","frac34","iquest","Agrave","Aacute","Acirc","Atilde","Auml","Aring","AElig","Ccedil","Egrave","Eacute","Ecirc","Euml","Igrave","Iacute","Icirc","Iuml","ETH","Ntilde","Ograve","Oacute","Ocirc","Otilde","Ouml","times","Oslash","Ugrave","Uacute","Ucirc","Uuml","Yacute","THORN","szlig","agrave","aacute","acirc","atilde","auml","aring","aelig","ccedil","egrave","eacute","ecirc","euml","igrave","iacute","icirc","iuml","eth","ntilde","ograve","oacute","ocirc","otilde","ouml","divide","oslash","ugrave","uacute","ucirc","uuml","yacute","thorn","yuml","OElig","oelig","Scaron","scaron","Yuml","fnof","circ","tilde","Alpha","Beta","Gamma","Delta","Epsilon","Zeta","Eta","Theta","Iota","Kappa","Lambda","Mu","Nu","Xi","Omicron","Pi","Rho","Sigma","Tau","Upsilon","Phi","Chi","Psi","Omega","alpha","beta","gamma","delta","epsilon","zeta","eta","theta","iota","kappa","lambda","mu","nu","xi","omicron","pi","rho","sigmaf","sigma","tau","upsilon","phi","chi","psi","omega","thetasym","upsih","piv","ensp","emsp","thinsp","zwnj","zwj","lrm","rlm","ndash","mdash","lsquo","rsquo","sbquo","ldquo","rdquo","bdquo","dagger","Dagger","bull","hellip","permil","prime","Prime","lsaquo","rsaquo","oline","frasl","euro","image","weierp","real","trade","alefsym","larr","uarr","rarr","darr","harr","crarr","lArr","uArr","rArr","dArr","hArr","forall","exist","nabla","isin","notin","ni","prod","sum","minus","lowast","radic","infin","ang","and","or","cap","cup","there4","sim","cong","asymp","ne","equiv","le","ge","sub","sup","nsub","sube","supe","oplus","otimes","perp","sdot","lceil","rceil","lfloor","rfloor","lang","rang","loz","spades","clubs","hearts","diams","visitors","baseVisitor","st","found","isNew","recursive","funcs","make","makeTest","findNodeAfter","findNodeAround","findNodeAt","findNodeBefore","fullAncestor","Found","Ctor","skipThrough","ignore","_node","_st","_c","ParenthesizedExpression","cs","ForInit","Pattern","VariablePattern","MemberPattern","Class","baseGetTag","isObjectLike","isPlainObject","React","prettyPrintObject","reactIs","React__namespace","_interopNamespace","__esModule","getOwnPropertyDescriptor","freeze","React__default","spacer","fill","_toConsumableArray","_arrayWithoutHoles","_arrayLikeToArray","_iterableToArray","iter","_unsupportedIterableToArray","o","minLen","_nonIterableSpread","arr2","createStringTreeNode","supportFragment","getFunctionTypeName","functionType","getWrappedComponentDisplayName","Component","getReactElementDisplayName","concat","_context","noChildren","propsValue","onlyMeaningfulChildren","originalProps","cb","filteredProps","parseReactElement","_options$displayName","displayNameFn","childrens","noRefCheck","inlineFunction","trim","formatFunction","_options$functionValu","functionValue","formatComplexDataStructure","lvl","normalizedValue","safeSortObject","seen","WeakSet","stringifiedValue","prettyPrint","transform","currentObj","originalResult","currentValue","formatTreeNode","formatPropValue","symbolDescription","valueOf","isNaN","toISOString","formatProp","hasValue","hasDefaultValue","useBooleanShorthandSyntax","formattedPropValue","attributeFormattedInline","attributeFormattedMultiline","isMultilineAttribute","mergeSiblingPlainStringChildrenReducer","previousNodes","currentNode","previousNode","compensateMultilineStringElementIndentation","formattedElement","isInlineAttributeTooLong","inlineAttributeString","maxInlineAttributesLineLength","formatReactElementNode","_node$displayName","_node$props","_node$defaultProps","sortProps","outInlineAttr","outMultilineAttr","containsMultilineAttr","visibleAttributeNames","propFilter","haveDefaultValue","defaultPropName","haveKeyProp","haveRefProp","userPropsOnly","oneProp","sortedProps","shouldSortUserProps","attributeName","_formatProp","newLvl","REACT_FRAGMENT_TAG_NAME_EXPLICIT_SYNTAX","toReactElementTreeNode","formatReactFragmentNode","useFragmentShortSyntax","hasNoChildren","_ref2","_ref","jsxStopChars","preserveTrailingSpace","jsxStopChar","_ref$filterProps","_ref$showDefaultProps","_ref$showFunctions","_ref$tabStop","_ref$useBooleanShorth","_ref$useFragmentShort","_ref$sortProps","preserveFunctionLineBreak","isObject","ctor","prot","__assign","t","apply","__spreadArrays","il","a","jl","pad","combinedOptions","inlineCharacterLimit","newLine","newLineOrSpace","expandWhiteSpace","oneLined","eol","objKeys_1","keySymbol","isSymbol","isClassic","REACT_MODULE_REFERENCE","REACT_SERVER_CONTEXT_TYPE","REACT_OFFSCREEN_TYPE","hasWarnedAboutDeprecatedIsConcurrentMode","SuspenseList","isSuspenseList","getModuleId","cachedSetTimeout","cachedClearTimeout","currentQueue","process","defaultSetTimout","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","queue","draining","queueIndex","cleanUpNextTick","drainQueue","timeout","run","runClearTimeout","marker","Item","noop","nextTick","title","env","argv","versions","on","addListener","once","off","removeListener","removeAllListeners","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","sortObject","createNumberTreeNode","createReactElementTreeNode","createReactFragmentTreeNode","defaultFunctionValue","escape","usedValue","isKeyOrRefProps","createPropFilter","formatOneChildren","onlyPropsWithOriginalValue","shouldRenderMultilineAttr","sortPropsByNames","REACT_FRAGMENT_TAG_NAME_SHORT_SYNTAX","isKeyedFragment","shouldBeEscaped","reactElementToJsxString","formatTree"],"version":3,"file":"entry-preview-docs.3c6b6684.js.map"}