Mercurial > repos > fubar > jbrowse2
view x/static/js/972.c0d17685.chunk.js.map @ 125:49f3d3878413 draft
planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/jbrowse2 commit 5ea1f9c1eef1de76232e69aa6d34cda77d90d566
| author | fubar |
|---|---|
| date | Sat, 05 Oct 2024 23:58:05 +0000 |
| parents | |
| children |
line wrap: on
line source
{"version":3,"file":"static/js/972.c0d17685.chunk.js","mappings":"iHAcA,SAASA,EAAgBC,EAASC,EAAUC,EAAOC,GACjDC,KAAKJ,QAAWA,EAChBI,KAAKH,SAAWA,EAChBG,KAAKF,MAAWA,EAChBE,KAAKD,SAAWA,EAChBC,KAAKC,KAAW,cAEuB,mBAA5BC,MAAMC,mBACfD,MAAMC,kBAAkBH,KAAML,EAElC,EAhBA,SAAsBS,EAAOC,GAC3B,SAASC,IAASN,KAAKO,YAAcH,CAAO,CAC5CE,EAAKE,UAAYH,EAAOG,UACxBJ,EAAMI,UAAY,IAAIF,CACxB,CAcAG,CAAad,EAAiBO,OAE9BP,EAAgBe,aAAe,SAASb,EAAUC,GAChD,IAAIa,EAA2B,CACzBC,QAAS,SAASC,GAChB,MAAO,IAAOC,EAAcD,EAAYE,MAAQ,GAClD,EAEA,MAAS,SAASF,GAChB,IACIG,EADAC,EAAe,GAGnB,IAAKD,EAAI,EAAGA,EAAIH,EAAYK,MAAMC,OAAQH,IACxCC,GAAgBJ,EAAYK,MAAMF,aAAcI,MAC5CC,EAAYR,EAAYK,MAAMF,GAAG,IAAM,IAAMK,EAAYR,EAAYK,MAAMF,GAAG,IAC9EK,EAAYR,EAAYK,MAAMF,IAGpC,MAAO,KAAOH,EAAYS,SAAW,IAAM,IAAML,EAAe,GAClE,EAEAM,IAAK,SAASV,GACZ,MAAO,eACT,EAEAW,IAAK,SAASX,GACZ,MAAO,cACT,EAEAY,MAAO,SAASZ,GACd,OAAOA,EAAYa,WACrB,GAGN,SAASC,EAAIC,GACX,OAAOA,EAAGC,WAAW,GAAGC,SAAS,IAAIC,aACvC,CAEA,SAASjB,EAAckB,GACrB,OAAOA,EACJC,QAAQ,MAAO,QACfA,QAAQ,KAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,gBAAyB,SAASL,GAAM,MAAO,OAASD,EAAIC,EAAK,IACzEK,QAAQ,yBAAyB,SAASL,GAAM,MAAO,MAASD,EAAIC,EAAK,GAC9E,CAEA,SAASP,EAAYW,GACnB,OAAOA,EACJC,QAAQ,MAAO,QACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,KAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,MAAO,OACfA,QAAQ,gBAAyB,SAASL,GAAM,MAAO,OAASD,EAAIC,EAAK,IACzEK,QAAQ,yBAAyB,SAASL,GAAM,MAAO,MAASD,EAAIC,EAAK,GAC9E,CA4CA,MAAO,YAtCP,SAA0B/B,GACxB,IACImB,EAAGkB,EANoBrB,EAKvBsB,EAAe,IAAIf,MAAMvB,EAASsB,QAGtC,IAAKH,EAAI,EAAGA,EAAInB,EAASsB,OAAQH,IAC/BmB,EAAanB,IATYH,EASahB,EAASmB,GAR1CL,EAAyBE,EAAYuB,MAAMvB,IAalD,GAFAsB,EAAaE,OAETF,EAAahB,OAAS,EAAG,CAC3B,IAAKH,EAAI,EAAGkB,EAAI,EAAGlB,EAAImB,EAAahB,OAAQH,IACtCmB,EAAanB,EAAI,KAAOmB,EAAanB,KACvCmB,EAAaD,GAAKC,EAAanB,GAC/BkB,KAGJC,EAAahB,OAASe,CACxB,CAEA,OAAQC,EAAahB,QACnB,KAAK,EACH,OAAOgB,EAAa,GAEtB,KAAK,EACH,OAAOA,EAAa,GAAK,OAASA,EAAa,GAEjD,QACE,OAAOA,EAAaG,MAAM,GAAI,GAAGC,KAAK,MAClC,QACAJ,EAAaA,EAAahB,OAAS,GAE7C,CAMqBqB,CAAiB3C,GAAY,QAJlD,SAAuBC,GACrB,OAAOA,EAAQ,IAAOgB,EAAchB,GAAS,IAAO,cACtD,CAE4D2C,CAAc3C,GAAS,SACrF,EAo1CA4C,EAAOC,QAAU,CACfC,YAAajD,EACbkD,MAp1CF,SAAmBC,EAAOC,GACxBA,OAAsB,IAAZA,EAAqBA,EAAU,CAAC,EAE1C,IAyGIC,EAwH8BnD,EAAUC,EAAOC,EAjO/CkD,EAAa,CAAC,EAEdC,EAAyB,CAAEC,YAAaC,IACxCC,EAAyBD,GAEzBE,EAAS,IACTC,EAASC,GAAuB,KAAK,GACrCC,EAAS,IACTC,EAASF,GAAuB,KAAK,GACrCG,EAAS,SAASvB,EAAMnC,EAAM2D,EAASC,GAAU,MAAO,CAAEzB,OAAMnC,OAAM2D,UAASC,SAAS,EACxFC,EAAS,SACTC,EAASP,GAAuB,UAAU,GAC1CQ,EAAS,SACTC,EAAST,GAAuB,UAAU,GAC1CU,EAAS,QACTC,EAAUX,GAAuB,SAAS,GAC1CY,EAAU,OACVC,EAAUb,GAAuB,QAAQ,GACzCc,EAAU,UACVC,EAAUf,GAAuB,WAAW,GAC5CgB,EAAU,QACVC,EAAUjB,GAAuB,SAAS,GAC1CkB,EAAU,SACVC,EAAUnB,GAAuB,UAAU,GAC3CoB,EAAU,SAASC,EAAIC,GAAK,OAAOA,CAAG,EACtCC,EAAU,SAASF,EAAIG,GAIjB,OAHGH,EAAG5E,MACJ+E,EAAIC,QAAQJ,GAEPG,CACT,EACJE,EAAU,IACVC,EAAU3B,GAAuB,KAAK,GACtC4B,EAAU,IACVC,EAAU7B,GAAuB,KAAK,GACtC8B,EAAU,SAASlD,EAAMnC,EAAM2D,GAAW,MAAO,CAAExB,OAAMnC,OAAM2D,UAAU,EACzE2B,EAAU,IACVC,EAAUhC,GAAuB,KAAK,GACtCiC,EAAU,IACVC,EAAUlC,GAAuB,KAAK,GACtCmC,EAAU,SAASvD,EAAMwD,EAAM3F,EAAM2D,GAAW,MAAO,CAAExB,OAAMwD,OAAM3F,OAAM2D,UAAU,EACrFiC,EAAU,SAASzD,EAAM0D,EAAM7F,EAAM2D,GAAW,MAAO,CAAExB,OAAM0D,OAAM7F,OAAM2D,UAAU,EACrFmC,EAAU,IACVC,EAAUxC,GAAuB,KAAK,GACtCyC,EAAU,SAASpB,EAAIG,GAEf,OADAA,EAAIC,QAAQJ,GACLG,CACX,EACJkB,EAAU,MACVC,EAAU3C,GAAuB,OAAO,GACxC4C,EAAU,OACVC,EAAU7C,GAAuB,QAAQ,GACzC8C,EAAU,QACVC,EAAU/C,GAAuB,SAAS,GAC1CgD,EAAU,SACVC,EAAUjD,GAAuB,UAAU,GAC3CkD,EAAU,OACVC,GAAUnD,GAAuB,QAAQ,GACzCoD,GAAU,QACVC,GAAUrD,GAAuB,SAAS,GAC1CsD,GAAU,QACVC,GAAUvD,GAAuB,SAAS,GAC1CwD,GAAU,OACVC,GAAUzD,GAAuB,QAAQ,GACzC0D,GAAU,SACVC,GAAU3D,GAAuB,UAAU,GAC3C4D,GAAU,UACVC,GAAU7D,GAAuB,WAAW,GAC5C8D,GAAU,OACVC,GAAU/D,GAAuB,QAAQ,GACzCgE,GAAU,SACVC,GAAUjE,GAAuB,UAAU,GAC3CkE,GAAU,SACVC,GAAUnE,GAAuB,UAAU,GAC3CoE,GAAU,MACVC,GAAUrE,GAAuB,OAAO,GACxCsE,GAAU,SAASC,EAAGC,GAAK,OAAOD,EAAE,IAAIC,CAAE,EAC1CC,GAAU,aACVC,GAAUC,GAAqB,CAAC,CAAC,IAAK,KAAM,CAAC,IAAK,KAAM,MAAM,GAAO,GACrEC,GAAU,gBACVC,GAAUF,GAAqB,CAAC,CAAC,IAAK,KAAM,CAAC,IAAK,KAAM,CAAC,IAAK,KAAM,MAAM,GAAO,GACjFG,GAAU,SAASP,GAAK,OAAOhH,IAAO,EAMtCwH,IAJU/E,GAAuB,KAAM,GAE7B2E,GAAqB,CAAC,MAAO,GAAM,GAEnC,YACVK,GAAUL,GAAqB,CAAC,KAAM,OAAO,GAAM,GACnDM,GAAU,SAASV,GAAK,OAAOA,EAAExF,KAAK,IAAIN,QAAQ,KAAK,IAAIA,QAAQ,KAAK,GAAI,EAC5EyG,GAAUC,GAAqB,WAC/BC,GAAU,SACVC,GAAUV,GAAqB,CAAC,CAAC,IAAK,OAAO,GAAO,GACpDW,GAAU,WAAa,OAAOC,SAAShI,KAAQ,GAAK,EACpDiI,GAAUL,GAAqB,cAC/BM,GAAU,aACVC,GAAUf,GAAqB,CAAC,IAAK,KAAM,KAAM,OAAO,GAAO,GAE/DgB,GAAuB,EACvBC,GAAuB,EACvBC,GAAuB,CAAC,CAAEC,KAAM,EAAGC,OAAQ,IAC3CC,GAAuB,EACvBC,GAAuB,GACvBC,GAAuB,EAI3B,GAAI,cAAe3G,EAAS,CAC1B,KAAMA,EAAQ4G,aAAazG,GACzB,MAAM,IAAIhD,MAAM,mCAAqC6C,EAAQ4G,UAAY,MAG3EtG,EAAwBH,EAAuBH,EAAQ4G,UACzD,CAEA,SAAS5I,KACP,OAAO+B,EAAM8G,UAAUR,GAAcD,GACvC,CAsBA,SAAS3F,GAAuBzC,EAAM8I,GACpC,MAAO,CAAEzH,KAAM,UAAWrB,KAAMA,EAAM8I,WAAYA,EACpD,CAEA,SAAS1B,GAAqBjH,EAAOI,EAAUuI,GAC7C,MAAO,CAAEzH,KAAM,QAASlB,MAAOA,EAAOI,SAAUA,EAAUuI,WAAYA,EACxE,CAUA,SAASlB,GAAqBjH,GAC5B,MAAO,CAAEU,KAAM,QAASV,YAAaA,EACvC,CAEA,SAASoI,GAAsBC,GAC7B,IAAwCC,EAApCC,EAAUZ,GAAoBU,GAElC,GAAIE,EACF,OAAOA,EAGP,IADAD,EAAID,EAAM,GACFV,GAAoBW,IAC1BA,IASF,IALAC,EAAU,CACRX,MAFFW,EAAUZ,GAAoBW,IAEZV,KAChBC,OAAQU,EAAQV,QAGXS,EAAID,GACmB,KAAxBjH,EAAMjB,WAAWmI,IACnBC,EAAQX,OACRW,EAAQV,OAAS,GAEjBU,EAAQV,SAGVS,IAIF,OADAX,GAAoBU,GAAOE,EACpBA,CAEX,CAEA,SAASC,GAAoBC,EAAUC,GACrC,IAAIC,EAAkBP,GAAsBK,GACxCG,EAAkBR,GAAsBM,GAE5C,MAAO,CACLG,MAAO,CACLC,OAAQL,EACRb,KAAQe,EAAgBf,KACxBC,OAAQc,EAAgBd,QAE1B/H,IAAK,CACHgJ,OAAQJ,EACRd,KAAQgB,EAAchB,KACtBC,OAAQe,EAAcf,QAG5B,CAEA,SAASkB,GAAS5K,GACZsJ,GAAcK,KAEdL,GAAcK,KAChBA,GAAiBL,GACjBM,GAAsB,IAGxBA,GAAoBiB,KAAK7K,GAC3B,CAeA,SAASuD,KACP,IAAIuH,EAAQC,EAAQC,EAAQC,EAAQC,EAAQC,EAAUC,EAiGtD,OA/FAN,EAAKxB,GACA+B,OACMjI,IACT2H,EAAKO,QACMlI,GACJiI,OACMjI,IACT4H,EAAKO,QACMnI,GACJiI,OACMjI,IACT6H,EAAKO,QACMpI,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnB4B,EAAKzH,EACL6F,OAEA4B,EAAK9H,EACmB,IAApByG,IAAyBe,GAASlH,IAEpCwH,IAAO9H,GACJiI,OACMjI,GACT+H,EAiOpB,WACE,IAAIL,EAAIW,EAAQC,EAAIV,EAAQC,EAI5B,GAFAH,EAAKxB,IACLmC,EAAKE,QACMvI,EAET,GADKiI,OACMjI,EAAY,CAkBrB,IAjBAsI,EAAK,GACLV,EAAK1B,GACA+B,OACMjI,IACT6H,EAAKU,QACMvI,GACTmG,GAAeyB,EAEfA,EADKjG,EAAQ0G,EAAIR,KAOnB3B,GAAc0B,EACdA,EAAK5H,GAEA4H,IAAO5H,GACZsI,EAAGb,KAAKG,GACRA,EAAK1B,GACA+B,OACMjI,IACT6H,EAAKU,QACMvI,GACTmG,GAAeyB,EAEfA,EADKjG,EAAQ0G,EAAIR,KAOnB3B,GAAc0B,EACdA,EAAK5H,GAGLsI,IAAOtI,IACT4H,EAAKK,QACMjI,GACTmG,GAAeuB,EAEfA,EADAW,EAAKvG,EAAQuG,EAAIC,KAOnBpC,GAAcwB,EACdA,EAAK1H,EAET,MACEkG,GAAcwB,EACdA,EAAK1H,OAGPkG,GAAcwB,EACdA,EAAK1H,EAGP,OAAO0H,CACT,CArS0Bc,GACFT,IAAQ/H,GACJiI,OACMjI,GAC4B,KAAlCH,EAAMjB,WAAWsH,KACnB8B,EAAMxH,EACN0F,OAEA8B,EAAMhI,EACkB,IAApByG,IAAyBe,GAAS/G,IAEpCuH,IAAQhI,GACJiI,OACMjI,GACVmG,GAAeuB,EAEfA,EADKhH,EAAOiH,EAAIC,EAAIC,EAAIE,KAO1B7B,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KA2BnBkG,GAAcwB,EACdA,EAAK1H,GAGA0H,CACT,CAEA,SAASQ,KACP,IAAIR,EA4BJ,OA1BI7H,EAAM4I,OAAOvC,GAAa,KAAOrF,GACnC6G,EAAK7G,EACLqF,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS1G,IAEpC4G,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOnF,GACnC2G,EAAK3G,EACLmF,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASxG,IAEpC0G,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOjF,GACnCyG,EAAKzG,EACLiF,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAStG,MAKrCwG,CACT,CAEA,SAASS,KACP,IAAIT,EAAIW,EAAIV,EAAIW,EAyEhB,OAvEAZ,EAAKgB,QACM1I,IACT0H,EAAKxB,IACLmC,EAAKK,QACM1I,IACT2H,EAAKgB,QACM3I,EAET0H,EADAW,EAAK,CAACA,EAAIV,IAOZzB,GAAcwB,EACdA,EAAK1H,GAEH0H,IAAO1H,IACT0H,EAAKxB,IACLmC,EAAKK,QACM1I,GACLH,EAAM4I,OAAOvC,GAAa,KAAO/E,GACnCwG,EAAKxG,EACL+E,IAAe,IAEfyB,EAAK3H,EACmB,IAApByG,IAAyBe,GAASpG,IAEpCuG,IAAO3H,EAET0H,EADAW,EAAK,CAACA,EAAIV,IAGVzB,GAAcwB,EACdA,EAAK1H,KAGPkG,GAAcwB,EACdA,EAAK1H,GAEH0H,IAAO1H,IACT0H,EAAKxB,IACLmC,EAAKK,QACM1I,IACT2H,EAAKgB,QACM3I,GACLH,EAAM4I,OAAOvC,GAAa,KAAO/E,GACnCmH,EAAKnH,EACL+E,IAAe,IAEfoC,EAAKtI,EACmB,IAApByG,IAAyBe,GAASpG,IAEpCkH,IAAOtI,EAET0H,EADAW,EAAK,CAACA,EAAIV,EAAIW,IAGdpC,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,MAMN0H,CACT,CAEA,SAASiB,KACP,IAAIjB,EA4BJ,OA1BI7H,EAAM4I,OAAOvC,GAAa,KAAO7E,GACnCqG,EAAKrG,EACL6E,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASlG,IAEpCoG,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO3E,GACnCmG,EAAKnG,EACL2E,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAShG,IAEpCkG,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOzE,GACnCiG,EAAKjG,EACLyE,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS9F,MAKrCgG,CACT,CAEA,SAASU,KACP,IAAIV,EAOJ,OALAA,EAAKkB,QACM5I,IACT0H,EAAKO,MAGAP,CACT,CAwHA,SAASa,KACP,IAAIb,EAAIW,EAAQC,EAAQO,EAAQC,EAAQC,EAASC,EAAUC,EAsQ3D,OApQAvB,EAAKxB,IACLmC,EAAKa,QACMlJ,GACJiI,OACMjI,IACTsI,EAAKI,QACM1I,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnB2C,EAAK1G,EACL+D,OAEA2C,EAAK7I,EACmB,IAApByG,IAAyBe,GAASpF,IAEpCyG,IAAO7I,GACJiI,OACMjI,IACT8I,EAAKV,QACMpI,GACTmG,GAAeuB,EAEfA,EADAW,EAAKhG,EAAQgG,EAAIC,EAAIQ,KAWzB5C,GAAcwB,EACdA,EAAK1H,KAebkG,GAAcwB,EACdA,EAAK1H,GAEH0H,IAAO1H,IACT0H,EAAKxB,IACLmC,EAAKa,QACMlJ,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnBoC,EAAKhG,EACL4D,OAEAoC,EAAKtI,EACmB,IAApByG,IAAyBe,GAASjF,IAEpC+F,IAAOtI,GACJiI,OACMjI,GACT6I,EAgbZ,WACE,IAAInB,EAOJ,OALAA,EAoJF,WACE,IAAIA,EAAQC,EAAIW,EAKhB,GAHA7B,KACAiB,EAAKxB,GACA+B,OACMjI,EAAY,CASrB,GARA2H,EAAK,GACDhC,GAAQwD,KAAKtJ,EAAMuJ,OAAOlD,MAC5BoC,EAAKzI,EAAMuJ,OAAOlD,IAClBA,OAEAoC,EAAKtI,EACmB,IAApByG,IAAyBe,GAAS5B,KAEpC0C,IAAOtI,EACT,KAAOsI,IAAOtI,GACZ2H,EAAGF,KAAKa,GACJ3C,GAAQwD,KAAKtJ,EAAMuJ,OAAOlD,MAC5BoC,EAAKzI,EAAMuJ,OAAOlD,IAClBA,OAEAoC,EAAKtI,EACmB,IAApByG,IAAyBe,GAAS5B,UAI1C+B,EAAK3H,EAEH2H,IAAO3H,GACTmG,GAAeuB,EAEfA,EADK7B,OAGLK,GAAcwB,EACdA,EAAK1H,EAET,MACEkG,GAAcwB,EACdA,EAAK1H,EAQP,OANAyG,KACIiB,IAAO1H,IAEe,IAApByG,IAAyBe,GAAS/B,KAGjCiC,CACT,CApMO2B,GACD3B,IAAO1H,IACT0H,EAAKgB,MAGAhB,CACT,CAzbiB4B,GACDT,IAAO7I,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnB4C,EAAKtG,EACL0D,OAEA4C,EAAK9I,EACmB,IAApByG,IAAyBe,GAAS/E,IAEpCqG,IAAO9I,GACJiI,OACMjI,IACT+I,EAAKL,QACM1I,GACHiI,OACMjI,GAC4B,KAAlCH,EAAMjB,WAAWsH,KACnB8C,EAAM7G,EACN+D,OAEA8C,EAAMhJ,EACkB,IAApByG,IAAyBe,GAASpF,IAEpC4G,IAAQhJ,GACJiI,OACMjI,IACViJ,EAAMb,QACMpI,GACVmG,GAAeuB,EAEfA,EADAW,EAAK3F,EAAQ2F,EAAIQ,EAAIE,EAAIE,KAW7B/C,GAAcwB,EACdA,EAAK1H,KAebkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,GAEH0H,IAAO1H,IACT0H,EAAKxB,IACLmC,EAAKa,QACMlJ,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnBoC,EAAKjI,EACL6F,OAEAoC,EAAKtI,EACmB,IAApByG,IAAyBe,GAASlH,IAEpCgI,IAAOtI,GACJiI,OACMjI,GACT6I,EA8Fd,WACE,IAAInB,EAAIW,EAAIV,EAAIW,EAAIV,EAAQC,EAI5B,GAFAH,EAAKxB,IACLmC,EAAKK,QACM1I,EAAY,CA8BrB,IA7BA2H,EAAK,GACLW,EAAKpC,GACiC,KAAlCrG,EAAMjB,WAAWsH,KACnB0B,EAAK9E,EACLoD,OAEA0B,EAAK5H,EACmB,IAApByG,IAAyBe,GAASzE,IAEpC6E,IAAO5H,GACJiI,OACMjI,IACT6H,EAAKa,QACM1I,GACTmG,GAAemC,EAEfA,EADAV,EAAKjG,EAAQ0G,EAAIR,KAWrB3B,GAAcoC,EACdA,EAAKtI,GAEAsI,IAAOtI,GACZ2H,EAAGF,KAAKa,GACRA,EAAKpC,GACiC,KAAlCrG,EAAMjB,WAAWsH,KACnB0B,EAAK9E,EACLoD,OAEA0B,EAAK5H,EACmB,IAApByG,IAAyBe,GAASzE,IAEpC6E,IAAO5H,GACJiI,OACMjI,IACT6H,EAAKa,QACM1I,GACTmG,GAAemC,EAEfA,EADAV,EAAKjG,EAAQ0G,EAAIR,KAWrB3B,GAAcoC,EACdA,EAAKtI,GAGL2H,IAAO3H,GACTmG,GAAeuB,EAEfA,EADAW,EAAKrF,EAAQqF,EAAIV,KAGjBzB,GAAcwB,EACdA,EAAK1H,EAET,MACEkG,GAAcwB,EACdA,EAAK1H,EAGP,OAAO0H,CACT,CA9KmB6B,GACDV,IAAO7I,GACJiI,OACMjI,GAC6B,KAAlCH,EAAMjB,WAAWsH,KACnB4C,EAAKtI,EACL0F,OAEA4C,EAAK9I,EACmB,IAApByG,IAAyBe,GAAS/G,IAEpCqI,IAAO9I,GACJiI,OACMjI,IACT+I,EAAKL,QACM1I,GACHiI,OACMjI,GAC4B,KAAlCH,EAAMjB,WAAWsH,KACnB8C,EAAM7G,EACN+D,OAEA8C,EAAMhJ,EACkB,IAApByG,IAAyBe,GAASpF,IAEpC4G,IAAQhJ,GACJiI,OACMjI,IACViJ,EAAMb,QACMpI,GACVmG,GAAeuB,EAEfA,EADAW,EAAKzF,EAAQyF,EAAIQ,EAAIE,EAAIE,KAW7B/C,GAAcwB,EACdA,EAAK1H,KAebkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,KAOTkG,GAAcwB,EACdA,EAAK1H,GAEH0H,IAAO1H,IACT0H,EApSR,WACE,IAAIA,EAAIW,EAAIV,EAAIW,EAAIV,EA8BpB,OA5BAF,EAAKxB,IACLmC,EAAKJ,QACMjI,GACT2H,EApBJ,WACE,IAAID,EAUJ,OARsC,KAAlC7H,EAAMjB,WAAWsH,KACnBwB,EAAKzF,EACLiE,OAEAwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAStF,IAGjCwF,CACT,CAQS8B,GACD7B,IAAO3H,IACTsI,EAAKM,QACM5I,IACT4H,EAAKK,QACMjI,EAET0H,EADAW,EAAK,CAACA,EAAIV,EAAIW,EAAIV,IAWtB1B,GAAcwB,EACdA,EAAK1H,KAGPkG,GAAcwB,EACdA,EAAK1H,GAGA0H,CACT,CAoQa+B,MAKJ/B,CACT,CAoFA,SAASwB,KACP,IAAIxB,EAAIW,EAAQC,EAuJhB,OArJIzI,EAAM4I,OAAOvC,GAAa,KAAOjD,GACnCyE,EAAKzE,EACLiD,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAStE,IAEpCwE,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO/C,GACnCuE,EAAKvE,EACL+C,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASpE,IAEpCsE,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO7C,GACnCqE,EAAKrE,EACL6C,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASlE,IAEpCoE,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO3C,GACnCmE,EAAKnE,EACL2C,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAShE,IAEpCkE,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOzC,GACnCiE,EAAKjE,EACLyC,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS9D,KAEpCgE,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOvC,IACnC+D,EAAK/D,GACLuC,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS5D,KAEpC8D,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOrC,IACnC6D,EAAK7D,GACLqC,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS1D,KAEpC4D,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOnC,IACnC2D,EAAK3D,GACLmC,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASxD,KAEpC0D,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOjC,IACnCyD,EAAKzD,GACLiC,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAStD,KAEpCwD,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO/B,IACnCuD,EAAKvD,GACL+B,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASpD,KAEpCsD,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO7B,IACnCqD,EAAKrD,GACL6B,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAASlD,KAEpCoD,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAO3B,IACnCmD,EAAKnD,GACL2B,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAShD,KAEpCkD,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOzB,IACnCiD,EAAKjD,GACLyB,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS9C,KAEpCgD,IAAO1H,IACLH,EAAM4I,OAAOvC,GAAa,KAAOvB,IACnC+C,EAAK/C,GACLuB,IAAe,IAEfwB,EAAK1H,EACmB,IAApByG,IAAyBe,GAAS5C,KAEpC8C,IAAO1H,IACT0H,EAAKxB,IACLmC,EAAKH,QACMlI,GACJiI,OACMjI,IACTsI,EAAKH,QACMnI,GACTmG,GAAeuB,EAEfA,EADAW,EAAKxD,GAAQwD,EAAIC,KAWrBpC,GAAcwB,EACdA,EAAK1H,iBAiB5B0H,CACT,CAaA,SAASgB,KACP,IAAIhB,EAAIW,EAAIV,EAAIW,EAAIV,EAWpB,GATAF,EAAKxB,GACLmC,EAAKnC,GACDlB,GAAQmE,KAAKtJ,EAAMuJ,OAAOlD,MAC5ByB,EAAK9H,EAAMuJ,OAAOlD,IAClBA,OAEAyB,EAAK3H,EACmB,IAApByG,IAAyBe,GAASvC,KAEpC0C,IAAO3H,EAAY,CASrB,IARAsI,EAAK,GACDnD,GAAQgE,KAAKtJ,EAAMuJ,OAAOlD,MAC5B0B,EAAK/H,EAAMuJ,OAAOlD,IAClBA,OAEA0B,EAAK5H,EACmB,IAApByG,IAAyBe,GAASpC,KAEjCwC,IAAO5H,GACZsI,EAAGb,KAAKG,GACJzC,GAAQgE,KAAKtJ,EAAMuJ,OAAOlD,MAC5B0B,EAAK/H,EAAMuJ,OAAOlD,IAClBA,OAEA0B,EAAK5H,EACmB,IAApByG,IAAyBe,GAASpC,KAGtCkD,IAAOtI,EAETqI,EADAV,EAAK,CAACA,EAAIW,IAGVpC,GAAcmC,EACdA,EAAKrI,EAET,MACEkG,GAAcmC,EACdA,EAAKrI,EAQP,OANIqI,IAAOrI,IACTmG,GAAeuB,EACfW,EAAKhD,GAAQgD,IAEVA,CAGP,CA4DA,SAASO,KACP,IAAIlB,EAAIW,EAAIV,EAWZ,IATAD,EAAKxB,GACLmC,EAAK,GACD/C,GAAQ6D,KAAKtJ,EAAMuJ,OAAOlD,MAC5ByB,EAAK9H,EAAMuJ,OAAOlD,IAClBA,OAEAyB,EAAK3H,EACmB,IAApByG,IAAyBe,GAASjC,KAEjCoC,IAAO3H,GACZqI,EAAGZ,KAAKE,GACJrC,GAAQ6D,KAAKtJ,EAAMuJ,OAAOlD,MAC5ByB,EAAK9H,EAAMuJ,OAAOlD,IAClBA,OAEAyB,EAAK3H,EACmB,IAApByG,IAAyBe,GAASjC,KAS1C,OANI8C,IAAOrI,IACTmG,GAAeuB,EACfW,EAAK7C,GAAQ6C,IAEVA,CAGP,CAoDA,SAASJ,KACP,IAAIP,EAAIW,EAWR,IATA5B,KACAiB,EAAK,GACD1B,GAAQmD,KAAKtJ,EAAMuJ,OAAOlD,MAC5BmC,EAAKxI,EAAMuJ,OAAOlD,IAClBA,OAEAmC,EAAKrI,EACmB,IAApByG,IAAyBe,GAASvB,KAEjCoC,IAAOrI,GACZ0H,EAAGD,KAAKY,GACJrC,GAAQmD,KAAKtJ,EAAMuJ,OAAOlD,MAC5BmC,EAAKxI,EAAMuJ,OAAOlD,IAClBA,OAEAmC,EAAKrI,EACmB,IAApByG,IAAyBe,GAASvB,KAS1C,OANAQ,KACIiB,IAAO1H,IACTqI,EAAKrI,EACmB,IAApByG,IAAyBe,GAASzB,KAGjC2B,CACT,CAIA,IAFA3H,EAAaK,OAEMJ,GAAckG,KAAgBrG,EAAM3B,OACrD,OAAO6B,EAMP,MAJIA,IAAeC,GAAckG,GAAcrG,EAAM3B,QACnDsJ,GA1qCK,CAAErI,KAAM,QAyEiBvC,EAqmC9B4J,GArmCwC3J,EAsmCxC0J,GAAiB1G,EAAM3B,OAAS2B,EAAMuJ,OAAO7C,IAAkB,KAtmChBzJ,EAumC/CyJ,GAAiB1G,EAAM3B,OACnB+I,GAAoBV,GAAgBA,GAAiB,GACrDU,GAAoBV,GAAgBA,IAxmCnC,IAAI7J,EACTA,EAAgBe,aAAab,EAAUC,GACvCD,EACAC,EACAC,EAumCN,E,0PCv9CO,MAAM4M,EAAW,+tBAiBXC,EAAc,m0CAyBdC,EAAc,s2DAwBdC,EAAU,qYAUVC,EAAS,yQAQTC,EAAgB,m9BAchBC,EAAS,qtDAkCTC,EAAmB,spDAiBnBC,EAAY,m6BAgBZC,EAAa,yfCjK1B,EAAeC,OAAOC,YACpBD,OAAOE,QAAQ,GAAOC,KAAI,EAAEC,EAAKC,KAAS,CACxCD,GACA,IAAA5K,OAAM6K,EAAIC,YCMP,SAASC,EAAYC,GAC1B,MAAMC,EAAe,IAAIC,IAAI,CAAC,OAAQ,MAAO,QAAS,SACtD,MAAO,IACFF,EACHhK,OAAQgK,EAAQhK,OACb2J,KAAIQ,IAAa,IACbA,EACHC,QAASD,EAAUpI,MAA2B,SAAnBoI,EAAU5L,KACrC8L,eAAgBF,EAAUpI,MAAQkI,EAAaK,IAAIH,EAAU5L,MAC7DgM,WAAYJ,EAAUpI,MAAQkI,EAAaK,IAAIH,EAAU5L,UAI1DiM,QAAOC,KAAOA,EAAErO,OAEvB,CCxBA,MAAMsO,EAAY,CAAE,IAAK,EAAG,KAAM,EAAG,IAAK,GAU3B,MAAMC,EAKnB,WAAAjO,CAAYkO,EAA4C,CAAC,GACvD,GAAIA,EAAKZ,QACP7N,KAAK6N,QAAUD,EAAY,IAAA/K,MAAa4L,EAAKZ,eACxC,GAAIY,EAAKrM,KAAM,CACpB,IAAK,EAAMqM,EAAKrM,MACd,MAAM,IAAIlC,MAAM,kBAElBF,KAAK6N,QAAUD,EAAY,EAAMa,EAAKrM,MACxC,MACEpC,KAAK6N,QAAUD,EAAY,EAAMV,kBACjClN,KAAK0O,mBAAoB,CAE7B,CASA,SAAAC,CAAUrF,EAAyBsF,EAA8B,CAAC,GAChE,MAAM,QAAEf,GAAY7N,MACd,SAAE6O,GAAaD,EACf/K,EAASzC,MAAM6M,QAAQ3E,GAAQA,EAAOA,EAAKwF,MAAM,MAEvD,IAAIC,EAAU,CAAC,EACf,IACG/O,KAAK0O,mBACL1O,KAAK0O,mBAzCZ,SAAqB7K,G,MACnB,OACEA,EAAO1C,QAAU,KAChB6N,OAAOC,MAAMlG,SAASlF,EAAO,GAAI,OACxB,QAAV,EAAAA,EAAO,WAAG,eAAEiL,MAAM,KAAKT,QAAOC,KAAOA,IAAGnN,UAAW4H,SAASlF,EAAO,GAAI,GAE3E,CAmCiCqL,CAAYrL,GAEvC,IAAK,IAAI7C,EAAI,EAAGA,EAAI6M,EAAQhK,OAAO1C,OAAQH,IAAK,CAC9C,MAAMgN,EAAYH,EAAQhK,OAAO7C,GACjC,IAAImO,EAAiBtL,EAAO7C,GAC5B,MAAM,UAAEoN,EAAS,QAAEH,EAAO,eAAEC,EAAc,KAAEjO,GAAS+N,EACrD,GAAImB,QACF,MAEF,GAAkB,MAAdA,EAAmB,CACrB,GAAIf,EAAW,CACb,MAAMgB,EAAMJ,OAAOG,GACnBA,EAAYH,OAAOC,MAAMG,GAAOD,EAAYC,CAC9C,MAAWnB,IACTkB,EAAYA,EAAUL,MAAM,KACY,KAApCK,EAAUA,EAAUhO,OAAS,IAC/BgO,EAAUE,MAERnB,IACFiB,EAAYA,EAAU3B,IAAIwB,UAI9BD,EAAQ9O,GAAQkP,CAClB,CACF,KACK,CACL,MAAMG,EAAa,CAAC,QAAS,aAAc,WAAY,QACvDP,EAAU1B,OAAOC,YACfzJ,EAAO2J,KAAI,CAACc,EAAGtN,IAAM,CAACsO,EAAWtO,IAAM,QAAUA,EAAGsN,MAEtDS,EAAQQ,YAAcR,EAAQQ,WAC9BR,EAAQS,UAAYT,EAAQS,SACvBR,OAAOC,MAAMD,OAAOS,WAAWV,EAAQW,WAC1CX,EAAQY,OAASZ,EAAQW,cAClBX,EAAQW,QAEM,MAAnBX,EAAQa,QAAqC,MAAnBb,EAAQa,SACpCb,EAAQc,OAASd,EAAQa,cAClBb,EAAQa,OAEnB,CAOA,OANIf,IACFE,EAAQF,SAAWA,GAErBE,EAAQc,OAAStB,EAAUQ,EAAQc,SAAqC,EAExEd,EAAQe,MAAQC,mBAAmBhB,EAAQe,OACpCf,CACT,E","sources":["../../../node_modules/@gmod/bed/src/autoSql.js","../../../node_modules/@gmod/bed/src/as/autoSqlSchemas.ts","../../../node_modules/@gmod/bed/src/defaultTypes.ts","../../../node_modules/@gmod/bed/src/util.ts","../../../node_modules/@gmod/bed/src/parser.ts"],"sourcesContent":["/*\n * Generated by PEG.js 0.10.0.\n *\n * http://pegjs.org/\n */\n\n\"use strict\";\n\nfunction peg$subclass(child, parent) {\n function ctor() { this.constructor = child; }\n ctor.prototype = parent.prototype;\n child.prototype = new ctor();\n}\n\nfunction peg$SyntaxError(message, expected, found, location) {\n this.message = message;\n this.expected = expected;\n this.found = found;\n this.location = location;\n this.name = \"SyntaxError\";\n\n if (typeof Error.captureStackTrace === \"function\") {\n Error.captureStackTrace(this, peg$SyntaxError);\n }\n}\n\npeg$subclass(peg$SyntaxError, Error);\n\npeg$SyntaxError.buildMessage = function(expected, found) {\n var DESCRIBE_EXPECTATION_FNS = {\n literal: function(expectation) {\n return \"\\\"\" + literalEscape(expectation.text) + \"\\\"\";\n },\n\n \"class\": function(expectation) {\n var escapedParts = \"\",\n i;\n\n for (i = 0; i < expectation.parts.length; i++) {\n escapedParts += expectation.parts[i] instanceof Array\n ? classEscape(expectation.parts[i][0]) + \"-\" + classEscape(expectation.parts[i][1])\n : classEscape(expectation.parts[i]);\n }\n\n return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";\n },\n\n any: function(expectation) {\n return \"any character\";\n },\n\n end: function(expectation) {\n return \"end of input\";\n },\n\n other: function(expectation) {\n return expectation.description;\n }\n };\n\n function hex(ch) {\n return ch.charCodeAt(0).toString(16).toUpperCase();\n }\n\n function literalEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\"/g, '\\\\\"')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function classEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\\]/g, '\\\\]')\n .replace(/\\^/g, '\\\\^')\n .replace(/-/g, '\\\\-')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function describeExpectation(expectation) {\n return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);\n }\n\n function describeExpected(expected) {\n var descriptions = new Array(expected.length),\n i, j;\n\n for (i = 0; i < expected.length; i++) {\n descriptions[i] = describeExpectation(expected[i]);\n }\n\n descriptions.sort();\n\n if (descriptions.length > 0) {\n for (i = 1, j = 1; i < descriptions.length; i++) {\n if (descriptions[i - 1] !== descriptions[i]) {\n descriptions[j] = descriptions[i];\n j++;\n }\n }\n descriptions.length = j;\n }\n\n switch (descriptions.length) {\n case 1:\n return descriptions[0];\n\n case 2:\n return descriptions[0] + \" or \" + descriptions[1];\n\n default:\n return descriptions.slice(0, -1).join(\", \")\n + \", or \"\n + descriptions[descriptions.length - 1];\n }\n }\n\n function describeFound(found) {\n return found ? \"\\\"\" + literalEscape(found) + \"\\\"\" : \"end of input\";\n }\n\n return \"Expected \" + describeExpected(expected) + \" but \" + describeFound(found) + \" found.\";\n};\n\nfunction peg$parse(input, options) {\n options = options !== void 0 ? options : {};\n\n var peg$FAILED = {},\n\n peg$startRuleFunctions = { declaration: peg$parsedeclaration },\n peg$startRuleFunction = peg$parsedeclaration,\n\n peg$c0 = \"(\",\n peg$c1 = peg$literalExpectation(\"(\", false),\n peg$c2 = \")\",\n peg$c3 = peg$literalExpectation(\")\", false),\n peg$c4 = function(type, name, comment, fields) { return { type, name, comment, fields } },\n peg$c5 = \"simple\",\n peg$c6 = peg$literalExpectation(\"simple\", false),\n peg$c7 = \"object\",\n peg$c8 = peg$literalExpectation(\"object\", false),\n peg$c9 = \"table\",\n peg$c10 = peg$literalExpectation(\"table\", false),\n peg$c11 = \"auto\",\n peg$c12 = peg$literalExpectation(\"auto\", false),\n peg$c13 = \"primary\",\n peg$c14 = peg$literalExpectation(\"primary\", false),\n peg$c15 = \"index\",\n peg$c16 = peg$literalExpectation(\"index\", false),\n peg$c17 = \"unique\",\n peg$c18 = peg$literalExpectation(\"unique\", false),\n peg$c19 = function(f1, w) { return w; },\n peg$c20 = function(f1, fds) {\n if(f1.name) {\n fds.unshift(f1);\n }\n return fds;\n },\n peg$c21 = \"#\",\n peg$c22 = peg$literalExpectation(\"#\", false),\n peg$c23 = \";\",\n peg$c24 = peg$literalExpectation(\";\", false),\n peg$c25 = function(type, name, comment) { return { type, name, comment } },\n peg$c26 = \"[\",\n peg$c27 = peg$literalExpectation(\"[\", false),\n peg$c28 = \"]\",\n peg$c29 = peg$literalExpectation(\"]\", false),\n peg$c30 = function(type, size, name, comment) { return { type, size, name, comment } },\n peg$c31 = function(type, vals, name, comment) { return { type, vals, name, comment } },\n peg$c32 = \",\",\n peg$c33 = peg$literalExpectation(\",\", false),\n peg$c34 = function(f1, fds) {\n fds.unshift(f1);\n return fds;\n },\n peg$c35 = \"int\",\n peg$c36 = peg$literalExpectation(\"int\", false),\n peg$c37 = \"uint\",\n peg$c38 = peg$literalExpectation(\"uint\", false),\n peg$c39 = \"short\",\n peg$c40 = peg$literalExpectation(\"short\", false),\n peg$c41 = \"ushort\",\n peg$c42 = peg$literalExpectation(\"ushort\", false),\n peg$c43 = \"byte\",\n peg$c44 = peg$literalExpectation(\"byte\", false),\n peg$c45 = \"ubyte\",\n peg$c46 = peg$literalExpectation(\"ubyte\", false),\n peg$c47 = \"float\",\n peg$c48 = peg$literalExpectation(\"float\", false),\n peg$c49 = \"char\",\n peg$c50 = peg$literalExpectation(\"char\", false),\n peg$c51 = \"string\",\n peg$c52 = peg$literalExpectation(\"string\", false),\n peg$c53 = \"lstring\",\n peg$c54 = peg$literalExpectation(\"lstring\", false),\n peg$c55 = \"enum\",\n peg$c56 = peg$literalExpectation(\"enum\", false),\n peg$c57 = \"double\",\n peg$c58 = peg$literalExpectation(\"double\", false),\n peg$c59 = \"bigint\",\n peg$c60 = peg$literalExpectation(\"bigint\", false),\n peg$c61 = \"set\",\n peg$c62 = peg$literalExpectation(\"set\", false),\n peg$c63 = function(t, n) { return t+' '+n },\n peg$c64 = /^[a-zA-Z_]/,\n peg$c65 = peg$classExpectation([[\"a\", \"z\"], [\"A\", \"Z\"], \"_\"], false, false),\n peg$c66 = /^[a-zA-Z0-9_]/,\n peg$c67 = peg$classExpectation([[\"a\", \"z\"], [\"A\", \"Z\"], [\"0\", \"9\"], \"_\"], false, false),\n peg$c68 = function(t) { return text() },\n peg$c69 = \"\\\"\",\n peg$c70 = peg$literalExpectation(\"\\\"\", false),\n peg$c71 = /^[^\"]/,\n peg$c72 = peg$classExpectation([\"\\\"\"], true, false),\n peg$c73 = function(t) { return t.join('') },\n peg$c74 = /^[^\\n\\r]/,\n peg$c75 = peg$classExpectation([\"\\n\", \"\\r\"], true, false),\n peg$c76 = function(t) { return t.join('').replace(/^\"/,'').replace(/\"$/,'') },\n peg$c77 = peg$otherExpectation(\"integer\"),\n peg$c78 = /^[0-9]/,\n peg$c79 = peg$classExpectation([[\"0\", \"9\"]], false, false),\n peg$c80 = function() { return parseInt(text(), 10); },\n peg$c81 = peg$otherExpectation(\"whitespace\"),\n peg$c82 = /^[ \\t\\n\\r]/,\n peg$c83 = peg$classExpectation([\" \", \"\\t\", \"\\n\", \"\\r\"], false, false),\n\n peg$currPos = 0,\n peg$savedPos = 0,\n peg$posDetailsCache = [{ line: 1, column: 1 }],\n peg$maxFailPos = 0,\n peg$maxFailExpected = [],\n peg$silentFails = 0,\n\n peg$result;\n\n if (\"startRule\" in options) {\n if (!(options.startRule in peg$startRuleFunctions)) {\n throw new Error(\"Can't start parsing from rule \\\"\" + options.startRule + \"\\\".\");\n }\n\n peg$startRuleFunction = peg$startRuleFunctions[options.startRule];\n }\n\n function text() {\n return input.substring(peg$savedPos, peg$currPos);\n }\n\n function location() {\n return peg$computeLocation(peg$savedPos, peg$currPos);\n }\n\n function expected(description, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildStructuredError(\n [peg$otherExpectation(description)],\n input.substring(peg$savedPos, peg$currPos),\n location\n );\n }\n\n function error(message, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildSimpleError(message, location);\n }\n\n function peg$literalExpectation(text, ignoreCase) {\n return { type: \"literal\", text: text, ignoreCase: ignoreCase };\n }\n\n function peg$classExpectation(parts, inverted, ignoreCase) {\n return { type: \"class\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };\n }\n\n function peg$anyExpectation() {\n return { type: \"any\" };\n }\n\n function peg$endExpectation() {\n return { type: \"end\" };\n }\n\n function peg$otherExpectation(description) {\n return { type: \"other\", description: description };\n }\n\n function peg$computePosDetails(pos) {\n var details = peg$posDetailsCache[pos], p;\n\n if (details) {\n return details;\n } else {\n p = pos - 1;\n while (!peg$posDetailsCache[p]) {\n p--;\n }\n\n details = peg$posDetailsCache[p];\n details = {\n line: details.line,\n column: details.column\n };\n\n while (p < pos) {\n if (input.charCodeAt(p) === 10) {\n details.line++;\n details.column = 1;\n } else {\n details.column++;\n }\n\n p++;\n }\n\n peg$posDetailsCache[pos] = details;\n return details;\n }\n }\n\n function peg$computeLocation(startPos, endPos) {\n var startPosDetails = peg$computePosDetails(startPos),\n endPosDetails = peg$computePosDetails(endPos);\n\n return {\n start: {\n offset: startPos,\n line: startPosDetails.line,\n column: startPosDetails.column\n },\n end: {\n offset: endPos,\n line: endPosDetails.line,\n column: endPosDetails.column\n }\n };\n }\n\n function peg$fail(expected) {\n if (peg$currPos < peg$maxFailPos) { return; }\n\n if (peg$currPos > peg$maxFailPos) {\n peg$maxFailPos = peg$currPos;\n peg$maxFailExpected = [];\n }\n\n peg$maxFailExpected.push(expected);\n }\n\n function peg$buildSimpleError(message, location) {\n return new peg$SyntaxError(message, null, null, location);\n }\n\n function peg$buildStructuredError(expected, found, location) {\n return new peg$SyntaxError(\n peg$SyntaxError.buildMessage(expected, found),\n expected,\n found,\n location\n );\n }\n\n function peg$parsedeclaration() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13;\n\n s0 = peg$currPos;\n s1 = peg$parse_();\n if (s1 !== peg$FAILED) {\n s2 = peg$parsedeclareType();\n if (s2 !== peg$FAILED) {\n s3 = peg$parse_();\n if (s3 !== peg$FAILED) {\n s4 = peg$parsedeclareName();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse_();\n if (s5 !== peg$FAILED) {\n s6 = peg$parsecomment();\n if (s6 !== peg$FAILED) {\n s7 = peg$parse_();\n if (s7 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 40) {\n s8 = peg$c0;\n peg$currPos++;\n } else {\n s8 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c1); }\n }\n if (s8 !== peg$FAILED) {\n s9 = peg$parse_();\n if (s9 !== peg$FAILED) {\n s10 = peg$parsefieldList();\n if (s10 !== peg$FAILED) {\n s11 = peg$parse_();\n if (s11 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 41) {\n s12 = peg$c2;\n peg$currPos++;\n } else {\n s12 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c3); }\n }\n if (s12 !== peg$FAILED) {\n s13 = peg$parse_();\n if (s13 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c4(s2, s4, s6, s10);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parsedeclareType() {\n var s0;\n\n if (input.substr(peg$currPos, 6) === peg$c5) {\n s0 = peg$c5;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c6); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c7) {\n s0 = peg$c7;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c8); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 5) === peg$c9) {\n s0 = peg$c9;\n peg$currPos += 5;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c10); }\n }\n }\n }\n\n return s0;\n }\n\n function peg$parsedeclareName() {\n var s0, s1, s2, s3;\n\n s0 = peg$parsename();\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsename();\n if (s1 !== peg$FAILED) {\n s2 = peg$parseindexType();\n if (s2 !== peg$FAILED) {\n s1 = [s1, s2];\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsename();\n if (s1 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c11) {\n s2 = peg$c11;\n peg$currPos += 4;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c12); }\n }\n if (s2 !== peg$FAILED) {\n s1 = [s1, s2];\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsename();\n if (s1 !== peg$FAILED) {\n s2 = peg$parseindexType();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c11) {\n s3 = peg$c11;\n peg$currPos += 4;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c12); }\n }\n if (s3 !== peg$FAILED) {\n s1 = [s1, s2, s3];\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n }\n }\n }\n\n return s0;\n }\n\n function peg$parseindexType() {\n var s0;\n\n if (input.substr(peg$currPos, 7) === peg$c13) {\n s0 = peg$c13;\n peg$currPos += 7;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c14); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 5) === peg$c15) {\n s0 = peg$c15;\n peg$currPos += 5;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c16); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c17) {\n s0 = peg$c17;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c18); }\n }\n }\n }\n\n return s0;\n }\n\n function peg$parsecomment() {\n var s0;\n\n s0 = peg$parsenonQuotedString();\n if (s0 === peg$FAILED) {\n s0 = peg$parse_();\n }\n\n return s0;\n }\n\n function peg$parsefieldList() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n s0 = peg$currPos;\n s1 = peg$parsefield();\n if (s1 !== peg$FAILED) {\n s2 = peg$parse_();\n if (s2 !== peg$FAILED) {\n s3 = [];\n s4 = peg$currPos;\n s5 = peg$parse_();\n if (s5 !== peg$FAILED) {\n s6 = peg$parsefield();\n if (s6 !== peg$FAILED) {\n peg$savedPos = s4;\n s5 = peg$c19(s1, s6);\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n while (s4 !== peg$FAILED) {\n s3.push(s4);\n s4 = peg$currPos;\n s5 = peg$parse_();\n if (s5 !== peg$FAILED) {\n s6 = peg$parsefield();\n if (s6 !== peg$FAILED) {\n peg$savedPos = s4;\n s5 = peg$c19(s1, s6);\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parse_();\n if (s4 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c20(s1, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parsecommentStart() {\n var s0;\n\n if (input.charCodeAt(peg$currPos) === 35) {\n s0 = peg$c21;\n peg$currPos++;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c22); }\n }\n\n return s0;\n }\n\n function peg$parseinternalComment() {\n var s0, s1, s2, s3, s4;\n\n s0 = peg$currPos;\n s1 = peg$parse_();\n if (s1 !== peg$FAILED) {\n s2 = peg$parsecommentStart();\n if (s2 !== peg$FAILED) {\n s3 = peg$parsenonQuotedString();\n if (s3 !== peg$FAILED) {\n s4 = peg$parse_();\n if (s4 !== peg$FAILED) {\n s1 = [s1, s2, s3, s4];\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parsefield() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13;\n\n s0 = peg$currPos;\n s1 = peg$parsefieldType();\n if (s1 !== peg$FAILED) {\n s2 = peg$parse_();\n if (s2 !== peg$FAILED) {\n s3 = peg$parsename();\n if (s3 !== peg$FAILED) {\n s4 = peg$parse_();\n if (s4 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 59) {\n s5 = peg$c23;\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n if (s5 !== peg$FAILED) {\n s6 = peg$parse_();\n if (s6 !== peg$FAILED) {\n s7 = peg$parsecomment();\n if (s7 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c25(s1, s3, s7);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsefieldType();\n if (s1 !== peg$FAILED) {\n s2 = peg$parse_();\n if (s2 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 91) {\n s3 = peg$c26;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c27); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parse_();\n if (s4 !== peg$FAILED) {\n s5 = peg$parsefieldSize();\n if (s5 !== peg$FAILED) {\n s6 = peg$parse_();\n if (s6 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 93) {\n s7 = peg$c28;\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c29); }\n }\n if (s7 !== peg$FAILED) {\n s8 = peg$parse_();\n if (s8 !== peg$FAILED) {\n s9 = peg$parsename();\n if (s9 !== peg$FAILED) {\n s10 = peg$parse_();\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 59) {\n s11 = peg$c23;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n if (s11 !== peg$FAILED) {\n s12 = peg$parse_();\n if (s12 !== peg$FAILED) {\n s13 = peg$parsecomment();\n if (s13 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c30(s1, s5, s9, s13);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsefieldType();\n if (s1 !== peg$FAILED) {\n s2 = peg$parse_();\n if (s2 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 40) {\n s3 = peg$c0;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c1); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parse_();\n if (s4 !== peg$FAILED) {\n s5 = peg$parsefieldValues();\n if (s5 !== peg$FAILED) {\n s6 = peg$parse_();\n if (s6 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 41) {\n s7 = peg$c2;\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c3); }\n }\n if (s7 !== peg$FAILED) {\n s8 = peg$parse_();\n if (s8 !== peg$FAILED) {\n s9 = peg$parsename();\n if (s9 !== peg$FAILED) {\n s10 = peg$parse_();\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 59) {\n s11 = peg$c23;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n if (s11 !== peg$FAILED) {\n s12 = peg$parse_();\n if (s12 !== peg$FAILED) {\n s13 = peg$parsecomment();\n if (s13 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c31(s1, s5, s9, s13);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n if (s0 === peg$FAILED) {\n s0 = peg$parseinternalComment();\n }\n }\n }\n\n return s0;\n }\n\n function peg$parsefieldValues() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n s0 = peg$currPos;\n s1 = peg$parsename();\n if (s1 !== peg$FAILED) {\n s2 = [];\n s3 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 44) {\n s4 = peg$c32;\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c33); }\n }\n if (s4 !== peg$FAILED) {\n s5 = peg$parse_();\n if (s5 !== peg$FAILED) {\n s6 = peg$parsename();\n if (s6 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c19(s1, s6);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 44) {\n s4 = peg$c32;\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c33); }\n }\n if (s4 !== peg$FAILED) {\n s5 = peg$parse_();\n if (s5 !== peg$FAILED) {\n s6 = peg$parsename();\n if (s6 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c19(s1, s6);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n }\n if (s2 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c34(s1, s2);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parsefieldType() {\n var s0, s1, s2, s3;\n\n if (input.substr(peg$currPos, 3) === peg$c35) {\n s0 = peg$c35;\n peg$currPos += 3;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c36); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c37) {\n s0 = peg$c37;\n peg$currPos += 4;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c38); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 5) === peg$c39) {\n s0 = peg$c39;\n peg$currPos += 5;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c40); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c41) {\n s0 = peg$c41;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c42); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c43) {\n s0 = peg$c43;\n peg$currPos += 4;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c44); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 5) === peg$c45) {\n s0 = peg$c45;\n peg$currPos += 5;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c46); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 5) === peg$c47) {\n s0 = peg$c47;\n peg$currPos += 5;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c48); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c49) {\n s0 = peg$c49;\n peg$currPos += 4;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c50); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c51) {\n s0 = peg$c51;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c52); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 7) === peg$c53) {\n s0 = peg$c53;\n peg$currPos += 7;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c54); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c55) {\n s0 = peg$c55;\n peg$currPos += 4;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c56); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c57) {\n s0 = peg$c57;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c58); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 6) === peg$c59) {\n s0 = peg$c59;\n peg$currPos += 6;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c60); }\n }\n if (s0 === peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c61) {\n s0 = peg$c61;\n peg$currPos += 3;\n } else {\n s0 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c62); }\n }\n if (s0 === peg$FAILED) {\n s0 = peg$currPos;\n s1 = peg$parsedeclareType();\n if (s1 !== peg$FAILED) {\n s2 = peg$parse_();\n if (s2 !== peg$FAILED) {\n s3 = peg$parsedeclareName();\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c63(s1, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n\n return s0;\n }\n\n function peg$parsefieldSize() {\n var s0;\n\n s0 = peg$parsenumber();\n if (s0 === peg$FAILED) {\n s0 = peg$parsename();\n }\n\n return s0;\n }\n\n function peg$parsename() {\n var s0, s1, s2, s3, s4;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n if (peg$c64.test(input.charAt(peg$currPos))) {\n s2 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c65); }\n }\n if (s2 !== peg$FAILED) {\n s3 = [];\n if (peg$c66.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c67); }\n }\n while (s4 !== peg$FAILED) {\n s3.push(s4);\n if (peg$c66.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c67); }\n }\n }\n if (s3 !== peg$FAILED) {\n s2 = [s2, s3];\n s1 = s2;\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c68(s1);\n }\n s0 = s1;\n\n return s0;\n }\n\n function peg$parsequotedString() {\n var s0, s1, s2, s3;\n\n s0 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 34) {\n s1 = peg$c69;\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c70); }\n }\n if (s1 !== peg$FAILED) {\n s2 = [];\n if (peg$c71.test(input.charAt(peg$currPos))) {\n s3 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c72); }\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n if (peg$c71.test(input.charAt(peg$currPos))) {\n s3 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c72); }\n }\n }\n if (s2 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 34) {\n s3 = peg$c69;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c70); }\n }\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c73(s2);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parsenonQuotedString() {\n var s0, s1, s2;\n\n s0 = peg$currPos;\n s1 = [];\n if (peg$c74.test(input.charAt(peg$currPos))) {\n s2 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c75); }\n }\n while (s2 !== peg$FAILED) {\n s1.push(s2);\n if (peg$c74.test(input.charAt(peg$currPos))) {\n s2 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c75); }\n }\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c76(s1);\n }\n s0 = s1;\n\n return s0;\n }\n\n function peg$parsenumber() {\n var s0, s1, s2, s3;\n\n peg$silentFails++;\n s0 = peg$currPos;\n s1 = peg$parse_();\n if (s1 !== peg$FAILED) {\n s2 = [];\n if (peg$c78.test(input.charAt(peg$currPos))) {\n s3 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c79); }\n }\n if (s3 !== peg$FAILED) {\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n if (peg$c78.test(input.charAt(peg$currPos))) {\n s3 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c79); }\n }\n }\n } else {\n s2 = peg$FAILED;\n }\n if (s2 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c80();\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n peg$silentFails--;\n if (s0 === peg$FAILED) {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c77); }\n }\n\n return s0;\n }\n\n function peg$parse_() {\n var s0, s1;\n\n peg$silentFails++;\n s0 = [];\n if (peg$c82.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c83); }\n }\n while (s1 !== peg$FAILED) {\n s0.push(s1);\n if (peg$c82.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c83); }\n }\n }\n peg$silentFails--;\n if (s0 === peg$FAILED) {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c81); }\n }\n\n return s0;\n }\n\n peg$result = peg$startRuleFunction();\n\n if (peg$result !== peg$FAILED && peg$currPos === input.length) {\n return peg$result;\n } else {\n if (peg$result !== peg$FAILED && peg$currPos < input.length) {\n peg$fail(peg$endExpectation());\n }\n\n throw peg$buildStructuredError(\n peg$maxFailExpected,\n peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,\n peg$maxFailPos < input.length\n ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)\n : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)\n );\n }\n}\n\nmodule.exports = {\n SyntaxError: peg$SyntaxError,\n parse: peg$parse\n};\n","export const bigChain = `table bigChain\n\"bigChain pairwise alignment\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string name; \"Name or ID of item, ideally both human readable and unique\"\n uint score; \"Score (0-1000)\"\n char[1] strand; \"+ or - for strand\"\n uint tSize; \"size of target sequence\"\n string qName; \"name of query sequence\"\n uint qSize; \"size of query sequence\"\n uint qStart; \"start of alignment on query sequence\"\n uint qEnd; \"end of alignment on query sequence\"\n uint chainScore; \"score from chain\"\n )`\n\nexport const bigGenePred = `table bigGenePred\n\"bigGenePred gene models\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string name; \"Name or ID of item, ideally both human readable and unique\"\n uint score; \"Score (0-1000)\"\n char[1] strand; \"+ or - for strand\"\n uint thickStart; \"Start of where display should be thick (start codon)\"\n uint thickEnd; \"End of where display should be thick (stop codon)\"\n uint reserved; \"RGB value (use R,G,B string in input file)\"\n int blockCount; \"Number of blocks\"\n int[blockCount] blockSizes; \"Comma separated list of block sizes\"\n int[blockCount] chromStarts; \"Start positions relative to chromStart\"\n string name2; \"Alternative/human readable name\"\n string cdsStartStat; \"Status of CDS start annotation (none, unknown, incomplete, or complete)\"\n string cdsEndStat; \"Status of CDS end annotation (none, unknown, incomplete, or complete)\"\n int[blockCount] exonFrames; \"Exon frame {0,1,2}, or -1 if no frame for exon\"\n string type; \"Transcript type\"\n string geneName; \"Primary identifier for gene\"\n string geneName2; \"Alternative/human readable gene name\"\n string geneType; \"Gene type\"\n )`\n\nexport const bigInteract = `table interact\n\"interaction between two regions\"\n (\n string chrom; \"Chromosome (or contig, scaffold, etc.). For interchromosomal, use 2 records\"\n uint chromStart; \"Start position of lower region. For interchromosomal, set to chromStart of this region\"\n uint chromEnd; \"End position of upper region. For interchromosomal, set to chromEnd of this region\"\n string name; \"Name of item, for display. Usually 'sourceName/targetName/exp' or empty\"\n uint score; \"Score (0-1000)\"\n double value; \"Strength of interaction or other data value. Typically basis for score\"\n string exp; \"Experiment name (metadata for filtering). Use . if not applicable\"\n string color; \"Item color. Specified as r,g,b or hexadecimal #RRGGBB or html color name, as in //www.w3.org/TR/css3-color/#html4. Use 0 and spectrum setting to shade by score\"\n string sourceChrom; \"Chromosome of source region (directional) or lower region. For non-directional interchromosomal, chrom of this region.\"\n uint sourceStart; \"Start position in chromosome of source/lower/this region\"\n uint sourceEnd; \"End position in chromosome of source/lower/this region\"\n string sourceName; \"Identifier of source/lower/this region\"\n string sourceStrand; \"Orientation of source/lower/this region: + or -. Use . if not applicable\"\n string targetChrom; \"Chromosome of target region (directional) or upper region. For non-directional interchromosomal, chrom of other region\"\n uint targetStart; \"Start position in chromosome of target/upper/this region\"\n uint targetEnd; \"End position in chromosome of target/upper/this region\"\n string targetName; \"Identifier of target/upper/this region\"\n string targetStrand; \"Orientation of target/upper/this region: + or -. Use . if not applicable\"\n\n )`\n\nexport const bigLink = `table bigLink\n\"bigLink pairwise alignment\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string name; \"Name or ID of item, ideally both human readable and unique\"\n uint qStart; \"start of alignment on query sequence\"\n )`\n\nexport const bigMaf = `table bedMaf\n\"Bed3 with MAF block\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n lstring mafBlock; \"MAF block\"\n )`\nexport const bigNarrowPeak = `table bigNarrowPeak\n\"BED6+4 Peaks of signal enrichment based on pooled, normalized (interpreted) data.\"\n(\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string name;\t \"Name given to a region (preferably unique). Use . if no name is assigned\"\n uint score; \"Indicates how dark the peak will be displayed in the browser (0-1000) \"\n char[1] strand; \"+ or - or . for unknown\"\n float signalValue; \"Measurement of average enrichment for the region\"\n float pValue; \"Statistical significance of signal value (-log10). Set to -1 if not used.\"\n float qValue; \"Statistical significance with multiple-test correction applied (FDR -log10). Set to -1 if not used.\"\n int peak; \"Point-source called for this peak; 0-based offset from chromStart. Set to -1 if no point-source called.\"\n)`\nexport const bigPsl = `table bigPsl\n\"bigPsl pairwise alignment\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string name; \"Name or ID of item, ideally both human readable and unique\"\n uint score; \"Score (0-1000)\"\n char[1] strand; \"+ or - indicates whether the query aligns to the + or - strand on the reference\"\n uint thickStart; \"Start of where display should be thick (start codon)\"\n uint thickEnd; \"End of where display should be thick (stop codon)\"\n uint reserved; \"RGB value (use R,G,B string in input file)\"\n int blockCount; \"Number of blocks\"\n int[blockCount] blockSizes; \"Comma separated list of block sizes\"\n int[blockCount] chromStarts; \"Start positions relative to chromStart\"\n\n uint oChromStart;\"Start position in other chromosome\"\n uint oChromEnd; \"End position in other chromosome\"\n char[1] oStrand; \"+ or -, - means that psl was reversed into BED-compatible coordinates\"\n uint oChromSize; \"Size of other chromosome.\"\n int[blockCount] oChromStarts; \"Start positions relative to oChromStart or from oChromStart+oChromSize depending on strand\"\n\n lstring oSequence; \"Sequence on other chrom (or empty)\"\n string oCDS; \"CDS in NCBI format\"\n\n uint chromSize;\"Size of target chromosome\"\n\n uint match; \"Number of bases matched.\"\n uint misMatch; \" Number of bases that don't match \"\n uint repMatch; \" Number of bases that match but are part of repeats \"\n uint nCount; \" Number of 'N' bases \"\n uint seqType; \"0=empty, 1=nucleotide, 2=amino_acid\"\n )`\n\nexport const defaultBedSchema = `table defaultBedSchema\n\"BED12\"\n (\n string chrom; \"The name of the chromosome (e.g. chr3, chrY, chr2_random) or scaffold (e.g. scaffold10671).\"\n uint chromStart; \"The starting position of the feature in the chromosome or scaffold. The first base in a chromosome is numbered 0.\"\n uint chromEnd; \"The ending position of the feature in the chromosome or scaffold. The chromEnd base is not included in the display of the feature. For example, the first 100 bases of a chromosome are defined as chromStart=0, chromEnd=100, and span the bases numbered 0-99.\"\n string name; \"Defines the name of the BED line.\"\n float score; \"Feature score, doesn't care about the 0-1000 limit as in bed\"\n char strand; \"Defines the strand. Either '.' (=no strand) or '+' or '-'\"\n uint thickStart; \"The starting position at which the feature is drawn thickly (for example, the start codon in gene displays). When there is no thick part, thickStart and thickEnd are usually set to the chromStart position.\"\n uint thickEnd; \"The ending position at which the feature is drawn thickly (for example the stop codon in gene displays).\"\n string itemRgb; \"An RGB value of the form R,G,B (e.g. 255,0,0). \"\n uint blockCount; \" The number of blocks (exons) in the BED line.\"\n uint[blockCount] blockSizes; \" A comma-separated list of the block sizes. The number of items in this list should correspond to blockCount.\"\n uint[blockCount] blockStarts; \"A comma-separated list of block starts. All of the blockStart positions should be calculated relative to chromStart. The number of items in this list should correspond to blockCount.\"\n )`\n\nexport const mafFrames = `table mafFrames\n\"codon frame assignment for MAF components\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start range in chromosome\"\n uint chromEnd; \"End range in chromosome\"\n string src; \"Name of sequence source in MAF\"\n ubyte frame; \"frame (0,1,2) for first base(+) or last bast(-)\"\n char[1] strand; \"+ or -\"\n string name; \"Name of gene used to define frame\"\n int prevFramePos; \"target position of the previous base (in transcription direction) that continues this frame, or -1 if none, or frame not contiguous\"\n int nextFramePos; \"target position of the next base (in transcription direction) that continues this frame, or -1 if none, or frame not contiguous\"\n ubyte isExonStart; \"does this start the CDS portion of an exon?\"\n ubyte isExonEnd; \"does this end the CDS portion of an exon?\"\n )`\n\nexport const mafSummary = `table mafSummary\n\"Positions and scores for alignment blocks\"\n (\n string chrom; \"Reference sequence chromosome or scaffold\"\n uint chromStart; \"Start position in chromosome\"\n uint chromEnd; \"End position in chromosome\"\n string src; \"Sequence name or database of alignment\"\n float score; \"Floating point score.\"\n char[1] leftStatus; \"Gap/break annotation for preceding block\"\n char[1] rightStatus; \"Gap/break annotation for following block\"\n )`\n","import { parse } from './autoSql'\nimport { AutoSqlPreSchema } from './util'\nimport * as types from './as/autoSqlSchemas'\n\nexport default Object.fromEntries(\n Object.entries(types).map(([key, val]) => [\n key,\n parse(val.trim()) as AutoSqlPreSchema,\n ]),\n)\n","export interface AutoSqlPreSchema {\n fields: { size: number; type: string; name: string; comment: string }[]\n}\n\n/*\n * adds some type annotations to the autoSql schema\n * for numeric fields ['uint', 'int', 'float', 'long'] \"isNumeric\" is added\n * for array types \"isArray\" is added\n * for numeric array types \"isArray\" and \"arrayIsNumeric\" is set\n *\n * @param autoSql - an autoSql schema from the peg parser\n * @return autoSql with type annotations added\n */\nexport function detectTypes(autoSql: AutoSqlPreSchema) {\n const numericTypes = new Set(['uint', 'int', 'float', 'long'])\n return {\n ...autoSql,\n fields: autoSql.fields\n .map(autoField => ({\n ...autoField,\n isArray: autoField.size && autoField.type !== 'char',\n arrayIsNumeric: autoField.size && numericTypes.has(autoField.type),\n isNumeric: !autoField.size && numericTypes.has(autoField.type),\n }))\n\n // this is needed because the autoSql doesn't properly parse comments in the autoSql\n .filter(f => !!f.name),\n }\n}\n\nexport type AutoSqlSchema = ReturnType<typeof detectTypes>\n","import parser from './autoSql'\nimport types from './defaultTypes'\nimport { detectTypes, AutoSqlSchema, AutoSqlPreSchema } from './util'\n\nconst strandMap = { '.': 0, '-': -1, '+': 1 }\n\n// heuristic that a BED file is BED12 like...the number in col 10 is blockCount-like\nfunction isBed12Like(fields: string[]) {\n return (\n fields.length >= 12 &&\n !Number.isNaN(parseInt(fields[9], 10)) &&\n fields[10]?.split(',').filter(f => !!f).length === parseInt(fields[9], 10)\n )\n}\nexport default class BED {\n public autoSql: AutoSqlSchema\n\n private attemptDefaultBed?: boolean\n\n constructor(args: { autoSql?: string; type?: string } = {}) {\n if (args.autoSql) {\n this.autoSql = detectTypes(parser.parse(args.autoSql) as AutoSqlPreSchema)\n } else if (args.type) {\n if (!types[args.type]) {\n throw new Error('Type not found')\n }\n this.autoSql = detectTypes(types[args.type])\n } else {\n this.autoSql = detectTypes(types.defaultBedSchema)\n this.attemptDefaultBed = true\n }\n }\n\n /*\n * parses a line of text as a BED line with the loaded autoSql schema\n *\n * @param line - a BED line as tab delimited text or array\n * @param opts - supply opts.uniqueId\n * @return a object representing a feature\n */\n parseLine(line: string | string[], opts: { uniqueId?: string } = {}) {\n const { autoSql } = this\n const { uniqueId } = opts\n const fields = Array.isArray(line) ? line : line.split('\\t')\n\n let feature = {} as Record<string, any>\n if (\n !this.attemptDefaultBed ||\n (this.attemptDefaultBed && isBed12Like(fields))\n ) {\n for (let i = 0; i < autoSql.fields.length; i++) {\n const autoField = autoSql.fields[i]\n let columnVal: any = fields[i]\n const { isNumeric, isArray, arrayIsNumeric, name } = autoField\n if (columnVal === null || columnVal === undefined) {\n break\n }\n if (columnVal !== '.') {\n if (isNumeric) {\n const num = Number(columnVal)\n columnVal = Number.isNaN(num) ? columnVal : num\n } else if (isArray) {\n columnVal = columnVal.split(',')\n if (columnVal[columnVal.length - 1] === '') {\n columnVal.pop()\n }\n if (arrayIsNumeric) {\n columnVal = columnVal.map(Number)\n }\n }\n\n feature[name] = columnVal\n }\n }\n } else {\n const fieldNames = ['chrom', 'chromStart', 'chromEnd', 'name']\n feature = Object.fromEntries(\n fields.map((f, i) => [fieldNames[i] || 'field' + i, f]),\n )\n feature.chromStart = +feature.chromStart\n feature.chromEnd = +feature.chromEnd\n if (!Number.isNaN(Number.parseFloat(feature.field4))) {\n feature.score = +feature.field4\n delete feature.field4\n }\n if (feature.field5 === '+' || feature.field5 === '-') {\n feature.strand = feature.field5\n delete feature.field5\n }\n }\n if (uniqueId) {\n feature.uniqueId = uniqueId\n }\n feature.strand = strandMap[feature.strand as keyof typeof strandMap] || 0\n\n feature.chrom = decodeURIComponent(feature.chrom)\n return feature\n }\n}\n"],"names":["peg$SyntaxError","message","expected","found","location","this","name","Error","captureStackTrace","child","parent","ctor","constructor","prototype","peg$subclass","buildMessage","DESCRIBE_EXPECTATION_FNS","literal","expectation","literalEscape","text","i","escapedParts","parts","length","Array","classEscape","inverted","any","end","other","description","hex","ch","charCodeAt","toString","toUpperCase","s","replace","j","descriptions","type","sort","slice","join","describeExpected","describeFound","module","exports","SyntaxError","parse","input","options","peg$result","peg$FAILED","peg$startRuleFunctions","declaration","peg$parsedeclaration","peg$startRuleFunction","peg$c0","peg$c1","peg$literalExpectation","peg$c2","peg$c3","peg$c4","comment","fields","peg$c5","peg$c6","peg$c7","peg$c8","peg$c9","peg$c10","peg$c11","peg$c12","peg$c13","peg$c14","peg$c15","peg$c16","peg$c17","peg$c18","peg$c19","f1","w","peg$c20","fds","unshift","peg$c21","peg$c22","peg$c23","peg$c24","peg$c25","peg$c26","peg$c27","peg$c28","peg$c29","peg$c30","size","peg$c31","vals","peg$c32","peg$c33","peg$c34","peg$c35","peg$c36","peg$c37","peg$c38","peg$c39","peg$c40","peg$c41","peg$c42","peg$c43","peg$c44","peg$c45","peg$c46","peg$c47","peg$c48","peg$c49","peg$c50","peg$c51","peg$c52","peg$c53","peg$c54","peg$c55","peg$c56","peg$c57","peg$c58","peg$c59","peg$c60","peg$c61","peg$c62","peg$c63","t","n","peg$c64","peg$c65","peg$classExpectation","peg$c66","peg$c67","peg$c68","peg$c74","peg$c75","peg$c76","peg$c77","peg$otherExpectation","peg$c78","peg$c79","peg$c80","parseInt","peg$c81","peg$c82","peg$c83","peg$currPos","peg$savedPos","peg$posDetailsCache","line","column","peg$maxFailPos","peg$maxFailExpected","peg$silentFails","startRule","substring","ignoreCase","peg$computePosDetails","pos","p","details","peg$computeLocation","startPos","endPos","startPosDetails","endPosDetails","start","offset","peg$fail","push","s0","s2","s4","s6","s8","s10","s12","peg$parse_","peg$parsedeclareType","peg$parsedeclareName","peg$parsecomment","s1","s3","peg$parsefield","peg$parsefieldList","substr","peg$parsename","peg$parseindexType","peg$parsenonQuotedString","s5","s7","s9","s11","s13","peg$parsefieldType","test","charAt","peg$parsenumber","peg$parsefieldSize","peg$parsefieldValues","peg$parsecommentStart","peg$parseinternalComment","bigChain","bigGenePred","bigInteract","bigLink","bigMaf","bigNarrowPeak","bigPsl","defaultBedSchema","mafFrames","mafSummary","Object","fromEntries","entries","map","key","val","trim","detectTypes","autoSql","numericTypes","Set","autoField","isArray","arrayIsNumeric","has","isNumeric","filter","f","strandMap","BED","args","attemptDefaultBed","parseLine","opts","uniqueId","split","feature","Number","isNaN","isBed12Like","columnVal","num","pop","fieldNames","chromStart","chromEnd","parseFloat","field4","score","field5","strand","chrom","decodeURIComponent"],"sourceRoot":""}