| | |
| | | /** |
| | | * @vue/compiler-sfc v3.5.25 |
| | | * @vue/compiler-sfc v3.5.32 |
| | | * (c) 2018-present Yuxi (Evan) You and Vue contributors |
| | | * @license MIT |
| | | **/ |
| | |
| | | ); |
| | | }; |
| | | |
| | | const FRAGMENT = Symbol(`Fragment` ); |
| | | const TELEPORT = Symbol(`Teleport` ); |
| | | const SUSPENSE = Symbol(`Suspense` ); |
| | | const KEEP_ALIVE = Symbol(`KeepAlive` ); |
| | | const BASE_TRANSITION = Symbol( |
| | | const FRAGMENT = /* @__PURE__ */ Symbol(`Fragment` ); |
| | | const TELEPORT = /* @__PURE__ */ Symbol(`Teleport` ); |
| | | const SUSPENSE = /* @__PURE__ */ Symbol(`Suspense` ); |
| | | const KEEP_ALIVE = /* @__PURE__ */ Symbol(`KeepAlive` ); |
| | | const BASE_TRANSITION = /* @__PURE__ */ Symbol( |
| | | `BaseTransition` |
| | | ); |
| | | const OPEN_BLOCK = Symbol(`openBlock` ); |
| | | const CREATE_BLOCK = Symbol(`createBlock` ); |
| | | const CREATE_ELEMENT_BLOCK = Symbol( |
| | | const OPEN_BLOCK = /* @__PURE__ */ Symbol(`openBlock` ); |
| | | const CREATE_BLOCK = /* @__PURE__ */ Symbol(`createBlock` ); |
| | | const CREATE_ELEMENT_BLOCK = /* @__PURE__ */ Symbol( |
| | | `createElementBlock` |
| | | ); |
| | | const CREATE_VNODE = Symbol(`createVNode` ); |
| | | const CREATE_ELEMENT_VNODE = Symbol( |
| | | const CREATE_VNODE = /* @__PURE__ */ Symbol(`createVNode` ); |
| | | const CREATE_ELEMENT_VNODE = /* @__PURE__ */ Symbol( |
| | | `createElementVNode` |
| | | ); |
| | | const CREATE_COMMENT = Symbol( |
| | | const CREATE_COMMENT = /* @__PURE__ */ Symbol( |
| | | `createCommentVNode` |
| | | ); |
| | | const CREATE_TEXT = Symbol( |
| | | const CREATE_TEXT = /* @__PURE__ */ Symbol( |
| | | `createTextVNode` |
| | | ); |
| | | const CREATE_STATIC = Symbol( |
| | | const CREATE_STATIC = /* @__PURE__ */ Symbol( |
| | | `createStaticVNode` |
| | | ); |
| | | const RESOLVE_COMPONENT = Symbol( |
| | | const RESOLVE_COMPONENT = /* @__PURE__ */ Symbol( |
| | | `resolveComponent` |
| | | ); |
| | | const RESOLVE_DYNAMIC_COMPONENT = Symbol( |
| | | const RESOLVE_DYNAMIC_COMPONENT = /* @__PURE__ */ Symbol( |
| | | `resolveDynamicComponent` |
| | | ); |
| | | const RESOLVE_DIRECTIVE = Symbol( |
| | | const RESOLVE_DIRECTIVE = /* @__PURE__ */ Symbol( |
| | | `resolveDirective` |
| | | ); |
| | | const RESOLVE_FILTER = Symbol( |
| | | const RESOLVE_FILTER = /* @__PURE__ */ Symbol( |
| | | `resolveFilter` |
| | | ); |
| | | const WITH_DIRECTIVES = Symbol( |
| | | const WITH_DIRECTIVES = /* @__PURE__ */ Symbol( |
| | | `withDirectives` |
| | | ); |
| | | const RENDER_LIST = Symbol(`renderList` ); |
| | | const RENDER_SLOT = Symbol(`renderSlot` ); |
| | | const CREATE_SLOTS = Symbol(`createSlots` ); |
| | | const TO_DISPLAY_STRING = Symbol( |
| | | const RENDER_LIST = /* @__PURE__ */ Symbol(`renderList` ); |
| | | const RENDER_SLOT = /* @__PURE__ */ Symbol(`renderSlot` ); |
| | | const CREATE_SLOTS = /* @__PURE__ */ Symbol(`createSlots` ); |
| | | const TO_DISPLAY_STRING = /* @__PURE__ */ Symbol( |
| | | `toDisplayString` |
| | | ); |
| | | const MERGE_PROPS = Symbol(`mergeProps` ); |
| | | const NORMALIZE_CLASS = Symbol( |
| | | const MERGE_PROPS = /* @__PURE__ */ Symbol(`mergeProps` ); |
| | | const NORMALIZE_CLASS = /* @__PURE__ */ Symbol( |
| | | `normalizeClass` |
| | | ); |
| | | const NORMALIZE_STYLE = Symbol( |
| | | const NORMALIZE_STYLE = /* @__PURE__ */ Symbol( |
| | | `normalizeStyle` |
| | | ); |
| | | const NORMALIZE_PROPS = Symbol( |
| | | const NORMALIZE_PROPS = /* @__PURE__ */ Symbol( |
| | | `normalizeProps` |
| | | ); |
| | | const GUARD_REACTIVE_PROPS = Symbol( |
| | | const GUARD_REACTIVE_PROPS = /* @__PURE__ */ Symbol( |
| | | `guardReactiveProps` |
| | | ); |
| | | const TO_HANDLERS = Symbol(`toHandlers` ); |
| | | const CAMELIZE = Symbol(`camelize` ); |
| | | const CAPITALIZE = Symbol(`capitalize` ); |
| | | const TO_HANDLER_KEY = Symbol( |
| | | const TO_HANDLERS = /* @__PURE__ */ Symbol(`toHandlers` ); |
| | | const CAMELIZE = /* @__PURE__ */ Symbol(`camelize` ); |
| | | const CAPITALIZE = /* @__PURE__ */ Symbol(`capitalize` ); |
| | | const TO_HANDLER_KEY = /* @__PURE__ */ Symbol( |
| | | `toHandlerKey` |
| | | ); |
| | | const SET_BLOCK_TRACKING = Symbol( |
| | | const SET_BLOCK_TRACKING = /* @__PURE__ */ Symbol( |
| | | `setBlockTracking` |
| | | ); |
| | | const PUSH_SCOPE_ID = Symbol(`pushScopeId` ); |
| | | const POP_SCOPE_ID = Symbol(`popScopeId` ); |
| | | const WITH_CTX = Symbol(`withCtx` ); |
| | | const UNREF = Symbol(`unref` ); |
| | | const IS_REF = Symbol(`isRef` ); |
| | | const WITH_MEMO = Symbol(`withMemo` ); |
| | | const IS_MEMO_SAME = Symbol(`isMemoSame` ); |
| | | const PUSH_SCOPE_ID = /* @__PURE__ */ Symbol(`pushScopeId` ); |
| | | const POP_SCOPE_ID = /* @__PURE__ */ Symbol(`popScopeId` ); |
| | | const WITH_CTX = /* @__PURE__ */ Symbol(`withCtx` ); |
| | | const UNREF = /* @__PURE__ */ Symbol(`unref` ); |
| | | const IS_REF = /* @__PURE__ */ Symbol(`isRef` ); |
| | | const WITH_MEMO = /* @__PURE__ */ Symbol(`withMemo` ); |
| | | const IS_MEMO_SAME = /* @__PURE__ */ Symbol(`isMemoSame` ); |
| | | const helperNameMap = { |
| | | [FRAGMENT]: `Fragment`, |
| | | [TELEPORT]: `Teleport`, |
| | |
| | | } |
| | | } |
| | | |
| | | // Generated using scripts/write-decode-map.ts |
| | | var htmlDecodeTree = new Uint16Array( |
| | | // prettier-ignore |
| | | "\u1d41<\xd5\u0131\u028a\u049d\u057b\u05d0\u0675\u06de\u07a2\u07d6\u080f\u0a4a\u0a91\u0da1\u0e6d\u0f09\u0f26\u10ca\u1228\u12e1\u1415\u149d\u14c3\u14df\u1525\0\0\0\0\0\0\u156b\u16cd\u198d\u1c12\u1ddd\u1f7e\u2060\u21b0\u228d\u23c0\u23fb\u2442\u2824\u2912\u2d08\u2e48\u2fce\u3016\u32ba\u3639\u37ac\u38fe\u3a28\u3a71\u3ae0\u3b2e\u0800EMabcfglmnoprstu\\bfms\x7f\x84\x8b\x90\x95\x98\xa6\xb3\xb9\xc8\xcflig\u803b\xc6\u40c6P\u803b&\u4026cute\u803b\xc1\u40c1reve;\u4102\u0100iyx}rc\u803b\xc2\u40c2;\u4410r;\uc000\ud835\udd04rave\u803b\xc0\u40c0pha;\u4391acr;\u4100d;\u6a53\u0100gp\x9d\xa1on;\u4104f;\uc000\ud835\udd38plyFunction;\u6061ing\u803b\xc5\u40c5\u0100cs\xbe\xc3r;\uc000\ud835\udc9cign;\u6254ilde\u803b\xc3\u40c3ml\u803b\xc4\u40c4\u0400aceforsu\xe5\xfb\xfe\u0117\u011c\u0122\u0127\u012a\u0100cr\xea\xf2kslash;\u6216\u0176\xf6\xf8;\u6ae7ed;\u6306y;\u4411\u0180crt\u0105\u010b\u0114ause;\u6235noullis;\u612ca;\u4392r;\uc000\ud835\udd05pf;\uc000\ud835\udd39eve;\u42d8c\xf2\u0113mpeq;\u624e\u0700HOacdefhilorsu\u014d\u0151\u0156\u0180\u019e\u01a2\u01b5\u01b7\u01ba\u01dc\u0215\u0273\u0278\u027ecy;\u4427PY\u803b\xa9\u40a9\u0180cpy\u015d\u0162\u017aute;\u4106\u0100;i\u0167\u0168\u62d2talDifferentialD;\u6145leys;\u612d\u0200aeio\u0189\u018e\u0194\u0198ron;\u410cdil\u803b\xc7\u40c7rc;\u4108nint;\u6230ot;\u410a\u0100dn\u01a7\u01adilla;\u40b8terDot;\u40b7\xf2\u017fi;\u43a7rcle\u0200DMPT\u01c7\u01cb\u01d1\u01d6ot;\u6299inus;\u6296lus;\u6295imes;\u6297o\u0100cs\u01e2\u01f8kwiseContourIntegral;\u6232eCurly\u0100DQ\u0203\u020foubleQuote;\u601duote;\u6019\u0200lnpu\u021e\u0228\u0247\u0255on\u0100;e\u0225\u0226\u6237;\u6a74\u0180git\u022f\u0236\u023aruent;\u6261nt;\u622fourIntegral;\u622e\u0100fr\u024c\u024e;\u6102oduct;\u6210nterClockwiseContourIntegral;\u6233oss;\u6a2fcr;\uc000\ud835\udc9ep\u0100;C\u0284\u0285\u62d3ap;\u624d\u0580DJSZacefios\u02a0\u02ac\u02b0\u02b4\u02b8\u02cb\u02d7\u02e1\u02e6\u0333\u048d\u0100;o\u0179\u02a5trahd;\u6911cy;\u4402cy;\u4405cy;\u440f\u0180grs\u02bf\u02c4\u02c7ger;\u6021r;\u61a1hv;\u6ae4\u0100ay\u02d0\u02d5ron;\u410e;\u4414l\u0100;t\u02dd\u02de\u6207a;\u4394r;\uc000\ud835\udd07\u0100af\u02eb\u0327\u0100cm\u02f0\u0322ritical\u0200ADGT\u0300\u0306\u0316\u031ccute;\u40b4o\u0174\u030b\u030d;\u42d9bleAcute;\u42ddrave;\u4060ilde;\u42dcond;\u62c4ferentialD;\u6146\u0470\u033d\0\0\0\u0342\u0354\0\u0405f;\uc000\ud835\udd3b\u0180;DE\u0348\u0349\u034d\u40a8ot;\u60dcqual;\u6250ble\u0300CDLRUV\u0363\u0372\u0382\u03cf\u03e2\u03f8ontourIntegra\xec\u0239o\u0274\u0379\0\0\u037b\xbb\u0349nArrow;\u61d3\u0100eo\u0387\u03a4ft\u0180ART\u0390\u0396\u03a1rrow;\u61d0ightArrow;\u61d4e\xe5\u02cang\u0100LR\u03ab\u03c4eft\u0100AR\u03b3\u03b9rrow;\u67f8ightArrow;\u67faightArrow;\u67f9ight\u0100AT\u03d8\u03derrow;\u61d2ee;\u62a8p\u0241\u03e9\0\0\u03efrrow;\u61d1ownArrow;\u61d5erticalBar;\u6225n\u0300ABLRTa\u0412\u042a\u0430\u045e\u047f\u037crrow\u0180;BU\u041d\u041e\u0422\u6193ar;\u6913pArrow;\u61f5reve;\u4311eft\u02d2\u043a\0\u0446\0\u0450ightVector;\u6950eeVector;\u695eector\u0100;B\u0459\u045a\u61bdar;\u6956ight\u01d4\u0467\0\u0471eeVector;\u695fector\u0100;B\u047a\u047b\u61c1ar;\u6957ee\u0100;A\u0486\u0487\u62a4rrow;\u61a7\u0100ct\u0492\u0497r;\uc000\ud835\udc9frok;\u4110\u0800NTacdfglmopqstux\u04bd\u04c0\u04c4\u04cb\u04de\u04e2\u04e7\u04ee\u04f5\u0521\u052f\u0536\u0552\u055d\u0560\u0565G;\u414aH\u803b\xd0\u40d0cute\u803b\xc9\u40c9\u0180aiy\u04d2\u04d7\u04dcron;\u411arc\u803b\xca\u40ca;\u442dot;\u4116r;\uc000\ud835\udd08rave\u803b\xc8\u40c8ement;\u6208\u0100ap\u04fa\u04fecr;\u4112ty\u0253\u0506\0\0\u0512mallSquare;\u65fberySmallSquare;\u65ab\u0100gp\u0526\u052aon;\u4118f;\uc000\ud835\udd3csilon;\u4395u\u0100ai\u053c\u0549l\u0100;T\u0542\u0543\u6a75ilde;\u6242librium;\u61cc\u0100ci\u0557\u055ar;\u6130m;\u6a73a;\u4397ml\u803b\xcb\u40cb\u0100ip\u056a\u056fsts;\u6203onentialE;\u6147\u0280cfios\u0585\u0588\u058d\u05b2\u05ccy;\u4424r;\uc000\ud835\udd09lled\u0253\u0597\0\0\u05a3mallSquare;\u65fcerySmallSquare;\u65aa\u0370\u05ba\0\u05bf\0\0\u05c4f;\uc000\ud835\udd3dAll;\u6200riertrf;\u6131c\xf2\u05cb\u0600JTabcdfgorst\u05e8\u05ec\u05ef\u05fa\u0600\u0612\u0616\u061b\u061d\u0623\u066c\u0672cy;\u4403\u803b>\u403emma\u0100;d\u05f7\u05f8\u4393;\u43dcreve;\u411e\u0180eiy\u0607\u060c\u0610dil;\u4122rc;\u411c;\u4413ot;\u4120r;\uc000\ud835\udd0a;\u62d9pf;\uc000\ud835\udd3eeater\u0300EFGLST\u0635\u0644\u064e\u0656\u065b\u0666qual\u0100;L\u063e\u063f\u6265ess;\u62dbullEqual;\u6267reater;\u6aa2ess;\u6277lantEqual;\u6a7eilde;\u6273cr;\uc000\ud835\udca2;\u626b\u0400Aacfiosu\u0685\u068b\u0696\u069b\u069e\u06aa\u06be\u06caRDcy;\u442a\u0100ct\u0690\u0694ek;\u42c7;\u405eirc;\u4124r;\u610clbertSpace;\u610b\u01f0\u06af\0\u06b2f;\u610dizontalLine;\u6500\u0100ct\u06c3\u06c5\xf2\u06a9rok;\u4126mp\u0144\u06d0\u06d8ownHum\xf0\u012fqual;\u624f\u0700EJOacdfgmnostu\u06fa\u06fe\u0703\u0707\u070e\u071a\u071e\u0721\u0728\u0744\u0778\u078b\u078f\u0795cy;\u4415lig;\u4132cy;\u4401cute\u803b\xcd\u40cd\u0100iy\u0713\u0718rc\u803b\xce\u40ce;\u4418ot;\u4130r;\u6111rave\u803b\xcc\u40cc\u0180;ap\u0720\u072f\u073f\u0100cg\u0734\u0737r;\u412ainaryI;\u6148lie\xf3\u03dd\u01f4\u0749\0\u0762\u0100;e\u074d\u074e\u622c\u0100gr\u0753\u0758ral;\u622bsection;\u62c2isible\u0100CT\u076c\u0772omma;\u6063imes;\u6062\u0180gpt\u077f\u0783\u0788on;\u412ef;\uc000\ud835\udd40a;\u4399cr;\u6110ilde;\u4128\u01eb\u079a\0\u079ecy;\u4406l\u803b\xcf\u40cf\u0280cfosu\u07ac\u07b7\u07bc\u07c2\u07d0\u0100iy\u07b1\u07b5rc;\u4134;\u4419r;\uc000\ud835\udd0dpf;\uc000\ud835\udd41\u01e3\u07c7\0\u07ccr;\uc000\ud835\udca5rcy;\u4408kcy;\u4404\u0380HJacfos\u07e4\u07e8\u07ec\u07f1\u07fd\u0802\u0808cy;\u4425cy;\u440cppa;\u439a\u0100ey\u07f6\u07fbdil;\u4136;\u441ar;\uc000\ud835\udd0epf;\uc000\ud835\udd42cr;\uc000\ud835\udca6\u0580JTaceflmost\u0825\u0829\u082c\u0850\u0863\u09b3\u09b8\u09c7\u09cd\u0a37\u0a47cy;\u4409\u803b<\u403c\u0280cmnpr\u0837\u083c\u0841\u0844\u084dute;\u4139bda;\u439bg;\u67ealacetrf;\u6112r;\u619e\u0180aey\u0857\u085c\u0861ron;\u413ddil;\u413b;\u441b\u0100fs\u0868\u0970t\u0500ACDFRTUVar\u087e\u08a9\u08b1\u08e0\u08e6\u08fc\u092f\u095b\u0390\u096a\u0100nr\u0883\u088fgleBracket;\u67e8row\u0180;BR\u0899\u089a\u089e\u6190ar;\u61e4ightArrow;\u61c6eiling;\u6308o\u01f5\u08b7\0\u08c3bleBracket;\u67e6n\u01d4\u08c8\0\u08d2eeVector;\u6961ector\u0100;B\u08db\u08dc\u61c3ar;\u6959loor;\u630aight\u0100AV\u08ef\u08f5rrow;\u6194ector;\u694e\u0100er\u0901\u0917e\u0180;AV\u0909\u090a\u0910\u62a3rrow;\u61a4ector;\u695aiangle\u0180;BE\u0924\u0925\u0929\u62b2ar;\u69cfqual;\u62b4p\u0180DTV\u0937\u0942\u094cownVector;\u6951eeVector;\u6960ector\u0100;B\u0956\u0957\u61bfar;\u6958ector\u0100;B\u0965\u0966\u61bcar;\u6952ight\xe1\u039cs\u0300EFGLST\u097e\u098b\u0995\u099d\u09a2\u09adqualGreater;\u62daullEqual;\u6266reater;\u6276ess;\u6aa1lantEqual;\u6a7dilde;\u6272r;\uc000\ud835\udd0f\u0100;e\u09bd\u09be\u62d8ftarrow;\u61daidot;\u413f\u0180npw\u09d4\u0a16\u0a1bg\u0200LRlr\u09de\u09f7\u0a02\u0a10eft\u0100AR\u09e6\u09ecrrow;\u67f5ightArrow;\u67f7ightArrow;\u67f6eft\u0100ar\u03b3\u0a0aight\xe1\u03bfight\xe1\u03caf;\uc000\ud835\udd43er\u0100LR\u0a22\u0a2ceftArrow;\u6199ightArrow;\u6198\u0180cht\u0a3e\u0a40\u0a42\xf2\u084c;\u61b0rok;\u4141;\u626a\u0400acefiosu\u0a5a\u0a5d\u0a60\u0a77\u0a7c\u0a85\u0a8b\u0a8ep;\u6905y;\u441c\u0100dl\u0a65\u0a6fiumSpace;\u605flintrf;\u6133r;\uc000\ud835\udd10nusPlus;\u6213pf;\uc000\ud835\udd44c\xf2\u0a76;\u439c\u0480Jacefostu\u0aa3\u0aa7\u0aad\u0ac0\u0b14\u0b19\u0d91\u0d97\u0d9ecy;\u440acute;\u4143\u0180aey\u0ab4\u0ab9\u0aberon;\u4147dil;\u4145;\u441d\u0180gsw\u0ac7\u0af0\u0b0eative\u0180MTV\u0ad3\u0adf\u0ae8ediumSpace;\u600bhi\u0100cn\u0ae6\u0ad8\xeb\u0ad9eryThi\xee\u0ad9ted\u0100GL\u0af8\u0b06reaterGreate\xf2\u0673essLes\xf3\u0a48Line;\u400ar;\uc000\ud835\udd11\u0200Bnpt\u0b22\u0b28\u0b37\u0b3areak;\u6060BreakingSpace;\u40a0f;\u6115\u0680;CDEGHLNPRSTV\u0b55\u0b56\u0b6a\u0b7c\u0ba1\u0beb\u0c04\u0c5e\u0c84\u0ca6\u0cd8\u0d61\u0d85\u6aec\u0100ou\u0b5b\u0b64ngruent;\u6262pCap;\u626doubleVerticalBar;\u6226\u0180lqx\u0b83\u0b8a\u0b9bement;\u6209ual\u0100;T\u0b92\u0b93\u6260ilde;\uc000\u2242\u0338ists;\u6204reater\u0380;EFGLST\u0bb6\u0bb7\u0bbd\u0bc9\u0bd3\u0bd8\u0be5\u626fqual;\u6271ullEqual;\uc000\u2267\u0338reater;\uc000\u226b\u0338ess;\u6279lantEqual;\uc000\u2a7e\u0338ilde;\u6275ump\u0144\u0bf2\u0bfdownHump;\uc000\u224e\u0338qual;\uc000\u224f\u0338e\u0100fs\u0c0a\u0c27tTriangle\u0180;BE\u0c1a\u0c1b\u0c21\u62eaar;\uc000\u29cf\u0338qual;\u62ecs\u0300;EGLST\u0c35\u0c36\u0c3c\u0c44\u0c4b\u0c58\u626equal;\u6270reater;\u6278ess;\uc000\u226a\u0338lantEqual;\uc000\u2a7d\u0338ilde;\u6274ested\u0100GL\u0c68\u0c79reaterGreater;\uc000\u2aa2\u0338essLess;\uc000\u2aa1\u0338recedes\u0180;ES\u0c92\u0c93\u0c9b\u6280qual;\uc000\u2aaf\u0338lantEqual;\u62e0\u0100ei\u0cab\u0cb9verseElement;\u620cghtTriangle\u0180;BE\u0ccb\u0ccc\u0cd2\u62ebar;\uc000\u29d0\u0338qual;\u62ed\u0100qu\u0cdd\u0d0cuareSu\u0100bp\u0ce8\u0cf9set\u0100;E\u0cf0\u0cf3\uc000\u228f\u0338qual;\u62e2erset\u0100;E\u0d03\u0d06\uc000\u2290\u0338qual;\u62e3\u0180bcp\u0d13\u0d24\u0d4eset\u0100;E\u0d1b\u0d1e\uc000\u2282\u20d2qual;\u6288ceeds\u0200;EST\u0d32\u0d33\u0d3b\u0d46\u6281qual;\uc000\u2ab0\u0338lantEqual;\u62e1ilde;\uc000\u227f\u0338erset\u0100;E\u0d58\u0d5b\uc000\u2283\u20d2qual;\u6289ilde\u0200;EFT\u0d6e\u0d6f\u0d75\u0d7f\u6241qual;\u6244ullEqual;\u6247ilde;\u6249erticalBar;\u6224cr;\uc000\ud835\udca9ilde\u803b\xd1\u40d1;\u439d\u0700Eacdfgmoprstuv\u0dbd\u0dc2\u0dc9\u0dd5\u0ddb\u0de0\u0de7\u0dfc\u0e02\u0e20\u0e22\u0e32\u0e3f\u0e44lig;\u4152cute\u803b\xd3\u40d3\u0100iy\u0dce\u0dd3rc\u803b\xd4\u40d4;\u441eblac;\u4150r;\uc000\ud835\udd12rave\u803b\xd2\u40d2\u0180aei\u0dee\u0df2\u0df6cr;\u414cga;\u43a9cron;\u439fpf;\uc000\ud835\udd46enCurly\u0100DQ\u0e0e\u0e1aoubleQuote;\u601cuote;\u6018;\u6a54\u0100cl\u0e27\u0e2cr;\uc000\ud835\udcaaash\u803b\xd8\u40d8i\u016c\u0e37\u0e3cde\u803b\xd5\u40d5es;\u6a37ml\u803b\xd6\u40d6er\u0100BP\u0e4b\u0e60\u0100ar\u0e50\u0e53r;\u603eac\u0100ek\u0e5a\u0e5c;\u63deet;\u63b4arenthesis;\u63dc\u0480acfhilors\u0e7f\u0e87\u0e8a\u0e8f\u0e92\u0e94\u0e9d\u0eb0\u0efcrtialD;\u6202y;\u441fr;\uc000\ud835\udd13i;\u43a6;\u43a0usMinus;\u40b1\u0100ip\u0ea2\u0eadncareplan\xe5\u069df;\u6119\u0200;eio\u0eb9\u0eba\u0ee0\u0ee4\u6abbcedes\u0200;EST\u0ec8\u0ec9\u0ecf\u0eda\u627aqual;\u6aaflantEqual;\u627cilde;\u627eme;\u6033\u0100dp\u0ee9\u0eeeuct;\u620fortion\u0100;a\u0225\u0ef9l;\u621d\u0100ci\u0f01\u0f06r;\uc000\ud835\udcab;\u43a8\u0200Ufos\u0f11\u0f16\u0f1b\u0f1fOT\u803b\"\u4022r;\uc000\ud835\udd14pf;\u611acr;\uc000\ud835\udcac\u0600BEacefhiorsu\u0f3e\u0f43\u0f47\u0f60\u0f73\u0fa7\u0faa\u0fad\u1096\u10a9\u10b4\u10bearr;\u6910G\u803b\xae\u40ae\u0180cnr\u0f4e\u0f53\u0f56ute;\u4154g;\u67ebr\u0100;t\u0f5c\u0f5d\u61a0l;\u6916\u0180aey\u0f67\u0f6c\u0f71ron;\u4158dil;\u4156;\u4420\u0100;v\u0f78\u0f79\u611cerse\u0100EU\u0f82\u0f99\u0100lq\u0f87\u0f8eement;\u620builibrium;\u61cbpEquilibrium;\u696fr\xbb\u0f79o;\u43a1ght\u0400ACDFTUVa\u0fc1\u0feb\u0ff3\u1022\u1028\u105b\u1087\u03d8\u0100nr\u0fc6\u0fd2gleBracket;\u67e9row\u0180;BL\u0fdc\u0fdd\u0fe1\u6192ar;\u61e5eftArrow;\u61c4eiling;\u6309o\u01f5\u0ff9\0\u1005bleBracket;\u67e7n\u01d4\u100a\0\u1014eeVector;\u695dector\u0100;B\u101d\u101e\u61c2ar;\u6955loor;\u630b\u0100er\u102d\u1043e\u0180;AV\u1035\u1036\u103c\u62a2rrow;\u61a6ector;\u695biangle\u0180;BE\u1050\u1051\u1055\u62b3ar;\u69d0qual;\u62b5p\u0180DTV\u1063\u106e\u1078ownVector;\u694feeVector;\u695cector\u0100;B\u1082\u1083\u61bear;\u6954ector\u0100;B\u1091\u1092\u61c0ar;\u6953\u0100pu\u109b\u109ef;\u611dndImplies;\u6970ightarrow;\u61db\u0100ch\u10b9\u10bcr;\u611b;\u61b1leDelayed;\u69f4\u0680HOacfhimoqstu\u10e4\u10f1\u10f7\u10fd\u1119\u111e\u1151\u1156\u1161\u1167\u11b5\u11bb\u11bf\u0100Cc\u10e9\u10eeHcy;\u4429y;\u4428FTcy;\u442ccute;\u415a\u0280;aeiy\u1108\u1109\u110e\u1113\u1117\u6abcron;\u4160dil;\u415erc;\u415c;\u4421r;\uc000\ud835\udd16ort\u0200DLRU\u112a\u1134\u113e\u1149ownArrow\xbb\u041eeftArrow\xbb\u089aightArrow\xbb\u0fddpArrow;\u6191gma;\u43a3allCircle;\u6218pf;\uc000\ud835\udd4a\u0272\u116d\0\0\u1170t;\u621aare\u0200;ISU\u117b\u117c\u1189\u11af\u65a1ntersection;\u6293u\u0100bp\u118f\u119eset\u0100;E\u1197\u1198\u628fqual;\u6291erset\u0100;E\u11a8\u11a9\u6290qual;\u6292nion;\u6294cr;\uc000\ud835\udcaear;\u62c6\u0200bcmp\u11c8\u11db\u1209\u120b\u0100;s\u11cd\u11ce\u62d0et\u0100;E\u11cd\u11d5qual;\u6286\u0100ch\u11e0\u1205eeds\u0200;EST\u11ed\u11ee\u11f4\u11ff\u627bqual;\u6ab0lantEqual;\u627dilde;\u627fTh\xe1\u0f8c;\u6211\u0180;es\u1212\u1213\u1223\u62d1rset\u0100;E\u121c\u121d\u6283qual;\u6287et\xbb\u1213\u0580HRSacfhiors\u123e\u1244\u1249\u1255\u125e\u1271\u1276\u129f\u12c2\u12c8\u12d1ORN\u803b\xde\u40deADE;\u6122\u0100Hc\u124e\u1252cy;\u440by;\u4426\u0100bu\u125a\u125c;\u4009;\u43a4\u0180aey\u1265\u126a\u126fron;\u4164dil;\u4162;\u4422r;\uc000\ud835\udd17\u0100ei\u127b\u1289\u01f2\u1280\0\u1287efore;\u6234a;\u4398\u0100cn\u128e\u1298kSpace;\uc000\u205f\u200aSpace;\u6009lde\u0200;EFT\u12ab\u12ac\u12b2\u12bc\u623cqual;\u6243ullEqual;\u6245ilde;\u6248pf;\uc000\ud835\udd4bipleDot;\u60db\u0100ct\u12d6\u12dbr;\uc000\ud835\udcafrok;\u4166\u0ae1\u12f7\u130e\u131a\u1326\0\u132c\u1331\0\0\0\0\0\u1338\u133d\u1377\u1385\0\u13ff\u1404\u140a\u1410\u0100cr\u12fb\u1301ute\u803b\xda\u40dar\u0100;o\u1307\u1308\u619fcir;\u6949r\u01e3\u1313\0\u1316y;\u440eve;\u416c\u0100iy\u131e\u1323rc\u803b\xdb\u40db;\u4423blac;\u4170r;\uc000\ud835\udd18rave\u803b\xd9\u40d9acr;\u416a\u0100di\u1341\u1369er\u0100BP\u1348\u135d\u0100ar\u134d\u1350r;\u405fac\u0100ek\u1357\u1359;\u63dfet;\u63b5arenthesis;\u63ddon\u0100;P\u1370\u1371\u62c3lus;\u628e\u0100gp\u137b\u137fon;\u4172f;\uc000\ud835\udd4c\u0400ADETadps\u1395\u13ae\u13b8\u13c4\u03e8\u13d2\u13d7\u13f3rrow\u0180;BD\u1150\u13a0\u13a4ar;\u6912ownArrow;\u61c5ownArrow;\u6195quilibrium;\u696eee\u0100;A\u13cb\u13cc\u62a5rrow;\u61a5own\xe1\u03f3er\u0100LR\u13de\u13e8eftArrow;\u6196ightArrow;\u6197i\u0100;l\u13f9\u13fa\u43d2on;\u43a5ing;\u416ecr;\uc000\ud835\udcb0ilde;\u4168ml\u803b\xdc\u40dc\u0480Dbcdefosv\u1427\u142c\u1430\u1433\u143e\u1485\u148a\u1490\u1496ash;\u62abar;\u6aeby;\u4412ash\u0100;l\u143b\u143c\u62a9;\u6ae6\u0100er\u1443\u1445;\u62c1\u0180bty\u144c\u1450\u147aar;\u6016\u0100;i\u144f\u1455cal\u0200BLST\u1461\u1465\u146a\u1474ar;\u6223ine;\u407ceparator;\u6758ilde;\u6240ThinSpace;\u600ar;\uc000\ud835\udd19pf;\uc000\ud835\udd4dcr;\uc000\ud835\udcb1dash;\u62aa\u0280cefos\u14a7\u14ac\u14b1\u14b6\u14bcirc;\u4174dge;\u62c0r;\uc000\ud835\udd1apf;\uc000\ud835\udd4ecr;\uc000\ud835\udcb2\u0200fios\u14cb\u14d0\u14d2\u14d8r;\uc000\ud835\udd1b;\u439epf;\uc000\ud835\udd4fcr;\uc000\ud835\udcb3\u0480AIUacfosu\u14f1\u14f5\u14f9\u14fd\u1504\u150f\u1514\u151a\u1520cy;\u442fcy;\u4407cy;\u442ecute\u803b\xdd\u40dd\u0100iy\u1509\u150drc;\u4176;\u442br;\uc000\ud835\udd1cpf;\uc000\ud835\udd50cr;\uc000\ud835\udcb4ml;\u4178\u0400Hacdefos\u1535\u1539\u153f\u154b\u154f\u155d\u1560\u1564cy;\u4416cute;\u4179\u0100ay\u1544\u1549ron;\u417d;\u4417ot;\u417b\u01f2\u1554\0\u155boWidt\xe8\u0ad9a;\u4396r;\u6128pf;\u6124cr;\uc000\ud835\udcb5\u0be1\u1583\u158a\u1590\0\u15b0\u15b6\u15bf\0\0\0\0\u15c6\u15db\u15eb\u165f\u166d\0\u1695\u169b\u16b2\u16b9\0\u16becute\u803b\xe1\u40e1reve;\u4103\u0300;Ediuy\u159c\u159d\u15a1\u15a3\u15a8\u15ad\u623e;\uc000\u223e\u0333;\u623frc\u803b\xe2\u40e2te\u80bb\xb4\u0306;\u4430lig\u803b\xe6\u40e6\u0100;r\xb2\u15ba;\uc000\ud835\udd1erave\u803b\xe0\u40e0\u0100ep\u15ca\u15d6\u0100fp\u15cf\u15d4sym;\u6135\xe8\u15d3ha;\u43b1\u0100ap\u15dfc\u0100cl\u15e4\u15e7r;\u4101g;\u6a3f\u0264\u15f0\0\0\u160a\u0280;adsv\u15fa\u15fb\u15ff\u1601\u1607\u6227nd;\u6a55;\u6a5clope;\u6a58;\u6a5a\u0380;elmrsz\u1618\u1619\u161b\u161e\u163f\u164f\u1659\u6220;\u69a4e\xbb\u1619sd\u0100;a\u1625\u1626\u6221\u0461\u1630\u1632\u1634\u1636\u1638\u163a\u163c\u163e;\u69a8;\u69a9;\u69aa;\u69ab;\u69ac;\u69ad;\u69ae;\u69aft\u0100;v\u1645\u1646\u621fb\u0100;d\u164c\u164d\u62be;\u699d\u0100pt\u1654\u1657h;\u6222\xbb\xb9arr;\u637c\u0100gp\u1663\u1667on;\u4105f;\uc000\ud835\udd52\u0380;Eaeiop\u12c1\u167b\u167d\u1682\u1684\u1687\u168a;\u6a70cir;\u6a6f;\u624ad;\u624bs;\u4027rox\u0100;e\u12c1\u1692\xf1\u1683ing\u803b\xe5\u40e5\u0180cty\u16a1\u16a6\u16a8r;\uc000\ud835\udcb6;\u402amp\u0100;e\u12c1\u16af\xf1\u0288ilde\u803b\xe3\u40e3ml\u803b\xe4\u40e4\u0100ci\u16c2\u16c8onin\xf4\u0272nt;\u6a11\u0800Nabcdefiklnoprsu\u16ed\u16f1\u1730\u173c\u1743\u1748\u1778\u177d\u17e0\u17e6\u1839\u1850\u170d\u193d\u1948\u1970ot;\u6aed\u0100cr\u16f6\u171ek\u0200ceps\u1700\u1705\u170d\u1713ong;\u624cpsilon;\u43f6rime;\u6035im\u0100;e\u171a\u171b\u623dq;\u62cd\u0176\u1722\u1726ee;\u62bded\u0100;g\u172c\u172d\u6305e\xbb\u172drk\u0100;t\u135c\u1737brk;\u63b6\u0100oy\u1701\u1741;\u4431quo;\u601e\u0280cmprt\u1753\u175b\u1761\u1764\u1768aus\u0100;e\u010a\u0109ptyv;\u69b0s\xe9\u170cno\xf5\u0113\u0180ahw\u176f\u1771\u1773;\u43b2;\u6136een;\u626cr;\uc000\ud835\udd1fg\u0380costuvw\u178d\u179d\u17b3\u17c1\u17d5\u17db\u17de\u0180aiu\u1794\u1796\u179a\xf0\u0760rc;\u65efp\xbb\u1371\u0180dpt\u17a4\u17a8\u17adot;\u6a00lus;\u6a01imes;\u6a02\u0271\u17b9\0\0\u17becup;\u6a06ar;\u6605riangle\u0100du\u17cd\u17d2own;\u65bdp;\u65b3plus;\u6a04e\xe5\u1444\xe5\u14adarow;\u690d\u0180ako\u17ed\u1826\u1835\u0100cn\u17f2\u1823k\u0180lst\u17fa\u05ab\u1802ozenge;\u69ebriangle\u0200;dlr\u1812\u1813\u1818\u181d\u65b4own;\u65beeft;\u65c2ight;\u65b8k;\u6423\u01b1\u182b\0\u1833\u01b2\u182f\0\u1831;\u6592;\u65914;\u6593ck;\u6588\u0100eo\u183e\u184d\u0100;q\u1843\u1846\uc000=\u20e5uiv;\uc000\u2261\u20e5t;\u6310\u0200ptwx\u1859\u185e\u1867\u186cf;\uc000\ud835\udd53\u0100;t\u13cb\u1863om\xbb\u13cctie;\u62c8\u0600DHUVbdhmptuv\u1885\u1896\u18aa\u18bb\u18d7\u18db\u18ec\u18ff\u1905\u190a\u1910\u1921\u0200LRlr\u188e\u1890\u1892\u1894;\u6557;\u6554;\u6556;\u6553\u0280;DUdu\u18a1\u18a2\u18a4\u18a6\u18a8\u6550;\u6566;\u6569;\u6564;\u6567\u0200LRlr\u18b3\u18b5\u18b7\u18b9;\u655d;\u655a;\u655c;\u6559\u0380;HLRhlr\u18ca\u18cb\u18cd\u18cf\u18d1\u18d3\u18d5\u6551;\u656c;\u6563;\u6560;\u656b;\u6562;\u655fox;\u69c9\u0200LRlr\u18e4\u18e6\u18e8\u18ea;\u6555;\u6552;\u6510;\u650c\u0280;DUdu\u06bd\u18f7\u18f9\u18fb\u18fd;\u6565;\u6568;\u652c;\u6534inus;\u629flus;\u629eimes;\u62a0\u0200LRlr\u1919\u191b\u191d\u191f;\u655b;\u6558;\u6518;\u6514\u0380;HLRhlr\u1930\u1931\u1933\u1935\u1937\u1939\u193b\u6502;\u656a;\u6561;\u655e;\u653c;\u6524;\u651c\u0100ev\u0123\u1942bar\u803b\xa6\u40a6\u0200ceio\u1951\u1956\u195a\u1960r;\uc000\ud835\udcb7mi;\u604fm\u0100;e\u171a\u171cl\u0180;bh\u1968\u1969\u196b\u405c;\u69c5sub;\u67c8\u016c\u1974\u197el\u0100;e\u1979\u197a\u6022t\xbb\u197ap\u0180;Ee\u012f\u1985\u1987;\u6aae\u0100;q\u06dc\u06db\u0ce1\u19a7\0\u19e8\u1a11\u1a15\u1a32\0\u1a37\u1a50\0\0\u1ab4\0\0\u1ac1\0\0\u1b21\u1b2e\u1b4d\u1b52\0\u1bfd\0\u1c0c\u0180cpr\u19ad\u19b2\u19ddute;\u4107\u0300;abcds\u19bf\u19c0\u19c4\u19ca\u19d5\u19d9\u6229nd;\u6a44rcup;\u6a49\u0100au\u19cf\u19d2p;\u6a4bp;\u6a47ot;\u6a40;\uc000\u2229\ufe00\u0100eo\u19e2\u19e5t;\u6041\xee\u0693\u0200aeiu\u19f0\u19fb\u1a01\u1a05\u01f0\u19f5\0\u19f8s;\u6a4don;\u410ddil\u803b\xe7\u40e7rc;\u4109ps\u0100;s\u1a0c\u1a0d\u6a4cm;\u6a50ot;\u410b\u0180dmn\u1a1b\u1a20\u1a26il\u80bb\xb8\u01adptyv;\u69b2t\u8100\xa2;e\u1a2d\u1a2e\u40a2r\xe4\u01b2r;\uc000\ud835\udd20\u0180cei\u1a3d\u1a40\u1a4dy;\u4447ck\u0100;m\u1a47\u1a48\u6713ark\xbb\u1a48;\u43c7r\u0380;Ecefms\u1a5f\u1a60\u1a62\u1a6b\u1aa4\u1aaa\u1aae\u65cb;\u69c3\u0180;el\u1a69\u1a6a\u1a6d\u42c6q;\u6257e\u0261\u1a74\0\0\u1a88rrow\u0100lr\u1a7c\u1a81eft;\u61baight;\u61bb\u0280RSacd\u1a92\u1a94\u1a96\u1a9a\u1a9f\xbb\u0f47;\u64c8st;\u629birc;\u629aash;\u629dnint;\u6a10id;\u6aefcir;\u69c2ubs\u0100;u\u1abb\u1abc\u6663it\xbb\u1abc\u02ec\u1ac7\u1ad4\u1afa\0\u1b0aon\u0100;e\u1acd\u1ace\u403a\u0100;q\xc7\xc6\u026d\u1ad9\0\0\u1ae2a\u0100;t\u1ade\u1adf\u402c;\u4040\u0180;fl\u1ae8\u1ae9\u1aeb\u6201\xee\u1160e\u0100mx\u1af1\u1af6ent\xbb\u1ae9e\xf3\u024d\u01e7\u1afe\0\u1b07\u0100;d\u12bb\u1b02ot;\u6a6dn\xf4\u0246\u0180fry\u1b10\u1b14\u1b17;\uc000\ud835\udd54o\xe4\u0254\u8100\xa9;s\u0155\u1b1dr;\u6117\u0100ao\u1b25\u1b29rr;\u61b5ss;\u6717\u0100cu\u1b32\u1b37r;\uc000\ud835\udcb8\u0100bp\u1b3c\u1b44\u0100;e\u1b41\u1b42\u6acf;\u6ad1\u0100;e\u1b49\u1b4a\u6ad0;\u6ad2dot;\u62ef\u0380delprvw\u1b60\u1b6c\u1b77\u1b82\u1bac\u1bd4\u1bf9arr\u0100lr\u1b68\u1b6a;\u6938;\u6935\u0270\u1b72\0\0\u1b75r;\u62dec;\u62dfarr\u0100;p\u1b7f\u1b80\u61b6;\u693d\u0300;bcdos\u1b8f\u1b90\u1b96\u1ba1\u1ba5\u1ba8\u622arcap;\u6a48\u0100au\u1b9b\u1b9ep;\u6a46p;\u6a4aot;\u628dr;\u6a45;\uc000\u222a\ufe00\u0200alrv\u1bb5\u1bbf\u1bde\u1be3rr\u0100;m\u1bbc\u1bbd\u61b7;\u693cy\u0180evw\u1bc7\u1bd4\u1bd8q\u0270\u1bce\0\0\u1bd2re\xe3\u1b73u\xe3\u1b75ee;\u62ceedge;\u62cfen\u803b\xa4\u40a4earrow\u0100lr\u1bee\u1bf3eft\xbb\u1b80ight\xbb\u1bbde\xe4\u1bdd\u0100ci\u1c01\u1c07onin\xf4\u01f7nt;\u6231lcty;\u632d\u0980AHabcdefhijlorstuwz\u1c38\u1c3b\u1c3f\u1c5d\u1c69\u1c75\u1c8a\u1c9e\u1cac\u1cb7\u1cfb\u1cff\u1d0d\u1d7b\u1d91\u1dab\u1dbb\u1dc6\u1dcdr\xf2\u0381ar;\u6965\u0200glrs\u1c48\u1c4d\u1c52\u1c54ger;\u6020eth;\u6138\xf2\u1133h\u0100;v\u1c5a\u1c5b\u6010\xbb\u090a\u016b\u1c61\u1c67arow;\u690fa\xe3\u0315\u0100ay\u1c6e\u1c73ron;\u410f;\u4434\u0180;ao\u0332\u1c7c\u1c84\u0100gr\u02bf\u1c81r;\u61catseq;\u6a77\u0180glm\u1c91\u1c94\u1c98\u803b\xb0\u40b0ta;\u43b4ptyv;\u69b1\u0100ir\u1ca3\u1ca8sht;\u697f;\uc000\ud835\udd21ar\u0100lr\u1cb3\u1cb5\xbb\u08dc\xbb\u101e\u0280aegsv\u1cc2\u0378\u1cd6\u1cdc\u1ce0m\u0180;os\u0326\u1cca\u1cd4nd\u0100;s\u0326\u1cd1uit;\u6666amma;\u43ddin;\u62f2\u0180;io\u1ce7\u1ce8\u1cf8\u40f7de\u8100\xf7;o\u1ce7\u1cf0ntimes;\u62c7n\xf8\u1cf7cy;\u4452c\u026f\u1d06\0\0\u1d0arn;\u631eop;\u630d\u0280lptuw\u1d18\u1d1d\u1d22\u1d49\u1d55lar;\u4024f;\uc000\ud835\udd55\u0280;emps\u030b\u1d2d\u1d37\u1d3d\u1d42q\u0100;d\u0352\u1d33ot;\u6251inus;\u6238lus;\u6214quare;\u62a1blebarwedg\xe5\xfan\u0180adh\u112e\u1d5d\u1d67ownarrow\xf3\u1c83arpoon\u0100lr\u1d72\u1d76ef\xf4\u1cb4igh\xf4\u1cb6\u0162\u1d7f\u1d85karo\xf7\u0f42\u026f\u1d8a\0\0\u1d8ern;\u631fop;\u630c\u0180cot\u1d98\u1da3\u1da6\u0100ry\u1d9d\u1da1;\uc000\ud835\udcb9;\u4455l;\u69f6rok;\u4111\u0100dr\u1db0\u1db4ot;\u62f1i\u0100;f\u1dba\u1816\u65bf\u0100ah\u1dc0\u1dc3r\xf2\u0429a\xf2\u0fa6angle;\u69a6\u0100ci\u1dd2\u1dd5y;\u445fgrarr;\u67ff\u0900Dacdefglmnopqrstux\u1e01\u1e09\u1e19\u1e38\u0578\u1e3c\u1e49\u1e61\u1e7e\u1ea5\u1eaf\u1ebd\u1ee1\u1f2a\u1f37\u1f44\u1f4e\u1f5a\u0100Do\u1e06\u1d34o\xf4\u1c89\u0100cs\u1e0e\u1e14ute\u803b\xe9\u40e9ter;\u6a6e\u0200aioy\u1e22\u1e27\u1e31\u1e36ron;\u411br\u0100;c\u1e2d\u1e2e\u6256\u803b\xea\u40ealon;\u6255;\u444dot;\u4117\u0100Dr\u1e41\u1e45ot;\u6252;\uc000\ud835\udd22\u0180;rs\u1e50\u1e51\u1e57\u6a9aave\u803b\xe8\u40e8\u0100;d\u1e5c\u1e5d\u6a96ot;\u6a98\u0200;ils\u1e6a\u1e6b\u1e72\u1e74\u6a99nters;\u63e7;\u6113\u0100;d\u1e79\u1e7a\u6a95ot;\u6a97\u0180aps\u1e85\u1e89\u1e97cr;\u4113ty\u0180;sv\u1e92\u1e93\u1e95\u6205et\xbb\u1e93p\u01001;\u1e9d\u1ea4\u0133\u1ea1\u1ea3;\u6004;\u6005\u6003\u0100gs\u1eaa\u1eac;\u414bp;\u6002\u0100gp\u1eb4\u1eb8on;\u4119f;\uc000\ud835\udd56\u0180als\u1ec4\u1ece\u1ed2r\u0100;s\u1eca\u1ecb\u62d5l;\u69e3us;\u6a71i\u0180;lv\u1eda\u1edb\u1edf\u43b5on\xbb\u1edb;\u43f5\u0200csuv\u1eea\u1ef3\u1f0b\u1f23\u0100io\u1eef\u1e31rc\xbb\u1e2e\u0269\u1ef9\0\0\u1efb\xed\u0548ant\u0100gl\u1f02\u1f06tr\xbb\u1e5dess\xbb\u1e7a\u0180aei\u1f12\u1f16\u1f1als;\u403dst;\u625fv\u0100;D\u0235\u1f20D;\u6a78parsl;\u69e5\u0100Da\u1f2f\u1f33ot;\u6253rr;\u6971\u0180cdi\u1f3e\u1f41\u1ef8r;\u612fo\xf4\u0352\u0100ah\u1f49\u1f4b;\u43b7\u803b\xf0\u40f0\u0100mr\u1f53\u1f57l\u803b\xeb\u40ebo;\u60ac\u0180cip\u1f61\u1f64\u1f67l;\u4021s\xf4\u056e\u0100eo\u1f6c\u1f74ctatio\xee\u0559nential\xe5\u0579\u09e1\u1f92\0\u1f9e\0\u1fa1\u1fa7\0\0\u1fc6\u1fcc\0\u1fd3\0\u1fe6\u1fea\u2000\0\u2008\u205allingdotse\xf1\u1e44y;\u4444male;\u6640\u0180ilr\u1fad\u1fb3\u1fc1lig;\u8000\ufb03\u0269\u1fb9\0\0\u1fbdg;\u8000\ufb00ig;\u8000\ufb04;\uc000\ud835\udd23lig;\u8000\ufb01lig;\uc000fj\u0180alt\u1fd9\u1fdc\u1fe1t;\u666dig;\u8000\ufb02ns;\u65b1of;\u4192\u01f0\u1fee\0\u1ff3f;\uc000\ud835\udd57\u0100ak\u05bf\u1ff7\u0100;v\u1ffc\u1ffd\u62d4;\u6ad9artint;\u6a0d\u0100ao\u200c\u2055\u0100cs\u2011\u2052\u03b1\u201a\u2030\u2038\u2045\u2048\0\u2050\u03b2\u2022\u2025\u2027\u202a\u202c\0\u202e\u803b\xbd\u40bd;\u6153\u803b\xbc\u40bc;\u6155;\u6159;\u615b\u01b3\u2034\0\u2036;\u6154;\u6156\u02b4\u203e\u2041\0\0\u2043\u803b\xbe\u40be;\u6157;\u615c5;\u6158\u01b6\u204c\0\u204e;\u615a;\u615d8;\u615el;\u6044wn;\u6322cr;\uc000\ud835\udcbb\u0880Eabcdefgijlnorstv\u2082\u2089\u209f\u20a5\u20b0\u20b4\u20f0\u20f5\u20fa\u20ff\u2103\u2112\u2138\u0317\u213e\u2152\u219e\u0100;l\u064d\u2087;\u6a8c\u0180cmp\u2090\u2095\u209dute;\u41f5ma\u0100;d\u209c\u1cda\u43b3;\u6a86reve;\u411f\u0100iy\u20aa\u20aerc;\u411d;\u4433ot;\u4121\u0200;lqs\u063e\u0642\u20bd\u20c9\u0180;qs\u063e\u064c\u20c4lan\xf4\u0665\u0200;cdl\u0665\u20d2\u20d5\u20e5c;\u6aa9ot\u0100;o\u20dc\u20dd\u6a80\u0100;l\u20e2\u20e3\u6a82;\u6a84\u0100;e\u20ea\u20ed\uc000\u22db\ufe00s;\u6a94r;\uc000\ud835\udd24\u0100;g\u0673\u061bmel;\u6137cy;\u4453\u0200;Eaj\u065a\u210c\u210e\u2110;\u6a92;\u6aa5;\u6aa4\u0200Eaes\u211b\u211d\u2129\u2134;\u6269p\u0100;p\u2123\u2124\u6a8arox\xbb\u2124\u0100;q\u212e\u212f\u6a88\u0100;q\u212e\u211bim;\u62e7pf;\uc000\ud835\udd58\u0100ci\u2143\u2146r;\u610am\u0180;el\u066b\u214e\u2150;\u6a8e;\u6a90\u8300>;cdlqr\u05ee\u2160\u216a\u216e\u2173\u2179\u0100ci\u2165\u2167;\u6aa7r;\u6a7aot;\u62d7Par;\u6995uest;\u6a7c\u0280adels\u2184\u216a\u2190\u0656\u219b\u01f0\u2189\0\u218epro\xf8\u209er;\u6978q\u0100lq\u063f\u2196les\xf3\u2088i\xed\u066b\u0100en\u21a3\u21adrtneqq;\uc000\u2269\ufe00\xc5\u21aa\u0500Aabcefkosy\u21c4\u21c7\u21f1\u21f5\u21fa\u2218\u221d\u222f\u2268\u227dr\xf2\u03a0\u0200ilmr\u21d0\u21d4\u21d7\u21dbrs\xf0\u1484f\xbb\u2024il\xf4\u06a9\u0100dr\u21e0\u21e4cy;\u444a\u0180;cw\u08f4\u21eb\u21efir;\u6948;\u61adar;\u610firc;\u4125\u0180alr\u2201\u220e\u2213rts\u0100;u\u2209\u220a\u6665it\xbb\u220alip;\u6026con;\u62b9r;\uc000\ud835\udd25s\u0100ew\u2223\u2229arow;\u6925arow;\u6926\u0280amopr\u223a\u223e\u2243\u225e\u2263rr;\u61fftht;\u623bk\u0100lr\u2249\u2253eftarrow;\u61a9ightarrow;\u61aaf;\uc000\ud835\udd59bar;\u6015\u0180clt\u226f\u2274\u2278r;\uc000\ud835\udcbdas\xe8\u21f4rok;\u4127\u0100bp\u2282\u2287ull;\u6043hen\xbb\u1c5b\u0ae1\u22a3\0\u22aa\0\u22b8\u22c5\u22ce\0\u22d5\u22f3\0\0\u22f8\u2322\u2367\u2362\u237f\0\u2386\u23aa\u23b4cute\u803b\xed\u40ed\u0180;iy\u0771\u22b0\u22b5rc\u803b\xee\u40ee;\u4438\u0100cx\u22bc\u22bfy;\u4435cl\u803b\xa1\u40a1\u0100fr\u039f\u22c9;\uc000\ud835\udd26rave\u803b\xec\u40ec\u0200;ino\u073e\u22dd\u22e9\u22ee\u0100in\u22e2\u22e6nt;\u6a0ct;\u622dfin;\u69dcta;\u6129lig;\u4133\u0180aop\u22fe\u231a\u231d\u0180cgt\u2305\u2308\u2317r;\u412b\u0180elp\u071f\u230f\u2313in\xe5\u078ear\xf4\u0720h;\u4131f;\u62b7ed;\u41b5\u0280;cfot\u04f4\u232c\u2331\u233d\u2341are;\u6105in\u0100;t\u2338\u2339\u621eie;\u69dddo\xf4\u2319\u0280;celp\u0757\u234c\u2350\u235b\u2361al;\u62ba\u0100gr\u2355\u2359er\xf3\u1563\xe3\u234darhk;\u6a17rod;\u6a3c\u0200cgpt\u236f\u2372\u2376\u237by;\u4451on;\u412ff;\uc000\ud835\udd5aa;\u43b9uest\u803b\xbf\u40bf\u0100ci\u238a\u238fr;\uc000\ud835\udcben\u0280;Edsv\u04f4\u239b\u239d\u23a1\u04f3;\u62f9ot;\u62f5\u0100;v\u23a6\u23a7\u62f4;\u62f3\u0100;i\u0777\u23aelde;\u4129\u01eb\u23b8\0\u23bccy;\u4456l\u803b\xef\u40ef\u0300cfmosu\u23cc\u23d7\u23dc\u23e1\u23e7\u23f5\u0100iy\u23d1\u23d5rc;\u4135;\u4439r;\uc000\ud835\udd27ath;\u4237pf;\uc000\ud835\udd5b\u01e3\u23ec\0\u23f1r;\uc000\ud835\udcbfrcy;\u4458kcy;\u4454\u0400acfghjos\u240b\u2416\u2422\u2427\u242d\u2431\u2435\u243bppa\u0100;v\u2413\u2414\u43ba;\u43f0\u0100ey\u241b\u2420dil;\u4137;\u443ar;\uc000\ud835\udd28reen;\u4138cy;\u4445cy;\u445cpf;\uc000\ud835\udd5ccr;\uc000\ud835\udcc0\u0b80ABEHabcdefghjlmnoprstuv\u2470\u2481\u2486\u248d\u2491\u250e\u253d\u255a\u2580\u264e\u265e\u2665\u2679\u267d\u269a\u26b2\u26d8\u275d\u2768\u278b\u27c0\u2801\u2812\u0180art\u2477\u247a\u247cr\xf2\u09c6\xf2\u0395ail;\u691barr;\u690e\u0100;g\u0994\u248b;\u6a8bar;\u6962\u0963\u24a5\0\u24aa\0\u24b1\0\0\0\0\0\u24b5\u24ba\0\u24c6\u24c8\u24cd\0\u24f9ute;\u413amptyv;\u69b4ra\xee\u084cbda;\u43bbg\u0180;dl\u088e\u24c1\u24c3;\u6991\xe5\u088e;\u6a85uo\u803b\xab\u40abr\u0400;bfhlpst\u0899\u24de\u24e6\u24e9\u24eb\u24ee\u24f1\u24f5\u0100;f\u089d\u24e3s;\u691fs;\u691d\xeb\u2252p;\u61abl;\u6939im;\u6973l;\u61a2\u0180;ae\u24ff\u2500\u2504\u6aabil;\u6919\u0100;s\u2509\u250a\u6aad;\uc000\u2aad\ufe00\u0180abr\u2515\u2519\u251drr;\u690crk;\u6772\u0100ak\u2522\u252cc\u0100ek\u2528\u252a;\u407b;\u405b\u0100es\u2531\u2533;\u698bl\u0100du\u2539\u253b;\u698f;\u698d\u0200aeuy\u2546\u254b\u2556\u2558ron;\u413e\u0100di\u2550\u2554il;\u413c\xec\u08b0\xe2\u2529;\u443b\u0200cqrs\u2563\u2566\u256d\u257da;\u6936uo\u0100;r\u0e19\u1746\u0100du\u2572\u2577har;\u6967shar;\u694bh;\u61b2\u0280;fgqs\u258b\u258c\u0989\u25f3\u25ff\u6264t\u0280ahlrt\u2598\u25a4\u25b7\u25c2\u25e8rrow\u0100;t\u0899\u25a1a\xe9\u24f6arpoon\u0100du\u25af\u25b4own\xbb\u045ap\xbb\u0966eftarrows;\u61c7ight\u0180ahs\u25cd\u25d6\u25derrow\u0100;s\u08f4\u08a7arpoon\xf3\u0f98quigarro\xf7\u21f0hreetimes;\u62cb\u0180;qs\u258b\u0993\u25falan\xf4\u09ac\u0280;cdgs\u09ac\u260a\u260d\u261d\u2628c;\u6aa8ot\u0100;o\u2614\u2615\u6a7f\u0100;r\u261a\u261b\u6a81;\u6a83\u0100;e\u2622\u2625\uc000\u22da\ufe00s;\u6a93\u0280adegs\u2633\u2639\u263d\u2649\u264bppro\xf8\u24c6ot;\u62d6q\u0100gq\u2643\u2645\xf4\u0989gt\xf2\u248c\xf4\u099bi\xed\u09b2\u0180ilr\u2655\u08e1\u265asht;\u697c;\uc000\ud835\udd29\u0100;E\u099c\u2663;\u6a91\u0161\u2669\u2676r\u0100du\u25b2\u266e\u0100;l\u0965\u2673;\u696alk;\u6584cy;\u4459\u0280;acht\u0a48\u2688\u268b\u2691\u2696r\xf2\u25c1orne\xf2\u1d08ard;\u696bri;\u65fa\u0100io\u269f\u26a4dot;\u4140ust\u0100;a\u26ac\u26ad\u63b0che\xbb\u26ad\u0200Eaes\u26bb\u26bd\u26c9\u26d4;\u6268p\u0100;p\u26c3\u26c4\u6a89rox\xbb\u26c4\u0100;q\u26ce\u26cf\u6a87\u0100;q\u26ce\u26bbim;\u62e6\u0400abnoptwz\u26e9\u26f4\u26f7\u271a\u272f\u2741\u2747\u2750\u0100nr\u26ee\u26f1g;\u67ecr;\u61fdr\xeb\u08c1g\u0180lmr\u26ff\u270d\u2714eft\u0100ar\u09e6\u2707ight\xe1\u09f2apsto;\u67fcight\xe1\u09fdparrow\u0100lr\u2725\u2729ef\xf4\u24edight;\u61ac\u0180afl\u2736\u2739\u273dr;\u6985;\uc000\ud835\udd5dus;\u6a2dimes;\u6a34\u0161\u274b\u274fst;\u6217\xe1\u134e\u0180;ef\u2757\u2758\u1800\u65cange\xbb\u2758ar\u0100;l\u2764\u2765\u4028t;\u6993\u0280achmt\u2773\u2776\u277c\u2785\u2787r\xf2\u08a8orne\xf2\u1d8car\u0100;d\u0f98\u2783;\u696d;\u600eri;\u62bf\u0300achiqt\u2798\u279d\u0a40\u27a2\u27ae\u27bbquo;\u6039r;\uc000\ud835\udcc1m\u0180;eg\u09b2\u27aa\u27ac;\u6a8d;\u6a8f\u0100bu\u252a\u27b3o\u0100;r\u0e1f\u27b9;\u601arok;\u4142\u8400<;cdhilqr\u082b\u27d2\u2639\u27dc\u27e0\u27e5\u27ea\u27f0\u0100ci\u27d7\u27d9;\u6aa6r;\u6a79re\xe5\u25f2mes;\u62c9arr;\u6976uest;\u6a7b\u0100Pi\u27f5\u27f9ar;\u6996\u0180;ef\u2800\u092d\u181b\u65c3r\u0100du\u2807\u280dshar;\u694ahar;\u6966\u0100en\u2817\u2821rtneqq;\uc000\u2268\ufe00\xc5\u281e\u0700Dacdefhilnopsu\u2840\u2845\u2882\u288e\u2893\u28a0\u28a5\u28a8\u28da\u28e2\u28e4\u0a83\u28f3\u2902Dot;\u623a\u0200clpr\u284e\u2852\u2863\u287dr\u803b\xaf\u40af\u0100et\u2857\u2859;\u6642\u0100;e\u285e\u285f\u6720se\xbb\u285f\u0100;s\u103b\u2868to\u0200;dlu\u103b\u2873\u2877\u287bow\xee\u048cef\xf4\u090f\xf0\u13d1ker;\u65ae\u0100oy\u2887\u288cmma;\u6a29;\u443cash;\u6014asuredangle\xbb\u1626r;\uc000\ud835\udd2ao;\u6127\u0180cdn\u28af\u28b4\u28c9ro\u803b\xb5\u40b5\u0200;acd\u1464\u28bd\u28c0\u28c4s\xf4\u16a7ir;\u6af0ot\u80bb\xb7\u01b5us\u0180;bd\u28d2\u1903\u28d3\u6212\u0100;u\u1d3c\u28d8;\u6a2a\u0163\u28de\u28e1p;\u6adb\xf2\u2212\xf0\u0a81\u0100dp\u28e9\u28eeels;\u62a7f;\uc000\ud835\udd5e\u0100ct\u28f8\u28fdr;\uc000\ud835\udcc2pos\xbb\u159d\u0180;lm\u2909\u290a\u290d\u43bctimap;\u62b8\u0c00GLRVabcdefghijlmoprstuvw\u2942\u2953\u297e\u2989\u2998\u29da\u29e9\u2a15\u2a1a\u2a58\u2a5d\u2a83\u2a95\u2aa4\u2aa8\u2b04\u2b07\u2b44\u2b7f\u2bae\u2c34\u2c67\u2c7c\u2ce9\u0100gt\u2947\u294b;\uc000\u22d9\u0338\u0100;v\u2950\u0bcf\uc000\u226b\u20d2\u0180elt\u295a\u2972\u2976ft\u0100ar\u2961\u2967rrow;\u61cdightarrow;\u61ce;\uc000\u22d8\u0338\u0100;v\u297b\u0c47\uc000\u226a\u20d2ightarrow;\u61cf\u0100Dd\u298e\u2993ash;\u62afash;\u62ae\u0280bcnpt\u29a3\u29a7\u29ac\u29b1\u29ccla\xbb\u02deute;\u4144g;\uc000\u2220\u20d2\u0280;Eiop\u0d84\u29bc\u29c0\u29c5\u29c8;\uc000\u2a70\u0338d;\uc000\u224b\u0338s;\u4149ro\xf8\u0d84ur\u0100;a\u29d3\u29d4\u666el\u0100;s\u29d3\u0b38\u01f3\u29df\0\u29e3p\u80bb\xa0\u0b37mp\u0100;e\u0bf9\u0c00\u0280aeouy\u29f4\u29fe\u2a03\u2a10\u2a13\u01f0\u29f9\0\u29fb;\u6a43on;\u4148dil;\u4146ng\u0100;d\u0d7e\u2a0aot;\uc000\u2a6d\u0338p;\u6a42;\u443dash;\u6013\u0380;Aadqsx\u0b92\u2a29\u2a2d\u2a3b\u2a41\u2a45\u2a50rr;\u61d7r\u0100hr\u2a33\u2a36k;\u6924\u0100;o\u13f2\u13f0ot;\uc000\u2250\u0338ui\xf6\u0b63\u0100ei\u2a4a\u2a4ear;\u6928\xed\u0b98ist\u0100;s\u0ba0\u0b9fr;\uc000\ud835\udd2b\u0200Eest\u0bc5\u2a66\u2a79\u2a7c\u0180;qs\u0bbc\u2a6d\u0be1\u0180;qs\u0bbc\u0bc5\u2a74lan\xf4\u0be2i\xed\u0bea\u0100;r\u0bb6\u2a81\xbb\u0bb7\u0180Aap\u2a8a\u2a8d\u2a91r\xf2\u2971rr;\u61aear;\u6af2\u0180;sv\u0f8d\u2a9c\u0f8c\u0100;d\u2aa1\u2aa2\u62fc;\u62facy;\u445a\u0380AEadest\u2ab7\u2aba\u2abe\u2ac2\u2ac5\u2af6\u2af9r\xf2\u2966;\uc000\u2266\u0338rr;\u619ar;\u6025\u0200;fqs\u0c3b\u2ace\u2ae3\u2aeft\u0100ar\u2ad4\u2ad9rro\xf7\u2ac1ightarro\xf7\u2a90\u0180;qs\u0c3b\u2aba\u2aealan\xf4\u0c55\u0100;s\u0c55\u2af4\xbb\u0c36i\xed\u0c5d\u0100;r\u0c35\u2afei\u0100;e\u0c1a\u0c25i\xe4\u0d90\u0100pt\u2b0c\u2b11f;\uc000\ud835\udd5f\u8180\xac;in\u2b19\u2b1a\u2b36\u40acn\u0200;Edv\u0b89\u2b24\u2b28\u2b2e;\uc000\u22f9\u0338ot;\uc000\u22f5\u0338\u01e1\u0b89\u2b33\u2b35;\u62f7;\u62f6i\u0100;v\u0cb8\u2b3c\u01e1\u0cb8\u2b41\u2b43;\u62fe;\u62fd\u0180aor\u2b4b\u2b63\u2b69r\u0200;ast\u0b7b\u2b55\u2b5a\u2b5flle\xec\u0b7bl;\uc000\u2afd\u20e5;\uc000\u2202\u0338lint;\u6a14\u0180;ce\u0c92\u2b70\u2b73u\xe5\u0ca5\u0100;c\u0c98\u2b78\u0100;e\u0c92\u2b7d\xf1\u0c98\u0200Aait\u2b88\u2b8b\u2b9d\u2ba7r\xf2\u2988rr\u0180;cw\u2b94\u2b95\u2b99\u619b;\uc000\u2933\u0338;\uc000\u219d\u0338ghtarrow\xbb\u2b95ri\u0100;e\u0ccb\u0cd6\u0380chimpqu\u2bbd\u2bcd\u2bd9\u2b04\u0b78\u2be4\u2bef\u0200;cer\u0d32\u2bc6\u0d37\u2bc9u\xe5\u0d45;\uc000\ud835\udcc3ort\u026d\u2b05\0\0\u2bd6ar\xe1\u2b56m\u0100;e\u0d6e\u2bdf\u0100;q\u0d74\u0d73su\u0100bp\u2beb\u2bed\xe5\u0cf8\xe5\u0d0b\u0180bcp\u2bf6\u2c11\u2c19\u0200;Ees\u2bff\u2c00\u0d22\u2c04\u6284;\uc000\u2ac5\u0338et\u0100;e\u0d1b\u2c0bq\u0100;q\u0d23\u2c00c\u0100;e\u0d32\u2c17\xf1\u0d38\u0200;Ees\u2c22\u2c23\u0d5f\u2c27\u6285;\uc000\u2ac6\u0338et\u0100;e\u0d58\u2c2eq\u0100;q\u0d60\u2c23\u0200gilr\u2c3d\u2c3f\u2c45\u2c47\xec\u0bd7lde\u803b\xf1\u40f1\xe7\u0c43iangle\u0100lr\u2c52\u2c5ceft\u0100;e\u0c1a\u2c5a\xf1\u0c26ight\u0100;e\u0ccb\u2c65\xf1\u0cd7\u0100;m\u2c6c\u2c6d\u43bd\u0180;es\u2c74\u2c75\u2c79\u4023ro;\u6116p;\u6007\u0480DHadgilrs\u2c8f\u2c94\u2c99\u2c9e\u2ca3\u2cb0\u2cb6\u2cd3\u2ce3ash;\u62adarr;\u6904p;\uc000\u224d\u20d2ash;\u62ac\u0100et\u2ca8\u2cac;\uc000\u2265\u20d2;\uc000>\u20d2nfin;\u69de\u0180Aet\u2cbd\u2cc1\u2cc5rr;\u6902;\uc000\u2264\u20d2\u0100;r\u2cca\u2ccd\uc000<\u20d2ie;\uc000\u22b4\u20d2\u0100At\u2cd8\u2cdcrr;\u6903rie;\uc000\u22b5\u20d2im;\uc000\u223c\u20d2\u0180Aan\u2cf0\u2cf4\u2d02rr;\u61d6r\u0100hr\u2cfa\u2cfdk;\u6923\u0100;o\u13e7\u13e5ear;\u6927\u1253\u1a95\0\0\0\0\0\0\0\0\0\0\0\0\0\u2d2d\0\u2d38\u2d48\u2d60\u2d65\u2d72\u2d84\u1b07\0\0\u2d8d\u2dab\0\u2dc8\u2dce\0\u2ddc\u2e19\u2e2b\u2e3e\u2e43\u0100cs\u2d31\u1a97ute\u803b\xf3\u40f3\u0100iy\u2d3c\u2d45r\u0100;c\u1a9e\u2d42\u803b\xf4\u40f4;\u443e\u0280abios\u1aa0\u2d52\u2d57\u01c8\u2d5alac;\u4151v;\u6a38old;\u69bclig;\u4153\u0100cr\u2d69\u2d6dir;\u69bf;\uc000\ud835\udd2c\u036f\u2d79\0\0\u2d7c\0\u2d82n;\u42dbave\u803b\xf2\u40f2;\u69c1\u0100bm\u2d88\u0df4ar;\u69b5\u0200acit\u2d95\u2d98\u2da5\u2da8r\xf2\u1a80\u0100ir\u2d9d\u2da0r;\u69beoss;\u69bbn\xe5\u0e52;\u69c0\u0180aei\u2db1\u2db5\u2db9cr;\u414dga;\u43c9\u0180cdn\u2dc0\u2dc5\u01cdron;\u43bf;\u69b6pf;\uc000\ud835\udd60\u0180ael\u2dd4\u2dd7\u01d2r;\u69b7rp;\u69b9\u0380;adiosv\u2dea\u2deb\u2dee\u2e08\u2e0d\u2e10\u2e16\u6228r\xf2\u1a86\u0200;efm\u2df7\u2df8\u2e02\u2e05\u6a5dr\u0100;o\u2dfe\u2dff\u6134f\xbb\u2dff\u803b\xaa\u40aa\u803b\xba\u40bagof;\u62b6r;\u6a56lope;\u6a57;\u6a5b\u0180clo\u2e1f\u2e21\u2e27\xf2\u2e01ash\u803b\xf8\u40f8l;\u6298i\u016c\u2e2f\u2e34de\u803b\xf5\u40f5es\u0100;a\u01db\u2e3as;\u6a36ml\u803b\xf6\u40f6bar;\u633d\u0ae1\u2e5e\0\u2e7d\0\u2e80\u2e9d\0\u2ea2\u2eb9\0\0\u2ecb\u0e9c\0\u2f13\0\0\u2f2b\u2fbc\0\u2fc8r\u0200;ast\u0403\u2e67\u2e72\u0e85\u8100\xb6;l\u2e6d\u2e6e\u40b6le\xec\u0403\u0269\u2e78\0\0\u2e7bm;\u6af3;\u6afdy;\u443fr\u0280cimpt\u2e8b\u2e8f\u2e93\u1865\u2e97nt;\u4025od;\u402eil;\u6030enk;\u6031r;\uc000\ud835\udd2d\u0180imo\u2ea8\u2eb0\u2eb4\u0100;v\u2ead\u2eae\u43c6;\u43d5ma\xf4\u0a76ne;\u660e\u0180;tv\u2ebf\u2ec0\u2ec8\u43c0chfork\xbb\u1ffd;\u43d6\u0100au\u2ecf\u2edfn\u0100ck\u2ed5\u2eddk\u0100;h\u21f4\u2edb;\u610e\xf6\u21f4s\u0480;abcdemst\u2ef3\u2ef4\u1908\u2ef9\u2efd\u2f04\u2f06\u2f0a\u2f0e\u402bcir;\u6a23ir;\u6a22\u0100ou\u1d40\u2f02;\u6a25;\u6a72n\u80bb\xb1\u0e9dim;\u6a26wo;\u6a27\u0180ipu\u2f19\u2f20\u2f25ntint;\u6a15f;\uc000\ud835\udd61nd\u803b\xa3\u40a3\u0500;Eaceinosu\u0ec8\u2f3f\u2f41\u2f44\u2f47\u2f81\u2f89\u2f92\u2f7e\u2fb6;\u6ab3p;\u6ab7u\xe5\u0ed9\u0100;c\u0ece\u2f4c\u0300;acens\u0ec8\u2f59\u2f5f\u2f66\u2f68\u2f7eppro\xf8\u2f43urlye\xf1\u0ed9\xf1\u0ece\u0180aes\u2f6f\u2f76\u2f7approx;\u6ab9qq;\u6ab5im;\u62e8i\xed\u0edfme\u0100;s\u2f88\u0eae\u6032\u0180Eas\u2f78\u2f90\u2f7a\xf0\u2f75\u0180dfp\u0eec\u2f99\u2faf\u0180als\u2fa0\u2fa5\u2faalar;\u632eine;\u6312urf;\u6313\u0100;t\u0efb\u2fb4\xef\u0efbrel;\u62b0\u0100ci\u2fc0\u2fc5r;\uc000\ud835\udcc5;\u43c8ncsp;\u6008\u0300fiopsu\u2fda\u22e2\u2fdf\u2fe5\u2feb\u2ff1r;\uc000\ud835\udd2epf;\uc000\ud835\udd62rime;\u6057cr;\uc000\ud835\udcc6\u0180aeo\u2ff8\u3009\u3013t\u0100ei\u2ffe\u3005rnion\xf3\u06b0nt;\u6a16st\u0100;e\u3010\u3011\u403f\xf1\u1f19\xf4\u0f14\u0a80ABHabcdefhilmnoprstux\u3040\u3051\u3055\u3059\u30e0\u310e\u312b\u3147\u3162\u3172\u318e\u3206\u3215\u3224\u3229\u3258\u326e\u3272\u3290\u32b0\u32b7\u0180art\u3047\u304a\u304cr\xf2\u10b3\xf2\u03ddail;\u691car\xf2\u1c65ar;\u6964\u0380cdenqrt\u3068\u3075\u3078\u307f\u308f\u3094\u30cc\u0100eu\u306d\u3071;\uc000\u223d\u0331te;\u4155i\xe3\u116emptyv;\u69b3g\u0200;del\u0fd1\u3089\u308b\u308d;\u6992;\u69a5\xe5\u0fd1uo\u803b\xbb\u40bbr\u0580;abcfhlpstw\u0fdc\u30ac\u30af\u30b7\u30b9\u30bc\u30be\u30c0\u30c3\u30c7\u30cap;\u6975\u0100;f\u0fe0\u30b4s;\u6920;\u6933s;\u691e\xeb\u225d\xf0\u272el;\u6945im;\u6974l;\u61a3;\u619d\u0100ai\u30d1\u30d5il;\u691ao\u0100;n\u30db\u30dc\u6236al\xf3\u0f1e\u0180abr\u30e7\u30ea\u30eer\xf2\u17e5rk;\u6773\u0100ak\u30f3\u30fdc\u0100ek\u30f9\u30fb;\u407d;\u405d\u0100es\u3102\u3104;\u698cl\u0100du\u310a\u310c;\u698e;\u6990\u0200aeuy\u3117\u311c\u3127\u3129ron;\u4159\u0100di\u3121\u3125il;\u4157\xec\u0ff2\xe2\u30fa;\u4440\u0200clqs\u3134\u3137\u313d\u3144a;\u6937dhar;\u6969uo\u0100;r\u020e\u020dh;\u61b3\u0180acg\u314e\u315f\u0f44l\u0200;ips\u0f78\u3158\u315b\u109cn\xe5\u10bbar\xf4\u0fa9t;\u65ad\u0180ilr\u3169\u1023\u316esht;\u697d;\uc000\ud835\udd2f\u0100ao\u3177\u3186r\u0100du\u317d\u317f\xbb\u047b\u0100;l\u1091\u3184;\u696c\u0100;v\u318b\u318c\u43c1;\u43f1\u0180gns\u3195\u31f9\u31fcht\u0300ahlrst\u31a4\u31b0\u31c2\u31d8\u31e4\u31eerrow\u0100;t\u0fdc\u31ada\xe9\u30c8arpoon\u0100du\u31bb\u31bfow\xee\u317ep\xbb\u1092eft\u0100ah\u31ca\u31d0rrow\xf3\u0feaarpoon\xf3\u0551ightarrows;\u61c9quigarro\xf7\u30cbhreetimes;\u62ccg;\u42daingdotse\xf1\u1f32\u0180ahm\u320d\u3210\u3213r\xf2\u0feaa\xf2\u0551;\u600foust\u0100;a\u321e\u321f\u63b1che\xbb\u321fmid;\u6aee\u0200abpt\u3232\u323d\u3240\u3252\u0100nr\u3237\u323ag;\u67edr;\u61fer\xeb\u1003\u0180afl\u3247\u324a\u324er;\u6986;\uc000\ud835\udd63us;\u6a2eimes;\u6a35\u0100ap\u325d\u3267r\u0100;g\u3263\u3264\u4029t;\u6994olint;\u6a12ar\xf2\u31e3\u0200achq\u327b\u3280\u10bc\u3285quo;\u603ar;\uc000\ud835\udcc7\u0100bu\u30fb\u328ao\u0100;r\u0214\u0213\u0180hir\u3297\u329b\u32a0re\xe5\u31f8mes;\u62cai\u0200;efl\u32aa\u1059\u1821\u32ab\u65b9tri;\u69celuhar;\u6968;\u611e\u0d61\u32d5\u32db\u32df\u332c\u3338\u3371\0\u337a\u33a4\0\0\u33ec\u33f0\0\u3428\u3448\u345a\u34ad\u34b1\u34ca\u34f1\0\u3616\0\0\u3633cute;\u415bqu\xef\u27ba\u0500;Eaceinpsy\u11ed\u32f3\u32f5\u32ff\u3302\u330b\u330f\u331f\u3326\u3329;\u6ab4\u01f0\u32fa\0\u32fc;\u6ab8on;\u4161u\xe5\u11fe\u0100;d\u11f3\u3307il;\u415frc;\u415d\u0180Eas\u3316\u3318\u331b;\u6ab6p;\u6abaim;\u62e9olint;\u6a13i\xed\u1204;\u4441ot\u0180;be\u3334\u1d47\u3335\u62c5;\u6a66\u0380Aacmstx\u3346\u334a\u3357\u335b\u335e\u3363\u336drr;\u61d8r\u0100hr\u3350\u3352\xeb\u2228\u0100;o\u0a36\u0a34t\u803b\xa7\u40a7i;\u403bwar;\u6929m\u0100in\u3369\xf0nu\xf3\xf1t;\u6736r\u0100;o\u3376\u2055\uc000\ud835\udd30\u0200acoy\u3382\u3386\u3391\u33a0rp;\u666f\u0100hy\u338b\u338fcy;\u4449;\u4448rt\u026d\u3399\0\0\u339ci\xe4\u1464ara\xec\u2e6f\u803b\xad\u40ad\u0100gm\u33a8\u33b4ma\u0180;fv\u33b1\u33b2\u33b2\u43c3;\u43c2\u0400;deglnpr\u12ab\u33c5\u33c9\u33ce\u33d6\u33de\u33e1\u33e6ot;\u6a6a\u0100;q\u12b1\u12b0\u0100;E\u33d3\u33d4\u6a9e;\u6aa0\u0100;E\u33db\u33dc\u6a9d;\u6a9fe;\u6246lus;\u6a24arr;\u6972ar\xf2\u113d\u0200aeit\u33f8\u3408\u340f\u3417\u0100ls\u33fd\u3404lsetm\xe9\u336ahp;\u6a33parsl;\u69e4\u0100dl\u1463\u3414e;\u6323\u0100;e\u341c\u341d\u6aaa\u0100;s\u3422\u3423\u6aac;\uc000\u2aac\ufe00\u0180flp\u342e\u3433\u3442tcy;\u444c\u0100;b\u3438\u3439\u402f\u0100;a\u343e\u343f\u69c4r;\u633ff;\uc000\ud835\udd64a\u0100dr\u344d\u0402es\u0100;u\u3454\u3455\u6660it\xbb\u3455\u0180csu\u3460\u3479\u349f\u0100au\u3465\u346fp\u0100;s\u1188\u346b;\uc000\u2293\ufe00p\u0100;s\u11b4\u3475;\uc000\u2294\ufe00u\u0100bp\u347f\u348f\u0180;es\u1197\u119c\u3486et\u0100;e\u1197\u348d\xf1\u119d\u0180;es\u11a8\u11ad\u3496et\u0100;e\u11a8\u349d\xf1\u11ae\u0180;af\u117b\u34a6\u05b0r\u0165\u34ab\u05b1\xbb\u117car\xf2\u1148\u0200cemt\u34b9\u34be\u34c2\u34c5r;\uc000\ud835\udcc8tm\xee\xf1i\xec\u3415ar\xe6\u11be\u0100ar\u34ce\u34d5r\u0100;f\u34d4\u17bf\u6606\u0100an\u34da\u34edight\u0100ep\u34e3\u34eapsilo\xee\u1ee0h\xe9\u2eafs\xbb\u2852\u0280bcmnp\u34fb\u355e\u1209\u358b\u358e\u0480;Edemnprs\u350e\u350f\u3511\u3515\u351e\u3523\u352c\u3531\u3536\u6282;\u6ac5ot;\u6abd\u0100;d\u11da\u351aot;\u6ac3ult;\u6ac1\u0100Ee\u3528\u352a;\u6acb;\u628alus;\u6abfarr;\u6979\u0180eiu\u353d\u3552\u3555t\u0180;en\u350e\u3545\u354bq\u0100;q\u11da\u350feq\u0100;q\u352b\u3528m;\u6ac7\u0100bp\u355a\u355c;\u6ad5;\u6ad3c\u0300;acens\u11ed\u356c\u3572\u3579\u357b\u3326ppro\xf8\u32faurlye\xf1\u11fe\xf1\u11f3\u0180aes\u3582\u3588\u331bppro\xf8\u331aq\xf1\u3317g;\u666a\u0680123;Edehlmnps\u35a9\u35ac\u35af\u121c\u35b2\u35b4\u35c0\u35c9\u35d5\u35da\u35df\u35e8\u35ed\u803b\xb9\u40b9\u803b\xb2\u40b2\u803b\xb3\u40b3;\u6ac6\u0100os\u35b9\u35bct;\u6abeub;\u6ad8\u0100;d\u1222\u35c5ot;\u6ac4s\u0100ou\u35cf\u35d2l;\u67c9b;\u6ad7arr;\u697bult;\u6ac2\u0100Ee\u35e4\u35e6;\u6acc;\u628blus;\u6ac0\u0180eiu\u35f4\u3609\u360ct\u0180;en\u121c\u35fc\u3602q\u0100;q\u1222\u35b2eq\u0100;q\u35e7\u35e4m;\u6ac8\u0100bp\u3611\u3613;\u6ad4;\u6ad6\u0180Aan\u361c\u3620\u362drr;\u61d9r\u0100hr\u3626\u3628\xeb\u222e\u0100;o\u0a2b\u0a29war;\u692alig\u803b\xdf\u40df\u0be1\u3651\u365d\u3660\u12ce\u3673\u3679\0\u367e\u36c2\0\0\0\0\0\u36db\u3703\0\u3709\u376c\0\0\0\u3787\u0272\u3656\0\0\u365bget;\u6316;\u43c4r\xeb\u0e5f\u0180aey\u3666\u366b\u3670ron;\u4165dil;\u4163;\u4442lrec;\u6315r;\uc000\ud835\udd31\u0200eiko\u3686\u369d\u36b5\u36bc\u01f2\u368b\0\u3691e\u01004f\u1284\u1281a\u0180;sv\u3698\u3699\u369b\u43b8ym;\u43d1\u0100cn\u36a2\u36b2k\u0100as\u36a8\u36aeppro\xf8\u12c1im\xbb\u12acs\xf0\u129e\u0100as\u36ba\u36ae\xf0\u12c1rn\u803b\xfe\u40fe\u01ec\u031f\u36c6\u22e7es\u8180\xd7;bd\u36cf\u36d0\u36d8\u40d7\u0100;a\u190f\u36d5r;\u6a31;\u6a30\u0180eps\u36e1\u36e3\u3700\xe1\u2a4d\u0200;bcf\u0486\u36ec\u36f0\u36f4ot;\u6336ir;\u6af1\u0100;o\u36f9\u36fc\uc000\ud835\udd65rk;\u6ada\xe1\u3362rime;\u6034\u0180aip\u370f\u3712\u3764d\xe5\u1248\u0380adempst\u3721\u374d\u3740\u3751\u3757\u375c\u375fngle\u0280;dlqr\u3730\u3731\u3736\u3740\u3742\u65b5own\xbb\u1dbbeft\u0100;e\u2800\u373e\xf1\u092e;\u625cight\u0100;e\u32aa\u374b\xf1\u105aot;\u65ecinus;\u6a3alus;\u6a39b;\u69cdime;\u6a3bezium;\u63e2\u0180cht\u3772\u377d\u3781\u0100ry\u3777\u377b;\uc000\ud835\udcc9;\u4446cy;\u445brok;\u4167\u0100io\u378b\u378ex\xf4\u1777head\u0100lr\u3797\u37a0eftarro\xf7\u084fightarrow\xbb\u0f5d\u0900AHabcdfghlmoprstuw\u37d0\u37d3\u37d7\u37e4\u37f0\u37fc\u380e\u381c\u3823\u3834\u3851\u385d\u386b\u38a9\u38cc\u38d2\u38ea\u38f6r\xf2\u03edar;\u6963\u0100cr\u37dc\u37e2ute\u803b\xfa\u40fa\xf2\u1150r\u01e3\u37ea\0\u37edy;\u445eve;\u416d\u0100iy\u37f5\u37farc\u803b\xfb\u40fb;\u4443\u0180abh\u3803\u3806\u380br\xf2\u13adlac;\u4171a\xf2\u13c3\u0100ir\u3813\u3818sht;\u697e;\uc000\ud835\udd32rave\u803b\xf9\u40f9\u0161\u3827\u3831r\u0100lr\u382c\u382e\xbb\u0957\xbb\u1083lk;\u6580\u0100ct\u3839\u384d\u026f\u383f\0\0\u384arn\u0100;e\u3845\u3846\u631cr\xbb\u3846op;\u630fri;\u65f8\u0100al\u3856\u385acr;\u416b\u80bb\xa8\u0349\u0100gp\u3862\u3866on;\u4173f;\uc000\ud835\udd66\u0300adhlsu\u114b\u3878\u387d\u1372\u3891\u38a0own\xe1\u13b3arpoon\u0100lr\u3888\u388cef\xf4\u382digh\xf4\u382fi\u0180;hl\u3899\u389a\u389c\u43c5\xbb\u13faon\xbb\u389aparrows;\u61c8\u0180cit\u38b0\u38c4\u38c8\u026f\u38b6\0\0\u38c1rn\u0100;e\u38bc\u38bd\u631dr\xbb\u38bdop;\u630eng;\u416fri;\u65f9cr;\uc000\ud835\udcca\u0180dir\u38d9\u38dd\u38e2ot;\u62f0lde;\u4169i\u0100;f\u3730\u38e8\xbb\u1813\u0100am\u38ef\u38f2r\xf2\u38a8l\u803b\xfc\u40fcangle;\u69a7\u0780ABDacdeflnoprsz\u391c\u391f\u3929\u392d\u39b5\u39b8\u39bd\u39df\u39e4\u39e8\u39f3\u39f9\u39fd\u3a01\u3a20r\xf2\u03f7ar\u0100;v\u3926\u3927\u6ae8;\u6ae9as\xe8\u03e1\u0100nr\u3932\u3937grt;\u699c\u0380eknprst\u34e3\u3946\u394b\u3952\u395d\u3964\u3996app\xe1\u2415othin\xe7\u1e96\u0180hir\u34eb\u2ec8\u3959op\xf4\u2fb5\u0100;h\u13b7\u3962\xef\u318d\u0100iu\u3969\u396dgm\xe1\u33b3\u0100bp\u3972\u3984setneq\u0100;q\u397d\u3980\uc000\u228a\ufe00;\uc000\u2acb\ufe00setneq\u0100;q\u398f\u3992\uc000\u228b\ufe00;\uc000\u2acc\ufe00\u0100hr\u399b\u399fet\xe1\u369ciangle\u0100lr\u39aa\u39afeft\xbb\u0925ight\xbb\u1051y;\u4432ash\xbb\u1036\u0180elr\u39c4\u39d2\u39d7\u0180;be\u2dea\u39cb\u39cfar;\u62bbq;\u625alip;\u62ee\u0100bt\u39dc\u1468a\xf2\u1469r;\uc000\ud835\udd33tr\xe9\u39aesu\u0100bp\u39ef\u39f1\xbb\u0d1c\xbb\u0d59pf;\uc000\ud835\udd67ro\xf0\u0efbtr\xe9\u39b4\u0100cu\u3a06\u3a0br;\uc000\ud835\udccb\u0100bp\u3a10\u3a18n\u0100Ee\u3980\u3a16\xbb\u397en\u0100Ee\u3992\u3a1e\xbb\u3990igzag;\u699a\u0380cefoprs\u3a36\u3a3b\u3a56\u3a5b\u3a54\u3a61\u3a6airc;\u4175\u0100di\u3a40\u3a51\u0100bg\u3a45\u3a49ar;\u6a5fe\u0100;q\u15fa\u3a4f;\u6259erp;\u6118r;\uc000\ud835\udd34pf;\uc000\ud835\udd68\u0100;e\u1479\u3a66at\xe8\u1479cr;\uc000\ud835\udccc\u0ae3\u178e\u3a87\0\u3a8b\0\u3a90\u3a9b\0\0\u3a9d\u3aa8\u3aab\u3aaf\0\0\u3ac3\u3ace\0\u3ad8\u17dc\u17dftr\xe9\u17d1r;\uc000\ud835\udd35\u0100Aa\u3a94\u3a97r\xf2\u03c3r\xf2\u09f6;\u43be\u0100Aa\u3aa1\u3aa4r\xf2\u03b8r\xf2\u09eba\xf0\u2713is;\u62fb\u0180dpt\u17a4\u3ab5\u3abe\u0100fl\u3aba\u17a9;\uc000\ud835\udd69im\xe5\u17b2\u0100Aa\u3ac7\u3acar\xf2\u03cer\xf2\u0a01\u0100cq\u3ad2\u17b8r;\uc000\ud835\udccd\u0100pt\u17d6\u3adcr\xe9\u17d4\u0400acefiosu\u3af0\u3afd\u3b08\u3b0c\u3b11\u3b15\u3b1b\u3b21c\u0100uy\u3af6\u3afbte\u803b\xfd\u40fd;\u444f\u0100iy\u3b02\u3b06rc;\u4177;\u444bn\u803b\xa5\u40a5r;\uc000\ud835\udd36cy;\u4457pf;\uc000\ud835\udd6acr;\uc000\ud835\udcce\u0100cm\u3b26\u3b29y;\u444el\u803b\xff\u40ff\u0500acdefhiosw\u3b42\u3b48\u3b54\u3b58\u3b64\u3b69\u3b6d\u3b74\u3b7a\u3b80cute;\u417a\u0100ay\u3b4d\u3b52ron;\u417e;\u4437ot;\u417c\u0100et\u3b5d\u3b61tr\xe6\u155fa;\u43b6r;\uc000\ud835\udd37cy;\u4436grarr;\u61ddpf;\uc000\ud835\udd6bcr;\uc000\ud835\udccf\u0100jn\u3b85\u3b87;\u600dj;\u600c" |
| | | .split("") |
| | | .map((c) => c.charCodeAt(0))); |
| | | |
| | | // Generated using scripts/write-decode-map.ts |
| | | var xmlDecodeTree = new Uint16Array( |
| | | // prettier-ignore |
| | | "\u0200aglq\t\x15\x18\x1b\u026d\x0f\0\0\x12p;\u4026os;\u4027t;\u403et;\u403cuot;\u4022" |
| | | .split("") |
| | | .map((c) => c.charCodeAt(0))); |
| | | |
| | | // Adapted from https://github.com/mathiasbynens/he/blob/36afe179392226cf1b6ccdb16ebbb7a5a844d93a/src/he.js#L106-L134 |
| | | var _a$1; |
| | | const decodeMap = new Map([ |
| | |
| | | * Polyfill for `String.fromCodePoint`. It is used to create a string from a Unicode code point. |
| | | */ |
| | | const fromCodePoint = |
| | | // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition, node/no-unsupported-features/es-builtins |
| | | (_a$1 = String.fromCodePoint) !== null && _a$1 !== void 0 ? _a$1 : function (codePoint) { |
| | | // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition, n/no-unsupported-features/es-builtins |
| | | (_a$1 = String.fromCodePoint) !== null && _a$1 !== void 0 ? _a$1 : ((codePoint) => { |
| | | let output = ""; |
| | | if (codePoint > 0xffff) { |
| | | codePoint -= 0x10000; |
| | | output += String.fromCharCode(((codePoint >>> 10) & 0x3ff) | 0xd800); |
| | | codePoint = 0xdc00 | (codePoint & 0x3ff); |
| | | if (codePoint > 65535) { |
| | | codePoint -= 65536; |
| | | output += String.fromCharCode(((codePoint >>> 10) & 1023) | 55296); |
| | | codePoint = 56320 | (codePoint & 1023); |
| | | } |
| | | output += String.fromCharCode(codePoint); |
| | | return output; |
| | | }; |
| | | }); |
| | | /** |
| | | * Replace the given code point with a replacement character if it is a |
| | | * surrogate or is outside the valid range. Otherwise return the code |
| | |
| | | */ |
| | | function replaceCodePoint(codePoint) { |
| | | var _a; |
| | | if ((codePoint >= 0xd800 && codePoint <= 0xdfff) || codePoint > 0x10ffff) { |
| | | return 0xfffd; |
| | | if ((codePoint >= 55296 && codePoint <= 57343) || |
| | | codePoint > 1114111) { |
| | | return 65533; |
| | | } |
| | | return (_a = decodeMap.get(codePoint)) !== null && _a !== void 0 ? _a : codePoint; |
| | | } |
| | | |
| | | var global$1 = (typeof global !== "undefined" ? global : |
| | | typeof self !== "undefined" ? self : |
| | | typeof window !== "undefined" ? window : {}); |
| | | |
| | | var lookup = []; |
| | | var revLookup = []; |
| | | var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array; |
| | | var inited = false; |
| | | function init () { |
| | | inited = true; |
| | | var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; |
| | | for (var i = 0, len = code.length; i < len; ++i) { |
| | | lookup[i] = code[i]; |
| | | revLookup[code.charCodeAt(i)] = i; |
| | | } |
| | | |
| | | revLookup['-'.charCodeAt(0)] = 62; |
| | | revLookup['_'.charCodeAt(0)] = 63; |
| | | } |
| | | |
| | | function toByteArray (b64) { |
| | | if (!inited) { |
| | | init(); |
| | | } |
| | | var i, j, l, tmp, placeHolders, arr; |
| | | var len = b64.length; |
| | | |
| | | if (len % 4 > 0) { |
| | | throw new Error('Invalid string. Length must be a multiple of 4') |
| | | } |
| | | |
| | | // the number of equal signs (place holders) |
| | | // if there are two placeholders, than the two characters before it |
| | | // represent one byte |
| | | // if there is only one, then the three characters before it represent 2 bytes |
| | | // this is just a cheap hack to not do indexOf twice |
| | | placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0; |
| | | |
| | | // base64 is 4/3 + up to two characters of the original data |
| | | arr = new Arr(len * 3 / 4 - placeHolders); |
| | | |
| | | // if there are placeholders, only get up to the last complete 4 chars |
| | | l = placeHolders > 0 ? len - 4 : len; |
| | | |
| | | var L = 0; |
| | | |
| | | for (i = 0, j = 0; i < l; i += 4, j += 3) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)]; |
| | | arr[L++] = (tmp >> 16) & 0xFF; |
| | | arr[L++] = (tmp >> 8) & 0xFF; |
| | | arr[L++] = tmp & 0xFF; |
| | | } |
| | | |
| | | if (placeHolders === 2) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4); |
| | | arr[L++] = tmp & 0xFF; |
| | | } else if (placeHolders === 1) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2); |
| | | arr[L++] = (tmp >> 8) & 0xFF; |
| | | arr[L++] = tmp & 0xFF; |
| | | } |
| | | |
| | | return arr |
| | | } |
| | | |
| | | function tripletToBase64 (num) { |
| | | return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F] |
| | | } |
| | | |
| | | function encodeChunk (uint8, start, end) { |
| | | var tmp; |
| | | var output = []; |
| | | for (var i = start; i < end; i += 3) { |
| | | tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]); |
| | | output.push(tripletToBase64(tmp)); |
| | | } |
| | | return output.join('') |
| | | } |
| | | |
| | | function fromByteArray (uint8) { |
| | | if (!inited) { |
| | | init(); |
| | | } |
| | | var tmp; |
| | | var len = uint8.length; |
| | | var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes |
| | | var output = ''; |
| | | var parts = []; |
| | | var maxChunkLength = 16383; // must be multiple of 3 |
| | | |
| | | // go through the array every three bytes, we'll deal with trailing stuff later |
| | | for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { |
| | | parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength))); |
| | | } |
| | | |
| | | // pad the end with zeros, but make sure to not forget the extra bytes |
| | | if (extraBytes === 1) { |
| | | tmp = uint8[len - 1]; |
| | | output += lookup[tmp >> 2]; |
| | | output += lookup[(tmp << 4) & 0x3F]; |
| | | output += '=='; |
| | | } else if (extraBytes === 2) { |
| | | tmp = (uint8[len - 2] << 8) + (uint8[len - 1]); |
| | | output += lookup[tmp >> 10]; |
| | | output += lookup[(tmp >> 4) & 0x3F]; |
| | | output += lookup[(tmp << 2) & 0x3F]; |
| | | output += '='; |
| | | } |
| | | |
| | | parts.push(output); |
| | | |
| | | return parts.join('') |
| | | } |
| | | |
| | | function read (buffer, offset, isLE, mLen, nBytes) { |
| | | var e, m; |
| | | var eLen = nBytes * 8 - mLen - 1; |
| | | var eMax = (1 << eLen) - 1; |
| | | var eBias = eMax >> 1; |
| | | var nBits = -7; |
| | | var i = isLE ? (nBytes - 1) : 0; |
| | | var d = isLE ? -1 : 1; |
| | | var s = buffer[offset + i]; |
| | | |
| | | i += d; |
| | | |
| | | e = s & ((1 << (-nBits)) - 1); |
| | | s >>= (-nBits); |
| | | nBits += eLen; |
| | | for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {} |
| | | |
| | | m = e & ((1 << (-nBits)) - 1); |
| | | e >>= (-nBits); |
| | | nBits += mLen; |
| | | for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {} |
| | | |
| | | if (e === 0) { |
| | | e = 1 - eBias; |
| | | } else if (e === eMax) { |
| | | return m ? NaN : ((s ? -1 : 1) * Infinity) |
| | | } else { |
| | | m = m + Math.pow(2, mLen); |
| | | e = e - eBias; |
| | | } |
| | | return (s ? -1 : 1) * m * Math.pow(2, e - mLen) |
| | | } |
| | | |
| | | function write (buffer, value, offset, isLE, mLen, nBytes) { |
| | | var e, m, c; |
| | | var eLen = nBytes * 8 - mLen - 1; |
| | | var eMax = (1 << eLen) - 1; |
| | | var eBias = eMax >> 1; |
| | | var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0); |
| | | var i = isLE ? 0 : (nBytes - 1); |
| | | var d = isLE ? 1 : -1; |
| | | var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0; |
| | | |
| | | value = Math.abs(value); |
| | | |
| | | if (isNaN(value) || value === Infinity) { |
| | | m = isNaN(value) ? 1 : 0; |
| | | e = eMax; |
| | | } else { |
| | | e = Math.floor(Math.log(value) / Math.LN2); |
| | | if (value * (c = Math.pow(2, -e)) < 1) { |
| | | e--; |
| | | c *= 2; |
| | | } |
| | | if (e + eBias >= 1) { |
| | | value += rt / c; |
| | | } else { |
| | | value += rt * Math.pow(2, 1 - eBias); |
| | | } |
| | | if (value * c >= 2) { |
| | | e++; |
| | | c /= 2; |
| | | } |
| | | |
| | | if (e + eBias >= eMax) { |
| | | m = 0; |
| | | e = eMax; |
| | | } else if (e + eBias >= 1) { |
| | | m = (value * c - 1) * Math.pow(2, mLen); |
| | | e = e + eBias; |
| | | } else { |
| | | m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen); |
| | | e = 0; |
| | | } |
| | | } |
| | | |
| | | for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {} |
| | | |
| | | e = (e << mLen) | m; |
| | | eLen += mLen; |
| | | for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {} |
| | | |
| | | buffer[offset + i - d] |= s * 128; |
| | | } |
| | | |
| | | var toString$1 = {}.toString; |
| | | |
| | | var isArray$2 = Array.isArray || function (arr) { |
| | | return toString$1.call(arr) == '[object Array]'; |
| | | }; |
| | | |
| | | /*! |
| | | * The buffer module from node.js, for the browser. |
| | | * |
| | | * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> |
| | | * @license MIT |
| | | */ |
| | | /* eslint-disable no-proto */ |
| | | |
| | | |
| | | var INSPECT_MAX_BYTES = 50; |
| | | |
| | | /** |
| | | * If `Buffer.TYPED_ARRAY_SUPPORT`: |
| | | * === true Use Uint8Array implementation (fastest) |
| | | * === false Use Object implementation (most compatible, even IE6) |
| | | * |
| | | * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, |
| | | * Opera 11.6+, iOS 4.2+. |
| | | * |
| | | * Due to various browser bugs, sometimes the Object implementation will be used even |
| | | * when the browser supports typed arrays. |
| | | * |
| | | * Note: |
| | | * |
| | | * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances, |
| | | * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. |
| | | * |
| | | * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. |
| | | * |
| | | * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of |
| | | * incorrect length in some situations. |
| | | |
| | | * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they |
| | | * get the Object implementation, which is slower but behaves correctly. |
| | | */ |
| | | Buffer$1.TYPED_ARRAY_SUPPORT = global$1.TYPED_ARRAY_SUPPORT !== undefined |
| | | ? global$1.TYPED_ARRAY_SUPPORT |
| | | : true; |
| | | |
| | | /* |
| | | * Export kMaxLength after typed array support is determined. |
| | | */ |
| | | kMaxLength(); |
| | | |
| | | function kMaxLength () { |
| | | return Buffer$1.TYPED_ARRAY_SUPPORT |
| | | ? 0x7fffffff |
| | | : 0x3fffffff |
| | | } |
| | | |
| | | function createBuffer (that, length) { |
| | | if (kMaxLength() < length) { |
| | | throw new RangeError('Invalid typed array length') |
| | | } |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // Return an augmented `Uint8Array` instance, for best performance |
| | | that = new Uint8Array(length); |
| | | that.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | // Fallback: Return an object instance of the Buffer class |
| | | if (that === null) { |
| | | that = new Buffer$1(length); |
| | | } |
| | | that.length = length; |
| | | } |
| | | |
| | | return that |
| | | } |
| | | |
| | | /** |
| | | * The Buffer constructor returns instances of `Uint8Array` that have their |
| | | * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of |
| | | * `Uint8Array`, so the returned instances will have all the node `Buffer` methods |
| | | * and the `Uint8Array` methods. Square bracket notation works as expected -- it |
| | | * returns a single octet. |
| | | * |
| | | * The `Uint8Array` prototype remains unmodified. |
| | | */ |
| | | |
| | | function Buffer$1 (arg, encodingOrOffset, length) { |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer$1)) { |
| | | return new Buffer$1(arg, encodingOrOffset, length) |
| | | } |
| | | |
| | | // Common case. |
| | | if (typeof arg === 'number') { |
| | | if (typeof encodingOrOffset === 'string') { |
| | | throw new Error( |
| | | 'If encoding is specified then the first argument must be a string' |
| | | ) |
| | | } |
| | | return allocUnsafe(this, arg) |
| | | } |
| | | return from(this, arg, encodingOrOffset, length) |
| | | } |
| | | |
| | | Buffer$1.poolSize = 8192; // not used by this implementation |
| | | |
| | | // TODO: Legacy, not needed anymore. Remove in next major version. |
| | | Buffer$1._augment = function (arr) { |
| | | arr.__proto__ = Buffer$1.prototype; |
| | | return arr |
| | | }; |
| | | |
| | | function from (that, value, encodingOrOffset, length) { |
| | | if (typeof value === 'number') { |
| | | throw new TypeError('"value" argument must not be a number') |
| | | } |
| | | |
| | | if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) { |
| | | return fromArrayBuffer(that, value, encodingOrOffset, length) |
| | | } |
| | | |
| | | if (typeof value === 'string') { |
| | | return fromString(that, value, encodingOrOffset) |
| | | } |
| | | |
| | | return fromObject(that, value) |
| | | } |
| | | |
| | | /** |
| | | * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError |
| | | * if value is a number. |
| | | * Buffer.from(str[, encoding]) |
| | | * Buffer.from(array) |
| | | * Buffer.from(buffer) |
| | | * Buffer.from(arrayBuffer[, byteOffset[, length]]) |
| | | **/ |
| | | Buffer$1.from = function (value, encodingOrOffset, length) { |
| | | return from(null, value, encodingOrOffset, length) |
| | | }; |
| | | |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | Buffer$1.prototype.__proto__ = Uint8Array.prototype; |
| | | Buffer$1.__proto__ = Uint8Array; |
| | | if (typeof Symbol !== 'undefined' && Symbol.species && |
| | | Buffer$1[Symbol.species] === Buffer$1) ; |
| | | } |
| | | |
| | | function assertSize (size) { |
| | | if (typeof size !== 'number') { |
| | | throw new TypeError('"size" argument must be a number') |
| | | } else if (size < 0) { |
| | | throw new RangeError('"size" argument must not be negative') |
| | | } |
| | | } |
| | | |
| | | function alloc (that, size, fill, encoding) { |
| | | assertSize(size); |
| | | if (size <= 0) { |
| | | return createBuffer(that, size) |
| | | } |
| | | if (fill !== undefined) { |
| | | // Only pay attention to encoding if it's a string. This |
| | | // prevents accidentally sending in a number that would |
| | | // be interpretted as a start offset. |
| | | return typeof encoding === 'string' |
| | | ? createBuffer(that, size).fill(fill, encoding) |
| | | : createBuffer(that, size).fill(fill) |
| | | } |
| | | return createBuffer(that, size) |
| | | } |
| | | |
| | | /** |
| | | * Creates a new filled Buffer instance. |
| | | * alloc(size[, fill[, encoding]]) |
| | | **/ |
| | | Buffer$1.alloc = function (size, fill, encoding) { |
| | | return alloc(null, size, fill, encoding) |
| | | }; |
| | | |
| | | function allocUnsafe (that, size) { |
| | | assertSize(size); |
| | | that = createBuffer(that, size < 0 ? 0 : checked(size) | 0); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | for (var i = 0; i < size; ++i) { |
| | | that[i] = 0; |
| | | } |
| | | } |
| | | return that |
| | | } |
| | | |
| | | /** |
| | | * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance. |
| | | * */ |
| | | Buffer$1.allocUnsafe = function (size) { |
| | | return allocUnsafe(null, size) |
| | | }; |
| | | /** |
| | | * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance. |
| | | */ |
| | | Buffer$1.allocUnsafeSlow = function (size) { |
| | | return allocUnsafe(null, size) |
| | | }; |
| | | |
| | | function fromString (that, string, encoding) { |
| | | if (typeof encoding !== 'string' || encoding === '') { |
| | | encoding = 'utf8'; |
| | | } |
| | | |
| | | if (!Buffer$1.isEncoding(encoding)) { |
| | | throw new TypeError('"encoding" must be a valid string encoding') |
| | | } |
| | | |
| | | var length = byteLength(string, encoding) | 0; |
| | | that = createBuffer(that, length); |
| | | |
| | | var actual = that.write(string, encoding); |
| | | |
| | | if (actual !== length) { |
| | | // Writing a hex string, for example, that contains invalid characters will |
| | | // cause everything after the first invalid character to be ignored. (e.g. |
| | | // 'abxxcd' will be treated as 'ab') |
| | | that = that.slice(0, actual); |
| | | } |
| | | |
| | | return that |
| | | } |
| | | |
| | | function fromArrayLike (that, array) { |
| | | var length = array.length < 0 ? 0 : checked(array.length) | 0; |
| | | that = createBuffer(that, length); |
| | | for (var i = 0; i < length; i += 1) { |
| | | that[i] = array[i] & 255; |
| | | } |
| | | return that |
| | | } |
| | | |
| | | function fromArrayBuffer (that, array, byteOffset, length) { |
| | | array.byteLength; // this throws if `array` is not a valid ArrayBuffer |
| | | |
| | | if (byteOffset < 0 || array.byteLength < byteOffset) { |
| | | throw new RangeError('\'offset\' is out of bounds') |
| | | } |
| | | |
| | | if (array.byteLength < byteOffset + (length || 0)) { |
| | | throw new RangeError('\'length\' is out of bounds') |
| | | } |
| | | |
| | | if (byteOffset === undefined && length === undefined) { |
| | | array = new Uint8Array(array); |
| | | } else if (length === undefined) { |
| | | array = new Uint8Array(array, byteOffset); |
| | | } else { |
| | | array = new Uint8Array(array, byteOffset, length); |
| | | } |
| | | |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // Return an augmented `Uint8Array` instance, for best performance |
| | | that = array; |
| | | that.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | // Fallback: Return an object instance of the Buffer class |
| | | that = fromArrayLike(that, array); |
| | | } |
| | | return that |
| | | } |
| | | |
| | | function fromObject (that, obj) { |
| | | if (internalIsBuffer(obj)) { |
| | | var len = checked(obj.length) | 0; |
| | | that = createBuffer(that, len); |
| | | |
| | | if (that.length === 0) { |
| | | return that |
| | | } |
| | | |
| | | obj.copy(that, 0, 0, len); |
| | | return that |
| | | } |
| | | |
| | | if (obj) { |
| | | if ((typeof ArrayBuffer !== 'undefined' && |
| | | obj.buffer instanceof ArrayBuffer) || 'length' in obj) { |
| | | if (typeof obj.length !== 'number' || isnan(obj.length)) { |
| | | return createBuffer(that, 0) |
| | | } |
| | | return fromArrayLike(that, obj) |
| | | } |
| | | |
| | | if (obj.type === 'Buffer' && isArray$2(obj.data)) { |
| | | return fromArrayLike(that, obj.data) |
| | | } |
| | | } |
| | | |
| | | throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.') |
| | | } |
| | | |
| | | function checked (length) { |
| | | // Note: cannot use `length < kMaxLength()` here because that fails when |
| | | // length is NaN (which is otherwise coerced to zero.) |
| | | if (length >= kMaxLength()) { |
| | | throw new RangeError('Attempt to allocate Buffer larger than maximum ' + |
| | | 'size: 0x' + kMaxLength().toString(16) + ' bytes') |
| | | } |
| | | return length | 0 |
| | | } |
| | | Buffer$1.isBuffer = isBuffer$1; |
| | | function internalIsBuffer (b) { |
| | | return !!(b != null && b._isBuffer) |
| | | } |
| | | |
| | | Buffer$1.compare = function compare (a, b) { |
| | | if (!internalIsBuffer(a) || !internalIsBuffer(b)) { |
| | | throw new TypeError('Arguments must be Buffers') |
| | | } |
| | | |
| | | if (a === b) return 0 |
| | | |
| | | var x = a.length; |
| | | var y = b.length; |
| | | |
| | | for (var i = 0, len = Math.min(x, y); i < len; ++i) { |
| | | if (a[i] !== b[i]) { |
| | | x = a[i]; |
| | | y = b[i]; |
| | | break |
| | | } |
| | | } |
| | | |
| | | if (x < y) return -1 |
| | | if (y < x) return 1 |
| | | return 0 |
| | | }; |
| | | |
| | | Buffer$1.isEncoding = function isEncoding (encoding) { |
| | | switch (String(encoding).toLowerCase()) { |
| | | case 'hex': |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | case 'ascii': |
| | | case 'latin1': |
| | | case 'binary': |
| | | case 'base64': |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return true |
| | | default: |
| | | return false |
| | | } |
| | | }; |
| | | |
| | | Buffer$1.concat = function concat (list, length) { |
| | | if (!isArray$2(list)) { |
| | | throw new TypeError('"list" argument must be an Array of Buffers') |
| | | } |
| | | |
| | | if (list.length === 0) { |
| | | return Buffer$1.alloc(0) |
| | | } |
| | | |
| | | var i; |
| | | if (length === undefined) { |
| | | length = 0; |
| | | for (i = 0; i < list.length; ++i) { |
| | | length += list[i].length; |
| | | } |
| | | } |
| | | |
| | | var buffer = Buffer$1.allocUnsafe(length); |
| | | var pos = 0; |
| | | for (i = 0; i < list.length; ++i) { |
| | | var buf = list[i]; |
| | | if (!internalIsBuffer(buf)) { |
| | | throw new TypeError('"list" argument must be an Array of Buffers') |
| | | } |
| | | buf.copy(buffer, pos); |
| | | pos += buf.length; |
| | | } |
| | | return buffer |
| | | }; |
| | | |
| | | function byteLength (string, encoding) { |
| | | if (internalIsBuffer(string)) { |
| | | return string.length |
| | | } |
| | | if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' && |
| | | (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) { |
| | | return string.byteLength |
| | | } |
| | | if (typeof string !== 'string') { |
| | | string = '' + string; |
| | | } |
| | | |
| | | var len = string.length; |
| | | if (len === 0) return 0 |
| | | |
| | | // Use a for loop to avoid recursion |
| | | var loweredCase = false; |
| | | for (;;) { |
| | | switch (encoding) { |
| | | case 'ascii': |
| | | case 'latin1': |
| | | case 'binary': |
| | | return len |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | case undefined: |
| | | return utf8ToBytes(string).length |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return len * 2 |
| | | case 'hex': |
| | | return len >>> 1 |
| | | case 'base64': |
| | | return base64ToBytes(string).length |
| | | default: |
| | | if (loweredCase) return utf8ToBytes(string).length // assume utf8 |
| | | encoding = ('' + encoding).toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | } |
| | | Buffer$1.byteLength = byteLength; |
| | | |
| | | function slowToString (encoding, start, end) { |
| | | var loweredCase = false; |
| | | |
| | | // No need to verify that "this.length <= MAX_UINT32" since it's a read-only |
| | | // property of a typed array. |
| | | |
| | | // This behaves neither like String nor Uint8Array in that we set start/end |
| | | // to their upper/lower bounds if the value passed is out of range. |
| | | // undefined is handled specially as per ECMA-262 6th Edition, |
| | | // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization. |
| | | if (start === undefined || start < 0) { |
| | | start = 0; |
| | | } |
| | | // Return early if start > this.length. Done here to prevent potential uint32 |
| | | // coercion fail below. |
| | | if (start > this.length) { |
| | | return '' |
| | | } |
| | | |
| | | if (end === undefined || end > this.length) { |
| | | end = this.length; |
| | | } |
| | | |
| | | if (end <= 0) { |
| | | return '' |
| | | } |
| | | |
| | | // Force coersion to uint32. This will also coerce falsey/NaN values to 0. |
| | | end >>>= 0; |
| | | start >>>= 0; |
| | | |
| | | if (end <= start) { |
| | | return '' |
| | | } |
| | | |
| | | if (!encoding) encoding = 'utf8'; |
| | | |
| | | while (true) { |
| | | switch (encoding) { |
| | | case 'hex': |
| | | return hexSlice(this, start, end) |
| | | |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | return utf8Slice(this, start, end) |
| | | |
| | | case 'ascii': |
| | | return asciiSlice(this, start, end) |
| | | |
| | | case 'latin1': |
| | | case 'binary': |
| | | return latin1Slice(this, start, end) |
| | | |
| | | case 'base64': |
| | | return base64Slice(this, start, end) |
| | | |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return utf16leSlice(this, start, end) |
| | | |
| | | default: |
| | | if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) |
| | | encoding = (encoding + '').toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | } |
| | | |
| | | // The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect |
| | | // Buffer instances. |
| | | Buffer$1.prototype._isBuffer = true; |
| | | |
| | | function swap (b, n, m) { |
| | | var i = b[n]; |
| | | b[n] = b[m]; |
| | | b[m] = i; |
| | | } |
| | | |
| | | Buffer$1.prototype.swap16 = function swap16 () { |
| | | var len = this.length; |
| | | if (len % 2 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 16-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 2) { |
| | | swap(this, i, i + 1); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.swap32 = function swap32 () { |
| | | var len = this.length; |
| | | if (len % 4 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 32-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 4) { |
| | | swap(this, i, i + 3); |
| | | swap(this, i + 1, i + 2); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.swap64 = function swap64 () { |
| | | var len = this.length; |
| | | if (len % 8 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 64-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 8) { |
| | | swap(this, i, i + 7); |
| | | swap(this, i + 1, i + 6); |
| | | swap(this, i + 2, i + 5); |
| | | swap(this, i + 3, i + 4); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.toString = function toString () { |
| | | var length = this.length | 0; |
| | | if (length === 0) return '' |
| | | if (arguments.length === 0) return utf8Slice(this, 0, length) |
| | | return slowToString.apply(this, arguments) |
| | | }; |
| | | |
| | | Buffer$1.prototype.equals = function equals (b) { |
| | | if (!internalIsBuffer(b)) throw new TypeError('Argument must be a Buffer') |
| | | if (this === b) return true |
| | | return Buffer$1.compare(this, b) === 0 |
| | | }; |
| | | |
| | | Buffer$1.prototype.inspect = function inspect () { |
| | | var str = ''; |
| | | var max = INSPECT_MAX_BYTES; |
| | | if (this.length > 0) { |
| | | str = this.toString('hex', 0, max).match(/.{2}/g).join(' '); |
| | | if (this.length > max) str += ' ... '; |
| | | } |
| | | return '<Buffer ' + str + '>' |
| | | }; |
| | | |
| | | Buffer$1.prototype.compare = function compare (target, start, end, thisStart, thisEnd) { |
| | | if (!internalIsBuffer(target)) { |
| | | throw new TypeError('Argument must be a Buffer') |
| | | } |
| | | |
| | | if (start === undefined) { |
| | | start = 0; |
| | | } |
| | | if (end === undefined) { |
| | | end = target ? target.length : 0; |
| | | } |
| | | if (thisStart === undefined) { |
| | | thisStart = 0; |
| | | } |
| | | if (thisEnd === undefined) { |
| | | thisEnd = this.length; |
| | | } |
| | | |
| | | if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) { |
| | | throw new RangeError('out of range index') |
| | | } |
| | | |
| | | if (thisStart >= thisEnd && start >= end) { |
| | | return 0 |
| | | } |
| | | if (thisStart >= thisEnd) { |
| | | return -1 |
| | | } |
| | | if (start >= end) { |
| | | return 1 |
| | | } |
| | | |
| | | start >>>= 0; |
| | | end >>>= 0; |
| | | thisStart >>>= 0; |
| | | thisEnd >>>= 0; |
| | | |
| | | if (this === target) return 0 |
| | | |
| | | var x = thisEnd - thisStart; |
| | | var y = end - start; |
| | | var len = Math.min(x, y); |
| | | |
| | | var thisCopy = this.slice(thisStart, thisEnd); |
| | | var targetCopy = target.slice(start, end); |
| | | |
| | | for (var i = 0; i < len; ++i) { |
| | | if (thisCopy[i] !== targetCopy[i]) { |
| | | x = thisCopy[i]; |
| | | y = targetCopy[i]; |
| | | break |
| | | } |
| | | } |
| | | |
| | | if (x < y) return -1 |
| | | if (y < x) return 1 |
| | | return 0 |
| | | }; |
| | | |
| | | // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, |
| | | // OR the last index of `val` in `buffer` at offset <= `byteOffset`. |
| | | // |
| | | // Arguments: |
| | | // - buffer - a Buffer to search |
| | | // - val - a string, Buffer, or number |
| | | // - byteOffset - an index into `buffer`; will be clamped to an int32 |
| | | // - encoding - an optional encoding, relevant is val is a string |
| | | // - dir - true for indexOf, false for lastIndexOf |
| | | function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) { |
| | | // Empty buffer means no match |
| | | if (buffer.length === 0) return -1 |
| | | |
| | | // Normalize byteOffset |
| | | if (typeof byteOffset === 'string') { |
| | | encoding = byteOffset; |
| | | byteOffset = 0; |
| | | } else if (byteOffset > 0x7fffffff) { |
| | | byteOffset = 0x7fffffff; |
| | | } else if (byteOffset < -2147483648) { |
| | | byteOffset = -2147483648; |
| | | } |
| | | byteOffset = +byteOffset; // Coerce to Number. |
| | | if (isNaN(byteOffset)) { |
| | | // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer |
| | | byteOffset = dir ? 0 : (buffer.length - 1); |
| | | } |
| | | |
| | | // Normalize byteOffset: negative offsets start from the end of the buffer |
| | | if (byteOffset < 0) byteOffset = buffer.length + byteOffset; |
| | | if (byteOffset >= buffer.length) { |
| | | if (dir) return -1 |
| | | else byteOffset = buffer.length - 1; |
| | | } else if (byteOffset < 0) { |
| | | if (dir) byteOffset = 0; |
| | | else return -1 |
| | | } |
| | | |
| | | // Normalize val |
| | | if (typeof val === 'string') { |
| | | val = Buffer$1.from(val, encoding); |
| | | } |
| | | |
| | | // Finally, search either indexOf (if dir is true) or lastIndexOf |
| | | if (internalIsBuffer(val)) { |
| | | // Special case: looking for empty string/buffer always fails |
| | | if (val.length === 0) { |
| | | return -1 |
| | | } |
| | | return arrayIndexOf(buffer, val, byteOffset, encoding, dir) |
| | | } else if (typeof val === 'number') { |
| | | val = val & 0xFF; // Search for a byte value [0-255] |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT && |
| | | typeof Uint8Array.prototype.indexOf === 'function') { |
| | | if (dir) { |
| | | return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset) |
| | | } else { |
| | | return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset) |
| | | } |
| | | } |
| | | return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir) |
| | | } |
| | | |
| | | throw new TypeError('val must be string, number or Buffer') |
| | | } |
| | | |
| | | function arrayIndexOf (arr, val, byteOffset, encoding, dir) { |
| | | var indexSize = 1; |
| | | var arrLength = arr.length; |
| | | var valLength = val.length; |
| | | |
| | | if (encoding !== undefined) { |
| | | encoding = String(encoding).toLowerCase(); |
| | | if (encoding === 'ucs2' || encoding === 'ucs-2' || |
| | | encoding === 'utf16le' || encoding === 'utf-16le') { |
| | | if (arr.length < 2 || val.length < 2) { |
| | | return -1 |
| | | } |
| | | indexSize = 2; |
| | | arrLength /= 2; |
| | | valLength /= 2; |
| | | byteOffset /= 2; |
| | | } |
| | | } |
| | | |
| | | function read (buf, i) { |
| | | if (indexSize === 1) { |
| | | return buf[i] |
| | | } else { |
| | | return buf.readUInt16BE(i * indexSize) |
| | | } |
| | | } |
| | | |
| | | var i; |
| | | if (dir) { |
| | | var foundIndex = -1; |
| | | for (i = byteOffset; i < arrLength; i++) { |
| | | if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) { |
| | | if (foundIndex === -1) foundIndex = i; |
| | | if (i - foundIndex + 1 === valLength) return foundIndex * indexSize |
| | | } else { |
| | | if (foundIndex !== -1) i -= i - foundIndex; |
| | | foundIndex = -1; |
| | | } |
| | | } |
| | | } else { |
| | | if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength; |
| | | for (i = byteOffset; i >= 0; i--) { |
| | | var found = true; |
| | | for (var j = 0; j < valLength; j++) { |
| | | if (read(arr, i + j) !== read(val, j)) { |
| | | found = false; |
| | | break |
| | | } |
| | | } |
| | | if (found) return i |
| | | } |
| | | } |
| | | |
| | | return -1 |
| | | } |
| | | |
| | | Buffer$1.prototype.includes = function includes (val, byteOffset, encoding) { |
| | | return this.indexOf(val, byteOffset, encoding) !== -1 |
| | | }; |
| | | |
| | | Buffer$1.prototype.indexOf = function indexOf (val, byteOffset, encoding) { |
| | | return bidirectionalIndexOf(this, val, byteOffset, encoding, true) |
| | | }; |
| | | |
| | | Buffer$1.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) { |
| | | return bidirectionalIndexOf(this, val, byteOffset, encoding, false) |
| | | }; |
| | | |
| | | function hexWrite (buf, string, offset, length) { |
| | | offset = Number(offset) || 0; |
| | | var remaining = buf.length - offset; |
| | | if (!length) { |
| | | length = remaining; |
| | | } else { |
| | | length = Number(length); |
| | | if (length > remaining) { |
| | | length = remaining; |
| | | } |
| | | } |
| | | |
| | | // must be an even number of digits |
| | | var strLen = string.length; |
| | | if (strLen % 2 !== 0) throw new TypeError('Invalid hex string') |
| | | |
| | | if (length > strLen / 2) { |
| | | length = strLen / 2; |
| | | } |
| | | for (var i = 0; i < length; ++i) { |
| | | var parsed = parseInt(string.substr(i * 2, 2), 16); |
| | | if (isNaN(parsed)) return i |
| | | buf[offset + i] = parsed; |
| | | } |
| | | return i |
| | | } |
| | | |
| | | function utf8Write (buf, string, offset, length) { |
| | | return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) |
| | | } |
| | | |
| | | function asciiWrite (buf, string, offset, length) { |
| | | return blitBuffer(asciiToBytes(string), buf, offset, length) |
| | | } |
| | | |
| | | function latin1Write (buf, string, offset, length) { |
| | | return asciiWrite(buf, string, offset, length) |
| | | } |
| | | |
| | | function base64Write (buf, string, offset, length) { |
| | | return blitBuffer(base64ToBytes(string), buf, offset, length) |
| | | } |
| | | |
| | | function ucs2Write (buf, string, offset, length) { |
| | | return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) |
| | | } |
| | | |
| | | Buffer$1.prototype.write = function write (string, offset, length, encoding) { |
| | | // Buffer#write(string) |
| | | if (offset === undefined) { |
| | | encoding = 'utf8'; |
| | | length = this.length; |
| | | offset = 0; |
| | | // Buffer#write(string, encoding) |
| | | } else if (length === undefined && typeof offset === 'string') { |
| | | encoding = offset; |
| | | length = this.length; |
| | | offset = 0; |
| | | // Buffer#write(string, offset[, length][, encoding]) |
| | | } else if (isFinite(offset)) { |
| | | offset = offset | 0; |
| | | if (isFinite(length)) { |
| | | length = length | 0; |
| | | if (encoding === undefined) encoding = 'utf8'; |
| | | } else { |
| | | encoding = length; |
| | | length = undefined; |
| | | } |
| | | // legacy write(string, encoding, offset, length) - remove in v0.13 |
| | | } else { |
| | | throw new Error( |
| | | 'Buffer.write(string, encoding, offset[, length]) is no longer supported' |
| | | ) |
| | | } |
| | | |
| | | var remaining = this.length - offset; |
| | | if (length === undefined || length > remaining) length = remaining; |
| | | |
| | | if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) { |
| | | throw new RangeError('Attempt to write outside buffer bounds') |
| | | } |
| | | |
| | | if (!encoding) encoding = 'utf8'; |
| | | |
| | | var loweredCase = false; |
| | | for (;;) { |
| | | switch (encoding) { |
| | | case 'hex': |
| | | return hexWrite(this, string, offset, length) |
| | | |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | return utf8Write(this, string, offset, length) |
| | | |
| | | case 'ascii': |
| | | return asciiWrite(this, string, offset, length) |
| | | |
| | | case 'latin1': |
| | | case 'binary': |
| | | return latin1Write(this, string, offset, length) |
| | | |
| | | case 'base64': |
| | | // Warning: maxLength not taken into account in base64Write |
| | | return base64Write(this, string, offset, length) |
| | | |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return ucs2Write(this, string, offset, length) |
| | | |
| | | default: |
| | | if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) |
| | | encoding = ('' + encoding).toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | }; |
| | | |
| | | Buffer$1.prototype.toJSON = function toJSON () { |
| | | return { |
| | | type: 'Buffer', |
| | | data: Array.prototype.slice.call(this._arr || this, 0) |
| | | } |
| | | }; |
| | | |
| | | function base64Slice (buf, start, end) { |
| | | if (start === 0 && end === buf.length) { |
| | | return fromByteArray(buf) |
| | | } else { |
| | | return fromByteArray(buf.slice(start, end)) |
| | | } |
| | | } |
| | | |
| | | function utf8Slice (buf, start, end) { |
| | | end = Math.min(buf.length, end); |
| | | var res = []; |
| | | |
| | | var i = start; |
| | | while (i < end) { |
| | | var firstByte = buf[i]; |
| | | var codePoint = null; |
| | | var bytesPerSequence = (firstByte > 0xEF) ? 4 |
| | | : (firstByte > 0xDF) ? 3 |
| | | : (firstByte > 0xBF) ? 2 |
| | | : 1; |
| | | |
| | | if (i + bytesPerSequence <= end) { |
| | | var secondByte, thirdByte, fourthByte, tempCodePoint; |
| | | |
| | | switch (bytesPerSequence) { |
| | | case 1: |
| | | if (firstByte < 0x80) { |
| | | codePoint = firstByte; |
| | | } |
| | | break |
| | | case 2: |
| | | secondByte = buf[i + 1]; |
| | | if ((secondByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F); |
| | | if (tempCodePoint > 0x7F) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | break |
| | | case 3: |
| | | secondByte = buf[i + 1]; |
| | | thirdByte = buf[i + 2]; |
| | | if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F); |
| | | if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | break |
| | | case 4: |
| | | secondByte = buf[i + 1]; |
| | | thirdByte = buf[i + 2]; |
| | | fourthByte = buf[i + 3]; |
| | | if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F); |
| | | if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | } |
| | | } |
| | | |
| | | if (codePoint === null) { |
| | | // we did not generate a valid codePoint so insert a |
| | | // replacement char (U+FFFD) and advance only 1 byte |
| | | codePoint = 0xFFFD; |
| | | bytesPerSequence = 1; |
| | | } else if (codePoint > 0xFFFF) { |
| | | // encode to utf16 (surrogate pair dance) |
| | | codePoint -= 0x10000; |
| | | res.push(codePoint >>> 10 & 0x3FF | 0xD800); |
| | | codePoint = 0xDC00 | codePoint & 0x3FF; |
| | | } |
| | | |
| | | res.push(codePoint); |
| | | i += bytesPerSequence; |
| | | } |
| | | |
| | | return decodeCodePointsArray(res) |
| | | } |
| | | |
| | | // Based on http://stackoverflow.com/a/22747272/680742, the browser with |
| | | // the lowest limit is Chrome, with 0x10000 args. |
| | | // We go 1 magnitude less, for safety |
| | | var MAX_ARGUMENTS_LENGTH = 0x1000; |
| | | |
| | | function decodeCodePointsArray (codePoints) { |
| | | var len = codePoints.length; |
| | | if (len <= MAX_ARGUMENTS_LENGTH) { |
| | | return String.fromCharCode.apply(String, codePoints) // avoid extra slice() |
| | | } |
| | | |
| | | // Decode in chunks to avoid "call stack size exceeded". |
| | | var res = ''; |
| | | var i = 0; |
| | | while (i < len) { |
| | | res += String.fromCharCode.apply( |
| | | String, |
| | | codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH) |
| | | ); |
| | | } |
| | | return res |
| | | } |
| | | |
| | | function asciiSlice (buf, start, end) { |
| | | var ret = ''; |
| | | end = Math.min(buf.length, end); |
| | | |
| | | for (var i = start; i < end; ++i) { |
| | | ret += String.fromCharCode(buf[i] & 0x7F); |
| | | } |
| | | return ret |
| | | } |
| | | |
| | | function latin1Slice (buf, start, end) { |
| | | var ret = ''; |
| | | end = Math.min(buf.length, end); |
| | | |
| | | for (var i = start; i < end; ++i) { |
| | | ret += String.fromCharCode(buf[i]); |
| | | } |
| | | return ret |
| | | } |
| | | |
| | | function hexSlice (buf, start, end) { |
| | | var len = buf.length; |
| | | |
| | | if (!start || start < 0) start = 0; |
| | | if (!end || end < 0 || end > len) end = len; |
| | | |
| | | var out = ''; |
| | | for (var i = start; i < end; ++i) { |
| | | out += toHex(buf[i]); |
| | | } |
| | | return out |
| | | } |
| | | |
| | | function utf16leSlice (buf, start, end) { |
| | | var bytes = buf.slice(start, end); |
| | | var res = ''; |
| | | for (var i = 0; i < bytes.length; i += 2) { |
| | | res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256); |
| | | } |
| | | return res |
| | | } |
| | | |
| | | Buffer$1.prototype.slice = function slice (start, end) { |
| | | var len = this.length; |
| | | start = ~~start; |
| | | end = end === undefined ? len : ~~end; |
| | | |
| | | if (start < 0) { |
| | | start += len; |
| | | if (start < 0) start = 0; |
| | | } else if (start > len) { |
| | | start = len; |
| | | } |
| | | |
| | | if (end < 0) { |
| | | end += len; |
| | | if (end < 0) end = 0; |
| | | } else if (end > len) { |
| | | end = len; |
| | | } |
| | | |
| | | if (end < start) end = start; |
| | | |
| | | var newBuf; |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | newBuf = this.subarray(start, end); |
| | | newBuf.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | var sliceLen = end - start; |
| | | newBuf = new Buffer$1(sliceLen, undefined); |
| | | for (var i = 0; i < sliceLen; ++i) { |
| | | newBuf[i] = this[i + start]; |
| | | } |
| | | } |
| | | |
| | | return newBuf |
| | | }; |
| | | |
| | | /* |
| | | * Need to make sure that buffer isn't trying to write out of bounds. |
| | | */ |
| | | function checkOffset (offset, ext, length) { |
| | | if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint') |
| | | if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length') |
| | | } |
| | | |
| | | Buffer$1.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var val = this[offset]; |
| | | var mul = 1; |
| | | var i = 0; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | val += this[offset + i] * mul; |
| | | } |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | checkOffset(offset, byteLength, this.length); |
| | | } |
| | | |
| | | var val = this[offset + --byteLength]; |
| | | var mul = 1; |
| | | while (byteLength > 0 && (mul *= 0x100)) { |
| | | val += this[offset + --byteLength] * mul; |
| | | } |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt8 = function readUInt8 (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 1, this.length); |
| | | return this[offset] |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | return this[offset] | (this[offset + 1] << 8) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | return (this[offset] << 8) | this[offset + 1] |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return ((this[offset]) | |
| | | (this[offset + 1] << 8) | |
| | | (this[offset + 2] << 16)) + |
| | | (this[offset + 3] * 0x1000000) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset] * 0x1000000) + |
| | | ((this[offset + 1] << 16) | |
| | | (this[offset + 2] << 8) | |
| | | this[offset + 3]) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var val = this[offset]; |
| | | var mul = 1; |
| | | var i = 0; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | val += this[offset + i] * mul; |
| | | } |
| | | mul *= 0x80; |
| | | |
| | | if (val >= mul) val -= Math.pow(2, 8 * byteLength); |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var i = byteLength; |
| | | var mul = 1; |
| | | var val = this[offset + --i]; |
| | | while (i > 0 && (mul *= 0x100)) { |
| | | val += this[offset + --i] * mul; |
| | | } |
| | | mul *= 0x80; |
| | | |
| | | if (val >= mul) val -= Math.pow(2, 8 * byteLength); |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt8 = function readInt8 (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 1, this.length); |
| | | if (!(this[offset] & 0x80)) return (this[offset]) |
| | | return ((0xff - this[offset] + 1) * -1) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt16LE = function readInt16LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | var val = this[offset] | (this[offset + 1] << 8); |
| | | return (val & 0x8000) ? val | 0xFFFF0000 : val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt16BE = function readInt16BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | var val = this[offset + 1] | (this[offset] << 8); |
| | | return (val & 0x8000) ? val | 0xFFFF0000 : val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt32LE = function readInt32LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset]) | |
| | | (this[offset + 1] << 8) | |
| | | (this[offset + 2] << 16) | |
| | | (this[offset + 3] << 24) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt32BE = function readInt32BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset] << 24) | |
| | | (this[offset + 1] << 16) | |
| | | (this[offset + 2] << 8) | |
| | | (this[offset + 3]) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readFloatLE = function readFloatLE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | return read(this, offset, true, 23, 4) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readFloatBE = function readFloatBE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | return read(this, offset, false, 23, 4) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 8, this.length); |
| | | return read(this, offset, true, 52, 8) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 8, this.length); |
| | | return read(this, offset, false, 52, 8) |
| | | }; |
| | | |
| | | function checkInt (buf, value, offset, ext, max, min) { |
| | | if (!internalIsBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance') |
| | | if (value > max || value < min) throw new RangeError('"value" argument is out of bounds') |
| | | if (offset + ext > buf.length) throw new RangeError('Index out of range') |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | var maxBytes = Math.pow(2, 8 * byteLength) - 1; |
| | | checkInt(this, value, offset, byteLength, maxBytes, 0); |
| | | } |
| | | |
| | | var mul = 1; |
| | | var i = 0; |
| | | this[offset] = value & 0xFF; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | this[offset + i] = (value / mul) & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | var maxBytes = Math.pow(2, 8 * byteLength) - 1; |
| | | checkInt(this, value, offset, byteLength, maxBytes, 0); |
| | | } |
| | | |
| | | var i = byteLength - 1; |
| | | var mul = 1; |
| | | this[offset + i] = value & 0xFF; |
| | | while (--i >= 0 && (mul *= 0x100)) { |
| | | this[offset + i] = (value / mul) & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) value = Math.floor(value); |
| | | this[offset] = (value & 0xff); |
| | | return offset + 1 |
| | | }; |
| | | |
| | | function objectWriteUInt16 (buf, value, offset, littleEndian) { |
| | | if (value < 0) value = 0xffff + value + 1; |
| | | for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) { |
| | | buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>> |
| | | (littleEndian ? i : 1 - i) * 8; |
| | | } |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, true); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 8); |
| | | this[offset + 1] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, false); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | function objectWriteUInt32 (buf, value, offset, littleEndian) { |
| | | if (value < 0) value = 0xffffffff + value + 1; |
| | | for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) { |
| | | buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff; |
| | | } |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset + 3] = (value >>> 24); |
| | | this[offset + 2] = (value >>> 16); |
| | | this[offset + 1] = (value >>> 8); |
| | | this[offset] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, true); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 24); |
| | | this[offset + 1] = (value >>> 16); |
| | | this[offset + 2] = (value >>> 8); |
| | | this[offset + 3] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, false); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) { |
| | | var limit = Math.pow(2, 8 * byteLength - 1); |
| | | |
| | | checkInt(this, value, offset, byteLength, limit - 1, -limit); |
| | | } |
| | | |
| | | var i = 0; |
| | | var mul = 1; |
| | | var sub = 0; |
| | | this[offset] = value & 0xFF; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) { |
| | | sub = 1; |
| | | } |
| | | this[offset + i] = ((value / mul) >> 0) - sub & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) { |
| | | var limit = Math.pow(2, 8 * byteLength - 1); |
| | | |
| | | checkInt(this, value, offset, byteLength, limit - 1, -limit); |
| | | } |
| | | |
| | | var i = byteLength - 1; |
| | | var mul = 1; |
| | | var sub = 0; |
| | | this[offset + i] = value & 0xFF; |
| | | while (--i >= 0 && (mul *= 0x100)) { |
| | | if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) { |
| | | sub = 1; |
| | | } |
| | | this[offset + i] = ((value / mul) >> 0) - sub & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -128); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) value = Math.floor(value); |
| | | if (value < 0) value = 0xff + value + 1; |
| | | this[offset] = (value & 0xff); |
| | | return offset + 1 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, true); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 8); |
| | | this[offset + 1] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, false); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | this[offset + 2] = (value >>> 16); |
| | | this[offset + 3] = (value >>> 24); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, true); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648); |
| | | if (value < 0) value = 0xffffffff + value + 1; |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 24); |
| | | this[offset + 1] = (value >>> 16); |
| | | this[offset + 2] = (value >>> 8); |
| | | this[offset + 3] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, false); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | function checkIEEE754 (buf, value, offset, ext, max, min) { |
| | | if (offset + ext > buf.length) throw new RangeError('Index out of range') |
| | | if (offset < 0) throw new RangeError('Index out of range') |
| | | } |
| | | |
| | | function writeFloat (buf, value, offset, littleEndian, noAssert) { |
| | | if (!noAssert) { |
| | | checkIEEE754(buf, value, offset, 4); |
| | | } |
| | | write(buf, value, offset, littleEndian, 23, 4); |
| | | return offset + 4 |
| | | } |
| | | |
| | | Buffer$1.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) { |
| | | return writeFloat(this, value, offset, true, noAssert) |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) { |
| | | return writeFloat(this, value, offset, false, noAssert) |
| | | }; |
| | | |
| | | function writeDouble (buf, value, offset, littleEndian, noAssert) { |
| | | if (!noAssert) { |
| | | checkIEEE754(buf, value, offset, 8); |
| | | } |
| | | write(buf, value, offset, littleEndian, 52, 8); |
| | | return offset + 8 |
| | | } |
| | | |
| | | Buffer$1.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) { |
| | | return writeDouble(this, value, offset, true, noAssert) |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { |
| | | return writeDouble(this, value, offset, false, noAssert) |
| | | }; |
| | | |
| | | // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) |
| | | Buffer$1.prototype.copy = function copy (target, targetStart, start, end) { |
| | | if (!start) start = 0; |
| | | if (!end && end !== 0) end = this.length; |
| | | if (targetStart >= target.length) targetStart = target.length; |
| | | if (!targetStart) targetStart = 0; |
| | | if (end > 0 && end < start) end = start; |
| | | |
| | | // Copy 0 bytes; we're done |
| | | if (end === start) return 0 |
| | | if (target.length === 0 || this.length === 0) return 0 |
| | | |
| | | // Fatal error conditions |
| | | if (targetStart < 0) { |
| | | throw new RangeError('targetStart out of bounds') |
| | | } |
| | | if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds') |
| | | if (end < 0) throw new RangeError('sourceEnd out of bounds') |
| | | |
| | | // Are we oob? |
| | | if (end > this.length) end = this.length; |
| | | if (target.length - targetStart < end - start) { |
| | | end = target.length - targetStart + start; |
| | | } |
| | | |
| | | var len = end - start; |
| | | var i; |
| | | |
| | | if (this === target && start < targetStart && targetStart < end) { |
| | | // descending copy from end |
| | | for (i = len - 1; i >= 0; --i) { |
| | | target[i + targetStart] = this[i + start]; |
| | | } |
| | | } else if (len < 1000 || !Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // ascending copy from start |
| | | for (i = 0; i < len; ++i) { |
| | | target[i + targetStart] = this[i + start]; |
| | | } |
| | | } else { |
| | | Uint8Array.prototype.set.call( |
| | | target, |
| | | this.subarray(start, start + len), |
| | | targetStart |
| | | ); |
| | | } |
| | | |
| | | return len |
| | | }; |
| | | |
| | | // Usage: |
| | | // buffer.fill(number[, offset[, end]]) |
| | | // buffer.fill(buffer[, offset[, end]]) |
| | | // buffer.fill(string[, offset[, end]][, encoding]) |
| | | Buffer$1.prototype.fill = function fill (val, start, end, encoding) { |
| | | // Handle string cases: |
| | | if (typeof val === 'string') { |
| | | if (typeof start === 'string') { |
| | | encoding = start; |
| | | start = 0; |
| | | end = this.length; |
| | | } else if (typeof end === 'string') { |
| | | encoding = end; |
| | | end = this.length; |
| | | } |
| | | if (val.length === 1) { |
| | | var code = val.charCodeAt(0); |
| | | if (code < 256) { |
| | | val = code; |
| | | } |
| | | } |
| | | if (encoding !== undefined && typeof encoding !== 'string') { |
| | | throw new TypeError('encoding must be a string') |
| | | } |
| | | if (typeof encoding === 'string' && !Buffer$1.isEncoding(encoding)) { |
| | | throw new TypeError('Unknown encoding: ' + encoding) |
| | | } |
| | | } else if (typeof val === 'number') { |
| | | val = val & 255; |
| | | } |
| | | |
| | | // Invalid ranges are not set to a default, so can range check early. |
| | | if (start < 0 || this.length < start || this.length < end) { |
| | | throw new RangeError('Out of range index') |
| | | } |
| | | |
| | | if (end <= start) { |
| | | return this |
| | | } |
| | | |
| | | start = start >>> 0; |
| | | end = end === undefined ? this.length : end >>> 0; |
| | | |
| | | if (!val) val = 0; |
| | | |
| | | var i; |
| | | if (typeof val === 'number') { |
| | | for (i = start; i < end; ++i) { |
| | | this[i] = val; |
| | | } |
| | | } else { |
| | | var bytes = internalIsBuffer(val) |
| | | ? val |
| | | : utf8ToBytes(new Buffer$1(val, encoding).toString()); |
| | | var len = bytes.length; |
| | | for (i = 0; i < end - start; ++i) { |
| | | this[i + start] = bytes[i % len]; |
| | | } |
| | | } |
| | | |
| | | return this |
| | | }; |
| | | |
| | | // HELPER FUNCTIONS |
| | | // ================ |
| | | |
| | | var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g; |
| | | |
| | | function base64clean (str) { |
| | | // Node strips out invalid characters like \n and \t from the string, base64-js does not |
| | | str = stringtrim(str).replace(INVALID_BASE64_RE, ''); |
| | | // Node converts strings with length < 2 to '' |
| | | if (str.length < 2) return '' |
| | | // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not |
| | | while (str.length % 4 !== 0) { |
| | | str = str + '='; |
| | | } |
| | | return str |
| | | } |
| | | |
| | | function stringtrim (str) { |
| | | if (str.trim) return str.trim() |
| | | return str.replace(/^\s+|\s+$/g, '') |
| | | } |
| | | |
| | | function toHex (n) { |
| | | if (n < 16) return '0' + n.toString(16) |
| | | return n.toString(16) |
| | | } |
| | | |
| | | function utf8ToBytes (string, units) { |
| | | units = units || Infinity; |
| | | var codePoint; |
| | | var length = string.length; |
| | | var leadSurrogate = null; |
| | | var bytes = []; |
| | | |
| | | for (var i = 0; i < length; ++i) { |
| | | codePoint = string.charCodeAt(i); |
| | | |
| | | // is surrogate component |
| | | if (codePoint > 0xD7FF && codePoint < 0xE000) { |
| | | // last char was a lead |
| | | if (!leadSurrogate) { |
| | | // no lead yet |
| | | if (codePoint > 0xDBFF) { |
| | | // unexpected trail |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | continue |
| | | } else if (i + 1 === length) { |
| | | // unpaired lead |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | continue |
| | | } |
| | | |
| | | // valid lead |
| | | leadSurrogate = codePoint; |
| | | |
| | | continue |
| | | } |
| | | |
| | | // 2 leads in a row |
| | | if (codePoint < 0xDC00) { |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | leadSurrogate = codePoint; |
| | | continue |
| | | } |
| | | |
| | | // valid surrogate pair |
| | | codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000; |
| | | } else if (leadSurrogate) { |
| | | // valid bmp char, but last char was a lead |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | } |
| | | |
| | | leadSurrogate = null; |
| | | |
| | | // encode utf8 |
| | | if (codePoint < 0x80) { |
| | | if ((units -= 1) < 0) break |
| | | bytes.push(codePoint); |
| | | } else if (codePoint < 0x800) { |
| | | if ((units -= 2) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0x6 | 0xC0, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else if (codePoint < 0x10000) { |
| | | if ((units -= 3) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0xC | 0xE0, |
| | | codePoint >> 0x6 & 0x3F | 0x80, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else if (codePoint < 0x110000) { |
| | | if ((units -= 4) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0x12 | 0xF0, |
| | | codePoint >> 0xC & 0x3F | 0x80, |
| | | codePoint >> 0x6 & 0x3F | 0x80, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else { |
| | | throw new Error('Invalid code point') |
| | | } |
| | | } |
| | | |
| | | return bytes |
| | | } |
| | | |
| | | function asciiToBytes (str) { |
| | | var byteArray = []; |
| | | for (var i = 0; i < str.length; ++i) { |
| | | // Node's code seems to be doing this and not & 0x7F.. |
| | | byteArray.push(str.charCodeAt(i) & 0xFF); |
| | | } |
| | | return byteArray |
| | | } |
| | | |
| | | function utf16leToBytes (str, units) { |
| | | var c, hi, lo; |
| | | var byteArray = []; |
| | | for (var i = 0; i < str.length; ++i) { |
| | | if ((units -= 2) < 0) break |
| | | |
| | | c = str.charCodeAt(i); |
| | | hi = c >> 8; |
| | | lo = c % 256; |
| | | byteArray.push(lo); |
| | | byteArray.push(hi); |
| | | } |
| | | |
| | | return byteArray |
| | | } |
| | | |
| | | |
| | | function base64ToBytes (str) { |
| | | return toByteArray(base64clean(str)) |
| | | } |
| | | |
| | | function blitBuffer (src, dst, offset, length) { |
| | | for (var i = 0; i < length; ++i) { |
| | | if ((i + offset >= dst.length) || (i >= src.length)) break |
| | | dst[i + offset] = src[i]; |
| | | } |
| | | return i |
| | | } |
| | | |
| | | function isnan (val) { |
| | | return val !== val // eslint-disable-line no-self-compare |
| | | } |
| | | |
| | | |
| | | // the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence |
| | | // The _isBuffer check is for Safari 5-7 support, because it's missing |
| | | // Object.prototype.constructor. Remove this eventually |
| | | function isBuffer$1(obj) { |
| | | return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj)) |
| | | } |
| | | |
| | | function isFastBuffer (obj) { |
| | | return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj) |
| | | } |
| | | |
| | | // For Node v0.10 support. Remove this eventually. |
| | | function isSlowBuffer (obj) { |
| | | return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0)) |
| | | } |
| | | |
| | | /* |
| | | * Shared base64 decode helper for generated decode data. |
| | | * Assumes global atob is available. |
| | | */ |
| | | function decodeBase64(input) { |
| | | const binary = |
| | | // eslint-disable-next-line n/no-unsupported-features/node-builtins |
| | | typeof atob === "function" |
| | | ? // Browser (and Node >=16) |
| | | // eslint-disable-next-line n/no-unsupported-features/node-builtins |
| | | atob(input) |
| | | : // Older Node versions (<16) |
| | | // eslint-disable-next-line n/no-unsupported-features/node-builtins |
| | | typeof Buffer$1.from === "function" |
| | | ? // eslint-disable-next-line n/no-unsupported-features/node-builtins |
| | | Buffer$1.from(input, "base64").toString("binary") |
| | | : // eslint-disable-next-line unicorn/no-new-buffer, n/no-deprecated-api |
| | | new Buffer$1(input, "base64").toString("binary"); |
| | | const evenLength = binary.length & -2; // Round down to even length |
| | | const out = new Uint16Array(evenLength / 2); |
| | | for (let index = 0, outIndex = 0; index < evenLength; index += 2) { |
| | | const lo = binary.charCodeAt(index); |
| | | const hi = binary.charCodeAt(index + 1); |
| | | out[outIndex++] = lo | (hi << 8); |
| | | } |
| | | return out; |
| | | } |
| | | |
| | | // Generated using scripts/write-decode-map.ts |
| | | const htmlDecodeTree = /* #__PURE__ */ decodeBase64("QR08ALkAAgH6AYsDNQR2BO0EPgXZBQEGLAbdBxMISQrvCmQLfQurDKQNLw4fD4YPpA+6D/IPAAAAAAAAAAAAAAAAKhBMEY8TmxUWF2EYLBkxGuAa3RsJHDscWR8YIC8jSCSIJcMl6ie3Ku8rEC0CLjoupS7kLgAIRU1hYmNmZ2xtbm9wcnN0dVQAWgBeAGUAaQBzAHcAfgCBAIQAhwCSAJoAoACsALMAbABpAGcAO4DGAMZAUAA7gCYAJkBjAHUAdABlADuAwQDBQHIiZXZlAAJhAAFpeW0AcgByAGMAO4DCAMJAEGRyAADgNdgE3XIAYQB2AGUAO4DAAMBA8CFoYZFj4SFjcgBhZAAAoFMqAAFncIsAjgBvAG4ABGFmAADgNdg43fAlbHlGdW5jdGlvbgCgYSBpAG4AZwA7gMUAxUAAAWNzpACoAHIAAOA12Jzc6SFnbgCgVCJpAGwAZABlADuAwwDDQG0AbAA7gMQAxEAABGFjZWZvcnN1xQDYANoA7QDxAPYA+QD8AAABY3LJAM8AayNzbGFzaAAAoBYidgHTANUAAKDnKmUAZAAAoAYjeQARZIABY3J0AOAA5QDrAGEidXNlAACgNSLuI291bGxpcwCgLCFhAJJjcgAA4DXYBd1wAGYAAOA12Dnd5SF2ZdhiYwDyAOoAbSJwZXEAAKBOIgAHSE9hY2RlZmhpbG9yc3UXARoBHwE6AVIBVQFiAWQBZgGCAakB6QHtAfIBYwB5ACdkUABZADuAqQCpQIABY3B5ACUBKAE1AfUhdGUGYWmg0iJ0KGFsRGlmZmVyZW50aWFsRAAAoEUhbCJleXMAAKAtIQACYWVpb0EBRAFKAU0B8iFvbgxhZABpAGwAO4DHAMdAcgBjAAhhbiJpbnQAAKAwIm8AdAAKYQABZG5ZAV0BaSJsbGEAuGB0I2VyRG90ALdg8gA5AWkAp2NyImNsZQAAAkRNUFRwAXQBeQF9AW8AdAAAoJkiaSJudXMAAKCWIuwhdXMAoJUiaSJtZXMAAKCXIm8AAAFjc4cBlAFrKndpc2VDb250b3VySW50ZWdyYWwAAKAyImUjQ3VybHkAAAFEUZwBpAFvJXVibGVRdW90ZQAAoB0gdSJvdGUAAKAZIAACbG5wdbABtgHNAdgBbwBuAGWgNyIAoHQqgAFnaXQAvAHBAcUB8iJ1ZW50AKBhIm4AdAAAoC8i7yV1ckludGVncmFsAKAuIgABZnLRAdMBAKACIe8iZHVjdACgECJuLnRlckNsb2Nrd2lzZUNvbnRvdXJJbnRlZ3JhbAAAoDMi7yFzcwCgLypjAHIAAOA12J7ccABDoNMiYQBwAACgTSKABURKU1phY2VmaW9zAAsCEgIVAhgCGwIsAjQCOQI9AnMCfwNvoEUh9CJyYWhkAKARKWMAeQACZGMAeQAFZGMAeQAPZIABZ3JzACECJQIoAuchZXIAoCEgcgAAoKEhaAB2AACg5CoAAWF5MAIzAvIhb24OYRRkbAB0oAciYQCUY3IAAOA12AfdAAFhZkECawIAAWNtRQJnAvIjaXRpY2FsAAJBREdUUAJUAl8CYwJjInV0ZQC0YG8AdAFZAloC2WJiJGxlQWN1dGUA3WJyImF2ZQBgYGkibGRlANxi7yFuZACgxCJmJWVyZW50aWFsRAAAoEYhcAR9AgAAAAAAAIECjgIAABoDZgAA4DXYO91EoagAhQKJAm8AdAAAoNwgcSJ1YWwAAKBQIuIhbGUAA0NETFJVVpkCqAK1Au8C/wIRA28AbgB0AG8AdQByAEkAbgB0AGUAZwByAGEA7ADEAW8AdAKvAgAAAACwAqhgbiNBcnJvdwAAoNMhAAFlb7kC0AJmAHQAgAFBUlQAwQLGAs0CciJyb3cAAKDQIekkZ2h0QXJyb3cAoNQhZQDlACsCbgBnAAABTFLWAugC5SFmdAABQVLcAuECciJyb3cAAKD4J+kkZ2h0QXJyb3cAoPon6SRnaHRBcnJvdwCg+SdpImdodAAAAUFU9gL7AnIicm93AACg0iFlAGUAAKCoInAAQQIGAwAAAAALA3Iicm93AACg0SFvJHduQXJyb3cAAKDVIWUlcnRpY2FsQmFyAACgJSJuAAADQUJMUlRhJAM2AzoDWgNxA3oDciJyb3cAAKGTIUJVLAMwA2EAcgAAoBMpcCNBcnJvdwAAoPUhciJldmUAEWPlIWZ00gJDAwAASwMAAFIDaSVnaHRWZWN0b3IAAKBQKWUkZVZlY3RvcgAAoF4p5SJjdG9yQqC9IWEAcgAAoFYpaSJnaHQA1AFiAwAAaQNlJGVWZWN0b3IAAKBfKeUiY3RvckKgwSFhAHIAAKBXKWUAZQBBoKQiciJyb3cAAKCnIXIAcgBvAPcAtAIAAWN0gwOHA3IAAOA12J/c8iFvaxBhAAhOVGFjZGZnbG1vcHFzdHV4owOlA6kDsAO/A8IDxgPNA9ID8gP9AwEEFAQeBCAEJQRHAEphSAA7gNAA0EBjAHUAdABlADuAyQDJQIABYWl5ALYDuQO+A/Ihb24aYXIAYwA7gMoAykAtZG8AdAAWYXIAAOA12AjdcgBhAHYAZQA7gMgAyEDlIm1lbnQAoAgiAAFhcNYD2QNjAHIAEmF0AHkAUwLhAwAAAADpA20lYWxsU3F1YXJlAACg+yVlJ3J5U21hbGxTcXVhcmUAAKCrJQABZ3D2A/kDbwBuABhhZgAA4DXYPN3zImlsb26VY3UAAAFhaQYEDgRsAFSgdSppImxkZQAAoEIi7CNpYnJpdW0AoMwhAAFjaRgEGwRyAACgMCFtAACgcyphAJdjbQBsADuAywDLQAABaXApBC0E8yF0cwCgAyLvJG5lbnRpYWxFAKBHIYACY2Zpb3MAPQQ/BEMEXQRyBHkAJGRyAADgNdgJ3WwibGVkAFMCTAQAAAAAVARtJWFsbFNxdWFyZQAAoPwlZSdyeVNtYWxsU3F1YXJlAACgqiVwA2UEAABpBAAAAABtBGYAAOA12D3dwSFsbACgACLyI2llcnRyZgCgMSFjAPIAcQQABkpUYWJjZGZnb3JzdIgEiwSOBJMElwSkBKcEqwStBLIE5QTqBGMAeQADZDuAPgA+QO0hbWFkoJMD3GNyImV2ZQAeYYABZWl5AJ0EoASjBOQhaWwiYXIAYwAcYRNkbwB0ACBhcgAA4DXYCt0AoNkicABmAADgNdg+3eUiYXRlcgADRUZHTFNUvwTIBM8E1QTZBOAEcSJ1YWwATKBlIuUhc3MAoNsidSRsbEVxdWFsAACgZyJyI2VhdGVyAACgoirlIXNzAKB3IuwkYW50RXF1YWwAoH4qaSJsZGUAAKBzImMAcgAA4DXYotwAoGsiAARBYWNmaW9zdfkE/QQFBQgFCwUTBSIFKwVSIkRjeQAqZAABY3QBBQQFZQBrAMdiXmDpIXJjJGFyAACgDCFsJWJlcnRTcGFjZQAAoAsh8AEYBQAAGwVmAACgDSHpJXpvbnRhbExpbmUAoAAlAAFjdCYFKAXyABIF8iFvayZhbQBwAEQBMQU5BW8AdwBuAEgAdQBtAPAAAAFxInVhbAAAoE8iAAdFSk9hY2RmZ21ub3N0dVMFVgVZBVwFYwVtBXAFcwV6BZAFtgXFBckFzQVjAHkAFWTsIWlnMmFjAHkAAWRjAHUAdABlADuAzQDNQAABaXlnBWwFcgBjADuAzgDOQBhkbwB0ADBhcgAAoBEhcgBhAHYAZQA7gMwAzEAAoREhYXB/BYsFAAFjZ4MFhQVyACphaSNuYXJ5SQAAoEghbABpAGUA8wD6AvQBlQUAAKUFZaAsIgABZ3KaBZ4F8iFhbACgKyLzI2VjdGlvbgCgwiJpI3NpYmxlAAABQ1SsBbEFbyJtbWEAAKBjIGkibWVzAACgYiCAAWdwdAC8Bb8FwwVvAG4ALmFmAADgNdhA3WEAmWNjAHIAAKAQIWkibGRlAChh6wHSBQAA1QVjAHkABmRsADuAzwDPQIACY2Zvc3UA4QXpBe0F8gX9BQABaXnlBegFcgBjADRhGWRyAADgNdgN3XAAZgAA4DXYQd3jAfcFAAD7BXIAAOA12KXc8iFjeQhk6yFjeQRkgANISmFjZm9zAAwGDwYSBhUGHQYhBiYGYwB5ACVkYwB5AAxk8CFwYZpjAAFleRkGHAbkIWlsNmEaZHIAAOA12A7dcABmAADgNdhC3WMAcgAA4DXYptyABUpUYWNlZmxtb3N0AD0GQAZDBl4GawZkB2gHcAd0B80H2gdjAHkACWQ7gDwAPECAAmNtbnByAEwGTwZSBlUGWwb1IXRlOWHiIWRhm2NnAACg6ifsI2FjZXRyZgCgEiFyAACgniGAAWFleQBkBmcGagbyIW9uPWHkIWlsO2EbZAABZnNvBjQHdAAABUFDREZSVFVWYXKABp4GpAbGBssG3AYDByEHwQIqBwABbnKEBowGZyVsZUJyYWNrZXQAAKDoJ/Ihb3cAoZAhQlKTBpcGYQByAACg5CHpJGdodEFycm93AKDGIWUjaWxpbmcAAKAII28A9QGqBgAAsgZiJWxlQnJhY2tldAAAoOYnbgDUAbcGAAC+BmUkZVZlY3RvcgAAoGEp5SJjdG9yQqDDIWEAcgAAoFkpbCJvb3IAAKAKI2kiZ2h0AAABQVbSBtcGciJyb3cAAKCUIeUiY3RvcgCgTikAAWVy4AbwBmUAAKGjIkFW5gbrBnIicm93AACgpCHlImN0b3IAoFopaSNhbmdsZQBCorIi+wYAAAAA/wZhAHIAAKDPKXEidWFsAACgtCJwAIABRFRWAAoHEQcYB+8kd25WZWN0b3IAoFEpZSRlVmVjdG9yAACgYCnlImN0b3JCoL8hYQByAACgWCnlImN0b3JCoLwhYQByAACgUilpAGcAaAB0AGEAcgByAG8A9wDMAnMAAANFRkdMU1Q/B0cHTgdUB1gHXwfxJXVhbEdyZWF0ZXIAoNoidSRsbEVxdWFsAACgZiJyI2VhdGVyAACgdiLlIXNzAKChKuwkYW50RXF1YWwAoH0qaSJsZGUAAKByInIAAOA12A/dZaDYIuYjdGFycm93AKDaIWkiZG90AD9hgAFucHcAege1B7kHZwAAAkxSbHKCB5QHmwerB+UhZnQAAUFSiAeNB3Iicm93AACg9SfpJGdodEFycm93AKD3J+kkZ2h0QXJyb3cAoPYn5SFmdAABYXLcAqEHaQBnAGgAdABhAHIAcgBvAPcA5wJpAGcAaAB0AGEAcgByAG8A9wDuAmYAAOA12EPdZQByAAABTFK/B8YHZSRmdEFycm93AACgmSHpJGdodEFycm93AKCYIYABY2h0ANMH1QfXB/IAWgYAoLAh8iFva0FhAKBqIgAEYWNlZmlvc3XpB+wH7gf/BwMICQgOCBEIcAAAoAUpeQAcZAABZGzyB/kHaSR1bVNwYWNlAACgXyBsI2ludHJmAACgMyFyAADgNdgQ3e4jdXNQbHVzAKATInAAZgAA4DXYRN1jAPIA/gecY4AESmFjZWZvc3R1ACEIJAgoCDUIgQiFCDsKQApHCmMAeQAKZGMidXRlAENhgAFhZXkALggxCDQI8iFvbkdh5CFpbEVhHWSAAWdzdwA7CGEIfQjhInRpdmWAAU1UVgBECEwIWQhlJWRpdW1TcGFjZQAAoAsgaABpAAABY25SCFMIawBTAHAAYQBjAOUASwhlAHIAeQBUAGgAaQDuAFQI9CFlZAABR0xnCHUIcgBlAGEAdABlAHIARwByAGUAYQB0AGUA8gDrBGUAcwBzAEwAZQBzAPMA2wdMImluZQAKYHIAAOA12BHdAAJCbnB0jAiRCJkInAhyImVhawAAoGAgwiZyZWFraW5nU3BhY2WgYGYAAKAVIUOq7CqzCMIIzQgAAOcIGwkAAAAAAAAtCQAAbwkAAIcJAACdCcAJGQoAADQKAAFvdbYIvAjuI2dydWVudACgYiJwIkNhcAAAoG0ibyh1YmxlVmVydGljYWxCYXIAAKAmIoABbHF4ANII1wjhCOUibWVudACgCSL1IWFsVKBgImkibGRlAADgQiI4A2kic3RzAACgBCJyI2VhdGVyAACjbyJFRkdMU1T1CPoIAgkJCQ0JFQlxInVhbAAAoHEidSRsbEVxdWFsAADgZyI4A3IjZWF0ZXIAAOBrIjgD5SFzcwCgeSLsJGFudEVxdWFsAOB+KjgDaSJsZGUAAKB1IvUhbXBEASAJJwnvI3duSHVtcADgTiI4A3EidWFsAADgTyI4A2UAAAFmczEJRgn0JFRyaWFuZ2xlQqLqIj0JAAAAAEIJYQByAADgzyk4A3EidWFsAACg7CJzAICibiJFR0xTVABRCVYJXAlhCWkJcSJ1YWwAAKBwInIjZWF0ZXIAAKB4IuUhc3MA4GoiOAPsJGFudEVxdWFsAOB9KjgDaSJsZGUAAKB0IuUic3RlZAABR0x1CX8J8iZlYXRlckdyZWF0ZXIA4KIqOAPlI3NzTGVzcwDgoSo4A/IjZWNlZGVzAKGAIkVTjwmVCXEidWFsAADgryo4A+wkYW50RXF1YWwAoOAiAAFlaaAJqQl2JmVyc2VFbGVtZW50AACgDCLnJWh0VHJpYW5nbGVCousitgkAAAAAuwlhAHIAAODQKTgDcSJ1YWwAAKDtIgABcXXDCeAJdSNhcmVTdQAAAWJwywnVCfMhZXRF4I8iOANxInVhbAAAoOIi5SJyc2V0ReCQIjgDcSJ1YWwAAKDjIoABYmNwAOYJ8AkNCvMhZXRF4IIi0iBxInVhbAAAoIgi4yJlZWRzgKGBIkVTVAD6CQAKBwpxInVhbAAA4LAqOAPsJGFudEVxdWFsAKDhImkibGRlAADgfyI4A+UicnNldEXggyLSIHEidWFsAACgiSJpImxkZQCAoUEiRUZUACIKJwouCnEidWFsAACgRCJ1JGxsRXF1YWwAAKBHImkibGRlAACgSSJlJXJ0aWNhbEJhcgAAoCQiYwByAADgNdip3GkAbABkAGUAO4DRANFAnWMAB0VhY2RmZ21vcHJzdHV2XgphCmgKcgp2CnoKgQqRCpYKqwqtCrsKyArNCuwhaWdSYWMAdQB0AGUAO4DTANNAAAFpeWwKcQpyAGMAO4DUANRAHmRiImxhYwBQYXIAAOA12BLdcgBhAHYAZQA7gNIA0kCAAWFlaQCHCooKjQpjAHIATGFnAGEAqWNjInJvbgCfY3AAZgAA4DXYRt3lI25DdXJseQABRFGeCqYKbyV1YmxlUXVvdGUAAKAcIHUib3RlAACgGCAAoFQqAAFjbLEKtQpyAADgNdiq3GEAcwBoADuA2ADYQGkAbAHACsUKZABlADuA1QDVQGUAcwAAoDcqbQBsADuA1gDWQGUAcgAAAUJQ0wrmCgABYXLXCtoKcgAAoD4gYQBjAAABZWvgCuIKAKDeI2UAdAAAoLQjYSVyZW50aGVzaXMAAKDcI4AEYWNmaGlsb3JzAP0KAwsFCwkLCwsMCxELIwtaC3IjdGlhbEQAAKACInkAH2RyAADgNdgT3WkApmOgY/Ujc01pbnVzsWAAAWlwFQsgC24AYwBhAHIAZQBwAGwAYQBuAOUACgVmAACgGSGAobsqZWlvACoLRQtJC+MiZWRlc4CheiJFU1QANAs5C0ALcSJ1YWwAAKCvKuwkYW50RXF1YWwAoHwiaSJsZGUAAKB+Im0AZQAAoDMgAAFkcE0LUQv1IWN0AKAPIm8jcnRpb24AYaA3ImwAAKAdIgABY2leC2ILcgAA4DXYq9yoYwACVWZvc2oLbwtzC3cLTwBUADuAIgAiQHIAAOA12BTdcABmAACgGiFjAHIAAOA12KzcAAZCRWFjZWZoaW9yc3WPC5MLlwupC7YL2AvbC90LhQyTDJoMowzhIXJyAKAQKUcAO4CuAK5AgAFjbnIAnQugC6ML9SF0ZVRhZwAAoOsncgB0oKAhbAAAoBYpgAFhZXkArwuyC7UL8iFvblhh5CFpbFZhIGR2oBwhZSJyc2UAAAFFVb8LzwsAAWxxwwvIC+UibWVudACgCyL1JGlsaWJyaXVtAKDLIXAmRXF1aWxpYnJpdW0AAKBvKXIAAKAcIW8AoWPnIWh0AARBQ0RGVFVWYewLCgwQDDIMNwxeDHwM9gIAAW5y8Av4C2clbGVCcmFja2V0AACg6SfyIW93AKGSIUJM/wsDDGEAcgAAoOUhZSRmdEFycm93AACgxCFlI2lsaW5nAACgCSNvAPUBFgwAAB4MYiVsZUJyYWNrZXQAAKDnJ24A1AEjDAAAKgxlJGVWZWN0b3IAAKBdKeUiY3RvckKgwiFhAHIAAKBVKWwib29yAACgCyMAAWVyOwxLDGUAAKGiIkFWQQxGDHIicm93AACgpiHlImN0b3IAoFspaSNhbmdsZQBCorMiVgwAAAAAWgxhAHIAAKDQKXEidWFsAACgtSJwAIABRFRWAGUMbAxzDO8kd25WZWN0b3IAoE8pZSRlVmVjdG9yAACgXCnlImN0b3JCoL4hYQByAACgVCnlImN0b3JCoMAhYQByAACgUykAAXB1iQyMDGYAAKAdIe4kZEltcGxpZXMAoHAp6SRnaHRhcnJvdwCg2yEAAWNongyhDHIAAKAbIQCgsSHsJGVEZWxheWVkAKD0KYAGSE9hY2ZoaW1vcXN0dQC/DMgMzAzQDOIM5gwKDQ0NFA0ZDU8NVA1YDQABQ2PDDMYMyCFjeSlkeQAoZEYiVGN5ACxkYyJ1dGUAWmEAorwqYWVpedgM2wzeDOEM8iFvbmBh5CFpbF5hcgBjAFxhIWRyAADgNdgW3e8hcnQAAkRMUlXvDPYM/QwEDW8kd25BcnJvdwAAoJMhZSRmdEFycm93AACgkCHpJGdodEFycm93AKCSIXAjQXJyb3cAAKCRIechbWGjY+EkbGxDaXJjbGUAoBgicABmAADgNdhK3XICHw0AAAAAIg10AACgGiLhIXJlgKGhJUlTVQAqDTINSg3uJXRlcnNlY3Rpb24AoJMidQAAAWJwNw1ADfMhZXRFoI8icSJ1YWwAAKCRIuUicnNldEWgkCJxInVhbAAAoJIibiJpb24AAKCUImMAcgAA4DXYrtxhAHIAAKDGIgACYmNtcF8Nag2ODZANc6DQImUAdABFoNAicSJ1YWwAAKCGIgABY2huDYkNZSJlZHMAgKF7IkVTVAB4DX0NhA1xInVhbAAAoLAq7CRhbnRFcXVhbACgfSJpImxkZQAAoH8iVABoAGEA9ADHCwCgESIAodEiZXOVDZ8NciJzZXQARaCDInEidWFsAACghyJlAHQAAKDRIoAFSFJTYWNmaGlvcnMAtQ27Db8NyA3ODdsN3w3+DRgOHQ4jDk8AUgBOADuA3gDeQMEhREUAoCIhAAFIY8MNxg1jAHkAC2R5ACZkAAFidcwNzQ0JYKRjgAFhZXkA1A3XDdoN8iFvbmRh5CFpbGJhImRyAADgNdgX3QABZWnjDe4N8gHoDQAA7Q3lImZvcmUAoDQiYQCYYwABY27yDfkNayNTcGFjZQAA4F8gCiDTInBhY2UAoAkg7CFkZYChPCJFRlQABw4MDhMOcSJ1YWwAAKBDInUkbGxFcXVhbAAAoEUiaSJsZGUAAKBIInAAZgAA4DXYS93pI3BsZURvdACg2yAAAWN0Jw4rDnIAAOA12K/c8iFva2Zh4QpFDlYOYA5qDgAAbg5yDgAAAAAAAAAAAAB5DnwOqA6zDgAADg8RDxYPGg8AAWNySA5ODnUAdABlADuA2gDaQHIAb6CfIeMhaXIAoEkpcgDjAVsOAABdDnkADmR2AGUAbGEAAWl5Yw5oDnIAYwA7gNsA20AjZGIibGFjAHBhcgAA4DXYGN1yAGEAdgBlADuA2QDZQOEhY3JqYQABZGl/Dp8OZQByAAABQlCFDpcOAAFhcokOiw5yAF9gYQBjAAABZWuRDpMOAKDfI2UAdAAAoLUjYSVyZW50aGVzaXMAAKDdI28AbgBQoMMi7CF1cwCgjiIAAWdwqw6uDm8AbgByYWYAAOA12EzdAARBREVUYWRwc78O0g7ZDuEOBQPqDvMOBw9yInJvdwDCoZEhyA4AAMwOYQByAACgEilvJHduQXJyb3cAAKDFIW8kd25BcnJvdwAAoJUhcSV1aWxpYnJpdW0AAKBuKWUAZQBBoKUiciJyb3cAAKClIW8AdwBuAGEAcgByAG8A9wAQA2UAcgAAAUxS+Q4AD2UkZnRBcnJvdwAAoJYh6SRnaHRBcnJvdwCglyFpAGyg0gNvAG4ApWPpIW5nbmFjAHIAAOA12LDcaSJsZGUAaGFtAGwAO4DcANxAgAREYmNkZWZvc3YALQ8xDzUPNw89D3IPdg97D4AP4SFzaACgqyJhAHIAAKDrKnkAEmThIXNobKCpIgCg5ioAAWVyQQ9DDwCgwSKAAWJ0eQBJD00Paw9hAHIAAKAWIGmgFiDjIWFsAAJCTFNUWA9cD18PZg9hAHIAAKAjIukhbmV8YGUkcGFyYXRvcgAAoFgnaSJsZGUAAKBAItQkaGluU3BhY2UAoAogcgAA4DXYGd1wAGYAAOA12E3dYwByAADgNdix3GQiYXNoAACgqiKAAmNlZm9zAI4PkQ+VD5kPng/pIXJjdGHkIWdlAKDAInIAAOA12BrdcABmAADgNdhO3WMAcgAA4DXYstwAAmZpb3OqD64Prw+0D3IAAOA12BvdnmNwAGYAAOA12E/dYwByAADgNdiz3IAEQUlVYWNmb3N1AMgPyw/OD9EP2A/gD+QP6Q/uD2MAeQAvZGMAeQAHZGMAeQAuZGMAdQB0AGUAO4DdAN1AAAFpedwP3w9yAGMAdmErZHIAAOA12BzdcABmAADgNdhQ3WMAcgAA4DXYtNxtAGwAeGEABEhhY2RlZm9z/g8BEAUQDRAQEB0QIBAkEGMAeQAWZGMidXRlAHlhAAFheQkQDBDyIW9ufWEXZG8AdAB7YfIBFRAAABwQbwBXAGkAZAB0AOgAVAhhAJZjcgAAoCghcABmAACgJCFjAHIAAOA12LXc4QtCEEkQTRAAAGcQbRByEAAAAAAAAAAAeRCKEJcQ8hD9EAAAGxEhETIROREAAD4RYwB1AHQAZQA7gOEA4UByImV2ZQADYYCiPiJFZGl1eQBWEFkQWxBgEGUQAOA+IjMDAKA/InIAYwA7gOIA4kB0AGUAO4C0ALRAMGRsAGkAZwA7gOYA5kByoGEgAOA12B7dcgBhAHYAZQA7gOAA4EAAAWVwfBCGEAABZnCAEIQQ8yF5bQCgNSHoAIMQaABhALFjAAFhcI0QWwAAAWNskRCTEHIAAWFnAACgPypkApwQAAAAALEQAKInImFkc3ajEKcQqRCuEG4AZAAAoFUqAKBcKmwib3BlAACgWCoAoFoqAKMgImVsbXJzersQvRDAEN0Q5RDtEACgpCllAACgICJzAGQAYaAhImEEzhDQENIQ1BDWENgQ2hDcEACgqCkAoKkpAKCqKQCgqykAoKwpAKCtKQCgrikAoK8pdAB2oB8iYgBkoL4iAKCdKQABcHTpEOwQaAAAoCIixWDhIXJyAKB8IwABZ3D1EPgQbwBuAAVhZgAA4DXYUt0Ao0giRWFlaW9wBxEJEQ0RDxESERQRAKBwKuMhaXIAoG8qAKBKImQAAKBLInMAJ2DyIW94ZaBIIvEADhFpAG4AZwA7gOUA5UCAAWN0eQAmESoRKxFyAADgNdi23CpgbQBwAGWgSCLxAPgBaQBsAGQAZQA7gOMA40BtAGwAO4DkAORAAAFjaUERRxFvAG4AaQBuAPQA6AFuAHQAAKARKgAITmFiY2RlZmlrbG5vcHJzdWQRaBGXEZ8RpxGrEdIR1hErEjASexKKEn0RThNbE3oTbwB0AACg7SoAAWNybBGJEWsAAAJjZXBzdBF4EX0RghHvIW5nAKBMInAjc2lsb24A9mNyImltZQAAoDUgaQBtAGWgPSJxAACgzSJ2AY0RkRFlAGUAAKC9ImUAZABnoAUjZQAAoAUjcgBrAHSgtSPiIXJrAKC2IwABb3mjEaYRbgDnAHcRMWTxIXVvAKAeIIACY21wcnQAtBG5Eb4RwRHFEeEhdXPloDUi5ABwInR5dgAAoLApcwDpAH0RbgBvAPUA6gCAAWFodwDLEcwRzhGyYwCgNiHlIWVuAKBsInIAAOA12B/dZwCAA2Nvc3R1dncA4xHyEQUSEhIhEiYSKRKAAWFpdQDpEesR7xHwAKMFcgBjAACg7yVwAACgwyKAAWRwdAD4EfwRABJvAHQAAKAAKuwhdXMAoAEqaSJtZXMAAKACKnECCxIAAAAADxLjIXVwAKAGKmEAcgAAoAUm8iNpYW5nbGUAAWR1GhIeEu8hd24AoL0lcAAAoLMlcCJsdXMAAKAEKmUA5QBCD+UAkg9hInJvdwAAoA0pgAFha28ANhJoEncSAAFjbjoSZRJrAIABbHN0AEESRxJNEm8jemVuZ2UAAKDrKXEAdQBhAHIA5QBcBPIjaWFuZ2xlgKG0JWRscgBYElwSYBLvIXduAKC+JeUhZnQAoMIlaSJnaHQAAKC4JWsAAKAjJLEBbRIAAHUSsgFxEgAAcxIAoJIlAKCRJTQAAKCTJWMAawAAoIglAAFlb38ShxJx4D0A5SD1IWl2AOBhIuUgdAAAoBAjAAJwdHd4kRKVEpsSnxJmAADgNdhT3XSgpSJvAG0AAKClIvQhaWUAoMgiAAZESFVWYmRobXB0dXayEsES0RLgEvcS+xIKExoTHxMjEygTNxMAAkxSbHK5ErsSvRK/EgCgVyUAoFQlAKBWJQCgUyUAolAlRFVkdckSyxLNEs8SAKBmJQCgaSUAoGQlAKBnJQACTFJsctgS2hLcEt4SAKBdJQCgWiUAoFwlAKBZJQCjUSVITFJobHLrEu0S7xLxEvMS9RIAoGwlAKBjJQCgYCUAoGslAKBiJQCgXyVvAHgAAKDJKQACTFJscgITBBMGEwgTAKBVJQCgUiUAoBAlAKAMJQCiACVEVWR1EhMUExYTGBMAoGUlAKBoJQCgLCUAoDQlaSJudXMAAKCfIuwhdXMAoJ4iaSJtZXMAAKCgIgACTFJsci8TMRMzEzUTAKBbJQCgWCUAoBglAKAUJQCjAiVITFJobHJCE0QTRhNIE0oTTBMAoGolAKBhJQCgXiUAoDwlAKAkJQCgHCUAAWV2UhNVE3YA5QD5AGIAYQByADuApgCmQAACY2Vpb2ITZhNqE24TcgAA4DXYt9xtAGkAAKBPIG0A5aA9IogRbAAAoVwAYmh0E3YTAKDFKfMhdWIAoMgnbAF+E4QTbABloCIgdAAAoCIgcAAAoU4iRWWJE4sTAKCuKvGgTyI8BeEMqRMAAN8TABQDFB8UAAAjFDQUAAAAAIUUAAAAAI0UAAAAANcU4xT3FPsUAACIFQAAlhWAAWNwcgCuE7ET1RP1IXRlB2GAoikiYWJjZHMAuxO/E8QTzhPSE24AZAAAoEQqciJjdXAAAKBJKgABYXXIE8sTcAAAoEsqcAAAoEcqbwB0AACgQCoA4CkiAP4AAWVv2RPcE3QAAKBBIO4ABAUAAmFlaXXlE+8T9RP4E/AB6hMAAO0TcwAAoE0qbwBuAA1hZABpAGwAO4DnAOdAcgBjAAlhcABzAHOgTCptAACgUCpvAHQAC2GAAWRtbgAIFA0UEhRpAGwAO4C4ALhAcCJ0eXYAAKCyKXQAAIGiADtlGBQZFKJAcgBkAG8A9ABiAXIAAOA12CDdgAFjZWkAKBQqFDIUeQBHZGMAawBtoBMn4SFyawCgEyfHY3IAAKPLJUVjZWZtcz8UQRRHFHcUfBSAFACgwykAocYCZWxGFEkUcQAAoFciZQBhAlAUAAAAAGAUciJyb3cAAAFsclYUWhTlIWZ0AKC6IWkiZ2h0AACguyGAAlJTYWNkAGgUaRRrFG8UcxSuYACgyCRzAHQAAKCbIukhcmMAoJoi4SFzaACgnSJuImludAAAoBAqaQBkAACg7yrjIWlyAKDCKfUhYnN1oGMmaQB0AACgYybsApMUmhS2FAAAwxRvAG4AZaA6APGgVCKrAG0CnxQAAAAAoxRhAHSgLABAYAChASJmbKcUqRTuABMNZQAAAW14rhSyFOUhbnQAoAEiZQDzANIB5wG6FAAAwBRkoEUibwB0AACgbSpuAPQAzAGAAWZyeQDIFMsUzhQA4DXYVN1vAOQA1wEAgakAO3MeAdMUcgAAoBchAAFhb9oU3hRyAHIAAKC1IXMAcwAAoBcnAAFjdeYU6hRyAADgNdi43AABYnDuFPIUZaDPKgCg0SploNAqAKDSKuQhb3QAoO8igANkZWxwcnZ3AAYVEBUbFSEVRBVlFYQV4SFycgABbHIMFQ4VAKA4KQCgNSlwAhYVAAAAABkVcgAAoN4iYwAAoN8i4SFycnCgtiEAoD0pgKIqImJjZG9zACsVMBU6FT4VQRVyImNhcAAAoEgqAAFhdTQVNxVwAACgRipwAACgSipvAHQAAKCNInIAAKBFKgDgKiIA/gACYWxydksVURVuFXMVcgByAG2gtyEAoDwpeQCAAWV2dwBYFWUVaRVxAHACXxUAAAAAYxVyAGUA4wAXFXUA4wAZFWUAZQAAoM4iZSJkZ2UAAKDPImUAbgA7gKQApEBlI2Fycm93AAABbHJ7FX8V5SFmdACgtiFpImdodAAAoLchZQDkAG0VAAFjaYsVkRVvAG4AaQBuAPQAkwFuAHQAAKAxImwiY3R5AACgLSOACUFIYWJjZGVmaGlqbG9yc3R1d3oAuBW7Fb8V1RXgFegV+RUKFhUWHxZUFlcWZRbFFtsW7xb7FgUXChdyAPIAtAJhAHIAAKBlKQACZ2xyc8YVyhXOFdAV5yFlcgCgICDlIXRoAKA4IfIA9QxoAHagECAAoKMiawHZFd4VYSJyb3cAAKAPKWEA4wBfAgABYXnkFecV8iFvbg9hNGQAoUYhYW/tFfQVAAFnciEC8RVyAACgyiF0InNlcQAAoHcqgAFnbG0A/xUCFgUWO4CwALBAdABhALRjcCJ0eXYAAKCxKQABaXIOFhIW8yFodACgfykA4DXYId1hAHIAAAFschsWHRYAoMMhAKDCIYACYWVnc3YAKBauAjYWOhY+Fm0AAKHEIm9zLhY0Fm4AZABzoMQi9SFpdACgZiZhIm1tYQDdY2kAbgAAoPIiAKH3AGlvQxZRFmQAZQAAgfcAO29KFksW90BuI3RpbWVzAACgxyJuAPgAUBZjAHkAUmRjAG8CXhYAAAAAYhZyAG4AAKAeI28AcAAAoA0jgAJscHR1dwBuFnEWdRaSFp4W7CFhciRgZgAA4DXYVd0AotkCZW1wc30WhBaJFo0WcQBkoFAibwB0AACgUSJpIm51cwAAoDgi7CF1cwCgFCLxInVhcmUAoKEiYgBsAGUAYgBhAHIAdwBlAGQAZwDlANcAbgCAAWFkaAClFqoWtBZyAHIAbwD3APUMbwB3AG4AYQByAHIAbwB3APMA8xVhI3Jwb29uAAABbHK8FsAWZQBmAPQAHBZpAGcAaAD0AB4WYgHJFs8WawBhAHIAbwD3AJILbwLUFgAAAADYFnIAbgAAoB8jbwBwAACgDCOAAWNvdADhFukW7BYAAXJ55RboFgDgNdi53FVkbAAAoPYp8iFvaxFhAAFkcvMW9xZvAHQAAKDxImkA5qC/JVsSAAFhaP8WAhdyAPIANQNhAPIA1wvhIm5nbGUAoKYpAAFjaQ4XEBd5AF9k5yJyYXJyAKD/JwAJRGFjZGVmZ2xtbm9wcXJzdHV4MRc4F0YXWxcyBF4XaRd5F40XrBe0F78X2RcVGCEYLRg1GEAYAAFEbzUXgRZvAPQA+BUAAWNzPBdCF3UAdABlADuA6QDpQPQhZXIAoG4qAAJhaW95TRdQF1YXWhfyIW9uG2FyAGOgViI7gOoA6kDsIW9uAKBVIk1kbwB0ABdhAAFEcmIXZhdvAHQAAKBSIgDgNdgi3XKhmipuF3QXYQB2AGUAO4DoAOhAZKCWKm8AdAAAoJgqgKGZKmlscwCAF4UXhxfuInRlcnMAoOcjAKATIWSglSpvAHQAAKCXKoABYXBzAJMXlheiF2MAcgATYXQAeQBzogUinxcAAAAAoRdlAHQAAKAFInAAMaADIDMBqRerFwCgBCAAoAUgAAFnc7AXsRdLYXAAAKACIAABZ3C4F7sXbwBuABlhZgAA4DXYVt2AAWFscwDFF8sXzxdyAHOg1SJsAACg4yl1AHMAAKBxKmkAAKG1A2x21RfYF28AbgC1Y/VjAAJjc3V24BfoF/0XEBgAAWlv5BdWF3IAYwAAoFYiaQLuFwAAAADwF+0ADQThIW50AAFnbPUX+Rd0AHIAAKCWKuUhc3MAoJUqgAFhZWkAAxgGGAoYbABzAD1gcwB0AACgXyJ2AESgYSJEAACgeCrwImFyc2wAoOUpAAFEYRkYHRhvAHQAAKBTInIAcgAAoHEpgAFjZGkAJxgqGO0XcgAAoC8hbwD0AIwCAAFhaDEYMhi3YzuA8ADwQAABbXI5GD0YbAA7gOsA60BvAACgrCCAAWNpcABGGEgYSxhsACFgcwD0ACwEAAFlb08YVxhjAHQAYQB0AGkAbwDuABoEbgBlAG4AdABpAGEAbADlADME4Ql1GAAAgRgAAIMYiBgAAAAAoRilGAAAqhgAALsYvhjRGAAA1xgnGWwAbABpAG4AZwBkAG8AdABzAGUA8QBlF3kARGRtImFsZQAAoEAmgAFpbHIAjRiRGJ0Y7CFpZwCgA/tpApcYAAAAAJoYZwAAoAD7aQBnAACgBPsA4DXYI93sIWlnAKAB++whaWcA4GYAagCAAWFsdACvGLIYthh0AACgbSZpAGcAAKAC+24AcwAAoLElbwBmAJJh8AHCGAAAxhhmAADgNdhX3QABYWvJGMwYbADsAGsEdqDUIgCg2SphI3J0aW50AACgDSoAAWFv2hgiGQABY3PeGB8ZsQPnGP0YBRkSGRUZAAAdGbID7xjyGPQY9xj5GAAA+xg7gL0AvUAAoFMhO4C8ALxAAKBVIQCgWSEAoFshswEBGQAAAxkAoFQhAKBWIbQCCxkOGQAAAAAQGTuAvgC+QACgVyEAoFwhNQAAoFghtgEZGQAAGxkAoFohAKBdITgAAKBeIWwAAKBEIHcAbgAAoCIjYwByAADgNdi73IAIRWFiY2RlZmdpamxub3JzdHYARhlKGVoZXhlmGWkZkhmWGZkZnRmgGa0ZxhnLGc8Z4BkjGmygZyIAoIwqgAFjbXAAUBlTGVgZ9SF0ZfVhbQBhAOSgswM6FgCghipyImV2ZQAfYQABaXliGWUZcgBjAB1hM2RvAHQAIWGAoWUibHFzAMYEcBl6GfGhZSLOBAAAdhlsAGEAbgD0AN8EgKF+KmNkbACBGYQZjBljAACgqSpvAHQAb6CAKmyggioAoIQqZeDbIgD+cwAAoJQqcgAA4DXYJN3noGsirATtIWVsAKA3IWMAeQBTZIChdyJFYWoApxmpGasZAKCSKgCgpSoAoKQqAAJFYWVztBm2Gb0ZwhkAoGkicABwoIoq8iFveACgiipxoIgq8aCIKrUZaQBtAACg5yJwAGYAAOA12FjdYQB2AOUAYwIAAWNp0xnWGXIAAKAKIW0AAKFzImVs3BneGQCgjioAoJAqAIM+ADtjZGxxco0E6xn0GfgZ/BkBGgABY2nvGfEZAKCnKnIAAKB6Km8AdAAAoNci0CFhcgCglSl1ImVzdAAAoHwqgAJhZGVscwAKGvQZFhrVBCAa8AEPGgAAFBpwAHIAbwD4AFkZcgAAoHgpcQAAAWxxxAQbGmwAZQBzAPMASRlpAO0A5AQAAWVuJxouGnIjdG5lcXEAAOBpIgD+xQAsGgAFQWFiY2Vma29zeUAaQxpmGmoabRqDGocalhrCGtMacgDyAMwCAAJpbG1yShpOGlAaVBpyAHMA8ABxD2YAvWBpAGwA9AASBQABZHJYGlsaYwB5AEpkAKGUIWN3YBpkGmkAcgAAoEgpAKCtIWEAcgAAoA8h6SFyYyVhgAFhbHIAcxp7Gn8a8iF0c3WgZSZpAHQAAKBlJuwhaXAAoCYg4yFvbgCguSJyAADgNdgl3XMAAAFld4wakRphInJvdwAAoCUpYSJyb3cAAKAmKYACYW1vcHIAnxqjGqcauhq+GnIAcgAAoP8h9CFodACgOyJrAAABbHKsGrMaZSRmdGFycm93AACgqSHpJGdodGFycm93AKCqIWYAAOA12Fnd4iFhcgCgFSCAAWNsdADIGswa0BpyAADgNdi93GEAcwDoAGka8iFvaydhAAFicNca2xr1IWxsAKBDIOghZW4AoBAg4Qr2GgAA/RoAAAgbExsaGwAAIRs7GwAAAAA+G2IbmRuVG6sbAACyG80b0htjAHUAdABlADuA7QDtQAChYyBpeQEbBhtyAGMAO4DuAO5AOGQAAWN4CxsNG3kANWRjAGwAO4ChAKFAAAFmcssCFhsA4DXYJt1yAGEAdgBlADuA7ADsQIChSCFpbm8AJxsyGzYbAAFpbisbLxtuAHQAAKAMKnQAAKAtIuYhaW4AoNwpdABhAACgKSHsIWlnM2GAAWFvcABDG1sbXhuAAWNndABJG0sbWRtyACthgAFlbHAAcQVRG1UbaQBuAOUAyAVhAHIA9AByBWgAMWFmAACgtyJlAGQAtWEAoggiY2ZvdGkbbRt1G3kb4SFyZQCgBSFpAG4AdKAeImkAZQAAoN0pZABvAPQAWxsAoisiY2VscIEbhRuPG5QbYQBsAACguiIAAWdyiRuNG2UAcgDzACMQ4wCCG2EicmhrAACgFyryIW9kAKA8KgACY2dwdJ8boRukG6gbeQBRZG8AbgAvYWYAAOA12FrdYQC5Y3UAZQBzAHQAO4C/AL9AAAFjabUbuRtyAADgNdi+3G4AAKIIIkVkc3bCG8QbyBvQAwCg+SJvAHQAAKD1Inag9CIAoPMiaaBiIOwhZGUpYesB1hsAANkbYwB5AFZkbAA7gO8A70AAA2NmbW9zdeYb7hvyG/Ub+hsFHAABaXnqG+0bcgBjADVhOWRyAADgNdgn3eEhdGg3YnAAZgAA4DXYW93jAf8bAAADHHIAAOA12L/c8iFjeVhk6yFjeVRkAARhY2ZnaGpvcxUcGhwiHCYcKhwtHDAcNRzwIXBhdqC6A/BjAAFleR4cIRzkIWlsN2E6ZHIAAOA12CjdciJlZW4AOGFjAHkARWRjAHkAXGRwAGYAAOA12FzdYwByAADgNdjA3IALQUJFSGFiY2RlZmdoamxtbm9wcnN0dXYAXhxtHHEcdRx5HN8cBx0dHTwd3B3tHfEdAR4EHh0eLB5FHrwewx7hHgkfPR9LH4ABYXJ0AGQcZxxpHHIA8gBvB/IAxQLhIWlsAKAbKeEhcnIAoA4pZ6BmIgCgiyphAHIAAKBiKWMJjRwAAJAcAACVHAAAAAAAAAAAAACZHJwcAACmHKgcrRwAANIc9SF0ZTph7SJwdHl2AKC0KXIAYQDuAFoG4iFkYbtjZwAAoegnZGyhHKMcAKCRKeUAiwYAoIUqdQBvADuAqwCrQHIAgKOQIWJmaGxwc3QAuhy/HMIcxBzHHMoczhxmoOQhcwAAoB8pcwAAoB0p6wCyGnAAAKCrIWwAAKA5KWkAbQAAoHMpbAAAoKIhAKGrKmFl1hzaHGkAbAAAoBkpc6CtKgDgrSoA/oABYWJyAOUc6RztHHIAcgAAoAwpcgBrAACgcicAAWFr8Rz4HGMAAAFla/Yc9xx7YFtgAAFlc/wc/hwAoIspbAAAAWR1Ax0FHQCgjykAoI0pAAJhZXV5Dh0RHRodHB3yIW9uPmEAAWRpFR0YHWkAbAA8YewAowbiAPccO2QAAmNxcnMkHScdLB05HWEAAKA2KXUAbwDyoBwgqhEAAWR1MB00HeghYXIAoGcpcyJoYXIAAKBLKWgAAKCyIQCiZCJmZ3FzRB1FB5Qdnh10AIACYWhscnQATh1WHWUdbB2NHXIicm93AHSgkCFhAOkAzxxhI3Jwb29uAAABZHVeHWId7yF3bgCgvSFwAACgvCHlJGZ0YXJyb3dzAKDHIWkiZ2h0AIABYWhzAHUdex2DHXIicm93APOglCGdBmEAcgBwAG8AbwBuAPMAzgtxAHUAaQBnAGEAcgByAG8A9wBlGugkcmVldGltZXMAoMsi8aFkIk0HAACaHWwAYQBuAPQAXgcAon0qY2Rnc6YdqR2xHbcdYwAAoKgqbwB0AG+gfypyoIEqAKCDKmXg2iIA/nMAAKCTKoACYWRlZ3MAwB3GHcod1h3ZHXAAcAByAG8A+ACmHG8AdAAAoNYicQAAAWdxzx3SHXQA8gBGB2cAdADyAHQcdADyAFMHaQDtAGMHgAFpbHIA4h3mHeod8yFodACgfClvAG8A8gDKBgDgNdgp3UWgdiIAoJEqYQH1Hf4dcgAAAWR1YB35HWygvCEAoGopbABrAACghCVjAHkAWWQAomoiYWNodAweDx4VHhkecgDyAGsdbwByAG4AZQDyAGAW4SFyZACgaylyAGkAAKD6JQABaW8hHiQe5CFvdEBh9SFzdGGgsCPjIWhlAKCwIwACRWFlczMeNR48HkEeAKBoInAAcKCJKvIhb3gAoIkqcaCHKvGghyo0HmkAbQAAoOYiAARhYm5vcHR3elIeXB5fHoUelh6mHqsetB4AAW5yVh5ZHmcAAKDsJ3IAAKD9IXIA6wCwBmcAgAFsbXIAZh52Hnse5SFmdAABYXKIB2weaQBnAGgAdABhAHIAcgBvAPcAkwfhInBzdG8AoPwnaQBnAGgAdABhAHIAcgBvAPcAmgdwI2Fycm93AAABbHKNHpEeZQBmAPQAxhxpImdodAAAoKwhgAFhZmwAnB6fHqIecgAAoIUpAOA12F3ddQBzAACgLSppIm1lcwAAoDQqYQGvHrMecwB0AACgFyLhAIoOZaHKJbkeRhLuIWdlAKDKJWEAcgBsoCgAdAAAoJMpgAJhY2htdADMHs8e1R7bHt0ecgDyAJ0GbwByAG4AZQDyANYWYQByAGSgyyEAoG0pAKAOIHIAaQAAoL8iAANhY2hpcXTrHu8e1QfzHv0eBh/xIXVvAKA5IHIAAOA12MHcbQDloXIi+h4AAPweAKCNKgCgjyoAAWJ19xwBH28AcqAYIACgGiDyIW9rQmEAhDwAO2NkaGlscXJCBhcfxh0gHyQfKB8sHzEfAAFjaRsfHR8AoKYqcgAAoHkqcgBlAOUAkx3tIWVzAKDJIuEhcnIAoHYpdSJlc3QAAKB7KgABUGk1HzkfYQByAACglillocMlAgdfEnIAAAFkdUIfRx9zImhhcgAAoEop6CFhcgCgZikAAWVuTx9WH3IjdG5lcXEAAOBoIgD+xQBUHwAHRGFjZGVmaGlsbm9wc3VuH3Ifoh+rH68ftx+7H74f5h/uH/MfBwj/HwsgxCFvdACgOiIAAmNscHJ5H30fiR+eH3IAO4CvAK9AAAFldIEfgx8AoEImZaAgJ3MAZQAAoCAnc6CmIXQAbwCAoaYhZGx1AJQfmB+cH28AdwDuAHkDZQBmAPQA6gbwAOkO6yFlcgCgriUAAW95ph+qH+0hbWEAoCkqPGThIXNoAKAUIOElc3VyZWRhbmdsZQCgISJyAADgNdgq3W8AAKAnIYABY2RuAMQfyR/bH3IAbwA7gLUAtUBhoiMi0B8AANMf1x9zAPQAKxFpAHIAAKDwKm8AdAA7gLcAt0B1AHMA4qESIh4TAADjH3WgOCIAoCoqYwHqH+0fcAAAoNsq8gB+GnAAbAB1APMACAgAAWRw9x/7H+UhbHMAoKciZgAA4DXYXt0AAWN0AyAHIHIAAOA12MLc8CFvcwCgPiJsobwDECAVIPQiaW1hcACguCJhAPAAEyAADEdMUlZhYmNkZWZnaGlqbG1vcHJzdHV2dzwgRyBmIG0geSCqILgg2iDeIBEhFSEyIUMhTSFQIZwhnyHSIQAiIyKLIrEivyIUIwABZ3RAIEMgAODZIjgD9uBrItIgBwmAAWVsdABNIF8gYiBmAHQAAAFhclMgWCByInJvdwAAoM0h6SRnaHRhcnJvdwCgziEA4NgiOAP24Goi0iBfCekkZ2h0YXJyb3cAoM8hAAFEZHEgdSDhIXNoAKCvIuEhc2gAoK4igAJiY25wdACCIIYgiSCNIKIgbABhAACgByL1IXRlRGFnAADgICLSIACiSSJFaW9wlSCYIJwgniAA4HAqOANkAADgSyI4A3MASWFyAG8A+AAyCnUAcgBhoG4mbADzoG4mmwjzAa8gAACzIHAAO4CgAKBAbQBwAOXgTiI4AyoJgAJhZW91eQDBIMogzSDWINkg8AHGIAAAyCAAoEMqbwBuAEhh5CFpbEZhbgBnAGSgRyJvAHQAAOBtKjgDcAAAoEIqPWThIXNoAKATIACjYCJBYWRxc3jpIO0g+SD+IAIhDCFyAHIAAKDXIXIAAAFocvIg9SBrAACgJClvoJch9wAGD28AdAAA4FAiOAN1AGkA9gC7CAABZWkGIQohYQByAACgKCntAN8I6SFzdPOgBCLlCHIAAOA12CvdAAJFZXN0/wgcISshLiHxoXEiIiEAABMJ8aFxIgAJAAAnIWwAYQBuAPQAEwlpAO0AGQlyoG8iAKBvIoABQWFwADghOyE/IXIA8gBeIHIAcgAAoK4hYQByAACg8ipzogsiSiEAAAAAxwtkoPwiAKD6ImMAeQBaZIADQUVhZGVzdABcIV8hYiFmIWkhkyGWIXIA8gBXIADgZiI4A3IAcgAAoJohcgAAoCUggKFwImZxcwBwIYQhjiF0AAABYXJ1IXohcgByAG8A9wBlIWkAZwBoAHQAYQByAHIAbwD3AD4h8aFwImAhAACKIWwAYQBuAPQAZwlz4H0qOAMAoG4iaQDtAG0JcqBuImkA5aDqIkUJaQDkADoKAAFwdKMhpyFmAADgNdhf3YCBrAA7aW4AriGvIcchrEBuAIChCSJFZHYAtyG6Ib8hAOD5IjgDbwB0AADg9SI4A+EB1gjEIcYhAKD3IgCg9iJpAHagDCLhAagJzyHRIQCg/iIAoP0igAFhb3IA2CHsIfEhcgCAoSYiYXN0AOAh5SHpIWwAbABlAOwAywhsAADg/SrlIADgAiI4A2wiaW50AACgFCrjoYAi9yEAAPohdQDlAJsJY+CvKjgDZaCAIvEAkwkAAkFhaXQHIgoiFyIeInIA8gBsIHIAcgAAoZshY3cRIhQiAOAzKTgDAOCdITgDZyRodGFycm93AACgmyFyAGkA5aDrIr4JgANjaGltcHF1AC8iPCJHIpwhTSJQIloigKGBImNlcgA2Iv0JOSJ1AOUABgoA4DXYw9zvIXJ0bQKdIQAAAABEImEAcgDhAOEhbQBloEEi8aBEIiYKYQDyAMsIcwB1AAABYnBWIlgi5QDUCeUA3wmAAWJjcABgInMieCKAoYQiRWVzAGci7glqIgDgxSo4A2UAdABl4IIi0iBxAPGgiCJoImMAZaCBIvEA/gmAoYUiRWVzAH8iFgqCIgDgxio4A2UAdABl4IMi0iBxAPGgiSKAIgACZ2lscpIilCKaIpwi7AAMCWwAZABlADuA8QDxQOcAWwlpI2FuZ2xlAAABbHKkIqoi5SFmdGWg6iLxAEUJaSJnaHQAZaDrIvEAvgltoL0DAKEjAGVzuCK8InIAbwAAoBYhcAAAoAcggARESGFkZ2lscnMAziLSItYi2iLeIugi7SICIw8j4SFzaACgrSLhIXJyAKAEKXAAAOBNItIg4SFzaACgrCIAAWV04iLlIgDgZSLSIADgPgDSIG4iZmluAACg3imAAUFldADzIvci+iJyAHIAAKACKQDgZCLSIHLgPADSIGkAZQAA4LQi0iAAAUF0BiMKI3IAcgAAoAMp8iFpZQDgtSLSIGkAbQAA4Dwi0iCAAUFhbgAaIx4jKiNyAHIAAKDWIXIAAAFociMjJiNrAACgIylvoJYh9wD/DuUhYXIAoCcpUxJqFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAVCMAAF4jaSN/I4IjjSOeI8AUAAAAAKYjwCMAANoj3yMAAO8jHiQvJD8kRCQAAWNzVyNsFHUAdABlADuA8wDzQAABaXlhI2cjcgBjoJoiO4D0APRAPmSAAmFiaW9zAHEjdCN3I3EBeiNzAOgAdhTsIWFjUWF2AACgOCrvIWxkAKC8KewhaWdTYQABY3KFI4kjaQByAACgvykA4DXYLN1vA5QjAAAAAJYjAACcI24A22JhAHYAZQA7gPIA8kAAoMEpAAFibaEjjAphAHIAAKC1KQACYWNpdKwjryO6I70jcgDyAFkUAAFpcrMjtiNyAACgvinvIXNzAKC7KW4A5QDZCgCgwCmAAWFlaQDFI8gjyyNjAHIATWFnAGEAyWOAAWNkbgDRI9Qj1iPyIW9uv2MAoLYpdQDzAHgBcABmAADgNdhg3YABYWVsAOQj5yPrI3IAAKC3KXIAcAAAoLkpdQDzAHwBAKMoImFkaW9zdvkj/CMPJBMkFiQbJHIA8gBeFIChXSplZm0AAyQJJAwkcgBvoDQhZgAAoDQhO4CqAKpAO4C6ALpA5yFvZgCgtiJyAACgVipsIm9wZQAAoFcqAKBbKoABY2xvACMkJSQrJPIACCRhAHMAaAA7gPgA+EBsAACgmCJpAGwBMyQ4JGQAZQA7gPUA9UBlAHMAYaCXInMAAKA2Km0AbAA7gPYA9kDiIWFyAKA9I+EKXiQAAHokAAB8JJQkAACYJKkkAAAAALUkEQsAAPAkAAAAAAQleiUAAIMlcgCAoSUiYXN0AGUkbyQBCwCBtgA7bGokayS2QGwAZQDsABgDaQJ1JAAAAAB4JG0AAKDzKgCg/Sp5AD9kcgCAAmNpbXB0AIUkiCSLJJkSjyRuAHQAJWBvAGQALmBpAGwAAKAwIOUhbmsAoDEgcgAA4DXYLd2AAWltbwCdJKAkpCR2oMYD1WNtAGEA9AD+B24AZQAAoA4m9KHAA64kAAC0JGMjaGZvcmsAAKDUItZjAAFhdbgkxCRuAAABY2u9JMIkawBooA8hAKAOIfYAaRpzAACkKwBhYmNkZW1zdNMkIRPXJNsk4STjJOck6yTjIWlyAKAjKmkAcgAAoCIqAAFvdYsW3yQAoCUqAKByKm4AO4CxALFAaQBtAACgJip3AG8AAKAnKoABaXB1APUk+iT+JO4idGludACgFSpmAADgNdhh3W4AZAA7gKMAo0CApHoiRWFjZWlub3N1ABMlFSUYJRslTCVRJVklSSV1JQCgsypwAACgtyp1AOUAPwtjoK8qgKJ6ImFjZW5zACclLSU0JTYlSSVwAHAAcgBvAPgAFyV1AHIAbAB5AGUA8QA/C/EAOAuAAWFlcwA8JUElRSXwInByb3gAoLkqcQBxAACgtSppAG0AAKDoImkA7QBEC20AZQDzoDIgIguAAUVhcwBDJVclRSXwAEAlgAFkZnAATwtfJXElgAFhbHMAZSVpJW0l7CFhcgCgLiPpIW5lAKASI/UhcmYAoBMjdKAdIu8AWQvyIWVsAKCwIgABY2l9JYElcgAA4DXYxdzIY24iY3NwAACgCCAAA2Zpb3BzdZElKxuVJZolnyWkJXIAAOA12C7dcABmAADgNdhi3XIiaW1lAACgVyBjAHIAAOA12MbcgAFhZW8AqiW6JcAldAAAAWVpryW2JXIAbgBpAG8AbgDzABkFbgB0AACgFipzAHQAZaA/APEACRj0AG0LgApBQkhhYmNkZWZoaWxtbm9wcnN0dXgA4yXyJfYl+iVpJpAmpia9JtUm5ib4JlonaCdxJ3UnnietJ7EnyCfiJ+cngAFhcnQA6SXsJe4lcgDyAJkM8gD6AuEhaWwAoBwpYQByAPIA3BVhAHIAAKBkKYADY2RlbnFydAAGJhAmEyYYJiYmKyZaJgABZXUKJg0mAOA9IjEDdABlAFVhaQDjACAN7SJwdHl2AKCzKWcAgKHpJ2RlbAAgJiImJCYAoJIpAKClKeUA9wt1AG8AO4C7ALtAcgAApZIhYWJjZmhscHN0dz0mQCZFJkcmSiZMJk4mUSZVJlgmcAAAoHUpZqDlIXMAAKAgKQCgMylzAACgHinrALka8ACVHmwAAKBFKWkAbQAAoHQpbAAAoKMhAKCdIQABYWleJmImaQBsAACgGilvAG6gNiJhAGwA8wB2C4ABYWJyAG8mciZ2JnIA8gAvEnIAawAAoHMnAAFha3omgSZjAAABZWt/JoAmfWBdYAABZXOFJocmAKCMKWwAAAFkdYwmjiYAoI4pAKCQKQACYWV1eZcmmiajJqUm8iFvbllhAAFkaZ4moSZpAGwAV2HsAA8M4gCAJkBkAAJjbHFzrSawJrUmuiZhAACgNylkImhhcgAAoGkpdQBvAPKgHSCjAWgAAKCzIYABYWNnAMMm0iaUC2wAgKEcIWlwcwDLJs4migxuAOUAoAxhAHIA9ADaC3QAAKCtJYABaWxyANsm3ybjJvMhaHQAoH0pbwBvAPIANgwA4DXYL90AAWFv6ib1JnIAAAFkde8m8SYAoMEhbKDAIQCgbCl2oMED8WOAAWducwD+Jk4nUCdoAHQAAANhaGxyc3QKJxInISc1Jz0nRydyInJvdwB0oJIhYQDpAFYmYSNycG9vbgAAAWR1GiceJ28AdwDuAPAmcAAAoMAh5SFmdAABYWgnJy0ncgByAG8AdwDzAAkMYQByAHAAbwBvAG4A8wATBGklZ2h0YXJyb3dzAACgySFxAHUAaQBnAGEAcgByAG8A9wBZJugkcmVldGltZXMAoMwiZwDaYmkAbgBnAGQAbwB0AHMAZQDxABwYgAFhaG0AYCdjJ2YncgDyAAkMYQDyABMEAKAPIG8idXN0AGGgsSPjIWhlAKCxI+0haWQAoO4qAAJhYnB0fCeGJ4knmScAAW5ygCeDJ2cAAKDtJ3IAAKD+IXIA6wAcDIABYWZsAI8nkieVJ3IAAKCGKQDgNdhj3XUAcwAAoC4qaSJtZXMAAKA1KgABYXCiJ6gncgBnoCkAdAAAoJQp7yJsaW50AKASKmEAcgDyADwnAAJhY2hxuCe8J6EMwCfxIXVvAKA6IHIAAOA12MfcAAFidYAmxCdvAPKgGSCoAYABaGlyAM4n0ifWJ3IAZQDlAE0n7SFlcwCgyiJpAIChuSVlZmwAXAxjEt4n9CFyaQCgzinsInVoYXIAoGgpAKAeIWENBSgJKA0oSyhVKIYoAACLKLAoAAAAAOMo5ygAABApJCkxKW0pcSmHKaYpAACYKgAAAACxKmMidXRlAFthcQB1AO8ABR+ApHsiRWFjZWlucHN5ABwoHignKCooLygyKEEoRihJKACgtCrwASMoAAAlKACguCpvAG4AYWF1AOUAgw1koLAqaQBsAF9hcgBjAF1hgAFFYXMAOCg6KD0oAKC2KnAAAKC6KmkAbQAAoOki7yJsaW50AKATKmkA7QCIDUFkbwB0AGKixSKRFgAAAABTKACgZiqAA0FhY21zdHgAYChkKG8ocyh1KHkogihyAHIAAKDYIXIAAAFocmkoayjrAJAab6CYIfcAzAd0ADuApwCnQGkAO2D3IWFyAKApKW0AAAFpbn4ozQBuAHUA8wDOAHQAAKA2J3IA7+A12DDdIxkAAmFjb3mRKJUonSisKHIAcAAAoG8mAAFoeZkonChjAHkASWRIZHIAdABtAqUoAAAAAKgoaQDkAFsPYQByAGEA7ABsJDuArQCtQAABZ22zKLsobQBhAAChwwNmdroouijCY4CjPCJkZWdsbnByAMgozCjPKNMo1yjaKN4obwB0AACgairxoEMiCw5FoJ4qAKCgKkWgnSoAoJ8qZQAAoEYi7CF1cwCgJCrhIXJyAKByKWEAcgDyAPwMAAJhZWl07Sj8KAEpCCkAAWxz8Sj4KGwAcwBlAHQAbQDpAH8oaABwAACgMyrwImFyc2wAoOQpAAFkbFoPBSllAACgIyNloKoqc6CsKgDgrCoA/oABZmxwABUpGCkfKfQhY3lMZGKgLwBhoMQpcgAAoD8jZgAA4DXYZN1hAAABZHIoKRcDZQBzAHWgYCZpAHQAAKBgJoABY3N1ADYpRilhKQABYXU6KUApcABzoJMiAOCTIgD+cABzoJQiAOCUIgD+dQAAAWJwSylWKQChjyJlcz4NUCllAHQAZaCPIvEAPw0AoZAiZXNIDVspZQB0AGWgkCLxAEkNAKGhJWFmZilbBHIAZQFrKVwEAKChJWEAcgDyAAMNAAJjZW10dyl7KX8pgilyAADgNdjI3HQAbQDuAM4AaQDsAAYpYQByAOYAVw0AAWFyiimOKXIA5qAGJhESAAFhbpIpoylpImdodAAAAWVwmSmgKXAAcwBpAGwAbwDuANkXaADpAKAkcwCvYIACYmNtbnAArin8KY4NJSooKgCkgiJFZGVtbnByc7wpvinCKcgpzCnUKdgp3CkAoMUqbwB0AACgvSpkoIYibwB0AACgwyr1IWx0AKDBKgABRWXQKdIpAKDLKgCgiiLsIXVzAKC/KuEhcnIAoHkpgAFlaXUA4inxKfQpdAAAoYIiZW7oKewpcQDxoIYivSllAHEA8aCKItEpbQAAoMcqAAFicPgp+ikAoNUqAKDTKmMAgKJ7ImFjZW5zAAcqDSoUKhYqRihwAHAAcgBvAPgAIyh1AHIAbAB5AGUA8QCDDfEAfA2AAWFlcwAcKiIqPShwAHAAcgBvAPgAPChxAPEAOShnAACgaiYApoMiMTIzRWRlaGxtbnBzPCo/KkIqRSpHKlIqWCpjKmcqaypzKncqO4C5ALlAO4CyALJAO4CzALNAAKDGKgABb3NLKk4qdAAAoL4qdQBiAACg2CpkoIcibwB0AACgxCpzAAABb3VdKmAqbAAAoMknYgAAoNcq4SFycgCgeyn1IWx0AKDCKgABRWVvKnEqAKDMKgCgiyLsIXVzAKDAKoABZWl1AH0qjCqPKnQAAKGDImVugyqHKnEA8aCHIkYqZQBxAPGgiyJwKm0AAKDIKgABYnCTKpUqAKDUKgCg1iqAAUFhbgCdKqEqrCpyAHIAAKDZIXIAAAFocqYqqCrrAJUab6CZIfcAxQf3IWFyAKAqKWwAaQBnADuA3wDfQOELzyrZKtwq6SrsKvEqAAD1KjQrAAAAAAAAAAAAAEwrbCsAAHErvSsAAAAAAADRK3IC1CoAAAAA2CrnIWV0AKAWI8RjcgDrAOUKgAFhZXkA4SrkKucq8iFvbmVh5CFpbGNhQmRvAPQAIg5sInJlYwAAoBUjcgAA4DXYMd0AAmVpa2/7KhIrKCsuK/IBACsAAAkrZQAAATRm6g0EK28AcgDlAOsNYQBzorgDECsAAAAAEit5AG0A0WMAAWNuFislK2sAAAFhcxsrIStwAHAAcgBvAPgAFw5pAG0AAKA8InMA8AD9DQABYXMsKyEr8AAXDnIAbgA7gP4A/kDsATgrOyswG2QA5QBnAmUAcwCAgdcAO2JkAEMrRCtJK9dAYaCgInIAAKAxKgCgMCqAAWVwcwBRK1MraSvhAAkh4qKkIlsrXysAAAAAYytvAHQAAKA2I2kAcgAAoPEqb+A12GXdcgBrAACg2irhAHgociJpbWUAAKA0IIABYWlwAHYreSu3K2QA5QC+DYADYWRlbXBzdACFK6MrmiunK6wrsCuzK24iZ2xlAACitSVkbHFykCuUK5ornCvvIXduAKC/JeUhZnRloMMl8QACBwCgXCJpImdodABloLkl8QBdDG8AdAAAoOwlaSJudXMAAKA6KuwhdXMAoDkqYgAAoM0p6SFtZQCgOyrlInppdW0AoOIjgAFjaHQAwivKK80rAAFyecYrySsA4DXYydxGZGMAeQBbZPIhb2tnYQABaW/UK9creAD0ANERaCJlYWQAAAFsct4r5ytlAGYAdABhAHIAcgBvAPcAXQbpJGdodGFycm93AKCgIQAJQUhhYmNkZmdobG1vcHJzdHV3CiwNLBEsHSwnLDEsQCxLLFIsYix6LIQsjyzLLOgs7Sz/LAotcgDyAAkDYQByAACgYykAAWNyFSwbLHUAdABlADuA+gD6QPIACQ1yAOMBIywAACUseQBeZHYAZQBtYQABaXkrLDAscgBjADuA+wD7QENkgAFhYmgANyw6LD0scgDyANEO7CFhY3FhYQDyAOAOAAFpckQsSCzzIWh0AKB+KQDgNdgy3XIAYQB2AGUAO4D5APlAYQFWLF8scgAAAWxyWixcLACgvyEAoL4hbABrAACggCUAAWN0Zix2LG8CbCwAAAAAcyxyAG4AZaAcI3IAAKAcI28AcAAAoA8jcgBpAACg+CUAAWFsfiyBLGMAcgBrYTuAqACoQAABZ3CILIssbwBuAHNhZgAA4DXYZt0AA2FkaGxzdZksniynLLgsuyzFLHIAcgBvAPcACQ1vAHcAbgBhAHIAcgBvAPcA2A5hI3Jwb29uAAABbHKvLLMsZQBmAPQAWyxpAGcAaAD0AF0sdQDzAKYOaQAAocUDaGzBLMIs0mNvAG4AxWPwI2Fycm93cwCgyCGAAWNpdADRLOEs5CxvAtcsAAAAAN4scgBuAGWgHSNyAACgHSNvAHAAAKAOI24AZwBvYXIAaQAAoPklYwByAADgNdjK3IABZGlyAPMs9yz6LG8AdAAAoPAi7CFkZWlhaQBmoLUlAKC0JQABYW0DLQYtcgDyAMosbAA7gPwA/EDhIm5nbGUAoKcpgAdBQkRhY2RlZmxub3Byc3oAJy0qLTAtNC2bLZ0toS2/LcMtxy3TLdgt3C3gLfwtcgDyABADYQByAHag6CoAoOkqYQBzAOgA/gIAAW5yOC08LechcnQAoJwpgANla25wcnN0AJkpSC1NLVQtXi1iLYItYQBwAHAA4QAaHG8AdABoAGkAbgDnAKEXgAFoaXIAoSmzJFotbwBwAPQAdCVooJUh7wD4JgABaXVmLWotZwBtAOEAuygAAWJwbi14LXMjZXRuZXEAceCKIgD+AODLKgD+cyNldG5lcQBx4IsiAP4A4MwqAP4AAWhyhi2KLWUAdADhABIraSNhbmdsZQAAAWxyki2WLeUhZnQAoLIiaSJnaHQAAKCzInkAMmThIXNoAKCiIoABZWxyAKcttC24LWKiKCKuLQAAAACyLWEAcgAAoLsicQAAoFoi7CFpcACg7iIAAWJ0vC1eD2EA8gBfD3IAAOA12DPddAByAOkAlS1zAHUAAAFicM0t0C0A4IIi0iAA4IMi0iBwAGYAAOA12GfdcgBvAPAAWQt0AHIA6QCaLQABY3XkLegtcgAA4DXYy9wAAWJw7C30LW4AAAFFZXUt8S0A4IoiAP5uAAABRWV/LfktAOCLIgD+6SJnemFnAKCaKYADY2Vmb3BycwANLhAuJS4pLiMuLi40LukhcmN1YQABZGkULiEuAAFiZxguHC5hAHIAAKBfKmUAcaAnIgCgWSLlIXJwAKAYIXIAAOA12DTdcABmAADgNdho3WWgQCJhAHQA6ABqD2MAcgAA4DXYzNzjCuQRUC4AAFQuAABYLmIuAAAAAGMubS5wLnQuAAAAAIguki4AAJouJxIqEnQAcgDpAB0ScgAA4DXYNd0AAUFhWy5eLnIA8gDnAnIA8gCTB75jAAFBYWYuaS5yAPIA4AJyAPIAjAdhAPAAeh5pAHMAAKD7IoABZHB0APgReS6DLgABZmx9LoAuAOA12GnddQDzAP8RaQBtAOUABBIAAUFhiy6OLnIA8gDuAnIA8gCaBwABY3GVLgoScgAA4DXYzdwAAXB0nS6hLmwAdQDzACUScgDpACASAARhY2VmaW9zdbEuvC7ELsguzC7PLtQu2S5jAAABdXm2LrsudABlADuA/QD9QE9kAAFpecAuwy5yAGMAd2FLZG4AO4ClAKVAcgAA4DXYNt1jAHkAV2RwAGYAAOA12GrdYwByAADgNdjO3AABY23dLt8ueQBOZGwAO4D/AP9AAAVhY2RlZmhpb3N38y73Lv8uAi8MLxAvEy8YLx0vIi9jInV0ZQB6YQABYXn7Lv4u8iFvbn5hN2RvAHQAfGEAAWV0Bi8KL3QAcgDmAB8QYQC2Y3IAAOA12DfdYwB5ADZk5yJyYXJyAKDdIXAAZgAA4DXYa91jAHIAAOA12M/cAAFqbiYvKC8AoA0gagAAoAwg"); |
| | | |
| | | /** |
| | | * Bit flags & masks for the binary trie encoding used for entity decoding. |
| | | * |
| | | * Bit layout (16 bits total): |
| | | * 15..14 VALUE_LENGTH (+1 encoding; 0 => no value) |
| | | * 13 FLAG13. If valueLength>0: semicolon required flag (implicit ';'). |
| | | * If valueLength==0: compact run flag. |
| | | * 12..7 BRANCH_LENGTH Branch length (0 => single branch in 6..0 if jumpOffset==char) OR run length (when compact run) |
| | | * 6..0 JUMP_TABLE Jump offset (jump table) OR single-branch char code OR first run char |
| | | */ |
| | | var BinTrieFlags; |
| | | (function (BinTrieFlags) { |
| | | BinTrieFlags[BinTrieFlags["VALUE_LENGTH"] = 49152] = "VALUE_LENGTH"; |
| | | BinTrieFlags[BinTrieFlags["FLAG13"] = 8192] = "FLAG13"; |
| | | BinTrieFlags[BinTrieFlags["BRANCH_LENGTH"] = 8064] = "BRANCH_LENGTH"; |
| | | BinTrieFlags[BinTrieFlags["JUMP_TABLE"] = 127] = "JUMP_TABLE"; |
| | | })(BinTrieFlags || (BinTrieFlags = {})); |
| | | |
| | | var CharCodes; |
| | | (function (CharCodes) { |
| | |
| | | CharCodes[CharCodes["UPPER_Z"] = 90] = "UPPER_Z"; |
| | | })(CharCodes || (CharCodes = {})); |
| | | /** Bit that needs to be set to convert an upper case ASCII character to lower case */ |
| | | const TO_LOWER_BIT = 0b100000; |
| | | var BinTrieFlags; |
| | | (function (BinTrieFlags) { |
| | | BinTrieFlags[BinTrieFlags["VALUE_LENGTH"] = 49152] = "VALUE_LENGTH"; |
| | | BinTrieFlags[BinTrieFlags["BRANCH_LENGTH"] = 16256] = "BRANCH_LENGTH"; |
| | | BinTrieFlags[BinTrieFlags["JUMP_TABLE"] = 127] = "JUMP_TABLE"; |
| | | })(BinTrieFlags || (BinTrieFlags = {})); |
| | | const TO_LOWER_BIT = 32; |
| | | function isNumber$1(code) { |
| | | return code >= CharCodes.ZERO && code <= CharCodes.NINE; |
| | | } |
| | |
| | | class EntityDecoder { |
| | | constructor( |
| | | /** The tree used to decode entities. */ |
| | | // biome-ignore lint/correctness/noUnusedPrivateClassMembers: False positive |
| | | decodeTree, |
| | | /** |
| | | * The function that is called when a codepoint is decoded. |
| | |
| | | this.excess = 1; |
| | | /** The mode in which the decoder is operating. */ |
| | | this.decodeMode = DecodingMode.Strict; |
| | | /** The number of characters that have been consumed in the current run. */ |
| | | this.runConsumed = 0; |
| | | } |
| | | /** Resets the instance to make it reusable. */ |
| | | startEntity(decodeMode) { |
| | |
| | | this.treeIndex = 0; |
| | | this.excess = 1; |
| | | this.consumed = 1; |
| | | this.runConsumed = 0; |
| | | } |
| | | /** |
| | | * Write an entity to the decoder. This can be called multiple times with partial entities. |
| | |
| | | * Mirrors the implementation of `getDecoder`, but with the ability to stop decoding if the |
| | | * entity is incomplete, and resume when the next string is written. |
| | | * |
| | | * @param string The string containing the entity (or a continuation of the entity). |
| | | * @param input The string containing the entity (or a continuation of the entity). |
| | | * @param offset The offset at which the entity begins. Should be 0 if this is not the first call. |
| | | * @returns The number of characters that were consumed, or -1 if the entity is incomplete. |
| | | */ |
| | | write(str, offset) { |
| | | write(input, offset) { |
| | | switch (this.state) { |
| | | case EntityDecoderState.EntityStart: { |
| | | if (str.charCodeAt(offset) === CharCodes.NUM) { |
| | | if (input.charCodeAt(offset) === CharCodes.NUM) { |
| | | this.state = EntityDecoderState.NumericStart; |
| | | this.consumed += 1; |
| | | return this.stateNumericStart(str, offset + 1); |
| | | return this.stateNumericStart(input, offset + 1); |
| | | } |
| | | this.state = EntityDecoderState.NamedEntity; |
| | | return this.stateNamedEntity(str, offset); |
| | | return this.stateNamedEntity(input, offset); |
| | | } |
| | | case EntityDecoderState.NumericStart: { |
| | | return this.stateNumericStart(str, offset); |
| | | return this.stateNumericStart(input, offset); |
| | | } |
| | | case EntityDecoderState.NumericDecimal: { |
| | | return this.stateNumericDecimal(str, offset); |
| | | return this.stateNumericDecimal(input, offset); |
| | | } |
| | | case EntityDecoderState.NumericHex: { |
| | | return this.stateNumericHex(str, offset); |
| | | return this.stateNumericHex(input, offset); |
| | | } |
| | | case EntityDecoderState.NamedEntity: { |
| | | return this.stateNamedEntity(str, offset); |
| | | return this.stateNamedEntity(input, offset); |
| | | } |
| | | } |
| | | } |
| | |
| | | * |
| | | * Equivalent to the `Numeric character reference state` in the HTML spec. |
| | | * |
| | | * @param str The string containing the entity (or a continuation of the entity). |
| | | * @param input The string containing the entity (or a continuation of the entity). |
| | | * @param offset The current offset. |
| | | * @returns The number of characters that were consumed, or -1 if the entity is incomplete. |
| | | */ |
| | | stateNumericStart(str, offset) { |
| | | if (offset >= str.length) { |
| | | stateNumericStart(input, offset) { |
| | | if (offset >= input.length) { |
| | | return -1; |
| | | } |
| | | if ((str.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) { |
| | | if ((input.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) { |
| | | this.state = EntityDecoderState.NumericHex; |
| | | this.consumed += 1; |
| | | return this.stateNumericHex(str, offset + 1); |
| | | return this.stateNumericHex(input, offset + 1); |
| | | } |
| | | this.state = EntityDecoderState.NumericDecimal; |
| | | return this.stateNumericDecimal(str, offset); |
| | | } |
| | | addToNumericResult(str, start, end, base) { |
| | | if (start !== end) { |
| | | const digitCount = end - start; |
| | | this.result = |
| | | this.result * Math.pow(base, digitCount) + |
| | | parseInt(str.substr(start, digitCount), base); |
| | | this.consumed += digitCount; |
| | | } |
| | | return this.stateNumericDecimal(input, offset); |
| | | } |
| | | /** |
| | | * Parses a hexadecimal numeric entity. |
| | | * |
| | | * Equivalent to the `Hexademical character reference state` in the HTML spec. |
| | | * |
| | | * @param str The string containing the entity (or a continuation of the entity). |
| | | * @param input The string containing the entity (or a continuation of the entity). |
| | | * @param offset The current offset. |
| | | * @returns The number of characters that were consumed, or -1 if the entity is incomplete. |
| | | */ |
| | | stateNumericHex(str, offset) { |
| | | const startIdx = offset; |
| | | while (offset < str.length) { |
| | | const char = str.charCodeAt(offset); |
| | | stateNumericHex(input, offset) { |
| | | while (offset < input.length) { |
| | | const char = input.charCodeAt(offset); |
| | | if (isNumber$1(char) || isHexadecimalCharacter(char)) { |
| | | offset += 1; |
| | | // Convert hex digit to value (0-15); 'a'/'A' -> 10. |
| | | const digit = char <= CharCodes.NINE |
| | | ? char - CharCodes.ZERO |
| | | : (char | TO_LOWER_BIT) - CharCodes.LOWER_A + 10; |
| | | this.result = this.result * 16 + digit; |
| | | this.consumed++; |
| | | offset++; |
| | | } |
| | | else { |
| | | this.addToNumericResult(str, startIdx, offset, 16); |
| | | return this.emitNumericEntity(char, 3); |
| | | } |
| | | } |
| | | this.addToNumericResult(str, startIdx, offset, 16); |
| | | return -1; |
| | | return -1; // Incomplete entity |
| | | } |
| | | /** |
| | | * Parses a decimal numeric entity. |
| | | * |
| | | * Equivalent to the `Decimal character reference state` in the HTML spec. |
| | | * |
| | | * @param str The string containing the entity (or a continuation of the entity). |
| | | * @param input The string containing the entity (or a continuation of the entity). |
| | | * @param offset The current offset. |
| | | * @returns The number of characters that were consumed, or -1 if the entity is incomplete. |
| | | */ |
| | | stateNumericDecimal(str, offset) { |
| | | const startIdx = offset; |
| | | while (offset < str.length) { |
| | | const char = str.charCodeAt(offset); |
| | | stateNumericDecimal(input, offset) { |
| | | while (offset < input.length) { |
| | | const char = input.charCodeAt(offset); |
| | | if (isNumber$1(char)) { |
| | | offset += 1; |
| | | this.result = this.result * 10 + (char - CharCodes.ZERO); |
| | | this.consumed++; |
| | | offset++; |
| | | } |
| | | else { |
| | | this.addToNumericResult(str, startIdx, offset, 10); |
| | | return this.emitNumericEntity(char, 2); |
| | | } |
| | | } |
| | | this.addToNumericResult(str, startIdx, offset, 10); |
| | | return -1; |
| | | return -1; // Incomplete entity |
| | | } |
| | | /** |
| | | * Validate and emit a numeric entity. |
| | |
| | | * |
| | | * Equivalent to the `Named character reference state` in the HTML spec. |
| | | * |
| | | * @param str The string containing the entity (or a continuation of the entity). |
| | | * @param input The string containing the entity (or a continuation of the entity). |
| | | * @param offset The current offset. |
| | | * @returns The number of characters that were consumed, or -1 if the entity is incomplete. |
| | | */ |
| | | stateNamedEntity(str, offset) { |
| | | stateNamedEntity(input, offset) { |
| | | const { decodeTree } = this; |
| | | let current = decodeTree[this.treeIndex]; |
| | | // The mask is the number of bytes of the value, including the current byte. |
| | | // The length is the number of bytes of the value, including the current byte. |
| | | let valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14; |
| | | for (; offset < str.length; offset++, this.excess++) { |
| | | const char = str.charCodeAt(offset); |
| | | while (offset < input.length) { |
| | | // Handle compact runs (possibly inline): valueLength == 0 and SEMI_REQUIRED bit set. |
| | | if (valueLength === 0 && (current & BinTrieFlags.FLAG13) !== 0) { |
| | | const runLength = (current & BinTrieFlags.BRANCH_LENGTH) >> 7; /* 2..63 */ |
| | | // If we are starting a run, check the first char. |
| | | if (this.runConsumed === 0) { |
| | | const firstChar = current & BinTrieFlags.JUMP_TABLE; |
| | | if (input.charCodeAt(offset) !== firstChar) { |
| | | return this.result === 0 |
| | | ? 0 |
| | | : this.emitNotTerminatedNamedEntity(); |
| | | } |
| | | offset++; |
| | | this.excess++; |
| | | this.runConsumed++; |
| | | } |
| | | // Check remaining characters in the run. |
| | | while (this.runConsumed < runLength) { |
| | | if (offset >= input.length) { |
| | | return -1; |
| | | } |
| | | const charIndexInPacked = this.runConsumed - 1; |
| | | const packedWord = decodeTree[this.treeIndex + 1 + (charIndexInPacked >> 1)]; |
| | | const expectedChar = charIndexInPacked % 2 === 0 |
| | | ? packedWord & 0xff |
| | | : (packedWord >> 8) & 0xff; |
| | | if (input.charCodeAt(offset) !== expectedChar) { |
| | | this.runConsumed = 0; |
| | | return this.result === 0 |
| | | ? 0 |
| | | : this.emitNotTerminatedNamedEntity(); |
| | | } |
| | | offset++; |
| | | this.excess++; |
| | | this.runConsumed++; |
| | | } |
| | | this.runConsumed = 0; |
| | | this.treeIndex += 1 + (runLength >> 1); |
| | | current = decodeTree[this.treeIndex]; |
| | | valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14; |
| | | } |
| | | if (offset >= input.length) |
| | | break; |
| | | const char = input.charCodeAt(offset); |
| | | /* |
| | | * Implicit semicolon handling for nodes that require a semicolon but |
| | | * don't have an explicit ';' branch stored in the trie. If we have |
| | | * a value on the current node, it requires a semicolon, and the |
| | | * current input character is a semicolon, emit the entity using the |
| | | * current node (without descending further). |
| | | */ |
| | | if (char === CharCodes.SEMI && |
| | | valueLength !== 0 && |
| | | (current & BinTrieFlags.FLAG13) !== 0) { |
| | | return this.emitNamedEntityData(this.treeIndex, valueLength, this.consumed + this.excess); |
| | | } |
| | | this.treeIndex = determineBranch(decodeTree, current, this.treeIndex + Math.max(1, valueLength), char); |
| | | if (this.treeIndex < 0) { |
| | | return this.result === 0 || |
| | |
| | | return this.emitNamedEntityData(this.treeIndex, valueLength, this.consumed + this.excess); |
| | | } |
| | | // If we encounter a non-terminated (legacy) entity while parsing strictly, then ignore it. |
| | | if (this.decodeMode !== DecodingMode.Strict) { |
| | | if (this.decodeMode !== DecodingMode.Strict && |
| | | (current & BinTrieFlags.FLAG13) === 0) { |
| | | this.result = this.treeIndex; |
| | | this.consumed += this.excess; |
| | | this.excess = 0; |
| | | } |
| | | } |
| | | // Increment offset & excess for next iteration |
| | | offset++; |
| | | this.excess++; |
| | | } |
| | | return -1; |
| | | } |
| | |
| | | emitNamedEntityData(result, valueLength, consumed) { |
| | | const { decodeTree } = this; |
| | | this.emitCodePoint(valueLength === 1 |
| | | ? decodeTree[result] & ~BinTrieFlags.VALUE_LENGTH |
| | | ? decodeTree[result] & |
| | | ~(BinTrieFlags.VALUE_LENGTH | BinTrieFlags.FLAG13) |
| | | : decodeTree[result + 1], consumed); |
| | | if (valueLength === 3) { |
| | | // For multi-byte values, we need to emit the second byte. |
| | |
| | | * @returns A function that decodes entities in a string. |
| | | */ |
| | | function getDecoder(decodeTree) { |
| | | let ret = ""; |
| | | const decoder = new EntityDecoder(decodeTree, (str) => (ret += fromCodePoint(str))); |
| | | return function decodeWithTrie(str, decodeMode) { |
| | | let returnValue = ""; |
| | | const decoder = new EntityDecoder(decodeTree, (data) => (returnValue += fromCodePoint(data))); |
| | | return function decodeWithTrie(input, decodeMode) { |
| | | let lastIndex = 0; |
| | | let offset = 0; |
| | | while ((offset = str.indexOf("&", offset)) >= 0) { |
| | | ret += str.slice(lastIndex, offset); |
| | | while ((offset = input.indexOf("&", offset)) >= 0) { |
| | | returnValue += input.slice(lastIndex, offset); |
| | | decoder.startEntity(decodeMode); |
| | | const len = decoder.write(str, |
| | | const length = decoder.write(input, |
| | | // Skip the "&" |
| | | offset + 1); |
| | | if (len < 0) { |
| | | if (length < 0) { |
| | | lastIndex = offset + decoder.end(); |
| | | break; |
| | | } |
| | | lastIndex = offset + len; |
| | | // If `len` is 0, skip the current `&` and continue. |
| | | offset = len === 0 ? lastIndex + 1 : lastIndex; |
| | | lastIndex = offset + length; |
| | | // If `length` is 0, skip the current `&` and continue. |
| | | offset = length === 0 ? lastIndex + 1 : lastIndex; |
| | | } |
| | | const result = ret + str.slice(lastIndex); |
| | | const result = returnValue + input.slice(lastIndex); |
| | | // Make sure we don't keep a reference to the final string. |
| | | ret = ""; |
| | | returnValue = ""; |
| | | return result; |
| | | }; |
| | | } |
| | |
| | | * @param char The current character. |
| | | * @returns The index of the next node, or -1 if no branch is taken. |
| | | */ |
| | | function determineBranch(decodeTree, current, nodeIdx, char) { |
| | | function determineBranch(decodeTree, current, nodeIndex, char) { |
| | | const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7; |
| | | const jumpOffset = current & BinTrieFlags.JUMP_TABLE; |
| | | // Case 1: Single branch encoded in jump offset |
| | | if (branchCount === 0) { |
| | | return jumpOffset !== 0 && char === jumpOffset ? nodeIdx : -1; |
| | | return jumpOffset !== 0 && char === jumpOffset ? nodeIndex : -1; |
| | | } |
| | | // Case 2: Multiple branches encoded in jump table |
| | | if (jumpOffset) { |
| | | const value = char - jumpOffset; |
| | | return value < 0 || value >= branchCount |
| | | ? -1 |
| | | : decodeTree[nodeIdx + value] - 1; |
| | | : decodeTree[nodeIndex + value] - 1; |
| | | } |
| | | // Case 3: Multiple branches encoded in dictionary |
| | | // Binary search for the character. |
| | | let lo = nodeIdx; |
| | | let hi = lo + branchCount - 1; |
| | | // Case 3: Multiple branches encoded in packed dictionary (two keys per uint16) |
| | | const packedKeySlots = (branchCount + 1) >> 1; |
| | | /* |
| | | * Treat packed keys as a virtual sorted array of length `branchCount`. |
| | | * Key(i) = low byte for even i, high byte for odd i in slot i>>1. |
| | | */ |
| | | let lo = 0; |
| | | let hi = branchCount - 1; |
| | | while (lo <= hi) { |
| | | const mid = (lo + hi) >>> 1; |
| | | const midVal = decodeTree[mid]; |
| | | if (midVal < char) { |
| | | const slot = mid >> 1; |
| | | const packed = decodeTree[nodeIndex + slot]; |
| | | const midKey = (packed >> ((mid & 1) * 8)) & 0xff; |
| | | if (midKey < char) { |
| | | lo = mid + 1; |
| | | } |
| | | else if (midVal > char) { |
| | | else if (midKey > char) { |
| | | hi = mid - 1; |
| | | } |
| | | else { |
| | | return decodeTree[mid + branchCount]; |
| | | return decodeTree[nodeIndex + packedKeySlots + mid]; |
| | | } |
| | | } |
| | | return -1; |
| | | } |
| | | const htmlDecoder = getDecoder(htmlDecodeTree); |
| | | getDecoder(xmlDecodeTree); |
| | | const htmlDecoder = /* #__PURE__ */ getDecoder(htmlDecodeTree); |
| | | /** |
| | | * Decodes an HTML string. |
| | | * |
| | | * @param str The string to decode. |
| | | * @param htmlString The string to decode. |
| | | * @param mode The decoding mode. |
| | | * @returns The decoded string. |
| | | */ |
| | | function decodeHTML(str, mode = DecodingMode.Legacy) { |
| | | return htmlDecoder(str, mode); |
| | | function decodeHTML(htmlString, mode = DecodingMode.Legacy) { |
| | | return htmlDecoder(htmlString, mode); |
| | | } |
| | | |
| | | const defaultDelimitersOpen = new Uint8Array([123, 123]); |
| | |
| | | getPos(index) { |
| | | let line = 1; |
| | | let column = index + 1; |
| | | for (let i = this.newlines.length - 1; i >= 0; i--) { |
| | | const newlineIndex = this.newlines[i]; |
| | | if (index > newlineIndex) { |
| | | line = i + 2; |
| | | column = index - newlineIndex; |
| | | break; |
| | | const length = this.newlines.length; |
| | | let j = -1; |
| | | if (length > 100) { |
| | | let l = -1; |
| | | let r = length; |
| | | while (l + 1 < r) { |
| | | const m = l + r >>> 1; |
| | | this.newlines[m] < index ? l = m : r = m; |
| | | } |
| | | j = l; |
| | | } else { |
| | | for (let i = length - 1; i >= 0; i--) { |
| | | if (index > this.newlines[i]) { |
| | | j = i; |
| | | break; |
| | | } |
| | | } |
| | | } |
| | | if (j >= 0) { |
| | | line = j + 2; |
| | | column = index - this.newlines[j]; |
| | | } |
| | | return { |
| | | column, |
| | |
| | | "43": "X_V_MODEL_ON_SCOPE_VARIABLE", |
| | | "X_V_MODEL_ON_PROPS": 44, |
| | | "44": "X_V_MODEL_ON_PROPS", |
| | | "X_INVALID_EXPRESSION": 45, |
| | | "45": "X_INVALID_EXPRESSION", |
| | | "X_KEEP_ALIVE_INVALID_CHILDREN": 46, |
| | | "46": "X_KEEP_ALIVE_INVALID_CHILDREN", |
| | | "X_PREFIX_ID_NOT_SUPPORTED": 47, |
| | | "47": "X_PREFIX_ID_NOT_SUPPORTED", |
| | | "X_MODULE_MODE_NOT_SUPPORTED": 48, |
| | | "48": "X_MODULE_MODE_NOT_SUPPORTED", |
| | | "X_CACHE_HANDLER_NOT_SUPPORTED": 49, |
| | | "49": "X_CACHE_HANDLER_NOT_SUPPORTED", |
| | | "X_SCOPE_ID_NOT_SUPPORTED": 50, |
| | | "50": "X_SCOPE_ID_NOT_SUPPORTED", |
| | | "X_VNODE_HOOKS": 51, |
| | | "51": "X_VNODE_HOOKS", |
| | | "X_V_BIND_INVALID_SAME_NAME_ARGUMENT": 52, |
| | | "52": "X_V_BIND_INVALID_SAME_NAME_ARGUMENT", |
| | | "__EXTEND_POINT__": 53, |
| | | "53": "__EXTEND_POINT__" |
| | | "X_V_MODEL_ON_CONST": 45, |
| | | "45": "X_V_MODEL_ON_CONST", |
| | | "X_INVALID_EXPRESSION": 46, |
| | | "46": "X_INVALID_EXPRESSION", |
| | | "X_KEEP_ALIVE_INVALID_CHILDREN": 47, |
| | | "47": "X_KEEP_ALIVE_INVALID_CHILDREN", |
| | | "X_PREFIX_ID_NOT_SUPPORTED": 48, |
| | | "48": "X_PREFIX_ID_NOT_SUPPORTED", |
| | | "X_MODULE_MODE_NOT_SUPPORTED": 49, |
| | | "49": "X_MODULE_MODE_NOT_SUPPORTED", |
| | | "X_CACHE_HANDLER_NOT_SUPPORTED": 50, |
| | | "50": "X_CACHE_HANDLER_NOT_SUPPORTED", |
| | | "X_SCOPE_ID_NOT_SUPPORTED": 51, |
| | | "51": "X_SCOPE_ID_NOT_SUPPORTED", |
| | | "X_VNODE_HOOKS": 52, |
| | | "52": "X_VNODE_HOOKS", |
| | | "X_V_BIND_INVALID_SAME_NAME_ARGUMENT": 53, |
| | | "53": "X_V_BIND_INVALID_SAME_NAME_ARGUMENT", |
| | | "__EXTEND_POINT__": 54, |
| | | "54": "__EXTEND_POINT__" |
| | | }; |
| | | const errorMessages$1 = { |
| | | // parse errors |
| | |
| | | [32]: `v-for has invalid expression.`, |
| | | [33]: `<template v-for> key should be placed on the <template> tag.`, |
| | | [34]: `v-bind is missing expression.`, |
| | | [52]: `v-bind with same-name shorthand only allows static argument.`, |
| | | [53]: `v-bind with same-name shorthand only allows static argument.`, |
| | | [35]: `v-on is missing expression.`, |
| | | [36]: `Unexpected custom directive on <slot> outlet.`, |
| | | [37]: `Mixed v-slot usage on both the component and nested <template>. When there are multiple named slots, all slots should use <template> syntax to avoid scope ambiguity.`, |
| | |
| | | [43]: `v-model cannot be used on v-for or v-slot scope variables because they are not writable.`, |
| | | [44]: `v-model cannot be used on a prop, because local prop bindings are not writable. |
| | | Use a v-bind binding combined with a v-on listener that emits update:x event instead.`, |
| | | [45]: `Error parsing JavaScript expression: `, |
| | | [46]: `<KeepAlive> expects exactly one child component.`, |
| | | [51]: `@vnode-* hooks in templates are no longer supported. Use the vue: prefix instead. For example, @vnode-mounted should be changed to @vue:mounted. @vnode-* hooks support has been removed in 3.4.`, |
| | | [45]: `v-model cannot be used on a const binding because it is not writable.`, |
| | | [46]: `Error parsing JavaScript expression: `, |
| | | [47]: `<KeepAlive> expects exactly one child component.`, |
| | | [52]: `@vnode-* hooks in templates are no longer supported. Use the vue: prefix instead. For example, @vnode-mounted should be changed to @vue:mounted. @vnode-* hooks support has been removed in 3.4.`, |
| | | // generic errors |
| | | [47]: `"prefixIdentifiers" option is not supported in this build of compiler.`, |
| | | [48]: `ES module mode is not supported in this build of compiler.`, |
| | | [49]: `"cacheHandlers" option is only supported when the "prefixIdentifiers" option is enabled.`, |
| | | [50]: `"scopeId" option is only supported in module mode.`, |
| | | [48]: `"prefixIdentifiers" option is not supported in this build of compiler.`, |
| | | [49]: `ES module mode is not supported in this build of compiler.`, |
| | | [50]: `"cacheHandlers" option is only supported when the "prefixIdentifiers" option is enabled.`, |
| | | [51]: `"scopeId" option is only supported in module mode.`, |
| | | // just to fulfill types |
| | | [53]: `` |
| | | [54]: `` |
| | | }; |
| | | |
| | | function getDefaultExportFromCjs (x) { |
| | |
| | | syntaxPlugin |
| | | }) { |
| | | const hasMissingPlugin = reasonCode === "MissingPlugin" || reasonCode === "MissingOneOfPlugins"; |
| | | { |
| | | const oldReasonCodes = { |
| | | AccessorCannotDeclareThisParameter: "AccesorCannotDeclareThisParameter", |
| | | AccessorCannotHaveTypeParameters: "AccesorCannotHaveTypeParameters", |
| | | ConstInitializerMustBeStringOrNumericLiteralOrLiteralEnumReference: "ConstInitiailizerMustBeStringOrNumericLiteralOrLiteralEnumReference", |
| | | SetAccessorCannotHaveOptionalParameter: "SetAccesorCannotHaveOptionalParameter", |
| | | SetAccessorCannotHaveRestParameter: "SetAccesorCannotHaveRestParameter", |
| | | SetAccessorCannotHaveReturnType: "SetAccesorCannotHaveReturnType" |
| | | }; |
| | | if (oldReasonCodes[reasonCode]) { |
| | | reasonCode = oldReasonCodes[reasonCode]; |
| | | } |
| | | const oldReasonCodes = { |
| | | AccessorCannotDeclareThisParameter: "AccesorCannotDeclareThisParameter", |
| | | AccessorCannotHaveTypeParameters: "AccesorCannotHaveTypeParameters", |
| | | ConstInitializerMustBeStringOrNumericLiteralOrLiteralEnumReference: "ConstInitiailizerMustBeStringOrNumericLiteralOrLiteralEnumReference", |
| | | SetAccessorCannotHaveOptionalParameter: "SetAccesorCannotHaveOptionalParameter", |
| | | SetAccessorCannotHaveRestParameter: "SetAccesorCannotHaveRestParameter", |
| | | SetAccessorCannotHaveReturnType: "SetAccesorCannotHaveReturnType" |
| | | }; |
| | | if (oldReasonCodes[reasonCode]) { |
| | | reasonCode = oldReasonCodes[reasonCode]; |
| | | } |
| | | return function constructor(loc, details) { |
| | | const error = new SyntaxError(); |
| | |
| | | } |
| | | parsePrivateName() { |
| | | const node = super.parsePrivateName(); |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return node; |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return node; |
| | | } |
| | | return this.convertPrivateNameToPrivateIdentifier(node); |
| | | } |
| | |
| | | return this.castNodeTo(node, "PrivateIdentifier"); |
| | | } |
| | | isPrivateName(node) { |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return super.isPrivateName(node); |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return super.isPrivateName(node); |
| | | } |
| | | return node.type === "PrivateIdentifier"; |
| | | } |
| | | getPrivateNameSV(node) { |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return super.getPrivateNameSV(node); |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return super.getPrivateNameSV(node); |
| | | } |
| | | return node.name; |
| | | } |
| | |
| | | } |
| | | parseClassProperty(...args) { |
| | | const propertyNode = super.parseClassProperty(...args); |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return propertyNode; |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return propertyNode; |
| | | } |
| | | { |
| | | this.castNodeTo(propertyNode, "PropertyDefinition"); |
| | | } |
| | | this.castNodeTo(propertyNode, "PropertyDefinition"); |
| | | return propertyNode; |
| | | } |
| | | parseClassPrivateProperty(...args) { |
| | | const propertyNode = super.parseClassPrivateProperty(...args); |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return propertyNode; |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return propertyNode; |
| | | } |
| | | { |
| | | this.castNodeTo(propertyNode, "PropertyDefinition"); |
| | | } |
| | | this.castNodeTo(propertyNode, "PropertyDefinition"); |
| | | propertyNode.computed = false; |
| | | return propertyNode; |
| | | } |
| | | parseClassAccessorProperty(node) { |
| | | const accessorPropertyNode = super.parseClassAccessorProperty(node); |
| | | { |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return accessorPropertyNode; |
| | | } |
| | | if (!this.getPluginOption("estree", "classFeatures")) { |
| | | return accessorPropertyNode; |
| | | } |
| | | if (accessorPropertyNode.abstract && this.hasPlugin("typescript")) { |
| | | delete accessorPropertyNode.abstract; |
| | |
| | | finishCallExpression(unfinished, optional) { |
| | | const node = super.finishCallExpression(unfinished, optional); |
| | | if (node.callee.type === "Import") { |
| | | var _ref; |
| | | var _ref, _ref2; |
| | | this.castNodeTo(node, "ImportExpression"); |
| | | node.source = node.arguments[0]; |
| | | node.options = (_ref = node.arguments[1]) != null ? _ref : null; |
| | | { |
| | | var _ref2; |
| | | node.attributes = (_ref2 = node.arguments[1]) != null ? _ref2 : null; |
| | | } |
| | | node.attributes = (_ref2 = node.arguments[1]) != null ? _ref2 : null; |
| | | delete node.arguments; |
| | | delete node.callee; |
| | | } else if (node.type === "OptionalCallExpression") { |
| | |
| | | j_cTag: new TokContext("</tag"), |
| | | j_expr: new TokContext("<tag>...</tag>", true) |
| | | }; |
| | | { |
| | | types.template = new TokContext("`", true); |
| | | } |
| | | types.template = new TokContext("`", true); |
| | | const beforeExpr = true; |
| | | const startsExpr = true; |
| | | const isLoop = true; |
| | |
| | | this.prefix = !!conf.prefix; |
| | | this.postfix = !!conf.postfix; |
| | | this.binop = conf.binop != null ? conf.binop : null; |
| | | { |
| | | this.updateContext = null; |
| | | } |
| | | this.updateContext = null; |
| | | } |
| | | } |
| | | const keywords$1 = new Map(); |
| | |
| | | function getExportedToken(token) { |
| | | return tokenTypes[token]; |
| | | } |
| | | { |
| | | tokenTypes[8].updateContext = context => { |
| | | tokenTypes[8].updateContext = context => { |
| | | context.pop(); |
| | | }; |
| | | tokenTypes[5].updateContext = tokenTypes[7].updateContext = tokenTypes[23].updateContext = context => { |
| | | context.push(types.brace); |
| | | }; |
| | | tokenTypes[22].updateContext = context => { |
| | | if (context[context.length - 1] === types.template) { |
| | | context.pop(); |
| | | }; |
| | | tokenTypes[5].updateContext = tokenTypes[7].updateContext = tokenTypes[23].updateContext = context => { |
| | | context.push(types.brace); |
| | | }; |
| | | tokenTypes[22].updateContext = context => { |
| | | if (context[context.length - 1] === types.template) { |
| | | context.pop(); |
| | | } else { |
| | | context.push(types.template); |
| | | } |
| | | }; |
| | | tokenTypes[143].updateContext = context => { |
| | | context.push(types.j_expr, types.j_oTag); |
| | | }; |
| | | } |
| | | } else { |
| | | context.push(types.template); |
| | | } |
| | | }; |
| | | tokenTypes[143].updateContext = context => { |
| | | context.push(types.j_expr, types.j_oTag); |
| | | }; |
| | | let nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u0870-\u0887\u0889-\u088f\u08a0-\u08c9\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c5c\u0c5d\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cdc-\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d04-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u1711\u171f-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4c\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c8a\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31bf\u31f0-\u31ff\u3400-\u4dbf\u4e00-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7dc\ua7f1-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab69\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc"; |
| | | let nonASCIIidentifierChars = "\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0897-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0cf3\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ece\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1add\u1ae0-\u1aeb\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\u30fb\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f\uff65"; |
| | | const nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]"); |
| | |
| | | parseClassSuper(node) { |
| | | super.parseClassSuper(node); |
| | | if (node.superClass && (this.match(47) || this.match(51))) { |
| | | { |
| | | node.superTypeParameters = this.flowParseTypeParameterInstantiationInExpression(); |
| | | } |
| | | node.superTypeParameters = this.flowParseTypeParameterInstantiationInExpression(); |
| | | } |
| | | if (this.isContextual(113)) { |
| | | this.next(); |
| | |
| | | switch (node.type) { |
| | | case "ObjectExpression": |
| | | case "ObjectPattern": |
| | | case "RecordExpression": |
| | | adjustInnerComments(node, node.properties, commentWS); |
| | | break; |
| | | case "CallExpression": |
| | |
| | | break; |
| | | case "ArrayExpression": |
| | | case "ArrayPattern": |
| | | case "TupleExpression": |
| | | adjustInnerComments(node, node.elements, commentWS); |
| | | break; |
| | | case "ExportNamedDeclaration": |
| | |
| | | adjustInnerComments(node, node.specifiers, commentWS); |
| | | break; |
| | | case "TSEnumDeclaration": |
| | | { |
| | | adjustInnerComments(node, node.members, commentWS); |
| | | } |
| | | adjustInnerComments(node, node.members, commentWS); |
| | | break; |
| | | case "TSEnumBody": |
| | | adjustInnerComments(node, node.members, commentWS); |
| | | break; |
| | | default: |
| | | { |
| | | if (node.type === "RecordExpression") { |
| | | adjustInnerComments(node, node.properties, commentWS); |
| | | break; |
| | | } |
| | | if (node.type === "TupleExpression") { |
| | | adjustInnerComments(node, node.elements, commentWS); |
| | | break; |
| | | } |
| | | setInnerComments(node, comments); |
| | | } |
| | | } |
| | |
| | | } |
| | | } |
| | | const NodePrototype = Node.prototype; |
| | | { |
| | | NodePrototype.__clone = function () { |
| | | const newNode = new Node(undefined, this.start, this.loc.start); |
| | | const keys = Object.keys(this); |
| | | for (let i = 0, length = keys.length; i < length; i++) { |
| | | const key = keys[i]; |
| | | if (key !== "leadingComments" && key !== "trailingComments" && key !== "innerComments") { |
| | | newNode[key] = this[key]; |
| | | } |
| | | NodePrototype.__clone = function () { |
| | | const newNode = new Node(undefined, this.start, this.loc.start); |
| | | const keys = Object.keys(this); |
| | | for (let i = 0, length = keys.length; i < length; i++) { |
| | | const key = keys[i]; |
| | | if (key !== "leadingComments" && key !== "trailingComments" && key !== "innerComments") { |
| | | newNode[key] = this[key]; |
| | | } |
| | | return newNode; |
| | | }; |
| | | } |
| | | } |
| | | return newNode; |
| | | }; |
| | | class NodeUtils extends UtilParser { |
| | | startNode() { |
| | | const loc = this.state.startLoc; |
| | |
| | | this.expect(10); |
| | | if (!this.match(134)) { |
| | | this.raise(TSErrors.UnsupportedImportTypeArgument, this.state.startLoc); |
| | | { |
| | | node.argument = super.parseExprAtom(); |
| | | } |
| | | node.argument = super.parseExprAtom(); |
| | | } else { |
| | | { |
| | | node.argument = this.parseStringLiteral(this.state.value); |
| | | } |
| | | node.argument = this.parseStringLiteral(this.state.value); |
| | | } |
| | | if (this.eat(12)) { |
| | | node.options = this.tsParseImportTypeOptions(); |
| | |
| | | node.qualifier = this.tsParseEntityName(1 | 2); |
| | | } |
| | | if (this.match(47)) { |
| | | { |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | return this.finishNode(node, "TSImportType"); |
| | | } |
| | |
| | | const node = this.startNode(); |
| | | node.typeName = this.tsParseEntityName(1); |
| | | if (!this.hasPrecedingLineBreak() && this.match(47)) { |
| | | { |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | return this.finishNode(node, "TSTypeReference"); |
| | | } |
| | |
| | | if (this.match(83)) { |
| | | node.exprName = this.tsParseImportType(); |
| | | } else { |
| | | { |
| | | node.exprName = this.tsParseEntityName(1 | 2); |
| | | } |
| | | node.exprName = this.tsParseEntityName(1 | 2); |
| | | } |
| | | if (!this.hasPrecedingLineBreak() && this.match(47)) { |
| | | { |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | return this.finishNode(node, "TSTypeQuery"); |
| | | } |
| | |
| | | node.readonly = true; |
| | | } |
| | | this.expect(0); |
| | | { |
| | | const typeParameter = this.startNode(); |
| | | typeParameter.name = this.tsParseTypeParameterName(); |
| | | typeParameter.constraint = this.tsExpectThenParseType(58); |
| | | node.typeParameter = this.finishNode(typeParameter, "TSTypeParameter"); |
| | | } |
| | | const typeParameter = this.startNode(); |
| | | typeParameter.name = this.tsParseTypeParameterName(); |
| | | typeParameter.constraint = this.tsExpectThenParseType(58); |
| | | node.typeParameter = this.finishNode(typeParameter, "TSTypeParameter"); |
| | | node.nameType = this.eatContextual(93) ? this.tsParseType() : null; |
| | | this.expect(3); |
| | | if (this.match(53)) { |
| | |
| | | return this.finishNode(node, "TSLiteralType"); |
| | | } |
| | | tsParseTemplateLiteralType() { |
| | | { |
| | | const node = this.startNode(); |
| | | node.literal = super.parseTemplate(false); |
| | | return this.finishNode(node, "TSLiteralType"); |
| | | } |
| | | const node = this.startNode(); |
| | | node.literal = super.parseTemplate(false); |
| | | return this.finishNode(node, "TSLiteralType"); |
| | | } |
| | | parseTemplateSubstitution() { |
| | | if (this.state.inType) return this.tsParseType(); |
| | |
| | | tsParseHeritageClause(token) { |
| | | const originalStartLoc = this.state.startLoc; |
| | | const delimitedList = this.tsParseDelimitedList("HeritageClauseElement", () => { |
| | | { |
| | | const node = this.startNode(); |
| | | node.expression = this.tsParseEntityName(1 | 2); |
| | | if (this.match(47)) { |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | return this.finishNode(node, "TSExpressionWithTypeArguments"); |
| | | const node = this.startNode(); |
| | | node.expression = this.tsParseEntityName(1 | 2); |
| | | if (this.match(47)) { |
| | | node.typeParameters = this.tsParseTypeArguments(); |
| | | } |
| | | return this.finishNode(node, "TSExpressionWithTypeArguments"); |
| | | }); |
| | | if (!delimitedList.length) { |
| | | this.raise(TSErrors.EmptyHeritageClauseType, originalStartLoc, { |
| | |
| | | this.expectContextual(126); |
| | | node.id = this.parseIdentifier(); |
| | | this.checkIdentifier(node.id, node.const ? 8971 : 8459); |
| | | { |
| | | this.expect(5); |
| | | node.members = this.tsParseDelimitedList("EnumMembers", this.tsParseEnumMember.bind(this)); |
| | | this.expect(8); |
| | | } |
| | | this.expect(5); |
| | | node.members = this.tsParseDelimitedList("EnumMembers", this.tsParseEnumMember.bind(this)); |
| | | this.expect(8); |
| | | return this.finishNode(node, "TSEnumDeclaration"); |
| | | } |
| | | tsParseEnumBody() { |
| | |
| | | tsParseAmbientExternalModuleDeclaration(node) { |
| | | if (this.isContextual(112)) { |
| | | node.kind = "global"; |
| | | { |
| | | node.global = true; |
| | | } |
| | | node.global = true; |
| | | node.id = this.parseIdentifier(); |
| | | } else if (this.match(134)) { |
| | | node.kind = "module"; |
| | |
| | | return this.finishNode(node, "TSModuleDeclaration"); |
| | | } |
| | | tsParseImportEqualsDeclaration(node, maybeDefaultIdentifier, isExport) { |
| | | { |
| | | node.isExport = isExport || false; |
| | | } |
| | | node.isExport = isExport || false; |
| | | node.id = maybeDefaultIdentifier || this.parseIdentifier(); |
| | | this.checkIdentifier(node.id, 4096); |
| | | this.expect(29); |
| | |
| | | } |
| | | if (tokenIsTemplate(this.state.type)) { |
| | | const result = super.parseTaggedTemplateExpression(base, startLoc, state); |
| | | { |
| | | result.typeParameters = typeArguments; |
| | | } |
| | | result.typeParameters = typeArguments; |
| | | return result; |
| | | } |
| | | if (!noCalls && this.eat(10)) { |
| | |
| | | node.callee = base; |
| | | node.arguments = this.parseCallExpressionArguments(); |
| | | this.tsCheckForInvalidTypeCasts(node.arguments); |
| | | { |
| | | node.typeParameters = typeArguments; |
| | | } |
| | | node.typeParameters = typeArguments; |
| | | if (state.optionalChainMember) { |
| | | node.optional = isOptionalCall; |
| | | } |
| | | return this.finishCallExpression(node, state.optionalChainMember); |
| | | } |
| | | const tokenType = this.state.type; |
| | | if (tokenType === 48 || tokenType === 52 || tokenType !== 10 && tokenCanStartExpression(tokenType) && !this.hasPrecedingLineBreak()) { |
| | | if (tokenType === 48 || tokenType === 52 || tokenType !== 10 && tokenType !== 93 && tokenType !== 120 && tokenCanStartExpression(tokenType) && !this.hasPrecedingLineBreak()) { |
| | | return; |
| | | } |
| | | const node = this.startNodeAt(startLoc); |
| | | node.expression = base; |
| | | { |
| | | node.typeParameters = typeArguments; |
| | | } |
| | | node.typeParameters = typeArguments; |
| | | return this.finishNode(node, "TSInstantiationExpression"); |
| | | }); |
| | | if (missingParenErrorLoc) { |
| | |
| | | callee |
| | | } = node; |
| | | if (callee.type === "TSInstantiationExpression" && !((_callee$extra = callee.extra) != null && _callee$extra.parenthesized)) { |
| | | { |
| | | node.typeParameters = callee.typeParameters; |
| | | } |
| | | node.typeParameters = callee.typeParameters; |
| | | node.callee = callee.expression; |
| | | } |
| | | } |
| | |
| | | nodeImportEquals.importKind = "value"; |
| | | } |
| | | const declaration = this.tsParseImportEqualsDeclaration(nodeImportEquals, maybeDefaultIdentifier, true); |
| | | { |
| | | return declaration; |
| | | } |
| | | return declaration; |
| | | } else if (this.eat(29)) { |
| | | const assign = node; |
| | | assign.expression = super.parseExpression(); |
| | |
| | | } |
| | | parseClassSuper(node) { |
| | | super.parseClassSuper(node); |
| | | if (node.superClass && (this.match(47) || this.match(51))) { |
| | | { |
| | | if (node.superClass) { |
| | | if (node.superClass.type === "TSInstantiationExpression") { |
| | | const tsInstantiationExpression = node.superClass; |
| | | const superClass = tsInstantiationExpression.expression; |
| | | this.takeSurroundingComments(superClass, superClass.start, superClass.end); |
| | | const superTypeArguments = tsInstantiationExpression.typeParameters; |
| | | this.takeSurroundingComments(superTypeArguments, superTypeArguments.start, superTypeArguments.end); |
| | | node.superClass = superClass; |
| | | node.superTypeParameters = superTypeArguments; |
| | | } else if (this.match(47) || this.match(51)) { |
| | | node.superTypeParameters = this.tsParseTypeArgumentsInExpression(); |
| | | } |
| | | } |
| | |
| | | const typeArguments = this.tsParseTypeArgumentsInExpression(); |
| | | if (this.match(10)) { |
| | | const call = super.parseMaybeDecoratorArguments(expr, startLoc); |
| | | { |
| | | call.typeParameters = typeArguments; |
| | | } |
| | | call.typeParameters = typeArguments; |
| | | return call; |
| | | } |
| | | this.unexpected(null, 10); |
| | |
| | | if (this.match(47) || this.match(51)) { |
| | | const typeArguments = this.tsTryParseAndCatch(() => this.tsParseTypeArgumentsInExpression()); |
| | | if (typeArguments) { |
| | | { |
| | | node.typeParameters = typeArguments; |
| | | } |
| | | node.typeParameters = typeArguments; |
| | | } |
| | | } |
| | | return super.jsxParseOpeningElementAfterName(node); |
| | |
| | | return false; |
| | | } |
| | | verifyBreakContinue(node, isBreak) { |
| | | if (node.label && node.label.type === "Placeholder") return; |
| | | var _node$label; |
| | | if (((_node$label = node.label) == null ? void 0 : _node$label.type) === "Placeholder") return; |
| | | super.verifyBreakContinue(node, isBreak); |
| | | } |
| | | parseExpressionStatement(node, expr) { |
| | |
| | | throw new Error(`"pipelineOperator" requires "proposal" option whose value must be one of: ${proposalList}.`); |
| | | } |
| | | if (proposal === "hack") { |
| | | var _pluginsMap$get; |
| | | if (pluginsMap.has("placeholders")) { |
| | | throw new Error("Cannot combine placeholders plugin and Hack-style pipes."); |
| | | } |
| | |
| | | const tokenList = TOPIC_TOKENS.map(t => `"${t}"`).join(", "); |
| | | throw new Error(`"pipelineOperator" in "proposal": "hack" mode also requires a "topicToken" option whose value must be one of: ${tokenList}.`); |
| | | } |
| | | { |
| | | var _pluginsMap$get; |
| | | if (topicToken === "#" && ((_pluginsMap$get = pluginsMap.get("recordAndTuple")) == null ? void 0 : _pluginsMap$get.syntaxType) === "hash") { |
| | | throw new Error(`Plugin conflict between \`["pipelineOperator", { proposal: "hack", topicToken: "#" }]\` and \`${JSON.stringify(["recordAndTuple", pluginsMap.get("recordAndTuple")])}\`.`); |
| | | } |
| | | if (topicToken === "#" && ((_pluginsMap$get = pluginsMap.get("recordAndTuple")) == null ? void 0 : _pluginsMap$get.syntaxType) === "hash") { |
| | | throw new Error(`Plugin conflict between \`["pipelineOperator", { proposal: "hack", topicToken: "#" }]\` and \`${JSON.stringify(["recordAndTuple", pluginsMap.get("recordAndTuple")])}\`.`); |
| | | } |
| | | } else if (proposal === "smart" && ((_pluginsMap$get2 = pluginsMap.get("recordAndTuple")) == null ? void 0 : _pluginsMap$get2.syntaxType) === "hash") { |
| | | throw new Error(`Plugin conflict between \`["pipelineOperator", { proposal: "smart" }]\` and \`${JSON.stringify(["recordAndTuple", pluginsMap.get("recordAndTuple")])}\`.`); |
| | | } |
| | | } |
| | | if (pluginsMap.has("moduleAttributes")) { |
| | | { |
| | | if (pluginsMap.has("deprecatedImportAssert") || pluginsMap.has("importAssertions")) { |
| | | throw new Error("Cannot combine importAssertions, deprecatedImportAssert and moduleAttributes plugins."); |
| | | } |
| | | const moduleAttributesVersionPluginOption = pluginsMap.get("moduleAttributes").version; |
| | | if (moduleAttributesVersionPluginOption !== "may-2020") { |
| | | throw new Error("The 'moduleAttributes' plugin requires a 'version' option," + " representing the last proposal update. Currently, the" + " only supported value is 'may-2020'."); |
| | | } |
| | | if (pluginsMap.has("deprecatedImportAssert") || pluginsMap.has("importAssertions")) { |
| | | throw new Error("Cannot combine importAssertions, deprecatedImportAssert and moduleAttributes plugins."); |
| | | } |
| | | const moduleAttributesVersionPluginOption = pluginsMap.get("moduleAttributes").version; |
| | | if (moduleAttributesVersionPluginOption !== "may-2020") { |
| | | throw new Error("The 'moduleAttributes' plugin requires a 'version' option," + " representing the last proposal update. Currently, the" + " only supported value is 'may-2020'."); |
| | | } |
| | | } |
| | | if (pluginsMap.has("importAssertions")) { |
| | |
| | | throw new Error("Cannot combine importAssertions and deprecatedImportAssert plugins."); |
| | | } |
| | | } |
| | | if (!pluginsMap.has("deprecatedImportAssert") && pluginsMap.has("importAttributes") && pluginsMap.get("importAttributes").deprecatedAssertSyntax) { |
| | | { |
| | | pluginsMap.set("deprecatedImportAssert", {}); |
| | | } |
| | | if (pluginsMap.has("deprecatedImportAssert")) ;else if (pluginsMap.has("importAttributes") && pluginsMap.get("importAttributes").deprecatedAssertSyntax) { |
| | | pluginsMap.set("deprecatedImportAssert", {}); |
| | | } |
| | | if (pluginsMap.has("recordAndTuple")) { |
| | | { |
| | | const syntaxType = pluginsMap.get("recordAndTuple").syntaxType; |
| | | if (syntaxType != null) { |
| | | const RECORD_AND_TUPLE_SYNTAX_TYPES = ["hash", "bar"]; |
| | | if (!RECORD_AND_TUPLE_SYNTAX_TYPES.includes(syntaxType)) { |
| | | throw new Error("The 'syntaxType' option of the 'recordAndTuple' plugin must be one of: " + RECORD_AND_TUPLE_SYNTAX_TYPES.map(p => `'${p}'`).join(", ")); |
| | | } |
| | | const syntaxType = pluginsMap.get("recordAndTuple").syntaxType; |
| | | if (syntaxType != null) { |
| | | const RECORD_AND_TUPLE_SYNTAX_TYPES = ["hash", "bar"]; |
| | | if (!RECORD_AND_TUPLE_SYNTAX_TYPES.includes(syntaxType)) { |
| | | throw new Error("The 'syntaxType' option of the 'recordAndTuple' plugin must be one of: " + RECORD_AND_TUPLE_SYNTAX_TYPES.map(p => `'${p}'`).join(", ")); |
| | | } |
| | | } |
| | | } |
| | |
| | | throw this.unexpected(); |
| | | } |
| | | default: |
| | | { |
| | | if (type === 137) { |
| | | return this.parseDecimalLiteral(this.state.value); |
| | | } else if (type === 2 || type === 1) { |
| | | return this.parseArrayLike(this.state.type === 2 ? 4 : 3, true); |
| | | } else if (type === 6 || type === 7) { |
| | | return this.parseObjectLike(this.state.type === 6 ? 9 : 8, false, true); |
| | | } |
| | | if (type === 137) { |
| | | return this.parseDecimalLiteral(this.state.value); |
| | | } else if (type === 2 || type === 1) { |
| | | return this.parseArrayLike(this.state.type === 2 ? 4 : 3, true); |
| | | } else if (type === 6 || type === 7) { |
| | | return this.parseObjectLike(this.state.type === 6 ? 9 : 8, false, true); |
| | | } |
| | | if (tokenIsIdentifier(type)) { |
| | | if (this.isContextual(127) && this.lookaheadInLineCharCode() === 123) { |
| | |
| | | this.next(); |
| | | return this.parseAsyncFunctionExpression(this.startNodeAtNode(id)); |
| | | } else if (tokenIsIdentifier(type)) { |
| | | if (this.lookaheadCharCode() === 61) { |
| | | if (canBeArrow && this.lookaheadCharCode() === 61) { |
| | | return this.parseAsyncArrowUnaryFunction(this.startNodeAtNode(id)); |
| | | } else { |
| | | return id; |
| | |
| | | const node = this.startNode(); |
| | | this.next(); |
| | | if (this.match(10) && !this.scope.allowDirectSuper) { |
| | | { |
| | | if (!(this.optionFlags & 16)) { |
| | | this.raise(Errors.SuperNotAllowed, node); |
| | | } |
| | | if (!(this.optionFlags & 16)) { |
| | | this.raise(Errors.SuperNotAllowed, node); |
| | | } |
| | | } else if (!this.scope.allowSuper) { |
| | | { |
| | | if (!(this.optionFlags & 16)) { |
| | | this.raise(Errors.UnexpectedSuper, node); |
| | | } |
| | | if (!(this.optionFlags & 16)) { |
| | | this.raise(Errors.UnexpectedSuper, node); |
| | | } |
| | | } |
| | | if (!this.match(10) && !this.match(0) && !this.match(16)) { |
| | |
| | | return this.parseLiteral(value, "NumericLiteral"); |
| | | } |
| | | parseBigIntLiteral(value) { |
| | | { |
| | | return this.parseLiteral(value, "BigIntLiteral"); |
| | | } |
| | | return this.parseLiteral(value, "BigIntLiteral"); |
| | | } |
| | | parseDecimalLiteral(value) { |
| | | return this.parseLiteral(value, "DecimalLiteral"); |
| | |
| | | if (isRecord && !this.isObjectProperty(prop) && prop.type !== "SpreadElement") { |
| | | this.raise(Errors.InvalidRecordProperty, prop); |
| | | } |
| | | { |
| | | if (prop.shorthand) { |
| | | this.addExtra(prop, "shorthand", true); |
| | | } |
| | | if (prop.shorthand) { |
| | | this.addExtra(prop, "shorthand", true); |
| | | } |
| | | node.properties.push(prop); |
| | | } |
| | |
| | | type |
| | | } = token; |
| | | if (typeof type === "number") { |
| | | { |
| | | if (type === 139) { |
| | | const { |
| | | loc, |
| | | start, |
| | | value, |
| | | end |
| | | } = token; |
| | | const hashEndPos = start + 1; |
| | | const hashEndLoc = createPositionWithColumnOffset(loc.start, 1); |
| | | tokens.splice(i, 1, new Token({ |
| | | type: getExportedToken(27), |
| | | value: "#", |
| | | if (type === 139) { |
| | | const { |
| | | loc, |
| | | start, |
| | | value, |
| | | end |
| | | } = token; |
| | | const hashEndPos = start + 1; |
| | | const hashEndLoc = createPositionWithColumnOffset(loc.start, 1); |
| | | tokens.splice(i, 1, new Token({ |
| | | type: getExportedToken(27), |
| | | value: "#", |
| | | start: start, |
| | | end: hashEndPos, |
| | | startLoc: loc.start, |
| | | endLoc: hashEndLoc |
| | | }), new Token({ |
| | | type: getExportedToken(132), |
| | | value: value, |
| | | start: hashEndPos, |
| | | end: end, |
| | | startLoc: hashEndLoc, |
| | | endLoc: loc.end |
| | | })); |
| | | i++; |
| | | continue; |
| | | } |
| | | if (tokenIsTemplate(type)) { |
| | | const { |
| | | loc, |
| | | start, |
| | | value, |
| | | end |
| | | } = token; |
| | | const backquoteEnd = start + 1; |
| | | const backquoteEndLoc = createPositionWithColumnOffset(loc.start, 1); |
| | | let startToken; |
| | | if (input.charCodeAt(start - startIndex) === 96) { |
| | | startToken = new Token({ |
| | | type: getExportedToken(22), |
| | | value: "`", |
| | | start: start, |
| | | end: hashEndPos, |
| | | end: backquoteEnd, |
| | | startLoc: loc.start, |
| | | endLoc: hashEndLoc |
| | | }), new Token({ |
| | | type: getExportedToken(132), |
| | | value: value, |
| | | start: hashEndPos, |
| | | endLoc: backquoteEndLoc |
| | | }); |
| | | } else { |
| | | startToken = new Token({ |
| | | type: getExportedToken(8), |
| | | value: "}", |
| | | start: start, |
| | | end: backquoteEnd, |
| | | startLoc: loc.start, |
| | | endLoc: backquoteEndLoc |
| | | }); |
| | | } |
| | | let templateValue, templateElementEnd, templateElementEndLoc, endToken; |
| | | if (type === 24) { |
| | | templateElementEnd = end - 1; |
| | | templateElementEndLoc = createPositionWithColumnOffset(loc.end, -1); |
| | | templateValue = value === null ? null : value.slice(1, -1); |
| | | endToken = new Token({ |
| | | type: getExportedToken(22), |
| | | value: "`", |
| | | start: templateElementEnd, |
| | | end: end, |
| | | startLoc: hashEndLoc, |
| | | startLoc: templateElementEndLoc, |
| | | endLoc: loc.end |
| | | })); |
| | | i++; |
| | | continue; |
| | | }); |
| | | } else { |
| | | templateElementEnd = end - 2; |
| | | templateElementEndLoc = createPositionWithColumnOffset(loc.end, -2); |
| | | templateValue = value === null ? null : value.slice(1, -2); |
| | | endToken = new Token({ |
| | | type: getExportedToken(23), |
| | | value: "${", |
| | | start: templateElementEnd, |
| | | end: end, |
| | | startLoc: templateElementEndLoc, |
| | | endLoc: loc.end |
| | | }); |
| | | } |
| | | if (tokenIsTemplate(type)) { |
| | | const { |
| | | loc, |
| | | start, |
| | | value, |
| | | end |
| | | } = token; |
| | | const backquoteEnd = start + 1; |
| | | const backquoteEndLoc = createPositionWithColumnOffset(loc.start, 1); |
| | | let startToken; |
| | | if (input.charCodeAt(start - startIndex) === 96) { |
| | | startToken = new Token({ |
| | | type: getExportedToken(22), |
| | | value: "`", |
| | | start: start, |
| | | end: backquoteEnd, |
| | | startLoc: loc.start, |
| | | endLoc: backquoteEndLoc |
| | | }); |
| | | } else { |
| | | startToken = new Token({ |
| | | type: getExportedToken(8), |
| | | value: "}", |
| | | start: start, |
| | | end: backquoteEnd, |
| | | startLoc: loc.start, |
| | | endLoc: backquoteEndLoc |
| | | }); |
| | | } |
| | | let templateValue, templateElementEnd, templateElementEndLoc, endToken; |
| | | if (type === 24) { |
| | | templateElementEnd = end - 1; |
| | | templateElementEndLoc = createPositionWithColumnOffset(loc.end, -1); |
| | | templateValue = value === null ? null : value.slice(1, -1); |
| | | endToken = new Token({ |
| | | type: getExportedToken(22), |
| | | value: "`", |
| | | start: templateElementEnd, |
| | | end: end, |
| | | startLoc: templateElementEndLoc, |
| | | endLoc: loc.end |
| | | }); |
| | | } else { |
| | | templateElementEnd = end - 2; |
| | | templateElementEndLoc = createPositionWithColumnOffset(loc.end, -2); |
| | | templateValue = value === null ? null : value.slice(1, -2); |
| | | endToken = new Token({ |
| | | type: getExportedToken(23), |
| | | value: "${", |
| | | start: templateElementEnd, |
| | | end: end, |
| | | startLoc: templateElementEndLoc, |
| | | endLoc: loc.end |
| | | }); |
| | | } |
| | | tokens.splice(i, 1, startToken, new Token({ |
| | | type: getExportedToken(20), |
| | | value: templateValue, |
| | | start: backquoteEnd, |
| | | end: templateElementEnd, |
| | | startLoc: backquoteEndLoc, |
| | | endLoc: templateElementEndLoc |
| | | }), endToken); |
| | | i += 2; |
| | | continue; |
| | | } |
| | | tokens.splice(i, 1, startToken, new Token({ |
| | | type: getExportedToken(20), |
| | | value: templateValue, |
| | | start: backquoteEnd, |
| | | end: templateElementEnd, |
| | | startLoc: backquoteEndLoc, |
| | | endLoc: templateElementEndLoc |
| | | }), endToken); |
| | | i += 2; |
| | | continue; |
| | | } |
| | | token.type = getExportedToken(type); |
| | | } |
| | |
| | | } |
| | | maybeParseImportAttributes(node) { |
| | | let attributes; |
| | | { |
| | | var useWith = false; |
| | | } |
| | | var useWith = false; |
| | | if (this.match(76)) { |
| | | if (this.hasPrecedingLineBreak() && this.lookaheadCharCode() === 40) { |
| | | return; |
| | |
| | | } else { |
| | | attributes = this.parseImportAttributes(); |
| | | } |
| | | { |
| | | useWith = true; |
| | | } |
| | | useWith = true; |
| | | } else if (this.isContextual(94) && !this.hasPrecedingLineBreak()) { |
| | | if (!this.hasPlugin("deprecatedImportAssert") && !this.hasPlugin("importAssertions")) { |
| | | this.raise(Errors.ImportAttributesUseAssert, this.state.startLoc); |
| | |
| | | } |
| | | } catch (e) { |
| | | exp.ast = false; |
| | | emitError(45, loc.start.offset, e.message); |
| | | emitError(46, loc.start.offset, e.message); |
| | | } |
| | | } |
| | | return exp; |
| | |
| | | function requireUtil$2 () { |
| | | if (hasRequiredUtil$2) return util$2; |
| | | hasRequiredUtil$2 = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | /* |
| | | * Copyright 2011 Mozilla Foundation and contributors |
| | | * Licensed under the New BSD license. See LICENSE or: |
| | |
| | | throw new Error('"' + aName + '" is a required argument.'); |
| | | } |
| | | } |
| | | exports.getArg = getArg; |
| | | exports$1.getArg = getArg; |
| | | |
| | | var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/; |
| | | var dataUrlRegexp = /^data:.+\,.+$/; |
| | |
| | | path: match[5] |
| | | }; |
| | | } |
| | | exports.urlParse = urlParse; |
| | | exports$1.urlParse = urlParse; |
| | | |
| | | function urlGenerate(aParsedUrl) { |
| | | var url = ''; |
| | |
| | | } |
| | | return url; |
| | | } |
| | | exports.urlGenerate = urlGenerate; |
| | | exports$1.urlGenerate = urlGenerate; |
| | | |
| | | var MAX_CACHED_INPUTS = 32; |
| | | |
| | |
| | | } |
| | | path = url.path; |
| | | } |
| | | var isAbsolute = exports.isAbsolute(path); |
| | | var isAbsolute = exports$1.isAbsolute(path); |
| | | // Split the path into parts between `/` characters. This is much faster than |
| | | // using `.split(/\/+/g)`. |
| | | var parts = []; |
| | |
| | | } |
| | | return path; |
| | | }); |
| | | exports.normalize = normalize; |
| | | exports$1.normalize = normalize; |
| | | |
| | | /** |
| | | * Joins two paths/URLs. |
| | |
| | | } |
| | | return joined; |
| | | } |
| | | exports.join = join; |
| | | exports$1.join = join; |
| | | |
| | | exports.isAbsolute = function (aPath) { |
| | | exports$1.isAbsolute = function (aPath) { |
| | | return aPath.charAt(0) === '/' || urlRegexp.test(aPath); |
| | | }; |
| | | |
| | |
| | | // Make sure we add a "../" for each component we removed from the root. |
| | | return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1); |
| | | } |
| | | exports.relative = relative; |
| | | exports$1.relative = relative; |
| | | |
| | | var supportsNullProto = (function () { |
| | | var obj = Object.create(null); |
| | |
| | | |
| | | return aStr; |
| | | } |
| | | exports.toSetString = supportsNullProto ? identity : toSetString; |
| | | exports$1.toSetString = supportsNullProto ? identity : toSetString; |
| | | |
| | | function fromSetString(aStr) { |
| | | if (isProtoString(aStr)) { |
| | |
| | | |
| | | return aStr; |
| | | } |
| | | exports.fromSetString = supportsNullProto ? identity : fromSetString; |
| | | exports$1.fromSetString = supportsNullProto ? identity : fromSetString; |
| | | |
| | | function isProtoString(s) { |
| | | if (!s) { |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByOriginalPositions = compareByOriginalPositions; |
| | | exports$1.compareByOriginalPositions = compareByOriginalPositions; |
| | | |
| | | function compareByOriginalPositionsNoSource(mappingA, mappingB, onlyCompareOriginal) { |
| | | var cmp; |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource; |
| | | exports$1.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource; |
| | | |
| | | /** |
| | | * Comparator between two mappings with deflated source and name indices where |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated; |
| | | exports$1.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated; |
| | | |
| | | function compareByGeneratedPositionsDeflatedNoLine(mappingA, mappingB, onlyCompareGenerated) { |
| | | var cmp = mappingA.generatedColumn - mappingB.generatedColumn; |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine; |
| | | exports$1.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine; |
| | | |
| | | function strcmp(aStr1, aStr2) { |
| | | if (aStr1 === aStr2) { |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated; |
| | | exports$1.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated; |
| | | |
| | | /** |
| | | * Strip any JSON XSSI avoidance prefix from the string (as documented |
| | |
| | | function parseSourceMapInput(str) { |
| | | return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, '')); |
| | | } |
| | | exports.parseSourceMapInput = parseSourceMapInput; |
| | | exports$1.parseSourceMapInput = parseSourceMapInput; |
| | | |
| | | /** |
| | | * Compute the URL of a source given the the source root, the source's |
| | |
| | | |
| | | return normalize(sourceURL); |
| | | } |
| | | exports.computeSourceURL = computeSourceURL; |
| | | exports$1.computeSourceURL = computeSourceURL; |
| | | } (util$2)); |
| | | return util$2; |
| | | } |
| | |
| | | function requireBinarySearch$1 () { |
| | | if (hasRequiredBinarySearch$1) return binarySearch$1; |
| | | hasRequiredBinarySearch$1 = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | /* |
| | | * Copyright 2011 Mozilla Foundation and contributors |
| | | * Licensed under the New BSD license. See LICENSE or: |
| | | * http://opensource.org/licenses/BSD-3-Clause |
| | | */ |
| | | |
| | | exports.GREATEST_LOWER_BOUND = 1; |
| | | exports.LEAST_UPPER_BOUND = 2; |
| | | exports$1.GREATEST_LOWER_BOUND = 1; |
| | | exports$1.LEAST_UPPER_BOUND = 2; |
| | | |
| | | /** |
| | | * Recursive implementation of binary search. |
| | |
| | | |
| | | // The exact needle element was not found in this haystack. Determine if |
| | | // we are in termination case (3) or (2) and return the appropriate thing. |
| | | if (aBias == exports.LEAST_UPPER_BOUND) { |
| | | if (aBias == exports$1.LEAST_UPPER_BOUND) { |
| | | return aHigh < aHaystack.length ? aHigh : -1; |
| | | } else { |
| | | return mid; |
| | |
| | | } |
| | | |
| | | // we are in termination case (3) or (2) and return the appropriate thing. |
| | | if (aBias == exports.LEAST_UPPER_BOUND) { |
| | | if (aBias == exports$1.LEAST_UPPER_BOUND) { |
| | | return mid; |
| | | } else { |
| | | return aLow < 0 ? -1 : aLow; |
| | |
| | | * searching for, respectively, if the exact element cannot be found. |
| | | * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'. |
| | | */ |
| | | exports.search = function search(aNeedle, aHaystack, aCompare, aBias) { |
| | | exports$1.search = function search(aNeedle, aHaystack, aCompare, aBias) { |
| | | if (aHaystack.length === 0) { |
| | | return -1; |
| | | } |
| | | |
| | | var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack, |
| | | aCompare, aBias || exports.GREATEST_LOWER_BOUND); |
| | | aCompare, aBias || exports$1.GREATEST_LOWER_BOUND); |
| | | if (index < 0) { |
| | | return -1; |
| | | } |
| | |
| | | } catch (e) { |
| | | context.onError( |
| | | createCompilerError( |
| | | 45, |
| | | 46, |
| | | node.loc, |
| | | void 0, |
| | | e.message |
| | |
| | | loop.body = createBlockStatement([ |
| | | createCompoundExpression([`const _memo = (`, memo.exp, `)`]), |
| | | createCompoundExpression([ |
| | | `if (_cached`, |
| | | `if (_cached && _cached.el`, |
| | | ...keyExp ? [` && _cached.key === `, keyExp] : [], |
| | | ` && ${context.helperString( |
| | | IS_MEMO_SAME |
| | |
| | | patchFlag |= 1024; |
| | | if (node.children.length > 1) { |
| | | context.onError( |
| | | createCompilerError(46, { |
| | | createCompilerError(47, { |
| | | start: node.children[0].loc.start, |
| | | end: node.children[node.children.length - 1].loc.end, |
| | | source: "" |
| | |
| | | if (arg.isStatic) { |
| | | let rawName = arg.content; |
| | | if (rawName.startsWith("vnode")) { |
| | | context.onError(createCompilerError(51, arg.loc)); |
| | | context.onError(createCompilerError(52, arg.loc)); |
| | | } |
| | | if (rawName.startsWith("vue:")) { |
| | | rawName = `vnode-${rawName.slice(4)}`; |
| | |
| | | context.onError(createCompilerError(44, exp.loc)); |
| | | return createTransformProps(); |
| | | } |
| | | if (bindingType === "literal-const" || bindingType === "setup-const") { |
| | | context.onError(createCompilerError(45, exp.loc)); |
| | | return createTransformProps(); |
| | | } |
| | | const maybeRef = context.inline && (bindingType === "setup-let" || bindingType === "setup-ref" || bindingType === "setup-maybe-ref"); |
| | | if (!expString.trim() || !isMemberExpression(exp, context) && !maybeRef) { |
| | | context.onError( |
| | |
| | | if (arg.type !== 4 || !arg.isStatic) { |
| | | context.onError( |
| | | createCompilerError( |
| | | 52, |
| | | 53, |
| | | arg.loc |
| | | ) |
| | | ); |
| | |
| | | const isModuleMode = options.mode === "module"; |
| | | const prefixIdentifiers = options.prefixIdentifiers === true || isModuleMode; |
| | | if (!prefixIdentifiers && options.cacheHandlers) { |
| | | onError(createCompilerError(49)); |
| | | onError(createCompilerError(50)); |
| | | } |
| | | if (options.scopeId && !isModuleMode) { |
| | | onError(createCompilerError(50)); |
| | | onError(createCompilerError(51)); |
| | | } |
| | | const resolvedOptions = extend({}, options, { |
| | | prefixIdentifiers |
| | |
| | | |
| | | const noopDirectiveTransform = () => ({ props: [] }); |
| | | |
| | | const V_MODEL_RADIO = Symbol(`vModelRadio` ); |
| | | const V_MODEL_CHECKBOX = Symbol( |
| | | const V_MODEL_RADIO = /* @__PURE__ */ Symbol(`vModelRadio` ); |
| | | const V_MODEL_CHECKBOX = /* @__PURE__ */ Symbol( |
| | | `vModelCheckbox` |
| | | ); |
| | | const V_MODEL_TEXT = Symbol(`vModelText` ); |
| | | const V_MODEL_SELECT = Symbol( |
| | | const V_MODEL_TEXT = /* @__PURE__ */ Symbol(`vModelText` ); |
| | | const V_MODEL_SELECT = /* @__PURE__ */ Symbol( |
| | | `vModelSelect` |
| | | ); |
| | | const V_MODEL_DYNAMIC = Symbol( |
| | | const V_MODEL_DYNAMIC = /* @__PURE__ */ Symbol( |
| | | `vModelDynamic` |
| | | ); |
| | | const V_ON_WITH_MODIFIERS = Symbol( |
| | | const V_ON_WITH_MODIFIERS = /* @__PURE__ */ Symbol( |
| | | `vOnModifiersGuard` |
| | | ); |
| | | const V_ON_WITH_KEYS = Symbol( |
| | | const V_ON_WITH_KEYS = /* @__PURE__ */ Symbol( |
| | | `vOnKeysGuard` |
| | | ); |
| | | const V_SHOW = Symbol(`vShow` ); |
| | | const TRANSITION = Symbol(`Transition` ); |
| | | const TRANSITION_GROUP = Symbol( |
| | | const V_SHOW = /* @__PURE__ */ Symbol(`vShow` ); |
| | | const TRANSITION = /* @__PURE__ */ Symbol(`Transition` ); |
| | | const TRANSITION_GROUP = /* @__PURE__ */ Symbol( |
| | | `TransitionGroup` |
| | | ); |
| | | registerRuntimeHelpers({ |
| | |
| | | ); |
| | | } |
| | | const DOMErrorCodes = { |
| | | "X_V_HTML_NO_EXPRESSION": 53, |
| | | "53": "X_V_HTML_NO_EXPRESSION", |
| | | "X_V_HTML_WITH_CHILDREN": 54, |
| | | "54": "X_V_HTML_WITH_CHILDREN", |
| | | "X_V_TEXT_NO_EXPRESSION": 55, |
| | | "55": "X_V_TEXT_NO_EXPRESSION", |
| | | "X_V_TEXT_WITH_CHILDREN": 56, |
| | | "56": "X_V_TEXT_WITH_CHILDREN", |
| | | "X_V_MODEL_ON_INVALID_ELEMENT": 57, |
| | | "57": "X_V_MODEL_ON_INVALID_ELEMENT", |
| | | "X_V_MODEL_ARG_ON_ELEMENT": 58, |
| | | "58": "X_V_MODEL_ARG_ON_ELEMENT", |
| | | "X_V_MODEL_ON_FILE_INPUT_ELEMENT": 59, |
| | | "59": "X_V_MODEL_ON_FILE_INPUT_ELEMENT", |
| | | "X_V_MODEL_UNNECESSARY_VALUE": 60, |
| | | "60": "X_V_MODEL_UNNECESSARY_VALUE", |
| | | "X_V_SHOW_NO_EXPRESSION": 61, |
| | | "61": "X_V_SHOW_NO_EXPRESSION", |
| | | "X_TRANSITION_INVALID_CHILDREN": 62, |
| | | "62": "X_TRANSITION_INVALID_CHILDREN", |
| | | "X_IGNORED_SIDE_EFFECT_TAG": 63, |
| | | "63": "X_IGNORED_SIDE_EFFECT_TAG", |
| | | "__EXTEND_POINT__": 64, |
| | | "64": "__EXTEND_POINT__" |
| | | "X_V_HTML_NO_EXPRESSION": 54, |
| | | "54": "X_V_HTML_NO_EXPRESSION", |
| | | "X_V_HTML_WITH_CHILDREN": 55, |
| | | "55": "X_V_HTML_WITH_CHILDREN", |
| | | "X_V_TEXT_NO_EXPRESSION": 56, |
| | | "56": "X_V_TEXT_NO_EXPRESSION", |
| | | "X_V_TEXT_WITH_CHILDREN": 57, |
| | | "57": "X_V_TEXT_WITH_CHILDREN", |
| | | "X_V_MODEL_ON_INVALID_ELEMENT": 58, |
| | | "58": "X_V_MODEL_ON_INVALID_ELEMENT", |
| | | "X_V_MODEL_ARG_ON_ELEMENT": 59, |
| | | "59": "X_V_MODEL_ARG_ON_ELEMENT", |
| | | "X_V_MODEL_ON_FILE_INPUT_ELEMENT": 60, |
| | | "60": "X_V_MODEL_ON_FILE_INPUT_ELEMENT", |
| | | "X_V_MODEL_UNNECESSARY_VALUE": 61, |
| | | "61": "X_V_MODEL_UNNECESSARY_VALUE", |
| | | "X_V_SHOW_NO_EXPRESSION": 62, |
| | | "62": "X_V_SHOW_NO_EXPRESSION", |
| | | "X_TRANSITION_INVALID_CHILDREN": 63, |
| | | "63": "X_TRANSITION_INVALID_CHILDREN", |
| | | "X_IGNORED_SIDE_EFFECT_TAG": 64, |
| | | "64": "X_IGNORED_SIDE_EFFECT_TAG", |
| | | "__EXTEND_POINT__": 65, |
| | | "65": "__EXTEND_POINT__" |
| | | }; |
| | | const DOMErrorMessages = { |
| | | [53]: `v-html is missing expression.`, |
| | | [54]: `v-html will override element children.`, |
| | | [55]: `v-text is missing expression.`, |
| | | [56]: `v-text will override element children.`, |
| | | [57]: `v-model can only be used on <input>, <textarea> and <select> elements.`, |
| | | [58]: `v-model argument is not supported on plain elements.`, |
| | | [59]: `v-model cannot be used on file inputs since they are read-only. Use a v-on:change listener instead.`, |
| | | [60]: `Unnecessary value binding used alongside v-model. It will interfere with v-model's behavior.`, |
| | | [61]: `v-show is missing expression.`, |
| | | [62]: `<Transition> expects exactly one child element or component.`, |
| | | [63]: `Tags with side effect (<script> and <style>) are ignored in client component templates.` |
| | | [54]: `v-html is missing expression.`, |
| | | [55]: `v-html will override element children.`, |
| | | [56]: `v-text is missing expression.`, |
| | | [57]: `v-text will override element children.`, |
| | | [58]: `v-model can only be used on <input>, <textarea> and <select> elements.`, |
| | | [59]: `v-model argument is not supported on plain elements.`, |
| | | [60]: `v-model cannot be used on file inputs since they are read-only. Use a v-on:change listener instead.`, |
| | | [61]: `Unnecessary value binding used alongside v-model. It will interfere with v-model's behavior.`, |
| | | [62]: `v-show is missing expression.`, |
| | | [63]: `<Transition> expects exactly one child element or component.`, |
| | | [64]: `Tags with side effect (<script> and <style>) are ignored in client component templates.` |
| | | }; |
| | | |
| | | const transformVHtml = (dir, node, context) => { |
| | | const { exp, loc } = dir; |
| | | if (!exp) { |
| | | context.onError( |
| | | createDOMCompilerError(53, loc) |
| | | createDOMCompilerError(54, loc) |
| | | ); |
| | | } |
| | | if (node.children.length) { |
| | | context.onError( |
| | | createDOMCompilerError(54, loc) |
| | | createDOMCompilerError(55, loc) |
| | | ); |
| | | node.children.length = 0; |
| | | } |
| | |
| | | const { exp, loc } = dir; |
| | | if (!exp) { |
| | | context.onError( |
| | | createDOMCompilerError(55, loc) |
| | | createDOMCompilerError(56, loc) |
| | | ); |
| | | } |
| | | if (node.children.length) { |
| | | context.onError( |
| | | createDOMCompilerError(56, loc) |
| | | createDOMCompilerError(57, loc) |
| | | ); |
| | | node.children.length = 0; |
| | | } |
| | |
| | | if (dir.arg) { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 58, |
| | | 59, |
| | | dir.arg.loc |
| | | ) |
| | | ); |
| | |
| | | if (value && isStaticArgOf(value.arg, "value")) { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 60, |
| | | 61, |
| | | value.loc |
| | | ) |
| | | ); |
| | |
| | | isInvalidType = true; |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 59, |
| | | 60, |
| | | dir.loc |
| | | ) |
| | | ); |
| | |
| | | } else { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 57, |
| | | 58, |
| | | dir.loc |
| | | ) |
| | | ); |
| | |
| | | const { exp, loc } = dir; |
| | | if (!exp) { |
| | | context.onError( |
| | | createDOMCompilerError(61, loc) |
| | | createDOMCompilerError(62, loc) |
| | | ); |
| | | } |
| | | return { |
| | |
| | | if (hasMultipleChildren(node)) { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 62, |
| | | 63, |
| | | { |
| | | start: node.children[0].loc.start, |
| | | end: node.children[node.children.length - 1].loc.end, |
| | |
| | | if (node.type === 1 && node.tagType === 0 && (node.tag === "script" || node.tag === "style")) { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 63, |
| | | 64, |
| | | node.loc |
| | | ) |
| | | ); |
| | |
| | | `; |
| | | } |
| | | |
| | | var global$1 = (typeof global !== "undefined" ? global : |
| | | typeof self !== "undefined" ? self : |
| | | typeof window !== "undefined" ? window : {}); |
| | | |
| | | // shim for using process in browser |
| | | // based off https://github.com/defunctzombie/node-process/blob/master/browser.js |
| | | |
| | |
| | | function isImportUsed(local, sfc) { |
| | | return resolveTemplateUsedIdentifiers(sfc).has(local); |
| | | } |
| | | const templateUsageCheckCache = createCache(); |
| | | const templateAnalysisCache = createCache(); |
| | | function resolveTemplateVModelIdentifiers(sfc) { |
| | | return resolveTemplateAnalysisResult(sfc, false).vModelIds; |
| | | } |
| | | function resolveTemplateUsedIdentifiers(sfc) { |
| | | return resolveTemplateAnalysisResult(sfc).usedIds; |
| | | } |
| | | function resolveTemplateAnalysisResult(sfc, collectUsedIds = true) { |
| | | const { content, ast } = sfc.template; |
| | | const cached = templateUsageCheckCache.get(content); |
| | | if (cached) { |
| | | const cached = templateAnalysisCache.get(content); |
| | | if (cached && (!collectUsedIds || cached.usedIds)) { |
| | | return cached; |
| | | } |
| | | const ids = /* @__PURE__ */ new Set(); |
| | | const ids = collectUsedIds ? /* @__PURE__ */ new Set() : void 0; |
| | | const vModelIds = /* @__PURE__ */ new Set(); |
| | | ast.children.forEach(walk); |
| | | function walk(node) { |
| | | var _a; |
| | |
| | | let tag = node.tag; |
| | | if (tag.includes(".")) tag = tag.split(".")[0].trim(); |
| | | if (!parserOptions.isNativeTag(tag) && !parserOptions.isBuiltInComponent(tag)) { |
| | | ids.add(camelize(tag)); |
| | | ids.add(capitalize(camelize(tag))); |
| | | if (ids) { |
| | | ids.add(camelize(tag)); |
| | | ids.add(capitalize(camelize(tag))); |
| | | } |
| | | } |
| | | for (let i = 0; i < node.props.length; i++) { |
| | | const prop = node.props[i]; |
| | | if (prop.type === 7) { |
| | | if (!isBuiltInDirective(prop.name)) { |
| | | ids.add(`v${capitalize(camelize(prop.name))}`); |
| | | if (ids) { |
| | | if (!isBuiltInDirective(prop.name)) { |
| | | ids.add(`v${capitalize(camelize(prop.name))}`); |
| | | } |
| | | } |
| | | if (prop.arg && !prop.arg.isStatic) { |
| | | if (prop.name === "model") { |
| | | const exp = prop.exp; |
| | | if (exp && exp.type === 4) { |
| | | const expString = exp.content.trim(); |
| | | if (isSimpleIdentifier(expString) && expString !== "undefined") { |
| | | vModelIds.add(expString); |
| | | } |
| | | } |
| | | } |
| | | if (ids && prop.arg && !prop.arg.isStatic) { |
| | | extractIdentifiers(ids, prop.arg); |
| | | } |
| | | if (prop.name === "for") { |
| | | extractIdentifiers(ids, prop.forParseResult.source); |
| | | } else if (prop.exp) { |
| | | extractIdentifiers(ids, prop.exp); |
| | | } else if (prop.name === "bind" && !prop.exp) { |
| | | ids.add(camelize(prop.arg.content)); |
| | | if (ids) { |
| | | if (prop.name === "for") { |
| | | extractIdentifiers(ids, prop.forParseResult.source); |
| | | } else if (prop.exp) { |
| | | extractIdentifiers(ids, prop.exp); |
| | | } else if (prop.name === "bind" && !prop.exp) { |
| | | ids.add(camelize(prop.arg.content)); |
| | | } |
| | | } |
| | | } |
| | | if (prop.type === 6 && prop.name === "ref" && ((_a = prop.value) == null ? void 0 : _a.content)) { |
| | | if (ids && prop.type === 6 && prop.name === "ref" && ((_a = prop.value) == null ? void 0 : _a.content)) { |
| | | ids.add(prop.value.content); |
| | | } |
| | | } |
| | | node.children.forEach(walk); |
| | | break; |
| | | case 5: |
| | | extractIdentifiers(ids, node.content); |
| | | if (ids) extractIdentifiers(ids, node.content); |
| | | break; |
| | | } |
| | | } |
| | | templateUsageCheckCache.set(content, ids); |
| | | return ids; |
| | | const result = { usedIds: ids, vModelIds }; |
| | | templateAnalysisCache.set(content, result); |
| | | return result; |
| | | } |
| | | function extractIdentifiers(ids, node) { |
| | | if (node.ast) { |
| | |
| | | 'xn--' + encode$1(string) : |
| | | string; |
| | | }); |
| | | } |
| | | |
| | | var lookup = []; |
| | | var revLookup = []; |
| | | var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array; |
| | | var inited = false; |
| | | function init () { |
| | | inited = true; |
| | | var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; |
| | | for (var i = 0, len = code.length; i < len; ++i) { |
| | | lookup[i] = code[i]; |
| | | revLookup[code.charCodeAt(i)] = i; |
| | | } |
| | | |
| | | revLookup['-'.charCodeAt(0)] = 62; |
| | | revLookup['_'.charCodeAt(0)] = 63; |
| | | } |
| | | |
| | | function toByteArray (b64) { |
| | | if (!inited) { |
| | | init(); |
| | | } |
| | | var i, j, l, tmp, placeHolders, arr; |
| | | var len = b64.length; |
| | | |
| | | if (len % 4 > 0) { |
| | | throw new Error('Invalid string. Length must be a multiple of 4') |
| | | } |
| | | |
| | | // the number of equal signs (place holders) |
| | | // if there are two placeholders, than the two characters before it |
| | | // represent one byte |
| | | // if there is only one, then the three characters before it represent 2 bytes |
| | | // this is just a cheap hack to not do indexOf twice |
| | | placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0; |
| | | |
| | | // base64 is 4/3 + up to two characters of the original data |
| | | arr = new Arr(len * 3 / 4 - placeHolders); |
| | | |
| | | // if there are placeholders, only get up to the last complete 4 chars |
| | | l = placeHolders > 0 ? len - 4 : len; |
| | | |
| | | var L = 0; |
| | | |
| | | for (i = 0, j = 0; i < l; i += 4, j += 3) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)]; |
| | | arr[L++] = (tmp >> 16) & 0xFF; |
| | | arr[L++] = (tmp >> 8) & 0xFF; |
| | | arr[L++] = tmp & 0xFF; |
| | | } |
| | | |
| | | if (placeHolders === 2) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4); |
| | | arr[L++] = tmp & 0xFF; |
| | | } else if (placeHolders === 1) { |
| | | tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2); |
| | | arr[L++] = (tmp >> 8) & 0xFF; |
| | | arr[L++] = tmp & 0xFF; |
| | | } |
| | | |
| | | return arr |
| | | } |
| | | |
| | | function tripletToBase64 (num) { |
| | | return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F] |
| | | } |
| | | |
| | | function encodeChunk (uint8, start, end) { |
| | | var tmp; |
| | | var output = []; |
| | | for (var i = start; i < end; i += 3) { |
| | | tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]); |
| | | output.push(tripletToBase64(tmp)); |
| | | } |
| | | return output.join('') |
| | | } |
| | | |
| | | function fromByteArray (uint8) { |
| | | if (!inited) { |
| | | init(); |
| | | } |
| | | var tmp; |
| | | var len = uint8.length; |
| | | var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes |
| | | var output = ''; |
| | | var parts = []; |
| | | var maxChunkLength = 16383; // must be multiple of 3 |
| | | |
| | | // go through the array every three bytes, we'll deal with trailing stuff later |
| | | for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { |
| | | parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength))); |
| | | } |
| | | |
| | | // pad the end with zeros, but make sure to not forget the extra bytes |
| | | if (extraBytes === 1) { |
| | | tmp = uint8[len - 1]; |
| | | output += lookup[tmp >> 2]; |
| | | output += lookup[(tmp << 4) & 0x3F]; |
| | | output += '=='; |
| | | } else if (extraBytes === 2) { |
| | | tmp = (uint8[len - 2] << 8) + (uint8[len - 1]); |
| | | output += lookup[tmp >> 10]; |
| | | output += lookup[(tmp >> 4) & 0x3F]; |
| | | output += lookup[(tmp << 2) & 0x3F]; |
| | | output += '='; |
| | | } |
| | | |
| | | parts.push(output); |
| | | |
| | | return parts.join('') |
| | | } |
| | | |
| | | function read (buffer, offset, isLE, mLen, nBytes) { |
| | | var e, m; |
| | | var eLen = nBytes * 8 - mLen - 1; |
| | | var eMax = (1 << eLen) - 1; |
| | | var eBias = eMax >> 1; |
| | | var nBits = -7; |
| | | var i = isLE ? (nBytes - 1) : 0; |
| | | var d = isLE ? -1 : 1; |
| | | var s = buffer[offset + i]; |
| | | |
| | | i += d; |
| | | |
| | | e = s & ((1 << (-nBits)) - 1); |
| | | s >>= (-nBits); |
| | | nBits += eLen; |
| | | for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {} |
| | | |
| | | m = e & ((1 << (-nBits)) - 1); |
| | | e >>= (-nBits); |
| | | nBits += mLen; |
| | | for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {} |
| | | |
| | | if (e === 0) { |
| | | e = 1 - eBias; |
| | | } else if (e === eMax) { |
| | | return m ? NaN : ((s ? -1 : 1) * Infinity) |
| | | } else { |
| | | m = m + Math.pow(2, mLen); |
| | | e = e - eBias; |
| | | } |
| | | return (s ? -1 : 1) * m * Math.pow(2, e - mLen) |
| | | } |
| | | |
| | | function write (buffer, value, offset, isLE, mLen, nBytes) { |
| | | var e, m, c; |
| | | var eLen = nBytes * 8 - mLen - 1; |
| | | var eMax = (1 << eLen) - 1; |
| | | var eBias = eMax >> 1; |
| | | var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0); |
| | | var i = isLE ? 0 : (nBytes - 1); |
| | | var d = isLE ? 1 : -1; |
| | | var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0; |
| | | |
| | | value = Math.abs(value); |
| | | |
| | | if (isNaN(value) || value === Infinity) { |
| | | m = isNaN(value) ? 1 : 0; |
| | | e = eMax; |
| | | } else { |
| | | e = Math.floor(Math.log(value) / Math.LN2); |
| | | if (value * (c = Math.pow(2, -e)) < 1) { |
| | | e--; |
| | | c *= 2; |
| | | } |
| | | if (e + eBias >= 1) { |
| | | value += rt / c; |
| | | } else { |
| | | value += rt * Math.pow(2, 1 - eBias); |
| | | } |
| | | if (value * c >= 2) { |
| | | e++; |
| | | c /= 2; |
| | | } |
| | | |
| | | if (e + eBias >= eMax) { |
| | | m = 0; |
| | | e = eMax; |
| | | } else if (e + eBias >= 1) { |
| | | m = (value * c - 1) * Math.pow(2, mLen); |
| | | e = e + eBias; |
| | | } else { |
| | | m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen); |
| | | e = 0; |
| | | } |
| | | } |
| | | |
| | | for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {} |
| | | |
| | | e = (e << mLen) | m; |
| | | eLen += mLen; |
| | | for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {} |
| | | |
| | | buffer[offset + i - d] |= s * 128; |
| | | } |
| | | |
| | | var toString$1 = {}.toString; |
| | | |
| | | var isArray$2 = Array.isArray || function (arr) { |
| | | return toString$1.call(arr) == '[object Array]'; |
| | | }; |
| | | |
| | | /*! |
| | | * The buffer module from node.js, for the browser. |
| | | * |
| | | * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> |
| | | * @license MIT |
| | | */ |
| | | /* eslint-disable no-proto */ |
| | | |
| | | |
| | | var INSPECT_MAX_BYTES = 50; |
| | | |
| | | /** |
| | | * If `Buffer.TYPED_ARRAY_SUPPORT`: |
| | | * === true Use Uint8Array implementation (fastest) |
| | | * === false Use Object implementation (most compatible, even IE6) |
| | | * |
| | | * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, |
| | | * Opera 11.6+, iOS 4.2+. |
| | | * |
| | | * Due to various browser bugs, sometimes the Object implementation will be used even |
| | | * when the browser supports typed arrays. |
| | | * |
| | | * Note: |
| | | * |
| | | * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances, |
| | | * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. |
| | | * |
| | | * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. |
| | | * |
| | | * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of |
| | | * incorrect length in some situations. |
| | | |
| | | * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they |
| | | * get the Object implementation, which is slower but behaves correctly. |
| | | */ |
| | | Buffer$1.TYPED_ARRAY_SUPPORT = global$1.TYPED_ARRAY_SUPPORT !== undefined |
| | | ? global$1.TYPED_ARRAY_SUPPORT |
| | | : true; |
| | | |
| | | /* |
| | | * Export kMaxLength after typed array support is determined. |
| | | */ |
| | | kMaxLength(); |
| | | |
| | | function kMaxLength () { |
| | | return Buffer$1.TYPED_ARRAY_SUPPORT |
| | | ? 0x7fffffff |
| | | : 0x3fffffff |
| | | } |
| | | |
| | | function createBuffer (that, length) { |
| | | if (kMaxLength() < length) { |
| | | throw new RangeError('Invalid typed array length') |
| | | } |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // Return an augmented `Uint8Array` instance, for best performance |
| | | that = new Uint8Array(length); |
| | | that.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | // Fallback: Return an object instance of the Buffer class |
| | | if (that === null) { |
| | | that = new Buffer$1(length); |
| | | } |
| | | that.length = length; |
| | | } |
| | | |
| | | return that |
| | | } |
| | | |
| | | /** |
| | | * The Buffer constructor returns instances of `Uint8Array` that have their |
| | | * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of |
| | | * `Uint8Array`, so the returned instances will have all the node `Buffer` methods |
| | | * and the `Uint8Array` methods. Square bracket notation works as expected -- it |
| | | * returns a single octet. |
| | | * |
| | | * The `Uint8Array` prototype remains unmodified. |
| | | */ |
| | | |
| | | function Buffer$1 (arg, encodingOrOffset, length) { |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer$1)) { |
| | | return new Buffer$1(arg, encodingOrOffset, length) |
| | | } |
| | | |
| | | // Common case. |
| | | if (typeof arg === 'number') { |
| | | if (typeof encodingOrOffset === 'string') { |
| | | throw new Error( |
| | | 'If encoding is specified then the first argument must be a string' |
| | | ) |
| | | } |
| | | return allocUnsafe(this, arg) |
| | | } |
| | | return from(this, arg, encodingOrOffset, length) |
| | | } |
| | | |
| | | Buffer$1.poolSize = 8192; // not used by this implementation |
| | | |
| | | // TODO: Legacy, not needed anymore. Remove in next major version. |
| | | Buffer$1._augment = function (arr) { |
| | | arr.__proto__ = Buffer$1.prototype; |
| | | return arr |
| | | }; |
| | | |
| | | function from (that, value, encodingOrOffset, length) { |
| | | if (typeof value === 'number') { |
| | | throw new TypeError('"value" argument must not be a number') |
| | | } |
| | | |
| | | if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) { |
| | | return fromArrayBuffer(that, value, encodingOrOffset, length) |
| | | } |
| | | |
| | | if (typeof value === 'string') { |
| | | return fromString(that, value, encodingOrOffset) |
| | | } |
| | | |
| | | return fromObject(that, value) |
| | | } |
| | | |
| | | /** |
| | | * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError |
| | | * if value is a number. |
| | | * Buffer.from(str[, encoding]) |
| | | * Buffer.from(array) |
| | | * Buffer.from(buffer) |
| | | * Buffer.from(arrayBuffer[, byteOffset[, length]]) |
| | | **/ |
| | | Buffer$1.from = function (value, encodingOrOffset, length) { |
| | | return from(null, value, encodingOrOffset, length) |
| | | }; |
| | | |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | Buffer$1.prototype.__proto__ = Uint8Array.prototype; |
| | | Buffer$1.__proto__ = Uint8Array; |
| | | if (typeof Symbol !== 'undefined' && Symbol.species && |
| | | Buffer$1[Symbol.species] === Buffer$1) ; |
| | | } |
| | | |
| | | function assertSize (size) { |
| | | if (typeof size !== 'number') { |
| | | throw new TypeError('"size" argument must be a number') |
| | | } else if (size < 0) { |
| | | throw new RangeError('"size" argument must not be negative') |
| | | } |
| | | } |
| | | |
| | | function alloc (that, size, fill, encoding) { |
| | | assertSize(size); |
| | | if (size <= 0) { |
| | | return createBuffer(that, size) |
| | | } |
| | | if (fill !== undefined) { |
| | | // Only pay attention to encoding if it's a string. This |
| | | // prevents accidentally sending in a number that would |
| | | // be interpretted as a start offset. |
| | | return typeof encoding === 'string' |
| | | ? createBuffer(that, size).fill(fill, encoding) |
| | | : createBuffer(that, size).fill(fill) |
| | | } |
| | | return createBuffer(that, size) |
| | | } |
| | | |
| | | /** |
| | | * Creates a new filled Buffer instance. |
| | | * alloc(size[, fill[, encoding]]) |
| | | **/ |
| | | Buffer$1.alloc = function (size, fill, encoding) { |
| | | return alloc(null, size, fill, encoding) |
| | | }; |
| | | |
| | | function allocUnsafe (that, size) { |
| | | assertSize(size); |
| | | that = createBuffer(that, size < 0 ? 0 : checked(size) | 0); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | for (var i = 0; i < size; ++i) { |
| | | that[i] = 0; |
| | | } |
| | | } |
| | | return that |
| | | } |
| | | |
| | | /** |
| | | * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance. |
| | | * */ |
| | | Buffer$1.allocUnsafe = function (size) { |
| | | return allocUnsafe(null, size) |
| | | }; |
| | | /** |
| | | * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance. |
| | | */ |
| | | Buffer$1.allocUnsafeSlow = function (size) { |
| | | return allocUnsafe(null, size) |
| | | }; |
| | | |
| | | function fromString (that, string, encoding) { |
| | | if (typeof encoding !== 'string' || encoding === '') { |
| | | encoding = 'utf8'; |
| | | } |
| | | |
| | | if (!Buffer$1.isEncoding(encoding)) { |
| | | throw new TypeError('"encoding" must be a valid string encoding') |
| | | } |
| | | |
| | | var length = byteLength(string, encoding) | 0; |
| | | that = createBuffer(that, length); |
| | | |
| | | var actual = that.write(string, encoding); |
| | | |
| | | if (actual !== length) { |
| | | // Writing a hex string, for example, that contains invalid characters will |
| | | // cause everything after the first invalid character to be ignored. (e.g. |
| | | // 'abxxcd' will be treated as 'ab') |
| | | that = that.slice(0, actual); |
| | | } |
| | | |
| | | return that |
| | | } |
| | | |
| | | function fromArrayLike (that, array) { |
| | | var length = array.length < 0 ? 0 : checked(array.length) | 0; |
| | | that = createBuffer(that, length); |
| | | for (var i = 0; i < length; i += 1) { |
| | | that[i] = array[i] & 255; |
| | | } |
| | | return that |
| | | } |
| | | |
| | | function fromArrayBuffer (that, array, byteOffset, length) { |
| | | array.byteLength; // this throws if `array` is not a valid ArrayBuffer |
| | | |
| | | if (byteOffset < 0 || array.byteLength < byteOffset) { |
| | | throw new RangeError('\'offset\' is out of bounds') |
| | | } |
| | | |
| | | if (array.byteLength < byteOffset + (length || 0)) { |
| | | throw new RangeError('\'length\' is out of bounds') |
| | | } |
| | | |
| | | if (byteOffset === undefined && length === undefined) { |
| | | array = new Uint8Array(array); |
| | | } else if (length === undefined) { |
| | | array = new Uint8Array(array, byteOffset); |
| | | } else { |
| | | array = new Uint8Array(array, byteOffset, length); |
| | | } |
| | | |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // Return an augmented `Uint8Array` instance, for best performance |
| | | that = array; |
| | | that.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | // Fallback: Return an object instance of the Buffer class |
| | | that = fromArrayLike(that, array); |
| | | } |
| | | return that |
| | | } |
| | | |
| | | function fromObject (that, obj) { |
| | | if (internalIsBuffer(obj)) { |
| | | var len = checked(obj.length) | 0; |
| | | that = createBuffer(that, len); |
| | | |
| | | if (that.length === 0) { |
| | | return that |
| | | } |
| | | |
| | | obj.copy(that, 0, 0, len); |
| | | return that |
| | | } |
| | | |
| | | if (obj) { |
| | | if ((typeof ArrayBuffer !== 'undefined' && |
| | | obj.buffer instanceof ArrayBuffer) || 'length' in obj) { |
| | | if (typeof obj.length !== 'number' || isnan(obj.length)) { |
| | | return createBuffer(that, 0) |
| | | } |
| | | return fromArrayLike(that, obj) |
| | | } |
| | | |
| | | if (obj.type === 'Buffer' && isArray$2(obj.data)) { |
| | | return fromArrayLike(that, obj.data) |
| | | } |
| | | } |
| | | |
| | | throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.') |
| | | } |
| | | |
| | | function checked (length) { |
| | | // Note: cannot use `length < kMaxLength()` here because that fails when |
| | | // length is NaN (which is otherwise coerced to zero.) |
| | | if (length >= kMaxLength()) { |
| | | throw new RangeError('Attempt to allocate Buffer larger than maximum ' + |
| | | 'size: 0x' + kMaxLength().toString(16) + ' bytes') |
| | | } |
| | | return length | 0 |
| | | } |
| | | Buffer$1.isBuffer = isBuffer$1; |
| | | function internalIsBuffer (b) { |
| | | return !!(b != null && b._isBuffer) |
| | | } |
| | | |
| | | Buffer$1.compare = function compare (a, b) { |
| | | if (!internalIsBuffer(a) || !internalIsBuffer(b)) { |
| | | throw new TypeError('Arguments must be Buffers') |
| | | } |
| | | |
| | | if (a === b) return 0 |
| | | |
| | | var x = a.length; |
| | | var y = b.length; |
| | | |
| | | for (var i = 0, len = Math.min(x, y); i < len; ++i) { |
| | | if (a[i] !== b[i]) { |
| | | x = a[i]; |
| | | y = b[i]; |
| | | break |
| | | } |
| | | } |
| | | |
| | | if (x < y) return -1 |
| | | if (y < x) return 1 |
| | | return 0 |
| | | }; |
| | | |
| | | Buffer$1.isEncoding = function isEncoding (encoding) { |
| | | switch (String(encoding).toLowerCase()) { |
| | | case 'hex': |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | case 'ascii': |
| | | case 'latin1': |
| | | case 'binary': |
| | | case 'base64': |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return true |
| | | default: |
| | | return false |
| | | } |
| | | }; |
| | | |
| | | Buffer$1.concat = function concat (list, length) { |
| | | if (!isArray$2(list)) { |
| | | throw new TypeError('"list" argument must be an Array of Buffers') |
| | | } |
| | | |
| | | if (list.length === 0) { |
| | | return Buffer$1.alloc(0) |
| | | } |
| | | |
| | | var i; |
| | | if (length === undefined) { |
| | | length = 0; |
| | | for (i = 0; i < list.length; ++i) { |
| | | length += list[i].length; |
| | | } |
| | | } |
| | | |
| | | var buffer = Buffer$1.allocUnsafe(length); |
| | | var pos = 0; |
| | | for (i = 0; i < list.length; ++i) { |
| | | var buf = list[i]; |
| | | if (!internalIsBuffer(buf)) { |
| | | throw new TypeError('"list" argument must be an Array of Buffers') |
| | | } |
| | | buf.copy(buffer, pos); |
| | | pos += buf.length; |
| | | } |
| | | return buffer |
| | | }; |
| | | |
| | | function byteLength (string, encoding) { |
| | | if (internalIsBuffer(string)) { |
| | | return string.length |
| | | } |
| | | if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' && |
| | | (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) { |
| | | return string.byteLength |
| | | } |
| | | if (typeof string !== 'string') { |
| | | string = '' + string; |
| | | } |
| | | |
| | | var len = string.length; |
| | | if (len === 0) return 0 |
| | | |
| | | // Use a for loop to avoid recursion |
| | | var loweredCase = false; |
| | | for (;;) { |
| | | switch (encoding) { |
| | | case 'ascii': |
| | | case 'latin1': |
| | | case 'binary': |
| | | return len |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | case undefined: |
| | | return utf8ToBytes(string).length |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return len * 2 |
| | | case 'hex': |
| | | return len >>> 1 |
| | | case 'base64': |
| | | return base64ToBytes(string).length |
| | | default: |
| | | if (loweredCase) return utf8ToBytes(string).length // assume utf8 |
| | | encoding = ('' + encoding).toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | } |
| | | Buffer$1.byteLength = byteLength; |
| | | |
| | | function slowToString (encoding, start, end) { |
| | | var loweredCase = false; |
| | | |
| | | // No need to verify that "this.length <= MAX_UINT32" since it's a read-only |
| | | // property of a typed array. |
| | | |
| | | // This behaves neither like String nor Uint8Array in that we set start/end |
| | | // to their upper/lower bounds if the value passed is out of range. |
| | | // undefined is handled specially as per ECMA-262 6th Edition, |
| | | // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization. |
| | | if (start === undefined || start < 0) { |
| | | start = 0; |
| | | } |
| | | // Return early if start > this.length. Done here to prevent potential uint32 |
| | | // coercion fail below. |
| | | if (start > this.length) { |
| | | return '' |
| | | } |
| | | |
| | | if (end === undefined || end > this.length) { |
| | | end = this.length; |
| | | } |
| | | |
| | | if (end <= 0) { |
| | | return '' |
| | | } |
| | | |
| | | // Force coersion to uint32. This will also coerce falsey/NaN values to 0. |
| | | end >>>= 0; |
| | | start >>>= 0; |
| | | |
| | | if (end <= start) { |
| | | return '' |
| | | } |
| | | |
| | | if (!encoding) encoding = 'utf8'; |
| | | |
| | | while (true) { |
| | | switch (encoding) { |
| | | case 'hex': |
| | | return hexSlice(this, start, end) |
| | | |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | return utf8Slice(this, start, end) |
| | | |
| | | case 'ascii': |
| | | return asciiSlice(this, start, end) |
| | | |
| | | case 'latin1': |
| | | case 'binary': |
| | | return latin1Slice(this, start, end) |
| | | |
| | | case 'base64': |
| | | return base64Slice(this, start, end) |
| | | |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return utf16leSlice(this, start, end) |
| | | |
| | | default: |
| | | if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) |
| | | encoding = (encoding + '').toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | } |
| | | |
| | | // The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect |
| | | // Buffer instances. |
| | | Buffer$1.prototype._isBuffer = true; |
| | | |
| | | function swap (b, n, m) { |
| | | var i = b[n]; |
| | | b[n] = b[m]; |
| | | b[m] = i; |
| | | } |
| | | |
| | | Buffer$1.prototype.swap16 = function swap16 () { |
| | | var len = this.length; |
| | | if (len % 2 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 16-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 2) { |
| | | swap(this, i, i + 1); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.swap32 = function swap32 () { |
| | | var len = this.length; |
| | | if (len % 4 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 32-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 4) { |
| | | swap(this, i, i + 3); |
| | | swap(this, i + 1, i + 2); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.swap64 = function swap64 () { |
| | | var len = this.length; |
| | | if (len % 8 !== 0) { |
| | | throw new RangeError('Buffer size must be a multiple of 64-bits') |
| | | } |
| | | for (var i = 0; i < len; i += 8) { |
| | | swap(this, i, i + 7); |
| | | swap(this, i + 1, i + 6); |
| | | swap(this, i + 2, i + 5); |
| | | swap(this, i + 3, i + 4); |
| | | } |
| | | return this |
| | | }; |
| | | |
| | | Buffer$1.prototype.toString = function toString () { |
| | | var length = this.length | 0; |
| | | if (length === 0) return '' |
| | | if (arguments.length === 0) return utf8Slice(this, 0, length) |
| | | return slowToString.apply(this, arguments) |
| | | }; |
| | | |
| | | Buffer$1.prototype.equals = function equals (b) { |
| | | if (!internalIsBuffer(b)) throw new TypeError('Argument must be a Buffer') |
| | | if (this === b) return true |
| | | return Buffer$1.compare(this, b) === 0 |
| | | }; |
| | | |
| | | Buffer$1.prototype.inspect = function inspect () { |
| | | var str = ''; |
| | | var max = INSPECT_MAX_BYTES; |
| | | if (this.length > 0) { |
| | | str = this.toString('hex', 0, max).match(/.{2}/g).join(' '); |
| | | if (this.length > max) str += ' ... '; |
| | | } |
| | | return '<Buffer ' + str + '>' |
| | | }; |
| | | |
| | | Buffer$1.prototype.compare = function compare (target, start, end, thisStart, thisEnd) { |
| | | if (!internalIsBuffer(target)) { |
| | | throw new TypeError('Argument must be a Buffer') |
| | | } |
| | | |
| | | if (start === undefined) { |
| | | start = 0; |
| | | } |
| | | if (end === undefined) { |
| | | end = target ? target.length : 0; |
| | | } |
| | | if (thisStart === undefined) { |
| | | thisStart = 0; |
| | | } |
| | | if (thisEnd === undefined) { |
| | | thisEnd = this.length; |
| | | } |
| | | |
| | | if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) { |
| | | throw new RangeError('out of range index') |
| | | } |
| | | |
| | | if (thisStart >= thisEnd && start >= end) { |
| | | return 0 |
| | | } |
| | | if (thisStart >= thisEnd) { |
| | | return -1 |
| | | } |
| | | if (start >= end) { |
| | | return 1 |
| | | } |
| | | |
| | | start >>>= 0; |
| | | end >>>= 0; |
| | | thisStart >>>= 0; |
| | | thisEnd >>>= 0; |
| | | |
| | | if (this === target) return 0 |
| | | |
| | | var x = thisEnd - thisStart; |
| | | var y = end - start; |
| | | var len = Math.min(x, y); |
| | | |
| | | var thisCopy = this.slice(thisStart, thisEnd); |
| | | var targetCopy = target.slice(start, end); |
| | | |
| | | for (var i = 0; i < len; ++i) { |
| | | if (thisCopy[i] !== targetCopy[i]) { |
| | | x = thisCopy[i]; |
| | | y = targetCopy[i]; |
| | | break |
| | | } |
| | | } |
| | | |
| | | if (x < y) return -1 |
| | | if (y < x) return 1 |
| | | return 0 |
| | | }; |
| | | |
| | | // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, |
| | | // OR the last index of `val` in `buffer` at offset <= `byteOffset`. |
| | | // |
| | | // Arguments: |
| | | // - buffer - a Buffer to search |
| | | // - val - a string, Buffer, or number |
| | | // - byteOffset - an index into `buffer`; will be clamped to an int32 |
| | | // - encoding - an optional encoding, relevant is val is a string |
| | | // - dir - true for indexOf, false for lastIndexOf |
| | | function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) { |
| | | // Empty buffer means no match |
| | | if (buffer.length === 0) return -1 |
| | | |
| | | // Normalize byteOffset |
| | | if (typeof byteOffset === 'string') { |
| | | encoding = byteOffset; |
| | | byteOffset = 0; |
| | | } else if (byteOffset > 0x7fffffff) { |
| | | byteOffset = 0x7fffffff; |
| | | } else if (byteOffset < -2147483648) { |
| | | byteOffset = -2147483648; |
| | | } |
| | | byteOffset = +byteOffset; // Coerce to Number. |
| | | if (isNaN(byteOffset)) { |
| | | // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer |
| | | byteOffset = dir ? 0 : (buffer.length - 1); |
| | | } |
| | | |
| | | // Normalize byteOffset: negative offsets start from the end of the buffer |
| | | if (byteOffset < 0) byteOffset = buffer.length + byteOffset; |
| | | if (byteOffset >= buffer.length) { |
| | | if (dir) return -1 |
| | | else byteOffset = buffer.length - 1; |
| | | } else if (byteOffset < 0) { |
| | | if (dir) byteOffset = 0; |
| | | else return -1 |
| | | } |
| | | |
| | | // Normalize val |
| | | if (typeof val === 'string') { |
| | | val = Buffer$1.from(val, encoding); |
| | | } |
| | | |
| | | // Finally, search either indexOf (if dir is true) or lastIndexOf |
| | | if (internalIsBuffer(val)) { |
| | | // Special case: looking for empty string/buffer always fails |
| | | if (val.length === 0) { |
| | | return -1 |
| | | } |
| | | return arrayIndexOf(buffer, val, byteOffset, encoding, dir) |
| | | } else if (typeof val === 'number') { |
| | | val = val & 0xFF; // Search for a byte value [0-255] |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT && |
| | | typeof Uint8Array.prototype.indexOf === 'function') { |
| | | if (dir) { |
| | | return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset) |
| | | } else { |
| | | return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset) |
| | | } |
| | | } |
| | | return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir) |
| | | } |
| | | |
| | | throw new TypeError('val must be string, number or Buffer') |
| | | } |
| | | |
| | | function arrayIndexOf (arr, val, byteOffset, encoding, dir) { |
| | | var indexSize = 1; |
| | | var arrLength = arr.length; |
| | | var valLength = val.length; |
| | | |
| | | if (encoding !== undefined) { |
| | | encoding = String(encoding).toLowerCase(); |
| | | if (encoding === 'ucs2' || encoding === 'ucs-2' || |
| | | encoding === 'utf16le' || encoding === 'utf-16le') { |
| | | if (arr.length < 2 || val.length < 2) { |
| | | return -1 |
| | | } |
| | | indexSize = 2; |
| | | arrLength /= 2; |
| | | valLength /= 2; |
| | | byteOffset /= 2; |
| | | } |
| | | } |
| | | |
| | | function read (buf, i) { |
| | | if (indexSize === 1) { |
| | | return buf[i] |
| | | } else { |
| | | return buf.readUInt16BE(i * indexSize) |
| | | } |
| | | } |
| | | |
| | | var i; |
| | | if (dir) { |
| | | var foundIndex = -1; |
| | | for (i = byteOffset; i < arrLength; i++) { |
| | | if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) { |
| | | if (foundIndex === -1) foundIndex = i; |
| | | if (i - foundIndex + 1 === valLength) return foundIndex * indexSize |
| | | } else { |
| | | if (foundIndex !== -1) i -= i - foundIndex; |
| | | foundIndex = -1; |
| | | } |
| | | } |
| | | } else { |
| | | if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength; |
| | | for (i = byteOffset; i >= 0; i--) { |
| | | var found = true; |
| | | for (var j = 0; j < valLength; j++) { |
| | | if (read(arr, i + j) !== read(val, j)) { |
| | | found = false; |
| | | break |
| | | } |
| | | } |
| | | if (found) return i |
| | | } |
| | | } |
| | | |
| | | return -1 |
| | | } |
| | | |
| | | Buffer$1.prototype.includes = function includes (val, byteOffset, encoding) { |
| | | return this.indexOf(val, byteOffset, encoding) !== -1 |
| | | }; |
| | | |
| | | Buffer$1.prototype.indexOf = function indexOf (val, byteOffset, encoding) { |
| | | return bidirectionalIndexOf(this, val, byteOffset, encoding, true) |
| | | }; |
| | | |
| | | Buffer$1.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) { |
| | | return bidirectionalIndexOf(this, val, byteOffset, encoding, false) |
| | | }; |
| | | |
| | | function hexWrite (buf, string, offset, length) { |
| | | offset = Number(offset) || 0; |
| | | var remaining = buf.length - offset; |
| | | if (!length) { |
| | | length = remaining; |
| | | } else { |
| | | length = Number(length); |
| | | if (length > remaining) { |
| | | length = remaining; |
| | | } |
| | | } |
| | | |
| | | // must be an even number of digits |
| | | var strLen = string.length; |
| | | if (strLen % 2 !== 0) throw new TypeError('Invalid hex string') |
| | | |
| | | if (length > strLen / 2) { |
| | | length = strLen / 2; |
| | | } |
| | | for (var i = 0; i < length; ++i) { |
| | | var parsed = parseInt(string.substr(i * 2, 2), 16); |
| | | if (isNaN(parsed)) return i |
| | | buf[offset + i] = parsed; |
| | | } |
| | | return i |
| | | } |
| | | |
| | | function utf8Write (buf, string, offset, length) { |
| | | return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) |
| | | } |
| | | |
| | | function asciiWrite (buf, string, offset, length) { |
| | | return blitBuffer(asciiToBytes(string), buf, offset, length) |
| | | } |
| | | |
| | | function latin1Write (buf, string, offset, length) { |
| | | return asciiWrite(buf, string, offset, length) |
| | | } |
| | | |
| | | function base64Write (buf, string, offset, length) { |
| | | return blitBuffer(base64ToBytes(string), buf, offset, length) |
| | | } |
| | | |
| | | function ucs2Write (buf, string, offset, length) { |
| | | return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) |
| | | } |
| | | |
| | | Buffer$1.prototype.write = function write (string, offset, length, encoding) { |
| | | // Buffer#write(string) |
| | | if (offset === undefined) { |
| | | encoding = 'utf8'; |
| | | length = this.length; |
| | | offset = 0; |
| | | // Buffer#write(string, encoding) |
| | | } else if (length === undefined && typeof offset === 'string') { |
| | | encoding = offset; |
| | | length = this.length; |
| | | offset = 0; |
| | | // Buffer#write(string, offset[, length][, encoding]) |
| | | } else if (isFinite(offset)) { |
| | | offset = offset | 0; |
| | | if (isFinite(length)) { |
| | | length = length | 0; |
| | | if (encoding === undefined) encoding = 'utf8'; |
| | | } else { |
| | | encoding = length; |
| | | length = undefined; |
| | | } |
| | | // legacy write(string, encoding, offset, length) - remove in v0.13 |
| | | } else { |
| | | throw new Error( |
| | | 'Buffer.write(string, encoding, offset[, length]) is no longer supported' |
| | | ) |
| | | } |
| | | |
| | | var remaining = this.length - offset; |
| | | if (length === undefined || length > remaining) length = remaining; |
| | | |
| | | if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) { |
| | | throw new RangeError('Attempt to write outside buffer bounds') |
| | | } |
| | | |
| | | if (!encoding) encoding = 'utf8'; |
| | | |
| | | var loweredCase = false; |
| | | for (;;) { |
| | | switch (encoding) { |
| | | case 'hex': |
| | | return hexWrite(this, string, offset, length) |
| | | |
| | | case 'utf8': |
| | | case 'utf-8': |
| | | return utf8Write(this, string, offset, length) |
| | | |
| | | case 'ascii': |
| | | return asciiWrite(this, string, offset, length) |
| | | |
| | | case 'latin1': |
| | | case 'binary': |
| | | return latin1Write(this, string, offset, length) |
| | | |
| | | case 'base64': |
| | | // Warning: maxLength not taken into account in base64Write |
| | | return base64Write(this, string, offset, length) |
| | | |
| | | case 'ucs2': |
| | | case 'ucs-2': |
| | | case 'utf16le': |
| | | case 'utf-16le': |
| | | return ucs2Write(this, string, offset, length) |
| | | |
| | | default: |
| | | if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) |
| | | encoding = ('' + encoding).toLowerCase(); |
| | | loweredCase = true; |
| | | } |
| | | } |
| | | }; |
| | | |
| | | Buffer$1.prototype.toJSON = function toJSON () { |
| | | return { |
| | | type: 'Buffer', |
| | | data: Array.prototype.slice.call(this._arr || this, 0) |
| | | } |
| | | }; |
| | | |
| | | function base64Slice (buf, start, end) { |
| | | if (start === 0 && end === buf.length) { |
| | | return fromByteArray(buf) |
| | | } else { |
| | | return fromByteArray(buf.slice(start, end)) |
| | | } |
| | | } |
| | | |
| | | function utf8Slice (buf, start, end) { |
| | | end = Math.min(buf.length, end); |
| | | var res = []; |
| | | |
| | | var i = start; |
| | | while (i < end) { |
| | | var firstByte = buf[i]; |
| | | var codePoint = null; |
| | | var bytesPerSequence = (firstByte > 0xEF) ? 4 |
| | | : (firstByte > 0xDF) ? 3 |
| | | : (firstByte > 0xBF) ? 2 |
| | | : 1; |
| | | |
| | | if (i + bytesPerSequence <= end) { |
| | | var secondByte, thirdByte, fourthByte, tempCodePoint; |
| | | |
| | | switch (bytesPerSequence) { |
| | | case 1: |
| | | if (firstByte < 0x80) { |
| | | codePoint = firstByte; |
| | | } |
| | | break |
| | | case 2: |
| | | secondByte = buf[i + 1]; |
| | | if ((secondByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F); |
| | | if (tempCodePoint > 0x7F) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | break |
| | | case 3: |
| | | secondByte = buf[i + 1]; |
| | | thirdByte = buf[i + 2]; |
| | | if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F); |
| | | if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | break |
| | | case 4: |
| | | secondByte = buf[i + 1]; |
| | | thirdByte = buf[i + 2]; |
| | | fourthByte = buf[i + 3]; |
| | | if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { |
| | | tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F); |
| | | if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { |
| | | codePoint = tempCodePoint; |
| | | } |
| | | } |
| | | } |
| | | } |
| | | |
| | | if (codePoint === null) { |
| | | // we did not generate a valid codePoint so insert a |
| | | // replacement char (U+FFFD) and advance only 1 byte |
| | | codePoint = 0xFFFD; |
| | | bytesPerSequence = 1; |
| | | } else if (codePoint > 0xFFFF) { |
| | | // encode to utf16 (surrogate pair dance) |
| | | codePoint -= 0x10000; |
| | | res.push(codePoint >>> 10 & 0x3FF | 0xD800); |
| | | codePoint = 0xDC00 | codePoint & 0x3FF; |
| | | } |
| | | |
| | | res.push(codePoint); |
| | | i += bytesPerSequence; |
| | | } |
| | | |
| | | return decodeCodePointsArray(res) |
| | | } |
| | | |
| | | // Based on http://stackoverflow.com/a/22747272/680742, the browser with |
| | | // the lowest limit is Chrome, with 0x10000 args. |
| | | // We go 1 magnitude less, for safety |
| | | var MAX_ARGUMENTS_LENGTH = 0x1000; |
| | | |
| | | function decodeCodePointsArray (codePoints) { |
| | | var len = codePoints.length; |
| | | if (len <= MAX_ARGUMENTS_LENGTH) { |
| | | return String.fromCharCode.apply(String, codePoints) // avoid extra slice() |
| | | } |
| | | |
| | | // Decode in chunks to avoid "call stack size exceeded". |
| | | var res = ''; |
| | | var i = 0; |
| | | while (i < len) { |
| | | res += String.fromCharCode.apply( |
| | | String, |
| | | codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH) |
| | | ); |
| | | } |
| | | return res |
| | | } |
| | | |
| | | function asciiSlice (buf, start, end) { |
| | | var ret = ''; |
| | | end = Math.min(buf.length, end); |
| | | |
| | | for (var i = start; i < end; ++i) { |
| | | ret += String.fromCharCode(buf[i] & 0x7F); |
| | | } |
| | | return ret |
| | | } |
| | | |
| | | function latin1Slice (buf, start, end) { |
| | | var ret = ''; |
| | | end = Math.min(buf.length, end); |
| | | |
| | | for (var i = start; i < end; ++i) { |
| | | ret += String.fromCharCode(buf[i]); |
| | | } |
| | | return ret |
| | | } |
| | | |
| | | function hexSlice (buf, start, end) { |
| | | var len = buf.length; |
| | | |
| | | if (!start || start < 0) start = 0; |
| | | if (!end || end < 0 || end > len) end = len; |
| | | |
| | | var out = ''; |
| | | for (var i = start; i < end; ++i) { |
| | | out += toHex(buf[i]); |
| | | } |
| | | return out |
| | | } |
| | | |
| | | function utf16leSlice (buf, start, end) { |
| | | var bytes = buf.slice(start, end); |
| | | var res = ''; |
| | | for (var i = 0; i < bytes.length; i += 2) { |
| | | res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256); |
| | | } |
| | | return res |
| | | } |
| | | |
| | | Buffer$1.prototype.slice = function slice (start, end) { |
| | | var len = this.length; |
| | | start = ~~start; |
| | | end = end === undefined ? len : ~~end; |
| | | |
| | | if (start < 0) { |
| | | start += len; |
| | | if (start < 0) start = 0; |
| | | } else if (start > len) { |
| | | start = len; |
| | | } |
| | | |
| | | if (end < 0) { |
| | | end += len; |
| | | if (end < 0) end = 0; |
| | | } else if (end > len) { |
| | | end = len; |
| | | } |
| | | |
| | | if (end < start) end = start; |
| | | |
| | | var newBuf; |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | newBuf = this.subarray(start, end); |
| | | newBuf.__proto__ = Buffer$1.prototype; |
| | | } else { |
| | | var sliceLen = end - start; |
| | | newBuf = new Buffer$1(sliceLen, undefined); |
| | | for (var i = 0; i < sliceLen; ++i) { |
| | | newBuf[i] = this[i + start]; |
| | | } |
| | | } |
| | | |
| | | return newBuf |
| | | }; |
| | | |
| | | /* |
| | | * Need to make sure that buffer isn't trying to write out of bounds. |
| | | */ |
| | | function checkOffset (offset, ext, length) { |
| | | if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint') |
| | | if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length') |
| | | } |
| | | |
| | | Buffer$1.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var val = this[offset]; |
| | | var mul = 1; |
| | | var i = 0; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | val += this[offset + i] * mul; |
| | | } |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | checkOffset(offset, byteLength, this.length); |
| | | } |
| | | |
| | | var val = this[offset + --byteLength]; |
| | | var mul = 1; |
| | | while (byteLength > 0 && (mul *= 0x100)) { |
| | | val += this[offset + --byteLength] * mul; |
| | | } |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt8 = function readUInt8 (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 1, this.length); |
| | | return this[offset] |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | return this[offset] | (this[offset + 1] << 8) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | return (this[offset] << 8) | this[offset + 1] |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return ((this[offset]) | |
| | | (this[offset + 1] << 8) | |
| | | (this[offset + 2] << 16)) + |
| | | (this[offset + 3] * 0x1000000) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset] * 0x1000000) + |
| | | ((this[offset + 1] << 16) | |
| | | (this[offset + 2] << 8) | |
| | | this[offset + 3]) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var val = this[offset]; |
| | | var mul = 1; |
| | | var i = 0; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | val += this[offset + i] * mul; |
| | | } |
| | | mul *= 0x80; |
| | | |
| | | if (val >= mul) val -= Math.pow(2, 8 * byteLength); |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) { |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) checkOffset(offset, byteLength, this.length); |
| | | |
| | | var i = byteLength; |
| | | var mul = 1; |
| | | var val = this[offset + --i]; |
| | | while (i > 0 && (mul *= 0x100)) { |
| | | val += this[offset + --i] * mul; |
| | | } |
| | | mul *= 0x80; |
| | | |
| | | if (val >= mul) val -= Math.pow(2, 8 * byteLength); |
| | | |
| | | return val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt8 = function readInt8 (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 1, this.length); |
| | | if (!(this[offset] & 0x80)) return (this[offset]) |
| | | return ((0xff - this[offset] + 1) * -1) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt16LE = function readInt16LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | var val = this[offset] | (this[offset + 1] << 8); |
| | | return (val & 0x8000) ? val | 0xFFFF0000 : val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt16BE = function readInt16BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 2, this.length); |
| | | var val = this[offset + 1] | (this[offset] << 8); |
| | | return (val & 0x8000) ? val | 0xFFFF0000 : val |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt32LE = function readInt32LE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset]) | |
| | | (this[offset + 1] << 8) | |
| | | (this[offset + 2] << 16) | |
| | | (this[offset + 3] << 24) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readInt32BE = function readInt32BE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | |
| | | return (this[offset] << 24) | |
| | | (this[offset + 1] << 16) | |
| | | (this[offset + 2] << 8) | |
| | | (this[offset + 3]) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readFloatLE = function readFloatLE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | return read(this, offset, true, 23, 4) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readFloatBE = function readFloatBE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 4, this.length); |
| | | return read(this, offset, false, 23, 4) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 8, this.length); |
| | | return read(this, offset, true, 52, 8) |
| | | }; |
| | | |
| | | Buffer$1.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) { |
| | | if (!noAssert) checkOffset(offset, 8, this.length); |
| | | return read(this, offset, false, 52, 8) |
| | | }; |
| | | |
| | | function checkInt (buf, value, offset, ext, max, min) { |
| | | if (!internalIsBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance') |
| | | if (value > max || value < min) throw new RangeError('"value" argument is out of bounds') |
| | | if (offset + ext > buf.length) throw new RangeError('Index out of range') |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | var maxBytes = Math.pow(2, 8 * byteLength) - 1; |
| | | checkInt(this, value, offset, byteLength, maxBytes, 0); |
| | | } |
| | | |
| | | var mul = 1; |
| | | var i = 0; |
| | | this[offset] = value & 0xFF; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | this[offset + i] = (value / mul) & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | byteLength = byteLength | 0; |
| | | if (!noAssert) { |
| | | var maxBytes = Math.pow(2, 8 * byteLength) - 1; |
| | | checkInt(this, value, offset, byteLength, maxBytes, 0); |
| | | } |
| | | |
| | | var i = byteLength - 1; |
| | | var mul = 1; |
| | | this[offset + i] = value & 0xFF; |
| | | while (--i >= 0 && (mul *= 0x100)) { |
| | | this[offset + i] = (value / mul) & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) value = Math.floor(value); |
| | | this[offset] = (value & 0xff); |
| | | return offset + 1 |
| | | }; |
| | | |
| | | function objectWriteUInt16 (buf, value, offset, littleEndian) { |
| | | if (value < 0) value = 0xffff + value + 1; |
| | | for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) { |
| | | buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>> |
| | | (littleEndian ? i : 1 - i) * 8; |
| | | } |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, true); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 8); |
| | | this[offset + 1] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, false); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | function objectWriteUInt32 (buf, value, offset, littleEndian) { |
| | | if (value < 0) value = 0xffffffff + value + 1; |
| | | for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) { |
| | | buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff; |
| | | } |
| | | } |
| | | |
| | | Buffer$1.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset + 3] = (value >>> 24); |
| | | this[offset + 2] = (value >>> 16); |
| | | this[offset + 1] = (value >>> 8); |
| | | this[offset] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, true); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 24); |
| | | this[offset + 1] = (value >>> 16); |
| | | this[offset + 2] = (value >>> 8); |
| | | this[offset + 3] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, false); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) { |
| | | var limit = Math.pow(2, 8 * byteLength - 1); |
| | | |
| | | checkInt(this, value, offset, byteLength, limit - 1, -limit); |
| | | } |
| | | |
| | | var i = 0; |
| | | var mul = 1; |
| | | var sub = 0; |
| | | this[offset] = value & 0xFF; |
| | | while (++i < byteLength && (mul *= 0x100)) { |
| | | if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) { |
| | | sub = 1; |
| | | } |
| | | this[offset + i] = ((value / mul) >> 0) - sub & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) { |
| | | var limit = Math.pow(2, 8 * byteLength - 1); |
| | | |
| | | checkInt(this, value, offset, byteLength, limit - 1, -limit); |
| | | } |
| | | |
| | | var i = byteLength - 1; |
| | | var mul = 1; |
| | | var sub = 0; |
| | | this[offset + i] = value & 0xFF; |
| | | while (--i >= 0 && (mul *= 0x100)) { |
| | | if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) { |
| | | sub = 1; |
| | | } |
| | | this[offset + i] = ((value / mul) >> 0) - sub & 0xFF; |
| | | } |
| | | |
| | | return offset + byteLength |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -128); |
| | | if (!Buffer$1.TYPED_ARRAY_SUPPORT) value = Math.floor(value); |
| | | if (value < 0) value = 0xff + value + 1; |
| | | this[offset] = (value & 0xff); |
| | | return offset + 1 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, true); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -32768); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 8); |
| | | this[offset + 1] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt16(this, value, offset, false); |
| | | } |
| | | return offset + 2 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648); |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value & 0xff); |
| | | this[offset + 1] = (value >>> 8); |
| | | this[offset + 2] = (value >>> 16); |
| | | this[offset + 3] = (value >>> 24); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, true); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) { |
| | | value = +value; |
| | | offset = offset | 0; |
| | | if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -2147483648); |
| | | if (value < 0) value = 0xffffffff + value + 1; |
| | | if (Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | this[offset] = (value >>> 24); |
| | | this[offset + 1] = (value >>> 16); |
| | | this[offset + 2] = (value >>> 8); |
| | | this[offset + 3] = (value & 0xff); |
| | | } else { |
| | | objectWriteUInt32(this, value, offset, false); |
| | | } |
| | | return offset + 4 |
| | | }; |
| | | |
| | | function checkIEEE754 (buf, value, offset, ext, max, min) { |
| | | if (offset + ext > buf.length) throw new RangeError('Index out of range') |
| | | if (offset < 0) throw new RangeError('Index out of range') |
| | | } |
| | | |
| | | function writeFloat (buf, value, offset, littleEndian, noAssert) { |
| | | if (!noAssert) { |
| | | checkIEEE754(buf, value, offset, 4); |
| | | } |
| | | write(buf, value, offset, littleEndian, 23, 4); |
| | | return offset + 4 |
| | | } |
| | | |
| | | Buffer$1.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) { |
| | | return writeFloat(this, value, offset, true, noAssert) |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) { |
| | | return writeFloat(this, value, offset, false, noAssert) |
| | | }; |
| | | |
| | | function writeDouble (buf, value, offset, littleEndian, noAssert) { |
| | | if (!noAssert) { |
| | | checkIEEE754(buf, value, offset, 8); |
| | | } |
| | | write(buf, value, offset, littleEndian, 52, 8); |
| | | return offset + 8 |
| | | } |
| | | |
| | | Buffer$1.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) { |
| | | return writeDouble(this, value, offset, true, noAssert) |
| | | }; |
| | | |
| | | Buffer$1.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { |
| | | return writeDouble(this, value, offset, false, noAssert) |
| | | }; |
| | | |
| | | // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) |
| | | Buffer$1.prototype.copy = function copy (target, targetStart, start, end) { |
| | | if (!start) start = 0; |
| | | if (!end && end !== 0) end = this.length; |
| | | if (targetStart >= target.length) targetStart = target.length; |
| | | if (!targetStart) targetStart = 0; |
| | | if (end > 0 && end < start) end = start; |
| | | |
| | | // Copy 0 bytes; we're done |
| | | if (end === start) return 0 |
| | | if (target.length === 0 || this.length === 0) return 0 |
| | | |
| | | // Fatal error conditions |
| | | if (targetStart < 0) { |
| | | throw new RangeError('targetStart out of bounds') |
| | | } |
| | | if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds') |
| | | if (end < 0) throw new RangeError('sourceEnd out of bounds') |
| | | |
| | | // Are we oob? |
| | | if (end > this.length) end = this.length; |
| | | if (target.length - targetStart < end - start) { |
| | | end = target.length - targetStart + start; |
| | | } |
| | | |
| | | var len = end - start; |
| | | var i; |
| | | |
| | | if (this === target && start < targetStart && targetStart < end) { |
| | | // descending copy from end |
| | | for (i = len - 1; i >= 0; --i) { |
| | | target[i + targetStart] = this[i + start]; |
| | | } |
| | | } else if (len < 1000 || !Buffer$1.TYPED_ARRAY_SUPPORT) { |
| | | // ascending copy from start |
| | | for (i = 0; i < len; ++i) { |
| | | target[i + targetStart] = this[i + start]; |
| | | } |
| | | } else { |
| | | Uint8Array.prototype.set.call( |
| | | target, |
| | | this.subarray(start, start + len), |
| | | targetStart |
| | | ); |
| | | } |
| | | |
| | | return len |
| | | }; |
| | | |
| | | // Usage: |
| | | // buffer.fill(number[, offset[, end]]) |
| | | // buffer.fill(buffer[, offset[, end]]) |
| | | // buffer.fill(string[, offset[, end]][, encoding]) |
| | | Buffer$1.prototype.fill = function fill (val, start, end, encoding) { |
| | | // Handle string cases: |
| | | if (typeof val === 'string') { |
| | | if (typeof start === 'string') { |
| | | encoding = start; |
| | | start = 0; |
| | | end = this.length; |
| | | } else if (typeof end === 'string') { |
| | | encoding = end; |
| | | end = this.length; |
| | | } |
| | | if (val.length === 1) { |
| | | var code = val.charCodeAt(0); |
| | | if (code < 256) { |
| | | val = code; |
| | | } |
| | | } |
| | | if (encoding !== undefined && typeof encoding !== 'string') { |
| | | throw new TypeError('encoding must be a string') |
| | | } |
| | | if (typeof encoding === 'string' && !Buffer$1.isEncoding(encoding)) { |
| | | throw new TypeError('Unknown encoding: ' + encoding) |
| | | } |
| | | } else if (typeof val === 'number') { |
| | | val = val & 255; |
| | | } |
| | | |
| | | // Invalid ranges are not set to a default, so can range check early. |
| | | if (start < 0 || this.length < start || this.length < end) { |
| | | throw new RangeError('Out of range index') |
| | | } |
| | | |
| | | if (end <= start) { |
| | | return this |
| | | } |
| | | |
| | | start = start >>> 0; |
| | | end = end === undefined ? this.length : end >>> 0; |
| | | |
| | | if (!val) val = 0; |
| | | |
| | | var i; |
| | | if (typeof val === 'number') { |
| | | for (i = start; i < end; ++i) { |
| | | this[i] = val; |
| | | } |
| | | } else { |
| | | var bytes = internalIsBuffer(val) |
| | | ? val |
| | | : utf8ToBytes(new Buffer$1(val, encoding).toString()); |
| | | var len = bytes.length; |
| | | for (i = 0; i < end - start; ++i) { |
| | | this[i + start] = bytes[i % len]; |
| | | } |
| | | } |
| | | |
| | | return this |
| | | }; |
| | | |
| | | // HELPER FUNCTIONS |
| | | // ================ |
| | | |
| | | var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g; |
| | | |
| | | function base64clean (str) { |
| | | // Node strips out invalid characters like \n and \t from the string, base64-js does not |
| | | str = stringtrim(str).replace(INVALID_BASE64_RE, ''); |
| | | // Node converts strings with length < 2 to '' |
| | | if (str.length < 2) return '' |
| | | // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not |
| | | while (str.length % 4 !== 0) { |
| | | str = str + '='; |
| | | } |
| | | return str |
| | | } |
| | | |
| | | function stringtrim (str) { |
| | | if (str.trim) return str.trim() |
| | | return str.replace(/^\s+|\s+$/g, '') |
| | | } |
| | | |
| | | function toHex (n) { |
| | | if (n < 16) return '0' + n.toString(16) |
| | | return n.toString(16) |
| | | } |
| | | |
| | | function utf8ToBytes (string, units) { |
| | | units = units || Infinity; |
| | | var codePoint; |
| | | var length = string.length; |
| | | var leadSurrogate = null; |
| | | var bytes = []; |
| | | |
| | | for (var i = 0; i < length; ++i) { |
| | | codePoint = string.charCodeAt(i); |
| | | |
| | | // is surrogate component |
| | | if (codePoint > 0xD7FF && codePoint < 0xE000) { |
| | | // last char was a lead |
| | | if (!leadSurrogate) { |
| | | // no lead yet |
| | | if (codePoint > 0xDBFF) { |
| | | // unexpected trail |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | continue |
| | | } else if (i + 1 === length) { |
| | | // unpaired lead |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | continue |
| | | } |
| | | |
| | | // valid lead |
| | | leadSurrogate = codePoint; |
| | | |
| | | continue |
| | | } |
| | | |
| | | // 2 leads in a row |
| | | if (codePoint < 0xDC00) { |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | leadSurrogate = codePoint; |
| | | continue |
| | | } |
| | | |
| | | // valid surrogate pair |
| | | codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000; |
| | | } else if (leadSurrogate) { |
| | | // valid bmp char, but last char was a lead |
| | | if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); |
| | | } |
| | | |
| | | leadSurrogate = null; |
| | | |
| | | // encode utf8 |
| | | if (codePoint < 0x80) { |
| | | if ((units -= 1) < 0) break |
| | | bytes.push(codePoint); |
| | | } else if (codePoint < 0x800) { |
| | | if ((units -= 2) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0x6 | 0xC0, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else if (codePoint < 0x10000) { |
| | | if ((units -= 3) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0xC | 0xE0, |
| | | codePoint >> 0x6 & 0x3F | 0x80, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else if (codePoint < 0x110000) { |
| | | if ((units -= 4) < 0) break |
| | | bytes.push( |
| | | codePoint >> 0x12 | 0xF0, |
| | | codePoint >> 0xC & 0x3F | 0x80, |
| | | codePoint >> 0x6 & 0x3F | 0x80, |
| | | codePoint & 0x3F | 0x80 |
| | | ); |
| | | } else { |
| | | throw new Error('Invalid code point') |
| | | } |
| | | } |
| | | |
| | | return bytes |
| | | } |
| | | |
| | | function asciiToBytes (str) { |
| | | var byteArray = []; |
| | | for (var i = 0; i < str.length; ++i) { |
| | | // Node's code seems to be doing this and not & 0x7F.. |
| | | byteArray.push(str.charCodeAt(i) & 0xFF); |
| | | } |
| | | return byteArray |
| | | } |
| | | |
| | | function utf16leToBytes (str, units) { |
| | | var c, hi, lo; |
| | | var byteArray = []; |
| | | for (var i = 0; i < str.length; ++i) { |
| | | if ((units -= 2) < 0) break |
| | | |
| | | c = str.charCodeAt(i); |
| | | hi = c >> 8; |
| | | lo = c % 256; |
| | | byteArray.push(lo); |
| | | byteArray.push(hi); |
| | | } |
| | | |
| | | return byteArray |
| | | } |
| | | |
| | | |
| | | function base64ToBytes (str) { |
| | | return toByteArray(base64clean(str)) |
| | | } |
| | | |
| | | function blitBuffer (src, dst, offset, length) { |
| | | for (var i = 0; i < length; ++i) { |
| | | if ((i + offset >= dst.length) || (i >= src.length)) break |
| | | dst[i + offset] = src[i]; |
| | | } |
| | | return i |
| | | } |
| | | |
| | | function isnan (val) { |
| | | return val !== val // eslint-disable-line no-self-compare |
| | | } |
| | | |
| | | |
| | | // the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence |
| | | // The _isBuffer check is for Safari 5-7 support, because it's missing |
| | | // Object.prototype.constructor. Remove this eventually |
| | | function isBuffer$1(obj) { |
| | | return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj)) |
| | | } |
| | | |
| | | function isFastBuffer (obj) { |
| | | return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj) |
| | | } |
| | | |
| | | // For Node v0.10 support. Remove this eventually. |
| | | function isSlowBuffer (obj) { |
| | | return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0)) |
| | | } |
| | | |
| | | var inherits; |
| | |
| | | |
| | | function isRelativeUrl(url) { |
| | | const firstChar = url.charAt(0); |
| | | return firstChar === "." || firstChar === "~" || firstChar === "@"; |
| | | return firstChar === "." || firstChar === "~" || firstChar === "@" || firstChar === "#"; |
| | | } |
| | | const externalRE = /^(?:https?:)?\/\//; |
| | | function isExternalUrl(url) { |
| | |
| | | const dataUrlRE = /^\s*data:/i; |
| | | function isDataUrl(url) { |
| | | return dataUrlRE.test(url); |
| | | } |
| | | function normalizeDecodedImportPath(source) { |
| | | try { |
| | | return decodeURIComponent(source); |
| | | } catch (e) { |
| | | return source; |
| | | } |
| | | } |
| | | function parseUrl(url) { |
| | | const firstChar = url.charAt(0); |
| | |
| | | return a; |
| | | }; |
| | | var __spreadProps$8 = (a, b) => __defProps$8(a, __getOwnPropDescs$8(b)); |
| | | const resourceUrlTagConfig = { |
| | | video: ["src", "poster"], |
| | | source: ["src"], |
| | | img: ["src"], |
| | | image: ["xlink:href", "href"] |
| | | }; |
| | | const defaultAssetUrlOptions = { |
| | | base: null, |
| | | includeAbsolute: false, |
| | | tags: { |
| | | video: ["src", "poster"], |
| | | source: ["src"], |
| | | img: ["src"], |
| | | image: ["xlink:href", "href"], |
| | | tags: __spreadProps$8(__spreadValues$9({}, resourceUrlTagConfig), { |
| | | use: ["xlink:href", "href"] |
| | | } |
| | | }) |
| | | }; |
| | | const normalizeOptions = (options) => { |
| | | if (Object.keys(options).some((key) => isArray$3(options[key]))) { |
| | |
| | | const createAssetUrlTransformWithOptions = (options) => { |
| | | return (node, context) => transformAssetUrl(node, context, options); |
| | | }; |
| | | function canTransformHashImport(tag, attrName) { |
| | | var _a; |
| | | return !!((_a = resourceUrlTagConfig[tag]) == null ? void 0 : _a.includes(attrName)); |
| | | } |
| | | const transformAssetUrl = (node, context, options = defaultAssetUrlOptions) => { |
| | | if (node.type === 1) { |
| | | if (!node.props.length) { |
| | |
| | | } |
| | | const assetAttrs = (attrs || []).concat(wildCardAttrs || []); |
| | | node.props.forEach((attr, index) => { |
| | | if (attr.type !== 6 || !assetAttrs.includes(attr.name) || !attr.value || isExternalUrl(attr.value.content) || isDataUrl(attr.value.content) || attr.value.content[0] === "#" || !options.includeAbsolute && !isRelativeUrl(attr.value.content)) { |
| | | if (attr.type !== 6 || !assetAttrs.includes(attr.name) || !attr.value) { |
| | | return; |
| | | } |
| | | const url = parseUrl(attr.value.content); |
| | | if (options.base && attr.value.content[0] === ".") { |
| | | const urlValue = attr.value.content; |
| | | const isHashOnlyValue = urlValue[0] === "#"; |
| | | if (isExternalUrl(urlValue) || isDataUrl(urlValue) || isHashOnlyValue && !canTransformHashImport(node.tag, attr.name) || !options.includeAbsolute && !isRelativeUrl(urlValue)) { |
| | | return; |
| | | } |
| | | const url = parseUrl(urlValue); |
| | | if (options.base && urlValue[0] === ".") { |
| | | const base = parseUrl(options.base); |
| | | const protocol = base.protocol || ""; |
| | | const host = base.host ? protocol + "//" + base.host : ""; |
| | |
| | | }); |
| | | } |
| | | }; |
| | | function resolveOrRegisterImport(source, loc, context) { |
| | | const normalizedSource = normalizeDecodedImportPath(source); |
| | | const existingIndex = context.imports.findIndex( |
| | | (i) => i.path === normalizedSource |
| | | ); |
| | | if (existingIndex > -1) { |
| | | return { |
| | | name: `_imports_${existingIndex}`, |
| | | exp: context.imports[existingIndex].exp |
| | | }; |
| | | } |
| | | const name = `_imports_${context.imports.length}`; |
| | | const exp = createSimpleExpression( |
| | | name, |
| | | false, |
| | | loc, |
| | | 3 |
| | | ); |
| | | context.imports.push({ |
| | | exp, |
| | | path: normalizedSource |
| | | }); |
| | | return { name, exp }; |
| | | } |
| | | function getImportsExpressionExp(path2, hash, loc, context) { |
| | | if (path2) { |
| | | let name; |
| | | let exp; |
| | | const existingIndex = context.imports.findIndex((i) => i.path === path2); |
| | | if (existingIndex > -1) { |
| | | name = `_imports_${existingIndex}`; |
| | | exp = context.imports[existingIndex].exp; |
| | | } else { |
| | | name = `_imports_${context.imports.length}`; |
| | | exp = createSimpleExpression( |
| | | name, |
| | | false, |
| | | loc, |
| | | 3 |
| | | ); |
| | | context.imports.push({ |
| | | exp, |
| | | path: decodeURIComponent(path2) |
| | | }); |
| | | } |
| | | if (!hash) { |
| | | return exp; |
| | | } |
| | | const hashExp = `${name} + '${hash}'`; |
| | | const finalExp = createSimpleExpression( |
| | | hashExp, |
| | | if (!path2 && !hash) { |
| | | return createSimpleExpression(`''`, false, loc, 3); |
| | | } |
| | | if (!path2 && hash) { |
| | | const { exp } = resolveOrRegisterImport(hash, loc, context); |
| | | return exp; |
| | | } |
| | | if (path2 && !hash) { |
| | | const { exp } = resolveOrRegisterImport(path2, loc, context); |
| | | return exp; |
| | | } |
| | | const { name } = resolveOrRegisterImport(path2, loc, context); |
| | | const hashExp = `${name} + '${hash}'`; |
| | | const finalExp = createSimpleExpression( |
| | | hashExp, |
| | | false, |
| | | loc, |
| | | 3 |
| | | ); |
| | | if (!context.hoistStatic) { |
| | | return finalExp; |
| | | } |
| | | const existingHoistIndex = context.hoists.findIndex((h) => { |
| | | return h && h.type === 4 && !h.isStatic && h.content === hashExp; |
| | | }); |
| | | if (existingHoistIndex > -1) { |
| | | return createSimpleExpression( |
| | | `_hoisted_${existingHoistIndex + 1}`, |
| | | false, |
| | | loc, |
| | | 3 |
| | | ); |
| | | if (!context.hoistStatic) { |
| | | return finalExp; |
| | | } |
| | | const existingHoistIndex = context.hoists.findIndex((h) => { |
| | | return h && h.type === 4 && !h.isStatic && h.content === hashExp; |
| | | }); |
| | | if (existingHoistIndex > -1) { |
| | | return createSimpleExpression( |
| | | `_hoisted_${existingHoistIndex + 1}`, |
| | | false, |
| | | loc, |
| | | 3 |
| | | ); |
| | | } |
| | | return context.hoist(finalExp); |
| | | } else { |
| | | return createSimpleExpression(`''`, false, loc, 3); |
| | | } |
| | | return context.hoist(finalExp); |
| | | } |
| | | |
| | | const srcsetTags = ["img", "source"]; |
| | |
| | | const compoundExpression = createCompoundExpression([], attr.loc); |
| | | imageCandidates.forEach(({ url, descriptor }, index2) => { |
| | | if (shouldProcessUrl(url)) { |
| | | const { path: path2 } = parseUrl(url); |
| | | let exp2; |
| | | if (path2) { |
| | | const { path: path2, hash } = parseUrl(url); |
| | | const source = path2 ? path2 : hash; |
| | | if (source) { |
| | | const normalizedSource = normalizeDecodedImportPath(source); |
| | | const existingImportsIndex = context.imports.findIndex( |
| | | (i) => i.path === path2 |
| | | (i) => i.path === normalizedSource |
| | | ); |
| | | let exp2; |
| | | if (existingImportsIndex > -1) { |
| | | exp2 = createSimpleExpression( |
| | | `_imports_${existingImportsIndex}`, |
| | |
| | | attr.loc, |
| | | 3 |
| | | ); |
| | | context.imports.push({ exp: exp2, path: path2 }); |
| | | context.imports.push({ exp: exp2, path: normalizedSource }); |
| | | } |
| | | if (path2 && hash) { |
| | | exp2 = createSimpleExpression( |
| | | `${exp2.content} + '${hash}'`, |
| | | false, |
| | | attr.loc, |
| | | 3 |
| | | ); |
| | | } |
| | | compoundExpression.children.push(exp2); |
| | | } |
| | |
| | | } |
| | | }; |
| | | |
| | | const SSR_INTERPOLATE = Symbol(`ssrInterpolate`); |
| | | const SSR_RENDER_VNODE = Symbol(`ssrRenderVNode`); |
| | | const SSR_RENDER_COMPONENT = Symbol(`ssrRenderComponent`); |
| | | const SSR_RENDER_SLOT = Symbol(`ssrRenderSlot`); |
| | | const SSR_RENDER_SLOT_INNER = Symbol(`ssrRenderSlotInner`); |
| | | const SSR_RENDER_CLASS = Symbol(`ssrRenderClass`); |
| | | const SSR_RENDER_STYLE = Symbol(`ssrRenderStyle`); |
| | | const SSR_RENDER_ATTRS = Symbol(`ssrRenderAttrs`); |
| | | const SSR_RENDER_ATTR = Symbol(`ssrRenderAttr`); |
| | | const SSR_RENDER_DYNAMIC_ATTR = Symbol(`ssrRenderDynamicAttr`); |
| | | const SSR_RENDER_LIST = Symbol(`ssrRenderList`); |
| | | const SSR_INCLUDE_BOOLEAN_ATTR = Symbol( |
| | | const SSR_INTERPOLATE = /* @__PURE__ */ Symbol(`ssrInterpolate`); |
| | | const SSR_RENDER_VNODE = /* @__PURE__ */ Symbol(`ssrRenderVNode`); |
| | | const SSR_RENDER_COMPONENT = /* @__PURE__ */ Symbol(`ssrRenderComponent`); |
| | | const SSR_RENDER_SLOT = /* @__PURE__ */ Symbol(`ssrRenderSlot`); |
| | | const SSR_RENDER_SLOT_INNER = /* @__PURE__ */ Symbol(`ssrRenderSlotInner`); |
| | | const SSR_RENDER_CLASS = /* @__PURE__ */ Symbol(`ssrRenderClass`); |
| | | const SSR_RENDER_STYLE = /* @__PURE__ */ Symbol(`ssrRenderStyle`); |
| | | const SSR_RENDER_ATTRS = /* @__PURE__ */ Symbol(`ssrRenderAttrs`); |
| | | const SSR_RENDER_ATTR = /* @__PURE__ */ Symbol(`ssrRenderAttr`); |
| | | const SSR_RENDER_DYNAMIC_ATTR = /* @__PURE__ */ Symbol(`ssrRenderDynamicAttr`); |
| | | const SSR_RENDER_LIST = /* @__PURE__ */ Symbol(`ssrRenderList`); |
| | | const SSR_INCLUDE_BOOLEAN_ATTR = /* @__PURE__ */ Symbol( |
| | | `ssrIncludeBooleanAttr` |
| | | ); |
| | | const SSR_LOOSE_EQUAL = Symbol(`ssrLooseEqual`); |
| | | const SSR_LOOSE_CONTAIN = Symbol(`ssrLooseContain`); |
| | | const SSR_RENDER_DYNAMIC_MODEL = Symbol( |
| | | const SSR_LOOSE_EQUAL = /* @__PURE__ */ Symbol(`ssrLooseEqual`); |
| | | const SSR_LOOSE_CONTAIN = /* @__PURE__ */ Symbol(`ssrLooseContain`); |
| | | const SSR_RENDER_DYNAMIC_MODEL = /* @__PURE__ */ Symbol( |
| | | `ssrRenderDynamicModel` |
| | | ); |
| | | const SSR_GET_DYNAMIC_MODEL_PROPS = Symbol( |
| | | const SSR_GET_DYNAMIC_MODEL_PROPS = /* @__PURE__ */ Symbol( |
| | | `ssrGetDynamicModelProps` |
| | | ); |
| | | const SSR_RENDER_TELEPORT = Symbol(`ssrRenderTeleport`); |
| | | const SSR_RENDER_SUSPENSE = Symbol(`ssrRenderSuspense`); |
| | | const SSR_GET_DIRECTIVE_PROPS = Symbol(`ssrGetDirectiveProps`); |
| | | const SSR_RENDER_TELEPORT = /* @__PURE__ */ Symbol(`ssrRenderTeleport`); |
| | | const SSR_RENDER_SUSPENSE = /* @__PURE__ */ Symbol(`ssrRenderSuspense`); |
| | | const SSR_GET_DIRECTIVE_PROPS = /* @__PURE__ */ Symbol(`ssrGetDirectiveProps`); |
| | | const ssrHelpers = { |
| | | [SSR_INTERPOLATE]: `ssrInterpolate`, |
| | | [SSR_RENDER_VNODE]: `ssrRenderVNode`, |
| | |
| | | }; |
| | | var __spreadProps$7 = (a, b) => __defProps$7(a, __getOwnPropDescs$7(b)); |
| | | const wipMap = /* @__PURE__ */ new WeakMap(); |
| | | const WIP_SLOT = Symbol(); |
| | | const WIP_SLOT = /* @__PURE__ */ Symbol(); |
| | | const componentTypeMap = /* @__PURE__ */ new WeakMap(); |
| | | const ssrTransformComponent = (node, context) => { |
| | | if (node.type !== 1 || node.tagType !== 1) { |
| | |
| | | if (value) { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 60, |
| | | 61, |
| | | value.loc |
| | | ) |
| | | ); |
| | |
| | | case "file": |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 59, |
| | | 60, |
| | | dir.loc |
| | | ) |
| | | ); |
| | |
| | | } else { |
| | | context.onError( |
| | | createDOMCompilerError( |
| | | 57, |
| | | 58, |
| | | dir.loc |
| | | ) |
| | | ); |
| | |
| | | const ssrTransformShow = (dir, node, context) => { |
| | | if (!dir.exp) { |
| | | context.onError( |
| | | createDOMCompilerError(61) |
| | | createDOMCompilerError(62) |
| | | ); |
| | | } |
| | | return { |
| | |
| | | }; |
| | | }; |
| | | |
| | | const filterChild = (node) => node.children.filter((n) => n.type !== 3); |
| | | const filterChild = (node) => node.children.filter((n) => !isCommentOrWhitespace(n)); |
| | | const hasSingleChild = (node) => filterChild(node).length === 1; |
| | | const ssrInjectFallthroughAttrs = (node, context) => { |
| | | if (node.type === 0) { |
| | |
| | | } |
| | | } |
| | | } else if (this.css) { |
| | | this.css = this.css.replace(/\n*\/\*#[\S\s]*?\*\/$/gm, ''); |
| | | let startIndex; |
| | | while ((startIndex = this.css.lastIndexOf('/*#')) !== -1) { |
| | | let endIndex = this.css.indexOf('*/', startIndex + 3); |
| | | if (endIndex === -1) break |
| | | while (startIndex > 0 && this.css[startIndex - 1] === '\n') { |
| | | startIndex--; |
| | | } |
| | | this.css = this.css.slice(0, startIndex) + this.css.slice(endIndex + 2); |
| | | } |
| | | } |
| | | } |
| | | |
| | |
| | | node.source.end.offset++; |
| | | |
| | | let text = token[1].slice(2, -2); |
| | | if (/^\s*$/.test(text)) { |
| | | if (!text.trim()) { |
| | | node.text = ''; |
| | | node.raws.left = text; |
| | | node.raws.right = ''; |
| | |
| | | this._css = css; |
| | | this._opts = opts; |
| | | this._map = undefined; |
| | | let root; |
| | | |
| | | let str = stringify; |
| | | this.result = new Result(this._processor, root, this._opts); |
| | | this.result = new Result(this._processor, undefined, this._opts); |
| | | this.result.css = css; |
| | | |
| | | let self = this; |
| | |
| | | } |
| | | }); |
| | | |
| | | let map = new MapGenerator(str, root, this._opts, css); |
| | | let map = new MapGenerator(str, undefined, this._opts, css); |
| | | if (map.isMap()) { |
| | | let [generatedCSS, generatedMap] = map.generate(); |
| | | if (generatedCSS) { |
| | |
| | | |
| | | class Processor { |
| | | constructor(plugins = []) { |
| | | this.version = '8.5.6'; |
| | | this.version = '8.5.8'; |
| | | this.plugins = this.normalize(plugins); |
| | | } |
| | | |
| | |
| | | function requireUnesc () { |
| | | if (hasRequiredUnesc) return unesc.exports; |
| | | hasRequiredUnesc = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = unesc; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = unesc; |
| | | // Many thanks for this post which made this migration much easier. |
| | | // https://mathiasbynens.be/notes/css-escapes |
| | | |
| | |
| | | } |
| | | return ret; |
| | | } |
| | | module.exports = exports.default; |
| | | module.exports = exports$1.default; |
| | | } (unesc, unesc.exports)); |
| | | return unesc.exports; |
| | | } |
| | |
| | | function requireGetProp () { |
| | | if (hasRequiredGetProp) return getProp.exports; |
| | | hasRequiredGetProp = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = getProp; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = getProp; |
| | | function getProp(obj) { |
| | | for (var _len = arguments.length, props = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) { |
| | | props[_key - 1] = arguments[_key]; |
| | |
| | | } |
| | | return obj; |
| | | } |
| | | module.exports = exports.default; |
| | | module.exports = exports$1.default; |
| | | } (getProp, getProp.exports)); |
| | | return getProp.exports; |
| | | } |
| | |
| | | function requireEnsureObject () { |
| | | if (hasRequiredEnsureObject) return ensureObject.exports; |
| | | hasRequiredEnsureObject = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = ensureObject; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = ensureObject; |
| | | function ensureObject(obj) { |
| | | for (var _len = arguments.length, props = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) { |
| | | props[_key - 1] = arguments[_key]; |
| | |
| | | obj = obj[prop]; |
| | | } |
| | | } |
| | | module.exports = exports.default; |
| | | module.exports = exports$1.default; |
| | | } (ensureObject, ensureObject.exports)); |
| | | return ensureObject.exports; |
| | | } |
| | |
| | | function requireStripComments () { |
| | | if (hasRequiredStripComments) return stripComments.exports; |
| | | hasRequiredStripComments = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = stripComments; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = stripComments; |
| | | function stripComments(str) { |
| | | var s = ""; |
| | | var commentStart = str.indexOf("/*"); |
| | |
| | | s = s + str.slice(lastEnd); |
| | | return s; |
| | | } |
| | | module.exports = exports.default; |
| | | module.exports = exports$1.default; |
| | | } (stripComments, stripComments.exports)); |
| | | return stripComments.exports; |
| | | } |
| | |
| | | function requireNode$1 () { |
| | | if (hasRequiredNode$1) return node$1.exports; |
| | | hasRequiredNode$1 = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _util = /*@__PURE__*/ requireUtil$1(); |
| | | function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } |
| | | function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; } |
| | |
| | | }]); |
| | | return Node; |
| | | }(); |
| | | exports["default"] = Node; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Node; |
| | | module.exports = exports$1.default; |
| | | } (node$1, node$1.exports)); |
| | | return node$1.exports; |
| | | } |
| | |
| | | function requireContainer () { |
| | | if (hasRequiredContainer) return container.exports; |
| | | hasRequiredContainer = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var types = _interopRequireWildcard(/*@__PURE__*/ requireTypes()); |
| | | function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); } |
| | |
| | | }]); |
| | | return Container; |
| | | }(_node["default"]); |
| | | exports["default"] = Container; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Container; |
| | | module.exports = exports$1.default; |
| | | } (container, container.exports)); |
| | | return container.exports; |
| | | } |
| | |
| | | function requireRoot () { |
| | | if (hasRequiredRoot) return root.exports; |
| | | hasRequiredRoot = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _container = _interopRequireDefault(/*@__PURE__*/ requireContainer()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | }]); |
| | | return Root; |
| | | }(_container["default"]); |
| | | exports["default"] = Root; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Root; |
| | | module.exports = exports$1.default; |
| | | } (root, root.exports)); |
| | | return root.exports; |
| | | } |
| | |
| | | function requireSelector () { |
| | | if (hasRequiredSelector) return selector.exports; |
| | | hasRequiredSelector = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _container = _interopRequireDefault(/*@__PURE__*/ requireContainer()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Selector; |
| | | }(_container["default"]); |
| | | exports["default"] = Selector; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Selector; |
| | | module.exports = exports$1.default; |
| | | } (selector, selector.exports)); |
| | | return selector.exports; |
| | | } |
| | |
| | | function requireClassName () { |
| | | if (hasRequiredClassName) return className.exports; |
| | | hasRequiredClassName = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _cssesc = _interopRequireDefault(/*@__PURE__*/ requireCssesc()); |
| | | var _util = /*@__PURE__*/ requireUtil$1(); |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | |
| | | }]); |
| | | return ClassName; |
| | | }(_node["default"]); |
| | | exports["default"] = ClassName; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = ClassName; |
| | | module.exports = exports$1.default; |
| | | } (className, className.exports)); |
| | | return className.exports; |
| | | } |
| | |
| | | function requireComment () { |
| | | if (hasRequiredComment) return comment.exports; |
| | | hasRequiredComment = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Comment; |
| | | }(_node["default"]); |
| | | exports["default"] = Comment; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Comment; |
| | | module.exports = exports$1.default; |
| | | } (comment, comment.exports)); |
| | | return comment.exports; |
| | | } |
| | |
| | | function requireId () { |
| | | if (hasRequiredId) return id.exports; |
| | | hasRequiredId = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | }; |
| | | return ID; |
| | | }(_node["default"]); |
| | | exports["default"] = ID; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = ID; |
| | | module.exports = exports$1.default; |
| | | } (id, id.exports)); |
| | | return id.exports; |
| | | } |
| | |
| | | function requireNamespace () { |
| | | if (hasRequiredNamespace) return namespace.exports; |
| | | hasRequiredNamespace = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _cssesc = _interopRequireDefault(/*@__PURE__*/ requireCssesc()); |
| | | var _util = /*@__PURE__*/ requireUtil$1(); |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | |
| | | }]); |
| | | return Namespace; |
| | | }(_node["default"]); |
| | | exports["default"] = Namespace; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Namespace; |
| | | module.exports = exports$1.default; |
| | | } (namespace, namespace.exports)); |
| | | return namespace.exports; |
| | | } |
| | |
| | | function requireTag () { |
| | | if (hasRequiredTag) return tag.exports; |
| | | hasRequiredTag = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _namespace = _interopRequireDefault(/*@__PURE__*/ requireNamespace()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Tag; |
| | | }(_namespace["default"]); |
| | | exports["default"] = Tag; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Tag; |
| | | module.exports = exports$1.default; |
| | | } (tag, tag.exports)); |
| | | return tag.exports; |
| | | } |
| | |
| | | function requireString () { |
| | | if (hasRequiredString) return string.exports; |
| | | hasRequiredString = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return String; |
| | | }(_node["default"]); |
| | | exports["default"] = String; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = String; |
| | | module.exports = exports$1.default; |
| | | } (string, string.exports)); |
| | | return string.exports; |
| | | } |
| | |
| | | function requirePseudo () { |
| | | if (hasRequiredPseudo) return pseudo.exports; |
| | | hasRequiredPseudo = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _container = _interopRequireDefault(/*@__PURE__*/ requireContainer()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | }; |
| | | return Pseudo; |
| | | }(_container["default"]); |
| | | exports["default"] = Pseudo; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Pseudo; |
| | | module.exports = exports$1.default; |
| | | } (pseudo, pseudo.exports)); |
| | | return pseudo.exports; |
| | | } |
| | |
| | | function requireAttribute () { |
| | | if (hasRequiredAttribute) return attribute; |
| | | hasRequiredAttribute = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports.unescapeValue = unescapeValue; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | exports$1.unescapeValue = unescapeValue; |
| | | var _cssesc = _interopRequireDefault(/*@__PURE__*/ requireCssesc()); |
| | | var _unesc = _interopRequireDefault(/*@__PURE__*/ requireUnesc()); |
| | | var _namespace = _interopRequireDefault(/*@__PURE__*/ requireNamespace()); |
| | |
| | | }]); |
| | | return Attribute; |
| | | }(_namespace["default"]); |
| | | exports["default"] = Attribute; |
| | | exports$1["default"] = Attribute; |
| | | Attribute.NO_QUOTE = null; |
| | | Attribute.SINGLE_QUOTE = "'"; |
| | | Attribute.DOUBLE_QUOTE = '"'; |
| | |
| | | function requireUniversal () { |
| | | if (hasRequiredUniversal) return universal.exports; |
| | | hasRequiredUniversal = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _namespace = _interopRequireDefault(/*@__PURE__*/ requireNamespace()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Universal; |
| | | }(_namespace["default"]); |
| | | exports["default"] = Universal; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Universal; |
| | | module.exports = exports$1.default; |
| | | } (universal, universal.exports)); |
| | | return universal.exports; |
| | | } |
| | |
| | | function requireCombinator () { |
| | | if (hasRequiredCombinator) return combinator.exports; |
| | | hasRequiredCombinator = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Combinator; |
| | | }(_node["default"]); |
| | | exports["default"] = Combinator; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Combinator; |
| | | module.exports = exports$1.default; |
| | | } (combinator, combinator.exports)); |
| | | return combinator.exports; |
| | | } |
| | |
| | | function requireNesting () { |
| | | if (hasRequiredNesting) return nesting.exports; |
| | | hasRequiredNesting = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _node = _interopRequireDefault(/*@__PURE__*/ requireNode$1()); |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | |
| | | } |
| | | return Nesting; |
| | | }(_node["default"]); |
| | | exports["default"] = Nesting; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Nesting; |
| | | module.exports = exports$1.default; |
| | | } (nesting, nesting.exports)); |
| | | return nesting.exports; |
| | | } |
| | |
| | | function requireSortAscending () { |
| | | if (hasRequiredSortAscending) return sortAscending.exports; |
| | | hasRequiredSortAscending = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = sortAscending; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = sortAscending; |
| | | function sortAscending(list) { |
| | | return list.sort(function (a, b) { |
| | | return a - b; |
| | | }); |
| | | } |
| | | module.exports = exports.default; |
| | | module.exports = exports$1.default; |
| | | } (sortAscending, sortAscending.exports)); |
| | | return sortAscending.exports; |
| | | } |
| | |
| | | function requireTokenize () { |
| | | if (hasRequiredTokenize) return tokenize; |
| | | hasRequiredTokenize = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports.FIELDS = void 0; |
| | | exports["default"] = tokenize; |
| | | exports$1.__esModule = true; |
| | | exports$1.FIELDS = void 0; |
| | | exports$1["default"] = tokenize; |
| | | var t = _interopRequireWildcard(/*@__PURE__*/ requireTokenTypes()); |
| | | var _unescapable, _wordDelimiters; |
| | | function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); } |
| | |
| | | START_POS: 5, |
| | | END_POS: 6 |
| | | }; |
| | | exports.FIELDS = FIELDS; |
| | | exports$1.FIELDS = FIELDS; |
| | | function tokenize(input) { |
| | | var tokens = []; |
| | | var css = input.css.valueOf(); |
| | |
| | | function requireParser () { |
| | | if (hasRequiredParser) return parser.exports; |
| | | hasRequiredParser = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _root = _interopRequireDefault(/*@__PURE__*/ requireRoot()); |
| | | var _selector = _interopRequireDefault(/*@__PURE__*/ requireSelector()); |
| | | var _className = _interopRequireDefault(/*@__PURE__*/ requireClassName()); |
| | |
| | | if (_space2.endsWith(' ') && _rawSpace2.endsWith(' ')) { |
| | | spaces.before = _space2.slice(0, _space2.length - 1); |
| | | raws.spaces.before = _rawSpace2.slice(0, _rawSpace2.length - 1); |
| | | } else if (_space2.startsWith(' ') && _rawSpace2.startsWith(' ')) { |
| | | } else if (_space2[0] === ' ' && _rawSpace2[0] === ' ') { |
| | | spaces.after = _space2.slice(1); |
| | | raws.spaces.after = _rawSpace2.slice(1); |
| | | } else { |
| | |
| | | }]); |
| | | return Parser; |
| | | }(); |
| | | exports["default"] = Parser; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Parser; |
| | | module.exports = exports$1.default; |
| | | } (parser, parser.exports)); |
| | | return parser.exports; |
| | | } |
| | |
| | | function requireProcessor () { |
| | | if (hasRequiredProcessor) return processor.exports; |
| | | hasRequiredProcessor = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _parser = _interopRequireDefault(/*@__PURE__*/ requireParser()); |
| | | function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } |
| | | var Processor = /*#__PURE__*/function () { |
| | |
| | | }; |
| | | return Processor; |
| | | }(); |
| | | exports["default"] = Processor; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = Processor; |
| | | module.exports = exports$1.default; |
| | | } (processor, processor.exports)); |
| | | return processor.exports; |
| | | } |
| | |
| | | function requireSelectors () { |
| | | if (hasRequiredSelectors) return selectors; |
| | | hasRequiredSelectors = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports$1.__esModule = true; |
| | | var _types = /*@__PURE__*/ requireTypes(); |
| | | Object.keys(_types).forEach(function (key) { |
| | | if (key === "default" || key === "__esModule") return; |
| | | if (key in exports && exports[key] === _types[key]) return; |
| | | exports[key] = _types[key]; |
| | | if (key in exports$1 && exports$1[key] === _types[key]) return; |
| | | exports$1[key] = _types[key]; |
| | | }); |
| | | var _constructors = /*@__PURE__*/ requireConstructors(); |
| | | Object.keys(_constructors).forEach(function (key) { |
| | | if (key === "default" || key === "__esModule") return; |
| | | if (key in exports && exports[key] === _constructors[key]) return; |
| | | exports[key] = _constructors[key]; |
| | | if (key in exports$1 && exports$1[key] === _constructors[key]) return; |
| | | exports$1[key] = _constructors[key]; |
| | | }); |
| | | var _guards = /*@__PURE__*/ requireGuards(); |
| | | Object.keys(_guards).forEach(function (key) { |
| | | if (key === "default" || key === "__esModule") return; |
| | | if (key in exports && exports[key] === _guards[key]) return; |
| | | exports[key] = _guards[key]; |
| | | if (key in exports$1 && exports$1[key] === _guards[key]) return; |
| | | exports$1[key] = _guards[key]; |
| | | }); |
| | | } (selectors)); |
| | | return selectors; |
| | |
| | | function requireDist () { |
| | | if (hasRequiredDist) return dist.exports; |
| | | hasRequiredDist = 1; |
| | | (function (module, exports) { |
| | | (function (module, exports$1) { |
| | | |
| | | exports.__esModule = true; |
| | | exports["default"] = void 0; |
| | | exports$1.__esModule = true; |
| | | exports$1["default"] = void 0; |
| | | var _processor = _interopRequireDefault(/*@__PURE__*/ requireProcessor()); |
| | | var selectors = _interopRequireWildcard(/*@__PURE__*/ requireSelectors()); |
| | | function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); } |
| | |
| | | Object.assign(parser, selectors); |
| | | delete parser.__esModule; |
| | | var _default = parser; |
| | | exports["default"] = _default; |
| | | module.exports = exports.default; |
| | | exports$1["default"] = _default; |
| | | module.exports = exports$1.default; |
| | | } (dist, dist.exports)); |
| | | return dist.exports; |
| | | } |
| | |
| | | function requireUtil () { |
| | | if (hasRequiredUtil) return util; |
| | | hasRequiredUtil = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | /* |
| | | * Copyright 2011 Mozilla Foundation and contributors |
| | | * Licensed under the New BSD license. See LICENSE or: |
| | |
| | | throw new Error('"' + aName + '" is a required argument.'); |
| | | } |
| | | } |
| | | exports.getArg = getArg; |
| | | exports$1.getArg = getArg; |
| | | |
| | | var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/; |
| | | var dataUrlRegexp = /^data:.+\,.+$/; |
| | |
| | | path: match[5] |
| | | }; |
| | | } |
| | | exports.urlParse = urlParse; |
| | | exports$1.urlParse = urlParse; |
| | | |
| | | function urlGenerate(aParsedUrl) { |
| | | var url = ''; |
| | |
| | | } |
| | | return url; |
| | | } |
| | | exports.urlGenerate = urlGenerate; |
| | | exports$1.urlGenerate = urlGenerate; |
| | | |
| | | /** |
| | | * Normalizes a path, or the path portion of a URL: |
| | |
| | | } |
| | | path = url.path; |
| | | } |
| | | var isAbsolute = exports.isAbsolute(path); |
| | | var isAbsolute = exports$1.isAbsolute(path); |
| | | |
| | | var parts = path.split(/\/+/); |
| | | for (var part, up = 0, i = parts.length - 1; i >= 0; i--) { |
| | |
| | | } |
| | | return path; |
| | | } |
| | | exports.normalize = normalize; |
| | | exports$1.normalize = normalize; |
| | | |
| | | /** |
| | | * Joins two paths/URLs. |
| | |
| | | } |
| | | return joined; |
| | | } |
| | | exports.join = join; |
| | | exports$1.join = join; |
| | | |
| | | exports.isAbsolute = function (aPath) { |
| | | exports$1.isAbsolute = function (aPath) { |
| | | return aPath.charAt(0) === '/' || urlRegexp.test(aPath); |
| | | }; |
| | | |
| | |
| | | // Make sure we add a "../" for each component we removed from the root. |
| | | return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1); |
| | | } |
| | | exports.relative = relative; |
| | | exports$1.relative = relative; |
| | | |
| | | var supportsNullProto = (function () { |
| | | var obj = Object.create(null); |
| | |
| | | |
| | | return aStr; |
| | | } |
| | | exports.toSetString = supportsNullProto ? identity : toSetString; |
| | | exports$1.toSetString = supportsNullProto ? identity : toSetString; |
| | | |
| | | function fromSetString(aStr) { |
| | | if (isProtoString(aStr)) { |
| | |
| | | |
| | | return aStr; |
| | | } |
| | | exports.fromSetString = supportsNullProto ? identity : fromSetString; |
| | | exports$1.fromSetString = supportsNullProto ? identity : fromSetString; |
| | | |
| | | function isProtoString(s) { |
| | | if (!s) { |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByOriginalPositions = compareByOriginalPositions; |
| | | exports$1.compareByOriginalPositions = compareByOriginalPositions; |
| | | |
| | | /** |
| | | * Comparator between two mappings with deflated source and name indices where |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated; |
| | | exports$1.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated; |
| | | |
| | | function strcmp(aStr1, aStr2) { |
| | | if (aStr1 === aStr2) { |
| | |
| | | |
| | | return strcmp(mappingA.name, mappingB.name); |
| | | } |
| | | exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated; |
| | | exports$1.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated; |
| | | |
| | | /** |
| | | * Strip any JSON XSSI avoidance prefix from the string (as documented |
| | |
| | | function parseSourceMapInput(str) { |
| | | return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, '')); |
| | | } |
| | | exports.parseSourceMapInput = parseSourceMapInput; |
| | | exports$1.parseSourceMapInput = parseSourceMapInput; |
| | | |
| | | /** |
| | | * Compute the URL of a source given the the source root, the source's |
| | |
| | | |
| | | return normalize(sourceURL); |
| | | } |
| | | exports.computeSourceURL = computeSourceURL; |
| | | exports$1.computeSourceURL = computeSourceURL; |
| | | } (util)); |
| | | return util; |
| | | } |
| | |
| | | function requireBinarySearch () { |
| | | if (hasRequiredBinarySearch) return binarySearch; |
| | | hasRequiredBinarySearch = 1; |
| | | (function (exports) { |
| | | (function (exports$1) { |
| | | /* |
| | | * Copyright 2011 Mozilla Foundation and contributors |
| | | * Licensed under the New BSD license. See LICENSE or: |
| | | * http://opensource.org/licenses/BSD-3-Clause |
| | | */ |
| | | |
| | | exports.GREATEST_LOWER_BOUND = 1; |
| | | exports.LEAST_UPPER_BOUND = 2; |
| | | exports$1.GREATEST_LOWER_BOUND = 1; |
| | | exports$1.LEAST_UPPER_BOUND = 2; |
| | | |
| | | /** |
| | | * Recursive implementation of binary search. |
| | |
| | | |
| | | // The exact needle element was not found in this haystack. Determine if |
| | | // we are in termination case (3) or (2) and return the appropriate thing. |
| | | if (aBias == exports.LEAST_UPPER_BOUND) { |
| | | if (aBias == exports$1.LEAST_UPPER_BOUND) { |
| | | return aHigh < aHaystack.length ? aHigh : -1; |
| | | } else { |
| | | return mid; |
| | |
| | | } |
| | | |
| | | // we are in termination case (3) or (2) and return the appropriate thing. |
| | | if (aBias == exports.LEAST_UPPER_BOUND) { |
| | | if (aBias == exports$1.LEAST_UPPER_BOUND) { |
| | | return mid; |
| | | } else { |
| | | return aLow < 0 ? -1 : aLow; |
| | |
| | | * searching for, respectively, if the exact element cannot be found. |
| | | * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'. |
| | | */ |
| | | exports.search = function search(aNeedle, aHaystack, aCompare, aBias) { |
| | | exports$1.search = function search(aNeedle, aHaystack, aCompare, aBias) { |
| | | if (aHaystack.length === 0) { |
| | | return -1; |
| | | } |
| | | |
| | | var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack, |
| | | aCompare, aBias || exports.GREATEST_LOWER_BOUND); |
| | | aCompare, aBias || exports$1.GREATEST_LOWER_BOUND); |
| | | if (index < 0) { |
| | | return -1; |
| | | } |
| | |
| | | } else if (userPlugins) { |
| | | userPlugins = userPlugins.filter((p) => p !== "jsx"); |
| | | } |
| | | if (lang === "ts" || lang === "mts" || lang === "tsx" || lang === "mtsx") { |
| | | if (lang === "ts" || lang === "mts" || lang === "tsx" || lang === "cts" || lang === "mtsx") { |
| | | plugins.push(["typescript", { dts }], "explicitResourceManagement"); |
| | | if (!userPlugins || !userPlugins.includes("decorators")) { |
| | | plugins.push("decorators-legacy"); |
| | |
| | | (base.calls || (base.calls = [])).push(...calls); |
| | | } |
| | | } catch (e) { |
| | | ctx.error( |
| | | `Failed to resolve extends base type. |
| | | if (!ctx.silentOnExtendsFailure) { |
| | | ctx.error( |
| | | `Failed to resolve extends base type. |
| | | If this previously worked in 3.2, you can instruct the compiler to ignore this extend by adding /* @vue-ignore */ before it, for example: |
| | | |
| | | interface Props extends /* @vue-ignore */ Base {} |
| | | |
| | | Note: both in 3.2 or with the ignore, the properties in the base type are treated as fallthrough attrs at runtime.`, |
| | | ext, |
| | | scope |
| | | ); |
| | | ext, |
| | | scope |
| | | ); |
| | | } |
| | | } |
| | | } |
| | | } |
| | |
| | | } |
| | | } |
| | | function resolveExt(filename, fs) { |
| | | filename = filename.replace(/\.js$/, ""); |
| | | let moduleType = "u"; |
| | | if (filename.endsWith(".mjs")) { |
| | | moduleType = "m"; |
| | | } else if (filename.endsWith(".cjs")) { |
| | | moduleType = "c"; |
| | | } |
| | | filename = filename.replace(/\.[cm]?jsx?$/, ""); |
| | | const tryResolve = (filename2) => { |
| | | if (fs.fileExists(filename2)) return filename2; |
| | | }; |
| | | return tryResolve(filename) || tryResolve(filename + `.ts`) || tryResolve(filename + `.tsx`) || tryResolve(filename + `.d.ts`) || tryResolve(joinPaths(filename, `index.ts`)) || tryResolve(joinPaths(filename, `index.tsx`)) || tryResolve(joinPaths(filename, `index.d.ts`)); |
| | | const resolveTs = () => tryResolve(filename + `.ts`) || tryResolve(filename + `.tsx`) || tryResolve(filename + `.d.ts`); |
| | | const resolveMts = () => tryResolve(filename + `.mts`) || tryResolve(filename + `.d.mts`); |
| | | const resolveCts = () => tryResolve(filename + `.cts`) || tryResolve(filename + `.d.cts`); |
| | | return tryResolve(filename) || // For explicit .mjs/.cjs imports, prefer .mts/.cts declarations first. |
| | | (moduleType === "m" ? resolveMts() || resolveTs() : moduleType === "c" ? resolveCts() || resolveTs() : resolveTs() || resolveMts() || resolveCts()) || tryResolve(joinPaths(filename, `index.ts`)) || tryResolve(joinPaths(filename, `index.tsx`)) || tryResolve(joinPaths(filename, `index.d.ts`)); |
| | | } |
| | | const tsConfigCache = createCache(); |
| | | const tsConfigRefMap = /* @__PURE__ */ new Map(); |
| | |
| | | } |
| | | function parseFile(filename, content, fs, parserPlugins) { |
| | | const ext = extname(filename); |
| | | if (ext === ".ts" || ext === ".mts" || ext === ".tsx" || ext === ".mtsx") { |
| | | if (ext === ".ts" || ext === ".mts" || ext === ".tsx" || ext === ".cts" || ext === ".mtsx") { |
| | | return libExports.parse(content, { |
| | | plugins: resolveParserPlugins( |
| | | ext.slice(1), |
| | | parserPlugins, |
| | | /\.d\.m?ts$/.test(filename) |
| | | /\.d\.[cm]?ts$/.test(filename) |
| | | ), |
| | | sourceType: "module" |
| | | }).program.body; |
| | |
| | | case "TSInterfaceDeclaration": |
| | | case "TSEnumDeclaration": |
| | | case "TSModuleDeclaration": { |
| | | if (node.type === "TSModuleDeclaration" && node.global) { |
| | | const body = node.body; |
| | | for (const s of body.body) { |
| | | if (s.type === "ExportNamedDeclaration" && s.declaration) { |
| | | recordType(s.declaration, types, declares); |
| | | } else { |
| | | recordType(s, types, declares); |
| | | } |
| | | } |
| | | break; |
| | | } |
| | | const id = overwriteId || getId(node.id); |
| | | let existing = types[id]; |
| | | if (existing) { |
| | |
| | | if (node.leadingComments && node.leadingComments.some((c) => c.value.includes("@vue-ignore"))) { |
| | | return [UNKNOWN_TYPE]; |
| | | } |
| | | const prevSilent = ctx.silentOnExtendsFailure; |
| | | ctx.silentOnExtendsFailure = true; |
| | | try { |
| | | switch (node.type) { |
| | | case "TSStringKeyword": |
| | |
| | | } |
| | | } |
| | | } catch (e) { |
| | | } finally { |
| | | ctx.silentOnExtendsFailure = prevSilent; |
| | | } |
| | | return [UNKNOWN_TYPE]; |
| | | } |
| | | function flattenTypes(ctx, types, scope, isKeyOf = false, typeParameters = void 0) { |
| | | if (types.length === 1) { |
| | | return inferRuntimeType(ctx, types[0], scope, isKeyOf, typeParameters); |
| | | return inferRuntimeType( |
| | | ctx, |
| | | types[0], |
| | | types[0]._ownerScope || scope, |
| | | isKeyOf, |
| | | typeParameters |
| | | ); |
| | | } |
| | | return [ |
| | | ...new Set( |
| | | [].concat( |
| | | ...types.map( |
| | | (t) => inferRuntimeType(ctx, t, scope, isKeyOf, typeParameters) |
| | | (t) => inferRuntimeType( |
| | | ctx, |
| | | t, |
| | | t._ownerScope || scope, |
| | | isKeyOf, |
| | | typeParameters |
| | | ) |
| | | ) |
| | | ) |
| | | ) |
| | |
| | | let modelName; |
| | | let options; |
| | | const arg0 = node.arguments[0] && unwrapTSNode(node.arguments[0]); |
| | | const hasName = arg0 && arg0.type === "StringLiteral"; |
| | | const hasName = arg0 && (arg0.type === "StringLiteral" || arg0.type === "TemplateLiteral" && arg0.expressions.length === 0); |
| | | if (hasName) { |
| | | modelName = arg0.value; |
| | | modelName = arg0.type === "StringLiteral" ? arg0.value : arg0.quasis[0].value.cooked; |
| | | options = node.arguments[1]; |
| | | } else { |
| | | modelName = "modelValue"; |
| | |
| | | if (prop.type === "ObjectProperty") { |
| | | defaultString = `default: ${ctx.getString(prop.value)}`; |
| | | } else { |
| | | defaultString = `${prop.async ? "async " : ""}${prop.kind !== "method" ? `${prop.kind} ` : ""}default() ${ctx.getString(prop.body)}`; |
| | | let paramsString = ""; |
| | | if (prop.params.length) { |
| | | const start = prop.params[0].start; |
| | | const end = prop.params[prop.params.length - 1].end; |
| | | paramsString = ctx.getString({ start, end }); |
| | | } |
| | | defaultString = `${prop.async ? "async " : ""}${prop.kind !== "method" ? `${prop.kind} ` : ""}default(${paramsString}) ${ctx.getString(prop.body)}`; |
| | | } |
| | | } |
| | | } |
| | |
| | | } else if (stmt.type === "FunctionDeclaration" || stmt.type === "ClassDeclaration") { |
| | | if (stmt.declare || !stmt.id) continue; |
| | | registerLocalBinding(stmt.id); |
| | | } else if ((stmt.type === "ForOfStatement" || stmt.type === "ForInStatement") && stmt.left.type === "VariableDeclaration") { |
| | | walkVariableDeclaration(stmt.left); |
| | | } else if (stmt.type === "ExportNamedDeclaration" && stmt.declaration && stmt.declaration.type === "VariableDeclaration") { |
| | | walkVariableDeclaration(stmt.declaration, isRoot); |
| | | } else if (stmt.type === "LabeledStatement" && stmt.body.type === "VariableDeclaration") { |
| | |
| | | walkScope(node.body); |
| | | return; |
| | | } |
| | | if (node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "ForStatement") { |
| | | pushScope(); |
| | | const varDecl = node.type === "ForStatement" ? node.init : node.left; |
| | | if (varDecl && varDecl.type === "VariableDeclaration") { |
| | | walkVariableDeclaration(varDecl); |
| | | } |
| | | if (node.body.type === "BlockStatement") { |
| | | walkScope(node.body); |
| | | } |
| | | return; |
| | | } |
| | | if (node.type === "BlockStatement" && !isFunctionType(parent)) { |
| | | pushScope(); |
| | | walkScope(node); |
| | |
| | | }, |
| | | leave(node, parent) { |
| | | parent && parentStack.pop(); |
| | | if (node.type === "BlockStatement" && !isFunctionType(parent) || isFunctionType(node) || node.type === "CatchClause") { |
| | | if (node.type === "BlockStatement" && !isFunctionType(parent) || isFunctionType(node) || node.type === "CatchClause" || node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "ForStatement") { |
| | | popScope(); |
| | | } |
| | | } |
| | |
| | | for (const key in setupBindings) { |
| | | ctx.bindingMetadata[key] = setupBindings[key]; |
| | | } |
| | | if (sfc.template && !sfc.template.src && sfc.template.ast) { |
| | | const vModelIds = resolveTemplateVModelIdentifiers(sfc); |
| | | if (vModelIds.size) { |
| | | const toDemote = /* @__PURE__ */ new Set(); |
| | | for (const id of vModelIds) { |
| | | if (setupBindings[id] === "setup-reactive-const") { |
| | | toDemote.add(id); |
| | | } |
| | | } |
| | | if (toDemote.size) { |
| | | for (const node of scriptSetupAst.body) { |
| | | if (node.type === "VariableDeclaration" && node.kind === "const" && !node.declare) { |
| | | const demotedInDecl = []; |
| | | for (const decl of node.declarations) { |
| | | if (decl.id.type === "Identifier" && toDemote.has(decl.id.name)) { |
| | | demotedInDecl.push(decl.id.name); |
| | | } |
| | | } |
| | | if (demotedInDecl.length) { |
| | | ctx.s.overwrite( |
| | | node.start + startOffset, |
| | | node.start + startOffset + "const".length, |
| | | "let" |
| | | ); |
| | | for (const id of demotedInDecl) { |
| | | setupBindings[id] = "setup-let"; |
| | | ctx.bindingMetadata[id] = "setup-let"; |
| | | warnOnce$1( |
| | | `\`v-model\` cannot update a \`const\` reactive binding \`${id}\`. The compiler has transformed it to \`let\` to make the update work.` |
| | | ); |
| | | } |
| | | } |
| | | } |
| | | } |
| | | } |
| | | } |
| | | } |
| | | if (sfc.cssVars.length && // no need to do this when targeting SSR |
| | | !((_a = options.templateOptions) == null ? void 0 : _a.ssr)) { |
| | | ctx.helperImports.add(CSS_VARS_HELPER); |
| | |
| | | } |
| | | return a; |
| | | }; |
| | | const version = "3.5.25"; |
| | | const version = "3.5.32"; |
| | | const parseCache = parseCache$1; |
| | | const errorMessages = __spreadValues(__spreadValues({}, errorMessages$1), DOMErrorMessages); |
| | | const walk = walk$2; |