{"version":3,"sources":["jsdelivr-header.js","/npm/biwascheme@0.8.3/release/biwascheme.mjs"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,ACGA,MAAM,OAAS,CAAC,EACV,QAAU,CAAC,EAMX,IAAM,CACV,SAAU,WACR,MAAO,KACT,EACA,SAAU,WACR,MAAO,IACT,EACA,SAAU,WACR,MAAO,EACT,EACA,OAAQ,WACN,OAAO,CACT,GAOI,MAAQ,IAAI,OAClB,MAAM,SAAW,WACf,MAAO,UACT,EAQA,MAAM,eAAiB,GAGjB,8BAA+B,EAG/B,QAAU,QACV,UAAY,2CAKlB,IAAI,UAAY,EAChB,SAAS,SAAS,GAChB,IAAI,IAAO,UAAY,GACvB,OAAO,EAAS,EAAS,EAAK,CAChC,CAGA,MAAM,UAAY,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,UAGP,SAAS,OAAO,GACd,OAAO,OAAO,QAAQ,WAAW,QAC/B,CAAC,GAAS,EAAQ,KAAS,EAAO,WAAW,EAAQ,IACrD,EAEJ,CAMA,MAAM,QAAU,CAAC,EAEjB,MAAM,WACJ,WAAA,CAAY,GACV,KAAK,KAAO,EACZ,QAAQ,GAAO,IACjB,CAEA,OAAA,GACE,MAAO,IAAM,KAAK,IAEpB,CAEA,QAAA,GACE,MAAO,IAAM,KAAK,IACpB,CAEA,QAAA,GACE,OAAO,KAAK,IACd,EAGF,MAAM,IAAM,SAAU,EAAM,GAC1B,YAAsB,IAAlB,QAAQ,GACH,IAAI,WAAW,GACX,QAAQ,aAAiB,WAI7B,QAAQ,GAFR,IAAI,WAAW,EAI1B,EAEM,OAAS,SAAU,EAAS,YAChC,OAAO,IAAI,SAAS,GACtB,EAKA,MAAM,MAEJ,WAAA,CAAY,GACV,KAAK,SAAW,CAClB,CAGA,SAAA,CAAU,EAAM,EAAG,EAAG,EAAG,GACvB,KAAK,YAAc,EACnB,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,CACX,CAGA,KAAA,GACE,KAAK,SAAS,KAChB,CAGA,MAAA,CAAO,GACL,OAAO,KAAK,YAAY,QAAO,EAAM,EAAO,KAAK,EAAG,KAAK,EAAG,KAAK,EAAG,KAAK,EAC3E,EAQF,MAAM,IAAM,IAAI,OAEhB,IAAI,SAAW,WACb,MAAO,QACT,EAEA,MAAM,KACJ,WAAA,CAAY,EAAO,GACjB,KAAK,SAAU,EACf,KAAK,WAAY,EACjB,KAAK,SAAW,EAChB,KAAK,UAAY,CACnB,CAEA,KAAA,GAEE,KAAK,SAAU,CACjB,CAEA,OAAA,GACE,MAAO,SACT,CAEA,QAAA,GACE,MAAO,SACT,EAMF,KAAK,aAAe,cAAc,KAChC,WAAA,GACE,OAAM,GAAO,GACb,KAAK,OAAS,EAChB,CAEA,UAAA,CAAW,GACT,KAAK,OAAO,KAAK,EACnB,CAEA,aAAA,CAAc,GACZ,OAAO,KAAK,OAAO,KAAK,GAC1B,GAGF,KAAK,YAAc,cAAc,KAC/B,WAAA,CAAY,GACV,OAAM,GAAM,GACZ,KAAK,IAAM,CACb,CAEA,UAAA,CAAW,GACT,OAAO,EAAM,KAAK,IACpB,GAGF,KAAK,UAAY,cAAc,KAC7B,WAAA,GACE,OAAM,GAAM,EACd,CAEA,UAAA,CAAW,GAET,OAAO,EAAM,GACf,GAGF,KAAK,WAAa,cAAc,KAC9B,WAAA,CAAY,GACV,OAAM,GAAO,GACb,KAAK,gBAAkB,CACzB,CAEA,UAAA,CAAW,GAAM,GAGnB,KAAK,aAAe,cAAc,KAChC,WAAA,CAAY,GACV,OAAM,GAAO,GACb,KAAK,gBAAkB,CACzB,CAEA,UAAA,CAAW,GACT,KAAK,gBAAgB,EACvB,GAGF,KAAK,YAAc,cAAc,KAC/B,WAAA,CAAY,GACV,OAAM,GAAM,GACZ,KAAK,eAAiB,CACxB,CAEA,UAAA,CAAW,GACT,IAAI,EAAiB,KAAK,eAC1B,OAAO,IAAI,OAAM,SAAU,GACzB,GAAe,SAAU,GACvB,EAAM,OAAO,EAAM,GACrB,GACF,GACF,GAIF,KAAK,cAAgB,IAAI,KAAK,UAC9B,KAAK,eAAiB,IAAI,KAAK,WAC/B,KAAK,cAAgB,IAAI,KAAK,WAG9B,MAAM,QAKJ,WAAA,CAAY,EAAM,EAAU,EAAQ,GAClC,KAAK,KAAO,EACZ,KAAK,SAAW,EAChB,KAAK,OAAS,EACd,KAAK,cAAgB,CACvB,CAEA,QAAA,GACE,MAAO,YACT,EAGF,MAAM,UAAY,SAAU,GAC1B,OAAO,aAAe,OACxB,EAWM,MAAQ,SAAU,GACtB,OAAO,IAAQ,GACjB,EAEM,QAAU,SAAU,GACxB,OAAO,IAAQ,KACjB,EAEM,UAAa,GAAmB,kBAAN,EAI1B,SAAY,GAAmB,iBAAN,EAEzB,WAAc,GAAmB,mBAAN,EAE3B,SAAW,SAAU,GACzB,OAAO,aAAe,UACxB,EAEM,OAAS,SAAU,GACvB,OAAO,aAAe,IACxB,EAEM,SAAW,SAAU,GACzB,OAAO,aAAe,KACxB,EAIM,YAAc,SAAU,GAC5B,OAAO,UAAU,IAAuB,mBAAR,CAClC,EAMM,GAAK,SAAU,EAAG,GACtB,cAAW,UAAa,EACf,iBAAiB,SAAU,GAE7B,EAAI,CACb,EAMA,MAAM,kBAAkB,MACtB,WAAA,CAAY,EAAK,EAAO,MAGtB,MADgB,GAAG,IADG,OAAT,EAAgB,GAAK,KAAK,SAAS,QAGhD,KAAK,KAAO,CACd,CAEA,QAAA,GACE,OAAO,KAAK,OACd,EAGF,MAAM,YAAY,UAChB,WAAA,CAAY,GACV,MAAM,SAAW,EACnB,EAIF,MAAM,kBAAkB,UACtB,WAAA,CAAY,GACV,MAAM,GACN,KAAK,QAAU,CACjB,EAOF,MAAM,QACJ,WAAA,GAEE,IAAI,EACJ,IAFA,KAAK,IAAM,GAEN,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,KAAK,IAAI,GAAK,UAAU,EACjE,CAEA,MAAA,CAAO,GACL,GAAI,KAAK,IAAI,QAAU,EAAM,IAAI,OAAQ,OAAO,EAEhD,IAAI,EAAK,IAAI,KAAK,KACd,EAAK,IAAI,EAAM,KACnB,EAAG,OACH,EAAG,OACH,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IACnC,GAAI,EAAG,IAAM,EAAG,GAAI,OAAO,EAE7B,OAAO,CACT,CAEA,QAAA,CAAS,GACP,IAAI,EAAI,IAAI,QAAQ,GAGpB,OAFA,EAAE,IAAM,IAAI,KAAK,KACjB,EAAE,IAAI,KAAK,GACJ,CACT,CAEA,SAAA,GACE,IAAI,EAAI,IAAI,QACZ,EAAE,IAAM,IAAI,KAAK,KAEjB,IAAK,IAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CACzC,IAAI,EAAK,UAAU,GACnB,KAAM,aAAc,SAClB,MAAM,IAAI,UAAU,sCAEtB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAI,OAAQ,IAAK,EAAE,IAAI,EAAG,IAAI,GACvD,CACA,OAAO,CACT,CAEA,aAAA,CAAc,GACZ,KAAM,aAAc,SAClB,MAAM,IAAI,UAAU,0CAGtB,IADA,IAAI,EAAI,IAAI,QACH,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IAC/B,EAAG,OAAO,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,IAC7C,OAAO,CACT,CAEA,SAAA,CAAU,GACR,KAAM,aAAc,SAClB,MAAM,IAAI,UAAU,sCAGtB,IADA,IAAI,EAAI,IAAI,QACH,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IAC9B,EAAG,OAAO,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,IAC9C,OAAO,CACT,CAEA,GAAA,CAAI,GACG,KAAK,OAAO,IACf,KAAK,IAAI,KAAK,EAElB,CAEA,MAAA,CAAO,GACL,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IACnC,GAAI,KAAK,IAAI,IAAM,EAAM,OAAO,EAElC,OAAO,CACT,CAEA,MAAA,CAAO,GACL,IAAK,IAAI,EAAI,KAAK,IAAI,OAAS,EAAG,GAAK,EAAG,IACxC,GAAI,KAAK,IAAI,IAAM,EAAM,OAAO,KAAK,IAAI,OAAS,EAAI,EAExD,OAAO,IACT,CAEA,KAAA,CAAM,GACJ,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IAAK,GAAI,KAAK,IAAI,IAAM,EAAM,OAAO,EAE1E,OAAO,IACT,CAEA,OAAA,GACE,MAAO,OAAS,KAAK,IAAI,KAAK,MAAQ,GACxC,CAEA,QAAA,GACE,OAAO,KAAK,SACd,CAEA,IAAA,GACE,OAAO,KAAK,IAAI,MAClB,EAQF,MAAM,KACJ,WAAA,CAAY,EAAK,GACf,KAAK,IAAM,EACX,KAAK,IAAM,CACb,CAIA,IAAA,CAAK,GACH,OAAO,KAAK,KAAK,CAAC,MAAO,OAAQ,EACnC,CACA,IAAA,CAAK,GACH,OAAO,KAAK,KAAK,CAAC,MAAO,OAAQ,EACnC,CACA,IAAA,CAAK,GACH,OAAO,KAAK,KAAK,CAAC,MAAO,OAAQ,EACnC,CACA,IAAA,CAAK,GACH,OAAO,KAAK,KAAK,CAAC,MAAO,OAAQ,EACnC,CACA,IAAA,CAAK,EAAO,EAAM,cAChB,IAAI,EAAI,KACR,IAAK,MAAM,KAAK,EAAO,CACrB,IAAI,EAAE,eAAe,GAGnB,MAAM,EAFN,EAAI,EAAE,EAIV,CACA,OAAO,CACT,CAEA,KAAA,GACE,OAAO,KAAK,GACd,CACA,MAAA,GACE,OAAO,KAAK,IAAI,GAClB,CACA,KAAA,GACE,OAAO,KAAK,IAAI,IAAI,GACtB,CACA,MAAA,GACE,OAAO,KAAK,IAAI,IAAI,IAAI,GAC1B,CACA,KAAA,GACE,OAAO,KAAK,IAAI,IAAI,IAAI,IAAI,GAC9B,CAKA,QAAA,GAEE,IADA,IAAI,EAAM,GACD,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,IAC1C,EAAI,KAAK,EAAE,KAEb,OAAO,CACT,CAEA,MAAA,GAEE,IADA,IAAI,EAAI,EACC,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,IAC1C,IAEF,OAAO,CACT,CAGA,QAAA,GACE,IAAI,EACJ,IAAK,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,KACxC,OAAO,CACT,CAIA,OAAA,CAAQ,GACN,IAAK,IAAI,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,IAC1C,EAAK,EAAE,KAET,OAAO,CACT,CAGA,OAAA,CAAQ,GACN,IAAK,IAAI,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,IAC1C,EAAK,EAAE,KAET,OAAO,CACT,CAIA,eAAM,CAAU,GACd,IAAK,IAAI,EAAI,KAAM,aAAa,KAAM,EAAI,EAAE,UACpC,EAAK,EAAE,KAEf,OAAO,CACT,CAMA,GAAA,CAAI,GAEF,IADA,IAAI,EAAM,GACD,EAAI,KAAM,OAAO,GAAI,EAAI,EAAE,IAClC,EAAI,KAAK,EAAK,EAAE,MAElB,OAAO,CACT,CAGA,OAAA,CAAQ,GACN,OAAO,cAAc,KAAK,IAAI,GAChC,CAEA,cAAM,CAAS,GACb,MAAM,EAAM,GACZ,IAAK,IAAI,EAAI,KAAM,OAAO,GAAI,EAAI,EAAE,IAClC,EAAI,WAAW,EAAK,EAAE,MAExB,OAAO,cAAc,EACvB,CAKA,MAAA,CAAO,GAEL,IADA,IAAI,EAAI,KACD,aAAa,MAAQ,EAAE,KAAO,KACnC,EAAI,EAAE,IAGR,OADA,EAAE,IAAM,EACD,IACT,CAGA,OAAA,CAAQ,GACN,IAAS,EAAO,SAChB,IAAI,EAAI,GACJ,EAAO,KAAK,SAAQ,SAAU,GAChC,EAAE,KAAK,EAAK,GACd,IAKA,OAJI,GAAQ,MACV,EAAE,KAAK,KACP,EAAE,KAAK,EAAK,KAEP,IAAM,EAAE,KAAK,KAAO,GAC7B,CAEA,QAAA,GACE,OAAO,KAAK,SACd,CAEA,UAAA,CAAW,GACT,OAAO,KAAK,QAAQ,EACtB,CAEA,QAAA,GACE,OAAO,KAAK,QAAQ,SACtB,EAGF,MAAM,OAAS,SAAU,GACvB,OAAO,aAAe,IACxB,EAIM,OAAS,SAAU,GACvB,GAAI,IAAQ,IAEV,OAAO,EAET,KAAM,aAAe,MAEnB,OAAO,EAKT,IAFA,IAAI,EAAW,EACX,EAAO,EAAI,MACF,CACX,GAAI,IAAS,IAEX,OAAO,EAET,GAAI,IAAS,EAEX,OAAO,EAET,KAAM,aAAgB,MAEpB,OAAO,EAGT,GAAI,EAAK,MAAQ,IAEf,OAAO,EAET,KAAM,EAAK,eAAe,MAExB,OAAO,EAGT,EAAO,EAAK,IAAI,IAChB,EAAW,EAAS,GACtB,CACF,EAMM,eAAiB,SAAU,EAAK,GAEpC,IADA,IAAI,EAAO,IACF,EAAI,EAAI,OAAS,EAAG,GAAK,EAAG,IAAK,CACxC,IAAI,EAAM,EAAI,GACV,GAAQ,MAAM,QAAQ,KAAS,EAAI,YACrC,EAAM,eAAe,EAAK,IAE5B,EAAO,IAAI,KAAK,EAAK,EACvB,CACA,OAAO,CACT,EAKM,KAAO,WACX,IAAI,EAAM,MAAM,KAAK,WACrB,OAAO,eAAe,GAAK,EAC7B,EAMM,cAAgB,SAAU,GAC9B,OAAO,eAAe,GAAK,EAC7B,EAIM,mBAAqB,SAAU,GACnC,OAAO,eAAe,GAAK,EAC7B,EAEM,KAAO,SAAU,EAAK,GAC1B,OAAO,IAAI,KAAK,EAAK,EACvB,EAEM,gBAAkB,SAAU,GAChC,QAAY,IAAR,EACF,OAAO,IAET,IAAI,EAAM,GAKV,OAJA,OAAO,KAAK,GAAK,SAAQ,SAAU,GACjC,EAAI,KAAK,IAAI,KAAK,EAAK,EAAI,IAC7B,IACY,cAAc,EAE5B,EAEM,gBAAkB,SAAU,GAChC,GAAI,IAAU,IACZ,MAAO,CAAC,EAEV,IAAI,EAAM,CAAC,EAIX,OAHA,EAAM,SAAQ,SAAU,GACtB,EAAI,EAAK,KAAO,EAAK,GACvB,IACO,CACT,EAOM,SAAW,SAAU,EAAK,GAE9B,OAAO,EAAI,OAAS,EAAS,EAAI,MAAM,EAAG,GADtB,MAC8C,CACpE,EAMM,aAAe,SAAU,GAC7B,QAAY,IAAR,EAAmB,MAAO,YACzB,GAAY,OAAR,EAAc,MAAO,OACzB,GAAmB,mBAAR,EACd,MACE,eACC,EAAI,MACD,EAAI,MACJ,EAAI,SACJ,SAAS,EAAI,WAAY,IACzB,IACJ,IAEC,GAAmB,iBAAR,EACd,MACE,IACA,EACG,QAAQ,UAAU,SAAU,GAC3B,MAAO,KAAO,CAChB,IACC,QAAQ,QAAS,OACjB,QAAQ,QAAS,OACjB,QAAQ,MAAO,OACf,QAAQ,MAAO,OACf,QAAQ,MAAO,OACf,QAAQ,MAAO,OACf,QAAQ,MAAO,OAClB,IAEC,GAAI,MAAM,QAAQ,GACrB,MACE,KACA,EACG,KAAI,SAAU,GACb,OAAO,aAAa,EACtB,IACC,KAAK,KACR,IAEC,GAA2B,mBAAhB,EAAI,SAAwB,OAAO,EAAI,WAClD,GAAI,MAAM,IAAsB,iBAAP,EAAiB,MAAO,SAEpD,OAAQ,GACN,KAAK,EACH,MAAO,KACT,KAAK,EACH,MAAO,KACT,KAAK,IACH,MAAO,SACT,KAAM,IACJ,MAAO,SAGb,OAAO,QAAQ,EACjB,EAMM,WAAa,SAAU,GAC3B,YAAmB,IAAR,EAA4B,YACtB,OAAR,EAAqB,OACrB,EAAI,WAAmB,EAAI,WAAW,YACd,iBAAjB,EAAI,UAA8B,EACzC,aAAe,WAAmB,EAAI,KACtC,aAAe,MACf,KAAO,EAAI,IAAI,YAAY,KAAK,KAAO,IACpC,aAAa,EAC3B,EAMM,QAAU,SAAU,EAAQ,GAChC,IACE,QAAsB,IAAX,EAAwB,MAAO,YAC1C,GAAe,OAAX,EAAiB,MAAO,OAC5B,IAAe,IAAX,EAAiB,MAAO,KAC5B,IAAe,IAAX,EAAkB,MAAO,KAC7B,GAAI,EAAO,QAAS,OAAO,EAAO,UAClC,GAAsB,iBAAX,EACT,MAAO,IAAM,EAAO,QAAQ,KAAM,OAAS,IAE7C,GAAI,MAAM,QAAQ,GAChB,MAAO,IAAM,EAAO,IAAI,SAAS,KAAK,MAAQ,IAEhD,GAAI,aAAkB,IAAK,CACzB,IAAI,EAAI,QACR,IAAK,MAAO,EAAG,KAAM,EACnB,GAAK,IAAI,QAAQ,EAAG,OAAU,QAAQ,EAAG,KAE3C,OAAO,EAAI,GACb,CAEA,OAAI,GAAQ,EAAe,SAClB,EAAe,SAEf,EAAO,UAElB,CAAE,MAAO,GACP,GAAI,aAAa,WAAY,MAAO,MACpC,MAAM,CACR,CACF,EAOA,SAAS,MAAM,GACb,MAAM,EAAS,YAAY,GAC3B,OAAI,EAAO,OACF,cAAc,EAAK,GAEnB,aAAa,EAExB,CAEA,SAAS,YAAY,GACnB,MAAM,EAAQ,CACZ,KAAM,IAAI,IACV,YAAa,IAAI,IACjB,QAAS,IAAI,IACb,QAAQ,GAEV,oBAAoB,EAAK,GAGzB,MAAM,EAAM,IAAI,IAChB,IAAK,MAAM,KAAK,EAAM,YACpB,EAAI,IAAI,EAAG,MAOb,MALe,CACb,IAAK,EACL,SAAU,EACV,OAAQ,EAAM,OAGlB,CAEA,SAAS,oBAAoB,EAAK,GAC5B,EAAM,QAAQ,IAAI,KAEpB,EAAM,QAAS,GAEb,EAAM,YAAY,IAAI,KAEf,EAAM,KAAK,IAAI,GACxB,EAAM,YAAY,IAAI,IAIxB,EAAM,KAAK,IAAI,GACX,OAAO,IACT,EAAM,QAAQ,IAAI,GAClB,oBAAoB,EAAI,IAAK,GAC7B,oBAAoB,EAAI,IAAK,GAC7B,EAAM,QAAQ,OAAO,IACZ,SAAS,KAClB,EAAM,QAAQ,IAAI,GAClB,EAAI,SAAS,IACX,oBAAoB,EAAM,EAAM,IAElC,EAAM,QAAQ,OAAO,KAEzB,CAGA,SAAS,aAAa,GAEpB,OAAO,cAAc,EADN,YAAY,GAE7B,CAEA,SAAS,cAAc,EAAK,GAC1B,IAAI,EAAI,GACR,GAAI,EAAO,IAAI,IAAI,GAAM,CACvB,MAAM,EAAK,EAAO,IAAI,IAAI,GAC1B,GAAW,OAAP,EAQF,MAAO,IAAI,KARI,CAEf,MAAM,EAAS,EAAO,QAAU,EAChC,EAAO,IAAI,IAAI,EAAK,GACpB,EAAO,QAAU,EACjB,GAAK,IAAI,IACX,CAIF,CACA,GAAI,OAAO,GAAM,CACf,MAAM,EAAI,GAEV,EAAE,KAAK,cAAc,EAAI,IAAK,IAC9B,IAAK,IAAI,EAAI,EAAI,IAAK,IAAM,IAAK,EAAI,EAAE,IAAK,CAC1C,IAAK,OAAO,IAAM,EAAO,IAAI,IAAI,GAAI,CACnC,EAAE,KAAK,KACP,EAAE,KAAK,cAAc,EAAG,IACxB,KACF,CACA,EAAE,KAAK,cAAc,EAAE,IAAK,GAC9B,CACA,GAAK,IAAM,EAAE,KAAK,KAAO,GAC3B,MAAO,GAAI,SAAS,GAAM,CAExB,GAAK,KADK,EAAI,KAAK,GAAS,cAAc,EAAM,KAClC,KAAK,KAAO,GAC5B,MACE,GAAK,aAAa,GAEpB,OAAO,CACT,CAEA,MAAM,SAAW,MAKX,GAAK,SAAU,EAAG,GACtB,OAAO,IAAM,CACf,EAGM,IAAM,SAAU,EAAG,GACvB,OAAO,GAAK,UAAY,UAAY,CACtC,EAEM,MAAQ,SAAU,EAAG,GACzB,OAAO,SAAS,IAAM,SAAS,EACjC,EAMM,MAAQ,CAAC,EAEf,MAAM,KACJ,WAAA,CAAY,GACV,MAAO,KAAK,MAAQ,GAAM,IAC5B,CAEA,QAAA,GACE,OAAQ,KAAK,OACX,IAAK,KACH,MAAO,aACT,IAAK,IACH,MAAO,WACT,IAAK,KACH,MAAO,SACT,QACE,MAAO,MAAQ,KAAK,MAE1B,CAEA,UAAA,GACE,OAAO,KAAK,KACd,CAEA,OAAA,GACE,OAAO,KAAK,UACd,EAEF,KAAK,IAAM,SAAU,GACnB,GAAgB,iBAAL,EACT,MAAM,IAAI,IAAI,aAAe,QAAQ,GAAK,oBAE5C,YAAiB,IAAb,MAAM,GAAyB,IAAI,KAAK,GAChC,MAAM,EACpB,EAEA,MAAM,OAAS,SAAU,GACvB,OAAO,aAAe,IACxB,EAsBA,MAAM,KACJ,WAAA,CAAY,EAAM,EAAM,GACtB,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,MACH,GACA,SAAU,GAER,OAAO,EAAG,EACZ,CACJ,CAEA,OAAA,GACE,MAAO,eAAiB,KAAK,KAAK,UAAY,GAChD,CAEA,QAAA,GACE,MAAO,SACT,CAEA,QAAA,GACE,MAAO,SACT,EAMF,MAAM,SAAW,CACf,SAAU,MACR,WAAA,CAAY,GACV,KAAK,IAAM,EACX,KAAK,EAAI,CACX,CACA,QAAA,GACE,OAAO,KAAK,EAAI,KAAK,IAAI,MAC3B,CACA,IAAA,GACE,OAAO,KAAK,IAAI,KAAK,IACvB,GAGF,UAAW,MACT,WAAA,CAAY,GACV,KAAK,IAAM,EACX,KAAK,EAAI,CACX,CACA,QAAA,GACE,OAAO,KAAK,EAAI,KAAK,IAAI,MAC3B,CACA,IAAA,GACE,OAAO,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK,KACvC,GAGF,QAAS,MACP,WAAA,CAAY,GACV,KAAK,GAAK,CACZ,CACA,QAAA,GACE,OAAO,KAAK,cAAc,MAAQ,KAAK,IAAM,GAC/C,CACA,IAAA,GACE,IAAI,EAAO,KAAK,GAEhB,OADA,KAAK,GAAK,KAAK,GAAG,IACX,CACT,GAGF,SAAU,MACR,WAAA,CAAY,GACV,KAAK,KAAO,EACZ,KAAK,KAAO,EAAK,OACjB,KAAK,UAAY,EAAK,KAAI,SAAU,GAClC,OAAO,SAAS,GAAG,EACrB,GACF,CACA,QAAA,GACE,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAC7B,IAAK,KAAK,UAAU,GAAG,WAAY,OAAO,EAE5C,OAAO,CACT,CACA,IAAA,GACE,OAAO,KAAK,UAAU,KAAI,SAAU,GAClC,OAAO,EAAI,MACb,GACF,GAGF,GAAI,SAAU,GACZ,QAAQ,GACN,KAAK,aAAe,MAClB,OAAO,IAAI,KAAK,SAAS,GAC3B,IAAmB,iBAAP,EACV,OAAO,IAAI,KAAK,UAAU,GAC5B,KAAK,aAAe,KACpB,KAAK,IAAQ,IACX,OAAO,IAAI,KAAK,QAAQ,GAC1B,QACE,MAAM,IAAI,IAAI,+BAAiC,QAAQ,IAE7D,GA8BF,KAAK,kBAAoB,CACvB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,KAAK,KAAM,CAAC,GAC9B,EACA,OAAQ,WAAa,EACrB,OAAQ,WAAa,GAEvB,KAAK,QAAU,SAAU,EAAK,EAAW,GACvC,IAAa,GAAW,GACxB,CAAC,OAAQ,SAAU,UAAU,SAAQ,SAAU,GACxC,EAAU,KAAM,EAAU,GAAO,KAAK,kBAAkB,GAC/D,IAEA,IAAI,EAAW,KACX,EAAI,KAEJ,EAAO,SAAU,GACnB,GAAI,EAAU,CACZ,IAAI,EAAM,EAAkB,OAAE,EAAG,GAAI,GACrC,QAAY,IAAR,EAAmB,OAAO,CAChC,MAEgB,EAAV,EAAqB,IAAI,SAAS,SAAS,GAC/B,SAAS,GAAG,GAG9B,GAAK,EAAS,WAEP,CACL,EAAI,EAAS,OACb,IAAI,EAAS,EAAgB,KAAE,GAE/B,OADA,EAAO,MAAQ,EACR,CACT,CANE,OAAO,EAAkB,QAO7B,EACA,OAAO,EAAK,KACd,EACA,KAAK,cAAgB,SAAU,EAAK,GAClC,OAAO,KAAK,QAAQ,EAAK,GAAW,EACtC,EAKA,MAAM,OACJ,WAAA,CAAY,EAAO,GACjB,KAAK,MAAQ,EACb,KAAK,KAAO,CACd,CAEA,SAAA,CAAU,GACR,IAAK,KAAK,KACR,MAAM,IAAI,IAAI,iBAAmB,KAAK,MAAQ,2BAEhD,OAAO,KAAK,KAAK,EACnB,CAEA,OAAA,GACE,MAAO,YAAc,KAAK,MAAQ,GACpC,EAKF,QAAgB,OAAI,IAAI,OAAO,UAC/B,QAAe,MAAI,IAAI,OAAO,SAC9B,QAAe,MAAI,IAAI,OAAO,SAC9B,QAAgB,OAAI,IAAI,OAAO,UAC/B,QAAY,GAAI,IAAI,OAAO,MAC3B,QAAQ,QAAU,IAAI,OAAO,QAG7B,MAAM,OAEJ,WAAA,CAAY,GACV,IAAK,SAAS,GAEZ,MADA,QAAQ,MAAM,GACR,YAER,KAAK,GAAK,CACZ,CAEA,QAAA,GACE,MAAO,WACT,EAQF,MAAM,SACJ,WAAA,GAAe,CAEf,OAAA,CAAQ,GACN,MAAe,UAAR,EAAE,EACX,CAOA,YAAA,CAAa,EAAM,EAAG,GAIpB,IAHA,IACI,EAAM,EACN,EAFO,EAEI,IACN,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,EAAM,KAAK,cAAc,EAAI,GAAI,EAAG,CAAC,WAAY,IAGnD,OAAO,CACT,CAKA,aAAA,CAAc,EAAG,EAAG,GAClB,OAAO,KAAK,eACV,EACA,GACA,SAAU,GACR,MAAO,CAAC,cAAe,EAAG,EAC5B,IACA,SAAU,GACR,MAAO,CAAC,aAAc,EAAG,EAC3B,IACA,SAAU,GACR,MAAO,CAAC,eAAgB,EAAK,EAC/B,GAEJ,CAEA,cAAA,CAAe,EAAG,EAAG,EAAc,EAAa,GAC9C,IAEI,EAFA,EAAS,EAAE,GACb,EAAO,EAAE,GAEX,OAA6B,OAAxB,EAAI,EAAO,MAAM,IAEb,EAAa,GACY,OAAtB,EAAI,EAAK,MAAM,IAElB,EAAY,GAGZ,EADG,EAAE,KAIhB,CAQA,UAAA,CAAW,EAAM,EAAM,GAIrB,IAHA,IACI,EAAI,EACJ,EAAI,GACD,aAAgB,MACjB,EAAK,OAAO,EAAK,MAAM,EAAE,KAAK,GAClC,IACA,EAAO,EAAK,IAGd,IADA,IAAI,EAAM,EACD,EAAI,EAAE,OAAS,EAAG,GAAK,EAAG,IAAK,EAAM,CAAC,MAAO,EAAE,GAAI,GAC5D,OAAO,CACT,CAMA,SAAA,CAAU,EAAG,GAEX,IAAI,EAAM,KACV,GAAI,aAAa,WACf,EAAM,IAAI,aACL,GAAI,aAAa,KACtB,OAAQ,EAAE,SACR,KAAK,IAAI,UACP,IAAI,EAAM,EAAE,QACZ,EAAM,KAAK,UAAU,EAAK,GAC5B,KAAK,IAAI,SACP,EAAM,KAAK,UAAU,EAAE,IAAK,GAC5B,MACF,KAAK,IAAI,SACP,EAAM,IAAI,QACV,MACF,KAAK,IAAI,UACP,IAAI,EAAO,EAAE,SACX,EAAO,EAAE,IAAI,IAGb,EAFE,aAAgB,KAEZ,KAAK,UAAU,EAAM,EAAE,UAAU,OAAO,KAGxC,KAAK,UAAU,EAAM,EAAE,UAAU,IAAI,QAAQ,KAErD,MACF,KAAK,IAAI,MACP,IAAI,EAAQ,EAAE,SACZ,EAAQ,EAAE,QACV,EAAQ,EAAE,SACZ,EAAM,KAAK,UAAU,EAAO,GAAG,UAC7B,KAAK,UAAU,EAAO,GACtB,KAAK,UAAU,EAAO,IAExB,MACF,KAAK,IAAI,QACP,IAAI,EAAO,EAAE,SACX,EAAK,EAAE,QACW,EAAhB,EAAE,OAAO,GAAa,KAAK,UAAU,EAAI,GAAG,SAAS,GAC9C,KAAK,UAAU,EAAI,GAC9B,MACF,KAAK,IAAI,WACH,EAAM,EAAE,SACZ,EAAM,KAAK,UAAU,EAAK,GAC1B,MACF,QAEE,IADA,IAAI,EAAM,IAAI,QACL,EAAI,EAAG,aAAa,KAAM,EAAI,EAAE,IACvC,EAAM,EAAI,UAAU,KAAK,UAAU,EAAE,IAAK,IAE5C,EAAM,OAIV,EAAM,IAAI,QAGZ,GAAW,MAAP,EAAa,MAAM,IAAI,IAAI,qCAC1B,OAAO,CACd,CASA,SAAA,CAAU,EAAG,EAAG,GACd,IAAI,EAAM,KACV,GAAI,aAAa,WACE,EAAb,EAAE,OAAO,GAAU,IAAI,QAAQ,GACxB,IAAI,aACV,GAAI,aAAa,KACtB,OAAQ,EAAE,SACR,KAAK,IAAI,UACP,IAAI,EAAM,EAAE,QACZ,EAAM,KAAK,UAAU,EAAK,EAAG,GAC7B,MACF,KAAK,IAAI,SACP,EAAM,KAAK,UAAU,EAAE,IAAK,EAAG,GAC/B,MACF,KAAK,IAAI,SACP,EAAM,IAAI,QACV,MACF,KAAK,IAAI,UACP,IAAI,EAAO,EAAE,SACX,EAAO,EAAE,IAAI,IAGb,EAFE,aAAgB,KAEZ,KAAK,UAAU,EAAM,EAAE,UAAU,OAAO,IAAQ,GAGhD,KAAK,UAAU,EAAM,EAAE,SAAS,GAAO,GAE/C,MACF,KAAK,IAAI,MACP,IAAI,EAAQ,EAAE,SACZ,EAAQ,EAAE,QACV,EAAQ,EAAE,SACZ,EAAM,KAAK,UAAU,EAAO,EAAG,GAAG,UAChC,KAAK,UAAU,EAAO,EAAG,GACzB,KAAK,UAAU,EAAO,EAAG,IAE3B,MACF,KAAK,IAAI,QACP,IAAI,EAAO,EAAE,SACX,EAAM,EAAE,QACU,EAAhB,EAAE,OAAO,GAAa,KAAK,UAAU,EAAK,EAAG,GAAG,SAAS,GAClD,KAAK,UAAU,EAAK,EAAG,GAClC,MACF,KAAK,IAAI,WACH,EAAM,EAAE,SACZ,EAAM,KAAK,UAAU,EAAK,EAAG,GAC7B,MACF,QAEE,IADA,IAAI,EAAM,IAAI,QACL,EAAI,EAAG,aAAa,KAAM,EAAI,EAAE,IACvC,EAAM,EAAI,UAAU,KAAK,UAAU,EAAE,IAAK,EAAG,IAE/C,EAAM,OAIV,EAAM,IAAI,QAIZ,GAAW,MAAP,EAAa,MAAM,IAAI,IAAI,qCAC1B,OAAO,CACd,CAMA,YAAA,CAAa,GAEX,IADA,IAAI,EAAM,EACH,aAAa,KAAM,EAAI,EAAE,MAAO,GACvC,OAAI,GAAK,IACA,GAEC,CAEZ,CAEA,SAAA,CAAU,GACR,GAAI,aAAa,KACf,KAAO,EAAE,eAAe,KAAM,EAAI,EAAE,KAEtC,OAAO,CACT,CAKA,aAAA,CAAc,GACZ,GAAI,IAAO,IAAK,OAAO,IAoBvB,GAAI,aAAc,KAAM,CACtB,IAAI,EAAO,KAAK,UAAU,GAC1B,GAAI,aAAgB,MAAQ,EAAK,MAAQ,IACvC,OAAO,EAEP,IAAI,EAbQ,SAAU,GAExB,IADA,IAAI,EAAM,IACH,aAAc,KAAM,EAAK,EAAG,IACjC,EAAM,IAAI,KAAK,EAAG,IAAK,GAEzB,OAfa,SAAU,GAEvB,IADA,IAAI,EAAM,IACH,aAAc,MAAQ,CAC3B,IAAI,EAAI,EAAG,IACX,EAAG,IAAM,EACT,EAAM,EACN,EAAK,CACP,CACA,OAAO,CACT,CAMS,CAAS,EAClB,CAOiB,CAAU,GAEvB,OADA,KAAK,UAAU,GAAQ,IAAM,IAAI,KAAK,EAAK,IAAK,KACzC,CAEX,CACE,OAAO,IAAI,KAAK,EAAI,IAExB,CAOA,OAAA,CAAQ,EAAG,EAAG,EAAG,EAAG,GAIlB,IAFA,IAAI,EAAM,OAEA,CACR,GAAI,aAAa,WAGf,OAAO,KAAK,cACV,EACA,EACA,EAAE,OAAO,GAAK,CAAC,WAAY,GAAQ,GAEhC,KAAI,aAAa,MA2HtB,MAAO,CAAC,WAAY,EAAG,GA1HvB,OAAQ,EAAE,SACR,KAAK,IAAI,UAGP,GAFA,EAAM,KAAK,gBAAgB,EAAG,IAEtB,GACR,EAAO,EAAI,GACX,MAEF,KAAK,IAAI,SAEP,IADA,IAAI,EAAI,GACC,EAAI,EAAE,IAAK,aAAa,KAAM,EAAI,EAAE,IAAK,EAAE,KAAK,EAAE,KAI3D,IADA,IAAI,EAAI,EACC,EAAI,EAAE,OAAS,EAAG,GAAK,EAAG,IACjC,EAAI,KAAK,QAAQ,EAAE,GAAI,EAAG,EAAG,EAAG,GAElC,OAAO,EAET,KAAK,IAAI,SACP,GAAI,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,kBAAoB,EAAE,YAG5C,MAAO,CAAC,WADE,EAAE,SACa,GAE3B,KAAK,IAAI,UACP,OAAO,KAAK,gBAAgB,EAAG,EAAG,EAAG,EAAG,GAE1C,KAAK,IAAI,MACP,GAAI,EAAE,SAAW,GAAK,EAAE,SAAW,EACjC,MAAM,IAAI,UAAU,eAAiB,EAAE,YAEzC,IAAI,EAAQ,EAAE,SACZ,EAAQ,EAAE,QACV,EAAQ,EAAE,SACR,EAAQ,KAAK,QAAQ,EAAO,EAAG,EAAG,EAAG,GACrC,EAAQ,KAAK,QAAQ,EAAO,EAAG,EAAG,EAAG,GACzC,EAAI,EACJ,EAAO,CAAC,OAAQ,EAAO,GACvB,MAEF,KAAK,IAAI,QAEP,GAAkB,GAAd,EAAE,SACJ,MAAM,IAAI,UAAU,iBAAmB,EAAE,YAE3C,IAAI,EAAI,EAAE,SAEN,GADF,EAAI,EAAE,QACQ,KAAK,eACnB,EACA,GACA,SAAU,GACR,MAAO,CAAC,eAAgB,EAAG,EAC7B,IACA,SAAU,GACR,MAAO,CAAC,cAAe,EAAG,EAC5B,IACA,SAAU,GACR,MAAO,CAAC,gBAAiB,EAAK,EAChC,KAEF,EAAO,EACP,MAEF,KAAK,IAAI,WACH,EAAI,EAAE,SAEN,EAAI,CACN,QACA,KAAK,QAAQ,GAAQ,EAAE,GAAG,OAAS,EAAI,EACvC,CACE,WACA,CACE,WAPa,EASb,CACE,WACA,KAAK,QACH,EACA,EACA,EACA,EACA,KAAK,QAAQ,GACT,CAAC,QAjBI,EAiBmB,CAAC,qBACzB,CAAC,cAQf,OAAO,KAAK,QAAQ,GAAQ,EAAI,CAAC,QAAS,EAAG,GAE/C,QAKE,IAAI,EAAO,EAAE,IACT,EAAO,EAAE,IACT,EAAI,KAAK,QACX,EACA,EACA,EACA,EACA,KAAK,QAAQ,GACT,CAAC,QAAS,EAAK,SAAU,CAAC,qBAC1B,CAAC,UAIP,EAAI,KAAK,QAAQ,EAAK,SAAU,EAAG,EAAG,EAAG,CAAC,WAAY,IACtD,IAAS,EAAI,EAAM,aAAa,KAAM,EAAI,EAAE,IAC1C,EAAI,KAAK,QAAQ,EAAE,IAAK,EAAG,EAAG,EAAG,CAAC,WAAY,IAIhD,OAAO,KAAK,QAAQ,GAAQ,EAAI,CAAC,QAAS,EAAG,GAKrD,CAQF,CAcA,eAAA,CAAgB,EAAG,GACjB,GAAkB,GAAd,EAAE,SAEJ,MAAM,IAAI,UAAU,qBAAuB,EAAE,YAG/C,IAAI,EAAQ,EAAE,IAAI,IACd,EAAO,EAAE,IAAI,IAEjB,GAAI,aAAiB,WAAY,CAC/B,GAAI,IAAS,IAEX,EAAI,UACC,CACL,GAAI,EAAK,MAAQ,IAIZ,MAAM,IAAI,UAAU,qBAAuB,EAAE,YAFhD,EAAI,EAAK,GAGb,CAEK,OAAO,eAAe,EAAM,QAC/B,OAAO,EAAM,MAAQ,OAEvB,EAAO,CAAC,gBAAiB,EAAM,KAAM,EACvC,KAAO,MAAI,aAAiB,MAe1B,MAAM,IAAI,UAAU,2CAA6C,GAVjE,IAAI,EAAQ,EAAM,IAChB,EAAO,EAAM,IAEf,EADa,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAM,IAE/C,OAAO,eAAe,EAAM,QAC/B,OAAO,EAAM,MAAQ,OAEvB,EAAO,CAAC,gBAAiB,EAAM,KAAM,EAIvC,CAEA,MAAO,CAAC,EAAG,EACb,CAOA,eAAA,CAAgB,EAAG,EAAG,EAAG,EAAG,GAC1B,GAAI,EAAE,SAAW,EAAG,MAAM,IAAI,UAAU,mBAAqB,EAAE,YAE/D,IAAI,EAAO,EAAE,IAAI,IACb,EAAO,EAAE,IAAI,IAGb,EAAQ,SAAS,0BAA0B,GAC/C,IAAI,EAIF,EAHE,OAAO,IAAU,SAAS,EAAM,MAA0B,WAAlB,EAAM,IAAI,KAG5C,SAAS,OAAO,GAIhB,IAAI,KAAK,IAAI,SAAU,EAAE,IAAI,KAGvC,IAAI,EAAS,KAAK,aAAa,GAC3B,EAAS,KAAK,cAAc,GAC5B,EAAO,KAAK,UAAU,EAAO,OAAO,GAAS,GAC7C,EAAO,KAAK,UAAU,EAAO,OAAO,IAMxC,MAAM,EAAa,EAAE,UAAU,OAAO,IAChC,EAAQ,EAAK,UAAU,EAAW,cAAc,IAEtD,IAAI,EAAU,KAAK,QACjB,EACA,CAAC,OAAO,GAAS,GACjB,EACA,EAAE,UAAU,OAAO,IACnB,CAAC,WAEC,EAAW,CACb,QACA,aAAgB,KAAO,EAAK,SAAW,EACvC,EAAK,OACL,KAAK,WAAW,EAAM,EAAQ,GAC9B,EACA,GAEF,OAAO,KAAK,aAAa,EAAM,EAAG,EACpC,CAEA,GAAA,CAAI,GACF,MAAM,EAAM,KAAK,QACf,EACA,CAAC,IAAI,QAAW,IAAI,SACpB,IAAI,QACJ,IAAI,QACJ,CAAC,SAEH,OAAO,IAAI,OAAO,EACpB,EAGF,SAAS,QAAU,SAAU,EAAM,GAEjC,OADA,EAAO,SAAS,OAAO,IAChB,IAAI,UAAW,IAAI,EAAM,EAClC,EAQA,SAAS,OAAS,SAAU,EAAG,GAC7B,IAAI,EAAS,SAAS,OACtB,IAAS,EAAO,CAAC,GACjB,IAAI,EAAM,KAEV,GAAI,aAAa,KACf,OAAQ,EAAE,KACR,KAAK,IAAI,UACP,IAAI,EAAO,EAAE,IAAI,IACf,EAAM,EAAE,IAAI,IACd,EAAM,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAM,EAAO,EAAK,KACzD,MACF,KAAK,IAAI,SACP,EAAM,IAAI,KAAK,IAAI,SAAU,EAAO,EAAE,IAAK,IAC3C,MACF,KAAK,IAAI,SACP,EAAM,EACN,MACF,KAAK,IAAI,UACP,IAAI,EAAO,EAAE,IAAI,IACf,EAAO,EAAE,IAAI,IACf,EAAM,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAM,EAAO,EAAM,KAC1D,MACF,KAAK,IAAI,MACP,IAAI,EAAQ,EAAE,SACZ,EAAQ,EAAE,QACV,EAAQ,EAAE,SACZ,EAAM,KACJ,IAAI,MACJ,EAAO,EAAO,GACd,EAAO,EAAO,GACd,EAAO,EAAO,IAEhB,MACF,KAAK,IAAI,QACP,IAAI,EAAI,EAAE,SACR,EAAI,EAAE,QACR,EAAM,KAAK,IAAI,QAAS,EAAG,EAAO,EAAG,IACrC,MACF,KAAK,IAAI,kCACT,KAAK,IAAI,WACH,EAAI,EAAE,SACV,EAAM,KAAK,IAAI,WAAY,EAAO,EAAG,IACrC,MACF,QAEE,IAAI,EAAc,KAQlB,GAPI,SAAS,EAAE,OACT,OAAO,EAAE,IAAI,gBAAiB,OAChC,EAAc,OAAO,EAAE,IAAI,MACpB,QAAQ,EAAE,IAAI,gBAAiB,SACtC,EAAc,QAAQ,EAAE,IAAI,QAG5B,EAAa,CAYf,IAAI,EACJ,IAZA,EAAe,UAAI,EACnB,EAAM,EAAY,UAAU,GAY1B,EAAM,EAAO,EAAM,EAAK,CAAC,GACpB,EAAa,WAEtB,KAAO,CACL,IACI,EADA,EAAe,EAAO,EAAE,IAAK,GAEjC,KAAM,EAAE,eAAe,OAAS,EAAE,MAAQ,IACxC,MAAM,IAAI,UACR,+DAEE,SAAS,IAGf,EAAe,cACb,EAAE,IAAI,WAAW,KAAI,SAAU,GAC7B,OAAO,EAAO,EAAM,EACtB,KAEF,EAAM,IAAI,KAAK,EAAc,EAC/B,OAGJ,EAAM,EAER,OAAO,CACT,EAmBA,IAAI,cAAgB,SAAU,GAC5B,OAAO,OAAO,IAAM,IAAI,YAAc,EAAE,GAE1C,EAOI,sBAAwB,SAAU,GACpC,IAAI,EAAM,EAAI,IAAI,IACd,EAAO,EAAI,IAAI,IAEnB,GAAI,SAAS,GAGX,OAAO,IAAI,KAFP,EAAW,EAEW,GAE1B,IAAI,EAAW,EAAI,IACf,EAAQ,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAI,IAAK,IAEtD,OAAO,KAAK,EAAU,EAE1B,EAqBA,SAAS,OAAO,GACd,GAAI,IAAO,IACT,OAAO,IAAI,QAGX,IADA,IAAI,EAAM,IAAI,QACL,EAAI,EAAI,aAAa,KAAM,EAAI,EAAE,IACxC,EAAI,IAAI,EAAE,KAEZ,OAAO,CAEX,CA7BA,SAAS,0BAA4B,SAAU,GAI7C,IAFA,IAAI,EAAO,GACT,EAAO,EACF,cAAc,EAAK,MACxB,EAAK,KAAK,EAAK,KACf,EAAO,EAAK,IAEd,IAAI,EAAQ,EAGZ,GAAmB,GAAf,EAAK,OAAa,OAAO,EAG7B,IAAI,EAAW,KAAK,MAAM,KAAM,EAAK,IAAI,wBACzC,OAAO,IAAI,KAAK,IAAI,WAAY,IAAI,KAAK,EAAU,GACrD,EAmBA,MAAM,YAAc,SAAU,GAC5B,OAAO,WAML,EAAM,MAAM,KAAM,CADJ,IACY,OAAO,MAAM,KAAK,YAC9C,CACF,EAEM,mBAAqB,SAAU,EAAM,EAAM,GAC/C,OAAO,aAAY,SAAU,EAAO,EAAK,GACvC,MAAM,EAAS,EAAM,IAAM,EAAM,MAAQ,GACzC,IAAK,EAAK,GACR,MAAM,IAAI,UACR,EAAS,EAAO,sBAAwB,SAAS,GAGvD,GACF,EAYA,MAAM,UACJ,WAAA,CAAY,EAAY,EAAa,GACnC,KAAK,aAAsB,IAAZ,KAA+B,EAE9C,KAAK,UAAY,EACjB,KAAK,WAAa,EAGlB,KAAK,SAAW,CAAC,CACnB,CAEA,KAAA,GACE,KAAK,SAAW,CAAC,CACnB,CAEA,eAAA,CAAgB,GACd,OAAO,KAAK,SAAS,EACvB,CAEA,QAAA,CAAS,EAAQ,EAAK,GACpB,IAAI,EAAQ,KAAK,SAAS,GAEtB,EACF,EAAM,KAAK,CAAC,EAAK,IAEjB,KAAK,SAAS,GAAU,CAAC,CAAC,EAAK,GAEnC,CAEA,WAAA,CAAY,EAAQ,GAClB,IAAI,EAAQ,KAAK,SAAS,GACtB,EAAI,EAAM,QAAQ,GACtB,IAAU,GAAN,EACF,MAAM,IAAI,IAAI,0CAEd,EAAM,OAAO,EAAG,EAEpB,CAEA,WAAA,CAAY,GACV,IAAI,EAAO,IAAI,UAAU,KAAK,UAAW,KAAK,WAAY,GAQ1D,OANA,OAAO,KAAK,KAAK,UAAU,SAAS,IAClC,IACI,EADQ,KAAK,SAAS,GACP,KAAK,GAAS,IAAI,KACrC,EAAK,SAAS,GAAU,CAAM,IAGzB,CACT,CAEA,IAAA,GACE,IAAI,EAAI,EAIR,OAHA,KAAK,aAAY,SAAU,GACzB,GACF,IACO,CACT,CAEA,IAAA,GACE,OAAO,KAAK,aAAY,SAAU,GAChC,OAAO,EAAK,EACd,GACF,CAEA,MAAA,GACE,OAAO,KAAK,aAAY,SAAU,GAChC,OAAO,EAAK,EACd,GACF,CAEA,WAAA,CAAY,GACV,IAAI,EAAI,GAMR,OALA,OAAO,OAAO,KAAK,UAAU,SAAQ,SAAU,GAC7C,EAAM,SAAQ,SAAU,GACtB,EAAE,KAAK,EAAK,GACd,GACF,IACO,CACT,CAEA,QAAA,GACE,MAAO,oBAAsB,KAAK,OAAS,GAC7C,EAGF,MAAM,YAAc,SAAU,GAC5B,OAAO,aAAe,SACxB,EAEM,mBAAqB,SAAU,GACnC,OAAO,aAAe,WAAa,EAAI,OACzC,EAMA,UAAU,WAAa,SAAU,GAC/B,OAAO,SAAS,EAAG,GACrB,EACA,UAAU,QAAU,UAAU,WAC9B,UAAU,SAAW,UAAU,WAE/B,UAAU,YAAc,SAAU,GAChC,OAAO,EAAG,EACZ,EAEA,UAAU,eAAiB,SAAU,GACnC,MAAwB,iBAAV,EAAG,GAAkB,EAAG,GAAG,cAAgB,EAAG,EAC9D,EAEA,UAAU,YAAc,SAAU,GAChC,OAAO,EAAG,aAAc,WAAa,EAAG,GAAG,KAAO,EAAG,EACvD,EAMA,UAAU,SAAW,SAAU,GAC7B,OAAO,GAAG,EAAG,GAAI,EAAG,GACtB,EAEA,UAAU,UAAY,SAAU,GAC9B,OAAO,IAAI,EAAG,GAAI,EAAG,GACvB,EASA,MAAM,QACJ,WAAA,CAAY,EAAM,GAChB,KAAK,KAAO,EACZ,KAAK,KAAO,CACd,CAEA,SAAA,GACE,OAAO,KAAK,KAAK,KAAK,KAAO,KAAK,KAAO,KAAK,KAAO,KAAK,KAC5D,CAEA,KAAA,GACE,OAAO,KAAK,MAAM,KAAK,KAAM,KAAK,KACpC,CAEA,MAAA,GACE,OAAoB,GAAb,KAAK,IACd,CAEA,UAAA,GACE,OAAoB,GAAb,KAAK,MAAa,WAAW,KAAK,KAC3C,CAEA,SAAA,GACE,OAAoB,GAAb,KAAK,MAAa,UAAU,KAAK,KAC1C,CAEA,QAAA,CAAS,GACP,GAAkB,IAAd,KAAK,MAA4B,IAAd,KAAK,KAAY,MAAO,IAC/C,IAAI,EAAM,GACV,GAAkB,IAAd,KAAK,KAAY,CAInB,OAHI,KAAK,KAAO,GAAmB,IAAd,KAAK,OACxB,GAAO,KAED,KAAK,MACX,KAAK,EACH,MACF,KAAM,EACJ,GAAO,IACP,MACF,QACE,GAAO,KAAK,KAAK,SAAS,GAE9B,GAAO,GACT,CACA,IAAI,EAAO,GAIX,OAHkB,IAAd,KAAK,OACP,GAAQ,KAAK,KAAK,SAAS,IAEtB,EAAO,CAChB,EAGF,QAAQ,WAAa,SAAU,EAAG,GAChC,IAAI,EAAO,EAAI,KAAK,IAAI,GACpB,EAAO,EAAI,KAAK,IAAI,GACxB,OAAO,IAAI,QAAQ,EAAM,EAC3B,EAEA,QAAQ,OAAS,SAAU,GACzB,OAAI,aAAe,QAAgB,EACvB,IAAI,QAAQ,EAAK,EAC/B,EAKA,MAAM,SACJ,WAAA,CAAY,EAAW,GACrB,KAAK,UAAY,EACjB,KAAK,YAAc,CACrB,CAEA,SAAA,GACE,OAAO,KAAK,UAAY,KAAK,aAAe,CAC9C,EAMF,MAAM,SAAW,SAAU,GACzB,OAAO,aAAa,SAAW,aAAa,UAAwB,iBAAL,CACjE,EACM,UAAY,SAEZ,OAAS,SAAU,GACvB,OAAI,aAAa,SAAW,aAAa,SAChC,EAAE,SAEU,iBAAL,CAElB,EAEM,WAAa,SAAU,GAC3B,OAAI,aAAa,QACR,EAAE,aACA,aAAa,UAGH,iBAAL,CAElB,EAEM,UAAY,SAAU,GAC1B,OAAI,aAAa,SAAW,aAAa,SAChC,EAAE,YAEU,iBAAL,GAAiB,EAAI,GAAK,CAE5C,EAGA,MAAM,qBAAqB,WAE3B,MAAM,mBAAmB,WAEzB,MAAM,gBAAgB,WAKtB,MAAM,QAAU,sCAGV,OAAS,CACb,EAAG,SACH,EAAG,UACH,GAAI,UACJ,GAAI,iBAIA,MAAQ,CACZ,IAAK,IACL,IAAK,IACL,IAAK,KAID,YAAc,CAClB,MAAO,IACP,UAAW,KACX,OAAQ,IACR,OAAQ,IACR,QAAS,KACT,KAAM,KACN,OAAQ,KACR,MAAO,IACP,IAAK,MAID,iBAAmB,CACvB,EAAG,IACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,MAGL,MAAM,OACJ,WAAA,CAAY,GAEV,KAAK,IAAM,EAEX,KAAK,EAAI,EAET,KAAK,UAAW,EAEhB,KAAK,aAAe,EACtB,CAGA,MAAA,CAAO,GACL,MAAM,EAAO,KAAK,IAClB,KAAK,IAAM,EAAK,MAAM,EAAG,KAAK,GAAK,EAAM,EAAK,MAAM,KAAK,EAC3D,CAGA,OAAA,GACE,MAAO,aAAa,KAAK,KAAK,KAAK,IAAI,UACzC,CAMA,SAAA,GAEE,IAAI,EACJ,GAFA,KAAK,kBAED,KAAK,OACP,EAAM,OAAO,QACR,CACL,MAAM,EAAM,KAAK,YACjB,OAAQ,GACN,IAAK,IACL,IAAK,IACL,IAAK,IACH,KAAK,IACL,EAAM,KAAK,aACX,MACF,IAAK,IACH,EAAM,KAAK,eACX,MACF,IAAK,IACH,EAAM,KAAK,uBACX,MAEF,IAAK,IACL,IAAK,IACL,IAAK,IACH,MAAM,IAAI,WAAW,qBAAqB,MAG5C,IAAK,IACH,EAAM,KAAK,YAAY,SACvB,MACF,IAAK,IACH,EAAM,KAAK,YAAY,cACvB,MACF,IAAK,IACH,EAAM,KAAK,YAAY,WACvB,MACF,IAAK,KACH,EAAM,KAAK,YAAY,oBACvB,MAEF,QAEI,EADY,KAAV,EAAI,GACA,KAAK,YAAY,GAEjB,KAAK,gCAAgC,GAInD,CAEA,OAAO,CACT,CAEA,6BAAA,CAA8B,GAC5B,MAAM,EAAI,KAAK,YACf,GAAI,IAAM,OAAO,IAAK,MAAM,IAAI,aAAa,GAC7C,OAAO,CACT,CAGA,SAAA,GACE,MAAM,EAAI,KAAK,IAAI,KAAK,GACxB,QAAU,IAAN,EAAiB,MAAM,IAAI,IAAI,kCACnC,IAAI,EACJ,OAAQ,GACN,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACH,KAAK,IACL,EAAM,EACN,MACF,IAAK,IACH,KAAK,IACmB,KAApB,KAAK,IAAI,KAAK,IAChB,KAAK,IACL,EAAM,MAEN,EAAM,IAER,MACF,IAAK,IACH,KAAK,IACL,EAAM,KAAK,iBACX,MACF,QACE,MAAM,EAAI,KAAK,MAAM,SACjB,GACF,KAAK,GAAK,EAAE,GAAG,OACf,EAAM,EAAE,KAER,KAAK,IACL,EAAM,GAIZ,OAAO,CACT,CAGA,cAAA,GACE,MAAM,EAAK,KAAK,IAAI,KAAK,GACzB,QAAW,IAAP,EAEF,MAAO,IAET,GAAW,MAAP,EAEF,OADA,KAAK,IACE,KAET,GAAW,OAAP,EAEF,OADA,KAAK,IACE,MAAQ,KAAK,gBAEtB,IAAI,EAAI,KAAK,MAAM,cACnB,OAAI,GACF,KAAK,GAAK,EAAE,GAAG,OACR,IAAM,EAAE,KAEjB,EAAI,KAAK,MAAM,SACX,GACF,KAAK,GAAK,EAAE,GAAG,OACR,IAAM,EAAE,KAGjB,KAAK,IACE,IAAM,GACf,CAGA,aAAA,GACE,GAAI,KAAK,OACP,MAAM,IAAI,aAAa,0BAA2B,KAAK,MAAM,IAE/D,MAAM,EAAI,KAAK,MAAM,UACrB,GAAI,EAEF,OADA,KAAK,GAAK,EAAE,GAAG,OACR,EAAE,GACJ,CACL,MAAM,EAAI,KAAK,IAAI,KAAK,GAExB,OADA,KAAK,IACE,CACT,CACF,CAIA,eAAA,GACE,KAAO,KAAK,EAAI,KAAK,IAAI,QACvB,OAAQ,KAAK,IAAI,KAAK,IAEpB,IAAK,IACL,IAAK,KACL,IAAK,KACH,KAAK,IACL,MAGF,IAAK,IACH,MAAM,EAAI,KAAK,MAAM,kBACrB,KAAK,GAAK,EAAE,GAAG,OACf,MAGF,IAAK,IACH,GAA4B,KAAxB,KAAK,IAAI,KAAK,EAAI,GACpB,KAAK,GAAK,EACV,KAAK,kBAEL,KAAK,8BAA8B,kCAC9B,GAA4B,KAAxB,KAAK,IAAI,KAAK,EAAI,GAC3B,KAAK,GAAK,EACV,KAAK,yBACA,GAAI,KAAK,MAAM,gBACpB,KAAK,GAAK,GACV,KAAK,UAAW,MACX,KAAI,KAAK,MAAM,mBAIpB,OAHA,KAAK,GAAK,GACV,KAAK,UAAW,CAGlB,CACA,MAEF,QACE,OAGR,CAIA,iBAAA,GACE,IAAI,EAAQ,EACZ,KAAO,KAAK,EAAI,KAAK,IAAI,QAAQ,CAC/B,MAAM,EAAO,KAAK,MAAM,OACxB,GAAa,OAAT,EACF,MAGF,MAAM,EAAS,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,EAAG,EAAK,QACtD,GAAI,EACF,IACA,KAAK,GAAK,EAAO,MAAQ,OAKzB,GAFA,KAAK,GAAK,EAAK,MAAQ,EACvB,IACa,GAAT,EAEF,MAGN,CACA,MAAM,IAAI,aACR,8CACA,KAAK,OAET,CAGA,WAAA,CAAY,GACV,KAAK,kBACL,MAAM,EAAI,KAAK,8BAA8B,gBAAgB,KAC7D,OAAO,KAAK,IAAI,GAAO,EACzB,CAGA,WAAA,CAAY,GACV,IAAK,EAAI,WAAW,KAAM,MAAM,IAAI,IAAI,eACxC,OAAQ,GACN,IAAK,KACL,IAAK,QACH,OAAO,EACT,IAAK,KACL,IAAK,SACH,OAAO,EACT,IAAK,KACH,OAAO,KAAK,eACd,QACE,QAAQ,GACN,KAAK,EAAI,WAAW,OAClB,OAAO,KAAK,WAAW,GACzB,KAAK,EAAI,WAAW,OAClB,MAAM,IAAI,UACR,oCACA,KAAK,MAAM,IAEf,IAAK,aAAa,KAAK,GACrB,OAAO,KAAK,qBAAqB,GACnC,IAAK,OAAO,KAAK,GACf,OAAO,KAAK,iBAAiB,GAC/B,QACE,MAAM,IAAI,QAAQ,mBAAoB,IAGhD,CAGA,UAAA,CAAW,GACT,IAAK,EAAI,WAAW,OAAQ,MAAM,IAAI,IAAI,cAC1C,MAAM,EAAO,EAAI,UAAU,GAE3B,IAAI,EAAI,YAAY,GACpB,GAAI,EACF,OAAO,KAAK,IAAI,GAGlB,IAAI,EAAI,oBAAoB,KAAK,GACjC,GAAI,EACF,OAAO,KAAK,IAAI,OAAO,aAAa,SAAS,EAAE,GAAI,MAGrD,GAAmB,GAAf,EAAK,OACP,OAAO,KAAK,IAAI,GAGlB,MAAM,IAAI,QAAQ,yBAAyB,IAC7C,CAGA,YAAA,GACgB,KAAK,EAAnB,MACM,EAAM,GACZ,EAAM,KAAO,KAAK,EAAI,KAAK,IAAI,QAE7B,OADA,KAAK,kBACG,KAAK,IAAI,KAAK,IACpB,IAAK,IACH,KAAK,IACL,MAAM,EACR,IAAK,IACL,IAAK,IACH,MAAM,IAAI,UAAU,oBAAqB,KAAK,QAChD,QACE,EAAI,KAAK,KAAK,aAIpB,OAAO,CACT,CAIA,oBAAA,CAAqB,GACnB,IAAI,EAAO,GACP,EAAI,EACJ,EAAE,MAAM,cAAa,EAAI,EAAE,UAAU,IACrC,EAAE,MAAM,WACV,EAAO,EACP,EAAI,EAAE,UAAU,IACP,EAAE,MAAM,WACjB,EAAO,EACP,EAAI,EAAE,UAAU,IACP,EAAE,MAAM,WACjB,EAAO,GACP,EAAI,EAAE,UAAU,IACP,EAAE,MAAM,YACjB,EAAO,GACP,EAAI,EAAE,UAAU,IAEd,EAAE,MAAM,cAAa,EAAI,EAAE,UAAU,IAEzC,MAAM,EAAI,KAAK,oBAAoB,EAAM,GACzC,GAAU,OAAN,EAEF,MAAM,IAAI,QAAQ,iCAElB,OAAO,CAEX,CAIA,mBAAA,CAAoB,EAAM,GACxB,MAAO,EAAG,GAAQ,KAAK,iBAAiB,EAAM,GAC9C,GAAU,OAAN,EACF,OAAO,KACF,GAAa,KAAT,EACT,OAAO,EAET,MAAM,EAAI,EAAK,GACf,GAAS,KAAL,EAAU,CAEZ,MAAO,EAAG,GAAS,KAAK,iBAAiB,EAAM,EAAK,UAAU,IAC9D,GAAU,OAAN,GAAwB,KAAV,EAChB,OAAO,QAAQ,WAAW,EAAG,EAEjC,MAAO,GAAS,KAAL,GAAiB,KAAL,EAAU,CAE/B,MAAO,EAAG,GAAS,KAAK,iBAAiB,EAAM,GAC/C,GAAU,OAAN,GAAc,EAAM,MAAM,UAC5B,OAAO,IAAI,QAAQ,EAAG,EAE1B,CACA,OAAO,IACT,CAKA,gBAAA,CAAiB,EAAM,GACrB,GAAY,KAAR,EAAY,MAAO,CAAC,KAAM,GAG9B,MAAM,EAAI,EAAI,MAAM,wBACpB,GAAI,EAAG,CAEL,MAAO,EADY,SAAR,EAAE,GAAgB,IAAW,MAAgB,KAAR,EAAE,GAAY,GAAK,GACxD,EAAI,UAAU,EAAE,GAAG,QAChC,CAGA,IAAI,EAAI,EACJ,EAAO,EASX,GARI,EAAE,MAAM,OACV,EAAI,EAAE,UAAU,GACP,EAAE,MAAM,SACjB,EAAI,EAAE,UAAU,GAChB,GAAQ,GAIE,IAAR,GAAsB,KAAR,EAAE,GAAW,CAC7B,MAAM,EAAK,EAAI,MAAM,2BACrB,OAAI,EACK,CAAC,WAAW,IAAM,EAAG,IAAK,EAAI,UAAU,EAAG,GAAG,SAE9C,CAAC,KAAM,EAElB,CAGA,IAAI,EAAI,EACR,MAAM,EAAK,EAAE,MAAM,OAAO,IAC1B,IAAI,EAIF,MAAO,CAAC,KAAM,GAGhB,GANE,EAAI,EAAE,UAAU,EAAG,GAAG,QACtB,EAAI,SAAS,EAAG,GAAI,GAAQ,EAKlB,KAAR,EAAE,GAAW,CACf,EAAI,EAAE,UAAU,GAChB,MAAM,EAAM,EAAE,MAAM,OAAO,IAC3B,GAAI,EAAK,CACP,EAAI,EAAE,UAAU,EAAI,GAAG,QACvB,MAAM,EAAI,SAAS,EAAI,GAAI,GAC3B,MAAO,CAAC,IAAI,SAAS,EAAG,GAAI,EAC9B,CACE,MAAO,CAAC,KAAM,EAElB,CAGA,GAAY,IAAR,EAAY,CAEd,MAAM,EAAM,EAAI,MAAM,0CACtB,GAAI,EACF,MAAO,CAAC,WAAW,EAAI,IAAK,EAAI,UAAU,EAAI,GAAG,QAErD,CAEA,MAAO,CAAC,KAAM,EAChB,CAGA,gBAAA,CAAiB,GACf,MAAM,EAAI,EAAI,MAAM,iBACpB,GAAI,EAAG,CACL,MAAM,EAAK,SAAS,EAAE,IACtB,GAAY,KAAR,EAAE,GAAW,CAEf,MAAM,EAAI,KAAK,8BACb,8BAGF,OADA,KAAK,aAAa,GAAM,EACjB,CACT,CAEE,GAAI,KAAK,aAAa,eAAe,GACnC,OAAO,KAAK,aAAa,GAEzB,MAAM,IAAI,UAAU,4BAA6B,EAGvD,CACE,MAAM,IAAI,UAAU,0BAA2B,EAEnD,CAIA,UAAA,GACE,MAAM,EAAQ,KAAK,EACb,EAAY,KAAK,IAAI,KAAK,GAChC,KAAK,IACL,MAAM,EAAa,MAAM,GACzB,IAAI,GAAU,EACV,EAAO,IACT,EAAO,EACT,KAAO,KAAK,EAAI,KAAK,IAAI,QAAQ,CAC/B,KAAK,kBACL,MAAM,EAAI,KAAK,IAAI,KAAK,GACxB,GAAI,GAAK,EAEP,OADA,KAAK,IACE,EACF,GAAS,KAAL,GAAiB,KAAL,GAAiB,KAAL,EACjC,MAAM,IAAI,UAAU,oBAAqB,KAAK,QACzC,GAAS,KAAL,GAAY,KAAK,MAAM,WAAY,CAC5C,GAAI,IAAS,IACX,MAAM,IAAI,UAAU,6BAA8B,KAAK,KAAK,IAE9D,GAAU,EACV,KAAK,IACL,MAAM,EAAI,KAAK,YACf,GAAI,IAAM,OAAO,IACf,MAAM,IAAI,aACR,8BACA,KAAK,KAAK,IAGd,EAAK,IAAM,CACb,KAAO,IAAI,EACT,MAAM,IAAI,UACR,kCACA,KAAK,KAAK,IAEP,CACL,MAAM,EAAK,KAAK,YAChB,GAAI,IAAO,OAAO,IAEhB,MADA,KAAK,EAAI,EACH,IAAI,aAAa,oBAAqB,KAAK,QAEnD,MAAM,EAAM,IAAI,KAAK,EAAI,KACrB,IAAS,IAAK,EAAO,EACpB,EAAK,IAAM,EAChB,EAAO,CACT,EACF,CAEA,MADA,KAAK,EAAI,EACH,IAAI,aAAa,oBAAqB,KAAK,OACnD,CAGA,YAAA,GACE,MAAM,EAAI,KAAK,MAAM,mBACrB,GAAI,EAAG,CACL,KAAK,GAAK,EAAE,GAAG,OACf,MAAM,EAAI,EAAE,GAAG,WAAW,cAAe,IACzC,OAAO,KAAK,qBAAqB,EACnC,CACE,MAAM,IAAI,aAAa,yBAA0B,KAAK,OAE1D,CAGA,oBAAA,GACE,MAAM,EAAI,KAAK,MAAM,sBACrB,GAAI,EAEF,OADA,KAAK,GAAK,EAAE,GAAG,OACR,IAAI,KAAK,qBAAqB,EAAE,KAEvC,MAAM,IAAI,aAAa,yBAA0B,KAAK,OAE1D,CAGA,oBAAA,CAAqB,GACnB,OAAO,EACJ,WAAW,qBAAqB,CAAC,EAAG,IACnC,OAAO,aAAa,SAAS,EAAG,OAEjC,WAAW,UAAU,CAAC,EAAG,IAAM,iBAAiB,IAAM,GAC3D,CAGA,+BAAA,CAAgC,GAC9B,GAAY,KAAR,EAAY,MAAM,IAAI,IAAI,sBAE9B,MAAM,EAAI,KAAK,oBAAoB,GAAI,GACvC,OAAU,OAAN,EACK,IAAI,KAAK,SAAW,EAAI,cAAgB,GAExC,CAEX,CAGA,IAAA,CAAK,EAAK,GACR,OAAO,KAAK,IAAI,MAAM,KAAK,EAAI,EACjC,CAGA,IAAA,CAAK,GACH,OAAO,KAAK,IAAI,MAAM,EACxB,CAIA,KAAA,CAAM,EAAM,EAAK,GACf,OAAO,EAAK,KAAK,KAAK,KAAK,GAC7B,CAGA,IAAA,GACE,OAAO,KAAK,GAAK,KAAK,IAAI,MAC5B,EAIF,OAAO,IAAM,IAAI,OACjB,OAAO,IAAI,SAAW,IAAM,2BAG5B,OAAO,MAAS,IACd,MAAM,EAAS,IAAI,OAAO,GACpB,EAAM,GACZ,OAAa,CACX,IAAI,EAAO,EAAO,YAClB,GAAI,IAAS,OAAO,IAAK,MACzB,EAAI,KAAK,EACX,CACA,OAAO,CAAG,EAGZ,OAAO,aAAe,aAMtB,MAAM,YAKJ,WAAA,GACE,IAAI,EAAmB,KACnB,EAAW,KACS,GAApB,UAAU,QACZ,EAAmB,UAAU,GAC7B,EAAW,UAAU,IACQ,GAApB,UAAU,QAAe,UAAU,aAAc,YAC1D,EAAmB,UAAU,GACA,GAApB,UAAU,QAAsC,mBAAhB,UAAU,KACnD,EAAW,UAAU,IAIvB,KAAK,MAAQ,GAEb,KAAK,SACH,IACC,EAAmB,EAAiB,SAAW,SAAU,GAAI,GAEhE,KAAK,eAAiB,WAAa,EAInC,KAAK,WAAa,EAAmB,EAAiB,WAAa,KAEnE,KAAK,WAAa,EAAmB,IAAI,EAAiB,YAAc,GAGxE,KAAK,YAAc,GAGnB,KAAK,eAAiB,EAClB,EAAiB,eACjB,eAGJ,KAAK,uBAAyB,YAAY,YAAY,IACxD,CAEA,OAAA,GACE,MAAO,CACL,8BACA,KAAK,MAAM,OACX,IACA,kBACA,QAAQ,KAAK,gBACb,KACA,KAAK,GACT,CAGA,IAAA,CAAK,EAAG,GAEN,OADA,KAAK,MAAM,GAAK,EACT,EAAI,CACb,CAKA,UAAA,CAAW,GAET,IADA,IAAI,EAAI,GACC,EAAI,EAAG,EAAI,EAAG,IACrB,EAAE,GAAK,KAAK,MAAM,GAEpB,MAAO,CACL,MAAO,EACP,WAAY,KAAK,WACjB,WAAY,IAAI,KAAK,YACrB,YAAa,IAAI,KAAK,aAE1B,CAKA,aAAA,CAAc,GACZ,MAAM,EAAI,EAAM,MACV,EAAI,EAAE,OACZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACrB,KAAK,MAAM,GAAK,EAAE,GAKpB,OAHA,KAAK,WAAa,EAAM,WACxB,KAAK,WAAa,IAAI,EAAM,YAC5B,KAAK,YAAc,IAAI,EAAM,aACtB,CACT,CAMA,oBAAA,CAAqB,EAAG,GAEtB,IAAI,EAAK,KAAK,KAAK,EAAG,GACtB,OAAO,KAAK,QACV,CAAC,SAAU,KAAK,WAAW,GAAK,KAAK,wBACrC,EACA,EACA,MACC,EAEL,CAOA,UAAA,CAAW,EAAG,EAAG,GACf,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,IACtB,KAAK,UAAU,EAAG,EAAI,EAAI,EAAG,KAAK,MAAM,EAAG,IAE7C,OAAO,EAAI,EAAI,CACjB,CAEA,KAAA,CAAM,EAAG,GACP,OAAO,KAAK,MAAM,EAAI,EAAI,EAC5B,CAGA,SAAA,CAAU,EAAG,EAAG,GACd,KAAK,MAAM,EAAI,EAAI,GAAK,CAC1B,CAGA,OAAA,CAAQ,EAAM,EAAQ,EAAG,EAAG,GAC1B,MAAM,EAAW,GACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACrB,EAAS,GAAK,KAAK,MAAM,EAAG,GAG9B,OAAO,IAAI,QAAQ,EAAM,EAAU,GADF,GAAX,EAAe,OAAS,EAEhD,CAGA,aAAA,CAAc,EAAG,EAAG,EAAG,EAAG,GACxB,IAAI,EACA,EAEJ,GAAI,KAAK,OACP,EAAS,KAAK,WACT,KAAI,YAAY,OAEhB,OADL,EAAS,YAAY,MACV,CAET,IACF,EAAQ,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,MAAO,KAAK,OACpD,EAAO,KAAK,GAEhB,CAQA,QAAA,CAAS,EAAG,EAAG,EAAG,EAAG,GAInB,IAHA,IAAI,EAAM,OAOR,OAFA,KAAK,cAAc,EAAG,EAAG,EAAG,EAAG,GAEvB,EAAE,IACR,IAAK,OACH,OAAO,EACT,IAAK,cACH,IAAI,EAAI,EAAE,GACR,EAAI,EAAE,GACR,EAAI,KAAK,MAAM,EAAG,EAAI,GACtB,KAAK,WAAa,SAClB,MACF,IAAK,aACC,EAAI,EAAE,GACR,EAAI,EAAE,GACR,EAAI,EAAE,SAAS,GACf,KAAK,WAAa,SAClB,MACF,IAAK,eACH,IAAI,EAAM,EAAE,GACV,EAAI,EAAE,GACR,GAAI,OAAO,eAAe,GAAM,IAAI,EAAM,OAAO,OAC5C,KAAI,QAAQ,eAAe,GAC3B,MAAM,IAAI,UAAU,4BAA8B,QAAQ,IADrB,EAAM,QAAQ,EACY,CAEpE,EAAI,EACJ,KAAK,WAAa,GAAO,SACzB,MACF,IAAK,WACC,EAAI,EAAE,GACV,EAAI,EAAE,GACN,MACF,IAAK,WACH,IAAI,EAAM,EAAE,GACV,EAAI,EAAE,GACR,EAAI,EACJ,KAAK,WAAa,SAClB,MACF,IAAK,QACH,IAAI,EAAK,EACL,EAAI,EAAG,GAET,GADA,EAAI,EAAG,GACA,EAAG,IAEV,GADA,EAAI,EAAG,GACE,EAAG,IACd,EAAI,KAAK,QAAQ,EAAM,EAAG,EAAG,EAAG,GAChC,GAAK,EACL,MACF,IAAK,MACC,EAAI,EAAE,GACR,EAAI,EAAE,GACR,KAAK,UAAU,EAAG,EAAI,EAAG,CAAC,KAAK,MAAM,EAAG,EAAI,KAC5C,MACF,IAAK,OACH,IAAI,EAAQ,EAAE,GACZ,EAAQ,EAAE,GACZ,GAAU,IAAN,EAAc,EAAQ,EAC1B,MACF,IAAK,gBACH,IAAI,EAAO,EAAE,GACX,EAAI,EAAE,GACR,IAAK,OAAO,eAAe,KAAU,QAAQ,eAAe,GAC1D,MAAM,IAAI,UACR,oBAAsB,EAAO,oBAGjC,OAAO,GAAQ,EACf,EAAI,MACJ,MACF,IAAK,eACC,EAAI,EAAE,GACR,EAAI,EAAE,GACE,KAAK,MAAM,EAAG,EAAI,GACxB,GAAK,EACT,EAAI,MACJ,MACF,IAAK,cACC,EAAI,EAAE,GACR,EAAI,EAAE,GACE,EAAE,SAAS,GACjB,GAAK,EACT,EAAI,MACJ,MACF,IAAK,QACC,EAAI,EAAE,GACR,EAAI,EAAE,GACR,EAAI,KAAK,qBAAqB,EAAG,GACjC,MACF,IAAK,SACH,IAAI,EAAQ,EAAE,GACZ,EAAK,EAAE,GACL,EAAO,KAAK,uBACZ,EAAU,YAAY,YAAY,YAAY,EAAM,GACxD,EAAI,YAAY,YAAY,YAAY,EAAS,CAC/C,cACA,EACA,CAAC,SAAU,KAEb,MACF,IAAK,SACC,EAAQ,EAAE,GACZ,EAAI,CAAC,UACP,EAAI,KAAK,cAAc,GACvB,MACF,IAAK,QACC,EAAM,EAAE,GACZ,EAAI,EAAE,GACN,EAAI,KAAK,KAAK,EAAK,KAAK,KAAK,EAAG,KAAK,KAAK,EAAG,KAC7C,KAAK,YAAY,KAAK,YAAY,QAAU,EAC5C,MACF,IAAK,WACC,EAAI,EAAE,GACV,EAAI,KAAK,KAAK,EAAG,GACjB,MACF,IAAK,QACC,EAAI,EAAE,GACR,EAAI,EAAE,GADR,IAII,EAAS,KAAK,MAAM,EAAG,EAAI,GAE/B,EAAI,KAAK,WAAW,EAAG,EAAQ,GAC/B,MACF,IAAK,mBACH,KAAK,YAAY,KAAK,YAAY,OAAS,KAC3C,EAAI,CAAC,SAAS,OAAO,EAAE,MAAM,IAC7B,MACF,IAAK,QACH,IAAI,EAAO,EAGX,KAAK,WAAW,KAAK,KAAK,YACtB,KAAK,WAAW,OAAS,KAAK,gBAKhC,KAAK,WAAW,QAKd,EAAS,KAAK,MAAM,EAAG,GAC3B,GAAI,UAAU,GAAO,CACnB,EAAI,EACJ,EAAI,EAAK,KAGT,MAAM,EAAS,EAAK,OACpB,GAAI,GAAU,EAAG,CAKf,IADA,IAAI,EAAK,IACA,EAAI,IAAU,GAAK,GAC1B,EAAK,IAAI,KAAK,KAAK,MAAM,EAAG,EAAI,GAAI,GAEtC,GAAI,GAAU,EAAQ,CAMpB,IAAS,EAAI,EAAG,EAAI,EAAS,EAAG,IAC9B,KAAK,UAAU,EAAG,EAAI,EAAG,KAAK,MAAM,EAAG,IAEzC,IAEA,KAAK,UAAU,EAAG,EAAG,KAAK,MAAM,EAAG,GAAK,EAC1C,CACA,KAAK,UAAU,EAAG,EAAS,EAAG,EAChC,MAKE,QACyB,IAAvB,EAAK,eACL,GAAU,EAAK,cACf,CACA,IAAI,EACF,4BACA,EACA,eACA,EAAK,cACP,MAAM,IAAI,UAAU,EACtB,CAEF,EAAI,EACJ,EAAI,CACN,KAAO,MAAI,aAAgB,UA2DzB,MAAM,IAAI,UAAU,QAAQ,GAAQ,sBAxDpC,IAAI,EAAO,GACX,IAAS,EAAI,EAAG,EAAI,EAAQ,IAAK,EAAK,KAAK,KAAK,MAAM,EAAG,EAAI,IAG7D,IAAI,EAAS,EAAK,EAAM,MAExB,GAAI,aAAkB,MAAO,CAE3B,IAAI,EAAQ,EAGZ,OAFA,EAAM,UAAU,KAAM,CAAC,UAAW,EAAG,EAAG,GACxC,EAAM,QACC,CACT,CAAO,GAAI,aAAkB,KAAM,CAWjC,IAAI,EAAa,CACf,QACA,CACE,WACA,CACE,WACA,EACA,CAAC,WAAY,CAAC,WAAY,EAAO,MAAO,CAAC,aAG7C,CAAC,WAEC,EAAY,CACd,WACA,EAAO,KAAK,OACZ,CACE,WACA,CAAC,WAAY,EAAO,KAAM,CAAC,QAAS,EAAO,KAAK,WAQpD,EAAI,CAAC,QALW,EAAO,KAAK,QAAO,SAAU,EAAK,GAGhD,MAAO,CAAC,WAAY,EAAK,CAAC,WAAY,GACxC,GAAG,GACsB,EAC3B,MAEE,EAAI,EACJ,EAAI,CAAC,SAKT,CACA,MACF,IAAK,SAEH,IACI,EAAK,GADL,EAAI,KAAK,MAAM,EAAG,IAErB,EAAI,KAAK,MAAM,EAAI,GACjB,EAAI,KAAK,MAAM,EAAI,GACnB,EAAI,KAAK,MAAM,EAAI,GACnB,EAAI,EAAK,EAAI,EAGhB,IAAI,EAAS,EAAI,KAAK,YAAY,KAAK,YAAY,OAAS,GAC5D,KAAK,WAAW,QAAQ,GACxB,KAAK,YAAY,MACjB,MACF,QACE,MAAM,IAAI,IAAI,yBAA2B,EAAE,IAQjD,OAAO,CACT,CAGA,QAAA,CAAS,EAAK,GACZ,KAAK,WAAa,GAClB,KAAK,OAAS,IAAI,OAAO,GACzB,KAAK,SAAW,IAAI,SAChB,IAAgB,KAAK,eAAiB,GAI1C,KAAK,QAAS,EACd,KAAK,WAAa,GAElB,IACE,OAAO,KAAK,QAAO,EACrB,CAAE,MAAO,GAEP,OADA,EAAE,QAAU,EAAE,QAAU,KAAO,KAAK,WAAW,KAAK,MAAQ,IACrD,KAAK,SAAS,EACvB,CACF,CAIA,MAAA,CAAO,EAAW,EAAG,EAAG,EAAG,EAAG,GAG5B,IAFA,IAAI,EAAM,QAED,CACP,GAAI,EACF,EAAM,KAAK,SAAS,EAAG,EAAG,EAAG,EAAG,GAChC,GAAY,MACP,CACL,IAAK,KAAK,OAAQ,MAClB,IAAI,EAAO,KAAK,OAAO,YACvB,GAAI,IAAS,OAAO,IAAK,MAGzB,EAAO,SAAS,OAAO,GAGvB,MAAM,EAAS,KAAK,SAAS,IAAI,GAGjC,EAAM,KAAK,SAAS,EAAM,EAAO,GAAI,EAAG,GAAI,EAC9C,CAEA,GAAI,aAAe,MAEjB,OAAO,CAEX,CAIA,OADA,KAAK,eAAe,GACb,CACT,CAGA,eAAA,CAAgB,GACd,KAAK,WAAa,GAClB,KAAK,QAAS,EACd,KAAK,WAAa,GAClB,IACE,MAAM,EAAM,KAAK,SAAS,MAAO,EAAO,GAAI,EAAG,GAAI,GAInD,OAHM,aAAe,OACnB,KAAK,eAAe,GAEf,CACT,CAAE,MAAO,GAEP,OADA,EAAE,QAAU,EAAE,QAAU,KAAO,KAAK,WAAW,KAAK,MAAQ,IACrD,KAAK,SAAS,EACvB,CACF,CAGA,cAAA,CAAe,EAAS,GACtB,IAAS,EAAO,IAQhB,IAPA,IAAI,EAAS,EAAK,OAEd,EAAI,CACN,WACA,EACA,CAAC,WAAY,CAAC,WAAY,EAAS,CAAC,YAE7B,EAAI,EAAG,EAAI,EAAQ,IAAK,EAAI,CAAC,WAAY,EAAK,GAAI,CAAC,WAAY,IAExE,OAAO,KAAK,SAAS,EAAS,CAAC,QAAS,EAAG,CAAC,SAAU,EAAG,EAAS,EACpE,CAGA,OAAA,CAAQ,GACN,IAAI,EAAM,YAAY,KAAK,GAE3B,OADU,SAAS,QAAQ,EAE7B,CAGA,mBAAA,CAAoB,EAAQ,GAC1B,KAAK,uBAAyB,IAAI,YAAY,YAC5C,KAAK,uBACL,EACA,EAEJ,CAEA,kBAAA,CAAmB,EAAQ,GACzB,KAAK,uBAAyB,KAAK,uBAAuB,MAC5D,EAIF,YAAY,KAAO,SAAU,GAC3B,IACI,EADS,IAAI,OAAO,GACT,YACf,OAAO,GAAK,OAAO,IAAM,IAAM,CACjC,EAEA,YAAY,OAAS,WACnB,KAAM,gDACR,EAMA,YAAY,YAAc,MACxB,WAAA,CAAY,EAAQ,EAAQ,GAE1B,KAAK,OAAS,EAEd,KAAK,OAAS,EAEd,KAAK,MAAQ,CACf,GAKF,YAAY,YAAY,KAAO,CAAE,EAAG,iBAGpC,YAAY,YAAY,YAAc,SAAU,EAAM,GAGpD,IADA,IAAI,EAAY,CAAC,GACV,IAAS,YAAY,YAAY,MACtC,EAAO,EAAK,OACZ,EAAU,KAAK,GAMjB,IAFA,IACI,EADA,EAAU,KAED,CACX,IAAI,EAAU,EAAU,MAAK,SAAU,GACrC,OAAO,IAAS,CAClB,IACA,GAAI,EAAS,CACX,EAAS,EACT,KACF,CACA,EAAQ,KAAK,GACb,EAAK,EAAG,MACV,CAIA,IADA,IAAI,EAAM,GACD,EAAI,EAAG,EAAI,EAAU,QACxB,EAAU,KAAO,EADe,IAEpC,EAAI,KAAK,EAAU,GAAG,OASxB,OALA,EAAQ,UACR,EAAQ,SAAQ,SAAU,GACxB,EAAI,KAAK,EAAK,OAChB,IAEO,CACT,EAGA,YAAY,YAAY,YAAc,SAAU,EAAS,GACvD,OAAO,EAAQ,aAAY,SAAU,EAAK,GACxC,MAAO,CACL,QACA,CAAC,WAAY,EAAG,CAAC,WAAY,CAAC,WAAY,EAAQ,CAAC,YACnD,EAEJ,GAAG,EACL,EAKA,MAAM,YACJ,WAAA,CAAY,EAAM,GAChB,KAAK,IAAM,CAAC,EAAM,EACpB,CAGA,OAAA,GACE,OAAO,KAAK,IAAI,EAClB,CAGA,KAAA,GACE,IAAK,KAAK,UACR,MAAM,IAAI,IAAI,sCAEhB,OAAO,KAAK,IAAI,EAClB,CAEA,KAAA,GACE,GAAI,KAAK,UACP,MAAM,IAAI,IAAI,wCAEhB,OAAO,KAAK,IAAI,EAClB,CAEA,WAAA,CAAY,GACV,KAAK,IAAI,GAAK,EAAY,IAAI,GAC9B,KAAK,IAAI,GAAK,EAAY,IAAI,GAC9B,EAAY,IAAM,KAAK,GACzB,EAGF,MAAM,UAAY,SAAU,GAC1B,OAAO,aAAe,WACxB,EAGA,YAAY,MAAQ,SAAU,GAC5B,OAAO,IAAI,aAAY,EAAO,EAChC,EAEA,YAAY,KAAO,SAAU,GAC3B,OAAO,IAAI,aAAY,EAAM,EAC/B,EASA,MAAM,YAAc,SAAU,EAAO,EAAK,EAAK,GAC7C,GAAI,EAAM,EACR,MACQ,IAAI,UADR,GAAO,GAAO,EAEd,EACE,0CACA,EACA,SACA,EACA,IAIF,EAAQ,kCAAoC,EAAM,SAAW,EAAM,KAElE,GAAI,GAAO,EAAM,EACtB,MAAM,IAAI,UACR,EAAQ,kCAAoC,EAAM,SAAW,EAAM,IAEzE,EAEM,eAAiB,SAAU,EAAO,EAAK,EAAK,GAChD,IAAI,EAAI,SAAU,EAAI,GAEpB,OADA,YAAY,EAAO,EAAG,OAAQ,EAAK,GAC5B,EAAK,EAAI,EAClB,EAEA,EAAY,MAAI,EAChB,EAAW,QAAI,WACb,OAAO,KAAK,KACd,EACA,QAAQ,GAAS,CACnB,EAEM,cAAgB,SAAU,EAAO,GACjC,QAAQ,GACN,MAAM,QAAQ,GAChB,EAAQ,KAAI,SAAU,GACpB,cAAc,EAAO,EACvB,IAC4B,iBAAZ,EAChB,QAAQ,GAAW,QAAQ,GAE3B,QAAQ,MACN,yCAEE,EACA,MACA,EAAQ,YAId,QAAQ,MACN,2BAEE,EAFF,uCAON,EAEM,cAAgB,SAAU,EAAO,GACrC,IAAI,EAAI,IAAI,OAAO,EAAO,GAC1B,QAAQ,GAAS,CACnB,EAEM,eAAiB,SAAU,EAAO,EAAK,EAAK,IAChD,IAAI,aAAc,SAAS,WAAa,EAAQ,IAAM,EAAM,MAC9D,EASM,cAAgB,mBAAmB,UAAU,SAAU,GAC3D,MAAqB,iBAAP,GAAmB,aAAe,OAClD,IAEM,eAAiB,mBAAmB,WAAW,SAAU,GAC7D,MAAqB,iBAAP,GAAmB,EAAM,GAAK,CAC9C,IAEM,YAAc,mBAAmB,eAAe,SAAU,GAC9D,MAAqB,iBAAP,CAChB,IAEM,eAAiB,aAAY,SAAU,EAAO,EAAK,EAAM,GAC7D,GAAkB,iBAAP,GAAmB,GAAO,KAAK,MAAM,GAC9C,MAAM,IAAI,UACR,gCAA6C,SAAS,IAI1D,GAAI,EAAM,GAAQ,EAAK,EACrB,MAAM,IAAI,UACR,8BAGE,EACA,QACA,EACA,aACA,SAAS,GAGjB,IAEM,cAAgB,mBAAmB,SAAU,UAC7C,YAAc,mBAAmB,YAAa,QAC9C,cAAgB,mBAAmB,SAAU,UAC7C,YAAc,mBAAmB,OAAQ,QACzC,YAAc,mBAAmB,OAAQ,QACzC,YAAc,mBAAmB,OAAQ,QACzC,cAAgB,mBAAmB,SAAU,UAC7C,iBAAmB,mBAAmB,YAAa,aACnD,yBAA2B,mBAC/B,oBACA,oBAEI,eAAiB,mBAAmB,UAAW,WAE/C,gBAAkB,mBAAmB,sBAAuB,YAC5D,eAAiB,mBAAmB,iBAAkB,WACtD,iBAAmB,mBAAmB,sBAAsB,SAChE,GAEA,OAAO,UAAU,IAAQ,WAAW,EACtC,IAEM,YAAc,mBAAmB,QAAQ,SAAU,GAGvD,OAAO,aAAe,IACxB,IAUM,OAAS,aAAY,SAAU,EAAO,EAAS,EAAS,GAC5D,IAAK,EACH,MAAM,IAAI,WAAW,GAAU,GAAS,KAAO,EAEnD,IAUM,UAAY,SAAU,EAAO,EAAK,GACtC,IAAI,EACF,EACA,oDACA,EAFA,gBAKA,EACA,WACF,QAAQ,KAAK,EACf,EAcM,eAAiB,SAAU,GAC/B,cAAc,GAEd,IAAI,EAAa,EAAI,MAAM,KAE3B,GAA0B,IAAtB,EAAW,OAAc,OAAO,EAEpC,IAAI,EAAU,EAAW,GACrB,EAAY,EAAW,GAEvB,EAAM,cAAc,EAAS,IAC7B,EAAQ,cAAc,EAAW,IAErC,OAAY,IAAR,IAA2B,IAAV,MAEjB,GAAS,IAEN,EAAM,EACf,EAQM,0BAA4B,SAAU,EAAK,GAI/C,GAHA,cAAc,GACd,eAAe,GAEX,EAAM,GAAK,EAAM,GAAI,OAAO,EAEhC,IAEI,EAFc,uCAEc,MAAM,EAAG,GAGzC,OAFgB,IAAI,OAAO,UAAiB,EAAgB,MAAO,MAElD,KAAK,EACxB,EASM,cAAgB,SAAU,EAAK,GAInC,GAHA,cAAc,GACd,eAAe,GAEX,EAAM,GAAK,EAAM,GAAI,OAAO,EAEhC,IAAK,0BAA0B,EAAK,GAAM,OAAO,EAEjD,IAAI,EAAM,SAAS,EAAK,GAExB,OAAI,OAAO,MAAM,IAEV,CACT,EAgBM,wBAA0B,SAAU,GACxC,cAAc,GAKd,SAHgB,uCAGF,KAAK,KAFJ,oDAEqB,KAAK,KAElC,0BAA0B,EAAK,GACxC,EAQM,YAAc,SAAU,GAG5B,GAFA,cAAc,IAET,wBAAwB,GAAM,OAAO,EAE1C,IAAI,EAAM,IAAI,OAAO,GAAK,UAE1B,OAAI,OAAO,MAAM,OAEZ,OAAO,SAAS,IAEd,EACT,EAiBM,YAAc,CAWpB,SAAuB,MAKrB,WAAA,CAAY,GACV,KAAK,QAAU,IAAI,IAAI,IAAI,GAC7B,CAGA,QAAA,GACE,OAAO,IAAI,YAAY,QAAQ,KAAM,KAAK,QAC5C,CAMA,OAAA,GAGE,OAAQ,IACN,cAAc,EAAG,GAAI,sBACrB,IAAI,EAAM,KAAK,QAAQ,QAAQ,EAAG,IAClC,OAAgB,IAAT,GAAqB,CAAG,CAEnC,CAIA,YAAA,GAGE,OAAQ,IACN,YAAY,EAAG,GAAI,0BACnB,IAAI,EAAU,EAAG,GAAG,WAKpB,OAJA,EAAQ,SAAQ,SAAU,GACxB,cAAc,EAAK,yBACrB,IAEO,IAAI,YAAY,QAAQ,KAAM,EAAQ,CAEjD,GAUF,QAAsB,MASpB,WAAA,CAAY,EAAW,GACrB,KAAK,UAAY,EACjB,KAAK,QAAU,EAAU,QAAQ,QAAQ,GAAQ,EAAQ,SAAS,IACpE,CAGA,WAAA,GACE,OAAO,cAAc,KAAK,QAC5B,CAIA,SAAA,CAAU,GACR,OAAO,KAAK,QAAQ,SAAS,EAC/B,CAOA,SAAA,CAAU,GAER,OAAI,KAAK,QAAQ,MAAM,IAAS,EAAM,QAAQ,SAAS,OAKnD,KAAK,YAAc,EAAM,WAGpB,KAAK,UAAU,QAAQ,OAAO,GACnC,EAAM,UAAU,QAAQ,SAAS,KAGvC,CAQA,QAAA,CAAS,GACP,OAAO,KAAK,UAAU,IAAU,EAAM,UAAU,KAClD,CAKA,KAAA,CAAM,GACJ,IAAI,EAAO,KAAK,UAAU,QAAQ,QAC/B,GAAQ,KAAK,QAAQ,SAAS,IAAQ,EAAM,QAAQ,SAAS,KAEhE,OAAO,IAAI,YAAY,QAAQ,KAAK,UAAW,EACjD,CAKA,YAAA,CAAa,GACX,IAAI,EAAO,KAAK,QAAQ,QAAQ,GAAQ,EAAM,QAAQ,SAAS,KAC/D,OAAO,IAAI,YAAY,QAAQ,KAAK,UAAW,EACjD,CAKA,UAAA,CAAW,GACT,IAAI,EAAO,KAAK,QAAQ,QAAQ,IAAS,EAAM,QAAQ,SAAS,KAChE,OAAO,IAAI,YAAY,QAAQ,KAAK,UAAW,EACjD,CAIA,UAAA,GACE,IAAI,EAAO,KAAK,UAAU,QAAQ,QAC/B,IAAS,KAAK,QAAQ,SAAS,KAElC,OAAO,IAAI,YAAY,QAAQ,KAAK,UAAW,EACjD,CAKA,UAAA,CAAW,GACT,IAAI,EAAO,KAAK,QAAQ,QAAQ,GAC9B,EAAM,UAAU,QAAQ,SAAS,KAEnC,OAAO,IAAI,YAAY,QAAQ,EAAM,UAAW,EAClD,CAGA,QAAA,GACE,MAAO,aAAe,QAAQ,KAAK,SAAW,GAChD,IAGI,UAAY,SAAU,GAC1B,OAAO,aAAe,YAAY,OACpC,EAEM,gBAAkB,mBAAmB,WAAY,WAKjD,QAAU,SAAU,EAAO,GAC/B,MAAM,EAAQ,EAAM,UACpB,EAAM,SAAS,IAEb,EAAM,WAAa,GAAQ,EAAM,GAEjC,EAAM,GAAQ,WAOZ,OANK,KAAK,eAAe,UAAY,KACnC,KAAK,UAAY,GAAQ,KAAK,WAAa,GAAM,MAC/C,KACA,MAAM,KAAK,aAGR,KAAK,UAAY,EAC1B,CAAC,GAEL,EACA,QAAQ,YAAY,QAAS,CAAC,gBAC9B,QAAQ,YAAY,SAAU,CAAC,WAAY,UAAW,iBAatD,MAAM,OACJ,WAAA,CAAY,EAAK,GACf,iBAAiB,EAAK,cAEtB,KAAK,IAAM,EACX,KAAK,OAAS,CAChB,CAEA,GAAA,CAAI,GACF,OAAO,KAAK,OAAO,EACrB,CAEA,GAAA,CAAI,EAAG,GACL,KAAK,OAAO,GAAK,CACnB,CAEA,QAAA,GACE,IAAI,EAAW,SAAS,KAAK,QAC7B,MAAO,YAAc,KAAK,IAAI,KAAO,IAAM,EAAW,GACxD,EAGF,MAAM,SAAW,SAAU,GACzB,OAAO,aAAa,MACtB,EAGA,OAAO,cAAgB,CAAC,EAExB,OAAO,YAAc,SAAU,EAAU,EAAK,GAC5C,OAAQ,OAAO,cAAc,GAAY,CAAE,IAAK,EAAK,GAAI,EAC3D,EAEA,OAAO,SAAW,SAAU,GAC1B,OAAO,OAAO,cAAc,EAC9B,EAKA,OAAO,IAAM,MAEX,WAAA,CAAY,EAAM,EAAY,EAAK,EAAQ,EAAQ,GACjD,KAAK,KAAO,EACZ,KAAK,WAAa,EAClB,KAAK,cAAgB,EAEjB,GACF,KAAK,IAAM,EACX,KAAK,YAAa,IAElB,KAAK,IAAM,KAAK,oBAChB,KAAK,YAAa,GAGpB,KAAK,SAAW,EAChB,KAAK,OAAS,EAAW,UAAY,EAErC,KAAK,OAAS,EAAO,KAAI,SAAU,GACjC,MAAO,CAAE,KAAM,EAAM,GAAI,UAAW,EAAM,GAC5C,GACF,CAIA,UAAA,CAAW,GAGT,IAFA,IAAI,EAAQ,KAAK,eAER,EAAM,KAAK,WAAY,EAAK,EAAM,EAAI,WAC7C,EAAQ,EAAI,eAAiB,EAG/B,OAAO,EAAM,EACf,CAEA,YAAA,GACE,OAAO,KAAK,OAAO,KAAI,SAAU,GAC/B,OAAO,EAAK,IACd,GACF,CAEA,iBAAA,GACE,OAAO,IAAI,SAAS,mBACtB,CAEA,QAAA,GACE,MAAO,cAAgB,KAAO,GAChC,GAGF,OAAO,IAAI,qBAAuB,CAAC,EACnC,MAAM,WAAa,SAAU,GAC3B,OAAO,aAAa,OAAO,GAC7B,EAKA,OAAO,GAAK,MACV,WAAA,CAAY,EAAK,EAAW,GAC1B,KAAK,OAAO,EAAK,EAAW,GAC5B,KAAK,IAAM,EACX,KAAK,UAAY,EACb,GACF,KAAK,qBAAsB,EAC3B,KAAK,SAAW,IAEhB,KAAK,qBAAsB,EACvB,EAAI,WACN,KAAK,SAAW,KAAK,sCAClB,KAAK,SAAW,KAAK,mCAE9B,CAEA,MAAA,CAAO,EAAK,EAAW,GACrB,GAAI,EAAI,cAAgB,EACtB,MAAM,IAAI,MAAM,0DAElB,GAAI,GAAa,EAAI,YAAc,EAAU,KAAO,EAAI,WACtD,MAAM,IAAI,MACR,+DAGJ,GAAI,EAAI,aAAe,GAAa,EAClC,MAAM,IAAI,MACR,kEAGJ,GAAI,GAAa,EAAU,sBAAwB,EACjD,MAAM,IAAI,MACR,iFAEN,CAEA,gCAAA,GAGE,OAAO,SAAU,GACf,IAAI,EAAI,EAAG,GAEX,OADA,iBAAiB,EAAG,0BACb,CACT,CACF,CAEA,mCAAA,GAKE,IAAI,EAAM,KAAK,IACf,OAAO,SAAU,GACf,IAAI,EAAI,EAAG,GACX,iBAAiB,EAAG,uBAuBpB,OArBW,SAAU,GACnB,IAAI,EAAU,EAAI,OAAO,OACrB,EAAgB,EAAK,OAAS,EAE9B,EAAkB,EAAK,MAAM,EAAG,GAChC,EAAY,EAAK,MAAM,GAG3B,OAAO,IAAI,KAAK,EAAG,GAAiB,SAAU,GAC5C,IAAI,EAAI,EAAG,GAIX,OAHA,iBAAiB,EAAG,uBAGb,IAAI,KAAK,EAAG,GAAW,SAAU,GACtC,IAAI,EAAS,EAAG,GAGhB,OAFA,cAAc,EAAQ,4BAEf,CACT,GACF,GACF,CAEF,CACF,CAEA,QAAA,GACE,MAAO,cAAgB,KAAK,IAAI,KAAO,GACzC,CAEA,kBAAA,GACE,IAAI,EAAmB,KAAK,UACxB,KAAK,QAAQ,GAAI,KAAK,KACtB,KAAK,UAGT,OAFA,EAAmB,EAAiB,KAAK,MAElC,IAAI,KAAK,KAAK,SAAU,CAAC,IAAmB,SAAU,GAC3D,IAAI,EAAO,EAAG,GAEd,OADA,iBAAiB,EAAM,sBAChB,CACT,GACF,CAGA,OAAA,GACE,OAAO,SAAU,GACf,OAAO,IAAI,OAAO,KAAK,IAAK,EAE9B,CACF,CAKA,OAAA,CAAQ,EAAiB,GACvB,IAAI,EAAY,KAAK,UAErB,OAAI,EAEM,SAAU,GAiBhB,OAfQ,SAAU,GAChB,IAAI,EAAS,GAAG,OAAO,EAAW,IAAI,OAAO,GACzC,EAAW,EAAU,QAAQ,EAAQ,GAEzC,OAAO,IAAI,KAAK,EAAU,SAAU,CAAC,IAAW,SAAU,GACxD,IAAI,EAAO,EAAG,GAGd,OAFA,iBAAiB,EAAM,WAEhB,IAAI,KAAK,EAAM,GAAY,SAAU,GAC1C,IAAI,EAAS,EAAG,GAEhB,OADA,cAAc,GACP,CACT,GACF,GACF,CAEF,EAGQ,SAAU,GAChB,IAAI,EAAS,EAAU,OAAO,GAC9B,OAAO,IAAI,OAAO,EAAK,EAEzB,CAGJ,GAGF,MAAM,WAAa,SAAU,GAC3B,OAAO,aAAa,OAAO,EAC7B,EAEM,cAAgB,mBAAmB,SAAU,UAC7C,iBAAmB,mBACvB,yBACA,YAEI,iBAAmB,mBACvB,gCACA,YAMF,MAAM,OACJ,WAAA,CAAY,GACV,KAAK,QAAU,CACjB,CAEA,QAAA,GACE,MAAO,YAAc,KAAK,QAAQ,IAAI,UAAU,KAAK,KAAO,GAC9D,EAGF,MAAM,QAAU,CAAC,EAIjB,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,OADA,cAAc,EAAG,IACV,OAAO,EAAG,GACnB,IACA,MAAM,aAAe,SAAU,GAC7B,OAAO,EAAK,IAAI,SAAS,KAAK,KAChC,EACA,eAAe,UAAW,EAAG,MAAM,SAAU,GAC3C,OAAO,aAAa,EACtB,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAE5C,OADA,QAAQ,KAAK,aAAa,IACnB,KACT,IAUA,MAAM,UAAY,SAAU,GAC1B,QAAQ,GACN,IAAqB,iBAAT,GACM,iBAAT,IACE,IAAT,IACS,IAAT,EACA,OAAO,EACT,KAAK,MAAM,QAAQ,GACjB,OAAO,cAAc,EAAK,IAAI,YAChC,IAAoB,iBAAR,EACV,IAAI,EAAK,IACT,IAAK,MAAM,KAAO,EAChB,EAAK,IAAI,KAAK,IAAI,KAAK,EAAK,UAAU,EAAK,KAAQ,GAErD,OAAO,EACT,QACE,MAAM,IAAI,MACR,gDAAkD,QAAQ,IAGlE,EACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAO,UAAU,EAAG,GACtB,IAGA,eAAe,eAAgB,EAAG,MAAM,SAAU,GAChD,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAC7B,EAAG,GAAG,KAAK,EAAG,IAEhB,OAAO,EAAG,EACZ,IAQA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAO,EAAG,EACZ,IAKA,cAAc,QAAQ,SAAU,GAC9B,IAAI,EAAS,EAAE,IAAI,IACnB,OAAO,KACL,IAAI,SACJ,KAAK,IAAI,QAAS,EAAQ,KAAK,IAAI,KAAM,EAAQ,IACjD,EAEJ,IAKA,cAAc,QAAQ,SAAU,GAC9B,IAAI,EAAS,EAAE,IAAI,IACnB,OAAO,KACL,IAAI,SACJ,KAAK,IAAI,QAAS,EAAQ,KAAK,IAAI,KAAM,EAAQ,IACjD,EAEJ,IAIA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,WAAW,KAAK,GAC/B,IAEA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAG7C,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,cAAc,EAAG,GAAG,MAAM,EAAG,IACtC,IAEA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,YAAY,EAAG,IACf,IAAI,EAAQ,GAKZ,OAJI,EAAG,KACL,cAAc,EAAG,IACjB,EAAQ,EAAG,IAEN,EAAG,GAAG,WAAW,KAAK,EAC/B,IAIA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GACV,YAAY,GAEZ,IAAI,EAAM,GAQV,OAPA,EAAG,WACA,UACA,SAAQ,SAAU,GACjB,EAAI,KAAK,GACT,EAAI,KAAK,EACX,IACF,EAAI,MACG,cAAc,EACvB,IAEA,eAAe,iBAAkB,EAAG,MAAM,SAAU,GAClD,IAAI,EAAO,EAAG,QACZ,EAAQ,EACV,EAAM,QAAQ,aAEd,IAAI,EAAU,GACZ,EAAI,EACN,OAAO,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,IAAI,EAAO,EAAG,KAAI,SAAU,GAC1B,OAAO,EAAE,GACX,IAGA,OAFA,EAAK,QAAQ,GACb,IACO,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,SAAU,GAChB,EAAQ,KAAK,EACf,EACA,OAAQ,WACN,OAAO,cAAc,EACvB,GAEJ,IAWA,cAAc,WAAW,SAAU,GACjC,IAAI,EAAO,EAAE,IAAI,IACf,EAAS,EAAE,IAAI,IACb,EAAW,EAAK,IAClB,EAAQ,EAAK,IAAI,IACjB,EAAS,EAAK,IAAI,IAAI,IACpB,EAAS,SAET,EAAU,mBAAmB,CAC/B,CAAC,EAAQ,GACT,CAAC,EAAU,EAAG,CAAC,IAAI,KAAM,EAAU,MAEjC,EAAW,mBAAmB,CAAC,CAAC,IAAI,MAAO,EAAU,GAAS,IAElE,OAAO,IAAI,KAAK,IAAI,MAAO,IAAI,KAAK,EAAS,IAAI,KAAK,EAAU,IAClE,IAMA,IAAI,eAAiB,SAAU,EAAK,EAAM,GACxC,OAAO,EAAI,MAAK,SAAU,EAAG,GAE3B,OADY,IAAI,YAAY,GACf,eAAe,EAAM,CAAC,EAAG,GACxC,GACF,EAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,EAAI,GAInD,OAHA,iBAAiB,EAAG,IACpB,YAAY,EAAG,IAER,cAAc,eAAe,EAAG,GAAG,WAAY,EAAG,GAAI,GAC/D,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,EAAI,GAIrD,OAHA,iBAAiB,EAAG,IACpB,cAAc,EAAG,IAEV,eAAe,IAAI,EAAG,IAAK,EAAG,GAAI,EAC3C,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,EAAI,GAKtD,OAJA,iBAAiB,EAAG,IACpB,cAAc,EAAG,IAEjB,eAAe,EAAG,GAAI,EAAG,GAAI,GACtB,KACT,IAOA,IAAI,eAAiB,SAAU,EAAU,GACvC,IAAI,EAAO,GACP,GAAS,IAAI,UAAW,aAAa,GACzC,IAAe,GAAX,EAAc,EAAO,MACpB,CACH,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAC1B,EAAK,GAAK,EAAM,GAElB,EAAK,GAAK,cAAc,EAAM,MAAM,GACtC,CACA,OAAO,CACT,EACA,cAAc,gBAAgB,SAAU,GACtC,IACI,EADA,EAAO,EAAE,IAAI,IAEjB,GAAI,aAAgB,KAAM,CACxB,IAAI,EAAO,EAAK,IAChB,EAAgB,EAAK,IACrB,IAAI,EAAO,EAAE,IAAI,IACb,EAAS,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAe,GAC/D,KAAO,CACD,EAAO,EACP,EAAS,EAAE,IAAI,IAAI,IACvB,EAAgB,EAAO,IAAI,GAC7B,CAGA,IAAI,EAAM,SAAS,QAAQ,GAAQ,GACnC,GAAc,GAAV,EAAI,GACN,MAAM,IAAI,IACR,yFAEJ,IAAI,EAAM,IAAI,QAAQ,EAAI,GAAI,IAAK,OAAG,GAatC,OAXA,OAAO,EAAK,MAAQ,IAAI,OAAO,EAAK,MAAM,SAAU,GAClD,IAAI,EAAa,EAAK,WAEtB,EAAW,QAEX,IAAI,EAAO,IAAI,YACX,EAAO,eAAe,EAAe,GAEzC,OADa,EAAK,eAAe,EAAK,EAExC,IAEO,KACT,IAEA,IAAI,cAAgB,SAAU,GAC5B,GAAI,aAAa,KAAM,CAErB,KAAI,EAAE,eAAe,YAAc,OAAO,EAAE,IAAI,gBAAiB,QAI/D,MAAM,IAAI,MAAM,mBAAqB,SAAS,GAAK,oBAFnD,EADkB,OAAO,EAAE,IAAI,MACf,UAAU,EAG9B,CACA,OAAO,CACT,EACA,cAAc,gBAAgB,SAAU,GACtC,IAAI,EAAW,SAAS,OAAO,EAAE,IAAI,KACrC,OAAO,KAAK,IAAI,SAAU,EAC5B,IACA,cAAc,kBAAkB,SAAU,GACxC,IAAI,EAAW,cAAc,EAAE,IAAI,KACnC,OAAO,KAAK,IAAI,SAAU,EAC5B,IAEA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,SAAS,OAAO,EAAG,GAC5B,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,OAAO,cAAc,EAAG,GAC1B,IAEA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAa,MAAT,EAAG,GACE,UAEP,cAAc,EAAG,IACV,OAAO,EAAG,IAErB,IAIA,eAAe,QAAS,EAAG,MAAM,SAAU,GAKzC,OAJA,EAAG,KAAI,SAAU,GACf,QAAQ,KAAK,WAAW,IAAO,EACjC,IACA,QAAQ,KAAK,IACN,KACT,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,SAAS,EAAG,GACrB,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,OADA,cAAc,EAAG,IACV,YAAY,KAAK,EAAG,GAC7B,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,YAAY,EAAG,KACP,EAAG,GAAG,OAChB,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,IAAI,EAAO,EAAG,GACZ,EAAO,EAAG,GACZ,YAAY,GACZ,iBAAiB,GAEjB,IAAI,EAAgB,KAAK,eAGzB,OAFA,KAAK,eAAiB,EAEf,IAAI,KAAK,EAAM,CAAC,IAAO,SAAU,GAItC,OAHA,EAAK,QACL,KAAK,eAAiB,EAEf,EAAG,EACZ,GACF,IAIA,cAAc,QAAQ,SAAU,GAG9B,IAAI,EAAO,EAAE,IAAI,IACb,EAAO,EAAE,IAAI,IAAI,IACjB,EAAO,EAAE,IAAI,IAAI,IAErB,OAAO,IAAI,KACT,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,IAAI,KAAK,EAAM,KAAM,IACtD,IAAI,KAAK,EAAM,KAEnB,IAKA,IAAI,cAAgB,SAAU,EAAK,GACjC,KAAM,aAAe,QACnB,MAAM,IAAI,MAAM,EAAQ,8BAAgC,SAAS,GACrE,EAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,cAAc,EAAG,GAAI,kBACd,IAAI,OAAO,EAAG,GACvB,IAEA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,OAAO,EAAG,aAAc,MAC1B,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,cAAc,EAAG,GAAI,kBACd,EAAG,GAAG,WAAW,MAAM,GAAI,EACpC,IAEA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,IAAI,EAAO,EAAG,GACO,iBAAV,EAAG,KACZ,EAAO,IAAI,OAAO,EAAG,KAEvB,cAAc,EAAM,eACpB,cAAc,EAAG,GAAI,eACrB,IAAI,EAAM,EAAK,KAAK,EAAG,IACvB,OAAe,OAAR,GAAuB,cAAc,EAC9C,IAoBA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,IAAI,EAAM,EAAG,GACb,GAAmB,iBAAR,EACT,IAAI,EAAO,IAAI,OAAO,EAAK,SACtB,CACL,cAAc,GACV,EAAO,IAAI,OAAO,EAAI,OAAQ,IACpC,CAGA,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,EAAG,GAAG,QAAQ,EAAM,EAAG,GAChC,IAYA,eAAe,UAAW,EAAG,GAAG,SAAU,IACxC,OAAO,KAAK,GAAG,GACjB,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,MAAqB,iBAAV,EAAG,IAAmB,OAAO,UAAU,EAAG,IAC5C,EAAG,GAAG,EAAG,KAEhB,cAAc,EAAG,IACV,EAAG,GAAG,EAAG,GAAG,MAEvB,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAGxC,OAFA,cAAc,EAAG,IACjB,EAAG,GAAG,EAAG,IAAM,EAAG,GACX,KACT,IAGA,eAAe,UAAW,EAAG,MAAM,SAAU,GAC3C,IAAI,EAAU,EAAG,QACjB,gBAAgB,GAGhB,OAAO,EAAQ,MADA,KACgB,EACjC,IAEA,eAAe,YAAa,EAAG,MAAM,SAAU,GAC7C,IAAI,EAAS,EAAG,QACZ,EAAY,EAAG,QAKnB,GAAI,EAAO,GAAY,OAAO,EAAO,GAAW,MAAM,EAAQ,GACzD,MAAM,IAAI,MAAM,uBAAyB,EAAY,kBAC5D,IAiBA,eAAe,gBAAiB,EAAG,MAAM,SAAU,GAAI,MACrD,IAAI,SAAW,GAAG,QAEd,SAAS,YACX,SAAW,KAAK,SAAS,OAG3B,IAAI,EAAI,SA8CR,OA3CA,GAAG,SAAQ,SAAU,GACnB,GAAI,SAAS,GAEX,EAAI,EAAE,EAAS,UACV,KAAI,OAAO,GAgChB,MAAM,IAAI,UACR,+DACE,QAAQ,IAhCZ,IAAI,EAAO,EAAS,WAEpB,cAAc,EAAK,IACnB,IAAI,EAAS,EAAK,QAAQ,KAmB1B,GAhBA,EAAO,EAAK,KAAI,SAAU,GACxB,GAAI,UAAU,GAEZ,OAAO,WAAW,EAAK,MAClB,GAAI,OAAO,GAAM,CAEtB,IAAI,EAAI,CAAC,EAKT,OAJA,EAAI,SAAQ,SAAU,GACpB,cAAc,EAAK,KACnB,EAAE,EAAK,IAAI,MAAQ,EAAK,GAC1B,IACO,CACT,CAAO,OAAO,CAChB,IAG0B,cAAd,EAAE,IAAV,GACF,MAAM,IAAI,UACR,8BAAgC,EAAS,eAG7C,EAAI,EAAE,GAAQ,MAAM,EAAG,EAOzB,CACF,IAEO,CACT,IAGA,cAAc,MAAM,SAAU,GAC5B,GAAI,EAAE,KAAO,IACX,MAAM,IAAI,MAAM,gBAElB,OAAO,IAAI,KAAK,IAAI,iBAAkB,EAAE,IAC1C,IAUA,eAAe,SAAU,EAAG,MAAM,SAAU,GAAI,MAE9C,IAAI,aAAe,SAAU,GAC3B,GAAI,EAAI,OAAS,GAAK,EACpB,MAAM,IAAI,MAAM,wCAGlB,IADA,IAAI,EAAM,CAAC,EACF,EAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAAG,CACtC,IAAI,EAAM,EAAI,GACZ,EAAQ,EAAI,EAAI,GAClB,cAAc,GACV,UAAU,KAAQ,EAAQ,WAAW,EAAO,OAEhD,EAAI,EAAI,MAAQ,CAClB,CACA,OAAO,CACT,EAEI,KAAO,GAAG,QAGd,GAFoB,iBAAT,OAAmB,KAAO,KAAK,OAEzB,GAAb,GAAG,OACL,OAAO,IAAI,KAIX,IADA,IAAI,KAAO,GACF,EAAI,EAAG,EAAI,GAAG,OAAQ,IAAK,CAClC,GAAI,GAAG,aAAc,WAAY,CAC/B,KAAK,KAAK,aAAa,GAAG,MAAM,KAChC,KACF,CACE,KAAK,KAAK,GAAG,GAEjB,CAEA,OAAO,IAAK,SAAS,UAAU,KAAK,MAAM,KAAM,CAAC,MAAM,OAAO,OAElE,IAIA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,GAAI,EAAG,OAAS,GAAK,EACnB,MAAM,IAAI,MAAM,4CAGlB,IAAI,EAAM,CAAC,EACX,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAS,EAAG,IACjC,cAAc,EAAO,EAAJ,IACjB,EAAI,EAAO,EAAJ,IAAU,EAAO,EAAJ,EAAQ,GAE9B,OAAO,CACT,IAEA,MAAM,WAAa,SAAU,EAAM,GACjC,IAAI,EAAQ,IAAI,YAAY,GAC5B,OAAO,WACL,OAAO,EAAM,eAAe,EAAM,MAAM,KAAK,WAC/C,CACF,EAMA,eAAe,aAAc,EAAG,GAAG,SAAU,EAAI,GAE/C,OADA,eAAe,EAAG,IACX,WAAW,EAAG,GAAI,EAC3B,IAEA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAiB,OAAV,EAAG,EACZ,IAEA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,YAAiB,IAAV,EAAG,EACZ,IAEA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,MAAwB,mBAAV,EAAG,EACnB,IAEA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,OADA,UAAU,mBAAoB,MAAO,kBAC9B,cAAc,EAAG,GAC1B,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAO,cAAc,EAAG,GAC1B,IAEA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,OADA,UAAU,mBAAoB,MAAO,kBAC9B,EAAG,GAAG,UACf,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAO,EAAG,GAAG,UACf,IAEA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAEhD,OADA,UAAU,kBAAmB,MAAO,iBAC7B,gBAAgB,EAAG,GAC5B,IAEA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,YAAY,EAAG,IACR,gBAAgB,EAAG,GAC5B,IAEA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAEhD,OADA,UAAU,kBAAmB,MAAO,iBAC7B,gBAAgB,EAAG,GAC5B,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,OAAO,gBAAgB,EAAG,GAC5B,IAKA,eAAe,QAAS,EAAG,GAAG,SAAU,EAAI,GAC1C,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GACX,eAAe,GACf,YAAY,GACZ,IAAI,EAAQ,IAAI,YAAY,GAI5B,OAHA,YAAW,WACT,EAAM,eAAe,EACvB,GAAS,IAAN,GACI,KACT,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,EAAI,GAC/C,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GACX,eAAe,GACf,YAAY,GACZ,IAAI,EAAQ,IAAI,YAAY,GAC5B,OAAO,aAAY,WACjB,EAAM,eAAe,EACvB,GAAS,IAAN,EACL,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,IAAI,EAAW,EAAG,GAElB,OADA,cAAc,GACP,KACT,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,IAAI,EAAM,EAAG,GAEb,OADA,YAAY,GACL,IAAI,OAAM,SAAU,GACzB,YAAW,WACT,EAAM,OAAO,IACf,GAAS,IAAN,EACL,GACF,IAeA,IAAI,oBAAsB,SAAU,GAClC,eAAe,WAAa,EAAM,EAAG,MAAM,SAAU,GACnD,IAAI,EAAM,OAAO,QACjB,GAAI,EAAK,CACP,IAAI,EAAO,EAAG,KAAI,SAAU,GAC1B,OAAO,QAAQ,EAAM,CAAE,SAAU,GACnC,IAEA,EAAI,GAAM,MAAM,EAAK,EACvB,CACA,OAAO,EAAG,EACZ,GACF,EACA,oBAAoB,SACpB,oBAAoB,OACpB,oBAAoB,QACpB,oBAAoB,QACpB,oBAAoB,SAmBpB,cAAc,QAAQ,SAAU,GAC9B,IAAI,EAAU,EAAE,IAChB,KAAM,aAAmB,OAAS,IAAY,IAC5C,MAAM,IAAI,UACR,2CAA6C,aAAa,IAK9D,IAAI,EAAM,KA0DV,OAzDA,EACG,WACA,UACA,SAAQ,SAAU,GACjB,KAAM,aAAkB,MACtB,MAAM,IAAI,UAAU,uBAAyB,aAAa,IAG5D,GAAI,EAAO,MAAQ,IAAI,QAAS,CAC9B,GAAY,OAAR,EACF,MAAM,IAAI,UACR,mDACE,aAAa,IAKjB,EAHS,EAAO,MAAQ,MAIf,EAAO,IAAI,MAAQ,IAGtB,EAAO,IAAI,IAIX,IAAI,KAAK,IAAI,SAAU,EAAO,KAExC,KAAO,CACL,IAAI,EAAO,EAAO,IAClB,GAAI,EAAO,MAAQ,IAGjB,EAAM,KAAK,IAAI,MAAO,EAAM,QACvB,GAAI,EAAO,IAAI,MAAQ,IAG5B,EAAM,KAAK,IAAI,MAAO,EAAM,EAAO,IAAI,IAAK,QACvC,GAAI,EAAO,IAAI,MAAQ,IAAI,MAAO,CAInC,EAAO,EAAO,IAAlB,IACE,EAAO,EAAO,IAAI,IAAI,IACpB,EAAU,SAEd,EAAM,KACJ,IAAI,OACJ,KAAK,KAAK,EAAS,IACnB,KAAK,IAAI,MAAO,EAAM,KAAK,EAAM,GAAU,GAE/C,MAGE,EAAM,KAAK,IAAI,MAAO,EAAM,IAAI,KAAK,IAAI,SAAU,EAAO,KAAM,EAEpE,CACF,IACK,CACT,IAEA,cAAc,QAAQ,SAAU,GAC9B,IAAI,EAAU,SAEd,GAAI,EAAE,MAAQ,IACZ,MAAM,IAAI,UAAU,yCACf,GAAM,EAAE,eAAe,KAEvB,CAGL,IAAI,EAAM,EAAE,IAAI,IACZ,EAAU,EAAE,IAAI,IAEhB,OAAM,EAkCV,OAjCA,EACG,WACA,UACA,SAAQ,SAAU,GACjB,GAAI,EAAO,MAAQ,IAAI,QAAS,CAG9B,QAAY,IAAR,EAGF,MAAM,IAAI,UACR,iDACE,aAAa,IAJjB,EAAM,IAAI,KAAK,IAAI,SAAU,EAAO,IAOxC,MAGE,EAAM,KACJ,IAAI,MACJ,IAAI,KACF,IAAI,MACJ,cACE,EAAO,IAAI,WAAW,KAAI,SAAU,GAClC,OAAO,KAAK,IAAI,QAAS,EAAS,KAAK,IAAI,SAAU,GACvD,MAGJ,IAAI,KAAK,IAAI,SAAU,EAAO,KAC9B,EAGN,IACK,IAAI,KACT,IAAI,QACJ,IAAI,KAAK,EAAS,IAAI,KAAK,EAAK,IAAI,KAAK,EAAK,OAElD,CA7CE,MAAM,IAAI,UAAU,gCA8CxB,IAEA,cAAc,OAAO,SAAU,GAG7B,GAAI,EAAE,KAAO,IAAK,OAAO,EAEzB,IAAI,EAAO,EAAE,IAAI,WACb,EAAI,EAAK,OAAS,EAClB,EAAI,EAAK,GACb,IAAK,GAAQ,EAAG,GAAK,EAAG,IAAK,EAAI,KAAK,IAAI,MAAO,EAAK,GAAI,GAAG,GAE7D,OAAO,CACT,IAEA,cAAc,MAAM,SAAU,GAM5B,IAFA,IAAI,EAAO,EAAE,IAAI,WACb,GAAI,EACC,EAAI,EAAK,OAAS,EAAG,GAAK,EAAG,IACpC,EAAI,KAAK,IAAI,MAAO,EAAK,GAAI,EAAK,GAAI,GAExC,OAAO,CACT,IAGA,cAAc,OAAO,SAAU,GAG7B,IAAI,EAAO,KACP,EAAE,IAAI,eAAe,aACvB,EAAO,EAAE,IAAI,IACb,EAAI,EAAE,KAER,IAAI,EAAQ,EAAE,IAAI,IAChB,EAAO,EAAE,IAAI,IAEf,KAAM,aAAiB,OAAS,GAAS,IACvC,MAAM,IAAI,UACR,sCAAwC,SAAS,IAMrD,IAFA,IAAI,EAAO,IACT,EAAO,IACA,EAAI,EAAO,aAAa,KAAM,EAAI,EAAE,IAAK,CAChD,KAAM,EAAE,eAAe,MACrB,MAAM,IAAI,UACR,sCAAwC,SAAS,EAAE,MAGvD,EAAO,IAAI,KAAK,EAAE,IAAI,IAAK,GAC3B,EAAO,IAAI,KAAK,EAAE,IAAI,IAAI,IAAK,EACjC,CAEA,IAAI,EAAS,KACb,GAAI,EAAM,CAGR,EAAO,cAAc,EAAK,WAAW,WACrC,EAAO,cAAc,EAAK,WAAW,WAErC,IAAI,EAAc,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAM,IACrD,EAAY,IAAI,KAAK,EAAM,GAE/B,EAAS,KACP,IAAI,UACJ,IAAI,KAAK,KAAK,EAAM,GAAc,KAClC,EAEJ,MACE,EAAS,IAAI,KAAK,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAM,IAAQ,GAEnE,OAAO,CACT,IAEA,cAAc,QAAQ,SAAU,GAI9B,IAAI,EAAQ,EAAE,IAAI,IAChB,EAAO,EAAE,IAAI,IAEf,GAAI,IAAU,IAAK,OAAO,IAAI,KAAK,IAAI,OAAQ,IAAI,KAAK,IAAK,IAE7D,KAAM,aAAiB,MACrB,MAAM,IAAI,UACR,uCAAyC,SAAS,IAGtD,IAAI,EAAM,KAUV,OATA,EACG,WACA,UACA,SAAQ,SAAU,GACjB,EAAM,IAAI,KACR,IAAI,OACJ,IAAI,KAAK,IAAI,KAAK,EAAM,KAAa,MAAP,EAAc,EAAO,IAAI,KAAK,EAAK,MAErE,IACK,CACT,IAEA,IAAI,mBAAqB,SAAU,GACjC,IAAI,EAAQ,EAAE,IAAI,IAChB,EAAO,EAAE,IAAI,IAEf,KAAM,aAAiB,MACrB,MAAM,IAAI,UACR,0CAA4C,SAAS,IAGzD,IAAI,EAAM,EACV,EACG,WACA,UACA,SAAQ,SAAU,GACjB,EAAM,IAAI,KAAK,IAAI,KAAK,IAAI,QAAS,GAAO,EAC9C,IACF,IAAI,EAAU,IAOd,OANA,EACG,WACA,UACA,SAAQ,SAAU,GACjB,EAAU,IAAI,KAAK,IAAI,KAAK,EAAK,IAAK,IAAI,KAAK,MAAO,MAAO,EAC/D,IACK,IAAI,KAAK,IAAI,OAAQ,IAAI,KAAK,EAAS,GAChD,EACA,cAAc,SAAU,oBACxB,cAAc,UAAW,oBAEzB,cAAc,cAAc,SAAU,GAUpC,IAAI,EAAc,EAAE,IAAI,IACpB,EAAO,EAAE,IAAI,IAGb,EAAe,IACf,EAA2B,IAC/B,EACG,WACA,UACA,SAAQ,SAAU,GACjB,IAAI,EAAO,EAAK,IAAI,IAChB,EAAS,SACT,EAAU,IAAI,KAChB,EACA,IAAI,KACF,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,IAAK,IAAI,KAAK,EAAM,OACrD,MAGJ,EAAe,IAAI,KAAK,EAAS,GAEjC,IAAI,EAAU,EAAK,IACnB,EAA2B,IAAI,KAC7B,IAAI,KAAK,EAAS,IAAI,KAAK,IAAI,KAAK,EAAQ,KAAM,MAClD,EAEJ,IAEF,IAAI,EAAkB,IAAI,KACxB,IAAI,eACJ,IAAI,KAAK,EAA0B,IAMrC,OAJM,IAAI,KACR,IAAI,OACJ,IAAI,KAAK,EAAc,IAAI,KAAK,EAAiB,MAGrD,IAGA,cAAc,eAAe,SAAU,GAWrC,IAAI,EAAc,EAAE,IAAI,IACpB,EAAO,EAAE,IAAI,IAEb,EAAM,KAsBV,OApBA,EACG,WACA,UACA,SAAQ,SAAU,GACjB,IAAI,EAAU,EAAK,IACjB,EAAO,EAAK,IAAI,IAClB,EAAM,IAAI,KACR,IAAI,oBACJ,IAAI,KACF,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,IAAK,IAAI,KAAK,EAAM,OACrD,IAAI,KACF,IAAI,KACF,IAAI,UACJ,IAAI,KAAK,EAAgB,MAAP,EAAc,EAAO,IAAI,KAAK,EAAK,OAEvD,MAIR,IACK,CACT,IAOA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,IAAI,EAAG,GAAI,EAAG,GACvB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GACpC,OAAO,GAAG,EAAG,GAAI,EAAG,GACtB,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,MAAM,EAAG,GAAI,EAAG,GACzB,IAMA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAO,YAAY,EAAG,GACxB,IAkBA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,OAAO,SAAS,EAAG,GACrB,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAO,UAAU,EAAG,GACtB,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,OAAO,EAAG,GACnB,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,OAAO,WAAW,EAAG,GACvB,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAO,UAAU,EAAG,GACtB,IAMA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,CACT,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAO,SAAS,EAAG,GACrB,IAUA,eAAe,IAAK,EAAG,MAAM,SAAU,GACrC,IAAI,EAAI,EAAG,GACX,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAAK,CAElC,GADA,cAAc,EAAG,IACb,UAAU,EAAG,KAAO,UAAU,GAAI,OAAO,EAC7C,GAAI,UAAU,EAAG,KAAO,UAAU,GAAI,OAAO,CAC/C,CACA,OAAO,CACT,IACA,eAAe,IAAK,EAAG,MAAM,SAAU,GACrC,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,GAAK,EAAG,IAAK,OAAO,EAEnC,OAAO,CACT,IACA,eAAe,IAAK,EAAG,MAAM,SAAU,GACrC,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,GAAK,EAAG,IAAK,OAAO,EAEnC,OAAO,CACT,IACA,eAAe,KAAM,EAAG,MAAM,SAAU,GACtC,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,IAAM,EAAG,IAAK,OAAO,EAEpC,OAAO,CACT,IACA,eAAe,KAAM,EAAG,MAAM,SAAU,GACtC,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,IAAM,EAAG,IAAK,OAAO,EAEpC,OAAO,CACT,IAEA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,cAAc,EAAG,IACA,IAAV,EAAG,EACZ,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,EAAG,GAAK,CACjB,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,EAAG,GAAK,CACjB,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACV,EAAG,GAAK,GAAK,GAAK,EAAG,GAAK,IAAM,CACzC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,cAAc,EAAG,IACV,EAAG,GAAK,GAAK,CACtB,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAExC,OADA,cAAc,EAAG,IACV,EAAG,IAAM,KAAY,EAAG,KAAO,MAAa,MAAM,EAAG,GAC9D,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,EAAG,IAAM,KAAY,EAAG,KAAO,GACxC,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACV,MAAM,EAAG,GAClB,IACA,eAAe,MAAO,EAAG,MAAM,SAAU,GACvC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAAK,cAAc,EAAG,IAErD,OAAO,KAAK,IAAI,MAAM,KAAM,EAC9B,IACA,eAAe,MAAO,EAAG,MAAM,SAAU,GACvC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAAK,cAAc,EAAG,IAErD,OAAO,KAAK,IAAI,MAAM,KAAM,EAC9B,IAEA,IAAI,gBAAkB,SAAU,EAAM,GACpC,OAAa,IAAT,EAAmB,EAChB,IAAI,QAAQ,EAAM,EAC3B,EACI,cAAgB,SAAU,EAAW,GACvC,OAAc,IAAV,EAAoB,EACjB,QAAQ,WAAW,EAAW,EACvC,EACA,eAAe,IAAK,EAAG,MAAM,SAAU,GAGrC,IAFA,IAAI,EAAO,EACP,EAAO,EACF,EAAI,EAAG,EAAI,EAAG,OAAQ,IAC7B,cAAc,EAAG,IACjB,GAAQ,UAAU,EAAG,IACrB,GAAQ,UAAU,EAAG,IAEvB,OAAO,gBAAgB,EAAM,EAC/B,IACA,IAAI,cAAgB,SAAU,GAC5B,OAAI,aAAa,QAAgB,EAAE,YAC5B,CACT,EACI,UAAY,SAAU,GACxB,OAAI,aAAa,QAAgB,EAAE,QAC5B,CACT,EACA,eAAe,IAAK,EAAG,MAAM,SAAU,GAGrC,IAFA,IAAI,EAAY,EACZ,EAAQ,EACH,EAAI,EAAG,EAAI,EAAG,OAAQ,IAC7B,cAAc,EAAG,IACjB,GAAa,cAAc,EAAG,IAC9B,GAAS,UAAU,EAAG,IAExB,OAAO,cAAc,EAAW,EAClC,IACA,eAAe,IAAK,EAAG,MAAM,SAAU,GACrC,IAAI,EAAM,EAAG,OAGb,GAFA,cAAc,EAAG,IAEN,GAAP,EACF,OAAI,EAAG,aAAc,QACZ,IAAI,SAAS,UAAU,EAAG,KAAM,UAAU,EAAG,MAC9C,EAAG,GAIX,IAFA,IAAI,EAAO,UAAU,EAAG,IACpB,EAAO,UAAU,EAAG,IACf,EAAI,EAAG,EAAI,EAAK,IACvB,cAAc,EAAG,IACjB,GAAQ,UAAU,EAAG,IACrB,GAAQ,UAAU,EAAG,IAEvB,OAAO,gBAAgB,EAAM,EAEjC,IAEA,eAAe,IAAK,EAAG,MAAM,SAAU,GACrC,IAAI,EAAM,EAAG,OAGb,GAFA,cAAc,EAAG,IAEN,GAAP,EACF,OAAI,EAAG,aAAc,QACZ,QAAQ,WAAW,EAAI,cAAc,EAAG,KAAM,UAAU,EAAG,KAC7D,EAAI,EAAG,GAId,IAFA,IAAI,EAAY,cAAc,EAAG,IAC7B,EAAQ,UAAU,EAAG,IAChB,EAAI,EAAG,EAAI,EAAK,IACvB,cAAc,EAAG,IACjB,GAAa,cAAc,EAAG,IAC9B,GAAS,UAAU,EAAG,IAExB,OAAO,cAAc,EAAW,EAEpC,IAEA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,OADA,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GACrB,IAEA,IAAI,IAAM,SAAU,EAAG,GACrB,OAAO,KAAK,MAAM,EAAI,EACxB,EACI,IAAM,SAAU,EAAG,GACrB,OAAO,EAAI,KAAK,MAAM,EAAI,GAAK,CACjC,EACI,KAAO,SAAU,EAAG,GACtB,OAAO,EAAI,EAAI,KAAK,MAAM,EAAI,GAAK,KAAK,KAAK,EAAI,EACnD,EACI,KAAO,SAAU,EAAG,GACtB,OAAO,EAAI,EAAI,EAAI,KAAK,MAAM,EAAI,GAAK,EAAI,EAAI,KAAK,KAAK,EAAI,GAAK,CACpE,EACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAG5C,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,OAAO,CAAC,IAAI,EAAG,GAAI,EAAG,IAAK,IAAI,EAAG,GAAI,EAAG,KACtD,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAGpC,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,EAAG,GAAI,EAAG,GACvB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAGpC,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,EAAG,GAAI,EAAG,GACvB,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAG9C,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,OAAO,CAAC,KAAK,EAAG,GAAI,EAAG,IAAK,KAAK,EAAG,GAAI,EAAG,KACxD,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAGrC,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,KAAK,EAAG,GAAI,EAAG,GACxB,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAGrC,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,KAAK,EAAG,GAAI,EAAG,GACxB,IAGA,cAAc,cAAe,UAC7B,cAAc,MAAO,kBACrB,cAAc,MAAO,mBACrB,IAAI,WAAa,SAAU,EAAG,GAC5B,OAAO,KAAK,MAAM,EAAI,EACxB,EACI,WAAa,SAAU,EAAG,GAC5B,OAAO,EAAI,KAAK,MAAM,EAAI,GAAK,CACjC,EACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAG1C,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,OAAO,CAAC,WAAW,EAAG,GAAI,EAAG,IAAK,WAAW,EAAG,GAAI,EAAG,KACpE,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAGlD,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,WAAW,EAAG,GAAI,EAAG,GAC9B,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GAGnD,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,WAAW,EAAG,GAAI,EAAG,GAC9B,IACA,cAAc,oBAAqB,YACnC,cAAc,qBAAsB,aACpC,cAAc,kBAAmB,UAKjC,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,GADA,cAAc,EAAG,IACb,EAAG,aAAc,SAAU,OAAO,EAAG,GAAG,UACvC,MAAM,IAAI,IAAI,OACrB,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,GADA,cAAc,EAAG,IACb,EAAG,aAAc,SAAU,OAAO,EAAG,GAAG,YACvC,MAAM,IAAI,IAAI,OACrB,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,cAAc,EAAG,IACV,KAAK,MAAM,EAAG,GACvB,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAExC,OADA,cAAc,EAAG,IACV,KAAK,KAAK,EAAG,GACtB,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GAEzC,OADA,cAAc,EAAG,IACV,EAAG,GAAK,EAAI,KAAK,KAAK,EAAG,IAAM,KAAK,MAAM,EAAG,GACtD,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,cAAc,EAAG,IACV,KAAK,MAAM,EAAG,GACvB,IAIA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,OADA,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GACrB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GACpC,IAAI,EAAM,EAAG,GACX,EAAO,EAAG,GAGZ,OAFA,cAAc,GAEV,GAEF,cAAc,GACP,KAAK,IAAI,GAAO,KAAK,IAAI,IACpB,KAAK,IAAI,EACzB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,OADA,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GACrB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,OADA,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GACrB,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,OADA,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GACrB,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACV,KAAK,KAAK,EAAG,GACtB,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACV,KAAK,KAAK,EAAG,GACtB,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACA,GAAb,EAAG,QACL,cAAc,EAAG,IACV,KAAK,MAAM,EAAG,GAAI,EAAG,KAChB,KAAK,KAAK,EAAG,GAC7B,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAErC,OADA,cAAc,EAAG,IACV,KAAK,KAAK,EAAG,GACtB,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,cAAc,EAAG,IACjB,IAAI,EAAS,KAAK,KAAK,EAAG,IACtB,EAAS,EAAU,EAAS,EAC5B,EAAO,EAAG,GAAK,EAAS,EAE5B,OAAO,IAAI,OAAO,CAAC,EAAQ,GAC7B,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GAGrC,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,KAAK,IAAI,EAAG,GAAI,EAAG,GAC5B,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAGjD,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,IAAI,QAAQ,EAAG,GAAI,EAAG,GAC/B,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OAFA,cAAc,EAAG,IACjB,cAAc,EAAG,IACV,QAAQ,WAAW,EAAG,GAAI,EAAG,GACtC,IACA,IAAI,UAAY,SAAU,GACxB,OAAO,QAAQ,OAAO,GAAG,IAC3B,EACI,UAAY,SAAU,GACxB,OAAO,QAAQ,OAAO,GAAG,IAC3B,EACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,UAAU,EAAG,GACtB,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,QAAQ,OAAO,EAAG,IAAI,IAC/B,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,QAAQ,OAAO,EAAG,IAAI,WAC/B,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,cAAc,EAAG,IACV,QAAQ,OAAO,EAAG,IAAI,OAC/B,IAKA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAI,EAAG,GACT,EAAQ,EAAG,GAEb,GADc,EAAG,GAEf,MAAM,IAAI,IAAI,oDAGhB,OADA,EAAQ,GAAS,GACV,EAAE,SAAS,EACpB,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAI,EAAG,GAEX,GAAU,WAAN,EAAgB,OAAO,IAE3B,GAAU,WAAN,EAAgB,OAAQ,IAE5B,GAAU,WAAN,EAAgB,OAAO,IAE3B,IAAI,EAAQ,EAAG,GAEX,EAAU,cAAc,EAAa,IAAV,EAAc,EAAI,GAAS,IAE1D,IAAgB,IAAZ,EAAmB,OAAO,EAE9B,QAAc,IAAV,GAAiC,KAAV,EAAc,OAAO,EAEhD,IAAI,EAAS,YAAY,GAEzB,IAAe,IAAX,EAAkB,OAAO,EAE7B,IAAI,EAAW,eAAe,GAE9B,OAAiB,IAAb,GAA2B,CAGjC,IAMA,eAAe,MAAO,EAAG,GAAG,SAAU,GACpC,OAAiB,IAAV,EAAG,EACZ,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,OAAiB,IAAV,EAAG,KAA0B,IAAV,EAAG,EAC/B,IACA,eAAe,YAAa,EAAG,MAAM,SAAU,GAE7C,IADA,IAAI,EAAM,EAAG,OACJ,EAAI,EAAG,EAAI,EAAK,IACvB,GAAI,EAAG,IAAM,EAAG,GAAI,OAAO,EAE7B,OAAO,CACT,IAIA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAG,aAAc,IAC1B,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,IAAI,KAAK,EAAG,GAAI,EAAG,GAC5B,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,KAAM,EAAG,aAAc,MACrB,MAAM,IAAI,UAAU,2BAA6B,EAAG,IACtD,OAAO,EAAG,GAAG,GACf,IACA,eAAe,MAAO,EAAG,GAAG,SAAU,GAEpC,KAAM,EAAG,aAAc,MACrB,MAAM,IAAI,UAAU,2BAA6B,EAAG,IACtD,OAAO,EAAG,GAAG,GACf,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,KAAM,EAAG,aAAc,MACrB,MAAM,IAAI,UAAU,gCAAkC,EAAG,IAE3D,OADA,EAAG,GAAG,IAAM,EAAG,GACR,KACT,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,KAAM,EAAG,aAAc,MACrB,MAAM,IAAI,UAAU,gCAAkC,EAAG,IAE3D,OADA,EAAG,GAAG,IAAM,EAAG,GACR,KACT,IAGA,WAEE,IAAI,EAAM,SAAU,EAAU,EAAM,GAClC,IAAI,EAAM,EAcV,OAbA,EAAK,SAAQ,SAAU,GACrB,KAAI,aAAe,MAGjB,MAAM,IAAI,UACR,EACE,qBACC,EAAS,MAAQ,OAClB,OACA,GAPJ,EAAM,EAAS,EAAI,IAAM,EAAI,GAUjC,IACO,CACT,EACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,EAAI,OAAQ,CAAC,EAAG,GAAI,EAAG,GAChC,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,EAAI,OAAQ,CAAC,EAAG,GAAI,EAAG,GAChC,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,EAAI,OAAQ,CAAC,EAAG,GAAI,EAAG,GAChC,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,OAAO,EAAI,OAAQ,CAAC,EAAG,GAAI,EAAG,GAChC,IAEA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAI,QAAS,CAAC,EAAG,EAAG,GAAI,EAAG,GACpC,IAEA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,OAAO,EAAI,SAAU,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GACxC,GACD,CAzGD,GA2GA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAG,KAAO,GACnB,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,OAAO,EAAG,GACnB,IACA,eAAe,OAAQ,EAAG,MAAM,SAAU,GAExC,IADA,IAAI,EAAI,IACC,EAAI,EAAG,OAAS,EAAG,GAAK,EAAG,IAAK,EAAI,IAAI,KAAK,EAAG,GAAI,GAC7D,OAAO,CACT,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,YAAY,EAAG,IAEf,IADA,IAAI,EAAI,EACC,EAAI,EAAG,GAAI,GAAK,IAAK,EAAI,EAAE,IAAK,IACzC,OAAO,CACT,IACA,eAAe,SAAU,EAAG,MAAM,SAAU,GAG1C,IAFA,IAAI,EAAI,EAAG,OACP,EAAM,IAAK,GACR,KACL,EAAG,GACA,WACA,UACA,SAAQ,SAAU,GACjB,EAAM,IAAI,KAAK,EAAM,EACvB,IAEJ,OAAO,CACT,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAExC,GAAI,EAAG,IAAM,IAAK,OAAO,IACzB,YAAY,EAAG,IAGf,IADA,IAAI,EAAI,IACC,EAAI,EAAG,GAAI,GAAK,IAAK,EAAI,EAAE,IAAK,EAAI,IAAI,KAAK,EAAE,IAAK,GAC7D,OAAO,CACT,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAG1C,GAFA,YAAY,EAAG,IACf,eAAe,EAAG,IACd,EAAG,GAAK,EACV,MAAM,IAAI,UAAU,kCAAoC,EAAG,GAAK,KAGlE,IADA,IAAI,EAAI,EAAG,GACF,EAAI,EAAG,EAAI,EAAG,GAAI,IAAK,CAC9B,KAAM,aAAa,MACjB,MAAM,IAAI,UAAU,uCAAyC,EAAG,IAClE,EAAI,EAAE,GACR,CACA,OAAO,CACT,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GAGzC,GAFA,YAAY,EAAG,IACf,eAAe,EAAG,IACd,EAAG,GAAK,EACV,MAAM,IAAI,UAAU,kCAAoC,EAAG,GAAK,KAGlE,IADA,IAAI,EAAI,EAAG,GACF,EAAI,EAAG,EAAI,EAAG,GAAI,IAAK,CAC9B,KAAM,aAAa,MACjB,MAAM,IAAI,UAAU,sCAAwC,EAAG,IACjE,EAAI,EAAE,GACR,CACA,OAAO,EAAE,GACX,IACA,eAAe,MAAO,EAAG,MAAM,SAAU,GACvC,IAAI,EAAO,EAAG,QACZ,EAAQ,EACV,EAAM,QAAQ,aAEd,IAAI,EAAI,GACR,OAAO,KAAK,cAAc,EAAO,CAI/B,KAAM,SAAU,GACd,OAAO,IAAI,KACT,EACA,EAAG,KAAI,SAAU,GACf,OAAO,EAAE,GACX,IAEJ,EAOA,OAAQ,SAAU,GAChB,EAAE,KAAK,EACT,EAKA,OAAQ,WACN,OAAO,cAAc,EACvB,GAEJ,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAC5C,IAAI,EAAO,EAAG,QACZ,EAAQ,EAGV,OAFA,EAAM,QAAQ,aAEP,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,OAAO,IAAI,KACT,EACA,EAAG,KAAI,SAAU,GACf,OAAO,EAAE,GACX,IAEJ,EACA,OAAQ,WACN,OAAO,KACT,GAEJ,IAIA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,OAAO,EAAG,aAAc,UAC1B,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,cAAc,EAAG,IACV,EAAG,GAAG,IACf,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAC5C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,IACb,EAAG,IAAM,EAAG,GAAI,OAAO,EAE7B,OAAO,CACT,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,cAAc,EAAG,IACV,IAAI,EAAG,GAChB,IAKA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAG,aAAc,IAC1B,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,MAAM,WAAW,EAChC,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,eAAe,EAAG,IACX,KAAK,IAAI,OAAO,aAAa,EAAG,IACzC,IAEA,IAAI,uBAAyB,SAAU,GACrC,OAAO,SAAU,GACf,YAAY,EAAG,IACf,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,YAAY,EAAG,KACV,EAAK,EAAG,EAAI,GAAG,MAAO,EAAG,GAAG,OAAQ,OAAO,EAElD,OAAO,CACT,CACF,EACA,eACE,SACA,EACA,KACA,wBAAuB,SAAU,EAAG,GAClC,OAAO,GAAK,CACd,KAEF,eACE,SACA,EACA,KACA,wBAAuB,SAAU,EAAG,GAClC,OAAO,EAAI,CACb,KAEF,eACE,SACA,EACA,KACA,wBAAuB,SAAU,EAAG,GAClC,OAAO,EAAI,CACb,KAEF,eACE,UACA,EACA,KACA,wBAAuB,SAAU,EAAG,GAClC,OAAO,GAAK,CACd,KAEF,eACE,UACA,EACA,KACA,wBAAuB,SAAU,EAAG,GAClC,OAAO,GAAK,CACd,KAMF,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,MAAuB,iBAAT,EAAG,EACnB,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,eAAe,EAAG,IAClB,IAAI,EAAI,IACJ,EAAG,KACL,YAAY,EAAG,IACf,EAAI,EAAG,GAAG,OAEZ,IAAI,EAAM,GAMV,OALA,MAAM,EAAG,IACN,OACA,KAAI,KACH,GAAO,CAAC,IAEL,CACT,IACA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,GAAiB,GAAb,EAAG,OAAa,MAAO,GAC3B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAAK,YAAY,EAAG,IACnD,OAAO,EACJ,KAAI,SAAU,GACb,OAAO,EAAE,KACX,IACC,KAAK,GACV,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,cAAc,EAAG,IACV,EAAG,GAAG,MACf,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OAFA,cAAc,EAAG,IACjB,eAAe,EAAG,GAAI,EAAG,EAAG,GAAG,OAAS,GACjC,KAAK,IAAI,EAAG,GAAG,OAAO,CAAC,EAAG,KACnC,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAC5C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,IACb,EAAG,IAAM,EAAG,GAAI,OAAO,EAE7B,OAAO,CACT,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAC5C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,GAAK,EAAG,IAAK,OAAO,EAEnC,OAAO,CACT,IACA,eAAe,WAAY,EAAG,MAAM,SAAU,GAC5C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,GAAK,EAAG,IAAK,OAAO,EAEnC,OAAO,CACT,IACA,eAAe,YAAa,EAAG,MAAM,SAAU,GAC7C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,IAAM,EAAG,IAAK,OAAO,EAEpC,OAAO,CACT,IACA,eAAe,YAAa,EAAG,MAAM,SAAU,GAC7C,cAAc,EAAG,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,MACX,EAAG,EAAI,IAAM,EAAG,IAAK,OAAO,EAEpC,OAAO,CACT,IAEA,eAAe,YAAa,EAAG,GAAG,SAAU,GAK1C,GAJA,cAAc,EAAG,IACjB,eAAe,EAAG,IAClB,eAAe,EAAG,IAEd,EAAG,GAAK,EAAG,MAAM,IAAI,UAAU,+BAAiC,EAAG,IACvE,GAAI,EAAG,GAAK,EAAG,MAAM,IAAI,UAAU,6BAA+B,EAAG,IACrE,GAAI,EAAG,GAAG,OAAS,GAAK,EAAG,GACzB,MAAM,IAAI,UAAU,6BAA+B,EAAG,IACxD,GAAI,EAAG,GAAG,OAAS,GAAK,EAAG,GACzB,MAAM,IAAI,UAAU,2BAA6B,EAAG,IACtD,KAAM,EAAG,IAAM,EAAG,IAChB,MAAM,IAAI,UAAU,gCAAkC,EAAG,GAAK,KAAO,EAAG,IAE1E,OAAO,EAAG,GAAG,UAAU,EAAG,GAAI,EAAG,GACnC,IAEA,eAAe,gBAAiB,EAAG,MAAM,SAAU,GACjD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,IAAK,cAAc,EAAG,IAErD,OAAO,EAAG,KAAK,GACjB,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,cAAc,EAAG,IACV,cACL,EAAG,GAAG,MAAM,IAAI,KAAI,SAAU,GAC5B,OAAO,KAAK,IAAI,EAAE,GACpB,IAEJ,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,YAAY,EAAG,IACR,EAAG,GACP,WACA,KAAI,SAAU,GACb,OAAO,EAAE,KACX,IACC,KAAK,GACV,IACA,eAAe,kBAAmB,EAAG,MAAM,SAAU,GACnD,IAAI,EAAO,EAAG,QACZ,EAAO,EAGT,OAFA,EAAK,QAAQ,eAEN,KAAK,cAAc,EAAM,CAC9B,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,WACN,OAAO,KACT,GAEJ,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAG5C,OADA,cAAc,EAAG,IACV,EAAG,EACZ,IAKA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,OAAO,SAAS,EAAG,GACrB,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,eAAe,EAAG,IAClB,IAAI,EAAM,IAAI,MAAM,EAAG,IAEvB,GAAiB,GAAb,EAAG,OACL,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,GAAI,IAAK,EAAI,GAAK,EAAG,GAE9C,OAAO,CACT,IACA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,OAAO,CACT,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,cAAc,EAAG,IACV,EAAG,GAAG,MACf,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAK3C,OAJA,cAAc,EAAG,IACjB,eAAe,EAAG,IAClB,eAAe,EAAG,GAAI,EAAG,EAAG,GAAG,OAAS,GAEjC,EAAG,GAAG,EAAG,GAClB,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAK5C,OAJA,cAAc,EAAG,IACjB,eAAe,EAAG,IAElB,EAAG,GAAG,EAAG,IAAM,EAAG,GACX,KACT,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,cAAc,EAAG,IACV,cAAc,EAAG,GAC1B,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,UACf,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,cAAc,EAAG,IAIjB,IAHA,IAAI,EAAM,EAAG,GACX,EAAM,EAAG,GAEF,EAAI,EAAG,EAAI,EAAI,OAAQ,IAAK,EAAI,GAAK,EAC9C,OAAO,CACT,IACA,eAAe,aAAc,EAAG,MAAM,SAAU,GAC9C,IAAI,EAAO,EAAG,QACZ,EAAO,EACT,EAAK,QAAQ,eAEb,IAAI,EAAI,GACR,OAAO,KAAK,cAAc,EAAM,CAC9B,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,SAAU,GAChB,EAAE,KAAK,EACT,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,kBAAmB,EAAG,MAAM,SAAU,GACnD,IAAI,EAAO,EAAG,QACZ,EAAO,EAGT,OAFA,EAAK,QAAQ,eAEN,KAAK,cAAc,EAAM,CAC9B,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,WACN,OAAO,KACT,GAEJ,IAYA,eAAe,QAAS,EAAG,MAAM,SAAU,GACzC,IAAI,EAAO,EAAG,QACZ,EAAY,EAAG,MACf,EAAO,EAGT,OAFA,EAAO,EAAK,OAAO,EAAU,YAEtB,IAAI,KAAK,EAAM,EACxB,IACA,cAAc,kCAAkC,SAAU,GACxD,OAAO,IAAI,KAAK,IAAI,WAAY,EAAE,IACpC,IACA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,OAAiB,GAAb,EAAG,OAEE,EAAG,GACA,IAAI,OAAO,EACzB,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,IAAI,EAAW,EAAG,GAChB,EAAW,EAAG,GAGhB,OAFA,iBAAiB,GACjB,iBAAiB,GACV,IAAI,KAAK,EAAU,IAAI,SAAU,GACtC,IAAI,EAAS,EAAG,GAChB,OACS,IAAI,KAAK,EADd,aAAkB,OACM,EAAO,QAIP,CAAC,GAE/B,GACF,IAEA,eAAe,eAAgB,EAAG,GAAG,SAAU,EAAI,GACjD,IAAI,EAAS,EAAG,GACd,EAAQ,EAAG,GACX,EAAQ,EAAG,GACb,OAAO,IAAI,KAAK,EAAQ,IAAI,WAE1B,OADA,EAAK,oBAAoB,EAAQ,GAC1B,IAAI,KAAK,EAAO,IAAI,SAAU,GACnC,IAAI,EAAS,EAAI,GAEjB,OADA,EAAK,qBACE,IAAI,KAAK,EAAO,IAAI,WACzB,OAAO,CACT,GACF,GACF,GACF,IAQA,MAAM,iBAAmB,SAAU,EAAG,GACpC,GAAI,aAAa,KAAM,CACrB,GAAI,EAAE,MAAQ,IAAI,cAChB,OAAO,KACL,IAAI,QACJ,KAAK,IAAI,SAAU,IAAI,eACvB,iBAAiB,EAAE,IAAK,EAAQ,IAE7B,GAAI,EAAE,MAAQ,IAAI,YAAc,EAAE,MAAQ,IAAI,oBAAqB,CACxE,GAAI,EAAQ,EACV,OAAO,KACL,IAAI,QACJ,KAAK,IAAI,SAAU,EAAE,KACrB,iBAAiB,EAAE,IAAK,EAAQ,IAE7B,GACL,EAAE,MAAQ,IAAI,YACd,EAAE,eAAe,MACjB,EAAE,IAAI,MAAQ,IAEd,OAAO,EAAE,IAAI,IAEb,MAAM,IAAI,UAAU,4BAExB,CAAO,OAAI,EAAE,MAAQ,IACZ,aAAa,EAAE,IAAK,GAGpB,KACL,IAAI,UACJ,aAAa,EAAE,IAAK,GACpB,iBAAiB,EAAE,IAAK,GAG9B,CAAO,GAAI,aAAa,MAAO,CAC7B,MAAM,EAAI,cAAc,GACxB,OAAO,KACL,IAAI,gBACJ,KACE,IAAI,UACJ,aAAa,EAAE,IAAK,GACpB,iBAAiB,EAAE,IAAK,IAG9B,CACE,OAAO,KAAK,IAAI,SAAU,EAE9B,EAIM,aAAe,SAAU,EAAG,GAChC,GAAI,aAAa,KACf,OAAI,EAAE,MAAQ,IAAI,cACT,KACL,IAAI,QACJ,KACE,IAAI,QACJ,KAAK,IAAI,cAAe,EAAE,KAC1B,iBAAiB,EAAE,IAAK,EAAQ,KAG3B,EAAE,MAAQ,IAAI,YAAc,EAAE,MAAQ,IAAI,oBAC/C,EAAQ,EACH,KACL,IAAI,QACJ,KACE,IAAI,QACJ,KAAK,IAAI,SAAU,EAAE,KACrB,iBAAiB,EAAE,IAAK,EAAQ,KAG3B,EAAE,MAAQ,IAAI,WAChB,KAAK,IAAI,QAAS,EAAE,KAGpB,KAAK,IAAI,UAAW,EAAE,KAGxB,KACL,IAAI,QACJ,KACE,IAAI,UACJ,aAAa,EAAE,IAAK,GACpB,iBAAiB,EAAE,IAAK,KAIzB,GAAI,aAAa,MAAO,CAC7B,MAAM,EAAI,cAAc,GACxB,OAAO,KACL,IAAI,QACJ,KACE,IAAI,gBACJ,KACE,IAAI,UACJ,aAAa,EAAE,IAAK,GACpB,iBAAiB,EAAE,IAAK,KAIhC,CACE,OAAO,KAAK,IAAI,SAAU,KAAK,GAEnC,EAEA,cAAc,cAAc,SAAU,GACpC,OAAO,iBAAiB,EAAE,IAAI,IAAK,EACrC,IACA,cAAc,WAAW,SAAU,GACjC,MAAM,IAAI,UAAU,0CACtB,IACA,cAAc,oBAAoB,SAAU,GAC1C,MAAM,IAAI,UAAU,oDACtB,IA0CA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,cAAc,EAAG,IACV,EAAG,GAAG,aACf,IAEA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAEhD,OADA,cAAc,EAAG,IACV,EAAG,GAAG,aACf,IAIA,MAAM,wBAA0B,SAAU,GACxC,OAAO,SAAU,GACf,cAAc,EAAG,IAGjB,IAFA,IAAI,EAAM,EAAG,GAAG,cAEP,EAAI,EAAG,EAAI,EAAG,OAAQ,IAE7B,GADA,cAAc,EAAG,KACZ,EAAQ,EAAK,EAAG,GAAG,eAAgB,OAAO,EAEjD,OAAO,CACT,CACF,EAEA,eACE,cACA,EACA,KACA,yBAAwB,SAAU,EAAG,GACnC,OAAO,GAAK,CACd,KAGF,eACE,cACA,EACA,KACA,yBAAwB,SAAU,EAAG,GACnC,OAAO,EAAI,CACb,KAGF,eACE,cACA,EACA,KACA,yBAAwB,SAAU,EAAG,GACnC,OAAO,EAAI,CACb,KAGF,eACE,eACA,EACA,KACA,yBAAwB,SAAU,EAAG,GACnC,OAAO,GAAK,CACd,KAGF,eACE,eACA,EACA,KACA,yBAAwB,SAAU,EAAG,GACnC,OAAO,GAAK,CACd,KAeF,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GAEV,OADA,YAAY,GACL,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,KAC3B,EACA,OAAQ,SAAU,EAAK,GACrB,GAAI,EAAK,OAAO,EAAE,GACpB,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,UAAW,EAAG,MAAM,SAAU,GAC3C,IAAI,EAAO,EAAG,QACV,EAAQ,EACZ,EAAM,QAAQ,aAEd,IAAI,GAAO,EACX,OAAO,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,OAAO,IAAI,KACT,EACA,EAAM,KAAI,SAAU,GAClB,OAAO,EAAE,GACX,IAEJ,EACA,OAAQ,SAAU,EAAK,GACrB,IAAY,IAAR,EAAe,OAAO,EAC1B,EAAO,CACT,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,IAAI,EAAO,EAAG,QACV,EAAQ,EAGZ,OAFA,EAAM,QAAQ,aAEP,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,OAAO,IAAI,KACT,EACA,EAAM,KAAI,SAAU,GAClB,OAAO,EAAE,GACX,IAEJ,EACA,OAAQ,SAAU,EAAK,GACrB,IAAY,IAAR,EAAe,OAAO,CAC5B,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,SAAU,EAAG,GAAG,SAAU,GACvC,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GACV,YAAY,GAEZ,IAAI,EAAI,GACR,OAAO,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,KAC3B,EACA,OAAQ,SAAU,EAAK,GACjB,GAAK,EAAE,KAAK,EAAE,IACpB,EACA,OAAQ,WACN,OAAO,cAAc,EACvB,GAEJ,IAWA,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GACV,YAAY,GAEZ,IAAI,EAAI,GACN,EAAI,GACN,OAAO,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,KAC3B,EACA,OAAQ,SAAU,EAAK,GACjB,EAAK,EAAE,KAAK,EAAE,KACb,EAAE,KAAK,EAAE,IAChB,EACA,OAAQ,WACN,OAAO,IAAI,OAAO,CAAC,cAAc,GAAI,cAAc,IACrD,GAEJ,IACA,eAAe,YAAa,EAAG,MAAM,SAAU,GAC7C,IAAI,EAAO,EAAG,QACZ,EAAQ,EAAG,QACX,EAAQ,EAGV,OAFA,EAAM,QAAQ,aAEP,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,IAAI,EAAO,EAAM,KAAI,SAAU,GAC7B,OAAO,EAAE,GACX,IAEA,OADA,EAAK,QAAQ,GACN,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,SAAU,EAAK,GACrB,EAAQ,CACV,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,aAAc,EAAG,MAAM,SAAU,GAC9C,IAAI,EAAO,EAAG,QACZ,EAAQ,EAAG,QACT,EAAQ,EAAG,KAAI,SAAU,GAG3B,OADA,YAAY,GACL,cAAc,EAAG,WAAW,UACrC,IAEA,OAAO,KAAK,cAAc,EAAO,CAC/B,KAAM,SAAU,GACd,IAAI,EAAO,EAAM,KAAI,SAAU,GAC7B,OAAO,EAAE,GACX,IAEA,OADA,EAAK,KAAK,GACH,IAAI,KAAK,EAAM,EACxB,EACA,OAAQ,SAAU,EAAK,GACrB,EAAQ,CACV,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GACV,YAAY,GAEZ,IAAI,EAAM,GACV,OAAO,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,KAC3B,EACA,OAAQ,SAAU,EAAK,GAChB,GAAK,EAAI,KAAK,EAAE,IACvB,EACA,OAAQ,WACN,OAAO,cAAc,EACvB,GAEJ,IACA,IAAI,aAAe,SAAU,GAC3B,OAAO,SAAU,GACf,IAAI,EAAM,EAAG,GACX,EAAK,EAAG,GACV,YAAY,GAEZ,IAAI,EAAM,GACV,OAAO,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,OAAO,IAAQ,QAAQ,GAAM,CAAC,EAAK,EAAE,KACvD,EACA,OAAQ,SAAU,EAAK,GAChB,GAAK,EAAI,KAAK,EAAE,IACvB,EACA,OAAQ,WACN,OAAO,cAAc,EACvB,GAEJ,CACF,EACA,eAAe,SAAU,EAAG,EAAG,aAAa,WAC5C,eAAe,OAAQ,EAAG,EAAG,aAAa,SAC1C,eAAe,OAAQ,EAAG,EAAG,aAAa,QAE1C,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAO,EAAG,GACZ,EAAK,EAAG,GAEV,OADA,YAAY,GACL,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,KAC3B,EACA,OAAQ,SAAU,EAAK,GACrB,GAAI,EAAK,OAAO,CAClB,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,IAAI,YAAc,SAAU,GAC1B,OAAO,SAAU,GACf,IAAI,EAAM,EAAG,GACX,EAAK,EAAG,GAEV,OADA,YAAY,GACL,KAAK,QAAQ,EAAI,CACtB,KAAM,SAAU,GACd,OAAO,IAAI,KAAK,OAAO,IAAQ,QAAQ,GAAM,CAAC,EAAK,EAAE,KACvD,EACA,OAAQ,SAAU,EAAK,GACrB,GAAI,EAAK,OAAO,CAClB,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,CACF,EACA,eAAe,SAAU,EAAG,EAAG,YAAY,WAC3C,eAAe,OAAQ,EAAG,EAAG,YAAY,SACzC,eAAe,OAAQ,EAAG,EAAG,YAAY,QAEzC,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GAEX,OADA,YAAY,GACL,KAAK,QAAQ,EAAK,CACvB,KAAM,SAAU,GACd,GAAI,EAAE,IAAI,IAAK,OAAO,IAAI,KAAK,EAAM,CAAC,EAAE,IAAI,MAE1C,MAAM,IAAI,UAAU,+BAAiC,SAAS,EAAE,KACpE,EACA,OAAQ,SAAU,EAAK,GACrB,GAAI,EAAK,OAAO,EAAE,GACpB,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,IACA,IAAI,WAAa,SAAU,EAAW,GACpC,OAAO,SAAU,GACf,IAAI,EAAM,EAAG,GACX,EAAO,EAAG,GAEZ,OADA,YAAY,GACL,KAAK,QAAQ,EAAM,CACxB,KAAM,SAAU,GACd,IAAK,OAAO,EAAG,KACb,MAAM,IAAI,UACR,EAAY,2BAA6B,SAAS,EAAG,MAGzD,IAAI,EAAW,OAAO,IAAiB,QAAQ,GAC/C,OAAO,IAAI,KAAK,EAAU,CAAC,EAAK,EAAG,IAAI,KACzC,EACA,OAAQ,SAAU,EAAW,GAC3B,GAAI,EAAW,OAAO,EAAG,GAC3B,EACA,OAAQ,WACN,OAAO,CACT,GAEJ,CACF,EACA,eAAe,QAAS,EAAG,EAAG,WAAW,QAAS,WAClD,eAAe,OAAQ,EAAG,EAAG,WAAW,OAAQ,SAChD,eAAe,OAAQ,EAAG,EAAG,WAAW,OAAQ,QAEhD,eAAe,QAAS,EAAG,MAAM,SAAU,GACzC,GAAiB,GAAb,EAAG,OAAa,OAAO,EAAG,GAE5B,IAAI,EAAM,KAMV,OALA,EAAG,UAAU,SAAQ,SAAU,GAE3B,EADE,EACI,IAAI,KAAK,EAAG,GACP,CACf,IACO,CAEX,IAKA,WAGE,IAAI,EAAY,SAAU,EAAK,EAAM,GACnC,OAAI,EAAI,QAAU,EAAU,EAAO,GAC5B,EAAW,EAAK,EAAM,EAAQ,CAAC,CAAC,EAAG,EAAI,QAAQ,KAAS,EACjE,EAEI,EAAa,SAAU,EAAK,EAAM,EAAQ,EAAO,GACnD,OAAa,CACX,IAAI,EAAQ,EAAM,EAAM,OAAS,GAAG,GAClC,EAAM,EAAM,EAAM,OAAS,GAAG,GAC9B,EAAO,EAAM,EAAM,OAAS,GAAG,GAC7B,EAAM,EAAM,EAGhB,GAAI,GAAO,IAAM,EAEf,EAAM,KAAK,CAAC,EAAO,GAAS,GAAO,IAAI,QAFzC,CAIO,IAAI,EAAJ,CASL,EAAM,MACN,IAAI,EAAS,EAAM,EAAM,OAAS,GAAG,GACjC,EAAO,EAAI,MAAM,EAAQ,GAC3B,EAAO,EAAI,MAAM,EAAO,GAC1B,OAAO,EAAO,EAAM,EAAM,EAAM,GAAI,EAAG,GAAG,SAAU,GAElD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,EAAI,EAAS,GAAK,EAAI,GAGxB,OAAoB,GAAhB,EAAM,OACD,EAAO,GAEP,EAAW,EAAK,EAAM,EAAQ,GAAO,EAEhD,GACF,CAvBE,EAAM,MACN,IAAI,EAAO,EAAM,EAAM,OAAS,GAAG,GACnC,EAAM,KAAK,CAAC,EAAK,GAAM,IACvB,GAAK,CAoBP,CACF,CACF,EAEI,EAAS,SAAU,EAAM,EAAM,EAAM,EAAK,EAAG,EAAG,GAElD,IAAI,EAAO,EAAK,OACd,EAAO,EAAK,OACd,GAAI,EAAI,GAAQ,EAAI,EAClB,OAAO,IAAI,KAAK,EAAM,CAAC,EAAK,GAAI,EAAK,KAAK,SAAU,GASlD,OAPI,EAAG,IACL,EAAI,KAAK,EAAK,IACd,GAAK,IAEL,EAAI,KAAK,EAAK,IACd,GAAK,GAEA,EAAO,EAAM,EAAM,EAAM,EAAK,EAAG,EAAG,EAC7C,IAEA,KAAO,EAAI,GACT,EAAI,KAAK,EAAK,IACd,GAAK,EAEP,KAAO,EAAI,GACT,EAAI,KAAK,EAAK,IACd,GAAK,EAEP,OAAO,EAAK,EAEhB,EAEI,EAAY,SAAU,EAAG,GAC3B,OAAO,GAAG,EAAG,IAAM,EAAI,GAAG,EAAG,GAAK,EAAI,CACxC,EAEA,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,OAAI,EAAG,IACL,iBAAiB,EAAG,IACpB,YAAY,EAAG,IACR,EAAU,EAAG,GAAG,WAAY,EAAG,IAAI,SAAU,GAClD,OAAO,cAAc,EACvB,MAEA,YAAY,EAAG,IACR,cAAc,EAAG,GAAG,WAAW,KAAK,IAE/C,IAGA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAI,EAAG,IACL,iBAAiB,EAAG,IACpB,cAAc,EAAG,IACV,EAAU,IAAI,EAAG,IAAK,EAAG,IAAI,SAAU,GAC5C,OAAO,CACT,MAEA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,KAAK,GAE3B,IAGA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,OAAI,EAAG,IACL,iBAAiB,EAAG,IACpB,cAAc,EAAG,IACV,EAAU,EAAG,GAAI,EAAG,IAAI,SAAU,GACvC,OAAO,KACT,MAEA,cAAc,EAAG,IACjB,EAAG,GAAG,KAAK,GACJ,MAEX,GACD,CA3HD,GAgIA,cAAc,QAAQ,SAAU,GAG9B,IAAI,EAAO,EAAE,IAAI,IACf,EAAO,EAAE,IAAI,IAEf,OAAO,IAAI,KACT,IAAI,MACJ,IAAI,KAAK,EAAM,IAAI,KAAK,IAAI,KAAK,IAAI,SAAU,GAAO,IAAI,KAAK,MAAO,OAE1E,IAEA,cAAc,UAAU,SAAU,GAGhC,IAAI,EAAO,EAAE,IAAI,IACf,EAAO,EAAE,IAAI,IAEf,OAAO,IAAI,KACT,IAAI,MACJ,IAAI,KACF,IAAI,KAAK,IAAI,OAAQ,IAAI,KAAK,EAAM,MACpC,IAAI,KAAK,IAAI,KAAK,IAAI,SAAU,GAAO,IAAI,KAAK,MAAO,OAG7D,IAEA,cAAc,MAAM,SAAU,GAY5B,IAAK,OAAO,EAAE,KAAM,MAAM,IAAI,UAAU,0BACxC,IAAI,EAAQ,EAAE,IAAI,IAClB,IAAK,OAAO,GACV,MAAM,IAAI,UAAU,yCACtB,IAAK,OAAO,EAAE,IAAI,KAAM,MAAM,IAAI,UAAU,+BAC5C,IAAI,EAAU,EAAE,IAAI,IAAI,IACpB,EAAQ,EAAE,IAAI,IAAI,IAGlB,EAAO,SAEP,EAAY,cACd,EAAM,KAAI,SAAU,GAClB,IAAI,EAAI,EAAQ,WAChB,OAAO,KAAK,EAAE,GAAI,EAAE,GACtB,KAGE,EAAO,EAAQ,IACf,EAAe,IAAI,KAAK,IAAI,SAAU,EAAQ,KAE9C,EAAY,IAAI,KAClB,EACA,cACE,EAAM,KAAI,SAAU,GAClB,IAAI,EAAI,EAAQ,WAChB,OAAO,EAAE,IAAM,EAAE,EACnB,MAGA,EAAa,IAAI,KAAK,IAAI,SAAU,GAAO,OAAO,KAAK,IAG3D,OAAO,KACL,IAAI,OACJ,EACA,EACA,KAAK,IAAI,MAAO,EAAM,EAAc,GAExC,IAGA,cAAc,eAAe,SAAU,GACrC,IAAK,OAAO,EAAE,KACZ,MAAM,IAAI,UAAU,2CACtB,IAAI,EAAU,EAAE,IAAI,WAEhB,EAAQ,SACR,EAAO,KAAK,IAAI,SAAU,yCAuC9B,OArCA,EAAQ,UAAU,SAAQ,SAAU,GAClC,IAAK,OAAO,GACV,MAAM,IAAI,UACR,uCAAyC,SAAS,IAEtD,IAAI,EAAU,EAAO,IACnB,EAAc,EAAO,IAEvB,GAAI,IAAY,IACd,EAAO,KACL,IAAI,MACJ,KAAK,IAAI,SAAU,GACnB,IAAI,KAAK,IAAI,SAAU,GACvB,QAEG,GAAI,OAAO,GAAU,CAC1B,IAAI,EAAM,EAAQ,SAChB,EAAW,EAAQ,WACjB,EAA0B,IAAnB,IAAa,IAAU,IAAW,MACzC,EAAS,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAS,IACvD,EAAO,KACL,IAAI,MACJ,KAAK,EAAM,KAAK,IAAI,UAAW,GAAQ,GACvC,KAAK,IAAI,SAAU,EAAQ,GAC3B,EAEJ,KAAO,KAAI,SAAS,GAOlB,MAAM,IAAI,UAAU,iCAAmC,SAAS,IANhE,EAAO,IAAI,KACT,IAAI,QACJ,IAAI,KAAK,EAAS,IAAI,KAAK,EAAO,IAKtC,CACF,IAEO,KAAK,IAAI,UAAW,EAAO,EACpC,IAWA,cAAc,sBAAsB,SAAU,GAE5C,IAAI,EAAY,EAAE,IAAI,IAClB,EAAiB,EAAE,IAAI,IAO3B,GAAI,SAAS,GACX,IAAI,EAAc,EACd,EAAmB,IAAI,QAAU,EAAU,MAC3C,EAAiB,IAAI,EAAU,KAAO,SACrC,CACL,YAAY,GACR,EAAc,EAAU,IACxB,EAAmB,EAAU,IAAI,IACjC,EAAiB,EAAU,IAAI,IAAI,IACvC,cAAc,GACd,cAAc,GACd,cAAc,EAChB,CAGA,IAGI,EAHA,GAAS,EACT,GAAS,EACT,GAAM,EAEN,GAAa,EACb,GAAY,EACZ,GAAW,EACX,EAAS,GAGb,EAAe,WAAW,SAAQ,SAAU,GAC1C,OAAQ,EAAO,KAEb,KAAK,IAAI,UACP,EAAS,EAAO,IAAI,WAAW,KAAI,SAAU,EAAY,GACvD,GAAI,SAAS,GAEX,MAAO,CACL,KAAM,EACN,IAAK,EACL,SAAS,EACT,cAAe,KACf,aAAc,MAKhB,OAFA,YAAY,GACZ,cAAc,EAAW,KACjB,EAAW,KACjB,KAAK,IAAI,aAGP,IAAI,EAAa,EAAW,IAAI,IAGhC,OAFA,cAAc,GAEV,MAAM,EAAW,IAAI,KAChB,CAAE,KAAM,EAAY,IAAK,EAAK,SAAS,GAEvC,CACL,KAAM,EACN,IAAK,EACL,SAAS,EACT,cAAe,EAAW,IAAI,IAAI,KAGxC,KAAK,IAAI,WAGH,EAAa,EAAW,IAAI,IAGhC,OAFA,cAAc,GAEV,MAAM,EAAW,IAAI,KAChB,CAAE,KAAM,EAAY,IAAK,EAAK,SAAS,GAEvC,CACL,KAAM,EACN,IAAK,EACL,SAAS,EACT,cAAe,EAAW,IAAI,IAAI,IAClC,aAAc,EAAW,IAAI,IAAI,IAAI,KAE3C,QACE,MAAM,IAAI,UACR,yFAGE,QAAQ,EAAW,MAI/B,IACA,MAEF,KAAK,IAAI,UACP,EAAc,EAAO,IAAI,IACzB,cAAc,GACd,MAEF,KAAK,IAAI,YACP,EAAW,EAAO,IAAI,IACtB,MAEF,KAAK,IAAI,UACP,IAAW,EAAO,IAAI,IACtB,MAEF,KAAK,IAAI,UACP,IAAW,EAAO,IAAI,IACtB,MAEF,KAAK,IAAI,iBACP,EAAM,EAAO,IAAI,IACjB,MAEF,KAAK,IAAI,cACP,EAAa,EAAO,IAAI,IACxB,EAAY,EAAO,IAAI,IAAI,IAC3B,MACF,QACE,MAAM,IAAI,UACR,uCAAyC,SAAS,EAAO,KAAO,KAGxE,IAEI,IACF,EAAa,CAAC,IAAI,0BAA2B,GAC7C,EAAY,CAAC,IAAI,iCAAkC,IAQrD,IAAI,EAAM,CAAC,IAAI,0BAA2B,GACtC,EAAK,CAAC,IAAI,iCAAkC,GAG5C,EAAa,EAAO,KAAI,SAAU,GACpC,OAAO,KAAK,IAAI,EAAM,QAAU,UAAY,aAAc,EAAM,KAClE,IACA,EAAW,WAAY,EACvB,IAAI,EAAU,CACZ,IAAI,+BACJ,CAAC,IAAI,SAAU,GACf,EACA,EACA,EACA,EACA,GAEE,EAAS,CACX,IAAI,sCACJ,IAAI,SACJ,EACA,GAEE,EAAe,CACjB,IAAI,QACJ,CACE,CAAC,IAAI,SAAU,GACf,CAAC,IAAI,QAAS,IAEhB,CACE,IAAI,uBACJ,CAAC,IAAI,SAAU,GACf,IAAI,SACJ,IAAI,UAKJ,EAAgB,EAAO,KAAI,SAAU,GACvC,IAAI,EACF,EAAM,eAAiB,IAAI,EAAY,KAAO,IAAM,EAAM,KAAK,MAEjE,MAAO,CAAC,IAAI,UAAW,EAAM,CAAC,IAAI,mBAAoB,EAAK,EAAM,KACnE,IAEI,EAAe,EAAO,QAAO,SAAU,GACzC,OAAO,EAAM,OACf,IAmCA,OAlCA,EAAe,EAAa,KAAI,SAAU,GACxC,IAAI,EACF,EAAM,cACN,IAAI,EAAY,KAAO,IAAM,EAAM,KAAK,KAAO,SAEjD,MAAO,CAAC,IAAI,UAAW,EAAM,CAAC,IAAI,kBAAmB,EAAK,EAAM,KAClE,IA4BO,mBACL,CACE,IAAI,SACJ,EACA,CAAC,IAAI,UAAW,EAAkB,CAAC,IAAI,sBAAuB,IAC9D,CAAC,IAAI,UAAW,EAAgB,CAAC,IAAI,oBAAqB,KAEzD,OAAO,GACP,OAAO,GAEd,IAEA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAKpD,OAJA,cAAc,EAAG,IACjB,iBAAiB,EAAG,IACpB,iBAAiB,EAAG,IACpB,OAAO,YAAY,EAAG,GAAG,KAAM,EAAG,GAAI,EAAG,IAClC,KACT,IAGA,cAAc,0BAA0B,SAAU,GAChD,OAAO,mBAAmB,CACxB,IAAI,2BACJ,CAAC,IAAI,SAAU,EAAE,IAAI,MAEzB,IACA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GACxD,cAAc,EAAG,IACjB,IAAI,EAAO,OAAO,SAAS,EAAG,GAAG,MACjC,GAAI,EAAM,OAAO,EAAK,IAEpB,MAAM,IAAI,UACR,+CAAiD,EAAG,GAAG,KAE7D,IAGA,cAAc,iCAAiC,SAAU,GACvD,OAAO,mBAAmB,CACxB,IAAI,kCACJ,CAAC,IAAI,SAAU,EAAE,IAAI,MAEzB,IACA,eAAe,iCAAkC,EAAG,GAAG,SAAU,GAC/D,cAAc,EAAG,IACjB,IAAI,EAAO,OAAO,SAAS,EAAG,GAAG,MACjC,GAAI,EAAM,OAAO,EAAK,GAEpB,MAAM,IAAI,UACR,sDAAwD,EAAG,GAAG,KAEpE,IAIA,eAAe,8BAA+B,EAAG,GAAG,SAAU,GAC5D,IAAI,EAAO,EAAG,GACZ,EAAa,EAAG,GAChB,EAAM,EAAG,GACT,EAAS,EAAG,GACZ,EAAS,EAAG,GACZ,EAAS,EAAG,GAId,GAFA,cAAc,GACV,GAAY,iBAAiB,GAC7B,EAAK,CACP,cAAc,GACd,IAAI,EAAO,OAAO,IAAI,qBAAqB,EAAI,MAC/C,GAAI,EAEF,OAAO,CAGX,CACA,IAAW,EACX,IAAW,EACX,cAAc,GACd,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,IAAI,EAAO,EAAO,GAClB,cAAc,EAAK,IAAK,cACxB,cAAc,EAAK,IAAI,IAAK,cAC5B,EAAO,GAAK,CAAC,EAAK,IAAI,IAAI,KAAM,EAAK,KAAO,IAAI,WAClD,CACA,IAAI,EAAM,IAAI,OAAO,IAAI,EAAM,EAAY,EAAK,EAAQ,EAAQ,GAGhE,OAFI,IAAK,OAAO,IAAI,qBAAqB,EAAI,MAAQ,GAE9C,CACT,IAGA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GACxD,OAAO,EAAG,aAAc,OAAO,GACjC,IAGA,eAAe,qCAAsC,EAAG,GAAG,SAAU,GACnE,IAAI,EAAM,EAAG,GACX,EAAY,EAAG,GACf,EAAW,EAAG,GAMhB,OAJA,iBAAiB,GACb,GAAW,iBAAiB,GAC5B,GAAU,iBAAiB,GAExB,IAAI,OAAO,GAAG,EAAK,EAAW,EACvC,IAGA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,IAAI,EAAK,EAAG,GAGZ,OAFA,iBAAiB,GAEV,EAAG,oBACZ,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,IAAI,EAAM,EAAG,GAGb,OAFA,iBAAiB,GAEV,SAAU,GACf,IAAI,EAAM,EAAK,GAEf,GAAM,aAAe,OAEd,IAAI,EAAI,MAAQ,EAErB,OAAO,EAEP,IAAK,IAAI,EAAO,EAAI,IAAK,EAAM,EAAO,EAAK,WACzC,GAAI,GAAQ,EAAK,OAAO,EAE1B,OAAO,CACT,CATE,OAAO,CAUX,CACF,IAGA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,IAAI,EAAM,EAAG,GACX,EAAI,EAAG,GACT,iBAAiB,GACjB,eAAe,GACf,IAAK,IAAI,EAAO,EAAI,WAAY,EAAM,EAAO,EAAK,WAChD,GAAK,EAAK,OAAO,OAEnB,OAAO,SAAU,GACf,IAAI,EAAS,EAAK,GACd,EACF,EAAI,KAAK,KACT,IACA,EAAI,WAAW,GACf,KACA,SAAS,GACT,aACA,EAAI,KAAK,KACX,OAAO,SAAS,GAAS,GAGzB,IADA,IAAI,GAAa,EACR,EAAO,EAAO,IAAK,EAAM,EAAO,EAAK,WACxC,GAAQ,IAAK,GAAa,GAIhC,OAFA,OAAO,EAAY,GAEZ,EAAO,IAAI,EACpB,CACF,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAM,EAAG,GACX,EAAI,EAAG,GACT,iBAAiB,GACjB,eAAe,GACf,IAAK,IAAI,EAAO,EAAI,WAAY,EAAM,EAAO,EAAK,WAChD,GAAK,EAAK,OAAO,OAEnB,OAAO,SAAU,GACf,IAAI,EAAS,EAAK,GAChB,EAAM,EAAK,GACT,EAAY,EAAI,WAAW,GAE/B,cAAc,GACd,OACE,EAAO,MAAQ,EACf,EAAY,KAAO,SAAS,GAAU,aAAe,EAAI,KAAK,MAEhE,QACG,EAAO,IAAI,OACZ,EAAY,KAAO,EAAI,KAAK,KAAO,6BAGrC,EAAO,IAAI,EAAG,EAChB,CACF,IAIA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,IAAI,EAAM,EAAG,GACb,QAAI,SAAS,KACP,EAAI,IAAI,MAIhB,IAGA,eAAe,aAAc,EAAG,GAAG,SAAU,GAE3C,OADA,cAAc,EAAG,IACV,EAAG,GAAG,GACf,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,IACf,IAGA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GAEnD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,UACf,IAGA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAEhD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,GACf,IAGA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GAExD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,UACf,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAEpD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,MACf,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAEpD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,MACf,IAGA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GAExD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,OAAO,KAAI,SAAU,GAChC,OAAO,EAAM,IACf,GACF,IAGA,eAAe,wBAAyB,EAAG,GAAG,SAAU,GACtD,IAAI,EAAM,EAAG,GACX,EAAI,EAAG,GACT,iBAAiB,EAAG,IACpB,eAAe,GAEf,IAAK,IAAI,EAAO,EAAI,WAAY,EAAM,EAAO,EAAK,WAChD,GAAK,EAAK,OAAO,OAEnB,OAAO,EAAG,GAAG,OAAO,GAAG,OACzB,IAQA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,MAAM,IAAI,UAAU,SAAS,EAAG,IAClC,IA2EA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAG,aAAc,IAC1B,IAEA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,YAAY,EAAG,KACP,EAAG,GAAG,SAChB,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,SACf,IAMA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OAFA,YAAY,EAAG,IACf,EAAG,GAAG,QACC,KACT,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAO,EAAG,GACZ,EAAO,EAAG,GAIZ,OAHA,YAAY,GACZ,eAAe,GAER,IAAI,KAAK,EAAM,CAAC,IAAO,SAAU,GAGtC,OADA,EAAK,QACE,EAAG,EACZ,GACF,IAuCA,eAAe,+BAAgC,EAAG,GAAG,SAAU,GAC7D,IAAI,EAAO,EAAG,GACd,iBAAiB,GAEjB,IAAI,EAAO,IAAI,KAAK,aAEpB,OAAO,IAAI,KAAK,EAAM,CAAC,IAAO,SAAU,GAEtC,OADA,EAAK,QACE,EAAK,eACd,GACF,IAsBA,eAAe,WAAY,EAAG,GAAG,SAAU,GAIzC,OAHA,YAAY,EAAG,IACf,YAAY,EAAG,IACf,EAAG,GAAG,WAAW,EAAG,GAAG,OAChB,KACT,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAI3C,OAHA,YAAY,EAAG,IACf,cAAc,EAAG,IACjB,EAAG,GAAG,WAAW,EAAG,IACb,KACT,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAG1C,OAFA,YAAY,EAAG,IACf,EAAG,GAAG,WAAW,SAAS,EAAG,KACtB,KACT,IAQA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAO,GACT,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,EAAG,KAAO,GACnB,IAGA,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,QACf,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,SACf,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,OAAO,KAAK,aACd,IACA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,OAAO,KAAK,cACd,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,OAAO,KAAK,aACd,IAKA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,GADA,YAAY,EAAG,KACV,EAAG,GAAG,SACT,MAAM,IAAI,UAAU,4CAEtB,OADA,EAAG,GAAG,QACC,KACT,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,GADA,YAAY,EAAG,KACV,EAAG,GAAG,UACT,MAAM,IAAI,UAAU,8CAEtB,OADA,EAAG,GAAG,QACC,KACT,IAGA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAO,EAAG,IAAM,KAAK,cAGzB,OAFA,YAAY,GAEL,EAAK,YAAW,SAAU,GAC/B,OAAO,YAAY,KAAK,EAC1B,GACF,IAEA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,IAAI,EAAO,EAAG,IAAM,KAAK,eAGzB,OAFA,YAAY,EAAG,IACf,EAAK,WAAW,EAAG,GAAG,OACf,KACT,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAGxC,OAFW,EAAG,IAAM,KAAK,gBACpB,WAAW,MACT,KACT,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GAGxC,OAFW,EAAG,IAAM,KAAK,gBACpB,WAAW,WAAW,EAAG,KACvB,KACT,IACA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,IAAI,EAAO,EAAG,IAAM,KAAK,eAGzB,OAFA,YAAY,GACZ,EAAK,WAAW,SAAS,EAAG,KACrB,KACT,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,IAAI,EAAO,EAAG,IAAM,KAAK,eAGzB,OAFA,YAAY,GACZ,EAAK,WAAW,aAAa,EAAG,KACzB,KACT,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,IAAI,EAAO,EAAG,IAAM,KAAK,eAGzB,OAFA,YAAY,GACZ,EAAK,WAAW,aAAa,EAAG,KACzB,KACT,IAmHA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAQ,EAAG,EACb,IAGA,eAAe,cAAe,EAAG,MAAM,SAAU,GAC/C,OAAO,EAAG,QAAO,SAAU,EAAK,GAC9B,OAAO,EAAM,CACf,GACF,IAGA,eAAe,cAAe,EAAG,MAAM,SAAU,GAC/C,OAAO,EAAG,QAAO,SAAU,EAAK,GAC9B,OAAO,EAAM,CACf,GACF,IAGA,eAAe,cAAe,EAAG,MAAM,SAAU,GAC/C,OAAO,EAAG,QAAO,SAAU,EAAK,GAC9B,OAAO,EAAM,CACf,GACF,IAGA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAQ,EAAG,GAAK,EAAG,IAAQ,EAAG,GAAK,EAAG,EACxC,IAGA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAGlD,IAFA,IAAI,EAAI,KAAK,IAAI,EAAG,IAClB,EAAM,EACI,GAAL,EAAQ,IAAM,EACX,EAAJ,GAAO,IAEb,OAAO,CACT,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAG/C,IAFA,IAAI,EAAI,KAAK,IAAI,EAAG,IAClB,EAAM,EACI,GAAL,EAAQ,IAAM,EACnB,IAEF,OAAO,CACT,IAGA,eAAe,wBAAyB,EAAG,GAAG,SAAU,GACtD,IAAI,EAAI,KAAK,IAAI,EAAG,IAClB,EAAM,EACR,GAAS,GAAL,EAAQ,OAAQ,EACpB,KAAY,GAAL,EAAQ,IAAM,EAAG,CACtB,GAAQ,EAAJ,EAAO,OAAO,EAClB,GACF,CACF,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,SAAU,EAAG,GAAM,GAAK,EAAG,GAC7B,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,IAAI,EAAO,GAAK,EAAG,GACnB,OACG,EAAQ,EAAG,IAAM,EAAG,IACnB,EAAO,EAAG,EAEhB,IAGA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,UADc,GAAK,EAAG,IACP,EAAG,KAAO,EAAG,EAC9B,IAGA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GACvD,IAAI,EAAM,EAAG,GACX,EAAQ,EAAG,GAGT,KACC,GAHG,EAAG,KAIP,GAAK,EACT,OAAQ,EAJA,EAAG,IAIY,GAAY,EAAO,CAC5C,IAGA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,OAAO,EAAG,IAAM,EAAI,EAAG,IAAM,EAAG,GAAK,EAAG,KAAO,EAAG,EACpD,IAGA,eAAe,gCAAiC,EAAG,GAAG,SAAU,GAC9D,OAAO,EAAG,IAAM,EAAG,EACrB,IAGA,eAAe,iCAAkC,EAAG,GAAG,SAAU,GAC/D,OAAO,EAAG,IAAM,EAAG,EACrB,IAGA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,IAAI,EAAI,EAAG,GACT,EAAQ,EAAG,GACX,EAAM,EAAG,GACT,EAAQ,EAAG,GACT,EAAQ,EAAM,EAClB,GAAI,GAAS,EAAG,OAAO,EAGvB,IAAI,MAAiB,GAAK,GAAO,IAAM,EAGnC,KAAU,GAAK,IAAS,GAAK,EACjC,OAAQ,GAHa,IAFrB,GAAS,GAEoC,GAAe,EAAQ,IAGnC,GAAY,EAAO,CACtD,IAGA,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAM1D,IALA,IAAI,EAAM,EAAG,GACX,EAAI,EAAG,GACP,EAAQ,EAAG,GACX,EAAM,EAAG,GACP,MAAiB,GAAK,GAAO,IAAM,EAC9B,EAAI,EAAG,EAAI,EAAM,EAAO,IAAK,IAAe,EAAG,CACtD,IACI,EAAS,EAAM,EAAI,EACnB,EAAO,GAAK,EAChB,EAAO,GAHgB,EAAb,IAGY,GAAa,EAAO,CAC5C,CACA,OAAO,CACT,IAaA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,OAAO,IAAI,UAAU,UAAU,QAAS,UAAU,SACpD,IAGA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,OAAO,IAAI,UAAU,UAAU,SAAU,UAAU,UACrD,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAG/C,OAFA,iBAAiB,EAAG,IACpB,iBAAiB,EAAG,IACb,IAAI,UAAU,EAAG,GAAI,EAAG,GACjC,IAIA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAO,EAAG,aAAc,SAC1B,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,OAAO,MACtB,IAcA,MAAM,eAAiB,SAAU,EAAM,EAAK,GAE1C,OAAO,IAAI,KAAK,EAAK,UAAW,CAAC,IAAM,SAAU,GAC/C,IAAI,EAAS,EAAG,GACZ,EAAkB,EAAK,gBAAgB,GAE3C,OAAK,EAME,KAAK,QAAQ,EAAiB,CACnC,KAAM,SAAU,GAEd,OAAO,IAAI,KAAK,EAAK,WAAY,CAAC,EAAK,EAAK,IAC9C,EACA,OAAQ,SAAU,EAAO,GACvB,GAAI,EAEF,OAAO,EAAU,SAAS,EAAM,EAEpC,EACA,OAAQ,WAEN,OAAO,EAAU,aAAa,EAChC,IAlBO,EAAU,aAAa,EAoBlC,GACF,EAGA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GACT,EAAS,EAAG,GAGd,OAFA,iBAAiB,GAEV,eAAe,EAAM,EAAK,CAC/B,SAAU,SAAU,GAClB,OAAO,EAAK,EACd,EACA,aAAc,SAAU,GACtB,OAAO,CACT,GAEJ,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GACT,EAAQ,EAAG,GAIb,OAHA,iBAAiB,GACjB,OAAO,EAAK,QAAS,4BAEd,eAAe,EAAM,EAAK,CAC/B,SAAU,SAAU,GAElB,OADA,EAAK,GAAK,EACH,KACT,EACA,aAAc,SAAU,GAEtB,OADA,EAAK,SAAS,EAAQ,EAAK,GACpB,KACT,GAEJ,IAGA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAClD,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GAIX,OAHA,iBAAiB,GACjB,OAAO,EAAK,QAAS,4BAEd,eAAe,EAAM,EAAK,CAC/B,SAAU,SAAU,EAAM,GAExB,OADA,EAAK,YAAY,EAAQ,GAClB,KACT,EACA,aAAc,SAAU,GACtB,OAAO,KACT,GAEJ,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GAGX,OAFA,iBAAiB,GAEV,eAAe,EAAM,EAAK,CAC/B,SAAU,SAAU,GAClB,OAAO,CACT,EACA,aAAc,SAAU,GACtB,OAAO,CACT,GAEJ,IAGA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAClD,IAAI,EAAO,EAAG,GACZ,EAAM,EAAG,GACT,EAAO,EAAG,GACV,EAAS,EAAG,GAKd,OAJA,iBAAiB,GACjB,OAAO,EAAK,QAAS,4BACrB,iBAAiB,GAEV,eAAe,EAAM,EAAK,CAC/B,SAAU,SAAU,EAAM,GAExB,OAAO,IAAI,KAAK,EAAM,CAAC,EAAK,KAAK,SAAU,GAGzC,OADA,EAAK,GAAK,EAAG,GACN,KACT,GACF,EACA,aAAc,SAAU,GAEtB,OAAO,IAAI,KAAK,EAAM,CAAC,IAAS,SAAU,GAGxC,OADA,EAAK,SAAS,EAAQ,EAAK,EAAG,IACvB,KACT,GACF,GAEJ,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,OAAoB,IAAV,EAAG,MAA6B,EAAG,GAEjD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,YAAY,EAC3B,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAIjD,OAHA,iBAAiB,EAAG,IACpB,OAAO,EAAG,GAAG,QAAS,4BACtB,EAAG,GAAG,QACC,KACT,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,MACf,IAEA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,OADA,iBAAiB,EAAG,IACb,IAAI,OAAO,CAAC,EAAG,GAAG,OAAQ,EAAG,GAAG,UACzC,IAKA,eAAe,iCAAkC,EAAG,GAAG,SAAU,GAE/D,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,UACf,IAEA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GAExD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,SACf,IAEA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GAEnD,OADA,iBAAiB,EAAG,IACb,EAAG,GAAG,OACf,IAKA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,OAAO,UAAU,UACnB,IAEA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,UAAU,WACnB,IAEA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAO,UAAU,cACnB,IAEA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,UAAU,WACnB,IAMA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,YAAY,EAAG,IACf,IAAI,EAAU,EAAG,GAAG,WAEpB,OADgB,IAAI,YAAY,SAAS,GACxB,UACnB,IAGA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,OADA,gBAAgB,EAAG,IACZ,EAAG,GAAG,UAAU,UACzB,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAEjD,OADA,gBAAgB,EAAG,IACZ,EAAG,GAAG,UAAU,SACzB,IAGA,eAAe,uBAAwB,EAAG,GAAG,SAAU,GAErD,OADA,gBAAgB,EAAG,IACZ,EAAG,GAAG,UAAU,cACzB,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAE/C,OADA,gBAAgB,EAAG,IACZ,EAAG,GAAG,aACf,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAGjD,OAFA,cAAc,EAAG,IACjB,gBAAgB,EAAG,IACZ,EAAG,GAAG,UAAU,EAAG,GAC5B,IAGA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAGjD,OAFA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACZ,EAAG,GAAG,UAAU,EAAG,GAC5B,IAGA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OAFA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACZ,EAAG,GAAG,SAAS,EAAG,GAC3B,IAGA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAQ/C,OAPA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACnB,OACE,EAAG,GAAG,YAAc,EAAG,GAAG,UAC1B,2CACA,kBAEK,EAAG,GAAG,MAAM,EAAG,GACxB,IAGA,eAAe,wBAAyB,EAAG,GAAG,SAAU,GAGtD,OAFA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACZ,EAAG,GAAG,aAAa,EAAG,GAC/B,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAGpD,OAFA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACZ,EAAG,GAAG,WAAW,EAAG,GAC7B,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAEpD,OADA,gBAAgB,EAAG,IACZ,EAAG,GAAG,YACf,IAGA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GAGpD,OAFA,gBAAgB,EAAG,IACnB,gBAAgB,EAAG,IACZ,EAAG,GAAG,WAAW,EAAG,GAC7B,IASA,cAAc,sBAAsB,SAAU,GAE5C,IAAI,EAAY,EAAE,IAAI,IACtB,OACE,SAAS,GACT,gCACA,sBAEF,EAAY,EAAU,KAEtB,IAAI,EAAU,EAAE,IAAI,IAAI,IACxB,OACE,OAAO,GACP,sCACA,sBAEF,EAAU,EAAQ,WAElB,IAAI,EAAmB,EAAE,IAAI,IAAI,IAAI,IACrC,OACE,SAAS,GACT,uCACA,sBAEF,EAAmB,EAAiB,KAGpC,IAAI,EAAY,IAAI,YAAY,SAAS,GAGzC,cAAc,GAAW,SAAU,GAEjC,QAAQ,MAAM,EAAE,KAAM,wBAAyB,GAE/C,IAAI,EAAM,EAAE,IAAI,IAYhB,OAXA,cAAc,EAAK,GAGnB,OACE,EAAU,QAAQ,SAAS,GAC3B,EAAI,KACF,qCACA,SAAS,EAAU,SACrB,GAGK,KAAK,IAAI,SAAU,EAC5B,IAGA,cAAc,GAAkB,SAAU,GACxC,YAAY,EAAE,IAAK,GAEnB,IAAI,EAAU,EAAE,IAAI,WAepB,OAZA,EAAQ,SAAQ,SAAU,GACxB,cAAc,EAAK,GACnB,OACE,EAAU,QAAQ,SAAS,GAC3B,EAAI,KACF,qCACA,SAAS,EAAU,SACrB,EAEJ,IAGO,IAAI,YAAY,QAAQ,EAAW,EAC5C,GACF,IAWA,eAAe,OAAQ,EAAG,GAAG,SAAU,EAAI,GAIzC,IAAI,EAAO,EAAG,GAEd,OADY,IAAI,YAAY,GACf,SAAS,SAAS,GACjC,IA+BA,cAAc,SAAS,SAAU,GAC/B,GAAI,EAAE,MAAQ,IACZ,MAAM,IAAI,UAAU,gCAEtB,GAAI,EAAE,IAAI,MAAQ,IAChB,MAAM,IAAI,UACR,wCAA0C,aAAa,IAG3D,IAAI,EAAO,EAAE,IAAI,IAGjB,OAAO,IAAI,KACT,IAAI,uBACJ,IAAI,KACF,IAAI,KACF,IAAI,UACJ,IAAI,KACF,IACA,IAAI,KAAK,IAAI,KAAK,IAAI,gBAAiB,IAAI,KAAK,EAAM,MAAO,QAKvE,IAGA,cAAc,eAAe,SAAU,GACrC,GAAI,EAAE,MAAQ,IACZ,MAAM,IAAI,UAAU,sCAEtB,GAAI,EAAE,IAAI,MAAQ,IAChB,MAAM,IAAI,UACR,8CAAgD,aAAa,IAGjE,IAAI,EAAO,EAAE,IAAI,IAGjB,OAAO,IAAI,KACT,IAAI,uBACJ,IAAI,KAAK,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,IAAK,IAAI,KAAK,EAAM,OAAQ,KAE1E,IAGA,IAAI,MAAQ,SAAU,GACpB,OAAI,EAAQ,UACH,EAAQ,QAEV,IAAI,KAAK,EAAQ,QAAS,IAAI,SAAU,GAC7C,eAAe,EAAG,IAClB,IAAI,EAAc,EAAG,GACrB,OAAI,EAAQ,UAEH,EAAQ,SAEf,EAAQ,YAAY,GACb,MAAM,GAEjB,GACF,EACA,eAAe,QAAS,EAAG,GAAG,SAAU,EAAI,GAE1C,OADA,eAAe,EAAG,IACX,MAAM,EAAG,GAClB,IAGA,eAAe,WAAY,EAAG,GAAG,SAAU,EAAI,GAC7C,OAAO,EAAG,aAAc,WAC1B,IAGA,eAAe,eAAgB,EAAG,GAAG,SAAU,EAAI,GACjD,IAAI,EAAM,EAAG,GACb,OAAI,aAAe,YACV,EAEA,YAAY,KAAK,EAE5B,IAKA,eAAe,sBAAuB,EAAG,GAAG,SAAU,EAAI,GAExD,OADA,iBAAiB,EAAG,IACb,YAAY,MAAM,EAAG,GAC9B,IAQA,eAAe,iBAAkB,EAAG,GAAG,SAAU,EAAI,GACnD,IAAI,EACJ,MAAM,EAAY,EAAG,GAIf,EAAe,SAAU,GAC7B,GAAkB,GAAd,EAAI,OAEN,OAAO,EACF,CAEL,MAAM,EAAY,EAClB,OAAI,EACK,IAAI,KAAK,EAAW,CAAC,EAAI,KAAM,IACpC,EAAe,EAAI,GACZ,MAGT,EAAe,EAAI,GACZ,EAEX,CACF,EAEA,GAAI,EACF,OAAO,IAAI,KAAK,EAAW,CAAC,EAAG,KAAM,IACnC,EAAe,EACR,KAEJ,CACL,MAAM,EAAe,EAAG,GAExB,OADA,EAAe,EACR,CACT,CACF,IAGA,cAAc,gBAAgB,SAAU,GACtC,MAAM,EAAQ,EAAE,IAAI,IAAI,WAClB,EAAO,EAAE,IAAI,IACb,EAAW,EAAM,KAAI,IAAM,WAM3B,EAAc,QACf,EAAM,KAAI,CAAC,EAAM,IAAM,KAAK,EAAS,GAAI,EAAK,IAAI,QAEjD,EAAe,KACnB,IAAI,SACJ,QACK,EAAM,KAAI,CAAC,EAAM,IAClB,KAAK,IAAI,QAAS,EAAS,GAAI,KAAK,EAAK,IAAK,EAAS,SAKvD,EAAS,KAAK,IAAI,UAAW,IAAK,GAClC,EAAQ,KAAK,IAAI,UAAW,KAAK,IAAK,IACtC,EAAQ,KAAK,IAAI,UAAW,IAAK,GAEvC,OAAO,KACL,IAAI,OACJ,EACA,KAAK,IAAI,gBAAiB,EAAQ,EAAO,GAG7C,IAYA,eAAe,OAAQ,EAAG,GAAG,SAAU,GACrC,IAAI,EAAQ,EAAG,GACX,EAAQ,EAAG,IAAM,EACjB,OAAiB,IAAV,EAAG,GAAmB,EAAI,EAAG,GACxC,eAAe,GACf,cAAc,GACd,cAAc,GAId,IAFA,IAAI,EAAI,GACN,EAAI,EACG,EAAI,EAAG,EAAI,EAAO,IACzB,EAAE,KAAK,GACP,GAAK,EAEP,OAAO,cAAc,EACvB,IAEA,IAAI,UAAY,SAAU,GACxB,IAAI,EAAM,OAAO,EAAK,KAAO,UAAU,EAAK,KAAO,EAAK,IACpD,EAAM,OAAO,EAAK,KAAO,UAAU,EAAK,KAAO,EAAK,IACxD,OAAO,IAAI,KAAK,EAAK,EACvB,EAEA,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,OAAI,OAAO,EAAG,IACL,UAAU,EAAG,IAEb,GAEX,IAKA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,OADA,cAAc,EAAG,IACV,IAAI,KAAK,YAAY,EAAG,GACjC,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,OAAO,IAAI,KAAK,YAClB,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAElD,GADA,YAAY,EAAG,MACT,EAAG,aAAc,KAAK,cAC1B,MAAM,IAAI,MACR,gEAEJ,OAAO,EAAG,GAAG,eACf,IASA,cAAc,WAAW,SAAU,GACjC,OAAO,OAAO,EAAE,KAAM,kBAAmB,WACzC,IAAI,EAAU,EAAE,IAAI,IACpB,OAAO,OAAO,EAAE,IAAI,KAAM,qBAAsB,WAChD,IAAI,EAAa,EAAE,IAAI,IAAI,IACvB,EAAO,EAAE,IAAI,IAAI,IAErB,OAAO,mBAAmB,CACxB,IAAI,oBACJ,CAAC,IAAI,UAAW,IAAK,GACrB,IAAI,KAAK,IAAI,UAAW,IAAI,KAAK,EAAS,KAE9C,IAaA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAE7C,OAAO,IAAI,IACb,IA+BA,eAAe,QAAS,EAAG,GAAG,SAAU,GACtC,OAAO,EAAG,aAAc,IAC1B,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAEhD,OADA,YAAY,EAAG,IACkB,IAA1B,EAAG,GAAG,iBACf,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GAGjD,OADA,YAAY,EAAG,IACR,EAAG,GAAG,iBACf,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,YACf,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,YACf,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,UACf,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GAEzC,OADA,YAAY,EAAG,IACR,EAAG,GAAG,SACf,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAE3C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,WAAa,CAC5B,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,aACf,IAGA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAE9C,OADA,YAAY,EAAG,IACR,EAAG,GAAG,QACf,IAYA,MAAM,WAAa,CACjB,QAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OACpD,aAAc,CACZ,SACA,SACA,UACA,YACA,WACA,SACA,YAEF,MAAO,CACL,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,OAEF,WAAY,CACV,UACA,WACA,QACA,QACA,MACA,OACA,OACA,SACA,YACA,WACA,WACA,aAIE,YAAc,SAAU,EAAM,GAClC,IAAI,EAAU,SAAU,GACtB,OAAO,EAAI,GAAK,IAAM,EAAI,GAAK,CACjC,EACI,EAAW,SAAU,GACvB,OAAO,EAAI,GAAK,IAAM,EAAI,GAAK,CACjC,EAcI,EAAS,CACX,EAAG,SAAU,GACX,OAAO,WAAW,QAAQ,EAAE,SAC9B,EACA,EAAG,SAAU,GACX,OAAO,WAAW,aAAa,EAAE,SACnC,EACA,EAAG,SAAU,GACX,OAAO,WAAW,MAAM,EAAE,WAC5B,EACA,EAAG,SAAU,GACX,OAAO,WAAW,WAAW,EAAE,WACjC,EACA,EAAG,SAAU,GACX,OAAO,EAAE,UACX,EACA,EAAG,SAAU,GACX,OAAO,EAAQ,EAAE,UACnB,EACA,EAAG,SAAU,GACX,OAAO,EAAO,EAAE,GAAK,EAAO,EAAE,GAAK,EAAO,EAAE,EAC9C,EACA,EAAG,SAAU,GACX,OAAO,EAAS,EAAE,UACpB,EACA,EAAG,SAAU,GACX,OAAO,EAAE,aAAe,EAAE,kBAAoB,GAChD,EACA,EAAG,SAAU,GACX,OAAO,WAAW,MAAM,EAAE,WAC5B,EACA,EAAG,SAAU,GACX,OAAO,EAAQ,EAAE,WACnB,EACA,EAAG,SAAU,GACX,IAAI,EAAI,EAAE,WACV,OAAO,EAAQ,EAAI,GAAK,EAAI,EAAI,GAClC,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,+BAChB,EACA,EAAG,SAAU,GACX,OAAO,EAAS,EAAE,WACpB,EACA,EAAG,SAAU,GACX,IAAI,EAAI,EAAE,WACV,OAAO,EAAS,EAAI,GAAK,EAAI,EAAI,GACnC,EACA,EAAG,SAAU,GACX,OAAO,EAAQ,EAAE,WAAa,EAChC,EACA,EAAG,SAAU,GACX,OAAO,EAAQ,EAAE,aACnB,EACA,EAAG,SAAU,GACX,MAAO,IACT,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,+BAChB,EACA,EAAG,SAAU,GACX,OAAO,EAAE,WAAa,GAAK,KAAO,IACpC,EACA,EAAG,SAAU,GACX,OACE,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,EAEzE,EACA,EAAG,SAAU,GACX,OAAO,KAAK,MAAM,EAAE,UAAY,IAClC,EACA,EAAG,SAAU,GACX,OAAO,EAAQ,EAAE,aACnB,EACA,EAAG,SAAU,GACX,MAAO,IACT,EACA,EAAG,SAAU,GACX,OAAO,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,EAC1D,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,oCAChB,EACA,EAAG,SAAU,GACX,OAjGa,SAAU,GACzB,IAAI,EAAU,IAAI,KAAK,EAAE,cAAe,EAAG,GACvC,EAAU,IAAI,KAAK,EAAE,cAAe,EAAG,GAQ3C,OANI,EAAQ,UAAY,WAAW,QAAQ,QAAQ,OACjD,EAAQ,QAAQ,EAAQ,WAAa,EAAQ,SAAW,IAExD,EAAQ,QAAQ,EAAQ,WAAa,EAAI,EAAQ,SAAW,IAGvD,KAAK,MAAM,EAAI,GAAW,MAAW,EAC9C,CAsFW,CAAW,EACpB,EACA,EAAG,SAAU,GACX,OAAO,EAAE,QACX,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,oCAChB,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,oCAChB,EACA,EAAG,SAAU,GACX,OAAO,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,GAAK,IAAM,EAAO,EAAE,EAC1D,EACA,EAAG,SAAU,GACX,OAAO,EAAE,cAAgB,GAC3B,EACA,EAAG,SAAU,GACX,OAAO,EAAE,aACX,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,6BAChB,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,oCAChB,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,kDAChB,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IACR,+DAEJ,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IAAI,sDAChB,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IACR,8EAEJ,EACA,EAAG,SAAU,GACX,MAAM,IAAI,IACR,qEAEJ,GAGF,OAAO,EAAO,QAAQ,gBAAgB,SAAU,EAAK,GACnD,IAAI,EAAO,EAAO,GAClB,OAAI,EAAa,EAAK,GACR,KAAL,EAAiB,IACd,CACd,GACF,EAGA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAG7C,OAFA,YAAY,EAAG,IAEX,EAAG,IACL,cAAc,EAAG,IACV,YAAY,EAAG,GAAI,EAAG,KACjB,EAAG,GAAG,UACtB,IAIA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OADA,cAAc,EAAG,IACV,IAAI,KAAK,KAAK,MAAM,EAAG,IAChC,IAKA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAI,EAAG,GAEX,GADA,eAAe,GACX,EAAI,EAAG,MAAM,IAAI,MAAM,6CACtB,OAAO,KAAK,MAAM,KAAK,SAAW,EAAG,GAC5C,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,KAAK,QACd,IAcA,eAAe,SAAU,EAAG,MAAM,SAAU,GAC1C,GAAqB,iBAAV,EAAG,GACZ,IAAI,EAAO,KACT,EAAa,EAAG,aACb,IAAc,IAAV,EAAG,GAAc,CAC1B,EAAG,QACC,EAAO,KACT,EAAa,EAAG,OACpB,MAAO,IAAc,IAAV,EAAG,GAAa,CACzB,EAAG,QACC,EAAO,KAAK,eACd,EAAa,EAAG,OACpB,KAAO,CACD,EAAO,EAAG,QACZ,EAAa,EAAG,QAClB,YAAY,EACd,CAEA,IAAI,EAAM,EACP,QAAQ,UAAU,SAAU,GAE3B,OADA,OAAO,EAAG,OAAS,EAAG,mCAAoC,UAC3C,MAAX,EAAwB,WAAW,EAAG,SAC9B,SAAS,EAAG,QAC1B,IACC,QAAQ,KAAM,MACd,QAAQ,KAAM,KACjB,OAAI,GACF,EAAK,WAAW,GACT,OAEA,CAEX,IAKA,MAAM,cAAgB,SAAU,GAE9B,OADA,QAAQ,KAAK,aAAa,EAAG,KAAK,GAC3B,KACT,EACA,eAAe,WAAY,EAAG,EAAG,eACjC,eAAe,8BAA+B,EAAG,EAAG,eACpD,eAAe,SAAU,EAAG,EAAG,eAK/B,eAAe,gBAAiB,EAAG,MAAM,SAAU,GACjD,IAAI,EAAM,GACV,OAAO,EAAI,OAAO,MAAM,EAAK,EAC/B,IAGA,eAAe,cAAe,EAAG,GAAG,SAAU,GAE5C,OADA,cAAc,EAAG,IACV,IAAI,EAAG,GAChB,IAOA,IAAI,aAAe,CACjB,cACA,gBACA,QACA,YACA,8BACA,0DACA,QAAS,QACT,gBACA,oBACA,MACA,QACA,YACA,YACA,gBACA,oBACA,kBACA,kBACA,cACA,cACA,cACA,kBACA,wBACA,sCACA,wBACA,MACA,kBACA,sBACA,gBACA,SAAU,aACV,YAAa,aACb,UACA,UACA,cACA,gBACA,oBACA,kBACA,wBACA,oBACA,MAAO,UACP,QACA,oBACA,oBACA,wBACA,gBACA,kBACA,kBACA,oBACA,cACA,sBACA,oBACA,UACA,UACA,4BACA,sCACA,UACA,cACA,YACA,UACA,QACA,QAAS,YACT,oBACA,cACA,kBACA,sBACA,sBACA,IAAK,QACL,OAAQ,WACR,QACA,cACA,cACA,cACA,cAEA,8BACA,8BACA,8BACA,oDACA,4BACA,gDACA,wBAEA,4BACA,8BACA,wBACA,8BACA,4BACA,wBACA,4BACA,wBACA,wBACA,wBACA,4BACA,kCACA,kDACA,8BACA,gCACA,8BACA,kCACA,wBACA,eAGF,QAAQ,KAAO,SAAU,EAAK,GAC5B,KAAK,eAAe,WAAW,GAAO,EAAa,GAAK,MAC1D,EAEA,QAAQ,EAAI,WACV,KAAK,eAAe,WAClB,MAAQ,MAAM,UAAU,WAAW,IAAI,SAAS,KAAK,KAEzD,EAEA,MAAM,cAAgB,IAAI,KAAK,aAAY,SAAU,GACnD,MAAM,EAAM,SAAS,cAAc,eAC7B,EAAO,SAAS,cAAc,QACpC,EAAK,UACH,+EACF,EAAI,YAAY,GAChB,EAAK,iBAAiB,UAAU,WAC9B,MAAM,EAAQ,SAAS,cAAc,wBAAwB,MAG7D,OAFA,EAAK,SACL,EAAS,IACF,CACT,GACF,IAEM,eAAiB,IAAI,KAAK,cAAa,SAAU,GACrD,MAAM,EAAM,SAAS,cAAc,eACnC,IAAK,EAAK,OACV,MAAM,EAAO,SAAS,cAAc,QACpC,EAAK,UAAY,OAAO,GAAK,QAAQ,MAAO,QAAQ,QAAQ,KAAM,UAClE,EAAI,YAAY,EAClB,IAEM,cAAgB,eAGhB,IAAM,OAAO,OAEnB,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,IAAI,EAAO,EAAG,IAAM,KAAK,cAEzB,OADA,YAAY,GACL,EAAK,YAAY,GAAQ,GAClC,IAKA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAI,IAAI,EAAG,IAAI,KAAK,SACX,IAAI,EAAG,IAAI,IAAI,IAEf,IAAI,EAAG,IAAI,OAEtB,IACA,cAAc,iBAAkB,kBAChC,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,OAAO,IAAI,EAAG,IAAI,GAAG,WACvB,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,IAAI,EAAG,IAAI,QACpB,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,OAAO,IAAI,EAAG,IAAI,MACpB,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,OAAO,IAAI,EAAG,IAAI,MACpB,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,IAAI,EAAG,IAAI,QACpB,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,IAAI,EAAG,IAAI,KAAK,EAAG,GAC5B,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,OAAO,IAAI,EAAG,IAAI,YAAY,EAAG,GACnC,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,IAAI,EAAG,IAAI,OAAO,EAAG,GAC9B,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAClD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,gCAAiC,EAAG,GAAG,SAAU,GAC9D,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,uBAAwB,EAAG,GAAG,SAAU,GACrD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,aAAc,EAAG,GAAG,SAAU,GAC3C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,IAAI,EAAG,IAAI,QACb,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,mBAAoB,EAAG,GAAG,SAAU,GACjD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GAEvD,OADA,cAAc,EAAG,IACb,EAAG,GAAG,WAAW,SAEZ,IAAI,EAAG,IAAI,KAAK,EAAG,IAEnB,IAAI,EAAG,IAAI,KAAK,EAAG,GAE9B,IAEA,IAAI,wBAA0B,SAAU,GAEtC,OADA,cAAc,EAAG,IACb,EAAG,GAAG,WAAW,SAEZ,IAAI,EAAG,IAAI,KAAK,EAAG,GAAI,EAAG,IAE1B,IAAI,EAAG,IAAI,KAAK,EAAG,GAAI,EAAG,GAErC,EACA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GAExD,OADA,UAAU,0BAA2B,MAAO,4BACrC,wBAAwB,EACjC,IACA,eAAe,2BAA4B,EAAG,EAAG,yBAEjD,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAO,IAAI,EAAG,IAAI,QACpB,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,OAAO,IAAI,EAAG,IAAI,OACpB,IAEA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GAExD,OADA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,SAAS,EAAG,GAChC,IAEA,IAAI,uBAAyB,SAAU,GAErC,OADA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,SAAS,EAAG,GAChC,EACA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GAEvD,OADA,UAAU,yBAA0B,MAAO,2BACpC,uBAAuB,EAChC,IACA,eAAe,0BAA2B,EAAG,EAAG,wBAEhD,IAAI,0BAA4B,SAAU,GAExC,OADA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,YAAY,EAAG,GACnC,EACA,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAE1D,OADA,UAAU,4BAA6B,MAAO,8BACvC,0BAA0B,EACnC,IACA,eAAe,6BAA8B,EAAG,EAAG,2BAEnD,IAAI,0BAA4B,SAAU,GAExC,OADA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,YAAY,EAAG,GACnC,EACA,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAE1D,OADA,UAAU,4BAA6B,MAAO,8BACvC,0BAA0B,EACnC,IACA,eAAe,6BAA8B,EAAG,EAAG,2BAEnD,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAC1D,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GACvD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,uBAAwB,EAAG,GAAG,SAAU,GACrD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,OAAO,IAAI,OAAO,IAAI,EAAG,IAAI,QAAS,IAAI,EAAG,IAAI,SACnD,IACA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,2BAA4B,EAAG,GAAG,SAAU,GACzD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GACvD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,yBAA0B,EAAG,GAAG,SAAU,GACvD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAC1D,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,4BAA6B,EAAG,GAAG,SAAU,GAC1D,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,mCAAoC,EAAG,GAAG,SAAU,GACjE,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,wBAAyB,EAAG,GAAG,SAAU,GACtD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GACxD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,0BAA2B,EAAG,GAAG,SAAU,GACxD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,sBAAuB,EAAG,GAAG,SAAU,GACpD,MAAM,IAAI,IAAI,sBAChB,IACA,eAAe,iBAAkB,EAAG,GAAG,SAAU,GAC/C,OAAO,IAAI,EAAG,IAAI,OACpB,IAUA,MAAM,0BAA4B,SAAU,GAE1C,IAAI,GADJ,EAAO,EAAK,YACI,QACZ,aAAgB,aAAY,EAAO,EAAK,MAC5C,IAAI,EAAI,EAAK,MAAM,cACf,IACF,EAAO,EAAE,GACT,EAAK,QAAQ,IAAI,SAAU,EAAE,MAE/B,EAAI,EAAK,MAAM,iBAEb,EAAO,EAAE,GACT,EAAK,QAAQ,IAAI,MAAO,EAAE,KAI5B,IAFA,IAAI,EAAW,GACX,EAAI,CAAC,IAAM,GACN,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC3B,EAAK,aAAc,YACrB,EAAE,KAAK,IAAM,EAAK,GAAG,KAAO,KAAO,EAAK,EAAI,GAAK,KACjD,KAEI,EAAK,aAAc,KACrB,EAAS,KAAK,0BAA0B,EAAK,KAC1C,EAAS,KAAK,EAAK,IAM5B,OAHA,EAAE,KAAK,KACP,EAAE,KAAK,EAAS,KAAK,KACrB,EAAE,KAAK,KAAO,EAAO,KACd,EAAE,KAAK,GAChB,EAEM,SAAW,SAAU,EAAM,GAC/B,OAAI,IAAS,MACe,IAAnB,EAAK,EAAK,MACP,SAAS,EAAK,IAAK,EACjC,EACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAQ5C,OAAI,SAAS,EAAG,IAPO,SAAU,GAC/B,MACkB,iBAAT,GACP,aAAgB,YAChB,aAAgB,IAEpB,IAES,IAAI,0BAA0B,EAAG,KAAK,GAEtC,GAEX,IAEA,MAAM,gBAAkB,SAAU,GAChC,OAAI,IAAI,GAAU,KAAK,SACd,IAAI,GAAU,MAEd,OAAO,IAAI,GAAU,OAEhC,EACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,GAChD,OAAO,gBAAgB,EAAG,GAC5B,IAKA,eAAe,OAAQ,EAAG,GAAG,SAAU,EAAI,GACzC,IAAI,EAAO,EAAG,GACd,cAAc,GACd,IAAI,EAAQ,IAAI,YAAY,GAC5B,OAAO,IAAI,OAAM,SAAU,GACzB,IAAI,KAAK,EAAM,CACb,SAAU,OACV,SAAU,4BACV,QAAS,SAAU,GAEjB,EAAM,SAAS,GAAM,WACnB,OAAO,EAAM,OAAO,MACtB,GACF,EACA,MAAO,WACL,MAAM,IAAI,MAAM,uCAAyC,EAC3D,GAEJ,GACF,IAGA,MAAM,SAAW,SAAU,EAAK,EAAO,GACrC,IAAI,EAAS,IAAI,YAAa,CAAE,IAAK,IACrC,IAAI,QAAQ,OAAO,GAEnB,IAAI,EAAU,IAAI,SAAS,aAAe,EAAQ,KAE9C,IAAW,IAEb,YAAW,WACT,IAAY,IAAS,WAAW,UAAU,OAAQ,GACpD,GAAG,GACP,EAEA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,IAAI,EAAO,EAAG,GACV,EAAQ,EAAG,GAIf,OAHA,cAAc,GACd,cAAc,GAEP,IAAI,OAAM,SAAU,GACzB,SAAS,EAAM,UAAY,GAAO,WAChC,EAAM,OAAO,MACf,GACF,GACF,IAMA,MAAM,QAAU,SAAU,GAEpB,EAAG,OAAS,IAAe,IAAV,EAAG,KACtB,EAAG,GAAK,IAGV,IAAI,EAAI,IAAI,MAAM,KAAM,GACxB,OAAI,EAAE,OAAS,GACN,CAIX,EACA,eAAe,IAAK,EAAG,EAAG,SAC1B,eAAe,UAAW,EAAG,EAAG,SAChC,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,IAAI,EAAG,IAAI,EACpB,IAEA,eAAe,aAAc,EAAG,GAAG,SAAU,GAG3C,OAFA,cAAc,EAAG,IACjB,IAAI,EAAG,IAAI,IAAI,EAAG,GAAI,EAAG,IAClB,KACT,IACA,eAAe,YAAa,EAAG,GAAG,SAAU,GAE1C,OADA,cAAc,EAAG,IACV,IAAI,EAAG,IAAI,IAAI,EAAG,GAC3B,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,cAAc,EAAG,IACjB,IAAI,EAAM,EAAG,GAAG,QAAQ,MAAO,QAAQ,QAAQ,MAAO,sBAEtD,OADA,IAAI,EAAG,IAAI,KAAK,GACT,KACT,IACA,eAAe,cAAe,EAAG,GAAG,SAAU,GAC5C,OAAO,gBAAgB,EAAG,GAC5B,IAKA,eAAe,eAAgB,EAAG,GAAG,SAAU,EAAI,GACjD,MAAM,IAAI,MAAM,4DAClB,IACA,eAAe,eAAgB,EAAG,GAAG,SAAU,EAAI,GACjD,IAAI,EAAW,EAAG,GAChB,EAAS,EAAG,GACZ,EAAO,EAAG,GACR,EAAU,SAAU,GACtB,OAAO,IAAI,YAAY,GAAM,eAAe,EAAM,CAAC,GACrD,EAEA,OADA,IAAI,GAAU,GAAG,EAAQ,GAClB,CACT,IACA,eAAe,kBAAmB,EAAG,GAAG,SAAU,EAAI,GACpD,IAAI,EAAW,EAAG,GAChB,EAAS,EAAG,GACZ,EAAU,EAAG,GAEf,OADA,IAAI,GAAU,IAAI,EAAQ,GACnB,KACT,IACA,eAAe,WAAY,EAAG,GAAG,SAAU,GACzC,IAAI,EAAW,EAAG,GAChB,EAAS,EAAG,GACV,EAAO,IAAI,GACf,EAAK,oBAAsB,EAAK,qBAAuB,CAAC,EAExD,IAAI,EAAe,EAAK,oBAAoB,GAO5C,OANI,GAGF,EAAK,IAAI,EAAQ,GAGZ,IAAI,OAAM,SAAU,GACzB,IAAI,EAAU,SAAU,GAGtB,OAFA,EAAK,oBAAoB,QAAU,EACnC,EAAK,IAAI,EAAQ,GACV,EAAM,OAAO,EACtB,EAEA,EAAK,oBAAoB,GAAU,EACnC,EAAK,GAAG,EAAQ,EAClB,GACF,IAKA,eAAe,UAAW,EAAG,MAAM,SAAU,GAC3C,MAAM,IAAI,MAAM,WAClB,IACA,eAAe,uBAAwB,EAAG,GAAG,SAAU,GAKrD,OAJA,QAAQ,KACN,yEAEF,IAAI,EAAG,IAAI,QACJ,KACT,IACA,eAAe,qBAAsB,EAAG,GAAG,SAAU,GACnD,MAAM,IAAI,MAAM,WAClB,IACA,eAAe,wBAAyB,EAAG,GAAG,SAAU,GACtD,OAAO,IAAI,EAAG,IAAI,OAAO,EAAG,GAC9B,IACA,eAAe,oBAAqB,EAAG,GAAG,SAAU,GAClD,MAAM,IAAI,MAAM,WAClB,IASA,eAAe,eAAgB,EAAG,GAAG,SAAU,GAC7C,IAAI,EAAO,EAAG,GAGd,OAFA,cAAc,GAEP,IAAI,OAAM,SAAU,GACzB,IAAI,IACF,GACA,SAAU,GACR,EAAM,OAAO,EACf,GACA,OAEJ,GACF,IAEA,eAAe,YAAa,EAAG,GAAG,SAAU,GAC1C,IAAI,EAAO,EAAG,GACd,cAAc,GACd,IAAI,EAAQ,EAAG,GACf,YAAY,GACZ,IAAI,EAAI,gBAAgB,GAExB,OAAO,IAAI,OAAM,SAAU,GACzB,IAAI,KACF,EACA,GACA,SAAU,GACR,EAAM,OAAO,EACf,GACA,OAEJ,GACF,IAEA,MAAM,eAAiB,GACvB,eAAe,gBAAiB,EAAG,GAAG,SAAU,GAC9C,IAAI,EAAM,EAAG,GACb,cAAc,GAGd,IADA,IAAI,EAAW,eACN,EAAI,EAAG,EAAI,EAAS,QAAiC,OAAhB,EAAS,GAAlB,KACrC,IAAI,EAAc,EAGlB,OAFA,GAAO,uCAAyC,EAAc,IAEvD,IAAI,OAAM,SAAU,GACzB,EAAS,GAAe,SAAU,GAChC,EAAM,OAAO,GACb,EAAS,GAAe,IAC1B,EACA,IAAI,EAAS,IAAI,YAAa,CAAE,IAAK,IACrC,IAAI,QAAQ,OAAO,EACrB,GACF,IAKA,eAAe,QAAS,EAAG,GAAG,SAAU,GAEtC,OADA,MAAM,EAAG,IACF,KACT,IACA,eAAe,UAAW,EAAG,GAAG,SAAU,GACxC,OAAO,QAAQ,EAAG,GACpB,IAMA,MAAM,SAAW,qBACX,WAAa,GACb,cAAgB,GAEtB,MAAM,OACJ,WAAA,CAAY,GACV,KAAK,SAAW,GAAY,EAAE,aAAa,IAAM,KACjD,KAAK,OACP,CAEA,KAAA,GACM,KAAK,UAEP,EAAE,KAAK,UAAU,QAEnB,KAAK,QAAU,EACf,KAAK,SAAW,GAChB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,WAAY,CACnB,CAEA,MAAA,CAAO,GACL,OAAO,aAAe,OAA0B,iBAAV,EAAI,EAC5C,CAEA,QAAA,CAAS,EAAK,EAAO,GACnB,IAAI,EAAI,GACJ,EAAO,GACT,EAAO,GACL,EAAQ,GAAS,EACjB,EAAS,IAAU,EACvB,MAAM,GACH,OACA,KAAI,KACH,GAAQ,QAAQ,IAEpB,MAAM,EAAQ,GACX,OACA,KAAI,KACH,GAAQ,QAAQ,IAGpB,GAAK,EAAO,+BAAiC,EAAI,GAAK,UAEtD,IADA,IAAI,EAAI,IACC,EAAI,aAAc,QAAU,EAAI,EAAI,QAC7B,YAAV,EAAI,GACN,GACE,qCACA,KAAK,SAAS,EAAI,IAClB,UACC,GAAK,SAAW,KAAK,SAAS,EAAI,IACvC,IAGF,IADI,EAAI,EAAI,SAAQ,GAAK,UAClB,EAAI,EAAI,OAAQ,IACjB,KAAK,OAAO,EAAI,IAClB,GAAK,KAAK,SACR,EAAI,GACJ,GAAK,EAAI,OAAS,EAAI,EAAQ,EAAQ,GACtC,IAGF,GAAK,GAAK,EAAI,OAAS,EAAI,EAAO,EAClC,GAAK,KAAK,SAAS,EAAI,KAErB,GAAK,EAAI,OAAS,IAAG,GAAK,UAGhC,OADA,GAAK,IACE,EAAS,EAAI,KAAK,SAAS,EACpC,CAEA,QAAA,CAAS,GACP,IAAI,EAAQ,EAAE,MAAM,WAEpB,GAAI,EAAM,OAAS,WAAY,CAC7B,IAAI,EACF,+GAEA,KAAK,QACL,iBACE,EACF,wCAA0C,KAAK,QAAU,KAG3D,OADA,KAAK,UACE,CACL,EAAM,MAAM,EAAG,YAAY,KAAK,QAChC,EACA,EACA,EAAM,MAAM,YAAY,KAAK,QANhB,UAQb,KAAK,GACT,CACE,OAAO,CAEX,CAEA,UAAA,CAAW,EAAK,GACd,GAAI,QAAmC,OAAO,QAAQ,GACtD,IAAI,EAAI,UAGR,GAAkB,GAAd,EAAI,OACN,GAAK,4DACA,GAAI,EAAO,EAAI,OAAQ,CAC5B,IAAI,EAAI,EAAI,OAAS,EACrB,GACE,8BACA,EADA,+BAIA,SAAS,KAAK,SAAS,EAAI,IAAK,eAChC,YACJ,CAGA,IAAK,IAAI,EAAI,EAAO,EAAG,GAAK,EAAG,IAC7B,GACE,gCACA,EADA,aAIA,SAAS,KAAK,SAAS,EAAI,IAAK,eAChC,aAEJ,OAAO,EAAI,UACb,CAEA,WAAA,CAAY,GACV,IAAI,EAAI,GACR,IAAK,IAAI,KAAK,EAEZ,EAAE,KAAK,EAAE,YAEX,MAAO,YAAc,EAAE,KAAK,KAAO,IACrC,CAEA,YAAA,CAAa,GACX,IAAK,EAAK,MAAO,aACjB,GAAkB,GAAd,EAAI,OAAa,MAAO,KAG5B,IADA,IAAI,EAAU,KACL,EAAI,EAAG,EAAI,KAAK,SAAS,OAAQ,IACpC,KAAK,SAAS,IAAM,IAAK,EAAU,GAE1B,MAAX,IACF,EAAU,KAAK,SAAS,OACxB,KAAK,SAAS,KAAK,IAGrB,MAAM,EAAO,EAAI,KACjB,MAAO,CACL,IACA,EACA,kDACA,KAAK,SAAS,EAAI,UAClB,+CACA,EAAI,OACJ,sDACA,EAAI,cACJ,6CACA,SAAS,KAAK,SAAS,GAAO,MAC9B,KAAK,GACT,CAEA,QAAA,CAAS,GACP,GAAI,GAA6B,mBAAf,EAAI,QAAuB,OAAO,EAAI,UAEtD,IAAI,EAAI,SAAS,GAEjB,MADS,mBAAL,IAAwB,EAAI,KAAK,YAAY,IAC1C,OAAO,EAElB,CAEA,IAAA,CAAK,GACH,IAAI,EAAI,GACJ,aAAe,QACjB,GAAK,UAGL,GACE,mDAGA,KAAK,QACL,iBAGF,OAAO,KAAK,GAAK,QACf,SAAU,GACR,IAAI,EAAQ,EAAI,GACL,KAAP,GAAqB,SAAP,IAChB,EACS,KAAP,EAAa,KAAK,aAAa,GAAS,KAAK,SAAS,GACxD,GACE,WACA,EADA,0BAIA,EACA,aAEN,EAAE,KAAK,OAET,GACE,uBACC,KAAK,OAAO,EAAO,GAChB,KAAK,SAAS,EAAO,GACrB,KAAK,SAAS,EAAO,IACzB,QAGF,GACE,2DACA,KAAK,WAAW,EAAW,MAAG,EAAO,GACrC,aACF,GAAK,YAEL,EAAI,OAAO,QAAQ,IAAQ,SAE7B,IAAI,EAAW,EAAE,SAAU,CAAE,MAAO,OAAS,KAAK,UAClD,EAAS,KAAK,GACd,EAAE,KAAK,UAAU,OAAO,GACvB,SAAU,GACT,EAAE,UAAW,KAAK,QAAQ,KAAK,UAAU,MACvC,WACE,KAAK,aAAa,GAClB,KAAK,WACP,EAAE,KAAK,MAEX,EAAE,KAAK,KAPP,CAOa,KAAK,SAClB,EAAS,OACT,KAAK,SACP,CAKA,OAAA,CAAQ,GACN,OAAO,EAAE,QAAU,EAAG,KAAK,SAC7B,CAEA,YAAA,CAAa,GACP,EAAI,IAAG,EAAI,KAAK,QAAU,GAE1B,GAAK,GAAK,GAAK,KAAK,UACtB,KAAK,QAAQ,KAAK,KAAK,OACvB,KAAK,IAAM,EACX,KAAK,QAAQ,KAAK,KAAK,OAE3B,CAEA,SAAA,CAAU,GACJ,GAAK,KAAK,KAAO,KAAK,IAAM,KAAK,SAAS,KAAK,QAAQ,KAAK,KAAK,OAEjE,GAAK,KAAK,IAAM,GAAO,KAAK,IAAM,EAAM,KAAK,UAAS,KAAK,KAAO,GAEtE,KAAK,QAAQ,KAAK,KAAK,MACzB,CAEA,SAAA,GACE,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAS,IAC5B,GAAK,KAAK,KAAK,KAAK,QAAQ,GAAG,OAErC,KAAK,WAAY,CACnB,CAEA,WAAA,GACE,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAS,IAAK,KAAK,QAAQ,GAAG,OAEvD,KAAK,WAAY,CACnB,CAEA,gBAAA,GACM,KAAK,UAAW,KAAK,cACpB,KAAK,WACZ,EAGF,OAAO,YAAc,SAAU,GAC7B,EAAE,QAAU,EAAG,KAAK,UAAU,QAChC,EAMA,MAAM,qBAAuB,WAC3B,IAAI,EAAS,KACb,MAAM,EAAa,SAAS,cAAc,wBACtC,IACF,EAAS,IAAI,OAAO,IAItB,MAAM,EAAU,SAAU,EAAG,GAE3B,GADA,WAAW,KAAK,cAAc,WAAW,EAAE,QAAU,MACjD,EACF,EAAO,KAAK,GACZ,EAAO,UAAU,OACZ,IAAuB,oBAAZ,UAA2B,QAAQ,MAGnD,MAAM,EAFN,QAAQ,MAAM,EAAE,QAGlB,CACF,EAEM,EAAM,SAAU,GACpB,MAAM,EAAO,IAAI,WAAW,YAAY,GACxC,IACE,EAAK,SAAS,GAAQ,WAAa,GACrC,CAAE,MAAO,GACP,EAAQ,EACV,CACF,EAGA,IAAI,EAAS,GACb,IAAK,MAAM,KAAK,SAAS,iBAAiB,gCACxC,GAAU,EAAE,UAEd,IAAK,MAAM,KAAK,SAAS,iBACvB,oCAEA,GAAU,EAAE,UAGV,EAAO,OAAS,GAAG,EAAI,GAG3B,OAAO,iBAAiB,oBAAoB,WAC1C,IAAK,MAAM,KAAK,SAAS,iBACvB,kCAEA,EAAI,EAAE,UAEV,GACF,EAEA,aAAa,SAAU,EACvB,aAAa,QAAU,QACvB,aAAa,KAAK,cAAgB,cAClC,aAAa,KAAK,eAAiB,eACnC,aAAa,KAAK,cAAgB,cAClC,aAAa,eAAiB,eAC9B,aAAa,OAAS,OAGtB,OAAO,WAAa,OAAO,YAAc,CAAC,EAC1C,OAAO,OAAO,OAAO,WAAY,cACjC,sCAEe","file":"/npm/biwascheme@0.8.3/release/biwascheme.mjs","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/biwascheme@0.8.3/release/biwascheme.mjs\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","/*\n * BiwaScheme 0.8.3 - R6RS/R7RS Scheme in JavaScript\n *\n * Copyright (c) 2007-2025 Yutaka HARA (http://www.biwascheme.org/)\n * Licensed under the MIT license.\n */\n//\n// variables\n//\nconst TopEnv = {};\nconst CoreEnv = {};\n\n//\n// Nil\n// javascript representation of empty list( '() )\n//\nconst nil = {\n  toString: function () {\n    return \"nil\";\n  },\n  to_write: function () {\n    return \"()\";\n  },\n  to_array: function () {\n    return [];\n  },\n  length: function () {\n    return 0;\n  },\n};\n\n//\n// #<undef> (The undefined value)\n// also used as #<unspecified> values\n//\nconst undef = new Object();\nundef.toString = function () {\n  return \"#<undef>\";\n};\n\n//\n// Configurations\n//\n\n// Maximum depth of stack trace\n// (You can also set Interpreter#max_trace_size for each Interpreter)\nconst max_trace_size = 40;\n\n// Stop showing deprecation warning\nconst suppress_deprecation_warning = false;\n\n// Actual values are set by rollup (see rollup.config.js)\nconst VERSION = \"0.8.3\";\nconst GitCommit = \"c52385d0ca3aa4dc58ec3b4a78c9651701a29530\";\n\n// utility functions to replace underscore equivalents\n\n// https://underscorejs.org/docs/modules/uniqueId.html\nvar idCounter = 0;\nfunction uniqueId(prefix) {\n  var id = ++idCounter + \"\";\n  return prefix ? prefix + id : id;\n}\n\n// https://underscorejs.org/docs/modules/escape.html\nconst escapeMap = {\n  \"&\": \"&amp;\",\n  \"<\": \"&lt;\",\n  \">\": \"&gt;\",\n  '\"': \"&quot;\",\n  \"'\": \"&#x27;\",\n  \"`\": \"&#x60;\",\n};\n\nfunction escape(string) {\n  return Object.entries(escapeMap).reduce(\n    (string, [target, sub]) => string.replaceAll(target, sub),\n    string\n  );\n}\n\n//\n// Scheme symbols\n//\n\nconst Symbols = {};\n\nclass BiwaSymbol {\n  constructor(str) {\n    this.name = str;\n    Symbols[str] = this;\n  }\n\n  inspect() {\n    return \"'\" + this.name;\n    //return \"#<Symbol '\"+this.name+\"'>\";\n  }\n\n  toString() {\n    return \"'\" + this.name;\n  }\n\n  to_write() {\n    return this.name;\n  }\n}\n\nconst Sym = function (name, leaveCase) {\n  if (Symbols[name] === undefined) {\n    return new BiwaSymbol(name);\n  } else if (!(Symbols[name] instanceof BiwaSymbol)) {\n    //pre-defined member (like 'eval' in Firefox)\n    return new BiwaSymbol(name);\n  } else {\n    return Symbols[name];\n  }\n};\n\nconst gensym = function (prefix = \"__gensym\") {\n  return Sym(uniqueId(prefix));\n};\n\n//\n// pause object (facility to stop/resume interpreting)\n//\nclass Pause {\n  //new (on_pause: javascript function calling setTimeout, Ajax.Request, ..)\n  constructor(on_pause) {\n    this.on_pause = on_pause;\n  }\n\n  //save state of interpreter\n  set_state(intp, x, f, c, s) {\n    this.interpreter = intp;\n    this.x = x;\n    this.f = f;\n    this.c = c;\n    this.s = s;\n  }\n\n  //call this when ready (to fire setTimeout, Ajax.Request..)\n  ready() {\n    this.on_pause(this);\n  }\n\n  //restart calculation\n  resume(value) {\n    return this.interpreter.resume(true, value, this.x, this.f, this.c, this.s);\n  }\n}\n\n//\n// Port\n//\n\n// (eof-object)\nconst eof = new Object();\n\neof.to_write = function () {\n  return \"#<eof>\";\n};\n\nclass Port {\n  constructor(is_in, is_out) {\n    this.is_open = true;\n    this.is_binary = false; //??\n    this.is_input = is_in;\n    this.is_output = is_out;\n  }\n\n  close() {\n    // close port\n    this.is_open = false;\n  }\n\n  inspect() {\n    return \"#<Port>\";\n  }\n\n  to_write() {\n    return \"#<Port>\";\n  }\n}\n\n//\n// string ports (srfi-6)\n//\nPort.StringOutput = class extends Port {\n  constructor() {\n    super(false, true);\n    this.buffer = [];\n  }\n\n  put_string(str) {\n    this.buffer.push(str);\n  }\n\n  output_string(str) {\n    return this.buffer.join(\"\");\n  }\n};\n\nPort.StringInput = class extends Port {\n  constructor(str) {\n    super(true, false);\n    this.str = str;\n  }\n\n  get_string(after) {\n    return after(this.str);\n  }\n};\n\nPort.NullInput = class extends Port {\n  constructor() {\n    super(true, false);\n  }\n\n  get_string(after) {\n    // Never give them anything!\n    return after(\"\");\n  }\n};\n\nPort.NullOutput = class extends Port {\n  constructor(output_function) {\n    super(false, true);\n    this.output_function = output_function;\n  }\n\n  put_string(str) {}\n};\n\nPort.CustomOutput = class extends Port {\n  constructor(output_function) {\n    super(false, true);\n    this.output_function = output_function;\n  }\n\n  put_string(str) {\n    this.output_function(str);\n  }\n};\n\nPort.CustomInput = class extends Port {\n  constructor(input_function) {\n    super(true, false);\n    this.input_function = input_function;\n  }\n\n  get_string(after) {\n    var input_function = this.input_function;\n    return new Pause(function (pause) {\n      input_function(function (input) {\n        pause.resume(after(input));\n      });\n    });\n  }\n};\n\n// User must set the current input/output\nPort.current_input = new Port.NullInput();\nPort.current_output = new Port.NullOutput();\nPort.current_error = new Port.NullOutput();\n\n// A Scheme lambda\nclass Closure {\n  // body: Intermediate Language (JS array)\n  // freevars: Captured free variables\n  // dotpos: The position of `.` in the parameter list. -1 if none\n  // expected_args: Expected number of args or `undefined`\n  constructor(body, freevars, dotpos, expected_args) {\n    this.body = body;\n    this.freevars = freevars;\n    this.dotpos = dotpos;\n    this.expected_args = expected_args;\n  }\n\n  to_write() {\n    return \"#<Closure>\";\n  }\n}\n\nconst isClosure = function (obj) {\n  return obj instanceof Closure;\n};\n\n//\n\n/**\n * An S-expression.\n * @typedef {(Pair|BiwaSymbol|number|string)} Form\n * A Scheme procedure.\n * @typedef {function|Closure} Procedure\n **/\n\nconst isNil = function (obj) {\n  return obj === nil;\n};\n\nconst isUndef = function (obj) {\n  return obj === undef;\n};\n\nconst isBoolean = (s) => typeof s === \"boolean\"; // Return true if arg is either true or false\n\n//isNumber is defined in number.js (Return true if arg is scheme number)\n\nconst isString = (s) => typeof s === \"string\";\n\nconst isFunction = (s) => typeof s === \"function\";\n\nconst isSymbol = function (obj) {\n  return obj instanceof BiwaSymbol;\n};\n\nconst isPort = function (obj) {\n  return obj instanceof Port;\n};\n\nconst isVector = function (obj) {\n  return obj instanceof Array;\n};\n\n// procedure: Scheme closure or JavaScript function\n// valid argument for anywhere function is expected\nconst isProcedure = function (obj) {\n  return isClosure(obj) || typeof obj === \"function\";\n};\n\n//\n// comaprator\n//\n// Return true when a < b\nconst lt = function (a, b) {\n  if (typeof a !== typeof b) {\n    return compareFn(typeof a, typeof b);\n  }\n  return a < b;\n};\n\n//\n// Errors\n//\n\nclass BiwaError extends Error {\n  constructor(msg, form = null) {\n    const info = form === null ? \"\" : `: ${to_write(form)}`;\n    const message = `${msg}${info}`;\n    super(message);\n    this.form = form;\n  }\n\n  toString() {\n    return this.message;\n  }\n}\n\nclass Bug extends BiwaError {\n  constructor(msg) {\n    super(\"[BUG] \" + msg);\n  }\n}\n\n// currently used by \"raise\"\nclass UserError extends BiwaError {\n  constructor(msg) {\n    super(msg);\n    this.message = msg;\n  }\n}\n\n//\n// Set - set of string\n// contents must be string (or at least sortable)\n//\nclass BiwaSet {\n  constructor(/*args*/) {\n    this.arr = [];\n    var i;\n    for (i = 0; i < arguments.length; i++) this.arr[i] = arguments[i];\n  }\n\n  equals(other) {\n    if (this.arr.length != other.arr.length) return false;\n\n    var a1 = [...this.arr];\n    var a2 = [...other.arr];\n    a1.sort();\n    a2.sort();\n    for (var i = 0; i < this.arr.length; i++) {\n      if (a1[i] != a2[i]) return false;\n    }\n    return true;\n  }\n\n  set_cons(item) {\n    var o = new BiwaSet(item);\n    o.arr = [...this.arr];\n    o.arr.push(item);\n    return o;\n  }\n\n  set_union(/*args*/) {\n    var o = new BiwaSet();\n    o.arr = [...this.arr];\n\n    for (var k = 0; k < arguments.length; k++) {\n      var s2 = arguments[k];\n      if (!(s2 instanceof BiwaSet))\n        throw new BiwaError(\"set_union: arguments must be a set\");\n\n      for (var i = 0; i < s2.arr.length; i++) o.add(s2.arr[i]);\n    }\n    return o;\n  }\n\n  set_intersect(s2) {\n    if (!(s2 instanceof BiwaSet))\n      throw new BiwaError(\"set_intersect: arguments must be a set\");\n\n    var o = new BiwaSet();\n    for (var i = 0; i < this.arr.length; i++)\n      if (s2.member(this.arr[i])) o.add(this.arr[i]);\n    return o;\n  }\n\n  set_minus(s2) {\n    if (!(s2 instanceof BiwaSet))\n      throw new BiwaError(\"set_minus: arguments must be a set\");\n\n    var o = new BiwaSet();\n    for (var i = 0; i < this.arr.length; i++)\n      if (!s2.member(this.arr[i])) o.add(this.arr[i]);\n    return o;\n  }\n\n  add(item) {\n    if (!this.member(item)) {\n      this.arr.push(item);\n    }\n  }\n\n  member(item) {\n    for (var i = 0; i < this.arr.length; i++)\n      if (this.arr[i] == item) return true;\n\n    return false;\n  }\n\n  rindex(item) {\n    for (var i = this.arr.length - 1; i >= 0; i--)\n      if (this.arr[i] == item) return this.arr.length - 1 - i;\n\n    return null;\n  }\n\n  index(item) {\n    for (var i = 0; i < this.arr.length; i++) if (this.arr[i] == item) return i;\n\n    return null;\n  }\n\n  inspect() {\n    return \"Set(\" + this.arr.join(\", \") + \")\";\n  }\n\n  toString() {\n    return this.inspect();\n  }\n\n  size() {\n    return this.arr.length;\n  }\n}\n\n//\n// Pair\n// cons cell\n//\n\nclass Pair {\n  constructor(car, cdr) {\n    this.car = car;\n    this.cdr = cdr;\n  }\n\n  // Returns `this.car.car`. If `err` is given and `this.car` is not a pair,\n  // throws `err`.\n  caar(err) {\n    return this._get([\"car\", \"car\"], err);\n  }\n  cadr(err) {\n    return this._get([\"cdr\", \"car\"], err);\n  }\n  cdar(err) {\n    return this._get([\"car\", \"cdr\"], err);\n  }\n  cddr(err) {\n    return this._get([\"cdr\", \"cdr\"], err);\n  }\n  _get(props, err = \"unexpected\") {\n    let x = this;\n    for (const p of props) {\n      if (x.hasOwnProperty(p)) {\n        x = x[p];\n      } else {\n        throw err;\n      }\n    }\n    return x;\n  }\n\n  first() {\n    return this.car;\n  }\n  second() {\n    return this.cdr.car;\n  }\n  third() {\n    return this.cdr.cdr.car;\n  }\n  fourth() {\n    return this.cdr.cdr.cdr.car;\n  }\n  fifth() {\n    return this.cdr.cdr.cdr.cdr.car;\n  }\n\n  // returns array containing all the car's of list\n  // '(1 2 3) => [1,2,3]\n  // '(1 2 . 3) => [1,2]\n  to_array() {\n    var ary = [];\n    for (var o = this; o instanceof Pair; o = o.cdr) {\n      ary.push(o.car);\n    }\n    return ary;\n  }\n\n  length() {\n    var n = 0;\n    for (var o = this; o instanceof Pair; o = o.cdr) {\n      n++;\n    }\n    return n;\n  }\n\n  // Return the last cdr\n  last_cdr() {\n    var o;\n    for (o = this; o instanceof Pair; o = o.cdr);\n    return o;\n  }\n\n  // calls the given func passing each car of list\n  // returns cdr of last Pair\n  forEach(func) {\n    for (var o = this; o instanceof Pair; o = o.cdr) {\n      func(o.car);\n    }\n    return o;\n  }\n\n  // Alias of `forEach` (for backward compatibility)\n  foreach(func) {\n    for (var o = this; o instanceof Pair; o = o.cdr) {\n      func(o.car);\n    }\n    return o;\n  }\n\n  // calls the given async func passing each car of list\n  // returns cdr of last Pair\n  async eachAsync(func) {\n    for (var o = this; o instanceof Pair; o = o.cdr) {\n      await func(o.car);\n    }\n    return o;\n  }\n\n  // Returns an array which contains the resuls of calling func\n  // with the car's as an argument.\n  // If the receiver is not a proper list, the last cdr is ignored.\n  // The receiver must not be a cyclic list.\n  map(func) {\n    var ary = [];\n    for (var o = this; isPair(o); o = o.cdr) {\n      ary.push(func(o.car));\n    }\n    return ary;\n  }\n\n  // Returns a new list made by applying `func` to each element\n  mapList(func) {\n    return array_to_list(this.map(func));\n  }\n\n  async mapAsync(func) {\n    const ary = [];\n    for (var o = this; isPair(o); o = o.cdr) {\n      ary.push(await func(o.car));\n    }\n    return array_to_list(ary);\n  }\n\n  // Destructively concat the given list to the receiver.\n  // The receiver must be a proper list.\n  // Returns the receiver.\n  concat(list) {\n    var o = this;\n    while (o instanceof Pair && o.cdr != nil) {\n      o = o.cdr;\n    }\n    o.cdr = list;\n    return this;\n  }\n\n  // returns human-redable string of pair\n  inspect(conv) {\n    conv || (conv = inspect);\n    var a = [];\n    var last = this.foreach(function (o) {\n      a.push(conv(o));\n    });\n    if (last != nil) {\n      a.push(\".\");\n      a.push(conv(last));\n    }\n    return \"(\" + a.join(\" \") + \")\";\n  }\n\n  toString() {\n    return this.inspect();\n  }\n\n  to_display(to_display) {\n    return this.inspect(to_display);\n  }\n\n  to_write() {\n    return this.inspect(to_write);\n  }\n}\n// Note: '() is not a pair in scheme\nconst isPair = function (obj) {\n  return obj instanceof Pair;\n};\n\n// Returns true if obj is a proper list\n// Note: isList returns true for '()\nconst isList = function (obj) {\n  if (obj === nil) {\n    // Empty list\n    return true;\n  }\n  if (!(obj instanceof Pair)) {\n    // Argument isn't even a pair\n    return false;\n  }\n\n  var tortoise = obj;\n  var hare = obj.cdr;\n  while (true) {\n    if (hare === nil) {\n      // End of list\n      return true;\n    }\n    if (hare === tortoise) {\n      // Cycle\n      return false;\n    }\n    if (!(hare instanceof Pair)) {\n      // Improper list\n      return false;\n    }\n\n    if (hare.cdr === nil) {\n      // End of list\n      return true;\n    }\n    if (!(hare.cdr instanceof Pair)) {\n      // Improper list\n      return false;\n    }\n\n    hare = hare.cdr.cdr;\n    tortoise = tortoise.cdr;\n  }\n};\n\n// Creates a list out of the arguments, optionally converting any nested arrays into nested lists if the deep argument is true.\n// Example:\n//   BiwaScheme.List(1, 2, [3, 4]) ;=> (list 1 2 (vector 3 4))\n//   BiwaScheme.deep_array_to_list(1, 2, [3, 4]) ;=> (list 1 2 (list 3 4))\nconst array_to_list_ = function (ary, deep) {\n  var list = nil;\n  for (var i = ary.length - 1; i >= 0; i--) {\n    var obj = ary[i];\n    if (deep && Array.isArray(obj) && !obj.is_vector) {\n      obj = array_to_list_(obj, deep);\n    }\n    list = new Pair(obj, list);\n  }\n  return list;\n};\n\n/** Shallow: List(1, 2, [3]) == (list 1 2 (vector 3 4))\n * @returns {Pair}\n */\nconst List = function () {\n  var ary = Array.from(arguments);\n  return array_to_list_(ary, false);\n};\n\n/** Shallow: array_to_list(1, 2, [3]) == (list 1 2 (vector 3 4))\n * @param {Array} ary\n * @returns {Pair}\n */\nconst array_to_list = function (ary) {\n  return array_to_list_(ary, false);\n};\n\n// Deep: deep_array_to_list(1, 2, [3, 4]) == (list 1 2 (list 3 4))\n// deep_array_to_list([1, 2, 3]) - deep\nconst deep_array_to_list = function (ary) {\n  return array_to_list_(ary, true);\n};\n\nconst Cons = function (car, cdr) {\n  return new Pair(car, cdr);\n};\n\nconst js_obj_to_alist = function (obj) {\n  if (obj === undefined) {\n    return nil;\n  }\n  var arr = [];\n  Object.keys(obj).forEach(function (key) {\n    arr.push(new Pair(key, obj[key]));\n  });\n  var alist = array_to_list(arr);\n  return alist;\n};\n\nconst alist_to_js_obj = function (alist) {\n  if (alist === nil) {\n    return {};\n  }\n  var obj = {};\n  alist.foreach(function (item) {\n    obj[item.car] = item.cdr;\n  });\n  return obj;\n};\n\n//\n// _writer.js: Functions to convert objects to strings\n//\n\n// Truncate long string with '...'\nconst truncate = function (str, length) {\n  const truncateStr = \"...\";\n  return str.length > length ? str.slice(0, length) + truncateStr : str;\n};\n\n//\n// write\n//\n\nconst write_simple = function (obj) {\n  if (obj === undefined) return \"undefined\";\n  else if (obj === null) return \"null\";\n  else if (typeof obj === \"function\")\n    return (\n      \"#<Function \" +\n      (obj.fname\n        ? obj.fname\n        : obj.toSource\n        ? truncate(obj.toSource(), 40)\n        : \"\") +\n      \">\"\n    );\n  else if (typeof obj === \"string\")\n    return (\n      '\"' +\n      obj\n        .replace(/\\\\|\\\"/g, function ($0) {\n          return \"\\\\\" + $0;\n        })\n        .replace(/\\x07/g, \"\\\\a\")\n        .replace(/\\x08/g, \"\\\\b\")\n        .replace(/\\t/g, \"\\\\t\")\n        .replace(/\\n/g, \"\\\\n\")\n        .replace(/\\v/g, \"\\\\v\")\n        .replace(/\\f/g, \"\\\\f\")\n        .replace(/\\r/g, \"\\\\r\") +\n      '\"'\n    );\n  else if (Array.isArray(obj))\n    return (\n      \"#(\" +\n      obj\n        .map(function (e) {\n          return write_simple(e);\n        })\n        .join(\" \") +\n      \")\"\n    );\n  else if (typeof obj.to_write == \"function\") return obj.to_write();\n  else if (isNaN(obj) && typeof obj == \"number\") return \"+nan.0\";\n  else {\n    switch (obj) {\n      case true:\n        return \"#t\";\n      case false:\n        return \"#f\";\n      case Infinity:\n        return \"+inf.0\";\n      case -Infinity:\n        return \"-inf.0\";\n    }\n  }\n  return inspect(obj);\n};\n\n//\n// display\n//\n\nconst to_display = function (obj) {\n  if (typeof obj === \"undefined\") return \"undefined\";\n  else if (obj === null) return \"null\";\n  else if (obj.to_display) return obj.to_display(to_display);\n  else if (typeof obj.valueOf() == \"string\") return obj;\n  else if (obj instanceof BiwaSymbol) return obj.name;\n  else if (obj instanceof Array)\n    return \"#(\" + obj.map(to_display).join(\" \") + \")\";\n  else return write_simple(obj);\n};\n\n//\n// inspect (for debugging)\n//\n\nconst inspect = function (object, opts) {\n  try {\n    if (typeof object === \"undefined\") return \"undefined\";\n    if (object === null) return \"null\";\n    if (object === true) return \"#t\";\n    if (object === false) return \"#f\";\n    if (object.inspect) return object.inspect();\n    if (typeof object === \"string\") {\n      return '\"' + object.replace(/\"/g, '\\\\\"') + '\"';\n    }\n    if (Array.isArray(object)) {\n      return \"[\" + object.map(inspect).join(\", \") + \"]\";\n    }\n    if (object instanceof Map) {\n      var s = \"#<Map\";\n      for (const [k, v] of object) {\n        s += ` ${inspect(k, opts)}: ${inspect(v, opts)}`;\n      }\n      return s + \">\";\n    }\n\n    if (opts && opts[\"fallback\"]) {\n      return opts[\"fallback\"];\n    } else {\n      return object.toString();\n    }\n  } catch (e) {\n    if (e instanceof RangeError) return \"...\";\n    throw e;\n  }\n};\n\n//\n// write/ss (write with substructure)\n//\n\n// Uses datum label if cyclic. Otherwise does not\nfunction write(obj) {\n  const wstate = _preprocess(obj);\n  if (wstate.cyclic) {\n    return _write_shared(obj, wstate);\n  } else {\n    return write_simple(obj);\n  }\n}\n\nfunction _preprocess(obj) {\n  const state = {\n    objs: new Set(),\n    shared_objs: new Set(),\n    parents: new Set(),\n    cyclic: false,\n  };\n  _gather_information(obj, state);\n\n  // Create initial writer state\n  const ids = new Map();\n  for (const o of state.shared_objs) {\n    ids.set(o, null);\n  }\n  const wstate = {\n    ids: ids,\n    last_id: -1,\n    cyclic: state.cyclic,\n  };\n  return wstate;\n}\n\nfunction _gather_information(obj, state) {\n  if (state.parents.has(obj)) {\n    // Already seen and this is a cyclic object\n    state.cyclic = true;\n  }\n  if (state.shared_objs.has(obj)) {\n    return;\n  } else if (state.objs.has(obj)) {\n    state.shared_objs.add(obj);\n    return;\n  }\n  // Found a new object\n  state.objs.add(obj);\n  if (isPair(obj)) {\n    state.parents.add(obj);\n    _gather_information(obj.car, state);\n    _gather_information(obj.cdr, state);\n    state.parents.delete(obj);\n  } else if (isVector(obj)) {\n    state.parents.add(obj);\n    obj.forEach((item) => {\n      _gather_information(item, state);\n    });\n    state.parents.delete(obj);\n  }\n}\n\n// Always use datum label\nfunction write_shared(obj) {\n  const wstate = _preprocess(obj);\n  return _write_shared(obj, wstate);\n}\n\nfunction _write_shared(obj, wstate) {\n  let s = \"\";\n  if (wstate.ids.has(obj)) {\n    const id = wstate.ids.get(obj);\n    if (id === null) {\n      // First occurrence of a shared object; Give it a number\n      const new_id = wstate.last_id + 1;\n      wstate.ids.set(obj, new_id);\n      wstate.last_id = new_id;\n      s += `#${new_id}=`;\n    } else {\n      // Already printed. Just show the reference\n      return `#${id}#`;\n    }\n  }\n  if (isPair(obj)) {\n    const a = [];\n    // Note that we cannot use obj.forEach (because it does not stop)\n    a.push(_write_shared(obj.car, wstate));\n    for (let o = obj.cdr; o !== nil; o = o.cdr) {\n      if (!isPair(o) || wstate.ids.has(o)) {\n        a.push(\".\");\n        a.push(_write_shared(o, wstate));\n        break;\n      }\n      a.push(_write_shared(o.car, wstate));\n    }\n    s += \"(\" + a.join(\" \") + \")\";\n  } else if (isVector(obj)) {\n    const a = obj.map((item) => _write_shared(item, wstate));\n    s += \"#(\" + a.join(\" \") + \")\";\n  } else {\n    s += write_simple(obj);\n  }\n  return s;\n}\n\nconst to_write = write;\n\n//\n// equality\n//\nconst eq = function (a, b) {\n  return a === b;\n};\n\n// TODO: Records (etc.)\nconst eqv = function (a, b) {\n  return a == b && typeof a == typeof b;\n};\n\nconst equal = function (a, b) {\n  return to_write(a) == to_write(b);\n};\n\n//\n// Char\n//\n\nconst Chars = {};\n\nclass Char {\n  constructor(c) {\n    Chars[(this.value = c)] = this;\n  }\n\n  to_write() {\n    switch (this.value) {\n      case \"\\n\":\n        return \"#\\\\newline\";\n      case \" \":\n        return \"#\\\\space\";\n      case \"\\t\":\n        return \"#\\\\tab\";\n      default:\n        return \"#\\\\\" + this.value;\n    }\n  }\n\n  to_display() {\n    return this.value;\n  }\n\n  inspect() {\n    return this.to_write();\n  }\n}\nChar.get = function (c) {\n  if (typeof c != \"string\") {\n    throw new Bug(\"Char.get: \" + inspect(c) + \" is not a string\");\n  }\n  if (Chars[c] === undefined) return new Char(c);\n  else return Chars[c];\n};\n\nconst isChar = function (obj) {\n  return obj instanceof Char;\n};\n\n// The class Call is used to invoke scheme closure from\n// library functions.\n//\n// Call#constructor takes three arguments: proc, args and after.\n//   * proc is the scheme closure to invoke.\n//   * args is an Array (not list!) of arguments for the invocation.\n//   * after is a javascript function which is invoked when\n//     returned from the proc.\n//\n//     after takes two arguments: ar and intp.\n//       * ar is an Array which contains the result of the invocation.\n//       * intp is an Interpreter which is running.\n//\n//     If after returns another Call object, another invocation\n//     happens. If after returns a normal value, it is the value\n//     of the library function.\n//\n// example:\n//   return new Call(proc, [x, y], function(ar){ ar[0] });\n//\nclass Call {\n  constructor(proc, args, after) {\n    this.proc = proc;\n    this.args = args;\n    this.after =\n      after ||\n      function (ar) {\n        // just return result which closure returned\n        return ar[0];\n      };\n  }\n\n  inspect() {\n    return \"#<Call args=\" + this.args.inspect() + \">\";\n  }\n\n  toString() {\n    return \"#<Call>\";\n  }\n\n  to_write() {\n    return \"#<Call>\";\n  }\n}\n\n//\n// Iterator - external iterator for Call.foreach\n//\nconst Iterator = {\n  ForArray: class {\n    constructor(arr) {\n      this.arr = arr;\n      this.i = 0;\n    }\n    has_next() {\n      return this.i < this.arr.length;\n    }\n    next() {\n      return this.arr[this.i++];\n    }\n  },\n\n  ForString: class {\n    constructor(str) {\n      this.str = str;\n      this.i = 0;\n    }\n    has_next() {\n      return this.i < this.str.length;\n    }\n    next() {\n      return Char.get(this.str.charAt(this.i++));\n    }\n  },\n\n  ForList: class {\n    constructor(ls) {\n      this.ls = ls;\n    }\n    has_next() {\n      return this.ls instanceof Pair && this.ls != nil;\n    }\n    next() {\n      var pair = this.ls;\n      this.ls = this.ls.cdr;\n      return pair;\n    }\n  },\n\n  ForMulti: class {\n    constructor(objs) {\n      this.objs = objs;\n      this.size = objs.length;\n      this.iterators = objs.map(function (x) {\n        return Iterator.of(x);\n      });\n    }\n    has_next() {\n      for (var i = 0; i < this.size; i++)\n        if (!this.iterators[i].has_next()) return false;\n\n      return true;\n    }\n    next() {\n      return this.iterators.map(function (ite) {\n        return ite.next();\n      });\n    }\n  },\n\n  of: function (obj) {\n    switch (true) {\n      case obj instanceof Array:\n        return new this.ForArray(obj);\n      case typeof obj == \"string\":\n        return new this.ForString(obj);\n      case obj instanceof Pair:\n      case obj === nil:\n        return new this.ForList(obj);\n      default:\n        throw new Bug(\"Iterator.of: unknown class: \" + inspect(obj));\n    }\n  },\n};\n\n//\n// Call.foreach - shortcut for successive Calls\n//\n// Some library functions, such as for-each or map,\n// call a closure for each element. Call.foreach is\n// a utility to help defining such methods.\n//\n// Call.foreach takes a sequence and some callbacks.\n// Sequence is an Array, String, or list.\n//\n// Example:\n//   return Call.foreach(sequence, {\n//     // before each call\n//     call: function(elem){\n//       return new Call(proc, [elem]);\n//     },\n//     // after each call\n//     result: function(value, elem){\n//       ary.push(value);\n//       // you can return a value to terminate the loop\n//     },\n//     // after all the calls\n//     finish: function(){\n//       return ary;\n//     }\n//   });\n\nCall.default_callbacks = {\n  call: function (x) {\n    return new Call(this.proc, [x]);\n  },\n  result: function () {},\n  finish: function () {},\n};\nCall.foreach = function (obj, callbacks, is_multi) {\n  is_multi || (is_multi = false);\n  [\"call\", \"result\", \"finish\"].forEach(function (key) {\n    if (!callbacks[key]) callbacks[key] = Call.default_callbacks[key];\n  });\n\n  var iterator = null;\n  var x = null;\n\n  var loop = function (ar) {\n    if (iterator) {\n      var ret = callbacks[\"result\"](ar[0], x);\n      if (ret !== undefined) return ret;\n    } else {\n      // first lap\n      if (is_multi) iterator = new Iterator.ForMulti(obj);\n      else iterator = Iterator.of(obj);\n    }\n\n    if (!iterator.has_next()) {\n      return callbacks[\"finish\"]();\n    } else {\n      x = iterator.next();\n      var result = callbacks[\"call\"](x);\n      result.after = loop;\n      return result;\n    }\n  };\n  return loop(null);\n};\nCall.multi_foreach = function (obj, callbacks) {\n  return Call.foreach(obj, callbacks, true);\n};\n\n//\n// Syntax\n//\nclass Syntax {\n  constructor(sname, func) {\n    this.sname = sname;\n    this.func = func;\n  }\n\n  transform(x) {\n    if (!this.func) {\n      throw new Bug(\"sorry, syntax \" + this.sname + \" is a pseudo syntax now\");\n    }\n    return this.func(x);\n  }\n\n  inspect() {\n    return \"#<Syntax \" + this.sname + \">\";\n  }\n}\n\n// A built-in syntax did not have associated Syntax object.\n// Following code installed dummy Syntax objects to built-in syntax.\nCoreEnv[\"define\"] = new Syntax(\"define\");\nCoreEnv[\"begin\"] = new Syntax(\"begin\");\nCoreEnv[\"quote\"] = new Syntax(\"quote\");\nCoreEnv[\"lambda\"] = new Syntax(\"lambda\");\nCoreEnv[\"if\"] = new Syntax(\"if\");\nCoreEnv[\"set!\"] = new Syntax(\"set!\");\n\n// A compiled Scheme expression\nclass VMCode {\n  // il: Intermediate Language (JS array)\n  constructor(il) {\n    if (!isVector(il)) {\n      console.error(il);\n      throw \"not array\";\n    }\n    this.il = il;\n  }\n\n  to_write() {\n    return \"#<VMCode>\";\n  }\n}\n\n///\n/// Compiler\n///\n/// Note: macro expansion is done by Intepreter#expand\n\nclass Compiler {\n  constructor() {}\n\n  is_tail(x) {\n    return x[0] == \"return\";\n  }\n\n  //free: set\n  //e: env(= [locals, frees])\n  //next: opc\n  //ret: opc[\"refer_*\", n, [\"argument\",\n  //          [\"refer_*\", n, ... [\"argument\", next]\n  collect_free(free, e, next) {\n    var vars = free;\n    var opc = next;\n    var arr = vars.arr;\n    for (var i = 0; i < arr.length; i++) {\n      opc = this.compile_refer(arr[i], e, [\"argument\", opc]);\n    }\n    //Console.puts(\"collect_free \"+free.inspect()+\" / \"+e.inspect()+\" => \"+opc.inspect());\n    return opc;\n  }\n\n  //x: Symbol\n  //e: env [set of locals, set of frees]\n  //ret: opc\n  compile_refer(x, e, next) {\n    return this.compile_lookup(\n      x,\n      e,\n      function (n) {\n        return [\"refer-local\", n, next];\n      },\n      function (n) {\n        return [\"refer-free\", n, next];\n      },\n      function (sym) {\n        return [\"refer-global\", sym, next];\n      }\n    );\n  }\n\n  compile_lookup(x, e, return_local, return_free, return_global) {\n    var locals = e[0],\n      free = e[1];\n    var n;\n    if ((n = locals.index(x)) != null) {\n      //Console.puts(\"compile_refer:\"+x.inspect()+\" in \"+e.inspect()+\" results refer-local \"+n);\n      return return_local(n);\n    } else if ((n = free.index(x)) != null) {\n      //Console.puts(\"compile_refer:\"+x.inspect()+\" in \"+e.inspect()+\" results refer-free \"+n);\n      return return_free(n);\n    } else {\n      var sym = x.name;\n      return return_global(sym);\n    }\n    //throw new BiwaError(\"undefined symbol `\" + sym + \"'\");\n  }\n\n  //generate boxing code (intersection of sets & vars)\n  //if no need of boxing, just returns next\n  //  sets(Set): assigned variables\n  //  vars(List): used variables\n  //  next(opc):\n  //  ret(opc):\n  make_boxes(sets, vars, next) {\n    var vars = vars;\n    var n = 0;\n    var a = [];\n    while (vars instanceof Pair) {\n      if (sets.member(vars.car)) a.push(n);\n      n++;\n      vars = vars.cdr;\n    }\n    var opc = next;\n    for (var i = a.length - 1; i >= 0; i--) opc = [\"box\", a[i], opc];\n    return opc;\n  }\n\n  // Enumerate variables which (could be assigned && included in v)\n  // x: exp\n  // v: set(vars)\n  // ret: set\n  find_sets(x, v) {\n    //Console.puts(\"find_sets: \" + to_write(x) + \" \" + to_write(v))\n    var ret = null;\n    if (x instanceof BiwaSymbol) {\n      ret = new BiwaSet();\n    } else if (x instanceof Pair) {\n      switch (x.first()) {\n        case Sym(\"define\"):\n          var exp = x.third();\n          ret = this.find_sets(exp, v);\n        case Sym(\"begin\"):\n          ret = this.find_sets(x.cdr, v); //(ignores improper list)\n          break;\n        case Sym(\"quote\"):\n          ret = new BiwaSet();\n          break;\n        case Sym(\"lambda\"):\n          var vars = x.second(),\n            body = x.cdr.cdr;\n          if (vars instanceof Pair) {\n            // (lambda (...) ...)\n            ret = this.find_sets(body, v.set_minus(to_set(vars)));\n          } else {\n            // (lambda args ...)\n            ret = this.find_sets(body, v.set_minus(new BiwaSet(vars)));\n          }\n          break;\n        case Sym(\"if\"):\n          var testc = x.second(),\n            thenc = x.third(),\n            elsec = x.fourth();\n          ret = this.find_sets(testc, v).set_union(\n            this.find_sets(thenc, v),\n            this.find_sets(elsec, v)\n          );\n          break;\n        case Sym(\"set!\"):\n          var vari = x.second(),\n            xx = x.third();\n          if (v.member(vari)) ret = this.find_sets(xx, v).set_cons(vari);\n          else ret = this.find_sets(xx, v);\n          break;\n        case Sym(\"call/cc\"):\n          var exp = x.second();\n          ret = this.find_sets(exp, v);\n          break;\n        default:\n          var set = new BiwaSet();\n          for (var p = x; p instanceof Pair; p = p.cdr) {\n            set = set.set_union(this.find_sets(p.car, v));\n          }\n          ret = set;\n          break;\n      }\n    } else {\n      ret = new BiwaSet();\n    }\n\n    if (ret == null) throw new Bug(\"find_sets() exited in unusual way\");\n    else return ret;\n  }\n\n  // find_free(): find free variables in x\n  //              these variables are collected by collect_free().\n  // x: expression\n  // b: set of local vars (= variables which are not free)\n  // f: set of free var candidates\n  //    (local vars of outer lambdas)\n  // ret: set of free vars\n  find_free(x, b, f) {\n    var ret = null;\n    if (x instanceof BiwaSymbol) {\n      if (f.member(x)) ret = new BiwaSet(x);\n      else ret = new BiwaSet();\n    } else if (x instanceof Pair) {\n      switch (x.first()) {\n        case Sym(\"define\"):\n          var exp = x.third();\n          ret = this.find_free(exp, b, f);\n          break;\n        case Sym(\"begin\"):\n          ret = this.find_free(x.cdr, b, f); //(ignores improper list)\n          break;\n        case Sym(\"quote\"):\n          ret = new BiwaSet();\n          break;\n        case Sym(\"lambda\"):\n          var vars = x.second(),\n            body = x.cdr.cdr;\n          if (vars instanceof Pair) {\n            // (lambda (...) ...)\n            ret = this.find_free(body, b.set_union(to_set(vars)), f);\n          } else {\n            // (lambda args ...)\n            ret = this.find_free(body, b.set_cons(vars), f);\n          }\n          break;\n        case Sym(\"if\"):\n          var testc = x.second(),\n            thenc = x.third(),\n            elsec = x.fourth();\n          ret = this.find_free(testc, b, f).set_union(\n            this.find_free(thenc, b, f),\n            this.find_free(elsec, b, f)\n          );\n          break;\n        case Sym(\"set!\"):\n          var vari = x.second(),\n            exp = x.third();\n          if (f.member(vari)) ret = this.find_free(exp, b, f).set_cons(vari);\n          else ret = this.find_free(exp, b, f);\n          break;\n        case Sym(\"call/cc\"):\n          var exp = x.second();\n          ret = this.find_free(exp, b, f);\n          break;\n        default:\n          var set = new BiwaSet();\n          for (var p = x; p instanceof Pair; p = p.cdr) {\n            set = set.set_union(this.find_free(p.car, b, f));\n          }\n          ret = set;\n          break;\n      }\n    } else {\n      ret = new BiwaSet();\n    }\n    //Console.p(\"find_free \"+x.inspect()+\" / \"+b.inspect()+\" => \"+ret.inspect());\n\n    if (ret == null) throw new Bug(\"find_free() exited in unusual way\");\n    else return ret;\n  }\n\n  // Returns the position of the dot pair.\n  // Returns -1 if x is a proper list.\n  //\n  // eg. (a b . c) -> 2\n  find_dot_pos(x) {\n    var idx = 0;\n    for (; x instanceof Pair; x = x.cdr, ++idx);\n    if (x != nil) {\n      return idx;\n    } else {\n      return -1;\n    }\n  }\n\n  last_pair(x) {\n    if (x instanceof Pair) {\n      for (; x.cdr instanceof Pair; x = x.cdr);\n    }\n    return x;\n  }\n\n  // Takes an dotted list and returns proper list.\n  //\n  // eg. (x y . z) -> (x y z)\n  dotted2proper(ls) {\n    if (ls === nil) return nil;\n\n    var nreverse = function (ls) {\n      var res = nil;\n      for (; ls instanceof Pair; ) {\n        var d = ls.cdr;\n        ls.cdr = res;\n        res = ls;\n        ls = d;\n      }\n      return res;\n    };\n    var copy_list = function (ls) {\n      var res = nil;\n      for (; ls instanceof Pair; ls = ls.cdr) {\n        res = new Pair(ls.car, res);\n      }\n      return nreverse(res);\n    };\n\n    if (ls instanceof Pair) {\n      var last = this.last_pair(ls);\n      if (last instanceof Pair && last.cdr === nil) {\n        return ls;\n      } else {\n        var copied = copy_list(ls);\n        this.last_pair(copied).cdr = new Pair(last.cdr, nil);\n        return copied;\n      }\n    } else {\n      return new Pair(ls, nil);\n    }\n  }\n\n  // x: exp(list of symbol or integer or..)\n  // e: env (= [locals, frees])\n  // s: vars might be set!\n  // next: opc\n  // ret: opc\n  compile(x, e, s, f, next) {\n    //Console.p(x);\n    var ret = null;\n\n    while (1) {\n      if (x instanceof BiwaSymbol) {\n        // Variable reference\n        // compiled into refer-(local|free|global)\n        return this.compile_refer(\n          x,\n          e,\n          s.member(x) ? [\"indirect\", next] : next\n        );\n      } else if (x instanceof Pair) {\n        switch (x.first()) {\n          case Sym(\"define\"):\n            ret = this._compile_define(x, next);\n\n            x = ret[0];\n            next = ret[1];\n            break;\n\n          case Sym(\"begin\"):\n            var a = [];\n            for (var p = x.cdr; p instanceof Pair; p = p.cdr) a.push(p.car);\n\n            //compile each expression (in reverse order)\n            var c = next;\n            for (var i = a.length - 1; i >= 0; i--) {\n              c = this.compile(a[i], e, s, f, c);\n            }\n            return c;\n\n          case Sym(\"quote\"):\n            if (x.length() < 2)\n              throw new BiwaError(\"Invalid quote: \" + x.to_write());\n\n            var obj = x.second();\n            return [\"constant\", obj, next];\n\n          case Sym(\"lambda\"):\n            return this._compile_lambda(x, e, s, f, next);\n\n          case Sym(\"if\"):\n            if (x.length() < 3 || x.length() > 4)\n              throw new BiwaError(\"Invalid if: \" + x.to_write());\n\n            var testc = x.second(),\n              thenc = x.third(),\n              elsec = x.fourth();\n            var thenc = this.compile(thenc, e, s, f, next);\n            var elsec = this.compile(elsec, e, s, f, next);\n            x = testc;\n            next = [\"test\", thenc, elsec];\n            break;\n\n          case Sym(\"set!\"):\n            // error-checking: should have only 3 things\n            if (x.length() != 3)\n              throw new BiwaError(\"Invalid set!: \" + x.to_write());\n\n            var v = x.second(),\n              x = x.third();\n            var do_assign = this.compile_lookup(\n              v,\n              e,\n              function (n) {\n                return [\"assign-local\", n, next];\n              },\n              function (n) {\n                return [\"assign-free\", n, next];\n              },\n              function (sym) {\n                return [\"assign-global\", sym, next];\n              }\n            );\n            next = do_assign;\n            break;\n\n          case Sym(\"call/cc\"):\n            var x = x.second();\n            var arity_of_arg = 1; // Always 1. (lambda (cc) ...)\n            var c = [\n              \"conti\",\n              this.is_tail(next) ? e[0].size() + 1 : 0, //number of args for outer lambda\n              [\n                \"argument\", // Push the continuaion closure onto the stack\n                [\n                  \"constant\",\n                  arity_of_arg,\n                  [\n                    \"argument\",\n                    this.compile(\n                      x,\n                      e,\n                      s,\n                      f,\n                      this.is_tail(next)\n                        ? [\"shift\", arity_of_arg, [\"tco_hinted_apply\"]]\n                        : [\"apply\"]\n                    ),\n                  ],\n                ],\n              ],\n            ];\n\n            // Do not push stack frame when call/cc is in a tail context\n            return this.is_tail(next) ? c : [\"frame\", c, next];\n\n          default:\n            //apply\n            //x = (func 1 2)\n            //x.car = func = '(lambda (x) ..) or Symbol\n            //x.cdr = args = '(1 2)\n            var func = x.car;\n            var args = x.cdr;\n            var c = this.compile(\n              func,\n              e,\n              s,\n              f,\n              this.is_tail(next)\n                ? [\"shift\", args.length(), [\"tco_hinted_apply\"]]\n                : [\"apply\"]\n            );\n\n            // VM will push the number of arguments to the stack.\n            c = this.compile(args.length(), e, s, f, [\"argument\", c]);\n            for (var p = args; p instanceof Pair; p = p.cdr) {\n              c = this.compile(p.car, e, s, f, [\"argument\", c]);\n            }\n\n            // Do not push stack frame for tail calls\n            return this.is_tail(next) ? c : [\"frame\", c, next];\n        }\n      } else {\n        return [\"constant\", x, next];\n      }\n    }\n    //Console.p(\"result of \" + x.inspect() + \":\");\n    //Console.p(ret);\n    //dump({\"ret\":ret, \"x\":x, \"e\":e, \"s\":s, \"next\":next, \"stack\":[]});\n    //      if(ret == null)\n    //        throw new Bug(\"compile() exited in unusual way\");\n    //      else\n    //        return ret;\n  }\n\n  // Compile define.\n  //\n  // 0. (define) ; => error\n  // 1. (define a)\n  // 2. (define a 1)\n  // 3. (define a 1 2) ; => error\n  // 4. (define (f x) x), (define (f . a) a)\n  // 5. (define 1 2)\n  //\n  // Note: define may appear in lambda, let, let*, let-values,\n  // let*-values, letrec, letrec*. These definitions are local to the\n  // <body> of these forms.\n  _compile_define(x, next) {\n    if (x.length() == 1) {\n      // 0. (define)\n      throw new BiwaError(\"Invalid `define': \" + x.to_write());\n    }\n\n    var first = x.cdr.car;\n    var rest = x.cdr.cdr;\n\n    if (first instanceof BiwaSymbol) {\n      if (rest === nil) {\n        // 1. (define a)\n        x = undef;\n      } else {\n        if (rest.cdr === nil)\n          // 2. (define a 1)\n          x = rest.car;\n        // 3. (define a 1 2)\n        else throw new BiwaError(\"Invalid `define': \" + x.to_write());\n      }\n\n      if (!TopEnv.hasOwnProperty(first.name)) {\n        TopEnv[first.name] = undef;\n      }\n      next = [\"assign-global\", first.name, next];\n    } else if (first instanceof Pair) {\n      // 4. (define (f x) ...)\n      // Note: define of this form may contain internal define.\n      // They are handled in compilation of \"lambda\".\n\n      var fname = first.car,\n        args = first.cdr;\n      var lambda = new Pair(Sym(\"lambda\"), new Pair(args, rest));\n      x = lambda;\n      if (!TopEnv.hasOwnProperty(first.name)) {\n        TopEnv[fname.name] = undef;\n      }\n      next = [\"assign-global\", fname.name, next];\n    } else {\n      // 5. (define 1 2)\n      throw new BiwaError(\"define: symbol or pair expected but got \" + first);\n    }\n\n    return [x, next];\n  }\n\n  // Compiles various forms of \"lambda\".\n  //\n  // * (lambda (x y) ...)\n  // * (lambda (x y . rest) ...)\n  // * (lambda args ...)\n  _compile_lambda(x, e, s, f, next) {\n    if (x.length() < 3) throw new BiwaError(\"Invalid lambda: \" + x.to_write());\n\n    var vars = x.cdr.car;\n    var body = x.cdr.cdr;\n\n    // Handle internal defines\n    var tbody = Compiler.transform_internal_define(body);\n    let cbody;\n    if (isPair(tbody) && isSymbol(tbody.car) && tbody.car.name == \"letrec*\") {\n      // The body has internal defines.\n      // Expand letrec* macro\n      cbody = Compiler.expand(tbody);\n    } else {\n      // The body has no internal defines.\n      // Just wrap the list with begin\n      cbody = new Pair(Sym(\"begin\"), x.cdr.cdr);\n    }\n\n    var dotpos = this.find_dot_pos(vars);\n    var proper = this.dotted2proper(vars);\n    var free = this.find_free(cbody, to_set(proper), f); //free variables\n    var sets = this.find_sets(cbody, to_set(proper)); //local variables\n\n    // When shadowing happens, the outer one should be removed from `s`\n    // eg.\n    //   (lambda (x) (set! x 0)   // This `x` is set\n    //     (lambda (x) ...        // but this one is not\n    const filtered_s = s.set_minus(to_set(proper));\n    const new_s = sets.set_union(filtered_s.set_intersect(free));\n\n    var do_body = this.compile(\n      cbody,\n      [to_set(proper), free],\n      new_s,\n      f.set_union(to_set(proper)),\n      [\"return\"]\n    );\n    var do_close = [\n      \"close\",\n      vars instanceof Pair ? vars.length() : 0,\n      free.size(),\n      this.make_boxes(sets, proper, do_body),\n      next,\n      dotpos,\n    ];\n    return this.collect_free(free, e, do_close);\n  }\n\n  run(expr) {\n    const opc = this.compile(\n      expr,\n      [new BiwaSet(), new BiwaSet()],\n      new BiwaSet(),\n      new BiwaSet(),\n      [\"halt\"]\n    );\n    return new VMCode(opc);\n  }\n}\n// Compile an expression with new compiler\nCompiler.compile = function (expr, next) {\n  expr = Compiler.expand(expr);\n  return new Compiler().run(expr, next);\n};\n\n// Expand macro calls in a expression recursively.\n//\n// x - expression\n// flag - used internally. do not specify this\n//\n// @throws {BiwaError} when x has syntax error\nCompiler.expand = function (x, flag /*optional*/) {\n  var expand = Compiler.expand;\n  flag || (flag = {});\n  var ret = null;\n\n  if (x instanceof Pair) {\n    switch (x.car) {\n      case Sym(\"define\"):\n        var left = x.cdr.car,\n          exp = x.cdr.cdr;\n        ret = new Pair(Sym(\"define\"), new Pair(left, expand(exp, flag)));\n        break;\n      case Sym(\"begin\"):\n        ret = new Pair(Sym(\"begin\"), expand(x.cdr, flag));\n        break;\n      case Sym(\"quote\"):\n        ret = x;\n        break;\n      case Sym(\"lambda\"):\n        var vars = x.cdr.car,\n          body = x.cdr.cdr;\n        ret = new Pair(Sym(\"lambda\"), new Pair(vars, expand(body, flag)));\n        break;\n      case Sym(\"if\"):\n        var testc = x.second(),\n          thenc = x.third(),\n          elsec = x.fourth();\n        ret = List(\n          Sym(\"if\"),\n          expand(testc, flag),\n          expand(thenc, flag),\n          expand(elsec, flag)\n        );\n        break;\n      case Sym(\"set!\"):\n        var v = x.second(),\n          x = x.third();\n        ret = List(Sym(\"set!\"), v, expand(x, flag));\n        break;\n      case Sym(\"call-with-current-continuation\"):\n      case Sym(\"call/cc\"):\n        var x = x.second();\n        ret = List(Sym(\"call/cc\"), expand(x, flag));\n        break;\n      default:\n        //apply\n        var transformer = null;\n        if (isSymbol(x.car)) {\n          if (TopEnv[x.car.name] instanceof Syntax)\n            transformer = TopEnv[x.car.name];\n          else if (CoreEnv[x.car.name] instanceof Syntax)\n            transformer = CoreEnv[x.car.name];\n        }\n\n        if (transformer) {\n          flag[\"modified\"] = true;\n          ret = transformer.transform(x);\n\n          //            // Debug\n          //            var before = to_write(x);\n          //            var after = to_write(ret);\n          //            if(before != after){\n          //              console.log(\"before: \" + before)\n          //              console.log(\"expand: \" + after)\n          //            }\n\n          var fl;\n          for (;;) {\n            ret = expand(ret, (fl = {}));\n            if (!fl[\"modified\"]) break;\n          }\n        } else {\n          var expanded_car = expand(x.car, flag);\n          var expanded_cdr;\n          if (!(x.cdr instanceof Pair) && x.cdr !== nil) {\n            throw new BiwaError(\n              \"proper list required for function application \" +\n                \"or macro use: \" +\n                to_write(x)\n            );\n          }\n          expanded_cdr = array_to_list(\n            x.cdr.to_array().map(function (item) {\n              return expand(item, flag);\n            })\n          );\n          ret = new Pair(expanded_car, expanded_cdr);\n        }\n    }\n  } else {\n    ret = x;\n  }\n  return ret;\n};\n\n// Transform internal defines to letrec*.\n//\n// Example\n//   (let ((a 1))\n//     (define (b) a)\n//     (b))\n//\n//   (let ((a 1))\n//     (letrec* ((b (lambda () a)))\n//       (b)))\n//\n// x - expression starts with (define ...)\n//\n// Returns a letrec* expression, or\n// just returns x, when x does not contain definitions.\n\n// Returns true if x is a definition\nvar is_definition = function (x) {\n  return isPair(x) && Sym(\"define\") === x.car;\n  // TODO: support \"begin\", nested \"begin\", \"let(rec)-syntax\"\n};\n\n// Convert function definition to lambda binding\n//   (define a ..)         -> (a ..)\n//   (define (f) ..)       -> (f (lambda () ..))\n//   (define (f x . y) ..) -> (f (lambda (x . y) ..))\n//   (define (f . a) ..)   -> (f (lambda a ..))\nvar define_to_lambda_bind = function (def) {\n  var sig = def.cdr.car;\n  var body = def.cdr.cdr;\n\n  if (isSymbol(sig)) {\n    var variable = sig;\n\n    return new Pair(variable, body);\n  } else {\n    var variable = sig.car;\n    var value = new Pair(Sym(\"lambda\"), new Pair(sig.cdr, body));\n\n    return List(variable, value);\n  }\n};\n\nCompiler.transform_internal_define = function (x) {\n  // 1. Split x into definitions and expressions\n  var defs = [],\n    item = x;\n  while (is_definition(item.car)) {\n    defs.push(item.car);\n    item = item.cdr;\n  }\n  var exprs = item;\n\n  // 2. Return x if there is no definitions\n  if (defs.length == 0) return x;\n\n  // 3. Return (letrec* <bindings> <expressions>)\n  var bindings = List.apply(null, defs.map(define_to_lambda_bind));\n  return new Pair(Sym(\"letrec*\"), new Pair(bindings, exprs));\n};\n\n// Convert a list to BiwaSet\nfunction to_set(ls) {\n  if (ls === nil) {\n    return new BiwaSet();\n  } else {\n    var set = new BiwaSet();\n    for (var o = ls; o instanceof Pair; o = o.cdr) {\n      set.add(o.car);\n    }\n    return set;\n  }\n}\n\n//\n// assertions - type checks\n//\n\nconst make_assert = function (check) {\n  return function (/*args*/) {\n    // We cannot use callee/caller in ESM (=JS strict mode)\n    //var fname = arguments.callee.caller\n    //              ? arguments.callee.caller.fname\n    //              : \"\";\n    const fname = \"\";\n    check.apply(this, [fname].concat(Array.from(arguments)));\n  };\n};\n\nconst make_simple_assert = function (type, test, _fname) {\n  return make_assert(function (fname, obj, opt) {\n    const option = opt ? \"(\" + opt + \"): \" : \"\";\n    if (!test(obj)) {\n      throw new BiwaError(\n        option + type + \" required, but got \" + to_write(obj)\n      );\n    }\n  });\n};\n\n//\n// Hashtable\n//\n// TODO: Reimplement with JavaScript Map\n//\n// Based on the base JavaScript Object class, but\n//  * Object takes only strings as keys\n//  * R6RS hashtable needs its own hash function\n// so some hacks are needed.\n\nclass Hashtable {\n  constructor(_hash_proc, _equiv_proc, mutable) {\n    this.mutable = mutable === undefined ? true : mutable ? true : false;\n\n    this.hash_proc = _hash_proc;\n    this.equiv_proc = _equiv_proc;\n\n    // Hash (hashed) => (array of (key and value))\n    this.pairs_of = {};\n  }\n\n  clear() {\n    this.pairs_of = {};\n  }\n\n  candidate_pairs(hashed) {\n    return this.pairs_of[hashed];\n  }\n\n  add_pair(hashed, key, value) {\n    var pairs = this.pairs_of[hashed];\n\n    if (pairs) {\n      pairs.push([key, value]);\n    } else {\n      this.pairs_of[hashed] = [[key, value]];\n    }\n  }\n\n  remove_pair(hashed, pair) {\n    var pairs = this.pairs_of[hashed];\n    var i = pairs.indexOf(pair);\n    if (i == -1) {\n      throw new Bug(\"Hashtable#remove_pair: pair not found!\");\n    } else {\n      pairs.splice(i, 1); //remove 1 element from i-th index\n    }\n  }\n\n  create_copy(mutable) {\n    var copy = new Hashtable(this.hash_proc, this.equiv_proc, mutable);\n    // clone the pairs to copy\n    Object.keys(this.pairs_of).forEach((hashed) => {\n      let pairs = this.pairs_of[hashed];\n      let cloned = pairs.map((pair) => [...pair]);\n      copy.pairs_of[hashed] = cloned;\n    });\n\n    return copy;\n  }\n\n  size() {\n    var n = 0;\n    this._apply_pair(function (pair) {\n      n++;\n    });\n    return n;\n  }\n\n  keys() {\n    return this._apply_pair(function (pair) {\n      return pair[0];\n    });\n  }\n\n  values() {\n    return this._apply_pair(function (pair) {\n      return pair[1];\n    });\n  }\n\n  _apply_pair(func) {\n    var a = [];\n    Object.values(this.pairs_of).forEach(function (pairs) {\n      pairs.forEach(function (pair) {\n        a.push(func(pair));\n      });\n    });\n    return a;\n  }\n\n  to_write() {\n    return \"#<Hashtable size=\" + this.size() + \">\";\n  }\n}\n\nconst isHashtable = function (obj) {\n  return obj instanceof Hashtable;\n};\n\nconst isMutableHashtable = function (obj) {\n  return obj instanceof Hashtable && obj.mutable;\n};\n\n//\n// Hash functions\n//\n\nHashtable.equal_hash = function (ar) {\n  return to_write(ar[0]);\n};\nHashtable.eq_hash = Hashtable.equal_hash;\nHashtable.eqv_hash = Hashtable.equal_hash;\n\nHashtable.string_hash = function (ar) {\n  return ar[0];\n};\n\nHashtable.string_ci_hash = function (ar) {\n  return typeof ar[0] === \"string\" ? ar[0].toLowerCase() : ar[0];\n};\n\nHashtable.symbol_hash = function (ar) {\n  return ar[0] instanceof BiwaSymbol ? ar[0].name : ar[0];\n};\n\n//\n// Equivalence functions\n//\n\nHashtable.eq_equiv = function (ar) {\n  return eq(ar[0], ar[1]);\n};\n\nHashtable.eqv_equiv = function (ar) {\n  return eqv(ar[0], ar[1]);\n};\n\n//\n// number.js\n//\n\n//\n// Complex\n//\nclass Complex {\n  constructor(real, imag) {\n    this.real = real;\n    this.imag = imag;\n  }\n\n  magnitude() {\n    return Math.sqrt(this.real * this.real + this.imag * this.imag);\n  }\n\n  angle() {\n    return Math.atan2(this.imag, this.real);\n  }\n\n  isReal() {\n    return this.imag == 0;\n  }\n\n  isRational() {\n    return this.imag == 0 && isRational(this.real);\n  }\n\n  isInteger() {\n    return this.imag == 0 && isInteger(this.real);\n  }\n\n  toString(radix) {\n    if (this.real === 0 && this.imag === 0) return \"0\";\n    var img = \"\";\n    if (this.imag !== 0) {\n      if (this.imag > 0 && this.real !== 0) {\n        img += \"+\";\n      }\n      switch (this.imag) {\n        case 1:\n          break;\n        case -1:\n          img += \"-\";\n          break;\n        default:\n          img += this.imag.toString(radix);\n      }\n      img += \"i\";\n    }\n    var real = \"\";\n    if (this.real !== 0) {\n      real += this.real.toString(radix);\n    }\n    return real + img;\n  }\n}\n\nComplex.from_polar = function (r, theta) {\n  var real = r * Math.cos(theta);\n  var imag = r * Math.sin(theta);\n  return new Complex(real, imag);\n};\n\nComplex.assure = function (num) {\n  if (num instanceof Complex) return num;\n  else return new Complex(num, 0);\n};\n\n//\n// Rational (unfinished)\n//\nclass Rational {\n  constructor(numerator, denominator) {\n    this.numerator = numerator;\n    this.denominator = denominator;\n  }\n\n  isInteger() {\n    return this.numerator % this.denominator == 0;\n  }\n}\n\n//\n// Predicates\n//\nconst isNumber = function (x) {\n  return x instanceof Complex || x instanceof Rational || typeof x == \"number\";\n};\nconst isComplex = isNumber;\n\nconst isReal = function (x) {\n  if (x instanceof Complex || x instanceof Rational) {\n    return x.isReal();\n  } else {\n    return typeof x == \"number\";\n  }\n};\n\nconst isRational = function (x) {\n  if (x instanceof Complex) {\n    return x.isRational();\n  } else if (x instanceof Rational) {\n    return true;\n  } else {\n    return typeof x == \"number\";\n  }\n};\n\nconst isInteger = function (x) {\n  if (x instanceof Complex || x instanceof Rational) {\n    return x.isInteger();\n  } else {\n    return typeof x == \"number\" && x % 1 == 0;\n  }\n};\n\n// Raised when input is not terminated\nclass Unterminated extends BiwaError {}\n// Raised when input contains extraneous `)`, etc.\nclass Unbalanced extends BiwaError {}\n// Raised for invalid char literal, etc.\nclass Invalid extends BiwaError {}\n\n// Matches first word-like stuff i.e. characters not space and\n// not symbols that are not allowed for an identifier.\n// TODO: is there other non-id symbols in Unicode?\nconst ID_REXP = /^[^\\s\\t\\n\\(\\)\\[\\]\\{\\}\\\"\\'\\`\\,\\;\\|]+/;\n\n// Allowed digits in each base\nconst DIGITS = {\n  2: /^[01]+/,\n  8: /^[0-7]+/,\n  10: /^[0-9]+/,\n  16: /^[0-9a-fA-F]+/,\n};\n\n// Matching parenthesis/bracket for lists\nconst PAREN = {\n  \"(\": \")\",\n  \"{\": \"}\",\n  \"[\": \"]\",\n};\n\n// Named characters like `#\\newline`\nconst NAMED_CHARS = {\n  alarm: \"\\x07\",\n  backspace: \"\\x08\",\n  delete: \"\\x7F\",\n  escape: \"\\x1B\",\n  newline: \"\\n\",\n  null: \"\\x00\",\n  return: \"\\x0D\",\n  space: \" \",\n  tab: \"\\t\",\n};\n\n// Escape sequences like `\\n`, `\\t`\nconst ESCAPE_SEQUENCES = {\n  a: \"\\x07\",\n  b: \"\\x08\",\n  t: \"\\t\",\n  n: \"\\n\",\n  r: \"\\x0D\",\n};\n\nclass Parser {\n  constructor(txt) {\n    // Scheme source text\n    this.txt = txt;\n    // Current position\n    this.i = 0;\n    // Case fold flag. Changed by `#!(no-)fold-case` directives in Scheme source text\n    this.foldCase = false;\n    // For datum labels (`#1=`)\n    this.labelledData = [];\n  }\n\n  // Inject scheme program into current position\n  insert(txt) {\n    const orig = this.txt;\n    this.txt = orig.slice(0, this.i) + txt + orig.slice(this.i);\n  }\n\n  // Returns string representation of `this` for debugging\n  inspect() {\n    return `#<Parser (${this.i}/${this.txt.length})>`;\n  }\n\n  // Read a Scheme value and returns it.\n  // Returns `Parser.EOS` if there is no more.\n  // Throws `Parser.Unterminated` if the source text ends with an unterminated\n  // list, etc.\n  getObject() {\n    this._skipAtmosphere();\n    let ret;\n    if (this.done()) {\n      ret = Parser.EOS;\n    } else {\n      const tok = this._getToken();\n      switch (tok) {\n        case \"(\":\n        case \"[\":\n        case \"{\":\n          this.i--; // Unget the first paren\n          ret = this._parseList();\n          break;\n        case '\"':\n          ret = this._parseString();\n          break;\n        case \"|\":\n          ret = this._parseEnclosedSymbol();\n          break;\n\n        case \")\":\n        case \"]\":\n        case \"}\":\n          throw new Unbalanced(`found extraneous '${tok}'`);\n\n        // Aliases\n        case \"'\":\n          ret = this._parseQuote(\"quote\");\n          break;\n        case \"`\":\n          ret = this._parseQuote(\"quasiquote\");\n          break;\n        case \",\":\n          ret = this._parseQuote(\"unquote\");\n          break;\n        case \",@\":\n          ret = this._parseQuote(\"unquote-splicing\");\n          break;\n\n        default:\n          if (tok[0] == \"#\") {\n            ret = this._parseSharp(tok);\n          } else {\n            ret = this._parseDecimalNumberOrIdentifier(tok);\n          }\n          break;\n      }\n    }\n    //onsole.log(\"getObject\", inspect(ret))\n    return ret;\n  }\n\n  _getObjectOrThrowUnterminated(msg) {\n    const v = this.getObject();\n    if (v === Parser.EOS) throw new Unterminated(msg);\n    return v;\n  }\n\n  // Returns current token and proceeds the cursor.\n  _getToken() {\n    const c = this.txt[this.i];\n    if (c === undefined) throw new Bug(\"EOS must be handled beforehand\");\n    let tok;\n    switch (c) {\n      case \"(\":\n      case \"[\":\n      case \"{\":\n      case \")\":\n      case \"]\":\n      case \"}\":\n      case \"'\":\n      case \"`\":\n      case '\"':\n      case \"|\":\n        this.i++;\n        tok = c;\n        break;\n      case \",\":\n        this.i++;\n        if (this.txt[this.i] == \"@\") {\n          this.i++;\n          tok = \",@\";\n        } else {\n          tok = \",\";\n        }\n        break;\n      case \"#\":\n        this.i++;\n        tok = this._getSharpToken();\n        break;\n      default:\n        const m = this.match(ID_REXP);\n        if (m) {\n          this.i += m[0].length;\n          tok = m[0];\n        } else {\n          this.i++;\n          tok = c;\n        }\n        break;\n    }\n    return tok;\n  }\n\n  // Get the possible part after `#`\n  _getSharpToken() {\n    const c2 = this.txt[this.i];\n    if (c2 === undefined) {\n      // Program ends with an `#` (invalid)\n      return \"#\";\n    }\n    if (c2 === \"(\") {\n      this.i++;\n      return \"#(\";\n    }\n    if (c2 === \"\\\\\") {\n      this.i++;\n      return \"#\\\\\" + this._getCharToken();\n    }\n    let m = this.match(/^(\\d+)[=#]/); // Datum label\n    if (m) {\n      this.i += m[0].length;\n      return \"#\" + m[0];\n    }\n    m = this.match(ID_REXP);\n    if (m) {\n      this.i += m[0].length;\n      return \"#\" + m[0];\n    }\n    // Invalid symbol after `#`\n    this.i++;\n    return \"#\" + c2;\n  }\n\n  // Get the possible part after `#\\`\n  _getCharToken() {\n    if (this.done()) {\n      throw new Unterminated(\"got EOS on char literal\", this.rest(-2));\n    }\n    const m = this.match(/^(\\w+)/);\n    if (m) {\n      this.i += m[0].length;\n      return m[0];\n    } else {\n      const c = this.txt[this.i];\n      this.i++;\n      return c;\n    }\n  }\n\n  // Skip whitespace, comment and directive\n  // Note: calling this method may change parser state (`this.foldCase`).\n  _skipAtmosphere() {\n    while (this.i < this.txt.length) {\n      switch (this.txt[this.i]) {\n        // Whitespace\n        case \" \":\n        case \"\\t\":\n        case \"\\n\":\n          this.i++;\n          break;\n\n        // Line comment\n        case \";\":\n          const m = this.match(/^;[^\\n]*(\\n|$)/);\n          this.i += m[0].length;\n          break;\n\n        // Sexp/multiline comment and directives\n        case \"#\":\n          if (this.txt[this.i + 1] == \";\") {\n            this.i += \"#;\".length;\n            this._skipAtmosphere();\n            // Drop the value after the `#;` and continue\n            this._getObjectOrThrowUnterminated(\"missing argument for `#;`\");\n          } else if (this.txt[this.i + 1] == \"|\") {\n            this.i += \"#|\".length;\n            this._skipBlockComment();\n          } else if (this.match(/^#!fold-case/)) {\n            this.i += \"#!fold-case\".length;\n            this.foldCase = true;\n          } else if (this.match(/^#!no-fold-case/)) {\n            this.i += \"#!no-fold-case\".length;\n            this.foldCase = false;\n          } else {\n            return;\n          }\n          break;\n\n        default:\n          return;\n      }\n    }\n  }\n\n  // Skip block comment (`#|...|#`)\n  // `#|` must be consumed beforehand\n  _skipBlockComment() {\n    let level = 1;\n    while (this.i < this.txt.length) {\n      const mEnd = this.match(/\\|#/);\n      if (mEnd === null) {\n        break;\n      }\n      // Check nested comment\n      const mBegin = /#\\|/.exec(this.txt.slice(this.i, mEnd.index));\n      if (mBegin) {\n        level++;\n        this.i += mBegin.index + \"#|\".length;\n        continue;\n      } else {\n        this.i += mEnd.index + \"|#\".length;\n        level--;\n        if (level == 0) {\n          // Found matching `|#` for all `#|`s.\n          return;\n        }\n      }\n    }\n    throw new Unterminated(\n      \"unterminated block comment (`|#` not found)\",\n      this.rest()\n    );\n  }\n\n  // Parse quote, backquote, unquote, unquote-splicing\n  _parseQuote(name) {\n    this._skipAtmosphere();\n    const v = this._getObjectOrThrowUnterminated(`unterminated ${name}`);\n    return List(Sym(name), v);\n  }\n\n  // Parse stuffs starting with `#` (except those parsed with _skipAtmosphere)\n  _parseSharp(tok) {\n    if (!tok.startsWith(\"#\")) throw new Bug(\"not a sharp\");\n    switch (tok) {\n      case \"#t\":\n      case \"#true\":\n        return true;\n      case \"#f\":\n      case \"#false\":\n        return false;\n      case \"#(\":\n        return this._parseVector();\n      default:\n        switch (true) {\n          case tok.startsWith(\"#\\\\\"):\n            return this._parseChar(tok);\n          case tok.startsWith(\"#u8\"):\n            throw new BiwaError(\n              \"bytevectors are not supported yet\",\n              this.rest(-1)\n            );\n          case /^#[eibodx]/.test(tok):\n            return this._parsePrefixedNumber(tok);\n          case /^#\\d/.test(tok):\n            return this._parseDatumLabel(tok);\n          default:\n            throw new Invalid(\"unknown #-syntax\", tok);\n        }\n    }\n  }\n\n  // Parse a character literal (begins with `#\\`)\n  _parseChar(tok) {\n    if (!tok.startsWith(\"#\\\\\")) throw new Bug(\"not a char\");\n    const body = tok.substring(2);\n    // Named char?\n    let c = NAMED_CHARS[body];\n    if (c) {\n      return Char.get(c);\n    }\n    // Specified by code?\n    let m = /^x([a-zA-Z0-9]+)$/.exec(body);\n    if (m) {\n      return Char.get(String.fromCharCode(parseInt(m[1], 16)));\n    }\n    // A character?\n    if (body.length == 1) {\n      return Char.get(body);\n    }\n    // Otherwise\n    throw new Invalid(`Invalid char literal: ${tok}`);\n  }\n\n  // Parse a vector expression after `#(`\n  _parseVector() {\n    const begin = this.i;\n    const arr = [];\n    loop: while (this.i < this.txt.length) {\n      this._skipAtmosphere();\n      switch (this.txt[this.i]) {\n        case \")\":\n          this.i++;\n          break loop;\n        case \"]\":\n        case \"}\":\n          throw new BiwaError(\"extra close paren\", this.rest());\n        default:\n          arr.push(this.getObject());\n          break;\n      }\n    }\n    return arr;\n  }\n\n  // Parse a number prefixed with `#i`, `#b`, etc.\n  // Throws error if not a prefixed number.\n  _parsePrefixedNumber(tok) {\n    let base = 10; // Decimal is the default\n    let s = tok;\n    if (s.match(/^#[iIeE]/)) s = s.substring(2); // Exactness is not supported.\n    if (s.match(/^#[bB]/)) {\n      base = 2;\n      s = s.substring(2);\n    } else if (s.match(/^#[oO]/)) {\n      base = 8;\n      s = s.substring(2);\n    } else if (s.match(/^#[dD]/)) {\n      base = 10;\n      s = s.substring(2);\n    } else if (s.match(/^#[xX]/)) {\n      base = 16;\n      s = s.substring(2);\n    }\n    if (s.match(/^#[iIeE]/)) s = s.substring(2); // Exactness is not supported.\n\n    const v = this._parseComplexNumber(base, s);\n    if (v === null) {\n      // Extraneous char after number prefix (like `#dfoo`)\n      throw new Invalid(`invalid number format: %{tok}`);\n    } else {\n      return v;\n    }\n  }\n\n  // Parse a complex (or real) number.\n  // Returns null if not a number.\n  _parseComplexNumber(base, tok) {\n    const [a, rest] = this._parseRealNumber(base, tok);\n    if (a === null) {\n      return null;\n    } else if (rest === \"\") {\n      return a;\n    }\n    const c = rest[0];\n    if (c == \"@\") {\n      // Polar complex number? (eg. `1@2`)\n      const [b, rest2] = this._parseRealNumber(base, rest.substring(1));\n      if (b !== null && rest2 === \"\") {\n        return Complex.from_polar(a, b);\n      }\n    } else if (c == \"+\" || c == \"-\") {\n      // Ortho complex number? (eg. `1+2i`)\n      const [b, rest2] = this._parseRealNumber(base, rest);\n      if (b !== null && rest2.match(/^[iI]$/)) {\n        return new Complex(a, b);\n      }\n    }\n    return null;\n  }\n\n  // Parse a real (or rational) number at the head of `tok`.\n  // Returns the number and the rest of the string.\n  // Returns [null, tok] if not a number.\n  _parseRealNumber(base, tok) {\n    if (tok === \"\") return [null, tok];\n\n    // inf or nan\n    const m = tok.match(/^(\\+|-)(inf.0|nan.0)/);\n    if (m) {\n      const v = (m[2] == \"inf.0\" ? Infinity : NaN) * (m[1] == \"+\" ? 1 : -1);\n      return [v, tok.substring(m[0].length)];\n    }\n\n    // Handle the sign in case this is a number\n    let s = tok;\n    let sign = 1;\n    if (s.match(/^\\+/)) {\n      s = s.substring(1);\n    } else if (s.match(/^\\-/)) {\n      s = s.substring(1);\n      sign = -1;\n    }\n\n    // Handle deciaml of the form `.123`\n    if (base == 10 && s[0] == \".\") {\n      const mm = tok.match(/^\\.(\\d+)([eE][+-]?\\d+)?/);\n      if (mm) {\n        return [parseFloat(\"0\" + mm[0]), tok.substring(mm[0].length)];\n      } else {\n        return [null, tok];\n      }\n    }\n\n    // Get the first number part\n    let a = 0;\n    const mm = s.match(DIGITS[base]);\n    if (mm) {\n      s = s.substring(mm[0].length);\n      a = parseInt(mm[0], base) * sign;\n    } else {\n      return [null, tok];\n    }\n    // Parse rational\n    if (s[0] == \"/\") {\n      s = s.substring(1);\n      const mmm = s.match(DIGITS[base]);\n      if (mmm) {\n        s = s.substring(mmm[0].length);\n        const b = parseInt(mmm[0], base);\n        return [new Rational(a, b), s];\n      } else {\n        return [null, tok];\n      }\n    }\n\n    // Was not a rational. Check if it is a decimal\n    if (base == 10) {\n      // Try matching form the beginning\n      const mmm = tok.match(/^[+-]?(\\d+\\.\\d*|\\.?\\d+)([eE][+-]?\\d+)?/);\n      if (mmm) {\n        return [parseFloat(mmm[0]), tok.substring(mmm[0].length)];\n      }\n    }\n\n    return [null, tok];\n  }\n\n  // Parse a datum label definition (`#0=`) or reference (`#0#`).\n  _parseDatumLabel(tok) {\n    const m = tok.match(/^#(\\d+)(=|#)$/);\n    if (m) {\n      const id = parseInt(m[1]);\n      if (m[2] == \"=\") {\n        // Definition\n        const v = this._getObjectOrThrowUnterminated(\n          \"got EOS for labelled datum\"\n        );\n        this.labelledData[id] = v;\n        return v;\n      } else {\n        // Reference\n        if (this.labelledData.hasOwnProperty(id)) {\n          return this.labelledData[id];\n        } else {\n          throw new BiwaError(\"undefined datum reference\", tok);\n        }\n      }\n    } else {\n      throw new BiwaError(\"[BUG] not a datum label\", tok);\n    }\n  }\n\n  // Parse a list (`(...)`)\n  // BiwaScheme allows `[]`, `{}` for list too\n  _parseList() {\n    const begin = this.i;\n    const openParen = this.txt[this.i];\n    this.i++;\n    const closeParen = PAREN[openParen];\n    let dotSeen = false;\n    let list = nil,\n      prev = list;\n    while (this.i < this.txt.length) {\n      this._skipAtmosphere();\n      const c = this.txt[this.i];\n      if (c == closeParen) {\n        this.i++;\n        return list;\n      } else if (c == \")\" || c == \"]\" || c == \"}\") {\n        throw new BiwaError(\"extra close paren\", this.rest());\n      } else if (c == \".\" && this.match(/^\\.[\\s]/)) {\n        if (list === nil) {\n          throw new BiwaError(\"no list element before `.`\", this.from(begin));\n        }\n        dotSeen = true;\n        this.i++;\n        const v = this.getObject();\n        if (v === Parser.EOS) {\n          throw new Unterminated(\n            \"found EOS after `.` in list\",\n            this.from(begin)\n          );\n        }\n        prev.cdr = v;\n      } else if (dotSeen) {\n        throw new BiwaError(\n          \"more than one element after `.`\",\n          this.from(begin)\n        );\n      } else {\n        const vv = this.getObject();\n        if (vv === Parser.EOS) {\n          this.i = begin;\n          throw new Unterminated(\"found EOS in list\", this.rest());\n        }\n        const cur = new Pair(vv, nil);\n        if (list === nil) list = cur;\n        else prev.cdr = cur;\n        prev = cur;\n      }\n    }\n    this.i = begin;\n    throw new Unterminated(\"found EOS in list\", this.rest());\n  }\n\n  // Parse a string literal after the first `\"`\n  _parseString() {\n    const m = this.match(/^((\\\\\"|[^\"])*)\"/);\n    if (m) {\n      this.i += m[0].length;\n      const s = m[1].replaceAll(/\\\\\\s*\\n\\s*/g, \"\");\n      return this._replaceEscapedChars(s);\n    } else {\n      throw new Unterminated(\"invalid string literal\", this.rest());\n    }\n  }\n\n  // Parse a symbol enclosed with `|` after the first `|`\n  _parseEnclosedSymbol() {\n    const m = this.match(/^((\\\\\\||[^\\|])*)\\|/);\n    if (m) {\n      this.i += m[0].length;\n      return Sym(this._replaceEscapedChars(m[1]));\n    } else {\n      throw new Unterminated(\"invalid symbol literal\", this.rest());\n    }\n  }\n\n  // Replace `\\n`, `\\t`, `\\x1234`, etc. in `s`\n  _replaceEscapedChars(s) {\n    return s\n      .replaceAll(/\\\\x([0-9a-f]+);/gi, (_, n) =>\n        String.fromCharCode(parseInt(n, 16))\n      )\n      .replaceAll(/\\\\(.)/g, (_, c) => ESCAPE_SEQUENCES[c] || c);\n  }\n\n  // Parse a number or an identifier.\n  _parseDecimalNumberOrIdentifier(tok) {\n    if (tok === \"\") throw new Bug(\"empty string given\");\n\n    const v = this._parseComplexNumber(10, tok);\n    if (v === null) {\n      return Sym(this.foldCase ? tok.toLowerCase() : tok);\n    } else {\n      return v;\n    }\n  }\n\n  // Returns rest of the source text\n  rest(di = 0) {\n    return this.txt.slice(this.i + di);\n  }\n\n  // Returns the source text beginning from `pos`\n  from(pos) {\n    return this.txt.slice(pos);\n  }\n\n  // Execute regexp match from the current position.\n  // Returns `null` if no match\n  match(rexp, di = 0) {\n    return rexp.exec(this.rest(di));\n  }\n\n  // Returns if whole text is seen\n  done() {\n    return this.i >= this.txt.length;\n  }\n}\n\n// Indicates end of source file\nParser.EOS = new Object();\nParser.EOS.toString = () => \"#<BiwaScheme.Parser.EOS>\";\n\n// Parser the text and return an array of exprs\nParser.parse = (txt) => {\n  const parser = new Parser(txt);\n  const ret = [];\n  while (true) {\n    var expr = parser.getObject();\n    if (expr === Parser.EOS) break;\n    ret.push(expr);\n  }\n  return ret;\n};\n\nParser.Unterminated = Unterminated;\n\n///\n/// Interpreter\n///\n\nclass Interpreter {\n  // new Interpreter()\n  // new Interpreter(lastInterpreter)\n  // new Interpreter(errorHandler)\n  // new Interpreter(lastInterpreter, errorHandler)\n  constructor() {\n    var last_interpreter = null;\n    var on_error = null;\n    if (arguments.length == 2) {\n      last_interpreter = arguments[0];\n      on_error = arguments[1];\n    } else if (arguments.length == 1 && arguments[0] instanceof Interpreter) {\n      last_interpreter = arguments[0];\n    } else if (arguments.length == 1 && typeof arguments[0] == \"function\") {\n      on_error = arguments[0];\n    }\n\n    // Interpreter stack\n    this.stack = [];\n    // JS function to handle error\n    this.on_error =\n      on_error ||\n      (last_interpreter ? last_interpreter.on_error : function (e) {});\n    // JS function to handle result\n    this.after_evaluate = function () {};\n\n    // (Variables for stack trace)\n    // Name of the last variable read by refer-xx\n    this.last_refer = last_interpreter ? last_interpreter.last_refer : null;\n    // Call stack (array of last_refer)\n    this.call_stack = last_interpreter ? [...last_interpreter.call_stack] : [];\n    // Counts number of tail calls (= how many times should we pop call_stack\n    // in op_return)\n    this.tco_counter = [];\n    // Maximum length of call_stack\n    // (Note: we should cap call_stack for inifinite loop with recursion)\n    this.max_trace_size = last_interpreter\n      ? last_interpreter.max_trace_size\n      : max_trace_size;\n\n    // dynamic-wind\n    this.current_dynamic_winder = Interpreter.DynamicWind.ROOT;\n  }\n\n  inspect() {\n    return [\n      \"#<Interpreter: stack size=>\",\n      this.stack.length,\n      \" \",\n      \"after_evaluate=\",\n      inspect(this.after_evaluate),\n      \">\",\n    ].join(\"\");\n  }\n\n  // private\n  push(x, s) {\n    this.stack[s] = x;\n    return s + 1;\n  }\n\n  // private\n  //s: depth of stack to save\n  //ret: saved(copied) stack\n  save_stack(s) {\n    var v = [];\n    for (var i = 0; i < s; i++) {\n      v[i] = this.stack[i];\n    }\n    return {\n      stack: v,\n      last_refer: this.last_refer,\n      call_stack: [...this.call_stack],\n      tco_counter: [...this.tco_counter],\n    };\n  }\n\n  // private\n  //v: stack array to restore\n  //ret: lenght of restored stack\n  restore_stack(stuff) {\n    const v = stuff.stack;\n    const s = v.length;\n    for (var i = 0; i < s; i++) {\n      this.stack[i] = v[i];\n    }\n    this.last_refer = stuff.last_refer;\n    this.call_stack = [...stuff.call_stack];\n    this.tco_counter = [...stuff.tco_counter];\n    return s;\n  }\n\n  // private\n  //s: depth of stack to save\n  //n: number of args(for outer lambda) to remove (= 0 unless tail position)\n  //ret: closure array\n  capture_continuation(s, n) {\n    // note: implementation of this function for final version doesn't exist in 3imp.pdf..\n    var ss = this.push(n, s);\n    return this.closure(\n      [\"nuate1\", this.save_stack(ss), this.current_dynamic_winder],\n      1, //arity\n      0, //n (number of frees)\n      null, //s (stack position to get frees)\n      -1\n    ); // dotpos\n  }\n\n  // private\n  // shift stack\n  // n: number of items to skip (from stack top)\n  // m: number of items to shift\n  // s: stack pointer (= index of stack top + 1)\n  shift_args(n, m, s) {\n    for (var i = n; i >= 0; i--) {\n      this.index_set(s, i + m + 1, this.index(s, i));\n    }\n    return s - m - 1;\n  }\n\n  index(s, i) {\n    return this.stack[s - 1 - i];\n  }\n\n  // private\n  index_set(s, i, v) {\n    this.stack[s - 1 - i] = v;\n  }\n\n  // private\n  closure(body, n_args, n, s, dotpos) {\n    const freevars = [];\n    for (var i = 0; i < n; i++) {\n      freevars[i] = this.index(s, i);\n    }\n    const expected_args = dotpos == -1 ? n_args : undefined;\n    return new Closure(body, freevars, dotpos, expected_args);\n  }\n\n  // private\n  run_dump_hook(a, x, f, c, s) {\n    var dumper;\n    var state;\n\n    if (this.dumper) {\n      dumper = this.dumper;\n    } else if (Interpreter.dumper) {\n      dumper = Interpreter.dumper;\n    } else return;\n\n    if (dumper) {\n      state = { a: a, f: f, c: c, s: s, x: x, stack: this.stack };\n      dumper.dump(state);\n    }\n  }\n\n  // private\n  // a: arbitary object (temporary register)\n  // x: opecode\n  // f: integer\n  // c: BiwaScheme.Closure\n  // s: integer\n  _execute(a, x, f, c, s) {\n    var ret = null;\n    //Console.puts(\"executing \"+x[0]);\n\n    while (true) {\n      //x[0] != \"halt\"){\n      this.run_dump_hook(a, x, f, c, s);\n\n      switch (x[0]) {\n        case \"halt\":\n          return a;\n        case \"refer-local\":\n          var n = x[1],\n            x = x[2];\n          a = this.index(f, n + 1);\n          this.last_refer = \"(anon)\";\n          break;\n        case \"refer-free\":\n          var n = x[1],\n            x = x[2];\n          a = c.freevars[n];\n          this.last_refer = \"(anon)\";\n          break;\n        case \"refer-global\":\n          var sym = x[1],\n            x = x[2];\n          if (TopEnv.hasOwnProperty(sym)) var val = TopEnv[sym];\n          else if (CoreEnv.hasOwnProperty(sym)) var val = CoreEnv[sym];\n          else throw new BiwaError(\"execute: unbound symbol: \" + inspect(sym));\n\n          a = val;\n          this.last_refer = sym || \"(anon)\";\n          break;\n        case \"indirect\":\n          var x = x[1];\n          a = a[0]; //unboxing\n          break;\n        case \"constant\":\n          var obj = x[1],\n            x = x[2];\n          a = obj;\n          this.last_refer = \"(anon)\";\n          break;\n        case \"close\":\n          var ox = x;\n          var v = ox[1],\n            n = ox[2],\n            body = ox[3],\n            x = ox[4],\n            dotpos = ox[5];\n          a = this.closure(body, v, n, s, dotpos);\n          s -= n;\n          break;\n        case \"box\":\n          var n = x[1],\n            x = x[2];\n          this.index_set(s, n + 1, [this.index(s, n + 1)]); //boxing\n          break;\n        case \"test\":\n          var thenc = x[1],\n            elsec = x[2];\n          x = a !== false ? thenc : elsec;\n          break;\n        case \"assign-global\":\n          var name = x[1],\n            x = x[2];\n          if (!TopEnv.hasOwnProperty(name) && !CoreEnv.hasOwnProperty(name))\n            throw new BiwaError(\n              \"global variable '\" + name + \"' is not defined\"\n            );\n\n          TopEnv[name] = a;\n          a = undef;\n          break;\n        case \"assign-local\":\n          var n = x[1],\n            x = x[2];\n          var box = this.index(f, n + 1);\n          box[0] = a;\n          a = undef;\n          break;\n        case \"assign-free\":\n          var n = x[1],\n            x = x[2];\n          var box = c.freevars[n];\n          box[0] = a;\n          a = undef;\n          break;\n        case \"conti\":\n          var n = x[1],\n            x = x[2];\n          a = this.capture_continuation(s, n);\n          break;\n        case \"nuate1\":\n          var stack = x[1],\n            to = x[2];\n          var from = this.current_dynamic_winder;\n          var winders = Interpreter.DynamicWind.listWinders(from, to);\n          x = Interpreter.DynamicWind.joinWinders(winders, [\n            \"refer-local\",\n            0,\n            [\"nuate2\", stack],\n          ]);\n          break;\n        case \"nuate2\":\n          var stack = x[1],\n            x = [\"return\"];\n          s = this.restore_stack(stack);\n          break;\n        case \"frame\":\n          var ret = x[2];\n          x = x[1];\n          s = this.push(ret, this.push(f, this.push(c, s)));\n          this.tco_counter[this.tco_counter.length] = 0;\n          break;\n        case \"argument\":\n          var x = x[1];\n          s = this.push(a, s);\n          break;\n        case \"shift\":\n          var n = x[1],\n            x = x[2];\n\n          // the number of arguments in the last call\n          var n_args = this.index(s, n + 1);\n\n          s = this.shift_args(n, n_args, s);\n          break;\n        case \"tco_hinted_apply\": // just like a regular apply, except we need to trace the # of TCO calls so we can generate a stacktrace\n          this.tco_counter[this.tco_counter.length - 1]++;\n          x = [\"apply\"].concat(x.slice(1));\n          break;\n        case \"apply\": //extended: n_args as second argument\n          var func = a; //, n_args = x[1];\n\n          // Save stack trace\n          this.call_stack.push(this.last_refer);\n          if (this.call_stack.length > this.max_trace_size) {\n            // Remove old memory if it grows too long\n            // Note: this simple way may be inconvenient (e.g. no trace\n            // will be shown when an error occurred right after returning\n            // from a large function)\n            this.call_stack.shift();\n          }\n\n          // the number of arguments in the last call is\n          // pushed to the stack.\n          var n_args = this.index(s, 0);\n          if (isClosure(func)) {\n            a = func;\n            x = func.body;\n\n            // The position of dot in the parameter list.\n            const dotpos = func.dotpos;\n            if (dotpos >= 0) {\n              // The dot is found\n              // ----------------\n              // => Process the &rest args: packing the rest args into a list.\n              var ls = nil;\n              for (var i = n_args; --i >= dotpos; ) {\n                ls = new Pair(this.index(s, i + 1), ls);\n              }\n              if (dotpos >= n_args) {\n                // No rest argument is passed to this closure.\n                // However, the closure expects the caller passes the rest argument.\n                // In such case this VM prepares an empty list as the rest argument.\n                // --------------------------------------------------------------\n                // => We extend the stack to put the empty list.\n                for (var i = 0; i < n_args + 1; i++) {\n                  this.index_set(s, i - 1, this.index(s, i));\n                }\n                s++;\n                // => Update the number of arguments\n                this.index_set(s, 0, this.index(s, 0) + 1);\n              }\n              this.index_set(s, dotpos + 1, ls);\n            } else {\n              // the dot is not found\n              // --------------------\n              // => Verify that number of arguments = expected number of arguments\n              // (if the closure knows how many it wants)\n              if (\n                func.expected_args !== undefined &&\n                n_args != func.expected_args\n              ) {\n                var errMsg =\n                  \"Function call error: got \" +\n                  n_args +\n                  \" but wanted \" +\n                  func.expected_args;\n                throw new BiwaError(errMsg);\n              }\n            }\n            f = s;\n            c = func;\n          } else if (func instanceof Function) {\n            // Apply JavaScript function\n            // load arguments from stack\n            var args = [];\n            for (var i = 0; i < n_args; i++) args.push(this.index(s, i + 1));\n\n            // invoke the function\n            var result = func(args, this);\n\n            if (result instanceof Pause) {\n              // it requested the interpreter to suspend\n              var pause = result;\n              pause.set_state(this, [\"return\"], f, c, s);\n              pause.ready();\n              return pause;\n            } else if (result instanceof Call) {\n              // it requested the interpreter to call a scheme closure\n\n              //   [frame,\n              //     [constant... (args)\n              //     [constant, proc\n              //     [apply]]]]\n              //   [frame,\n              //     [constant, after\n              //     [apply 1]]]]\n              //   x\n              var call_after = [\n                \"frame\",\n                [\n                  \"argument\",\n                  [\n                    \"constant\",\n                    1,\n                    [\"argument\", [\"constant\", result.after, [\"apply\"]]],\n                  ],\n                ],\n                [\"return\"],\n              ];\n              var call_proc = [\n                \"constant\",\n                result.args.length,\n                [\n                  \"argument\",\n                  [\"constant\", result.proc, [\"apply\", result.args.length]],\n                ],\n              ];\n              var push_args = result.args.reduce(function (opc, arg) {\n                // (foo 1 2) => first push 2, then 1\n                //   [constant 2 ... [constant 1 ... ]\n                return [\"constant\", arg, [\"argument\", opc]];\n              }, call_proc);\n              x = [\"frame\", push_args, call_after];\n            } else {\n              // the JavaScript function returned a normal value\n              a = result;\n              x = [\"return\"];\n            }\n          } else {\n            // unknown function type\n            throw new BiwaError(inspect(func) + \" is not a function\");\n          }\n          break;\n        case \"return\":\n          // Pop stack frame\n          var n = this.index(s, 0);\n          var ss = s - n;\n          (x = this.index(ss, 1)),\n            (f = this.index(ss, 2)),\n            (c = this.index(ss, 3)),\n            (s = ss - 3 - 1);\n\n          // Pop stack trace (> 1 times if tail calls are done)\n          var n_pops = 1 + this.tco_counter[this.tco_counter.length - 1];\n          this.call_stack.splice(-n_pops);\n          this.tco_counter.pop();\n          break;\n        default:\n          throw new Bug(\"unknown opecode type: \" + x[0]);\n      }\n    }\n\n    //      if(ret === null)\n    //        throw new Bug(\"interpreter exited in unusual way\");\n    //      else\n    //        return ret;\n    return a;\n  }\n\n  // Compile and evaluate Scheme program\n  evaluate(str, after_evaluate) {\n    this.call_stack = [];\n    this.parser = new Parser(str);\n    this.compiler = new Compiler();\n    if (after_evaluate) this.after_evaluate = after_evaluate;\n\n    //Console.puts(\"executing: \" + str);\n\n    this.is_top = true;\n    this.file_stack = [];\n\n    try {\n      return this.resume(false);\n    } catch (e) {\n      e.message = e.message + \" [\" + this.call_stack.join(\", \") + \"]\";\n      return this.on_error(e);\n    }\n  }\n\n  // Resume evaluation\n  // (internally used from Interpreter#execute and Pause#resume)\n  resume(is_resume, a, x, f, c, s) {\n    var ret = undef;\n\n    for (;;) {\n      if (is_resume) {\n        ret = this._execute(a, x, f, c, s);\n        is_resume = false;\n      } else {\n        if (!this.parser) break; // adhoc: when Pause is used via invoke_closure\n        var expr = this.parser.getObject();\n        if (expr === Parser.EOS) break;\n\n        // expand\n        expr = Compiler.expand(expr);\n\n        // compile\n        const vmcode = this.compiler.run(expr);\n\n        // execute\n        ret = this._execute(expr, vmcode.il, 0, [], 0);\n      }\n\n      if (ret instanceof Pause) {\n        //suspend evaluation\n        return ret;\n      }\n    }\n\n    // finished executing all forms\n    this.after_evaluate(ret);\n    return ret;\n  }\n\n  // Execute compiled vmcode\n  evaluate_vmcode(vmcode) {\n    this.call_stack = [];\n    this.is_top = true;\n    this.file_stack = [];\n    try {\n      const ret = this._execute(undef, vmcode.il, 0, [], 0);\n      if (!(ret instanceof Pause)) {\n        this.after_evaluate(ret);\n      }\n      return ret;\n    } catch (e) {\n      e.message = e.message + \" [\" + this.call_stack.join(\", \") + \"]\";\n      return this.on_error(e);\n    }\n  }\n\n  // Invoke a scheme closure\n  invoke_closure(closure, args) {\n    args || (args = []);\n    var n_args = args.length;\n\n    var x = [\n      \"constant\",\n      n_args,\n      [\"argument\", [\"constant\", closure, [\"apply\"]]],\n    ];\n    for (var i = 0; i < n_args; i++) x = [\"constant\", args[i], [\"argument\", x]];\n\n    return this._execute(closure, [\"frame\", x, [\"halt\"]], 0, closure, 0);\n  }\n\n  // only compiling (for debug use only)\n  compile(str) {\n    var obj = Interpreter.read(str);\n    var opc = Compiler.compile(obj);\n    return opc;\n  }\n\n  // before, after: Scheme closure\n  push_dynamic_winder(before, after) {\n    this.current_dynamic_winder = new Interpreter.DynamicWind(\n      this.current_dynamic_winder,\n      before,\n      after\n    );\n  }\n\n  pop_dynamic_winder(before, after) {\n    this.current_dynamic_winder = this.current_dynamic_winder.parent;\n  }\n}\n\n// Take a string and returns an expression.\nInterpreter.read = function (str) {\n  var parser = new Parser(str);\n  var r = parser.getObject();\n  return r == Parser.EOS ? eof : r;\n};\n\nInterpreter.expand = function () {\n  throw \"Interpreter.expand is moved to Compiler.expand\";\n};\n\n//\n// dynamic-wind\n//\n\nInterpreter.DynamicWind = class {\n  constructor(parent, before, after) {\n    // Parent `DynamicWind` obj\n    this.parent = parent;\n    // \"before\" winder (Scheme closure)\n    this.before = before;\n    // \"after\" winder (Scheme closure)\n    this.after = after;\n  }\n};\n\n// A special value indicates the root of the winders\n// (the string is just for debugging purpose.)\nInterpreter.DynamicWind.ROOT = { _: \"this is ROOT.\" };\n\n// Return the list of winders to call\nInterpreter.DynamicWind.listWinders = function (from, to) {\n  // List winders from `from` to `ROOT`\n  var fromStack = [from];\n  while (from !== Interpreter.DynamicWind.ROOT) {\n    from = from.parent;\n    fromStack.push(from);\n  }\n\n  // List winders from `to` to `ROOT` and find the common one\n  var toStack = [];\n  var common;\n  while (true) {\n    var matched = fromStack.find(function (item) {\n      return item === to;\n    });\n    if (matched) {\n      common = matched;\n      break;\n    }\n    toStack.push(to);\n    to = to.parent;\n  }\n\n  // List `after`s to call\n  var ret = [];\n  for (var i = 0; i < fromStack.length; i++) {\n    if (fromStack[i] === common) break;\n    ret.push(fromStack[i].after);\n  }\n\n  // List `before`s to call\n  toStack.reverse();\n  toStack.forEach(function (item) {\n    ret.push(item.before);\n  });\n\n  return ret;\n};\n\n// Return an opecode to run all the winders\nInterpreter.DynamicWind.joinWinders = function (winders, x) {\n  return winders.reduceRight(function (acc, winder) {\n    return [\n      \"frame\",\n      [\"constant\", 0, [\"argument\", [\"constant\", winder, [\"apply\"]]]],\n      acc,\n    ];\n  }, x);\n};\n\n//\n// R7RS Promise (lazy library; has nothing to do with JS Promise)\n//\nclass BiwaPromise {\n  constructor(done, thunk_or_value) {\n    this.box = [done, thunk_or_value];\n  }\n\n  // Return true when this promise is already calculated\n  is_done() {\n    return this.box[0];\n  }\n\n  // Return calculated value of this promise\n  value() {\n    if (!this.is_done()) {\n      throw new Bug(\"this promise is not calculated yet\");\n    }\n    return this.box[1];\n  }\n\n  thunk() {\n    if (this.is_done()) {\n      throw new Bug(\"this promise does not know the thunk\");\n    }\n    return this.box[1];\n  }\n\n  update_with(new_promise) {\n    this.box[0] = new_promise.box[0];\n    this.box[1] = new_promise.box[1];\n    new_promise.box = this.box;\n  }\n}\n\nconst isPromise = function (obj) {\n  return obj instanceof BiwaPromise;\n};\n\n// Create fresh promise\nBiwaPromise.fresh = function (thunk) {\n  return new BiwaPromise(false, thunk);\n};\n// Create calculated promise\nBiwaPromise.done = function (value) {\n  return new BiwaPromise(true, value);\n};\n\n///\n/// infra.js - Basis for library functions\n///\n\n//\n// define_*func - define library functions\n//\nconst check_arity = function (fname, len, min, max) {\n  if (len < min) {\n    if (max && max == min)\n      throw new BiwaError(\n        fname +\n          \": wrong number of arguments (expected: \" +\n          min +\n          \" got: \" +\n          len +\n          \")\"\n      );\n    else\n      throw new BiwaError(\n        fname + \": too few arguments (at least: \" + min + \" got: \" + len + \")\"\n      );\n  } else if (max && max < len)\n    throw new BiwaError(\n      fname + \": too many arguments (at most: \" + max + \" got: \" + len + \")\"\n    );\n};\n\nconst define_libfunc = function (fname, min, max, func) {\n  var f = function (ar, intp) {\n    check_arity(fname, ar.length, min, max);\n    return func(ar, intp);\n  };\n\n  func[\"fname\"] = fname; // for assert_*\n  f[\"inspect\"] = function () {\n    return this.fname;\n  };\n  CoreEnv[fname] = f;\n};\n\nconst alias_libfunc = function (fname, aliases) {\n  if (CoreEnv[fname]) {\n    if (Array.isArray(aliases)) {\n      aliases.map(function (a) {\n        alias_libfunc(fname, a);\n      });\n    } else if (typeof aliases === \"string\") {\n      CoreEnv[aliases] = CoreEnv[fname];\n    } else {\n      console.error(\n        \"[BUG] bad alias for library function \" +\n          \"`\" +\n          fname +\n          \"': \" +\n          aliases.toString()\n      );\n    }\n  } else {\n    console.error(\n      \"[BUG] library function \" +\n        \"`\" +\n        fname +\n        \"'\" +\n        \" does not exist, so can't alias it.\"\n    );\n  }\n};\n\nconst define_syntax = function (sname, func) {\n  var s = new Syntax(sname, func);\n  CoreEnv[sname] = s;\n};\n\nconst define_scmfunc = function (fname, min, max, str) {\n  new Interpreter().evaluate(\"(define \" + fname + \" \" + str + \"\\n)\");\n};\n\n//  define_scmfunc(\"map+\", 2, null,\n//    \"(lambda (proc ls) (if (null? ls) ls (cons (proc (car ls)) (map proc (cdr ls)))))\");\n\n//\n// assertions - type checks\n//\n\nconst assert_number = make_simple_assert(\"number\", function (obj) {\n  return typeof obj == \"number\" || obj instanceof Complex;\n});\n\nconst assert_integer = make_simple_assert(\"integer\", function (obj) {\n  return typeof obj == \"number\" && obj % 1 == 0;\n});\n\nconst assert_real = make_simple_assert(\"real number\", function (obj) {\n  return typeof obj == \"number\";\n});\n\nconst assert_between = make_assert(function (fname, obj, from, to) {\n  if (typeof obj != \"number\" || obj != Math.round(obj)) {\n    throw new BiwaError(\n      fname + \": \" + \"number required, but got \" + to_write(obj)\n    );\n  }\n\n  if (obj < from || to < obj) {\n    throw new BiwaError(\n      fname +\n        \": \" +\n        \"number must be between \" +\n        from +\n        \" and \" +\n        to +\n        \", but got \" +\n        to_write(obj)\n    );\n  }\n});\n\nconst assert_string = make_simple_assert(\"string\", isString);\nconst assert_char = make_simple_assert(\"character\", isChar);\nconst assert_symbol = make_simple_assert(\"symbol\", isSymbol);\nconst assert_port = make_simple_assert(\"port\", isPort);\nconst assert_pair = make_simple_assert(\"pair\", isPair);\nconst assert_list = make_simple_assert(\"list\", isList);\nconst assert_vector = make_simple_assert(\"vector\", isVector);\nconst assert_hashtable = make_simple_assert(\"hashtable\", isHashtable);\nconst assert_mutable_hashtable = make_simple_assert(\n  \"mutable hashtable\",\n  isMutableHashtable\n);\nconst assert_promise = make_simple_assert(\"promise\", isPromise);\n\nconst assert_function = make_simple_assert(\"JavaScript function\", isFunction);\nconst assert_closure = make_simple_assert(\"scheme closure\", isClosure);\nconst assert_procedure = make_simple_assert(\"scheme/js function\", function (\n  obj\n) {\n  return isClosure(obj) || isFunction(obj);\n});\n\nconst assert_date = make_simple_assert(\"date\", function (obj) {\n  // FIXME: this is not accurate (about cross-frame issue)\n  // https://prototype.lighthouseapp.com/projects/8886/tickets/443\n  return obj instanceof Date;\n});\n\n//var assert_instance_of = BiwaScheme.make_assert(function(fname, type, obj, klass){\n//  if(!(obj instanceof klass)){\n//    throw new BiwaScheme.Error(fname + \": \" +\n//                               type + \" required, but got \" +\n//                               BiwaScheme.to_write(obj));\n//  }\n//});\n\nconst assert = make_assert(function (fname, success, message, _fname) {\n  if (!success) {\n    throw new BiwaError((_fname || fname) + \": \" + message);\n  }\n});\n\n//\n// deprecation\n//\n\n// Show deprecation warnig\n// @param {string} title - feature to be deprecated\n// @param {string} ver - when it will be removed (eg. \"1.0\")\n// @param {string} alt - alternatives\nconst deprecate = function (title, ver, alt) {\n  var msg =\n    title +\n    \" is deprecated and will be removed in BiwaScheme \" +\n    ver +\n    \". \" +\n    \"Please use \" +\n    alt +\n    \" instead\";\n  console.warn(msg);\n};\n\n//\n// utils\n//\n\n// Parses a fractional notation in the format: <num>/<denom> (e.g. 3/7, -9/4),\n// where <num> is a valid integer notation, and <denom> is a valid notation\n// for a positive integer.\n//\n// Returns a float if the notation is valid, otherwise false.\n//\n// @param {string} rep - the string representation of the fraction\n// @return {float|false}\nconst parse_fraction = function (rep) {\n  assert_string(rep);\n\n  var frac_parts = rep.split(\"/\");\n\n  if (frac_parts.length !== 2) return false;\n\n  var num_rep = frac_parts[0];\n  var denom_rep = frac_parts[1];\n\n  var num = parse_integer(num_rep, 10);\n  var denom = parse_integer(denom_rep, 10);\n\n  if (num === false || denom === false) return false;\n\n  if (denom <= 0) return false;\n\n  return num / denom;\n};\n\n// Given a string notation of an integer, and the radix, validates the\n// notation: returns true if the notation is valid, otherwise false.\n//\n// @param {string} rep - the string representation of the integer\n// @param {integer} rdx - the radix, where 2 <= rdx <= 36\n// @return {boolean}\nconst is_valid_integer_notation = function (rep, rdx) {\n  assert_string(rep);\n  assert_integer(rdx);\n\n  if (rdx < 2 || rdx > 36) return false;\n\n  var rdx_symbols = \"0123456789abcdefghijklmnopqrstuvwxyz\";\n\n  var valid_symbols = rdx_symbols.slice(0, rdx);\n  var sym_regex = new RegExp(\"^[+-]?\" + \"[\" + valid_symbols + \"]+$\", \"ig\");\n\n  return sym_regex.test(rep);\n};\n\n// Parse an integer. If the integer does not have a valid representation, or\n// produces NaN, - false is returned. If the radix is not within [2..36]\n// range, false is returned as well.\n//\n// @param {string} rep - the string representation of the integer\n// @param {integer} rdx - the radix, where 2 <= rdx <= 36\n// @return {integer|false}\nconst parse_integer = function (rep, rdx) {\n  assert_string(rep);\n  assert_integer(rdx);\n\n  if (rdx < 2 || rdx > 36) return false;\n\n  if (!is_valid_integer_notation(rep, rdx)) return false;\n\n  var res = parseInt(rep, rdx);\n\n  if (Number.isNaN(res)) return false;\n\n  return res;\n};\n\n// Given a string notation of a floating-point number in the standard or\n// scientific notation, returns true if the notation valid, otherwise false.\n//\n// For example:\n// \"1\"      -> true\n// \"1.\"     -> true\n// \"1.23\"   -> true\n// \"1e4\"    -> true\n// \"1E4\"    -> true\n// \"1E4.34\" -> false\n// \"e34\"    -> false\n//\n// @param {string} rep - the string representation of the float.\n// @return {boolean}\nconst is_valid_float_notation = function (rep) {\n  assert_string(rep);\n\n  var sci_regex = /^[+-]?[0-9]+[.]?[0-9]*e[+-]?[0-9]+$/i;\n  var fp_regex = /(^[+-]?[0-9]*[.][0-9]+$)|(^[+-]?[0-9]+[.][0-9]*$)/;\n\n  if (sci_regex.test(rep) || fp_regex.test(rep)) return true;\n\n  return is_valid_integer_notation(rep, 10);\n};\n\n// Parse a floating-point number. If the floating-point number does not have a\n// valid representation, or produces -Infinity, +Infinity or NaN, - false is\n// returned.\n//\n// @param {string} rep - the string representation of the floating-point value\n// @return {float|false}\nconst parse_float = function (rep) {\n  assert_string(rep);\n\n  if (!is_valid_float_notation(rep)) return false;\n\n  var res = new Number(rep).valueOf();\n\n  if (Number.isNaN(res)) return false;\n\n  if (!Number.isFinite(res)) return false;\n\n  return res;\n};\n\n//\n// R6RS Enumerations\n// http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib-Z-H-15.html#node_chap_14\n//\n// Example\n//\n//   (define-enumeration color\n//     (black white purple maroon)\n//     color-set)\n//\n//   (color black)                  ;=> 'black\n//   (color purpel)                 ;=> &syntax exception\n//   (enum-set->list\n//     (color-set maroon white))    ;=> #<enum-set (white maroon)>\n\nconst Enumeration = {};\n\n// Represents an enum_type.\n//\n// Becuase there is no way to access an EnumType directly from Scheme,\n// EnumType#to_write is not defined.\n//\n// Properties\n//\n// members - Array of symbols (no duplicate)\n//\nEnumeration.EnumType = class {\n  // Creates a new enum_type.\n  //\n  // members - Array of symbols.\n  //           Symbols may be duplicate (I think you shouldn't, though :-p).\n  constructor(members) {\n    this.members = [...new Set(members)];\n  }\n\n  // Returns an EnumSet.\n  universe() {\n    return new Enumeration.EnumSet(this, this.members);\n  }\n\n  // Returns a function which map a symbol to an integer (or #f, if\n  // the symbol is out of the universe).\n  //\n  // Implementation note: don't forget this.members may have duplicates.\n  indexer() {\n    // ar[0] - a symbol\n    // Returns an integer or #f.\n    return (ar) => {\n      assert_symbol(ar[0], \"(enum-set indexer)\");\n      var idx = this.members.indexOf(ar[0]);\n      return idx === -1 ? false : idx;\n    };\n  }\n\n  // Retuns a function which creates an enum_set from a list of\n  // symbols (Symbols may be duplicate.)\n  constructor_() {\n    // ar[0] - a list of symbol\n    // Returns a enum_set.\n    return (ar) => {\n      assert_list(ar[0], \"(enum-set constructor)\");\n      var symbols = ar[0].to_array();\n      symbols.forEach(function (arg) {\n        assert_symbol(arg, \"(enum-set constructor)\");\n      });\n\n      return new Enumeration.EnumSet(this, symbols);\n    };\n  }\n};\n\n// Represents an enum_set of an enum_type.\n//\n// Properties\n//\n// enum_type - The enum_type.\n// symbols   - Array of symbols (no duplicate, properly ordered)\n//\nEnumeration.EnumSet = class {\n  // Creates a new enum_set.\n  //\n  // enum_type - An EnumType\n  // symbols   - Array of symbols.\n  //\n  // initialize normalizes symbols.\n  //   - remove duplicates\n  //   - order by universe\n  constructor(enum_type, symbols) {\n    this.enum_type = enum_type;\n    this.symbols = enum_type.members.filter((sym) => symbols.includes(sym));\n  }\n\n  // Returns a list of symbols.\n  symbol_list() {\n    return array_to_list(this.symbols);\n  }\n\n  // Returns true if the enum_set includes the symbol.\n  // 'symbol' is allowed to be a symbol which is not included in the universe.\n  is_member(symbol) {\n    return this.symbols.includes(symbol);\n  }\n\n  // Returns true if:\n  // - the enum_set is a subset of the enum_set 'other', and\n  // - the universe of the enum_set is a subset of\n  //   the universe of 'other'.\n  // The enum_set and 'other' may belong to different enum_type.\n  is_subset(other) {\n    // Check elements\n    if (this.symbols.some((sym) => !other.symbols.includes(sym))) {\n      return false;\n    }\n\n    // Check universe\n    if (this.enum_type === other.enum_type) {\n      return true;\n    } else {\n      return this.enum_type.members.every((sym) =>\n        other.enum_type.members.includes(sym)\n      );\n    }\n  }\n\n  // Returns true if:\n  //   - the enum_set contains the same set of symbols as 'other', and\n  //   - universe of the enum_set contains the same set of symbols\n  //     as the universe of 'other'.\n  //\n  // The enum_set and 'other' may belong to different enum_type.\n  equal_to(other) {\n    return this.is_subset(other) && other.is_subset(this);\n  }\n\n  // Returns a enum_set which has:\n  // - all the symbols included in the enum_set or the enum_set 'other'.\n  // The enum_set and 'other' *must* belong to the same enum_type.\n  union(other) {\n    var syms = this.enum_type.members.filter(\n      (sym) => this.symbols.includes(sym) || other.symbols.includes(sym)\n    );\n    return new Enumeration.EnumSet(this.enum_type, syms);\n  }\n\n  // Returns a enum_set which has:\n  // - the symbols included both in the enum_set or the enum_set 'other'.\n  // The enum_set and 'other' *must* belong to the same enum_type.\n  intersection(other) {\n    var syms = this.symbols.filter((sym) => other.symbols.includes(sym));\n    return new Enumeration.EnumSet(this.enum_type, syms);\n  }\n\n  // Returns a enum_set which has:\n  // - the symbols included in the enum_set and not in the enum_set 'other'.\n  // The enum_set and 'other' *must* belong to the same enum_type.\n  difference(other) {\n    var syms = this.symbols.filter((sym) => !other.symbols.includes(sym));\n    return new Enumeration.EnumSet(this.enum_type, syms);\n  }\n\n  // Returns a enum_set which has:\n  // - the symbols included in the universe but not in the enum_set.\n  complement() {\n    var syms = this.enum_type.members.filter(\n      (sym) => !this.symbols.includes(sym)\n    );\n    return new Enumeration.EnumSet(this.enum_type, syms);\n  }\n\n  // Returns a enum_set which has:\n  // - the symbols included in the enum_set and the universe of the enum_set 'other'.\n  // The enum_set and 'other' may belong to different enum_type.\n  projection(other) {\n    var syms = this.symbols.filter((sym) =>\n      other.enum_type.members.includes(sym)\n    );\n    return new Enumeration.EnumSet(other.enum_type, syms);\n  }\n\n  // Returns a string which represents the enum_set.\n  toString() {\n    return \"#<EnumSet \" + inspect(this.symbols) + \">\";\n  }\n};\n\nconst isEnumSet = function (obj) {\n  return obj instanceof Enumeration.EnumSet;\n};\n\nconst assert_enum_set = make_simple_assert(\"enum_set\", isEnumSet);\n\n//\n// Memoize\n//\nconst memoize = function (klass, names) {\n  const proto = klass.prototype;\n  names.forEach((name) => {\n    // Copy original function foo as 'compute_foo'\n    proto[\"compute_\" + name] = proto[name];\n    // Define memoized version\n    proto[name] = function (/*arguments*/) {\n      if (!this.hasOwnProperty(\"cached_\" + name)) {\n        this[\"cached_\" + name] = this[\"compute_\" + name].apply(\n          this,\n          Array.from(arguments)\n        );\n      }\n      return this[\"cached_\" + name];\n    };\n  });\n};\nmemoize(Enumeration.EnumSet, [\"symbol_list\"]);\nmemoize(Enumeration.EnumType, [\"universe\", \"indexer\", \"constructor_\"]);\n\n//\n// R6RS Records\n// http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib-Z-H-7.html#node_chap_6\n//\n// Record is like struct in C, but supports more feature like inheritance.\n// see also: src/library/r6rs_lib.js\n\n//\n// Record\n// represents each instance of record type\n//\nclass Record {\n  constructor(rtd, values) {\n    assert_record_td(rtd, \"new Record\");\n\n    this.rtd = rtd;\n    this.fields = values;\n  }\n\n  get(k) {\n    return this.fields[k];\n  }\n\n  set(k, v) {\n    this.fields[k] = v;\n  }\n\n  toString() {\n    var contents = to_write(this.fields);\n    return \"#<Record \" + this.rtd.name + \" \" + contents + \">\";\n  }\n}\n\nconst isRecord = function (o) {\n  return o instanceof Record;\n};\n\n// Defined record types\nRecord._DefinedTypes = {};\n\nRecord.define_type = function (name_str, rtd, cd) {\n  return (Record._DefinedTypes[name_str] = { rtd: rtd, cd: cd });\n};\n\nRecord.get_type = function (name_str) {\n  return Record._DefinedTypes[name_str];\n};\n\n//\n// RTD (Record type descriptor)\n//\nRecord.RTD = class {\n  //          Symbol RTD        Symbol Bool  Bool    Array\n  constructor(name, parent_rtd, uid, sealed, opaque, fields) {\n    this.name = name;\n    this.parent_rtd = parent_rtd;\n    this.is_base_type = !parent_rtd;\n\n    if (uid) {\n      this.uid = uid;\n      this.generative = false;\n    } else {\n      this.uid = this._generate_new_uid();\n      this.generative = true;\n    }\n\n    this.sealed = !!sealed;\n    this.opaque = parent_rtd.opaque || !!opaque;\n\n    this.fields = fields.map(function (field) {\n      return { name: field[0], mutable: !!field[1] };\n    });\n  }\n\n  // Returns the name of the k-th field.\n  // Only used for error messages.\n  field_name(k) {\n    var names = this._field_names();\n\n    for (var par = this.parent_rtd; par; par = par.parent_rtd) {\n      names = par._field_names() + names;\n    }\n\n    return names[k];\n  }\n\n  _field_names() {\n    return this.fields.map(function (spec) {\n      return spec.name;\n    });\n  }\n\n  _generate_new_uid() {\n    return Sym(uniqueId(\"__record_td_uid\"));\n  }\n\n  toString() {\n    return \"#<RecordTD \" + name + \">\";\n  }\n};\n\nRecord.RTD.NongenerativeRecords = {};\nconst isRecordTD = function (o) {\n  return o instanceof Record.RTD;\n};\n\n//\n// CD (Record constructor descriptor)\n//\nRecord.CD = class {\n  constructor(rtd, parent_cd, protocol) {\n    this._check(rtd, parent_cd, protocol);\n    this.rtd = rtd;\n    this.parent_cd = parent_cd;\n    if (protocol) {\n      this.has_custom_protocol = true;\n      this.protocol = protocol;\n    } else {\n      this.has_custom_protocol = false;\n      if (rtd.parent_rtd)\n        this.protocol = this._default_protocol_for_derived_types();\n      else this.protocol = this._default_protocol_for_base_types();\n    }\n  }\n\n  _check(rtd, parent_cd, protocol) {\n    if (rtd.is_base_type && parent_cd)\n      throw new Error(\"Record.CD.new: cannot specify parent cd of a base type\");\n\n    if (parent_cd && rtd.parent_rtd && parent_cd.rtd != rtd.parent_rtd)\n      throw new Error(\n        \"Record.CD.new: mismatched parents between rtd and parent_cd\"\n      );\n\n    if (rtd.parent_rtd && !parent_cd && protocol)\n      throw new Error(\n        \"Record.CD.new: protocol must be #f when parent_cd is not given\"\n      );\n\n    if (parent_cd && parent_cd.has_custom_protocol && !protocol)\n      throw new Error(\n        \"Record.CD.new: protocol must be specified when parent_cd has a custom protocol\"\n      );\n  }\n\n  _default_protocol_for_base_types() {\n    // (lambda (p) p)\n    // called with `p' as an argument\n    return function (ar) {\n      var p = ar[0];\n      assert_procedure(p, \"_default_protocol/base\");\n      return p;\n    };\n  }\n\n  _default_protocol_for_derived_types() {\n    // (lambda (n)\n    //   (lambda (a b x y s t)\n    //     (let1 p (n a b x y) (p s t))))\n    // called with `n' as an argument\n    var rtd = this.rtd;\n    return function (ar) {\n      var n = ar[0];\n      assert_procedure(n, \"_default_protocol/n\");\n\n      var ctor = function (args) {\n        var my_argc = rtd.fields.length;\n        var ancestor_argc = args.length - my_argc;\n\n        var ancestor_values = args.slice(0, ancestor_argc);\n        var my_values = args.slice(ancestor_argc);\n\n        // (n a b x y) => p\n        return new Call(n, ancestor_values, function (ar) {\n          var p = ar[0];\n          assert_procedure(p, \"_default_protocol/p\");\n\n          // (p s t) => record\n          return new Call(p, my_values, function (ar) {\n            var record = ar[0];\n            assert_record(record, \"_default_protocol/result\");\n\n            return record;\n          });\n        });\n      };\n      return ctor;\n    };\n  }\n\n  toString() {\n    return \"#<RecordCD \" + this.rtd.name + \">\";\n  }\n\n  record_constructor() {\n    var arg_for_protocol = this.parent_cd\n      ? this._make_n([], this.rtd)\n      : this._make_p();\n    arg_for_protocol = arg_for_protocol.bind(this);\n\n    return new Call(this.protocol, [arg_for_protocol], function (ar) {\n      var ctor = ar[0];\n      assert_procedure(ctor, \"record_constructor\");\n      return ctor;\n    });\n  }\n\n  // Create the function `p' which is given to the protocol.\n  _make_p() {\n    return function (values) {\n      return new Record(this.rtd, values);\n      // TODO: check argc\n    };\n  }\n\n  // Create the function `n' which is given to the protocol.\n  // When creating an instance of a derived type,\n  // _make_n is called for each ancestor rtd's.\n  _make_n(children_values, rtd) {\n    var parent_cd = this.parent_cd;\n\n    if (parent_cd) {\n      // called from protocol (n)\n      var n = function (args_for_n) {\n        // called from protocol (p)\n        var p = function (args_for_p) {\n          var values = [].concat(args_for_p[0]).concat(children_values);\n          var parent_n = parent_cd._make_n(values, rtd);\n\n          return new Call(parent_cd.protocol, [parent_n], function (ar) {\n            var ctor = ar[0];\n            assert_procedure(ctor, \"_make_n\");\n\n            return new Call(ctor, args_for_n, function (ar) {\n              var record = ar[0];\n              assert_record(record);\n              return record;\n            });\n          });\n        };\n        return p;\n      };\n      return n;\n    } else {\n      var n = function (my_values) {\n        var values = my_values.concat(children_values);\n        return new Record(rtd, values);\n        // TODO: check argc\n      };\n      return n;\n    }\n  }\n};\n\nconst isRecordCD = function (o) {\n  return o instanceof Record.CD;\n};\n\nconst assert_record = make_simple_assert(\"record\", isRecord);\nconst assert_record_td = make_simple_assert(\n  \"record type descriptor\",\n  isRecordTD\n);\nconst assert_record_cd = make_simple_assert(\n  \"record constructor descriptor\",\n  isRecordCD\n);\n\n//\n// Values\n//\nclass Values {\n  constructor(values) {\n    this.content = values;\n  }\n\n  to_write() {\n    return \"#<Values \" + this.content.map(to_write).join(\" \") + \">\";\n  }\n}\n\nconst Console = {};\n\n// Actual implementation is in src/platforms/*/console.js\n\ndefine_libfunc(\"html-escape\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return escape(ar[0]);\n});\nconst inspect_objs = function (objs) {\n  return objs.map(inspect).join(\", \");\n};\ndefine_libfunc(\"inspect\", 1, null, function (ar) {\n  return inspect_objs(ar);\n});\ndefine_libfunc(\"inspect!\", 1, null, function (ar) {\n  Console.puts(inspect_objs(ar));\n  return undef;\n});\n\n//\n// json\n//\n// json->sexp\n// Array -> list\n// Object -> alist\n// (number, boolean, string,\n//\nconst json2sexp = function (json) {\n  switch (true) {\n    case typeof json === \"number\" ||\n      typeof json === \"string\" ||\n      json === true ||\n      json === false:\n      return json;\n    case Array.isArray(json):\n      return array_to_list(json.map(json2sexp));\n    case typeof json == \"object\":\n      var ls = nil;\n      for (const key in json) {\n        ls = new Pair(new Pair(key, json2sexp(json[key])), ls);\n      }\n      return ls;\n    default:\n      throw new Error(\n        \"json->sexp: detected invalid value for json: \" + inspect(json)\n      );\n  }\n};\ndefine_libfunc(\"json->sexp\", 1, 1, function (ar) {\n  return json2sexp(ar[0]);\n});\n\n// (vector-push! v item1 item2 ...)\ndefine_libfunc(\"vector-push!\", 2, null, function (ar) {\n  assert_vector(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    ar[0].push(ar[i]);\n  }\n  return ar[0];\n});\n\n//\n//from Gauche\n//\n\n// (identity obj)\n// Returns obj.\ndefine_libfunc(\"identity\", 1, 1, function (ar) {\n  return ar[0];\n});\n\n// (inc! i)\n// = (begin (set! i (+ i 1)) i)\n// Increments i (i.e., set i+1 to i).\ndefine_syntax(\"inc!\", function (x) {\n  var target = x.cdr.car;\n  return List(\n    Sym(\"begin\"),\n    List(Sym(\"set!\"), target, List(Sym(\"+\"), target, 1)),\n    target\n  );\n});\n\n// (dec! i)\n// = (begin (set! i (- i 1)) i)\n// Decrements i (i.e., set i-1 to i).\ndefine_syntax(\"dec!\", function (x) {\n  var target = x.cdr.car;\n  return List(\n    Sym(\"begin\"),\n    List(Sym(\"set!\"), target, List(Sym(\"-\"), target, 1)),\n    target\n  );\n});\n\n// string\n\ndefine_libfunc(\"string-concat\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  return ar[0].to_array().join(\"\");\n});\n\ndefine_libfunc(\"string-split\", 2, 2, function (ar) {\n  assert_string(ar[0]);\n  assert_string(ar[1]);\n  return array_to_list(ar[0].split(ar[1]));\n});\n\ndefine_libfunc(\"string-join\", 1, 2, function (ar) {\n  assert_list(ar[0]);\n  var delim = \"\";\n  if (ar[1]) {\n    assert_string(ar[1]);\n    delim = ar[1];\n  }\n  return ar[0].to_array().join(delim);\n});\n\n// lists\n\ndefine_libfunc(\"intersperse\", 2, 2, function (ar) {\n  var item = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n\n  var ret = [];\n  ls.to_array()\n    .reverse()\n    .forEach(function (x) {\n      ret.push(x);\n      ret.push(item);\n    });\n  ret.pop();\n  return array_to_list(ret);\n});\n\ndefine_libfunc(\"map-with-index\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    lists = ar;\n  lists.forEach(assert_list);\n\n  var results = [],\n    i = 0;\n  return Call.multi_foreach(lists, {\n    call: function (xs) {\n      var args = xs.map(function (x) {\n        return x.car;\n      });\n      args.unshift(i);\n      i++;\n      return new Call(proc, args);\n    },\n    result: function (res) {\n      results.push(res);\n    },\n    finish: function () {\n      return array_to_list(results);\n    },\n  });\n});\n\n// loop\n\n// (dotimes (variable limit result) body ...)\n// Iterate with variable 0 to limit-1.\n// ->\n//    (do ((tlimit limit)\n//         (variable 0 (+ variable 1)))\n//        ((>= variable tlimit) result)\n//      body ...)\ndefine_syntax(\"dotimes\", function (x) {\n  var spec = x.cdr.car,\n    bodies = x.cdr.cdr;\n  var variable = spec.car,\n    limit = spec.cdr.car,\n    result = spec.cdr.cdr.car;\n  var tlimit = gensym();\n\n  var do_vars = deep_array_to_list([\n    [tlimit, limit],\n    [variable, 0, [Sym(\"+\"), variable, 1]],\n  ]);\n  var do_check = deep_array_to_list([[Sym(\">=\"), variable, tlimit], result]);\n\n  return new Pair(Sym(\"do\"), new Pair(do_vars, new Pair(do_check, bodies)));\n});\n\n// sorting (Obsolete: use list-sort, etc. instead of these.)\n\n// utility function. takes a JS Array and a Scheme procedure,\n// returns sorted array\nvar sort_with_comp = function (ary, proc, intp) {\n  return ary.sort(function (a, b) {\n    var intp2 = new Interpreter(intp);\n    return intp2.invoke_closure(proc, [a, b]);\n  });\n};\n\ndefine_libfunc(\"list-sort/comp\", 1, 2, function (ar, intp) {\n  assert_procedure(ar[0]);\n  assert_list(ar[1]);\n\n  return array_to_list(sort_with_comp(ar[1].to_array(), ar[0], intp));\n});\ndefine_libfunc(\"vector-sort/comp\", 1, 2, function (ar, intp) {\n  assert_procedure(ar[0]);\n  assert_vector(ar[1]);\n\n  return sort_with_comp([...ar[1]], ar[0], intp);\n});\ndefine_libfunc(\"vector-sort/comp!\", 1, 2, function (ar, intp) {\n  assert_procedure(ar[0]);\n  assert_vector(ar[1]);\n\n  sort_with_comp(ar[1], ar[0], intp);\n  return undef;\n});\n\n// macros\n\n//(define-macro (foo x y) body ...)\n//(define-macro foo lambda)\n\nvar rearrange_args = function (expected, given) {\n  var args = [];\n  var dotpos = new Compiler().find_dot_pos(expected);\n  if (dotpos == -1) args = given;\n  else {\n    for (var i = 0; i < dotpos; i++) {\n      args[i] = given[i];\n    }\n    args[i] = array_to_list(given.slice(i));\n  }\n  return args;\n};\ndefine_syntax(\"define-macro\", function (x) {\n  var head = x.cdr.car;\n  var expected_args;\n  if (head instanceof Pair) {\n    var name = head.car;\n    expected_args = head.cdr;\n    var body = x.cdr.cdr;\n    var lambda = new Pair(Sym(\"lambda\"), new Pair(expected_args, body));\n  } else {\n    var name = head;\n    var lambda = x.cdr.cdr.car;\n    expected_args = lambda.cdr.car;\n  }\n\n  //[\"close\", <args>, <n>, <body>, <opecodes_next>, <dotpos>]\n  var opc = Compiler.compile(lambda).il;\n  if (opc[2] != 0)\n    throw new Bug(\n      \"you cannot use free variables in macro expander (or define-macro must be on toplevel)\"\n    );\n  var cls = new Closure(opc[3], [], -1, undefined);\n\n  TopEnv[name.name] = new Syntax(name.name, function (sexp) {\n    var given_args = sexp.to_array();\n\n    given_args.shift();\n\n    var intp = new Interpreter();\n    var args = rearrange_args(expected_args, given_args);\n    var result = intp.invoke_closure(cls, args);\n    return result;\n  });\n\n  return undef;\n});\n\nvar macroexpand_1 = function (x) {\n  if (x instanceof Pair) {\n    // TODO: Should we check CoreEnv too?\n    if (x.car instanceof BiwaSymbol && TopEnv[x.car.name] instanceof Syntax) {\n      var transformer = TopEnv[x.car.name];\n      x = transformer.transform(x);\n    } else\n      throw new Error(\"macroexpand-1: `\" + to_write(x) + \"' is not a macro\");\n  }\n  return x;\n};\ndefine_syntax(\"%macroexpand\", function (x) {\n  var expanded = Compiler.expand(x.cdr.car);\n  return List(Sym(\"quote\"), expanded);\n});\ndefine_syntax(\"%macroexpand-1\", function (x) {\n  var expanded = macroexpand_1(x.cdr.car);\n  return List(Sym(\"quote\"), expanded);\n});\n\ndefine_libfunc(\"macroexpand\", 1, 1, function (ar) {\n  return Compiler.expand(ar[0]);\n});\ndefine_libfunc(\"macroexpand-1\", 1, 1, function (ar) {\n  return macroexpand_1(ar[0]);\n});\n\ndefine_libfunc(\"gensym\", 0, 1, function (ar) {\n  if (ar[0] == undefined) {\n    return gensym();\n  } else {\n    assert_string(ar[0]);\n    return gensym(ar[0]);\n  }\n});\n\n// i/o\n\ndefine_libfunc(\"print\", 1, null, function (ar) {\n  ar.map(function (item) {\n    Console.puts(to_display(item), true);\n  });\n  Console.puts(\"\"); //newline\n  return undef;\n});\ndefine_libfunc(\"write-to-string\", 1, 1, function (ar) {\n  return to_write(ar[0]);\n});\ndefine_libfunc(\"read-from-string\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return Interpreter.read(ar[0]);\n});\ndefine_libfunc(\"port-closed?\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  return !ar[0].is_open;\n});\n//define_libfunc(\"with-input-from-port\", 2, 2, function(ar){\n//define_libfunc(\"with-error-to-port\", 2, 2, function(ar){\ndefine_libfunc(\"with-output-to-port\", 2, 2, function (ar) {\n  var port = ar[0],\n    proc = ar[1];\n  assert_port(port);\n  assert_procedure(proc);\n\n  var original_port = Port.current_output;\n  Port.current_output = port;\n\n  return new Call(proc, [port], function (ar) {\n    port.close();\n    Port.current_output = original_port;\n\n    return ar[0];\n  });\n});\n\n// syntax\n\ndefine_syntax(\"let1\", function (x) {\n  //(let1 vari expr body ...)\n  //=> ((lambda (var) body ...) expr)\n  var vari = x.cdr.car;\n  var expr = x.cdr.cdr.car;\n  var body = x.cdr.cdr.cdr;\n\n  return new Pair(\n    new Pair(Sym(\"lambda\"), new Pair(new Pair(vari, nil), body)),\n    new Pair(expr, nil)\n  );\n});\n\n//\n// Regular Expression\n//\nvar assert_regexp = function (obj, fname) {\n  if (!(obj instanceof RegExp))\n    throw new Error(fname + \": regexp required, but got \" + to_write(obj));\n};\n\n//Function: string->regexp string &keyword case-fold\ndefine_libfunc(\"string->regexp\", 1, 1, function (ar) {\n  assert_string(ar[0], \"string->regexp\");\n  return new RegExp(ar[0]); //todo: case-fold\n});\n//Function: regexp? obj\ndefine_libfunc(\"regexp?\", 1, 1, function (ar) {\n  return ar[0] instanceof RegExp;\n});\n//Function: regexp->string regexp\ndefine_libfunc(\"regexp->string\", 1, 1, function (ar) {\n  assert_regexp(ar[0], \"regexp->string\");\n  return ar[0].toString().slice(1, -1); //cut '/'\n});\n\ndefine_libfunc(\"regexp-exec\", 2, 2, function (ar) {\n  var rexp = ar[0];\n  if (typeof ar[0] === \"string\") {\n    rexp = new RegExp(ar[0]);\n  }\n  assert_regexp(rexp, \"regexp-exec\");\n  assert_string(ar[1], \"regexp-exec\");\n  var ret = rexp.exec(ar[1]);\n  return ret === null ? false : array_to_list(ret);\n});\n\n//  //Function: rxmatch regexp string\n//  define_libfunc(\"rxmatch\", 1, 1, function(ar){\n//    assert_regexp(ar[0], \"rxmatch\");\n//    assert_string(ar[1], \"rxmatch\");\n//    return ar[0].match(ar[1]);\n//  });\n//Function: rxmatch-start match &optional (i 0)\n//Function: rxmatch-end match &optional (i 0)\n//Function: rxmatch-substring match &optional (i 0)\n//Function: rxmatch-num-matches match\n//Function: rxmatch-after match &optional (i 0)\n//Function: rxmatch-before match &optional (i 0)\n//Generic application: regmatch &optional index\n//Generic application: regmatch 'before &optional index\n//Generic application: regmatch 'after &optional index\n//Function: regexp-replace regexp string substitution\n\n// regexp-replace-all regexp string substitution\ndefine_libfunc(\"regexp-replace-all\", 3, 3, function (ar) {\n  var pat = ar[0];\n  if (typeof pat === \"string\") {\n    var rexp = new RegExp(pat, \"g\");\n  } else {\n    assert_regexp(pat);\n    var rexp = new RegExp(pat.source, \"g\");\n  }\n  assert_string(ar[1]);\n  assert_string(ar[2]);\n  return ar[1].replace(rexp, ar[2]);\n});\n//Function: regexp-replace* string rx1 sub1 rx2 sub2 ...\n//Function: regexp-replace-all* string rx1 sub1 rx2 sub2 ...\n//Function: regexp-quote string\n//Macro: rxmatch-let match-expr (var ...) form ...\n//Macro: rxmatch-if match-expr (var ...) then-form else-form\n//Macro: rxmatch-cond clause ...\n//Macro: rxmatch-case string-expr clause ...\n\n//\n// interface to javascript\n//\ndefine_libfunc(\"js-eval\", 1, 1, function (ar) {\n  return eval(ar[0]);\n});\ndefine_libfunc(\"js-ref\", 2, 2, function (ar) {\n  if (typeof ar[1] === \"string\" || Number.isInteger(ar[1])) {\n    return ar[0][ar[1]];\n  } else {\n    assert_symbol(ar[1]);\n    return ar[0][ar[1].name];\n  }\n});\ndefine_libfunc(\"js-set!\", 3, 3, function (ar) {\n  assert_string(ar[1]);\n  ar[0][ar[1]] = ar[2];\n  return undef;\n});\n\n// (js-call (js-eval \"Math.pow\") 2 4)\ndefine_libfunc(\"js-call\", 1, null, function (ar) {\n  var js_func = ar.shift();\n  assert_function(js_func);\n\n  var receiver = null;\n  return js_func.apply(receiver, ar);\n});\n// (js-invoke (js-new \"Date\") \"getTime\")\ndefine_libfunc(\"js-invoke\", 2, null, function (ar) {\n  var js_obj = ar.shift();\n  var func_name = ar.shift();\n  if (!typeof func_name === \"string\") {\n    assert_symbol(func_name);\n    func_name = func_name.name;\n  }\n  if (js_obj[func_name]) return js_obj[func_name].apply(js_obj, ar);\n  else throw new Error(\"js-invoke: function \" + func_name + \" is not defined\");\n});\n\n// Short hand for JavaScript method call.\n//\n// (js-invocation obj '(foo 1 2 3))  ;=> obj.foo(1,2,3)\n// (js-invocation obj '(foo 1 2 3)   ;=> obj.foo(1,2,3)\n//                    'bar           ;      .bar\n//                    '(baz 4 5))    ;      .baz(4,5)\n// (js-invocation 'Math '(pow 2 3))  ;=> Math.pow(2,3)\n//\n// It also converts\n//   (lambda (e) ...) to\n//   (js-closure (lambda (e) ...))\n//   and\n//   '((a . b) (c . 4)) to\n//   {a: \"b\", c: 4}\n//\ndefine_libfunc(\"js-invocation\", 2, null, function (ar, intp) {\n  var receiver = ar.shift();\n  // TODO: convert lambdas by js-closure\n  if (isSymbol(receiver)) {\n    receiver = eval(receiver.name); //XXX: is this ok?\n  }\n\n  var v = receiver;\n\n  // Process each method call\n  ar.forEach(function (callspec) {\n    if (isSymbol(callspec)) {\n      // Property access\n      v = v[callspec.name];\n    } else if (isList(callspec)) {\n      // Method call\n      var args = callspec.to_array();\n\n      assert_symbol(args[0]);\n      var method = args.shift().name;\n\n      // Convert arguments\n      args = args.map(function (arg) {\n        if (isClosure(arg)) {\n          // closure -> JavaScript funciton\n          return js_closure(arg, intp);\n        } else if (isList(arg)) {\n          // alist -> JavaScript Object\n          var o = {};\n          arg.foreach(function (pair) {\n            assert_symbol(pair.car);\n            o[pair.car.name] = pair.cdr;\n          });\n          return o;\n        } else return arg;\n      });\n\n      // Call the method\n      if (!typeof v[method] === \"function\") {\n        throw new BiwaError(\n          \"js-invocation: the method `\" + method + \"' not found\"\n        );\n      }\n      v = v[method].apply(v, args);\n    } else {\n      // (wrong argument)\n      throw new BiwaError(\n        \"js-invocation: expected list or symbol for callspec but got \" +\n          inspect(callspec)\n      );\n    }\n  });\n\n  return v;\n});\n\n// TODO: provide corresponding macro \"..\"\ndefine_syntax(\"..\", function (x) {\n  if (x.cdr == nil) {\n    throw new Error(\"malformed ..\");\n  }\n  return new Pair(Sym(\"js-invocation\"), x.cdr);\n});\n\n// (js-new (js-eval \"Date\") 2005 1 1)\n// (js-new (js-eval \"Draggable\") elem 'onEnd (lambda (drg) ...))\n//   If symbol is given, following arguments are converted to\n//   an js object. If any of them is a scheme closure,\n//   it is converted to js function which invokes that closure.\n//\n// (js-new \"Date\" 2005 1 1)\n//   You can pass javascript program string for constructor.\ndefine_libfunc(\"js-new\", 1, null, function (ar, intp) {\n  // make js object from key-value pair\n  var array_to_obj = function (ary) {\n    if (ary.length % 2 != 0)\n      throw new Error(\"js-new: odd number of key-value pair\");\n\n    var obj = {};\n    for (var i = 0; i < ary.length; i += 2) {\n      var key = ary[i],\n        value = ary[i + 1];\n      assert_symbol(key);\n      if (isClosure(value)) value = js_closure(value, intp);\n\n      obj[key.name] = value;\n    }\n    return obj;\n  };\n\n  var ctor = ar.shift();\n  if (typeof ctor === \"string\") ctor = eval(ctor);\n\n  if (ar.length == 0) {\n    return new ctor();\n  } else {\n    // pack args to js object, if symbol appears\n    var args = [];\n    for (var i = 0; i < ar.length; i++) {\n      if (ar[i] instanceof BiwaSymbol) {\n        args.push(array_to_obj(ar.slice(i)));\n        break;\n      } else {\n        args.push(ar[i]);\n      }\n    }\n    // Run `new ctor(...args)`;\n    return new (Function.prototype.bind.apply(ctor, [null].concat(args)))();\n  }\n});\n\n// (js-obj \"foo\" 1 \"bar\" 2)\n// -> {\"foo\": 1, \"bar\": 2}\ndefine_libfunc(\"js-obj\", 0, null, function (ar) {\n  if (ar.length % 2 != 0) {\n    throw new Error(\"js-obj: number of arguments must be even\");\n  }\n\n  var obj = {};\n  for (let i = 0; i < ar.length / 2; i++) {\n    assert_string(ar[i * 2]);\n    obj[ar[i * 2]] = ar[i * 2 + 1];\n  }\n  return obj;\n});\n\nconst js_closure = function (proc, intp) {\n  var intp2 = new Interpreter(intp);\n  return function (/*args*/) {\n    return intp2.invoke_closure(proc, Array.from(arguments));\n  };\n};\n// (js-closure (lambda (event) ..))\n// Returns a js function which executes the given procedure.\n//\n// Example\n//   (add-handler! ($ \"#btn\") \"click\" (js-closure on-click))\ndefine_libfunc(\"js-closure\", 1, 1, function (ar, intp) {\n  assert_closure(ar[0]);\n  return js_closure(ar[0], intp);\n});\n\ndefine_libfunc(\"js-null?\", 1, 1, function (ar) {\n  return ar[0] === null;\n});\n\ndefine_libfunc(\"js-undefined?\", 1, 1, function (ar) {\n  return ar[0] === undefined;\n});\n\ndefine_libfunc(\"js-function?\", 1, 1, function (ar) {\n  return typeof ar[0] === \"function\";\n});\n\ndefine_libfunc(\"js-array-to-list\", 1, 1, function (ar) {\n  deprecate(\"js-array-to-list\", \"1.0\", \"js-array->list\");\n  return array_to_list(ar[0]);\n});\n\ndefine_libfunc(\"js-array->list\", 1, 1, function (ar) {\n  return array_to_list(ar[0]);\n});\n\ndefine_libfunc(\"list-to-js-array\", 1, 1, function (ar) {\n  deprecate(\"list-to-js-array\", \"1.0\", \"list->js-array\");\n  return ar[0].to_array();\n});\n\ndefine_libfunc(\"list->js-array\", 1, 1, function (ar) {\n  return ar[0].to_array();\n});\n\ndefine_libfunc(\"alist-to-js-obj\", 1, 1, function (ar) {\n  deprecate(\"alist-to-js-obj\", \"1.0\", \"alist->js-obj\");\n  return alist_to_js_obj(ar[0]);\n});\n\ndefine_libfunc(\"alist->js-obj\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  return alist_to_js_obj(ar[0]);\n});\n\ndefine_libfunc(\"js-obj-to-alist\", 1, 1, function (ar) {\n  deprecate(\"js-obj-to-alist\", \"1.0\", \"js-obj->alist\");\n  return js_obj_to_alist(ar[0]);\n});\ndefine_libfunc(\"js-obj->alist\", 1, 1, function (ar) {\n  return js_obj_to_alist(ar[0]);\n});\n\n//\n// timer, sleep\n//\ndefine_libfunc(\"timer\", 2, 2, function (ar, intp) {\n  var proc = ar[0],\n    sec = ar[1];\n  assert_closure(proc);\n  assert_real(sec);\n  var intp2 = new Interpreter(intp);\n  setTimeout(function () {\n    intp2.invoke_closure(proc);\n  }, sec * 1000);\n  return undef;\n});\ndefine_libfunc(\"set-timer!\", 2, 2, function (ar, intp) {\n  var proc = ar[0],\n    sec = ar[1];\n  assert_closure(proc);\n  assert_real(sec);\n  var intp2 = new Interpreter(intp);\n  return setInterval(function () {\n    intp2.invoke_closure(proc);\n  }, sec * 1000);\n});\ndefine_libfunc(\"clear-timer!\", 1, 1, function (ar) {\n  var timer_id = ar[0];\n  clearInterval(timer_id);\n  return undef;\n});\ndefine_libfunc(\"sleep\", 1, 1, function (ar) {\n  var sec = ar[0];\n  assert_real(sec);\n  return new Pause(function (pause) {\n    setTimeout(function () {\n      pause.resume(nil);\n    }, sec * 1000);\n  });\n});\n\n//\n// console\n//\n// (console-debug obj1 ...)\n// (console-log obj1 ...)\n// (console-info obj1 ...)\n// (console-warn obj1 ...)\n// (console-error obj1 ...)\n//   Put objects to console, if window.console is defined.\n//   Returns obj1.\n//\n// Example:\n//     (some-func arg1 (console-debug arg2) arg3)\nvar define_console_func = function (name) {\n  define_libfunc(\"console-\" + name, 1, null, function (ar) {\n    var con = window.console;\n    if (con) {\n      var vals = ar.map(function (item) {\n        return inspect(item, { fallback: item });\n      });\n\n      con[name].apply(con, vals);\n    }\n    return ar[0];\n  });\n};\ndefine_console_func(\"debug\");\ndefine_console_func(\"log\");\ndefine_console_func(\"info\");\ndefine_console_func(\"warn\");\ndefine_console_func(\"error\");\n\n///\n/// R6RS Base library\n///\n\n//\n//        11.4  Expressions\n//\n//            11.4.1  Quotation\n//(quote)\n//            11.4.2  Procedures\n//(lambda)\n//            11.4.3  Conditionaar\n//(if)\n//            11.4.4  Assignments\n//(set!)\n//            11.4.5  Derived conditionaar\n\ndefine_syntax(\"cond\", function (x) {\n  var clauses = x.cdr;\n  if (!(clauses instanceof Pair) || clauses === nil) {\n    throw new BiwaError(\n      \"malformed cond: cond needs list but got \" + write_shared(clauses)\n    );\n  }\n  // TODO: assert that clauses is a proper list\n\n  var ret = null;\n  clauses\n    .to_array()\n    .reverse()\n    .forEach(function (clause) {\n      if (!(clause instanceof Pair)) {\n        throw new BiwaError(\"bad clause in cond: \" + write_shared(clause));\n      }\n\n      if (clause.car === Sym(\"else\")) {\n        if (ret !== null) {\n          throw new BiwaError(\n            \"'else' clause of cond followed by more clauses: \" +\n              write_shared(clauses)\n          );\n        } else if (clause.cdr === nil) {\n          // pattern A: (else)\n          //  -> #f            ; not specified in R6RS...?\n          ret = false;\n        } else if (clause.cdr.cdr === nil) {\n          // pattern B: (else expr)\n          //  -> expr\n          ret = clause.cdr.car;\n        } else {\n          // pattern C: (else expr ...)\n          //  -> (begin expr ...)\n          ret = new Pair(Sym(\"begin\"), clause.cdr);\n        }\n      } else {\n        var test = clause.car;\n        if (clause.cdr === nil) {\n          // pattern 1: (test)\n          //  -> (or test ret)\n          ret = List(Sym(\"or\"), test, ret);\n        } else if (clause.cdr.cdr === nil) {\n          // pattern 2: (test expr)\n          //  -> (if test expr ret)\n          ret = List(Sym(\"if\"), test, clause.cdr.car, ret);\n        } else if (clause.cdr.car === Sym(\"=>\")) {\n          // pattern 3: (test => expr)\n          //  -> (let ((#<gensym1> test))\n          //       (if test (expr #<gensym1>) ret))\n          var test = clause.car,\n            expr = clause.cdr.cdr.car;\n          var tmp_sym = gensym();\n\n          ret = List(\n            Sym(\"let\"),\n            List(List(tmp_sym, test)),\n            List(Sym(\"if\"), test, List(expr, tmp_sym), ret)\n          );\n        } else {\n          // pattern 4: (test expr ...)\n          //  -> (if test (begin expr ...) ret)\n          ret = List(Sym(\"if\"), test, new Pair(Sym(\"begin\"), clause.cdr), ret);\n        }\n      }\n    });\n  return ret;\n});\n\ndefine_syntax(\"case\", function (x) {\n  var tmp_sym = gensym();\n\n  if (x.cdr === nil) {\n    throw new BiwaError(\"case: at least one clause is required\");\n  } else if (!(x.cdr instanceof Pair)) {\n    throw new BiwaError(\"case: proper list is required\");\n  } else {\n    // (case key clauses ....)\n    //  -> (let ((#<gensym1> key))\n    var key = x.cdr.car;\n    var clauses = x.cdr.cdr;\n\n    var ret = undefined;\n    clauses\n      .to_array()\n      .reverse()\n      .forEach(function (clause) {\n        if (clause.car === Sym(\"else\")) {\n          // pattern 0: (else expr ...)\n          //  -> (begin expr ...)\n          if (ret === undefined) {\n            ret = new Pair(Sym(\"begin\"), clause.cdr);\n          } else {\n            throw new BiwaError(\n              \"case: 'else' clause followed by more clauses: \" +\n                write_shared(clauses)\n            );\n          }\n        } else {\n          // pattern 1: ((datum ...) expr ...)\n          //  -> (if (or (eqv? key (quote d1)) ...) (begin expr ...) ret)\n          ret = List(\n            Sym(\"if\"),\n            new Pair(\n              Sym(\"or\"),\n              array_to_list(\n                clause.car.to_array().map(function (d) {\n                  return List(Sym(\"eqv?\"), tmp_sym, List(Sym(\"quote\"), d));\n                })\n              )\n            ),\n            new Pair(Sym(\"begin\"), clause.cdr),\n            ret\n          );\n        }\n      });\n    return new Pair(\n      Sym(\"let1\"),\n      new Pair(tmp_sym, new Pair(key, new Pair(ret, nil)))\n    );\n  }\n});\n\ndefine_syntax(\"and\", function (x) {\n  // (and a b c) => (if a (if b c #f) #f)\n  //todo: check improper list\n  if (x.cdr == nil) return true;\n\n  var objs = x.cdr.to_array();\n  var i = objs.length - 1;\n  var t = objs[i];\n  for (i = i - 1; i >= 0; i--) t = List(Sym(\"if\"), objs[i], t, false);\n\n  return t;\n});\n\ndefine_syntax(\"or\", function (x) {\n  // (or a b c) => (if a a (if b b (if c c #f)))\n  //todo: check improper list\n\n  var objs = x.cdr.to_array();\n  var f = false;\n  for (var i = objs.length - 1; i >= 0; i--)\n    f = List(Sym(\"if\"), objs[i], objs[i], f);\n\n  return f;\n});\n\n//            11.4.6  Binding constructs\ndefine_syntax(\"let\", function (x) {\n  //(let ((a 1) (b 2)) (print a) (+ a b))\n  //=> ((lambda (a b) (print a) (+ a b)) 1 2)\n  var name = null;\n  if (x.cdr.car instanceof BiwaSymbol) {\n    name = x.cdr.car;\n    x = x.cdr;\n  }\n  var binds = x.cdr.car,\n    body = x.cdr.cdr;\n\n  if (!(binds instanceof Pair) && binds != nil) {\n    throw new BiwaError(\n      \"let: need a pair for bindings: got \" + to_write(binds)\n    );\n  }\n\n  var vars = nil,\n    vals = nil;\n  for (var p = binds; p instanceof Pair; p = p.cdr) {\n    if (!(p.car instanceof Pair)) {\n      throw new BiwaError(\n        \"let: need a pair for bindings: got \" + to_write(p.car)\n      );\n    }\n    vars = new Pair(p.car.car, vars);\n    vals = new Pair(p.car.cdr.car, vals);\n  }\n\n  var lambda = null;\n  if (name) {\n    // (let loop ((a 1) (b 2)) body ..)\n    //=> (letrec ((loop (lambda (a b) body ..))) (loop 1 2))\n    vars = array_to_list(vars.to_array().reverse());\n    vals = array_to_list(vals.to_array().reverse());\n\n    var body_lambda = new Pair(Sym(\"lambda\"), new Pair(vars, body));\n    var init_call = new Pair(name, vals);\n\n    lambda = List(\n      Sym(\"letrec\"),\n      new Pair(List(name, body_lambda), nil),\n      init_call\n    );\n  } else {\n    lambda = new Pair(new Pair(Sym(\"lambda\"), new Pair(vars, body)), vals);\n  }\n  return lambda;\n});\n\ndefine_syntax(\"let*\", function (x) {\n  //(let* ((a 1) (b a)) (print a) (+ a b))\n  //-> (let ((a 1))\n  //     (let ((b a)) (print a) (+ a b)))\n  var binds = x.cdr.car,\n    body = x.cdr.cdr;\n\n  if (binds === nil) return new Pair(Sym(\"let\"), new Pair(nil, body));\n\n  if (!(binds instanceof Pair))\n    throw new BiwaError(\n      \"let*: need a pair for bindings: got \" + to_write(binds)\n    );\n\n  var ret = null;\n  binds\n    .to_array()\n    .reverse()\n    .forEach(function (bind) {\n      ret = new Pair(\n        Sym(\"let\"),\n        new Pair(new Pair(bind, nil), ret == null ? body : new Pair(ret, nil))\n      );\n    });\n  return ret;\n});\n\nvar expand_letrec_star = function (x) {\n  var binds = x.cdr.car,\n    body = x.cdr.cdr;\n\n  if (!(binds instanceof Pair))\n    throw new BiwaError(\n      \"letrec*: need a pair for bindings: got \" + to_write(binds)\n    );\n\n  var ret = body;\n  binds\n    .to_array()\n    .reverse()\n    .forEach(function (bind) {\n      ret = new Pair(new Pair(Sym(\"set!\"), bind), ret);\n    });\n  var letbody = nil;\n  binds\n    .to_array()\n    .reverse()\n    .forEach(function (bind) {\n      letbody = new Pair(new Pair(bind.car, new Pair(undef, nil)), letbody);\n    });\n  return new Pair(Sym(\"let\"), new Pair(letbody, ret));\n};\ndefine_syntax(\"letrec\", expand_letrec_star);\ndefine_syntax(\"letrec*\", expand_letrec_star);\n\ndefine_syntax(\"let-values\", function (x) {\n  // (let-values (((a b) (values 1 2))\n  //               ((c d . e) (values 3 4 a)))\n  //              (print a b c d e))\n  // =>\n  // (let ((#<gensym1> (lambda () (values 1 2)))\n  //       (#<gensym2> (lambda () (values 3 4 a))))\n  //   (let*-values (((a b) #<gensym1>)\n  //                 ((c d . e) #<gensym2>))\n  //                 (print a b c d e)))\n  var mv_bindings = x.cdr.car;\n  var body = x.cdr.cdr;\n  var ret = null;\n\n  var let_bindings = nil;\n  var let_star_values_bindings = nil;\n  mv_bindings\n    .to_array()\n    .reverse()\n    .forEach(function (item) {\n      var init = item.cdr.car;\n      var tmpsym = gensym();\n      var binding = new Pair(\n        tmpsym,\n        new Pair(\n          new Pair(Sym(\"lambda\"), new Pair(nil, new Pair(init, nil))),\n          nil\n        )\n      );\n      let_bindings = new Pair(binding, let_bindings);\n\n      var formals = item.car;\n      let_star_values_bindings = new Pair(\n        new Pair(formals, new Pair(new Pair(tmpsym, nil), nil)),\n        let_star_values_bindings\n      );\n    });\n\n  var let_star_values = new Pair(\n    Sym(\"let*-values\"),\n    new Pair(let_star_values_bindings, body)\n  );\n  ret = new Pair(\n    Sym(\"let\"),\n    new Pair(let_bindings, new Pair(let_star_values, nil))\n  );\n  return ret;\n});\n\n//let*-values\ndefine_syntax(\"let*-values\", function (x) {\n  // (let*-values (((a b) (values 1 2))\n  //               ((c d . e) (values 3 4 a)))\n  //   (print a b c d e))\n  // -> (call-with-values\n  //      (lambda () (values 1 2))\n  //      (lambda (a b)\n  //        (call-with-values\n  //          (lambda () (values 3 4 a))\n  //          (lambda (c d . e)\n  //            (print a b c d e)))))\n  var mv_bindings = x.cdr.car;\n  var body = x.cdr.cdr;\n\n  var ret = null;\n\n  mv_bindings\n    .to_array()\n    .reverse()\n    .forEach(function (item) {\n      var formals = item.car,\n        init = item.cdr.car;\n      ret = new Pair(\n        Sym(\"call-with-values\"),\n        new Pair(\n          new Pair(Sym(\"lambda\"), new Pair(nil, new Pair(init, nil))),\n          new Pair(\n            new Pair(\n              Sym(\"lambda\"),\n              new Pair(formals, ret == null ? body : new Pair(ret, nil))\n            ),\n            nil\n          )\n        )\n      );\n    });\n  return ret;\n});\n//            11.4.7  Sequencing\n//(begin)\n\n//\n//        11.5  Equivalence predicates\n//\ndefine_libfunc(\"eqv?\", 2, 2, function (ar) {\n  return eqv(ar[0], ar[1]);\n});\ndefine_libfunc(\"eq?\", 2, 2, function (ar) {\n  return eq(ar[0], ar[1]);\n});\ndefine_libfunc(\"equal?\", 2, 2, function (ar) {\n  return equal(ar[0], ar[1]);\n});\n\n//\n//        11.6  Procedure predicate\n//\n//\"procedure?\", 1, 1\ndefine_libfunc(\"procedure?\", 1, 1, function (ar) {\n  return isProcedure(ar[0]);\n});\n\n//\n//        11.7  Arithmetic\n//\n\n//            11.7.1  Propagation of exactness and inexactness\n//            11.7.2  Representability of infinities and NaNs\n//            11.7.3  Semantics of common operations\n//                11.7.3.1  Integer division\n//                11.7.3.2  Transcendental functions\n//(no functions are introduced by above sections)\n\n//\n//            11.7.4  Numerical operations\n//\n\n//                11.7.4.1  Numerical type predicates\ndefine_libfunc(\"number?\", 1, 1, function (ar) {\n  return isNumber(ar[0]);\n});\ndefine_libfunc(\"complex?\", 1, 1, function (ar) {\n  return isComplex(ar[0]);\n});\ndefine_libfunc(\"real?\", 1, 1, function (ar) {\n  return isReal(ar[0]);\n});\ndefine_libfunc(\"rational?\", 1, 1, function (ar) {\n  return isRational(ar[0]);\n});\ndefine_libfunc(\"integer?\", 1, 1, function (ar) {\n  return isInteger(ar[0]);\n});\n\n//(real-valued? obj)    procedure\n//(rational-valued? obj)    procedure\n//(integer-valued? obj)    procedure\n//\ndefine_libfunc(\"exact?\", 1, 1, function (ar) {\n  return false;\n});\ndefine_libfunc(\"inexact?\", 1, 1, function (ar) {\n  return isNumber(ar[0]);\n});\n\n//                11.7.4.2  Generic conversions\n//\n//(inexact z)    procedure\n//(exact z)    procedure\n//\n//                11.7.4.3  Arithmetic operations\n\n//inf & nan: ok (for this section)\ndefine_libfunc(\"=\", 2, null, function (ar) {\n  var v = ar[0];\n  assert_number(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_number(ar[i]);\n    if (real_part(ar[i]) != real_part(v)) return false;\n    if (imag_part(ar[i]) != imag_part(v)) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"<\", 2, null, function (ar) {\n  assert_number(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_number(ar[i]);\n    if (!(ar[i - 1] < ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\">\", 2, null, function (ar) {\n  assert_number(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_number(ar[i]);\n    if (!(ar[i - 1] > ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"<=\", 2, null, function (ar) {\n  assert_number(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_number(ar[i]);\n    if (!(ar[i - 1] <= ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\">=\", 2, null, function (ar) {\n  assert_number(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_number(ar[i]);\n    if (!(ar[i - 1] >= ar[i])) return false;\n  }\n  return true;\n});\n\ndefine_libfunc(\"zero?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] === 0;\n});\ndefine_libfunc(\"positive?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] > 0;\n});\ndefine_libfunc(\"negative?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] < 0;\n});\ndefine_libfunc(\"odd?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] % 2 == 1 || ar[0] % 2 == -1;\n});\ndefine_libfunc(\"even?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] % 2 == 0;\n});\ndefine_libfunc(\"finite?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] != Infinity && ar[0] != -Infinity && !isNaN(ar[0]);\n});\ndefine_libfunc(\"infinite?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] == Infinity || ar[0] == -Infinity;\n});\ndefine_libfunc(\"nan?\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return isNaN(ar[0]);\n});\ndefine_libfunc(\"max\", 2, null, function (ar) {\n  for (var i = 0; i < ar.length; i++) assert_number(ar[i]);\n\n  return Math.max.apply(null, ar);\n});\ndefine_libfunc(\"min\", 2, null, function (ar) {\n  for (var i = 0; i < ar.length; i++) assert_number(ar[i]);\n\n  return Math.min.apply(null, ar);\n});\n\nvar complex_or_real = function (real, imag) {\n  if (imag === 0) return real;\n  return new Complex(real, imag);\n};\nvar polar_or_real = function (magnitude, angle) {\n  if (angle === 0) return magnitude;\n  return Complex.from_polar(magnitude, angle);\n};\ndefine_libfunc(\"+\", 0, null, function (ar) {\n  var real = 0;\n  var imag = 0;\n  for (var i = 0; i < ar.length; i++) {\n    assert_number(ar[i]);\n    real += real_part(ar[i]);\n    imag += imag_part(ar[i]);\n  }\n  return complex_or_real(real, imag);\n});\nvar the_magnitude = function (n) {\n  if (n instanceof Complex) return n.magnitude();\n  return n;\n};\nvar the_angle = function (n) {\n  if (n instanceof Complex) return n.angle();\n  return 0;\n};\ndefine_libfunc(\"*\", 0, null, function (ar) {\n  var magnitude = 1;\n  var angle = 0;\n  for (var i = 0; i < ar.length; i++) {\n    assert_number(ar[i]);\n    magnitude *= the_magnitude(ar[i]);\n    angle += the_angle(ar[i]);\n  }\n  return polar_or_real(magnitude, angle);\n});\ndefine_libfunc(\"-\", 1, null, function (ar) {\n  var len = ar.length;\n  assert_number(ar[0]);\n\n  if (len == 1) {\n    if (ar[0] instanceof Complex)\n      return new Complex(-real_part(ar[0]), -imag_part(ar[0]));\n    return -ar[0];\n  } else {\n    var real = real_part(ar[0]);\n    var imag = imag_part(ar[0]);\n    for (var i = 1; i < len; i++) {\n      assert_number(ar[i]);\n      real -= real_part(ar[i]);\n      imag -= imag_part(ar[i]);\n    }\n    return complex_or_real(real, imag);\n  }\n});\n//for r6rs specification, (/ 0 0) or (/ 3 0) raises '&assertion exception'\ndefine_libfunc(\"/\", 1, null, function (ar) {\n  var len = ar.length;\n  assert_number(ar[0]);\n\n  if (len == 1) {\n    if (ar[0] instanceof Complex)\n      return Complex.from_polar(1 / the_magnitude(ar[0]), -the_angle(ar[0]));\n    return 1 / ar[0];\n  } else {\n    var magnitude = the_magnitude(ar[0]);\n    var angle = the_angle(ar[0]);\n    for (var i = 1; i < len; i++) {\n      assert_number(ar[i]);\n      magnitude /= the_magnitude(ar[i]);\n      angle -= the_angle(ar[i]);\n    }\n    return polar_or_real(magnitude, angle);\n  }\n});\n\ndefine_libfunc(\"abs\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.abs(ar[0]);\n});\n\nvar div = function (n, m) {\n  return Math.floor(n / m);\n};\nvar mod = function (n, m) {\n  return n - Math.floor(n / m) * m;\n};\nvar div0 = function (n, m) {\n  return n > 0 ? Math.floor(n / m) : Math.ceil(n / m);\n};\nvar mod0 = function (n, m) {\n  return n > 0 ? n - Math.floor(n / m) * m : n - Math.ceil(n / m) * m;\n};\ndefine_libfunc(\"div-and-mod\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return new Values([div(ar[0], ar[1]), mod(ar[0], ar[1])]);\n});\ndefine_libfunc(\"div\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return div(ar[0], ar[1]);\n});\ndefine_libfunc(\"mod\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return mod(ar[0], ar[1]);\n});\ndefine_libfunc(\"div0-and-mod0\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return new Values([div0(ar[0], ar[1]), mod0(ar[0], ar[1])]);\n});\ndefine_libfunc(\"div0\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return div0(ar[0], ar[1]);\n});\ndefine_libfunc(\"mod0\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return mod0(ar[0], ar[1]);\n});\n\n// R7RS\nalias_libfunc(\"div-and-mod\", \"floor/\");\nalias_libfunc(\"div\", \"floor-quotient\");\nalias_libfunc(\"mod\", \"floor-remainder\");\nvar truncate_q = function (n, m) {\n  return Math.trunc(n / m);\n};\nvar truncate_r = function (n, m) {\n  return n - Math.trunc(n / m) * m;\n};\ndefine_libfunc(\"truncate/\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return new Values([truncate_q(ar[0], ar[1]), truncate_r(ar[0], ar[1])]);\n});\ndefine_libfunc(\"truncate-quotient\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return truncate_q(ar[0], ar[1]);\n});\ndefine_libfunc(\"truncate-remainder\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return truncate_r(ar[0], ar[1]);\n});\nalias_libfunc(\"truncate-quotient\", \"quotient\");\nalias_libfunc(\"truncate-remainder\", \"remainder\");\nalias_libfunc(\"floor-remainder\", \"modulo\");\n\n//(gcd n1 ...)    procedure\n//(lcm n1 ...)    procedure\n\ndefine_libfunc(\"numerator\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  if (ar[0] instanceof Rational) return ar[0].numerator;\n  else throw new Bug(\"todo\");\n});\ndefine_libfunc(\"denominator\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  if (ar[0] instanceof Rational) return ar[0].denominator;\n  else throw new Bug(\"todo\");\n});\ndefine_libfunc(\"floor\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.floor(ar[0]);\n});\ndefine_libfunc(\"ceiling\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.ceil(ar[0]);\n});\ndefine_libfunc(\"truncate\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return ar[0] < 0 ? Math.ceil(ar[0]) : Math.floor(ar[0]);\n});\ndefine_libfunc(\"round\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.round(ar[0]);\n});\n\n//(rationalize x1 x2)    procedure\n\ndefine_libfunc(\"exp\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.exp(ar[0]);\n});\ndefine_libfunc(\"log\", 1, 2, function (ar) {\n  var num = ar[0],\n    base = ar[1];\n  assert_number(num);\n\n  if (base) {\n    // log b num == log e num / log e b\n    assert_number(base);\n    return Math.log(num) / Math.log(base);\n  } else return Math.log(num);\n});\ndefine_libfunc(\"sin\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.sin(ar[0]);\n});\ndefine_libfunc(\"cos\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.cos(ar[0]);\n});\ndefine_libfunc(\"tan\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.tan(ar[0]);\n});\ndefine_libfunc(\"asin\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.asin(ar[0]);\n});\ndefine_libfunc(\"acos\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.acos(ar[0]);\n});\ndefine_libfunc(\"atan\", 1, 2, function (ar) {\n  assert_number(ar[0]);\n  if (ar.length == 2) {\n    assert_number(ar[1]);\n    return Math.atan2(ar[0], ar[1]);\n  } else return Math.atan(ar[0]);\n});\ndefine_libfunc(\"sqrt\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Math.sqrt(ar[0]);\n});\ndefine_libfunc(\"exact-integer-sqrt\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  var sqrt_f = Math.sqrt(ar[0]);\n  var sqrt_i = sqrt_f - (sqrt_f % 1);\n  var rest = ar[0] - sqrt_i * sqrt_i;\n\n  return new Values([sqrt_i, rest]);\n});\ndefine_libfunc(\"expt\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return Math.pow(ar[0], ar[1]);\n});\ndefine_libfunc(\"make-rectangular\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return new Complex(ar[0], ar[1]);\n});\ndefine_libfunc(\"make-polar\", 2, 2, function (ar) {\n  assert_number(ar[0]);\n  assert_number(ar[1]);\n  return Complex.from_polar(ar[0], ar[1]);\n});\nvar real_part = function (n) {\n  return Complex.assure(n).real;\n};\nvar imag_part = function (n) {\n  return Complex.assure(n).imag;\n};\ndefine_libfunc(\"real-part\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return real_part(ar[0]);\n});\ndefine_libfunc(\"imag-part\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Complex.assure(ar[0]).imag;\n});\ndefine_libfunc(\"magnitude\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Complex.assure(ar[0]).magnitude();\n});\ndefine_libfunc(\"angle\", 1, 1, function (ar) {\n  assert_number(ar[0]);\n  return Complex.assure(ar[0]).angle();\n});\n\n//\n//                11.7.4.4  Numerical Input and Output\n//\ndefine_libfunc(\"number->string\", 1, 3, function (ar) {\n  var z = ar[0],\n    radix = ar[1],\n    precision = ar[2];\n  if (precision)\n    throw new Bug(\"number->string: precision is not yet implemented\");\n\n  radix = radix || 10; //TODO: check radix is 2, 8, 10, or 16.\n  return z.toString(radix);\n});\ndefine_libfunc(\"string->number\", 1, 3, function (ar) {\n  var s = ar[0];\n\n  if (s === \"+inf.0\") return Infinity;\n\n  if (s === \"-inf.0\") return -Infinity;\n\n  if (s === \"+nan.0\") return NaN;\n\n  var radix = ar[1];\n\n  var int_res = parse_integer(s, radix === 0 ? 0 : radix || 10);\n\n  if (int_res !== false) return int_res;\n\n  if (radix !== undefined && radix !== 10) return false;\n\n  var fp_res = parse_float(s);\n\n  if (fp_res !== false) return fp_res;\n\n  var frac_res = parse_fraction(s);\n\n  if (frac_res !== false) return frac_res;\n\n  return false;\n});\n\n//\n//        11.8  Booleans\n//\n\ndefine_libfunc(\"not\", 1, 1, function (ar) {\n  return ar[0] === false ? true : false;\n});\ndefine_libfunc(\"boolean?\", 1, 1, function (ar) {\n  return ar[0] === false || ar[0] === true ? true : false;\n});\ndefine_libfunc(\"boolean=?\", 2, null, function (ar) {\n  var len = ar.length;\n  for (var i = 1; i < len; i++) {\n    if (ar[i] != ar[0]) return false;\n  }\n  return true;\n});\n\n//        11.9  Pairs and lists\n\ndefine_libfunc(\"pair?\", 1, 1, function (ar) {\n  return ar[0] instanceof Pair ? true : false;\n});\ndefine_libfunc(\"cons\", 2, 2, function (ar) {\n  return new Pair(ar[0], ar[1]);\n});\ndefine_libfunc(\"car\", 1, 1, function (ar) {\n  //should raise &assertion for '()...\n  if (!(ar[0] instanceof Pair))\n    throw new BiwaError(\"Attempt to apply car on \" + ar[0]);\n  return ar[0].car;\n});\ndefine_libfunc(\"cdr\", 1, 1, function (ar) {\n  //should raise &assertion for '()...\n  if (!(ar[0] instanceof Pair))\n    throw new BiwaError(\"Attempt to apply cdr on \" + ar[0]);\n  return ar[0].cdr;\n});\ndefine_libfunc(\"set-car!\", 2, 2, function (ar) {\n  if (!(ar[0] instanceof Pair))\n    throw new BiwaError(\"Attempt to apply set-car! on \" + ar[0]);\n  ar[0].car = ar[1];\n  return undef;\n});\ndefine_libfunc(\"set-cdr!\", 2, 2, function (ar) {\n  if (!(ar[0] instanceof Pair))\n    throw new BiwaError(\"Attempt to apply set-cdr! on \" + ar[0]);\n  ar[0].cdr = ar[1];\n  return undef;\n});\n\n// cadr, caddr, cadddr, etc.\n(function () {\n  // To traverse into pair and raise error\n  var get = function (funcname, spec, obj) {\n    var ret = obj;\n    spec.forEach(function (is_cdr) {\n      if (ret instanceof Pair) {\n        ret = is_cdr ? ret.cdr : ret.car;\n      } else {\n        throw new BiwaError(\n          funcname +\n            \": attempt to get \" +\n            (is_cdr ? \"cdr\" : \"car\") +\n            \" of \" +\n            ret\n        );\n      }\n    });\n    return ret;\n  };\n  define_libfunc(\"caar\", 1, 1, function (ar) {\n    return get(\"caar\", [0, 0], ar[0]);\n  });\n  define_libfunc(\"cadr\", 1, 1, function (ar) {\n    return get(\"cadr\", [1, 0], ar[0]);\n  });\n  define_libfunc(\"cdar\", 1, 1, function (ar) {\n    return get(\"cadr\", [0, 1], ar[0]);\n  });\n  define_libfunc(\"cddr\", 1, 1, function (ar) {\n    return get(\"cadr\", [1, 1], ar[0]);\n  });\n\n  define_libfunc(\"caaar\", 1, 1, function (ar) {\n    return get(\"caaar\", [0, 0, 0], ar[0]);\n  });\n  define_libfunc(\"caadr\", 1, 1, function (ar) {\n    return get(\"caadr\", [1, 0, 0], ar[0]);\n  });\n  define_libfunc(\"cadar\", 1, 1, function (ar) {\n    return get(\"cadar\", [0, 1, 0], ar[0]);\n  });\n  define_libfunc(\"caddr\", 1, 1, function (ar) {\n    return get(\"caddr\", [1, 1, 0], ar[0]);\n  });\n  define_libfunc(\"cdaar\", 1, 1, function (ar) {\n    return get(\"cdaar\", [0, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cdadr\", 1, 1, function (ar) {\n    return get(\"cdadr\", [1, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cddar\", 1, 1, function (ar) {\n    return get(\"cddar\", [0, 1, 1], ar[0]);\n  });\n  define_libfunc(\"cdddr\", 1, 1, function (ar) {\n    return get(\"cdddr\", [1, 1, 1], ar[0]);\n  });\n\n  define_libfunc(\"caaaar\", 1, 1, function (ar) {\n    return get(\"caaaar\", [0, 0, 0, 0], ar[0]);\n  });\n  define_libfunc(\"caaadr\", 1, 1, function (ar) {\n    return get(\"caaadr\", [1, 0, 0, 0], ar[0]);\n  });\n  define_libfunc(\"caadar\", 1, 1, function (ar) {\n    return get(\"caadar\", [0, 1, 0, 0], ar[0]);\n  });\n  define_libfunc(\"caaddr\", 1, 1, function (ar) {\n    return get(\"caaddr\", [1, 1, 0, 0], ar[0]);\n  });\n  define_libfunc(\"cadaar\", 1, 1, function (ar) {\n    return get(\"cadaar\", [0, 0, 1, 0], ar[0]);\n  });\n  define_libfunc(\"cadadr\", 1, 1, function (ar) {\n    return get(\"cadadr\", [1, 0, 1, 0], ar[0]);\n  });\n  define_libfunc(\"caddar\", 1, 1, function (ar) {\n    return get(\"caddar\", [0, 1, 1, 0], ar[0]);\n  });\n  define_libfunc(\"cadddr\", 1, 1, function (ar) {\n    return get(\"cadddr\", [1, 1, 1, 0], ar[0]);\n  });\n  define_libfunc(\"cdaaar\", 1, 1, function (ar) {\n    return get(\"cdaaar\", [0, 0, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cdaadr\", 1, 1, function (ar) {\n    return get(\"cdaadr\", [1, 0, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cdadar\", 1, 1, function (ar) {\n    return get(\"cdadar\", [0, 1, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cdaddr\", 1, 1, function (ar) {\n    return get(\"cdaddr\", [1, 1, 0, 1], ar[0]);\n  });\n  define_libfunc(\"cddaar\", 1, 1, function (ar) {\n    return get(\"cddaar\", [0, 0, 1, 1], ar[0]);\n  });\n  define_libfunc(\"cddadr\", 1, 1, function (ar) {\n    return get(\"cddadr\", [1, 0, 1, 1], ar[0]);\n  });\n  define_libfunc(\"cdddar\", 1, 1, function (ar) {\n    return get(\"cdddar\", [0, 1, 1, 1], ar[0]);\n  });\n  define_libfunc(\"cddddr\", 1, 1, function (ar) {\n    return get(\"cddddr\", [1, 1, 1, 1], ar[0]);\n  });\n})();\n\ndefine_libfunc(\"null?\", 1, 1, function (ar) {\n  return ar[0] === nil;\n});\ndefine_libfunc(\"list?\", 1, 1, function (ar) {\n  return isList(ar[0]);\n});\ndefine_libfunc(\"list\", 0, null, function (ar) {\n  var l = nil;\n  for (var i = ar.length - 1; i >= 0; i--) l = new Pair(ar[i], l);\n  return l;\n});\ndefine_libfunc(\"length\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  var n = 0;\n  for (var o = ar[0]; o != nil; o = o.cdr) n++;\n  return n;\n});\ndefine_libfunc(\"append\", 1, null, function (ar) {\n  var k = ar.length;\n  var ret = ar[--k];\n  while (k--) {\n    ar[k]\n      .to_array()\n      .reverse()\n      .forEach(function (item) {\n        ret = new Pair(item, ret);\n      });\n  }\n  return ret;\n});\ndefine_libfunc(\"reverse\", 1, 1, function (ar) {\n  // (reverse '()) => '()\n  if (ar[0] == nil) return nil;\n  assert_pair(ar[0]);\n\n  var l = nil;\n  for (var o = ar[0]; o != nil; o = o.cdr) l = new Pair(o.car, l);\n  return l;\n});\ndefine_libfunc(\"list-tail\", 2, 2, function (ar) {\n  assert_pair(ar[0]);\n  assert_integer(ar[1]);\n  if (ar[1] < 0)\n    throw new BiwaError(\"list-tail: index out of range (\" + ar[1] + \")\");\n\n  var o = ar[0];\n  for (var i = 0; i < ar[1]; i++) {\n    if (!(o instanceof Pair))\n      throw new BiwaError(\"list-tail: the list is shorter than \" + ar[1]);\n    o = o.cdr;\n  }\n  return o;\n});\ndefine_libfunc(\"list-ref\", 2, 2, function (ar) {\n  assert_pair(ar[0]);\n  assert_integer(ar[1]);\n  if (ar[1] < 0)\n    throw new BiwaError(\"list-tail: index out of range (\" + ar[1] + \")\");\n\n  var o = ar[0];\n  for (var i = 0; i < ar[1]; i++) {\n    if (!(o instanceof Pair))\n      throw new BiwaError(\"list-ref: the list is shorter than \" + ar[1]);\n    o = o.cdr;\n  }\n  return o.car;\n});\ndefine_libfunc(\"map\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    lists = ar;\n  lists.forEach(assert_list);\n\n  var a = [];\n  return Call.multi_foreach(lists, {\n    // Called for each element\n    // input: the element (or the elements, if more than one list is given)\n    // output: a Call request of proc and args\n    call: function (xs) {\n      return new Call(\n        proc,\n        xs.map(function (x) {\n          return x.car;\n        })\n      );\n    },\n\n    // Called when each Call request is finished\n    // input: the result of Call request,\n    //   the element(s) of the Call request (which is not used here)\n    // output: `undefined' to continue,\n    //   some value to terminate (the value will be the result)\n    result: function (res) {\n      a.push(res);\n    },\n\n    // Called when reached to the end of the list(s)\n    // input: none\n    // output: the resultant value\n    finish: function () {\n      return array_to_list(a);\n    },\n  });\n});\ndefine_libfunc(\"for-each\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    lists = ar;\n  lists.forEach(assert_list);\n\n  return Call.multi_foreach(lists, {\n    call: function (xs) {\n      return new Call(\n        proc,\n        xs.map(function (x) {\n          return x.car;\n        })\n      );\n    },\n    finish: function () {\n      return undef;\n    },\n  });\n});\n\n//        11.10  Symbols\n\ndefine_libfunc(\"symbol?\", 1, 1, function (ar) {\n  return ar[0] instanceof BiwaSymbol ? true : false;\n});\ndefine_libfunc(\"symbol->string\", 1, 1, function (ar) {\n  assert_symbol(ar[0]);\n  return ar[0].name;\n});\ndefine_libfunc(\"symbol=?\", 2, null, function (ar) {\n  assert_symbol(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_symbol(ar[i]);\n    if (ar[i] != ar[0]) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"string->symbol\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return Sym(ar[0]);\n});\n\n//\n//        11.11  Characters\n//\ndefine_libfunc(\"char?\", 1, 1, function (ar) {\n  return ar[0] instanceof Char;\n});\ndefine_libfunc(\"char->integer\", 1, 1, function (ar) {\n  assert_char(ar[0]);\n  return ar[0].value.charCodeAt(0);\n});\ndefine_libfunc(\"integer->char\", 1, 1, function (ar) {\n  assert_integer(ar[0]);\n  return Char.get(String.fromCharCode(ar[0]));\n});\n\nvar make_char_compare_func = function (test) {\n  return function (ar) {\n    assert_char(ar[0]);\n    for (var i = 1; i < ar.length; i++) {\n      assert_char(ar[i]);\n      if (!test(ar[i - 1].value, ar[i].value)) return false;\n    }\n    return true;\n  };\n};\ndefine_libfunc(\n  \"char=?\",\n  2,\n  null,\n  make_char_compare_func(function (a, b) {\n    return a == b;\n  })\n);\ndefine_libfunc(\n  \"char<?\",\n  2,\n  null,\n  make_char_compare_func(function (a, b) {\n    return a < b;\n  })\n);\ndefine_libfunc(\n  \"char>?\",\n  2,\n  null,\n  make_char_compare_func(function (a, b) {\n    return a > b;\n  })\n);\ndefine_libfunc(\n  \"char<=?\",\n  2,\n  null,\n  make_char_compare_func(function (a, b) {\n    return a <= b;\n  })\n);\ndefine_libfunc(\n  \"char>=?\",\n  2,\n  null,\n  make_char_compare_func(function (a, b) {\n    return a >= b;\n  })\n);\n\n//\n//        11.12  Strings\n//\ndefine_libfunc(\"string?\", 1, 1, function (ar) {\n  return typeof ar[0] == \"string\";\n});\ndefine_libfunc(\"make-string\", 1, 2, function (ar) {\n  assert_integer(ar[0]);\n  var c = \" \";\n  if (ar[1]) {\n    assert_char(ar[1]);\n    c = ar[1].value;\n  }\n  var out = \"\";\n  Array(ar[0])\n    .fill()\n    .map(() => {\n      out += c;\n    });\n  return out;\n});\ndefine_libfunc(\"string\", 0, null, function (ar) {\n  if (ar.length == 0) return \"\";\n  for (var i = 0; i < ar.length; i++) assert_char(ar[i]);\n  return ar\n    .map(function (c) {\n      return c.value;\n    })\n    .join(\"\");\n});\ndefine_libfunc(\"string-length\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return ar[0].length;\n});\ndefine_libfunc(\"string-ref\", 2, 2, function (ar) {\n  assert_string(ar[0]);\n  assert_between(ar[1], 0, ar[0].length - 1);\n  return Char.get(ar[0].charAt([ar[1]]));\n});\ndefine_libfunc(\"string=?\", 2, null, function (ar) {\n  assert_string(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_string(ar[i]);\n    if (ar[0] != ar[i]) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"string<?\", 2, null, function (ar) {\n  assert_string(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_string(ar[i]);\n    if (!(ar[i - 1] < ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"string>?\", 2, null, function (ar) {\n  assert_string(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_string(ar[i]);\n    if (!(ar[i - 1] > ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"string<=?\", 2, null, function (ar) {\n  assert_string(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_string(ar[i]);\n    if (!(ar[i - 1] <= ar[i])) return false;\n  }\n  return true;\n});\ndefine_libfunc(\"string>=?\", 2, null, function (ar) {\n  assert_string(ar[0]);\n  for (var i = 1; i < ar.length; i++) {\n    assert_string(ar[i]);\n    if (!(ar[i - 1] >= ar[i])) return false;\n  }\n  return true;\n});\n\ndefine_libfunc(\"substring\", 3, 3, function (ar) {\n  assert_string(ar[0]);\n  assert_integer(ar[1]);\n  assert_integer(ar[2]);\n\n  if (ar[1] < 0) throw new BiwaError(\"substring: start too small: \" + ar[1]);\n  if (ar[2] < 0) throw new BiwaError(\"substring: end too small: \" + ar[2]);\n  if (ar[0].length + 1 <= ar[1])\n    throw new BiwaError(\"substring: start too big: \" + ar[1]);\n  if (ar[0].length + 1 <= ar[2])\n    throw new BiwaError(\"substring: end too big: \" + ar[2]);\n  if (!(ar[1] <= ar[2]))\n    throw new BiwaError(\"substring: not start <= end: \" + ar[1] + \", \" + ar[2]);\n\n  return ar[0].substring(ar[1], ar[2]);\n});\n\ndefine_libfunc(\"string-append\", 0, null, function (ar) {\n  for (var i = 0; i < ar.length; i++) assert_string(ar[i]);\n\n  return ar.join(\"\");\n});\ndefine_libfunc(\"string->list\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return array_to_list(\n    ar[0].split(\"\").map(function (s) {\n      return Char.get(s[0]);\n    })\n  );\n});\ndefine_libfunc(\"list->string\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  return ar[0]\n    .to_array()\n    .map(function (c) {\n      return c.value;\n    })\n    .join(\"\");\n});\ndefine_libfunc(\"string-for-each\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    strs = ar;\n  strs.forEach(assert_string);\n\n  return Call.multi_foreach(strs, {\n    call: function (chars) {\n      return new Call(proc, chars);\n    },\n    finish: function () {\n      return undef;\n    },\n  });\n});\ndefine_libfunc(\"string-copy\", 1, 1, function (ar) {\n  // note: this is useless, because javascript strings are immutable\n  assert_string(ar[0]);\n  return ar[0];\n});\n\n//\n//        11.13  Vectors\n//\ndefine_libfunc(\"vector?\", 1, 1, function (ar) {\n  return isVector(ar[0]);\n});\ndefine_libfunc(\"make-vector\", 1, 2, function (ar) {\n  assert_integer(ar[0]);\n  var vec = new Array(ar[0]);\n\n  if (ar.length == 2) {\n    for (var i = 0; i < ar[0]; i++) vec[i] = ar[1];\n  }\n  return vec;\n});\ndefine_libfunc(\"vector\", 0, null, function (ar) {\n  return ar;\n});\ndefine_libfunc(\"vector-length\", 1, 1, function (ar) {\n  assert_vector(ar[0]);\n  return ar[0].length;\n});\ndefine_libfunc(\"vector-ref\", 2, 2, function (ar) {\n  assert_vector(ar[0]);\n  assert_integer(ar[1]);\n  assert_between(ar[1], 0, ar[0].length - 1);\n\n  return ar[0][ar[1]];\n});\ndefine_libfunc(\"vector-set!\", 3, 3, function (ar) {\n  assert_vector(ar[0]);\n  assert_integer(ar[1]);\n\n  ar[0][ar[1]] = ar[2];\n  return undef;\n});\ndefine_libfunc(\"vector->list\", 1, 1, function (ar) {\n  assert_vector(ar[0]);\n  return array_to_list(ar[0]);\n});\ndefine_libfunc(\"list->vector\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  return ar[0].to_array();\n});\ndefine_libfunc(\"vector-fill!\", 2, 2, function (ar) {\n  assert_vector(ar[0]);\n  var vec = ar[0],\n    obj = ar[1];\n\n  for (var i = 0; i < vec.length; i++) vec[i] = obj;\n  return vec;\n});\ndefine_libfunc(\"vector-map\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    vecs = ar;\n  vecs.forEach(assert_vector);\n\n  var a = [];\n  return Call.multi_foreach(vecs, {\n    call: function (objs) {\n      return new Call(proc, objs);\n    },\n    result: function (res) {\n      a.push(res);\n    },\n    finish: function () {\n      return a;\n    },\n  });\n});\ndefine_libfunc(\"vector-for-each\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    vecs = ar;\n  vecs.forEach(assert_vector);\n\n  return Call.multi_foreach(vecs, {\n    call: function (objs) {\n      return new Call(proc, objs);\n    },\n    finish: function () {\n      return undef;\n    },\n  });\n});\n\n//\n//        11.14  Errors and violations\n//\n//(error who message irritant1 ...)    procedure\n//(assertion-violation who message irritant1 ...)    procedure\n//(assert <expression>)    syntax\n\n//\n//        11.15  Control features\n//\ndefine_libfunc(\"apply\", 2, null, function (ar) {\n  var proc = ar.shift(),\n    rest_args = ar.pop(),\n    args = ar;\n  args = args.concat(rest_args.to_array());\n\n  return new Call(proc, args);\n});\ndefine_syntax(\"call-with-current-continuation\", function (x) {\n  return new Pair(Sym(\"call/cc\"), x.cdr);\n});\ndefine_libfunc(\"values\", 0, null, function (ar) {\n  if (ar.length == 1)\n    // eg. (values 3)\n    return ar[0];\n  else return new Values(ar);\n});\ndefine_libfunc(\"call-with-values\", 2, 2, function (ar) {\n  var producer = ar[0],\n    consumer = ar[1];\n  assert_procedure(producer);\n  assert_procedure(consumer);\n  return new Call(producer, [], function (ar) {\n    var result = ar[0];\n    if (result instanceof Values) {\n      return new Call(consumer, result.content);\n    } else {\n      // eg. (call-with-values (lambda () 3)\n      //                       (lambda (x) x))\n      return new Call(consumer, [result]);\n    }\n  });\n});\n\ndefine_libfunc(\"dynamic-wind\", 3, 3, function (ar, intp) {\n  var before = ar[0],\n    thunk = ar[1],\n    after = ar[2];\n  return new Call(before, [], function () {\n    intp.push_dynamic_winder(before, after);\n    return new Call(thunk, [], function (ar2) {\n      var result = ar2[0];\n      intp.pop_dynamic_winder();\n      return new Call(after, [], function () {\n        return result;\n      });\n    });\n  });\n});\n\n//        11.16  Iteration\n//named let\n\n//        11.17  Quasiquotation\n// `() is expanded to `cons` and `append`.\n// `#() is expanded to `vector` and `vector-append`.\nconst expandQuasiquote = function (x, depth) {\n  if (x instanceof Pair) {\n    if (x.car === Sym(\"quasiquote\")) {\n      return List(\n        Sym(\"cons\"),\n        List(Sym(\"quote\"), Sym(\"quasiquote\")),\n        expandQuasiquote(x.cdr, depth + 1)\n      );\n    } else if (x.car === Sym(\"unquote\") || x.car === Sym(\"unquote-splicing\")) {\n      if (depth > 0) {\n        return List(\n          Sym(\"cons\"),\n          List(Sym(\"quote\"), x.car),\n          expandQuasiquote(x.cdr, depth - 1)\n        );\n      } else if (\n        x.car === Sym(\"unquote\") &&\n        x.cdr instanceof Pair && // Check if it has only one argument\n        x.cdr.cdr === nil\n      ) {\n        return x.cdr.car;\n      } else {\n        throw new BiwaError(\"invalid use of quasiquote\");\n      }\n    } else if (x.cdr === nil) {\n      return expandQqList(x.car, depth);\n    } else {\n      // Use `append` because there may be a `,@` in the list\n      return List(\n        Sym(\"append\"),\n        expandQqList(x.car, depth),\n        expandQuasiquote(x.cdr, depth)\n      );\n    }\n  } else if (x instanceof Array) {\n    const l = array_to_list(x);\n    return List(\n      Sym(\"list->vector\"),\n      List(\n        Sym(\"append\"),\n        expandQqList(l.car, depth),\n        expandQuasiquote(l.cdr, depth)\n      )\n    );\n  } else {\n    return List(Sym(\"quote\"), x);\n  }\n};\n\n// Auxiliary function for expandQuasiquote\n// Expands an item in a list context\nconst expandQqList = function (x, depth) {\n  if (x instanceof Pair) {\n    if (x.car === Sym(\"quasiquote\")) {\n      return List(\n        Sym(\"list\"),\n        List(\n          Sym(\"cons\"),\n          List(Sym(\"quasiquote\"), x.car),\n          expandQuasiquote(x.cdr, depth + 1)\n        )\n      );\n    } else if (x.car === Sym(\"unquote\") || x.car === Sym(\"unquote-splicing\")) {\n      if (depth > 0) {\n        return List(\n          Sym(\"list\"),\n          List(\n            Sym(\"cons\"),\n            List(Sym(\"quote\"), x.car),\n            expandQuasiquote(x.cdr, depth - 1)\n          )\n        );\n      } else if (x.car === Sym(\"unquote\")) {\n        return Cons(Sym(\"list\"), x.cdr);\n      } else {\n        // i.e. x.car === Sym(\"unquote-splicing\")\n        return Cons(Sym(\"append\"), x.cdr);\n      }\n    } else {\n      return List(\n        Sym(\"list\"),\n        List(\n          Sym(\"append\"),\n          expandQqList(x.car, depth),\n          expandQuasiquote(x.cdr, depth)\n        )\n      );\n    }\n  } else if (x instanceof Array) {\n    const l = array_to_list(x);\n    return List(\n      Sym(\"list\"),\n      List(\n        Sym(\"list->vector\"),\n        List(\n          Sym(\"append\"),\n          expandQqList(l.car, depth),\n          expandQuasiquote(l.cdr, depth)\n        )\n      )\n    );\n  } else {\n    return List(Sym(\"quote\"), List(x));\n  }\n};\n\ndefine_syntax(\"quasiquote\", function (x) {\n  return expandQuasiquote(x.cdr.car, 0);\n});\ndefine_syntax(\"unquote\", function (x) {\n  throw new BiwaError(\"unquote(,) must be inside quasiquote(`)\");\n});\ndefine_syntax(\"unquote-splicing\", function (x) {\n  throw new BiwaError(\"unquote-splicing(,@) must be inside quasiquote(`)\");\n});\n\n//        11.18  Binding constructs for syntactic keywords\n//let-syntax\n//letrec-syntax\n\n//        11.19  Macro transformers\n//syntax-rules\n//identifier-syntax\n//\n\n//        11.20  Tail calls and tail contexts\n//(no library function introduced)\n\n///\n/// R6RS Standard Libraries\n///\n\n//\n// Chapter 1 Unicode\n//\n//(char-upcase char)    procedure\n//(char-downcase char)    procedure\n//(char-titlecase char)    procedure\n//(char-foldcase char)    procedure\n//\n//(char-ci=? char1 char2 char3 ...)    procedure\n//(char-ci<? char1 char2 char3 ...)    procedure\n//(char-ci>? char1 char2 char3 ...)    procedure\n//(char-ci<=? char1 char2 char3 ...)    procedure\n//(char-ci>=? char1 char2 char3 ...)    procedure\n//\n//(char-alphabetic? char)    procedure\n//(char-numeric? char)    procedure\n//(char-whitespace? char)    procedure\n//(char-upper-case? char)    procedure\n//(char-lower-case? char)    procedure\n//(char-title-case? char)    procedure\n//\n//(char-general-category char)    procedure\n\n//(string-upcase string)    procedure\ndefine_libfunc(\"string-upcase\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return ar[0].toUpperCase();\n});\n//(string-downcase string)    procedure\ndefine_libfunc(\"string-downcase\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return ar[0].toLowerCase();\n});\n//(string-titlecase string)    procedure\n//(string-foldcase string)    procedure\n\nconst make_string_ci_function = function (compare) {\n  return function (ar) {\n    assert_string(ar[0]);\n    var str = ar[0].toUpperCase();\n\n    for (var i = 1; i < ar.length; i++) {\n      assert_string(ar[i]);\n      if (!compare(str, ar[i].toUpperCase())) return false;\n    }\n    return true;\n  };\n};\n//(string-ci=? string1 string2 string3 ...)    procedure\ndefine_libfunc(\n  \"string-ci=?\",\n  2,\n  null,\n  make_string_ci_function(function (a, b) {\n    return a == b;\n  })\n);\n//(string-ci<? string1 string2 string3 ...)    procedure\ndefine_libfunc(\n  \"string-ci<?\",\n  2,\n  null,\n  make_string_ci_function(function (a, b) {\n    return a < b;\n  })\n);\n//(string-ci>? string1 string2 string3 ...)    procedure\ndefine_libfunc(\n  \"string-ci>?\",\n  2,\n  null,\n  make_string_ci_function(function (a, b) {\n    return a > b;\n  })\n);\n//(string-ci<=? string1 string2 string3 ...)    procedure\ndefine_libfunc(\n  \"string-ci<=?\",\n  2,\n  null,\n  make_string_ci_function(function (a, b) {\n    return a <= b;\n  })\n);\n//(string-ci>=? string1 string2 string3 ...)    procedure\ndefine_libfunc(\n  \"string-ci>=?\",\n  2,\n  null,\n  make_string_ci_function(function (a, b) {\n    return a >= b;\n  })\n);\n\n//(string-normalize-nfd string)    procedure\n//(string-normalize-nfkd string)    procedure\n//(string-normalize-nfc string)    procedure\n//(string-normalize-nfkc string)    procedure\n\n//\n// Chapter 2 Bytevectors\n//\n\n//\n// Chapter 3 List utilities\n//\ndefine_libfunc(\"find\", 2, 2, function (ar) {\n  var proc = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n  return Call.foreach(ls, {\n    call: function (x) {\n      return new Call(proc, [x.car]);\n    },\n    result: function (res, x) {\n      if (res) return x.car;\n    },\n    finish: function () {\n      return false;\n    },\n  });\n});\ndefine_libfunc(\"for-all\", 2, null, function (ar) {\n  var proc = ar.shift();\n  var lists = ar;\n  lists.forEach(assert_list);\n\n  var last = true; //holds last result which proc returns\n  return Call.multi_foreach(lists, {\n    call: function (pairs) {\n      return new Call(\n        proc,\n        pairs.map(function (x) {\n          return x.car;\n        })\n      );\n    },\n    result: function (res, pairs) {\n      if (res === false) return false;\n      last = res;\n    },\n    finish: function () {\n      return last;\n    },\n  });\n});\ndefine_libfunc(\"exists\", 2, null, function (ar) {\n  var proc = ar.shift();\n  var lists = ar;\n  lists.forEach(assert_list);\n\n  return Call.multi_foreach(lists, {\n    call: function (pairs) {\n      return new Call(\n        proc,\n        pairs.map(function (x) {\n          return x.car;\n        })\n      );\n    },\n    result: function (res, pairs) {\n      if (res !== false) return res;\n    },\n    finish: function () {\n      return false;\n    },\n  });\n});\ndefine_libfunc(\"filter\", 2, 2, function (ar) {\n  var proc = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n\n  var a = [];\n  return Call.foreach(ls, {\n    call: function (x) {\n      return new Call(proc, [x.car]);\n    },\n    result: function (res, x) {\n      if (res) a.push(x.car);\n    },\n    finish: function () {\n      return array_to_list(a);\n    },\n  });\n});\n//  define_scmfunc(\"partition+\", 2, 2,\n//    \"(lambda (proc ls)  \\\n//       (define (partition2 proc ls t f) \\\n//         (if (null? ls) \\\n//           (values (reverse t) (reverse f)) \\\n//           (if (proc (car ls)) \\\n//             (partition2 proc (cdr ls) (cons (car ls) t) f) \\\n//             (partition2 proc (cdr ls) t (cons (car ls) f))))) \\\n//       (partition2 proc ls '() '()))\");\n\ndefine_libfunc(\"partition\", 2, 2, function (ar) {\n  var proc = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n\n  var t = [],\n    f = [];\n  return Call.foreach(ls, {\n    call: function (x) {\n      return new Call(proc, [x.car]);\n    },\n    result: function (res, x) {\n      if (res) t.push(x.car);\n      else f.push(x.car);\n    },\n    finish: function () {\n      return new Values([array_to_list(t), array_to_list(f)]);\n    },\n  });\n});\ndefine_libfunc(\"fold-left\", 3, null, function (ar) {\n  var proc = ar.shift(),\n    accum = ar.shift(),\n    lists = ar;\n  lists.forEach(assert_list);\n\n  return Call.multi_foreach(lists, {\n    call: function (pairs) {\n      var args = pairs.map(function (x) {\n        return x.car;\n      });\n      args.unshift(accum);\n      return new Call(proc, args);\n    },\n    result: function (res, pairs) {\n      accum = res;\n    },\n    finish: function () {\n      return accum;\n    },\n  });\n});\ndefine_libfunc(\"fold-right\", 3, null, function (ar) {\n  var proc = ar.shift(),\n    accum = ar.shift();\n  var lists = ar.map(function (ls) {\n    // reverse each list\n    assert_list(ls);\n    return array_to_list(ls.to_array().reverse());\n  });\n\n  return Call.multi_foreach(lists, {\n    call: function (pairs) {\n      var args = pairs.map(function (x) {\n        return x.car;\n      });\n      args.push(accum);\n      return new Call(proc, args);\n    },\n    result: function (res, pairs) {\n      accum = res;\n    },\n    finish: function () {\n      return accum;\n    },\n  });\n});\ndefine_libfunc(\"remp\", 2, 2, function (ar) {\n  var proc = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n\n  var ret = [];\n  return Call.foreach(ls, {\n    call: function (x) {\n      return new Call(proc, [x.car]);\n    },\n    result: function (res, x) {\n      if (!res) ret.push(x.car);\n    },\n    finish: function () {\n      return array_to_list(ret);\n    },\n  });\n});\nvar make_remover = function (key) {\n  return function (ar) {\n    var obj = ar[0],\n      ls = ar[1];\n    assert_list(ls);\n\n    var ret = [];\n    return Call.foreach(ls, {\n      call: function (x) {\n        return new Call(TopEnv[key] || CoreEnv[key], [obj, x.car]);\n      },\n      result: function (res, x) {\n        if (!res) ret.push(x.car);\n      },\n      finish: function () {\n        return array_to_list(ret);\n      },\n    });\n  };\n};\ndefine_libfunc(\"remove\", 2, 2, make_remover(\"equal?\"));\ndefine_libfunc(\"remv\", 2, 2, make_remover(\"eqv?\"));\ndefine_libfunc(\"remq\", 2, 2, make_remover(\"eq?\"));\n\ndefine_libfunc(\"memp\", 2, 2, function (ar) {\n  var proc = ar[0],\n    ls = ar[1];\n  assert_list(ls);\n  return Call.foreach(ls, {\n    call: function (x) {\n      return new Call(proc, [x.car]);\n    },\n    result: function (res, x) {\n      if (res) return x;\n    },\n    finish: function () {\n      return false;\n    },\n  });\n});\nvar make_finder = function (key) {\n  return function (ar) {\n    var obj = ar[0],\n      ls = ar[1];\n    assert_list(ls);\n    return Call.foreach(ls, {\n      call: function (x) {\n        return new Call(TopEnv[key] || CoreEnv[key], [obj, x.car]);\n      },\n      result: function (res, x) {\n        if (res) return x;\n      },\n      finish: function () {\n        return false;\n      },\n    });\n  };\n};\ndefine_libfunc(\"member\", 2, 2, make_finder(\"equal?\"));\ndefine_libfunc(\"memv\", 2, 2, make_finder(\"eqv?\"));\ndefine_libfunc(\"memq\", 2, 2, make_finder(\"eq?\"));\n\ndefine_libfunc(\"assp\", 2, 2, function (ar) {\n  var proc = ar[0],\n    als = ar[1];\n  assert_list(als);\n  return Call.foreach(als, {\n    call: function (x) {\n      if (x.car.car) return new Call(proc, [x.car.car]);\n      else\n        throw new BiwaError(\"ass*: pair required but got \" + to_write(x.car));\n    },\n    result: function (res, x) {\n      if (res) return x.car;\n    },\n    finish: function () {\n      return false;\n    },\n  });\n});\nvar make_assoc = function (func_name, eq_func_name) {\n  return function (ar) {\n    var obj = ar[0],\n      list = ar[1];\n    assert_list(list);\n    return Call.foreach(list, {\n      call: function (ls) {\n        if (!isPair(ls.car))\n          throw new BiwaError(\n            func_name + \": pair required but got \" + to_write(ls.car)\n          );\n\n        var equality = TopEnv[eq_func_name] || CoreEnv[eq_func_name];\n        return new Call(equality, [obj, ls.car.car]);\n      },\n      result: function (was_equal, ls) {\n        if (was_equal) return ls.car;\n      },\n      finish: function () {\n        return false;\n      },\n    });\n  };\n};\ndefine_libfunc(\"assoc\", 2, 2, make_assoc(\"assoc\", \"equal?\"));\ndefine_libfunc(\"assv\", 2, 2, make_assoc(\"assv\", \"eqv?\"));\ndefine_libfunc(\"assq\", 2, 2, make_assoc(\"assq\", \"eq?\"));\n\ndefine_libfunc(\"cons*\", 1, null, function (ar) {\n  if (ar.length == 1) return ar[0];\n  else {\n    var ret = null;\n    ar.reverse().forEach(function (x) {\n      if (ret) {\n        ret = new Pair(x, ret);\n      } else ret = x;\n    });\n    return ret;\n  }\n});\n\n//\n// Chapter 4 Sorting\n//\n(function () {\n  // Destructively sort the given array\n  // with scheme function `proc` as comparator\n  var mergeSort = function (ary, proc, finish) {\n    if (ary.length <= 1) return finish(ary);\n    return mergeSort_(ary, proc, finish, [[0, ary.length, false]], false);\n  };\n\n  var mergeSort_ = function (ary, proc, finish, stack, up) {\n    while (true) {\n      var start = stack[stack.length - 1][0],\n        end = stack[stack.length - 1][1],\n        left = stack[stack.length - 1][2];\n      var len = end - start;\n      //console.debug(\"mergeSort_\", ary, stack.join(' '), up?\"u\":\"d\", \"\"+start+\"..\"+(end-1))\n\n      if (len >= 2 && !up) {\n        // There are parts to be sorted\n        stack.push([start, start + (len >> 1), true]);\n        continue;\n      } else if (left) {\n        // Left part sorted. Continue to the right one\n        stack.pop();\n        var rend = stack[stack.length - 1][1];\n        stack.push([end, rend, false]);\n        up = false;\n        continue;\n      } else {\n        // Right part sorted. Merge left and right\n        stack.pop();\n        var lstart = stack[stack.length - 1][0];\n        var ary1 = ary.slice(lstart, start),\n          ary2 = ary.slice(start, end);\n        return merge_(ary1, ary2, proc, [], 0, 0, function (ret) {\n          //console.debug(\"mergeSortd\", ary, stack.join(' '), up?\"u\":\"d\", ary1, ary2, ret, \"\"+start+\"..\"+(start+len-1));\n          for (var i = 0; i < ret.length; i++) {\n            ary[lstart + i] = ret[i];\n          }\n\n          if (stack.length == 1) {\n            return finish(ary);\n          } else {\n            return mergeSort_(ary, proc, finish, stack, true);\n          }\n        });\n      }\n    }\n  };\n\n  var merge_ = function (ary1, ary2, proc, ret, i, j, cont) {\n    //console.debug(\"merge_\", ary1, ary2, ret, i, j);\n    var len1 = ary1.length,\n      len2 = ary2.length;\n    if (i < len1 && j < len2) {\n      return new Call(proc, [ary2[j], ary1[i]], function (ar) {\n        //console.debug(\"comp\", [ary2[j], ary1[i]], ar[0]);\n        if (ar[0]) {\n          ret.push(ary2[j]);\n          j += 1;\n        } else {\n          ret.push(ary1[i]);\n          i += 1;\n        }\n        return merge_(ary1, ary2, proc, ret, i, j, cont);\n      });\n    } else {\n      while (i < len1) {\n        ret.push(ary1[i]);\n        i += 1;\n      }\n      while (j < len2) {\n        ret.push(ary2[j]);\n        j += 1;\n      }\n      return cont(ret);\n    }\n  };\n\n  var compareFn = function (a, b) {\n    return lt(a, b) ? -1 : lt(b, a) ? 1 : 0;\n  };\n\n  define_libfunc(\"list-sort\", 1, 2, function (ar) {\n    if (ar[1]) {\n      assert_procedure(ar[0]);\n      assert_list(ar[1]);\n      return mergeSort(ar[1].to_array(), ar[0], function (ret) {\n        return array_to_list(ret);\n      });\n    } else {\n      assert_list(ar[0]);\n      return array_to_list(ar[0].to_array().sort(compareFn));\n    }\n  });\n\n  //(vector-sort proc vector)    procedure\n  define_libfunc(\"vector-sort\", 1, 2, function (ar) {\n    if (ar[1]) {\n      assert_procedure(ar[0]);\n      assert_vector(ar[1]);\n      return mergeSort([...ar[1]], ar[0], function (ret) {\n        return ret;\n      });\n    } else {\n      assert_vector(ar[0]);\n      return [...ar[0]].sort(compareFn);\n    }\n  });\n\n  //(vector-sort! proc vector)    procedure\n  define_libfunc(\"vector-sort!\", 1, 2, function (ar) {\n    if (ar[1]) {\n      assert_procedure(ar[0]);\n      assert_vector(ar[1]);\n      return mergeSort(ar[1], ar[0], function (ret) {\n        return undef;\n      });\n    } else {\n      assert_vector(ar[0]);\n      ar[0].sort(compareFn);\n      return undef;\n    }\n  });\n})();\n\n//\n// Chapter 5 Control Structures\n//\ndefine_syntax(\"when\", function (x) {\n  //(when test body ...)\n  //=> (if test (begin body ...) #<undef>)\n  var test = x.cdr.car,\n    body = x.cdr.cdr;\n\n  return new Pair(\n    Sym(\"if\"),\n    new Pair(test, new Pair(new Pair(Sym(\"begin\"), body), new Pair(undef, nil)))\n  );\n});\n\ndefine_syntax(\"unless\", function (x) {\n  //(unless test body ...)\n  //=> (if (not test) (begin body ...) #<undef>)\n  var test = x.cdr.car,\n    body = x.cdr.cdr;\n\n  return new Pair(\n    Sym(\"if\"),\n    new Pair(\n      new Pair(Sym(\"not\"), new Pair(test, nil)),\n      new Pair(new Pair(Sym(\"begin\"), body), new Pair(undef, nil))\n    )\n  );\n});\n\ndefine_syntax(\"do\", function (x) {\n  //(do ((var1 init1 step1)\n  //     (var2 init2 step2) ...)\n  //    (test expr1 expr2 ...)\n  //  body1 body2 ...)\n  //=> (let loop` ((var1 init1) (var2 init2) ...)\n  //     (if test\n  //       (begin expr1 expr2 ...)\n  //       (begin body1 body2 ...\n  //              (loop` step1 step2 ...)))))\n\n  // parse arguments\n  if (!isPair(x.cdr)) throw new BiwaError(\"do: no variables of do\");\n  var varsc = x.cdr.car;\n  if (!isPair(varsc))\n    throw new BiwaError(\"do: variables must be given as a list\");\n  if (!isPair(x.cdr.cdr)) throw new BiwaError(\"do: no resulting form of do\");\n  var resultc = x.cdr.cdr.car;\n  var bodyc = x.cdr.cdr.cdr;\n\n  // construct subforms\n  var loop = gensym();\n\n  var init_vars = array_to_list(\n    varsc.map(function (var_def) {\n      var a = var_def.to_array();\n      return List(a[0], a[1]);\n    })\n  );\n\n  var test = resultc.car;\n  var result_exprs = new Pair(Sym(\"begin\"), resultc.cdr);\n\n  var next_loop = new Pair(\n    loop,\n    array_to_list(\n      varsc.map(function (var_def) {\n        var a = var_def.to_array();\n        return a[2] || a[0];\n      })\n    )\n  );\n  var body_exprs = new Pair(Sym(\"begin\"), bodyc).concat(List(next_loop));\n\n  // combine subforms\n  return List(\n    Sym(\"let\"),\n    loop,\n    init_vars,\n    List(Sym(\"if\"), test, result_exprs, body_exprs)\n  );\n});\n\n//(case-lambda <case-lambda clause> ...)    syntax\ndefine_syntax(\"case-lambda\", function (x) {\n  if (!isPair(x.cdr))\n    throw new BiwaError(\"case-lambda: at least 1 clause required\");\n  var clauses = x.cdr.to_array();\n\n  var args_ = gensym();\n  var exec = List(Sym(\"raise\"), \"case-lambda: no matching clause found\");\n\n  clauses.reverse().forEach(function (clause) {\n    if (!isPair(clause))\n      throw new BiwaError(\n        \"case-lambda: clause must be a pair: \" + to_write(clause)\n      );\n    var formals = clause.car,\n      clause_body = clause.cdr;\n\n    if (formals === nil) {\n      exec = List(\n        Sym(\"if\"),\n        List(Sym(\"null?\"), args_),\n        new Pair(Sym(\"begin\"), clause_body),\n        exec\n      );\n    } else if (isPair(formals)) {\n      var len = formals.length(),\n        last_cdr = formals.last_cdr();\n      var pred = last_cdr === nil ? Sym(\"=\") : Sym(\">=\");\n      var lambda = new Pair(Sym(\"lambda\"), new Pair(formals, clause_body));\n      exec = List(\n        Sym(\"if\"),\n        List(pred, List(Sym(\"length\"), args_), len),\n        List(Sym(\"apply\"), lambda, args_),\n        exec\n      );\n    } else if (isSymbol(formals)) {\n      exec = new Pair(\n        Sym(\"let1\"),\n        new Pair(formals, new Pair(args_, clause_body))\n      );\n      // Note: previous `exec` is just discarded because this is a wildcard pattern.\n    } else {\n      throw new BiwaError(\"case-lambda: invalid formals: \" + to_write(formals));\n    }\n  });\n\n  return List(Sym(\"lambda\"), args_, exec);\n});\n\n//\n// Chapter 6 Records\n// see also: src/system/record.js\n//\n\n// 6.2 Records: Syntactic layer\n//eqv, eq\n\n//(define-record-type <name spec> <record clause>*)    syntax\ndefine_syntax(\"define-record-type\", function (x) {\n  // (define-record-type <name spec> <record clause>*)\n  var name_spec = x.cdr.car;\n  var record_clauses = x.cdr.cdr;\n\n  // 1. parse name spec\n  // <name spec>: either\n  // - <record name> eg: point\n  // - (<record name> <constructor name> <predicate name>)\n  //   eg: (point make-point point?)\n  if (isSymbol(name_spec)) {\n    var record_name = name_spec;\n    var constructor_name = Sym(\"make-\" + name_spec.name);\n    var predicate_name = Sym(name_spec.name + \"?\");\n  } else {\n    assert_list(name_spec);\n    var record_name = name_spec.car;\n    var constructor_name = name_spec.cdr.car;\n    var predicate_name = name_spec.cdr.cdr.car;\n    assert_symbol(record_name);\n    assert_symbol(constructor_name);\n    assert_symbol(predicate_name);\n  }\n\n  // 2. parse record clauses\n  var sealed = false;\n  var opaque = false;\n  var uid = false;\n  var parent_name;\n  var parent_rtd = false;\n  var parent_cd = false;\n  var protocol = false;\n  var fields = [];\n\n  // <record clause>:\n  record_clauses.to_array().forEach(function (clause) {\n    switch (clause.car) {\n      // - (fields <field spec>*)\n      case Sym(\"fields\"):\n        fields = clause.cdr.to_array().map(function (field_spec, idx) {\n          if (isSymbol(field_spec)) {\n            // - <field name>\n            return {\n              name: field_spec,\n              idx: idx,\n              mutable: false,\n              accessor_name: null,\n              mutator_name: null,\n            };\n          } else {\n            assert_list(field_spec);\n            assert_symbol(field_spec.car);\n            switch (field_spec.car) {\n              case Sym(\"immutable\"):\n                // - (immutable <field name>)\n                // - (immutable <field name> <accessor name>)\n                var field_name = field_spec.cdr.car;\n                assert_symbol(field_name);\n\n                if (isNil(field_spec.cdr.cdr))\n                  return { name: field_name, idx: idx, mutable: false };\n                else\n                  return {\n                    name: field_name,\n                    idx: idx,\n                    mutable: false,\n                    accessor_name: field_spec.cdr.cdr.car,\n                  };\n\n              case Sym(\"mutable\"):\n                // - (mutable <field name>)\n                // - (mutable <field name> <accessor name> <mutator name>)\n                var field_name = field_spec.cdr.car;\n                assert_symbol(field_name);\n\n                if (isNil(field_spec.cdr.cdr))\n                  return { name: field_name, idx: idx, mutable: true };\n                else\n                  return {\n                    name: field_name,\n                    idx: idx,\n                    mutable: true,\n                    accessor_name: field_spec.cdr.cdr.car,\n                    mutator_name: field_spec.cdr.cdr.cdr.car,\n                  };\n              default:\n                throw new BiwaError(\n                  \"define-record-type: field definition \" +\n                    \"must start with `immutable' or `mutable' \" +\n                    \"but got \" +\n                    inspect(field_spec.car)\n                );\n            }\n          }\n        });\n        break;\n      // - (parent <name>)\n      case Sym(\"parent\"):\n        parent_name = clause.cdr.car;\n        assert_symbol(parent_name);\n        break;\n      // - (protocol <expr>)\n      case Sym(\"protocol\"):\n        protocol = clause.cdr.car;\n        break;\n      // - (sealed <bool>)\n      case Sym(\"sealed\"):\n        sealed = !!clause.cdr.car;\n        break;\n      // - (opaque <bool>)\n      case Sym(\"opaque\"):\n        opaque = !!clause.cdr.car;\n        break;\n      // - (nongenerative <uid>?)\n      case Sym(\"nongenerative\"):\n        uid = clause.cdr.car;\n        break;\n      // - (parent-rtd <rtd> <cd>)\n      case Sym(\"parent-rtd\"):\n        parent_rtd = clause.cdr.car;\n        parent_cd = clause.cdr.cdr.car;\n        break;\n      default:\n        throw new BiwaError(\n          \"define-record-type: unknown clause `\" + to_write(clause.car) + \"'\"\n        );\n    }\n  });\n\n  if (parent_name) {\n    parent_rtd = [Sym(\"record-type-descriptor\"), parent_name];\n    parent_cd = [Sym(\"record-constructor-descriptor\"), parent_name];\n  }\n\n  // 3. build the definitions\n  // Note: In this implementation, rtd and cd are not bound to symbols.\n  // They are referenced through record name by record-type-descriptor\n  // and record-constructor-descriptor. These relation are stored in\n  // the hash BiwaScheme.Record._DefinedTypes.\n  var rtd = [Sym(\"record-type-descriptor\"), record_name];\n  var cd = [Sym(\"record-constructor-descriptor\"), record_name];\n\n  // registration\n  var rtd_fields = fields.map(function (field) {\n    return List(Sym(field.mutable ? \"mutable\" : \"immutable\"), field.name);\n  });\n  rtd_fields.is_vector = true; //tell List not to convert\n  var rtd_def = [\n    Sym(\"make-record-type-descriptor\"),\n    [Sym(\"quote\"), record_name],\n    parent_rtd,\n    uid,\n    sealed,\n    opaque,\n    rtd_fields,\n  ];\n  var cd_def = [\n    Sym(\"make-record-constructor-descriptor\"),\n    Sym(\"__rtd\"),\n    parent_cd,\n    protocol,\n  ];\n  var registration = [\n    Sym(\"let*\"),\n    [\n      [Sym(\"__rtd\"), rtd_def],\n      [Sym(\"__cd\"), cd_def],\n    ],\n    [\n      Sym(\"_define-record-type\"),\n      [Sym(\"quote\"), record_name],\n      Sym(\"__rtd\"),\n      Sym(\"__cd\"),\n    ],\n  ];\n\n  // accessors and mutators\n  var accessor_defs = fields.map(function (field) {\n    var name =\n      field.accessor_name || Sym(record_name.name + \"-\" + field.name.name);\n\n    return [Sym(\"define\"), name, [Sym(\"record-accessor\"), rtd, field.idx]];\n  });\n\n  var mutator_defs = fields.filter(function (field) {\n    return field.mutable;\n  });\n  mutator_defs = mutator_defs.map(function (field) {\n    var name =\n      field.mutator_name ||\n      Sym(record_name.name + \"-\" + field.name.name + \"-set!\");\n\n    return [Sym(\"define\"), name, [Sym(\"record-mutator\"), rtd, field.idx]];\n  });\n\n  // Wrap the definitions with `begin'\n  // Example:\n  //   (begin\n  //     (let* ((__rtd (make-record-type-descriptor 'square\n  //                     (record-type-descriptor rect)\n  //                     #f #f #f\n  //                     #((mutable w) (mutable h))))\n  //            (__cd (make-record-constructor-descriptor __rtd\n  //                    (record-constructor-descriptor rect)\n  //                    (lambda (n) ...))))\n  //       (_define-record-type 'square __rtd __cd))\n  //\n  //     (define make-square\n  //       (record-constructor\n  //         (record-constructor-descriptor square)))\n  //     (define square?\n  //       (record-predicate (record-type-descriptor square)))\n  //     (define square-w\n  //       (record-accessor (record-type-descriptor square) 0))\n  //     (define square-h\n  //       (record-accessor (record-type-descriptor square) 1))\n  //     (define set-square-w!\n  //       (record-mutator (record-type-descriptor square) 0))\n  //     (define set-square-h!\n  //       (record-mutator (record-type-descriptor square) 1)))\n  //\n  return deep_array_to_list(\n    [\n      Sym(\"begin\"),\n      registration,\n      [Sym(\"define\"), constructor_name, [Sym(\"record-constructor\"), cd]],\n      [Sym(\"define\"), predicate_name, [Sym(\"record-predicate\"), rtd]],\n    ]\n      .concat(accessor_defs)\n      .concat(mutator_defs)\n  );\n});\n\ndefine_libfunc(\"_define-record-type\", 3, 3, function (ar) {\n  assert_symbol(ar[0]);\n  assert_record_td(ar[1]);\n  assert_record_cd(ar[2]);\n  Record.define_type(ar[0].name, ar[1], ar[2]);\n  return undef;\n});\n\n//(record-type-descriptor <record name>)    syntax\ndefine_syntax(\"record-type-descriptor\", function (x) {\n  return deep_array_to_list([\n    Sym(\"_record-type-descriptor\"),\n    [Sym(\"quote\"), x.cdr.car],\n  ]);\n});\ndefine_libfunc(\"_record-type-descriptor\", 1, 1, function (ar) {\n  assert_symbol(ar[0]);\n  var type = Record.get_type(ar[0].name);\n  if (type) return type.rtd;\n  else\n    throw new BiwaError(\n      \"record-type-descriptor: unknown record type \" + ar[0].name\n    );\n});\n\n//(record-constructor-descriptor <record name>)    syntax\ndefine_syntax(\"record-constructor-descriptor\", function (x) {\n  return deep_array_to_list([\n    Sym(\"_record-constructor-descriptor\"),\n    [Sym(\"quote\"), x.cdr.car],\n  ]);\n});\ndefine_libfunc(\"_record-constructor-descriptor\", 1, 1, function (ar) {\n  assert_symbol(ar[0]);\n  var type = Record.get_type(ar[0].name);\n  if (type) return type.cd;\n  else\n    throw new BiwaError(\n      \"record-constructor-descriptor: unknown record type \" + ar[0].name\n    );\n});\n\n// 6.3  Records: Procedural layer\n//(make-record-type-descriptor name    procedure\ndefine_libfunc(\"make-record-type-descriptor\", 6, 6, function (ar) {\n  var name = ar[0],\n    parent_rtd = ar[1],\n    uid = ar[2],\n    sealed = ar[3],\n    opaque = ar[4],\n    fields = ar[5];\n\n  assert_symbol(name);\n  if (parent_rtd) assert_record_td(parent_rtd);\n  if (uid) {\n    assert_symbol(uid);\n    var _rtd = Record.RTD.NongenerativeRecords[uid.name];\n    if (_rtd) {\n      // the record type is already defined.\n      return _rtd;\n      // should check equality of other arguments..\n    }\n  }\n  sealed = !!sealed;\n  opaque = !!opaque;\n  assert_vector(fields);\n  for (var i = 0; i < fields.length; i++) {\n    var list = fields[i];\n    assert_symbol(list.car, \"mutability\");\n    assert_symbol(list.cdr.car, \"field name\");\n    fields[i] = [list.cdr.car.name, list.car == Sym(\"mutable\")];\n  }\n  var rtd = new Record.RTD(name, parent_rtd, uid, sealed, opaque, fields);\n  if (uid) Record.RTD.NongenerativeRecords[uid.name] = rtd;\n\n  return rtd;\n});\n\n//(record-type-descriptor? obj)    procedure\ndefine_libfunc(\"record-type-descriptor?\", 1, 1, function (ar) {\n  return ar[0] instanceof Record.RTD;\n});\n\n//(make-record-constructor-descriptor rtd    procedure\ndefine_libfunc(\"make-record-constructor-descriptor\", 3, 3, function (ar) {\n  var rtd = ar[0],\n    parent_cd = ar[1],\n    protocol = ar[2];\n\n  assert_record_td(rtd);\n  if (parent_cd) assert_record_cd(parent_cd);\n  if (protocol) assert_procedure(protocol);\n\n  return new Record.CD(rtd, parent_cd, protocol);\n});\n\n//(record-constructor constructor-descriptor)    procedure\ndefine_libfunc(\"record-constructor\", 1, 1, function (ar) {\n  var cd = ar[0];\n  assert_record_cd(cd);\n\n  return cd.record_constructor();\n});\n\n//(record-predicate rtd)    procedure\ndefine_libfunc(\"record-predicate\", 1, 1, function (ar) {\n  var rtd = ar[0];\n  assert_record_td(rtd);\n\n  return function (args) {\n    var obj = args[0];\n\n    if (!(obj instanceof Record)) {\n      return false;\n    } else if (obj.rtd === rtd) {\n      // Fast path\n      return true;\n    } else {\n      for (let _rtd = obj.rtd; _rtd; _rtd = _rtd.parent_rtd) {\n        if (_rtd == rtd) return true;\n      }\n      return false;\n    }\n  };\n});\n\n//(record-accessor rtd k)    procedure\ndefine_libfunc(\"record-accessor\", 2, 2, function (ar) {\n  var rtd = ar[0],\n    k = ar[1];\n  assert_record_td(rtd);\n  assert_integer(k);\n  for (var _rtd = rtd.parent_rtd; _rtd; _rtd = _rtd.parent_rtd)\n    k += _rtd.fields.length;\n\n  return function (args) {\n    var record = args[0];\n    var error_msg =\n      rtd.name.name +\n      \"-\" +\n      rtd.field_name(k) +\n      \": \" +\n      to_write(record) +\n      \" is not a \" +\n      rtd.name.name;\n    assert(isRecord(record), error_msg);\n\n    var descendant = false;\n    for (var _rtd = record.rtd; _rtd; _rtd = _rtd.parent_rtd) {\n      if (_rtd == rtd) descendant = true;\n    }\n    assert(descendant, error_msg);\n\n    return record.get(k);\n  };\n});\n\n//(record-mutator rtd k)    procedure\ndefine_libfunc(\"record-mutator\", 2, 2, function (ar) {\n  var rtd = ar[0],\n    k = ar[1];\n  assert_record_td(rtd);\n  assert_integer(k);\n  for (var _rtd = rtd.parent_rtd; _rtd; _rtd = _rtd.parent_rtd)\n    k += _rtd.fields.length;\n\n  return function (args) {\n    var record = args[0],\n      val = args[1];\n    var func_name = rtd.field_name(k);\n\n    assert_record(record);\n    assert(\n      record.rtd === rtd,\n      func_name + \": \" + to_write(record) + \" is not a \" + rtd.name.name\n    );\n    assert(\n      !record.rtd.sealed,\n      func_name + \": \" + rtd.name.name + \" is sealed (can't mutate)\"\n    );\n\n    record.set(k, val);\n  };\n});\n\n// 6.4  Records: Inspection\n//(record? obj)    procedure\ndefine_libfunc(\"record?\", 1, 1, function (ar) {\n  var obj = ar[0];\n  if (isRecord(obj)) {\n    if (obj.rtd.opaque) return false;\n    // opaque records pretend as if it is not a record.\n    else return true;\n  } else return false;\n});\n\n//(record-rtd record)    procedure\ndefine_libfunc(\"record-rtd\", 1, 1, function (ar) {\n  assert_record(ar[0]);\n  return ar[0].rtd;\n});\n\n//(record-type-name rtd)    procedure\ndefine_libfunc(\"record-type-name\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].name;\n});\n\n//(record-type-parent rtd)    procedure\ndefine_libfunc(\"record-type-parent\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].parent_rtd;\n});\n\n//(record-type-uid rtd)    procedure\ndefine_libfunc(\"record-type-uid\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].uid;\n});\n\n//(record-type-generative? rtd)    procedure\ndefine_libfunc(\"record-type-generative?\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].generative;\n});\n\n//(record-type-sealed? rtd)    procedure\ndefine_libfunc(\"record-type-sealed?\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].sealed;\n});\n\n//(record-type-opaque? rtd)    procedure\ndefine_libfunc(\"record-type-opaque?\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].opaque;\n});\n\n//(record-type-field-names rtd)    procedure\ndefine_libfunc(\"record-type-field-names\", 1, 1, function (ar) {\n  assert_record_td(ar[0]);\n  return ar[0].fields.map(function (field) {\n    return field.name;\n  });\n});\n\n//(record-field-mutable? rtd k)    procedure\ndefine_libfunc(\"record-field-mutable?\", 2, 2, function (ar) {\n  var rtd = ar[0],\n    k = ar[1];\n  assert_record_td(ar[0]);\n  assert_integer(k);\n\n  for (var _rtd = rtd.parent_rtd; _rtd; _rtd = _rtd.parent_rtd)\n    k += _rtd.fields.length;\n\n  return ar[0].fields[k].mutable;\n});\n\n//\n// Chapter 7 Exceptions and conditions\n//\n//(with-exception-handler handler thunk)    procedure\n//(guard (<variable>    syntax\n//(raise obj)    procedure\ndefine_libfunc(\"raise\", 1, 1, function (ar) {\n  throw new UserError(to_write(ar[0]));\n});\n//(raise-continuable obj)    procedure\n//\n//&condition    condition type\n//(condition condition1 ...)    procedure\n//(simple-conditions condition)    procedure\n//(condition? obj)    procedure\n//(condition-predicate rtd)    procedure\n//(condition-accessor rtd proc)    procedure\n//\n//&message    condition type\n//&warning    condition type\n//&serious    condition type\n//&error    condition type\n//&violation    condition type\n//&assertion    condition type\n//&irritants    condition type\n//&who    condition type\n//&non-continuable    condition type\n//&implementation-restriction    condition type\n//&lexical    condition type\n//&syntax    condition type\n//&undefined    condition type\n\n//\n// Chapter 8 I/O\n//\n//  //    8  I/O\n//  //        8.1  Condition types\n//&i/o    condition type\n//&i/o-read    condition type\n//&i/o-write    condition type\n//&i/o-invalid-position    condition type\n//&i/o-filename    condition type\n//&i/o-file-protection    condition type\n//&i/o-file-is-read-only    condition type\n//&i/o-file-already-exists    condition type\n//&i/o-file-does-not-exist    condition type\n//&i/o-port    condition type\n//\n//  //        8.2  Port I/O\n//  //            8.2.1  File names\n//  //(no function introduced)\n//\n//  //            8.2.2  File options\n//(file-options <file-options symbol> ...)    syntax\n//\n//  //            8.2.3  Buffer modes\n//(buffer-mode <buffer-mode symbol>)    syntax\n//(buffer-mode? obj)    procedure\n//\n//  //            8.2.4  Transcoders\n//(latin-1-codec)    procedure\n//(utf-8-codec)    procedure\n//(utf-16-codec)    procedure\n//(eol-style <eol-style symbol>)    syntax\n//(native-eol-style)    procedure\n//&i/o-decoding    condition type\n//&i/o-encoding    condition type\n//(error-handling-mode <error-handling-mode symbol>)    syntax\n//(make-transcoder codec)    procedure\n//(make-transcoder codec eol-style)    procedure\n//(make-transcoder codec eol-style handling-mode)    procedure\n//(native-transcoder)    procedure\n//(transcoder-codec transcoder)    procedure\n//(transcoder-eol-style transcoder)    procedure\n//(transcoder-error-handling-mode transcoder)    procedure\n//(bytevector->string bytevector transcoder)    procedure\n//(string->bytevector string transcoder)    procedure\n//\n//            8.2.5  End-of-file object\n//-> 8.3 (eof-object)    procedure\n//-> 8.3 (eof-object? obj)    procedure\n\n//            8.2.6  Input and output ports\ndefine_libfunc(\"port?\", 1, 1, function (ar) {\n  return ar[0] instanceof Port;\n});\n//(port-transcoder port)    procedure\ndefine_libfunc(\"textual-port?\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  return !ar[0].is_binary;\n});\ndefine_libfunc(\"binary-port?\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  return ar[0].is_binary;\n});\n//(transcoded-port binary-port transcoder)    procedure\n//(port-has-port-position? port)    procedure\n//(port-position port)    procedure\n//(port-has-set-port-position!? port)    procedure\n//(set-port-position! port pos)    procedure\ndefine_libfunc(\"close-port\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  ar[0].close();\n  return undef;\n});\n//(call-with-port port proc)    procedure\ndefine_libfunc(\"call-with-port\", 2, 2, function (ar) {\n  var port = ar[0],\n    proc = ar[1];\n  assert_port(port);\n  assert_closure(proc);\n\n  return new Call(proc, [port], function (ar) {\n    // Automatically close the port\n    port.close();\n    return ar[0]; // TODO: values\n  });\n});\n\n//            8.2.7  Input ports\n//8.3 (input-port? obj)    procedure\n//(port-eof? input-port)    procedure\n//(open-file-input-port filename)    procedure\n//(open-bytevector-input-port bytevector)    procedure\n//(open-string-input-port string)    procedure\n//(standard-input-port)    procedure\n//8.3 (current-input-port)    procedure\n//(make-custom-binary-input-port id read!    procedure\n//(make-custom-textual-input-port id read!    procedure\n//\n//  //            8.2.8  Binary input\n//(get-u8 binary-input-port)    procedure\n//(lookahead-u8 binary-input-port)    procedure\n//(get-bytevector-n binary-input-port count)    procedure\n//(get-bytevector-n! binary-input-port    procedure\n//(get-bytevector-some binary-input-port)    procedure\n//(get-bytevector-all binary-input-port)    procedure\n//\n//  //            8.2.9  Textual input\n//(get-char textual-input-port)    procedure\n//(lookahead-char textual-input-port)    procedure\n//(get-string-n textual-input-port count)    procedure\n//(get-string-n! textual-input-port string start count)    procedure\n//(get-string-all textual-input-port)    procedure\n//(get-line textual-input-port)    procedure\n//(get-datum textual-input-port)    procedure\n//\n//            8.2.10  Output ports\n//8.3 (output-port? obj)    procedure\n//(flush-output-port output-port)    procedure\n//(output-port-buffer-mode output-port)    procedure\n//(open-file-output-port filename)    procedure\n//(open-bytevector-output-port)    procedure\n//(call-with-bytevector-output-port proc)    procedure\n//(open-string-output-port)    procedure\n//(call-with-string-output-port proc)    procedure\ndefine_libfunc(\"call-with-string-output-port\", 1, 1, function (ar) {\n  var proc = ar[0];\n  assert_procedure(proc);\n\n  var port = new Port.StringOutput();\n\n  return new Call(proc, [port], function (ar) {\n    port.close();\n    return port.output_string();\n  });\n});\n\n//(standard-output-port)    procedure\n//(standard-error-port)    procedure\n//8.3 (current-output-port)    procedure\n//8.3 (current-error-port)    procedure\n//(make-custom-binary-output-port id    procedure\n//(make-custom-textual-output-port id write! get-position set-position! close)\n//  define_libfunc(\"make-custom-textual-output-port\", 5, 5, function(ar){\n//    assert_string(ar[0]);\n//    assert_closure(ar[1]);\n//    assert_closure(ar[2]);\n//    assert_closure(ar[3]);\n//    assert_closure(ar[4]);\n//    return new Port(ar[0], ar[1], ar[2], ar[3], ar[4]);\n//  })\n//\n//  //            8.2.11  Binary output\n//(put-u8 binary-output-port octet)    procedure\n//(put-bytevector binary-output-port bytevector)    procedure\n//\n//            8.2.12  Textual output\ndefine_libfunc(\"put-char\", 2, 2, function (ar) {\n  assert_port(ar[0]);\n  assert_char(ar[1]);\n  ar[0].put_string(ar[1].value);\n  return undef;\n});\ndefine_libfunc(\"put-string\", 2, 2, function (ar) {\n  assert_port(ar[0]);\n  assert_string(ar[1]);\n  ar[0].put_string(ar[1]);\n  return undef;\n});\ndefine_libfunc(\"put-datum\", 2, 2, function (ar) {\n  assert_port(ar[0]);\n  ar[0].put_string(to_write(ar[1]));\n  return undef;\n});\n//\n//  //            8.2.13  Input/output ports\n//(open-file-input/output-port filename)    procedure\n//(make-custom-binary-input/output-port    procedure\n//(make-custom-textual-input/output-port    procedure\n//\n//  //        8.3  Simple I/O\ndefine_libfunc(\"eof-object\", 0, 0, function (ar) {\n  return eof;\n});\ndefine_libfunc(\"eof-object?\", 1, 1, function (ar) {\n  return ar[0] === eof;\n});\n//(call-with-input-file filename proc)    procedure\n//(call-with-output-file filename proc)    procedure\ndefine_libfunc(\"input-port?\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  return ar[0].is_input;\n});\ndefine_libfunc(\"output-port?\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  return ar[0].is_output;\n});\ndefine_libfunc(\"current-input-port\", 0, 0, function (ar) {\n  return Port.current_input;\n});\ndefine_libfunc(\"current-output-port\", 0, 0, function (ar) {\n  return Port.current_output;\n});\ndefine_libfunc(\"current-error-port\", 0, 0, function (ar) {\n  return Port.current_error;\n});\n//(with-input-from-file filename thunk)    procedure\n//(with-output-to-file filename thunk)    procedure\n//(open-input-file filename)    procedure\n//(open-output-file filename)    procedure\ndefine_libfunc(\"close-input-port\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  if (!ar[0].is_input)\n    throw new BiwaError(\"close-input-port: port is not input port\");\n  ar[0].close();\n  return undef;\n});\ndefine_libfunc(\"close-output-port\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  if (!ar[0].is_output)\n    throw new BiwaError(\"close-output-port: port is not output port\");\n  ar[0].close();\n  return undef;\n});\n//(read-char)    procedure\n//(peek-char)    procedure\ndefine_libfunc(\"read\", 0, 1, function (ar) {\n  var port = ar[0] || Port.current_input;\n  assert_port(port);\n\n  return port.get_string(function (str) {\n    return Interpreter.read(str);\n  });\n});\n\ndefine_libfunc(\"write-char\", 1, 2, function (ar) {\n  var port = ar[1] || Port.current_output;\n  assert_char(ar[0]);\n  port.put_string(ar[0].value);\n  return undef;\n});\ndefine_libfunc(\"newline\", 0, 1, function (ar) {\n  var port = ar[0] || Port.current_output;\n  port.put_string(\"\\n\");\n  return undef;\n});\ndefine_libfunc(\"display\", 1, 2, function (ar) {\n  var port = ar[1] || Port.current_output;\n  port.put_string(to_display(ar[0]));\n  return undef;\n});\ndefine_libfunc(\"write\", 1, 2, function (ar) {\n  var port = ar[1] || Port.current_output;\n  assert_port(port);\n  port.put_string(to_write(ar[0]));\n  return undef;\n});\ndefine_libfunc(\"write-shared\", 1, 2, function (ar) {\n  var port = ar[1] || Port.current_output;\n  assert_port(port);\n  port.put_string(write_shared(ar[0]));\n  return undef;\n});\ndefine_libfunc(\"write-simple\", 1, 2, function (ar) {\n  var port = ar[1] || Port.current_output;\n  assert_port(port);\n  port.put_string(write_simple(ar[0]));\n  return undef;\n});\n\n//\n// Chapter 9 File System\n// Chapter 10 Command-line access and exit values\n//\n// see src/library/node_functions.js\n\n//\n// Chapter 11 Arithmetic\n//\n////        11.1  Bitwise operations\n////        11.2  Fixnums\n//(fixnum? obj)    procedure\n//(fixnum-width)    procedure\n//(least-fixnum)    procedure\n//(greatest-fixnum)    procedure\n//(fx=? fx1 fx2 fx3 ...)    procedure\n//(fx>? fx1 fx2 fx3 ...)    procedure\n//(fx<? fx1 fx2 fx3 ...)    procedure\n//(fx>=? fx1 fx2 fx3 ...)    procedure\n//(fx<=? fx1 fx2 fx3 ...)    procedure\n//(fxzero? fx)    procedure\n//(fxpositive? fx)    procedure\n//(fxnegative? fx)    procedure\n//(fxodd? fx)    procedure\n//(fxeven? fx)    procedure\n//(fxmax fx1 fx2 ...)    procedure\n//(fxmin fx1 fx2 ...)    procedure\n//(fx+ fx1 fx2)    procedure\n//(fx* fx1 fx2)    procedure\n//(fx- fx1 fx2)    procedure\n//(fxdiv-and-mod fx1 fx2)    procedure\n//(fxdiv fx1 fx2)    procedure\n//(fxmod fx1 fx2)    procedure\n//(fxdiv0-and-mod0 fx1 fx2)    procedure\n//(fxdiv0 fx1 fx2)    procedure\n//(fxmod0 fx1 fx2)    procedure\n//(fx+/carry fx1 fx2 fx3)    procedure\n//(fx-/carry fx1 fx2 fx3)    procedure\n//(fx*/carry fx1 fx2 fx3)    procedure\n//(fxnot fx)    procedure\n//(fxand fx1 ...)    procedure\n//(fxior fx1 ...)    procedure\n//(fxxor fx1 ...)    procedure\n//(fxif fx1 fx2 fx3)    procedure\n//(fxbit-count fx)    procedure\n//(fxlength fx)    procedure\n//(fxfirst-bit-set fx)    procedure\n//(fxbit-set? fx1 fx2)    procedure\n//(fxcopy-bit fx1 fx2 fx3)    procedure\n//(fxbit-field fx1 fx2 fx3)    procedure\n//(fxcopy-bit-field fx1 fx2 fx3 fx4)    procedure\n//(fxarithmetic-shift fx1 fx2)    procedure\n//(fxarithmetic-shift-left fx1 fx2)    procedure\n//(fxarithmetic-shift-right fx1 fx2)    procedure\n//(fxrotate-bit-field fx1 fx2 fx3 fx4)    procedure\n//(fxreverse-bit-field fx1 fx2 fx3)    procedure\n//\n////        11.3  Flonums\n//(flonum? obj)    procedure\n//(real->flonum x)    procedure\n//(fl=? fl1 fl2 fl3 ...)    procedure\n//(fl<? fl1 fl2 fl3 ...)    procedure\n//(fl<=? fl1 fl2 fl3 ...)    procedure\n//(fl>? fl1 fl2 fl3 ...)    procedure\n//(fl>=? fl1 fl2 fl3 ...)    procedure\n//(flinteger? fl)    procedure\n//(flzero? fl)    procedure\n//(flpositive? fl)    procedure\n//(flnegative? fl)    procedure\n//(flodd? ifl)    procedure\n//(fleven? ifl)    procedure\n//(flfinite? fl)    procedure\n//(flinfinite? fl)    procedure\n//(flnan? fl)    procedure\n//(flmax fl1 fl2 ...)    procedure\n//(flmin fl1 fl2 ...)    procedure\n//(fl+ fl1 ...)    procedure\n//(fl* fl1 ...)    procedure\n//(fl- fl1 fl2 ...)    procedure\n//(fl- fl)    procedure\n//(fl/ fl1 fl2 ...)    procedure\n//(fl/ fl)    procedure\n//(flabs fl)    procedure\n//(fldiv-and-mod fl1 fl2)    procedure\n//(fldiv fl1 fl2)    procedure\n//(flmod fl1 fl2)    procedure\n//(fldiv0-and-mod0 fl1 fl2)    procedure\n//(fldiv0 fl1 fl2)    procedure\n//(flmod0 fl1 fl2)    procedure\n//(flnumerator fl)    procedure\n//(fldenominator fl)    procedure\n//(flfloor fl)    procedure\n//(flceiling fl)    procedure\n//(fltruncate fl)    procedure\n//(flround fl)    procedure\n//(flexp fl)    procedure\n//(fllog fl)    procedure\n//(fllog fl1 fl2)    procedure\n//(flsin fl)    procedure\n//(flcos fl)    procedure\n//(fltan fl)    procedure\n//(flasin fl)    procedure\n//(flacos fl)    procedure\n//(flatan fl)    procedure\n//(flatan fl1 fl2)    procedure\n//(flsqrt fl)    procedure\n//(flexpt fl1 fl2)    procedure\n//&no-infinities    condition type\n//&no-nans    condition type\n//(fixnum->flonum fx)    procedure\n\n////        11.4  Exact bitwise arithmetic\n//(bitwise-not ei)    procedure\ndefine_libfunc(\"bitwise-not\", 1, 1, function (ar) {\n  return ~ar[0];\n});\n\n//(bitwise-and ei1 ...)    procedure\ndefine_libfunc(\"bitwise-and\", 1, null, function (ar) {\n  return ar.reduce(function (ret, item) {\n    return ret & item;\n  });\n});\n\n//(bitwise-ior ei1 ...)    procedure\ndefine_libfunc(\"bitwise-ior\", 1, null, function (ar) {\n  return ar.reduce(function (ret, item) {\n    return ret | item;\n  });\n});\n\n//(bitwise-xor ei1 ...)    procedure\ndefine_libfunc(\"bitwise-xor\", 1, null, function (ar) {\n  return ar.reduce(function (ret, item) {\n    return ret ^ item;\n  });\n});\n\n//(bitwise-if ei1 ei2 ei3)    procedure\ndefine_libfunc(\"bitwise-if\", 3, 3, function (ar) {\n  return (ar[0] & ar[1]) | (~ar[0] & ar[2]);\n});\n\n//(bitwise-bit-count ei)    procedure\ndefine_libfunc(\"bitwise-bit-count\", 1, 1, function (ar) {\n  var e = Math.abs(ar[0]),\n    ret = 0;\n  for (; e != 0; e >>= 1) {\n    if (e & 1) ret++;\n  }\n  return ret;\n});\n\n//(bitwise-length ei)    procedure\ndefine_libfunc(\"bitwise-length\", 1, 1, function (ar) {\n  var e = Math.abs(ar[0]),\n    ret = 0;\n  for (; e != 0; e >>= 1) {\n    ret++;\n  }\n  return ret;\n});\n\n//(bitwise-first-bit-set ei)    procedure\ndefine_libfunc(\"bitwise-first-bit-set\", 1, 1, function (ar) {\n  var e = Math.abs(ar[0]),\n    ret = 0;\n  if (e == 0) return -1;\n  for (; e != 0; e >>= 1) {\n    if (e & 1) return ret;\n    ret++;\n  }\n});\n\n//(bitwise-bit-set? ei1 ei2)    procedure\ndefine_libfunc(\"bitwise-bit-set?\", 2, 2, function (ar) {\n  return !!(ar[0] & (1 << ar[1]));\n});\n\n//(bitwise-copy-bit ei1 n b)    procedure\ndefine_libfunc(\"bitwise-copy-bit\", 3, 3, function (ar) {\n  var mask = 1 << ar[1];\n  return (\n    (mask & (ar[2] << ar[1])) | // Set n-th bit to b\n    (~mask & ar[0])\n  ); // and use ei1 for rest of the bits\n});\n\n//(bitwise-bit-field ei1 start end)    procedure\ndefine_libfunc(\"bitwise-bit-field\", 3, 3, function (ar) {\n  var mask = ~(-1 << ar[2]); // Has 1 at 0...end\n  return (mask & ar[0]) >> ar[1];\n});\n\n//(bitwise-copy-bit-field dst start end src)    procedure\ndefine_libfunc(\"bitwise-copy-bit-field\", 4, 4, function (ar) {\n  var dst = ar[0],\n    start = ar[1],\n    end = ar[2],\n    src = ar[3];\n  var mask =\n    ~(-1 << end) & // Has 1 at 0...end\n    (-1 << start); // Clear 0...start\n  return (mask & (src << start)) | (~mask & dst);\n});\n\n//(bitwise-arithmetic-shift ei1 ei2)    procedure\ndefine_libfunc(\"bitwise-arithmetic-shift\", 2, 2, function (ar) {\n  return ar[1] >= 0 ? ar[0] << ar[1] : ar[0] >> -ar[1];\n});\n\n//(bitwise-arithmetic-shift-left ei1 ei2)    procedure\ndefine_libfunc(\"bitwise-arithmetic-shift-left\", 2, 2, function (ar) {\n  return ar[0] << ar[1];\n});\n\n//(bitwise-arithmetic-shift-right ei1 ei2)    procedure\ndefine_libfunc(\"bitwise-arithmetic-shift-right\", 2, 2, function (ar) {\n  return ar[0] >> ar[1];\n});\n\n//(bitwise-rotate-bit-field ei1 start end count)    procedure\ndefine_libfunc(\"bitwise-rotate-bit-field\", 4, 4, function (ar) {\n  var n = ar[0],\n    start = ar[1],\n    end = ar[2],\n    count = ar[3];\n  var width = end - start;\n  if (width <= 0) return n;\n\n  count %= width;\n  var orig_field = (~(-1 << end) & n) >> start;\n  var rotated_field = (orig_field << count) | (orig_field >> (width - count));\n\n  var mask = ~(-1 << end) & (-1 << start);\n  return (mask & (rotated_field << start)) | (~mask & n);\n});\n\n//(bitwise-reverse-bit-field ei1 ei2 ei3)    procedure\ndefine_libfunc(\"bitwise-reverse-bit-field\", 3, 3, function (ar) {\n  var ret = ar[0],\n    n = ar[0],\n    start = ar[1],\n    end = ar[2];\n  var orig_field = (~(-1 << end) & n) >> start;\n  for (var i = 0; i < end - start; i++, orig_field >>= 1) {\n    var bit = orig_field & 1;\n    var setpos = end - 1 - i;\n    var mask = 1 << setpos;\n    ret = (mask & (bit << setpos)) | (~mask & ret);\n  }\n  return ret;\n});\n\n//\n// Chapter 12 syntax-case\n//\n\n//\n// Chapter 13 Hashtables\n//\n\n//13.1  Constructors\n//(define h (make-eq-hashtale)\n//(define h (make-eq-hashtable 1000))\ndefine_libfunc(\"make-eq-hashtable\", 0, 1, function (ar) {\n  // Note: ar[1] (hashtable size) is just ignored\n  return new Hashtable(Hashtable.eq_hash, Hashtable.eq_equiv);\n});\n//(make-eqv-hashtable)    procedure\n//(make-eqv-hashtable k)    procedure\ndefine_libfunc(\"make-eqv-hashtable\", 0, 1, function (ar) {\n  return new Hashtable(Hashtable.eqv_hash, Hashtable.eqv_equiv);\n});\n//(make-hashtable hash-function equiv)    procedure\n//(make-hashtable hash-function equiv k)    procedure\ndefine_libfunc(\"make-hashtable\", 2, 3, function (ar) {\n  assert_procedure(ar[0]);\n  assert_procedure(ar[1]);\n  return new Hashtable(ar[0], ar[1]);\n});\n\n//13.2  Procedures\n// (hashtable? hash)\ndefine_libfunc(\"hashtable?\", 1, 1, function (ar) {\n  return ar[0] instanceof Hashtable;\n});\n//(hashtable-size hash)\ndefine_libfunc(\"hashtable-size\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return ar[0].keys().length;\n});\n\n// Find a pair from a hashtable with given key.\n//\n// hash      - a BiwaScheme.Hashtable\n// key       - an object\n// callbacks - an object contains callback functions\n//             .on_found     - function(pair, hashed)\n//               pair   - [Object key, Object value]\n//               hashed - Object hashed\n//             .on_not_found - function(hashed)\n//               hashed - Object hashed\n//\n// Returns an instance of BiwaScheme.Call.\nconst find_hash_pair = function (hash, key, callbacks) {\n  // invoke hash proc\n  return new Call(hash.hash_proc, [key], function (ar) {\n    var hashed = ar[0];\n    var candidate_pairs = hash.candidate_pairs(hashed);\n\n    if (!candidate_pairs) {\n      // shortcut: obviously not found\n      return callbacks.on_not_found(hashed);\n    }\n\n    // search the exact key from candidates\n    return Call.foreach(candidate_pairs, {\n      call: function (pair) {\n        // invoke the equivalence proc\n        return new Call(hash.equiv_proc, [key, pair[0]]);\n      },\n      result: function (equal, pair) {\n        if (equal) {\n          // found\n          return callbacks.on_found(pair, hashed);\n        }\n      },\n      finish: function () {\n        // not found\n        return callbacks.on_not_found(hashed);\n      },\n    });\n  });\n};\n\n//(hashtable-ref hash \"foo\" #f)\ndefine_libfunc(\"hashtable-ref\", 3, 3, function (ar) {\n  var hash = ar[0],\n    key = ar[1],\n    ifnone = ar[2];\n  assert_hashtable(hash);\n\n  return find_hash_pair(hash, key, {\n    on_found: function (pair) {\n      return pair[1];\n    },\n    on_not_found: function (hashed) {\n      return ifnone;\n    },\n  });\n});\n\n//(hashtable-set! hash \"foo\" '(1 2))\ndefine_libfunc(\"hashtable-set!\", 3, 3, function (ar) {\n  var hash = ar[0],\n    key = ar[1],\n    value = ar[2];\n  assert_hashtable(hash);\n  assert(hash.mutable, \"hashtable is not mutable\");\n\n  return find_hash_pair(hash, key, {\n    on_found: function (pair) {\n      pair[1] = value;\n      return undef;\n    },\n    on_not_found: function (hashed) {\n      hash.add_pair(hashed, key, value);\n      return undef;\n    },\n  });\n});\n\n//(hashtable-delete! hash \"foo\")\ndefine_libfunc(\"hashtable-delete!\", 2, 2, function (ar) {\n  var hash = ar[0],\n    key = ar[1];\n  assert_hashtable(hash);\n  assert(hash.mutable, \"hashtable is not mutable\");\n\n  return find_hash_pair(hash, key, {\n    on_found: function (pair, hashed) {\n      hash.remove_pair(hashed, pair);\n      return undef;\n    },\n    on_not_found: function (hashed) {\n      return undef;\n    },\n  });\n});\n\n//(hashtable-contains? hash \"foo\")\ndefine_libfunc(\"hashtable-contains?\", 2, 2, function (ar) {\n  var hash = ar[0],\n    key = ar[1];\n  assert_hashtable(hash);\n\n  return find_hash_pair(hash, key, {\n    on_found: function (pair) {\n      return true;\n    },\n    on_not_found: function (hashed) {\n      return false;\n    },\n  });\n});\n\n//(hashtable-update! hashtable key proc default)    procedure\ndefine_libfunc(\"hashtable-update!\", 4, 4, function (ar) {\n  var hash = ar[0],\n    key = ar[1],\n    proc = ar[2],\n    ifnone = ar[3];\n  assert_hashtable(hash);\n  assert(hash.mutable, \"hashtable is not mutable\");\n  assert_procedure(proc);\n\n  return find_hash_pair(hash, key, {\n    on_found: function (pair, hashed) {\n      // invoke proc and get new value\n      return new Call(proc, [pair[1]], function (ar) {\n        // replace the value\n        pair[1] = ar[0];\n        return undef;\n      });\n    },\n    on_not_found: function (hashed) {\n      // invoke proc and get new value\n      return new Call(proc, [ifnone], function (ar) {\n        // create new pair\n        hash.add_pair(hashed, key, ar[0]);\n        return undef;\n      });\n    },\n  });\n});\n//(hashtable-copy hashtable)    procedure\n//(hashtable-copy hashtable mutable)    procedure\ndefine_libfunc(\"hashtable-copy\", 1, 2, function (ar) {\n  var mutable = ar[1] === undefined ? false : !!ar[1];\n  assert_hashtable(ar[0]);\n  return ar[0].create_copy(mutable);\n});\n//(hashtable-clear! hashtable)    procedure\n//(hashtable-clear! hashtable k)    procedure\ndefine_libfunc(\"hashtable-clear!\", 0, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  assert(ar[0].mutable, \"hashtable is not mutable\");\n  ar[0].clear();\n  return undef;\n});\n//(hashtable-keys hash)  ; => vector\ndefine_libfunc(\"hashtable-keys\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return ar[0].keys();\n});\n//(hashtable-entries hash)  ; => two vectors (keys, values)\ndefine_libfunc(\"hashtable-entries\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return new Values([ar[0].keys(), ar[0].values()]);\n});\n\n//13.3  Inspection\n\n//(hashtable-equivalence-function hashtable)    procedure\ndefine_libfunc(\"hashtable-equivalence-function\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return ar[0].equiv_proc;\n});\n//(hashtable-hash-function hashtable)    procedure\ndefine_libfunc(\"hashtable-hash-function\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return ar[0].hash_proc;\n});\n//(hashtable-mutable? hashtable)    procedure\ndefine_libfunc(\"hashtable-mutable?\", 1, 1, function (ar) {\n  assert_hashtable(ar[0]);\n  return ar[0].mutable;\n});\n\n//13.4  Hash functions\n\n//(equal-hash obj)    procedure\ndefine_libfunc(\"equal-hash\", 0, 0, function (ar) {\n  return Hashtable.equal_hash;\n});\n//(string-hash string)    procedure\ndefine_libfunc(\"string-hash\", 0, 0, function (ar) {\n  return Hashtable.string_hash;\n});\n//(string-ci-hash string)    procedure\ndefine_libfunc(\"string-ci-hash\", 0, 0, function (ar) {\n  return Hashtable.string_ci_hash;\n});\n//(symbol-hash symbol)    procedure\ndefine_libfunc(\"symbol-hash\", 0, 0, function (ar) {\n  return Hashtable.symbol_hash;\n});\n\n//\n// Chapter 14 Enumerators\n//\n//(make-enumeration symbol-list) -> enum-set(new type)\ndefine_libfunc(\"make-enumeration\", 1, 1, function (ar) {\n  assert_list(ar[0]);\n  var members = ar[0].to_array();\n  var enum_type = new Enumeration.EnumType(members);\n  return enum_type.universe();\n});\n\n//(enum-set-universe enum-set) -> enum-set(same type as the argument)\ndefine_libfunc(\"enum-set-universe\", 1, 1, function (ar) {\n  assert_enum_set(ar[0]);\n  return ar[0].enum_type.universe();\n});\n\n//(enum-set-indexer enum-set) -> (lambda (sym)) -> integer or #f\ndefine_libfunc(\"enum-set-indexer\", 1, 1, function (ar) {\n  assert_enum_set(ar[0]);\n  return ar[0].enum_type.indexer();\n});\n\n//(enum-set-constructor enum-set) -> (lambda (syms)) -> enum-set(same type as the argument)\ndefine_libfunc(\"enum-set-constructor\", 1, 1, function (ar) {\n  assert_enum_set(ar[0]);\n  return ar[0].enum_type.constructor_();\n});\n\n//(enum-set->list enum-set) -> symbol-list\ndefine_libfunc(\"enum-set->list\", 1, 1, function (ar) {\n  assert_enum_set(ar[0]);\n  return ar[0].symbol_list();\n});\n\n//(enum-set-member? symbol enum-set) -> bool\ndefine_libfunc(\"enum-set-member?\", 2, 2, function (ar) {\n  assert_symbol(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[1].is_member(ar[0]);\n});\n\n//(enum-set-subset? esa esb) -> bool\ndefine_libfunc(\"enum-set-subset?\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[0].is_subset(ar[1]);\n});\n\n//(enum-set=? esa esb) -> bool\ndefine_libfunc(\"enum-set=?\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[0].equal_to(ar[1]);\n});\n\n//(enum-set-union es1 es2) -> enum-set\ndefine_libfunc(\"enum-set-union\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  assert(\n    ar[0].enum_type === ar[1].enum_type,\n    \"two enum-sets must be the same enum-type\",\n    \"enum-set-union\"\n  );\n  return ar[0].union(ar[1]);\n});\n\n//(enum-set-intersection es1 es2) -> enum-set\ndefine_libfunc(\"enum-set-intersection\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[0].intersection(ar[1]);\n});\n\n//(enum-set-difference es1 es2) -> enum-set\ndefine_libfunc(\"enum-set-difference\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[0].difference(ar[1]);\n});\n\n//(enum-set-complement enum-set) -> enum-set\ndefine_libfunc(\"enum-set-complement\", 1, 1, function (ar) {\n  assert_enum_set(ar[0]);\n  return ar[0].complement();\n});\n\n//(enum-set-projection esa esb) -> enum-set\ndefine_libfunc(\"enum-set-projection\", 2, 2, function (ar) {\n  assert_enum_set(ar[0]);\n  assert_enum_set(ar[1]);\n  return ar[0].projection(ar[1]);\n});\n\n//(define-enumeration <type-name> (<symbol> ...) <constructor-syntax>)\n// Example:\n//   (define-enumeration color (red green black white) color-set)\n//   this defines:\n//     - an EnumType\n//     - (color red) ;=> 'red\n//     - (color-set red black) ;=> #<enum-set (red black)>\ndefine_syntax(\"define-enumeration\", function (x) {\n  // Extract parameters\n  var type_name = x.cdr.car;\n  assert(\n    isSymbol(type_name),\n    \"expected symbol for type_name\",\n    \"define-enumeration\"\n  );\n  type_name = type_name.name;\n\n  var members = x.cdr.cdr.car;\n  assert(\n    isList(members),\n    \"expected list of symbol for members\",\n    \"define-enumeration\"\n  );\n  members = members.to_array();\n\n  var constructor_name = x.cdr.cdr.cdr.car;\n  assert(\n    isSymbol(constructor_name),\n    \"expected symbol for constructor_name\",\n    \"define-enumeration\"\n  );\n  constructor_name = constructor_name.name;\n\n  // Define EnumType\n  var enum_type = new Enumeration.EnumType(members);\n\n  // Define (color red)\n  define_syntax(type_name, function (x) {\n    // (color)\n    assert(!isNil(x.cdr), \"an argument is needed\", type_name);\n\n    var arg = x.cdr.car;\n    assert_symbol(arg, type_name);\n\n    // Check arg is included in the universe\n    assert(\n      enum_type.members.includes(arg),\n      arg.name +\n        \" is not included in the universe: \" +\n        to_write(enum_type.members),\n      type_name\n    );\n\n    return List(Sym(\"quote\"), arg);\n  });\n\n  // Define (color-set red black)\n  define_syntax(constructor_name, function (x) {\n    assert_list(x.cdr, constructor_name);\n\n    var symbols = x.cdr.to_array();\n\n    // Check each argument is included in the universe\n    symbols.forEach(function (arg) {\n      assert_symbol(arg, constructor_name);\n      assert(\n        enum_type.members.includes(arg),\n        arg.name +\n          \" is not included in the universe: \" +\n          to_write(enum_type.members),\n        constructor_name\n      );\n    });\n\n    // Create an EnumSet\n    return new Enumeration.EnumSet(enum_type, symbols);\n  });\n});\n\n//\n// Chapter 15 Composite library\n//\n//(rnrs 6) = all - eval - mutable pairs - mutable strings - r5rs compatibility\n\n//\n// Chapter 16 eval\n//\n//(eval expression environment)    procedure\ndefine_libfunc(\"eval\", 1, 1, function (ar, intp) {\n  //TODO: environment\n  //TODO: this implementation has a bug that\n  //  expressions which contains #<undef>, etc. cannot be evaluated.\n  var expr = ar[0];\n  var intp2 = new Interpreter(intp);\n  return intp2.evaluate(to_write(expr));\n});\n//(environment import-spec ...)    procedure\n\n//\n// Chapter 17 Mutable pairs\n//\n//(set-car! pair obj)    procedure\n//(set-cdr! pair obj)    procedure\n\n//\n// Chapter 18 Mutable strings\n//\n//(string-set! string k char)    procedure\n// (string-fill! string char)    procedure\n\n//\n// Chapter 19 R5RS compatibility\n//\n//(exact->inexact z)    procedure\n//(inexact->exact z)    procedure\n//\n//(null-environment n)    procedure\n//(scheme-report-environment n)    procedure\n\n//\n// R7RS (TODO: split file?)\n//\n\n// R7RS Promise\n//\n// (delay expression)\ndefine_syntax(\"delay\", function (x) {\n  if (x.cdr === nil) {\n    throw new BiwaError(\"malformed delay: no argument\");\n  }\n  if (x.cdr.cdr !== nil) {\n    throw new BiwaError(\n      \"malformed delay: too many arguments: \" + write_shared(x)\n    );\n  }\n  var expr = x.cdr.car;\n  // Expand into call of internal function\n  // ( procedure->promise (lambda () (make-promise expr)))\n  return new Pair(\n    Sym(\" procedure->promise\"),\n    new Pair(\n      new Pair(\n        Sym(\"lambda\"),\n        new Pair(\n          nil,\n          new Pair(new Pair(Sym(\"make-promise\"), new Pair(expr, nil)), nil)\n        )\n      )\n    )\n  );\n});\n\n// (delay-force promise-expr)\ndefine_syntax(\"delay-force\", function (x) {\n  if (x.cdr === nil) {\n    throw new BiwaError(\"malformed delay-force: no argument\");\n  }\n  if (x.cdr.cdr !== nil) {\n    throw new BiwaError(\n      \"malformed delay-force: too many arguments: \" + write_shared(x)\n    );\n  }\n  var expr = x.cdr.car;\n  // Expand into call of internal function\n  // ( procedure->promise (lambda () expr))\n  return new Pair(\n    Sym(\" procedure->promise\"),\n    new Pair(new Pair(Sym(\"lambda\"), new Pair(nil, new Pair(expr, nil))), nil)\n  );\n});\n\n// (force promise)\nvar force = function (promise) {\n  if (promise.is_done()) {\n    return promise.value();\n  }\n  return new Call(promise.thunk(), [], function (ar) {\n    assert_promise(ar[0]);\n    var new_promise = ar[0];\n    if (promise.is_done()) {\n      // reentrant!\n      return promise.value();\n    } else {\n      promise.update_with(new_promise);\n      return force(new_promise);\n    }\n  });\n};\ndefine_libfunc(\"force\", 1, 1, function (ar, intp) {\n  assert_promise(ar[0]);\n  return force(ar[0]);\n});\n\n// (promise? obj)\ndefine_libfunc(\"promise?\", 1, 1, function (ar, intp) {\n  return ar[0] instanceof BiwaPromise;\n});\n\n// (make-promise obj)\ndefine_libfunc(\"make-promise\", 1, 1, function (ar, intp) {\n  var obj = ar[0];\n  if (obj instanceof BiwaPromise) {\n    return obj;\n  } else {\n    return BiwaPromise.done(obj);\n  }\n});\n\n// internal function\n// ( procedure->promise proc)\n// proc must be a procedure with no argument and return a promise\ndefine_libfunc(\" procedure->promise\", 1, 1, function (ar, intp) {\n  assert_procedure(ar[0]);\n  return BiwaPromise.fresh(ar[0]);\n});\n\n//\n// parameterize\n//\n\n// (make-parameter init)\n// (make-parameter init converter)\ndefine_libfunc(\"make-parameter\", 1, 2, function (ar, intp) {\n  let currentValue;\n  const converter = ar[1];\n  // A parameter is represented by a JS function.\n  // (parameterObj)   ;=> Return the current value\n  // (parameterObj v) ;=> Set v as the value and return the original value\n  const parameterObj = function (ar2) {\n    if (ar2.length == 0) {\n      // Get\n      return currentValue;\n    } else {\n      // Set\n      const origValue = currentValue;\n      if (converter) {\n        return new Call(converter, [ar2[0]], (ar3) => {\n          currentValue = ar3[0];\n          return origValue;\n        });\n      } else {\n        currentValue = ar2[0];\n        return origValue;\n      }\n    }\n  };\n\n  if (converter) {\n    return new Call(converter, [ar[0]], (initialValue) => {\n      currentValue = initialValue;\n      return parameterObj;\n    });\n  } else {\n    const initialValue = ar[0];\n    currentValue = initialValue;\n    return parameterObj;\n  }\n});\n\n// (parameterize ((param val) ...) body ...)\ndefine_syntax(\"parameterize\", function (x) {\n  const inits = x.cdr.car.to_array();\n  const body = x.cdr.cdr;\n  const tmpNames = inits.map(() => gensym());\n  // (let ((tmp0 val0) (tmp1 val1) ...)\n  //   (dynamic-wind\n  //     (lambda () (begin (set! tmp0 (param0 tmp0))) ...)\n  //     (lambda () body ...)\n  //     (lambda () (begin (set! tmp0 (param0 tmp0))) ...)))\n  const givenValues = List(\n    ...inits.map((item, i) => List(tmpNames[i], item.cdr.car))\n  );\n  const updateValues = Cons(\n    Sym(\"begin\"),\n    List(\n      ...inits.map((item, i) =>\n        List(Sym(\"set!\"), tmpNames[i], List(item.car, tmpNames[i]))\n      )\n    )\n  );\n\n  const before = List(Sym(\"lambda\"), nil, updateValues);\n  const thunk = Cons(Sym(\"lambda\"), Cons(nil, body));\n  const after = List(Sym(\"lambda\"), nil, updateValues);\n  //return List(Sym(\"quote\"),\n  return List(\n    Sym(\"let\"),\n    givenValues,\n    List(Sym(\"dynamic-wind\"), before, thunk, after)\n  );\n  //)\n});\n\n//\n// srfi.js - SRFI libraries\n//\n// should be src/library/srfi/1.js, etc (in the future).\n//\n\n//\n// srfi-1 (list)\n//\n// (iota count start? step?)\ndefine_libfunc(\"iota\", 1, 3, function (ar) {\n  var count = ar[0];\n  var start = ar[1] || 0;\n  var step = ar[2] === undefined ? 1 : ar[2];\n  assert_integer(count);\n  assert_number(start);\n  assert_number(step);\n\n  var a = [],\n    n = start;\n  for (var i = 0; i < count; i++) {\n    a.push(n);\n    n += step;\n  }\n  return array_to_list(a);\n});\n\nvar copy_pair = function (pair) {\n  var car = isPair(pair.car) ? copy_pair(pair.car) : pair.car;\n  var cdr = isPair(pair.cdr) ? copy_pair(pair.cdr) : pair.cdr;\n  return new Pair(car, cdr);\n};\n// (list-copy list)\ndefine_libfunc(\"list-copy\", 1, 1, function (ar) {\n  if (isPair(ar[0])) {\n    return copy_pair(ar[0]);\n  } else {\n    return nil;\n  }\n});\n\n//\n// srfi-6 & Gauche (string port)\n//\ndefine_libfunc(\"open-input-string\", 1, 1, function (ar) {\n  assert_string(ar[0]);\n  return new Port.StringInput(ar[0]);\n});\ndefine_libfunc(\"open-output-string\", 0, 0, function (ar) {\n  return new Port.StringOutput();\n});\ndefine_libfunc(\"get-output-string\", 1, 1, function (ar) {\n  assert_port(ar[0]);\n  if (!(ar[0] instanceof Port.StringOutput))\n    throw new Error(\n      \"get-output-string: port must be made by 'open-output-string'\"\n    );\n  return ar[0].output_string();\n});\n\n//\n// srfi-8 (receive)\n//\n\n// (receive <formals> <expression> <body>...)\n// -> (call-with-values (lambda () expression)\n//                        (lambda formals body ...))\ndefine_syntax(\"receive\", function (x) {\n  assert(isPair(x.cdr), \"missing formals\", \"receive\");\n  var formals = x.cdr.car;\n  assert(isPair(x.cdr.cdr), \"missing expression\", \"receive\");\n  var expression = x.cdr.cdr.car;\n  var body = x.cdr.cdr.cdr;\n\n  return deep_array_to_list([\n    Sym(\"call-with-values\"),\n    [Sym(\"lambda\"), nil, expression],\n    new Pair(Sym(\"lambda\"), new Pair(formals, body)),\n  ]);\n});\n\n// srfi-19 (time)\n//\n//  // constants\n//time-duration\n//time-monotonic\n//time-process\n//time-tai\n//time-thread\n//time-utc\n// Current time and clock resolution\n// (current-date [tz-offset])\ndefine_libfunc(\"current-date\", 0, 1, function (ar) {\n  //todo: tz-offset (ar[1])\n  return new Date();\n});\n//\n//current-julian-day -> jdn\n//current-modified-julian-day -> mjdn\n//current-time [time-type] -> time\n//time-resolution [time-type] -> integer\n//  // Time object and accessors\n//make-time type nanosecond second -> time\n//time? object -> boolean\n//time-type time -> time-type\n//time-nanosecond time -> integer\n//time-second time -> integer\n//set-time-type! time time-type\n//set-time-nanosecond! time integer\n//set-time-second! time integer\n//copy-time time1 -> time2\n//  // Time comparison procedures\n//time<=? time1 time2 -> boolean\n//time<? time1 time2 -> boolean\n//time=? time1 time2 -> boolean\n//time>=? time1 time2 -> boolean\n//time>? time1 time2 -> boolean\n//  // Time arithmetic procedures\n//time-difference time1 time2 -> time-duration\n//time-difference! time1 time2 -> time-duration\n//add-duration time1 time-duration -> time\n//add-duration! time1 time-duration -> time\n//subtract-duration time1 time-duration -> time\n//subtract-duration! time1 time-duration -> time\n// Date object and accessors\n// make-date\ndefine_libfunc(\"date?\", 1, 1, function (ar) {\n  return ar[0] instanceof Date;\n});\ndefine_libfunc(\"date-nanosecond\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getMilliseconds() * 1000000;\n});\ndefine_libfunc(\"date-millisecond\", 1, 1, function (ar) {\n  // not srfi-19\n  assert_date(ar[0]);\n  return ar[0].getMilliseconds();\n});\ndefine_libfunc(\"date-second\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getSeconds();\n});\ndefine_libfunc(\"date-minute\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getMinutes();\n});\ndefine_libfunc(\"date-hour\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getHours();\n});\ndefine_libfunc(\"date-day\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getDate();\n});\ndefine_libfunc(\"date-month\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getMonth() + 1; //Jan = 0 in javascript..\n});\ndefine_libfunc(\"date-year\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getFullYear();\n});\n//date-zone-offset\n//date-year-day\ndefine_libfunc(\"date-week-day\", 1, 1, function (ar) {\n  assert_date(ar[0]);\n  return ar[0].getDay();\n});\n//date-week-number\n\n// Time/Date/Julian Day/Modified Julian Day Converters\n// (snipped)\n\n// Date to String/String to Date Converters\n// TODO: support locale\n//   * date_names\n//   * ~f 5.2 sec\n//   * ~p AM/PM\n//   * ~X 2007/01/01\nconst date_names = {\n  weekday: [\"Sun\", \"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\"],\n  full_weekday: [\n    \"Sunday\",\n    \"Monday\",\n    \"Tuesday\",\n    \"Wednesday\",\n    \"Thursday\",\n    \"Friday\",\n    \"Saturday\",\n  ],\n  month: [\n    \"Jan\",\n    \"Feb\",\n    \"Mar\",\n    \"Apr\",\n    \"May\",\n    \"Jun\",\n    \"Jul\",\n    \"Aug\",\n    \"Sep\",\n    \"Oct\",\n    \"Nov\",\n    \"Dec\",\n  ],\n  full_month: [\n    \"January\",\n    \"February\",\n    \"March\",\n    \"April\",\n    \"May\",\n    \"June\",\n    \"July\",\n    \"August\",\n    \"September\",\n    \"Octorber\",\n    \"November\",\n    \"December\",\n  ],\n};\n\nconst date2string = function (date, format) {\n  var zeropad = function (n) {\n    return n < 10 ? \"0\" + n : \"\" + n;\n  };\n  var spacepad = function (n) {\n    return n < 10 ? \" \" + n : \"\" + n;\n  };\n  var isoweeknum = function (x) {\n    var janFour = new Date(x.getFullYear(), 0, 4);\n    var weekone = new Date(x.getFullYear(), 0, 4);\n\n    if (janFour.getDay() >= date_names.weekday.indexOf(\"Thu\")) {\n      weekone.setDate(janFour.getDate() - (janFour.getDay() + 1));\n    } else {\n      weekone.setDate(janFour.getDate() + (7 - janFour.getDay() + 1));\n    }\n\n    return Math.ceil((x - weekone) / 86400000 / 7);\n  };\n\n  var getter = {\n    a: function (x) {\n      return date_names.weekday[x.getDay()];\n    },\n    A: function (x) {\n      return date_names.full_weekday[x.getDay()];\n    },\n    b: function (x) {\n      return date_names.month[x.getMonth()];\n    },\n    B: function (x) {\n      return date_names.full_month[x.getMonth()];\n    },\n    c: function (x) {\n      return x.toString();\n    },\n    d: function (x) {\n      return zeropad(x.getDate());\n    },\n    D: function (x) {\n      return getter.d(x) + getter.m(x) + getter.y(x);\n    },\n    e: function (x) {\n      return spacepad(x.getDate());\n    },\n    f: function (x) {\n      return x.getSeconds() + x.getMilliseconds() / 1000;\n    },\n    h: function (x) {\n      return date_names.month[x.getMonth()];\n    },\n    H: function (x) {\n      return zeropad(x.getHours());\n    },\n    I: function (x) {\n      var h = x.getHours();\n      return zeropad(h < 13 ? h : h - 12);\n    },\n    j: function (x) {\n      throw new Bug(\"not implemented: day of year\");\n    },\n    k: function (x) {\n      return spacepad(x.getHours());\n    },\n    l: function (x) {\n      var h = x.getHours();\n      return spacepad(h < 13 ? h : h - 12);\n    },\n    m: function (x) {\n      return zeropad(x.getMonth() + 1);\n    },\n    M: function (x) {\n      return zeropad(x.getMinutes());\n    },\n    n: function (x) {\n      return \"\\n\";\n    },\n    N: function (x) {\n      throw new Bug(\"not implemented: nanoseconds\");\n    },\n    p: function (x) {\n      return x.getHours() < 13 ? \"AM\" : \"PM\";\n    },\n    r: function (x) {\n      return (\n        getter.I(x) + \":\" + getter.M(x) + \":\" + getter.S(x) + \" \" + getter.p(x)\n      );\n    },\n    s: function (x) {\n      return Math.floor(x.getTime() / 1000);\n    },\n    S: function (x) {\n      return zeropad(x.getSeconds());\n    },\n    t: function (x) {\n      return \"\\t\";\n    },\n    T: function (x) {\n      return getter.H(x) + \":\" + getter.M(x) + \":\" + getter.S(x);\n    },\n    U: function (x) {\n      throw new Bug(\"not implemented: weeknum(0~, Sun)\");\n    },\n    V: function (x) {\n      return isoweeknum(x);\n    },\n    w: function (x) {\n      return x.getDay();\n    },\n    W: function (x) {\n      throw new Bug(\"not implemented: weeknum(0~, Mon)\");\n    },\n    x: function (x) {\n      throw new Bug(\"not implemented: weeknum(1~, Mon)\");\n    },\n    X: function (x) {\n      return getter.Y(x) + \"/\" + getter.m(x) + \"/\" + getter.d(x);\n    },\n    y: function (x) {\n      return x.getFullYear() % 100;\n    },\n    Y: function (x) {\n      return x.getFullYear();\n    },\n    z: function (x) {\n      throw new Bug(\"not implemented: time-zone\");\n    },\n    Z: function (x) {\n      throw new Bug(\"not implemented: symbol time zone\");\n    },\n    1: function (x) {\n      throw new Bug(\"not implemented: ISO-8601 year-month-day format\");\n    },\n    2: function (x) {\n      throw new Bug(\n        \"not implemented: ISO-8601 hour-minute-second-timezone format\"\n      );\n    },\n    3: function (x) {\n      throw new Bug(\"not implemented: ISO-8601 hour-minute-second format\");\n    },\n    4: function (x) {\n      throw new Bug(\n        \"not implemented: ISO-8601 year-month-day-hour-minute-second-timezone format\"\n      );\n    },\n    5: function (x) {\n      throw new Bug(\n        \"not implemented: ISO-8601 year-month-day-hour-minute-second format\"\n      );\n    },\n  };\n\n  return format.replace(/~([\\w1-5~])/g, function (str, x) {\n    var func = getter[x];\n    if (func) return func(date);\n    else if (x == \"~\") return \"~\";\n    else return x;\n  });\n};\n\n// date->string date template\ndefine_libfunc(\"date->string\", 1, 2, function (ar) {\n  assert_date(ar[0]);\n\n  if (ar[1]) {\n    assert_string(ar[1]);\n    return date2string(ar[0], ar[1]);\n  } else return ar[0].toString();\n});\n// string->date\n\n// parse-date date\ndefine_libfunc(\"parse-date\", 1, 1, function (ar) {\n  // not srfi-19\n  assert_string(ar[0]);\n  return new Date(Date.parse(ar[0]));\n});\n\n//\n// srfi-27\n//\ndefine_libfunc(\"random-integer\", 1, 1, function (ar) {\n  var n = ar[0];\n  assert_integer(n);\n  if (n < 0) throw new Error(\"random-integer: the argument must be >= 0\");\n  else return Math.floor(Math.random() * ar[0]);\n});\ndefine_libfunc(\"random-real\", 0, 0, function (ar) {\n  return Math.random();\n});\n\n//\n// srfi-28 (format)\n//\n\n// (format format-str obj1 obj2 ...) -> string\n// (format #f format-str ...) -> string\n// (format #t format-str ...) -> output to current port\n// (format port format-str ...) -> output to the port\n//   ~a: display\n//   ~s: write\n//   ~%: newline\n//   ~~: tilde\ndefine_libfunc(\"format\", 1, null, function (ar) {\n  if (typeof ar[0] === \"string\") {\n    var port = null,\n      format_str = ar.shift();\n  } else if (ar[0] === false) {\n    ar.shift();\n    var port = null,\n      format_str = ar.shift();\n  } else if (ar[0] === true) {\n    ar.shift();\n    var port = Port.current_output,\n      format_str = ar.shift();\n  } else {\n    var port = ar.shift(),\n      format_str = ar.shift();\n    assert_port(port);\n  }\n\n  var str = format_str\n    .replace(/~[as]/g, function (matched) {\n      assert(ar.length > 0, \"insufficient number of arguments\", \"format\");\n      if (matched == \"~a\") return to_display(ar.shift());\n      else return to_write(ar.shift());\n    })\n    .replace(/~%/, \"\\n\")\n    .replace(/~~/, \"~\");\n  if (port) {\n    port.put_string(str);\n    return undef;\n  } else {\n    return str;\n  }\n});\n\n//\n// srfi-38 (write/ss)\n//\nconst user_write_ss = function (ar) {\n  Console.puts(write_shared(ar[0]), true);\n  return undef;\n};\ndefine_libfunc(\"write/ss\", 1, 2, user_write_ss);\ndefine_libfunc(\"write-with-shared-structure\", 1, 2, user_write_ss);\ndefine_libfunc(\"write*\", 1, 2, user_write_ss); //from Gauche(STklos)\n\n//\n// srfi-43 (vector library)\n//\ndefine_libfunc(\"vector-append\", 2, null, function (ar) {\n  var vec = [];\n  return vec.concat.apply(vec, ar);\n});\n\n// (vector-copy vector)\ndefine_libfunc(\"vector-copy\", 1, 1, function (ar) {\n  assert_vector(ar[0]);\n  return [...ar[0]];\n});\n\n//\n// see src/library/node_functions.js for:\n// - srfi-98 (get-environment-variable)\n//\n\nvar BiwaScheme$1 = {\n  TopEnv,\n  CoreEnv,\n  nil,\n  undef,\n  max_trace_size,\n  suppress_deprecation_warning,\n  Version: VERSION,\n  VERSION,\n  GitCommit,\n  eq,\n  eqv,\n  equal,\n  isNil,\n  isUndef,\n  isBoolean,\n  isString,\n  isSymbol,\n  isPort,\n  isPair,\n  isList,\n  isVector,\n  isHashtable,\n  isMutableHashtable,\n  isProcedure,\n  lt,\n  to_write,\n  to_display,\n  inspect,\n  write_ss: write_shared,\n  to_write_ss: write_shared, // For backward compatibility\n  Call,\n  Char,\n  isChar,\n  Closure,\n  isClosure,\n  Compiler,\n  Enumeration,\n  isEnumSet,\n  Error: BiwaError,\n  Bug,\n  UserError,\n  Hashtable,\n  Interpreter,\n  Complex,\n  Rational,\n  isNumber,\n  isComplex,\n  isReal,\n  isRational,\n  isInteger,\n  Pair,\n  List,\n  array_to_list,\n  deep_array_to_list,\n  Cons,\n  Parser,\n  Pause,\n  Port,\n  eof,\n  Promise: BiwaPromise,\n  isPromise,\n  Record,\n  isRecord,\n  isRecordTD,\n  isRecordCD,\n  Set: BiwaSet,\n  Symbol: BiwaSymbol,\n  Sym,\n  gensym,\n  Syntax,\n  Values,\n  VMCode,\n\n  define_libfunc,\n  define_scmfunc,\n  parse_fraction,\n  is_valid_integer_notation,\n  parse_integer,\n  is_valid_float_notation,\n  parse_float,\n\n  assert_number,\n  assert_integer,\n  assert_real,\n  assert_between,\n  assert_string,\n  assert_char,\n  assert_symbol,\n  assert_port,\n  assert_pair,\n  assert_list,\n  assert_vector,\n  assert_hashtable,\n  assert_mutable_hashtable,\n  assert_promise,\n  assert_function,\n  assert_closure,\n  assert_procedure,\n  assert_date,\n  assert,\n};\n\nConsole.puts = function (str, no_newline) {\n  Port.current_output.put_string(str + (no_newline ? \"\" : \"\\n\"));\n};\n\nConsole.p = function (/*ARGS*/) {\n  Port.current_output.put_string(\n    \"p> \" + Array.arrayFrom(arguments).map(inspect).join(\" \")\n  );\n};\n\nconst current_input = new Port.CustomInput(function (callback) {\n  const out = document.querySelector(\"#bs-console\");\n  const form = document.createElement(\"form\");\n  form.innerHTML =\n    \"<input id='webscheme-read-line' type='text'><input type='submit' value='ok'>\";\n  out.appendChild(form);\n  form.addEventListener(\"submit\", function () {\n    const input = document.querySelector(\"#webscheme-read-line\").value;\n    form.remove();\n    callback(input);\n    return false;\n  });\n});\n\nconst current_output = new Port.CustomOutput(function (str) {\n  const out = document.querySelector(\"#bs-console\");\n  if (!out) return;\n  const span = document.createElement(\"span\");\n  span.innerHTML = escape(str).replace(/\\n/g, \"<br>\").replace(/ /g, \"&nbsp;\");\n  out.appendChild(span);\n});\n\nconst current_error = current_output;\n\n// To use webscheme_lib, jQuery must be loaded beforehand\nconst $$1 = window.jQuery;\n\ndefine_libfunc(\"read-line\", 0, 1, function (ar) {\n  var port = ar[0] || Port.current_input;\n  assert_port(port);\n  return port.get_string((str) => str);\n});\n\n//\n// element\n//\ndefine_libfunc(\"element-empty!\", 1, 1, function (ar) {\n  if ($$1(ar[0]).prop(\"value\")) {\n    return $$1(ar[0]).val(\"\");\n  } else {\n    return $$1(ar[0]).empty();\n  }\n});\nalias_libfunc(\"element-empty!\", \"element-clear!\");\ndefine_libfunc(\"element-visible?\", 1, 1, function (ar) {\n  return $$1(ar[0]).is(\":visible\");\n});\ndefine_libfunc(\"element-toggle!\", 1, 1, function (ar) {\n  return $$1(ar[0]).toggle();\n});\ndefine_libfunc(\"element-hide!\", 1, 1, function (ar) {\n  return $$1(ar[0]).hide();\n});\ndefine_libfunc(\"element-show!\", 1, 1, function (ar) {\n  return $$1(ar[0]).show();\n});\ndefine_libfunc(\"element-remove!\", 1, 1, function (ar) {\n  return $$1(ar[0]).remove();\n});\ndefine_libfunc(\"element-update!\", 2, 2, function (ar) {\n  return $$1(ar[0]).html(ar[1]);\n});\ndefine_libfunc(\"element-replace!\", 2, 2, function (ar) {\n  return $$1(ar[0]).replaceWith(ar[1]);\n});\ndefine_libfunc(\"element-insert!\", 2, 2, function (ar) {\n  return $$1(ar[0]).append(ar[1]);\n});\ndefine_libfunc(\"element-wrap!\", 3, 3, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-ancestors\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-descendants\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-first-descendant\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-immediate-descendants\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-previous-sibling\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-next-sibling\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-siblings\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-match?\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-up\", 3, 3, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-down\", 3, 3, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-previous\", 3, 3, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-next\", 3, 3, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-select\", 1, 1, function (ar) {\n  $$1(ar[0]).select();\n});\ndefine_libfunc(\"element-adjacent\", 0, 0, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-identify\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-read-attribute\", 2, 2, function (ar) {\n  assert_string(ar[1]);\n  if (ar[1].startsWith(\"data-\")) {\n    // For backward compatibility. #271\n    return $$1(ar[0]).attr(ar[1]);\n  } else {\n    return $$1(ar[0]).prop(ar[1]);\n  }\n});\n\nvar element_write_attribute = function (ar) {\n  assert_string(ar[1]);\n  if (ar[1].startsWith(\"data-\")) {\n    // For backward compatibility. #271\n    return $$1(ar[0]).attr(ar[1], ar[2]);\n  } else {\n    return $$1(ar[0]).prop(ar[1], ar[2]);\n  }\n};\ndefine_libfunc(\"element-write-attribute\", 3, 3, function (ar) {\n  deprecate(\"element-write-attribute\", \"1.0\", \"element-write-attribute!\");\n  return element_write_attribute(ar);\n});\ndefine_libfunc(\"element-write-attribute!\", 3, 3, element_write_attribute);\n\ndefine_libfunc(\"element-height\", 1, 1, function (ar) {\n  return $$1(ar[0]).height();\n});\ndefine_libfunc(\"element-width\", 1, 1, function (ar) {\n  return $$1(ar[0]).width();\n});\n\ndefine_libfunc(\"element-class-names\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-has-class-name?\", 2, 2, function (ar) {\n  assert_string(ar[1]);\n  return $$1(ar[0]).hasClass(ar[1]);\n});\n\nvar element_add_class_name = function (ar) {\n  assert_string(ar[1]);\n  return $$1(ar[0]).addClass(ar[1]);\n};\ndefine_libfunc(\"element-add-class-name\", 2, 2, function (ar) {\n  deprecate(\"element-add-class-name\", \"1.0\", \"element-add-class-name!\");\n  return element_add_class_name(ar);\n});\ndefine_libfunc(\"element-add-class-name!\", 2, 2, element_add_class_name);\n\nvar element_remove_class_name = function (ar) {\n  assert_string(ar[1]);\n  return $$1(ar[0]).removeClass(ar[1]);\n};\ndefine_libfunc(\"element-remove-class-name\", 2, 2, function (ar) {\n  deprecate(\"element-remove-class-name\", \"1.0\", \"element-remove-class-name!\");\n  return element_remove_class_name(ar);\n});\ndefine_libfunc(\"element-remove-class-name!\", 2, 2, element_remove_class_name);\n\nvar element_toggle_class_name = function (ar) {\n  assert_string(ar[1]);\n  return $$1(ar[0]).toggleClass(ar[1]);\n};\ndefine_libfunc(\"element-toggle-class-name\", 2, 2, function (ar) {\n  deprecate(\"element-toggle-class-name\", \"1.0\", \"element-toggle-class-name!\");\n  return element_toggle_class_name(ar);\n});\ndefine_libfunc(\"element-toggle-class-name!\", 2, 2, element_toggle_class_name);\n\ndefine_libfunc(\"element-clean-whitespace!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-empty?\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-descendant-of!\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"scroll-to-element!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-style\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-opacity\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-style-set!\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-opacity-set!\", 2, 2, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-dimensions\", 1, 1, function (ar) {\n  return new Values($$1(ar[0]).width(), $$1(ar[0]).height());\n});\ndefine_libfunc(\"element-make-positioned!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-undo-positioned!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-make-clipping!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-undo-clipping!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-cumulative-offset\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-positioned-offset\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-absolutize!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-relativize!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-cumulative-scroll-offset\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-offset-parent\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-viewport-offset\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-clone-position!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-absolutize!\", 1, 1, function (ar) {\n  throw new Bug(\"not yet implemented\");\n});\ndefine_libfunc(\"element-focus!\", 1, 1, function (ar) {\n  return $$1(ar[0]).focus();\n});\n\n// usage:\n//  (element-new '(div \"foo\"))        => <div>foo</div>\n//  (element-new '(\"div#main\" \"foo\")) => <div id='main'>foo</div>\n//  (element-new '(\"div.red\" \"foo\"))  => <div class='red'>foo</div>\n//  (element-new '(div align \"right\" \"foo\"))  => <div align='right'>foo</div>\n//  (element-new '(div (span \"foo\"))  => <div><span>foo</span></div>\n//\n\nconst create_elements_by_string = function (spec) {\n  spec = spec.to_array();\n  var name = spec.shift();\n  if (name instanceof BiwaSymbol) name = name.name;\n  var m = name.match(/(.*)\\.(.*)/);\n  if (m) {\n    name = m[1];\n    spec.unshift(Sym(\"class\"), m[2]);\n  }\n  m = name.match(/(.*)\\#(.*)/);\n  if (m) {\n    name = m[1];\n    spec.unshift(Sym(\"id\"), m[2]);\n  }\n  var children = [];\n  var s = [\"<\" + name];\n  for (var i = 0; i < spec.length; i++) {\n    if (spec[i] instanceof BiwaSymbol) {\n      s.push(\" \" + spec[i].name + '=\"' + spec[i + 1] + '\"');\n      i++;\n    } else {\n      if (spec[i] instanceof Pair)\n        children.push(create_elements_by_string(spec[i]));\n      else children.push(spec[i]); // String\n    }\n  }\n  s.push(\">\");\n  s.push(children.join(\"\"));\n  s.push(\"</\" + name + \">\");\n  return s.join(\"\");\n};\n\nconst tree_all = function (tree, pred) {\n  if (tree === nil) return true;\n  else if (pred(tree.car) === false) return false;\n  else return tree_all(tree.cdr, pred);\n};\ndefine_libfunc(\"element-new\", 1, 1, function (ar) {\n  var string_or_symbol = function (item) {\n    return (\n      typeof item === \"string\" ||\n      item instanceof BiwaSymbol ||\n      item instanceof Pair\n    );\n  };\n  if (tree_all(ar[0], string_or_symbol)) {\n    return $$1(create_elements_by_string(ar[0]))[0];\n  } else {\n    return nil;\n  }\n});\n\nconst element_content = function (selector) {\n  if ($$1(selector).prop(\"value\")) {\n    return $$1(selector).val();\n  } else {\n    return escape($$1(selector).html());\n  }\n};\ndefine_libfunc(\"element-content\", 1, 1, function (ar) {\n  return element_content(ar[0]);\n});\n\n//\n// load from network\n//\ndefine_libfunc(\"load\", 1, 1, function (ar, intp) {\n  var path = ar[0];\n  assert_string(path);\n  var intp2 = new Interpreter(intp);\n  return new Pause(function (pause) {\n    $$1.ajax(path, {\n      dataType: \"text\",\n      mimeType: \"text/plain; charset=UTF-8\", // For Firefox (#88)\n      success: function (data) {\n        // create new interpreter not to destroy current stack.\n        intp2.evaluate(data, function () {\n          return pause.resume(undef);\n        });\n      },\n      error: function () {\n        throw new Error(\"load: network error: failed to load \" + path);\n      },\n    });\n  });\n});\n\n// Load javascript file on the server\nconst _require = function (src, check, proc) {\n  var script = $$1(\"<script/>\", { src: src });\n  $$1(\"body\").append(script);\n\n  var checker = new Function(\"return !!(\" + check + \")\");\n\n  if (checker()) proc();\n  else\n    setTimeout(function () {\n      checker() ? proc() : setTimeout(arguments.callee, 10);\n    }, 10);\n};\n// (js-load \"lib/foo.js\" \"Foo\")\ndefine_libfunc(\"js-load\", 2, 2, function (ar) {\n  var path = ar[0];\n  var check = ar[1];\n  assert_string(path);\n  assert_string(check);\n\n  return new Pause(function (pause) {\n    _require(path, \"window.\" + check, function () {\n      pause.resume(undef);\n    });\n  });\n});\n\n//\n// html modification\n//\n\nconst getelem = function (ar) {\n  // account for getelem returning false when no results (and that getting passed back in)\n  if (ar.length > 1 && ar[1] === false) {\n    ar[1] = [];\n  }\n\n  var x = $$1.apply(this, ar);\n  if (x.length > 0) {\n    return x;\n  } else {\n    return false;\n  }\n};\ndefine_libfunc(\"$\", 1, 2, getelem);\ndefine_libfunc(\"getelem\", 1, 2, getelem);\ndefine_libfunc(\"dom-element\", 1, 1, function (ar) {\n  return $$1(ar[0])[0];\n});\n\ndefine_libfunc(\"set-style!\", 3, 3, function (ar) {\n  assert_string(ar[1]);\n  $$1(ar[0]).css(ar[1], ar[2]);\n  return undef;\n});\ndefine_libfunc(\"get-style\", 2, 2, function (ar) {\n  assert_string(ar[1]);\n  return $$1(ar[0]).css(ar[1]);\n});\ndefine_libfunc(\"set-content!\", 2, 2, function (ar) {\n  assert_string(ar[1]);\n  var str = ar[1].replace(/\\n/g, \"<br>\").replace(/\\t/g, \"&nbsp;&nbsp;&nbsp;\");\n  $$1(ar[0]).html(str);\n  return undef;\n});\ndefine_libfunc(\"get-content\", 1, 1, function (ar) {\n  return element_content(ar[0]);\n});\n\n//\n// handlers\n//\ndefine_libfunc(\"set-handler!\", 3, 3, function (ar, intp) {\n  throw new Error(\"set-handler! is obsolete, please use add-handler! instead\");\n});\ndefine_libfunc(\"add-handler!\", 3, 3, function (ar, intp) {\n  var selector = ar[0],\n    evtype = ar[1],\n    proc = ar[2];\n  var handler = function (event) {\n    return new Interpreter(intp).invoke_closure(proc, [event]);\n  };\n  $$1(selector).on(evtype, handler);\n  return handler;\n});\ndefine_libfunc(\"remove-handler!\", 3, 3, function (ar, intp) {\n  var selector = ar[0],\n    evtype = ar[1],\n    handler = ar[2];\n  $$1(selector).off(evtype, handler);\n  return undef;\n});\ndefine_libfunc(\"wait-for\", 2, 2, function (ar) {\n  var selector = ar[0],\n    evtype = ar[1];\n  var elem = $$1(selector);\n  elem.biwascheme_wait_for = elem.biwascheme_wait_for || {};\n\n  var prev_handler = elem.biwascheme_wait_for[evtype];\n  if (prev_handler) {\n    // Maybe a wait-for is called more than once,\n    // and previous handler is not consumed.\n    elem.off(evtype, prev_handler);\n  }\n\n  return new Pause(function (pause) {\n    var handler = function (event) {\n      elem.biwascheme_wait_for[evtype] = undefined;\n      elem.off(evtype, handler);\n      return pause.resume(event);\n    };\n\n    elem.biwascheme_wait_for[evtype] = handler;\n    elem.on(evtype, handler);\n  });\n});\n\n//\n// dom\n//\ndefine_libfunc(\"domelem\", 1, null, function (ar) {\n  throw new Error(\"obsolete\");\n});\ndefine_libfunc(\"dom-remove-children!\", 1, 1, function (ar) {\n  Console.puts(\n    \"warning: dom-remove-children! is obsolete. use element-empty! instead\"\n  );\n  $$1(ar[0]).empty();\n  return undef;\n});\ndefine_libfunc(\"dom-create-element\", 1, 1, function (ar) {\n  throw new Error(\"obsolete\");\n});\ndefine_libfunc(\"element-append-child!\", 2, 2, function (ar) {\n  return $$1(ar[0]).append(ar[1]);\n});\ndefine_libfunc(\"dom-remove-child!\", 2, 2, function (ar) {\n  throw new Error(\"obsolete\");\n});\n//  define_libfunc(\"dom-get-attribute\", 2, 2, function(ar){\n//  });\n//  define_libfunc(\"dom-remove-child!\", 2, 2, function(ar){\n//  });\n\n//\n// communication to server\n//\ndefine_libfunc(\"http-request\", 1, 1, function (ar) {\n  var path = ar[0];\n  assert_string(path);\n\n  return new Pause(function (pause) {\n    $$1.get(\n      path,\n      function (data) {\n        pause.resume(data);\n      },\n      \"text\"\n    );\n  });\n});\n// (http-post \"/foo\" '((\"x\" . 1) (\"y\" . 2)))\ndefine_libfunc(\"http-post\", 2, 2, function (ar) {\n  var path = ar[0];\n  assert_string(path);\n  var alist = ar[1];\n  assert_list(alist);\n  var h = alist_to_js_obj(alist);\n\n  return new Pause(function (pause) {\n    $$1.post(\n      path,\n      h,\n      function (data) {\n        pause.resume(data);\n      },\n      \"text\"\n    );\n  });\n});\n\nconst jsonp_receiver = [];\ndefine_libfunc(\"receive-jsonp\", 1, 1, function (ar) {\n  var url = ar[0];\n  assert_string(url);\n\n  var receives = jsonp_receiver;\n  for (var i = 0; i < receives.length; i++) if (receives[i] === null) break;\n  var receiver_id = i;\n  url += \"?callback=BiwaScheme.jsonp_receiver[\" + receiver_id + \"]\";\n\n  return new Pause(function (pause) {\n    receives[receiver_id] = function (data) {\n      pause.resume(data);\n      receives[receiver_id] = null;\n    };\n    var script = $$1(\"<script/>\", { src: url });\n    $$1(\"body\").append(script);\n  });\n});\n\n//\n// dialog, debug\n//\ndefine_libfunc(\"alert\", 1, 1, function (ar) {\n  alert(ar[0]);\n  return undef;\n});\ndefine_libfunc(\"confirm\", 1, 1, function (ar) {\n  return confirm(ar[0]);\n});\n\n//\n// Dumper - graphical state dumper\n//\n\nconst DUMP_PAD = \"&nbsp;&nbsp;&nbsp;\";\nconst FOLD_LIMIT = 20;\nconst STACK_MAX_LEN = 80;\n\nclass Dumper {\n  constructor(dumparea) {\n    this.dumparea = dumparea || $(\"#dumparea\")[0] || null;\n    this.reset();\n  }\n\n  reset() {\n    if (this.dumparea) {\n      // Note: this is for repl.html (needs refactoring..)\n      $(this.dumparea).empty();\n    }\n    this.n_folds = 0;\n    this.closures = [];\n    this.n_dumps = 0;\n    this.cur = -1;\n    this.is_folded = true;\n  }\n\n  is_opc(obj) {\n    return obj instanceof Array && typeof obj[0] == \"string\";\n  }\n\n  dump_opc(obj, level, nested) {\n    var s = \"\";\n    var pad1 = \"\",\n      pad2 = \"\";\n    var level = level || 0;\n    var nested = nested || false;\n    Array(level)\n      .fill()\n      .map(() => {\n        pad1 += DUMP_PAD;\n      });\n    Array(level + 1)\n      .fill()\n      .map(() => {\n        pad2 += DUMP_PAD;\n      });\n\n    s += pad1 + '[<span class=\"dump_opecode\">' + obj[0] + \"</span>\";\n    var i = 1;\n    while (!(obj[i] instanceof Array) && i < obj.length) {\n      if (obj[0] == \"constant\")\n        s +=\n          \"&nbsp;<span class='dump_constant'>\" +\n          this.dump_obj(obj[i]) +\n          \"</span>\";\n      else s += \"&nbsp;\" + this.dump_obj(obj[i]);\n      i++;\n    }\n    if (i < obj.length) s += \"<br>\\n\";\n    for (; i < obj.length; i++) {\n      if (this.is_opc(obj[i])) {\n        s += this.dump_opc(\n          obj[i],\n          i == obj.length - 1 ? level : level + 1,\n          true\n        );\n      } else {\n        s += i == obj.length - 1 ? pad1 : pad2;\n        s += this.dump_obj(obj[i]);\n      }\n      if (i != obj.length - 1) s += \"<br>\\n\";\n    }\n    s += \"]\";\n    return nested ? s : this.add_fold(s);\n  }\n\n  add_fold(s) {\n    var lines = s.split(/<br>/gim);\n\n    if (lines.length > FOLD_LIMIT) {\n      var fold_btn =\n        \" <span style='text-decoration:underline; color:blue; cursor:pointer;'\" +\n        \"onclick='BiwaScheme.Dumper.toggle_fold(\" +\n        this.n_folds +\n        \")'>more</span>\";\n      var fold_start =\n        \"<div style='display:none' class='fold\" + this.n_folds + \"'>\";\n      var fold_end = \"</div>\";\n      this.n_folds++;\n      return [\n        lines.slice(0, FOLD_LIMIT).join(\"<br>\"),\n        fold_btn,\n        fold_start,\n        lines.slice(FOLD_LIMIT).join(\"<br>\"),\n        fold_end,\n      ].join(\"\");\n    } else {\n      return s;\n    }\n  }\n\n  dump_stack(stk, size) {\n    if (stk === null || stk === undefined) return inspect(stk);\n    var s = \"<table>\";\n\n    // show the 'physical' stack top\n    if (stk.length == 0) {\n      s += \"<tr><td class='dump_dead'>(stack is empty)</td></tr>\";\n    } else if (size < stk.length) {\n      var l = stk.length - 1;\n      s +=\n        \"<tr><td class='dump_dead'>[\" +\n        l +\n        \"]</td>\" +\n        \"<td class='dump_dead'>\" +\n        truncate(this.dump_obj(stk[l]), STACK_MAX_LEN) +\n        \"</td></tr>\";\n    }\n\n    // show the element in the stack\n    for (var i = size - 1; i >= 0; i--) {\n      s +=\n        \"<tr><td class='dump_stknum'>[\" +\n        i +\n        \"]</td>\" +\n        \"<td>\" +\n        truncate(this.dump_obj(stk[i]), STACK_MAX_LEN) +\n        \"</td></tr>\";\n    }\n    return s + \"</table>\";\n  }\n\n  dump_object(obj) {\n    var a = [];\n    for (var k in obj) {\n      //if(this.prototype[k]) continue;\n      a.push(k.toString()); //+\" => \"+this[k].toString() );\n    }\n    return \"#<Object{\" + a.join(\",\") + \"}>\";\n  }\n\n  dump_closure(cls) {\n    if (!cls) return \"**BROKEN**\";\n    if (cls.length == 0) return \"[]\";\n\n    var cls_num = null;\n    for (var i = 0; i < this.closures.length; i++) {\n      if (this.closures[i] == cls) cls_num = i;\n    }\n    if (cls_num == null) {\n      cls_num = this.closures.length;\n      this.closures.push(cls);\n    }\n\n    const body = cls.body;\n    return [\n      \"c\",\n      cls_num,\n      \" <span class='dump_closure'>free vars :</span> \",\n      this.dump_obj(cls.freevars),\n      \" <span class='dump_closure'>dotpos :</span> \",\n      cls.dotpos,\n      \" <span class='dump_closure'>expected_args :</span> \",\n      cls.expected_args,\n      \" <span class='dump_closure'>body :</span> \",\n      truncate(this.dump_obj(body), 100),\n    ].join(\"\");\n  }\n\n  dump_obj(obj) {\n    if (obj && typeof obj.to_html == \"function\") return obj.to_html();\n    else {\n      var s = to_write(obj);\n      if (s == \"[object Object]\") s = this.dump_object(obj);\n      return escape(s);\n    }\n  }\n\n  dump(obj) {\n    var s = \"\";\n    if (obj instanceof Object) {\n      s += \"<table>\";\n\n      // header\n      s +=\n        \"<tr><td colspan='4'>\" +\n        \"<a href='#' class='header'>\" +\n        \"#\" +\n        this.n_dumps +\n        \"</a></td></tr>\";\n\n      // registers\n      Object.keys(obj).forEach(\n        function (key) {\n          var value = obj[key];\n          if (key != \"x\" && key != \"stack\") {\n            value =\n              key == \"c\" ? this.dump_closure(value) : this.dump_obj(value);\n            s +=\n              \"<tr><td>\" +\n              key +\n              \": </td>\" +\n              \"<td colspan='3'>\" +\n              value +\n              \"</td></tr>\";\n          }\n        }.bind(this)\n      );\n      s +=\n        \"<tr><td>x:</td><td>\" +\n        (this.is_opc(obj[\"x\"])\n          ? this.dump_opc(obj[\"x\"])\n          : this.dump_obj(obj[\"x\"])) +\n        \"</td>\";\n\n      // stack\n      s +=\n        \"<td style='border-left: 1px solid black'>stack:</td><td>\" +\n        this.dump_stack(obj[\"stack\"], obj[\"s\"]) +\n        \"</td></tr>\";\n      s += \"</table>\";\n    } else {\n      s = escape(inspect(obj)) + \"<br>\\n\";\n    }\n    var dumpitem = $(\"<div/>\", { class: \"dump\" + this.n_dumps });\n    dumpitem.html(s);\n    $(this.dumparea).append(dumpitem);\n    (function (n) {\n      $(\".header\", this.dump_el(this.n_dumps)).click(\n        function () {\n          this.dump_move_to(n);\n          this.dump_fold();\n        }.bind(this)\n      );\n    }.bind(this)(this.n_dumps));\n    dumpitem.hide();\n    this.n_dumps++;\n  }\n\n  //\n  // UI\n  //\n  dump_el(n) {\n    return $(\".dump\" + n, this.dumparea);\n  }\n\n  dump_move_to(n) {\n    if (n < 0) n = this.n_dumps + n;\n\n    if (0 <= n && n <= this.n_dumps) {\n      this.dump_el(this.cur).hide();\n      this.cur = n;\n      this.dump_el(this.cur).show();\n    }\n  }\n\n  dump_move(dir) {\n    if (0 <= this.cur && this.cur < this.n_dumps) this.dump_el(this.cur).hide();\n\n    if (0 <= this.cur + dir && this.cur + dir < this.n_dumps) this.cur += dir;\n\n    this.dump_el(this.cur).show();\n  }\n\n  dump_fold() {\n    for (var i = 0; i < this.n_dumps; i++)\n      if (i != this.cur) this.dump_el(i).hide();\n\n    this.is_folded = true;\n  }\n\n  dump_unfold() {\n    for (var i = 0; i < this.n_dumps; i++) this.dump_el(i).show();\n\n    this.is_folded = false;\n  }\n\n  dump_toggle_fold() {\n    if (this.is_folded) this.dump_unfold();\n    else this.dump_fold();\n  }\n}\n\nDumper.toggle_fold = function (n) {\n  $(\".fold\" + n, this.dumparea).toggle();\n};\n\n//\n// release_initializer.js - read user's program and eval it (if it exists)\n//\n\nconst execute_user_program = function () {\n  let dumper = null;\n  const debug_area = document.querySelector(\"#biwascheme-debugger\");\n  if (debug_area) {\n    dumper = new Dumper(debug_area);\n  }\n\n  // Error handler (show message to console div)\n  const onError = function (e, state) {\n    BiwaScheme.Port.current_error.put_string(e.message + \"\\n\");\n    if (dumper) {\n      dumper.dump(state);\n      dumper.dump_move(1);\n    } else if (typeof console !== \"undefined\" && console.error) {\n      console.error(e.message);\n    } else {\n      throw e;\n    }\n  };\n\n  const run = function (script) {\n    const intp = new BiwaScheme.Interpreter(onError);\n    try {\n      intp.evaluate(script, function () {});\n    } catch (e) {\n      onError(e);\n    }\n  };\n\n  // Start user's program (old style)\n  let script = \"\";\n  for (const s of document.querySelectorAll(\"script[src$='biwascheme.js']\")) {\n    script += s.innerHTML;\n  }\n  for (const s of document.querySelectorAll(\n    \"script[src$='biwascheme-min.js']\"\n  )) {\n    script += s.innerHTML;\n  }\n\n  if (script.length > 0) run(script);\n\n  // Start user's program (new style)\n  window.addEventListener(\"DOMContentLoaded\", function () {\n    for (const s of document.querySelectorAll(\n      \"script[type='text/biwascheme']\"\n    )) {\n      run(s.innerHTML);\n    }\n  });\n};\n\nBiwaScheme$1.on_node = false;\nBiwaScheme$1.Console = Console;\nBiwaScheme$1.Port.current_input = current_input;\nBiwaScheme$1.Port.current_output = current_output;\nBiwaScheme$1.Port.current_error = current_error;\nBiwaScheme$1.jsonp_receiver = jsonp_receiver;\nBiwaScheme$1.Dumper = Dumper;\n\n// TODO: ideally this should just be `window.BiwaScheme = BiwaScheme` but it will break test/spec.html (grep with `register_tests`)\nwindow.BiwaScheme = window.BiwaScheme || {};\nObject.assign(window.BiwaScheme, BiwaScheme$1);\nexecute_user_program();\n\nexport default BiwaScheme$1;\n"]}