ove-auto-annotate 0.0.4 → 0.0.8

package/umd/ove-auto-annotate.js.map

@@ -1 +1 @@
-{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap","webpack:///./node_modules/@babel/runtime/regenerator/index.js","webpack:///./node_modules/papaparse/papaparse.min.js","webpack:///./node_modules/downloadjs/download.js","webpack:///./node_modules/regenerator-runtime/runtime.js","webpack:///./src/constants.js","webpack:///./src/CreateAnnotationsPage.js","webpack:///./src/AutoAnnotateBpMatchingDialog.js","webpack:///./src/fileUtils.js","webpack:///./src/index.js"],"names":["formName","window","addOnGlobals","startCase","compose","hideDialog","typeField","pluralize","React","useEffect","DataTable","DialogFooter","withSelectedEntities","withSelectTableRecords","tidyUpAnnotation","schemaFeatures","schemaOther","CreateAnnotationsPage","props","newAnnotations","annotationType","annotationVisibilityShow","beforeAnnotationCreate","handleSubmit","selectTableRecords","sequenceData","ents","length","map","e","start","end","annotationTypePlural","forEach","newAnnotation","i","annotation","conditionals","batchUndoStart","batchUndoEnd","batchUndoMiddle","Tab","Tabs","wrapDialog","highlightStyle","background","marginTop","AutoAnnotateBpMatchingDialog","title","isRegex","display","columnGap","gridTemplateColumns","maxHeight","overflow","allowedCsvFileTypes","isZipFile","file","type","mimetype","getExt","name","split","pop","isExcelFile","isCsvFile","isTextFile","includes","defaultCsvParserOptions","header","skipEmptyLines","trimHeaders","parseCsvFile","csvFile","parserOptions","Promise","resolve","reject","parse","originFileObj","complete","results","errors","JSON","stringify","error","parseCsvString","csvString","cleanCommaSeparatedCell","cellData","n","trim","filter","cleanCsvExport","rows","allHeaders","row","Object","keys","push","validateCSVRequiredHeaders","fields","requiredHeaders","filename","missingRequiredHeaders","field","join","validateCSVRow","index","missingRequiredFields","shortid","FileUploadField","Colors","reduxForm","SubmissionError","featureColors","FeatureTypes","InfoHelper","showConfirmationDialog","showDialog","withEditorProps","useState","convertApELikeRegexToRegex","autoAnnotate","autoAnnotateFeatures","ModalComponent","AutoAnnotateModal","autoAnnotateParts","autoAnnotatePrimers","p","form","getCustomAutoAnnotateList","fileType","setSelectedImportType","setNewAnns","customAnnResponse","setCustomAnnResponse","loadingCustomAnnList","setLoadingCustomAnnList","anns","toastr","warning","console","stopPropagation","preventDefault","description","sequence","csv","unparse","downloadjs","padding","color","RED1","list","customAnnsSchema","customAnnsSchemaNoType","apeFile","convertNonStandardTypes","annsToCheck","validateRow","rowName","cleanedType","find","t","toLowerCase","cancelButtonText","text","validationError","toUpperCase","RegExp","regexConvertedSeq","undefined","entries","csvHeaders","data","meta","info","annotationsToCheckById","ann","id","seqId","seqsToAnnotateById","newAnns","a","toRet","forward","strand","_ove_addons"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;QCVA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;;QAEA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;;;QAGA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA,0CAA0C,gCAAgC;QAC1E;QACA;;QAEA;QACA;QACA;QACA,wDAAwD,kBAAkB;QAC1E;QACA,iDAAiD,cAAc;QAC/D;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,yCAAyC,iCAAiC;QAC1E,gHAAgH,mBAAmB,EAAE;QACrI;QACA;;QAEA;QACA;QACA;QACA,2BAA2B,0BAA0B,EAAE;QACvD,iCAAiC,eAAe;QAChD;QACA;QACA;;QAEA;QACA,sDAAsD,+DAA+D;;QAErH;QACA;;;QAGA;QACA;;;;;;;AClFA,iBAAiB,mBAAO,CAAC,CAAqB;;;;;;;ACA9C;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,KAAqC,CAAC,iCAAO,EAAE,oCAAC,CAAC;AAAA;AAAA;AAAA,oGAAC,CAAC,SAAkF,CAAC,mBAAmB,aAAa,sFAAsF,qEAAqE,gBAAgB,QAAQ,oBAAoB,cAAc,oBAAoB,qCAAqC,EAAE,8FAA8F,iBAAiB,iCAAiC,gHAAgH,IAAI,uBAAuB,uBAAuB,QAAQ,wCAAwC,GAAG,+MAA+M,+BAA+B,EAAE,WAAW,oLAAoL,mBAAmB,uBAAuB,0DAA0D,YAAY,6BAA6B,kEAAkE,kCAAkC,0BAA0B,iGAAiG,4FAA4F,0CAA0C,8CAA8C,yCAAyC,6BAA6B,mEAAmE,YAAY,0CAA0C,yDAAyD,GAAG,2BAA2B,sCAAsC,qBAAqB,qDAAqD,4DAA4D,2WAA2W,0DAA0D,kBAAkB,SAAS,4EAA4E,0DAA0D,SAAS,YAAY,WAAW,6BAA6B,mBAAmB,YAAY,WAAW,KAAK,mFAAmF,0GAA0G,iBAAiB,IAAI,KAAK,eAAe,gBAAgB,yBAAyB,OAAO,YAAY,IAAI,KAAK,gBAAgB,kBAAkB,gBAAgB,qCAAqC,SAAS,gBAAgB,oBAAoB,6DAA6D,qEAAqE,8HAA8H,YAAY,WAAW,mCAAmC,SAAS,qFAAqF,oBAAoB,sZAAsZ,eAAe,uBAAuB,kBAAkB,MAAM,6BAA6B,8JAA8J,YAAY,oBAAoB,YAAY,4DAA4D,IAAI,EAAE,WAAW,aAAa,iBAAiB,mBAAmB,gBAAgB,mCAAmC,uBAAuB,wGAAwG,OAAO,SAAS,qCAAqC,kFAAkF,mCAAmC,gCAAgC,sCAAsC,kCAAkC,kCAAkC,iCAAiC,aAAa,oBAAoB,cAAc,+NAA+N,0BAA0B,aAAa,WAAW,sEAAsE,6DAA6D,4CAA4C,wDAAwD,uCAAuC,kBAAkB,qCAAqC,0BAA0B,qBAAqB,4DAA4D,oDAAoD,oBAAoB,gIAAgI,iFAAiF,oBAAoB,0CAA0C,EAAE,mCAAmC,iHAAiH,sCAAsC,4ZAA4Z,gBAAgB,6BAA6B,kFAAkF,yCAAyC,GAAG,cAAc,MAAM,QAAQ,yFAAyF,sCAAsC,YAAY,kBAAkB,yBAAyB,gCAAgC,4BAA4B,sCAAsC,KAAK,4RAA4R,0CAA0C,0CAA0C,2BAA2B,2CAA2C,uDAAuD,IAAI,yCAAyC,SAAS,4BAA4B,qCAAqC,8BAA8B,qNAAqN,2CAA2C,qBAAqB,mDAAmD,sCAAsC,8BAA8B,sBAAsB,+BAA+B,cAAc,QAAQ,QAAQ,2DAA2D,qCAAqC,wBAAwB,qLAAqL,4BAA4B,gGAAgG,4BAA4B,kBAAkB,2BAA2B,oEAAoE,0BAA0B,4CAA4C,sBAAsB,QAAQ,UAAU,EAAE,+BAA+B,2IAA2I,6BAA6B,0BAA0B,cAAc,MAAM,mBAAmB,0BAA0B,6BAA6B,4BAA4B,oBAAoB,+BAA+B,iGAAiG,cAAc,mBAAmB,EAAE,mBAAmB,sBAAsB,4DAA4D,wBAAwB,8DAA8D,yBAAyB,sIAAsI,kCAAkC,qCAAqC,4BAA4B,iEAAiE,gCAAgC,IAAI,4HAA4H,SAAS,sBAAsB,uCAAuC,yCAAyC,oCAAoC,gDAAgD,wCAAwC,4JAA4J,OAAO,cAAc,6FAA6F,EAAE,yEAAyE,EAAE,oEAAoE,EAAE,2FAA2F,2BAA2B,cAAc,aAAa,mBAAmB,eAAe,KAAK,gCAAgC,8EAA8E,cAAc,uFAAuF,aAAa,4FAA4F,4EAA4E,gBAAgB,uCAAuC,uBAAuB,aAAa,gBAAgB,2DAA2D,6BAA6B,YAAY,qBAAqB,yBAAyB,mBAAmB,uBAAuB,cAAc,0DAA0D,gBAAgB,mBAAmB,IAAI,QAAQ,WAAW,KAAK,eAAe,oJAAoJ,oPAAoP,QAAQ,mGAAmG,oCAAoC,cAAc,GAAG,aAAa,8BAA8B,gBAAgB,2NAA2N,cAAc,oBAAoB,qBAAqB,SAAS,yDAAyD,MAAM,oBAAoB,OAAO,yBAAyB,uCAAuC,2BAA2B,uBAAuB,uCAAuC,yBAAyB,mIAAmI,8BAA8B,gBAAgB,WAAW,wBAAwB,iCAAiC,kGAAkG,KAAK,0BAA0B,YAAY,qBAAqB,2BAA2B,YAAY,WAAW,KAAK,uBAAuB,SAAS,iBAAiB,4CAA4C,eAAe,gBAAgB,2BAA2B,KAAK,uBAAuB,gDAAgD,mGAAmG,OAAO,8CAA8C,8DAA8D,4GAA4G,WAAW,+EAA+E,MAAM,WAAW,KAAK,MAAM,YAAY,wBAAwB,SAAS,uBAAuB,6DAA6D,wBAAwB,6EAA6E,yBAAyB,SAAS,uBAAuB,oEAAoE,cAAc,2BAA2B,oBAAoB,cAAc,gBAAgB,gHAAgH,sKAAsK,mHAAmH,aAAa,2BAA2B,gEAAgE,4EAA4E,iBAAiB,iCAAiC,yBAAyB,WAAW,KAAK,iDAAiD,qBAAqB,6BAA6B,MAAM,uCAAuC,mBAAmB,wCAAwC,WAAW,wFAAwF,yDAAyD,qBAAqB,wCAAwC,8EAA8E,KAAK,gBAAgB,yDAAyD,+BAA+B,kBAAkB,EAAE,+CAA+C,4FAA4F,MAAM,mDAAmD,sBAAsB,6BAA6B,wEAAwE,gCAAgC,iBAAiB,6GAA6G,MAAM,WAAW,mCAAmC,4GAA4G,+BAA+B,MAAM,QAAQ,8GAA8G,OAAO,SAAS,WAAW,cAAc,cAAc,cAAc,QAAQ,WAAW,yBAAyB,+BAA+B,SAAS,cAAc,yEAAyE,cAAc,+BAA+B,cAAc,OAAO,sBAAsB,kEAAkE,aAAa,kBAAkB,uBAAuB,KAAK,8BAA8B,UAAU,cAAc,kCAAkC,uCAAuC,mCAAmC,OAAO,iBAAiB,mBAAmB,wBAAwB,YAAY,EAAE,mBAAmB,kBAAkB,YAAY,sCAAsC,mEAAmE,QAAQ,KAAK,iBAAiB,wEAAwE,wCAAwC,gBAAgB,WAAW,+DAA+D,aAAa,oCAAoC,cAAc,yCAAyC,6BAA6B,4BAA4B,SAAS,gBAAgB,kBAAkB,sBAAsB,cAAc,2BAA2B,mCAAmC,aAAa,kDAAkD,2CAA2C,mEAAmE,EAAE,oEAAoE,gCAAgC,kBAAkB,2CAA2C,GAAG,gOAAgO,E;;;;;;ACN1zkB,gIAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK,IAA0C;AAC/C;AACA,EAAE,iCAAO,EAAE,oCAAE,OAAO;AAAA;AAAA;AAAA,oGAAC;AACrB,EAAE,MAAM,EAQL;AACH,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,kBAAkB;AAC5C;AACA;AACA;AACA;AACA;;AAEA,4BAA4B;AAC5B;AACA;AACA;AACA;;;AAGA,8BAA8B;AAC9B;AACA,qBAAqB;AACrB,yCAAyC;AACzC;AACA;AACA;AACA,mC;AACA;AACA;AACA,gCAAgC,cAAc,KAAK;AACnD;AACA,IAAI;AACJ,GAAG;;;AAGH;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA,IAAI,K;AACJ;AACA;AACA,qBAAqB;AACrB;;AAEA,GAAG,KAAK;AACR,qC;AACA;AACA,UAAU,KAAK;AACf,sCAAsC,eAAe;AACrD,I;AACA;AACA;AACA;AACA,0BAA0B,eAAe;;;AAGzC;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,KAAK;;AAEd,+BAA+B,WAAW;AAC1C;;AAEA;;AAEA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sBAAsB,wCAAwC;AACtF,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,0BAA0B;AAC1B,mHAAmH,mBAAmB;AACtI;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sCAAsC;AACtC;AACA;AACA;AACA,yBAAyB,8BAA8B,EAAE;;AAEzD,GAAG;;;;;AAKH,6BAA6B;AAC7B;AACA;;AAEA,eAAe;AACf;AACA,GAAG;AACH;AACA;AACA;AACA,6CAA6C;AAC7C,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,CAAC;;;;;;;;;;;;;;ACtKD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,KAAK;AACL,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,WAAW;AACX;;AAEA;AACA;AACA,wCAAwC,WAAW;AACnD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;;AAEA;;AAEA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC,cAAc;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,iCAAiC,kBAAkB;AACnD;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,iBAAiB;;AAEjB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,iBAAiB;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,YAAY;AACZ;AACA;;AAEA;AACA,YAAY;AACZ;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,8CAA8C,QAAQ;AACtD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA,WAAW;AACX;AACA;AACA;;AAEA,WAAW;AACX;AACA;AACA;;AAEA,WAAW;AACX;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,CAAC;AACD;AACA;AACA;AACA;AACA,EAAE,KAA0B,oBAAoB,SAAE;AAClD;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;AC3uBO,IAAMA,QAAQ,GAAG,cAAjB,C;;;;;;;;;;ACAP;AACA,2BAaIC,MAAM,CAACC,YAbX;AAAA,IACEC,SADF,wBACEA,SADF;AAAA,IAEEC,OAFF,wBAEEA,OAFF;AAAA,IAGEC,UAHF,wBAGEA,UAHF;AAAA,IAIEC,SAJF,wBAIEA,SAJF;AAAA,IAKEC,SALF,wBAKEA,SALF;AAAA,IAMEC,KANF,wBAMEA,KANF;AAAA,IAOEC,SAPF,wBAOEA,SAPF;AAAA,IAQEC,SARF,wBAQEA,SARF;AAAA,IASEC,YATF,wBASEA,YATF;AAAA,IAUEC,oBAVF,wBAUEA,oBAVF;AAAA,IAWEC,sBAXF,wBAWEA,sBAXF;AAAA,IAYEC,gBAZF,wBAYEA,gBAZF;AAeA,IAAMC,cAAc,GAAG,CAAC,MAAD,EAAST,SAAT,EAAoB,OAApB,EAA6B,KAA7B,EAAoC,QAApC,CAAvB;AACA,IAAMU,WAAW,GAAG,CAAC,MAAD,EAAS,OAAT,EAAkB,KAAlB,EAAyB,QAAzB,CAApB;AACeZ,qEAAO,CACpBQ,oBAAoB,CAACZ,QAAD,CADA,EAEpBa,sBAAsB,CAACb,QAAD,CAFF,CAAP,CAGb,SAASiB,qBAAT,CAA+BC,KAA/B,EAAsC;AACtC,MACEC,cADF,GAQID,KARJ,CACEC,cADF;AAAA,MAEEC,cAFF,GAQIF,KARJ,CAEEE,cAFF;AAAA,MAGEC,wBAHF,GAQIH,KARJ,CAGEG,wBAHF;AAAA,MAIEC,sBAJF,GAQIJ,KARJ,CAIEI,sBAJF;AAAA,MAKEC,YALF,GAQIL,KARJ,CAKEK,YALF;AAAA,MAMEC,kBANF,GAQIN,KARJ,CAMEM,kBANF;AAAA,MAOEC,YAPF,GAQIP,KARJ,CAOEO,YAPF;AASA,MAAMC,IAAI,GAAGR,KAAK,CAAIlB,QAAJ,sBAAlB;AACAS,WAAS,CAAC,YAAM;AACde,sBAAkB,CAACL,cAAD,CAAlB;AACD,GAFQ,EAEN,CAACA,cAAD,EAAiBK,kBAAjB,CAFM,CAAT;AAGA,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,mDACiBJ,cADjB,EAEGD,cAAc,CAACQ,MAAf,GAAwB,CAAxB,GAA4B,GAA5B,GAAkC,EAFrC,kCAGE,oBAAC,SAAD;AACE,cAAU,MADZ;AAEE,YAAQ,EAAE3B,QAFZ;AAGE,YAAQ,EAAEmB,cAAc,CAACS,GAAf,CAAmB,UAACC,CAAD;AAAA,0BACxBA,CADwB;AAE3BC,aAAK,EAAED,CAAC,CAACC,KAAF,GAAU,CAFU;AAG3BC,WAAG,EAAEF,CAAC,CAACE,GAAF,GAAQ;AAHc;AAAA,KAAnB,CAHZ;AAQE,kBAAc,MARhB;AASE,UAAM,EAAEX,cAAc,KAAK,SAAnB,GAA+BL,cAA/B,GAAgDC;AAT1D,IAHF,CADF,eAgBE,oBAAC,YAAD;AACE,aAAS,EAAEX,UADb;AAEE,WAAO,EAAEkB,YAAY,0EAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AACdS,kCADc,GACSzB,SAAS,CAACa,cAAD,CADlB;AAGpBM,kBAAI,CAACO,OAAL,CAAa,UAACC,aAAD,EAAgBC,CAAhB,EAAsB;AACjCb,sCAAsB,IACpBA,sBAAsB,CAAC;AACrBU,sCAAoB,EAApBA,oBADqB;AAErBI,4BAAU,EAAEF,aAFS;AAGrBhB,uBAAK,EAAEA;AAHc,iBAAD,CADxB;AAOA,oBAAImB,YAAY,GAAG,EAAnB;;AACA,oBAAIX,IAAI,CAACC,MAAL,GAAc,CAAlB,EAAqB;AACnB,sBAAIQ,CAAC,KAAK,CAAV,EAAa;AACXE,gCAAY,GAAG;AACbC,oCAAc,EAAE;AADH,qBAAf;AAGD,mBAJD,MAIO,IAAIH,CAAC,KAAKT,IAAI,CAACC,MAAL,GAAc,CAAxB,EAA2B;AAChCU,gCAAY,GAAG;AACbE,kCAAY,EAAE;AADD,qBAAf;AAGD,mBAJM,MAIA;AACLF,gCAAY,GAAG;AACbG,qCAAe,EAAE;AADJ,qBAAf;AAGD;AACF;;AACDtB,qBAAK,YAAUf,SAAS,CAACiB,cAAD,CAAnB,CAAL,CACEN,gBAAgB,CAACoB,aAAD,EAAgB;AAC9BT,8BAAY,EAAZA,YAD8B;AAE9BL,gCAAc,EAAEY;AAFc,iBAAhB,CADlB,EAKEK,YALF;AAOAhB,wCAAwB,CAACW,oBAAD,CAAxB;AACD,eAhCD;AAkCA3B,wBAAU;;AArCU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAAD,GAFvB;AAyCE,QAAI,EAAC;AAzCP,IAhBF,CADF;AA8DD,CA/Ec,CAAf,E;;AClBA;AACA,uDAAyCJ,MAAM,CAACC,YAAhD;AAAA,IAAQuC,GAAR,oDAAQA,GAAR;AAAA,IAAaC,IAAb,oDAAaA,IAAb;AAAA,IAAmBC,UAAnB,oDAAmBA,UAAnB;AAAA,IAA+BnC,kCAA/B,oDAA+BA,KAA/B;AAEA,IAAMoC,cAAc,GAAG;AACrBC,YAAU,EAAE,KADS;AAErBC,WAAS,EAAE;AAFU,CAAvB;AAIO,IAAMC,4BAA4B,GAAGJ,UAAU,CAAC;AACrDK,OAAK,EAAE;AAD8C,CAAD,CAAV,CAEzC,gBAAuB;AAAA,MAAXC,OAAW,QAAXA,OAAW;AACxB,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,iDAAC,IAAD;AAAM,wBAAoB,EAAEA,OAAO,GAAG,OAAH,GAAa;AAAhD,kBACE,iDAAC,GAAD;AACE,MAAE,EAAC,OADL;AAEE,SAAK,EAAC,OAFR;AAGE,SAAK,eACH,2EACE,4NADF,eAME,mFANF,eAOE;AACE,WAAK,EAAE;AACLC,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE,SAHhB;AAILC,iBAAS,EAAE,GAJN;AAKLC,gBAAQ,EAAE;AALL;AADT,oBASE,kEATF,eAUE,gIAVF,eAcE,8DAAM,GAAN,CAdF,eAeE,qFAAyB,GAAzB,6BAfF,eAgBE,8DAAM,GAAN,CAhBF,eAiBE,oFAAwB,GAAxB,6BAjBF,eAkBE,kEAlBF,oBAkBe,mEAlBf,eAmBE,kEAnBF,oBAmBe,mEAnBf,eAoBE,kEApBF,oBAoBe,mEApBf,eAqBE,kEArBF,oBAqBe,mEArBf,eAsBE,kEAtBF,oBAsBe,mEAtBf,eAuBE,kEAvBF,oBAuBe,mEAvBf,eAwBE,kEAxBF,oBAwBe,oEAxBf,eAyBE,kEAzBF,oBAyBe,oEAzBf,eA0BE,kEA1BF,oBA0Be,oEA1Bf,eA2BE,kEA3BF,oBA2Be,oEA3Bf,eA4BE,kEA5BF,oBA4Be,qEA5Bf,eA6BE,kEA7BF,oBA6Be,qEA7Bf,eA8BE,kEA9BF,oBA8Be,qEA9Bf,CAPF,eAuCE,4DAvCF,eAwCE,yEAxCF,eAyCE;AACE,WAAK,EAAE;AACLJ,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE;AAHhB;AADT,oBAOE,0EAPF,eAQE,mGACuB;AAAM,WAAK,EAAER;AAAb,aADvB,MARF,eAWE,qEAXF,eAYE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAZF,eAeE,qEAfF,eAgBE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,+BAEE;AAAM,WAAK,EAAEA;AAAb,cAFF,CAhBF,eAoBE,oEApBF,eAqBE,iFACI;AAAM,WAAK,EAAEA;AAAb,aADJ,iCAEE;AAAM,WAAK,EAAEA;AAAb,aAFF,CArBF,eAyBE,oEAzBF,eA0BE,sFACS;AAAM,WAAK,EAAEA;AAAb,iBADT,aA1BF,eA6BE,oEAAQ,GAAR,SA7BF,eA8BE,iFACI;AAAM,WAAK,EAAEA;AAAb,eADJ,oBA9BF,eAiCE,oEACK,GADL,SACa,GADb,UAjCF,eAoCE,iFACI;AAAM,WAAK,EAAEA;AAAb,iBADJ,kBApCF,CAzCF,eAkFE,4DAlFF;AAJJ,IADF,eA4FE,iDAAC,GAAD;AACE,MAAE,EAAC,OADL;AAEE,SAAK,EAAC,OAFR;AAGE,SAAK,eACH,2EACE,mIADF,eAKE,qHACwD,GADxD,eAEE;AAAG,UAAI,EAAC;AAAR,+BAFF,CALF,eASE,4DATF,eAUE,yEAVF,eAWE;AACE,WAAK,EAAE;AACLM,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE;AAHhB;AADT,oBAOE,0EAPF,eAQE,mGACuB;AAAM,WAAK,EAAER;AAAb,aADvB,MARF,eAWE,qEAXF,eAYE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAZF,eAeE,qEAfF,eAgBE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAhBF,eAmBE,oEAnBF,eAoBE,iFACI;AAAM,WAAK,EAAEA;AAAb,aADJ,iCAEE;AAAM,WAAK,EAAEA;AAAb,aAFF,CApBF,eAwBE,qEAxBF,eAyBE,mFACM;AAAM,WAAK,EAAEA;AAAb,wBADN,SAzBF,eA4BE,yEA5BF,eA6BE,sFACS;AAAM,WAAK,EAAEA;AAAb,iBADT,aA7BF,eAgCE,wEAhCF,eAiCE,iFACI;AAAM,WAAK,EAAEA;AAAb,eADJ,oBAjCF,eAoCE,8EApCF,eAqCE,iFACI;AAAM,WAAK,EAAEA;AAAb,gBADJ,mBArCF,CAXF,eAoDE,4DApDF;AAJJ,IA5FF,CADF,CADF;AA+JD,CAlK2C,CAArC,C,CAoKP;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,I;;;;AC7MA;AACA;AAEO,IAAMW,mBAAmB,GAAG,CAAC,MAAD,EAAS,MAAT,EAAiB,OAAjB,CAA5B;AAEA,IAAMC,SAAS,GAAG,SAAZA,SAAY,CAACC,IAAD,EAAU;AACjC,MAAMC,IAAI,GAAGD,IAAI,CAACE,QAAL,IAAiBF,IAAI,CAACC,IAAnC;AACA,SAAOA,IAAI,KAAK,iBAAT,IAA8BA,IAAI,KAAK,8BAA9C;AACD,CAHM;AAKA,IAAME,MAAM,GAAG,SAATA,MAAS,CAACH,IAAD;AAAA,SAAUA,IAAI,CAACI,IAAL,CAAUC,KAAV,CAAgB,GAAhB,EAAqBC,GAArB,EAAV;AAAA,CAAf;AACA,IAAMC,WAAW,GAAG,SAAdA,WAAc,CAACP,IAAD;AAAA,SAAUG,MAAM,CAACH,IAAD,CAAN,KAAiB,MAA3B;AAAA,CAApB;AACA,IAAMQ,SAAS,GAAG,SAAZA,SAAY,CAACR,IAAD;AAAA,SAAUG,MAAM,CAACH,IAAD,CAAN,KAAiB,KAA3B;AAAA,CAAlB;AACA,IAAMS,UAAU,GAAG,SAAbA,UAAa,CAACT,IAAD;AAAA,SAAU,CAAC,MAAD,EAAS,KAAT,EAAgBU,QAAhB,CAAyBP,MAAM,CAACH,IAAD,CAA/B,CAAV;AAAA,CAAnB;AAEP,IAAMW,uBAAuB,GAAG;AAC9BC,QAAM,EAAE,IADsB;AAE9BC,gBAAc,EAAE,QAFc;AAG9BC,aAAW,EAAE,IAHiB,CAI9B;;AAJ8B,CAAhC;AAOO,IAAMC,sBAAY,GAAG,SAAfA,YAAe,CAACC,OAAD,EAAUC,aAAV,EAAiC;AAAA,MAAvBA,aAAuB;AAAvBA,iBAAuB,GAAP,EAAO;AAAA;;AAC3D,SAAO,IAAIC,OAAJ,CAAY,UAACC,OAAD,EAAUC,MAAV,EAAqB;AACtCC,kCAAK,CAACL,OAAO,CAACM,aAAT,wBACAX,uBADA;AAEHY,cAAQ,EAAE,kBAACC,OAAD,EAAa;AACrB,YAAIA,OAAO,IAAIA,OAAO,CAACC,MAAnB,IAA6BD,OAAO,CAACC,MAAR,CAAevD,MAAhD,EAAwD;AACtD,iBAAOkD,MAAM,CAAC,mBAAmBM,IAAI,CAACC,SAAL,CAAeH,OAAO,CAACC,MAAvB,CAApB,CAAb;AACD;;AACDN,eAAO,CAACK,OAAD,CAAP;AACD,OAPE;AAQHI,WAAK,EAAE,eAACA,MAAD,EAAW;AAChBR,cAAM,CAACQ,MAAD,CAAN;AACD;AAVE,OAWAX,aAXA,EAAL;AAaD,GAdM,CAAP;AAeD,CAhBM;AAkBA,IAAMY,wBAAc,GAAG,SAAjBA,cAAiB,CAACC,SAAD,EAAYb,aAAZ,EAAmC;AAAA,MAAvBA,aAAuB;AAAvBA,iBAAuB,GAAP,EAAO;AAAA;;AAC/D,SAAOI,8BAAK,CAACS,SAAD,wBAAiBnB,uBAAjB,EAA6CM,aAA7C,EAAZ;AACD,CAFM;AAIA,IAAMc,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,QAAD;AAAA,SACrC,CAACA,QAAQ,IAAI,EAAb,EACG3B,KADH,CACS,GADT,EAEGlC,GAFH,CAEO,UAAC8D,CAAD;AAAA,WAAOA,CAAC,CAACC,IAAF,EAAP;AAAA,GAFP,EAGGC,MAHH,CAGU,UAACF,CAAD;AAAA,WAAOA,CAAP;AAAA,GAHV,CADqC;AAAA,CAAhC;AAMP;AACA;AACA;AACA;AACA;AACA;;AACO,IAAMG,cAAc,GAAG,SAAjBA,cAAiB,CAACC,IAAD,EAAU;AACtC,MAAMC,UAAU,GAAG,EAAnB;AACAD,MAAI,CAAC7D,OAAL,CAAa,UAAC+D,GAAD,EAAS;AACpBC,UAAM,CAACC,IAAP,CAAYF,GAAZ,EAAiB/D,OAAjB,CAAyB,UAACoC,MAAD,EAAY;AACnC,UAAI,CAAC0B,UAAU,CAAC5B,QAAX,CAAoBE,MAApB,CAAL,EAAkC;AAChC0B,kBAAU,CAACI,IAAX,CAAgB9B,MAAhB;AACD;AACF,KAJD;AAKD,GAND;AAOAyB,MAAI,CAAC7D,OAAL,CAAa,UAAC+D,GAAD,EAAS;AACpBD,cAAU,CAAC9D,OAAX,CAAmB,UAACoC,MAAD,EAAY;AAC7B2B,SAAG,CAAC3B,MAAD,CAAH,GAAc2B,GAAG,CAAC3B,MAAD,CAAH,IAAe,EAA7B;AACD,KAFD;AAGD,GAJD;AAKA,SAAOyB,IAAP;AACD,CAfM;AAiBA,IAAMM,0BAA0B,GAAG,SAA7BA,0BAA6B,CACxCC,MADwC,EAExCC,eAFwC,EAGxCC,QAHwC,EAIrC;AACH,MAAMC,sBAAsB,GAAGF,eAAe,CAACV,MAAhB,CAAuB,UAACa,KAAD,EAAW;AAC/D,WAAO,CAACJ,MAAM,CAAClC,QAAP,CAAgBsC,KAAhB,CAAR;AACD,GAF8B,CAA/B;;AAGA,MAAID,sBAAsB,CAAC7E,MAA3B,EAAmC;AACjC,QAAMkC,IAAI,GAAG0C,QAAQ,iBAAeA,QAAf,GAA4B,UAAjD;AACA,WAAU1C,IAAV,uCAAgD2C,sBAAsB,CAACE,IAAvB,CAC9C,IAD8C,CAAhD;AAGD;AACF,CAdM;AAgBA,IAAMC,cAAc,GAAG,SAAjBA,cAAiB,CAACX,GAAD,EAAMM,eAAN,EAAuBM,KAAvB,EAAiC;AAC7D,MAAMC,qBAAqB,GAAGP,eAAe,CAACV,MAAhB,CAAuB,UAACa,KAAD;AAAA,WAAW,CAACT,GAAG,CAACS,KAAD,CAAf;AAAA,GAAvB,CAA9B;;AACA,MAAII,qBAAqB,CAAClF,MAA1B,EAAkC;AAChC,QAAIkF,qBAAqB,CAAClF,MAAtB,KAAiC,CAArC,EAAwC;AACtC,uBAAciF,KAAK,GAAG,CAAtB,0CACEC,qBAAqB,CAAC,CAAD,CADvB;AAGD,KAJD,MAIO;AACL,uBACED,KAAK,GAAG,CADV,4CAEsCC,qBAAqB,CAACH,IAAtB,CAA2B,IAA3B,CAFtC;AAGD;AACF;AACF,CAbM,C;;;;;;;;;;;;;;;;;;;;ACzFP;;AACA;;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;AAEA,8BA2BIzG,MAAM,CAACC,YA3BX;AAAA,IACE4G,OADF,2BACEA,OADF;AAAA,IAEEC,eAFF,2BAEEA,eAFF;AAAA,IAGEC,MAHF,2BAGEA,MAHF;AAAA,IAIEvE,OAJF,2BAIEA,GAJF;AAAA,IAKEC,QALF,2BAKEA,IALF;AAAA,IAMEnC,aANF,2BAMEA,SANF;AAAA,IAOE0G,SAPF,2BAOEA,SAPF;AAAA,IAQEC,eARF,2BAQEA,eARF;AAAA,IASEC,aATF,2BASEA,aATF;AAAA,IAUEC,YAVF,2BAUEA,YAVF;AAAA,IAWEC,UAXF,2BAWEA,UAXF;AAAA,IAYEC,sBAZF,2BAYEA,sBAZF;AAAA,IAaE3E,cAbF,2BAaEA,UAbF;AAAA,IAcE4E,UAdF,2BAcEA,UAdF;AAAA,IAeEC,eAfF,2BAeEA,eAfF;AAAA,IAgBE7G,gBAhBF,2BAgBEA,YAhBF;AAAA,IAiBE8G,QAjBF,2BAiBEA,QAjBF;AAAA,IAkBEpH,cAlBF,2BAkBEA,UAlBF;AAAA,IAmBEF,aAnBF,2BAmBEA,SAnBF;AAAA,IAoBEC,WApBF,2BAoBEA,OApBF;AAAA,IAqBEI,SArBF,2BAqBEA,KArBF;AAAA,IAsBEkH,0BAtBF,2BAsBEA,0BAtBF;AAAA,IAuBEC,YAvBF,2BAuBEA,YAvBF;AAAA,IAwBElH,aAxBF,2BAwBEA,SAxBF;AAAA,IAyBEC,aAzBF,2BAyBEA,SAzBF;AAAA,IA0BEJ,aA1BF,2BA0BEA,SA1BF;AA6BO,SAASsH,oBAAT,GAAgC;AACrCL,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AACM,SAAS2G,iBAAT,GAA6B;AAClCR,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AACM,SAAS4G,mBAAT,GAA+B;AACpCT,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AAEM,IAAM0G,iBAAiB,GAAG1H,WAAO,CACtCuC,cAAU,CAAC,UAACsF,CAAD;AAAA,SAAQ;AACjBjF,SAAK,qBAAmB7C,aAAS,CAACI,aAAS,CAAC0H,CAAC,CAAC7G,cAAH,CAAV;AADhB,GAAR;AAAA,CAAD,CAD4B,EAItCoG,eAJsC,EAKtCP,SAAS,CAAC;AAAEiB,MAAI,EAAElI,QAAQA;AAAhB,CAAD,CAL6B,CAAP,CAM/B,UAACkB,KAAD,EAAW;AACX,MACEO,YADF,GAMIP,KANJ,CACEO,YADF;AAAA,MAEEF,YAFF,GAMIL,KANJ,CAEEK,YAFF;AAAA,8BAMIL,KANJ,CAGEE,cAHF;AAAA,MAGEA,cAHF,sCAGmB,SAHnB;AAAA,MAIEiE,KAJF,GAMInE,KANJ,CAIEmE,KAJF;AAAA,MAKE8C,yBALF,GAMIjH,KANJ,CAKEiH,yBALF;;AAOA,kBAA0CV,QAAQ,CAAC,SAAD,CAAlD;AAAA,MAAOW,QAAP;AAAA,MAAiBC,qBAAjB;;AACA,mBAAqCZ,QAAQ,CAAC,KAAD,CAA7C;AAAA,MAAOtG,cAAP;AAAA,MAAuBmH,UAAvB;;AACA,mBAAkDb,QAAQ,EAA1D;AAAA,MAAOc,iBAAP;AAAA,MAA0BC,oBAA1B;;AACA,mBAAwDf,QAAQ,EAAhE;AAAA,MAAOgB,oBAAP;AAAA,MAA6BC,uBAA7B;;AACAjI,eAAS,CAAC,YAAM;AACd,kEAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBACK0H,yBADL;AAAA;AAAA;AAAA;;AAEGO,qCAAuB,CAAC,IAAD,CAAvB;AAFH;AAAA;AAAA,qBAIwBP,yBAAyB,CAACjH,KAAD,CAJjD;;AAAA;AAIWyH,kBAJX;AAKKH,kCAAoB,CAACG,IAAD,CAApB;AALL;AAAA;;AAAA;AAAA;AAAA;AAOK1I,oBAAM,CAAC2I,MAAP,CAAcC,OAAd,CAAsB,sCAAtB;AACAC,qBAAO,CAACzD,KAAR;;AARL;AAAA;AAUKqD,qCAAuB,CAAC,KAAD,CAAvB;AAVL;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAAD;AAcD,GAfQ,EAeN,CAACP,yBAAD,EAA4BjH,KAA5B,CAfM,CAAT;;AAgBA,MAAIC,cAAJ,EAAoB;AAClB,wBACE,wBAAC,yBAAD,kBACMD,KADN;AAEE,oBAAc,EAAEC;AAFlB,OADF;AAMD;;AACD,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,wBAAC,QAAD;AACE,4BAAwB,MAD1B;AAEE,YAAQ,EAAEkH,qBAFZ;AAGE,iBAAa,EAAED;AAHjB,kBAKE,wBAAC,OAAD;AACE,SAAK,eACH,kDACE,oGACgD,mCADhD,eAEE,mCAFF,eAGE;AAAK,WAAK,EAAE;AAAElF,eAAO,EAAE;AAAX;AAAZ,uDAEE;AAAM,WAAK,EAAE;AAAEA,eAAO,EAAE;AAAX;AAAb,oCAEE,wBAAC,UAAD;AACE,aAAO,EAAE,iBAACrB,CAAD,EAAO;AACdA,SAAC,CAACkH,eAAF;AACAlH,SAAC,CAACmH,cAAF;AACAzB,kBAAU,CAAC;AACTM,wBAAc,EAAE9E,4BAA4BA;AADnC,SAAD,CAAV;AAGD,OAPH;AAQE,aAAO,EACL,oBACE,4GADF;AATJ,MAFF,CAFF,CAHF,eA4BE,mCA5BF,EA6BG3B,cAAc,KAAK,SAAnB,iBACC,wBAAC,SAAD,CAAO,QAAP,qBACE,2EADF,eAEE,mCAFF,CA9BJ,eAmCE,mCAnCF,eAoCE;AACE,aAAO,EAAE,mBAAM;AACb,YAAM0E,IAAI,GAAG,CAAC;AAEVjC,cAAI,eAAa1D,aAAS,CAACiB,cAAD,CAAtB,OAFK;AAGT6H,qBAAW,EAAE,mBAHJ;AAITC,kBAAQ;AAJC,WAKL9H,cAAc,KAAK,SAAnB,IAAgC;AAClCsC,cAAI;AAD8B,SAL3B;AAQTT,iBAAO,EAAE;AARA;AAWTY,cAAI,eAAa1D,aAAS,CAACiB,cAAD,CAAtB,OAXK;AAYT6H,qBAAW,EAAE,yBAZJ;AAaTC,kBAAQ;AAbC,WAcL9H,cAAc,KAAK,SAAnB,IAAgC;AAClCsC,cAAI;AAD8B,SAd3B;AAiBTT,iBAAO,EAAE;AAjBA,WAAb;AAoBA,YAAMkG,GAAG,GAAGC,gCAAO,CAACtD,IAAD,CAAnB,CArBa,CAsBb;AACA;AACA;;AACAuD,0BAAU,CACRF,GADQ,4CAGR,YAHQ,CAAV;AAKD;AA/BH,0BApCF,CADF,eAyEE,wBAAC,eAAD;AACE,UAAI,EAAC,SADP;AAEE,eAAS,EAAE,CAFb;AAGE,gBAAU,MAHZ;AAIE,YAAM,EAAC;AAJT,MAzEF,CAFJ;AAmFE,MAAE,EAAC,SAnFL;AAoFE,SAAK,EAAC;AApFR,IALF,eA2FE,wBAAC,OAAD;AACE,SAAK,eACH,kDACE,8FAEE;AACE,aAAO,EAAE,mBAAM;AACbE,0BAAU,gPAKR,YALQ,CAAV;AAOD;AATH,0BAFF,OADF,eAkBE,wBAAC,eAAD;AACE,eAAS,EAAE,CADb;AAEE,UAAI,EAAC,SAFP;AAGE,gBAAU,MAHZ;AAIE,YAAM,EAAC;AAJT,MAlBF,EAwBGhE,KAAK,iBACJ;AAAK,WAAK,EAAE;AAAEiE,eAAO,EAAE,CAAX;AAAcC,aAAK,EAAEvC,MAAM,CAACwC;AAA5B;AAAZ,OAAiDnE,KAAjD,CAzBJ,CAFJ;AA+BE,MAAE,EAAC,SA/BL;AAgCE,SAAK,EAAC;AAhCR,IA3FF,EA6HG8C,yBAAyB,KACvBM,oBAAoB,gBACnB,wBAAC,OAAD;AAAK,YAAQ,MAAb;AAAc,SAAK,EAAC;AAApB,IADmB,GAGnBF,iBAAiB,iBACf,wBAAC,OAAD;AACE,MAAE,EAAC,oBADL;AAEE,SAAK,EACFA,iBAAiB,IAAIA,iBAAiB,CAACvF,KAAxC,IACA,aAJJ;AAME,SAAK,EACHuF,iBAAiB,IACjBA,iBAAiB,CAACkB,IADlB,IAEAlB,iBAAiB,CAACkB,IAAlB,CAAuB9H,MAFvB,gBAGE,kDACE,wBAAC,aAAD;AACE,gBAAU,MADZ;AAEE,YAAM,EACJP,cAAc,KAAK,SAAnB,GACIsI,gBADJ,GAEIC,sBALR;AAOE,cAAQ,EAAEpB,iBAAiB,CAACkB;AAP9B,MADF,CAHF,gBAeE;AAtBN,IALoB,CA7H5B,CADF,eAgKE,wBAAC,gBAAD;AACE,aAAS,EAAEpJ,cADb;AAEE,YAAQ,EACN+H,QAAQ,KAAK,oBAAb,IACA,EACEG,iBAAiB,IACjBA,iBAAiB,CAACkB,IADlB,IAEAlB,iBAAiB,CAACkB,IAAlB,CAAuB9H,MAHzB,CAJJ;AAUE,WAAO,EAAEJ,YAAY;AAAA,gFAAC;AAAA;;AAAA;AAAA;AAAA;AAAA;AAASqI,uBAAT,SAASA,OAAT,EAAkBnF,OAAlB,SAAkBA,OAAlB;AAChBoF,uCADgB,GACU,KADV;AAEdC,2BAFc,GAEA,EAFA;AAAA;;AAIZC,2BAJY;AAAA,4FAIE,kBAAO/D,GAAP,EAAYgE,OAAZ;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,wCACchE,GADd,CACVtC,IADU,EACVA,IADU,0BACH,EADG,cACCwF,QADD,GACclD,GADd,CACCkD,QADD;;AAAA,kCAId9H,cAAc,KAAK,SAJL;AAAA;AAAA;AAAA;;AAKV6I,uCALU,GAKI7C,YAAY,CAAC8C,IAAb,CAClB,UAACC,CAAD;AAAA,qCAAOA,CAAC,CAACC,WAAF,OAAoB1G,IAAI,CAAC0G,WAAL,EAA3B;AAAA,6BADkB,CALJ;;AAAA,gCAQXH,WARW;AAAA;AAAA;AAAA;;AAAA,gCASTJ,uBATS;AAAA;AAAA;AAAA;;AAAA;AAAA,mCAUoBvC,sBAAsB,CAAC;AACrD+C,8CAAgB,EAAE,oBADmC;AAErDC,kCAAI,qBAAmBN,OAAnB,oCAAyDtG,IAAzD;AAFiD,6BAAD,CAV1C;;AAAA;AAUZmG,mDAVY;;AAAA,gCAcPA,uBAdO;AAAA;AAAA;AAAA;;AAAA,kCAeJ;AACJU,6CAAe,EAAKP,OAAL,oCAA2CtG,IAA3C;AADX,6BAfI;;AAAA;AAoBdsC,+BAAG,CAACtC,IAAJ,GAAW,cAAX;AApBc;AAAA;;AAAA;AAsBdsC,+BAAG,CAACtC,IAAJ,GAAWuG,WAAX;;AAtBc;AAAA,gCAyBbf,QAzBa;AAAA;AAAA;AAAA;;AAAA,kCA0BV;AACJqB,6CAAe,EAAKP,OAAL;AADX,6BA1BU;;AAAA;AAAA,kCA8BdhE,GAAG,CAAC/C,OAAJ,IAAe+C,GAAG,CAAC/C,OAAJ,CAAYuH,WAAZ,OAA8B,MA9B/B;AAAA;AAAA;AAAA;;AAAA;AAgCd,gCAAIC,MAAJ,CAAWC,iBAAX,EAhCc,CAgCiB;;AAhCjB;AAAA;;AAAA;AAAA;AAAA;AAAA,kCAkCR;AACJH,6CAAe,EAAKP,OAAL;AADX,6BAlCQ;;AAAA;AAsChBhE,+BAAG,CAAC/C,OAAJ,GAAc,IAAd;AAtCgB;AAAA;;AAAA;AAwChB+C,+BAAG,CAAC/C,OAAJ,GAAc0H,SAAd;;AAxCgB;AA0ClBb,uCAAW,CAAC3D,IAAZ,CAAiBH,GAAjB;;AA1CkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAJF;;AAAA,kCAIZ+D,WAJY;AAAA;AAAA;AAAA;;AAAA,sBAgDd3B,QAAQ,KAAK,oBAhDC;AAAA;AAAA;AAAA;;AAAA,4DAsDXG,iBAAiB,CAACkB,IAAlB,CAAuBmB,OAAvB,EAtDW;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,2CAkDd;AACAzI,iBAnDc,kDAqDZ0B,IArDY,gBAqDZA,IArDY,EAqDNqF,QArDM,gBAqDNA,QArDM,EAqDIxF,IArDJ,gBAqDIA,IArDJ,EAqDUT,OArDV,gBAqDUA,OArDV;AAAA;AAAA,uBAuDR8G,WAAW,CACf;AAAElG,sBAAI,EAAJA,IAAF;AAAQqF,0BAAQ,EAARA,QAAR;AAAkBxF,sBAAI,EAAJA,IAAlB;AAAwBT,yBAAO,EAAEA,OAAO,GAAG,MAAH,GAAY;AAApD,iBADe,YAERd,CAAC,GAAG,CAFI,WAEE0B,IAFF,OAvDH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBA4DPuE,QAAQ,KAAK,SA5DN;AAAA;AAAA;AAAA;;AA6DVyC,0BA7DU,GA6DG,CAAC,MAAD,EAAS,aAAT,EAAwB,UAAxB,CA7DH;;AA8DhB,oBAAIzJ,cAAc,KAAK,SAAvB,EAAkC;AAChCyJ,4BAAU,CAAC1E,IAAX,CAAgB,MAAhB;AACD;;AACD0E,0BAAU,CAAC1E,IAAX,CAAgB,SAAhB;AAjEgB;AAAA,uBAqEN3B,sBAAY,CAACC,OAAO,CAAC,CAAD,CAAR,CArEN;;AAAA;AAAA;AAmEdqG,oBAnEc,uBAmEdA,IAnEc;AAoENzE,sBApEM,uBAoEd0E,IApEc,CAoEN1E,MApEM;AAsEVhB,sBAtEU,GAsEFe,0BAA0B,CAACC,MAAD,EAASwE,UAAT,CAtExB;;AAAA,qBAuEZxF,MAvEY;AAAA;AAAA;AAAA;;AAAA,sBAwER;AACJkF,iCAAe,EAAElF;AADb,iBAxEQ;;AAAA;AAAA,6DA8EWyF,IAAI,CAACF,OAAL,EA9EX;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,6CA8EJhE,KA9EI,oBA8EGZ,GA9EH;AA+ERX,uBA/EQ,GA+EAsB,cAAc,CAACX,GAAD,EAAM6E,UAAN,EAAkBjE,KAAlB,CA/Ed;;AAAA,qBAgFVvB,OAhFU;AAAA;AAAA;AAAA;;AAAA,sBAiFN;AACJkF,iCAAe,EAAElF;AADb,iBAjFM;;AAAA;AAAA;AAAA,uBAqFR0E,WAAW,CAAC/D,GAAD,YAAaY,KAAK,GAAG,CAArB,WAA2BZ,GAAG,CAACnC,IAA/B,OArFH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBAuFPuE,QAAQ,KAAK,SAvFN;AAAA;AAAA;AAAA;;AAAA;AAAA,uBAwFO5D,sBAAY,CAACoF,OAAO,CAAC,CAAD,CAAR,EAAa;AAC9CvF,wBAAM,EAAE;AADsC,iBAAb,CAxFnB;;AAAA;AAAA;AAwFRyG,qBAxFQ,wBAwFRA,IAxFQ;AAAA,6DA4F0BA,KAAI,CAACF,OAAL,EA5F1B;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,6CA4FJzI,EA5FI,qDA4FA0B,KA5FA,qBA4FMqF,SA5FN,qBA4FgBxF,KA5FhB;AAAA;AAAA,uBA6FRqG,WAAW,CACf;AAAElG,sBAAI,EAAJA,KAAF;AAAQqF,0BAAQ,EAARA,SAAR;AAAkBxF,sBAAI,EAAJA;AAAlB,iBADe,YAERvB,EAAC,GAAG,CAFI,WAEE0B,KAFF,OA7FH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAmGhBiF,uBAAO,CAACkC,IAAR;AACAlC,uBAAO,CAACkC,IAAR,cAA0B5C,QAA1B;;AApGgB;AAAA,oBAuGb0B,WAAW,CAACnI,MAvGC;AAAA;AAAA;AAAA;;AAAA,kDAwGT1B,MAAM,CAAC2I,MAAP,CAAcC,OAAd,CACL,wFADK,CAxGS;;AAAA;AA4GZoC,sCA5GY,GA4Ga,EA5Gb;AA6GlBnB,2BAAW,CAAC7H,OAAZ,CAAoB,UAACiJ,GAAD,EAAS;AAC3B,sBAAMC,EAAE,GAAGrE,OAAO,EAAlB;AACAmE,wCAAsB,CAACE,EAAD,CAAtB,mBACKD,GADL;AAEEhC,4BAAQ,EAAEgC,GAAG,CAACjI,OAAJ,GACNiI,GAAG,CAAChC,QADE,GAENxB,0BAA0B,CAACwD,GAAG,CAAChC,QAAL,CAJhC;AAKEiC,sBAAE,EAAFA;AALF;AAOD,iBATD;AAWMC,qBAxHY,GAwHJ,eAxHI;AAAA,gCAyHWzD,YAAY,CAAC;AACxC0D,oCAAkB,iDACfD,KADe,oBACF3J,YADE;AACY0J,sBAAE,EAAEC;AADhB,0CADsB;AAIxCH,wCAAsB,EAAtBA;AAJwC,iBAAD,CAzHvB,EAyHDK,OAzHC,iBAyHTF,KAzHS;;AAgIlB,oBAAIE,OAAO,IAAIA,OAAO,CAAC3J,MAAvB,EAA+B;AAC7B2G,4BAAU,CACRgD,OAAO,CAAC1J,GAAR,CAAY,UAAC2J,CAAD,EAAO;AACjB,wBAAMC,KAAK,GAAG,gBACTP,sBAAsB,CAACM,CAAC,CAACJ,EAAH,CADhB,EAENI,CAFM;AAGTE,6BAAO,EAAEF,CAAC,CAACG,MAAF,KAAa,CAAC,CAHd;AAITP,wBAAE,EAAErE,OAAO;AAJF,sBAAX;;AAMA0E,yBAAK,CAACjC,KAAN,GAAciC,KAAK,CAACjC,KAAN,IAAepC,aAAa,CAACqE,KAAK,CAAC9H,IAAP,CAA1C;AACA,2BAAO8H,KAAP;AACD,mBATD,CADQ,CAAV;AAYD,iBAbD,MAaO;AACLvL,wBAAM,CAAC2I,MAAP,CAAcC,OAAd,SACQzH,cADR;AAGD;;AAjJiB;AAAA;;AAAA;AAAA;AAAA;AAmJlB0H,uBAAO,CAACzD,KAAR;;AAnJkB,qBAoJd,aAAMkF,eApJQ;AAAA;AAAA;AAAA;;AAAA,sBAqJV,IAAIrD,eAAJ,0CAAuBkB,QAAvB,IAAkC,aAAMmC,eAAxC,oBArJU;;AAAA;AAuJhBtK,sBAAM,CAAC2I,MAAP,CAAcvD,KAAd,uBACsBjE,cADtB;;AAvJgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAD;;AAAA;AAAA;AAAA;AAAA,QAVvB;AAuKE,QAAI,EAAC;AAvKP,IAhKF,CADF;AA4UD,CAtXgC,CAA1B;AAwXP,IAAI,CAACnB,MAAM,CAAC0L,WAAZ,EAAyB1L,MAAM,CAAC0L,WAAP,GAAqB,EAArB;AACzB1L,MAAM,CAAC0L,WAAP,CAAmB/D,oBAAnB,GAA0CA,oBAA1C;AACA3H,MAAM,CAAC0L,WAAP,CAAmB5D,iBAAnB,GAAuCA,iBAAvC;AACA9H,MAAM,CAAC0L,WAAP,CAAmB3D,mBAAnB,GAAyCA,mBAAzC;AAEA,IAAM0B,gBAAgB,GAAG,CAAC,MAAD,EAAS,UAAT,EAAqBpJ,aAArB,EAAgC,SAAhC,CAAzB;AACA,IAAMqJ,sBAAsB,GAAG,CAAC,MAAD,EAAS,UAAT,EAAqBrJ,aAArB,EAAgC,SAAhC,CAA/B,C","file":"ove-auto-annotate.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse {\n\t\tvar a = factory();\n\t\tfor(var i in a) (typeof exports === 'object' ? exports : root)[i] = a[i];\n\t}\n})(window, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 3);\n","module.exports = require(\"regenerator-runtime\");\n","/* @license\nPapa Parse\nv5.3.1\nhttps://github.com/mholt/PapaParse\nLicense: MIT\n*/\n!function(e,t){\"function\"==typeof define&&define.amd?define([],t):\"object\"==typeof module&&\"undefined\"!=typeof exports?module.exports=t():e.Papa=t()}(this,function s(){\"use strict\";var f=\"undefined\"!=typeof self?self:\"undefined\"!=typeof window?window:void 0!==f?f:{};var n=!f.document&&!!f.postMessage,o=n&&/blob:/i.test((f.location||{}).protocol),a={},h=0,b={parse:function(e,t){var i=(t=t||{}).dynamicTyping||!1;M(i)&&(t.dynamicTypingFunction=i,i={});if(t.dynamicTyping=i,t.transform=!!M(t.transform)&&t.transform,t.worker&&b.WORKERS_SUPPORTED){var r=function(){if(!b.WORKERS_SUPPORTED)return!1;var e=(i=f.URL||f.webkitURL||null,r=s.toString(),b.BLOB_URL||(b.BLOB_URL=i.createObjectURL(new Blob([\"(\",r,\")();\"],{type:\"text/javascript\"})))),t=new f.Worker(e);var i,r;return t.onmessage=_,t.id=h++,a[t.id]=t}();return r.userStep=t.step,r.userChunk=t.chunk,r.userComplete=t.complete,r.userError=t.error,t.step=M(t.step),t.chunk=M(t.chunk),t.complete=M(t.complete),t.error=M(t.error),delete t.worker,void r.postMessage({input:e,config:t,workerId:r.id})}var n=null;b.NODE_STREAM_INPUT,\"string\"==typeof e?n=t.download?new l(t):new p(t):!0===e.readable&&M(e.read)&&M(e.on)?n=new g(t):(f.File&&e instanceof File||e instanceof Object)&&(n=new c(t));return n.stream(e)},unparse:function(e,t){var n=!1,_=!0,m=\",\",y=\"\\r\\n\",s='\"',a=s+s,i=!1,r=null,o=!1;!function(){if(\"object\"!=typeof t)return;\"string\"!=typeof t.delimiter||b.BAD_DELIMITERS.filter(function(e){return-1!==t.delimiter.indexOf(e)}).length||(m=t.delimiter);(\"boolean\"==typeof t.quotes||\"function\"==typeof t.quotes||Array.isArray(t.quotes))&&(n=t.quotes);\"boolean\"!=typeof t.skipEmptyLines&&\"string\"!=typeof t.skipEmptyLines||(i=t.skipEmptyLines);\"string\"==typeof t.newline&&(y=t.newline);\"string\"==typeof t.quoteChar&&(s=t.quoteChar);\"boolean\"==typeof t.header&&(_=t.header);if(Array.isArray(t.columns)){if(0===t.columns.length)throw new Error(\"Option columns is empty\");r=t.columns}void 0!==t.escapeChar&&(a=t.escapeChar+s);\"boolean\"==typeof t.escapeFormulae&&(o=t.escapeFormulae)}();var h=new RegExp(j(s),\"g\");\"string\"==typeof e&&(e=JSON.parse(e));if(Array.isArray(e)){if(!e.length||Array.isArray(e[0]))return u(null,e,i);if(\"object\"==typeof e[0])return u(r||Object.keys(e[0]),e,i)}else if(\"object\"==typeof e)return\"string\"==typeof e.data&&(e.data=JSON.parse(e.data)),Array.isArray(e.data)&&(e.fields||(e.fields=e.meta&&e.meta.fields),e.fields||(e.fields=Array.isArray(e.data[0])?e.fields:\"object\"==typeof e.data[0]?Object.keys(e.data[0]):[]),Array.isArray(e.data[0])||\"object\"==typeof e.data[0]||(e.data=[e.data])),u(e.fields||[],e.data||[],i);throw new Error(\"Unable to serialize unrecognized input\");function u(e,t,i){var r=\"\";\"string\"==typeof e&&(e=JSON.parse(e)),\"string\"==typeof t&&(t=JSON.parse(t));var n=Array.isArray(e)&&0<e.length,s=!Array.isArray(t[0]);if(n&&_){for(var a=0;a<e.length;a++)0<a&&(r+=m),r+=v(e[a],a);0<t.length&&(r+=y)}for(var o=0;o<t.length;o++){var h=n?e.length:t[o].length,u=!1,f=n?0===Object.keys(t[o]).length:0===t[o].length;if(i&&!n&&(u=\"greedy\"===i?\"\"===t[o].join(\"\").trim():1===t[o].length&&0===t[o][0].length),\"greedy\"===i&&n){for(var d=[],l=0;l<h;l++){var c=s?e[l]:l;d.push(t[o][c])}u=\"\"===d.join(\"\").trim()}if(!u){for(var p=0;p<h;p++){0<p&&!f&&(r+=m);var g=n&&s?e[p]:p;r+=v(t[o][g],p)}o<t.length-1&&(!i||0<h&&!f)&&(r+=y)}}return r}function v(e,t){if(null==e)return\"\";if(e.constructor===Date)return JSON.stringify(e).slice(1,25);!0===o&&\"string\"==typeof e&&null!==e.match(/^[=+\\-@].*$/)&&(e=\"'\"+e);var i=e.toString().replace(h,a),r=\"boolean\"==typeof n&&n||\"function\"==typeof n&&n(e,t)||Array.isArray(n)&&n[t]||function(e,t){for(var i=0;i<t.length;i++)if(-1<e.indexOf(t[i]))return!0;return!1}(i,b.BAD_DELIMITERS)||-1<i.indexOf(m)||\" \"===i.charAt(0)||\" \"===i.charAt(i.length-1);return r?s+i+s:i}}};if(b.RECORD_SEP=String.fromCharCode(30),b.UNIT_SEP=String.fromCharCode(31),b.BYTE_ORDER_MARK=\"\\ufeff\",b.BAD_DELIMITERS=[\"\\r\",\"\\n\",'\"',b.BYTE_ORDER_MARK],b.WORKERS_SUPPORTED=!n&&!!f.Worker,b.NODE_STREAM_INPUT=1,b.LocalChunkSize=10485760,b.RemoteChunkSize=5242880,b.DefaultDelimiter=\",\",b.Parser=E,b.ParserHandle=i,b.NetworkStreamer=l,b.FileStreamer=c,b.StringStreamer=p,b.ReadableStreamStreamer=g,f.jQuery){var d=f.jQuery;d.fn.parse=function(o){var i=o.config||{},h=[];return this.each(function(e){if(!(\"INPUT\"===d(this).prop(\"tagName\").toUpperCase()&&\"file\"===d(this).attr(\"type\").toLowerCase()&&f.FileReader)||!this.files||0===this.files.length)return!0;for(var t=0;t<this.files.length;t++)h.push({file:this.files[t],inputElem:this,instanceConfig:d.extend({},i)})}),e(),this;function e(){if(0!==h.length){var e,t,i,r,n=h[0];if(M(o.before)){var s=o.before(n.file,n.inputElem);if(\"object\"==typeof s){if(\"abort\"===s.action)return e=\"AbortError\",t=n.file,i=n.inputElem,r=s.reason,void(M(o.error)&&o.error({name:e},t,i,r));if(\"skip\"===s.action)return void u();\"object\"==typeof s.config&&(n.instanceConfig=d.extend(n.instanceConfig,s.config))}else if(\"skip\"===s)return void u()}var a=n.instanceConfig.complete;n.instanceConfig.complete=function(e){M(a)&&a(e,n.file,n.inputElem),u()},b.parse(n.file,n.instanceConfig)}else M(o.complete)&&o.complete()}function u(){h.splice(0,1),e()}}}function u(e){this._handle=null,this._finished=!1,this._completed=!1,this._halted=!1,this._input=null,this._baseIndex=0,this._partialLine=\"\",this._rowCount=0,this._start=0,this._nextChunk=null,this.isFirstChunk=!0,this._completeResults={data:[],errors:[],meta:{}},function(e){var t=w(e);t.chunkSize=parseInt(t.chunkSize),e.step||e.chunk||(t.chunkSize=null);this._handle=new i(t),(this._handle.streamer=this)._config=t}.call(this,e),this.parseChunk=function(e,t){if(this.isFirstChunk&&M(this._config.beforeFirstChunk)){var i=this._config.beforeFirstChunk(e);void 0!==i&&(e=i)}this.isFirstChunk=!1,this._halted=!1;var r=this._partialLine+e;this._partialLine=\"\";var n=this._handle.parse(r,this._baseIndex,!this._finished);if(!this._handle.paused()&&!this._handle.aborted()){var s=n.meta.cursor;this._finished||(this._partialLine=r.substring(s-this._baseIndex),this._baseIndex=s),n&&n.data&&(this._rowCount+=n.data.length);var a=this._finished||this._config.preview&&this._rowCount>=this._config.preview;if(o)f.postMessage({results:n,workerId:b.WORKER_ID,finished:a});else if(M(this._config.chunk)&&!t){if(this._config.chunk(n,this._handle),this._handle.paused()||this._handle.aborted())return void(this._halted=!0);n=void 0,this._completeResults=void 0}return this._config.step||this._config.chunk||(this._completeResults.data=this._completeResults.data.concat(n.data),this._completeResults.errors=this._completeResults.errors.concat(n.errors),this._completeResults.meta=n.meta),this._completed||!a||!M(this._config.complete)||n&&n.meta.aborted||(this._config.complete(this._completeResults,this._input),this._completed=!0),a||n&&n.meta.paused||this._nextChunk(),n}this._halted=!0},this._sendError=function(e){M(this._config.error)?this._config.error(e):o&&this._config.error&&f.postMessage({workerId:b.WORKER_ID,error:e,finished:!1})}}function l(e){var r;(e=e||{}).chunkSize||(e.chunkSize=b.RemoteChunkSize),u.call(this,e),this._nextChunk=n?function(){this._readChunk(),this._chunkLoaded()}:function(){this._readChunk()},this.stream=function(e){this._input=e,this._nextChunk()},this._readChunk=function(){if(this._finished)this._chunkLoaded();else{if(r=new XMLHttpRequest,this._config.withCredentials&&(r.withCredentials=this._config.withCredentials),n||(r.onload=v(this._chunkLoaded,this),r.onerror=v(this._chunkError,this)),r.open(this._config.downloadRequestBody?\"POST\":\"GET\",this._input,!n),this._config.downloadRequestHeaders){var e=this._config.downloadRequestHeaders;for(var t in e)r.setRequestHeader(t,e[t])}if(this._config.chunkSize){var i=this._start+this._config.chunkSize-1;r.setRequestHeader(\"Range\",\"bytes=\"+this._start+\"-\"+i)}try{r.send(this._config.downloadRequestBody)}catch(e){this._chunkError(e.message)}n&&0===r.status&&this._chunkError()}},this._chunkLoaded=function(){4===r.readyState&&(r.status<200||400<=r.status?this._chunkError():(this._start+=this._config.chunkSize?this._config.chunkSize:r.responseText.length,this._finished=!this._config.chunkSize||this._start>=function(e){var t=e.getResponseHeader(\"Content-Range\");if(null===t)return-1;return parseInt(t.substring(t.lastIndexOf(\"/\")+1))}(r),this.parseChunk(r.responseText)))},this._chunkError=function(e){var t=r.statusText||e;this._sendError(new Error(t))}}function c(e){var r,n;(e=e||{}).chunkSize||(e.chunkSize=b.LocalChunkSize),u.call(this,e);var s=\"undefined\"!=typeof FileReader;this.stream=function(e){this._input=e,n=e.slice||e.webkitSlice||e.mozSlice,s?((r=new FileReader).onload=v(this._chunkLoaded,this),r.onerror=v(this._chunkError,this)):r=new FileReaderSync,this._nextChunk()},this._nextChunk=function(){this._finished||this._config.preview&&!(this._rowCount<this._config.preview)||this._readChunk()},this._readChunk=function(){var e=this._input;if(this._config.chunkSize){var t=Math.min(this._start+this._config.chunkSize,this._input.size);e=n.call(e,this._start,t)}var i=r.readAsText(e,this._config.encoding);s||this._chunkLoaded({target:{result:i}})},this._chunkLoaded=function(e){this._start+=this._config.chunkSize,this._finished=!this._config.chunkSize||this._start>=this._input.size,this.parseChunk(e.target.result)},this._chunkError=function(){this._sendError(r.error)}}function p(e){var i;u.call(this,e=e||{}),this.stream=function(e){return i=e,this._nextChunk()},this._nextChunk=function(){if(!this._finished){var e,t=this._config.chunkSize;return t?(e=i.substring(0,t),i=i.substring(t)):(e=i,i=\"\"),this._finished=!i,this.parseChunk(e)}}}function g(e){u.call(this,e=e||{});var t=[],i=!0,r=!1;this.pause=function(){u.prototype.pause.apply(this,arguments),this._input.pause()},this.resume=function(){u.prototype.resume.apply(this,arguments),this._input.resume()},this.stream=function(e){this._input=e,this._input.on(\"data\",this._streamData),this._input.on(\"end\",this._streamEnd),this._input.on(\"error\",this._streamError)},this._checkIsFinished=function(){r&&1===t.length&&(this._finished=!0)},this._nextChunk=function(){this._checkIsFinished(),t.length?this.parseChunk(t.shift()):i=!0},this._streamData=v(function(e){try{t.push(\"string\"==typeof e?e:e.toString(this._config.encoding)),i&&(i=!1,this._checkIsFinished(),this.parseChunk(t.shift()))}catch(e){this._streamError(e)}},this),this._streamError=v(function(e){this._streamCleanUp(),this._sendError(e)},this),this._streamEnd=v(function(){this._streamCleanUp(),r=!0,this._streamData(\"\")},this),this._streamCleanUp=v(function(){this._input.removeListener(\"data\",this._streamData),this._input.removeListener(\"end\",this._streamEnd),this._input.removeListener(\"error\",this._streamError)},this)}function i(m){var a,o,h,r=Math.pow(2,53),n=-r,s=/^\\s*-?(\\d+\\.?|\\.\\d+|\\d+\\.\\d+)([eE][-+]?\\d+)?\\s*$/,u=/^(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d:[0-5]\\d\\.\\d+([+-][0-2]\\d:[0-5]\\d|Z))|(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d:[0-5]\\d([+-][0-2]\\d:[0-5]\\d|Z))|(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d([+-][0-2]\\d:[0-5]\\d|Z))$/,t=this,i=0,f=0,d=!1,e=!1,l=[],c={data:[],errors:[],meta:{}};if(M(m.step)){var p=m.step;m.step=function(e){if(c=e,_())g();else{if(g(),0===c.data.length)return;i+=e.data.length,m.preview&&i>m.preview?o.abort():(c.data=c.data[0],p(c,t))}}}function y(e){return\"greedy\"===m.skipEmptyLines?\"\"===e.join(\"\").trim():1===e.length&&0===e[0].length}function g(){if(c&&h&&(k(\"Delimiter\",\"UndetectableDelimiter\",\"Unable to auto-detect delimiting character; defaulted to '\"+b.DefaultDelimiter+\"'\"),h=!1),m.skipEmptyLines)for(var e=0;e<c.data.length;e++)y(c.data[e])&&c.data.splice(e--,1);return _()&&function(){if(!c)return;function e(e,t){M(m.transformHeader)&&(e=m.transformHeader(e,t)),l.push(e)}if(Array.isArray(c.data[0])){for(var t=0;_()&&t<c.data.length;t++)c.data[t].forEach(e);c.data.splice(0,1)}else c.data.forEach(e)}(),function(){if(!c||!m.header&&!m.dynamicTyping&&!m.transform)return c;function e(e,t){var i,r=m.header?{}:[];for(i=0;i<e.length;i++){var n=i,s=e[i];m.header&&(n=i>=l.length?\"__parsed_extra\":l[i]),m.transform&&(s=m.transform(s,n)),s=v(n,s),\"__parsed_extra\"===n?(r[n]=r[n]||[],r[n].push(s)):r[n]=s}return m.header&&(i>l.length?k(\"FieldMismatch\",\"TooManyFields\",\"Too many fields: expected \"+l.length+\" fields but parsed \"+i,f+t):i<l.length&&k(\"FieldMismatch\",\"TooFewFields\",\"Too few fields: expected \"+l.length+\" fields but parsed \"+i,f+t)),r}var t=1;!c.data.length||Array.isArray(c.data[0])?(c.data=c.data.map(e),t=c.data.length):c.data=e(c.data,0);m.header&&c.meta&&(c.meta.fields=l);return f+=t,c}()}function _(){return m.header&&0===l.length}function v(e,t){return i=e,m.dynamicTypingFunction&&void 0===m.dynamicTyping[i]&&(m.dynamicTyping[i]=m.dynamicTypingFunction(i)),!0===(m.dynamicTyping[i]||m.dynamicTyping)?\"true\"===t||\"TRUE\"===t||\"false\"!==t&&\"FALSE\"!==t&&(function(e){if(s.test(e)){var t=parseFloat(e);if(n<t&&t<r)return!0}return!1}(t)?parseFloat(t):u.test(t)?new Date(t):\"\"===t?null:t):t;var i}function k(e,t,i,r){var n={type:e,code:t,message:i};void 0!==r&&(n.row=r),c.errors.push(n)}this.parse=function(e,t,i){var r=m.quoteChar||'\"';if(m.newline||(m.newline=function(e,t){e=e.substring(0,1048576);var i=new RegExp(j(t)+\"([^]*?)\"+j(t),\"gm\"),r=(e=e.replace(i,\"\")).split(\"\\r\"),n=e.split(\"\\n\"),s=1<n.length&&n[0].length<r[0].length;if(1===r.length||s)return\"\\n\";for(var a=0,o=0;o<r.length;o++)\"\\n\"===r[o][0]&&a++;return a>=r.length/2?\"\\r\\n\":\"\\r\"}(e,r)),h=!1,m.delimiter)M(m.delimiter)&&(m.delimiter=m.delimiter(e),c.meta.delimiter=m.delimiter);else{var n=function(e,t,i,r,n){var s,a,o,h;n=n||[\",\",\"\\t\",\"|\",\";\",b.RECORD_SEP,b.UNIT_SEP];for(var u=0;u<n.length;u++){var f=n[u],d=0,l=0,c=0;o=void 0;for(var p=new E({comments:r,delimiter:f,newline:t,preview:10}).parse(e),g=0;g<p.data.length;g++)if(i&&y(p.data[g]))c++;else{var _=p.data[g].length;l+=_,void 0!==o?0<_&&(d+=Math.abs(_-o),o=_):o=_}0<p.data.length&&(l/=p.data.length-c),(void 0===a||d<=a)&&(void 0===h||h<l)&&1.99<l&&(a=d,s=f,h=l)}return{successful:!!(m.delimiter=s),bestDelimiter:s}}(e,m.newline,m.skipEmptyLines,m.comments,m.delimitersToGuess);n.successful?m.delimiter=n.bestDelimiter:(h=!0,m.delimiter=b.DefaultDelimiter),c.meta.delimiter=m.delimiter}var s=w(m);return m.preview&&m.header&&s.preview++,a=e,o=new E(s),c=o.parse(a,t,i),g(),d?{meta:{paused:!0}}:c||{meta:{paused:!1}}},this.paused=function(){return d},this.pause=function(){d=!0,o.abort(),a=M(m.chunk)?\"\":a.substring(o.getCharIndex())},this.resume=function(){t.streamer._halted?(d=!1,t.streamer.parseChunk(a,!0)):setTimeout(t.resume,3)},this.aborted=function(){return e},this.abort=function(){e=!0,o.abort(),c.meta.aborted=!0,M(m.complete)&&m.complete(c),a=\"\"}}function j(e){return e.replace(/[.*+?^${}()|[\\]\\\\]/g,\"\\\\$&\")}function E(e){var S,O=(e=e||{}).delimiter,x=e.newline,I=e.comments,T=e.step,D=e.preview,A=e.fastMode,L=S=void 0===e.quoteChar?'\"':e.quoteChar;if(void 0!==e.escapeChar&&(L=e.escapeChar),(\"string\"!=typeof O||-1<b.BAD_DELIMITERS.indexOf(O))&&(O=\",\"),I===O)throw new Error(\"Comment character same as delimiter\");!0===I?I=\"#\":(\"string\"!=typeof I||-1<b.BAD_DELIMITERS.indexOf(I))&&(I=!1),\"\\n\"!==x&&\"\\r\"!==x&&\"\\r\\n\"!==x&&(x=\"\\n\");var F=0,z=!1;this.parse=function(r,t,i){if(\"string\"!=typeof r)throw new Error(\"Input must be a string\");var n=r.length,e=O.length,s=x.length,a=I.length,o=M(T),h=[],u=[],f=[],d=F=0;if(!r)return C();if(A||!1!==A&&-1===r.indexOf(S)){for(var l=r.split(x),c=0;c<l.length;c++){if(f=l[c],F+=f.length,c!==l.length-1)F+=x.length;else if(i)return C();if(!I||f.substring(0,a)!==I){if(o){if(h=[],k(f.split(O)),R(),z)return C()}else k(f.split(O));if(D&&D<=c)return h=h.slice(0,D),C(!0)}}return C()}for(var p=r.indexOf(O,F),g=r.indexOf(x,F),_=new RegExp(j(L)+j(S),\"g\"),m=r.indexOf(S,F);;)if(r[F]!==S)if(I&&0===f.length&&r.substring(F,F+a)===I){if(-1===g)return C();F=g+s,g=r.indexOf(x,F),p=r.indexOf(O,F)}else if(-1!==p&&(p<g||-1===g))f.push(r.substring(F,p)),F=p+e,p=r.indexOf(O,F);else{if(-1===g)break;if(f.push(r.substring(F,g)),w(g+s),o&&(R(),z))return C();if(D&&h.length>=D)return C(!0)}else for(m=F,F++;;){if(-1===(m=r.indexOf(S,m+1)))return i||u.push({type:\"Quotes\",code:\"MissingQuotes\",message:\"Quoted field unterminated\",row:h.length,index:F}),E();if(m===n-1)return E(r.substring(F,m).replace(_,S));if(S!==L||r[m+1]!==L){if(S===L||0===m||r[m-1]!==L){-1!==p&&p<m+1&&(p=r.indexOf(O,m+1)),-1!==g&&g<m+1&&(g=r.indexOf(x,m+1));var y=b(-1===g?p:Math.min(p,g));if(r[m+1+y]===O){f.push(r.substring(F,m).replace(_,S)),r[F=m+1+y+e]!==S&&(m=r.indexOf(S,F)),p=r.indexOf(O,F),g=r.indexOf(x,F);break}var v=b(g);if(r.substring(m+1+v,m+1+v+s)===x){if(f.push(r.substring(F,m).replace(_,S)),w(m+1+v+s),p=r.indexOf(O,F),m=r.indexOf(S,F),o&&(R(),z))return C();if(D&&h.length>=D)return C(!0);break}u.push({type:\"Quotes\",code:\"InvalidQuotes\",message:\"Trailing quote on quoted field is malformed\",row:h.length,index:F}),m++}}else m++}return E();function k(e){h.push(e),d=F}function b(e){var t=0;if(-1!==e){var i=r.substring(m+1,e);i&&\"\"===i.trim()&&(t=i.length)}return t}function E(e){return i||(void 0===e&&(e=r.substring(F)),f.push(e),F=n,k(f),o&&R()),C()}function w(e){F=e,k(f),f=[],g=r.indexOf(x,F)}function C(e){return{data:h,errors:u,meta:{delimiter:O,linebreak:x,aborted:z,truncated:!!e,cursor:d+(t||0)}}}function R(){T(C()),h=[],u=[]}},this.abort=function(){z=!0},this.getCharIndex=function(){return F}}function _(e){var t=e.data,i=a[t.workerId],r=!1;if(t.error)i.userError(t.error,t.file);else if(t.results&&t.results.data){var n={abort:function(){r=!0,m(t.workerId,{data:[],errors:[],meta:{aborted:!0}})},pause:y,resume:y};if(M(i.userStep)){for(var s=0;s<t.results.data.length&&(i.userStep({data:t.results.data[s],errors:t.results.errors,meta:t.results.meta},n),!r);s++);delete t.results}else M(i.userChunk)&&(i.userChunk(t.results,n,t.file),delete t.results)}t.finished&&!r&&m(t.workerId,t.results)}function m(e,t){var i=a[e];M(i.userComplete)&&i.userComplete(t),i.terminate(),delete a[e]}function y(){throw new Error(\"Not implemented.\")}function w(e){if(\"object\"!=typeof e||null===e)return e;var t=Array.isArray(e)?[]:{};for(var i in e)t[i]=w(e[i]);return t}function v(e,t){return function(){e.apply(t,arguments)}}function M(e){return\"function\"==typeof e}return o&&(f.onmessage=function(e){var t=e.data;void 0===b.WORKER_ID&&t&&(b.WORKER_ID=t.workerId);if(\"string\"==typeof t.input)f.postMessage({workerId:b.WORKER_ID,results:b.parse(t.input,t.config),finished:!0});else if(f.File&&t.input instanceof File||t.input instanceof Object){var i=b.parse(t.input,t.config);i&&f.postMessage({workerId:b.WORKER_ID,results:i,finished:!0})}}),(l.prototype=Object.create(u.prototype)).constructor=l,(c.prototype=Object.create(u.prototype)).constructor=c,(p.prototype=Object.create(p.prototype)).constructor=p,(g.prototype=Object.create(u.prototype)).constructor=g,b});","//download.js v4.2, by dandavis; 2008-2016. [MIT] see http://danml.com/download.html for tests/usage\n// v1 landed a FF+Chrome compat way of downloading strings to local un-named files, upgraded to use a hidden frame and optional mime\n// v2 added named files via a[download], msSaveBlob, IE (10+) support, and window.URL support for larger+faster saves than dataURLs\n// v3 added dataURL and Blob Input, bind-toggle arity, and legacy dataURL fallback was improved with force-download mime and base64 support. 3.1 improved safari handling.\n// v4 adds AMD/UMD, commonJS, and plain browser support\n// v4.1 adds url download capability via solo URL argument (same domain/CORS only)\n// v4.2 adds semantic variable names, long (over 2MB) dataURL support, and hidden by default temp anchors\n// https://github.com/rndme/download\n\n(function (root, factory) {\n\tif (typeof define === 'function' && define.amd) {\n\t\t// AMD. Register as an anonymous module.\n\t\tdefine([], factory);\n\t} else if (typeof exports === 'object') {\n\t\t// Node. Does not work with strict CommonJS, but\n\t\t// only CommonJS-like environments that support module.exports,\n\t\t// like Node.\n\t\tmodule.exports = factory();\n\t} else {\n\t\t// Browser globals (root is window)\n\t\troot.download = factory();\n  }\n}(this, function () {\n\n\treturn function download(data, strFileName, strMimeType) {\n\n\t\tvar self = window, // this script is only for browsers anyway...\n\t\t\tdefaultMime = \"application/octet-stream\", // this default mime also triggers iframe downloads\n\t\t\tmimeType = strMimeType || defaultMime,\n\t\t\tpayload = data,\n\t\t\turl = !strFileName && !strMimeType && payload,\n\t\t\tanchor = document.createElement(\"a\"),\n\t\t\ttoString = function(a){return String(a);},\n\t\t\tmyBlob = (self.Blob || self.MozBlob || self.WebKitBlob || toString),\n\t\t\tfileName = strFileName || \"download\",\n\t\t\tblob,\n\t\t\treader;\n\t\t\tmyBlob= myBlob.call ? myBlob.bind(self) : Blob ;\n\t  \n\t\tif(String(this)===\"true\"){ //reverse arguments, allowing download.bind(true, \"text/xml\", \"export.xml\") to act as a callback\n\t\t\tpayload=[payload, mimeType];\n\t\t\tmimeType=payload[0];\n\t\t\tpayload=payload[1];\n\t\t}\n\n\n\t\tif(url && url.length< 2048){ // if no filename and no mime, assume a url was passed as the only argument\n\t\t\tfileName = url.split(\"/\").pop().split(\"?\")[0];\n\t\t\tanchor.href = url; // assign href prop to temp anchor\n\t\t  \tif(anchor.href.indexOf(url) !== -1){ // if the browser determines that it's a potentially valid url path:\n        \t\tvar ajax=new XMLHttpRequest();\n        \t\tajax.open( \"GET\", url, true);\n        \t\tajax.responseType = 'blob';\n        \t\tajax.onload= function(e){ \n\t\t\t\t  download(e.target.response, fileName, defaultMime);\n\t\t\t\t};\n        \t\tsetTimeout(function(){ ajax.send();}, 0); // allows setting custom ajax headers using the return:\n\t\t\t    return ajax;\n\t\t\t} // end if valid url?\n\t\t} // end if url?\n\n\n\t\t//go ahead and download dataURLs right away\n\t\tif(/^data:([\\w+-]+\\/[\\w+.-]+)?[,;]/.test(payload)){\n\t\t\n\t\t\tif(payload.length > (1024*1024*1.999) && myBlob !== toString ){\n\t\t\t\tpayload=dataUrlToBlob(payload);\n\t\t\t\tmimeType=payload.type || defaultMime;\n\t\t\t}else{\t\t\t\n\t\t\t\treturn navigator.msSaveBlob ?  // IE10 can't do a[download], only Blobs:\n\t\t\t\t\tnavigator.msSaveBlob(dataUrlToBlob(payload), fileName) :\n\t\t\t\t\tsaver(payload) ; // everyone else can save dataURLs un-processed\n\t\t\t}\n\t\t\t\n\t\t}else{//not data url, is it a string with special needs?\n\t\t\tif(/([\\x80-\\xff])/.test(payload)){\t\t\t  \n\t\t\t\tvar i=0, tempUiArr= new Uint8Array(payload.length), mx=tempUiArr.length;\n\t\t\t\tfor(i;i<mx;++i) tempUiArr[i]= payload.charCodeAt(i);\n\t\t\t \tpayload=new myBlob([tempUiArr], {type: mimeType});\n\t\t\t}\t\t  \n\t\t}\n\t\tblob = payload instanceof myBlob ?\n\t\t\tpayload :\n\t\t\tnew myBlob([payload], {type: mimeType}) ;\n\n\n\t\tfunction dataUrlToBlob(strUrl) {\n\t\t\tvar parts= strUrl.split(/[:;,]/),\n\t\t\ttype= parts[1],\n\t\t\tdecoder= parts[2] == \"base64\" ? atob : decodeURIComponent,\n\t\t\tbinData= decoder( parts.pop() ),\n\t\t\tmx= binData.length,\n\t\t\ti= 0,\n\t\t\tuiArr= new Uint8Array(mx);\n\n\t\t\tfor(i;i<mx;++i) uiArr[i]= binData.charCodeAt(i);\n\n\t\t\treturn new myBlob([uiArr], {type: type});\n\t\t }\n\n\t\tfunction saver(url, winMode){\n\n\t\t\tif ('download' in anchor) { //html5 A[download]\n\t\t\t\tanchor.href = url;\n\t\t\t\tanchor.setAttribute(\"download\", fileName);\n\t\t\t\tanchor.className = \"download-js-link\";\n\t\t\t\tanchor.innerHTML = \"downloading...\";\n\t\t\t\tanchor.style.display = \"none\";\n\t\t\t\tdocument.body.appendChild(anchor);\n\t\t\t\tsetTimeout(function() {\n\t\t\t\t\tanchor.click();\n\t\t\t\t\tdocument.body.removeChild(anchor);\n\t\t\t\t\tif(winMode===true){setTimeout(function(){ self.URL.revokeObjectURL(anchor.href);}, 250 );}\n\t\t\t\t}, 66);\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\t// handle non-a[download] safari as best we can:\n\t\t\tif(/(Version)\\/(\\d+)\\.(\\d+)(?:\\.(\\d+))?.*Safari\\//.test(navigator.userAgent)) {\n\t\t\t\tif(/^data:/.test(url))\turl=\"data:\"+url.replace(/^data:([\\w\\/\\-\\+]+)/, defaultMime);\n\t\t\t\tif(!window.open(url)){ // popup blocked, offer direct download:\n\t\t\t\t\tif(confirm(\"Displaying New Document\\n\\nUse Save As... to download, then click back to return to this page.\")){ location.href=url; }\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\t//do iframe dataURL download (old ch+FF):\n\t\t\tvar f = document.createElement(\"iframe\");\n\t\t\tdocument.body.appendChild(f);\n\n\t\t\tif(!winMode && /^data:/.test(url)){ // force a mime that will download:\n\t\t\t\turl=\"data:\"+url.replace(/^data:([\\w\\/\\-\\+]+)/, defaultMime);\n\t\t\t}\n\t\t\tf.src=url;\n\t\t\tsetTimeout(function(){ document.body.removeChild(f); }, 333);\n\n\t\t}//end saver\n\n\n\n\n\t\tif (navigator.msSaveBlob) { // IE10+ : (has Blob, but not a[download] or URL)\n\t\t\treturn navigator.msSaveBlob(blob, fileName);\n\t\t}\n\n\t\tif(self.URL){ // simple fast and modern way using Blob and URL:\n\t\t\tsaver(self.URL.createObjectURL(blob), true);\n\t\t}else{\n\t\t\t// handle non-Blob()+non-URL browsers:\n\t\t\tif(typeof blob === \"string\" || blob.constructor===toString ){\n\t\t\t\ttry{\n\t\t\t\t\treturn saver( \"data:\" +  mimeType   + \";base64,\"  +  self.btoa(blob)  );\n\t\t\t\t}catch(y){\n\t\t\t\t\treturn saver( \"data:\" +  mimeType   + \",\" + encodeURIComponent(blob)  );\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Blob but not URL support:\n\t\t\treader=new FileReader();\n\t\t\treader.onload=function(e){\n\t\t\t\tsaver(this.result);\n\t\t\t};\n\t\t\treader.readAsDataURL(blob);\n\t\t}\n\t\treturn true;\n\t}; /* end download() */\n}));\n","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","export const formName = \"autoAnnotate\";\n","import { formName } from \"./constants\";\nconst {\n  startCase,\n  compose,\n  hideDialog,\n  typeField,\n  pluralize,\n  React,\n  useEffect,\n  DataTable,\n  DialogFooter,\n  withSelectedEntities,\n  withSelectTableRecords,\n  tidyUpAnnotation\n} = window.addOnGlobals;\n\nconst schemaFeatures = [\"name\", typeField, \"start\", \"end\", \"strand\"];\nconst schemaOther = [\"name\", \"start\", \"end\", \"strand\"];\nexport default compose(\n  withSelectedEntities(formName),\n  withSelectTableRecords(formName)\n)(function CreateAnnotationsPage(props) {\n  const {\n    newAnnotations,\n    annotationType,\n    annotationVisibilityShow,\n    beforeAnnotationCreate,\n    handleSubmit,\n    selectTableRecords,\n    sequenceData\n  } = props;\n  const ents = props[`${formName}SelectedEntities`];\n  useEffect(() => {\n    selectTableRecords(newAnnotations);\n  }, [newAnnotations, selectTableRecords]);\n  return (\n    <div className=\"bp3-dialog-body\">\n      <div>\n        The following {annotationType}\n        {newAnnotations.length > 1 ? \"s\" : \"\"} will be added:\n        <DataTable\n          isInfinite\n          formName={formName}\n          entities={newAnnotations.map((e) => ({\n            ...e,\n            start: e.start + 1,\n            end: e.end + 1\n          }))}\n          withCheckboxes\n          schema={annotationType === \"feature\" ? schemaFeatures : schemaOther}\n        ></DataTable>\n      </div>\n      <DialogFooter\n        hideModal={hideDialog}\n        onClick={handleSubmit(async () => {\n          const annotationTypePlural = pluralize(annotationType);\n\n          ents.forEach((newAnnotation, i) => {\n            beforeAnnotationCreate &&\n              beforeAnnotationCreate({\n                annotationTypePlural,\n                annotation: newAnnotation,\n                props: props\n              });\n\n            let conditionals = {};\n            if (ents.length > 1) {\n              if (i === 0) {\n                conditionals = {\n                  batchUndoStart: true\n                };\n              } else if (i === ents.length - 1) {\n                conditionals = {\n                  batchUndoEnd: true\n                };\n              } else {\n                conditionals = {\n                  batchUndoMiddle: true\n                };\n              }\n            }\n            props[`upsert${startCase(annotationType)}`](\n              tidyUpAnnotation(newAnnotation, {\n                sequenceData,\n                annotationType: annotationTypePlural\n              }),\n              conditionals\n            );\n            annotationVisibilityShow(annotationTypePlural);\n          });\n\n          hideDialog();\n        })}\n        text=\"Add\"\n      ></DialogFooter>\n    </div>\n  );\n});\n","/* Copyright (C) 2018 TeselaGen Biotechnology, Inc. */\nconst { Tab, Tabs, wrapDialog, React } = window.addOnGlobals;\n\nconst highlightStyle = {\n  background: \"red\",\n  marginTop: 2\n};\nexport const AutoAnnotateBpMatchingDialog = wrapDialog({\n  title: \"Annotation Matching\"\n})(function ({ isRegex }) {\n  return (\n    <div className=\"bp3-dialog-body\">\n      <Tabs defaultSelectedTabId={isRegex ? \"regex\" : \"iupac\"}>\n        <Tab\n          id=\"iupac\"\n          title=\"IUPAC\"\n          panel={\n            <div>\n              <p>\n                When in standard (IUPAC) mode, annotations are matched\n                case-insensitively. You can use any degenerate IUPAC base pair\n                as well as a couple special characters.\n              </p>\n              <h4>Special Characters:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"1fr 5fr\",\n                  maxHeight: 200,\n                  overflow: \"auto\"\n                }}\n              >\n                <div>#</div>\n                <div>\n                  Any arbitrary string of zero or more bases can be matched\n                  here.\n                </div>\n                <div>{\"<\"}</div>\n                <div>Any bases before a {\"<\"} are considered optional</div>\n                <div>{\">\"}</div>\n                <div>Any bases after a {\">\"} are considered optional</div>\n                <div>M</div> <div>AC</div>\n                <div>R</div> <div>AG</div>\n                <div>W</div> <div>AT</div>\n                <div>S</div> <div>CG</div>\n                <div>Y</div> <div>CT</div>\n                <div>K</div> <div>GT</div>\n                <div>V</div> <div>ACG</div>\n                <div>H</div> <div>ACT</div>\n                <div>D</div> <div>AGT</div>\n                <div>B</div> <div>CGT</div>\n                <div>X</div> <div>GATC</div>\n                <div>N</div> <div>GATC</div>\n                <div>.</div> <div>GATC</div>\n              </div>\n              <br></br>\n              <h4>Examples:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"2fr 5fr\"\n                }}\n              >\n                <h6>Annotation</h6>\n                <h6>\n                  Sequence (matches in <span style={highlightStyle}>red</span>)\n                </h6>\n                <div>AATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>aAkT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCC\n                  <span style={highlightStyle}>AAGT</span>\n                </div>\n                <div>ANT</div>\n                <div>\n                  AA<span style={highlightStyle}>AAT</span>TTTGGGGGCCCCCA\n                  <span style={highlightStyle}>AGT</span>\n                </div>\n                <div>T#C</div>\n                <div>\n                  AAAATTT<span style={highlightStyle}>TGGGGGC</span>CCCCAAGT\n                </div>\n                <div>CA{\"<\"}ATTT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTT</span>TGGGGGCCCCCAAGT\n                </div>\n                <div>\n                  CA{\"<\"}ATT{\">\"}TTGAG\n                </div>\n                <div>\n                  AA<span style={highlightStyle}>AATTTTG</span>GGGGCCCCCAAGT\n                </div>\n              </div>\n\n              <br></br>\n              {/* <ConvertApeToRegexTool></ConvertApeToRegexTool> */}\n            </div>\n          }\n        ></Tab>\n        <Tab\n          id=\"regex\"\n          title=\"Regex\"\n          panel={\n            <div>\n              <p>\n                When in regex mode, you can use any custom regex to match base\n                pairs\n              </p>\n              <p>\n                You can learn more and try out your custom regexes at{\" \"}\n                <a href=\"https://regex101.com/\">https://regex101.com/</a>\n              </p>\n              <br></br>\n              <h4>Examples:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"2fr 5fr\"\n                }}\n              >\n                <h6>Annotation</h6>\n                <h6>\n                  Sequence (matches in <span style={highlightStyle}>red</span>)\n                </h6>\n                <div>AATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>aAtT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>A.T</div>\n                <div>\n                  AA<span style={highlightStyle}>AAT</span>TTTGGGGGCCCCCA\n                  <span style={highlightStyle}>AGT</span>\n                </div>\n                <div>T.*C</div>\n                <div>\n                  AAAA<span style={highlightStyle}>TTTTGGGGGCCCCC</span>AAGT\n                </div>\n                <div>T[^T]*?C</div>\n                <div>\n                  AAAATTT<span style={highlightStyle}>TGGGGGC</span>CCCCAAGT\n                </div>\n                <div>C?A?ATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTT</span>TGGGGGCCCCCAAGT\n                </div>\n                <div>C?A?ATTT?T?C?</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTTT</span>GGGGGCCCCCAAGT\n                </div>\n              </div>\n              <br></br>\n\n              {/* <ConvertApeToRegexTool></ConvertApeToRegexTool> */}\n            </div>\n          }\n        ></Tab>\n      </Tabs>\n    </div>\n  );\n});\n\n// function ConvertApeToRegexTool() {\n//   const [inputVal, setInput] = useState(\"CA<ANT>TTGAG\");\n\n//   let convertedVal = \"\";\n//   try {\n//     convertedVal = convertApELikeRegexToRegex(inputVal);\n//   } catch (error) {\n//     convertedVal = \"Error trying to convert to regex\";\n//   }\n//   return (\n//     <div\n//       style={{\n//         display: \"grid\",\n//         rowGap: 10,\n//         columnGap: 10,\n//         gridTemplateColumns: \"1fr 5fr\"\n//       }}\n//     >\n//       <div>Input:</div>\n//       <TextArea\n//         value={inputVal}\n//         onChange={e => {\n//           setInput(e.target.value.replace(/\\s/g, \"X\"));\n//         }}\n//       ></TextArea>\n\n//       <div>Output:</div>\n//       <div\n//         style={{ maxHeight: 200, overflowWrap: \"anywhere\", overflow: \"auto\" }}\n//       >\n//         {convertedVal}\n//       </div>\n//     </div>\n//   );\n// }\n","/* Copyright (C) 2018 TeselaGen Biotechnology, Inc. */\nimport { parse } from \"papaparse\";\n\nexport const allowedCsvFileTypes = [\".csv\", \".txt\", \".xlsx\"];\n\nexport const isZipFile = (file) => {\n  const type = file.mimetype || file.type;\n  return type === \"application/zip\" || type === \"application/x-zip-compressed\";\n};\n\nexport const getExt = (file) => file.name.split(\".\").pop();\nexport const isExcelFile = (file) => getExt(file) === \"xlsx\";\nexport const isCsvFile = (file) => getExt(file) === \"csv\";\nexport const isTextFile = (file) => [\"text\", \"txt\"].includes(getExt(file));\n\nconst defaultCsvParserOptions = {\n  header: true,\n  skipEmptyLines: \"greedy\",\n  trimHeaders: true,\n  // delimiter: \",\"\n};\n\nexport const parseCsvFile = (csvFile, parserOptions = {}) => {\n  return new Promise((resolve, reject) => {\n    parse(csvFile.originFileObj, {\n      ...defaultCsvParserOptions,\n      complete: (results) => {\n        if (results && results.errors && results.errors.length) {\n          return reject(\"Error in csv: \" + JSON.stringify(results.errors));\n        }\n        resolve(results);\n      },\n      error: (error) => {\n        reject(error);\n      },\n      ...parserOptions\n    });\n  });\n};\n\nexport const parseCsvString = (csvString, parserOptions = {}) => {\n  return parse(csvString, { ...defaultCsvParserOptions, ...parserOptions });\n};\n\nexport const cleanCommaSeparatedCell = (cellData) =>\n  (cellData || \"\")\n    .split(\",\")\n    .map((n) => n.trim())\n    .filter((n) => n);\n\n/**\n * Because the csv rows might not have the same header keys in some cases (extended properties)\n * this function will make sure that each row will have all headers so that the export\n * does not drop fields\n * @param {*} rows\n */\nexport const cleanCsvExport = (rows) => {\n  const allHeaders = [];\n  rows.forEach((row) => {\n    Object.keys(row).forEach((header) => {\n      if (!allHeaders.includes(header)) {\n        allHeaders.push(header);\n      }\n    });\n  });\n  rows.forEach((row) => {\n    allHeaders.forEach((header) => {\n      row[header] = row[header] || \"\";\n    });\n  });\n  return rows;\n};\n\nexport const validateCSVRequiredHeaders = (\n  fields,\n  requiredHeaders,\n  filename\n) => {\n  const missingRequiredHeaders = requiredHeaders.filter((field) => {\n    return !fields.includes(field);\n  });\n  if (missingRequiredHeaders.length) {\n    const name = filename ? `The file ${filename}` : \"CSV file\";\n    return `${name} is missing required headers. (${missingRequiredHeaders.join(\n      \", \"\n    )})`;\n  }\n};\n\nexport const validateCSVRow = (row, requiredHeaders, index) => {\n  const missingRequiredFields = requiredHeaders.filter((field) => !row[field]);\n  if (missingRequiredFields.length) {\n    if (missingRequiredFields.length === 1) {\n      return `Row ${index + 1} is missing the required field \"${\n        missingRequiredFields[0]\n      }\"`;\n    } else {\n      return `Row ${\n        index + 1\n      } is missing these required fields: ${missingRequiredFields.join(\", \")}`;\n    }\n  }\n};\n","/* eslint-disable jsx-a11y/anchor-is-valid */\n/* eslint-disable jsx-a11y/anchor-has-content */\n/* eslint-disable no-throw-literal */\nimport { unparse } from \"papaparse\";\nimport CreateAnnotationsPage from \"./CreateAnnotationsPage\";\nimport { formName } from \"./constants\";\nimport { AutoAnnotateBpMatchingDialog } from \"./AutoAnnotateBpMatchingDialog\";\nimport {\n  parseCsvFile,\n  validateCSVRequiredHeaders,\n  validateCSVRow\n} from \"./fileUtils\";\nimport downloadjs from \"downloadjs\";\n\nconst {\n  shortid,\n  FileUploadField,\n  Colors,\n  Tab,\n  Tabs,\n  pluralize,\n  reduxForm,\n  SubmissionError,\n  featureColors,\n  FeatureTypes,\n  InfoHelper,\n  showConfirmationDialog,\n  wrapDialog,\n  showDialog,\n  withEditorProps,\n  DialogFooter,\n  useState,\n  hideDialog,\n  startCase,\n  compose,\n  React,\n  convertApELikeRegexToRegex,\n  autoAnnotate,\n  useEffect,\n  DataTable,\n  typeField\n} = window.addOnGlobals;\n\nexport function autoAnnotateFeatures() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"feature\"\n    }\n  });\n}\nexport function autoAnnotateParts() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"part\"\n    }\n  });\n}\nexport function autoAnnotatePrimers() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"primer\"\n    }\n  });\n}\n\nexport const AutoAnnotateModal = compose(\n  wrapDialog((p) => ({\n    title: `Auto Annotate ${startCase(pluralize(p.annotationType))}`\n  })),\n  withEditorProps,\n  reduxForm({ form: formName })\n)((props) => {\n  const {\n    sequenceData,\n    handleSubmit,\n    annotationType = \"feature\",\n    error,\n    getCustomAutoAnnotateList\n  } = props;\n  const [fileType, setSelectedImportType] = useState(\"csvFile\");\n  const [newAnnotations, setNewAnns] = useState(false);\n  const [customAnnResponse, setCustomAnnResponse] = useState();\n  const [loadingCustomAnnList, setLoadingCustomAnnList] = useState();\n  useEffect(() => {\n    (async () => {\n      if (getCustomAutoAnnotateList) {\n        setLoadingCustomAnnList(true);\n        try {\n          const anns = await getCustomAutoAnnotateList(props);\n          setCustomAnnResponse(anns);\n        } catch (e) {\n          window.toastr.warning(\"Error loading custom annotation list\");\n          console.error(`e:`, e);\n        } finally {\n          setLoadingCustomAnnList(false);\n        }\n      }\n    })();\n  }, [getCustomAutoAnnotateList, props]);\n  if (newAnnotations) {\n    return (\n      <CreateAnnotationsPage\n        {...props}\n        newAnnotations={newAnnotations}\n      ></CreateAnnotationsPage>\n    );\n  }\n  return (\n    <div className=\"bp3-dialog-body\">\n      <Tabs\n        renderActiveTabPanelOnly\n        onChange={setSelectedImportType}\n        selectedTabId={fileType}\n      >\n        <Tab\n          panel={\n            <div>\n              <div>\n                Select a CSV file with the following columns -<br></br>\n                <br></br>\n                <div style={{ display: \"flex\" }}>\n                  name,description,sequence,type,\n                  <span style={{ display: \"flex\" }}>\n                    isRegex &nbsp;\n                    <InfoHelper\n                      onClick={(e) => {\n                        e.stopPropagation();\n                        e.preventDefault();\n                        showDialog({\n                          ModalComponent: AutoAnnotateBpMatchingDialog\n                        });\n                      }}\n                      content={\n                        true ? (\n                          <span>\n                            Any valid regexes allowed. Click for more info about\n                            regex matching\n                          </span>\n                        ) : (\n                          `All valid IUPAC bases allowed as well as a couple special characters. Click for more info`\n                        )\n                      }\n                    ></InfoHelper>\n                  </span>\n                </div>\n                <br></br>\n                {annotationType !== \"feature\" && (\n                  <React.Fragment>\n                    <i>Note: the \"type\" column is optional</i>\n                    <br></br>\n                  </React.Fragment>\n                )}\n                <br></br>\n                <a\n                  onClick={() => {\n                    const rows = [\n                      {\n                        name: `Example ${startCase(annotationType)} 1`,\n                        description: \"I'm a description\",\n                        sequence: `gatNNtacaggttt`,\n                        ...(annotationType === \"feature\" && {\n                          type: `cds`\n                        }),\n                        isRegex: false\n                      },\n                      {\n                        name: `Example ${startCase(annotationType)} 2`,\n                        description: \"I'm another description\",\n                        sequence: `gat.*tacccc.*aggttt`,\n                        ...(annotationType === \"feature\" && {\n                          type: `cds`\n                        }),\n                        isRegex: true\n                      }\n                    ];\n                    const csv = unparse(rows);\n                    // const blob = new Blob([convert(sequenceData)], { type: \"text/plain\" });\n                    // const filename = `${sequenceData.name || \"Untitled_Sequence\"}.${fileExt}`;\n                    // FileSaver.saveAs(blob, filename);\n                    downloadjs(\n                      csv,\n                      `Example CSV Annotation Upload File.csv`,\n                      \"text/plain\"\n                    );\n                  }}\n                >\n                  download example\n                </a>\n              </div>\n              <FileUploadField\n                name=\"csvFile\"\n                fileLimit={1}\n                isRequired\n                accept=\".csv\"\n              ></FileUploadField>\n            </div>\n          }\n          id=\"csvFile\"\n          title=\"CSV\"\n        ></Tab>\n        <Tab\n          panel={\n            <div>\n              <div>\n                Select an ApE style features .txt file (\n                <a\n                  onClick={() => {\n                    downloadjs(\n                      `T3\tATTAACCCTCACTAAAGGGA\tprimer_bind\tcyan\tgreen\t0\t0\nM13-fwd\tTGTAAAACGACGGCCAGT\tprimer_bind\tcyan\tgreen\t0\t0\nFRT\tGAAGTTCCTATTCTCTAGAAAGTATAGGAACTTC\tmisc_recomb\torchid\tpink\t0\t0`,\n                      `Example APE Feature List Upload File.txt`,\n                      \"text/plain\"\n                    );\n                  }}\n                >\n                  download example\n                </a>\n                ):\n              </div>\n              <FileUploadField\n                fileLimit={1}\n                name=\"apeFile\"\n                isRequired\n                accept=\".txt\"\n              ></FileUploadField>\n              {error && (\n                <div style={{ padding: 5, color: Colors.RED1 }}>{error}</div>\n              )}\n            </div>\n          }\n          id=\"apeFile\"\n          title=\"ApE File\"\n        ></Tab>\n        {getCustomAutoAnnotateList &&\n          (loadingCustomAnnList ? (\n            <Tab disabled title=\"Loading...\"></Tab>\n          ) : (\n            customAnnResponse && (\n              <Tab\n                id=\"implementerDefined\"\n                title={\n                  (customAnnResponse && customAnnResponse.title) ||\n                  \"Custom List\"\n                }\n                panel={\n                  customAnnResponse &&\n                  customAnnResponse.list &&\n                  customAnnResponse.list.length ? (\n                    <div>\n                      <DataTable\n                        isInfinite\n                        schema={\n                          annotationType === \"feature\"\n                            ? customAnnsSchema\n                            : customAnnsSchemaNoType\n                        }\n                        entities={customAnnResponse.list}\n                      ></DataTable>\n                    </div>\n                  ) : (\n                    <div>No Annotations Found</div>\n                  )\n                }\n              ></Tab>\n            )\n          ))}\n      </Tabs>\n      <DialogFooter\n        hideModal={hideDialog}\n        disabled={\n          fileType === \"implementerDefined\" &&\n          !(\n            customAnnResponse &&\n            customAnnResponse.list &&\n            customAnnResponse.list.length\n          )\n        }\n        onClick={handleSubmit(async ({ apeFile, csvFile }) => {\n          let convertNonStandardTypes = false;\n          const annsToCheck = [];\n          try {\n            const validateRow = async (row, rowName) => {\n              const { type = \"\", sequence } = row;\n              let regexConvertedSeq;\n\n              if (annotationType === \"feature\") {\n                const cleanedType = FeatureTypes.find(\n                  (t) => t.toLowerCase() === type.toLowerCase()\n                );\n                if (!cleanedType) {\n                  if (!convertNonStandardTypes) {\n                    convertNonStandardTypes = await showConfirmationDialog({\n                      cancelButtonText: \"Stop Auto-Annotate\",\n                      text: `Detected that ${rowName} has a non-standard type of ${type}. We will assign it and all subsequent non-standard types to use the misc_feature type instead`\n                    });\n                    if (!convertNonStandardTypes) {\n                      throw {\n                        validationError: `${rowName} specifies the feature type ${type} which is not valid`\n                      };\n                    }\n                  }\n                  row.type = \"misc_feature\";\n                } else {\n                  row.type = cleanedType;\n                }\n              }\n              if (!sequence) {\n                throw {\n                  validationError: `${rowName} did not have a sequence`\n                };\n              }\n              if (row.isRegex && row.isRegex.toUpperCase() === \"TRUE\") {\n                try {\n                  new RegExp(regexConvertedSeq); //just trying out whether the regexConvertedSeq will work as a valid regex\n                } catch (error) {\n                  throw {\n                    validationError: `${rowName} has an invalid sequence/regex. Please fix it manually.`\n                  };\n                }\n                row.isRegex = true;\n              } else {\n                row.isRegex = undefined;\n              }\n              annsToCheck.push(row);\n            };\n            if (fileType === \"implementerDefined\") {\n              for (const [\n                // eslint-disable-next-line no-unused-vars\n                i,\n                // eslint-disable-next-line no-unused-vars\n                { name, sequence, type, isRegex }\n              ] of customAnnResponse.list.entries()) {\n                await validateRow(\n                  { name, sequence, type, isRegex: isRegex ? \"TRUE\" : \"FALSE\" },\n                  `Row ${i + 1} (${name})`\n                );\n              }\n            } else if (fileType === \"csvFile\") {\n              const csvHeaders = [\"name\", \"description\", \"sequence\"];\n              if (annotationType === \"feature\") {\n                csvHeaders.push(\"type\");\n              }\n              csvHeaders.push(\"isRegex\");\n              const {\n                data,\n                meta: { fields }\n              } = await parseCsvFile(csvFile[0]);\n              const error = validateCSVRequiredHeaders(fields, csvHeaders);\n              if (error) {\n                throw {\n                  validationError: error\n                };\n              }\n\n              // eslint-disable-next-line no-unused-vars\n              for (const [index, row] of data.entries()) {\n                const error = validateCSVRow(row, csvHeaders, index);\n                if (error) {\n                  throw {\n                    validationError: error\n                  };\n                }\n                await validateRow(row, `Row ${index + 1} (${row.name})`);\n              }\n            } else if (fileType === \"apeFile\") {\n              const { data } = await parseCsvFile(apeFile[0], {\n                header: false\n              });\n              // eslint-disable-next-line no-unused-vars\n              for (const [i, [name, sequence, type]] of data.entries()) {\n                await validateRow(\n                  { name, sequence, type },\n                  `Row ${i + 1} (${name})`\n                );\n              }\n            } else {\n              console.info(`we shouldn't be here!`);\n              console.info(`fileType:`, fileType);\n            }\n\n            if (!annsToCheck.length) {\n              return window.toastr.warning(\n                \"No Annotations Detected on File. Please check that your file is in the correct format.\"\n              );\n            }\n            const annotationsToCheckById = {};\n            annsToCheck.forEach((ann) => {\n              const id = shortid();\n              annotationsToCheckById[id] = {\n                ...ann,\n                sequence: ann.isRegex\n                  ? ann.sequence\n                  : convertApELikeRegexToRegex(ann.sequence),\n                id\n              };\n            });\n\n            const seqId = \"placeholderId\";\n            const { [seqId]: newAnns } = autoAnnotate({\n              seqsToAnnotateById: {\n                [seqId]: { ...sequenceData, id: seqId }\n              },\n              annotationsToCheckById\n            });\n\n            if (newAnns && newAnns.length) {\n              setNewAnns(\n                newAnns.map((a) => {\n                  const toRet = {\n                    ...annotationsToCheckById[a.id],\n                    ...a,\n                    forward: a.strand !== -1,\n                    id: shortid()\n                  };\n                  toRet.color = toRet.color || featureColors[toRet.type];\n                  return toRet;\n                })\n              );\n            } else {\n              window.toastr.warning(\n                `No ${annotationType}s detected on sequence.`\n              );\n            }\n          } catch (error) {\n            console.error(`error:`, error);\n            if (error.validationError) {\n              throw new SubmissionError({ [fileType]: error.validationError });\n            } else {\n              window.toastr.error(\n                `Error annotating ${annotationType}(s). Double check your file to make sure it is valid!`\n              );\n            }\n          }\n        })}\n        text=\"Annotate\"\n      ></DialogFooter>\n    </div>\n  );\n});\n\nif (!window._ove_addons) window._ove_addons = {};\nwindow._ove_addons.autoAnnotateFeatures = autoAnnotateFeatures;\nwindow._ove_addons.autoAnnotateParts = autoAnnotateParts;\nwindow._ove_addons.autoAnnotatePrimers = autoAnnotatePrimers;\n\nconst customAnnsSchema = [\"name\", \"sequence\", typeField, \"isRegex\"];\nconst customAnnsSchemaNoType = [\"name\", \"sequence\", typeField, \"isRegex\"];\n"],"sourceRoot":""}
+{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/lodash/lodash.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/index.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/normalizePositionByRangeLength.js","webpack:///./node_modules/@babel/runtime/regenerator/index.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/annotationTypes.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseComplementSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/tidyUpSequenceData.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getRangeLength.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/bson-objectid/objectid.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/splitRangeIntoTwoPartsIfItIsCircular.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getOverlapsOfPotentiallyCircularRanges.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/proteinAlphabet.js","webpack:///./node_modules/papaparse/papaparse.min.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getAminoAcidDataForEachBaseOfDna.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/trimRangeByAnotherRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/provideInclusiveOptions.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/aminoAcidToDegenerateDnaMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/bioData.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/cutSequenceByRestrictionEnzyme.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getAminoAcidStringFromSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getComplementSequenceString.js","webpack:///(webpack)/buildin/global.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/convertRangeIndices.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/isRangeWithinRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/DNAComplementMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/aminoAcidToDegenerateRnaMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/insertSequenceDataAtPositionOrRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/convertDnaCaretPositionOrRangeToAA.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/adjustAnnotationsToInsert.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getSequenceDataBetweenRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/downloadjs/download.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getOverlapOfNonCircularRanges.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/trimNonCicularRangeByAnotherNonCircularRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/checkIfNonCircularRangesOverlap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/checkIfPotentiallyCircularRangesOverlap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/collapseOverlapsGeneratedFromRangeComparisonIfPossible.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/isPositionWithinRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/expandOrContractCircularRangeToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/expandOrContractNonCircularRangeToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/expandOrContractRangeByLength.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/normalizeRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/translateRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getEachPositionInRangeAsArray.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getShortestDistanceBetweenTwoPositions.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getYOffsetForPotentiallyCircularRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/modulatePositionByRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/zeroSubrangeByContainerRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getAminoAcidFromSequenceTriplet.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/threeLetterSequenceStringToAminoAcidMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/degenerateDnaToAminoAcidMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/filterSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/tidyUpAnnotation.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/featureTypesAndColors.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/filterAminoAcidSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getDegenerateDnaStringFromAAString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/autoAnnotate.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getAllInsertionsInSeqReads.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/insertGapsIntoRefSeq.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/adjustBpsToReplaceOrInsert.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/calculatePercentGC.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/rotateSequenceDataToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/rotateBpsToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/aliasedEnzymesByName.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getOrfsFromSequence.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/insertSequenceDataAtPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getCutsitesFromSequence.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/computeDigestFragments.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseComplementAnnotation.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/mapAnnotationsToRows.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/calculateNebTm.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getDigestFragmentsForCutsites.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/index.js","webpack:///./node_modules/regenerator-runtime/runtime.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/diffUtils.js","webpack:///(webpack)/buildin/module.js","webpack:///./node_modules/process/browser.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/adjustRangeToDeletionOfAnotherRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/adjustRangeToInsert.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/convertRangeTo0Based.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/convertRangeTo1Based.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/doesRangeSpanEntireSequence.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/isRangeOrPositionWithinRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/doesRangeSpanOrigin.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/expandOrContractRangeToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/flipContainedRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/generateRandomRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getAnnotationRangeType.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getLengthOfOverlappingRegionsBetweenTwoRanges.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getPositionFromAngle.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getRangeAngles.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getMiddleOfRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getRangesBetweenTwoRanges.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getSequenceWithinRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getYOffsetsForPotentiallyCircularRanges.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/invertRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/isPositionCloserToRangeStartThanRangeEnd.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/loopEachPositionInRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/modulateRangeBySequenceLength.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/normalizePositionByRangeLength1Based.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/reversePositionInRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/trimNumberToFitWithin0ToAnotherNumber.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/adjustRangeToRotation.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-range-utils/lib/getZeroedRangeOverlaps.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/jsondiffpatch/dist/jsondiffpatch.umd.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/annotateSingleSeq.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getDegenerateRnaStringFromAAString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getVirtualDigest.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/isEnzymeType2S.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/string-splice/spliceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/calculateTm.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/deleteSequenceDataAtRange.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/doesEnzymeChopOutsideOfRecognitionSite.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/defaultEnzymesByName.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/generateSequenceData.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/findNearestRangeOfSequenceOverlapToPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/findOrfsInPlasmid.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/findSequenceMatches.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/escape-string-regexp/index.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getCodonRangeForAASliver.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getComplementAminoAcidStringFromSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getComplementSequenceAndAnnotations.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getCutsiteType.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getInsertBetweenVals.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getLeftAndRightOfSequenceInRangeGivenPosition.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getOverlapBetweenTwoSequences.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getPossiblePartsFromSequenceAndEnzymes.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseAminoAcidStringFromSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseComplementAminoAcidStringFromSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseComplementSequenceAndAnnotations.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getReverseSequenceString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/guessIfSequenceIsDnaAndNotProtein.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/prepareCircularViewData.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/prepareRowData.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/condensePairwiseAlignmentDifferences.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/addGapsToSeqReads.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/calculateNebTa.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getDigestFragmentsForRestrictionEnzymes.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/convertAACaretPositionOrRangeToDna.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/degenerateRnaToAminoAcidMap.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/getMassOfAaString.js","webpack:////Users/tnrich/Sites/openVectorEditor/node_modules/ve-sequence-utils/lib/shiftAnnotationsByLen.js","webpack:///./src/constants.js","webpack:///./src/CreateAnnotationsPage.js","webpack:///./src/AutoAnnotateBpMatchingDialog.js","webpack:///./src/fileUtils.js","webpack:///./src/index.js"],"names":["formName","window","addOnGlobals","startCase","compose","hideDialog","typeField","pluralize","React","useEffect","DataTable","DialogFooter","withSelectedEntities","withSelectTableRecords","tidyUpAnnotation","schemaFeatures","schemaOther","CreateAnnotationsPage","props","newAnnotations","annotationType","annotationVisibilityShow","beforeAnnotationCreate","handleSubmit","selectTableRecords","sequenceData","ents","length","map","e","start","end","annotationTypePlural","forEach","newAnnotation","i","annotation","conditionals","batchUndoStart","batchUndoEnd","batchUndoMiddle","Tab","Tabs","wrapDialog","highlightStyle","background","marginTop","AutoAnnotateBpMatchingDialog","title","isRegex","display","columnGap","gridTemplateColumns","maxHeight","overflow","allowedCsvFileTypes","isZipFile","file","type","mimetype","getExt","name","split","pop","isExcelFile","isCsvFile","isTextFile","includes","defaultCsvParserOptions","header","skipEmptyLines","trimHeaders","parseCsvFile","csvFile","parserOptions","Promise","resolve","reject","parse","originFileObj","complete","results","errors","JSON","stringify","error","parseCsvString","csvString","cleanCommaSeparatedCell","cellData","n","trim","filter","cleanCsvExport","rows","allHeaders","row","Object","keys","push","validateCSVRequiredHeaders","fields","requiredHeaders","filename","missingRequiredHeaders","field","join","validateCSVRow","index","missingRequiredFields","shortid","FileUploadField","Colors","reduxForm","SubmissionError","getFeatureToColorMap","getFeatureTypes","InfoHelper","showConfirmationDialog","showDialog","withEditorProps","useState","convertApELikeRegexToRegex","autoAnnotate","autoAnnotateFeatures","ModalComponent","AutoAnnotateModal","autoAnnotateParts","autoAnnotatePrimers","p","canEscapeKeyClose","form","getCustomAutoAnnotateList","fileType","setSelectedImportType","setNewAnns","customAnnResponse","setCustomAnnResponse","loadingCustomAnnList","setLoadingCustomAnnList","anns","toastr","warning","console","description","sequence","matchType","csv","unparse","downloadjs","stopPropagation","preventDefault","validateAgainstSchema","padding","color","RED1","list","customAnnsSchema","customAnnsSchemaNoType","apeFile","convertNonStandardTypes","annsToCheck","validateRow","rowName","cleanedType","find","t","toLowerCase","cancelButtonText","text","validationError","toUpperCase","RegExp","regexConvertedSeq","undefined","entries","csvHeaders","data","meta","info","annotationsToCheckById","ann","convertProteinSeqToDNAIupac","id","seqId","seqsToAnnotateById","newAnns","a","toRet","forward","strand","_ove_addons","path","isRequired","values","defaultValue"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;QCVA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;;QAEA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;;;QAGA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA,0CAA0C,gCAAgC;QAC1E;QACA;;QAEA;QACA;QACA;QACA,wDAAwD,kBAAkB;QAC1E;QACA,iDAAiD,cAAc;QAC/D;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,yCAAyC,iCAAiC;QAC1E,gHAAgH,mBAAmB,EAAE;QACrI;QACA;;QAEA;QACA;QACA;QACA,2BAA2B,0BAA0B,EAAE;QACvD,iCAAiC,eAAe;QAChD;QACA;QACA;;QAEA;QACA,sDAAsD,+DAA+D;;QAErH;QACA;;;QAGA;QACA;;;;;;;AClFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C;AAC3C;AACA,2DAA2D;;AAE3D;AACA,+CAA+C;AAC/C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,yBAAyB;AACzB,yBAAyB;AACzB;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,2CAA2C;;AAE3C;AACA;;AAEA;AACA;AACA;AACA;AACA,0BAA0B,MAAM,aAAa,OAAO;;AAEpD;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,EAAE;AACnD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,2CAA2C,EAAE;;AAE7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf,cAAc;AACd,cAAc;AACd,gBAAgB;AAChB,eAAe;AACf;;AAEA;AACA;AACA,UAAU;AACV,SAAS;AACT,SAAS;AACT,WAAW;AACX,UAAU;AACV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,KAA0B;;AAE9C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,MAAM;AACnB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,OAAO;AACpB,aAAa,QAAQ;AACrB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,EAAE;AACf,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,aAAa,SAAS;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,eAAe,EAAE;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA,cAAc,2BAA2B;AACzC;AACA;AACA,mBAAmB,gCAAgC;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,6BAA6B;AAC9D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe,QAAQ;AACvB;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kEAAkE;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW;AACX;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;AACA;AACA,oCAAoC,6BAA6B,EAAE;AACnE;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,eAAe,QAAQ;AACvB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,6BAA6B;AAC5C,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,gBAAgB;AAChB,OAAO;;AAEP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qEAAqE;AACrE;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,mBAAmB;AAClC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,gBAAgB,QAAQ;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,gBAAgB,QAAQ;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,eAAe,OAAO,WAAW;AACjC,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,4BAA4B;;AAE5B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,WAAW;AACjC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,WAAW;AACjC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,+CAA+C;AACpF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,oEAAoE;AACpE;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0CAA0C;AAC1C,wCAAwC;AACxC,+DAA+D;AAC/D,iEAAiE;AACjE;AACA;AACA,cAAc;AACd;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,SAAS,GAAG,SAAS,KAAK,SAAS;AAC3D,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D;AACA,mCAAmC,iBAAiB;AACpD,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,4CAA4C,kBAAkB,EAAE;AAChE;AACA;AACA;AACA,gCAAgC,qCAAqC;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,kBAAkB,EAAE;AAC3D;AACA;AACA;AACA,2BAA2B,oCAAoC;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,2BAA2B,EAAE;AACpE;AACA;AACA;AACA,2BAA2B,kCAAkC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,2CAA2C,4BAA4B,EAAE;AACzE;AACA;AACA;AACA,+BAA+B,mCAAmC;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,SAAS,KAAK,SAAS,GAAG,SAAS;AAC7D,eAAe,SAAS;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AAClE;AACA,4BAA4B,SAAS,GAAG,SAAS;AACjD;AACA,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AAC9E;AACA,8BAA8B,iBAAiB;AAC/C;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,qBAAqB;AACpC,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;;AAEP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,iCAAiC,SAAS,eAAe,YAAY,EAAE;AACvE;AACA;AACA;AACA,iCAAiC,SAAS;AAC1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,SAAS,eAAe,YAAY,EAAE;AAC3E;AACA;AACA;AACA,qCAAqC,SAAS;AAC9C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,4CAA4C,kBAAkB,EAAE;AAChE;AACA;AACA;AACA,gCAAgC,qCAAqC;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,kBAAkB,EAAE;AAC3D;AACA;AACA;AACA,2BAA2B,oCAAoC;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS,KAAK,SAAS,GAAG,SAAS;AACtD,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AACxE;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS,GAAG,SAAS,GAAG,SAAS;AACnD,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AAChF;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,KAAK,SAAS,GAAG,SAAS;AACpD,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc,OAAO,QAAQ,SAAS,GAAG,SAAS,GAAG;AACrD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,+BAA+B;AACzC,UAAU,+BAA+B;AACzC,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,8BAA8B;;AAExE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,cAAc;AACd;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA;AACA,uBAAuB,oCAAoC;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,UAAU,8CAA8C;AACxD,UAAU;AACV;AACA;AACA,oCAAoC,kBAAkB,EAAE;AACxD;AACA;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,YAAY;AAChD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU,gDAAgD;AAC1D,UAAU;AACV;AACA;AACA,kCAAkC,mBAAmB,EAAE;AACvD;AACA;AACA;AACA,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,oBAAoB;AACnC,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,sBAAsB;AACrC;AACA,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,4BAA4B;AACtC,UAAU;AACV;AACA;AACA;AACA;AACA,QAAQ;AACR,cAAc,OAAO,4BAA4B,QAAQ,8BAA8B;AACvF;AACA;AACA,cAAc,UAAU,4BAA4B,YAAY,8BAA8B;AAC9F;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA,UAAU,mBAAmB;AAC7B,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,qCAAqC;AACpD;AACA,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,gDAAgD;AAC1D,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA,uCAAuC,iBAAiB,EAAE;AAC1D;AACA;AACA;AACA,2BAA2B,4BAA4B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,cAAc,iBAAiB,EAAE;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,iBAAiB,yBAAyB;AAC1C;AACA;AACA,QAAQ,IAAI;AACZ,cAAc,8BAA8B;AAC5C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA,oCAAoC,kBAAkB,EAAE;AACxD;AACA;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,oBAAoB;AACnC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,mCAAmC;AAC7C,UAAU;AACV;AACA;AACA;AACA,sBAAsB,oCAAoC;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,yBAAyB;AACxC;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA,qCAAqC,eAAe,EAAE;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oBAAoB,iCAAiC;AACrD,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,QAAQ;AACvB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,kDAAkD,kBAAkB;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,qBAAqB;AACpC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB;AACA,eAAe,QAAQ;AACvB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,uDAAuD,oBAAoB;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB;AACA,6BAA6B,mBAAmB,cAAc,EAAE,EAAE;AAClE;AACA;AACA,6BAA6B,mBAAmB,cAAc,EAAE,EAAE;AAClE;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA,iCAAiC,kBAAkB,EAAE;AACrD;AACA;AACA;AACA;AACA;AACA,kDAAkD,kBAAkB,EAAE;AACtE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB;AACA,0BAA0B,SAAS;AACnC;AACA;AACA,0BAA0B,SAAS;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,iBAAiB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,GAAG,SAAS,GAAG,SAAS;AAClD,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,GAAG,SAAS,GAAG,SAAS;AAClD,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,mBAAmB,SAAS,GAAG,SAAS,GAAG,SAAS;AACpD,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,OAAO,SAAS,EAAE,GAAG,OAAO,iBAAiB,EAAE;AACtE,cAAc,OAAO,iBAAiB;AACtC;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,qBAAqB,4BAA4B;AACjD,qBAAqB,6BAA6B;AAClD,qBAAqB;AACrB;AACA;AACA,qCAAqC,mBAAmB,EAAE;AAC1D;AACA;AACA;AACA,yBAAyB,2BAA2B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,qBAAqB,4BAA4B;AACjD,qBAAqB,6BAA6B;AAClD,qBAAqB;AACrB;AACA;AACA,yCAAyC,mBAAmB,EAAE;AAC9D;AACA;AACA;AACA,6BAA6B,4BAA4B;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB,OAAO,SAAS;AACrC,6BAA6B,gBAAgB,SAAS,GAAG;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,8BAA8B,gBAAgB,SAAS,GAAG;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,QAAQ;AACR,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,KAAK;AACpB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,oBAAoB,EAAE;AAC1D;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA,QAAQ;AACR,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,qBAAqB,+BAA+B;AACpD,qBAAqB;AACrB;AACA;AACA,uCAAuC,cAAc,EAAE;AACvD,cAAc,2BAA2B;AACzC;AACA;AACA;AACA,cAAc,2BAA2B;AACzC;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,gBAAgB,SAAS,GAAG,SAAS;AACrC;AACA;AACA;AACA,gBAAgB,SAAS,GAAG,SAAS;AACrC;AACA;AACA;AACA,cAAc,QAAQ,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA,gCAAgC;AAChC,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,+BAA+B,EAAE;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO,WAAW;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oBAAoB,yBAAyB;AAC7C;AACA,QAAQ,IAAI;AACZ,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA,cAAc,QAAQ,QAAQ,EAAE;AAChC;AACA;AACA;AACA;AACA;AACA,cAAc,QAAQ,QAAQ,EAAE;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA,iDAAiD,cAAc,EAAE;AACjE;AACA;AACA;AACA,iDAAiD,sBAAsB,EAAE;AACzE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO,WAAW;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,KAAK;AACvC;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,eAAe,gBAAgB;AAC/B,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,iBAAiB,sBAAsB;AACvC,qBAAqB,UAAU;AAC/B;AACA;AACA,sEAAsE,2BAA2B,EAAE;AACnG,iBAAiB,8BAA8B;AAC/C;AACA;AACA;AACA,4DAA4D;AAC5D,iBAAiB,mBAAmB;AACpC;AACA;AACA;AACA;AACA,0CAA0C,OAAO;AACjD,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA,qDAAqD,2BAA2B,EAAE;AAClF,wCAAwC,aAAa,eAAe,EAAE;AACtE,iBAAiB,8BAA8B;AAC/C;AACA;AACA;AACA,wDAAwD,qCAAqC;AAC7F;AACA;AACA;AACA;AACA,0DAA0D,qBAAqB;AAC/E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C,YAAY;AACvD,0CAA0C,QAAQ;AAClD,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+BAA+B;;AAE/B,mCAAmC;AACnC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,wBAAwB;AAC/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA,8BAA8B,mBAAmB;AACjD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,4CAA4C;;AAE5C;AACA,uDAAuD;AACvD;AACA;AACA,6BAA6B,EAAE;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,+BAA+B,iCAAiC;AAChE,cAAc;AACd;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC;AACjC,aAAa,QAAQ,QAAQ,UAAU,aAAa;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB,SAAS;AAC9B,sBAAsB,kBAAkB;AACxC;AACA;AACA;AACA,aAAa,iBAAiB;AAC9B;AACA;AACA,aAAa,iBAAiB;AAC9B;AACA;AACA,aAAa,qBAAqB;AAClC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,iBAAiB;AAC3B,UAAU;AACV;AACA;AACA,qCAAqC,mBAAmB,cAAc,EAAE,EAAE;AAC1E,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA,4CAA4C,SAAS;AACrD;AACA;AACA,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,8CAA8C;AACxD,UAAU;AACV;AACA;AACA;AACA,mCAAmC,mCAAmC;AACtE,eAAe,8CAA8C;AAC7D;AACA;AACA;AACA,eAAe,4BAA4B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,yBAAyB;AACnC,UAAU;AACV;AACA;AACA,oCAAoC,iBAAiB;AACrD,eAAe,yBAAyB;AACxC;AACA;AACA,gDAAgD,SAAS,cAAc,SAAS;AAChF,eAAe,yBAAyB,GAAG,yBAAyB;AACpE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,yBAAyB;AACnC,UAAU;AACV;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,eAAe,yBAAyB,GAAG,yBAAyB;AACpE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,OAAO,qBAAqB,EAAE;AACxC,UAAU,OAAO,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB,iBAAiB,gBAAgB;AACjC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,gBAAgB,mBAAmB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,mBAAmB,GAAG,iBAAiB;AACvD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4BAA4B,qDAAqD;AACjF;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,SAAS,GAAG,SAAS;AAC3D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,OAAO,SAAS,EAAE;AAC5B,UAAU,OAAO,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,gBAAgB,IAAI;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kEAAkE;AAClE;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,YAAY,EAAE;AACnD,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AACpE;AACA,sCAAsC,YAAY,EAAE;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,YAAY,EAAE;AACnD,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AACpE;AACA,qCAAqC,YAAY,EAAE;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK,MAAM,iBAAiB;;AAE5B;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,mCAAmC,4DAA4D;AAC/F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,yCAAyC;AACtE;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;;AAEH;;AAEA;AACA;;AAEA;AACA,MAAM,IAA0E;AAChF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI,mCAAO;AACX;AACA,KAAK;AAAA,oGAAC;AACN;AACA;AACA,OAAO,EASJ;AACH,CAAC;;;;;;;;;ACxzhBY;;AAEb,qDAAqD,mBAAO,CAAC,EAAuC;AACpG,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,iDAAiD,mBAAO,CAAC,EAAmC;AAC5F,yDAAyD,mBAAO,CAAC,EAA2C;AAC5G,wEAAwE,mBAAO,CAAC,EAA0D;AAC1I,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,8CAA8C,mBAAO,CAAC,EAAgC;AACtF,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,yDAAyD,mBAAO,CAAC,EAA2C;AAC5G,4DAA4D,mBAAO,CAAC,EAA8C;AAClH,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,iDAAiD,mBAAO,CAAC,EAAmC;AAC5F,oCAAoC,mBAAO,CAAC,EAAsB;AAClE,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,wCAAwC,mBAAO,CAAC,EAA0B;AAC1E,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,+DAA+D,mBAAO,CAAC,EAAiD;AACxH,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,wDAAwD,mBAAO,CAAC,EAA0C;AAC1G,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,gCAAgC,mBAAO,CAAC,EAAkB;AAC1D,gCAAgC,mBAAO,CAAC,CAAkB;AAC1D,kCAAkC,mBAAO,CAAC,EAAoB;AAC9D,2CAA2C,mBAAO,CAAC,EAA6B;AAChF,wCAAwC,mBAAO,CAAC,EAA0B;AAC1E,wDAAwD,mBAAO,CAAC,EAA0C;AAC1G,uDAAuD,mBAAO,CAAC,EAAyC;AACxG,yDAAyD,mBAAO,CAAC,EAA2C;AAC5G,6BAA6B,mBAAO,CAAC,EAAe;AACpD,0DAA0D,mBAAO,CAAC,EAA4C;AAC9G,uCAAuC,mBAAO,CAAC,EAAyB;AACxE,oCAAoC,mBAAO,CAAC,EAAsB;AAClE,yCAAyC,mBAAO,CAAC,EAA2B;AAC5E,yCAAyC,mBAAO,CAAC,EAA2B;AAC5E,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,gDAAgD,mBAAO,CAAC,CAAkC;AAC1F,sDAAsD,mBAAO,CAAC,EAAwC;AACtG,gCAAgC,mBAAO,CAAC,EAAkB;AAC1D,yCAAyC,mBAAO,CAAC,EAA2B;AAC5E,wCAAwC,mBAAO,CAAC,GAA0B;AAC1E,sDAAsD,mBAAO,CAAC,CAAwC;AACtG,gCAAgC,mBAAO,CAAC,EAAkB;AAC1D,8DAA8D,mBAAO,CAAC,EAAgD;AACtH,uDAAuD,mBAAO,CAAC,GAAyC;AACxG,yCAAyC,mBAAO,CAAC,EAA2B;AAC5E,8CAA8C,mBAAO,CAAC,EAAgC;AACtF,uCAAuC,mBAAO,CAAC,GAAyB;AACxE,wCAAwC,mBAAO,CAAC,GAA0B,E;;;;;;;ACpD7D;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,E;;;;;;ACjBA,iBAAiB,mBAAO,CAAC,EAAqB;;;;;;;;ACAjC;;AAEb;AACA,gJ;;;;;;;ACHa;;AAEb,uBAAuB,mBAAO,CAAC,EAAoB;AACnD;AACA;AACA;AACA;AACA;AACA,mCAAmC,QAAQ;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACjBa;;AAEb,oGAAoG,mBAAmB,EAAE,mBAAmB,8HAA8H;;AAE1Q,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P;AACA,mBAAmB,mBAAO,CAAC,CAAe;AAC1C,uCAAuC,mBAAO,CAAC,EAAoC;;AAEnF,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;;AAEA,sBAAsB,mBAAO,CAAC,CAAmB;AACjD,2BAA2B,mBAAO,CAAC,EAAwB;AAC3D,uBAAuB,mBAAO,CAAC,EAAoB;AACnD,oCAAoC,mBAAO,CAAC,EAAiC;AAC7E,yCAAyC,mBAAO,CAAC,EAAsC;;AAEvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iGAAiG,yBAAyB;AAC1H,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA,OAAO,IAAI;AACX,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AChJa;;AAEb,8BAA8B,mBAAO,CAAC,EAA2B;AACjE;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;ACdA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,cAAc;AACzB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qBAAqB,6CAA6C;AAClE,GAAG;AACH;AACA,qBAAqB,4CAA4C;AACjE,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,SAAS;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,SAAS;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,GAAG;AACvB;;AAEA;AACA;AACA;AACA,WAAW,cAAc;AACzB,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,IAAI;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,aAAa,OAAO;AACpB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,cAAc,KAAK;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,SAAS,KAAK;;AAEd;AACA,SAAS,KAAK;;AAEd;AACA;;AAEA;;AAEA;AACA;AACA;AACA,YAAY,OAAO;AACnB;AACA;AACA,0CAA0C;AAC1C;AACA;;;;;;;;;AC/Na;;AAEb,oC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,E;;;;;;;AChCa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,2CAA2C,mBAAO,CAAC,CAAwC;AAC3F,oCAAoC,mBAAO,CAAC,EAAiC;AAC7E;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,E;;;;;;;ACtCa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;AChQA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,KAAqC,CAAC,iCAAO,EAAE,oCAAC,CAAC;AAAA;AAAA;AAAA,oGAAC,CAAC,SAAkF,CAAC,mBAAmB,aAAa,sFAAsF,qEAAqE,gBAAgB,QAAQ,oBAAoB,cAAc,oBAAoB,qCAAqC,EAAE,8FAA8F,iBAAiB,iCAAiC,gHAAgH,IAAI,uBAAuB,uBAAuB,QAAQ,wCAAwC,GAAG,+MAA+M,+BAA+B,EAAE,WAAW,oLAAoL,mBAAmB,uBAAuB,0DAA0D,YAAY,6BAA6B,kEAAkE,kCAAkC,0BAA0B,iGAAiG,4FAA4F,0CAA0C,8CAA8C,yCAAyC,6BAA6B,mEAAmE,YAAY,0CAA0C,yDAAyD,GAAG,2BAA2B,sCAAsC,qBAAqB,qDAAqD,4DAA4D,2WAA2W,0DAA0D,kBAAkB,SAAS,4EAA4E,0DAA0D,SAAS,YAAY,WAAW,6BAA6B,mBAAmB,YAAY,WAAW,KAAK,mFAAmF,0GAA0G,iBAAiB,IAAI,KAAK,eAAe,gBAAgB,yBAAyB,OAAO,YAAY,IAAI,KAAK,gBAAgB,kBAAkB,gBAAgB,qCAAqC,SAAS,gBAAgB,oBAAoB,6DAA6D,qEAAqE,8HAA8H,YAAY,WAAW,mCAAmC,SAAS,qFAAqF,oBAAoB,sZAAsZ,eAAe,uBAAuB,kBAAkB,MAAM,6BAA6B,8JAA8J,YAAY,oBAAoB,YAAY,4DAA4D,IAAI,EAAE,WAAW,aAAa,iBAAiB,mBAAmB,gBAAgB,mCAAmC,uBAAuB,wGAAwG,OAAO,SAAS,qCAAqC,kFAAkF,mCAAmC,gCAAgC,sCAAsC,kCAAkC,kCAAkC,iCAAiC,aAAa,oBAAoB,cAAc,+NAA+N,0BAA0B,aAAa,WAAW,sEAAsE,6DAA6D,4CAA4C,wDAAwD,uCAAuC,kBAAkB,qCAAqC,0BAA0B,qBAAqB,4DAA4D,oDAAoD,oBAAoB,gIAAgI,iFAAiF,oBAAoB,0CAA0C,EAAE,mCAAmC,iHAAiH,sCAAsC,4ZAA4Z,gBAAgB,6BAA6B,kFAAkF,yCAAyC,GAAG,cAAc,MAAM,QAAQ,yFAAyF,sCAAsC,YAAY,kBAAkB,yBAAyB,gCAAgC,4BAA4B,sCAAsC,KAAK,4RAA4R,0CAA0C,0CAA0C,2BAA2B,2CAA2C,uDAAuD,IAAI,yCAAyC,SAAS,4BAA4B,qCAAqC,8BAA8B,qNAAqN,2CAA2C,qBAAqB,mDAAmD,sCAAsC,8BAA8B,sBAAsB,+BAA+B,cAAc,QAAQ,QAAQ,2DAA2D,qCAAqC,wBAAwB,qLAAqL,4BAA4B,gGAAgG,4BAA4B,kBAAkB,2BAA2B,oEAAoE,0BAA0B,4CAA4C,sBAAsB,QAAQ,UAAU,EAAE,+BAA+B,2IAA2I,6BAA6B,0BAA0B,cAAc,MAAM,mBAAmB,0BAA0B,6BAA6B,4BAA4B,oBAAoB,+BAA+B,iGAAiG,cAAc,mBAAmB,EAAE,mBAAmB,sBAAsB,4DAA4D,wBAAwB,8DAA8D,yBAAyB,sIAAsI,kCAAkC,qCAAqC,4BAA4B,iEAAiE,gCAAgC,IAAI,4HAA4H,SAAS,sBAAsB,uCAAuC,yCAAyC,oCAAoC,gDAAgD,wCAAwC,4JAA4J,OAAO,cAAc,6FAA6F,EAAE,yEAAyE,EAAE,oEAAoE,EAAE,2FAA2F,2BAA2B,cAAc,aAAa,mBAAmB,eAAe,KAAK,gCAAgC,8EAA8E,cAAc,uFAAuF,aAAa,4FAA4F,4EAA4E,gBAAgB,uCAAuC,uBAAuB,aAAa,gBAAgB,2DAA2D,6BAA6B,YAAY,qBAAqB,yBAAyB,mBAAmB,uBAAuB,cAAc,0DAA0D,gBAAgB,mBAAmB,IAAI,QAAQ,WAAW,KAAK,eAAe,oJAAoJ,oPAAoP,QAAQ,mGAAmG,oCAAoC,cAAc,GAAG,aAAa,8BAA8B,gBAAgB,2NAA2N,cAAc,oBAAoB,qBAAqB,SAAS,yDAAyD,MAAM,oBAAoB,OAAO,yBAAyB,uCAAuC,2BAA2B,uBAAuB,uCAAuC,yBAAyB,mIAAmI,8BAA8B,gBAAgB,WAAW,wBAAwB,iCAAiC,kGAAkG,KAAK,0BAA0B,YAAY,qBAAqB,2BAA2B,YAAY,WAAW,KAAK,uBAAuB,SAAS,iBAAiB,4CAA4C,eAAe,gBAAgB,2BAA2B,KAAK,uBAAuB,gDAAgD,mGAAmG,OAAO,8CAA8C,8DAA8D,4GAA4G,WAAW,+EAA+E,MAAM,WAAW,KAAK,MAAM,YAAY,wBAAwB,SAAS,uBAAuB,6DAA6D,wBAAwB,6EAA6E,yBAAyB,SAAS,uBAAuB,oEAAoE,cAAc,2BAA2B,oBAAoB,cAAc,gBAAgB,gHAAgH,sKAAsK,mHAAmH,aAAa,2BAA2B,gEAAgE,4EAA4E,iBAAiB,iCAAiC,yBAAyB,WAAW,KAAK,iDAAiD,qBAAqB,6BAA6B,MAAM,uCAAuC,mBAAmB,wCAAwC,WAAW,wFAAwF,yDAAyD,qBAAqB,wCAAwC,8EAA8E,KAAK,gBAAgB,yDAAyD,+BAA+B,kBAAkB,EAAE,+CAA+C,4FAA4F,MAAM,mDAAmD,sBAAsB,6BAA6B,wEAAwE,gCAAgC,iBAAiB,6GAA6G,MAAM,WAAW,mCAAmC,4GAA4G,+BAA+B,MAAM,QAAQ,8GAA8G,OAAO,SAAS,WAAW,cAAc,cAAc,cAAc,QAAQ,WAAW,yBAAyB,+BAA+B,SAAS,cAAc,yEAAyE,cAAc,+BAA+B,cAAc,OAAO,sBAAsB,kEAAkE,aAAa,kBAAkB,uBAAuB,KAAK,8BAA8B,UAAU,cAAc,kCAAkC,uCAAuC,mCAAmC,OAAO,iBAAiB,mBAAmB,wBAAwB,YAAY,EAAE,mBAAmB,kBAAkB,YAAY,sCAAsC,mEAAmE,QAAQ,KAAK,iBAAiB,wEAAwE,wCAAwC,gBAAgB,WAAW,+DAA+D,aAAa,oCAAoC,cAAc,yCAAyC,6BAA6B,4BAA4B,SAAS,gBAAgB,kBAAkB,sBAAsB,cAAc,2BAA2B,mCAAmC,aAAa,kDAAkD,2CAA2C,mEAAmE,EAAE,oEAAoE,gCAAgC,kBAAkB,2CAA2C,GAAG,gOAAgO,E;;;;;;;ACN7ykB;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;;AAEA,cAAc,mBAAO,CAAC,CAAsC;AAC5D,YAAY,mBAAO,CAAC,EAAmC;AACvD;AACA,sBAAsB,mBAAO,CAAC,EAAmB;;AAEjD;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,qBAAqB,sBAAsB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA,wCAAwC,8BAA8B;AACtE;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,iBAAiB,0CAA0C;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,E;;;;;;;ACxIa;;AAEb,6CAA6C,mBAAO,CAAC,EAA0C;AAC/F,2CAA2C,mBAAO,CAAC,CAAwC;AAC3F,mDAAmD,mBAAO,CAAC,EAAgD;;AAE3G,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA;AACA,YAAY,OAAO,YAAY;AAC/B;AACA;AACA,YAAY,OAAO,iBAAiB;AACpC;AACA;AACA,YAAY,IAAI;AAChB,YAAY,OAAO,iBAAiB;AACpC;AACA;AACA;;;AAGA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA,kBAAkB,kBAAkB;AACpC;;AAEA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA,KAAK;AACL;AACA,E;;;;;;;ACzFa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,uBAAuB;AACtE;AACA;AACA,+CAA+C,mBAAmB;AAClE;AACA,aAAa;AACb;AACA;AACA;AACA,2CAA2C,6BAA6B;AACxE;AACA;AACA,2CAA2C,yBAAyB;AACpE;AACA;AACA;AACA,E;;;;;;;AC5Ba;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6C;;;;;;;ACjCa;;AAEb;;AAEA;AACA;AACA,iBAAiB;AACjB,iBAAiB;AACjB,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC3aa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,mBAAmB,mBAAO,CAAC,CAAe;;AAE1C,yCAAyC,mBAAO,CAAC,CAAsC;;AAEvF,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB;AACvB;AACA,+BAA+B;AAC/B,kCAAkC;AAClC;AACA,+BAA+B;AAC/B,kCAAkC;AAClC;;AAEA;AACA,oFAAoF;AACpF;AACA;;AAEA;AACA,uCAAuC;;AAEvC;AACA,mCAAmC;;AAEnC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;AChNa;;AAEb,uCAAuC,mBAAO,CAAC,EAAoC;;AAEnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;AChBa;;AAEb,uBAAuB,mBAAO,CAAC,EAAoB;AACnD;AACA;AACA;AACA;AACA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;ACjBA;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;;AAEA;AACA;AACA,4CAA4C;;AAE5C;;;;;;;;ACnBa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA,KAAK;AACL,E;;;;;;;ACZa;;AAEb;AACA,8BAA8B,mBAAO,CAAC,EAA2B;AACjE;;AAEA;AACA;AACA;AACA,E;;;;;;;ACTa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kC;;;;;;;ACjCa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6C;;;;;;;ACjCa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC;AACA;;AAEA,yCAAyC,mBAAO,CAAC,EAAsC;AACvF,mCAAmC,mBAAO,CAAC,EAAgC;;AAE3E,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;;AAEA,yBAAyB,mBAAO,CAAC,CAAsB;AACvD,sBAAsB,mBAAO,CAAC,CAAmB;AACjD,iCAAiC,mBAAO,CAAC,EAA8B;AACvE,gCAAgC,mBAAO,CAAC,EAA6B;;AAErE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,yDAAyD;AACzD;AACA,KAAK,IAAI;AACT;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,wBAAwB;AACxB;AACA;AACA,OAAO,8BAA8B,0BAA0B;AAC/D,KAAK;AACL;AACA;AACA,GAAG;AACH;AACA,GAAG,EAAE;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,qBAAqB,4BAA4B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA,C;;;;;;;AC/La;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,oGAAoG,mBAAmB,EAAE,mBAAmB,8HAA8H;;AAE1Q;AACA;AACA,+CAA+C;AAC/C;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB;AACpB;AACA;AACA,GAAG;AACH,C;;;;;;;ACzBa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC;;AAEA;AACA;AACA,sBAAsB;AACtB;AACA;AACA,OAAO;AACP,KAAK;AACL,GAAG;AACH,E;;;;;;;AClBa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;;AAEA,yCAAyC,mBAAO,CAAC,EAAsC;AACvF,mCAAmC,mBAAO,CAAC,EAAgC;;AAE3E,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;AACA;;AAEA,yBAAyB,mBAAO,CAAC,CAAsB;AACvD,sBAAsB,mBAAO,CAAC,CAAmB;;AAEjD;AACA;;AAEA;AACA;AACA,mDAAmD;AACnD;AACA,+DAA+D;;AAE/D;AACA;AACA;AACA,GAAG;AACH,iCAAiC;AACjC;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,GAAG,IAAI;AACP;AACA,wDAAwD,qCAAqC;;AAE7F;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB,KAAK;AACL;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,EAAE;AACL,C;;;;;;AC1FA,gIAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK,IAA0C;AAC/C;AACA,EAAE,iCAAO,EAAE,oCAAE,OAAO;AAAA;AAAA;AAAA,oGAAC;AACrB,EAAE,MAAM,EAQL;AACH,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,kBAAkB;AAC5C;AACA;AACA;AACA;AACA;;AAEA,4BAA4B;AAC5B;AACA;AACA;AACA;;;AAGA,8BAA8B;AAC9B;AACA,qBAAqB;AACrB,yCAAyC;AACzC;AACA;AACA;AACA,mC;AACA;AACA;AACA,gCAAgC,cAAc,KAAK;AACnD;AACA,IAAI;AACJ,GAAG;;;AAGH;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA,IAAI,K;AACJ;AACA;AACA,qBAAqB;AACrB;;AAEA,GAAG,KAAK;AACR,qC;AACA;AACA,UAAU,KAAK;AACf,sCAAsC,eAAe;AACrD,I;AACA;AACA;AACA;AACA,0BAA0B,eAAe;;;AAGzC;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,KAAK;;AAEd,+BAA+B,WAAW;AAC1C;;AAEA;;AAEA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sBAAsB,wCAAwC;AACtF,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,0BAA0B;AAC1B,mHAAmH,mBAAmB;AACtI;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sCAAsC;AACtC;AACA;AACA;AACA,yBAAyB,8BAA8B,EAAE;;AAEzD,GAAG;;;;;AAKH,6BAA6B;AAC7B;AACA;;AAEA,eAAe;AACf;AACA,GAAG;AACH;AACA;AACA;AACA,6CAA6C;AAC7C,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,CAAC;;;;;;;;ACtKY;;AAEb;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACpCa;;AAEb,oC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC1Da;;AAEb,oC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC/Ba;;AAEb,oC;AACA,sCAAsC,mBAAO,CAAC,EAAmC;AACjF,2CAA2C,mBAAO,CAAC,CAAwC;AAC3F;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH,E;;;;;;;ACda;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC9Ca;;AAEb,2CAA2C,mBAAO,CAAC,CAAwC;AAC3F;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,EAAE;AACb;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA,uC;;;;;;;AC1Ba;;AAEb,qCAAqC,mBAAO,CAAC,CAAkC;;AAE/E,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC5Ca;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC3Ba;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,qBAAqB,mBAAO,CAAC,EAAkB;AAC/C;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,E;;;;;;;ACda;;AAEb;AACA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,qCAAqC,mBAAO,CAAC,CAAkC;AAC/E;AACA,oBAAoB;AACpB;AACA;AACA,KAAK;AACL,E;;;;;;;ACZa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,qCAAqC,mBAAO,CAAC,CAAkC;AAC/E;AACA,oBAAoB;AACpB;AACA;AACA,KAAK;AACL,E;;;;;;;ACXa;;AAEb,qCAAqC,mBAAO,CAAC,CAAkC;AAC/E,qBAAqB,mBAAO,CAAC,CAAkB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,0BAA0B;AACvD;AACA;AACA;AACA;AACA,E;;;;;;;ACfa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,E;;;;;;;ACba;;AAEb,8CAA8C,mBAAO,CAAC,EAA2C;AACjG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACxBa;;AAEb;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,E;;;;;;;ACXa;;AAEb;AACA;AACA,8BAA8B,mBAAO,CAAC,EAA2B;AACjE;AACA;AACA;AACA,YAAY,OAAO,YAAY;AAC/B;AACA;AACA,YAAY,OAAO,iBAAiB;AACpC;AACA;AACA,YAAY,IAAI;AAChB,YAAY,OAAO,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACpCa;;AAEb,8CAA8C,mBAAO,CAAC,EAA2C;AACjG,sBAAsB,mBAAO,CAAC,EAAmB;AACjD,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,E;;;;;;;ACrBa;;AAEb,sBAAsB,mBAAO,CAAC,EAAmB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACxGa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA,6C;;;;;;;ACRa;;AAEb;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACfA,8CAAa;;AAEb,oGAAoG,mBAAmB,EAAE,mBAAmB,8HAA8H;;AAE1Q,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,EAAyB;AACjD;AACA;;AAEA,mBAAmB,mBAAO,CAAC,CAAe;;AAE1C;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kIAAkI;AAClI;AACA;AACA;AACA,mIAAmI;AACnI;AACA;AACA;AACA,yFAAyF;AACzF;AACA;AACA,C;;;;;;;;ACvIA,8CAAa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;;AAEA,4BAA4B,uCAAuC,GAAG,uCAAuC,GAAG,mCAAmC,GAAG,kCAAkC,GAAG,mCAAmC,GAAG,kCAAkC,GAAG,mCAAmC,GAAG,yCAAyC,GAAG,uCAAuC,GAAG,gCAAgC,GAAG,2CAA2C,GAAG,kCAAkC,GAAG,uCAAuC,GAAG,uCAAuC,GAAG,mCAAmC,GAAG,iCAAiC,GAAG,oCAAoC,GAAG,kCAAkC,GAAG,mCAAmC,GAAG,sCAAsC,GAAG,mCAAmC,GAAG,uCAAuC,GAAG,qCAAqC,GAAG,wCAAwC,GAAG,gCAAgC,GAAG,sCAAsC,GAAG,sCAAsC,GAAG,oCAAoC,GAAG,qCAAqC,GAAG,iCAAiC,GAAG,gCAAgC,GAAG,sCAAsC,GAAG,iCAAiC,GAAG,iCAAiC,GAAG,mCAAmC,GAAG,qCAAqC,GAAG,gCAAgC,GAAG,kCAAkC,GAAG,wCAAwC,GAAG,yCAAyC,GAAG,4CAA4C,GAAG,yCAAyC,GAAG,wCAAwC,GAAG,sCAAsC,GAAG,wCAAwC,GAAG,qCAAqC,GAAG,wCAAwC,GAAG,2CAA2C,GAAG,0CAA0C,GAAG,iCAAiC,GAAG,qCAAqC,GAAG,yCAAyC,GAAG,qCAAqC,GAAG,mCAAmC,GAAG,iCAAiC,GAAG,oCAAoC,GAAG,yCAAyC,GAAG,uCAAuC,GAAG,0CAA0C,GAAG,4CAA4C,GAAG,wCAAwC,GAAG,qCAAqC,GAAG,yCAAyC,GAAG,2CAA2C,GAAG,oCAAoC,GAAG,gCAAgC,GAAG,uCAAuC,GAAG,0CAA0C,GAAG,wCAAwC,GAAG,iCAAiC,GAAG,uCAAuC,GAAG,qCAAqC,GAAG,sCAAsC,GAAG,kCAAkC,GAAG,wCAAwC,GAAG,mCAAmC,GAAG,kCAAkC,GAAG,mCAAmC,GAAG,kCAAkC,GAAG,sCAAsC,GAAG,iCAAiC,GAAG,gCAAgC,GAAG,gCAAgC,GAAG,wCAAwC,GAAG,uCAAuC,GAAG,4CAA4C,GAAG,uCAAuC,GAAG,iCAAiC,GAAG,qCAAqC,GAAG,sCAAsC;;AAEzjH;AACA;AACA,sBAAsB;AACtB;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;AACA,sBAAsB,kDAAkD,qBAAqB,IAAI,qBAAqB;AACtH,GAAG;AACH;;AAEA,oBAAoB;AACpB;;AAEA;AACA,mFAAmF;AACnF;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;;AAEA;AACA,oFAAoF;AACpF;;AAEA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,yD;;;;;;;;AClEa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACXa;;AAEb,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA;AACA;AACA,GAAG;AACH,E;;;;;;;ACRa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P;AACA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;;AAEA,cAAc,mBAAO,CAAC,EAAW;AACjC,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;AACA;;AAEA,yCAAyC,mBAAO,CAAC,CAAsC;;AAEvF;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;;AAEb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL,GAAG;;AAEH;;AAEA;;AAEA;AACA;AACA;AACA;AACA,yDAAyD,2BAA2B;AACpF,KAAK;AACL;AACA;AACA,kFAAkF,2BAA2B;AAC7G;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kLAAkL;AAClL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,uBAAuB;AAClD;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uJAAuJ;AACvJ;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,E;;;;;;;AC3Ra;;AAEb,4CAA4C,sBAAsB,GAAG,sBAAsB;AAC3F;AACA;AACA;AACA;AACA;;AAEA,4BAA4B,kCAAkC;AAC9D;AACA;AACA;AACA,uBAAuB,gBAAgB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA,iBAAiB,iCAAiC;AAClD;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,+CAA+C,oDAAoD,GAAG,cAAc;AACpH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA,oBAAoB,yBAAyB;AAC7C;AACA;AACA;AACA,MAAM;AACN,IAAI;AACJ;AACA;AACA,+FAA+F,eAAe;AAC9G;AACA,I;;;;;;;AC9Ea;;AAEb,iCAAiC,mBAAO,CAAC,EAAiC;;AAE1E,4CAA4C,sBAAsB,GAAG,sBAAsB;AAC3F;AACA;AACA;AACA;AACA;AACA,iBAAiB,oCAAoC;AACrD;AACA;AACA;AACA;AACA,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA,0BAA0B,uCAAuC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN,oBAAoB,oCAAoC;AACxD;AACA,+BAA+B,yCAAyC;AACxE;AACA;AACA;AACA;AACA;AACA,M;;;;;;;ACvCa;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,mBAAO,CAAC,GAAe;;AAE1C;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA,E;;;;;;;ACzCa;;AAEb;AACA;AACA,E;;;;;;;ACJa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;;AAEA,yBAAyB,mBAAO,CAAC,CAAsB;AACvD,sBAAsB,mBAAO,CAAC,CAAmB;AACjD,0BAA0B,mBAAO,CAAC,EAAuB;;AAEzD;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA,sBAAsB;AACtB;AACA;AACA,OAAO;AACP,KAAK;AACL,GAAG;AACH;AACA,GAAG,EAAE;AACL,C;;;;;;;ACvCa;;AAEb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,C;;;;;;;ACVa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P;AACA;AACA;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,YAAY,EAAE;AACnC,mBAAmB,EAAE,YAAY,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,uBAAuB,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,sBAAsB,EAAE;AACxB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,YAAY,EAAE;AACnC,mBAAmB,EAAE,YAAY,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,yBAAyB,EAAE,EAAE,EAAE;AAC/B,yBAAyB,EAAE,EAAE,EAAE;AAC/B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,0CAA0C,EAAE;AAC5C,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE,EAAE,EAAE;AAC3B,qBAAqB,EAAE,EAAE,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,2CAA2C,EAAE,GAAG,EAAE;AAClD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE,IAAI,EAAE;AAC7C,mBAAmB,EAAE,oBAAoB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,MAAM,EAAE;AAC7B,mBAAmB,EAAE,MAAM,EAAE;AAC7B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,oBAAoB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAChD;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE;AACrD,mBAAmB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE;AACrD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,uCAAuC,EAAE;AACzC;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,uCAAuC,EAAE,GAAG,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,wBAAwB,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACjC,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACjC;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,0BAA0B,EAAE;AAC5B,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,mBAAmB,EAAE;AACrB,uBAAuB,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,YAAY,EAAE;AACnC,mBAAmB,EAAE,YAAY,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,OAAO,EAAE;AACnC,wBAAwB,EAAE,OAAO,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,uBAAuB,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,0BAA0B,EAAE;AAC5B,mBAAmB,EAAE;AACrB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA,0BAA0B,EAAE;AAC5B,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE;AAC1C,2CAA2C,EAAE,EAAE,EAAE;AACjD;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE;AAC1C,2CAA2C,EAAE,EAAE,EAAE;AACjD;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,OAAO,EAAE;AAC/B,oBAAoB,EAAE,OAAO,EAAE;AAC/B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,MAAM,EAAE;AAC7B,mBAAmB,EAAE,MAAM,EAAE;AAC7B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,GAAG,EAAE;AAC1B,oBAAoB,EAAE,GAAG,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,uCAAuC,EAAE,GAAG,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,4CAA4C,EAAE;AAC9C,mCAAmC,EAAE;AACrC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,IAAI,EAAE;AAC9C,mBAAmB,EAAE,oBAAoB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE,EAAE,EAAE;AAC3B,qBAAqB,EAAE,EAAE,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,qBAAqB,EAAE,EAAE,EAAE;AAC3B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,IAAI,EAAE;AAC9C,mBAAmB,EAAE,oBAAoB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C,mBAAmB,EAAE,qBAAqB,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,2CAA2C,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE;AACzB,mBAAmB,EAAE,EAAE,EAAE;AACzB;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,gDAAgD,EAAE;AAClD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,uBAAuB,EAAE;AACzB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,0BAA0B,EAAE;AAC5B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,wBAAwB,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,uCAAuC,EAAE,GAAG,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,MAAM,EAAE,EAAE,EAAE;AACjC,mBAAmB,EAAE,MAAM,EAAE,EAAE,EAAE;AACjC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,uBAAuB,EAAE;AAC/C,0CAA0C,EAAE,OAAO,EAAE;AACrD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,OAAO,EAAE;AAC/B,oBAAoB,EAAE,OAAO,EAAE;AAC/B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,MAAM,EAAE,EAAE,EAAE;AACjC,mBAAmB,EAAE,MAAM,EAAE,EAAE,EAAE;AACjC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE;AAC1C,2CAA2C,EAAE,EAAE,EAAE;AACjD;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,yBAAyB,EAAE;AAC3B,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,IAAI,EAAE;AAChD,mBAAmB,EAAE,oBAAoB,EAAE,EAAE,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,qBAAqB,EAAE;AACvB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,OAAO,EAAE;AACjD,oBAAoB,EAAE,uBAAuB,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE;AAC1C,uCAAuC,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,0CAA0C,EAAE;AAC5C,0CAA0C,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,2CAA2C,EAAE,GAAG,EAAE;AAClD;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,uBAAuB,EAAE,IAAI,EAAE;AAC/B,oBAAoB,EAAE,QAAQ,EAAE;AAChC;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,2BAA2B,EAAE;AAC7B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C,mBAAmB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE;AAC9C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,uBAAuB,EAAE;AACzB,mBAAmB,EAAE;AACrB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,0BAA0B,EAAE;AAC5B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,0BAA0B,EAAE;AAC5B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,qCAAqC,EAAE;AACvC;AACA;AACA,CAAC;AACD;AACA;AACA,uCAAuC,EAAE,GAAG,EAAE;AAC9C,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA,0CAA0C,EAAE;AAC5C,0CAA0C,EAAE;AAC5C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,OAAO,EAAE;AACnC,wBAAwB,EAAE,OAAO,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,GAAG,EAAE;AAC7C,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,2CAA2C,EAAE,GAAG,EAAE;AAClD;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,MAAM,EAAE;AAC7B,mBAAmB,EAAE,MAAM,EAAE;AAC7B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,2CAA2C,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C,wBAAwB,EAAE,mBAAmB,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,GAAG,EAAE;AAC1B,oBAAoB,EAAE,GAAG,EAAE;AAC3B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE;AAC1B,wBAAwB,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,yBAAyB,EAAE;AAC3B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,QAAQ,EAAE;AAClD,wBAAwB,EAAE,wBAAwB,EAAE;AACpD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,uCAAuC,EAAE;AACzC;AACA;AACA,CAAC;AACD;AACA;AACA,yBAAyB,EAAE,EAAE,EAAE;AAC/B,yBAAyB,EAAE,EAAE,EAAE;AAC/B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,iCAAiC,EAAE;AACnC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,OAAO,EAAE;AACnD,oBAAoB,EAAE,uBAAuB,EAAE,EAAE,EAAE;AACnD;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,OAAO,EAAE;AACnD,oBAAoB,EAAE,uBAAuB,EAAE,EAAE,EAAE;AACnD;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,0BAA0B,EAAE;AAC5B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,sBAAsB,EAAE;AACxB;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,OAAO,EAAE;AAC/B,oBAAoB,EAAE,OAAO,EAAE;AAC/B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,oBAAoB,EAAE;AACtB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,IAAI,EAAE;AAC9C,mBAAmB,EAAE,oBAAoB,EAAE;AAC3C;AACA;AACA,CAAC;AACD;AACA;AACA,uCAAuC,EAAE;AACzC,2CAA2C,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,yBAAyB,EAAE,EAAE,EAAE;AAC/B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,OAAO,EAAE;AAC9B,mBAAmB,EAAE,OAAO,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA,uCAAuC,EAAE;AACzC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,2BAA2B,EAAE;AAC7B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,yBAAyB,EAAE;AAC3B,yBAAyB,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,wCAAwC,EAAE;AAC1C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,2CAA2C,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,oBAAoB,EAAE,EAAE,EAAE;AAC1B;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE;AACtB,sBAAsB,EAAE;AACxB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE;AACrB,oBAAoB,EAAE;AACtB;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE;AAC1C,2CAA2C,EAAE,EAAE,EAAE;AACjD;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,sCAAsC,EAAE,GAAG,EAAE;AAC7C;AACA;AACA,CAAC;AACD;AACA;AACA,qBAAqB,EAAE;AACvB,qBAAqB,EAAE;AACvB;AACA;AACA,CAAC;AACD;AACA;AACA,sBAAsB,EAAE;AACxB,mBAAmB,EAAE;AACrB;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,IAAI,EAAE;AAC3B,mBAAmB,EAAE,IAAI,EAAE;AAC3B;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,EAAE,EAAE;AAC1B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,gDAAgD,EAAE,GAAG,EAAE;AACvD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACjC,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACjC;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C,sCAAsC,EAAE,GAAG,EAAE;AAC7C;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,IAAI,EAAE;AAChD,mBAAmB,EAAE,oBAAoB,EAAE,EAAE,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,wBAAwB,EAAE,EAAE,EAAE;AAC9B,wBAAwB,EAAE,EAAE,EAAE;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,qCAAqC,EAAE,GAAG,EAAE;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C,qCAAqC,EAAE,GAAG,EAAE;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C,sCAAsC,EAAE,GAAG,EAAE;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,EAAE,EAAE;AAC5C,yBAAyB,EAAE,kBAAkB,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,GAAG,EAAE;AAC7C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE,GAAG,EAAE;AAC7C,mBAAmB,EAAE,mBAAmB,EAAE;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAChD,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE;AAClD,mBAAmB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE;AACjD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,0CAA0C,EAAE;AAC5C,0CAA0C,EAAE;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,oBAAoB,EAAE,mBAAmB,EAAE;AAC3C,sCAAsC,EAAE,GAAG,EAAE;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,sCAAsC,EAAE;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE,IAAI,EAAE;AAC7C,mBAAmB,EAAE,oBAAoB,EAAE;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,0CAA0C,EAAE;AAC5C,8CAA8C,EAAE;AAChD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,qCAAqC,EAAE;AACvC,4CAA4C,EAAE;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,sCAAsC,EAAE;AACxC,2CAA2C,EAAE;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA,MAAM,YAAY;AAClB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,0DAA0D,QAAQ,aAAa;AAC/E,GAAG;AACH,CAAC;;AAED,sC;;;;;;;ACl1Ha;;AAEb,mBAAmB,mBAAO,CAAC,CAAe;AAC1C,yCAAyC,mBAAO,CAAC,CAAsC;AACvF;AACA;AACA;AACA;AACA,YAAY,IAAI;AAChB,YAAY,OAAO;AACnB,YAAY,IAAI;AAChB,YAAY,QAAQ;AACpB,YAAY,wBAAwB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2EAA2E,EAAE,uDAAuD,EAAE;AACtI;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iHAAiH;AACjH;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,E;;;;;;;ACpHa;;AAEb,0CAA0C,mBAAO,CAAC,EAAuC;;AAEzF,qD;;;;;;;ACJa;;AAEb,qCAAqC,mBAAO,CAAC,EAAkC;;AAE/E;AACA;AACA,iBAAiB,+BAA+B;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACda;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;;AAEA,mBAAmB,mBAAO,CAAC,CAAe;;AAE1C,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;AACA;;AAEA,8BAA8B,mBAAO,CAAC,EAA2B;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,2BAA2B,yBAAyB;AACpD;AACA;AACA;AACA;AACA;AACA,6BAA6B,yBAAyB;AACtD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,yBAAyB;;AAE7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA,OAAO;AACP,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA,+E;;;;;;;ACpKa;;AAEb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,yBAAyB;AACzB;AACA;AACA;AACA;AACA,GAAG;AACH,E;;;;;;;ACrBa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;AACA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;AACA;;AAEA;AACA,mFAAmF;AACnF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,wBAAwB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,wBAAwB,uCAAuC,eAAe,+BAA+B;AACpH;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA,C;;;;;;;AC9Ja;;AAEb,kCAAkC,mBAAO,CAAC,EAA+B;AACzE,yBAAyB,mBAAO,CAAC,EAAsB;;AAEvD;AACA;AACA;AACA;;AAEA;AACA;AACA,mFAAmF;AACnF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,gBAAgB;AACnC;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACpHa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;AACA;AACA,yBAAyB;AACzB;;AAEA;AACA;;AAEA,uBAAuB,aAAa;;AAEpC;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA,OAAO;AACP,uBAAuB;AACvB;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,E;;;;;;;ACzFa;;AAEb,gBAAgB,mBAAO,CAAC,EAAa;;AAErC,eAAe,mBAAO,CAAC,EAAgB;AACvC;AACA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,EAAyB;AACjD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,mBAAO,CAAC,EAA8B;AAClF,mCAAmC,mBAAO,CAAC,GAAqB;AAChE,oDAAoD,mBAAO,CAAC,EAAsC;AAClG,oDAAoD,mBAAO,CAAC,GAAsC;AAClG,kCAAkC,mBAAO,CAAC,GAAoB;AAC9D,gCAAgC,mBAAO,CAAC,GAAkB;AAC1D,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,4CAA4C,mBAAO,CAAC,EAA8B;AAClF,iCAAiC,mBAAO,CAAC,CAAmB;AAC5D,oCAAoC,mBAAO,CAAC,EAAsB;AAClE,6BAA6B,mBAAO,CAAC,GAAe;AACpD,yBAAyB,mBAAO,CAAC,EAAW;AAC5C,gDAAgD,mBAAO,CAAC,EAAkC;AAC1F,2CAA2C,mBAAO,CAAC,GAA6B;AAChF,kCAAkC,mBAAO,CAAC,EAAoB;AAC9D,wDAAwD,mBAAO,CAAC,GAA0C;AAC1G,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,sCAAsC,mBAAO,CAAC,GAAwB;AACtE,sCAAsC,mBAAO,CAAC,GAAwB;AACtE,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,6DAA6D,mBAAO,CAAC,GAA+C;AACpH,mCAAmC,mBAAO,CAAC,GAAqB;AAChE,qCAAqC,mBAAO,CAAC,GAAuB;AACpE,kDAAkD,mBAAO,CAAC,EAAoC;AAC9F,iDAAiD,mBAAO,CAAC,EAAmC;AAC5F,sDAAsD,mBAAO,CAAC,EAAwC;AACtG,0CAA0C,mBAAO,CAAC,GAA4B;AAC9E,gEAAgE,mBAAO,CAAC,GAAkD;AAC1H,qDAAqD,mBAAO,CAAC,GAAuC;AACpG,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,yCAAyC,mBAAO,CAAC,EAA2B;AAC5E,gCAAgC,mBAAO,CAAC,GAAkB;AAC1D,wCAAwC,mBAAO,CAAC,EAA0B;AAC1E,gDAAgD,mBAAO,CAAC,EAA0B;AAClF,sCAAsC,mBAAO,CAAC,GAAwB;AACtE,+DAA+D,mBAAO,CAAC,GAAiD;AACxH,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,+CAA+C,mBAAO,CAAC,GAAiC;AACxF,wDAAwD,mBAAO,CAAC,GAA0C;AAC1G,6DAA6D,mBAAO,CAAC,GAA+C;AACpH,uEAAuE,mBAAO,CAAC,GAAyD;AACxI,gDAAgD,mBAAO,CAAC,EAAkC;AAC1F,4DAA4D,mBAAO,CAAC,GAA8C;AAClH,oDAAoD,mBAAO,CAAC,CAAsC;AAClG,0CAA0C,mBAAO,CAAC,GAA4B;AAC9E,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,mDAAmD,mBAAO,CAAC,GAAqC;AAChG,8CAA8C,mBAAO,CAAC,EAAgC;AACtF,qDAAqD,mBAAO,CAAC,EAAuC;AACpG,sCAAsC,mBAAO,CAAC,EAAwB;AACtE,yCAAyC,mBAAO,CAAC,GAA2B;AAC5E,gCAAgC,mBAAO,CAAC,GAAkB;AAC1D,iCAAiC,mBAAO,CAAC,EAAmB;AAC5D,8CAA8C,mBAAO,CAAC,EAAgC;AACtF,qCAAqC,mBAAO,CAAC,EAAuB;AACpE,yDAAyD,mBAAO,CAAC,EAA2C;AAC5G,oCAAoC,mBAAO,CAAC,CAAsB;AAClE,kCAAkC,mBAAO,CAAC,EAAoB;AAC9D,sDAAsD,mBAAO,CAAC,GAAwC;AACtG,mCAAmC,mBAAO,CAAC,GAAqB;AAChE,gCAAgC,mBAAO,CAAC,EAAkB;AAC1D,gCAAgC,mBAAO,CAAC,GAAkB;AAC1D,+CAA+C,mBAAO,CAAC,EAAiC;AACxF,yDAAyD,mBAAO,CAAC,GAA2C;AAC5G,oDAAoD,mBAAO,CAAC,EAAsC;AAClG,oDAAoD,mBAAO,CAAC,GAAsC;AAClG,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,6CAA6C,mBAAO,CAAC,EAA+B;AACpF,6CAA6C,mBAAO,CAAC,GAA+B;AACpF,mCAAmC,mBAAO,CAAC,GAAqB;AAChE,uCAAuC,mBAAO,CAAC,GAAyB;AACxE,2CAA2C,mBAAO,CAAC,EAA6B,E;;;;;;;;;;;;;ACxGhF;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,aAAa;AACb,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,KAAK;AACL,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,WAAW;AACX;;AAEA;AACA;AACA,wCAAwC,WAAW;AACnD;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;;AAEA;;AAEA,SAAS;AACT;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC,cAAc;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,iCAAiC,kBAAkB;AACnD;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,iBAAiB;;AAEjB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,iBAAiB;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,YAAY;AACZ;AACA;;AAEA;AACA,YAAY;AACZ;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,8CAA8C,QAAQ;AACtD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;;AAEA,WAAW;AACX;AACA;AACA;;AAEA,WAAW;AACX;AACA;AACA;;AAEA,WAAW;AACX;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,8CAA8C,QAAQ;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,CAAC;AACD;AACA;AACA;AACA;AACA,EAAE,KAA0B,oBAAoB,SAAE;AAClD;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC3uBa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;AACA;;AAEA,yBAAyB,mBAAO,CAAC,CAAsB;AACvD,aAAa,mBAAO,CAAC,GAAe;AACpC;AACA,CAAC;;AAED;AACA,mFAAmF;AACnF;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;AACA,GAAG;;AAEH;AACA;AACA;AACA,oFAAoF;AACpF;AACA;;AAEA;AACA;AACA,GAAG;AACH,8DAA8D,6BAA6B;AAC3F;AACA;AACA;AACA;;AAEA,kBAAkB,wG;;;;;;ACxDlB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;;;;;ACrBA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,sBAAsB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qCAAqC;;AAErC;AACA;AACA;;AAEA,2BAA2B;AAC3B;AACA;AACA;AACA,4BAA4B,UAAU;;;;;;;;ACvLzB;;AAEb,2CAA2C,mBAAO,CAAC,CAAwC;AAC3F,8BAA8B,mBAAO,CAAC,EAA2B;AACjE,sC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,iBAAiB;AACjB;AACA,iBAAiB;AACjB;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,E;;;;;;;AC1Ca;;AAEb,sC;AACA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC9Ba;;AAEb,0BAA0B,mBAAO,CAAC,EAAuB;AACzD;AACA,qCAAqC,uDAAuD;AAC5F,E;;;;;;;ACLa;;AAEb,0BAA0B,mBAAO,CAAC,EAAuB;AACzD;AACA,sCAAsC,GAAG,uDAAuD;AAChG,E;;;;;;;ACLa;;AAEb,qBAAqB,mBAAO,CAAC,CAAkB;AAC/C;AACA;AACA;AACA;AACA,E;;;;;;;ACPa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,yBAAyB,mBAAO,CAAC,EAAsB;AACvD,4BAA4B,mBAAO,CAAC,EAAyB;;AAE7D;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;AClBa;;AAEb;AACA;AACA,E;;;;;;;ACJa;;AAEb,8CAA8C,mBAAO,CAAC,EAA2C;AACjG,iDAAiD,mBAAO,CAAC,EAA8C;AACvG;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,E;;;;;;;ACVa;;AAEb,oCAAoC,mBAAO,CAAC,EAAiC;AAC7E,yBAAyB,mBAAO,CAAC,EAAsB;AACvD,6CAA6C,mBAAO,CAAC,EAA0C;AAC/F,qBAAqB,mBAAO,CAAC,EAAkB;;AAE/C,qBAAqB,mBAAO,CAAC,CAAkB;AAC/C;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,Q;;;;;;;ACjFa;;AAEb,qCAAqC,mBAAO,CAAC,CAAkC;;AAE/E;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,C;;;;;;;ACpBa;;AAEb;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,E;;;;;;;ACzBa;;AAEb,qBAAqB,mBAAO,CAAC,CAAkB;AAC/C,6CAA6C,mBAAO,CAAC,EAA0C;AAC/F;AACA;AACA;AACA;AACA,KAAK;AACL,E;;;;;;;ACTa;;AAEb;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACPa;;AAEb,qBAAqB,mBAAO,CAAC,CAAkB;;AAE/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,oCAAoC,qCAAqC;;AAEzE;AACA;AACA;AACA;AACA;AACA,C;;;;;;;AC7Ba;;AAEb,qBAAqB,mBAAO,CAAC,CAAkB;AAC/C,qCAAqC,mBAAO,CAAC,CAAkC;;AAE/E;AACA,4BAA4B,qCAAqC;AACjE;AACA,E;;;;;;;ACRa;;AAEb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL,E;;;;;;;AC5Ba;;AAEb,oC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,E;;;;;;;AClBa;;AAEb,4CAA4C,mBAAO,CAAC,EAAyC;AAC7F;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,YAAY;AACZ,E;;;;;;;ACpBa;;AAEb,qCAAqC,mBAAO,CAAC,CAAkC;AAC/E,8BAA8B,mBAAO,CAAC,EAA2B;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;ACrBa;;AAEb;AACA,6CAA6C,mBAAO,CAAC,EAA0C;AAC/F;AACA;AACA;AACA;AACA,E;;;;;;;ACRa;;AAEb,oCAAoC,mBAAO,CAAC,EAAiC;AAC7E;AACA;AACA,E;;;;;;;ACLa;;AAEb,qCAAqC,mBAAO,CAAC,CAAkC;AAC/E,8BAA8B,mBAAO,CAAC,EAA2B;;AAEjE,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,C;;;;;;;ACfa;;AAEb,8BAA8B,mBAAO,CAAC,EAA2B;AACjE;AACA,4CAA4C,gCAAgC;AAC5E,E;;;;;;;ACLa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACda;;AAEb,oC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACba;;AAEb;AACA,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,0BAA0B;AAC1B;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA,C;;;;;;;AC1Ba;;AAEb,6CAA6C,mBAAO,CAAC,EAA0C;AAC/F,6DAA6D,mBAAO,CAAC,EAA0D;AAC/H,mCAAmC,mBAAO,CAAC,EAAgC;AAC3E,qCAAqC,mBAAO,CAAC,CAAkC;;AAE/E;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA,E;;;;;;ACjBA;AACA,CAAC,KAA4D,oBAAoB,mBAAO,CAAC,GAAS;AAClG,CAAC,SACmD;AACpD,CAAC,kCAAkC;;AAEnC;;AAEA;AACA;AACA,CAAC;AACD;AACA;;;;;;;;;;;;AAYA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;AAQD;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;;;;;;;;;;;AAYA;AACA;AACA;AACA;;AAEA;AACA;;;;;;AAMA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA+C,+BAA+B;AAC9E;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;;AAcD;AACA;AACA,6CAA6C,gBAAgB;;AAE7D;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,gBAAgB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,yBAAyB,6BAA6B;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;AACA;AACA,aAAa,cAAc;AAC3B,eAAe,cAAc;AAC7B;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,sBAAsB,eAAe;AACrC;AACA,wBAAwB,eAAe;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,2BAA2B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,2BAA2B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,2BAA2B;AACrD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B,2BAA2B;AACrD;AACA;AACA;AACA;AACA;AACA,sCAAsC,uCAAuC;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;;AAEA;AACA;AACA,mCAAmC,YAAY;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,wBAAwB;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,wBAAwB;AAC3C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,YAAY,EAAE;AAChC;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,sBAAsB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA,WAAW,OAAO;AAClB,YAAY,gCAAgC;AAC5C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,gCAAgC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,QAAQ;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;;AAEd;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,gCAAgC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,WAAW;AAC5B;AACA;AACA;AACA;;AAEA;AACA,+BAA+B,iBAAiB;AAChD;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+BAA+B,iBAAiB;AAChD;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,gCAAgC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,oBAAoB;;AAEpB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;;;AAGA;AACA;AACA;AACA,WAAW,gCAAgC;AAC3C,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,eAAe;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,cAAc,eAAe;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,gCAAgC;AAC3C;AACA;AACA;AACA,sBAAsB;AACtB,2BAA2B;AAC3B,aAAa,QAAQ;AACrB;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,OAAO;AACZ;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,gCAAgC;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,gCAAgC;AAC3C;AACA;AACA;AACA,sBAAsB;AACtB,2BAA2B;AAC3B,aAAa,QAAQ;AACrB;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK,OAAO;AACZ;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,gCAAgC;AAC3C;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,gCAAgC;AAC3C,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,kBAAkB;AAC/B,sCAAsC;AACtC;AACA;AACA,sCAAsC;AACtC;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,gCAAgC;AAC3C,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC,yBAAyB;AACzB,2BAA2B;AAC3B,+CAA+C,4BAA4B;AAC3E,kCAAkC,gCAAgC;AAClE;AACA;AACA,kDAAkD;AAClD;AACA;AACA,kDAAkD;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,gCAAgC;AAC3C,YAAY,OAAO;AACnB;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,gCAAgC;AAC3C,YAAY,OAAO;AACnB;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,oCAAoC;AACpC;AACA,WAAW,gCAAgC;AAC3C,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,WAAW,gCAAgC;AAC3C,YAAY,OAAO;AACnB;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,gCAAgC;AAC5C,YAAY,OAAO;AACnB;AACA;AACA;AACA,sBAAsB;AACtB,kBAAkB;AAClB;AACA,iBAAiB,mBAAmB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB;;AAEjB;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA,oBAAoB;AACpB;AACA,OAAO,OAAO;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;;;AAGA;;;AAGA;AACA;AACA;AACA,WAAW,4BAA4B;AACvC,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,uCAAuC;AAClD;AACA,WAAW,uCAAuC;AAClD;AACA,WAAW,uCAAuC;AAClD;AACA,YAAY,qCAAqC;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,OAAO;AAC9B,6CAA6C,OAAO;AACpD;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,uBAAuB,gCAAgC;AACvD;AACA,GAAG;AACH;AACA;AACA,uBAAuB,OAAO;AAC9B,uBAAuB,gCAAgC;AACvD,GAAG;AACH;AACA;AACA;AACA,uBAAuB,OAAO;AAC9B,uBAAuB,gCAAgC;AACvD,GAAG;AACH;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;AACA,0BAA0B;AAC1B,sBAAsB;AACtB,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA,WAAW,qCAAqC;AAChD,YAAY,qCAAqC;AACjD;AACA;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA,mBAAmB,wBAAwB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,qCAAqC;AAChD,WAAW,OAAO;AAClB,YAAY,iCAAiC;AAC7C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,yBAAyB,6BAA6B;AACtD;AACA;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA,aAAa,mCAAmC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,WAAW,qCAAqC;AAChD,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;;AAEA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC,kCAAkC;AAClC;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,qCAAqC;AAChD;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,qCAAqC;AAChD,YAAY,OAAO;AACnB;AACA;AACA;AACA,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;;;AAGA;AACA;AACA,WAAW,OAAO;AAClB,YAAY,qCAAqC;AACjD,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,aAAa,gCAAgC;AAC7C;AACA,aAAa,QAAQ;AACrB;AACA,aAAa,QAAQ;AACrB;AACA,aAAa,OAAO;AACpB;AACA,aAAa,OAAO;AACpB;AACA;;;AAGA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,uBAAuB,uBAAuB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,OAAO;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,+CAA+C,gBAAgB;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,uCAAuC,OAAO;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D,2BAA2B;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;;;AAID;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,uCAAuC,OAAO;AAC9C;AACA;AACA;AACA,8DAA8D,2BAA2B;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,kIAAkI;AAClI;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;;AAEA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uEAAuE,aAAa,yEAAyE,eAAe,uQAAuQ,2HAA2H,mBAAmB,YAAY,0BAA0B,+BAA+B;AACtoB;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA,mCAAmC,gBAAgB,gBAAgB,kBAAkB,kBAAkB;AACvG,iBAAiB,yBAAyB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,OAAO;AAC5C;AACA;AACA;AACA;AACA;;AAEA,wCAAwC,OAAO;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,qEAAqE,MAAM;AAC3E;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,uCAAuC,OAAO;AAC9C;AACA;AACA;AACA,8DAA8D,2BAA2B;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,yBAAyB,iBAAiB,GAAG;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;;AAEA;;AAEA;;AAEA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;;AAEA;AACA,kDAAkD,kBAAkB;AACpE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,6BAA6B,sCAAsC;AACnE;AACA,GAAG;AACH;AACA;AACA,6BAA6B,0CAA0C;AACvE;AACA,GAAG;AACH;AACA;AACA,6BAA6B,wBAAwB;AACrD;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,YAAY;AACZ,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,mEAAmE,aAAa;AAChF;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0EAA0E,eAAe;AACzF;AACA;;AAEA,wCAAwC,OAAO;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,uCAAuC,OAAO;AAC9C;AACA;AACA;AACA;AACA;AACA,8DAA8D,2BAA2B;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA,CAAC;;;;AAID;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,kBAAkB,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE;AAChG;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,8CAA8C,cAAc;;AAE5D,CAAC;;;;;;;;;;;;;;ACpxJY;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,EAAgB;AACvC;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,iDAAiD,8CAA8C;AAC/F;AACA,KAAK;AACL,uDAAuD,kDAAkD;AACzG;AACA,KAAK;AACL;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH,YAAY;AACZ;AACA;AACA,mC;;;;;;;AChCa;;AAEb,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA;AACA;AACA,GAAG;AACH,E;;;;;;;ACRa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P;;AAEA,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA,GAAG;AACH;AACA;AACA,MAAM;;AAEN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA,6BAA6B,mCAAmC;AAChE,oBAAoB;AACpB;AACA;AACA,GAAG;AACH,C;;;;;;;AC/Fa;;AAEb;AACA;AACA,E;;;;;;ACJA;AACA;AACA,E;;;;;;;ACFa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,uBAAuB;;AAEvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,mBAAmB,QAAQ;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA,aAAa,OAAO;AACpB,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,aAAa,OAAO;AACpB,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,IAAI;AAClB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,sBAAsB;;AAEtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA,cAAc,OAAO;AACrB,cAAc,OAAO;AACrB,cAAc,IAAI;AAClB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA,wE;;;;;;;AC7La;;AAEb,0CAA0C,mBAAO,CAAC,EAAuC;AACzF;AACA,+CAA+C;AAC/C,E;;;;;;;ACLa;;AAEb;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACRa;;AAEb,2BAA2B,mBAAO,CAAC,EAAwB;;AAE3D;;AAEA;;AAEA;AACA;AACA,CAAC;;AAED,sC;;;;;;;ACZa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P;;AAEA;AACA,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA,mBAAmB,mBAAO,CAAC,CAAe;;AAE1C;AACA,mFAAmF;AACnF;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,mCAAmC;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,K;;;;;;;AC7Na;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,6D;;;;;;;AC/Ba;;AAEb,0BAA0B,mBAAO,CAAC,EAA0B;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,E;;;;;;;ACrBa;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;;AAEA,gBAAgB,mBAAO,CAAC,CAAQ;AAChC;AACA;;AAEA,yBAAyB,mBAAO,CAAC,GAAsB;AACvD,2CAA2C,mBAAO,CAAC,EAAwC;;AAE3F,gBAAgB,mBAAO,CAAC,EAAW;AACnC;AACA;;AAEA,yCAAyC,mBAAO,CAAC,CAAsC;;AAEvF;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,6BAA6B,oCAAoC;AACzF;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;;AAEA,2BAA2B,uCAAuC;AAClE;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,GAAG;AACH,C;;;;;;;AC3Ha;;AAEb,8BAA8B;;AAE9B;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;ACVa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;AC/Ca;;AAEb,2CAA2C,mBAAO,CAAC,EAAwC;;AAE3F;AACA;AACA;AACA,E;;;;;;;ACPa;;AAEb,kCAAkC,mBAAO,CAAC,EAA+B;AACzE,yBAAyB,mBAAO,CAAC,CAAsB;AACvD;AACA,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA,GAAG;AACH;AACA,E;;;;;;;AChBa;;AAEb;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACba;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACda;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,mDAAmD,kCAAkC;AACrF,GAAG;AACH;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,E;;;;;;;AC3Ba;;AAEb,eAAe,mBAAO,CAAC,CAAgB;AACvC;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,eAAe;AAC3B;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;AC/Ba;;AAEb,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE,eAAe,mBAAO,CAAC,CAAgB;AACvC;;AAEA,qCAAqC,mBAAO,CAAC,EAAkC;AAC/E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,C;;;;;;;AChGa;;AAEb,uCAAuC,mBAAO,CAAC,EAAoC;;AAEnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;AChBa;;AAEb,2CAA2C,mBAAO,CAAC,EAAwC;AAC3F,yCAAyC,mBAAO,CAAC,CAAsC;;AAEvF;AACA;AACA,E;;;;;;;ACPa;;AAEb,yCAAyC,mBAAO,CAAC,CAAsC;AACvF,qCAAqC,mBAAO,CAAC,EAAkC;AAC/E,sBAAsB,mBAAO,CAAC,CAAmB;;AAEjD,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,yBAAyB,mBAAO,CAAC,CAAsB;AACvD;AACA,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA,GAAG;AACH;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,GAAG,IAAI;AACP;AACA,E;;;;;;;AC7Ba;;AAEb;AACA;AACA,mCAAmC,QAAQ;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACba;;AAEb,eAAe,mBAAO,CAAC,EAAW;AAClC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA,GAAG,IAAI;AACP;AACA;AACA,qBAAqB,oBAAoB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA,eAAe;AACf,E;;;;;;;AClCa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,gBAAgB,mBAAO,CAAC,CAAgB;AACxC;;AAEA,sBAAsB,mBAAO,CAAC,CAAmB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,E;;;;;;;ACnBa;;AAEb;AACA;AACA,2BAA2B,mBAAO,CAAC,EAAwB;AAC3D,sBAAsB,mBAAO,CAAC,CAAmB;AACjD;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA,wFAAwF,0CAA0C;AAClI,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA,yBAAyB,uBAAuB;AAChD;AACA;AACA;AACA,E;;;;;;;ACpCa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,8BAA8B;AAC/C;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,E;;;;;;;ACjDa;;AAEb;AACA,2BAA2B,mBAAO,CAAC,EAA2B;;AAE9D,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA;AACA;AACA;;AAEA,+BAA+B;AAC/B,4CAA4C,sBAAsB,GAAG,sBAAsB;AAC3F;;;AAGA;AACA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA,2BAA2B,4DAA4D;AACvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,kCAAkC;AAChE;AACA;AACA;AACA,0BAA0B,iBAAiB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,4BAA4B,uCAAuC;AACnE;AACA;AACA;AACA,yBAAyB,kBAAkB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,sBAAsB,kCAAkC;AACxD;AACA;AACA;AACA;AACA,wBAAwB,2BAA2B;AACnD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6BAA6B,wCAAwC;AACrE;AACA;AACA;AACA;AACA,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA,0BAA0B,2BAA2B;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA,sBAAsB,mCAAmC;AACzD;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA,+BAA+B,mCAAmC;AAClE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA,qBAAqB,kCAAkC;AACvD;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,sCAAsC;AAC9D;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA,0BAA0B,uCAAuC;AACjE;AACA;AACA;AACA;AACA,uBAAuB,wCAAwC;AAC/D;AACA,uBAAuB,aAAa;AACpC;AACA;AACA;AACA;AACA;AACA,wBAAwB,iCAAiC;AACzD,0BAA0B,yCAAyC;AACnE;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,oGAAoG;AAC9H;AACA;AACA;AACA;AACA,wBAAwB,6BAA6B;AACrD;AACA;AACA;AACA,oCAAoC,gCAAgC;AACpE;AACA;AACA;;AAEA;AACA,wBAAwB,yCAAyC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,mBAAmB,+BAA+B;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,+BAA+B;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,+BAA+B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,+BAA+B;AAClD;AACA;AACA;AACA;AACA;;AAEA;AACA,YAAY,uDAAuD,GAAG,kDAAkD;AACxH;AACA,E;;;;;;;ACrXa;;AAEb,kBAAkB,mBAAO,CAAC,EAAkB;;AAE5C;AACA,mFAAmF;AACnF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,2CAA2C,6CAA6C;AACxF,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,E;;;;;;;ACnCa;;AAEb,oCAAoC,mBAAO,CAAC,EAAiC;AAC7E,qCAAqC,mBAAO,CAAC,EAAkC;;AAE/E,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,E;;;;;;;ACda;;AAEb,mDAAmD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe;;AAE9P,oGAAoG,mBAAmB,EAAE,mBAAmB,8HAA8H;;AAE1Q;AACA;AACA,+CAA+C;AAC/C;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB;AACpB;AACA;AACA,GAAG;AACH,C;;;;;;;ACzBa;;AAEb,eAAe,mBAAO,CAAC,CAAQ;AAC/B;;AAEA,kCAAkC,mBAAO,CAAC,EAA+B;;AAEzE;AACA,6C;;;;;;;ACRa;;AAEb,sBAAsB,mBAAO,CAAC,EAAmB;;AAEjD;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA,E;;;;;;;ACxBa;;AAEb,eAAe,mBAAO,CAAC,CAAmB;AAC1C;;AAEA,gCAAgC,mBAAO,CAAC,EAA6B;;AAErE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH,E;;;;;;;;;;;;;;;;;;;;;;;;AChBO,IAAMA,QAAQ,GAAG,cAAjB,C;;;;;;;;;;ACAP;AACA,2BAaIC,MAAM,CAACC,YAbX;AAAA,IACEC,SADF,wBACEA,SADF;AAAA,IAEEC,OAFF,wBAEEA,OAFF;AAAA,IAGEC,UAHF,wBAGEA,UAHF;AAAA,IAIEC,SAJF,wBAIEA,SAJF;AAAA,IAKEC,SALF,wBAKEA,SALF;AAAA,IAMEC,KANF,wBAMEA,KANF;AAAA,IAOEC,SAPF,wBAOEA,SAPF;AAAA,IAQEC,SARF,wBAQEA,SARF;AAAA,IASEC,YATF,wBASEA,YATF;AAAA,IAUEC,oBAVF,wBAUEA,oBAVF;AAAA,IAWEC,sBAXF,wBAWEA,sBAXF;AAAA,IAYEC,gBAZF,wBAYEA,gBAZF;AAeA,IAAMC,cAAc,GAAG,CAAC,MAAD,EAAST,SAAT,EAAoB,OAApB,EAA6B,KAA7B,EAAoC,QAApC,CAAvB;AACA,IAAMU,WAAW,GAAG,CAAC,MAAD,EAAS,OAAT,EAAkB,KAAlB,EAAyB,QAAzB,CAApB;AACeZ,qEAAO,CACpBQ,oBAAoB,CAACZ,QAAD,CADA,EAEpBa,sBAAsB,CAACb,QAAD,CAFF,CAAP,CAGb,SAASiB,qBAAT,CAA+BC,KAA/B,EAAsC;AACtC,MACEC,cADF,GAQID,KARJ,CACEC,cADF;AAAA,MAEEC,cAFF,GAQIF,KARJ,CAEEE,cAFF;AAAA,MAGEC,wBAHF,GAQIH,KARJ,CAGEG,wBAHF;AAAA,MAIEC,sBAJF,GAQIJ,KARJ,CAIEI,sBAJF;AAAA,MAKEC,YALF,GAQIL,KARJ,CAKEK,YALF;AAAA,MAMEC,kBANF,GAQIN,KARJ,CAMEM,kBANF;AAAA,MAOEC,YAPF,GAQIP,KARJ,CAOEO,YAPF;AASA,MAAMC,IAAI,GAAGR,KAAK,CAAIlB,QAAJ,sBAAlB;AACAS,WAAS,CAAC,YAAM;AACde,sBAAkB,CAACL,cAAD,CAAlB;AACD,GAFQ,EAEN,CAACA,cAAD,EAAiBK,kBAAjB,CAFM,CAAT;AAGA,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,mDACiBJ,cADjB,EAEGD,cAAc,CAACQ,MAAf,GAAwB,CAAxB,GAA4B,GAA5B,GAAkC,EAFrC,kCAGE,oBAAC,SAAD;AACE,cAAU,MADZ;AAEE,YAAQ,EAAE3B,QAFZ;AAGE,YAAQ,EAAEmB,cAAc,CAACS,GAAf,CAAmB,UAACC,CAAD;AAAA,0BACxBA,CADwB;AAE3BC,aAAK,EAAED,CAAC,CAACC,KAAF,GAAU,CAFU;AAG3BC,WAAG,EAAEF,CAAC,CAACE,GAAF,GAAQ;AAHc;AAAA,KAAnB,CAHZ;AAQE,kBAAc,MARhB;AASE,UAAM,EAAEX,cAAc,KAAK,SAAnB,GAA+BL,cAA/B,GAAgDC;AAT1D,IAHF,CADF,eAgBE,oBAAC,YAAD;AACE,aAAS,EAAEX,UADb;AAEE,WAAO,EAAEkB,YAAY,0EAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AACdS,kCADc,GACSzB,SAAS,CAACa,cAAD,CADlB;AAGpBM,kBAAI,CAACO,OAAL,CAAa,UAACC,aAAD,EAAgBC,CAAhB,EAAsB;AACjCb,sCAAsB,IACpBA,sBAAsB,CAAC;AACrBU,sCAAoB,EAApBA,oBADqB;AAErBI,4BAAU,EAAEF,aAFS;AAGrBhB,uBAAK,EAAEA;AAHc,iBAAD,CADxB;AAOA,oBAAImB,YAAY,GAAG,EAAnB;;AACA,oBAAIX,IAAI,CAACC,MAAL,GAAc,CAAlB,EAAqB;AACnB,sBAAIQ,CAAC,KAAK,CAAV,EAAa;AACXE,gCAAY,GAAG;AACbC,oCAAc,EAAE;AADH,qBAAf;AAGD,mBAJD,MAIO,IAAIH,CAAC,KAAKT,IAAI,CAACC,MAAL,GAAc,CAAxB,EAA2B;AAChCU,gCAAY,GAAG;AACbE,kCAAY,EAAE;AADD,qBAAf;AAGD,mBAJM,MAIA;AACLF,gCAAY,GAAG;AACbG,qCAAe,EAAE;AADJ,qBAAf;AAGD;AACF;;AACDtB,qBAAK,YAAUf,SAAS,CAACiB,cAAD,CAAnB,CAAL,CACEN,gBAAgB,CAACoB,aAAD,EAAgB;AAC9BT,8BAAY,EAAZA,YAD8B;AAE9BL,gCAAc,EAAEY;AAFc,iBAAhB,CADlB,EAKEK,YALF;AAOAhB,wCAAwB,CAACW,oBAAD,CAAxB;AACD,eAhCD;AAkCA3B,wBAAU;;AArCU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAAD,GAFvB;AAyCE,QAAI,EAAC;AAzCP,IAhBF,CADF;AA8DD,CA/Ec,CAAf,E;;AClBA;AACA,uDAAyCJ,MAAM,CAACC,YAAhD;AAAA,IAAQuC,GAAR,oDAAQA,GAAR;AAAA,IAAaC,IAAb,oDAAaA,IAAb;AAAA,IAAmBC,UAAnB,oDAAmBA,UAAnB;AAAA,IAA+BnC,kCAA/B,oDAA+BA,KAA/B;AAEA,IAAMoC,cAAc,GAAG;AACrBC,YAAU,EAAE,KADS;AAErBC,WAAS,EAAE;AAFU,CAAvB;AAIO,IAAMC,4BAA4B,GAAGJ,UAAU,CAAC;AACrDK,OAAK,EAAE;AAD8C,CAAD,CAAV,CAEzC,gBAAuB;AAAA,MAAXC,OAAW,QAAXA,OAAW;AACxB,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,iDAAC,IAAD;AAAM,wBAAoB,EAAEA,OAAO,GAAG,OAAH,GAAa;AAAhD,kBACE,iDAAC,GAAD;AACE,MAAE,EAAC,OADL;AAEE,SAAK,EAAC,OAFR;AAGE,SAAK,eACH,2EACE,4NADF,eAME,mFANF,eAOE;AACE,WAAK,EAAE;AACLC,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE,SAHhB;AAILC,iBAAS,EAAE,GAJN;AAKLC,gBAAQ,EAAE;AALL;AADT,oBASE,kEATF,eAUE,gIAVF,eAcE,8DAAM,GAAN,CAdF,eAeE,qFAAyB,GAAzB,6BAfF,eAgBE,8DAAM,GAAN,CAhBF,eAiBE,oFAAwB,GAAxB,6BAjBF,eAkBE,kEAlBF,oBAkBe,mEAlBf,eAmBE,kEAnBF,oBAmBe,mEAnBf,eAoBE,kEApBF,oBAoBe,mEApBf,eAqBE,kEArBF,oBAqBe,mEArBf,eAsBE,kEAtBF,oBAsBe,mEAtBf,eAuBE,kEAvBF,oBAuBe,mEAvBf,eAwBE,kEAxBF,oBAwBe,oEAxBf,eAyBE,kEAzBF,oBAyBe,oEAzBf,eA0BE,kEA1BF,oBA0Be,oEA1Bf,eA2BE,kEA3BF,oBA2Be,oEA3Bf,eA4BE,kEA5BF,oBA4Be,qEA5Bf,eA6BE,kEA7BF,oBA6Be,qEA7Bf,eA8BE,kEA9BF,oBA8Be,qEA9Bf,CAPF,eAuCE,4DAvCF,eAwCE,yEAxCF,eAyCE;AACE,WAAK,EAAE;AACLJ,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE;AAHhB;AADT,oBAOE,0EAPF,eAQE,mGACuB;AAAM,WAAK,EAAER;AAAb,aADvB,MARF,eAWE,qEAXF,eAYE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAZF,eAeE,qEAfF,eAgBE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,+BAEE;AAAM,WAAK,EAAEA;AAAb,cAFF,CAhBF,eAoBE,oEApBF,eAqBE,iFACI;AAAM,WAAK,EAAEA;AAAb,aADJ,iCAEE;AAAM,WAAK,EAAEA;AAAb,aAFF,CArBF,eAyBE,oEAzBF,eA0BE,sFACS;AAAM,WAAK,EAAEA;AAAb,iBADT,aA1BF,eA6BE,oEAAQ,GAAR,SA7BF,eA8BE,iFACI;AAAM,WAAK,EAAEA;AAAb,eADJ,oBA9BF,eAiCE,oEACK,GADL,SACa,GADb,UAjCF,eAoCE,iFACI;AAAM,WAAK,EAAEA;AAAb,iBADJ,kBApCF,CAzCF,eAkFE,4DAlFF;AAJJ,IADF,eA4FE,iDAAC,GAAD;AACE,MAAE,EAAC,OADL;AAEE,SAAK,EAAC,OAFR;AAGE,SAAK,eACH,2EACE,mIADF,eAKE,qHACwD,GADxD,eAEE;AAAG,UAAI,EAAC;AAAR,+BAFF,CALF,eASE,4DATF,eAUE,yEAVF,eAWE;AACE,WAAK,EAAE;AACLM,eAAO,EAAE,MADJ;AAELC,iBAAS,EAAE,EAFN;AAGLC,2BAAmB,EAAE;AAHhB;AADT,oBAOE,0EAPF,eAQE,mGACuB;AAAM,WAAK,EAAER;AAAb,aADvB,MARF,eAWE,qEAXF,eAYE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAZF,eAeE,qEAfF,eAgBE,iFACI;AAAM,WAAK,EAAEA;AAAb,cADJ,qBAhBF,eAmBE,oEAnBF,eAoBE,iFACI;AAAM,WAAK,EAAEA;AAAb,aADJ,iCAEE;AAAM,WAAK,EAAEA;AAAb,aAFF,CApBF,eAwBE,qEAxBF,eAyBE,mFACM;AAAM,WAAK,EAAEA;AAAb,wBADN,SAzBF,eA4BE,yEA5BF,eA6BE,sFACS;AAAM,WAAK,EAAEA;AAAb,iBADT,aA7BF,eAgCE,wEAhCF,eAiCE,iFACI;AAAM,WAAK,EAAEA;AAAb,eADJ,oBAjCF,eAoCE,8EApCF,eAqCE,iFACI;AAAM,WAAK,EAAEA;AAAb,gBADJ,mBArCF,CAXF,eAoDE,4DApDF;AAJJ,IA5FF,CADF,CADF;AA+JD,CAlK2C,CAArC,C,CAoKP;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,I;;;;AC7MA;AACA;AAEO,IAAMW,mBAAmB,GAAG,CAAC,MAAD,EAAS,MAAT,EAAiB,OAAjB,CAA5B;AAEA,IAAMC,SAAS,GAAG,SAAZA,SAAY,CAACC,IAAD,EAAU;AACjC,MAAMC,IAAI,GAAGD,IAAI,CAACE,QAAL,IAAiBF,IAAI,CAACC,IAAnC;AACA,SAAOA,IAAI,KAAK,iBAAT,IAA8BA,IAAI,KAAK,8BAA9C;AACD,CAHM;AAKA,IAAME,MAAM,GAAG,SAATA,MAAS,CAACH,IAAD;AAAA,SAAUA,IAAI,CAACI,IAAL,CAAUC,KAAV,CAAgB,GAAhB,EAAqBC,GAArB,EAAV;AAAA,CAAf;AACA,IAAMC,WAAW,GAAG,SAAdA,WAAc,CAACP,IAAD;AAAA,SAAUG,MAAM,CAACH,IAAD,CAAN,KAAiB,MAA3B;AAAA,CAApB;AACA,IAAMQ,SAAS,GAAG,SAAZA,SAAY,CAACR,IAAD;AAAA,SAAUG,MAAM,CAACH,IAAD,CAAN,KAAiB,KAA3B;AAAA,CAAlB;AACA,IAAMS,UAAU,GAAG,SAAbA,UAAa,CAACT,IAAD;AAAA,SAAU,CAAC,MAAD,EAAS,KAAT,EAAgBU,QAAhB,CAAyBP,MAAM,CAACH,IAAD,CAA/B,CAAV;AAAA,CAAnB;AAEP,IAAMW,uBAAuB,GAAG;AAC9BC,QAAM,EAAE,IADsB;AAE9BC,gBAAc,EAAE,QAFc;AAG9BC,aAAW,EAAE,IAHiB,CAI9B;;AAJ8B,CAAhC;AAOO,IAAMC,sBAAY,GAAG,SAAfA,YAAe,CAACC,OAAD,EAAUC,aAAV,EAAiC;AAAA,MAAvBA,aAAuB;AAAvBA,iBAAuB,GAAP,EAAO;AAAA;;AAC3D,SAAO,IAAIC,OAAJ,CAAY,UAACC,OAAD,EAAUC,MAAV,EAAqB;AACtCC,kCAAK,CAACL,OAAO,CAACM,aAAT,wBACAX,uBADA;AAEHY,cAAQ,EAAE,kBAACC,OAAD,EAAa;AACrB,YAAIA,OAAO,IAAIA,OAAO,CAACC,MAAnB,IAA6BD,OAAO,CAACC,MAAR,CAAevD,MAAhD,EAAwD;AACtD,iBAAOkD,MAAM,CAAC,mBAAmBM,IAAI,CAACC,SAAL,CAAeH,OAAO,CAACC,MAAvB,CAApB,CAAb;AACD;;AACDN,eAAO,CAACK,OAAD,CAAP;AACD,OAPE;AAQHI,WAAK,EAAE,eAACA,MAAD,EAAW;AAChBR,cAAM,CAACQ,MAAD,CAAN;AACD;AAVE,OAWAX,aAXA,EAAL;AAaD,GAdM,CAAP;AAeD,CAhBM;AAkBA,IAAMY,wBAAc,GAAG,SAAjBA,cAAiB,CAACC,SAAD,EAAYb,aAAZ,EAAmC;AAAA,MAAvBA,aAAuB;AAAvBA,iBAAuB,GAAP,EAAO;AAAA;;AAC/D,SAAOI,8BAAK,CAACS,SAAD,wBAAiBnB,uBAAjB,EAA6CM,aAA7C,EAAZ;AACD,CAFM;AAIA,IAAMc,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,QAAD;AAAA,SACrC,CAACA,QAAQ,IAAI,EAAb,EACG3B,KADH,CACS,GADT,EAEGlC,GAFH,CAEO,UAAC8D,CAAD;AAAA,WAAOA,CAAC,CAACC,IAAF,EAAP;AAAA,GAFP,EAGGC,MAHH,CAGU,UAACF,CAAD;AAAA,WAAOA,CAAP;AAAA,GAHV,CADqC;AAAA,CAAhC;AAMP;AACA;AACA;AACA;AACA;AACA;;AACO,IAAMG,cAAc,GAAG,SAAjBA,cAAiB,CAACC,IAAD,EAAU;AACtC,MAAMC,UAAU,GAAG,EAAnB;AACAD,MAAI,CAAC7D,OAAL,CAAa,UAAC+D,GAAD,EAAS;AACpBC,UAAM,CAACC,IAAP,CAAYF,GAAZ,EAAiB/D,OAAjB,CAAyB,UAACoC,MAAD,EAAY;AACnC,UAAI,CAAC0B,UAAU,CAAC5B,QAAX,CAAoBE,MAApB,CAAL,EAAkC;AAChC0B,kBAAU,CAACI,IAAX,CAAgB9B,MAAhB;AACD;AACF,KAJD;AAKD,GAND;AAOAyB,MAAI,CAAC7D,OAAL,CAAa,UAAC+D,GAAD,EAAS;AACpBD,cAAU,CAAC9D,OAAX,CAAmB,UAACoC,MAAD,EAAY;AAC7B2B,SAAG,CAAC3B,MAAD,CAAH,GAAc2B,GAAG,CAAC3B,MAAD,CAAH,IAAe,EAA7B;AACD,KAFD;AAGD,GAJD;AAKA,SAAOyB,IAAP;AACD,CAfM;AAiBA,IAAMM,0BAA0B,GAAG,SAA7BA,0BAA6B,CACxCC,MADwC,EAExCC,eAFwC,EAGxCC,QAHwC,EAIrC;AACH,MAAMC,sBAAsB,GAAGF,eAAe,CAACV,MAAhB,CAAuB,UAACa,KAAD,EAAW;AAC/D,WAAO,CAACJ,MAAM,CAAClC,QAAP,CAAgBsC,KAAhB,CAAR;AACD,GAF8B,CAA/B;;AAGA,MAAID,sBAAsB,CAAC7E,MAA3B,EAAmC;AACjC,QAAMkC,IAAI,GAAG0C,QAAQ,iBAAeA,QAAf,GAA4B,UAAjD;AACA,WAAU1C,IAAV,uCAAgD2C,sBAAsB,CAACE,IAAvB,CAC9C,IAD8C,CAAhD;AAGD;AACF,CAdM;AAgBA,IAAMC,cAAc,GAAG,SAAjBA,cAAiB,CAACX,GAAD,EAAMM,eAAN,EAAuBM,KAAvB,EAAiC;AAC7D,MAAMC,qBAAqB,GAAGP,eAAe,CAACV,MAAhB,CAAuB,UAACa,KAAD;AAAA,WAAW,CAACT,GAAG,CAACS,KAAD,CAAf;AAAA,GAAvB,CAA9B;;AACA,MAAII,qBAAqB,CAAClF,MAA1B,EAAkC;AAChC,QAAIkF,qBAAqB,CAAClF,MAAtB,KAAiC,CAArC,EAAwC;AACtC,uBAAciF,KAAK,GAAG,CAAtB,0CACEC,qBAAqB,CAAC,CAAD,CADvB;AAGD,KAJD,MAIO;AACL,uBACED,KAAK,GAAG,CADV,4CAEsCC,qBAAqB,CAACH,IAAtB,CAA2B,IAA3B,CAFtC;AAGD;AACF;AACF,CAbM,C;;;;;;;;;;;;;;;;;;;;;;;ACzFP;;AACA;;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;AACA;AAEA,8BA2BIzG,MAAM,CAACC,YA3BX;AAAA,IACE4G,OADF,2BACEA,OADF;AAAA,IAEEC,eAFF,2BAEEA,eAFF;AAAA,IAGEC,MAHF,2BAGEA,MAHF;AAAA,IAIEvE,OAJF,2BAIEA,GAJF;AAAA,IAKEC,QALF,2BAKEA,IALF;AAAA,IAMEnC,aANF,2BAMEA,SANF;AAAA,IAOE0G,SAPF,2BAOEA,SAPF;AAAA,IAQEC,eARF,2BAQEA,eARF;AAAA,IASEC,oBATF,2BASEA,oBATF;AAAA,IAUEC,eAVF,2BAUEA,eAVF;AAAA,IAWEC,UAXF,2BAWEA,UAXF;AAAA,IAYEC,sBAZF,2BAYEA,sBAZF;AAAA,IAaE3E,cAbF,2BAaEA,UAbF;AAAA,IAcE4E,UAdF,2BAcEA,UAdF;AAAA,IAeEC,eAfF,2BAeEA,eAfF;AAAA,IAgBE7G,gBAhBF,2BAgBEA,YAhBF;AAAA,IAiBE8G,QAjBF,2BAiBEA,QAjBF;AAAA,IAkBEpH,cAlBF,2BAkBEA,UAlBF;AAAA,IAmBEF,aAnBF,2BAmBEA,SAnBF;AAAA,IAoBEC,WApBF,2BAoBEA,OApBF;AAAA,IAqBEI,SArBF,2BAqBEA,KArBF;AAAA,IAsBEkH,0BAtBF,2BAsBEA,0BAtBF;AAAA,IAuBEC,YAvBF,2BAuBEA,YAvBF;AAAA,IAwBElH,aAxBF,2BAwBEA,SAxBF;AAAA,IAyBEC,aAzBF,2BAyBEA,SAzBF;AAAA,IA0BEJ,aA1BF,2BA0BEA,SA1BF;AA6BO,SAASsH,oBAAT,GAAgC;AACrCL,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AACM,SAAS2G,iBAAT,GAA6B;AAClCR,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AACM,SAAS4G,mBAAT,GAA+B;AACpCT,YAAU,CAAC;AACTM,kBAAc,EAAEC,iBADP;AAC0B;AACnC5G,SAAK,EAAE;AACLE,oBAAc,EAAE;AADX;AAFE,GAAD,CAAV;AAMD;AAEM,IAAM0G,iBAAiB,GAAG1H,WAAO,CACtCuC,cAAU,CAAC,UAACsF,CAAD;AAAA,SAAQ;AACjBC,qBAAiB,EAAE,KADF;AAEjBlF,SAAK,qBAAmB7C,aAAS,CAACI,aAAS,CAAC0H,CAAC,CAAC7G,cAAH,CAAV;AAFhB,GAAR;AAAA,CAAD,CAD4B,EAKtCoG,eALsC,EAMtCP,SAAS,CAAC;AAAEkB,MAAI,EAAEnI,QAAQA;AAAhB,CAAD,CAN6B,CAAP,CAO/B,UAACkB,KAAD,EAAW;AACX,MACEO,YADF,GAMIP,KANJ,CACEO,YADF;AAAA,MAEEF,YAFF,GAMIL,KANJ,CAEEK,YAFF;AAAA,8BAMIL,KANJ,CAGEE,cAHF;AAAA,MAGEA,cAHF,sCAGmB,SAHnB;AAAA,MAIEiE,KAJF,GAMInE,KANJ,CAIEmE,KAJF;AAAA,MAKE+C,yBALF,GAMIlH,KANJ,CAKEkH,yBALF;;AAOA,kBAA0CX,QAAQ,CAAC,SAAD,CAAlD;AAAA,MAAOY,QAAP;AAAA,MAAiBC,qBAAjB;;AACA,mBAAqCb,QAAQ,CAAC,KAAD,CAA7C;AAAA,MAAOtG,cAAP;AAAA,MAAuBoH,UAAvB;;AACA,mBAAkDd,QAAQ,EAA1D;AAAA,MAAOe,iBAAP;AAAA,MAA0BC,oBAA1B;;AACA,mBAAwDhB,QAAQ,EAAhE;AAAA,MAAOiB,oBAAP;AAAA,MAA6BC,uBAA7B;;AACAlI,eAAS,CAAC,YAAM;AACd,kEAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBACK2H,yBADL;AAAA;AAAA;AAAA;;AAEGO,qCAAuB,CAAC,IAAD,CAAvB;AAFH;AAAA;AAAA,qBAIwBP,yBAAyB,CAAClH,KAAD,CAJjD;;AAAA;AAIW0H,kBAJX;AAKKH,kCAAoB,CAACG,IAAD,CAApB;AALL;AAAA;;AAAA;AAAA;AAAA;AAOK3I,oBAAM,CAAC4I,MAAP,CAAcC,OAAd,CAAsB,sCAAtB;AACAC,qBAAO,CAAC1D,KAAR;;AARL;AAAA;AAUKsD,qCAAuB,CAAC,KAAD,CAAvB;AAVL;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAAD,KADc,CAed;;AACD,GAhBQ,EAgBN,EAhBM,CAAT;;AAiBA,MAAIxH,cAAJ,EAAoB;AAClB,wBACE,wBAAC,yBAAD,kBACMD,KADN;AAEE,oBAAc,EAAEC;AAFlB,OADF;AAMD;;AACD,sBACE;AAAK,aAAS,EAAC;AAAf,kBACE,wBAAC,QAAD;AACE,4BAAwB,MAD1B;AAEE,YAAQ,EAAEmH,qBAFZ;AAGE,iBAAa,EAAED;AAHjB,kBAKE,wBAAC,OAAD;AACE,SAAK,eACH,kDACE,yEAEE;AACE,aAAO,EAAE,mBAAM;AACb,YAAMvC,IAAI,GAAG,CAAC;AAEVjC,cAAI,eAAa1D,aAAS,CAACiB,cAAD,CAAtB,OAFK;AAGT4H,qBAAW,EAAE,mBAHJ;AAITC,kBAAQ;AAJC,WAKL7H,cAAc,KAAK,SAAnB,IAAgC;AAClCsC,cAAI;AAD8B,SAL3B;AAQTT,iBAAO,EAAE,KARA;AASTiG,mBAAS,EAAE;AATF;AAYTrF,cAAI,uBAAqB1D,aAAS,CAACiB,cAAD,CAZzB;AAaT4H,qBAAW,EAAE,mBAbJ;AAcTC,kBAAQ;AAdC,WAeL7H,cAAc,KAAK,SAAnB,IAAgC;AAClCsC,cAAI;AAD8B,SAf3B;AAkBTT,iBAAO,EAAE,KAlBA;AAmBTiG,mBAAS,EAAE;AAnBF;AAsBTrF,cAAI,eAAa1D,aAAS,CAACiB,cAAD,CAAtB,OAtBK;AAuBT4H,qBAAW,EAAE,yBAvBJ;AAwBTC,kBAAQ;AAxBC,WAyBL7H,cAAc,KAAK,SAAnB,IAAgC;AAClCsC,cAAI;AAD8B,SAzB3B;AA4BTT,iBAAO,EAAE,IA5BA;AA6BTiG,mBAAS,EAAE;AA7BF,WAAb;AAgCA,YAAMC,GAAG,GAAGC,gCAAO,CAACtD,IAAD,CAAnB,CAjCa,CAkCb;AACA;AACA;;AACAuD,0BAAU,CACRF,GADQ,4CAGR,YAHQ,CAAV;AAKD;AA3CH,0BAFF,gDAiD+B,mCAjD/B,eAkDE,mCAlDF,eAmDE;AAAK,WAAK,EAAE;AAAEjG,eAAO,EAAE;AAAX;AAAZ,uDAEE;AAAM,WAAK,EAAE;AAAEA,eAAO,EAAE;AAAX;AAAb,oCAEE,wBAAC,UAAD;AACE,aAAO,EAAE,iBAACrB,CAAD,EAAO;AACdA,SAAC,CAACyH,eAAF;AACAzH,SAAC,CAAC0H,cAAF;AACAhC,kBAAU,CAAC;AACTM,wBAAc,EAAE9E,4BAA4BA;AADnC,SAAD,CAAV;AAGD,OAPH;AAQE,aAAO,EACL,oBACE,4GADF;AATJ,MAFF,CAFF,eAnDF,eA6EE,mCA7EF,EA8EG3B,cAAc,KAAK,SAAnB,iBACC,wBAAC,SAAD,CAAO,QAAP,qBACE,2EADF,eAEE,mCAFF,CA/EJ,CADF,eAsFE,wBAAC,eAAD;AACE,2BAAqB,EAAEoI,qBADzB;AAEE,UAAI,EAAC,SAFP;AAGE,eAAS,EAAE,CAHb;AAIE,gBAAU,MAJZ;AAKE,YAAM,EAAC;AALT,MAtFF,CAFJ;AAiGE,MAAE,EAAC,SAjGL;AAkGE,SAAK,EAAC;AAlGR,IALF,eAyGE,wBAAC,OAAD;AACE,SAAK,eACH,kDACE,8FAEE;AACE,aAAO,EAAE,mBAAM;AACbH,0BAAU,gPAKR,YALQ,CAAV;AAOD;AATH,0BAFF,OADF,eAkBE,wBAAC,eAAD;AACE,eAAS,EAAE,CADb;AAEE,UAAI,EAAC,SAFP;AAGE,gBAAU,MAHZ;AAIE,YAAM,EAAC;AAJT,MAlBF,EAwBGhE,KAAK,iBACJ;AAAK,WAAK,EAAE;AAAEoE,eAAO,EAAE,CAAX;AAAcC,aAAK,EAAE1C,MAAM,CAAC2C;AAA5B;AAAZ,OAAiDtE,KAAjD,CAzBJ,CAFJ;AA+BE,MAAE,EAAC,SA/BL;AAgCE,SAAK,EAAC;AAhCR,IAzGF,EA2IG+C,yBAAyB,KACvBM,oBAAoB,gBACnB,wBAAC,OAAD;AAAK,YAAQ,MAAb;AAAc,SAAK,EAAC;AAApB,IADmB,GAGnBF,iBAAiB,IACjBA,iBAAiB,CAACoB,IADlB,iBAEE,wBAAC,OAAD;AACE,MAAE,EAAC,oBADL;AAEE,SAAK,EAAEpB,iBAAiB,CAACxF,KAAlB,IAA2B,aAFpC;AAGE,SAAK,EACHwF,iBAAiB,CAACoB,IAAlB,CAAuBjI,MAAvB,gBACE,kDACE,wBAAC,aAAD;AACE,gBAAU,MADZ;AAEE,YAAM,EACJP,cAAc,KAAK,SAAnB,GACIyI,gBADJ,GAEIC,sBALR;AAOE,cAAQ,EAAEtB,iBAAiB,CAACoB;AAP9B,MADF,CADF,gBAaE;AAjBN,IANoB,CA3I5B,CADF,eA0KE,wBAAC,gBAAD;AACE,aAAS,EAAEvJ,cADb;AAEE,YAAQ,EACNgI,QAAQ,KAAK,oBAAb,IACA,EACEG,iBAAiB,IACjBA,iBAAiB,CAACoB,IADlB,IAEApB,iBAAiB,CAACoB,IAAlB,CAAuBjI,MAHzB,CAJJ;AAUE,WAAO,EAAEJ,YAAY;AAAA,gFAAC;AAAA;;AAAA;AAAA;AAAA;AAAA;AAASwI,uBAAT,SAASA,OAAT,EAAkBtF,OAAlB,SAAkBA,OAAlB;AAChBuF,uCADgB,GACU,KADV;AAEdC,2BAFc,GAEA,EAFA;AAAA;;AAIZC,2BAJY;AAAA,4FAIE,kBAAOlE,GAAP,EAAYmE,OAAZ;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,wCACcnE,GADd,CACVtC,IADU,EACVA,IADU,0BACH,EADG,cACCuF,QADD,GACcjD,GADd,CACCiD,QADD;;AAAA,kCAId7H,cAAc,KAAK,SAJL;AAAA;AAAA;AAAA;;AAKVgJ,uCALU,GAKIhD,eAAe,GAAGiD,IAAlB,CAClB,UAACC,CAAD;AAAA,qCAAOA,CAAC,CAACC,WAAF,OAAoB7G,IAAI,CAAC6G,WAAL,EAA3B;AAAA,6BADkB,CALJ;;AAAA,gCAQXH,WARW;AAAA;AAAA;AAAA;;AAAA,gCASTJ,uBATS;AAAA;AAAA;AAAA;;AAAA;AAAA,mCAUoB1C,sBAAsB,CAAC;AACrDkD,8CAAgB,EAAE,oBADmC;AAErDC,kCAAI,qBAAmBN,OAAnB,oCAAyDzG,IAAzD;AAFiD,6BAAD,CAV1C;;AAAA;AAUZsG,mDAVY;;AAAA,gCAcPA,uBAdO;AAAA;AAAA;AAAA;;AAAA,kCAeJ;AACJU,6CAAe,EAAKP,OAAL,oCAA2CzG,IAA3C;AADX,6BAfI;;AAAA;AAoBdsC,+BAAG,CAACtC,IAAJ,GAAW,cAAX;AApBc;AAAA;;AAAA;AAsBdsC,+BAAG,CAACtC,IAAJ,GAAW0G,WAAX;;AAtBc;AAAA,gCAyBbnB,QAzBa;AAAA;AAAA;AAAA;;AAAA,kCA0BV;AACJyB,6CAAe,EAAKP,OAAL;AADX,6BA1BU;;AAAA;AAAA,kCA8BdnE,GAAG,CAAC/C,OAAJ,IAAe+C,GAAG,CAAC/C,OAAJ,CAAY0H,WAAZ,OAA8B,MA9B/B;AAAA;AAAA;AAAA;;AAAA;AAgCd,gCAAIC,MAAJ,CAAWC,iBAAX,EAhCc,CAgCiB;;AAhCjB;AAAA;;AAAA;AAAA;AAAA;AAAA,kCAkCR;AACJH,6CAAe,EAAKP,OAAL;AADX,6BAlCQ;;AAAA;AAsChBnE,+BAAG,CAAC/C,OAAJ,GAAc,IAAd;AAtCgB;AAAA;;AAAA;AAwChB+C,+BAAG,CAAC/C,OAAJ,GAAc6H,SAAd;;AAxCgB;AA0ClBb,uCAAW,CAAC9D,IAAZ,CAAiBH,GAAjB;;AA1CkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAJF;;AAAA,kCAIZkE,WAJY;AAAA;AAAA;AAAA;;AAAA,sBAgDd7B,QAAQ,KAAK,oBAhDC;AAAA;AAAA;AAAA;;AAAA,4DAsDXG,iBAAiB,CAACoB,IAAlB,CAAuBmB,OAAvB,EAtDW;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,2CAkDd;AACA5I,iBAnDc,kDAqDZ0B,IArDY,gBAqDZA,IArDY,EAqDNoF,QArDM,gBAqDNA,QArDM,EAqDIC,SArDJ,gBAqDIA,SArDJ,EAqDexF,IArDf,gBAqDeA,IArDf,EAqDqBT,OArDrB,gBAqDqBA,OArDrB;AAAA;AAAA,uBAuDRiH,WAAW,CACf;AACErG,sBAAI,EAAJA,IADF;AAEEoF,0BAAQ,EAARA,QAFF;AAGEC,2BAAS,EAATA,SAHF;AAIExF,sBAAI,EAAJA,IAJF;AAKET,yBAAO,EAAEA,OAAO,GAAG,MAAH,GAAY;AAL9B,iBADe,YAQRd,CAAC,GAAG,CARI,WAQE0B,IARF,OAvDH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBAkEPwE,QAAQ,KAAK,SAlEN;AAAA;AAAA;AAAA;;AAmEV2C,0BAnEU,GAmEG,CAAC,MAAD,EAAS,aAAT,EAAwB,UAAxB,CAnEH;;AAoEhB,oBAAI5J,cAAc,KAAK,SAAvB,EAAkC;AAChC4J,4BAAU,CAAC7E,IAAX,CAAgB,MAAhB;AACD;;AACD6E,0BAAU,CAAC7E,IAAX,CAAgB,SAAhB;AAvEgB;AAAA,uBA2EN3B,sBAAY,CAACC,OAAO,CAAC,CAAD,CAAR,CA3EN;;AAAA;AAAA;AAyEdwG,oBAzEc,uBAyEdA,IAzEc;AA0EN5E,sBA1EM,uBA0Ed6E,IA1Ec,CA0EN7E,MA1EM;AA4EVhB,sBA5EU,GA4EFe,0BAA0B,CAACC,MAAD,EAAS2E,UAAT,CA5ExB;;AAAA,qBA6EZ3F,MA7EY;AAAA;AAAA;AAAA;;AAAA,sBA8ER;AACJqF,iCAAe,EAAErF;AADb,iBA9EQ;;AAAA;AAAA,6DAoFW4F,IAAI,CAACF,OAAL,EApFX;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,6CAoFJnE,KApFI,oBAoFGZ,GApFH;AAqFRX,uBArFQ,GAqFAsB,cAAc,CAACX,GAAD,EAAMgF,UAAN,EAAkBpE,KAAlB,CArFd;;AAAA,qBAsFVvB,OAtFU;AAAA;AAAA;AAAA;;AAAA,sBAuFN;AACJqF,iCAAe,EAAErF;AADb,iBAvFM;;AAAA;AAAA;AAAA,uBA2FR6E,WAAW,CAAClE,GAAD,YAAaY,KAAK,GAAG,CAArB,WAA2BZ,GAAG,CAACnC,IAA/B,OA3FH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBA6FPwE,QAAQ,KAAK,SA7FN;AAAA;AAAA;AAAA;;AAAA;AAAA,uBA8FO7D,sBAAY,CAACuF,OAAO,CAAC,CAAD,CAAR,EAAa;AAC9C1F,wBAAM,EAAE;AADsC,iBAAb,CA9FnB;;AAAA;AAAA;AA8FR4G,qBA9FQ,wBA8FRA,IA9FQ;AAAA,6DAkG0BA,KAAI,CAACF,OAAL,EAlG1B;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,6CAkGJ5I,EAlGI,qDAkGA0B,KAlGA,qBAkGMoF,SAlGN,qBAkGgBvF,KAlGhB;AAAA;AAAA,uBAmGRwG,WAAW,CACf;AAAErG,sBAAI,EAAJA,KAAF;AAAQoF,0BAAQ,EAARA,SAAR;AAAkBvF,sBAAI,EAAJA;AAAlB,iBADe,YAERvB,EAAC,GAAG,CAFI,WAEE0B,KAFF,OAnGH;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAyGhBkF,uBAAO,CAACoC,IAAR;AACApC,uBAAO,CAACoC,IAAR,cAA0B9C,QAA1B;;AA1GgB;AAAA,oBA6Gb4B,WAAW,CAACtI,MA7GC;AAAA;AAAA;AAAA;;AAAA,kDA8GT1B,MAAM,CAAC4I,MAAP,CAAcC,OAAd,CACL,wFADK,CA9GS;;AAAA;AAkHZsC,sCAlHY,GAkHa,EAlHb;AAmHlBnB,2BAAW,CAAChI,OAAZ,CAAoB,UAACoJ,GAAD,EAAS;AAC3B,sBAAIA,GAAG,CAACnC,SAAJ,KAAkB,SAAtB,EAAiC;AAC/BmC,uBAAG,CAACpC,QAAJ,GAAeqC,0CAA2B,CAACD,GAAG,CAACpC,QAAL,CAA1C;AACD;;AACD,sBAAMsC,EAAE,GAAGzE,OAAO,EAAlB;AACAsE,wCAAsB,CAACG,EAAD,CAAtB,mBACKF,GADL;AAEEpC,4BAAQ,EAAEoC,GAAG,CAACpI,OAAJ,GACNoI,GAAG,CAACpC,QADE,GAENvB,0BAA0B,CAAC2D,GAAG,CAACpC,QAAL,CAJhC;AAKEsC,sBAAE,EAAFA;AALF;AAOD,iBAZD;AAcMC,qBAjIY,GAiIJ,eAjII;AAAA,gCAkIW7D,YAAY,CAAC;AACxC8D,oCAAkB,iDACfD,KADe,oBACF/J,YADE;AACY8J,sBAAE,EAAEC;AADhB,0CADsB;AAIxCJ,wCAAsB,EAAtBA;AAJwC,iBAAD,CAlIvB,EAkIDM,OAlIC,iBAkITF,KAlIS;;AAyIlB,oBAAIE,OAAO,IAAIA,OAAO,CAAC/J,MAAvB,EAA+B;AAC7B4G,4BAAU,CACRmD,OAAO,CAAC9J,GAAR,CAAY,UAAC+J,CAAD,EAAO;AACjB,wBAAMC,KAAK,GAAG,gBACTR,sBAAsB,CAACO,CAAC,CAACJ,EAAH,CADhB,EAENI,CAFM;AAGTE,6BAAO,EAAEF,CAAC,CAACG,MAAF,KAAa,CAAC,CAHd;AAITP,wBAAE,EAAEzE,OAAO;AAJF,sBAAX;;AAMA8E,yBAAK,CAAClC,KAAN,GACEkC,KAAK,CAAClC,KAAN,IAAevC,oBAAoB,GAAGyE,KAAK,CAAClI,IAAT,CADrC;AAEA,2BAAOkI,KAAP;AACD,mBAVD,CADQ,CAAV;AAaD,iBAdD,MAcO;AACL3L,wBAAM,CAAC4I,MAAP,CAAcC,OAAd,SACQ1H,cADR;AAGD;;AA3JiB;AAAA;;AAAA;AAAA;AAAA;AA6JlB2H,uBAAO,CAAC1D,KAAR;;AA7JkB,qBA8Jd,aAAMqF,eA9JQ;AAAA;AAAA;AAAA;;AAAA,sBA+JV,IAAIxD,eAAJ,0CAAuBmB,QAAvB,IAAkC,aAAMqC,eAAxC,oBA/JU;;AAAA;AAiKhBzK,sBAAM,CAAC4I,MAAP,CAAcxD,KAAd,uBACsBjE,cADtB;;AAjKgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAD;;AAAA;AAAA;AAAA;AAAA,QAVvB;AAiLE,QAAI,EAAC;AAjLP,IA1KF,CADF;AAgWD,CA5YgC,CAA1B;AA8YP,IAAI,CAACnB,MAAM,CAAC8L,WAAZ,EAAyB9L,MAAM,CAAC8L,WAAP,GAAqB,EAArB;AACzB9L,MAAM,CAAC8L,WAAP,CAAmBnE,oBAAnB,GAA0CA,oBAA1C;AACA3H,MAAM,CAAC8L,WAAP,CAAmBhE,iBAAnB,GAAuCA,iBAAvC;AACA9H,MAAM,CAAC8L,WAAP,CAAmB/D,mBAAnB,GAAyCA,mBAAzC;AAEA,IAAM6B,gBAAgB,GAAG,CAAC,MAAD,EAAS,UAAT,EAAqBvJ,aAArB,EAAgC,SAAhC,CAAzB;AACA,IAAMwJ,sBAAsB,GAAG,CAAC,MAAD,EAAS,UAAT,EAAqBxJ,aAArB,EAAgC,SAAhC,CAA/B;AAEA,IAAMkJ,qBAAqB,GAAG;AAC5BnD,QAAM,EAAE,CACN;AACE2F,QAAI,EAAE,MADR;AAEEtI,QAAI,EAAE,QAFR;AAGEuI,cAAU,EAAE;AAHd,GADM,EAMN;AACED,QAAI,EAAE,aADR;AAEEtI,QAAI,EAAE;AAFR,GANM,EAUN;AACEsI,QAAI,EAAE,UADR;AAEEtI,QAAI,EAAE,QAFR;AAGEuI,cAAU,EAAE;AAHd,GAVM,EAeN;AACED,QAAI,EAAE,MADR;AAEEtI,QAAI,EAAE,UAFR;AAGEwI,UAAM,EAAE9E,eAAe,EAHzB;AAIE+E,gBAAY,EAAE;AAJhB,GAfM,EAqBN;AACEH,QAAI,EAAE,SADR;AAEEtI,QAAI,EAAE;AAFR,GArBM,EAyBN;AACEsI,QAAI,EAAE,WADR;AAEEtI,QAAI,EAAE,UAFR;AAGEyI,gBAAY,EAAE,KAHhB;AAIED,UAAM,EAAE,CAAC,KAAD,EAAQ,SAAR;AAJV,GAzBM;AADoB,CAA9B,C","file":"ove-auto-annotate.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse {\n\t\tvar a = factory();\n\t\tfor(var i in a) (typeof exports === 'object' ? exports : root)[i] = a[i];\n\t}\n})(window, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 72);\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.21';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function',\n      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var arrayBufferTag = '[object ArrayBuffer]',\n      dataViewTag = '[object DataView]',\n      float32Tag = '[object Float32Array]',\n      float64Tag = '[object Float64Array]',\n      int8Tag = '[object Int8Array]',\n      int16Tag = '[object Int16Array]',\n      int32Tag = '[object Int32Array]',\n      uint8Tag = '[object Uint8Array]',\n      uint8ClampedTag = '[object Uint8ClampedArray]',\n      uint16Tag = '[object Uint16Array]',\n      uint32Tag = '[object Uint32Array]';\n\n  /** Used to match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading whitespace. */\n  var reTrimStart = /^\\s+/;\n\n  /** Used to match a single whitespace character. */\n  var reWhitespace = /\\s/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /**\n   * Used to validate the `validate` option in `_.template` variable.\n   *\n   * Forbids characters which could potentially change the meaning of the function argument definition:\n   * - \"(),\" (modification of function parameters)\n   * - \"=\" (default value)\n   * - \"[]{}\" (destructuring of function parameters)\n   * - \"/\" (beginning of a comment)\n   * - whitespace\n   */\n  var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n      rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n      rsNonAstral = '[^' + rsAstralRange + ']',\n      rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n      rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\n\n  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      // Use `util.types` for Node.js 10+.\n      var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n      if (types) {\n        return types;\n      }\n\n      // Legacy `process.binding('util')` for Node.js < 10.\n      return freeProcess && freeProcess.binding && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * A faster alternative to `Function#apply`, this function invokes `func`\n   * with the `this` binding of `thisArg` and the arguments of `args`.\n   *\n   * @private\n   * @param {Function} func The function to invoke.\n   * @param {*} thisArg The `this` binding of `func`.\n   * @param {Array} args The arguments to invoke `func` with.\n   * @returns {*} Returns the result of `func`.\n   */\n  function apply(func, thisArg, args) {\n    switch (args.length) {\n      case 0: return func.call(thisArg);\n      case 1: return func.call(thisArg, args[0]);\n      case 2: return func.call(thisArg, args[0], args[1]);\n      case 3: return func.call(thisArg, args[0], args[1], args[2]);\n    }\n    return func.apply(thisArg, args);\n  }\n\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (!predicate(array[index], index, array)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * A specialized version of `_.filter` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {Array} Returns the new filtered array.\n   */\n  function arrayFilter(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (predicate(value, index, array)) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.includes` for arrays without support for\n   * specifying an index to search from.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\n  /**\n   * This function is like `arrayIncludes` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludesWith(array, value, comparator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (comparator(value, array[index])) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * A specialized version of `_.map` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the new mapped array.\n   */\n  function arrayMap(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        result = Array(length);\n\n    while (++index < length) {\n      result[index] = iteratee(array[index], index, array);\n    }\n    return result;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Gets the size of an ASCII `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.findIndex` and `_.findLastIndex` without\n   * support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {number} fromIndex The index to search from.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseFindIndex(array, predicate, fromIndex, fromRight) {\n    var length = array.length,\n        index = fromIndex + (fromRight ? 1 : -1);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (predicate(array[index], index, array)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\n  /**\n   * This function is like `baseIndexOf` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOfWith(array, value, fromIndex, comparator) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (comparator(array[index], value)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.isNaN` without support for number objects.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\n  /**\n   * The base implementation of `_.sortBy` which uses `comparer` to define the\n   * sort order of `array` and replaces criteria objects with their corresponding\n   * values.\n   *\n   * @private\n   * @param {Array} array The array to sort.\n   * @param {Function} comparer The function to define sort order.\n   * @returns {Array} Returns `array`.\n   */\n  function baseSortBy(array, comparer) {\n    var length = array.length;\n\n    array.sort(comparer);\n    while (length--) {\n      array[length] = array[length].value;\n    }\n    return array;\n  }\n\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\n\n  /**\n   * The base implementation of `_.trim`.\n   *\n   * @private\n   * @param {string} string The string to trim.\n   * @returns {string} Returns the trimmed string.\n   */\n  function baseTrim(string) {\n    return string\n      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n      : string;\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\n  /**\n   * Checks if a `cache` value for `key` exists.\n   *\n   * @private\n   * @param {Object} cache The cache to query.\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\n\n  /**\n   * Checks if `string` contains Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\n  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.indexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictIndexOf(array, value, fromIndex) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * A specialized version of `_.lastIndexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictLastIndexOf(array, value, fromIndex) {\n    var index = fromIndex + 1;\n    while (index--) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return index;\n  }\n\n  /**\n   * Gets the number of symbols in `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the string size.\n   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n   * character of `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the index of the last non-whitespace character.\n   */\n  function trimmedEndIndex(string) {\n    var index = string.length;\n\n    while (index-- && reWhitespace.test(string.charAt(index))) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n  /**\n   * Gets the size of a Unicode `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\n\n    /**\n     * The base implementation of `_.create` without support for assigning\n     * properties to the created object.\n     *\n     * @private\n     * @param {Object} proto The object to inherit from.\n     * @returns {Object} Returns the new object.\n     */\n    var baseCreate = (function() {\n      function object() {}\n      return function(proto) {\n        if (!isObject(proto)) {\n          return {};\n        }\n        if (objectCreate) {\n          return objectCreate(proto);\n        }\n        object.prototype = proto;\n        var result = new object;\n        object.prototype = undefined;\n        return result;\n      };\n    }());\n\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Hash(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the hash.\n     *\n     * @private\n     * @name delete\n     * @memberOf Hash\n     * @param {Object} hash The hash to modify.\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the hash value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Hash\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function hashGet(key) {\n      var data = this.__data__;\n      if (nativeCreate) {\n        var result = data[key];\n        return result === HASH_UNDEFINED ? undefined : result;\n      }\n      return hasOwnProperty.call(data, key) ? data[key] : undefined;\n    }\n\n    /**\n     * Checks if a hash value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Hash\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\n\n    /**\n     * Sets the hash `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Hash\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the hash instance.\n     */\n    function hashSet(key, value) {\n      var data = this.__data__;\n      this.size += this.has(key) ? 0 : 1;\n      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n      return this;\n    }\n\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function ListCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the list cache.\n     *\n     * @private\n     * @name delete\n     * @memberOf ListCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function listCacheDelete(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        return false;\n      }\n      var lastIndex = data.length - 1;\n      if (index == lastIndex) {\n        data.pop();\n      } else {\n        splice.call(data, index, 1);\n      }\n      --this.size;\n      return true;\n    }\n\n    /**\n     * Gets the list cache value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf ListCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\n\n    /**\n     * Checks if a list cache value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf ListCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\n\n    /**\n     * Sets the list cache `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf ListCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the list cache instance.\n     */\n    function listCacheSet(key, value) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        ++this.size;\n        data.push([key, value]);\n      } else {\n        data[index][1] = value;\n      }\n      return this;\n    }\n\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a map cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function MapCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\n\n    /**\n     * Removes `key` and its value from the map.\n     *\n     * @private\n     * @name delete\n     * @memberOf MapCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the map value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf MapCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\n\n    /**\n     * Checks if a map value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf MapCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\n\n    /**\n     * Sets the map `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf MapCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the map cache instance.\n     */\n    function mapCacheSet(key, value) {\n      var data = getMapData(this, key),\n          size = data.size;\n\n      data.set(key, value);\n      this.size += data.size == size ? 0 : 1;\n      return this;\n    }\n\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     *\n     * Creates an array cache object to store unique values.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [values] The values to cache.\n     */\n    function SetCache(values) {\n      var index = -1,\n          length = values == null ? 0 : values.length;\n\n      this.__data__ = new MapCache;\n      while (++index < length) {\n        this.add(values[index]);\n      }\n    }\n\n    /**\n     * Adds `value` to the array cache.\n     *\n     * @private\n     * @name add\n     * @memberOf SetCache\n     * @alias push\n     * @param {*} value The value to cache.\n     * @returns {Object} Returns the cache instance.\n     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\n    /**\n     * Checks if `value` is in the array cache.\n     *\n     * @private\n     * @name has\n     * @memberOf SetCache\n     * @param {*} value The value to search for.\n     * @returns {number} Returns `true` if `value` is found, else `false`.\n     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a stack cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the stack.\n     *\n     * @private\n     * @name delete\n     * @memberOf Stack\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\n    /**\n     * Gets the stack value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Stack\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\n    /**\n     * Checks if a stack value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Stack\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\n\n    /**\n     * Sets the stack `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Stack\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the stack cache instance.\n     */\n    function stackSet(key, value) {\n      var data = this.__data__;\n      if (data instanceof ListCache) {\n        var pairs = data.__data__;\n        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n          pairs.push([key, value]);\n          this.size = ++data.size;\n          return this;\n        }\n        data = this.__data__ = new MapCache(pairs);\n      }\n      data.set(key, value);\n      this.size = data.size;\n      return this;\n    }\n\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of the enumerable property names of the array-like `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @param {boolean} inherited Specify returning inherited property names.\n     * @returns {Array} Returns the array of property names.\n     */\n    function arrayLikeKeys(value, inherited) {\n      var isArr = isArray(value),\n          isArg = !isArr && isArguments(value),\n          isBuff = !isArr && !isArg && isBuffer(value),\n          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n          skipIndexes = isArr || isArg || isBuff || isType,\n          result = skipIndexes ? baseTimes(value.length, String) : [],\n          length = result.length;\n\n      for (var key in value) {\n        if ((inherited || hasOwnProperty.call(value, key)) &&\n            !(skipIndexes && (\n               // Safari 9 has enumerable `arguments.length` in strict mode.\n               key == 'length' ||\n               // Node.js 0.10 has enumerable non-index properties on buffers.\n               (isBuff && (key == 'offset' || key == 'parent')) ||\n               // PhantomJS 2 has enumerable non-index properties on typed arrays.\n               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n               // Skip index properties.\n               isIndex(key, length)\n            ))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\n\n    /**\n     * This function is like `assignValue` except that it doesn't assign\n     * `undefined` values.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignMergeValue(object, key, value) {\n      if ((value !== undefined && !eq(object[key], value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Assigns `value` to `key` of `object` if the existing value is not equivalent\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignValue(object, key, value) {\n      var objValue = object[key];\n      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Gets the index at which the `key` is found in `array` of key-value pairs.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {*} key The key to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     */\n    function assocIndexOf(array, key) {\n      var length = array.length;\n      while (length--) {\n        if (eq(array[length][0], key)) {\n          return length;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.assign` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\n\n    /**\n     * The base implementation of `_.assignIn` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\n\n    /**\n     * The base implementation of `assignValue` and `assignMergeValue` without\n     * value checks.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function baseAssignValue(object, key, value) {\n      if (key == '__proto__' && defineProperty) {\n        defineProperty(object, key, {\n          'configurable': true,\n          'enumerable': true,\n          'value': value,\n          'writable': true\n        });\n      } else {\n        object[key] = value;\n      }\n    }\n\n    /**\n     * The base implementation of `_.at` without support for individual paths.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Array} Returns the picked elements.\n     */\n    function baseAt(object, paths) {\n      var index = -1,\n          length = paths.length,\n          result = Array(length),\n          skip = object == null;\n\n      while (++index < length) {\n        result[index] = skip ? undefined : get(object, paths[index]);\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.clamp` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     */\n    function baseClamp(number, lower, upper) {\n      if (number === number) {\n        if (upper !== undefined) {\n          number = number <= upper ? number : upper;\n        }\n        if (lower !== undefined) {\n          number = number >= lower ? number : lower;\n        }\n      }\n      return number;\n    }\n\n    /**\n     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n     * traversed objects.\n     *\n     * @private\n     * @param {*} value The value to clone.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Deep clone\n     *  2 - Flatten inherited properties\n     *  4 - Clone symbols\n     * @param {Function} [customizer] The function to customize cloning.\n     * @param {string} [key] The key of `value`.\n     * @param {Object} [object] The parent object of `value`.\n     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n     * @returns {*} Returns the cloned value.\n     */\n    function baseClone(value, bitmask, customizer, key, object, stack) {\n      var result,\n          isDeep = bitmask & CLONE_DEEP_FLAG,\n          isFlat = bitmask & CLONE_FLAT_FLAG,\n          isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n      if (customizer) {\n        result = object ? customizer(value, key, object, stack) : customizer(value);\n      }\n      if (result !== undefined) {\n        return result;\n      }\n      if (!isObject(value)) {\n        return value;\n      }\n      var isArr = isArray(value);\n      if (isArr) {\n        result = initCloneArray(value);\n        if (!isDeep) {\n          return copyArray(value, result);\n        }\n      } else {\n        var tag = getTag(value),\n            isFunc = tag == funcTag || tag == genTag;\n\n        if (isBuffer(value)) {\n          return cloneBuffer(value, isDeep);\n        }\n        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n          result = (isFlat || isFunc) ? {} : initCloneObject(value);\n          if (!isDeep) {\n            return isFlat\n              ? copySymbolsIn(value, baseAssignIn(result, value))\n              : copySymbols(value, baseAssign(result, value));\n          }\n        } else {\n          if (!cloneableTags[tag]) {\n            return object ? value : {};\n          }\n          result = initCloneByTag(value, tag, isDeep);\n        }\n      }\n      // Check for circular references and return its corresponding clone.\n      stack || (stack = new Stack);\n      var stacked = stack.get(value);\n      if (stacked) {\n        return stacked;\n      }\n      stack.set(value, result);\n\n      if (isSet(value)) {\n        value.forEach(function(subValue) {\n          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n        });\n      } else if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n      }\n\n      var keysFunc = isFull\n        ? (isFlat ? getAllKeysIn : getAllKeys)\n        : (isFlat ? keysIn : keys);\n\n      var props = isArr ? undefined : keysFunc(value);\n      arrayEach(props || value, function(subValue, key) {\n        if (props) {\n          key = subValue;\n          subValue = value[key];\n        }\n        // Recursively populate clone (susceptible to call stack limits).\n        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\n\n    /**\n     * The base implementation of methods like `_.difference` without support\n     * for excluding multiple arrays or iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Array} values The values to exclude.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     */\n    function baseDifference(array, values, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          isCommon = true,\n          length = array.length,\n          result = [],\n          valuesLength = values.length;\n\n      if (!length) {\n        return result;\n      }\n      if (iteratee) {\n        values = arrayMap(values, baseUnary(iteratee));\n      }\n      if (comparator) {\n        includes = arrayIncludesWith;\n        isCommon = false;\n      }\n      else if (values.length >= LARGE_ARRAY_SIZE) {\n        includes = cacheHas;\n        isCommon = false;\n        values = new SetCache(values);\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee == null ? value : iteratee(value);\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var valuesIndex = valuesLength;\n          while (valuesIndex--) {\n            if (values[valuesIndex] === computed) {\n              continue outer;\n            }\n          }\n          result.push(value);\n        }\n        else if (!includes(values, computed, comparator)) {\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of methods like `_.max` and `_.min` which accepts a\n     * `comparator` to determine the extremum value.\n     *\n     * @private\n     * @param {Array} array The array to iterate over.\n     * @param {Function} iteratee The iteratee invoked per iteration.\n     * @param {Function} comparator The comparator used to compare values.\n     * @returns {*} Returns the extremum value.\n     */\n    function baseExtremum(array, iteratee, comparator) {\n      var index = -1,\n          length = array.length;\n\n      while (++index < length) {\n        var value = array[index],\n            current = iteratee(value);\n\n        if (current != null && (computed === undefined\n              ? (current === current && !isSymbol(current))\n              : comparator(current, computed)\n            )) {\n          var computed = current,\n              result = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.fill` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     */\n    function baseFill(array, value, start, end) {\n      var length = array.length;\n\n      start = toInteger(start);\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = (end === undefined || end > length) ? length : toInteger(end);\n      if (end < 0) {\n        end += length;\n      }\n      end = start > end ? 0 : toLength(end);\n      while (start < end) {\n        array[start++] = value;\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.flatten` with support for restricting flattening.\n     *\n     * @private\n     * @param {Array} array The array to flatten.\n     * @param {number} depth The maximum recursion depth.\n     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n     * @param {Array} [result=[]] The initial result value.\n     * @returns {Array} Returns the new flattened array.\n     */\n    function baseFlatten(array, depth, predicate, isStrict, result) {\n      var index = -1,\n          length = array.length;\n\n      predicate || (predicate = isFlattenable);\n      result || (result = []);\n\n      while (++index < length) {\n        var value = array[index];\n        if (depth > 0 && predicate(value)) {\n          if (depth > 1) {\n            // Recursively flatten arrays (susceptible to call stack limits).\n            baseFlatten(value, depth - 1, predicate, isStrict, result);\n          } else {\n            arrayPush(result, value);\n          }\n        } else if (!isStrict) {\n          result[result.length] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\n\n    /**\n     * The base implementation of `_.get` without support for default values.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseGet(object, path) {\n      path = castPath(path, object);\n\n      var index = 0,\n          length = path.length;\n\n      while (object != null && index < length) {\n        object = object[toKey(path[index++])];\n      }\n      return (index && index == length) ? object : undefined;\n    }\n\n    /**\n     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @param {Function} symbolsFunc The function to get the symbols of `object`.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\n    /**\n     * The base implementation of `_.gt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     */\n    function baseGt(value, other) {\n      return value > other;\n    }\n\n    /**\n     * The base implementation of `_.has` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\n    /**\n     * The base implementation of `_.hasIn` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\n\n    /**\n     * The base implementation of methods like `_.intersection`, without support\n     * for iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of shared values.\n     */\n    function baseIntersection(arrays, iteratee, comparator) {\n      var includes = comparator ? arrayIncludesWith : arrayIncludes,\n          length = arrays[0].length,\n          othLength = arrays.length,\n          othIndex = othLength,\n          caches = Array(othLength),\n          maxLength = Infinity,\n          result = [];\n\n      while (othIndex--) {\n        var array = arrays[othIndex];\n        if (othIndex && iteratee) {\n          array = arrayMap(array, baseUnary(iteratee));\n        }\n        maxLength = nativeMin(array.length, maxLength);\n        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n          ? new SetCache(othIndex && array)\n          : undefined;\n      }\n      array = arrays[0];\n\n      var index = -1,\n          seen = caches[0];\n\n      outer:\n      while (++index < length && result.length < maxLength) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (!(seen\n              ? cacheHas(seen, computed)\n              : includes(result, computed, comparator)\n            )) {\n          othIndex = othLength;\n          while (--othIndex) {\n            var cache = caches[othIndex];\n            if (!(cache\n                  ? cacheHas(cache, computed)\n                  : includes(arrays[othIndex], computed, comparator))\n                ) {\n              continue outer;\n            }\n          }\n          if (seen) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\n\n    /**\n     * The base implementation of `_.isArguments`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\n\n    /**\n     * The base implementation of `_.isEqual` which supports partial comparisons\n     * and tracks traversed objects.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Unordered comparison\n     *  2 - Partial comparison\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     */\n    function baseIsEqual(value, other, bitmask, customizer, stack) {\n      if (value === other) {\n        return true;\n      }\n      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n        return value !== value && other !== other;\n      }\n      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n    }\n\n    /**\n     * A specialized version of `baseIsEqual` for arrays and objects which performs\n     * deep comparisons and tracks traversed objects enabling objects with circular\n     * references to be compared.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n      var objIsArr = isArray(object),\n          othIsArr = isArray(other),\n          objTag = objIsArr ? arrayTag : getTag(object),\n          othTag = othIsArr ? arrayTag : getTag(other);\n\n      objTag = objTag == argsTag ? objectTag : objTag;\n      othTag = othTag == argsTag ? objectTag : othTag;\n\n      var objIsObj = objTag == objectTag,\n          othIsObj = othTag == objectTag,\n          isSameTag = objTag == othTag;\n\n      if (isSameTag && isBuffer(object)) {\n        if (!isBuffer(other)) {\n          return false;\n        }\n        objIsArr = true;\n        objIsObj = false;\n      }\n      if (isSameTag && !objIsObj) {\n        stack || (stack = new Stack);\n        return (objIsArr || isTypedArray(object))\n          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n      }\n      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n        if (objIsWrapped || othIsWrapped) {\n          var objUnwrapped = objIsWrapped ? object.value() : object,\n              othUnwrapped = othIsWrapped ? other.value() : other;\n\n          stack || (stack = new Stack);\n          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n        }\n      }\n      if (!isSameTag) {\n        return false;\n      }\n      stack || (stack = new Stack);\n      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n    }\n\n    /**\n     * The base implementation of `_.isMap` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\n\n    /**\n     * The base implementation of `_.isMatch` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Array} matchData The property names, values, and compare flags to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     */\n    function baseIsMatch(object, source, matchData, customizer) {\n      var index = matchData.length,\n          length = index,\n          noCustomizer = !customizer;\n\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (index--) {\n        var data = matchData[index];\n        if ((noCustomizer && data[2])\n              ? data[1] !== object[data[0]]\n              : !(data[0] in object)\n            ) {\n          return false;\n        }\n      }\n      while (++index < length) {\n        data = matchData[index];\n        var key = data[0],\n            objValue = object[key],\n            srcValue = data[1];\n\n        if (noCustomizer && data[2]) {\n          if (objValue === undefined && !(key in object)) {\n            return false;\n          }\n        } else {\n          var stack = new Stack;\n          if (customizer) {\n            var result = customizer(objValue, srcValue, key, object, source, stack);\n          }\n          if (!(result === undefined\n                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n                : result\n              )) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.isNative` without bad shim checks.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     */\n    function baseIsNative(value) {\n      if (!isObject(value) || isMasked(value)) {\n        return false;\n      }\n      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n      return pattern.test(toSource(value));\n    }\n\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\n\n    /**\n     * The base implementation of `_.isSet` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\n\n    /**\n     * The base implementation of `_.isTypedArray` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\n\n    /**\n     * The base implementation of `_.iteratee`.\n     *\n     * @private\n     * @param {*} [value=_.identity] The value to convert to an iteratee.\n     * @returns {Function} Returns the iteratee.\n     */\n    function baseIteratee(value) {\n      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n      if (typeof value == 'function') {\n        return value;\n      }\n      if (value == null) {\n        return identity;\n      }\n      if (typeof value == 'object') {\n        return isArray(value)\n          ? baseMatchesProperty(value[0], value[1])\n          : baseMatches(value);\n      }\n      return property(value);\n    }\n\n    /**\n     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeys(object) {\n      if (!isPrototype(object)) {\n        return nativeKeys(object);\n      }\n      var result = [];\n      for (var key in Object(object)) {\n        if (hasOwnProperty.call(object, key) && key != 'constructor') {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeysIn(object) {\n      if (!isObject(object)) {\n        return nativeKeysIn(object);\n      }\n      var isProto = isPrototype(object),\n          result = [];\n\n      for (var key in object) {\n        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.lt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     */\n    function baseLt(value, other) {\n      return value < other;\n    }\n\n    /**\n     * The base implementation of `_.map` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     */\n    function baseMap(collection, iteratee) {\n      var index = -1,\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value, key, collection) {\n        result[++index] = iteratee(value, key, collection);\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.matches` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatches(source) {\n      var matchData = getMatchData(source);\n      if (matchData.length == 1 && matchData[0][2]) {\n        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n      }\n      return function(object) {\n        return object === source || baseIsMatch(object, source, matchData);\n      };\n    }\n\n    /**\n     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n     *\n     * @private\n     * @param {string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatchesProperty(path, srcValue) {\n      if (isKey(path) && isStrictComparable(srcValue)) {\n        return matchesStrictComparable(toKey(path), srcValue);\n      }\n      return function(object) {\n        var objValue = get(object, path);\n        return (objValue === undefined && objValue === srcValue)\n          ? hasIn(object, path)\n          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n      };\n    }\n\n    /**\n     * The base implementation of `_.merge` without support for multiple sources.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} [customizer] The function to customize merged values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMerge(object, source, srcIndex, customizer, stack) {\n      if (object === source) {\n        return;\n      }\n      baseFor(source, function(srcValue, key) {\n        stack || (stack = new Stack);\n        if (isObject(srcValue)) {\n          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n        }\n        else {\n          var newValue = customizer\n            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n            : undefined;\n\n          if (newValue === undefined) {\n            newValue = srcValue;\n          }\n          assignMergeValue(object, key, newValue);\n        }\n      }, keysIn);\n    }\n\n    /**\n     * A specialized version of `baseMerge` for arrays and objects which performs\n     * deep merges and tracks traversed objects enabling objects with circular\n     * references to be merged.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {string} key The key of the value to merge.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} mergeFunc The function to merge values.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n      var objValue = safeGet(object, key),\n          srcValue = safeGet(source, key),\n          stacked = stack.get(srcValue);\n\n      if (stacked) {\n        assignMergeValue(object, key, stacked);\n        return;\n      }\n      var newValue = customizer\n        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      var isCommon = newValue === undefined;\n\n      if (isCommon) {\n        var isArr = isArray(srcValue),\n            isBuff = !isArr && isBuffer(srcValue),\n            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n        newValue = srcValue;\n        if (isArr || isBuff || isTyped) {\n          if (isArray(objValue)) {\n            newValue = objValue;\n          }\n          else if (isArrayLikeObject(objValue)) {\n            newValue = copyArray(objValue);\n          }\n          else if (isBuff) {\n            isCommon = false;\n            newValue = cloneBuffer(srcValue, true);\n          }\n          else if (isTyped) {\n            isCommon = false;\n            newValue = cloneTypedArray(srcValue, true);\n          }\n          else {\n            newValue = [];\n          }\n        }\n        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n          newValue = objValue;\n          if (isArguments(objValue)) {\n            newValue = toPlainObject(objValue);\n          }\n          else if (!isObject(objValue) || isFunction(objValue)) {\n            newValue = initCloneObject(srcValue);\n          }\n        }\n        else {\n          isCommon = false;\n        }\n      }\n      if (isCommon) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, newValue);\n        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n        stack['delete'](srcValue);\n      }\n      assignMergeValue(object, key, newValue);\n    }\n\n    /**\n     * The base implementation of `_.nth` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {number} n The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     */\n    function baseNth(array, n) {\n      var length = array.length;\n      if (!length) {\n        return;\n      }\n      n += n < 0 ? length : 0;\n      return isIndex(n, length) ? array[n] : undefined;\n    }\n\n    /**\n     * The base implementation of `_.orderBy` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n     * @param {string[]} orders The sort orders of `iteratees`.\n     * @returns {Array} Returns the new sorted array.\n     */\n    function baseOrderBy(collection, iteratees, orders) {\n      if (iteratees.length) {\n        iteratees = arrayMap(iteratees, function(iteratee) {\n          if (isArray(iteratee)) {\n            return function(value) {\n              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n            }\n          }\n          return iteratee;\n        });\n      } else {\n        iteratees = [identity];\n      }\n\n      var index = -1;\n      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n      var result = baseMap(collection, function(value, key, collection) {\n        var criteria = arrayMap(iteratees, function(iteratee) {\n          return iteratee(value);\n        });\n        return { 'criteria': criteria, 'index': ++index, 'value': value };\n      });\n\n      return baseSortBy(result, function(object, other) {\n        return compareMultiple(object, other, orders);\n      });\n    }\n\n    /**\n     * The base implementation of `_.pick` without support for individual\n     * property identifiers.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Object} Returns the new object.\n     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\n\n    /**\n     * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @param {Function} predicate The function invoked per property.\n     * @returns {Object} Returns the new object.\n     */\n    function basePickBy(object, paths, predicate) {\n      var index = -1,\n          length = paths.length,\n          result = {};\n\n      while (++index < length) {\n        var path = paths[index],\n            value = baseGet(object, path);\n\n        if (predicate(value, path)) {\n          baseSet(result, castPath(path, object), value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseProperty` which supports deep paths.\n     *\n     * @private\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\n\n    /**\n     * The base implementation of `_.pullAllBy` without support for iteratee\n     * shorthands.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAll(array, values, iteratee, comparator) {\n      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n          index = -1,\n          length = values.length,\n          seen = array;\n\n      if (array === values) {\n        values = copyArray(values);\n      }\n      if (iteratee) {\n        seen = arrayMap(array, baseUnary(iteratee));\n      }\n      while (++index < length) {\n        var fromIndex = 0,\n            value = values[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n          if (seen !== array) {\n            splice.call(seen, fromIndex, 1);\n          }\n          splice.call(array, fromIndex, 1);\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.pullAt` without support for individual\n     * indexes or capturing the removed elements.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {number[]} indexes The indexes of elements to remove.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAt(array, indexes) {\n      var length = array ? indexes.length : 0,\n          lastIndex = length - 1;\n\n      while (length--) {\n        var index = indexes[length];\n        if (length == lastIndex || index !== previous) {\n          var previous = index;\n          if (isIndex(index)) {\n            splice.call(array, index, 1);\n          } else {\n            baseUnset(array, index);\n          }\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\n\n    /**\n     * The base implementation of `_.range` and `_.rangeRight` which doesn't\n     * coerce arguments.\n     *\n     * @private\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} step The value to increment or decrement by.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the range of numbers.\n     */\n    function baseRange(start, end, step, fromRight) {\n      var index = -1,\n          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n          result = Array(length);\n\n      while (length--) {\n        result[fromRight ? length : ++index] = start;\n        start += step;\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * The base implementation of `_.set`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseSet(object, path, value, customizer) {\n      if (!isObject(object)) {\n        return object;\n      }\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          lastIndex = length - 1,\n          nested = object;\n\n      while (nested != null && ++index < length) {\n        var key = toKey(path[index]),\n            newValue = value;\n\n        if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n          return object;\n        }\n\n        if (index != lastIndex) {\n          var objValue = nested[key];\n          newValue = customizer ? customizer(objValue, key, nested) : undefined;\n          if (newValue === undefined) {\n            newValue = isObject(objValue)\n              ? objValue\n              : (isIndex(path[index + 1]) ? [] : {});\n          }\n        }\n        assignValue(nested, key, newValue);\n        nested = nested[key];\n      }\n      return object;\n    }\n\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\n\n    /**\n     * The base implementation of `setToString` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetToString = !defineProperty ? identity : function(func, string) {\n      return defineProperty(func, 'toString', {\n        'configurable': true,\n        'enumerable': false,\n        'value': constant(string),\n        'writable': true\n      });\n    };\n\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.slice` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseSlice(array, start, end) {\n      var index = -1,\n          length = array.length;\n\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = end > length ? length : end;\n      if (end < 0) {\n        end += length;\n      }\n      length = start > end ? 0 : ((end - start) >>> 0);\n      start >>>= 0;\n\n      var result = Array(length);\n      while (++index < length) {\n        result[index] = array[index + start];\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\n\n    /**\n     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n     * performs a binary search of `array` to determine the index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndex(array, value, retHighest) {\n      var low = 0,\n          high = array == null ? low : array.length;\n\n      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n        while (low < high) {\n          var mid = (low + high) >>> 1,\n              computed = array[mid];\n\n          if (computed !== null && !isSymbol(computed) &&\n              (retHighest ? (computed <= value) : (computed < value))) {\n            low = mid + 1;\n          } else {\n            high = mid;\n          }\n        }\n        return high;\n      }\n      return baseSortedIndexBy(array, value, identity, retHighest);\n    }\n\n    /**\n     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n     * which invokes `iteratee` for `value` and each element of `array` to compute\n     * their sort ranking. The iteratee is invoked with one argument; (value).\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} iteratee The iteratee invoked per element.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndexBy(array, value, iteratee, retHighest) {\n      var low = 0,\n          high = array == null ? 0 : array.length;\n      if (high === 0) {\n        return 0;\n      }\n\n      value = iteratee(value);\n      var valIsNaN = value !== value,\n          valIsNull = value === null,\n          valIsSymbol = isSymbol(value),\n          valIsUndefined = value === undefined;\n\n      while (low < high) {\n        var mid = nativeFloor((low + high) / 2),\n            computed = iteratee(array[mid]),\n            othIsDefined = computed !== undefined,\n            othIsNull = computed === null,\n            othIsReflexive = computed === computed,\n            othIsSymbol = isSymbol(computed);\n\n        if (valIsNaN) {\n          var setLow = retHighest || othIsReflexive;\n        } else if (valIsUndefined) {\n          setLow = othIsReflexive && (retHighest || othIsDefined);\n        } else if (valIsNull) {\n          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n        } else if (valIsSymbol) {\n          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n        } else if (othIsNull || othIsSymbol) {\n          setLow = false;\n        } else {\n          setLow = retHighest ? (computed <= value) : (computed < value);\n        }\n        if (setLow) {\n          low = mid + 1;\n        } else {\n          high = mid;\n        }\n      }\n      return nativeMin(high, MAX_ARRAY_INDEX);\n    }\n\n    /**\n     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n     * support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseSortedUniq(array, iteratee) {\n      var index = -1,\n          length = array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        if (!index || !eq(computed, seen)) {\n          var seen = computed;\n          result[resIndex++] = value === 0 ? 0 : value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\n\n    /**\n     * The base implementation of `_.toString` which doesn't convert nullish\n     * values to empty strings.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {string} Returns the string.\n     */\n    function baseToString(value) {\n      // Exit early for strings to avoid a performance hit in some environments.\n      if (typeof value == 'string') {\n        return value;\n      }\n      if (isArray(value)) {\n        // Recursively convert values (susceptible to call stack limits).\n        return arrayMap(value, baseToString) + '';\n      }\n      if (isSymbol(value)) {\n        return symbolToString ? symbolToString.call(value) : '';\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseUniq(array, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          length = array.length,\n          isCommon = true,\n          result = [],\n          seen = result;\n\n      if (comparator) {\n        isCommon = false;\n        includes = arrayIncludesWith;\n      }\n      else if (length >= LARGE_ARRAY_SIZE) {\n        var set = iteratee ? null : createSet(array);\n        if (set) {\n          return setToArray(set);\n        }\n        isCommon = false;\n        includes = cacheHas;\n        seen = new SetCache;\n      }\n      else {\n        seen = iteratee ? [] : result;\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var seenIndex = seen.length;\n          while (seenIndex--) {\n            if (seen[seenIndex] === computed) {\n              continue outer;\n            }\n          }\n          if (iteratee) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n        else if (!includes(seen, computed, comparator)) {\n          if (seen !== result) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.unset`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The property path to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\n\n    /**\n     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n     * without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {Function} predicate The function invoked per iteration.\n     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseWhile(array, predicate, isDrop, fromRight) {\n      var length = array.length,\n          index = fromRight ? length : -1;\n\n      while ((fromRight ? index-- : ++index < length) &&\n        predicate(array[index], index, array)) {}\n\n      return isDrop\n        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n    }\n\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\n\n    /**\n     * The base implementation of methods like `_.xor`, without support for\n     * iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of values.\n     */\n    function baseXor(arrays, iteratee, comparator) {\n      var length = arrays.length;\n      if (length < 2) {\n        return length ? baseUniq(arrays[0]) : [];\n      }\n      var index = -1,\n          result = Array(length);\n\n      while (++index < length) {\n        var array = arrays[index],\n            othIndex = -1;\n\n        while (++othIndex < length) {\n          if (othIndex != index) {\n            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n          }\n        }\n      }\n      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n    }\n\n    /**\n     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n     *\n     * @private\n     * @param {Array} props The property identifiers.\n     * @param {Array} values The property values.\n     * @param {Function} assignFunc The function to assign values.\n     * @returns {Object} Returns the new object.\n     */\n    function baseZipObject(props, values, assignFunc) {\n      var index = -1,\n          length = props.length,\n          valsLength = values.length,\n          result = {};\n\n      while (++index < length) {\n        var value = index < valsLength ? values[index] : undefined;\n        assignFunc(result, props[index], value);\n      }\n      return result;\n    }\n\n    /**\n     * Casts `value` to an empty array if it's not an array like object.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Array|Object} Returns the cast array-like object.\n     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\n\n    /**\n     * Casts `value` to a path array if it's not one.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {Array} Returns the cast property path array.\n     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\n\n    /**\n     * Creates a clone of  `buffer`.\n     *\n     * @private\n     * @param {Buffer} buffer The buffer to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Buffer} Returns the cloned buffer.\n     */\n    function cloneBuffer(buffer, isDeep) {\n      if (isDeep) {\n        return buffer.slice();\n      }\n      var length = buffer.length,\n          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n      buffer.copy(result);\n      return result;\n    }\n\n    /**\n     * Creates a clone of `arrayBuffer`.\n     *\n     * @private\n     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n     * @returns {ArrayBuffer} Returns the cloned array buffer.\n     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\n\n    /**\n     * Creates a clone of `dataView`.\n     *\n     * @private\n     * @param {Object} dataView The data view to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned data view.\n     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\n\n    /**\n     * Creates a clone of `regexp`.\n     *\n     * @private\n     * @param {Object} regexp The regexp to clone.\n     * @returns {Object} Returns the cloned regexp.\n     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\n\n    /**\n     * Creates a clone of the `symbol` object.\n     *\n     * @private\n     * @param {Object} symbol The symbol object to clone.\n     * @returns {Object} Returns the cloned symbol object.\n     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\n\n    /**\n     * Creates a clone of `typedArray`.\n     *\n     * @private\n     * @param {Object} typedArray The typed array to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned typed array.\n     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\n\n    /**\n     * Compares values to sort them in ascending order.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {number} Returns the sort order indicator for `value`.\n     */\n    function compareAscending(value, other) {\n      if (value !== other) {\n        var valIsDefined = value !== undefined,\n            valIsNull = value === null,\n            valIsReflexive = value === value,\n            valIsSymbol = isSymbol(value);\n\n        var othIsDefined = other !== undefined,\n            othIsNull = other === null,\n            othIsReflexive = other === other,\n            othIsSymbol = isSymbol(other);\n\n        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n            (valIsNull && othIsDefined && othIsReflexive) ||\n            (!valIsDefined && othIsReflexive) ||\n            !valIsReflexive) {\n          return 1;\n        }\n        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n            (othIsNull && valIsDefined && valIsReflexive) ||\n            (!othIsDefined && valIsReflexive) ||\n            !othIsReflexive) {\n          return -1;\n        }\n      }\n      return 0;\n    }\n\n    /**\n     * Used by `_.orderBy` to compare multiple properties of a value to another\n     * and stable sort them.\n     *\n     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n     * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n     * of corresponding values.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {boolean[]|string[]} orders The order to sort by for each property.\n     * @returns {number} Returns the sort order indicator for `object`.\n     */\n    function compareMultiple(object, other, orders) {\n      var index = -1,\n          objCriteria = object.criteria,\n          othCriteria = other.criteria,\n          length = objCriteria.length,\n          ordersLength = orders.length;\n\n      while (++index < length) {\n        var result = compareAscending(objCriteria[index], othCriteria[index]);\n        if (result) {\n          if (index >= ordersLength) {\n            return result;\n          }\n          var order = orders[index];\n          return result * (order == 'desc' ? -1 : 1);\n        }\n      }\n      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n      // that causes it, under certain circumstances, to provide the same value for\n      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n      // for more details.\n      //\n      // This also ensures a stable sort in V8 and other engines.\n      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n      return object.index - other.index;\n    }\n\n    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Copies the values of `source` to `array`.\n     *\n     * @private\n     * @param {Array} source The array to copy values from.\n     * @param {Array} [array=[]] The array to copy values to.\n     * @returns {Array} Returns `array`.\n     */\n    function copyArray(source, array) {\n      var index = -1,\n          length = source.length;\n\n      array || (array = Array(length));\n      while (++index < length) {\n        array[index] = source[index];\n      }\n      return array;\n    }\n\n    /**\n     * Copies properties of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy properties from.\n     * @param {Array} props The property identifiers to copy.\n     * @param {Object} [object={}] The object to copy properties to.\n     * @param {Function} [customizer] The function to customize copied values.\n     * @returns {Object} Returns `object`.\n     */\n    function copyObject(source, props, object, customizer) {\n      var isNew = !object;\n      object || (object = {});\n\n      var index = -1,\n          length = props.length;\n\n      while (++index < length) {\n        var key = props[index];\n\n        var newValue = customizer\n          ? customizer(object[key], source[key], key, object, source)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = source[key];\n        }\n        if (isNew) {\n          baseAssignValue(object, key, newValue);\n        } else {\n          assignValue(object, key, newValue);\n        }\n      }\n      return object;\n    }\n\n    /**\n     * Copies own symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\n\n    /**\n     * Copies own and inherited symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\n\n    /**\n     * Creates a function like `_.assign`.\n     *\n     * @private\n     * @param {Function} assigner The function to assign values.\n     * @returns {Function} Returns the new assigner function.\n     */\n    function createAssigner(assigner) {\n      return baseRest(function(object, sources) {\n        var index = -1,\n            length = sources.length,\n            customizer = length > 1 ? sources[length - 1] : undefined,\n            guard = length > 2 ? sources[2] : undefined;\n\n        customizer = (assigner.length > 3 && typeof customizer == 'function')\n          ? (length--, customizer)\n          : undefined;\n\n        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n          customizer = length < 3 ? undefined : customizer;\n          length = 1;\n        }\n        object = Object(object);\n        while (++index < length) {\n          var source = sources[index];\n          if (source) {\n            assigner(object, source, index, customizer);\n          }\n        }\n        return object;\n      });\n    }\n\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.find` or `_.findLast` function.\n     *\n     * @private\n     * @param {Function} findIndexFunc The function to find the collection index.\n     * @returns {Function} Returns the new find function.\n     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(predicate, 3);\n          collection = keys(collection);\n          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n        }\n        var index = findIndexFunc(collection, predicate, fromIndex);\n        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n      };\n    }\n\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.range` or `_.rangeRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new range function.\n     */\n    function createRange(fromRight) {\n      return function(start, end, step) {\n        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n          end = step = undefined;\n        }\n        // Ensure the sign of `-0` is preserved.\n        start = toFinite(start);\n        if (end === undefined) {\n          end = start;\n          start = 0;\n        } else {\n          end = toFinite(end);\n        }\n        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n        return baseRange(start, end, step, fromRight);\n      };\n    }\n\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\n\n    /**\n     * Creates a set object of `values`.\n     *\n     * @private\n     * @param {Array} values The values to add to the set.\n     * @returns {Object} Returns the new set.\n     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for arrays with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Array} array The array to compare.\n     * @param {Array} other The other array to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `array` and `other` objects.\n     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n     */\n    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          arrLength = array.length,\n          othLength = other.length;\n\n      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n        return false;\n      }\n      // Check that cyclic values are equal.\n      var arrStacked = stack.get(array);\n      var othStacked = stack.get(other);\n      if (arrStacked && othStacked) {\n        return arrStacked == other && othStacked == array;\n      }\n      var index = -1,\n          result = true,\n          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n      stack.set(array, other);\n      stack.set(other, array);\n\n      // Ignore non-index properties.\n      while (++index < arrLength) {\n        var arrValue = array[index],\n            othValue = other[index];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, arrValue, index, other, array, stack)\n            : customizer(arrValue, othValue, index, array, other, stack);\n        }\n        if (compared !== undefined) {\n          if (compared) {\n            continue;\n          }\n          result = false;\n          break;\n        }\n        // Recursively compare arrays (susceptible to call stack limits).\n        if (seen) {\n          if (!arraySome(other, function(othValue, othIndex) {\n                if (!cacheHas(seen, othIndex) &&\n                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n                  return seen.push(othIndex);\n                }\n              })) {\n            result = false;\n            break;\n          }\n        } else if (!(\n              arrValue === othValue ||\n                equalFunc(arrValue, othValue, bitmask, customizer, stack)\n            )) {\n          result = false;\n          break;\n        }\n      }\n      stack['delete'](array);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for comparing objects of\n     * the same `toStringTag`.\n     *\n     * **Note:** This function only supports comparing values with tags of\n     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {string} tag The `toStringTag` of the objects to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n      switch (tag) {\n        case dataViewTag:\n          if ((object.byteLength != other.byteLength) ||\n              (object.byteOffset != other.byteOffset)) {\n            return false;\n          }\n          object = object.buffer;\n          other = other.buffer;\n\n        case arrayBufferTag:\n          if ((object.byteLength != other.byteLength) ||\n              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n            return false;\n          }\n          return true;\n\n        case boolTag:\n        case dateTag:\n        case numberTag:\n          // Coerce booleans to `1` or `0` and dates to milliseconds.\n          // Invalid dates are coerced to `NaN`.\n          return eq(+object, +other);\n\n        case errorTag:\n          return object.name == other.name && object.message == other.message;\n\n        case regexpTag:\n        case stringTag:\n          // Coerce regexes to strings and treat strings, primitives and objects,\n          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n          // for more details.\n          return object == (other + '');\n\n        case mapTag:\n          var convert = mapToArray;\n\n        case setTag:\n          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n          convert || (convert = setToArray);\n\n          if (object.size != other.size && !isPartial) {\n            return false;\n          }\n          // Assume cyclic values are equal.\n          var stacked = stack.get(object);\n          if (stacked) {\n            return stacked == other;\n          }\n          bitmask |= COMPARE_UNORDERED_FLAG;\n\n          // Recursively compare objects (susceptible to call stack limits).\n          stack.set(object, other);\n          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n          stack['delete'](object);\n          return result;\n\n        case symbolTag:\n          if (symbolValueOf) {\n            return symbolValueOf.call(object) == symbolValueOf.call(other);\n          }\n      }\n      return false;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for objects with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          objProps = getAllKeys(object),\n          objLength = objProps.length,\n          othProps = getAllKeys(other),\n          othLength = othProps.length;\n\n      if (objLength != othLength && !isPartial) {\n        return false;\n      }\n      var index = objLength;\n      while (index--) {\n        var key = objProps[index];\n        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n          return false;\n        }\n      }\n      // Check that cyclic values are equal.\n      var objStacked = stack.get(object);\n      var othStacked = stack.get(other);\n      if (objStacked && othStacked) {\n        return objStacked == other && othStacked == object;\n      }\n      var result = true;\n      stack.set(object, other);\n      stack.set(other, object);\n\n      var skipCtor = isPartial;\n      while (++index < objLength) {\n        key = objProps[index];\n        var objValue = object[key],\n            othValue = other[key];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, objValue, key, other, object, stack)\n            : customizer(objValue, othValue, key, object, other, stack);\n        }\n        // Recursively compare objects (susceptible to call stack limits).\n        if (!(compared === undefined\n              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n              : compared\n            )) {\n          result = false;\n          break;\n        }\n        skipCtor || (skipCtor = key == 'constructor');\n      }\n      if (result && !skipCtor) {\n        var objCtor = object.constructor,\n            othCtor = other.constructor;\n\n        // Non `Object` object instances with different constructors are not equal.\n        if (objCtor != othCtor &&\n            ('constructor' in object && 'constructor' in other) &&\n            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n          result = false;\n        }\n      }\n      stack['delete'](object);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseRest` which flattens the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\n\n    /**\n     * Creates an array of own enumerable property names and symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\n\n    /**\n     * Creates an array of own and inherited enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\n\n    /**\n     * Gets the data for `map`.\n     *\n     * @private\n     * @param {Object} map The map to query.\n     * @param {string} key The reference key.\n     * @returns {*} Returns the map data.\n     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\n\n    /**\n     * Gets the property names, values, and compare flags of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the match data of `object`.\n     */\n    function getMatchData(object) {\n      var result = keys(object),\n          length = result.length;\n\n      while (length--) {\n        var key = result[length],\n            value = object[key];\n\n        result[length] = [key, value, isStrictComparable(value)];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the native function at `key` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the method to get.\n     * @returns {*} Returns the function if it's native, else `undefined`.\n     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array of the own enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n      if (object == null) {\n        return [];\n      }\n      object = Object(object);\n      return arrayFilter(nativeGetSymbols(object), function(symbol) {\n        return propertyIsEnumerable.call(object, symbol);\n      });\n    };\n\n    /**\n     * Creates an array of the own and inherited enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n      var result = [];\n      while (object) {\n        arrayPush(result, getSymbols(object));\n        object = getPrototype(object);\n      }\n      return result;\n    };\n\n    /**\n     * Gets the `toStringTag` of `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n        (Map && getTag(new Map) != mapTag) ||\n        (Promise && getTag(Promise.resolve()) != promiseTag) ||\n        (Set && getTag(new Set) != setTag) ||\n        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n      getTag = function(value) {\n        var result = baseGetTag(value),\n            Ctor = result == objectTag ? value.constructor : undefined,\n            ctorString = Ctor ? toSource(Ctor) : '';\n\n        if (ctorString) {\n          switch (ctorString) {\n            case dataViewCtorString: return dataViewTag;\n            case mapCtorString: return mapTag;\n            case promiseCtorString: return promiseTag;\n            case setCtorString: return setTag;\n            case weakMapCtorString: return weakMapTag;\n          }\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\n\n    /**\n     * Checks if `path` exists on `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @param {Function} hasFunc The function to check properties.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     */\n    function hasPath(object, path, hasFunc) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          result = false;\n\n      while (++index < length) {\n        var key = toKey(path[index]);\n        if (!(result = object != null && hasFunc(object, key))) {\n          break;\n        }\n        object = object[key];\n      }\n      if (result || ++index != length) {\n        return result;\n      }\n      length = object == null ? 0 : object.length;\n      return !!length && isLength(length) && isIndex(key, length) &&\n        (isArray(object) || isArguments(object));\n    }\n\n    /**\n     * Initializes an array clone.\n     *\n     * @private\n     * @param {Array} array The array to clone.\n     * @returns {Array} Returns the initialized clone.\n     */\n    function initCloneArray(array) {\n      var length = array.length,\n          result = new array.constructor(length);\n\n      // Add properties assigned by `RegExp#exec`.\n      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n        result.index = array.index;\n        result.input = array.input;\n      }\n      return result;\n    }\n\n    /**\n     * Initializes an object clone.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\n\n    /**\n     * Initializes an object clone based on its `toStringTag`.\n     *\n     * **Note:** This function only supports cloning values with tags of\n     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @param {string} tag The `toStringTag` of the object to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneByTag(object, tag, isDeep) {\n      var Ctor = object.constructor;\n      switch (tag) {\n        case arrayBufferTag:\n          return cloneArrayBuffer(object);\n\n        case boolTag:\n        case dateTag:\n          return new Ctor(+object);\n\n        case dataViewTag:\n          return cloneDataView(object, isDeep);\n\n        case float32Tag: case float64Tag:\n        case int8Tag: case int16Tag: case int32Tag:\n        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n          return cloneTypedArray(object, isDeep);\n\n        case mapTag:\n          return new Ctor;\n\n        case numberTag:\n        case stringTag:\n          return new Ctor(object);\n\n        case regexpTag:\n          return cloneRegExp(object);\n\n        case setTag:\n          return new Ctor;\n\n        case symbolTag:\n          return cloneSymbol(object);\n      }\n    }\n\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\n\n    /**\n     * Checks if `value` is a flattenable `arguments` object or array.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like index.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n     */\n    function isIndex(value, length) {\n      var type = typeof value;\n      length = length == null ? MAX_SAFE_INTEGER : length;\n\n      return !!length &&\n        (type == 'number' ||\n          (type != 'symbol' && reIsUint.test(value))) &&\n            (value > -1 && value % 1 == 0 && value < length);\n    }\n\n    /**\n     * Checks if the given arguments are from an iteratee call.\n     *\n     * @private\n     * @param {*} value The potential iteratee value argument.\n     * @param {*} index The potential iteratee index or key argument.\n     * @param {*} object The potential iteratee object argument.\n     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n     *  else `false`.\n     */\n    function isIterateeCall(value, index, object) {\n      if (!isObject(object)) {\n        return false;\n      }\n      var type = typeof index;\n      if (type == 'number'\n            ? (isArrayLike(object) && isIndex(index, object.length))\n            : (type == 'string' && index in object)\n          ) {\n        return eq(object[index], value);\n      }\n      return false;\n    }\n\n    /**\n     * Checks if `value` is a property name and not a property path.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n     */\n    function isKey(value, object) {\n      if (isArray(value)) {\n        return false;\n      }\n      var type = typeof value;\n      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n          value == null || isSymbol(value)) {\n        return true;\n      }\n      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n        (object != null && value in Object(object));\n    }\n\n    /**\n     * Checks if `value` is suitable for use as unique object key.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n     */\n    function isKeyable(value) {\n      var type = typeof value;\n      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n        ? (value !== '__proto__')\n        : (value === null);\n    }\n\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\n    }\n\n    /**\n     * Checks if `func` has its source masked.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\n\n    /**\n     * Checks if `value` is likely a prototype object.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\n\n    /**\n     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` if suitable for strict\n     *  equality comparisons, else `false`.\n     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\n    /**\n     * A specialized version of `matchesProperty` for source values suitable\n     * for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {string} key The key of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function matchesStrictComparable(key, srcValue) {\n      return function(object) {\n        if (object == null) {\n          return false;\n        }\n        return object[key] === srcValue &&\n          (srcValue !== undefined || (key in Object(object)));\n      };\n    }\n\n    /**\n     * A specialized version of `_.memoize` which clears the memoized function's\n     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n     *\n     * @private\n     * @param {Function} func The function to have its output memoized.\n     * @returns {Function} Returns the new memoized function.\n     */\n    function memoizeCapped(func) {\n      var result = memoize(func, function(key) {\n        if (cache.size === MAX_MEMOIZE_SIZE) {\n          cache.clear();\n        }\n        return key;\n      });\n\n      var cache = result.cache;\n      return result;\n    }\n\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\n    /**\n     * This function is like\n     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * except that it includes inherited enumerable properties.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function nativeKeysIn(object) {\n      var result = [];\n      if (object != null) {\n        for (var key in Object(object)) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\n\n    /**\n     * A specialized version of `baseRest` which transforms the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @param {Function} transform The rest array transform.\n     * @returns {Function} Returns the new function.\n     */\n    function overRest(func, start, transform) {\n      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n      return function() {\n        var args = arguments,\n            index = -1,\n            length = nativeMax(args.length - start, 0),\n            array = Array(length);\n\n        while (++index < length) {\n          array[index] = args[start + index];\n        }\n        index = -1;\n        var otherArgs = Array(start + 1);\n        while (++index < start) {\n          otherArgs[index] = args[index];\n        }\n        otherArgs[start] = transform(array);\n        return apply(func, this, otherArgs);\n      };\n    }\n\n    /**\n     * Gets the parent value at `path` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array} path The path to get the parent value of.\n     * @returns {*} Returns the parent value.\n     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\n    /**\n     * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the property to get.\n     * @returns {*} Returns the property value.\n     */\n    function safeGet(object, key) {\n      if (key === 'constructor' && typeof object[key] === 'function') {\n        return;\n      }\n\n      if (key == '__proto__') {\n        return;\n      }\n\n      return object[key];\n    }\n\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\n\n    /**\n     * Sets the `toString` method of `func` to return `string`.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\n\n    /**\n     * Creates a function that'll short out and invoke `identity` instead\n     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n     * milliseconds.\n     *\n     * @private\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new shortable function.\n     */\n    function shortOut(func) {\n      var count = 0,\n          lastCalled = 0;\n\n      return function() {\n        var stamp = nativeNow(),\n            remaining = HOT_SPAN - (stamp - lastCalled);\n\n        lastCalled = stamp;\n        if (remaining > 0) {\n          if (++count >= HOT_COUNT) {\n            return arguments[0];\n          }\n        } else {\n          count = 0;\n        }\n        return func.apply(undefined, arguments);\n      };\n    }\n\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\n\n    /**\n     * Converts `string` to a property path array.\n     *\n     * @private\n     * @param {string} string The string to convert.\n     * @returns {Array} Returns the property path array.\n     */\n    var stringToPath = memoizeCapped(function(string) {\n      var result = [];\n      if (string.charCodeAt(0) === 46 /* . */) {\n        result.push('');\n      }\n      string.replace(rePropName, function(match, number, quote, subString) {\n        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n      });\n      return result;\n    });\n\n    /**\n     * Converts `value` to a string key if it's not a string or symbol.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {string|symbol} Returns the key.\n     */\n    function toKey(value) {\n      if (typeof value == 'string' || isSymbol(value)) {\n        return value;\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * Converts `func` to its source code.\n     *\n     * @private\n     * @param {Function} func The function to convert.\n     * @returns {string} Returns the source code.\n     */\n    function toSource(func) {\n      if (func != null) {\n        try {\n          return funcToString.call(func);\n        } catch (e) {}\n        try {\n          return (func + '');\n        } catch (e) {}\n      }\n      return '';\n    }\n\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of elements split into groups the length of `size`.\n     * If `array` can't be split evenly, the final chunk will be the remaining\n     * elements.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to process.\n     * @param {number} [size=1] The length of each chunk\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the new array of chunks.\n     * @example\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 2);\n     * // => [['a', 'b'], ['c', 'd']]\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 3);\n     * // => [['a', 'b', 'c'], ['d']]\n     */\n    function chunk(array, size, guard) {\n      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n        size = 1;\n      } else {\n        size = nativeMax(toInteger(size), 0);\n      }\n      var length = array == null ? 0 : array.length;\n      if (!length || size < 1) {\n        return [];\n      }\n      var index = 0,\n          resIndex = 0,\n          result = Array(nativeCeil(length / size));\n\n      while (index < length) {\n        result[resIndex++] = baseSlice(array, index, (index += size));\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array with all falsey values removed. The values `false`, `null`,\n     * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to compact.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.compact([0, 1, false, 2, '', 3]);\n     * // => [1, 2, 3]\n     */\n    function compact(array) {\n      var index = -1,\n          length = array == null ? 0 : array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index];\n        if (value) {\n          result[resIndex++] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates a new array concatenating `array` with any additional arrays\n     * and/or values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to concatenate.\n     * @param {...*} [values] The values to concatenate.\n     * @returns {Array} Returns the new concatenated array.\n     * @example\n     *\n     * var array = [1];\n     * var other = _.concat(array, 2, [3], [[4]]);\n     *\n     * console.log(other);\n     * // => [1, 2, 3, [4]]\n     *\n     * console.log(array);\n     * // => [1]\n     */\n    function concat() {\n      var length = arguments.length;\n      if (!length) {\n        return [];\n      }\n      var args = Array(length - 1),\n          array = arguments[0],\n          index = length;\n\n      while (index--) {\n        args[index - 1] = arguments[index];\n      }\n      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n    }\n\n    /**\n     * Creates an array of `array` values not included in the other given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * **Note:** Unlike `_.pullAll`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.without, _.xor\n     * @example\n     *\n     * _.difference([2, 1], [2, 3]);\n     * // => [1]\n     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `iteratee` which\n     * is invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var differenceBy = baseRest(function(array, values) {\n      var iteratee = last(values);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `comparator`\n     * which is invoked to compare elements of `array` to `values`. The order and\n     * references of result values are determined by the first array. The comparator\n     * is invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     *\n     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }]\n     */\n    var differenceWith = baseRest(function(array, values) {\n      var comparator = last(values);\n      if (isArrayLikeObject(comparator)) {\n        comparator = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.drop([1, 2, 3]);\n     * // => [2, 3]\n     *\n     * _.drop([1, 2, 3], 2);\n     * // => [3]\n     *\n     * _.drop([1, 2, 3], 5);\n     * // => []\n     *\n     * _.drop([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function drop(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.dropRight([1, 2, 3]);\n     * // => [1, 2]\n     *\n     * _.dropRight([1, 2, 3], 2);\n     * // => [1]\n     *\n     * _.dropRight([1, 2, 3], 5);\n     * // => []\n     *\n     * _.dropRight([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function dropRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the end.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.dropRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropRightWhile(users, ['active', false]);\n     * // => objects for ['barney']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropRightWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the beginning.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.dropWhile(users, function(o) { return !o.active; });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropWhile(users, ['active', false]);\n     * // => objects for ['pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\n\n    /**\n     * Fills elements of `array` with `value` from `start` up to, but not\n     * including, `end`.\n     *\n     * **Note:** This method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Array\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.fill(array, 'a');\n     * console.log(array);\n     * // => ['a', 'a', 'a']\n     *\n     * _.fill(Array(3), 2);\n     * // => [2, 2, 2]\n     *\n     * _.fill([4, 6, 8, 10], '*', 1, 3);\n     * // => [4, '*', '*', 10]\n     */\n    function fill(array, value, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n        start = 0;\n        end = length;\n      }\n      return baseFill(array, value, start, end);\n    }\n\n    /**\n     * This method is like `_.find` except that it returns the index of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.findIndex(users, function(o) { return o.user == 'barney'; });\n     * // => 0\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findIndex(users, { 'user': 'fred', 'active': false });\n     * // => 1\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findIndex(users, ['active', false]);\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findIndex(users, 'active');\n     * // => 2\n     */\n    function findIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index);\n    }\n\n    /**\n     * This method is like `_.findIndex` except that it iterates over elements\n     * of `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n     * // => 2\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n     * // => 0\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastIndex(users, ['active', false]);\n     * // => 2\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastIndex(users, 'active');\n     * // => 0\n     */\n    function findLastIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length - 1;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = fromIndex < 0\n          ? nativeMax(length + index, 0)\n          : nativeMin(index, length - 1);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n    }\n\n    /**\n     * Flattens `array` a single level deep.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flatten([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, [3, [4]], 5]\n     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\n\n    /**\n     * Recursively flattens `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flattenDeep([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, 3, 4, 5]\n     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\n\n    /**\n     * Recursively flatten `array` up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * var array = [1, [2, [3, [4]], 5]];\n     *\n     * _.flattenDepth(array, 1);\n     * // => [1, 2, [3, [4]], 5]\n     *\n     * _.flattenDepth(array, 2);\n     * // => [1, 2, 3, [4], 5]\n     */\n    function flattenDepth(array, depth) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(array, depth);\n    }\n\n    /**\n     * The inverse of `_.toPairs`; this method returns an object composed\n     * from key-value `pairs`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} pairs The key-value pairs.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.fromPairs([['a', 1], ['b', 2]]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function fromPairs(pairs) {\n      var index = -1,\n          length = pairs == null ? 0 : pairs.length,\n          result = {};\n\n      while (++index < length) {\n        var pair = pairs[index];\n        result[pair[0]] = pair[1];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias first\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the first element of `array`.\n     * @example\n     *\n     * _.head([1, 2, 3]);\n     * // => 1\n     *\n     * _.head([]);\n     * // => undefined\n     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\n\n    /**\n     * Gets the index at which the first occurrence of `value` is found in `array`\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. If `fromIndex` is negative, it's used as the\n     * offset from the end of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.indexOf([1, 2, 1, 2], 2);\n     * // => 1\n     *\n     * // Search from the `fromIndex`.\n     * _.indexOf([1, 2, 1, 2], 2, 2);\n     * // => 3\n     */\n    function indexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseIndexOf(array, value, index);\n    }\n\n    /**\n     * Gets all but the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.initial([1, 2, 3]);\n     * // => [1, 2]\n     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\n\n    /**\n     * Creates an array of unique values that are included in all given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersection([2, 1], [2, 3]);\n     * // => [2]\n     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `iteratee`\n     * which is invoked for each element of each `arrays` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [2.1]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }]\n     */\n    var intersectionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      if (iteratee === last(mapped)) {\n        iteratee = undefined;\n      } else {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `comparator`\n     * which is invoked to compare elements of `arrays`. The order and references\n     * of result values are determined by the first array. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.intersectionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }]\n     */\n    var intersectionWith = baseRest(function(arrays) {\n      var comparator = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      if (comparator) {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Converts all elements in `array` into a string separated by `separator`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to convert.\n     * @param {string} [separator=','] The element separator.\n     * @returns {string} Returns the joined string.\n     * @example\n     *\n     * _.join(['a', 'b', 'c'], '~');\n     * // => 'a~b~c'\n     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\n    /**\n     * Gets the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the last element of `array`.\n     * @example\n     *\n     * _.last([1, 2, 3]);\n     * // => 3\n     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it iterates over elements of\n     * `array` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.lastIndexOf([1, 2, 1, 2], 2);\n     * // => 3\n     *\n     * // Search from the `fromIndex`.\n     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n     * // => 1\n     */\n    function lastIndexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n      }\n      return value === value\n        ? strictLastIndexOf(array, value, index)\n        : baseFindIndex(array, baseIsNaN, index, true);\n    }\n\n    /**\n     * Gets the element at index `n` of `array`. If `n` is negative, the nth\n     * element from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.11.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=0] The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     *\n     * _.nth(array, 1);\n     * // => 'b'\n     *\n     * _.nth(array, -2);\n     * // => 'c';\n     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\n\n    /**\n     * Removes all given values from `array` using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n     * to remove elements from an array by predicate.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...*} [values] The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pull(array, 'a', 'c');\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    var pull = baseRest(pullAll);\n\n    /**\n     * This method is like `_.pull` except that it accepts an array of values to remove.\n     *\n     * **Note:** Unlike `_.difference`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pullAll(array, ['a', 'c']);\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `iteratee` which is\n     * invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The iteratee is invoked with one argument: (value).\n     *\n     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n     *\n     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n     * console.log(array);\n     * // => [{ 'x': 2 }]\n     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `comparator` which\n     * is invoked to compare elements of `array` to `values`. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n     *\n     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n     * console.log(array);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\n\n    /**\n     * Removes elements from `array` corresponding to `indexes` and returns an\n     * array of removed elements.\n     *\n     * **Note:** Unlike `_.at`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     * var pulled = _.pullAt(array, [1, 3]);\n     *\n     * console.log(array);\n     * // => ['a', 'c']\n     *\n     * console.log(pulled);\n     * // => ['b', 'd']\n     */\n    var pullAt = flatRest(function(array, indexes) {\n      var length = array == null ? 0 : array.length,\n          result = baseAt(array, indexes);\n\n      basePullAt(array, arrayMap(indexes, function(index) {\n        return isIndex(index, length) ? +index : index;\n      }).sort(compareAscending));\n\n      return result;\n    });\n\n    /**\n     * Removes all elements from `array` that `predicate` returns truthy for\n     * and returns an array of the removed elements. The predicate is invoked\n     * with three arguments: (value, index, array).\n     *\n     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n     * to pull elements from an array by value.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = [1, 2, 3, 4];\n     * var evens = _.remove(array, function(n) {\n     *   return n % 2 == 0;\n     * });\n     *\n     * console.log(array);\n     * // => [1, 3]\n     *\n     * console.log(evens);\n     * // => [2, 4]\n     */\n    function remove(array, predicate) {\n      var result = [];\n      if (!(array && array.length)) {\n        return result;\n      }\n      var index = -1,\n          indexes = [],\n          length = array.length;\n\n      predicate = getIteratee(predicate, 3);\n      while (++index < length) {\n        var value = array[index];\n        if (predicate(value, index, array)) {\n          result.push(value);\n          indexes.push(index);\n        }\n      }\n      basePullAt(array, indexes);\n      return result;\n    }\n\n    /**\n     * Reverses `array` so that the first element becomes the last, the second\n     * element becomes the second to last, and so on.\n     *\n     * **Note:** This method mutates `array` and is based on\n     * [`Array#reverse`](https://mdn.io/Array/reverse).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.reverse(array);\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\n\n    /**\n     * Creates a slice of `array` from `start` up to, but not including, `end`.\n     *\n     * **Note:** This method is used instead of\n     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n     * returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function slice(array, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n        start = 0;\n        end = length;\n      }\n      else {\n        start = start == null ? 0 : toInteger(start);\n        end = end === undefined ? length : toInteger(end);\n      }\n      return baseSlice(array, start, end);\n    }\n\n    /**\n     * Uses a binary search to determine the lowest index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedIndex([30, 50], 40);\n     * // => 1\n     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 0\n     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 1\n     */\n    function sortedIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value);\n        if (index < length && eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it returns the highest\n     * index at which `value` should be inserted into `array` in order to\n     * maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n     * // => 4\n     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\n\n    /**\n     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 1\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 1\n     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\n\n    /**\n     * This method is like `_.lastIndexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 3\n     */\n    function sortedLastIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value, true) - 1;\n        if (eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.uniq` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniq([1, 1, 2]);\n     * // => [1, 2]\n     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\n\n    /**\n     * This method is like `_.uniqBy` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n     * // => [1.1, 2.3]\n     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\n\n    /**\n     * Gets all but the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.tail([1, 2, 3]);\n     * // => [2, 3]\n     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.take([1, 2, 3]);\n     * // => [1]\n     *\n     * _.take([1, 2, 3], 2);\n     * // => [1, 2]\n     *\n     * _.take([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.take([1, 2, 3], 0);\n     * // => []\n     */\n    function take(array, n, guard) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.takeRight([1, 2, 3]);\n     * // => [3]\n     *\n     * _.takeRight([1, 2, 3], 2);\n     * // => [2, 3]\n     *\n     * _.takeRight([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.takeRight([1, 2, 3], 0);\n     * // => []\n     */\n    function takeRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the end. Elements are\n     * taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.takeRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeRightWhile(users, ['active', false]);\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeRightWhile(users, 'active');\n     * // => []\n     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the beginning. Elements\n     * are taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.takeWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeWhile(users, ['active', false]);\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeWhile(users, 'active');\n     * // => []\n     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\n\n    /**\n     * Creates an array of unique values, in order, from all given arrays using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.union([2], [1, 2]);\n     * // => [2, 1]\n     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which uniqueness is computed. Result values are chosen from the first\n     * array in which the value occurs. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    var unionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `comparator` which\n     * is invoked to compare elements of `arrays`. Result values are chosen from\n     * the first array in which the value occurs. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.unionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var unionWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n    });\n\n    /**\n     * Creates a duplicate-free version of an array, using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons, in which only the first occurrence of each element\n     * is kept. The order of result values is determined by the order they occur\n     * in the array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniq([2, 1, 2]);\n     * // => [2, 1]\n     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * uniqueness is computed. The order of result values is determined by the\n     * order they occur in the array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `comparator` which\n     * is invoked to compare elements of `array`. The order of result values is\n     * determined by the order they occur in the array.The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.uniqWith(objects, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts an array of grouped\n     * elements and creates an array regrouping the elements to their pre-zip\n     * configuration.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.2.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     *\n     * _.unzip(zipped);\n     * // => [['a', 'b'], [1, 2], [true, false]]\n     */\n    function unzip(array) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var length = 0;\n      array = arrayFilter(array, function(group) {\n        if (isArrayLikeObject(group)) {\n          length = nativeMax(group.length, length);\n          return true;\n        }\n      });\n      return baseTimes(length, function(index) {\n        return arrayMap(array, baseProperty(index));\n      });\n    }\n\n    /**\n     * This method is like `_.unzip` except that it accepts `iteratee` to specify\n     * how regrouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  regrouped values.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n     * // => [[1, 10, 100], [2, 20, 200]]\n     *\n     * _.unzipWith(zipped, _.add);\n     * // => [3, 30, 300]\n     */\n    function unzipWith(array, iteratee) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var result = unzip(array);\n      if (iteratee == null) {\n        return result;\n      }\n      return arrayMap(result, function(group) {\n        return apply(iteratee, undefined, group);\n      });\n    }\n\n    /**\n     * Creates an array excluding all given values using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.pull`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...*} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.xor\n     * @example\n     *\n     * _.without([2, 1, 2, 3], 1, 2);\n     * // => [3]\n     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\n\n    /**\n     * Creates an array of unique values that is the\n     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n     * of the given arrays. The order of result values is determined by the order\n     * they occur in the arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.without\n     * @example\n     *\n     * _.xor([2, 1], [2, 3]);\n     * // => [1, 3]\n     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which by which they're compared. The order of result values is determined\n     * by the order they occur in the arrays. The iteratee is invoked with one\n     * argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2, 3.4]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `comparator` which is\n     * invoked to compare elements of `arrays`. The order of result values is\n     * determined by the order they occur in the arrays. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.xorWith(objects, others, _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var xorWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n    });\n\n    /**\n     * Creates an array of grouped elements, the first of which contains the\n     * first elements of the given arrays, the second of which contains the\n     * second elements of the given arrays, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     */\n    var zip = baseRest(unzip);\n\n    /**\n     * This method is like `_.fromPairs` except that it accepts two arrays,\n     * one of property identifiers and one of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.4.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObject(['a', 'b'], [1, 2]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\n\n    /**\n     * This method is like `_.zipObject` except that it supports property paths.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts `iteratee` to specify\n     * how grouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  grouped values.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n     *   return a + b + c;\n     * });\n     * // => [111, 222]\n     */\n    var zipWith = baseRest(function(arrays) {\n      var length = arrays.length,\n          iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n      return unzipWith(arrays, iteratee);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     *\n     * // Combining several predicates using `_.overEvery` or `_.overSome`.\n     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n     * // => objects for ['fred', 'barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning the first element\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': true },\n     *   { 'user': 'fred',    'age': 40, 'active': false },\n     *   { 'user': 'pebbles', 'age': 1,  'active': true }\n     * ];\n     *\n     * _.find(users, function(o) { return o.age < 40; });\n     * // => object for 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.find(users, { 'age': 1, 'active': true });\n     * // => object for 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.find(users, ['active', false]);\n     * // => object for 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.find(users, 'active');\n     * // => object for 'barney'\n     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\n\n    /**\n     * Creates an array of values by running each element in `collection` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n     *\n     * The guarded methods are:\n     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * _.map([4, 8], square);\n     * // => [16, 64]\n     *\n     * _.map({ 'a': 4, 'b': 8 }, square);\n     * // => [16, 64] (iteration order is not guaranteed)\n     *\n     * var users = [\n     *   { 'user': 'barney' },\n     *   { 'user': 'fred' }\n     * ];\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, 'user');\n     * // => ['barney', 'fred']\n     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\n\n    /**\n     * Gets the size of `collection` by returning its length for array-like\n     * values or the number of own enumerable string keyed properties for objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @returns {number} Returns the collection size.\n     * @example\n     *\n     * _.size([1, 2, 3]);\n     * // => 3\n     *\n     * _.size({ 'a': 1, 'b': 2 });\n     * // => 2\n     *\n     * _.size('pebbles');\n     * // => 7\n     */\n    function size(collection) {\n      if (collection == null) {\n        return 0;\n      }\n      if (isArrayLike(collection)) {\n        return isString(collection) ? stringSize(collection) : collection.length;\n      }\n      var tag = getTag(collection);\n      if (tag == mapTag || tag == setTag) {\n        return collection.size;\n      }\n      return baseKeys(collection).length;\n    }\n\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Creates an array of elements, sorted in ascending order by the results of\n     * running each element in a collection thru each iteratee. This method\n     * performs a stable sort, that is, it preserves the original sort order of\n     * equal elements. The iteratees are invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 30 },\n     *   { 'user': 'barney', 'age': 34 }\n     * ];\n     *\n     * _.sortBy(users, [function(o) { return o.user; }]);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n     */\n    var sortBy = baseRest(function(collection, iteratees) {\n      if (collection == null) {\n        return [];\n      }\n      var length = iteratees.length;\n      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n        iteratees = [];\n      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n        iteratees = [iteratees[0]];\n      }\n      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Gets the timestamp of the number of milliseconds that have elapsed since\n     * the Unix epoch (1 January 1970 00:00:00 UTC).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Date\n     * @returns {number} Returns the timestamp.\n     * @example\n     *\n     * _.defer(function(stamp) {\n     *   console.log(_.now() - stamp);\n     * }, _.now());\n     * // => Logs the number of milliseconds it took for the deferred invocation.\n     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\n\n    /**\n     * Creates a function that memoizes the result of `func`. If `resolver` is\n     * provided, it determines the cache key for storing the result based on the\n     * arguments provided to the memoized function. By default, the first argument\n     * provided to the memoized function is used as the map cache key. The `func`\n     * is invoked with the `this` binding of the memoized function.\n     *\n     * **Note:** The cache is exposed as the `cache` property on the memoized\n     * function. Its creation may be customized by replacing the `_.memoize.Cache`\n     * constructor with one whose instances implement the\n     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to have its output memoized.\n     * @param {Function} [resolver] The function to resolve the cache key.\n     * @returns {Function} Returns the new memoized function.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     * var other = { 'c': 3, 'd': 4 };\n     *\n     * var values = _.memoize(_.values);\n     * values(object);\n     * // => [1, 2]\n     *\n     * values(other);\n     * // => [3, 4]\n     *\n     * object.a = 2;\n     * values(object);\n     * // => [1, 2]\n     *\n     * // Modify the result cache.\n     * values.cache.set(object, ['a', 'b']);\n     * values(object);\n     * // => ['a', 'b']\n     *\n     * // Replace `_.memoize.Cache`.\n     * _.memoize.Cache = WeakMap;\n     */\n    function memoize(func, resolver) {\n      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var memoized = function() {\n        var args = arguments,\n            key = resolver ? resolver.apply(this, args) : args[0],\n            cache = memoized.cache;\n\n        if (cache.has(key)) {\n          return cache.get(key);\n        }\n        var result = func.apply(this, args);\n        memoized.cache = cache.set(key, result) || cache;\n        return result;\n      };\n      memoized.cache = new (memoize.Cache || MapCache);\n      return memoized;\n    }\n\n    // Expose `MapCache`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * This method is like `_.clone` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.clone\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var deep = _.cloneDeep(objects);\n     * console.log(deep[0] === objects[0]);\n     * // => false\n     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\n    /**\n     * Performs a\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * comparison between two values to determine if they are equivalent.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.eq(object, object);\n     * // => true\n     *\n     * _.eq(object, other);\n     * // => false\n     *\n     * _.eq('a', 'a');\n     * // => true\n     *\n     * _.eq('a', Object('a'));\n     * // => false\n     *\n     * _.eq(NaN, NaN);\n     * // => true\n     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\n\n    /**\n     * Checks if `value` is likely an `arguments` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArguments(function() { return arguments; }());\n     * // => true\n     *\n     * _.isArguments([1, 2, 3]);\n     * // => false\n     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n    /**\n     * Checks if `value` is array-like. A value is considered array-like if it's\n     * not a function and has a `value.length` that's an integer greater than or\n     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n     * @example\n     *\n     * _.isArrayLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLike(document.body.children);\n     * // => true\n     *\n     * _.isArrayLike('abc');\n     * // => true\n     *\n     * _.isArrayLike(_.noop);\n     * // => false\n     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\n\n    /**\n     * This method is like `_.isArrayLike` except that it also checks if `value`\n     * is an object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array-like object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArrayLikeObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLikeObject(document.body.children);\n     * // => true\n     *\n     * _.isArrayLikeObject('abc');\n     * // => false\n     *\n     * _.isArrayLikeObject(_.noop);\n     * // => false\n     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\n\n    /**\n     * Checks if `value` is a buffer.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n     * @example\n     *\n     * _.isBuffer(new Buffer(2));\n     * // => true\n     *\n     * _.isBuffer(new Uint8Array(2));\n     * // => false\n     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Function` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n     * @example\n     *\n     * _.isFunction(_);\n     * // => true\n     *\n     * _.isFunction(/abc/);\n     * // => false\n     */\n    function isFunction(value) {\n      if (!isObject(value)) {\n        return false;\n      }\n      // The use of `Object#toString` avoids issues with the `typeof` operator\n      // in Safari 9 which returns 'object' for typed arrays and other constructors.\n      var tag = baseGetTag(value);\n      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n    }\n\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like length.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n     * @example\n     *\n     * _.isLength(3);\n     * // => true\n     *\n     * _.isLength(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isLength(Infinity);\n     * // => false\n     *\n     * _.isLength('3');\n     * // => false\n     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is the\n     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n     * @example\n     *\n     * _.isObject({});\n     * // => true\n     *\n     * _.isObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isObject(_.noop);\n     * // => true\n     *\n     * _.isObject(null);\n     * // => false\n     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"object\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\n\n    /**\n     * Checks if `value` is classified as a `Map` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     * @example\n     *\n     * _.isMap(new Map);\n     * // => true\n     *\n     * _.isMap(new WeakMap);\n     * // => false\n     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\n\n    /**\n     * Checks if `value` is a plain object, that is, an object created by the\n     * `Object` constructor or one with a `[[Prototype]]` of `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.8.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * _.isPlainObject(new Foo);\n     * // => false\n     *\n     * _.isPlainObject([1, 2, 3]);\n     * // => false\n     *\n     * _.isPlainObject({ 'x': 0, 'y': 0 });\n     * // => true\n     *\n     * _.isPlainObject(Object.create(null));\n     * // => true\n     */\n    function isPlainObject(value) {\n      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n        return false;\n      }\n      var proto = getPrototype(value);\n      if (proto === null) {\n        return true;\n      }\n      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n        funcToString.call(Ctor) == objectCtorString;\n    }\n\n    /**\n     * Checks if `value` is classified as a `RegExp` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Set` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     * @example\n     *\n     * _.isSet(new Set);\n     * // => true\n     *\n     * _.isSet(new WeakSet);\n     * // => false\n     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n    /**\n     * Checks if `value` is classified as a `String` primitive or object.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n     * @example\n     *\n     * _.isString('abc');\n     * // => true\n     *\n     * _.isString(1);\n     * // => false\n     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Symbol` primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n     * @example\n     *\n     * _.isSymbol(Symbol.iterator);\n     * // => true\n     *\n     * _.isSymbol('abc');\n     * // => false\n     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a typed array.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     * @example\n     *\n     * _.isTypedArray(new Uint8Array);\n     * // => true\n     *\n     * _.isTypedArray([]);\n     * // => false\n     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\n\n    /**\n     * Converts `value` to a finite number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.12.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted number.\n     * @example\n     *\n     * _.toFinite(3.2);\n     * // => 3.2\n     *\n     * _.toFinite(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toFinite(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toFinite('3.2');\n     * // => 3.2\n     */\n    function toFinite(value) {\n      if (!value) {\n        return value === 0 ? value : 0;\n      }\n      value = toNumber(value);\n      if (value === INFINITY || value === -INFINITY) {\n        var sign = (value < 0 ? -1 : 1);\n        return sign * MAX_INTEGER;\n      }\n      return value === value ? value : 0;\n    }\n\n    /**\n     * Converts `value` to an integer.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toInteger(3.2);\n     * // => 3\n     *\n     * _.toInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toInteger(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toInteger('3.2');\n     * // => 3\n     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\n\n    /**\n     * Converts `value` to an integer suitable for use as the length of an\n     * array-like object.\n     *\n     * **Note:** This method is based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toLength(3.2);\n     * // => 3\n     *\n     * _.toLength(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toLength(Infinity);\n     * // => 4294967295\n     *\n     * _.toLength('3.2');\n     * // => 3\n     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\n\n    /**\n     * Converts `value` to a number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     * @example\n     *\n     * _.toNumber(3.2);\n     * // => 3.2\n     *\n     * _.toNumber(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toNumber(Infinity);\n     * // => Infinity\n     *\n     * _.toNumber('3.2');\n     * // => 3.2\n     */\n    function toNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      if (isObject(value)) {\n        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n        value = isObject(other) ? (other + '') : other;\n      }\n      if (typeof value != 'string') {\n        return value === 0 ? value : +value;\n      }\n      value = baseTrim(value);\n      var isBinary = reIsBinary.test(value);\n      return (isBinary || reIsOctal.test(value))\n        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n        : (reIsBadHex.test(value) ? NAN : +value);\n    }\n\n    /**\n     * Converts `value` to a plain object flattening inherited enumerable string\n     * keyed properties of `value` to own properties of the plain object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Object} Returns the converted plain object.\n     * @example\n     *\n     * function Foo() {\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.assign({ 'a': 1 }, new Foo);\n     * // => { 'a': 1, 'b': 2 }\n     *\n     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n     * // => { 'a': 1, 'b': 2, 'c': 3 }\n     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\n\n    /**\n     * Converts `value` to a string. An empty string is returned for `null`\n     * and `undefined` values. The sign of `-0` is preserved.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.toString(null);\n     * // => ''\n     *\n     * _.toString(-0);\n     * // => '-0'\n     *\n     * _.toString([1, 2, 3]);\n     * // => '1,2,3'\n     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\n\n    /**\n     * Assigns own and inherited enumerable string keyed properties of source\n     * objects to the destination object for all destination properties that\n     * resolve to `undefined`. Source objects are applied from left to right.\n     * Once a property is set, additional values of the same property are ignored.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaultsDeep\n     * @example\n     *\n     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var defaults = baseRest(function(object, sources) {\n      object = Object(object);\n\n      var index = -1;\n      var length = sources.length;\n      var guard = length > 2 ? sources[2] : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        length = 1;\n      }\n\n      while (++index < length) {\n        var source = sources[index];\n        var props = keysIn(source);\n        var propsIndex = -1;\n        var propsLength = props.length;\n\n        while (++propsIndex < propsLength) {\n          var key = props[propsIndex];\n          var value = object[key];\n\n          if (value === undefined ||\n              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n            object[key] = source[key];\n          }\n        }\n      }\n\n      return object;\n    });\n\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\n\n    /**\n     * Iterates over own and inherited enumerable string keyed properties of an\n     * object and invokes `iteratee` for each property. The iteratee is invoked\n     * with three arguments: (value, key, object). Iteratee functions may exit\n     * iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forInRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forIn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * Iterates over own enumerable string keyed properties of an object and\n     * invokes `iteratee` for each property. The iteratee is invoked with three\n     * arguments: (value, key, object). Iteratee functions may exit iteration\n     * early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwnRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\n\n    /**\n     * Gets the value at `path` of `object`. If the resolved value is\n     * `undefined`, the `defaultValue` is returned in its place.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.get(object, 'a[0].b.c');\n     * // => 3\n     *\n     * _.get(object, ['a', '0', 'b', 'c']);\n     * // => 3\n     *\n     * _.get(object, 'a.b.c', 'default');\n     * // => 'default'\n     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\n\n    /**\n     * Checks if `path` is a direct property of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = { 'a': { 'b': 2 } };\n     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.has(object, 'a');\n     * // => true\n     *\n     * _.has(object, 'a.b');\n     * // => true\n     *\n     * _.has(object, ['a', 'b']);\n     * // => true\n     *\n     * _.has(other, 'a');\n     * // => false\n     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\n\n    /**\n     * Checks if `path` is a direct or inherited property of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.hasIn(object, 'a');\n     * // => true\n     *\n     * _.hasIn(object, 'a.b');\n     * // => true\n     *\n     * _.hasIn(object, ['a', 'b']);\n     * // => true\n     *\n     * _.hasIn(object, 'b');\n     * // => false\n     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\n\n    /**\n     * Creates an array of the own enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects. See the\n     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * for more details.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keys(new Foo);\n     * // => ['a', 'b'] (iteration order is not guaranteed)\n     *\n     * _.keys('hi');\n     * // => ['0', '1']\n     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keysIn(new Foo);\n     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\n\n    /**\n     * Creates an object with the same keys as `object` and values generated\n     * by running each own enumerable string keyed property of `object` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapKeys\n     * @example\n     *\n     * var users = {\n     *   'fred':    { 'user': 'fred',    'age': 40 },\n     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n     * };\n     *\n     * _.mapValues(users, function(o) { return o.age; });\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.mapValues(users, 'age');\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\n\n    /**\n     * This method is like `_.assign` except that it recursively merges own and\n     * inherited enumerable string keyed properties of source objects into the\n     * destination object. Source properties that resolve to `undefined` are\n     * skipped if a destination value exists. Array and plain object properties\n     * are merged recursively. Other objects and value types are overridden by\n     * assignment. Source objects are applied from left to right. Subsequent\n     * sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {\n     *   'a': [{ 'b': 2 }, { 'd': 4 }]\n     * };\n     *\n     * var other = {\n     *   'a': [{ 'c': 3 }, { 'e': 5 }]\n     * };\n     *\n     * _.merge(object, other);\n     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\n\n    /**\n     * Creates an object composed of the picked `object` properties.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pick(object, ['a', 'c']);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n      // and escape the comment, thus injecting code that gets evaled.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/\\s/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Throw an error if a forbidden character was found in `variable`, to prevent\n      // potential command injection attacks.\n      else if (reForbiddenIdentifierChars.test(variable)) {\n        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n      }\n\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return baseTrim(string);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.slice(0, trimmedEndIndex(string) + 1);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     *\n     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","\"use strict\";\n\nmodule.exports.adjustRangeToDeletionOfAnotherRange = require(\"./adjustRangeToDeletionOfAnotherRange\");\nmodule.exports.adjustRangeToInsert = require(\"./adjustRangeToInsert\");\nmodule.exports.checkIfNonCircularRangesOverlap = require(\"./checkIfNonCircularRangesOverlap\");\nmodule.exports.checkIfPotentiallyCircularRangesOverlap = require(\"./checkIfPotentiallyCircularRangesOverlap\");\nmodule.exports.collapseOverlapsGeneratedFromRangeComparisonIfPossible = require(\"./collapseOverlapsGeneratedFromRangeComparisonIfPossible\");\nmodule.exports.convertRangeIndices = require(\"./convertRangeIndices\");\nmodule.exports.convertRangeTo0Based = require(\"./convertRangeTo0Based\");\nmodule.exports.convertRangeTo1Based = require(\"./convertRangeTo1Based\");\nmodule.exports.doesRangeSpanEntireSequence = require(\"./doesRangeSpanEntireSequence\");\nmodule.exports.isRangeOrPositionWithinRange = require(\"./isRangeOrPositionWithinRange\");\nmodule.exports.doesRangeSpanOrigin = require(\"./doesRangeSpanOrigin\");\nmodule.exports.expandOrContractCircularRangeToPosition = require(\"./expandOrContractCircularRangeToPosition\");\nmodule.exports.expandOrContractNonCircularRangeToPosition = require(\"./expandOrContractNonCircularRangeToPosition\");\nmodule.exports.expandOrContractRangeByLength = require(\"./expandOrContractRangeByLength\");\nmodule.exports.expandOrContractRangeToPosition = require(\"./expandOrContractRangeToPosition\");\nmodule.exports.flipContainedRange = require(\"./flipContainedRange\");\nmodule.exports.generateRandomRange = require(\"./generateRandomRange\");\nmodule.exports.getAnnotationRangeType = require(\"./getAnnotationRangeType\");\nmodule.exports.getEachPositionInRangeAsArray = require(\"./getEachPositionInRangeAsArray\");\nmodule.exports.getLengthOfOverlappingRegionsBetweenTwoRanges = require(\"./getLengthOfOverlappingRegionsBetweenTwoRanges\");\nmodule.exports.getOverlapOfNonCircularRanges = require(\"./getOverlapOfNonCircularRanges\");\nmodule.exports.getOverlapsOfPotentiallyCircularRanges = require(\"./getOverlapsOfPotentiallyCircularRanges\");\nmodule.exports.getPositionFromAngle = require(\"./getPositionFromAngle\");\nmodule.exports.getRangeAngles = require(\"./getRangeAngles\");\nmodule.exports.getRangeLength = require(\"./getRangeLength\");\nmodule.exports.getMiddleOfRange = require(\"./getMiddleOfRange\");\nmodule.exports.getRangesBetweenTwoRanges = require(\"./getRangesBetweenTwoRanges\");\nmodule.exports.getSequenceWithinRange = require(\"./getSequenceWithinRange\");\nmodule.exports.getShortestDistanceBetweenTwoPositions = require(\"./getShortestDistanceBetweenTwoPositions\");\nmodule.exports.getYOffsetForPotentiallyCircularRange = require(\"./getYOffsetForPotentiallyCircularRange\");\nmodule.exports.getYOffsetsForPotentiallyCircularRanges = require(\"./getYOffsetsForPotentiallyCircularRanges\");\nmodule.exports.invertRange = require(\"./invertRange\");\nmodule.exports.isPositionCloserToRangeStartThanRangeEnd = require(\"./isPositionCloserToRangeStartThanRangeEnd\");\nmodule.exports.isPositionWithinRange = require(\"./isPositionWithinRange\");\nmodule.exports.isRangeWithinRange = require(\"./isRangeWithinRange\");\nmodule.exports.loopEachPositionInRange = require(\"./loopEachPositionInRange\");\nmodule.exports.modulatePositionByRange = require(\"./modulatePositionByRange\");\nmodule.exports.modulateRangeBySequenceLength = require(\"./modulateRangeBySequenceLength\");\nmodule.exports.normalizePositionByRangeLength = require(\"./normalizePositionByRangeLength\");\nmodule.exports.normalizePositionByRangeLength1Based = require(\"./normalizePositionByRangeLength1Based\");\nmodule.exports.normalizeRange = require(\"./normalizeRange\");\nmodule.exports.provideInclusiveOptions = require(\"./provideInclusiveOptions\");\nmodule.exports.reversePositionInRange = require(\"./reversePositionInRange\");\nmodule.exports.splitRangeIntoTwoPartsIfItIsCircular = require(\"./splitRangeIntoTwoPartsIfItIsCircular\");\nmodule.exports.translateRange = require(\"./translateRange\");\nmodule.exports.trimNonCicularRangeByAnotherNonCircularRange = require(\"./trimNonCicularRangeByAnotherNonCircularRange\");\nmodule.exports.trimNumberToFitWithin0ToAnotherNumber = require(\"./trimNumberToFitWithin0ToAnotherNumber\");\nmodule.exports.trimRangeByAnotherRange = require(\"./trimRangeByAnotherRange\");\nmodule.exports.zeroSubrangeByContainerRange = require(\"./zeroSubrangeByContainerRange\");\nmodule.exports.adjustRangeToRotation = require(\"./adjustRangeToRotation\");\nmodule.exports.getZeroedRangeOverlaps = require(\"./getZeroedRangeOverlaps\");","\"use strict\";\n\n// var ac = require('ve-api-check');\n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nmodule.exports = function normalizePositionByRangeLength(pPosition, sequenceLength, isInBetweenPositions) {\n    //isInBetweenPositions refers to:\n    // A T G C\n    // 0 1 2 3    <--  isInBetweenPositions = false is counting the positions themselves\n    //0 1 2 3 4   <--  isInBetweenPositions = true is counting the spaces between positions\n    // ac.throw([ac.number, ac.posInt, ac.bool], arguments);\n    var position = pPosition;\n    if (position < 0) {\n        position += sequenceLength;\n    } else if (position + (isInBetweenPositions ? 0 : 1) > sequenceLength) {\n        position -= sequenceLength;\n    }\n    return position < 0 ? 0 : position > sequenceLength - (isInBetweenPositions ? 0 : 1) ? sequenceLength - (isInBetweenPositions ? 0 : 1) : position;\n};","module.exports = require(\"regenerator-runtime\");\n","\"use strict\";\n\nmodule.exports = [\"features\", \"warnings\", \"assemblyPieces\", \"lineageAnnotations\", \"parts\", \"cutsites\", \"orfs\", \"translations\", \"primers\", \"guides\"];\nmodule.exports.modifiableTypes = [\"features\", \"assemblyPieces\", \"lineageAnnotations\", \"warnings\", \"parts\", \"translations\", \"primers\", \"guides\"];","\"use strict\";\n\nvar DNAComplementMap = require(\"./DNAComplementMap\");\n// const ac = require('ve-api-check');\n// ac.throw([ac.string,ac.bool],arguments);\nmodule.exports = function getReverseComplementSequenceString(sequence) {\n  // ac.throw([ac.string],arguments);\n  var reverseComplementSequenceString = \"\";\n  for (var i = sequence.length - 1; i >= 0; i--) {\n    var revChar = DNAComplementMap[sequence[i]];\n    if (!revChar) {\n      revChar = sequence[i];\n      // throw new Error('trying to get the reverse compelement of an invalid base');\n    }\n    reverseComplementSequenceString += revChar;\n  }\n  return reverseComplementSequenceString;\n};","\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\n// tnrtodo: figure out where to insert this validation exactly..\nvar bsonObjectId = require(\"bson-objectid\");\nvar getAminoAcidDataForEachBaseOfDna = require(\"./getAminoAcidDataForEachBaseOfDna\");\n\nvar _require = require(\"lodash\"),\n    cloneDeep = _require.cloneDeep,\n    flatMap = _require.flatMap;\n\nvar annotationTypes = require(\"./annotationTypes\");\nvar filterSequenceString = require(\"./filterSequenceString\");\nvar tidyUpAnnotation = require(\"./tidyUpAnnotation\");\nvar filterAminoAcidSequenceString = require(\"./filterAminoAcidSequenceString\");\nvar getDegenerateDnaStringFromAaString = require(\"./getDegenerateDnaStringFromAAString\");\n\nmodule.exports = function tidyUpSequenceData(pSeqData) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var annotationsAsObjects = options.annotationsAsObjects,\n      logMessages = options.logMessages,\n      removeUnwantedChars = options.removeUnwantedChars,\n      additionalValidChars = options.additionalValidChars,\n      noTranslationData = options.noTranslationData,\n      charOverrides = options.charOverrides,\n      doNotProvideIdsForAnnotations = options.doNotProvideIdsForAnnotations,\n      proteinFilterOptions = options.proteinFilterOptions,\n      noCdsTranslations = options.noCdsTranslations,\n      convertAnnotationsFromAAIndices = options.convertAnnotationsFromAAIndices;\n\n  var seqData = cloneDeep(pSeqData); //sequence is usually immutable, so we clone it and return it\n  var response = {\n    messages: []\n  };\n  if (!seqData) {\n    seqData = {};\n  }\n  if (!seqData.sequence) {\n    seqData.sequence = \"\";\n  }\n  if (!seqData.proteinSequence) {\n    seqData.proteinSequence = \"\";\n  }\n  var needsBackTranslation = false;\n  if (seqData.isProtein) {\n    seqData.circular = false; //there are no circular proteins..\n    if (!seqData.proteinSequence && seqData.proteinSequence !== \"\") {\n      seqData.proteinSequence = seqData.sequence; //if there is no proteinSequence, assign seqData.sequence\n    }\n    if (!seqData.sequence || seqData.sequence.length !== seqData.proteinSequence.length * 3) {\n      //if we don't have a sequence or it is clear that the DNA sequence doesn't match the proteinSequence, add a back translation\n      needsBackTranslation = true;\n    }\n  }\n  if (seqData.isRna) {\n    //flip all t's to u's\n    seqData.sequence = seqData.sequence.replace(/t/gi, \"u\");\n  }\n  if (removeUnwantedChars) {\n    if (seqData.isProtein) {\n      seqData.proteinSequence = filterAminoAcidSequenceString(seqData.proteinSequence, _extends({ includeStopCodon: true }, proteinFilterOptions));\n    } else {\n      seqData.sequence = filterSequenceString(seqData.sequence, \"\" + (additionalValidChars || \"\") + (seqData.isRna || seqData.isMixedRnaAndDna ? \"u\" : \"\" //if it is rna or mixed, allow u's\n      ), charOverrides);\n    }\n  }\n  if (seqData.isProtein) {\n    if (needsBackTranslation) {\n      //backtranslate the AA sequence\n      seqData.sequence = getDegenerateDnaStringFromAaString(seqData.proteinSequence);\n    }\n    seqData.aminoAcidDataForEachBaseOfDNA = getAminoAcidDataForEachBaseOfDna(seqData.proteinSequence, true, null, true);\n  }\n\n  seqData.size = seqData.noSequence ? seqData.size : seqData.sequence.length;\n  seqData.proteinSize = seqData.noSequence ? seqData.proteinSize : seqData.proteinSequence.length;\n  if (seqData.circular === \"false\" ||\n  /* eslint-disable eqeqeq*/\n\n  seqData.circular == -1 ||\n  /* eslint-enable eqeqeq*/\n  seqData.circular === false || !seqData.circular && seqData.sequenceTypeCode !== \"CIRCULAR_DNA\") {\n    seqData.circular = false;\n  } else {\n    seqData.circular = true;\n  }\n\n  annotationTypes.forEach(function (annotationType) {\n    if (!Array.isArray(seqData[annotationType])) {\n      if (_typeof(seqData[annotationType]) === \"object\") {\n        seqData[annotationType] = Object.keys(seqData[annotationType]).map(function (key) {\n          return seqData[annotationType][key];\n        });\n      } else {\n        seqData[annotationType] = [];\n      }\n    }\n    seqData[annotationType] = seqData[annotationType].filter(function (annotation) {\n      return tidyUpAnnotation(annotation, _extends({}, options, {\n        sequenceData: seqData,\n        convertAnnotationsFromAAIndices: convertAnnotationsFromAAIndices,\n        mutative: true,\n        annotationType: annotationType\n      }));\n    });\n  });\n\n  if (!noTranslationData) {\n    seqData.translations = flatMap(seqData.translations, function (translation) {\n      if (noCdsTranslations && translation.translationType === \"CDS Feature\") {\n        //filter off cds translations\n        return [];\n      }\n      if (!translation.aminoAcids && !seqData.noSequence) {\n        translation.aminoAcids = getAminoAcidDataForEachBaseOfDna(seqData.sequence, translation.forward, translation);\n      }\n      return translation;\n    });\n  }\n\n  if (annotationsAsObjects) {\n    annotationTypes.forEach(function (name) {\n      seqData[name] = seqData[name].reduce(function (acc, item) {\n        var itemId = void 0;\n        if (item.id || item.id === 0) {\n          itemId = item.id;\n        } else {\n          itemId = bsonObjectId().str;\n          if (!doNotProvideIdsForAnnotations) {\n            item.id = itemId; //assign the newly created id to the item\n          }\n        }\n        acc[itemId] = item;\n        return acc;\n      }, {});\n    });\n  }\n  if (logMessages && response.messages.length > 0) {\n    console.info(\"tidyUpSequenceData messages:\", response.messages);\n  }\n  return seqData;\n};","\"use strict\";\n\nvar provideInclusiveOptions = require(\"./provideInclusiveOptions\");\nmodule.exports = provideInclusiveOptions(getRangeLength);\nfunction getRangeLength(range, rangeMax) {\n  var toRet = void 0;\n  if (range.end < range.start) {\n    toRet = rangeMax - range.start + range.end + 1;\n  } else {\n    toRet = range.end - range.start + 1;\n  }\n  if (range.overlapsSelf && rangeMax) {\n    toRet += rangeMax;\n  }\n  return toRet;\n}","\nvar MACHINE_ID = Math.floor(Math.random() * 0xFFFFFF);\nvar index = ObjectID.index = parseInt(Math.random() * 0xFFFFFF, 10);\nvar pid = (typeof process === 'undefined' || typeof process.pid !== 'number' ? Math.floor(Math.random() * 100000) : process.pid) % 0xFFFF;\n\n/**\n * Determine if an object is Buffer\n *\n * Author:   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * License:  MIT\n *\n */\nvar isBuffer = function (obj) {\n  return !!(\n  obj != null &&\n  obj.constructor &&\n  typeof obj.constructor.isBuffer === 'function' &&\n  obj.constructor.isBuffer(obj)\n  )\n};\n\n/**\n * Create a new immutable ObjectID instance\n *\n * @class Represents the BSON ObjectID type\n * @param {String|Number} arg Can be a 24 byte hex string, 12 byte binary string or a Number.\n * @return {Object} instance of ObjectID.\n */\nfunction ObjectID(arg) {\n  if(!(this instanceof ObjectID)) return new ObjectID(arg);\n  if(arg && ((arg instanceof ObjectID) || arg._bsontype===\"ObjectID\"))\n    return arg;\n\n  var buf;\n\n  if(isBuffer(arg) || (Array.isArray(arg) && arg.length===12)) {\n    buf = Array.prototype.slice.call(arg);\n  }\n  else if(typeof arg === \"string\") {\n    if(arg.length!==12 && !ObjectID.isValid(arg))\n      throw new Error(\"Argument passed in must be a single String of 12 bytes or a string of 24 hex characters\");\n\n    buf = buffer(arg);\n  }\n  else if(/number|undefined/.test(typeof arg)) {\n    buf = buffer(generate(arg));\n  }\n\n  Object.defineProperty(this, \"id\", {\n    enumerable: true,\n    get: function() { return String.fromCharCode.apply(this, buf); }\n  });\n  Object.defineProperty(this, \"str\", {\n    get: function() { return buf.map(hex.bind(this, 2)).join(''); }\n  });\n}\nmodule.exports = ObjectID;\nObjectID.generate = generate;\nObjectID.default = ObjectID;\n\n/**\n * Creates an ObjectID from a second based number, with the rest of the ObjectID zeroed out. Used for comparisons or sorting the ObjectID.\n *\n * @param {Number} time an integer number representing a number of seconds.\n * @return {ObjectID} return the created ObjectID\n * @api public\n */\nObjectID.createFromTime = function(time){\n  time = parseInt(time, 10) % 0xFFFFFFFF;\n  return new ObjectID(hex(8,time)+\"0000000000000000\");\n};\n\n/**\n * Creates an ObjectID from a hex string representation of an ObjectID.\n *\n * @param {String} hexString create a ObjectID from a passed in 24 byte hexstring.\n * @return {ObjectID} return the created ObjectID\n * @api public\n */\nObjectID.createFromHexString = function(hexString) {\n  if(!ObjectID.isValid(hexString))\n    throw new Error(\"Invalid ObjectID hex string\");\n\n  return new ObjectID(hexString);\n};\n\n/**\n * Checks if a value is a valid bson ObjectId\n *\n * @param {String} objectid Can be a 24 byte hex string or an instance of ObjectID.\n * @return {Boolean} return true if the value is a valid bson ObjectID, return false otherwise.\n * @api public\n *\n * THE NATIVE DOCUMENTATION ISN'T CLEAR ON THIS GUY!\n * http://mongodb.github.io/node-mongodb-native/api-bson-generated/objectid.html#objectid-isvalid\n */\nObjectID.isValid = function(objectid) {\n  if(!objectid || (typeof objectid !== 'string' && (typeof objectid !== 'object' || Array.isArray(objectid) || typeof objectid.toString !== 'function'))) return false;\n\n  //call .toString() to get the hex if we're\n  // working with an instance of ObjectID\n  return /^[0-9A-F]{24}$/i.test(objectid.toString());\n};\n\n/**\n * set a custom machineID\n * \n * @param {String|Number} machineid Can be a string, hex-string or a number\n * @return {void}\n * @api public\n */\nObjectID.setMachineID = function(arg) {\n  var machineID;\n\n  if(typeof arg === \"string\") {\n    // hex string\n    machineID = parseInt(arg, 16);\n   \n    // any string\n    if(isNaN(machineID)) {\n      arg = ('000000' + arg).substr(-7,6);\n\n      machineID = \"\";\n      for(var i = 0;i<6; i++) {\n        machineID += (arg.charCodeAt(i));\n      }\n    }\n  }\n  else if(/number|undefined/.test(typeof arg)) {\n    machineID = arg | 0;\n  }\n\n  MACHINE_ID = (machineID & 0xFFFFFF);\n}\n\n/**\n * get the machineID\n * \n * @return {number}\n * @api public\n */\nObjectID.getMachineID = function() {\n  return MACHINE_ID;\n}\n\nObjectID.prototype = {\n  _bsontype: 'ObjectID',\n  constructor: ObjectID,\n\n  /**\n   * Return the ObjectID id as a 24 byte hex string representation\n   *\n   * @return {String} return the 24 byte hex string representation.\n   * @api public\n   */\n  toHexString: function() {\n    return this.str;\n  },\n\n  /**\n   * Compares the equality of this ObjectID with `otherID`.\n   *\n   * @param {Object} other ObjectID instance to compare against.\n   * @return {Boolean} the result of comparing two ObjectID's\n   * @api public\n   */\n  equals: function (other){\n    return !!other && this.str === other.toString();\n  },\n\n  /**\n   * Returns the generation date (accurate up to the second) that this ID was generated.\n   *\n   * @return {Date} the generation date\n   * @api public\n   */\n  getTimestamp: function(){\n    return new Date(parseInt(this.str.substr(0,8), 16) * 1000);\n  }\n};\n\nfunction next() {\n  return index = (index+1) % 0xFFFFFF;\n}\n\nfunction generate(time) {\n  if (typeof time !== 'number')\n    time = Date.now()/1000;\n\n  //keep it in the ring!\n  time = parseInt(time, 10) % 0xFFFFFFFF;\n\n  //FFFFFFFF FFFFFF FFFF FFFFFF\n  return hex(8,time) + hex(6,MACHINE_ID) + hex(4,pid) + hex(6,next());\n}\n\nfunction hex(length, n) {\n  n = n.toString(16);\n  return (n.length===length)? n : \"00000000\".substring(n.length, length) + n;\n}\n\nfunction buffer(str) {\n  var i=0,out=[];\n\n  if(str.length===24)\n    for(;i<24; out.push(parseInt(str[i]+str[i+1], 16)),i+=2);\n\n  else if(str.length===12)\n    for(;i<12; out.push(str.charCodeAt(i)),i++);\n\n  return out;\n}\n\nvar inspect = (Symbol && Symbol.for('nodejs.util.inspect.custom')) || 'inspect';\n\n/**\n * Converts to a string representation of this Id.\n *\n * @return {String} return the 24 byte hex string representation.\n * @api private\n */\nObjectID.prototype[inspect] = function() { return \"ObjectID(\"+this+\")\" };\nObjectID.prototype.toJSON = ObjectID.prototype.toHexString;\nObjectID.prototype.toString = ObjectID.prototype.toHexString;\n","\"use strict\";\n\n// var ac = require('ve-api-check'); \n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\n//takes a potentially circular range and returns an array containing the range split on the origin\nmodule.exports = function splitRangeIntoTwoPartsIfItIsCircular(range, sequenceLength) {\n    // ac.throw([ac.range, ac.number], arguments);\n    if (sequenceLength !== 0) {\n        sequenceLength = sequenceLength || Infinity;\n    }\n    var ranges = [];\n    if (range.start > range.end) {\n        //the range is cicular, so we return an array of two ranges\n        ranges.push({\n            start: 0,\n            end: range.end,\n            type: \"end\"\n        });\n        ranges.push({\n            start: range.start,\n            end: sequenceLength - 1,\n            type: \"beginning\"\n        });\n    } else {\n        //the range isn't circular, so we just return the range\n        ranges.push({\n            start: range.start,\n            end: range.end,\n            type: \"beginningAndEnd\"\n        });\n    }\n    return ranges;\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    flatMap = _require.flatMap;\n\nvar splitRangeIntoTwoPartsIfItIsCircular = require(\"./splitRangeIntoTwoPartsIfItIsCircular\");\nvar getOverlapOfNonCircularRanges = require(\"./getOverlapOfNonCircularRanges\");\n//returns an array of the overlaps between two potentially circular ranges\nmodule.exports = function getOverlapsOfPotentiallyCircularRanges(rangeA, rangeB, maxRangeLength, joinIfPossible //by default this fn only returns **non-circular** overlaps, if true it will try to join overlaps split on the origin\n) {\n  var normalizedRangeA = splitRangeIntoTwoPartsIfItIsCircular(rangeA, maxRangeLength);\n  var normalizedRangeB = splitRangeIntoTwoPartsIfItIsCircular(rangeB, maxRangeLength);\n\n  var overlaps = [];\n\n  normalizedRangeA.forEach(function (nonCircularRangeA, iA) {\n    normalizedRangeB.forEach(function (nonCircularRangeB, iB) {\n      var overlap = getOverlapOfNonCircularRanges(nonCircularRangeA, nonCircularRangeB);\n      if (overlap) {\n        overlaps.push(overlap);\n      }\n    });\n  });\n  if (joinIfPossible && normalizedRangeA.length === 2 && normalizedRangeB.length === 2 && maxRangeLength) {\n    //we have 2 circular ranges that will have gotten split on the origin, so we'll manually mend those pieces back together\n    var joinedOverlap = {};\n    overlaps = flatMap(overlaps, function (o, i) {\n      if (o.start === 0) {\n        joinedOverlap.end = o.end;\n        return [];\n      } else if (o.end === maxRangeLength - 1) {\n        joinedOverlap.start = o.start;\n        return [];\n      }\n    });\n    overlaps.push(joinedOverlap);\n  }\n  return overlaps;\n};","\"use strict\";\n\nmodule.exports = {\n  A: {\n    value: \"A\",\n    name: \"Alanine\",\n    threeLettersName: \"Ala\",\n    hydrophobicity: 1.8,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(327.3, 100%, 69%)\",\n    mass: 89.1\n  },\n  R: {\n    value: \"R\",\n    name: \"Arginine\",\n    threeLettersName: \"Arg\",\n    hydrophobicity: -4.5,\n    colorByFamily: \"#FFC0CB\",\n    color: \"hsl(258.1, 100%, 69%)\",\n    mass: 174.2\n  },\n  N: {\n    value: \"N\",\n    name: \"Asparagine\",\n    threeLettersName: \"Asn\",\n    hydrophobicity: -3.5,\n    colorByFamily: \"#D3D3D3\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    mass: 132.1\n  },\n  D: {\n    value: \"D\",\n    name: \"Aspartic acid\",\n    threeLettersName: \"Asp\",\n    hydrophobicity: -3.5,\n    colorByFamily: \"#EE82EE\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    mass: 133.1\n  },\n  C: {\n    value: \"C\",\n    name: \"Cysteine\",\n    threeLettersName: \"Cys\",\n    hydrophobicity: 2.5,\n    colorByFamily: \"#FFFF00\",\n    color: \"hsl(335.1, 100%, 69%)\",\n    mass: 121.2\n  },\n  E: {\n    value: \"E\",\n    name: \"Glutamic acid\",\n    threeLettersName: \"Glu\",\n    hydrophobicity: -3.5,\n    colorByFamily: \"#EE82EE\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    mass: 147.1\n  },\n  Q: {\n    value: \"Q\",\n    name: \"Glutamine\",\n    threeLettersName: \"Gln\",\n    hydrophobicity: -3.5,\n    colorByFamily: \"#D3D3D3\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    mass: 146.2\n  },\n  G: {\n    value: \"G\",\n    name: \"Glycine\",\n    threeLettersName: \"Gly\",\n    hydrophobicity: -0.4,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(303.1, 100%, 69%)\",\n    mass: 75.1\n  },\n  H: {\n    value: \"H\",\n    name: \"Histidine\",\n    threeLettersName: \"His\",\n    hydrophobicity: -3.2,\n    colorByFamily: \"#FFC0CB\",\n    color: \"hsl(272.2, 100%, 69%)\",\n    mass: 155.2\n  },\n  I: {\n    value: \"I\",\n    name: \"Isoleucine \",\n    threeLettersName: \"Ile\",\n    hydrophobicity: 4.5,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(356.9, 100%, 69%)\",\n    mass: 131.2\n  },\n  L: {\n    value: \"L\",\n    name: \"Leucine\",\n    threeLettersName: \"Leu\",\n    hydrophobicity: 3.8,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(349.4, 100%, 69%)\",\n    mass: 131.2\n  },\n  K: {\n    value: \"K\",\n    name: \"Lysine\",\n    threeLettersName: \"Lys\",\n    hydrophobicity: -3.9,\n    colorByFamily: \"#FFC0CB\",\n    color: \"hsl(264.7, 100%, 69%)\",\n    mass: 146.2\n  },\n  M: {\n    value: \"M\",\n    name: \"Methionine\",\n    threeLettersName: \"Met\",\n    hydrophobicity: 1.9,\n    colorByFamily: \"#FFFF00\",\n    color: \"hsl(328.5, 100%, 69%)\",\n    mass: 149.2\n  },\n  F: {\n    value: \"F\",\n    name: \"Phenylalanine\",\n    threeLettersName: \"Phe\",\n    hydrophobicity: 2.8,\n    colorByFamily: \"#FFA500\",\n    color: \"hsl(338.4, 100%, 69%)\",\n    mass: 165.2\n  },\n  P: {\n    value: \"P\",\n    name: \"Proline\",\n    threeLettersName: \"Pro\",\n    hydrophobicity: -1.6,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(289.9, 100%, 69%)\",\n    mass: 115.1\n  },\n  S: {\n    value: \"S\",\n    name: \"Serine\",\n    threeLettersName: \"Ser\",\n    hydrophobicity: -0.8,\n    colorByFamily: \"#90EE90\",\n    color: \"hsl(298.6, 100%, 69%)\",\n    mass: 105.1\n  },\n  T: {\n    value: \"T\",\n    name: \"Threonine\",\n    threeLettersName: \"Thr\",\n    hydrophobicity: -0.7,\n    colorByFamily: \"#90EE90\",\n    color: \"hsl(299.8, 100%, 69%)\",\n    mass: 119.1\n  },\n  U: {\n    value: \"U\",\n    name: \"Selenocysteine\",\n    threeLettersName: \"Sec\",\n    colorByFamily: \"#FF0000\",\n    color: \"hsl(0, 100%, 69%)\",\n    mass: 168.1\n  },\n  W: {\n    value: \"W\",\n    name: \"Tryptophan\",\n    threeLettersName: \"Trp\",\n    hydrophobicity: -0.9,\n    colorByFamily: \"#FFA500\",\n    color: \"hsl(297.6, 100%, 69%)\",\n    mass: 204.2\n  },\n  Y: {\n    value: \"Y\",\n    name: \"Tyrosine\",\n    threeLettersName: \"Tyr\",\n    hydrophobicity: -1.3,\n    colorByFamily: \"#FFA500\",\n    color: \"hsl(293.2, 100%, 69%)\",\n    mass: 181.2\n  },\n  V: {\n    value: \"V\",\n    name: \"Valine\",\n    threeLettersName: \"Val\",\n    hydrophobicity: 4.2,\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(353.6, 100%, 69%)\",\n    mass: 117.1\n  },\n  \"*\": {\n    value: \"*\",\n    name: \"Stop\",\n    threeLettersName: \"Stop\",\n    colorByFamily: \"#FF0000\",\n    color: \"hsl(0, 100%, 69%)\",\n    mass: 0\n  },\n  \".\": {\n    //tnr: this is actually a deletion/gap character (previously we had this as a stop character which is incorrect) https://www.dnabaser.com/articles/IUPAC%20ambiguity%20codes.html\n    value: \".\",\n    name: \"Gap\",\n    threeLettersName: \"Gap\",\n    colorByFamily: \"#FF0000\",\n    color: \"hsl(0, 100%, 69%)\",\n    mass: 0\n  },\n  \"-\": {\n    value: \"-\",\n    name: \"Gap\",\n    threeLettersName: \"Gap\",\n    colorByFamily: \"#FF0000\",\n    color: \"hsl(0, 100%, 69%)\",\n    mass: 0\n  },\n  B: {\n    value: \"B\",\n    threeLettersName: \"ND\",\n    colorByFamily: \"#D3D3D3\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    isAmbiguous: true,\n    name: \"B\",\n    aliases: \"ND\",\n    mass: 0\n  },\n  J: {\n    value: \"J\",\n    threeLettersName: \"IL\",\n    colorByFamily: \"#00FFFF\",\n    color: \"hsl(352, 100%, 69%)\",\n    isAmbiguous: true,\n    name: \"J\",\n    aliases: \"IL\",\n    mass: 0\n  },\n  X: {\n    value: \"X\",\n    threeLettersName: \"ACDEFGHIKLMNPQRSTVWY\",\n    colorByFamily: \"#FFFFFF\",\n    color: \"hsl(60, 100%, 69%)\",\n    isAmbiguous: true,\n    name: \"X\",\n    aliases: \"ACDEFGHIKLMNPQRSTVWY\",\n    mass: 0\n  },\n  Z: {\n    value: \"Z\",\n    threeLettersName: \"QE\",\n    colorByFamily: \"#D3D3D3\",\n    color: \"hsl(268.9, 100%, 69%)\",\n    isAmbiguous: true,\n    name: \"Z\",\n    aliases: \"QE\",\n    mass: 0\n  }\n};","/* @license\nPapa Parse\nv5.3.1\nhttps://github.com/mholt/PapaParse\nLicense: MIT\n*/\n!function(e,t){\"function\"==typeof define&&define.amd?define([],t):\"object\"==typeof module&&\"undefined\"!=typeof exports?module.exports=t():e.Papa=t()}(this,function s(){\"use strict\";var f=\"undefined\"!=typeof self?self:\"undefined\"!=typeof window?window:void 0!==f?f:{};var n=!f.document&&!!f.postMessage,o=n&&/blob:/i.test((f.location||{}).protocol),a={},h=0,b={parse:function(e,t){var i=(t=t||{}).dynamicTyping||!1;M(i)&&(t.dynamicTypingFunction=i,i={});if(t.dynamicTyping=i,t.transform=!!M(t.transform)&&t.transform,t.worker&&b.WORKERS_SUPPORTED){var r=function(){if(!b.WORKERS_SUPPORTED)return!1;var e=(i=f.URL||f.webkitURL||null,r=s.toString(),b.BLOB_URL||(b.BLOB_URL=i.createObjectURL(new Blob([\"(\",r,\")();\"],{type:\"text/javascript\"})))),t=new f.Worker(e);var i,r;return t.onmessage=_,t.id=h++,a[t.id]=t}();return r.userStep=t.step,r.userChunk=t.chunk,r.userComplete=t.complete,r.userError=t.error,t.step=M(t.step),t.chunk=M(t.chunk),t.complete=M(t.complete),t.error=M(t.error),delete t.worker,void r.postMessage({input:e,config:t,workerId:r.id})}var n=null;b.NODE_STREAM_INPUT,\"string\"==typeof e?n=t.download?new l(t):new p(t):!0===e.readable&&M(e.read)&&M(e.on)?n=new g(t):(f.File&&e instanceof File||e instanceof Object)&&(n=new c(t));return n.stream(e)},unparse:function(e,t){var n=!1,_=!0,m=\",\",y=\"\\r\\n\",s='\"',a=s+s,i=!1,r=null,o=!1;!function(){if(\"object\"!=typeof t)return;\"string\"!=typeof t.delimiter||b.BAD_DELIMITERS.filter(function(e){return-1!==t.delimiter.indexOf(e)}).length||(m=t.delimiter);(\"boolean\"==typeof t.quotes||\"function\"==typeof t.quotes||Array.isArray(t.quotes))&&(n=t.quotes);\"boolean\"!=typeof t.skipEmptyLines&&\"string\"!=typeof t.skipEmptyLines||(i=t.skipEmptyLines);\"string\"==typeof t.newline&&(y=t.newline);\"string\"==typeof t.quoteChar&&(s=t.quoteChar);\"boolean\"==typeof t.header&&(_=t.header);if(Array.isArray(t.columns)){if(0===t.columns.length)throw new Error(\"Option columns is empty\");r=t.columns}void 0!==t.escapeChar&&(a=t.escapeChar+s);\"boolean\"==typeof t.escapeFormulae&&(o=t.escapeFormulae)}();var h=new RegExp(j(s),\"g\");\"string\"==typeof e&&(e=JSON.parse(e));if(Array.isArray(e)){if(!e.length||Array.isArray(e[0]))return u(null,e,i);if(\"object\"==typeof e[0])return u(r||Object.keys(e[0]),e,i)}else if(\"object\"==typeof e)return\"string\"==typeof e.data&&(e.data=JSON.parse(e.data)),Array.isArray(e.data)&&(e.fields||(e.fields=e.meta&&e.meta.fields),e.fields||(e.fields=Array.isArray(e.data[0])?e.fields:\"object\"==typeof e.data[0]?Object.keys(e.data[0]):[]),Array.isArray(e.data[0])||\"object\"==typeof e.data[0]||(e.data=[e.data])),u(e.fields||[],e.data||[],i);throw new Error(\"Unable to serialize unrecognized input\");function u(e,t,i){var r=\"\";\"string\"==typeof e&&(e=JSON.parse(e)),\"string\"==typeof t&&(t=JSON.parse(t));var n=Array.isArray(e)&&0<e.length,s=!Array.isArray(t[0]);if(n&&_){for(var a=0;a<e.length;a++)0<a&&(r+=m),r+=v(e[a],a);0<t.length&&(r+=y)}for(var o=0;o<t.length;o++){var h=n?e.length:t[o].length,u=!1,f=n?0===Object.keys(t[o]).length:0===t[o].length;if(i&&!n&&(u=\"greedy\"===i?\"\"===t[o].join(\"\").trim():1===t[o].length&&0===t[o][0].length),\"greedy\"===i&&n){for(var d=[],l=0;l<h;l++){var c=s?e[l]:l;d.push(t[o][c])}u=\"\"===d.join(\"\").trim()}if(!u){for(var p=0;p<h;p++){0<p&&!f&&(r+=m);var g=n&&s?e[p]:p;r+=v(t[o][g],p)}o<t.length-1&&(!i||0<h&&!f)&&(r+=y)}}return r}function v(e,t){if(null==e)return\"\";if(e.constructor===Date)return JSON.stringify(e).slice(1,25);!0===o&&\"string\"==typeof e&&null!==e.match(/^[=+\\-@].*$/)&&(e=\"'\"+e);var i=e.toString().replace(h,a),r=\"boolean\"==typeof n&&n||\"function\"==typeof n&&n(e,t)||Array.isArray(n)&&n[t]||function(e,t){for(var i=0;i<t.length;i++)if(-1<e.indexOf(t[i]))return!0;return!1}(i,b.BAD_DELIMITERS)||-1<i.indexOf(m)||\" \"===i.charAt(0)||\" \"===i.charAt(i.length-1);return r?s+i+s:i}}};if(b.RECORD_SEP=String.fromCharCode(30),b.UNIT_SEP=String.fromCharCode(31),b.BYTE_ORDER_MARK=\"\\ufeff\",b.BAD_DELIMITERS=[\"\\r\",\"\\n\",'\"',b.BYTE_ORDER_MARK],b.WORKERS_SUPPORTED=!n&&!!f.Worker,b.NODE_STREAM_INPUT=1,b.LocalChunkSize=10485760,b.RemoteChunkSize=5242880,b.DefaultDelimiter=\",\",b.Parser=E,b.ParserHandle=i,b.NetworkStreamer=l,b.FileStreamer=c,b.StringStreamer=p,b.ReadableStreamStreamer=g,f.jQuery){var d=f.jQuery;d.fn.parse=function(o){var i=o.config||{},h=[];return this.each(function(e){if(!(\"INPUT\"===d(this).prop(\"tagName\").toUpperCase()&&\"file\"===d(this).attr(\"type\").toLowerCase()&&f.FileReader)||!this.files||0===this.files.length)return!0;for(var t=0;t<this.files.length;t++)h.push({file:this.files[t],inputElem:this,instanceConfig:d.extend({},i)})}),e(),this;function e(){if(0!==h.length){var e,t,i,r,n=h[0];if(M(o.before)){var s=o.before(n.file,n.inputElem);if(\"object\"==typeof s){if(\"abort\"===s.action)return e=\"AbortError\",t=n.file,i=n.inputElem,r=s.reason,void(M(o.error)&&o.error({name:e},t,i,r));if(\"skip\"===s.action)return void u();\"object\"==typeof s.config&&(n.instanceConfig=d.extend(n.instanceConfig,s.config))}else if(\"skip\"===s)return void u()}var a=n.instanceConfig.complete;n.instanceConfig.complete=function(e){M(a)&&a(e,n.file,n.inputElem),u()},b.parse(n.file,n.instanceConfig)}else M(o.complete)&&o.complete()}function u(){h.splice(0,1),e()}}}function u(e){this._handle=null,this._finished=!1,this._completed=!1,this._halted=!1,this._input=null,this._baseIndex=0,this._partialLine=\"\",this._rowCount=0,this._start=0,this._nextChunk=null,this.isFirstChunk=!0,this._completeResults={data:[],errors:[],meta:{}},function(e){var t=w(e);t.chunkSize=parseInt(t.chunkSize),e.step||e.chunk||(t.chunkSize=null);this._handle=new i(t),(this._handle.streamer=this)._config=t}.call(this,e),this.parseChunk=function(e,t){if(this.isFirstChunk&&M(this._config.beforeFirstChunk)){var i=this._config.beforeFirstChunk(e);void 0!==i&&(e=i)}this.isFirstChunk=!1,this._halted=!1;var r=this._partialLine+e;this._partialLine=\"\";var n=this._handle.parse(r,this._baseIndex,!this._finished);if(!this._handle.paused()&&!this._handle.aborted()){var s=n.meta.cursor;this._finished||(this._partialLine=r.substring(s-this._baseIndex),this._baseIndex=s),n&&n.data&&(this._rowCount+=n.data.length);var a=this._finished||this._config.preview&&this._rowCount>=this._config.preview;if(o)f.postMessage({results:n,workerId:b.WORKER_ID,finished:a});else if(M(this._config.chunk)&&!t){if(this._config.chunk(n,this._handle),this._handle.paused()||this._handle.aborted())return void(this._halted=!0);n=void 0,this._completeResults=void 0}return this._config.step||this._config.chunk||(this._completeResults.data=this._completeResults.data.concat(n.data),this._completeResults.errors=this._completeResults.errors.concat(n.errors),this._completeResults.meta=n.meta),this._completed||!a||!M(this._config.complete)||n&&n.meta.aborted||(this._config.complete(this._completeResults,this._input),this._completed=!0),a||n&&n.meta.paused||this._nextChunk(),n}this._halted=!0},this._sendError=function(e){M(this._config.error)?this._config.error(e):o&&this._config.error&&f.postMessage({workerId:b.WORKER_ID,error:e,finished:!1})}}function l(e){var r;(e=e||{}).chunkSize||(e.chunkSize=b.RemoteChunkSize),u.call(this,e),this._nextChunk=n?function(){this._readChunk(),this._chunkLoaded()}:function(){this._readChunk()},this.stream=function(e){this._input=e,this._nextChunk()},this._readChunk=function(){if(this._finished)this._chunkLoaded();else{if(r=new XMLHttpRequest,this._config.withCredentials&&(r.withCredentials=this._config.withCredentials),n||(r.onload=v(this._chunkLoaded,this),r.onerror=v(this._chunkError,this)),r.open(this._config.downloadRequestBody?\"POST\":\"GET\",this._input,!n),this._config.downloadRequestHeaders){var e=this._config.downloadRequestHeaders;for(var t in e)r.setRequestHeader(t,e[t])}if(this._config.chunkSize){var i=this._start+this._config.chunkSize-1;r.setRequestHeader(\"Range\",\"bytes=\"+this._start+\"-\"+i)}try{r.send(this._config.downloadRequestBody)}catch(e){this._chunkError(e.message)}n&&0===r.status&&this._chunkError()}},this._chunkLoaded=function(){4===r.readyState&&(r.status<200||400<=r.status?this._chunkError():(this._start+=this._config.chunkSize?this._config.chunkSize:r.responseText.length,this._finished=!this._config.chunkSize||this._start>=function(e){var t=e.getResponseHeader(\"Content-Range\");if(null===t)return-1;return parseInt(t.substring(t.lastIndexOf(\"/\")+1))}(r),this.parseChunk(r.responseText)))},this._chunkError=function(e){var t=r.statusText||e;this._sendError(new Error(t))}}function c(e){var r,n;(e=e||{}).chunkSize||(e.chunkSize=b.LocalChunkSize),u.call(this,e);var s=\"undefined\"!=typeof FileReader;this.stream=function(e){this._input=e,n=e.slice||e.webkitSlice||e.mozSlice,s?((r=new FileReader).onload=v(this._chunkLoaded,this),r.onerror=v(this._chunkError,this)):r=new FileReaderSync,this._nextChunk()},this._nextChunk=function(){this._finished||this._config.preview&&!(this._rowCount<this._config.preview)||this._readChunk()},this._readChunk=function(){var e=this._input;if(this._config.chunkSize){var t=Math.min(this._start+this._config.chunkSize,this._input.size);e=n.call(e,this._start,t)}var i=r.readAsText(e,this._config.encoding);s||this._chunkLoaded({target:{result:i}})},this._chunkLoaded=function(e){this._start+=this._config.chunkSize,this._finished=!this._config.chunkSize||this._start>=this._input.size,this.parseChunk(e.target.result)},this._chunkError=function(){this._sendError(r.error)}}function p(e){var i;u.call(this,e=e||{}),this.stream=function(e){return i=e,this._nextChunk()},this._nextChunk=function(){if(!this._finished){var e,t=this._config.chunkSize;return t?(e=i.substring(0,t),i=i.substring(t)):(e=i,i=\"\"),this._finished=!i,this.parseChunk(e)}}}function g(e){u.call(this,e=e||{});var t=[],i=!0,r=!1;this.pause=function(){u.prototype.pause.apply(this,arguments),this._input.pause()},this.resume=function(){u.prototype.resume.apply(this,arguments),this._input.resume()},this.stream=function(e){this._input=e,this._input.on(\"data\",this._streamData),this._input.on(\"end\",this._streamEnd),this._input.on(\"error\",this._streamError)},this._checkIsFinished=function(){r&&1===t.length&&(this._finished=!0)},this._nextChunk=function(){this._checkIsFinished(),t.length?this.parseChunk(t.shift()):i=!0},this._streamData=v(function(e){try{t.push(\"string\"==typeof e?e:e.toString(this._config.encoding)),i&&(i=!1,this._checkIsFinished(),this.parseChunk(t.shift()))}catch(e){this._streamError(e)}},this),this._streamError=v(function(e){this._streamCleanUp(),this._sendError(e)},this),this._streamEnd=v(function(){this._streamCleanUp(),r=!0,this._streamData(\"\")},this),this._streamCleanUp=v(function(){this._input.removeListener(\"data\",this._streamData),this._input.removeListener(\"end\",this._streamEnd),this._input.removeListener(\"error\",this._streamError)},this)}function i(m){var a,o,h,r=Math.pow(2,53),n=-r,s=/^\\s*-?(\\d+\\.?|\\.\\d+|\\d+\\.\\d+)([eE][-+]?\\d+)?\\s*$/,u=/^(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d:[0-5]\\d\\.\\d+([+-][0-2]\\d:[0-5]\\d|Z))|(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d:[0-5]\\d([+-][0-2]\\d:[0-5]\\d|Z))|(\\d{4}-[01]\\d-[0-3]\\dT[0-2]\\d:[0-5]\\d([+-][0-2]\\d:[0-5]\\d|Z))$/,t=this,i=0,f=0,d=!1,e=!1,l=[],c={data:[],errors:[],meta:{}};if(M(m.step)){var p=m.step;m.step=function(e){if(c=e,_())g();else{if(g(),0===c.data.length)return;i+=e.data.length,m.preview&&i>m.preview?o.abort():(c.data=c.data[0],p(c,t))}}}function y(e){return\"greedy\"===m.skipEmptyLines?\"\"===e.join(\"\").trim():1===e.length&&0===e[0].length}function g(){if(c&&h&&(k(\"Delimiter\",\"UndetectableDelimiter\",\"Unable to auto-detect delimiting character; defaulted to '\"+b.DefaultDelimiter+\"'\"),h=!1),m.skipEmptyLines)for(var e=0;e<c.data.length;e++)y(c.data[e])&&c.data.splice(e--,1);return _()&&function(){if(!c)return;function e(e,t){M(m.transformHeader)&&(e=m.transformHeader(e,t)),l.push(e)}if(Array.isArray(c.data[0])){for(var t=0;_()&&t<c.data.length;t++)c.data[t].forEach(e);c.data.splice(0,1)}else c.data.forEach(e)}(),function(){if(!c||!m.header&&!m.dynamicTyping&&!m.transform)return c;function e(e,t){var i,r=m.header?{}:[];for(i=0;i<e.length;i++){var n=i,s=e[i];m.header&&(n=i>=l.length?\"__parsed_extra\":l[i]),m.transform&&(s=m.transform(s,n)),s=v(n,s),\"__parsed_extra\"===n?(r[n]=r[n]||[],r[n].push(s)):r[n]=s}return m.header&&(i>l.length?k(\"FieldMismatch\",\"TooManyFields\",\"Too many fields: expected \"+l.length+\" fields but parsed \"+i,f+t):i<l.length&&k(\"FieldMismatch\",\"TooFewFields\",\"Too few fields: expected \"+l.length+\" fields but parsed \"+i,f+t)),r}var t=1;!c.data.length||Array.isArray(c.data[0])?(c.data=c.data.map(e),t=c.data.length):c.data=e(c.data,0);m.header&&c.meta&&(c.meta.fields=l);return f+=t,c}()}function _(){return m.header&&0===l.length}function v(e,t){return i=e,m.dynamicTypingFunction&&void 0===m.dynamicTyping[i]&&(m.dynamicTyping[i]=m.dynamicTypingFunction(i)),!0===(m.dynamicTyping[i]||m.dynamicTyping)?\"true\"===t||\"TRUE\"===t||\"false\"!==t&&\"FALSE\"!==t&&(function(e){if(s.test(e)){var t=parseFloat(e);if(n<t&&t<r)return!0}return!1}(t)?parseFloat(t):u.test(t)?new Date(t):\"\"===t?null:t):t;var i}function k(e,t,i,r){var n={type:e,code:t,message:i};void 0!==r&&(n.row=r),c.errors.push(n)}this.parse=function(e,t,i){var r=m.quoteChar||'\"';if(m.newline||(m.newline=function(e,t){e=e.substring(0,1048576);var i=new RegExp(j(t)+\"([^]*?)\"+j(t),\"gm\"),r=(e=e.replace(i,\"\")).split(\"\\r\"),n=e.split(\"\\n\"),s=1<n.length&&n[0].length<r[0].length;if(1===r.length||s)return\"\\n\";for(var a=0,o=0;o<r.length;o++)\"\\n\"===r[o][0]&&a++;return a>=r.length/2?\"\\r\\n\":\"\\r\"}(e,r)),h=!1,m.delimiter)M(m.delimiter)&&(m.delimiter=m.delimiter(e),c.meta.delimiter=m.delimiter);else{var n=function(e,t,i,r,n){var s,a,o,h;n=n||[\",\",\"\\t\",\"|\",\";\",b.RECORD_SEP,b.UNIT_SEP];for(var u=0;u<n.length;u++){var f=n[u],d=0,l=0,c=0;o=void 0;for(var p=new E({comments:r,delimiter:f,newline:t,preview:10}).parse(e),g=0;g<p.data.length;g++)if(i&&y(p.data[g]))c++;else{var _=p.data[g].length;l+=_,void 0!==o?0<_&&(d+=Math.abs(_-o),o=_):o=_}0<p.data.length&&(l/=p.data.length-c),(void 0===a||d<=a)&&(void 0===h||h<l)&&1.99<l&&(a=d,s=f,h=l)}return{successful:!!(m.delimiter=s),bestDelimiter:s}}(e,m.newline,m.skipEmptyLines,m.comments,m.delimitersToGuess);n.successful?m.delimiter=n.bestDelimiter:(h=!0,m.delimiter=b.DefaultDelimiter),c.meta.delimiter=m.delimiter}var s=w(m);return m.preview&&m.header&&s.preview++,a=e,o=new E(s),c=o.parse(a,t,i),g(),d?{meta:{paused:!0}}:c||{meta:{paused:!1}}},this.paused=function(){return d},this.pause=function(){d=!0,o.abort(),a=M(m.chunk)?\"\":a.substring(o.getCharIndex())},this.resume=function(){t.streamer._halted?(d=!1,t.streamer.parseChunk(a,!0)):setTimeout(t.resume,3)},this.aborted=function(){return e},this.abort=function(){e=!0,o.abort(),c.meta.aborted=!0,M(m.complete)&&m.complete(c),a=\"\"}}function j(e){return e.replace(/[.*+?^${}()|[\\]\\\\]/g,\"\\\\$&\")}function E(e){var S,O=(e=e||{}).delimiter,x=e.newline,I=e.comments,T=e.step,D=e.preview,A=e.fastMode,L=S=void 0===e.quoteChar?'\"':e.quoteChar;if(void 0!==e.escapeChar&&(L=e.escapeChar),(\"string\"!=typeof O||-1<b.BAD_DELIMITERS.indexOf(O))&&(O=\",\"),I===O)throw new Error(\"Comment character same as delimiter\");!0===I?I=\"#\":(\"string\"!=typeof I||-1<b.BAD_DELIMITERS.indexOf(I))&&(I=!1),\"\\n\"!==x&&\"\\r\"!==x&&\"\\r\\n\"!==x&&(x=\"\\n\");var F=0,z=!1;this.parse=function(r,t,i){if(\"string\"!=typeof r)throw new Error(\"Input must be a string\");var n=r.length,e=O.length,s=x.length,a=I.length,o=M(T),h=[],u=[],f=[],d=F=0;if(!r)return C();if(A||!1!==A&&-1===r.indexOf(S)){for(var l=r.split(x),c=0;c<l.length;c++){if(f=l[c],F+=f.length,c!==l.length-1)F+=x.length;else if(i)return C();if(!I||f.substring(0,a)!==I){if(o){if(h=[],k(f.split(O)),R(),z)return C()}else k(f.split(O));if(D&&D<=c)return h=h.slice(0,D),C(!0)}}return C()}for(var p=r.indexOf(O,F),g=r.indexOf(x,F),_=new RegExp(j(L)+j(S),\"g\"),m=r.indexOf(S,F);;)if(r[F]!==S)if(I&&0===f.length&&r.substring(F,F+a)===I){if(-1===g)return C();F=g+s,g=r.indexOf(x,F),p=r.indexOf(O,F)}else if(-1!==p&&(p<g||-1===g))f.push(r.substring(F,p)),F=p+e,p=r.indexOf(O,F);else{if(-1===g)break;if(f.push(r.substring(F,g)),w(g+s),o&&(R(),z))return C();if(D&&h.length>=D)return C(!0)}else for(m=F,F++;;){if(-1===(m=r.indexOf(S,m+1)))return i||u.push({type:\"Quotes\",code:\"MissingQuotes\",message:\"Quoted field unterminated\",row:h.length,index:F}),E();if(m===n-1)return E(r.substring(F,m).replace(_,S));if(S!==L||r[m+1]!==L){if(S===L||0===m||r[m-1]!==L){-1!==p&&p<m+1&&(p=r.indexOf(O,m+1)),-1!==g&&g<m+1&&(g=r.indexOf(x,m+1));var y=b(-1===g?p:Math.min(p,g));if(r[m+1+y]===O){f.push(r.substring(F,m).replace(_,S)),r[F=m+1+y+e]!==S&&(m=r.indexOf(S,F)),p=r.indexOf(O,F),g=r.indexOf(x,F);break}var v=b(g);if(r.substring(m+1+v,m+1+v+s)===x){if(f.push(r.substring(F,m).replace(_,S)),w(m+1+v+s),p=r.indexOf(O,F),m=r.indexOf(S,F),o&&(R(),z))return C();if(D&&h.length>=D)return C(!0);break}u.push({type:\"Quotes\",code:\"InvalidQuotes\",message:\"Trailing quote on quoted field is malformed\",row:h.length,index:F}),m++}}else m++}return E();function k(e){h.push(e),d=F}function b(e){var t=0;if(-1!==e){var i=r.substring(m+1,e);i&&\"\"===i.trim()&&(t=i.length)}return t}function E(e){return i||(void 0===e&&(e=r.substring(F)),f.push(e),F=n,k(f),o&&R()),C()}function w(e){F=e,k(f),f=[],g=r.indexOf(x,F)}function C(e){return{data:h,errors:u,meta:{delimiter:O,linebreak:x,aborted:z,truncated:!!e,cursor:d+(t||0)}}}function R(){T(C()),h=[],u=[]}},this.abort=function(){z=!0},this.getCharIndex=function(){return F}}function _(e){var t=e.data,i=a[t.workerId],r=!1;if(t.error)i.userError(t.error,t.file);else if(t.results&&t.results.data){var n={abort:function(){r=!0,m(t.workerId,{data:[],errors:[],meta:{aborted:!0}})},pause:y,resume:y};if(M(i.userStep)){for(var s=0;s<t.results.data.length&&(i.userStep({data:t.results.data[s],errors:t.results.errors,meta:t.results.meta},n),!r);s++);delete t.results}else M(i.userChunk)&&(i.userChunk(t.results,n,t.file),delete t.results)}t.finished&&!r&&m(t.workerId,t.results)}function m(e,t){var i=a[e];M(i.userComplete)&&i.userComplete(t),i.terminate(),delete a[e]}function y(){throw new Error(\"Not implemented.\")}function w(e){if(\"object\"!=typeof e||null===e)return e;var t=Array.isArray(e)?[]:{};for(var i in e)t[i]=w(e[i]);return t}function v(e,t){return function(){e.apply(t,arguments)}}function M(e){return\"function\"==typeof e}return o&&(f.onmessage=function(e){var t=e.data;void 0===b.WORKER_ID&&t&&(b.WORKER_ID=t.workerId);if(\"string\"==typeof t.input)f.postMessage({workerId:b.WORKER_ID,results:b.parse(t.input,t.config),finished:!0});else if(f.File&&t.input instanceof File||t.input instanceof Object){var i=b.parse(t.input,t.config);i&&f.postMessage({workerId:b.WORKER_ID,results:i,finished:!0})}}),(l.prototype=Object.create(u.prototype)).constructor=l,(c.prototype=Object.create(u.prototype)).constructor=c,(p.prototype=Object.create(p.prototype)).constructor=p,(g.prototype=Object.create(u.prototype)).constructor=g,b});","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    translateRange = _require.translateRange,\n    getSequenceWithinRange = _require.getSequenceWithinRange;\n\nvar revComp = require(\"./getReverseComplementSequenceString\");\nvar getAA = require(\"./getAminoAcidFromSequenceTriplet\");\n// var ac = require('ve-api-check');\nvar proteinAlphabet = require(\"./proteinAlphabet\");\n\n// ac.throw([ac.string,ac.bool],arguments);\n/**\n * @private\n * Gets aminoAcid data, including position in string and position in codon\n * from the sequenceString and the direction of the translation\n * @param  {String} sequenceString The dna sequenceString.\n * @param  {boolean} forward Should we find forward facing orfs or reverse facing orfs\n * @param  {boolean} isProteinSequence We're passing in a sequence of AA chars instead of DNA chars (slightly confusing but we'll still use the dna indexing for rendering in OVE)\n * @return [{\n        aminoAcid: \n        positionInCodon: \n      }]\n */\nmodule.exports = function getAminoAcidDataForEachBaseOfDna(originalSequenceString, forward, optionalSubrangeRange, isProteinSequence) {\n  var originalSequenceStringLength = isProteinSequence ? originalSequenceString.length * 3 : originalSequenceString.length;\n  var sequenceString = originalSequenceString;\n  var startOffset = 0;\n  if (optionalSubrangeRange) {\n    sequenceString = getSequenceWithinRange(optionalSubrangeRange, originalSequenceString);\n    startOffset = optionalSubrangeRange.start;\n  }\n  var sequenceStringLength = isProteinSequence ? sequenceString.length * 3 : sequenceString.length;\n\n  // ac.throw([ac.string,ac.bool],arguments);\n  var aminoAcidDataForEachBaseOfDNA = [];\n  var codonRange = void 0;\n  var revCompGapLength = 0;\n  var aminoAcidIndex = 0;\n  if (!forward) {\n    //compute the start of the amino acid sequence, but only if translating in the reverse direction\n    aminoAcidIndex = Math.floor((sequenceStringLength - 1) / 3);\n    //because we're translating in the reverse direction, we need to\n    //check to see if there are untranslated amino acids at the start of the sequenceString\n    revCompGapLength = sequenceStringLength % 3;\n    codonRange = translateRange({\n      start: 0,\n      end: revCompGapLength - 1\n    }, startOffset, originalSequenceStringLength);\n\n    if (revCompGapLength > 0) {\n      for (var i = 0; i < revCompGapLength; i++) {\n        aminoAcidDataForEachBaseOfDNA.push({\n          aminoAcid: getAA(\"xxx\"), //fake xxx triplet returns the ambiguous X amino acid\n          positionInCodon: revCompGapLength - i - 1,\n          aminoAcidIndex: aminoAcidIndex,\n          sequenceIndex: codonRange.start + i,\n          codonRange: codonRange,\n          fullCodon: false\n        });\n      }\n      aminoAcidIndex--;\n    }\n  }\n\n  //compute the bulk of the sequence\n  for (var index = 2 + revCompGapLength; index < sequenceStringLength; index += 3) {\n    var aminoAcid = void 0;\n    if (isProteinSequence) {\n      aminoAcid = proteinAlphabet[sequenceString[(index - 2) / 3].toUpperCase()];\n    } else {\n      var triplet = sequenceString.slice(index - 2, index + 1);\n      if (!forward) {\n        //we reverse the triplet\n        triplet = revComp(triplet);\n      }\n      aminoAcid = getAA(triplet);\n    }\n    codonRange = translateRange({\n      start: index - 2,\n      end: index\n    }, startOffset, originalSequenceStringLength);\n\n    aminoAcidDataForEachBaseOfDNA.push({\n      aminoAcid: aminoAcid, //gap amino acid\n      positionInCodon: forward ? 0 : 2,\n      aminoAcidIndex: aminoAcidIndex,\n      sequenceIndex: codonRange.start,\n      codonRange: codonRange,\n      fullCodon: true\n    });\n    aminoAcidDataForEachBaseOfDNA.push({\n      aminoAcid: aminoAcid, //gap amino acid\n      positionInCodon: 1,\n      aminoAcidIndex: aminoAcidIndex,\n      sequenceIndex: codonRange.start + 1,\n      codonRange: codonRange,\n      fullCodon: true\n    });\n    aminoAcidDataForEachBaseOfDNA.push({\n      aminoAcid: aminoAcid, //gap amino acid\n      positionInCodon: forward ? 2 : 0,\n      aminoAcidIndex: aminoAcidIndex,\n      sequenceIndex: codonRange.start + 2,\n      codonRange: codonRange,\n      fullCodon: true\n    });\n    if (forward) {\n      aminoAcidIndex++;\n    } else {\n      aminoAcidIndex--;\n    }\n  }\n\n  //compute the end of the sequence\n  //we'll never hit the following logic if translating in the reverse direction\n  var lengthOfEndBpsNotCoveredByAminoAcids = sequenceStringLength - aminoAcidDataForEachBaseOfDNA.length;\n  codonRange = translateRange({\n    start: sequenceStringLength - lengthOfEndBpsNotCoveredByAminoAcids,\n    end: sequenceStringLength - 1\n  }, startOffset, originalSequenceStringLength);\n  for (var j = 0; j < lengthOfEndBpsNotCoveredByAminoAcids; j++) {\n    aminoAcidDataForEachBaseOfDNA.push({\n      aminoAcid: getAA(\"xxx\"), //fake xxx triplet returns the gap amino acid\n      positionInCodon: j,\n      aminoAcidIndex: aminoAcidIndex,\n      sequenceIndex: codonRange.start + j,\n      fullCodon: false,\n      codonRange: codonRange\n    });\n  }\n\n  if (sequenceStringLength !== aminoAcidDataForEachBaseOfDNA.length) {\n    throw new Error(\"something went wrong!\");\n  }\n  return aminoAcidDataForEachBaseOfDNA;\n};","\"use strict\";\n\nvar getOverlapsOfPotentiallyCircularRanges = require(\"./getOverlapsOfPotentiallyCircularRanges\");\nvar splitRangeIntoTwoPartsIfItIsCircular = require(\"./splitRangeIntoTwoPartsIfItIsCircular\");\nvar trimNonCicularRangeByAnotherNonCircularRange = require(\"./trimNonCicularRangeByAnotherNonCircularRange\");\n\nvar _require = require(\"lodash\"),\n    extend = _require.extend;\n\n/**\n * trims range, but does *not* adjust it\n * returns a new range if there is one, or null, if it is trimmed completely\n * @param  {object} subRange  {start:\n *                                  end:\n *                                  }\n * @param  {object} containerRange {start:\n *                                  end:\n *                                  }\n * @param  {int} sequenceLength\n * @return {object} || null        {start:\n *                                  end:\n *                                  }\n */\n\n\nmodule.exports = function trimRangeByAnotherRange(rangeToBeTrimmed, trimmingRange, sequenceLength) {\n  if (!rangeToBeTrimmed || !trimmingRange) {\n    console.warn(\"invalid range input\");\n    return null; //a null return val means something went wrong with this function\n  }\n  var position = void 0;\n  var _arr = [rangeToBeTrimmed.start, rangeToBeTrimmed.end, trimmingRange.start, trimmingRange.end];\n  for (var _i = 0; _i < _arr.length; _i++) {\n    position = _arr[_i];\n\n    if (position < 0 || !position && position !== 0) {\n      console.warn(\"invalid range input\");\n      return null; //a null return val means something went wrong with this function\n    }\n  }\n  //get the overlaps of the ranges\n  var overlaps = getOverlapsOfPotentiallyCircularRanges(rangeToBeTrimmed, trimmingRange, sequenceLength);\n  //split the range to be trimmed into pieces if necessary\n  if (!overlaps.length) {\n    //just return the range to be trimmed\n    return rangeToBeTrimmed;\n  }\n  //and trim both pieces by the already calculated overlaps\n  var splitRangesToBeTrimmed = splitRangeIntoTwoPartsIfItIsCircular(rangeToBeTrimmed, sequenceLength);\n  splitRangesToBeTrimmed.forEach(function (nonCircularRangeToBeTrimmed, index) {\n    overlaps.forEach(function (overlap) {\n      if (nonCircularRangeToBeTrimmed) {\n        nonCircularRangeToBeTrimmed = trimNonCicularRangeByAnotherNonCircularRange(nonCircularRangeToBeTrimmed, overlap);\n      }\n    });\n    splitRangesToBeTrimmed[index] = nonCircularRangeToBeTrimmed;\n  });\n  //filter out any of the split ranges that have been fully deleted!\n  var outputSplitRanges = splitRangesToBeTrimmed.filter(function (trimmedRange) {\n    if (trimmedRange) {\n      return true;\n    }\n    return false;\n  });\n\n  var outputTrimmedRange = void 0;\n  if (outputSplitRanges.length < 0) {\n    //do nothing to the output trimmed range\n  } else if (outputSplitRanges.length === 1) {\n    outputTrimmedRange = outputSplitRanges[0];\n  } else if (outputSplitRanges.length === 2) {\n    if (outputSplitRanges[0].start < outputSplitRanges[1].start) {\n      outputTrimmedRange = {\n        start: outputSplitRanges[1].start,\n        end: outputSplitRanges[0].end\n      };\n    } else {\n      outputTrimmedRange = {\n        start: outputSplitRanges[0].start,\n        end: outputSplitRanges[1].end\n      };\n    }\n  }\n  if (outputTrimmedRange) {\n    return extend({}, rangeToBeTrimmed, {\n      start: outputTrimmedRange.start,\n      end: outputTrimmedRange.end\n    });\n  }\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = function provideInclusiveOptions(funToWrap) {\n    return function () {\n        var args = Array.prototype.slice.call(arguments);\n        var options = args[args.length - 1];\n        if (options && (options.inclusive1BasedEnd || options.inclusive1BasedStart)) {\n            args.forEach(function (arg, index) {\n                if (arg && arg.start > -1 && options.inclusive1BasedStart) {\n                    args[index] = assign(arg, { start: arg.start - 1 });\n                }\n                if (arg && arg.end > -1 && options.inclusive1BasedEnd) {\n                    args[index] = assign(arg, { end: arg.end - 1 });\n                }\n            });\n        }\n        var returnVal = funToWrap.apply(this, args);\n        if (returnVal && returnVal.start > -1 && options && options.inclusive1BasedStart) {\n            returnVal = assign(returnVal, { start: returnVal.start + 1 });\n        }\n        if (returnVal && returnVal.end > -1 && options && options.inclusive1BasedEnd) {\n            returnVal = assign(returnVal, { end: returnVal.end + 1 });\n        }\n        return returnVal;\n    };\n};","\"use strict\";\n\nvar aminoAcidToDegenerateDnaMap = {\n  \"-\": \"---\",\n  \".\": \"...\",\n  \"*\": \"trr\",\n  a: \"gcn\",\n  b: \"ray\", // D or N => aay + gay = ray\n  c: \"tgy\",\n  d: \"gay\",\n  e: \"gar\",\n  f: \"tty\",\n  g: \"ggn\",\n  h: \"cay\",\n  i: \"ath\",\n  j: \"htn\", // L or I ytn + ath => htn\n  k: \"aar\",\n  l: \"ytn\", // YTR、CTN => Y=CT, N=AGCT\n  m: \"atg\",\n  n: \"aay\",\n  o: \"tag\", // Pyrrolysine, https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2933860/\n  p: \"ccn\",\n  q: \"car\",\n  r: \"mgn\", // CGN、MGR => M=AC, N=AGCT\n  s: \"wsn\", // TCN、AGY => AT = w, CG = S, N is AGCT\n  t: \"acn\",\n  u: \"tga\", // Selenocysteine, https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2933860/\n  v: \"gtn\",\n  w: \"tgg\",\n  x: \"nnn\", // unknown aa.\n  y: \"tay\",\n  z: \"sar\" // E or Q, => gar + car = sar\n};\nmodule.exports = aminoAcidToDegenerateDnaMap;","\"use strict\";\n\n//Adapted from biopython. Check the BIOPYTHON_LICENSE for licensing info\n\nmodule.exports.protein_letters = \"ACDEFGHIKLMNPQRSTVWY\";\nmodule.exports.extended_protein_letters = \"ACDEFGHIKLMNPQRSTVWYBXZJUO.*-\";\n// #   B = \"Asx\";  aspartic acid or asparagine (D or N)\n// #   X = \"Xxx\";  unknown or 'other' amino acid\n// #   Z = \"Glx\";  glutamic acid or glutamine (E or Q)\n// #   http://www.chem.qmul.ac.uk/iupac/AminoAcid/A2021.html#AA212\n// #\n// #   J = \"Xle\";  leucine or isoleucine (L or I, used in NMR)\n// #   Mentioned in http://www.chem.qmul.ac.uk/iubmb/newsletter/1999/item3.html\n// #   Also the International Nucleotide Sequence Database Collaboration (INSDC)\n// #   (i.e. GenBank, EMBL, DDBJ) adopted this in 2006\n// #   http://www.ddbj.nig.ac.jp/insdc/icm2006-e.html\n// #\n// #   Xle (J); Leucine or Isoleucine\n// #   The residue abbreviations, Xle (the three-letter abbreviation) and J\n// #   (the one-letter abbreviation) are reserved for the case that cannot\n// #   experimentally distinguish leucine from isoleucine.\n// #\n// #   U = \"Sec\";  selenocysteine\n// #   http://www.chem.qmul.ac.uk/iubmb/newsletter/1999/item3.html\n// #\n// #   O = \"Pyl\";  pyrrolysine\n// #   http://www.chem.qmul.ac.uk/iubmb/newsletter/2009.html#item35\n\nmodule.exports.protein_letters_1to3 = {\n  A: \"Ala\",\n  C: \"Cys\",\n  D: \"Asp\",\n  E: \"Glu\",\n  F: \"Phe\",\n  G: \"Gly\",\n  H: \"His\",\n  I: \"Ile\",\n  K: \"Lys\",\n  L: \"Leu\",\n  M: \"Met\",\n  N: \"Asn\",\n  P: \"Pro\",\n  Q: \"Gln\",\n  R: \"Arg\",\n  S: \"Ser\",\n  T: \"Thr\",\n  V: \"Val\",\n  W: \"Trp\",\n  Y: \"Tyr\",\n  O: \"Pyl\",\n  U: \"Sec\"\n};\n// module.exports.protein_letters_1to3_extended = dict(\n//   list(protein_letters_1to3.items()) +\n//     list(\n//       {\n//         B: \"Asx\",\n//         X: \"Xaa\",\n//         Z: \"Glx\",\n//         J: \"Xle\",\n//         U: \"Sel\",\n//         O: \"Pyl\"\n//       }.items()\n//     )\n// );\n\nmodule.exports.ambiguous_dna_letters = \"GATCRYWSMKHBVDN\";\nmodule.exports.unambiguous_dna_letters = \"GATC\";\nmodule.exports.ambiguous_rna_letters = \"GAUCRYWSMKHBVDN\";\nmodule.exports.unambiguous_rna_letters = \"GAUC\";\n\n// #   B == 5-bromouridine\n// #   D == 5,6-dihydrouridine\n// #   S == thiouridine\n// #   W == wyosine\nmodule.exports.extended_dna_letters = \"GATCBDSW\";\n\n// # are there extended forms?\n// # extended_rna_letters = \"GAUCBDSW\"\n\nmodule.exports.ambiguous_dna_values = {\n  \".\": \".\",\n  A: \"A\",\n  C: \"C\",\n  G: \"G\",\n  T: \"T\",\n  M: \"AC\",\n  R: \"AG\",\n  W: \"AT\",\n  S: \"CG\",\n  Y: \"CT\",\n  K: \"GT\",\n  V: \"ACG\",\n  H: \"ACT\",\n  D: \"AGT\",\n  B: \"CGT\",\n  X: \"GATC\",\n  N: \"GATC\"\n};\nmodule.exports.ambiguous_rna_values = {\n  \".\": \".\",\n  A: \"A\",\n  C: \"C\",\n  G: \"G\",\n  U: \"U\",\n  M: \"AC\",\n  R: \"AG\",\n  W: \"AU\",\n  S: \"CG\",\n  Y: \"CU\",\n  K: \"GU\",\n  V: \"ACG\",\n  H: \"ACU\",\n  D: \"AGU\",\n  B: \"CGU\",\n  X: \"GAUC\",\n  N: \"GAUC\"\n};\n\nmodule.exports.ambiguous_dna_complement = {\n  \".\": \".\",\n  A: \"T\",\n  C: \"G\",\n  G: \"C\",\n  T: \"A\",\n  M: \"K\",\n  R: \"Y\",\n  W: \"W\",\n  S: \"S\",\n  Y: \"R\",\n  K: \"M\",\n  V: \"B\",\n  H: \"D\",\n  D: \"H\",\n  B: \"V\",\n  X: \"X\",\n  N: \"N\"\n};\n\nmodule.exports.ambiguous_rna_complement = {\n  \".\": \".\",\n  A: \"U\",\n  C: \"G\",\n  G: \"C\",\n  U: \"A\",\n  M: \"K\",\n  R: \"Y\",\n  W: \"W\",\n  S: \"S\",\n  Y: \"R\",\n  K: \"M\",\n  V: \"B\",\n  H: \"D\",\n  D: \"H\",\n  B: \"V\",\n  X: \"X\",\n  N: \"N\"\n};\n\n// # Mass data taken from PubChem\n\n// # Average masses of monophosphate deoxy nucleotides\nmodule.exports.unambiguous_dna_weights = {\n  A: 331.2218,\n  C: 307.1971,\n  G: 347.2212,\n  T: 322.2085\n};\n\n// # Monoisotopic masses of monophospate deoxy nucleotides\nmodule.exports.monoisotopic_unambiguous_dna_weights = {\n  A: 331.06817,\n  C: 307.056936,\n  G: 347.063084,\n  T: 322.056602\n};\n\n// module.exports.unambiguous_dna_weight_ranges = _make_ranges(\n//   unambiguous_dna_weights\n// );\n\nmodule.exports.unambiguous_rna_weights = {\n  A: 347.2212,\n  C: 323.1965,\n  G: 363.2206,\n  U: 324.1813\n};\n\nmodule.exports.monoisotopic_unambiguous_rna_weights = {\n  A: 347.063084,\n  C: 323.051851,\n  G: 363.057999,\n  U: 324.035867\n};\n\n// module.exports.unambiguous_rna_weight_ranges = _make_ranges(\n//   unambiguous_rna_weights\n// );\n\n// def _make_ambiguous_ranges(mydict, weight_table):\n//     range_d = {}\n//     avg_d = {}\n//     for letter, values in mydict.items():\n//         # Following line is a quick hack to skip undefined weights for U and O\n//         if len(values) == 1 and values[0] not in weight_table:\n//             continue\n\n//         weights = [weight_table.get(x) for x in values]\n//         range_d[letter] = (min(weights), max(weights))\n//         total_w = 0.0\n//         for w in weights:\n//             total_w = total_w + w\n//         avg_d[letter] = total_w / len(weights)\n//     return range_d, avg_d\n\n// ambiguous_dna_weight_ranges, avg_ambiguous_dna_weights = \\\n//                _make_ambiguous_ranges(ambiguous_dna_values,\n//                                       unambiguous_dna_weights)\n\n// ambiguous_rna_weight_ranges, avg_ambiguous_rna_weights = \\\n//                _make_ambiguous_ranges(ambiguous_rna_values,\n//                                       unambiguous_rna_weights)\n\nmodule.exports.protein_weights = {\n  A: 89.0932,\n  C: 121.1582,\n  D: 133.1027,\n  E: 147.1293,\n  F: 165.1891,\n  G: 75.0666,\n  H: 155.1546,\n  I: 131.1729,\n  K: 146.1876,\n  L: 131.1729,\n  M: 149.2113,\n  N: 132.1179,\n  O: 255.3134,\n  P: 115.1305,\n  Q: 146.1445,\n  R: 174.201,\n  S: 105.0926,\n  T: 119.1192,\n  U: 168.0532,\n  V: 117.1463,\n  W: 204.2252,\n  Y: 181.1885\n};\n\nmodule.exports.monoisotopic_protein_weights = {\n  A: 89.047678,\n  C: 121.019749,\n  D: 133.037508,\n  E: 147.053158,\n  F: 165.078979,\n  G: 75.032028,\n  H: 155.069477,\n  I: 131.094629,\n  K: 146.105528,\n  L: 131.094629,\n  M: 149.051049,\n  N: 132.053492,\n  O: 255.158292,\n  P: 115.063329,\n  Q: 146.069142,\n  R: 174.111676,\n  S: 105.042593,\n  T: 119.058243,\n  U: 168.964203,\n  V: 117.078979,\n  W: 204.089878,\n  Y: 181.073893\n};\n\nmodule.exports.extended_protein_values = {\n  A: \"A\",\n  B: \"ND\",\n  C: \"C\",\n  D: \"D\",\n  E: \"E\",\n  F: \"F\",\n  G: \"G\",\n  H: \"H\",\n  I: \"I\",\n  J: \"IL\",\n  K: \"K\",\n  L: \"L\",\n  M: \"M\",\n  N: \"N\",\n  O: \"O\",\n  P: \"P\",\n  Q: \"Q\",\n  R: \"R\",\n  S: \"S\",\n  T: \"T\",\n  U: \"U\",\n  V: \"V\",\n  W: \"W\",\n  X: \"ACDEFGHIKLMNPQRSTVWY\",\n  // # TODO - Include U and O in the possible values of X?\n  // # This could alter the extended_protein_weight_ranges ...\n  // # by MP: Won't do this, because they are so rare.\n  Y: \"Y\",\n  Z: \"QE\",\n  \"*\": \"\\\\*\\\\.\",\n  \".\": \"\\\\.\\\\.\",\n  \"-\": \"\\\\-\"\n};\n\n// protein_weight_ranges = _make_ranges(protein_weights)\n\n// extended_protein_weight_ranges, avg_extended_protein_weights = \\\n//                _make_ambiguous_ranges(extended_protein_values,\n//                                       protein_weights)\n\n// # For Center of Mass Calculation.\n// # Taken from http://www.chem.qmul.ac.uk/iupac/AtWt/ & PyMol\nmodule.exports.atom_weights = {\n  H: 1.00794,\n  D: 2.0141,\n  He: 4.002602,\n  Li: 6.941,\n  Be: 9.012182,\n  B: 10.811,\n  C: 12.0107,\n  N: 14.0067,\n  O: 15.9994,\n  F: 18.9984032,\n  Ne: 20.1797,\n  Na: 22.98977,\n  Mg: 24.305,\n  Al: 26.981538,\n  Si: 28.0855,\n  P: 30.973761,\n  S: 32.065,\n  Cl: 35.453,\n  Ar: 39.948,\n  K: 39.0983,\n  Ca: 40.078,\n  Sc: 44.95591,\n  Ti: 47.867,\n  V: 50.9415,\n  Cr: 51.9961,\n  Mn: 54.938049,\n  Fe: 55.845,\n  Co: 58.9332,\n  Ni: 58.6934,\n  Cu: 63.546,\n  Zn: 65.39,\n  Ga: 69.723,\n  Ge: 72.64,\n  As: 74.9216,\n  Se: 78.96,\n  Br: 79.904,\n  Kr: 83.8,\n  Rb: 85.4678,\n  Sr: 87.62,\n  Y: 88.90585,\n  Zr: 91.224,\n  Nb: 92.90638,\n  Mo: 95.94,\n  Tc: 98.0,\n  Ru: 101.07,\n  Rh: 102.9055,\n  Pd: 106.42,\n  Ag: 107.8682,\n  Cd: 112.411,\n  In: 114.818,\n  Sn: 118.71,\n  Sb: 121.76,\n  Te: 127.6,\n  I: 126.90447,\n  Xe: 131.293,\n  Cs: 132.90545,\n  Ba: 137.327,\n  La: 138.9055,\n  Ce: 140.116,\n  Pr: 140.90765,\n  Nd: 144.24,\n  Pm: 145.0,\n  Sm: 150.36,\n  Eu: 151.964,\n  Gd: 157.25,\n  Tb: 158.92534,\n  Dy: 162.5,\n  Ho: 164.93032,\n  Er: 167.259,\n  Tm: 168.93421,\n  Yb: 173.04,\n  Lu: 174.967,\n  Hf: 178.49,\n  Ta: 180.9479,\n  W: 183.84,\n  Re: 186.207,\n  Os: 190.23,\n  Ir: 192.217,\n  Pt: 195.078,\n  Au: 196.96655,\n  Hg: 200.59,\n  Tl: 204.3833,\n  Pb: 207.2,\n  Bi: 208.98038,\n  Po: 208.98,\n  At: 209.99,\n  Rn: 222.02,\n  Fr: 223.02,\n  Ra: 226.03,\n  Ac: 227.03,\n  Th: 232.0381,\n  Pa: 231.03588,\n  U: 238.02891,\n  Np: 237.05,\n  Pu: 244.06,\n  Am: 243.06,\n  Cm: 247.07,\n  Bk: 247.07,\n  Cf: 251.08,\n  Es: 252.08,\n  Fm: 257.1,\n  Md: 258.1,\n  No: 259.1,\n  Lr: 262.11,\n  Rf: 261.11,\n  Db: 262.11,\n  Sg: 266.12,\n  Bh: 264.12,\n  Hs: 269.13,\n  Mt: 268.14\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nvar bsonObjectId = require(\"bson-objectid\");\n\nvar getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\n\nvar _require2 = require(\"ve-range-utils\"),\n    getSequenceWithinRange = _require2.getSequenceWithinRange,\n    normalizePositionByRangeLength = _require2.normalizePositionByRangeLength,\n    reversePositionInRange = _require2.reversePositionInRange;\n\nmodule.exports = function cutSequenceByRestrictionEnzyme(pSequence, circular, restrictionEnzyme) {\n  if (restrictionEnzyme.forwardRegex.length === 0 || restrictionEnzyme.reverseRegex.length === 0) {\n    var returnArray = [];\n    returnArray.error = \"Cannot cut sequence. Enzyme restriction site must be at least 1 bp long.\";\n    return returnArray;\n  }\n  var forwardRegExpPattern = new RegExp(restrictionEnzyme.forwardRegex, \"ig\");\n  var sequence = pSequence;\n\n  var cutsitesForward = cutSequence(forwardRegExpPattern, restrictionEnzyme, sequence, circular);\n  var cutsitesReverse = [];\n  if (restrictionEnzyme.forwardRegex !== restrictionEnzyme.reverseRegex) {\n    var revSequence = getReverseComplementSequenceString(sequence);\n    cutsitesReverse = cutSequence(forwardRegExpPattern, restrictionEnzyme, revSequence, circular);\n    cutsitesReverse = cutsitesReverse.map(function (cutsite) {\n      return reverseAllPositionsOfCutsite(cutsite, sequence.length);\n    });\n  }\n  return cutsitesForward.concat(cutsitesReverse);\n\n  function reverseAllPositionsOfCutsite(cutsite, rangeLength) {\n    cutsite.start = reversePositionInRange(cutsite.start, rangeLength, false);\n    cutsite.end = reversePositionInRange(cutsite.end, rangeLength, false);\n    cutsite.topSnipPosition = reversePositionInRange(cutsite.topSnipPosition, rangeLength, true);\n    cutsite.bottomSnipPosition = reversePositionInRange(cutsite.bottomSnipPosition, rangeLength, true);\n    if (cutsite.cutsTwice) {\n      cutsite.upstreamTopSnip = reversePositionInRange(cutsite.upstreamTopSnip, rangeLength, true);\n      cutsite.upstreamBottomSnip = reversePositionInRange(cutsite.upstreamBottomSnip, rangeLength, true);\n    }\n    cutsite.recognitionSiteRange.start = reversePositionInRange(cutsite.recognitionSiteRange.start, rangeLength, false);\n    cutsite.recognitionSiteRange.end = reversePositionInRange(cutsite.recognitionSiteRange.end, rangeLength, false);\n    return assign({}, cutsite, {\n      start: cutsite.end,\n      end: cutsite.start,\n      overhangBps: getReverseComplementSequenceString(cutsite.overhangBps),\n      topSnipPosition: cutsite.bottomSnipPosition,\n      bottomSnipPosition: cutsite.topSnipPosition,\n      upstreamTopSnip: cutsite.upstreamBottomSnip,\n      upstreamBottomSnip: cutsite.upstreamTopSnip,\n      upstreamTopBeforeBottom: !!cutsite.upstreamTopBeforeBottom,\n      topSnipBeforeBottom: !!cutsite.topSnipBeforeBottom,\n      recognitionSiteRange: {\n        start: cutsite.recognitionSiteRange.end,\n        end: cutsite.recognitionSiteRange.start\n      },\n      forward: false\n    });\n  }\n};\n\nfunction cutSequence(forwardRegExpPattern, restrictionEnzyme, sequence, circular) {\n  var restrictionCutSites = [];\n  var restrictionCutSite = void 0;\n  var recognitionSiteLength = restrictionEnzyme.site.length;\n  var originalSequence = sequence;\n  var originalSequenceLength = sequence.length;\n  if (circular) {\n    //if the sequence is circular, we send in double the sequence\n    //we'll deduplicate the results afterwards!\n    sequence += sequence;\n  }\n  var currentSequenceLength = sequence.length;\n\n  var matchIndex = sequence.search(forwardRegExpPattern);\n  var startIndex = 0;\n  var subSequence = sequence;\n\n  while (matchIndex !== -1) {\n    var recognitionSiteRange = {};\n    var start = void 0; //start and end should fully enclose the enzyme snips and the recognition site!\n    var end = void 0;\n    var upstreamTopSnip = null; //upstream top snip position\n    var upstreamBottomSnip = null; //upstream bottom snip position\n    var upstreamTopBeforeBottom = false;\n    var topSnipPosition = null; //downstream top snip position\n    var bottomSnipPosition = null; //downstream bottom snip position\n    var topSnipBeforeBottom = false;\n\n    var fitsWithinSequence = false;\n    // if (matchIndex + startIndex + recognitionSiteLength - 1 >= sequence.length) { // subSequence is too short\n    //     break;\n    // }\n\n    recognitionSiteRange.start = matchIndex + startIndex;\n    start = recognitionSiteRange.start; //this might change later on!\n\n    recognitionSiteRange.end = matchIndex + recognitionSiteLength - 1 + startIndex;\n    end = recognitionSiteRange.end; //this might change later on!\n\n    //we need to get the snip sites, top and bottom for each of these cut sites\n    //as well as all of the bp's between the snip sites\n\n    //if the cutsite is type 1, it cuts both upstream and downstream of its recognition site (cutsite type 0's cut only downstream)\n    if (restrictionEnzyme.cutType === 1) {\n      //double cutter, add upstream cutsite here\n      upstreamTopSnip = recognitionSiteRange.end - restrictionEnzyme.usForward;\n      upstreamBottomSnip = recognitionSiteRange.end - restrictionEnzyme.usReverse;\n      if (upstreamTopSnip >= 0 && upstreamBottomSnip >= 0) {\n        fitsWithinSequence = true;\n        if (upstreamTopSnip < upstreamBottomSnip) {\n          if (start > upstreamTopSnip) {\n            start = upstreamTopSnip + 1;\n          }\n          upstreamTopBeforeBottom = true;\n        } else {\n          if (start > upstreamBottomSnip) {\n            start = upstreamBottomSnip + 1;\n          }\n        }\n        upstreamTopSnip = normalizePositionByRangeLength(upstreamTopSnip, originalSequenceLength, true);\n        upstreamBottomSnip = normalizePositionByRangeLength(upstreamBottomSnip, originalSequenceLength, true);\n      } else {\n        upstreamTopSnip = null;\n        upstreamBottomSnip = null;\n      }\n    }\n\n    //add downstream cutsite here\n    topSnipPosition = recognitionSiteRange.start + restrictionEnzyme.topSnipOffset;\n    bottomSnipPosition = recognitionSiteRange.start + restrictionEnzyme.bottomSnipOffset;\n    if (bottomSnipPosition <= currentSequenceLength && topSnipPosition <= currentSequenceLength) {\n      fitsWithinSequence = true;\n      if (topSnipPosition > bottomSnipPosition) {\n        if (topSnipPosition > recognitionSiteRange.end) {\n          end = topSnipPosition - 1;\n        }\n      } else {\n        if (bottomSnipPosition > recognitionSiteRange.end) {\n          end = bottomSnipPosition - 1;\n        }\n        topSnipBeforeBottom = true;\n      }\n      topSnipPosition = normalizePositionByRangeLength(topSnipPosition, originalSequenceLength, true);\n      bottomSnipPosition = normalizePositionByRangeLength(bottomSnipPosition, originalSequenceLength, true);\n    } else {\n      topSnipPosition = null;\n      bottomSnipPosition = null;\n    }\n\n    if (fitsWithinSequence && start >= 0 && end >= 0 && start < originalSequenceLength && end < currentSequenceLength) {\n      //only push cutsites onto the array if they are fully contained within the boundaries of the sequence!\n      //and they aren't duplicated\n      start = normalizePositionByRangeLength(start, originalSequenceLength, false);\n      end = normalizePositionByRangeLength(end, originalSequenceLength, false);\n      recognitionSiteRange.start = normalizePositionByRangeLength(recognitionSiteRange.start, originalSequenceLength, false);\n      recognitionSiteRange.end = normalizePositionByRangeLength(recognitionSiteRange.end, originalSequenceLength, false);\n      var cutRange = {\n        start: -1,\n        end: -1\n      };\n\n      if (topSnipPosition !== bottomSnipPosition) {\n        //there is only a cut range if the snips don't snip at the exact same spot on top and bottom\n        cutRange = topSnipBeforeBottom ? {\n          start: topSnipPosition,\n          end: normalizePositionByRangeLength(bottomSnipPosition - 1, originalSequenceLength)\n        } : {\n          start: bottomSnipPosition,\n          end: normalizePositionByRangeLength(topSnipPosition - 1, originalSequenceLength)\n        };\n      }\n      var overhangBps = getSequenceWithinRange(cutRange, originalSequence);\n\n      restrictionCutSite = {\n        id: bsonObjectId().str,\n        start: start,\n        end: end,\n        topSnipPosition: topSnipPosition,\n        bottomSnipPosition: bottomSnipPosition,\n        topSnipBeforeBottom: topSnipBeforeBottom,\n        overhangBps: overhangBps,\n        overhangSize: overhangBps.length,\n        upstreamTopBeforeBottom: upstreamTopBeforeBottom,\n        upstreamTopSnip: upstreamTopSnip,\n        annotationTypePlural: \"cutsites\",\n        upstreamBottomSnip: upstreamBottomSnip,\n        recognitionSiteRange: recognitionSiteRange,\n        forward: true,\n        name: restrictionEnzyme.name,\n        restrictionEnzyme: restrictionEnzyme\n      };\n      restrictionCutSites.push(restrictionCutSite);\n    }\n\n    // Make sure that we always store the previous match index to ensure\n    // that we are always storing indices relative to the whole sequence,\n    // not just the subSequence.\n    startIndex = startIndex + matchIndex + 1;\n\n    // Search again on subSequence, starting from the index of the last match + 1.\n    subSequence = sequence.substring(startIndex, sequence.length);\n    matchIndex = subSequence.search(forwardRegExpPattern);\n  }\n  return restrictionCutSites;\n}","\"use strict\";\n\nvar getAminoAcidDataForEachBaseOfDna = require(\"./getAminoAcidDataForEachBaseOfDna\");\n\nmodule.exports = function getAminoAcidStringFromSequenceString(sequenceString) {\n  var aminoAcidsPerBase = getAminoAcidDataForEachBaseOfDna(sequenceString, true);\n  var aaArray = [];\n  var aaString = \"\";\n  aminoAcidsPerBase.forEach(function (aa) {\n    if (!aa.fullCodon) {\n      return;\n    }\n    aaArray[aa.aminoAcidIndex] = aa.aminoAcid.value;\n  });\n  aaString = aaArray.join(\"\");\n  return aaString;\n};","\"use strict\";\n\nvar DNAComplementMap = require(\"./DNAComplementMap\");\n// const ac = require('ve-api-check');\n// ac.throw([ac.string,ac.bool],arguments);\nmodule.exports = function getComplementSequenceString(sequence) {\n  // ac.throw([ac.string],arguments);\n  var complementSeqString = \"\";\n  for (var i = 0; i < sequence.length; i++) {\n    var complementChar = DNAComplementMap[sequence[i]];\n    if (!complementChar) {\n      complementChar = sequence[i];\n      // throw new Error('trying to get the reverse compelement of an invalid base');\n    }\n    complementSeqString += complementChar;\n  }\n  return complementSeqString;\n};","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = function convertRangeIndices(range, inputType, outputType) {\n    inputType = inputType || {};\n    outputType = outputType || {};\n    return assign({}, range, {\n        start: Number(range.start) + (inputType.inclusive1BasedStart ? outputType.inclusive1BasedStart ? 0 : -1 : outputType.inclusive1BasedStart ? 1 : 0),\n        end: Number(range.end) + (inputType.inclusive1BasedEnd ? outputType.inclusive1BasedEnd ? 0 : -1 : outputType.inclusive1BasedEnd ? 1 : 0)\n    });\n};","\"use strict\";\n\n//TNR: THIS METHOD ONLY WORKS FOR COMPARING 0-BASED RANGES!!!!!!\nvar trimRangeByAnotherRange = require(\"./trimRangeByAnotherRange\");\nmodule.exports = function isRangeWithinRange(rangeToCheck, containingRange, maxLength) {\n\n  var ranges = trimRangeByAnotherRange(rangeToCheck, containingRange, maxLength);\n  if (ranges === null) return false;\n  return !ranges;\n};","\"use strict\";\n\nvar DNAComplementMap = {\n  \".\": \".\",\n  a: \"t\",\n  t: \"a\",\n  u: \"a\",\n  c: \"g\",\n  g: \"c\",\n  A: \"T\",\n  T: \"A\",\n  U: \"A\",\n  C: \"G\",\n  G: \"C\",\n  r: \"y\",\n  R: \"Y\",\n  y: \"r\",\n  Y: \"R\",\n  d: \"h\",\n  D: \"H\",\n  h: \"d\",\n  H: \"D\",\n  k: \"m\",\n  K: \"M\",\n  m: \"k\",\n  M: \"K\",\n  v: \"b\",\n  V: \"B\",\n  b: \"v\",\n  B: \"V\"\n  //tnrtodo add more letters here\n};\n\nmodule.exports = DNAComplementMap;","\"use strict\";\n\nvar aminoAcidToDegenerateRnaMap = {\n  \"-\": \"---\",\n  \".\": \"...\",\n  \"*\": \"trr\",\n  a: \"gcn\",\n  b: \"ray\",\n  c: \"ugy\",\n  d: \"gay\",\n  e: \"gar\",\n  f: \"uuy\",\n  g: \"ggn\",\n  h: \"cay\",\n  i: \"auh\",\n  j: \"hun\",\n  k: \"aar\",\n  l: \"yun\",\n  m: \"aug\",\n  n: \"aay\",\n  o: \"uag\",\n  p: \"ccn\",\n  q: \"car\",\n  r: \"mgn\",\n  s: \"wsn\",\n  t: \"acn\",\n  u: \"uga\",\n  v: \"gun\",\n  w: \"ugg\",\n  x: \"nnn\",\n  y: \"uay\",\n  z: \"sar\"\n};\nmodule.exports = aminoAcidToDegenerateRnaMap;","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"ve-range-utils\"),\n    getRangeLength = _require.getRangeLength;\n\nvar _require2 = require(\"lodash\"),\n    map = _require2.map,\n    cloneDeep = _require2.cloneDeep;\n\nvar convertDnaCaretPositionOrRangeToAa = require(\"./convertDnaCaretPositionOrRangeToAA\");\nvar rotateSequenceDataToPosition = require(\"./rotateSequenceDataToPosition\");\n\nvar _require3 = require(\"ve-range-utils\"),\n    adjustRangeToDeletionOfAnotherRange = _require3.adjustRangeToDeletionOfAnotherRange;\n\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\nvar modifiableTypes = require(\"./annotationTypes\").modifiableTypes;\nvar adjustBpsToReplaceOrInsert = require(\"./adjustBpsToReplaceOrInsert\");\nvar adjustAnnotationsToInsert = require(\"./adjustAnnotationsToInsert\");\n\nmodule.exports = function insertSequenceDataAtPositionOrRange(_sequenceDataToInsert, _existingSequenceData, caretPositionOrRange) {\n  var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n\n  //maintainOriginSplit means that if you're inserting around the origin with n bps selected before the origin\n  //when inserting new seq, n bps of the new seq should go in before the origin and the rest should be\n  //inserted at the sequence start\n  var maintainOriginSplit = options.maintainOriginSplit;\n\n  var existingSequenceData = tidyUpSequenceData(_existingSequenceData, options);\n  var sequenceDataToInsert = tidyUpSequenceData(_sequenceDataToInsert, options);\n  var newSequenceData = cloneDeep(existingSequenceData);\n  var insertLength = sequenceDataToInsert.proteinSequence ? sequenceDataToInsert.proteinSequence.length * 3 : sequenceDataToInsert.sequence.length;\n  var caretPosition = caretPositionOrRange;\n\n  var isInsertSameLengthAsSelection = sequenceDataToInsert.sequence.length === getRangeLength(caretPositionOrRange, existingSequenceData.sequence.length);\n\n  if (caretPositionOrRange.start > -1 && getRangeLength(caretPositionOrRange, existingSequenceData.sequence.length) === existingSequenceData.sequence.length) {\n    //handle the case where we're deleting everything!\n    existingSequenceData = tidyUpSequenceData(_extends({}, existingSequenceData, modifiableTypes.reduce(function (acc, type) {\n      return acc[type] = [];\n    }, {}), {\n      sequence: \"\",\n      proteinSequence: \"\",\n      chromatogramData: undefined\n    }), options);\n    newSequenceData.chromatogramData = undefined;\n  } else if (newSequenceData.chromatogramData && newSequenceData.chromatogramData.baseTraces) {\n    //handle chromatogramData updates\n    if (caretPositionOrRange && caretPositionOrRange.start > -1) {\n      if (caretPositionOrRange.start > caretPositionOrRange.end) {\n        newSequenceData.chromatogramData = trimChromatogram({\n          chromatogramData: newSequenceData.chromatogramData,\n          range: {\n            start: caretPositionOrRange.start,\n            end: newSequenceData.sequence.length\n          },\n          justBaseCalls: isInsertSameLengthAsSelection\n        });\n        newSequenceData.chromatogramData = trimChromatogram({\n          chromatogramData: newSequenceData.chromatogramData,\n          range: {\n            start: 0,\n            end: caretPositionOrRange.end\n          },\n          justBaseCalls: isInsertSameLengthAsSelection\n        });\n      } else {\n        newSequenceData.chromatogramData = trimChromatogram({\n          chromatogramData: newSequenceData.chromatogramData,\n          range: {\n            start: caretPositionOrRange.start,\n            end: caretPositionOrRange.end\n          },\n          justBaseCalls: isInsertSameLengthAsSelection\n        });\n      }\n    }\n    if (sequenceDataToInsert.sequence) {\n      insertIntoChromatogram({\n        chromatogramData: newSequenceData.chromatogramData,\n        caretPosition: caretPositionOrRange.start > -1 ? caretPositionOrRange.start : caretPositionOrRange,\n        seqToInsert: sequenceDataToInsert.sequence,\n        justBaseCalls: isInsertSameLengthAsSelection\n      });\n    }\n  }\n\n  //update the sequence\n  newSequenceData.sequence = adjustBpsToReplaceOrInsert(existingSequenceData.sequence, sequenceDataToInsert.sequence, caretPositionOrRange);\n  newSequenceData.size = newSequenceData.sequence.length;\n  newSequenceData.proteinSequence = adjustBpsToReplaceOrInsert(existingSequenceData.proteinSequence, sequenceDataToInsert.proteinSequence, convertDnaCaretPositionOrRangeToAa(caretPositionOrRange));\n  newSequenceData.proteinSize = newSequenceData.proteinSequence.length;\n\n  //handle the insert\n  modifiableTypes.forEach(function (annotationType) {\n    var existingAnnotations = existingSequenceData[annotationType];\n    //update the annotations:\n    //handle the delete if necessary\n    if (caretPositionOrRange && caretPositionOrRange.start > -1) {\n      //we have a range! so let's delete it!\n      var range = caretPositionOrRange;\n      caretPosition = range.start > range.end ? 0 : range.start;\n      //update all annotations for the deletion\n      existingAnnotations = adjustAnnotationsToDelete(existingAnnotations, range, existingSequenceData.sequence.length);\n    }\n    //first clear the newSequenceData's annotations\n    newSequenceData[annotationType] = [];\n    //in two steps adjust the annotations to the insert\n    newSequenceData[annotationType] = newSequenceData[annotationType].concat(adjustAnnotationsToInsert(existingAnnotations, caretPosition, insertLength));\n    newSequenceData[annotationType] = newSequenceData[annotationType].concat(adjustAnnotationsToInsert(sequenceDataToInsert[annotationType], 0, caretPosition));\n  });\n  if (maintainOriginSplit && caretPositionOrRange && caretPositionOrRange.start > caretPositionOrRange.end) {\n    //we're replacing around the origin and maintainOriginSplit=true\n    //so rotate the resulting seqData n bps\n    var caretPosToRotateTo = existingSequenceData.sequence.length - caretPositionOrRange.start;\n    return rotateSequenceDataToPosition(newSequenceData, Math.min(caretPosToRotateTo, insertLength));\n  }\n  return newSequenceData;\n};\n\nfunction adjustAnnotationsToDelete(annotationsToBeAdjusted, range, maxLength) {\n  return map(annotationsToBeAdjusted, function (annotation) {\n    var newRange = adjustRangeToDeletionOfAnotherRange(annotation, range, maxLength);\n    var newLocations = annotation.locations && annotation.locations.map(function (loc) {\n      return adjustRangeToDeletionOfAnotherRange(loc, range, maxLength);\n    }).filter(function (range) {\n      return !!range;\n    });\n    if (newLocations && newLocations.length) {\n      return _extends({}, newRange, {\n        start: newLocations[0].start,\n        end: newLocations[newLocations.length - 1].end\n      }, newLocations.length > 1 && { locations: newLocations });\n    } else {\n      return newRange;\n    }\n  }).filter(function (range) {\n    return !!range;\n  }); //filter any fully deleted ranges\n}\n\nfunction insertIntoChromatogram(_ref) {\n  var _chromatogramData$bas, _chromatogramData$bas2, _chromatogramData$qua;\n\n  var chromatogramData = _ref.chromatogramData,\n      caretPosition = _ref.caretPosition,\n      seqToInsert = _ref.seqToInsert,\n      justBaseCalls = _ref.justBaseCalls;\n\n  if (!seqToInsert.length) return;\n\n  chromatogramData.baseCalls && (_chromatogramData$bas = chromatogramData.baseCalls).splice.apply(_chromatogramData$bas, [caretPosition, 0].concat(seqToInsert.split(\"\")));\n  if (justBaseCalls) {\n    //return early if just base calls\n    return chromatogramData;\n  }\n\n  var baseTracesToInsert = [];\n  var qualNumsToInsert = [];\n\n  for (var index = 0; index < seqToInsert.length; index++) {\n    qualNumsToInsert.push(0);\n    var toPush = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n    baseTracesToInsert.push({\n      aTrace: toPush,\n      cTrace: toPush,\n      gTrace: toPush,\n      tTrace: toPush\n    });\n  }\n\n  chromatogramData.baseTraces && (_chromatogramData$bas2 = chromatogramData.baseTraces).splice.apply(_chromatogramData$bas2, [caretPosition, 0].concat(baseTracesToInsert));\n  chromatogramData.qualNums && (_chromatogramData$qua = chromatogramData.qualNums).splice.apply(_chromatogramData$qua, [caretPosition, 0].concat(qualNumsToInsert));\n\n  return chromatogramData;\n}\n\nfunction trimChromatogram(_ref2) {\n  var chromatogramData = _ref2.chromatogramData,\n      _ref2$range = _ref2.range,\n      start = _ref2$range.start,\n      end = _ref2$range.end,\n      justBaseCalls = _ref2.justBaseCalls;\n\n  [\"baseCalls\"].concat(justBaseCalls ? [] : [\"qualNums\", \"baseTraces\", \"basePos\"]).forEach(function (type) {\n    chromatogramData[type] && chromatogramData[type].splice(start, end - start + 1);\n  });\n\n  return chromatogramData;\n}","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nmodule.exports = function convertDnaCaretPositionOrRangeToAA(rangeOrCaret) {\n  if ((typeof rangeOrCaret === \"undefined\" ? \"undefined\" : _typeof(rangeOrCaret)) === \"object\" && rangeOrCaret !== null) {\n    return convertDnaRangeToAARange(_extends({}, rangeOrCaret, {\n      locations: rangeOrCaret.locations ? rangeOrCaret.locations.map(convertDnaRangeToAARange) : undefined\n    }));\n  } else {\n    return convertDnaCaretPositionToAACaretPosition(rangeOrCaret);\n  }\n};\n\nfunction convertDnaCaretPositionToAACaretPosition(caret) {\n  return Math.floor(caret / 3);\n}\n\nfunction convertDnaRangeToAARange(range) {\n  return _extends({}, range, {\n    start: range.start > -1 ? Math.floor(range.start / 3) : range.start,\n    end: range.end > -1 ? Math.floor(range.end - 2) / 3 : range.end\n  });\n}","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"ve-range-utils\"),\n    adjustRangeToInsert = _require.adjustRangeToInsert;\n\nvar _require2 = require(\"lodash\"),\n    map = _require2.map;\n\nmodule.exports = function adjustAnnotationsToInsert(annotationsToBeAdjusted, insertStart, insertLength) {\n  return map(annotationsToBeAdjusted, function (annotation) {\n    return _extends({}, adjustRangeToInsert(annotation, insertStart, insertLength), annotation.locations && {\n      locations: annotation.locations.map(function (loc) {\n        return adjustRangeToInsert(loc, insertStart, insertLength);\n      })\n    });\n  });\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    flatMap = _require.flatMap,\n    extend = _require.extend,\n    forEach = _require.forEach,\n    startCase = _require.startCase;\n\nvar _require2 = require(\"ve-range-utils\"),\n    getRangeLength = _require2.getRangeLength;\n\nvar convertDnaCaretPositionOrRangeToAa = require(\"./convertDnaCaretPositionOrRangeToAA\");\nvar insertSequenceDataAtPosition = require(\"./insertSequenceDataAtPosition\");\n\nvar _require3 = require(\"ve-range-utils\"),\n    getSequenceWithinRange = _require3.getSequenceWithinRange,\n    getZeroedRangeOverlaps = _require3.getZeroedRangeOverlaps;\n\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\nvar annotationTypes = require(\"./annotationTypes\");\n\nmodule.exports = function getSequenceDataBetweenRange(seqData, range) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n\n  if (!range) return seqData;\n  var _options$exclude = options.exclude,\n      exclude = _options$exclude === undefined ? {} : _options$exclude,\n      _options$excludeParti = options.excludePartial,\n      excludePartial = _options$excludeParti === undefined ? {} : _options$excludeParti;\n\n  var seqDataToUse = tidyUpSequenceData(seqData, options);\n  annotationTypes.forEach(function (type) {\n    delete seqDataToUse[\"filtered\" + startCase(type)];\n  });\n  var seqDataToReturn = extend({}, seqDataToUse, {\n    circular: seqDataToUse.sequence.length === getRangeLength(range, seqData.sequence.length) ? seqDataToUse.circular : false,\n    sequence: getSequenceWithinRange(range, seqDataToUse.sequence),\n    proteinSequence: getSequenceWithinRange(convertDnaCaretPositionOrRangeToAa(range), seqDataToUse.proteinSequence)\n  }, annotationTypes.reduce(function (acc, type) {\n    if (exclude[type]) {\n      acc[type] = [];\n      return acc; //return early cause we're not interested in these annotations\n    }\n    acc[type] = getAnnotationsBetweenRange(seqDataToUse[type], range, seqDataToUse.sequence.length, excludePartial[type]);\n    return acc;\n  }, {}));\n  if (range.overlapsSelf) {\n    var extendedSeqData = insertSequenceDataAtPosition({ sequence: seqDataToReturn.sequence }, seqDataToUse, range.start);\n\n    var toRet = getSequenceDataBetweenRange(extendedSeqData, {\n      start: range.end + 1,\n      end: range.end\n    }, options);\n    annotationTypes.forEach(function (type) {\n      //we need to go through and adjust any anns where overlapsSelf=true to no longer overlap themselves if they match the range completely\n      forEach(toRet[type], function (ann) {\n        if (ann.overlapsSelf && ann.start === 0 && getRangeLength(ann, seqDataToUse.sequence.length) === getRangeLength(range, seqDataToUse.sequence.length)) {\n          ann.overlapsSelf = false;\n          ann.end = toRet.sequence.length - 1;\n        }\n      });\n    });\n    return tidyUpSequenceData(toRet, options);\n  }\n\n  return tidyUpSequenceData(seqDataToReturn, options);\n};\n\nfunction getAnnotationsBetweenRange(annotationsToBeAdjusted, range, maxLength, shouldExcludePartial) {\n  return flatMap(annotationsToBeAdjusted, function (annotation) {\n    if (annotation.locations && annotation.locations.length) {\n      annotation.locations = getAnnotationsBetweenRange(annotation.locations, range, maxLength, shouldExcludePartial);\n    }\n    //map through every annotation and get the overlap of the annotation with the range\n    var overlaps = getZeroedRangeOverlaps(annotation, range, maxLength).map(function (overlap) {\n      //we get back 1 or more overlaps here\n\n      return extend({}, annotation, overlap);\n    });\n    if (shouldExcludePartial) {\n      if (overlaps.length > 1) return []; //the annotation has multiple overlaps and thus must be a partial copy so we exclude it completely\n      if (overlaps[0]) {\n        //there is just 1 overlap, if it doesn't have the same length, it must be a partial copy so we need to exclude it\n        if (getRangeLength(overlaps[0], maxLength) !== getRangeLength(annotation, maxLength)) {\n          return [];\n        }\n      }\n    }\n    return overlaps;\n  }); //filter any fully deleted ranges\n}","//download.js v4.2, by dandavis; 2008-2016. [MIT] see http://danml.com/download.html for tests/usage\n// v1 landed a FF+Chrome compat way of downloading strings to local un-named files, upgraded to use a hidden frame and optional mime\n// v2 added named files via a[download], msSaveBlob, IE (10+) support, and window.URL support for larger+faster saves than dataURLs\n// v3 added dataURL and Blob Input, bind-toggle arity, and legacy dataURL fallback was improved with force-download mime and base64 support. 3.1 improved safari handling.\n// v4 adds AMD/UMD, commonJS, and plain browser support\n// v4.1 adds url download capability via solo URL argument (same domain/CORS only)\n// v4.2 adds semantic variable names, long (over 2MB) dataURL support, and hidden by default temp anchors\n// https://github.com/rndme/download\n\n(function (root, factory) {\n\tif (typeof define === 'function' && define.amd) {\n\t\t// AMD. Register as an anonymous module.\n\t\tdefine([], factory);\n\t} else if (typeof exports === 'object') {\n\t\t// Node. Does not work with strict CommonJS, but\n\t\t// only CommonJS-like environments that support module.exports,\n\t\t// like Node.\n\t\tmodule.exports = factory();\n\t} else {\n\t\t// Browser globals (root is window)\n\t\troot.download = factory();\n  }\n}(this, function () {\n\n\treturn function download(data, strFileName, strMimeType) {\n\n\t\tvar self = window, // this script is only for browsers anyway...\n\t\t\tdefaultMime = \"application/octet-stream\", // this default mime also triggers iframe downloads\n\t\t\tmimeType = strMimeType || defaultMime,\n\t\t\tpayload = data,\n\t\t\turl = !strFileName && !strMimeType && payload,\n\t\t\tanchor = document.createElement(\"a\"),\n\t\t\ttoString = function(a){return String(a);},\n\t\t\tmyBlob = (self.Blob || self.MozBlob || self.WebKitBlob || toString),\n\t\t\tfileName = strFileName || \"download\",\n\t\t\tblob,\n\t\t\treader;\n\t\t\tmyBlob= myBlob.call ? myBlob.bind(self) : Blob ;\n\t  \n\t\tif(String(this)===\"true\"){ //reverse arguments, allowing download.bind(true, \"text/xml\", \"export.xml\") to act as a callback\n\t\t\tpayload=[payload, mimeType];\n\t\t\tmimeType=payload[0];\n\t\t\tpayload=payload[1];\n\t\t}\n\n\n\t\tif(url && url.length< 2048){ // if no filename and no mime, assume a url was passed as the only argument\n\t\t\tfileName = url.split(\"/\").pop().split(\"?\")[0];\n\t\t\tanchor.href = url; // assign href prop to temp anchor\n\t\t  \tif(anchor.href.indexOf(url) !== -1){ // if the browser determines that it's a potentially valid url path:\n        \t\tvar ajax=new XMLHttpRequest();\n        \t\tajax.open( \"GET\", url, true);\n        \t\tajax.responseType = 'blob';\n        \t\tajax.onload= function(e){ \n\t\t\t\t  download(e.target.response, fileName, defaultMime);\n\t\t\t\t};\n        \t\tsetTimeout(function(){ ajax.send();}, 0); // allows setting custom ajax headers using the return:\n\t\t\t    return ajax;\n\t\t\t} // end if valid url?\n\t\t} // end if url?\n\n\n\t\t//go ahead and download dataURLs right away\n\t\tif(/^data:([\\w+-]+\\/[\\w+.-]+)?[,;]/.test(payload)){\n\t\t\n\t\t\tif(payload.length > (1024*1024*1.999) && myBlob !== toString ){\n\t\t\t\tpayload=dataUrlToBlob(payload);\n\t\t\t\tmimeType=payload.type || defaultMime;\n\t\t\t}else{\t\t\t\n\t\t\t\treturn navigator.msSaveBlob ?  // IE10 can't do a[download], only Blobs:\n\t\t\t\t\tnavigator.msSaveBlob(dataUrlToBlob(payload), fileName) :\n\t\t\t\t\tsaver(payload) ; // everyone else can save dataURLs un-processed\n\t\t\t}\n\t\t\t\n\t\t}else{//not data url, is it a string with special needs?\n\t\t\tif(/([\\x80-\\xff])/.test(payload)){\t\t\t  \n\t\t\t\tvar i=0, tempUiArr= new Uint8Array(payload.length), mx=tempUiArr.length;\n\t\t\t\tfor(i;i<mx;++i) tempUiArr[i]= payload.charCodeAt(i);\n\t\t\t \tpayload=new myBlob([tempUiArr], {type: mimeType});\n\t\t\t}\t\t  \n\t\t}\n\t\tblob = payload instanceof myBlob ?\n\t\t\tpayload :\n\t\t\tnew myBlob([payload], {type: mimeType}) ;\n\n\n\t\tfunction dataUrlToBlob(strUrl) {\n\t\t\tvar parts= strUrl.split(/[:;,]/),\n\t\t\ttype= parts[1],\n\t\t\tdecoder= parts[2] == \"base64\" ? atob : decodeURIComponent,\n\t\t\tbinData= decoder( parts.pop() ),\n\t\t\tmx= binData.length,\n\t\t\ti= 0,\n\t\t\tuiArr= new Uint8Array(mx);\n\n\t\t\tfor(i;i<mx;++i) uiArr[i]= binData.charCodeAt(i);\n\n\t\t\treturn new myBlob([uiArr], {type: type});\n\t\t }\n\n\t\tfunction saver(url, winMode){\n\n\t\t\tif ('download' in anchor) { //html5 A[download]\n\t\t\t\tanchor.href = url;\n\t\t\t\tanchor.setAttribute(\"download\", fileName);\n\t\t\t\tanchor.className = \"download-js-link\";\n\t\t\t\tanchor.innerHTML = \"downloading...\";\n\t\t\t\tanchor.style.display = \"none\";\n\t\t\t\tdocument.body.appendChild(anchor);\n\t\t\t\tsetTimeout(function() {\n\t\t\t\t\tanchor.click();\n\t\t\t\t\tdocument.body.removeChild(anchor);\n\t\t\t\t\tif(winMode===true){setTimeout(function(){ self.URL.revokeObjectURL(anchor.href);}, 250 );}\n\t\t\t\t}, 66);\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\t// handle non-a[download] safari as best we can:\n\t\t\tif(/(Version)\\/(\\d+)\\.(\\d+)(?:\\.(\\d+))?.*Safari\\//.test(navigator.userAgent)) {\n\t\t\t\tif(/^data:/.test(url))\turl=\"data:\"+url.replace(/^data:([\\w\\/\\-\\+]+)/, defaultMime);\n\t\t\t\tif(!window.open(url)){ // popup blocked, offer direct download:\n\t\t\t\t\tif(confirm(\"Displaying New Document\\n\\nUse Save As... to download, then click back to return to this page.\")){ location.href=url; }\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\t//do iframe dataURL download (old ch+FF):\n\t\t\tvar f = document.createElement(\"iframe\");\n\t\t\tdocument.body.appendChild(f);\n\n\t\t\tif(!winMode && /^data:/.test(url)){ // force a mime that will download:\n\t\t\t\turl=\"data:\"+url.replace(/^data:([\\w\\/\\-\\+]+)/, defaultMime);\n\t\t\t}\n\t\t\tf.src=url;\n\t\t\tsetTimeout(function(){ document.body.removeChild(f); }, 333);\n\n\t\t}//end saver\n\n\n\n\n\t\tif (navigator.msSaveBlob) { // IE10+ : (has Blob, but not a[download] or URL)\n\t\t\treturn navigator.msSaveBlob(blob, fileName);\n\t\t}\n\n\t\tif(self.URL){ // simple fast and modern way using Blob and URL:\n\t\t\tsaver(self.URL.createObjectURL(blob), true);\n\t\t}else{\n\t\t\t// handle non-Blob()+non-URL browsers:\n\t\t\tif(typeof blob === \"string\" || blob.constructor===toString ){\n\t\t\t\ttry{\n\t\t\t\t\treturn saver( \"data:\" +  mimeType   + \";base64,\"  +  self.btoa(blob)  );\n\t\t\t\t}catch(y){\n\t\t\t\t\treturn saver( \"data:\" +  mimeType   + \",\" + encodeURIComponent(blob)  );\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Blob but not URL support:\n\t\t\treader=new FileReader();\n\t\t\treader.onload=function(e){\n\t\t\t\tsaver(this.result);\n\t\t\t};\n\t\t\treader.readAsDataURL(blob);\n\t\t}\n\t\treturn true;\n\t}; /* end download() */\n}));\n","\"use strict\";\n\nmodule.exports = function getOverlapOfNonCircularRanges(rangeA, rangeB) {\n    if (rangeA.start < rangeB.start) {\n        if (rangeA.end < rangeB.start) {\n            //no overlap\n        } else {\n            if (rangeA.end < rangeB.end) {\n                return {\n                    start: rangeB.start,\n                    end: rangeA.end\n                };\n            } else {\n                return {\n                    start: rangeB.start,\n                    end: rangeB.end\n                };\n            }\n        }\n    } else {\n        if (rangeA.start > rangeB.end) {\n            //no overlap\n        } else {\n            if (rangeA.end < rangeB.end) {\n                return {\n                    start: rangeA.start,\n                    end: rangeA.end\n                };\n            } else {\n                return {\n                    start: rangeA.start,\n                    end: rangeB.end\n                };\n            }\n        }\n    }\n};","\"use strict\";\n\n// var ac = require('ve-api-check'); \nmodule.exports = function trimNonCicularRangeByAnotherNonCircularRange(rangeToBeTrimmed, trimmingRange) {\n    // ac.throw([ac.range, ac.range], arguments);\n    var outputTrimmedRange = void 0;\n    if (!rangeToBeTrimmed) {\n        return outputTrimmedRange;\n    }\n    if (rangeToBeTrimmed.start < trimmingRange.start) {\n        if (rangeToBeTrimmed.end < trimmingRange.start) {\n            // rrr   <range to be trimmed\n            //    ttt  <trimming range\n            outputTrimmedRange = {\n                start: rangeToBeTrimmed.start,\n                end: rangeToBeTrimmed.end\n            };\n        } else {\n            if (rangeToBeTrimmed.end > trimmingRange.end) {\n                // rrrrrr   <range to be trimmed\n                //   ttt  <trimming range\n                outputTrimmedRange = {\n                    start: rangeToBeTrimmed.start,\n                    end: rangeToBeTrimmed.end\n                };\n            } else {\n                // rrrrrr   <range to be trimmed\n                //   ttt  <trimming range\n                outputTrimmedRange = {\n                    start: rangeToBeTrimmed.start,\n                    end: trimmingRange.start - 1\n                };\n            }\n        }\n    } else {\n        if (rangeToBeTrimmed.end <= trimmingRange.end) {\n            //   rrr   <range to be trimmed\n            //  ttttt  <trimming range\n            //fully deleting the range, so do nothing\n        } else {\n            if (rangeToBeTrimmed.start > trimmingRange.end) {\n                //     rrrrrr   <range to be trimmed\n                //  ttt  <trimming range\n                outputTrimmedRange = {\n                    end: rangeToBeTrimmed.end,\n                    start: rangeToBeTrimmed.start\n                };\n            } else {\n                //    rrrrrr   <range to be trimmed\n                //  ttt  <trimming range\n                outputTrimmedRange = {\n                    end: rangeToBeTrimmed.end,\n                    start: trimmingRange.end + 1\n                };\n            }\n        }\n    }\n    return outputTrimmedRange;\n};","\"use strict\";\n\n// var ac = require('ve-api-check'); \n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nmodule.exports = function checkIfNonCircularRangesOverlap(range, comparisonRange) {\n    // ac.throw([ac.range, ac.range], arguments);\n    if (range.start < comparisonRange.start) {\n        if (range.end < comparisonRange.start) {\n            //----llll\n            //--------cccc\n            //no overlap\n            return false;\n        } else {\n            //----llll\n            //-------cccc\n            //overlap\n            return true;\n        }\n    } else {\n        if (range.start > comparisonRange.end) {\n            //------llll\n            // -cccc\n            //no overlap\n            return false;\n        } else {\n            //-----llll\n            // -cccc\n            //overlap\n            return true;\n        }\n    }\n};","'use strict';\n\n// var ac = require('ve-api-check'); \nvar checkIfNonCircularRangesOverlap = require('./checkIfNonCircularRangesOverlap');\nvar splitRangeIntoTwoPartsIfItIsCircular = require('./splitRangeIntoTwoPartsIfItIsCircular');\n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nmodule.exports = function checkIfPotentiallyCircularRangesOverlap(range, comparisonRange) {\n  // ac.throw([ac.range, ac.range], arguments);\n  //split the potentially circular ranges and compare each part for overlap\n  return splitRangeIntoTwoPartsIfItIsCircular(range, Infinity).some(function (splitRange) {\n    return splitRangeIntoTwoPartsIfItIsCircular(comparisonRange, Infinity).some(function (splitComparisonRange) {\n      return checkIfNonCircularRangesOverlap(splitRange, splitComparisonRange);\n    });\n  });\n};","\"use strict\";\n\n//this function is a little confusing, but basically it takes an array of overlaps \n//generated from a range overlaps calculation, and it sews them together if possible\nmodule.exports = function collapseOverlapsGeneratedFromRangeComparisonIfPossible(overlaps, sequenceLength, optionalOriginalRange) {\n    var originalRangeLinear = optionalOriginalRange && optionalOriginalRange.start <= optionalOriginalRange.end;\n    if (overlaps.length === 1 || overlaps.length === 0) {\n        return overlaps;\n    } else if (overlaps.length === 2) {\n        if (overlaps[0].start === 0 && overlaps[1].end + 1 === sequenceLength && !originalRangeLinear) {\n            return [{\n                start: overlaps[1].start,\n                end: overlaps[0].end\n            }];\n        } else if (overlaps[1].start === 0 && overlaps[0].end + 1 === sequenceLength && !originalRangeLinear) {\n            return [{\n                start: overlaps[0].start,\n                end: overlaps[1].end\n            }];\n        } else {\n            return overlaps;\n        }\n    } else if (overlaps.length === 3) {\n        var firstOverlap = overlaps[0];\n        var secondOverlap = overlaps[1];\n        var thirdOverlap = overlaps[2];\n        var collapsedOverlaps = collapseOverlapsGeneratedFromRangeComparisonIfPossible([firstOverlap, secondOverlap], sequenceLength, optionalOriginalRange);\n        if (collapsedOverlaps.length === 1) {\n            collapsedOverlaps.push(thirdOverlap);\n            return collapsedOverlaps;\n        } else {\n            collapsedOverlaps = collapseOverlapsGeneratedFromRangeComparisonIfPossible([firstOverlap, thirdOverlap], sequenceLength, optionalOriginalRange);\n            if (collapsedOverlaps.length === 1) {\n                collapsedOverlaps.push(secondOverlap);\n                return collapsedOverlaps;\n            } else {\n                collapsedOverlaps = collapseOverlapsGeneratedFromRangeComparisonIfPossible([secondOverlap, thirdOverlap], sequenceLength, optionalOriginalRange);\n                if (collapsedOverlaps.length === 1) {\n                    collapsedOverlaps.push(firstOverlap);\n                    return collapsedOverlaps;\n                } else {\n                    return overlaps;\n                }\n            }\n        }\n    }\n};","\"use strict\";\n\nvar splitRangeIntoTwoPartsIfItIsCircular = require(\"./splitRangeIntoTwoPartsIfItIsCircular\");\n/**\n * \n * @param {*} position //assumed to be a 0 based \"caretPosition\"\n * @param {*} range //0 based inclusive range\n * @param {*} sequenceLength \n * @param {*} includeEdges - (default false) whether or not to say \n */\nfunction isPositionWithinRange(position, range, sequenceLength, includeStartEdge, includeEndEdge) {\n  var ranges = splitRangeIntoTwoPartsIfItIsCircular(range, sequenceLength);\n  var positionFits = ranges.some(function (range) {\n    if (includeStartEdge ? position < range.start : position <= range.start) {\n      return false;\n    } else {\n      if (includeEndEdge ? position <= range.end + 1 : position <= range.end) {\n        return true;\n      } else {\n        return false;\n      }\n    }\n  });\n  return positionFits;\n}\n\nmodule.exports = isPositionWithinRange;","\"use strict\";\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = function expandOrContractCircularRangeToPosition(range, position, maxLength) {\n\n    // 0 1 2 3 4 5 6 7 8 9\n    // r r r r r - - r r r\n    //0 1 2 3 4 5 6 7 8 9 10\n    //        | \n    var newRange = assign({}, range);\n    var endMoved = true;\n    if (range.end >= position) {\n        if (position + maxLength - range.start > range.end - position) {\n            newRange.end = normalizePositionByRangeLength(position - 1, maxLength, false);\n        } else {\n            newRange.start = position;\n            endMoved = false;\n        }\n    } else {\n        if (range.start < position) {\n            if (range.end + maxLength - position > position - range.start) {\n                newRange.start = position;\n                endMoved = false;\n            } else {\n                newRange.end = position - 1;\n            }\n        } else {\n            //position somewhere between end and start\n            if (range.start - position > position - range.end) {\n                newRange.end = position - 1;\n            } else {\n                endMoved = false;\n                newRange.start = position;\n            }\n        }\n    }\n    return {\n        newRange: newRange,\n        endMoved: endMoved\n    };\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = function expandOrContractNonCircularRangeToPosition(range, position) {\n    var newRange = assign({}, range);\n    var endMoved = true;\n    if (range.start > position) {\n        newRange.start = position;\n        endMoved = false;\n    } else {\n        if (range.end < position) {\n            newRange.end = position - 1;\n        } else {\n            if (position - range.start > range.end - position) {\n                newRange.end = position - 1;\n            } else {\n                newRange.start = position;\n                endMoved = false;\n            }\n        }\n    }\n    return {\n        newRange: newRange,\n        endMoved: endMoved\n    };\n};","'use strict';\n\nvar _require = require('lodash'),\n    clone = _require.clone;\n\nvar normalizeRange = require('./normalizeRange');\nmodule.exports = function expandOrContractRangeByLength(range, shiftBy, shiftStart, sequenceLength) {\n    var rangeToReturn = clone(range);\n    if (shiftStart) {\n        rangeToReturn.start -= shiftBy;\n    } else {\n        rangeToReturn.end += shiftBy;\n    }\n    return normalizeRange(rangeToReturn, sequenceLength);\n};","\"use strict\";\n\n//normalize range takes in a range that might be slightly outside of the rangeMax and wraps the start/end as necessary to fit\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\nmodule.exports = function normalizeRange(range, sequenceLength) {\n    return assign({}, range, {\n        start: normalizePositionByRangeLength(range.start, sequenceLength),\n        end: normalizePositionByRangeLength(range.end, sequenceLength)\n    });\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\nmodule.exports = function translateRange(rangeToBeAdjusted, translateBy, rangeLength) {\n    return assign({}, rangeToBeAdjusted, {\n        start: normalizePositionByRangeLength(rangeToBeAdjusted.start + translateBy, rangeLength),\n        end: normalizePositionByRangeLength(rangeToBeAdjusted.end + translateBy, rangeLength)\n    });\n};","'use strict';\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\nvar getRangeLength = require('./getRangeLength');\nmodule.exports = function getEachPositionInRangeAsArray(range, rangeMax) {\n    var output = [];\n    var length = getRangeLength(range, rangeMax);\n    if (!(length > 0)) {\n        return output;\n    }\n    for (var i = range.start; i < length + range.start; i++) {\n        var position = normalizePositionByRangeLength(i, rangeMax);\n        output.push(position);\n    }\n    return output;\n};","\"use strict\";\n\nmodule.exports = function getShortestDistanceBetweenTwoPositions(position1, position2, sequenceLength) {\n  if (position1 < position2) {\n    var position1Holder = position1;\n    position1 = position2;\n    position2 = position1Holder;\n  }\n  //position 1 is now always >= position 2\n\n  var d1 = position1 - position2;\n  var d2 = sequenceLength - position1 + position2;\n  return Math.min(d1, d2);\n};","'use strict';\n\nvar checkIfPotentiallyCircularRangesOverlap = require('./checkIfPotentiallyCircularRangesOverlap');\nmodule.exports = function getYOffsetForPotentiallyCircularRange(range, YOffsetLevelsWithRanges, assignYOffsetToRange) {\n    //adjust the yOffset of the range being pushed in by checking its range against other range already in the row\n    var yOffset = [];\n    //YOffsetLevelsWithRanges is an array of arrays (array of yOffset levels holding arrays of range)\n    //loop through y offset levels starting with the 0 level until an empty one is found and push the range into it. If none are found, add another level. \n    var openYOffsetFound = YOffsetLevelsWithRanges.some(function (rangesAlreadyAddedToYOffset, index) {\n        var rangeBlocked = rangesAlreadyAddedToYOffset.some(function (comparisonRange) {\n            return checkIfPotentiallyCircularRangesOverlap(range, comparisonRange);\n        });\n        if (!rangeBlocked) {\n            yOffset = index;\n            if (assignYOffsetToRange) range.yOffset = index;\n            rangesAlreadyAddedToYOffset.push(range);\n            return true;\n        }\n    });\n    if (!openYOffsetFound) {\n        yOffset = YOffsetLevelsWithRanges.length;\n        if (assignYOffsetToRange) range.yOffset = YOffsetLevelsWithRanges.length;\n    }\n    return yOffset;\n};","\"use strict\";\n\n//this function takes a position that might not fit in a given range and puts it into that range\nmodule.exports = function modulatePositionByRange(position, range) {\n  var returnVal = position;\n  if (position < range.start) {\n    returnVal = range.end - (range.start - (position + 1));\n  } else if (position > range.end) {\n    returnVal = range.start + (position - range.end - 1);\n  }\n  return returnVal;\n};","'use strict';\n\n// var ac = require('ve-api-check');\n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nvar trimRangeByAnotherRange = require('./trimRangeByAnotherRange');\n/**\n * \"zeroes\" a subrange of a container range by \n * adjusting subRange start and end such that it is as if the container range start = 0.\n * @param  {object} subRange  {start:\n *                                     end:\n *                                     }\n * @param  {object} containerRange {start:\n *                                     end:\n *                                     }\n * @param  {int} sequenceLength \n * @return {object}                {start:\n *                                     end:\n *                                     }\n */\nmodule.exports = function zeroSubrangeByContainerRange(subRange, containerRange, sequenceLength) {\n    // ac.throw([ac.range, ac.range, ac.posInt], arguments);\n    //first check to make sure the container range fully contains the subRange\n    var trimmedSubRange = trimRangeByAnotherRange(subRange, containerRange, sequenceLength);\n    if (trimmedSubRange) {\n        throw new Error('subRange must be fully contained by containerRange! Otherwise this function does not make sense');\n    }\n    var newSubrange = {};\n    newSubrange.start = subRange.start - containerRange.start;\n    newSubrange.end = subRange.end - containerRange.start;\n    if (newSubrange.start < 0) {\n        newSubrange.start += sequenceLength;\n    }\n    if (newSubrange.end < 0) {\n        newSubrange.end += sequenceLength;\n    }\n    return newSubrange;\n};","\"use strict\";\n\nvar threeLetterSequenceStringToAminoAcidMap = require(\"./threeLetterSequenceStringToAminoAcidMap\");\nvar proteinAlphabet = require(\"./proteinAlphabet\");\nvar degenerateDnaToAminoAcidMap = require(\"./degenerateDnaToAminoAcidMap\");\n\n//tnrtodo: expand the threeLetterSequenceStringToAminoAcidMap mappings to include RNA characters.\n//currently stop bps aren't all mapped!\nmodule.exports = function getAminoAcidFromSequenceTriplet(sequenceString) {\n  sequenceString = sequenceString.toLowerCase();\n  if (sequenceString.length !== 3) {\n    throw new Error(\"must pass a string of length 3\");\n  }\n  var aa = threeLetterSequenceStringToAminoAcidMap[sequenceString];\n  if (aa) {\n    return aa;\n  }\n  var letter = degenerateDnaToAminoAcidMap[sequenceString.replace(\"x\", \"n\") //replace x's with n's as those are equivalent dna chars\n  ] || \"x\";\n\n  return proteinAlphabet[letter.toUpperCase()];\n};","\"use strict\";\n\nvar proteinAlphabet = require(\"./proteinAlphabet\");\nmodule.exports = {\n  gct: proteinAlphabet.A,\n  gcc: proteinAlphabet.A,\n  gca: proteinAlphabet.A,\n  gcg: proteinAlphabet.A,\n  gcu: proteinAlphabet.A,\n  cgt: proteinAlphabet.R,\n  cgc: proteinAlphabet.R,\n  cga: proteinAlphabet.R,\n  cgg: proteinAlphabet.R,\n  aga: proteinAlphabet.R,\n  agg: proteinAlphabet.R,\n  cgu: proteinAlphabet.R,\n  aat: proteinAlphabet.N,\n  aac: proteinAlphabet.N,\n  aau: proteinAlphabet.N,\n  gat: proteinAlphabet.D,\n  gac: proteinAlphabet.D,\n  gau: proteinAlphabet.D,\n  tgt: proteinAlphabet.C,\n  tgc: proteinAlphabet.C,\n  ugu: proteinAlphabet.C,\n  ugc: proteinAlphabet.C,\n  gaa: proteinAlphabet.E,\n  gag: proteinAlphabet.E,\n  caa: proteinAlphabet.Q,\n  cag: proteinAlphabet.Q,\n  ggt: proteinAlphabet.G,\n  ggc: proteinAlphabet.G,\n  gga: proteinAlphabet.G,\n  ggg: proteinAlphabet.G,\n  ggu: proteinAlphabet.G,\n  cat: proteinAlphabet.H,\n  cac: proteinAlphabet.H,\n  cau: proteinAlphabet.H,\n  att: proteinAlphabet.I,\n  atc: proteinAlphabet.I,\n  ata: proteinAlphabet.I,\n  auu: proteinAlphabet.I,\n  auc: proteinAlphabet.I,\n  aua: proteinAlphabet.I,\n  ctt: proteinAlphabet.L,\n  ctc: proteinAlphabet.L,\n  cta: proteinAlphabet.L,\n  ctg: proteinAlphabet.L,\n  tta: proteinAlphabet.L,\n  ttg: proteinAlphabet.L,\n  cuu: proteinAlphabet.L,\n  cuc: proteinAlphabet.L,\n  cua: proteinAlphabet.L,\n  cug: proteinAlphabet.L,\n  uua: proteinAlphabet.L,\n  uug: proteinAlphabet.L,\n  aaa: proteinAlphabet.K,\n  aag: proteinAlphabet.K,\n  atg: proteinAlphabet.M,\n  aug: proteinAlphabet.M,\n  ttt: proteinAlphabet.F,\n  ttc: proteinAlphabet.F,\n  uuu: proteinAlphabet.F,\n  uuc: proteinAlphabet.F,\n  cct: proteinAlphabet.P,\n  ccc: proteinAlphabet.P,\n  cca: proteinAlphabet.P,\n  ccg: proteinAlphabet.P,\n  ccu: proteinAlphabet.P,\n  tct: proteinAlphabet.S,\n  tcc: proteinAlphabet.S,\n  tca: proteinAlphabet.S,\n  tcg: proteinAlphabet.S,\n  agt: proteinAlphabet.S,\n  agc: proteinAlphabet.S,\n  ucu: proteinAlphabet.S,\n  ucc: proteinAlphabet.S,\n  uca: proteinAlphabet.S,\n  ucg: proteinAlphabet.S,\n  agu: proteinAlphabet.S,\n  act: proteinAlphabet.T,\n  acc: proteinAlphabet.T,\n  aca: proteinAlphabet.T,\n  acg: proteinAlphabet.T,\n  acu: proteinAlphabet.T,\n  tgg: proteinAlphabet.W,\n  ugg: proteinAlphabet.W,\n  tat: proteinAlphabet.Y,\n  tac: proteinAlphabet.Y,\n  uau: proteinAlphabet.Y,\n  uac: proteinAlphabet.Y,\n  gtt: proteinAlphabet.V,\n  gtc: proteinAlphabet.V,\n  gta: proteinAlphabet.V,\n  gtg: proteinAlphabet.V,\n  guu: proteinAlphabet.V,\n  guc: proteinAlphabet.V,\n  gua: proteinAlphabet.V,\n  gug: proteinAlphabet.V,\n  taa: proteinAlphabet[\"*\"],\n  tag: proteinAlphabet[\"*\"],\n  tga: proteinAlphabet[\"*\"],\n  \"...\": proteinAlphabet[\".\"],\n  \"---\": proteinAlphabet[\"-\"]\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    invert = _require.invert;\n\nvar aminoAcidToDegenerateDnaMap = require(\"./aminoAcidToDegenerateDnaMap\");\n\nvar degenerateDnaToAminoAcidMap = invert(aminoAcidToDegenerateDnaMap);\nmodule.exports = degenerateDnaToAminoAcidMap;","\"use strict\";\n\n// this is throwing a weird eslint error\n\n// var ac = require('ve-api-check');\nmodule.exports = function filterSequenceString(sequenceString) {\n  var additionalValidChars = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : \"\";\n  var charOverrides = arguments[2];\n\n  // ac.throw(ac.string,sequenceString);\n  if (sequenceString) {\n    return sequenceString.replace(new RegExp(\"[^\" + (charOverrides || \"atgcyrswkmbvdhnu\" + additionalValidChars.split(\"\").join(\"\\\\\")) + \"]\", \"gi\"), \"\");\n  } else {\n    return sequenceString;\n  }\n};","\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nvar _require = require(\"lodash\"),\n    cloneDeep = _require.cloneDeep,\n    get = _require.get,\n    some = _require.some;\n\nvar _require2 = require(\"./featureTypesAndColors\"),\n    getFeatureToColorMap = _require2.getFeatureToColorMap,\n    getFeatureTypes = _require2.getFeatureTypes;\n\nvar bsonObjectId = require(\"bson-objectid\");\n\nmodule.exports = function tidyUpAnnotation(_annotation, _ref) {\n  var _ref$sequenceData = _ref.sequenceData,\n      sequenceData = _ref$sequenceData === undefined ? {} : _ref$sequenceData,\n      convertAnnotationsFromAAIndices = _ref.convertAnnotationsFromAAIndices,\n      annotationType = _ref.annotationType,\n      provideNewIdsForAnnotations = _ref.provideNewIdsForAnnotations,\n      doNotProvideIdsForAnnotations = _ref.doNotProvideIdsForAnnotations,\n      _ref$messages = _ref.messages,\n      messages = _ref$messages === undefined ? [] : _ref$messages,\n      mutative = _ref.mutative,\n      allowNonStandardGenbankTypes = _ref.allowNonStandardGenbankTypes;\n  var size = sequenceData.size,\n      circular = sequenceData.circular,\n      isProtein = sequenceData.isProtein;\n\n  if (!_annotation || (typeof _annotation === \"undefined\" ? \"undefined\" : _typeof(_annotation)) !== \"object\") {\n    messages.push(\"Invalid annotation detected and removed\");\n    return false;\n  }\n  var annotation = _annotation;\n  if (!mutative) {\n    annotation = cloneDeep(_annotation);\n  }\n  annotation.annotationTypePlural = annotationType;\n\n  if (!annotation.name || typeof annotation.name !== \"string\") {\n    messages.push('Unable to detect valid name for annotation, setting name to \"Untitled annotation\"');\n    annotation.name = \"Untitled annotation\";\n  }\n  if (provideNewIdsForAnnotations) {\n    annotation.id = bsonObjectId().str;\n  }\n  if (!annotation.id && annotation.id !== 0 && !doNotProvideIdsForAnnotations) {\n    annotation.id = bsonObjectId().str;\n    messages.push(\"Unable to detect valid ID for annotation, setting ID to \" + annotation.id);\n  }\n\n  //run this for the annotation itself\n  coerceLocation({\n    isProtein: isProtein,\n    location: annotation,\n    convertAnnotationsFromAAIndices: convertAnnotationsFromAAIndices,\n    size: size,\n    messages: messages,\n    circular: circular,\n    name: annotation.name\n  });\n  //and for each location\n  annotation.locations && annotation.locations.forEach(function (location) {\n    coerceLocation({\n      isProtein: isProtein,\n      location: location,\n      convertAnnotationsFromAAIndices: convertAnnotationsFromAAIndices,\n      size: size,\n      messages: messages,\n      circular: circular,\n      name: annotation.name\n    });\n  });\n\n  if (isProtein || annotation.forward === true || annotation.forward === \"true\" || annotation.strand === 1 || annotation.strand === \"1\" || annotation.strand === \"+\") {\n    annotation.forward = true;\n    annotation.strand = 1;\n  } else {\n    annotation.forward = false;\n    annotation.strand = -1;\n  }\n  if (!annotation.type || typeof annotation.type !== \"string\" || !some(getFeatureTypes(), function (featureType) {\n    if (featureType.toLowerCase() === annotation.type.toLowerCase()) {\n      annotation.type = featureType; //this makes sure the annotation.type is being set to the exact value of the accepted featureType\n      return true;\n    }\n    if (allowNonStandardGenbankTypes || typeof window !== \"undefined\" && get(window, \"tg_allowNonStandardGenbankTypes\") || get(global, \"tg_allowNonStandardGenbankTypes\")) return true;\n    return false;\n  })) {\n    messages.push(\"Invalid annotation type detected:  \" + annotation.type + \" for \" + annotation.name + \". set type to misc_feature\");\n    annotation.type = \"misc_feature\";\n  }\n  if (annotation.notes && typeof annotation.notes === \"string\") {\n    try {\n      annotation.notes = JSON.parse(annotation.notes);\n    } catch (error) {\n      console.info(\"warning 33y00a0912 - couldn't parse notes for \" + (annotation.name || \"\") + \" \" + annotation.notes + \":\", error);\n    }\n  }\n\n  if (!annotation.color) {\n    annotation.color = getFeatureToColorMap()[annotation.type];\n  }\n  return annotation;\n};\n\nfunction coerceLocation(_ref2) {\n  var location = _ref2.location,\n      convertAnnotationsFromAAIndices = _ref2.convertAnnotationsFromAAIndices,\n      size = _ref2.size,\n      isProtein = _ref2.isProtein,\n      messages = _ref2.messages,\n      circular = _ref2.circular,\n      name = _ref2.name;\n\n  location.start = parseInt(location.start, 10);\n  location.end = parseInt(location.end, 10);\n\n  if (convertAnnotationsFromAAIndices) {\n    location.start = location.start * 3;\n    location.end = location.end * 3 + 2;\n  }\n  if (location.start < 0 || !(location.start <= size - 1) || location.start > size - 1) {\n    messages.push(\"Invalid annotation start: \" + location.start + \" detected for \" + location.name + \" and set to size: \" + size); //setting it to 0 internally, but users will see it as 1\n    location.start = size - (isProtein ? 3 : 1);\n  }\n  if (location.end < 0 || !(location.end <= size - 1) || location.end > size - 1) {\n    messages.push(\"Invalid annotation end:  \" + location.end + \" detected for \" + location.name + \" and set to seq size: \" + size); //setting it to 0 internally, but users will see it as 1\n    location.end = size - 1;\n  }\n  if (location.start > location.end && circular === false) {\n    messages.push(\"Invalid circular annotation detected for \" + name + \". end set to 1\"); //setting it to 0 internally, but users will see it as 1\n    location.end = size;\n  }\n}","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"lodash\"),\n    get = _require.get,\n    keyBy = _require.keyBy,\n    filter = _require.filter;\n\nvar genbankFeatureTypes = [{ name: \"-10_signal\", color: \"#4ECDC4\" }, { name: \"-35_signal\", color: \"#F7FFF7\" }, { name: \"3'clip\", color: \"#FF6B6B\" }, { name: \"3'UTR\", color: \"#FFE66D\" }, { name: \"5'clip\", color: \"#3E517A\" }, { name: \"5'UTR\", color: \"#BBBBBB\" }, { name: \"D-loop\", color: \"#F13C73\" }, { name: \"assembly_gap\", color: \"#DE9151\" }, { name: \"centromere\", color: \"#F34213\" }, { name: \"Het\", color: \"#BC5D2E\" }, { name: \"mobile_element\", color: \"#6DB1BF\" }, { name: \"ncRNA\", color: \"#FFEAEC\" }, { name: \"proprotein\", color: \"#F39A9D\" }, { name: \"regulatory\", color: \"#3F6C51\" }, { name: \"SecStr\", color: \"#7B4B94\" }, { name: \"Site\", color: \"#7D82B8\" }, { name: \"telomere\", color: \"DE9151\" }, { name: \"tmRNA\", color: \"#B7E3CC\" }, { name: \"unsure\", color: \"#C4FFB2\" }, { name: \"V_segment\", color: \"#D6F7A3\" }, { name: \"allele\", color: \"#D86D6D\" }, { name: \"attenuator\", color: \"#6B7F9C\" }, { name: \"C_region\", color: \"#B5D89D\" }, { name: \"CAAT_signal\", color: \"#E9CD98\" }, { name: \"CDS\", color: \"#EF6500\" }, { name: \"conserved\", color: \"#A3A5F0\" }, { name: \"D_segment\", color: \"#C060F7\" }, { name: \"default\", color: \"#CCCCCC\" }, { name: \"enhancer\", color: \"#38F872\" }, { name: \"exon\", color: \"#95F844\" }, { name: \"gap\", color: \"#F7D43C\" }, { name: \"GC_signal\", color: \"#861F1F\" }, { name: \"gene\", color: \"#684E27\" }, { name: \"iDNA\", color: \"#A59B41\" }, { name: \"intron\", color: \"#52963E\" }, { name: \"J_region\", color: \"#369283\" }, { name: \"LTR\", color: \"#31748F\" }, { name: \"m_rna\", color: \"#FFFF00\" }, { name: \"mat_peptide\", color: \"#353E8F\" }, { name: \"misc_binding\", color: \"#006FEF\" }, { name: \"misc_difference\", color: \"#5A368A\" }, { name: \"misc_feature\", color: \"#006FEF\" }, { name: \"misc_marker\", color: \"#8DCEB1\" }, { name: \"misc_part\", color: \"#006FEF\" }, { name: \"misc_recomb\", color: \"#DD97B4\" }, { name: \"misc_RNA\", color: \"#BD0101\" }, { name: \"misc_signal\", color: \"#FF9A04\" }, { name: \"misc_structure\", color: \"#B3FF00\" }, { name: \"modified_base\", color: \"#00F7FF\" }, { name: \"mRNA\", color: \"#FFD900\" }, { name: \"N_region\", color: \"#AE00FF\" }, { name: \"old_sequence\", color: \"#F0A7FF\" }, { name: \"operator\", color: \"#63004D\" }, { name: \"operon\", color: \"#000653\" }, { name: \"oriT\", color: \"#580000\" }, { name: \"plasmid\", color: \"#00635E\" }, { name: \"polyA_signal\", color: \"#BBBBBB\" }, { name: \"polyA_site\", color: \"#003328\" }, { name: \"precursor_RNA\", color: \"#443200\" }, { name: \"prim_transcript\", color: \"#665E4C\" }, { name: \"primer_bind\", color: \"#53d969\" }, { name: \"promoter\", color: \"#31B440\" }, { name: \"protein_bind\", color: \"#2E2E2E\" }, { name: \"protein_domain\", color: \"#4D4B4B\" }, { name: \"protein\", color: \"#696969\" }, { name: \"RBS\", color: \"#BDFFCB\" }, { name: \"rep_origin\", color: \"#878787\" }, { name: \"repeat_region\", color: \"#966363\" }, { name: \"repeat_unit\", color: \"#A16D8D\" }, { name: \"rRNA\", color: \"#9BF0FF\" }, { name: \"s_mutation\", color: \"#70A2FF\" }, { name: \"S_region\", color: \"#FF74A9\" }, { name: \"satellite\", color: \"#164E64\" }, { name: \"scRNA\", color: \"#A057FF\" }, { name: \"sig_peptide\", color: \"#2FFF8D\" }, { name: \"snoRNA\", color: \"#296B14\" }, { name: \"snRNA\", color: \"#A16249\" }, { name: \"source\", color: \"#0B17BD\" }, { name: \"start\", color: \"#D6A336\" }, { name: \"stem_loop\", color: \"#67069E\" }, { name: \"stop\", color: \"#D44FC9\" }, { name: \"STS\", color: \"#597FE7\" }, { name: \"tag\", color: \"#E419DA\" }, { name: \"TATA_signal\", color: \"#EB2B2B\" }, { name: \"terminator\", color: \"#F51600\" }, { name: \"transit_peptide\", color: \"#24D491\" }, { name: \"transposon\", color: \"#B6E436\" }, { name: \"tRNA\", color: \"#D1456F\" }, { name: \"V_region\", color: \"#7B5EE7\" }, { name: \"variation\", color: \"#2EE455\" }];\n\nvar getMergedFeatureMap = function getMergedFeatureMap() {\n  var keyedGBFeats = keyBy(genbankFeatureTypes.map(function (f) {\n    return _extends({}, f, {\n      isGenbankStandardType: true\n    });\n  }), \"name\");\n  var featureOverrides = typeof window !== \"undefined\" && get(window, \"tg_featureTypeOverrides\") || get(global, \"tg_featureTypeOverrides\");\n\n  featureOverrides = featureOverrides || [];\n  featureOverrides = featureOverrides.map(function (fo) {\n    var originalGenbankFeat = keyedGBFeats[fo.name];\n    return _extends({}, originalGenbankFeat, fo, originalGenbankFeat ? { isOverridden: true } : { isCustomType: true });\n  });\n  featureOverrides = keyBy(featureOverrides, \"name\");\n\n  return _extends({}, keyedGBFeats, featureOverrides);\n};\n\nvar getFeatureToColorMap = function getFeatureToColorMap() {\n  var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n      includeHidden = _ref.includeHidden;\n\n  var toRet = {};\n  filter(getMergedFeatureMap(), function (f) {\n    return includeHidden ? true : !f.isHidden;\n  }).forEach(function (f) {\n    toRet[f.name] = f.color;\n  });\n  return toRet;\n};\n\nvar getFeatureTypes = function getFeatureTypes() {\n  var _ref2 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n      includeHidden = _ref2.includeHidden;\n\n  return filter(getMergedFeatureMap(), function (f) {\n    return includeHidden ? true : !f.isHidden;\n  }).map(function (f) {\n    return f.name;\n  });\n};\n\nmodule.exports.genbankFeatureTypes = genbankFeatureTypes;\nmodule.exports.getGenbankFeatureToColorMap = function () {\n  var toRet = {};\n  genbankFeatureTypes.forEach(function (_ref3) {\n    var name = _ref3.name,\n        color = _ref3.color;\n\n    toRet[name] = color;\n  });\n  return toRet;\n};\nmodule.exports.getFeatureToColorMap = getFeatureToColorMap;\nmodule.exports.getFeatureTypes = getFeatureTypes;\nmodule.exports.getMergedFeatureMap = getMergedFeatureMap;","\"use strict\";\n\n// var ac = require('ve-api-check');\nmodule.exports = function filterAminoAcidSequenceString(sequenceString, options) {\n  options = options || {};\n  if (options.includeStopCodon) {\n    //tnrtodo this maybe needs the stop codon char in it?\n    return sequenceString.replace(/[^xtgalmfwkqespvicyhrndu.*]/gi, \"\");\n  }\n  // ac.throw(ac.string, sequenceString);\n  return sequenceString.replace(/[^xtgalmfwkqespvicyhrndu]/gi, \"\");\n};","\"use strict\";\n\nvar aminoAcidToDegenerateDnaMap = require(\"./aminoAcidToDegenerateDnaMap\");\n\nmodule.exports = function getDegenerateDnaStringFromAAString(aaString) {\n  return aaString.split(\"\").map(function (char) {\n    return aminoAcidToDegenerateDnaMap[char.toLowerCase()] || \"nnn\";\n  }).join(\"\");\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\n/* Copyright (C) 2018 TeselaGen Biotechnology, Inc. */\nvar _require = require(\"lodash\"),\n    forEach = _require.forEach,\n    omitBy = _require.omitBy;\n\nvar bioData = require(\"./bioData\");\nvar aminoAcidToDegenerateDnaMap = require(\"./aminoAcidToDegenerateDnaMap\");\n\nvar _require2 = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength = _require2.normalizePositionByRangeLength,\n    reversePositionInRange = _require2.reversePositionInRange;\n\nvar getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\n\nvar ambiguous_dna_values = bioData.ambiguous_dna_values;\n//seqsToAnnotateById must not be length = 0\n\nfunction autoAnnotate(_ref) {\n  var seqsToAnnotateById = _ref.seqsToAnnotateById,\n      annotationsToCheckById = _ref.annotationsToCheckById,\n      compareName = _ref.compareName,\n      warnIfMoreThan = _ref.warnIfMoreThan;\n\n  var annotationsToAddBySeqId = {};\n\n  forEach(annotationsToCheckById, function (ann) {\n    var reg = new RegExp(ann.sequence, \"gi\");\n    forEach(omitBy(seqsToAnnotateById, function (s) {\n      return !s.sequence.length;\n    }), function (_ref2, id) {\n      var circular = _ref2.circular,\n          sequence = _ref2.sequence;\n\n      function getMatches(_ref3) {\n        var seqToMatchAgainst = _ref3.seqToMatchAgainst,\n            isReverse = _ref3.isReverse,\n            seqLen = _ref3.seqLen;\n\n        var match = void 0;\n        var lastMatch = void 0;\n        // const matches = []\n        try {\n          while (match = reg.exec(seqToMatchAgainst)) {\n            var _match = match,\n                matchStart = _match.index,\n                matchSeq = _match[0];\n\n            if (matchStart >= seqLen) return;\n            var matchEnd = matchStart + matchSeq.length;\n            if (lastMatch) {\n              if (matchStart > lastMatch.start && matchEnd <= lastMatch.end) {\n                reg.lastIndex = match.index + 1;\n                continue;\n              }\n            }\n            lastMatch = {\n              start: matchStart,\n              end: matchEnd\n            };\n            var range = {\n              start: matchStart,\n              end: normalizePositionByRangeLength(matchEnd - 1, seqLen)\n            };\n            if (!annotationsToAddBySeqId[id]) annotationsToAddBySeqId[id] = [];\n            annotationsToAddBySeqId[id].push(_extends({}, isReverse ? {\n              start: reversePositionInRange(range.end, seqLen),\n              end: reversePositionInRange(range.start, seqLen)\n            } : range, {\n              strand: isReverse ? -1 : 1,\n              id: ann.id\n            }));\n\n            reg.lastIndex = match.index + 1;\n          }\n        } catch (error) {\n          console.error(\"error:\", error);\n        }\n      }\n      var seqLen = sequence.length;\n\n      var revSeq = getReverseComplementSequenceString(sequence);\n      getMatches({\n        seqLen: seqLen,\n        seqToMatchAgainst: circular ? sequence + sequence : sequence\n      });\n      getMatches({\n        seqLen: seqLen,\n        isReverse: true,\n        seqToMatchAgainst: circular ? revSeq + revSeq : revSeq\n      });\n    });\n  });\n\n  //loop through all patterns and get all matches\n\n  var toReturn = {};\n\n  forEach(annotationsToAddBySeqId, function (anns, id) {\n    var origSeq = seqsToAnnotateById[id];\n    var alreadyExistingAnnsByStartEnd = {};\n    forEach(origSeq.annotations, function (ann) {\n      alreadyExistingAnnsByStartEnd[getStartEndStr(ann, { compareName: compareName })] = ann;\n    });\n    var warningCounter = {};\n    var toAdd = anns.filter(function (ann) {\n      var alreadyExistingAnn = alreadyExistingAnnsByStartEnd[getStartEndStr(ann, { compareName: compareName })];\n      if (alreadyExistingAnn) return false;\n      if (warnIfMoreThan) {\n        warningCounter[ann.id] = (warningCounter[ann.id] || 0) + 1;\n      }\n      return true;\n    }).sort(function (a, b) {\n      return a.start - b.start;\n    });\n    if (toAdd.length) {\n      toReturn[id] = toAdd;\n    }\n    warnIfMoreThan && forEach(warningCounter, function (num, annId) {\n      if (num > warnIfMoreThan) {\n        toReturn.__more_than_warnings = toReturn.__more_than_warnings || {};\n        toReturn.__more_than_warnings[id] = toReturn.__more_than_warnings[id] || [];\n        toReturn.__more_than_warnings[id].push(annId);\n      }\n    });\n  });\n  return toReturn;\n}\n\nfunction getStartEndStr(_ref4, _ref5) {\n  var start = _ref4.start,\n      end = _ref4.end,\n      name = _ref4.name,\n      strand = _ref4.strand,\n      forward = _ref4.forward;\n  var compareName = _ref5.compareName;\n\n  var isReverse = strand === -1 || forward === false;\n  return start + \"-\" + end + \"-\" + (isReverse ? \"rev\" : \"for\") + \"-\" + (compareName ? name : \"\");\n}\n\nfunction convertApELikeRegexToRegex() {\n  var regString = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : \"\";\n\n  var newstr = \"\";\n  var rightOfCaretHolder = \"\";\n  var afterRightCaretHolder = \"\";\n  var beforeRightCaret = \"\";\n  var prevBp = void 0;\n  var hitLeftCaret = void 0;\n  var hitRightCaret = void 0;\n\n  // eslint-disable-next-line no-unused-vars\n  for (var _iterator = regString.replace(\"(\", \"\").replace(\")\", \"\"), _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : _iterator[Symbol.iterator]();;) {\n    /* eslint-disable no-loop-func*/\n    /* eslint-disable no-inner-declarations*/\n    var maybeHandleRightCaret = function maybeHandleRightCaret(justAdded) {\n      if (hitRightCaret) {\n        rightOfCaretHolder += justAdded;\n        afterRightCaretHolder = \"\" + rightOfCaretHolder + (afterRightCaretHolder.length ? \"|\" : \"\") + afterRightCaretHolder;\n      }\n    };\n    /* eslint-enable no-loop-func*/\n    /* eslint-enable no-inner-declarations*/\n\n\n    var _ref6;\n\n    if (_isArray) {\n      if (_i >= _iterator.length) break;\n      _ref6 = _iterator[_i++];\n    } else {\n      _i = _iterator.next();\n      if (_i.done) break;\n      _ref6 = _i.value;\n    }\n\n    var bp = _ref6;\n    var ambigVal = ambiguous_dna_values[bp.toUpperCase()];\n    if (ambigVal && ambigVal.length > 1) {\n      var valToUse = void 0;\n      if (ambigVal.length === 4) {\n        valToUse = \".\";\n      } else {\n        valToUse = \"[\" + ambigVal + \"]\";\n      }\n      newstr += valToUse;\n      maybeHandleRightCaret(valToUse);\n      continue;\n    }\n    if (bp === \"#\") {\n      if (hitRightCaret) throw new Error(\"Error converting regex\");\n      var _valToUse = prevBp ? \"[^\" + prevBp + \"]*?\" : \".*?\";\n      newstr += _valToUse;\n      maybeHandleRightCaret(_valToUse);\n      continue;\n    }\n    if (bp === \"<\") {\n      var _ret = function () {\n        if (hitRightCaret) throw new Error(\"Error converting to regex\");\n        if (hitLeftCaret) throw new Error(\"Error converting to regex\");\n        var holder = \"\";\n        var stringToAdd = \"\";\n        var isGroupClosed = true;\n        var closingBraceHit = void 0;\n        var groups = [];\n        for (var index = 0; index < newstr.length; index++) {\n          var char = newstr[index];\n          var nextChar = newstr[index + 1];\n          if (char === \"[\") {\n            isGroupClosed = false;\n          } else if (char === \"]\" || closingBraceHit) {\n            closingBraceHit = true;\n            if (ambiguous_dna_values[nextChar] || nextChar === \"[\") {\n              isGroupClosed = true;\n              closingBraceHit = false;\n            }\n          }\n          holder += char;\n          if (isGroupClosed) {\n            groups.push(holder);\n            holder = \"\";\n          }\n        }\n        var concattedEls = \"\";\n        groups.reverse();\n        groups.forEach(function (g) {\n          concattedEls = g + concattedEls;\n          stringToAdd = \"\" + concattedEls + (stringToAdd.length ? \"|\" : \"\") + stringToAdd;\n        });\n        newstr = \"(\" + stringToAdd + \")?\";\n        hitLeftCaret = true;\n        return \"continue\";\n      }();\n\n      if (_ret === \"continue\") continue;\n    }\n    if (bp === \">\") {\n      if (hitRightCaret) throw new Error(\"Error converting regex\");\n      hitRightCaret = true;\n      beforeRightCaret = newstr;\n      continue;\n    }\n    newstr += bp;\n    maybeHandleRightCaret(bp);\n    prevBp = bp;\n  }\n  if (hitRightCaret) {\n    newstr = beforeRightCaret + \"(\" + afterRightCaretHolder + \")?\";\n  }\n  return newstr;\n}\nfunction convertProteinSeqToDNAIupac(sequence) {\n  var toRet = \"\";\n  var l = void 0;\n  for (var _iterator2 = sequence, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : _iterator2[Symbol.iterator]();;) {\n    if (_isArray2) {\n      if (_i2 >= _iterator2.length) break;\n      l = _iterator2[_i2++];\n    } else {\n      _i2 = _iterator2.next();\n      if (_i2.done) break;\n      l = _i2.value;\n    }\n\n    var degenDna = aminoAcidToDegenerateDnaMap[l.toLowerCase()];\n    if (degenDna) {\n      toRet += degenDna;\n    } else {\n      toRet += l;\n    }\n  }\n\n  return toRet;\n}\n\nmodule.exports = {\n  convertProteinSeqToDNAIupac: convertProteinSeqToDNAIupac,\n  convertApELikeRegexToRegex: convertApELikeRegexToRegex,\n  autoAnnotate: autoAnnotate\n};","\"use strict\";\n\n// seqReads should be an array of objects [{name, seq, pos, cigar}, {name, seq, pos, cigar}, ...]\nmodule.exports = function getAllInsertionsInSeqReads(seqReads) {\n  var allInsertionsInSeqReads = [];\n  seqReads.forEach(function (seqRead) {\n    // split cigar string at M, D, or I (match, deletion, or insertion), e.g. [\"2M\", \"3I\", \"39M\", \"3D\"...]\n    var splitSeqRead = seqRead.cigar.match(/([0-9]*[MDI])/g);\n\n    for (var componentI = 0; componentI < splitSeqRead.length; componentI++) {\n      if (splitSeqRead[componentI].slice(-1) === \"I\") {\n        var bpPosOfInsertion = seqRead.pos;\n        var numberOfInsertions = Number(splitSeqRead[componentI].slice(0, -1));\n        for (var i = 0; i < componentI; i++) {\n          if (splitSeqRead[i].slice(-1) !== \"I\") {\n            var previousComponentNumber = Number(splitSeqRead[i].slice(0, -1));\n            bpPosOfInsertion += previousComponentNumber;\n          }\n        }\n        var insertionInfo = {\n          // keeping bpPos 1-based\n          bpPos: bpPosOfInsertion,\n          number: numberOfInsertions\n        };\n        allInsertionsInSeqReads.push(insertionInfo);\n      }\n    }\n  });\n  // sort insertions by ascending bp pos\n  var sortedInsertions = allInsertionsInSeqReads.sort(function (a, b) {\n    return a.bpPos - b.bpPos;\n  });\n  // combine duplicate or overlapping insertions from seq reads\n  for (var i = 0; i < sortedInsertions.length - 1; i++) {\n    if (sortedInsertions[i].bpPos === sortedInsertions[i + 1].bpPos) {\n      if (sortedInsertions[i].number > sortedInsertions[i + 1].number) {\n        // remove the one with fewer number of gaps from array\n        sortedInsertions.splice(i + 1, 1);\n        i--;\n      } else if (sortedInsertions[i].number < sortedInsertions[i + 1].number) {\n        sortedInsertions.splice(i, 1);\n        i--;\n      } else if (sortedInsertions[i].number === sortedInsertions[i + 1].number) {\n        sortedInsertions.splice(i, 1);\n        i--;\n      }\n    }\n  }\n  // sortedInsertions is an array of objects [{bpPos: bp pos of insertion, number: # of insertions}, {bpPos, number}, ...]\n  return sortedInsertions;\n};\n\n// function getAllInsertionsInSeqReads(seqReads) {\n//   let allInsertionBpPosInSeqReads = [];\n//   seqReads.forEach(seqRead => {\n//     // split cigar string at M, D, or I (match, deletion, or insertion)\n//     // [\"2M\", \"3I\", \"39M\", \"3D\"...]\n//     const splitSeqRead = seqRead.cigar.match(/([0-9]*[MDI])/g)\n//     splitSeqRead.forEach(component => {\n//       // keeping bpPos 1-based\n//       let bpPosOfInsertion = seqRead.pos;\n// if (component.slice(-1) === \"I\") {\n//   const numberOfInsertions = Number(component.slice(0, -1));\n//   const componentIndex = splitSeqRead.indexOf(component);\n//   for (let i = 0; i < componentIndex; i++) {\n//       const previousComponentNumber = Number(splitSeqRead[i].slice(0, -1));\n//       bpPosOfInsertion += previousComponentNumber;\n//     }\n//   for (let i = 1; i <= numberOfInsertions; i++) {\n//     allInsertionBpPosInSeqReads.push(bpPosOfInsertion - i);\n//   }\n// }\n//   });\n// });\n//   // allInsertionBpPosInSeqReads should be an array of bp pos [6, 15, 9, 2, 23...]\n//   // remove duplicates, organize in ascending order\n// const uniqueInsertionBpPos = [...new Set(allInsertionBpPosInSeqReads)].sort(function(a, b) { return a - b });\n//   return uniqueInsertionBpPos;\n// }","\"use strict\";\n\nvar getAllInsertionsInSeqReads = require(\"./getAllInsertionsInSeqReads.js\");\n\n// seqReads should be an array of objects [{name, seq, pos, cigar}, {name, seq, pos, cigar}, ...]\n// add gaps in reference sequence where there are insertions\nmodule.exports = function insertGapsIntoRefSeq(refSeq, seqReads) {\n  // turn ref seq into an array [\"A\", \"T\", \"C\", \"G\"...]\n  var refSeqWithGaps = refSeq.split(\"\");\n  var allInsertionsInSeqReads = getAllInsertionsInSeqReads(seqReads);\n  for (var i = 0; i < allInsertionsInSeqReads.length; i++) {\n    var bpPosOfInsertion = allInsertionsInSeqReads[i].bpPos;\n    var numberOfInsertions = allInsertionsInSeqReads[i].number;\n    // adding gaps at the bp pos of insertion\n    var insertionGaps = \"\";\n    for (var gapI = 0; gapI < numberOfInsertions; gapI++) {\n      insertionGaps += \"-\";\n    }\n    refSeqWithGaps.splice(bpPosOfInsertion - 1, 0, insertionGaps);\n    for (var posI = i + 1; posI < allInsertionsInSeqReads.length; posI++) {\n      allInsertionsInSeqReads[posI].bpPos += 1;\n    }\n  }\n  // refSeqWithGaps is a string \"GGGA--GA-C--ACC\"\n  return refSeqWithGaps.join(\"\");\n};\n\n// allInsertionsInSeqReads.forEach(insertion => {\n//       // adding gap at the bp pos of insertion\n//       refSeqWithGaps.splice(insertion - 1, 0, \"-\");\n//   });\n//   for (let i = 0; i < allInsertionsInSeqReads.length; i++) {\n//     refSeqWithGaps.splice(allInsertionsInSeqReads[i] - 1, 0, \"-\");\n//     for (let innerI = i + 1; innerI < allInsertionsInSeqReads.length; innerI++){\n//       if (refSeqWithGaps[i] - 1 !== \"-\") {\n//         // allInsertionsInSeqReads[innerI] += 1;\n//         allInsertionsInSeqReads[i + 1] += 1;\n//       }\n//     }\n//   }","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    splitRangeIntoTwoPartsIfItIsCircular = _require.splitRangeIntoTwoPartsIfItIsCircular,\n    getSequenceWithinRange = _require.getSequenceWithinRange,\n    getRangeLength = _require.getRangeLength,\n    invertRange = _require.invertRange,\n    isPositionWithinRange = _require.isPositionWithinRange;\n\nvar spliceString = require(\"string-splice\");\n\nmodule.exports = function adjustBpsToReplaceOrInsert(bpString) {\n  var insertString = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : \"\";\n  var caretPositionOrRange = arguments[2];\n  var isProtein = arguments[3];\n\n  var stringToReturn = bpString;\n\n  if (caretPositionOrRange && caretPositionOrRange.start > -1) {\n    if (getRangeLength(caretPositionOrRange, bpString.length) === bpString.length) {\n      return insertString;\n    }\n    var ranges = splitRangeIntoTwoPartsIfItIsCircular(invertRange(caretPositionOrRange, bpString.length));\n    stringToReturn = \"\";\n    ranges.forEach(function (range, index) {\n      stringToReturn += getSequenceWithinRange(range, bpString);\n      if (ranges.length === 1) {\n        if (isPositionWithinRange(0, range, bpString.length, true, true)) {\n          stringToReturn = stringToReturn + insertString;\n        } else {\n          stringToReturn = insertString + stringToReturn;\n        }\n      } else {\n        if (index === 0) stringToReturn += insertString;\n      }\n    });\n  } else {\n    //caretPosition Passed\n    stringToReturn = spliceString(bpString, caretPositionOrRange, 0, insertString);\n  }\n  return stringToReturn;\n};","\"use strict\";\n\nmodule.exports = function calculatePercentGC(bps) {\n  return (bps.match(/[cg]/gi) || []).length / bps.length * 100 || 0;\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"lodash\"),\n    map = _require.map;\n\nvar _require2 = require(\"ve-range-utils\"),\n    adjustRangeToRotation = _require2.adjustRangeToRotation;\n\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\nvar modifiableTypes = require(\"./annotationTypes\").modifiableTypes;\nvar rotateBpsToPosition = require(\"./rotateBpsToPosition\");\n\nmodule.exports = function rotateSequenceDataToPosition(sequenceData, caretPosition, options) {\n  var newSequenceData = tidyUpSequenceData(sequenceData, options);\n\n  //update the sequence\n  newSequenceData.sequence = rotateBpsToPosition(newSequenceData.sequence, caretPosition);\n\n  //handle the insert\n  modifiableTypes.forEach(function (annotationType) {\n    //update the annotations:\n    //handle the delete if necessary\n    newSequenceData[annotationType] = adjustAnnotationsToRotation(newSequenceData[annotationType], caretPosition, newSequenceData.sequence.length);\n  });\n  return newSequenceData;\n};\n\nfunction adjustAnnotationsToRotation(annotationsToBeAdjusted, positionToRotateTo, maxLength) {\n  return map(annotationsToBeAdjusted, function (annotation) {\n    return _extends({}, adjustRangeToRotation(annotation, positionToRotateTo, maxLength), {\n      locations: annotation.locations ? annotation.locations.map(function (location) {\n        return adjustRangeToRotation(location, positionToRotateTo, maxLength);\n      }) : undefined\n    });\n  }).filter(function (range) {\n    return !!range;\n  }); //filter any fully deleted ranges\n}","\"use strict\";\n\nmodule.exports = function rotateBpsToPosition(bps, caretPosition) {\n  return arrayRotate(bps.split(\"\"), caretPosition).join(\"\");\n};\n\nfunction arrayRotate(arr, count) {\n  count -= arr.length * Math.floor(count / arr.length);\n  arr.push.apply(arr, arr.splice(0, count));\n  return arr;\n}","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\n//this file exports a list of enzymes grouped together by similarities\nvar aliasedEnzymes = [{\n  aliases: [\"ErpI\", \"Bme18I\", \"BsrAI\", \"SmuEI\", \"FdiI\", \"BmpI\", \"VpaK11BI\", \"CauI\", \"Kzo49I\", \"SinI\", \"EagMI\", \"HgiHIII\", \"AvaII\", \"BamNxI\", \"AflI\", \"FssI\", \"Asp745I\", \"BthAI\", \"HgiCII\", \"FspMSI\", \"DsaIV\", \"Eco47I\", \"Csp68KI\", \"BcuAI\", \"HgiEI\", \"HgiJI\", \"HgiBI\", \"Bme216I\"],\n  site: \"ggwcc\",\n  forwardRegex: \"g{2}[atw]c{2}\",\n  reverseRegex: \"g{2}[atw]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Eco196I\", \"Uba1126I\", \"Pae17I\", \"Ssp1725I\", \"BacI\", \"Eco104I\", \"Bsp12I\", \"Eco100I\", \"EccI\", \"Kpn19I\", \"DrdFI\", \"Cfr37I\", \"DrdEI\", \"DrdBI\", \"DrdAI\", \"DrdCI\", \"Cfr45II\", \"FscI\", \"Cte1I\", \"Pfl1108II\", \"NlaSI\", \"Ecl1I\", \"Bac465I\", \"Uba66I\", \"NgoDIII\", \"NgoJIII\", \"Pae7I\", \"Dsp1I\", \"SseII\", \"BscTI\", \"MraI\", \"Pae36I\", \"SsmII\", \"NlaDIII\", \"Eco55I\", \"Uba77I\", \"Uba1364I\", \"Uba1369I\", \"Pae44I\", \"Pae43I\", \"Pae42I\", \"Sfr382I\", \"Ese3I\", \"Ese6I\", \"SfrI\", \"Cfr43I\", \"Cfr41I\", \"Uba1234I\", \"StaI\", \"Uba90I\", \"NgoKIII\", \"Eco151I\", \"Eco208I\", \"Uba1306I\", \"Ecl28I\", \"Eco158I\", \"TtoI\", \"Uba1244I\", \"Asp32HI\", \"SboI\", \"Eco134I\", \"Eco135I\", \"SenpCI\", \"ShyI\", \"TglI\", \"UbaHKAI\", \"NgoGIII\", \"NgoMIII\", \"Eco96I\", \"SakI\", \"Eco92I\", \"Ssm5II\", \"SaaI\", \"SabI\", \"Uba1111I\", \"AosIII\", \"Uba1113I\", \"Eco182I\", \"Eco99I\", \"Uba1187I\", \"Uba1095I\", \"Uba1093I\", \"Ecl37I\", \"Uba1229I\"],\n  site: \"ccgcgg\",\n  forwardRegex: \"c{2}gcg{2}\",\n  reverseRegex: \"c{2}gcg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SplI\", \"PpuAI\", \"BvuBI\", \"Pfl23II\", \"PspLI\", \"SunI\", \"BsiWI\", \"BpuB5I\", \"MaeK81I\"],\n  site: \"cgtacg\",\n  forwardRegex: \"cgtacg\",\n  reverseRegex: \"cgtacg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Uba1366II\", \"Bsh108AI\", \"Uba1161I\", \"Uba1379I\", \"BfrAI\", \"BscVI\", \"Uba1145I\", \"Uba1257I\", \"Uba1144I\", \"Bsp145I\", \"Apu16I\", \"Uba1138I\", \"Uba1286I\", \"Bth1202I\", \"Uba1137I\", \"Uba1133I\", \"Bli576I\", \"Bsp84I\", \"Uba1427I\", \"BstLVI\", \"Uba1200I\", \"Bsp127I\", \"Bsp126I\", \"Bsp125I\", \"Uba1275I\", \"Bli585I\", \"BazI\", \"Uba1412I\", \"Uba1342I\", \"Uba1416I\", \"Uba1195I\", \"Uba1197I\", \"Uba1196I\", \"Bth9415I\", \"Uba1295I\", \"Uba1096I\", \"Bco79I\", \"Bsp2I\", \"Uba43I\", \"Bsp4I\", \"Uba34I\", \"Asp86I\", \"Asp14I\", \"Uba1430I\", \"Uba1100I\", \"Csp4I\", \"Uba1198I\", \"Uba1199I\", \"Uba30I\", \"Asp123I\", \"Uba1246I\", \"Uba22I\", \"Uba24I\", \"Asp707I\", \"BsrCI\", \"Uba1168I\", \"Uba1315I\", \"Uba1394I\", \"Asp37I\", \"Uba1233I\", \"Uba1238I\", \"Asp130I\", \"BtuI\", \"Uba1451I\", \"Uba1453I\", \"Uba1380I\"],\n  site: \"atcgat\",\n  forwardRegex: \"atcgat\",\n  reverseRegex: \"atcgat\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bbv12I\", \"MspV281I\", \"BsiHKAI\", \"Alw21I\", \"Bsm6I\", \"Bsh45I\", \"AspHI\", \"HgiAI\"],\n  site: \"gwgcwc\",\n  forwardRegex: \"g[atw]gc[atw]c\",\n  reverseRegex: \"g[atw]gc[atw]c\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SmiMII\", \"NflAI\", \"Rma495II\", \"Bsc217I\", \"Tsp273I\", \"Eco17I\", \"NanI\", \"Eco178I\", \"BshLI\", \"Bsp16I\", \"Pac1110II\", \"BsoAI\", \"PxyARI\", \"UbaN4I\", \"Rma497II\", \"Rma496II\", \"Uba1400I\", \"BstRI\", \"Pfl16I\"],\n  site: \"gatatc\",\n  forwardRegex: \"gatatc\",\n  reverseRegex: \"gatatc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Uba1223I\", \"MthTI\", \"Bpa36I\", \"Bce71I\", \"NgoCII\", \"SagI\", \"Bal3006I\", \"Uba9I\", \"NlaI\", \"Uba1449I\", \"HhgI\", \"Bsu1114I\", \"Uba1336I\", \"Bfi458I\", \"Uba1228I\", \"Bsp23I\", \"Uba1097I\", \"Uba1214I\", \"Tsp266I\", \"TteAI\", \"Uba1210I\", \"Afl83II\", \"BmeU1594I\", \"Uba1322I\", \"Bme46I\", \"Bsp2500I\", \"Csp2I\", \"UbaN8I\", \"MniI\", \"BshAI\", \"BshDI\", \"BshEI\", \"Van91III\", \"BshBI\", \"BshCI\", \"Bsp2013I\", \"HpyF10V\", \"NgoAII\", \"SulI\", \"BsiDI\", \"BsiAI\", \"Uba1169I\", \"NgoNII\", \"Uba1319I\", \"BliI\", \"BsiHI\", \"Uba1392I\", \"Uba1395I\", \"Uba1231I\", \"BsaRI\", \"HpyF72I\", \"Uba1235I\", \"Uba1450I\", \"Bsp1261I\", \"Tsp132I\", \"Uba1230I\", \"FinSI\", \"Tsp281I\", \"Bsp2362I\", \"BssCI\", \"Uba1176I\", \"Uba1175I\", \"Uba1174I\", \"Uba1179I\", \"Uba1388I\", \"Uba1178I\", \"BspLRI\", \"Psp29I\", \"BspBDG2I\", \"Bsu1076I\", \"PaiI\", \"TtnI\", \"Bse126I\", \"Bsp137I\", \"BstJI\", \"HpyF69II\", \"Uba1150I\", \"HpyF63I\", \"Uba1152I\", \"Bal475I\", \"HpyF26II\", \"Uba1153I\", \"Uba1155I\", \"BhaII\", \"Uth557I\", \"Tsp273II\", \"Uba1408I\", \"Uth555I\", \"Bco33I\", \"PpuI\", \"BscQI\", \"Uba1377I\", \"Bme74I\", \"HpyF33II\", \"VniI\", \"BstCI\", \"BluII\", \"AspTIII\", \"Tsp560I\", \"Uba1146I\", \"HpyF57I\", \"Uba1147I\", \"HpyF53I\", \"BseI\", \"Uba1140I\", \"Bsp881I\", \"M.H2I\", \"HpyF73III\", \"Vha1168I\", \"M.Csp68KV\", \"TspZNI\", \"HpyF49IV\", \"Uth549I\", \"BspBSE18I\", \"HpyF42I\", \"UbaN2I\", \"Uba1288I\", \"Uba1209I\", \"Uba1208I\", \"EsaWC1I\", \"HpyF46V\", \"Uba1207I\", \"Asp742I\", \"ClmI\", \"Bse9I\", \"Bsp44II\", \"Uba1429I\", \"BspCHE15I\", \"Uba61I\", \"OchI\", \"NgoSII\", \"Uba1422I\", \"Hpy178VII\", \"Uba1292I\", \"SplIII\", \"Uba1293I\", \"Bsp1593I\", \"MnnII\", \"Bsp226I\", \"BspBake1I\", \"AcaIV\", \"M.NgoGII\", \"Uba1418I\", \"VhaI\", \"Uba54I\", \"BspGHA1I\", \"BspH106II\", \"Psb9879I\", \"Ple214I\", \"NgoTII\", \"AvrBI\", \"HpyF29I\"],\n  site: \"ggcc\",\n  forwardRegex: \"g{2}c{2}\",\n  reverseRegex: \"g{2}c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"ErhB9I\", \"Afa16RI\", \"XorII\", \"NblI\", \"Ple19I\", \"RshI\", \"BpvUI\", \"Afa22MI\", \"PvuI\", \"Psu161I\", \"EagBI\", \"MvrI\", \"BspCI\"],\n  site: \"cgatcg\",\n  forwardRegex: \"cgatcg\",\n  reverseRegex: \"cgatcg\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BsmRI\", \"Ssp4800I\", \"Bsp1407I\", \"BstAUI\", \"BsrGI\", \"SspBI\", \"AauI\"],\n  site: \"tgtaca\",\n  forwardRegex: \"tgtaca\",\n  reverseRegex: \"tgtaca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Psp32I\", \"Acs1422I\", \"Acs1421I\", \"BstZ16I\", \"Acs1371I\", \"Acs1372I\", \"Acs1373I\", \"CglAII\", \"RhpI\", \"RheI\", \"Psp89I\", \"XamI\", \"RroI\", \"RrhI\", \"Uba89I\", \"BtgAI\", \"Psp33I\", \"KoyI\"],\n  site: \"gtcgac\",\n  forwardRegex: \"gtcgac\",\n  reverseRegex: \"gtcgac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Ecl136I\", \"Scg2I\", \"Bme2095I\", \"Ecl1zII\", \"Bsp56I\", \"Esp2I\", \"Eco70I\", \"Eco71I\", \"Eco206I\", \"Asp2HI\", \"Eco207I\", \"Uba1181I\", \"M.SPRI\", \"Eco67I\", \"Uba1185I\", \"Uba13I\", \"Acc38I\", \"Uba11I\", \"CfrS37I\", \"BsaNI\", \"Uba20I\", \"Bsp44I\", \"Ese6II\", \"SflHK7462I\", \"Cdi27I\", \"Sau16I\", \"Uba1171I\", \"BsiUI\", \"Uba1243I\", \"BsiVI\", \"UbaN16I\", \"Bsp103I\", \"Uba1218I\", \"Eco128I\", \"BspSI\", \"SflHK7234I\", \"SflHK2374I\", \"Eco170I\", \"Cfr11I\", \"Esp24I\", \"M.EcoKDcm\", \"AcuII\", \"EagKI\", \"Cfr5I\", \"Bsp317I\", \"Ecl37kII\", \"EcaII\", \"Uba1118I\", \"Bst7QII\", \"Uba1189I\", \"HhdI\", \"Uba1114I\", \"Uba1193I\", \"SflHK8401I\", \"BstGII\", \"Sfl2bI\", \"Uba1410I\", \"Sfl2aI\", \"Kpn16I\", \"Kpn14I\", \"Cfr35I\", \"Eco38I\", \"Kpn13I\", \"MpsI\", \"Ecl57kI\", \"Cfr31I\", \"Cfr30I\", \"EclII\", \"Uba1120I\", \"Uba1121I\", \"KspHK12I\", \"KspHK14I\", \"Eco256I\", \"Kpn10I\", \"TspAI\", \"Eco254I\", \"BsoGI\", \"Eco193I\", \"Cfr28I\", \"Cfr29I\", \"Uba1125I\", \"MphI\", \"Cfr27I\", \"Cfr25I\", \"Cfr24I\", \"Ecl66I\", \"EclS39I\", \"Uba1428I\", \"Cfr22I\", \"Lla497I\", \"Cfr20I\", \"EspHK7I\", \"Sgr20I\", \"Mlu2300I\", \"BspH43I\", \"EspHK30I\", \"Cfr58I\", \"Kox165I\", \"SflHK2731I\", \"UbaN11II\", \"Eco60I\", \"Ecl54kI\", \"Eco61I\", \"Sth455I\", \"SflHK10790I\", \"SflHK6873I\", \"BinSI\", \"Psp39I\", \"AtuBI\", \"Uba82I\", \"Uba81I\", \"Ecl137II\", \"Eco41I\", \"Eco40I\", \"AtuII\", \"SflHK1794I\", \"Atu1I\", \"Pca17AI\", \"M.Bbu297I\", \"EspHK22I\"],\n  site: \"ccwgg\",\n  forwardRegex: \"c{2}[atw]g{2}\",\n  reverseRegex: \"c{2}[atw]g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SspCI\", \"NaeI\", \"SauLPI\", \"SauSI\", \"SauBMKI\", \"RrhJ1I\", \"SauHPI\", \"CcoI\", \"PdiI\", \"SauNI\", \"Slu1777I\"],\n  site: \"gccggc\",\n  forwardRegex: \"gc{2}g{2}c\",\n  reverseRegex: \"gc{2}g{2}c\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"AflIV\", \"BstMI\", \"Uba1158I\", \"LlaDI\", \"VchO49I\", \"NmeSI\", \"PinI\", \"Asp763I\", \"BsoSI\", \"Uba1094I\", \"BshHI\"],\n  site: \"agtact\",\n  forwardRegex: \"agtact\",\n  reverseRegex: \"agtact\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco190I\", \"Uba1280I\", \"Uba1347I\", \"RshII\", \"BspJ67I\", \"Uba1424I\", \"Uba1423I\", \"SflHK11086I\", \"Asp1I\", \"SflHK11087I\", \"BspF105I\", \"SflHK10695I\", \"Uba1372I\", \"Uba1370I\", \"Tmu1I\", \"Uba1378I\", \"Uba1401I\", \"Uba1376I\", \"Uba1389I\", \"Bsp55I\", \"SflHK11572I\", \"HgiS21I\", \"Uba1318I\", \"Pae181I\", \"Eco179I\", \"UbaN11I\", \"Eco121I\", \"Hin3I\", \"Bsp7I\", \"Bsp8I\", \"SflHK115731I\", \"Uba42I\", \"Uba41I\", \"EciDI\", \"Ssp2I\"],\n  site: \"ccsgg\",\n  forwardRegex: \"c{2}[cgs]g{2}\",\n  reverseRegex: \"c{2}[cgs]g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AgeI\", \"CsiAI\", \"AsiAI\", \"AsiGI\", \"PinAI\", \"BshTI\", \"CspAI\"],\n  site: \"accggt\",\n  forwardRegex: \"ac{2}g{2}t\",\n  reverseRegex: \"ac{2}g{2}t\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BtsI\"],\n  site: \"gcagtg\",\n  forwardRegex: \"gcagtg\",\n  reverseRegex: \"cactgc\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 6,\n  isType2S: true\n}, {\n  aliases: [\"SteI\", \"Eco147I\", \"StuI\", \"PceI\", \"AatI\", \"SarI\", \"Pme55I\", \"GdiI\", \"Sru30DI\", \"SseBI\", \"Eco1524I\", \"AspMI\"],\n  site: \"aggcct\",\n  forwardRegex: \"ag{2}c{2}t\",\n  reverseRegex: \"ag{2}c{2}t\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"HpyF10I\", \"HinS1I\", \"HinS2I\", \"Hin7I\", \"BcaI\", \"HinGUI\", \"Hpy99III\", \"Mho2965I\", \"Csp1470I\", \"MnnIV\", \"CcoP95I\", \"NgoEII\"],\n  site: \"gcgc\",\n  forwardRegex: \"gcgc\",\n  reverseRegex: \"gcgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BceBI\", \"Bsp50I\", \"BtkI\", \"Bpu95I\", \"Csp68KVI\", \"BepI\", \"MvnI\", \"Bsh1236I\", \"AccII\", \"BstFNI\", \"FnuDII\", \"FalII\", \"FauBII\", \"Bsp123I\", \"ThaI\", \"BstUI\", \"BspFNI\", \"Bsu1532I\"],\n  site: \"cgcg\",\n  forwardRegex: \"cgcg\",\n  reverseRegex: \"cgcg\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"TspBI\", \"BstDSI\", \"BtgI\", \"DsaI\"],\n  site: \"ccrygg\",\n  forwardRegex: \"c{2}[agr][cty]g{2}\",\n  reverseRegex: \"c{2}[agr][cty]g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BecAII\", \"BspKI\", \"HaeIII\", \"PlaI\", \"BshFI\", \"BspBRI\", \"BspRI\", \"SuaI\", \"PhoI\", \"Pde133I\", \"SbvI\", \"NgoPII\", \"PalI\", \"PflKI\", \"BteI\", \"SfaI\", \"Bsp211I\", \"DsaII\", \"Bme361I\", \"BsuRI\", \"BshI\", \"BsnI\", \"CltI\", \"NspLKI\", \"MchAII\", \"EsaBC4I\", \"BspANI\", \"FnuDI\", \"BseQI\", \"Bim19II\", \"MfoAI\", \"BanAI\", \"Pru2I\"],\n  site: \"ggcc\",\n  forwardRegex: \"g{2}c{2}\",\n  reverseRegex: \"g{2}c{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"CceI\", \"Bsp116I\", \"HpyF43I\", \"Uba1355I\", \"Asp748I\", \"M.Csp68KIV\", \"Uba1128I\", \"Uba1267I\", \"Pme35I\", \"SecII\", \"Uba1141I\", \"Bsp48I\", \"Bsp47I\", \"HpyVIII\", \"BsaZI\", \"FinII\", \"Hin5I\", \"SfaGUI\", \"Msp199I\", \"MniII\", \"Bsu1192I\", \"Uba1338I\", \"Bsp5I\", \"Bsp1591II\", \"BshMI\", \"UbaN13I\", \"Uba1439I\"],\n  site: \"ccgg\",\n  forwardRegex: \"c{2}g{2}\",\n  reverseRegex: \"c{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Cfr10I\", \"Bse634I\", \"BssAI\", \"Bco118I\", \"Bse118I\", \"BstB7SI\", \"BsrFI\"],\n  site: \"rccggy\",\n  forwardRegex: \"[agr]c{2}g{2}[cty]\",\n  reverseRegex: \"[agr]c{2}g{2}[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BseRI\"],\n  isType2S: true,\n  site: \"gaggag\",\n  forwardRegex: \"gag{2}ag\",\n  reverseRegex: \"ctc{2}tc\",\n  topSnipOffset: 16,\n  bottomSnipOffset: 14\n}, {\n  aliases: [\"MmaI\", \"XmaII\", \"XorI\", \"ScoAI\", \"VpaK29AI\", \"XveI\", \"Pph2066I\", \"Asp708I\", \"Bsp43I\", \"Uba1399I\", \"Eco161I\", \"Eco83I\", \"BloHIII\", \"Eco167I\", \"Uba1184I\", \"BsaQI\", \"Pma44I\", \"MkrI\", \"Ali2882I\", \"Uba1232I\", \"Asp36I\", \"Pph2059I\", \"Ecl133I\", \"EaePI\", \"SkaII\", \"Bsp268I\", \"Psp28I\", \"Uba1115I\", \"PmaI\", \"Uba1116I\", \"Ssp12I\", \"Uba1112I\", \"Bth9411I\", \"Uba46I\", \"Bsp17I\", \"Uba1225I\", \"Uba1294II\", \"Uba1296I\", \"PspSI\", \"Ecl1zI\", \"AinI\", \"Uba1337I\", \"Uba1186I\", \"Uba1119I\", \"SriI\", \"UbaHKBI\", \"Uba1213I\", \"Uba1212I\", \"Uba1211I\", \"Uba1328I\", \"Bsp107I\", \"Uba1215I\", \"Uba1216I\", \"Esp141I\", \"NasI\", \"PmyI\", \"PshEI\", \"Pae24I\", \"Pae25I\", \"Pae22I\", \"Ecl593I\", \"Pae26I\", \"Pfl37I\", \"Uba1287I\", \"BbiI\", \"ClcI\", \"Bsp108I\", \"MauI\", \"VchO87I\", \"Bsp81I\", \"BspS122I\", \"VpaK4AI\", \"VpaK4BI\", \"Pae14I\", \"Pae15I\", \"Uba1123I\", \"GseII\", \"Kpn12I\", \"SgiI\", \"Ecl699kI\", \"Ecl77I\", \"Uba1411I\", \"Srl32DI\", \"Bsp93I\", \"Uba1417I\", \"XorKII\", \"Esp5II\", \"Eco260I\", \"Eco261I\", \"Srl2DI\", \"Uba1262I\", \"Pae40I\", \"Pae41I\", \"YenDI\", \"YenEI\", \"YenBI\", \"YenCI\", \"Eco49I\", \"YenAI\", \"BscDI\", \"TspGWII\", \"Eco48I\", \"Msp11I\", \"VpaKutGI\", \"AspTI\", \"Pae39I\", \"BsaNII\", \"Srl1DI\", \"Uba1256I\", \"CauIII\", \"Sal13I\", \"Uba1149I\", \"Bsp78I\", \"Bce170I\", \"Pae9I\", \"Pae8I\", \"Uba72I\", \"Psp46I\", \"Uba71I\", \"BmeBI\", \"SprLI\", \"NgbI\", \"NocI\", \"XphI\", \"MizI\"],\n  site: \"ctgcag\",\n  forwardRegex: \"ctgcag\",\n  reverseRegex: \"ctgcag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco32I\", \"HpyCI\", \"HjaI\", \"EcoRV\", \"CeqI\", \"NsiCI\"],\n  site: \"gatatc\",\n  forwardRegex: \"gatatc\",\n  reverseRegex: \"gatatc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BspBS31I\", \"BbsI\", \"Bbv16II\", \"BpiI\", \"BstV2I\", \"BspTS514I\", \"BspIS4I\", \"BstBS32I\", \"Bsc91I\", \"BbvII\", \"BstTS5I\", \"BpuAI\"],\n  isType2S: true,\n  site: \"gaagac\",\n  forwardRegex: \"ga{2}gac\",\n  reverseRegex: \"gtct{2}c\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 12\n}, {\n  aliases: [\"BspJ64I\", \"HpyHPK5II\", \"Ssu212I\", \"Ssu211I\", \"R2.Ssu4109I\", \"TrsSI\", \"M.PhaTDam\", \"Uba1204I\", \"Bst1274I\", \"NlaDI\", \"TrsTI\", \"M.Kpn43816Dam\", \"UbaN1I\", \"CtyI\", \"Bth1997I\", \"Bth1786I\", \"AsuMBI\", \"Mel7JI\", \"Ssu220I\", \"NciAI\", \"BfiSHI\", \"M.EcoT2Dam\", \"SauCI\", \"M.Ssp6803Dam\", \"R1.Ssu11318I\", \"SalAI\", \"Bsp122I\", \"SauFI\", \"M.CjeEDam\", \"SauGI\", \"MspBI\", \"SauDI\", \"SauEI\", \"Uba59I\", \"SalHI\", \"Msp67II\", \"NmeAII\", \"Bth1140I\", \"BsmXII\", \"Bth1141I\", \"EsaLHCI\", \"SsuRBI\", \"NsuDI\", \"NgoDXIV\", \"Bsp91I\", \"Bsp61I\", \"Bsp60I\", \"R2.SsuDAT1I\", \"M.SmaII\", \"NsiAI\", \"Bsp65I\", \"Bsp135I\", \"Bsp64I\", \"R1.SsuDAT1I\", \"HpyAIII\", \"Mel5TI\", \"BthCanI\", \"Bsp138I\", \"Mel5OI\", \"Bsp136I\", \"Bsp66I\", \"FtnUIV\", \"BstEIII\", \"Bth211I\", \"Mel5JI\", \"SinMI\", \"M.HinHP1Dam\", \"M.EcoEc67Dam\", \"M.FspVDam\", \"CcoP31I\", \"R2.Ssu4961I\", \"Bth84I\", \"Cte1179I\", \"PfaI\", \"TruII\", \"Uba1259I\", \"Bsp72I\", \"Bsp74I\", \"Bsp147I\", \"FnuAII\", \"Bsp76I\", \"Cte1180I\", \"NflI\", \"CdiCD6II\", \"R1.Ssu4961I\", \"Mel4OI\", \"CcoP95II\", \"Sau6782I\", \"Bth221I\", \"Uba1366I\", \"Bth213I\", \"M.HindDam\", \"CpaPI\", \"Mmu5I\", \"Rlu1I\", \"Bme2494I\", \"BspI\", \"CviHI\", \"NanII\", \"MnoIII\", \"Sau15I\", \"Mel3JI\", \"R1.Ssu8074I\", \"M.YpsADam\", \"TdeI\", \"BsrMI\", \"Uba1317I\", \"Vha44I\", \"Bsp49I\", \"M.HinHP2Dam\", \"M.CviBII\", \"R1.Ssu2479I\", \"MthI\", \"BsrPII\", \"M.VvuDam\", \"Pph288I\", \"LlaDCHI\", \"Tsp133I\", \"Uba1183I\", \"Pei9403I\", \"Uba1182I\", \"SmiMBI\", \"M.StyDam\", \"M.TpaI\", \"M.PmuADam\", \"MjaIII\", \"Bth945I\", \"Mel2TI\", \"BsaPI\", \"BssGII\", \"M.NmaPhiCh1I\", \"BtcI\", \"Btu41I\", \"NmeBL859I\", \"Bsp58I\", \"Bsp59I\", \"M.CjeNIII\", \"Bsp57I\", \"Bsp54I\", \"MmeII\", \"Bsp52I\", \"M.PgiI\", \"Bsp51I\", \"Uba1177I\", \"NspAI\", \"NflBI\", \"Lsp1109II\", \"M.EcoT1Dam\", \"CcoP219I\", \"Mth1047I\", \"LlaKR2I\", \"Cin1467I\", \"CcoP76I\", \"Gst1588II\", \"M.EcoVT2Dam\", \"NmuEI\", \"R2.Ssu8074I\", \"MmuP2I\", \"Bsp18I\", \"NmuDI\", \"R1.Ssu4109I\", \"Btu34I\", \"R2.Ssu2479I\", \"Uba4I\", \"Btu33I\", \"MosI\", \"TrsKTI\", \"Btu39I\", \"Btu36I\", \"M.EcoT4Dam\", \"CjeP338I\", \"M.Sty14028Dam\", \"M.VchK139I\", \"Bsp9I\", \"Btu37I\", \"NsuI\", \"Uba1101I\", \"Csp5I\", \"R2.Ssu11318I\", \"M.EcoP1Dam\", \"M.StyLT2Dam\", \"CcoP84I\", \"Uba1323I\", \"MeuI\", \"M.EcoKDam\", \"BstXII\", \"CpfAI\", \"M.PmuDam\", \"Mph1103II\", \"NflAII\", \"MthAI\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SmaAIII\", \"EclJI\", \"Pvu84I\", \"Uba1129I\", \"XorKI\", \"DrdIII\", \"Uba1139I\", \"BmaDI\", \"BmaCI\", \"BmaBI\", \"Cfr51I\", \"RspI\", \"Xgl3220I\", \"Kpl79I\", \"Xgl3216I\", \"BmaI\", \"XniI\", \"Xgl3219I\", \"Xgl3218I\", \"Xgl3217I\", \"PntI\", \"BstZ8I\", \"BmaAI\", \"SplAIII\", \"SpaPII\", \"Cas2I\", \"XmlAI\", \"XmlI\"],\n  site: \"cgatcg\",\n  forwardRegex: \"cgatcg\",\n  reverseRegex: \"cgatcg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BthII\", \"Bth617I\", \"BsrWI\", \"BpuFI\", \"Ral8I\"],\n  site: \"ggatc\",\n  forwardRegex: \"g{2}atc\",\n  reverseRegex: \"gatc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BfuAI\", \"BspMI\", \"Acc36I\", \"BveI\"],\n  isType2S: true,\n  site: \"acctgc\",\n  forwardRegex: \"ac{2}tgc\",\n  reverseRegex: \"gcag{2}t\",\n  topSnipOffset: 10,\n  bottomSnipOffset: 14\n}, {\n  aliases: [\"Bst2BI\", \"BssSI\", \"BsiI\", \"BauI\"],\n  site: \"cacgag\",\n  forwardRegex: \"cacgag\",\n  reverseRegex: \"ctcgtg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"NmuFI\", \"Afa24RI\", \"ApeAI\", \"RluI\", \"SaoI\", \"AmeII\", \"NasWI\", \"AniMI\", \"NmuI\", \"Srl77DI\", \"Esp5I\", \"NspWI\", \"Smo40529I\", \"SkaI\", \"MisI\", \"PglI\", \"Mlu9273II\", \"NtaSII\", \"NbrI\", \"NbaI\", \"BheI\", \"Psp61I\", \"AprI\", \"SacAI\", \"MauAI\", \"SauAI\", \"SalCI\", \"Uba1122I\"],\n  site: \"gccggc\",\n  forwardRegex: \"gc{2}g{2}c\",\n  reverseRegex: \"gc{2}g{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BthI\", \"DdeII\", \"PflNI\", \"BbiIII\", \"McaI\", \"ScuI\", \"PflWI\", \"Pfl67I\", \"Uba1237I\", \"Uba1397I\", \"SluI\", \"Uba1166I\", \"MecI\", \"Sca1827I\", \"Asp703I\", \"Uba1248I\", \"SdiAI\", \"Sfu1762I\", \"Msp23II\", \"AhyAI\", \"Psp4I\", \"Asp15I\", \"PspNI\", \"Ssp4I\", \"Uba1298I\", \"Uba1448I\", \"CjaI\", \"Uba1335I\", \"Sph1719I\", \"DrdDI\", \"SgoI\", \"MpuI\", \"Bsp92I\", \"Sve194I\", \"BadI\", \"Uba1271I\", \"MhaI\", \"SpaI\", \"Bsp129I\", \"SgaI\", \"AlwFII\", \"Shy1766I\", \"OcoI\", \"AerAI\", \"Uba1130I\", \"BbfI\", \"StaAI\", \"Asp47I\", \"Sgr1841I\", \"Bsp140I\", \"Bsp141I\", \"SrifpI\", \"Bsp142I\", \"MrhI\", \"BsuMI\", \"SciBI\", \"Uba1148I\", \"Sci1831I\", \"Eae2I\", \"MscAI\", \"Sal1974I\", \"Uba1154I\", \"SexI\", \"BstLI\", \"MsiI\", \"BstHI\", \"Bsp139I\"],\n  site: \"ctcgag\",\n  forwardRegex: \"ctcgag\",\n  reverseRegex: \"ctcgag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Uba1382I\", \"Uba1415I\"],\n  site: \"gaatgc\",\n  forwardRegex: \"ga{2}tgc\",\n  reverseRegex: \"gcat{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco97I\", \"Eco95I\", \"Bli161I\", \"Eco120I\", \"Eco127I\", \"Eco233I\", \"Eco185I\", \"Eco217I\", \"Eco225I\", \"Eco203I\", \"Eco156I\", \"Eco204I\", \"Eco155I\", \"Eco205I\", \"Eco157I\", \"PpaI\", \"Eco162I\", \"Uba1316I\", \"SlbI\", \"Eco129I\", \"Sau12I\", \"Eco51I\", \"Bli49I\", \"Bli5508I\", \"Cfr56I\", \"VpaKutHI\", \"Eco71KI\", \"Eco42I\", \"VpaK57AI\", \"Uba84I\", \"Rle69I\", \"Eco263I\", \"Eco101I\", \"VpaK57I\", \"Uba1343I\", \"Bli576II\", \"Eco191I\", \"Uba65I\", \"Eco239I\", \"Eco246I\", \"Eco247I\", \"Eco240I\", \"Eco241I\"],\n  site: \"ggtctc\",\n  forwardRegex: \"g{2}tctc\",\n  reverseRegex: \"gagac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BmrI\", \"BfiI\", \"BmuI\"],\n  isType2S: true,\n  site: \"actggg\",\n  forwardRegex: \"actg{3}\",\n  reverseRegex: \"c{3}agt\",\n  topSnipOffset: 11,\n  bottomSnipOffset: 10\n}, {\n  aliases: [\"BstRZ246I\", \"MspSWI\", \"BstSWI\", \"SmiI\", \"SwaI\"],\n  site: \"atttaaat\",\n  forwardRegex: \"at{3}a{3}t\",\n  reverseRegex: \"at{3}a{3}t\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Srl76DI\", \"Srl19I\", \"Srl61DI\"],\n  site: \"tttaaa\",\n  forwardRegex: \"t{3}a{3}\",\n  reverseRegex: \"t{3}a{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Tsp32I\", \"Tsp32II\", \"TaqI\", \"PpaAII\", \"TthHB8I\"],\n  site: \"tcga\",\n  forwardRegex: \"tcga\",\n  reverseRegex: \"tcga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"EcoPI\"],\n  isType2S: true,\n  site: \"agacc\",\n  forwardRegex: \"agac{2}\",\n  reverseRegex: \"g{2}tct\",\n  topSnipOffset: 30,\n  bottomSnipOffset: 32\n}, {\n  aliases: [\"OmiBII\", \"DsaVI\"],\n  site: \"gtmkac\",\n  forwardRegex: \"gt[acm][gkt]ac\",\n  reverseRegex: \"gt[acm][gkt]ac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpuSI\", \"BspLU11III\", \"BstOZ616I\", \"BslFI\", \"FaqI\", \"BsmFI\"],\n  isType2S: true,\n  site: \"gggac\",\n  forwardRegex: \"g{3}ac\",\n  reverseRegex: \"gtc{3}\",\n  topSnipOffset: 15,\n  bottomSnipOffset: 19\n}, {\n  aliases: [\"BspJ105I\", \"VpaK13AI\", \"Uba1314I\", \"GspAI\", \"Uba1249I\", \"PolI\", \"VpaK7AI\", \"NspDII\", \"BceSII\", \"MliI\", \"VpaK11DI\", \"AspBII\", \"VpaK11I\", \"NspGI\", \"BtiI\", \"NspKI\", \"VpaK11CI\", \"Uba1304I\", \"Bsp1260I\", \"MfoI\", \"Uba48I\", \"UbaN15I\", \"NmuAII\", \"Uba1438I\", \"Bsp100I\", \"Tsp301I\", \"BspF53I\", \"Uba62I\", \"ClmII\", \"VpaK65I\", \"AspDII\", \"NspHII\", \"Sgh1835I\", \"Uba1131I\", \"CliI\", \"Asp697I\", \"Uba1413I\", \"Nli3877II\", \"Uba1278I\", \"Uba1272I\", \"Bsp128I\", \"NliII\", \"MspAI\", \"Bst4QI\", \"SfnI\", \"Uth554I\", \"Uba1373I\", \"Tru28I\", \"Pfl19I\", \"SinJI\", \"SinHI\", \"SinGI\", \"SinFI\", \"SinEI\", \"SinDI\", \"SinCI\", \"SinBI\", \"SinAI\", \"Bsp133I\", \"Bsp132I\", \"SynI\", \"TruI\", \"Hsp2I\", \"Bsp71I\"],\n  site: \"ggwcc\",\n  forwardRegex: \"g{2}[atw]c{2}\",\n  reverseRegex: \"g{2}[atw]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NtaSI\", \"Uba1180I\", \"SsvI\", \"Uba1239I\", \"Uba1170I\", \"Ppu13I\", \"VchO44I\", \"ChyI\", \"GobAI\", \"Uba1217I\", \"PluI\", \"Uba40I\", \"Uba1419I\", \"Asp78I\", \"Uba1371I\", \"Uba1403I\"],\n  site: \"aggcct\",\n  forwardRegex: \"ag{2}c{2}t\",\n  reverseRegex: \"ag{2}c{2}t\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BseGI\", \"BstF5I\", \"BtsCI\"],\n  site: \"ggatg\",\n  forwardRegex: \"g{2}atg\",\n  reverseRegex: \"catc{2}\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 5,\n  isType2S: true\n}, {\n  aliases: [\"AvrII\", \"AspA2I\", \"XmaJI\", \"BlnI\", \"AvrBII\", \"BspA2I\"],\n  site: \"cctagg\",\n  forwardRegex: \"c{2}tag{2}\",\n  reverseRegex: \"c{2}tag{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BspKT8I\", \"SsbI\", \"BspLAIII\", \"LlaCI\", \"BstFI\", \"HindIII\", \"HsuI\", \"BbrI\", \"EcoVIII\"],\n  site: \"aagctt\",\n  forwardRegex: \"a{2}gct{2}\",\n  reverseRegex: \"a{2}gct{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"NsbI\", \"Acc16I\", \"PamI\", \"Pun14627I\", \"MstI\", \"AosI\", \"FspI\", \"AviII\", \"FdiII\"],\n  site: \"tgcgca\",\n  forwardRegex: \"tgcgca\",\n  reverseRegex: \"tgcgca\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Ecl136II\", \"BpuAmI\", \"MxaI\", \"Eco53kI\", \"EcoICRI\"],\n  site: \"gagctc\",\n  forwardRegex: \"gagctc\",\n  reverseRegex: \"gagctc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"TtmI\", \"TspWAM8AI\", \"HpyF74II\", \"HpyF35II\", \"TspIDSI\", \"HpyF13III\"],\n  site: \"acgt\",\n  forwardRegex: \"acgt\",\n  reverseRegex: \"acgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BseZI\", \"Ksp632I\", \"EarI\", \"Eam1104I\", \"Bsu6I\", \"Bst6I\", \"CatHI\", \"Bco116I\", \"Bco5I\", \"BcoKI\"],\n  isType2S: true,\n  site: \"ctcttc\",\n  forwardRegex: \"ctct{2}c\",\n  reverseRegex: \"ga{2}gag\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 10\n}, {\n  aliases: [\"Msp24I\", \"BsaSI\", \"HpyF73IV\", \"MjaII\", \"VpaK15I\", \"TdeIII\", \"Sau557I\", \"Sau17I\", \"GseI\", \"Bfi105I\", \"Eco201I\", \"CfrNI\", \"Sau13I\", \"Sau14I\", \"Bse54I\", \"Eco196II\", \"VpaK25I\", \"Uba1164I\", \"NlaDII\", \"Cfr4I\", \"Cfr8I\", \"CdiCD6I\", \"AhaB1I\", \"MthBI\", \"Pph1579I\", \"Pph1773I\", \"Hin5II\", \"Sau32I\", \"VpaK9AI\", \"Sau33I\", \"Uba1099I\", \"NmuSI\", \"SauBI\", \"VchO85I\", \"Sau5I\", \"Cfr33I\", \"Eco39I\", \"Sau2I\", \"ApuI\", \"VchO90I\", \"PspI\", \"Uba1134I\", \"BpsI\", \"Cfr23I\", \"MhoI\", \"PseI\", \"Eco47II\", \"HpyF71II\", \"VpaK19AI\", \"VpaK19BI\", \"SdyI\", \"NmuEII\", \"Cfr52I\", \"Cfr54I\", \"NspLII\", \"VpaKutBI\", \"CdiAI\", \"VpaKutAI\", \"Bsu5044I\", \"HpyF66I\", \"SelAI\", \"Cfr46I\", \"Cfr47I\", \"Cfr45I\", \"Uba1160I\", \"VchO66I\", \"VpaKutJI\"],\n  site: \"ggncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Cpa1150I\", \"PflAI\", \"TmaI\", \"BceRI\", \"FspMI\", \"MvaAI\", \"Uba1446I\", \"Bsu1193I\", \"EsaBS9I\", \"HpyF52II\", \"Bsu1192II\", \"HpyF14I\", \"HpyF15I\", \"Uba1321I\", \"HpyF64IV\", \"SceAI\", \"HpyF26I\", \"BspJ76I\", \"Bce31293I\", \"BsuEII\", \"Hin1056I\", \"Uba1405I\", \"Uba1404I\", \"Bsu6633I\", \"CpaAI\", \"Bsp70I\"],\n  site: \"cgcg\",\n  forwardRegex: \"cgcg\",\n  reverseRegex: \"cgcg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TseI\", \"ApeKI\", \"AceI\", \"Taq52I\", \"SuiI\"],\n  site: \"gcwgc\",\n  forwardRegex: \"gc[atw]gc\",\n  reverseRegex: \"gc[atw]gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Asp27HI\", \"Asp26HI\", \"PctI\", \"Asp40HI\", \"BsaMI\", \"BscCI\", \"BsmI\", \"BmaHI\", \"Mva1269I\", \"Asp50HI\", \"Asp36HI\", \"Asp35HI\"],\n  site: \"gaatgc\",\n  forwardRegex: \"ga{2}tgc\",\n  reverseRegex: \"gcat{2}c\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Uba51I\", \"M.BamHII\", \"Uba1414I\", \"Uba1346I\", \"Bsu8646I\", \"AcaII\", \"SpvI\", \"BamNI\", \"GdoI\", \"UbaN3I\", \"BamKI\", \"Uba1205I\", \"BamFI\", \"BsuB519I\", \"Bst2902I\", \"Rlu4I\", \"Ali12257I\", \"Ali12258I\", \"Uba1250I\", \"RhsI\", \"Psp56I\", \"Uba1258I\", \"Bsp144I\", \"AinII\", \"Bco10278I\", \"Uba88I\", \"Uba1402I\", \"Bca1259I\", \"Bsp90II\", \"Bsp131I\", \"Bsp130I\", \"BstQI\", \"MleI\", \"Uba1383I\", \"Uba1302I\", \"GinI\", \"Uba19I\", \"Bst2464I\", \"Uba1167I\", \"GseIII\", \"Uba1163I\", \"BsaDI\", \"Pac1110I\", \"Bsp46I\", \"Uba1398I\", \"Uba1173I\", \"Uba1242I\", \"Uba1172I\", \"NasBI\", \"UbaN14I\", \"GoxI\", \"AaeI\", \"Uba31I\", \"DdsI\", \"Uba1324I\", \"Bsp30I\", \"Uba1325I\", \"AspTII\", \"Uba38I\", \"AacLI\", \"Pae177I\", \"Uba1098I\", \"BsuB763I\", \"Uba1339I\", \"Uba1297I\", \"Uba1334I\", \"Bst1126I\", \"Uba1224I\", \"Atu1II\", \"Bsu8565I\", \"Bsu90I\"],\n  site: \"ggatcc\",\n  forwardRegex: \"g{2}atc{2}\",\n  reverseRegex: \"g{2}atc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SpaPIII\", \"PvuHKUI\", \"MziI\", \"SciAII\", \"SplAIV\", \"Sol3335I\", \"Bth2350I\", \"GspI\", \"Uba1245I\", \"Uba1227I\", \"SmaAIV\", \"Psp3I\", \"SbaI\", \"Psp5I\"],\n  site: \"cagctg\",\n  forwardRegex: \"cagctg\",\n  reverseRegex: \"cagctg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BspZEI\", \"BscI\", \"Bsa29I\", \"PgaI\", \"BspOVII\", \"ClaI\", \"BseCI\", \"Bli41I\", \"BavCI\", \"BciBI\", \"LplI\", \"SpmI\", \"Ssp27144I\", \"ZhoI\", \"BspDI\", \"BanIII\", \"BsuTUI\", \"BshVI\", \"BspXI\", \"BstNZ169I\", \"Bsu15I\", \"BspJII\", \"AagI\", \"Bsp106I\", \"Bli86I\", \"BliAI\", \"Bst28I\", \"BbvAII\", \"BsiXI\", \"BcmI\", \"BliRI\", \"Bci29I\", \"LcaI\", \"Rme21I\", \"BdiI\"],\n  site: \"atcgat\",\n  forwardRegex: \"atcgat\",\n  reverseRegex: \"atcgat\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BspJ74I\", \"Bco35I\", \"Bth1795I\", \"Uba1444I\", \"Bsp22I\", \"Bsp28I\", \"Uba1437I\"],\n  site: \"ctggag\",\n  forwardRegex: \"ctg{2}ag\",\n  reverseRegex: \"ctc{2}ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SolI\", \"Bsp98I\", \"Bce751I\", \"Uba4009I\", \"BamHI\", \"RspLKII\", \"SurI\", \"BstI\", \"OkrAI\", \"ApaCI\", \"Nsp29132II\", \"BspAAIII\", \"CelI\", \"AliI\", \"AsiI\", \"GstI\", \"Mlu23I\", \"NspSAIV\", \"Pfl8I\", \"BnaI\", \"AccEBI\", \"Bsp4009I\"],\n  site: \"ggatcc\",\n  forwardRegex: \"g{2}atc{2}\",\n  reverseRegex: \"g{2}atc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"M.NgoHVIII\", \"NgoMVIII\", \"NgoJVIII\", \"NgoBVIII\", \"NgoDVIII\"],\n  site: \"ggtga\",\n  forwardRegex: \"g{2}tga\",\n  reverseRegex: \"tcac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF13I\", \"HpyF1I\", \"HpyF4I\", \"HpyF6II\", \"HpyF9I\", \"HpyF31II\", \"HpyF49II\", \"HpyF51I\", \"HpyF34II\", \"HpyF48I\", \"HpyF62III\", \"HpyF40III\", \"HpyF25II\", \"Hpy99II\", \"Hpy8II\", \"HpyF35IV\", \"HpyF36I\"],\n  site: \"gtsac\",\n  forwardRegex: \"gt[cgs]ac\",\n  reverseRegex: \"gt[cgs]ac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PsyI\", \"BgiI\", \"TelI\", \"Tth111I\", \"AspI\", \"PflFI\", \"AtsI\"],\n  site: \"gacnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{3}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{3}gtc\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"PfaAI\", \"AccB1I\", \"HgiHI\", \"HgiCI\", \"BspT107I\", \"MspB4I\", \"BanI\", \"BshNI\", \"Eco64I\", \"BbvBI\"],\n  site: \"ggyrcc\",\n  forwardRegex: \"g{2}[cty][agr]c{2}\",\n  reverseRegex: \"g{2}[cty][agr]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BspMAI\", \"CflI\", \"Psp23I\", \"BspBI\", \"AliAJI\", \"Srl5DI\", \"MhaAI\", \"CfrA4I\", \"Ecl2zI\", \"AjoI\", \"Sag16I\", \"PstI\", \"Sag23I\", \"Ecl37kI\", \"Pfl21I\", \"ApiI\", \"Sst12I\", \"SalPI\", \"CstI\", \"YenI\", \"Bsp63I\", \"BloHII\", \"CfuII\", \"PaePI\", \"SflI\", \"HalII\", \"BsuBI\", \"Asp713I\"],\n  site: \"ctgcag\",\n  forwardRegex: \"ctgcag\",\n  reverseRegex: \"ctgcag\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SvoI\", \"PsuNI\"],\n  site: \"crccggyg\",\n  forwardRegex: \"c[agr]c{2}g{2}[cty]g\",\n  reverseRegex: \"c[agr]c{2}g{2}[cty]g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SphI\", \"BbuI\", \"PaeI\", \"SpaHI\", \"RspLKI\", \"PfaAIII\"],\n  site: \"gcatgc\",\n  forwardRegex: \"gcatgc\",\n  reverseRegex: \"gcatgc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PspN4I\", \"BspLI\", \"BmiI\", \"AspNI\", \"BscBI\", \"NlaIV\"],\n  site: \"ggnncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]{2}c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]{2}c{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"HpyHPK5I\", \"HpyF32I\", \"HpyF34I\", \"HpyHI\", \"HpyF25I\", \"HpyF27I\", \"HpyF24II\", \"HpyF37I\", \"HpyF13II\", \"HpyF60II\", \"HpyF59I\", \"HpyF68II\", \"HpyF4II\", \"Bpa36II\", \"HpyF67I\", \"HpyF41II\", \"HpyF64V\", \"Bst295I\", \"BscPI\", \"HpyF70I\", \"HpyF5I\", \"HpyF7I\", \"HpyF66II\", \"HpyF6III\", \"HpyF72II\", \"HpyF30II\", \"HpyF11I\", \"HpyF19I\", \"HpyF22II\", \"HpyCH4II\", \"HpyF9II\", \"HpyF21I\"],\n  site: \"ctnag\",\n  forwardRegex: \"ct[abcdghkmnrstvwy]ag\",\n  reverseRegex: \"ct[abcdghkmnrstvwy]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF51II\", \"HpyF74I\", \"HpyF42II\", \"HpyF35III\", \"HpyF9III\", \"HpyF64II\", \"HpyF20I\", \"HpyF22I\", \"HpyF12I\", \"HpyF41I\", \"HpyF40I\", \"HpyF46I\", \"HpyF56I\", \"HpyF58I\", \"HpyF55I\", \"HpyF54I\", \"HpyF5II\", \"HpyF48II\", \"HpyF69I\", \"HpyF68I\", \"HpyF65I\", \"HpyF62I\"],\n  site: \"acngt\",\n  forwardRegex: \"ac[abcdghkmnrstvwy]gt\",\n  reverseRegex: \"ac[abcdghkmnrstvwy]gt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF15II\", \"HpyF17I\", \"HpyF64III\", \"HpyF50II\", \"HpyF61I\", \"HpyF11II\", \"HpyF27II\", \"HpyF12II\", \"HpyF46IV\", \"Hpy166I\", \"HpyF42III\", \"HpyF33I\", \"HpyF28I\", \"HpyF19II\"],\n  site: \"tcnga\",\n  forwardRegex: \"tc[abcdghkmnrstvwy]ga\",\n  reverseRegex: \"tc[abcdghkmnrstvwy]ga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EclRI\", \"TspMI\", \"Pac25I\", \"XmaCI\", \"EaeAI\", \"AhyI\", \"XmaI\", \"Cfr9I\", \"PspAI\", \"XcyI\"],\n  site: \"cccggg\",\n  forwardRegex: \"c{3}g{3}\",\n  reverseRegex: \"c{3}g{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"XapI\", \"CfaI\", \"FsiI\", \"ApoI\", \"AcsI\"],\n  site: \"raatty\",\n  forwardRegex: \"[agr]a{2}t{2}[cty]\",\n  reverseRegex: \"[agr]a{2}t{2}[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"SenPI\", \"HpyNI\", \"Bsp548I\", \"LlaMI\", \"Eco51II\", \"Eco43I\", \"BsoI\", \"Bsp73I\", \"Eco200I\", \"Eco85I\", \"BsaCI\", \"Eco80I\", \"Uba17I\", \"Uba1391I\", \"Eco153I\", \"Bsp53I\", \"Eco93I\"],\n  site: \"ccngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Tsp49I\", \"TaiI\", \"TscI\"],\n  site: \"acgt\",\n  forwardRegex: \"acgt\",\n  reverseRegex: \"acgt\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"DraII\", \"EcoO109I\"],\n  site: \"rggnccy\",\n  forwardRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  reverseRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Ssp34I\", \"AcaI\", \"Bsp151I\", \"Uba1452I\", \"Ssp48I\", \"Ssp47I\", \"BpuHI\", \"NspJI\", \"Uba1385I\", \"Rma376I\", \"NspFI\", \"Ssp45I\", \"NspBI\", \"Ssp42I\", \"Ssp43I\", \"Ssp14I\", \"Psc27I\", \"Psc28I\", \"BspH22I\", \"Afl83I\", \"Bsp101I\", \"Ssp152I\", \"Bsp102I\", \"Bsp104I\", \"Mva16I\", \"Bsp241I\", \"Rma523I\", \"Bsp82I\", \"Sgr1839I\", \"OspI\", \"Bsp90I\", \"AviI\", \"BspH106I\", \"BspH103I\", \"Bsp148I\", \"Nsp29132I\"],\n  site: \"ttcgaa\",\n  forwardRegex: \"t{2}cga{2}\",\n  reverseRegex: \"t{2}cga{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CjuII\"],\n  site: \"caynnnnnctc\",\n  forwardRegex: \"ca[cty][abcdghkmnrstvwy]{5}ctc\",\n  reverseRegex: \"gag[abcdghkmnrstvwy]{5}[agr]tg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaN6II\", \"BstNSII\", \"Bst7QI\", \"AspDI\", \"AspBI\", \"AvrI\", \"EspHK29I\", \"NspDI\", \"NspEI\", \"AcrI\", \"Uba1205II\", \"Gst1588I\", \"BstZ4I\", \"Uba1436I\", \"BstBAII\", \"Umi5I\", \"NliI\", \"NmuAI\", \"Uba1440I\"],\n  site: \"cycgrg\",\n  forwardRegex: \"c[cty]cg[agr]g\",\n  reverseRegex: \"c[cty]cg[agr]g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AdeI\", \"DraIII\", \"BstIZ316I\"],\n  site: \"cacnnngtg\",\n  forwardRegex: \"cac[abcdghkmnrstvwy]{3}gtg\",\n  reverseRegex: \"cac[abcdghkmnrstvwy]{3}gtg\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Uba153AI\", \"BavAI\", \"BavBI\", \"BspO4I\", \"BamGI\", \"BavI\", \"EclI\", \"Pvu84II\", \"BspM39I\", \"UbaM39I\", \"NmeRI\", \"PvuII\", \"DmaI\", \"Bsp153AI\", \"Pun14627II\", \"Cfr6I\", \"Pae17kI\"],\n  site: \"cagctg\",\n  forwardRegex: \"cagctg\",\n  reverseRegex: \"cagctg\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Ava458I\", \"Cfr38I\", \"Cfr39I\", \"KspHK15I\", \"Cfr40I\", \"EspHK24I\", \"Cfr55I\", \"EcoHAI\", \"Cfr59I\", \"Eco164I\", \"EspHK16I\", \"Uba1188I\", \"EciBI\", \"Eco90I\", \"Uba1327I\", \"Cfr14I\", \"Uba36I\"],\n  site: \"yggccr\",\n  forwardRegex: \"[cty]g{2}c{2}[agr]\",\n  reverseRegex: \"[cty]g{2}c{2}[agr]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MchAI\", \"CspBI\", \"NotI\", \"CsiBI\", \"CciNI\"],\n  site: \"gcggccgc\",\n  forwardRegex: \"gcg{2}c{2}gc\",\n  reverseRegex: \"gcg{2}c{2}gc\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"BscKI\", \"Rtr20I\", \"BspVI\", \"Bco102II\", \"BsaVI\"],\n  site: \"gaagac\",\n  forwardRegex: \"ga{2}gac\",\n  reverseRegex: \"gtct{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AspMDI\", \"BfuCI\", \"NlaII\", \"HacI\", \"CcyI\", \"FnuEI\", \"FnuCI\", \"NdeII\", \"RalF40I\", \"BstMBI\", \"Sth368I\", \"SauMI\", \"Kzo9I\", \"MgoI\", \"MboI\", \"NphI\", \"Bsp67I\", \"BscFI\", \"LlaAI\", \"Bsp143I\", \"DpnII\", \"CviAI\", \"Bme12I\", \"PbrTI\", \"CpfI\", \"NmeCI\", \"SsiBI\", \"SsiAI\", \"Bfi57I\", \"Bst19II\", \"BstENII\", \"BssMI\", \"MkrAI\", \"BspAI\", \"BspFI\", \"BtkII\", \"BspJI\", \"CacI\", \"Bsp2095I\", \"BspKMI\", \"Sau3AI\", \"Bce243I\", \"Bsp105I\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"EcoprrI\"],\n  site: \"ccannnnnnnrtgc\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{7}[agr]tgc\",\n  reverseRegex: \"gca[cty][abcdghkmnrstvwy]{7}tg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Cfr48I\", \"Ese4I\", \"BscMI\", \"Uba1409I\", \"Eco262I\", \"Uba1159I\", \"Uba1264I\", \"Uba1263I\", \"Uba1363I\", \"Uba1142I\", \"Uba1357I\", \"Uba1421I\", \"Eco26I\", \"Eco25I\", \"Bsp117I\", \"Uba1206I\", \"Eco249I\", \"Eco35I\", \"Uba57I\", \"Uba1124I\", \"OmiAI\", \"OmiBI\", \"Eco113I\", \"Eco215I\", \"Eco216I\", \"Eco180I\", \"Uba1330I\", \"EcoT88I\", \"Uba1329I\", \"Ppu20I\", \"Eco232I\", \"Uba39I\", \"BstZ7I\", \"Uba1307I\", \"EcoT95I\", \"EcoT93I\", \"Eco68I\", \"Psp31I\", \"Eco211I\"],\n  site: \"grgcyc\",\n  forwardRegex: \"g[agr]gc[cty]c\",\n  reverseRegex: \"g[agr]gc[cty]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PaeR7I\", \"PanI\", \"BluI\", \"BssHI\", \"TliI\", \"Sol10179I\", \"StrI\", \"SauLPII\", \"SlaI\", \"AbrI\", \"Sfr274I\", \"EscI\", \"Sbi68I\", \"Sau3239I\", \"MavI\", \"CcrI\", \"BspAAI\", \"MlaAI\", \"XpaI\", \"BstVI\", \"XhoI\"],\n  site: \"ctcgag\",\n  forwardRegex: \"ctcgag\",\n  reverseRegex: \"ctcgag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"MchI\", \"Mly113I\", \"NarI\", \"NunII\", \"SseAI\", \"NdaI\"],\n  site: \"ggcgcc\",\n  forwardRegex: \"g{2}cgc{2}\",\n  reverseRegex: \"g{2}cgc{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"EgeI\", \"Eco78I\", \"DinI\", \"SfoI\", \"EheI\"],\n  site: \"ggcgcc\",\n  forwardRegex: \"g{2}cgc{2}\",\n  reverseRegex: \"g{2}cgc{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"M.AtuCI\", \"HpyF72III\", \"HpyF38I\", \"HpyF44I\", \"HpyAIV\", \"M.BabI\", \"HpyF55II\", \"HpyF2II\", \"HpyIV\", \"NcaI\", \"NsiHI\", \"HpyF60I\", \"CviEI\", \"CviFI\", \"CviCI\", \"M.SmeI\", \"CviDI\", \"CviGI\", \"HpyF10II\", \"HpyF71III\", \"Hpy87AI\", \"HpyF18I\", \"NovII\"],\n  site: \"gantc\",\n  forwardRegex: \"ga[abcdghkmnrstvwy]tc\",\n  reverseRegex: \"ga[abcdghkmnrstvwy]tc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bsp6I\", \"SatI\", \"Uur960I\", \"ItaI\", \"Fsp4HI\", \"Fnu4HI\", \"BisI\", \"FbrI\", \"GluI\", \"BsoFI\"],\n  site: \"gcngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]gc\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BsoDI\", \"Tsp504I\", \"TauII\"],\n  site: \"cggccg\",\n  forwardRegex: \"cg{2}c{2}g\",\n  reverseRegex: \"cg{2}c{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Hpy178II\", \"TceI\", \"HpyAII\", \"HpyII\"],\n  site: \"gaaga\",\n  forwardRegex: \"ga{2}ga\",\n  reverseRegex: \"tct{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PfeI\", \"TfiI\"],\n  site: \"gawtc\",\n  forwardRegex: \"ga[atw]tc\",\n  reverseRegex: \"ga[atw]tc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"NspIII\", \"BsoBI\", \"AvaI\", \"PunAI\", \"NspSAI\", \"BstSI\", \"BcoI\", \"BmeT110I\", \"PlaAI\", \"Bse15I\", \"OfoI\", \"AquI\", \"Eco88I\", \"BspLU4I\", \"Ama87I\", \"Eco27kI\", \"BsiHKCI\"],\n  site: \"cycgrg\",\n  forwardRegex: \"c[cty]cg[agr]g\",\n  reverseRegex: \"c[cty]cg[agr]g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"SdeAI\"],\n  site: \"cagrag\",\n  forwardRegex: \"cag[agr]ag\",\n  reverseRegex: \"ct[cty]ctg\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"BcoDI\", \"BsoMAI\", \"BsmAI\", \"Alw26I\", \"BstMAI\"],\n  site: \"gtctc\",\n  forwardRegex: \"gtctc\",\n  reverseRegex: \"gagac\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"SauHI\", \"Uba1294I\", \"BseG73I\", \"Uba1184II\", \"PxyMZI\", \"AsuSAI\", \"SecIII\", \"Bli643I\", \"Eco76I\", \"Bst29I\", \"Eco110kI\", \"BstZ6I\", \"Eco118I\", \"Bst30I\", \"EciCI\", \"Eco115I\", \"Uba1333I\", \"Uba1332I\"],\n  site: \"cctnagg\",\n  forwardRegex: \"c{2}t[abcdghkmnrstvwy]ag{2}\",\n  reverseRegex: \"c{2}t[abcdghkmnrstvwy]ag{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF44IV\", \"HpyCH4VI\", \"HpyF16II\", \"HpyF22III\", \"HpyF19III\", \"HpyNSH57II\"],\n  site: \"tcnnga\",\n  forwardRegex: \"tc[abcdghkmnrstvwy]{2}ga\",\n  reverseRegex: \"tc[abcdghkmnrstvwy]{2}ga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"OtuI\", \"MarI\", \"OtuNI\", \"Uba1433I\", \"Uba1441I\", \"Mho2111I\", \"BsaLI\", \"OxaI\"],\n  site: \"agct\",\n  forwardRegex: \"agct\",\n  reverseRegex: \"agct\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BfoI\", \"Bsp143II\", \"BstH2I\", \"AccB2I\", \"HaeII\"],\n  site: \"rgcgcy\",\n  forwardRegex: \"[agr]gcgc[cty]\",\n  reverseRegex: \"[agr]gcgc[cty]\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco57I\", \"BspKT5I\", \"AcuI\"],\n  site: \"ctgaag\",\n  forwardRegex: \"ctga{2}g\",\n  reverseRegex: \"ct{2}cag\",\n  topSnipOffset: 22,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"Uba1276I\", \"TdeII\", \"VpaO5I\", \"Bst158I\", \"UbaN7I\", \"BcrAI\", \"VpaKutEI\", \"VpaKutFI\", \"BsrEI\", \"Uba1192I\", \"BcoSI\"],\n  site: \"ctcttc\",\n  forwardRegex: \"ctct{2}c\",\n  reverseRegex: \"ga{2}gag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SsoII\", \"StyD4I\", \"BstSCI\", \"Eco137kI\", \"Ecl18kI\", \"BstMZ611I\", \"Eco13kI\", \"BssKI\", \"DsaV\", \"Eco21kI\", \"Kpn2kI\"],\n  site: \"ccngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BsmXI\", \"BsmDI\", \"BsmCI\"],\n  site: \"acnnnnnctcc\",\n  forwardRegex: \"ac[abcdghkmnrstvwy]{5}ctc{2}\",\n  reverseRegex: \"g{2}ag[abcdghkmnrstvwy]{5}gt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Uba1426I\", \"Uba1420I\", \"TrsTII\", \"Uba1374I\", \"BscLI\", \"Uba1266I\", \"VfiI\", \"BsaFI\", \"Uba1313I\", \"Uba1312I\", \"Uba1299I\", \"Uba1331I\", \"Uba1443I\", \"Cfr92I\"],\n  site: \"cttaag\",\n  forwardRegex: \"ct{2}a{2}g\",\n  reverseRegex: \"ct{2}a{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcaI\", \"BstEII\", \"AspAI\", \"Eci125I\", \"BstT9I\", \"Bse64I\", \"AcrII\", \"BstPI\", \"BseT9I\", \"NspSAII\", \"BsiKI\", \"EcoO128I\", \"BstT10I\", \"Eco91I\", \"BseT10I\", \"EcoO65I\", \"PspEI\"],\n  site: \"ggtnacc\",\n  forwardRegex: \"g{2}t[abcdghkmnrstvwy]ac{2}\",\n  reverseRegex: \"g{2}t[abcdghkmnrstvwy]ac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"HpyAV\", \"Hin4II\"],\n  site: \"ccttc\",\n  forwardRegex: \"c{2}t{2}c\",\n  reverseRegex: \"ga{2}g{2}\",\n  topSnipOffset: 11,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"BseII\", \"BsaKI\", \"Uba1408II\", \"MwhI\"],\n  site: \"gttaac\",\n  forwardRegex: \"gt{2}a{2}c\",\n  reverseRegex: \"gt{2}a{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Sse8387I\", \"SdaI\", \"SbfI\"],\n  site: \"cctgcagg\",\n  forwardRegex: \"c{2}tgcag{2}\",\n  reverseRegex: \"c{2}tgcag{2}\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"SacII\", \"CscI\", \"SpuI\", \"PaeAI\", \"GceI\", \"SchZI\", \"SstII\", \"Cfr42I\", \"PaeQI\", \"Eae46I\", \"Pae14kI\", \"RaqI\", \"Mpr154I\", \"GalI\", \"NgoAIII\", \"GceGLI\", \"Eco29kI\", \"Sfr303I\", \"Pae5kI\", \"NgoPIII\", \"SenPT14bI\", \"SgrBI\", \"KspI\", \"SexBI\", \"SexCI\", \"Kpn378I\"],\n  site: \"ccgcgg\",\n  forwardRegex: \"c{2}gcg{2}\",\n  reverseRegex: \"c{2}gcg{2}\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BpuNI\", \"FinI\", \"BscWI\"],\n  site: \"gggac\",\n  forwardRegex: \"g{3}ac\",\n  reverseRegex: \"gtc{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Uba1431I\", \"SseI\", \"Umi7I\", \"Uba1447I\", \"PovI\", \"CpeI\", \"BceDI\", \"BmeTI\", \"Bco102I\", \"AtuSI\", \"M.TaeII\", \"Bst77I\", \"BstKI\", \"BstGI\", \"SstIV\", \"Uba1282I\", \"CthI\", \"Uba1283I\", \"BstZ10II\"],\n  site: \"tgatca\",\n  forwardRegex: \"tgatca\",\n  reverseRegex: \"tgatca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MaeIII\"],\n  site: \"gtnac\",\n  forwardRegex: \"gt[abcdghkmnrstvwy]ac\",\n  reverseRegex: \"gt[abcdghkmnrstvwy]ac\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Eco646I\", \"Eco1341I\", \"Eco1413I\", \"Eco1432I\", \"Eco1424I\", \"Eco1422I\", \"Eco1383I\"],\n  site: \"ccannnnnnncttc\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{7}ct{2}c\",\n  reverseRegex: \"ga{2}g[abcdghkmnrstvwy]{7}tg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MvaI\", \"Bst1I\", \"Bst2I\", \"BsiLI\", \"CthII\", \"Sth302I\", \"BshGI\", \"BspNI\", \"TaqXI\", \"Bse17I\", \"Bse16I\", \"Bst2UI\", \"Bse24I\", \"Bst38I\", \"SslI\", \"BciBII\", \"AglI\", \"BthDI\", \"BthEI\", \"ApyI\", \"ZanI\", \"CbrI\", \"BstM6I\", \"BptI\", \"AorI\", \"ApaORI\", \"BseBI\", \"Fsp1604I\", \"AeuI\", \"Sth117I\", \"SniI\", \"Bst100I\", \"BstOI\", \"BstNI\"],\n  site: \"ccwgg\",\n  forwardRegex: \"c{2}[atw]g{2}\",\n  reverseRegex: \"c{2}[atw]g{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Bco27I\", \"CboI\", \"MspI\", \"BsuFI\", \"BsiSI\", \"Pde137I\", \"HpaII\", \"Sth134I\", \"Hin2I\", \"Bst40I\", \"HapII\", \"MnoI\"],\n  site: \"ccgg\",\n  forwardRegex: \"c{2}g{2}\",\n  reverseRegex: \"c{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Uba1368I\", \"Uba1156I\", \"Uba1157I\", \"Uba1202I\", \"EciEI\", \"Psp30I\", \"Uba1165I\", \"Uba1241I\"],\n  site: \"gggccc\",\n  forwardRegex: \"g{3}c{3}\",\n  reverseRegex: \"g{3}c{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SduI\", \"BsoCI\", \"BspLS2I\", \"MhlI\", \"Bsp1286I\", \"BmyI\", \"NspII\", \"AocII\"],\n  site: \"gdgchc\",\n  forwardRegex: \"g[adgkrtw]gc[achmtwy]c\",\n  reverseRegex: \"g[adgkrtw]gc[achmtwy]c\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"KspAI\", \"BstEZ359I\", \"BstHPI\", \"SsrI\", \"HpaI\"],\n  site: \"gttaac\",\n  forwardRegex: \"gt{2}a{2}c\",\n  reverseRegex: \"gt{2}a{2}c\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"SfiI\", \"SdiI\"],\n  site: \"ggccnnnnnggcc\",\n  forwardRegex: \"g{2}c{2}[abcdghkmnrstvwy]{5}g{2}c{2}\",\n  reverseRegex: \"g{2}c{2}[abcdghkmnrstvwy]{5}g{2}c{2}\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"LlaG2I\", \"NheI\", \"PstNHI\", \"AsuNHI\"],\n  site: \"gctagc\",\n  forwardRegex: \"gctagc\",\n  reverseRegex: \"gctagc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"AluBI\", \"AluI\", \"MltI\"],\n  site: \"agct\",\n  forwardRegex: \"agct\",\n  reverseRegex: \"agct\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"HpyF49V\", \"HpyF36III\", \"M.CviSI\", \"HpyF48III\", \"HpyJP26I\", \"HpyF38II\", \"HpyF45II\", \"HpyF67II\", \"Hpy26I\"],\n  site: \"tgca\",\n  forwardRegex: \"tgca\",\n  reverseRegex: \"tgca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"DraRI\"],\n  site: \"caagnac\",\n  forwardRegex: \"ca{2}g[abcdghkmnrstvwy]ac\",\n  reverseRegex: \"gt[abcdghkmnrstvwy]ct{2}g\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"Eco1265I\", \"Eco1441I\", \"Eco1443I\", \"Eco1447I\", \"Eco1158I\", \"Eco14444I\", \"EcoBI\"],\n  site: \"tgannnnnnnntgct\",\n  forwardRegex: \"tga[abcdghkmnrstvwy]{8}tgct\",\n  reverseRegex: \"agca[abcdghkmnrstvwy]{8}tca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BbeAI\", \"PmnI\", \"McaAI\", \"NamI\", \"PatAI\", \"MsaI\"],\n  site: \"ggcgcc\",\n  forwardRegex: \"g{2}cgc{2}\",\n  reverseRegex: \"g{2}cgc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BstC8I\", \"Cac8I\"],\n  site: \"gcnngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]{2}gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]{2}gc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"EsaBC3I\"],\n  site: \"tcga\",\n  forwardRegex: \"tcga\",\n  reverseRegex: \"tcga\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"Pfr12I\", \"AmeI\", \"Bsp146I\", \"Uba1203I\", \"Pfl23I\", \"PliI\", \"AaqI\", \"DaqI\", \"ScoNI\", \"Uba1387I\"],\n  site: \"gtgcac\",\n  forwardRegex: \"gtgcac\",\n  reverseRegex: \"gtgcac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AccIII\", \"PinBII\", \"CauB3I\", \"MroI\", \"Aor13HI\", \"BseAI\", \"Bsp13I\", \"Kpn2I\", \"PtaI\", \"BspEI\", \"Bsu23I\", \"BsiMI\", \"BlfI\", \"BbvAIII\", \"BspMII\"],\n  site: \"tccgga\",\n  forwardRegex: \"tc{2}g{2}a\",\n  reverseRegex: \"tc{2}g{2}a\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Eco1342I\", \"Eco1344I\", \"EcoKI\", \"Eco1394I\"],\n  site: \"aacnnnnnngtgc\",\n  forwardRegex: \"a{2}c[abcdghkmnrstvwy]{6}gtgc\",\n  reverseRegex: \"gcac[abcdghkmnrstvwy]{6}gt{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NgoJI\", \"NgoGI\", \"NgoMI\", \"HinHI\", \"NgoAI\", \"NgoBI\", \"M.NgoEI\", \"NgoCI\", \"NgoWI\", \"Bst16I\", \"Btu34II\", \"Bst1473II\", \"BsmHI\"],\n  site: \"rgcgcy\",\n  forwardRegex: \"[agr]gcgc[cty]\",\n  reverseRegex: \"[agr]gcgc[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MboII\", \"NcuI\"],\n  site: \"gaaga\",\n  forwardRegex: \"ga{2}ga\",\n  reverseRegex: \"tct{2}c\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 12,\n  isType2S: true\n}, {\n  aliases: [\"Eco188I\", \"Eco98I\", \"Uba1435I\", \"Hin5III\", \"Uba1219I\", \"UbaN17I\", \"SpaPIV\", \"Eco231I\", \"BstZ1II\", \"Csp231I\", \"Eco65I\", \"HinbIII\", \"ChuEI\", \"Asp52I\", \"Asp3065I\", \"Uba83I\", \"HinfII\", \"MkiI\", \"HinJCII\", \"BsmGII\", \"Hin1076III\", \"HinSAFI\", \"Hin173I\", \"Uba1164II\", \"BseHI\", \"BbrAI\", \"Bst170II\", \"BpeI\", \"Cfr32I\"],\n  site: \"aagctt\",\n  forwardRegex: \"a{2}gct{2}\",\n  reverseRegex: \"a{2}gct{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"StsI\"],\n  site: \"ggatg\",\n  forwardRegex: \"g{2}atg\",\n  reverseRegex: \"catc{2}\",\n  topSnipOffset: 15,\n  bottomSnipOffset: 19,\n  isType2S: true\n}, {\n  aliases: [\"BstZ2I\", \"Uba1191I\", \"Uba1190I\"],\n  site: \"gacnnnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{5}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{5}gtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Hin6I\", \"HinP1I\", \"HsoI\", \"HspAI\", \"SciNI\", \"BbtI\"],\n  site: \"gcgc\",\n  forwardRegex: \"gcgc\",\n  reverseRegex: \"gcgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"PmdI\"],\n  site: \"cctcagc\",\n  forwardRegex: \"c{2}tcagc\",\n  reverseRegex: \"gctgag{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BcefI\"],\n  site: \"acggc\",\n  forwardRegex: \"acg{2}c\",\n  reverseRegex: \"gc{2}gt\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 18,\n  isType2S: true\n}, {\n  aliases: [\"Eco52I\", \"BstZI\", \"EagI\", \"XmaIII\", \"BseX3I\", \"EclXI\", \"AaaI\", \"SenPT16I\"],\n  site: \"cggccg\",\n  forwardRegex: \"cg{2}c{2}g\",\n  reverseRegex: \"cg{2}c{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BsaJI\", \"SecI\", \"BssECI\", \"BseDI\"],\n  site: \"ccnngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]{2}g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"CciI\", \"RspXI\", \"BspHI\", \"PagI\", \"RcaI\"],\n  site: \"tcatga\",\n  forwardRegex: \"tcatga\",\n  reverseRegex: \"tcatga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"FseI\", \"RigI\"],\n  site: \"ggccggcc\",\n  forwardRegex: \"g{2}c{2}g{2}c{2}\",\n  reverseRegex: \"g{2}c{2}g{2}c{2}\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BstMWI\", \"HpyF10VI\", \"Bce4I\", \"BceCI\", \"BspWI\", \"MwoI\"],\n  site: \"gcnnnnnnngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]{7}gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]{7}gc\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"HpyF10III\", \"Uba1442I\", \"HpyF67IV\", \"BstZ10I\", \"BsoKI\", \"HpyF61II\", \"Hpy99IV\"],\n  site: \"ccnngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]{2}g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Aor51HI\", \"FunI\", \"Eco47III\", \"AitI\", \"AfeI\"],\n  site: \"agcgct\",\n  forwardRegex: \"agcgct\",\n  reverseRegex: \"agcgct\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"MlyI\", \"SchI\"],\n  site: \"gagtc\",\n  forwardRegex: \"gagtc\",\n  reverseRegex: \"gactc\",\n  topSnipOffset: 10,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"BseB631I\", \"VanI\", \"Bpu86I\", \"Tsp219I\", \"BsoJI\"],\n  site: \"gccnnnnnggc\",\n  forwardRegex: \"gc{2}[abcdghkmnrstvwy]{5}g{2}c\",\n  reverseRegex: \"gc{2}[abcdghkmnrstvwy]{5}g{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bsp120I\", \"PspOMI\"],\n  site: \"gggccc\",\n  forwardRegex: \"g{3}c{3}\",\n  reverseRegex: \"g{3}c{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Csp6I\", \"RsaNI\", \"CviRII\", \"CviQI\"],\n  site: \"gtac\",\n  forwardRegex: \"gtac\",\n  reverseRegex: \"gtac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"M.Phi3TI\", \"Cac824I\", \"Bpu1811I\", \"M.NgoBXII\", \"M.Rho11sI\", \"CcoP216I\", \"CcoP215I\", \"Bli1904II\", \"BssFI\", \"BssXI\", \"M.SPBetaI\", \"LlaDII\"],\n  site: \"gcngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AflII\", \"MspCI\", \"Vha464I\", \"Bst98I\", \"BstAFI\", \"Esp4I\", \"BstPZ740I\", \"BfrI\", \"BspTI\"],\n  site: \"cttaag\",\n  forwardRegex: \"ct{2}a{2}g\",\n  reverseRegex: \"ct{2}a{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BthCI\"],\n  site: \"gcngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]gc\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TfiTok6A1I\", \"TspAK13D21I\", \"TspVil3I\", \"M.Rho11sII\", \"Hpy26II\", \"HpyF65II\", \"TflI\", \"HpyF16I\", \"TfiTok4A2I\", \"HpyF23I\", \"HpyV\", \"Tsp358I\", \"HpyF71I\", \"HpyF73II\", \"TfiA3I\", \"HpyF26III\", \"TspAK16D24I\", \"Tsc4aI\", \"HpyF42IV\", \"HpyF66IV\", \"TspVi4AI\", \"M.CviBIII\", \"TthRQI\", \"Tbr51I\", \"HpyF52I\", \"HpyF49I\", \"Tth24I\", \"M.Phi3TII\", \"HpyF64I\", \"CviSIII\", \"HpyF40II\", \"Taq20I\", \"Tsp505I\", \"HpyF35I\", \"HpyF62II\", \"HpyJP26II\", \"HpyF30I\", \"HpyF24I\", \"HpyF59III\", \"TspNI\", \"Tsp510I\", \"HpyF45I\", \"HpyF14III\"],\n  site: \"tcga\",\n  forwardRegex: \"tcga\",\n  reverseRegex: \"tcga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SthNI\", \"SthBI\", \"SthCI\", \"SthDI\", \"SthEI\", \"SthAI\", \"SthJI\", \"SthKI\", \"SthLI\", \"SthMI\", \"SthFI\", \"SthGI\", \"SthHI\", \"Uba1201I\", \"Uba76I\", \"Uba86I\", \"Uba85I\", \"Uba87I\", \"NmiI\", \"KpnK14I\", \"Eco149I\", \"MvsAI\", \"MvsDI\", \"MvsEI\", \"MvsBI\", \"MvsCI\", \"BspJ106I\", \"Sau10I\", \"Esp19I\", \"MvsI\"],\n  site: \"ggtacc\",\n  forwardRegex: \"g{2}tac{2}\",\n  reverseRegex: \"g{2}tac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"M.NgoBIX\"],\n  site: \"gtannnnnctc\",\n  forwardRegex: \"gta[abcdghkmnrstvwy]{5}ctc\",\n  reverseRegex: \"gag[abcdghkmnrstvwy]{5}tac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Asp29HI\", \"HpyF65III\", \"HpyF21II\", \"HpyF59II\", \"Hpy303I\", \"HpyF10IV\", \"HpyF66III\", \"Hpy471I\", \"Hpy423I\", \"Hpy421I\", \"HpyHII\", \"Asp18HI\", \"CcoP73I\", \"HpyNSH57I\", \"Hpy312I\", \"HpyF53II\", \"Asp17HI\", \"HpyF44V\", \"Hpy401I\", \"HpyF13IV\", \"HpyF31I\", \"HpyF36II\", \"Asp16HI\", \"HpyF52III\", \"Hpy501I\", \"MjaV\"],\n  site: \"gtac\",\n  forwardRegex: \"gtac\",\n  reverseRegex: \"gtac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bsp19I\", \"NcoI\"],\n  site: \"ccatgg\",\n  forwardRegex: \"c{2}atg{2}\",\n  reverseRegex: \"c{2}atg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Psp1406I\", \"AclI\"],\n  site: \"aacgtt\",\n  forwardRegex: \"a{2}cgt{2}\",\n  reverseRegex: \"a{2}cgt{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Uba1432I\", \"Asp17I\", \"Asp8HI\", \"AitII\", \"AitAI\", \"BpuGI\", \"Asp21HI\", \"Asp22I\", \"Asp1HI\", \"Asp14HI\", \"BscSI\", \"Asp6HI\"],\n  site: \"rgatcy\",\n  forwardRegex: \"[agr]gatc[cty]\",\n  reverseRegex: \"[agr]gatc[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"RpaB5I\"],\n  site: \"cgrggac\",\n  forwardRegex: \"cg[agr]g{2}ac\",\n  reverseRegex: \"gtc{2}[cty]cg\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"LweI\", \"SfaNI\", \"BspST5I\", \"BmsI\", \"PhaI\"],\n  site: \"gcatc\",\n  forwardRegex: \"gcatc\",\n  reverseRegex: \"gatgc\",\n  topSnipOffset: 10,\n  bottomSnipOffset: 14,\n  isType2S: true\n}, {\n  aliases: [\"EcoA4I\", \"BspTNI\", \"EcoO44I\", \"Bso31I\", \"BsaI\", \"Eco31I\", \"Bli736I\"],\n  isType2S: true,\n  site: \"ggtctc\",\n  forwardRegex: \"g{2}tctc\",\n  reverseRegex: \"gagac{2}\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 11\n}, {\n  aliases: [\"Asi256I\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Uba1362I\", \"TseAI\", \"Bka1125I\", \"HpyF36IV\", \"HpyF47I\", \"Mlu40I\", \"BstZ15I\"],\n  site: \"gdgchc\",\n  forwardRegex: \"g[adgkrtw]gc[achmtwy]c\",\n  reverseRegex: \"g[adgkrtw]gc[achmtwy]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Ppu21I\", \"BsaAI\", \"PsuAI\", \"BstBAI\", \"MspYI\"],\n  site: \"yacgtr\",\n  forwardRegex: \"[cty]acgt[agr]\",\n  reverseRegex: \"[cty]acgt[agr]\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Vsp2246I\", \"Eco50I\", \"Uba1127I\", \"Eco195I\", \"Bme05I\", \"Eco173I\", \"SspM1III\", \"Eco171I\", \"Esp25I\", \"Esp22I\", \"Esp21I\", \"Esp15I\", \"Esp9I\", \"Esp14I\", \"Esp13I\", \"Esp12I\", \"Esp11I\", \"Esp10I\", \"Esp1I\", \"Esp6I\", \"Pph14I\", \"Eco169I\", \"Eco168I\"],\n  site: \"ggyrcc\",\n  forwardRegex: \"g{2}[cty][agr]c{2}\",\n  reverseRegex: \"g{2}[cty][agr]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Mlu1106I\"],\n  site: \"rggwccy\",\n  forwardRegex: \"[agr]g{2}[atw]c{2}[cty]\",\n  reverseRegex: \"[agr]g{2}[atw]c{2}[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bst22I\", \"BsiYI\", \"BflI\", \"Bsc107I\", \"BseLI\", \"AfiI\", \"BslI\", \"Bsc4I\"],\n  site: \"ccnnnnnnngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]{7}g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]{7}g{2}\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BstD102I\", \"BsrBI\", \"MbiI\", \"AccBSI\", \"Bst31NI\"],\n  site: \"ccgctc\",\n  forwardRegex: \"c{2}gctc\",\n  reverseRegex: \"gagcg{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BsrXI\", \"Msp23I\", \"BspLU11II\"],\n  site: \"tctaga\",\n  forwardRegex: \"tctaga\",\n  reverseRegex: \"tctaga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AclNI\", \"BcuI\", \"SpeI\", \"AhlI\"],\n  site: \"actagt\",\n  forwardRegex: \"actagt\",\n  reverseRegex: \"actagt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"PunAII\", \"AvoI\", \"PauAI\", \"NspHI\", \"BstNSI\", \"NspI\", \"XceI\"],\n  site: \"rcatgy\",\n  forwardRegex: \"[agr]catg[cty]\",\n  reverseRegex: \"[agr]catg[cty]\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MscI\", \"BalI\", \"MluNI\", \"MlsI\", \"Mlu31I\", \"Msp20I\"],\n  site: \"tggcca\",\n  forwardRegex: \"tg{2}c{2}a\",\n  reverseRegex: \"tg{2}c{2}a\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BmgI\"],\n  site: \"gkgccc\",\n  forwardRegex: \"g[gkt]gc{3}\",\n  reverseRegex: \"g{3}c[acm]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BglII\", \"NcrI\", \"Pae2kI\", \"Pae18kI\", \"NspMACI\"],\n  site: \"agatct\",\n  forwardRegex: \"agatct\",\n  reverseRegex: \"agatct\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"FatII\", \"M.CviSII\", \"Hin8II\"],\n  site: \"catg\",\n  forwardRegex: \"catg\",\n  reverseRegex: \"catg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CglI\", \"NgoFVII\"],\n  site: \"gcsgc\",\n  forwardRegex: \"gc[cgs]gc\",\n  reverseRegex: \"gc[cgs]gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SspM1II\", \"NlaSII\", \"SspJII\", \"Uba1381I\", \"Hin8I\", \"SspM2II\"],\n  site: \"grcgyc\",\n  forwardRegex: \"g[agr]cg[cty]c\",\n  reverseRegex: \"g[agr]cg[cty]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"VchO68I\", \"BscOI\", \"PaeCI\", \"Asp5HI\", \"Bsp121I\", \"Uba1226I\", \"Uba1162I\", \"CglAI\", \"BtgAII\", \"SpaXI\"],\n  site: \"gcatgc\",\n  forwardRegex: \"gcatgc\",\n  reverseRegex: \"gcatgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"XcaI\", \"BstZ17I\", \"BspM90I\", \"BssNAI\", \"BstBSI\", \"Bst1107I\"],\n  site: \"gtatac\",\n  forwardRegex: \"gtatac\",\n  reverseRegex: \"gtatac\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Bme1580I\", \"BstSLI\", \"BseSI\", \"BaeGI\"],\n  site: \"gkgcmc\",\n  forwardRegex: \"g[gkt]gc[acm]c\",\n  reverseRegex: \"g[gkt]gc[acm]c\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MthFI\", \"Rma500I\", \"Rma501I\", \"Rma503I\", \"FisI\", \"Rma509I\", \"Rma506I\", \"Rma510I\", \"MjaI\", \"Rma515I\", \"Rma516I\", \"Rma517I\", \"Rma518I\", \"Rma519I\", \"Rma496I\", \"Rma495I\", \"Rma522I\", \"Rma497I\", \"UbaN5I\", \"Rma490I\", \"Rma486I\", \"Rma485I\"],\n  site: \"ctag\",\n  forwardRegex: \"ctag\",\n  reverseRegex: \"ctag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SelI\"],\n  site: \"cgcg\",\n  forwardRegex: \"cgcg\",\n  reverseRegex: \"cgcg\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Mlu9273I\", \"VchO70I\", \"Sna3286I\", \"SalDI\", \"PspDI\", \"Uba1117I\", \"Uba1386I\", \"AmaSI\"],\n  site: \"tcgcga\",\n  forwardRegex: \"tcgcga\",\n  reverseRegex: \"tcgcga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Hsp92I\", \"BbiII\", \"Msp17I\", \"HgiGI\", \"HgiDI\", \"AsuIII\", \"PamII\", \"BsaHI\", \"BstACI\", \"HgiHII\", \"AcyI\", \"BssNI\", \"Hin1I\", \"AhaII\", \"AstWI\", \"HgiI\", \"AosII\"],\n  site: \"grcgyc\",\n  forwardRegex: \"g[agr]cg[cty]c\",\n  reverseRegex: \"g[agr]cg[cty]c\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BtgZI\"],\n  site: \"gcgatg\",\n  forwardRegex: \"gcgatg\",\n  reverseRegex: \"catcgc\",\n  topSnipOffset: 16,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"Bme142I\", \"LpnI\"],\n  site: \"rgcgcy\",\n  forwardRegex: \"[agr]gcgc[cty]\",\n  reverseRegex: \"[agr]gcgc[cty]\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"PlaAII\", \"HpyBI\", \"RsaI\", \"AfaI\"],\n  site: \"gtac\",\n  forwardRegex: \"gtac\",\n  reverseRegex: \"gtac\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"Tru201I\", \"BloHI\", \"BstX2I\", \"MflI\", \"BstYI\", \"XhoII\", \"PsuI\", \"DsaIII\"],\n  site: \"rgatcy\",\n  forwardRegex: \"[agr]gatc[cty]\",\n  reverseRegex: \"[agr]gatc[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Eco252I\", \"Uba58I\", \"Van91II\", \"VchO2I\", \"Eco159I\", \"Hal22I\", \"Eco82I\", \"Eco228I\", \"Eco237I\", \"VchN100I\"],\n  site: \"gaattc\",\n  forwardRegex: \"ga{2}t{2}c\",\n  reverseRegex: \"ga{2}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MluB2I\", \"Bsp68I\", \"RruI\", \"SpoI\", \"NruI\", \"BtuMI\", \"Sbo13I\"],\n  site: \"tcgcga\",\n  forwardRegex: \"tcgcga\",\n  reverseRegex: \"tcgcga\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"AlwXI\", \"Bst12I\", \"BseKI\", \"BbvI\", \"Bst71I\", \"BseXI\", \"BstV1I\", \"Bsp423I\", \"Lsp1109I\"],\n  site: \"gcagc\",\n  forwardRegex: \"gcagc\",\n  reverseRegex: \"gctgc\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 17,\n  isType2S: true\n}, {\n  aliases: [\"BspACI\", \"SsiI\", \"AciI\"],\n  site: \"ccgc\",\n  forwardRegex: \"c{2}gc\",\n  reverseRegex: \"gcg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"EcoT38I\", \"PaeHI\", \"KoxII\", \"SacNI\", \"Eco24I\", \"BpuI\", \"FriOI\", \"Bsu1854I\", \"Eco75KI\", \"BanII\", \"BvuI\", \"HgiJII\", \"Bsp519I\"],\n  site: \"grgcyc\",\n  forwardRegex: \"g[agr]gc[cty]c\",\n  reverseRegex: \"g[agr]gc[cty]c\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PasI\"],\n  site: \"cccwggg\",\n  forwardRegex: \"c{3}[atw]g{3}\",\n  reverseRegex: \"c{3}[atw]g{3}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"MluCI\", \"TseCI\"],\n  site: \"aatt\",\n  forwardRegex: \"a{2}t{2}\",\n  reverseRegex: \"a{2}t{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF50I\", \"HpyF49III\", \"HpyF14II\", \"HpyF7III\", \"HpyF46III\", \"MjaIV\"],\n  site: \"gtnnac\",\n  forwardRegex: \"gt[abcdghkmnrstvwy]{2}ac\",\n  reverseRegex: \"gt[abcdghkmnrstvwy]{2}ac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Psp1009I\", \"Tsp8EI\", \"BglI\"],\n  site: \"gccnnnnnggc\",\n  forwardRegex: \"gc{2}[abcdghkmnrstvwy]{5}g{2}c\",\n  reverseRegex: \"gc{2}[abcdghkmnrstvwy]{5}g{2}c\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"SruI\", \"DraI\", \"PauAII\", \"AhaIII\"],\n  site: \"tttaaa\",\n  forwardRegex: \"t{3}a{3}\",\n  reverseRegex: \"t{3}a{3}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"AccI\", \"XmiI\", \"FblI\"],\n  site: \"gtmkac\",\n  forwardRegex: \"gt[acm][gkt]ac\",\n  reverseRegex: \"gt[acm][gkt]ac\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"PmeI\", \"MssI\"],\n  site: \"gtttaaac\",\n  forwardRegex: \"gt{3}a{3}c\",\n  reverseRegex: \"gt{3}a{3}c\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"PshDI\", \"PshCI\", \"PspBI\", \"Pgl34I\", \"Psp38I\", \"VpaK3AI\", \"VpaK3BI\", \"Bsp87I\"],\n  site: \"cacgtg\",\n  forwardRegex: \"cacgtg\",\n  reverseRegex: \"cacgtg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AxyI\", \"AocI\", \"Lmu60I\", \"BspR7I\", \"OxaNI\", \"CvnI\", \"MstII\", \"Bsu36I\", \"Eco81I\", \"SshAI\", \"SauI\", \"BliHKI\", \"Bse21I\"],\n  site: \"cctnagg\",\n  forwardRegex: \"c{2}t[abcdghkmnrstvwy]ag{2}\",\n  reverseRegex: \"c{2}t[abcdghkmnrstvwy]ag{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"TsoI\"],\n  site: \"tarcca\",\n  forwardRegex: \"ta[agr]c{2}a\",\n  reverseRegex: \"tg{2}[cty]ta\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"PlaII\", \"LspI\", \"SspRFI\", \"BsiCI\", \"Bpu14I\", \"AcpI\", \"FspII\", \"MlaI\", \"AsuII\", \"Ssp1I\", \"Asp10HI\", \"NspV\", \"Bsp119I\", \"BspLAII\", \"SviI\", \"PpaAI\", \"SfuI\", \"CbiI\", \"Bim19I\", \"BstBI\", \"BimI\", \"Csp68KII\", \"Csp45I\", \"BspT104I\"],\n  site: \"ttcgaa\",\n  forwardRegex: \"t{2}cga{2}\",\n  reverseRegex: \"t{2}cga{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"EspHK26I\", \"Bla7920I\", \"Uba1375I\", \"BspH226I\", \"Cfr57I\", \"Tsp514I\", \"Bsp233I\", \"Uba1136I\", \"Uba1425I\", \"Tsp507I\", \"Bsp228I\", \"Uba1279I\", \"Bbf7411I\", \"BstZ3I\", \"Bsu22I\", \"BstZ1I\", \"BsiGI\", \"BsiOI\", \"Bsp508I\"],\n  site: \"tccgga\",\n  forwardRegex: \"tc{2}g{2}a\",\n  reverseRegex: \"tc{2}g{2}a\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpuEI\", \"Bce83I\"],\n  site: \"cttgag\",\n  forwardRegex: \"ct{2}gag\",\n  reverseRegex: \"ctca{2}g\",\n  topSnipOffset: 22,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"AspS9I\", \"AsuI\", \"NspIV\", \"BsiZI\", \"Bsp1894I\", \"BspF4I\", \"Cfr13I\", \"BshKI\", \"BspBII\", \"Pde12I\", \"PspPI\", \"MaeK81II\", \"BavAII\", \"Nsp7121I\", \"BavBII\", \"Bal228I\", \"CcuI\", \"Sau96I\", \"AvcI\", \"Bsu54I\", \"Bce22I\", \"Bac36I\"],\n  site: \"ggncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BstKTI\", \"BspKT6I\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BfmI\", \"BdiSI\", \"Srl56DI\", \"BpcI\", \"BthP35I\", \"SfcI\", \"BstSFI\", \"LlaBI\", \"SfeI\"],\n  site: \"ctryag\",\n  forwardRegex: \"ct[agr][cty]ag\",\n  reverseRegex: \"ct[agr][cty]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"MseI\", \"Tru1I\", \"Tru9I\", \"SaqAI\"],\n  site: \"ttaa\",\n  forwardRegex: \"t{2}a{2}\",\n  reverseRegex: \"t{2}a{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Sau96mI\", \"Sau93I\", \"Sau98I\", \"Sau90I\"],\n  site: \"ctyrag\",\n  forwardRegex: \"ct[cty][agr]ag\",\n  reverseRegex: \"ct[cty][agr]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TrsSII\"],\n  site: \"gacnnnnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{6}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{6}gtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"ParI\", \"BsiQI\", \"BclI\", \"AbaI\", \"FbaI\", \"Ksp22I\", \"BstT7I\", \"BspXII\"],\n  site: \"tgatca\",\n  forwardRegex: \"tgatca\",\n  reverseRegex: \"tgatca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Eco255I\", \"DpaI\", \"BmcAI\", \"ZrmI\", \"ScaI\", \"AssI\", \"Bpa34I\", \"Acc113I\", \"RflFII\"],\n  site: \"agtact\",\n  forwardRegex: \"agtact\",\n  reverseRegex: \"agtact\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"SplAII\", \"TteI\", \"TspI\", \"TrsKTII\", \"FsuI\", \"SmaAII\", \"NtaI\", \"SplII\", \"SpaPI\", \"TtrI\"],\n  site: \"gacnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{3}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{3}gtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AspLEI\", \"HhaI\", \"BspLAI\", \"CfoI\", \"BstHHI\", \"FnuDIII\"],\n  site: \"gcgc\",\n  forwardRegex: \"gcgc\",\n  reverseRegex: \"gcgc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"StyLTI\"],\n  site: \"cagag\",\n  forwardRegex: \"cagag\",\n  reverseRegex: \"ctctg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BsoEI\", \"Uba1289I\", \"Uba1290I\", \"BstWI\", \"Uba1309I\", \"Uba1308I\", \"Uba1310I\", \"Bpu1268I\"],\n  site: \"cctnnnnnagg\",\n  forwardRegex: \"c{2}t[abcdghkmnrstvwy]{5}ag{2}\",\n  reverseRegex: \"c{2}t[abcdghkmnrstvwy]{5}ag{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco826I\", \"Eco1455I\"],\n  site: \"gcannnnnnctga\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{6}ctga\",\n  reverseRegex: \"tcag[abcdghkmnrstvwy]{6}tgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"ApaI\", \"PpeI\"],\n  site: \"gggccc\",\n  forwardRegex: \"g{3}c{3}\",\n  reverseRegex: \"g{3}c{3}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"KpnBI\"],\n  site: \"caaannnnnnrtca\",\n  forwardRegex: \"ca{3}[abcdghkmnrstvwy]{6}[agr]tca\",\n  reverseRegex: \"tga[cty][abcdghkmnrstvwy]{6}t{3}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UnbI\"],\n  site: \"ggncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Uba1384I\", \"SmuCI\", \"AvaIII\", \"Uba1353I\", \"PxyJKI\", \"Uba1367I\", \"BfrCI\", \"SrlII\"],\n  site: \"atgcat\",\n  forwardRegex: \"atgcat\",\n  reverseRegex: \"atgcat\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BspMKI\", \"XciI\", \"SalI\", \"HgiCIII\", \"Rtr63I\", \"Rrh4273I\", \"RflFI\", \"HgiDII\", \"NopI\", \"RtrI\"],\n  site: \"gtcgac\",\n  forwardRegex: \"gtcgac\",\n  reverseRegex: \"gtcgac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"EcoR124I\"],\n  site: \"gaannnnnnrtcg\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{6}[agr]tcg\",\n  reverseRegex: \"cga[cty][abcdghkmnrstvwy]{6}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SynII\", \"Psc2I\"],\n  site: \"gaannnnttc\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{4}t{2}c\",\n  reverseRegex: \"ga{2}[abcdghkmnrstvwy]{4}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CspI\", \"Rsr2I\", \"RsrII\", \"CpoI\"],\n  site: \"cggwccg\",\n  forwardRegex: \"cg{2}[atw]c{2}g\",\n  reverseRegex: \"cg{2}[atw]c{2}g\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"AscI\", \"PalAI\", \"SgsI\"],\n  site: \"ggcgcgcc\",\n  forwardRegex: \"g{2}cgcgc{2}\",\n  reverseRegex: \"g{2}cgcgc{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"Uba69I\", \"TtmII\", \"BscEI\", \"BsrHI\", \"Kpn30I\", \"M.BssHIII\", \"BssBI\", \"Eco143I\", \"Eco152I\", \"Esp7I\", \"Esp8I\", \"CfrJ5I\", \"BsoPI\"],\n  site: \"gcgcgc\",\n  forwardRegex: \"gcgcgc\",\n  reverseRegex: \"gcgcgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EclHKI\", \"BspOVI\", \"AhdI\", \"AspEI\", \"Eam1105I\", \"NruGI\", \"BmeRI\", \"DriI\"],\n  site: \"gacnnnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{5}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{5}gtc\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Uba1222I\", \"Uba1221I\", \"BpuGCI\", \"Uba1320I\", \"Uba1284I\"],\n  site: \"gctnagc\",\n  forwardRegex: \"gct[abcdghkmnrstvwy]agc\",\n  reverseRegex: \"gct[abcdghkmnrstvwy]agc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpuCI\"],\n  site: \"ggcgga\",\n  forwardRegex: \"g{2}cg{2}a\",\n  reverseRegex: \"tc{2}gc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EspI\", \"BlpI\", \"Bsp1720I\", \"Bpu1102I\", \"CelII\"],\n  site: \"gctnagc\",\n  forwardRegex: \"gct[abcdghkmnrstvwy]agc\",\n  reverseRegex: \"gct[abcdghkmnrstvwy]agc\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Eco1476I\", \"Eco1427I\", \"Eco1430I\", \"Eco1323I\", \"Eco377I\", \"Eco1386I\", \"Eco37I\", \"Eco1344II\", \"Eco1456I\"],\n  site: \"ggannnnnnnnatgc\",\n  forwardRegex: \"g{2}a[abcdghkmnrstvwy]{8}atgc\",\n  reverseRegex: \"gcat[abcdghkmnrstvwy]{8}tc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MnnI\", \"Hin1160II\", \"ChuEII\", \"Hin1161II\"],\n  site: \"gtyrac\",\n  forwardRegex: \"gt[cty][agr]ac\",\n  reverseRegex: \"gt[cty][agr]ac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SstI\", \"SacI\", \"Psp124BI\"],\n  site: \"gagctc\",\n  forwardRegex: \"gagctc\",\n  reverseRegex: \"gagctc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SspD5II\", \"NsiI\", \"PinBI\", \"Asi372I\", \"Mph1103I\", \"Csp68KIII\", \"Zsp2I\", \"SepI\", \"EcoT22I\", \"BfrBI\"],\n  site: \"atgcat\",\n  forwardRegex: \"atgcat\",\n  reverseRegex: \"atgcat\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AsnI\", \"AseI\", \"VspI\", \"PshBI\", \"Sru4DI\", \"BpoAI\"],\n  site: \"attaat\",\n  forwardRegex: \"at{2}a{2}t\",\n  reverseRegex: \"at{2}a{2}t\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BmrFI\", \"Msp67I\", \"MspR9I\", \"ScrFI\", \"Bme1390I\"],\n  site: \"ccngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]g{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"McrI\", \"BsaOI\", \"BsiEI\", \"Bsh1285I\", \"BstMCI\"],\n  site: \"cgrycg\",\n  forwardRegex: \"cg[agr][cty]cg\",\n  reverseRegex: \"cg[agr][cty]cg\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"TspRI\", \"TscAI\"],\n  site: \"castgnn\",\n  forwardRegex: \"ca[cgs]tg[abcdghkmnrstvwy]{2}\",\n  reverseRegex: \"[abcdghkmnrstvwy]{2}ca[cgs]tg\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"BsmWI\", \"SmaAI\", \"SspKI\", \"SplAI\", \"PfuNI\"],\n  site: \"cgtacg\",\n  forwardRegex: \"cgtacg\",\n  reverseRegex: \"cgtacg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CdiI\"],\n  site: \"catcg\",\n  forwardRegex: \"catcg\",\n  reverseRegex: \"cgatg\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"TrsKTIII\"],\n  site: \"catatg\",\n  forwardRegex: \"catatg\",\n  reverseRegex: \"catatg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BseB631II\"],\n  site: \"agatct\",\n  forwardRegex: \"agatct\",\n  reverseRegex: \"agatct\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Sth302II\"],\n  site: \"ccgg\",\n  forwardRegex: \"c{2}g{2}\",\n  reverseRegex: \"c{2}g{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"PbuJKI\", \"Hpy178VI\", \"HpyF67III\", \"HinGUII\", \"HpyF6I\"],\n  site: \"ggatg\",\n  forwardRegex: \"g{2}atg\",\n  reverseRegex: \"catc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaF13I\"],\n  site: \"gagnnnnnnctgg\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{6}ctg{2}\",\n  reverseRegex: \"c{2}ag[abcdghkmnrstvwy]{6}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MreI\", \"Sse232I\"],\n  site: \"cgccggcg\",\n  forwardRegex: \"cgc{2}g{2}cg\",\n  reverseRegex: \"cgc{2}g{2}cg\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"BsaGI\", \"HpyF7II\", \"Pph3215I\", \"Bfu1570I\", \"BsmPI\", \"HpyF46II\", \"Hpy8III\"],\n  site: \"gwgcwc\",\n  forwardRegex: \"g[atw]gc[atw]c\",\n  reverseRegex: \"g[atw]gc[atw]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BceSIII\", \"BceAI\"],\n  site: \"acggc\",\n  forwardRegex: \"acg{2}c\",\n  reverseRegex: \"gc{2}gt\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 19,\n  isType2S: true\n}, {\n  aliases: [\"CstMI\"],\n  site: \"aaggag\",\n  forwardRegex: \"a{2}g{2}ag\",\n  reverseRegex: \"ctc{2}t{2}\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"Acc65I\", \"Asp718I\", \"SthI\", \"AhaB8I\"],\n  site: \"ggtacc\",\n  forwardRegex: \"g{2}tac{2}\",\n  reverseRegex: \"g{2}tac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"EacI\", \"BinI\", \"AlwI\", \"Bst31TI\", \"BspPI\", \"AclWI\", \"BstH9I\"],\n  site: \"ggatc\",\n  forwardRegex: \"g{2}atc\",\n  reverseRegex: \"gatc{2}\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"BspGI\"],\n  site: \"ctggac\",\n  forwardRegex: \"ctg{2}ac\",\n  reverseRegex: \"gtc{2}ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BspCNI\"],\n  site: \"ctcag\",\n  forwardRegex: \"ctcag\",\n  reverseRegex: \"ctgag\",\n  topSnipOffset: 14,\n  bottomSnipOffset: 12,\n  isType2S: true\n}, {\n  aliases: [\"MunI\", \"MfeI\"],\n  site: \"caattg\",\n  forwardRegex: \"ca{2}t{2}g\",\n  reverseRegex: \"ca{2}t{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"StySENI\", \"StySBLI\"],\n  site: \"cgannnnnntacc\",\n  forwardRegex: \"cga[abcdghkmnrstvwy]{6}tac{2}\",\n  reverseRegex: \"g{2}ta[abcdghkmnrstvwy]{6}tcg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BfaI\", \"MthZI\", \"RmaI\", \"FspBI\", \"FgoI\", \"MaeI\", \"XspI\"],\n  site: \"ctag\",\n  forwardRegex: \"ctag\",\n  reverseRegex: \"ctag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BseYI\"],\n  site: \"cccagc\",\n  forwardRegex: \"c{3}agc\",\n  reverseRegex: \"gctg{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"SmlI\", \"SmoI\"],\n  site: \"ctyrag\",\n  forwardRegex: \"ct[cty][agr]ag\",\n  reverseRegex: \"ct[cty][agr]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Tsp509I\", \"Sse9I\", \"TspEI\", \"TasI\"],\n  site: \"aatt\",\n  forwardRegex: \"a{2}t{2}\",\n  reverseRegex: \"a{2}t{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"HgaI\", \"CseI\"],\n  site: \"gacgc\",\n  forwardRegex: \"gacgc\",\n  reverseRegex: \"gcgtc\",\n  topSnipOffset: 10,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"PaeBI\", \"PspALI\", \"SmaI\", \"CfrJ4I\"],\n  site: \"cccggg\",\n  forwardRegex: \"c{3}g{3}\",\n  reverseRegex: \"c{3}g{3}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"SnaBI\", \"Eco105I\", \"BstSNI\"],\n  site: \"tacgta\",\n  forwardRegex: \"tacgta\",\n  reverseRegex: \"tacgta\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Esp3I\", \"BstGZ53I\", \"BsmBI\"],\n  isType2S: true,\n  site: \"cgtctc\",\n  forwardRegex: \"cgtctc\",\n  reverseRegex: \"gagacg\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 11\n}, {\n  aliases: [\"Bsp1591I\", \"Cfr19I\", \"Uba1291I\", \"SciAI\", \"KoxI\", \"BstDI\", \"Bse59I\", \"Bst31I\", \"Cfr7I\"],\n  site: \"ggtnacc\",\n  forwardRegex: \"g{2}t[abcdghkmnrstvwy]ac{2}\",\n  reverseRegex: \"g{2}t[abcdghkmnrstvwy]ac{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PstII\"],\n  site: \"ctgatg\",\n  forwardRegex: \"ctgatg\",\n  reverseRegex: \"catcag\",\n  topSnipOffset: 31,\n  bottomSnipOffset: 33,\n  isType2S: true\n}, {\n  aliases: [\"PflMI\", \"PflBI\", \"Asp10HII\", \"BasI\", \"Van91I\", \"AcpII\", \"Esp1396I\", \"AccB7I\"],\n  site: \"ccannnnntgg\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{5}tg{2}\",\n  reverseRegex: \"c{2}a[abcdghkmnrstvwy]{5}tg{2}\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"RceI\"],\n  site: \"catcgac\",\n  forwardRegex: \"catcgac\",\n  reverseRegex: \"gtcgatg\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"BstDEI\", \"BstJZ301I\", \"HpyF3I\", \"DdeI\"],\n  site: \"ctnag\",\n  forwardRegex: \"ct[abcdghkmnrstvwy]ag\",\n  reverseRegex: \"ct[abcdghkmnrstvwy]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"UbaN6I\", \"Bco631I\", \"Bco63I\", \"Bse631I\"],\n  site: \"gatnnnnatc\",\n  forwardRegex: \"gat[abcdghkmnrstvwy]{4}atc\",\n  reverseRegex: \"gat[abcdghkmnrstvwy]{4}atc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"StySJI\"],\n  site: \"gagnnnnnngtrc\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{6}gt[agr]c\",\n  reverseRegex: \"g[cty]ac[abcdghkmnrstvwy]{6}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BchI\", \"BsaUI\", \"BsrVI\", \"LfeI\"],\n  site: \"gcagc\",\n  forwardRegex: \"gcagc\",\n  reverseRegex: \"gctgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BscAI\", \"Bst19I\"],\n  site: \"gcatc\",\n  forwardRegex: \"gcatc\",\n  reverseRegex: \"gatgc\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 11,\n  isType2S: true\n}, {\n  aliases: [\"KteAI\", \"Uba1393I\", \"Uba1220I\"],\n  site: \"cccggg\",\n  forwardRegex: \"c{3}g{3}\",\n  reverseRegex: \"c{3}g{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BctI\"],\n  site: \"acggc\",\n  forwardRegex: \"acg{2}c\",\n  reverseRegex: \"gc{2}gt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BsePI\", \"PteI\", \"BssHII\", \"BstBZ153I\", \"PauI\"],\n  site: \"gcgcgc\",\n  forwardRegex: \"gcgcgc\",\n  reverseRegex: \"gcgcgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"StyLTIII\"],\n  site: \"gagnnnnnnrtayg\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{6}[agr]ta[cty]g\",\n  reverseRegex: \"c[agr]ta[cty][abcdghkmnrstvwy]{6}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"VpaK32I\", \"PciSI\", \"LguI\", \"BspQI\", \"SapI\"],\n  isType2S: true,\n  site: \"gctcttc\",\n  forwardRegex: \"gctct{2}c\",\n  reverseRegex: \"ga{2}gagc\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 11\n}, {\n  aliases: [\"BniI\"],\n  site: \"gcnngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]{2}gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]{2}gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoDR2\"],\n  site: \"tcannnnnngtcg\",\n  forwardRegex: \"tca[abcdghkmnrstvwy]{6}gtcg\",\n  reverseRegex: \"cgac[abcdghkmnrstvwy]{6}tga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TssI\"],\n  site: \"gagnnnctc\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{3}ctc\",\n  reverseRegex: \"gag[abcdghkmnrstvwy]{3}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Tth111II\"],\n  site: \"caarca\",\n  forwardRegex: \"ca{2}[agr]ca\",\n  reverseRegex: \"tg[cty]t{2}g\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"BbvCI\", \"AbeI\"],\n  site: \"cctcagc\",\n  forwardRegex: \"c{2}tcagc\",\n  reverseRegex: \"gctgag{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"MluI\", \"Bbi24I\"],\n  site: \"acgcgt\",\n  forwardRegex: \"acgcgt\",\n  reverseRegex: \"acgcgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"MnlI\"],\n  site: \"cctc\",\n  forwardRegex: \"c{2}tc\",\n  reverseRegex: \"gag{2}\",\n  topSnipOffset: 11,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"SspD5I\"],\n  site: \"ggtga\",\n  forwardRegex: \"g{2}tga\",\n  reverseRegex: \"tcac{2}\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 13,\n  isType2S: true\n}, {\n  aliases: [\"AspCNI\"],\n  site: \"gccgc\",\n  forwardRegex: \"gc{2}gc\",\n  reverseRegex: \"gcg{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TauI\", \"BspUI\"],\n  site: \"gcsgc\",\n  forwardRegex: \"gc[cgs]gc\",\n  reverseRegex: \"gc[cgs]gc\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BinSII\", \"BbeI\"],\n  site: \"ggcgcc\",\n  forwardRegex: \"g{2}cgc{2}\",\n  reverseRegex: \"g{2}cgc{2}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpmI\", \"GsuI\"],\n  site: \"ctggag\",\n  forwardRegex: \"ctg{2}ag\",\n  reverseRegex: \"ctc{2}ag\",\n  topSnipOffset: 22,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"NciI\", \"AhaI\", \"AseII\", \"Mgl14481I\", \"AsuC2I\", \"BpuMI\", \"HgiS22I\", \"CauII\", \"BcnI\"],\n  site: \"ccsgg\",\n  forwardRegex: \"c{2}[cgs]g{2}\",\n  reverseRegex: \"c{2}[cgs]g{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"Eco1348I\", \"Eco777I\", \"Eco1412I\"],\n  site: \"ggannnnnntatc\",\n  forwardRegex: \"g{2}a[abcdghkmnrstvwy]{6}tatc\",\n  reverseRegex: \"gata[abcdghkmnrstvwy]{6}tc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AgsI\"],\n  site: \"ttsaa\",\n  forwardRegex: \"t{2}[cgs]a{2}\",\n  reverseRegex: \"t{2}[cgs]a{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"Pfl18I\", \"Ssm4I\", \"Ssm5I\", \"NasSI\", \"ScoI\", \"Ecl137I\"],\n  site: \"gagctc\",\n  forwardRegex: \"gagctc\",\n  reverseRegex: \"gagctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CfrBI\", \"StyI\", \"ErhB9II\", \"Eco130I\", \"ErhI\", \"EcoT14I\", \"BsmSI\", \"BssT1I\"],\n  site: \"ccwwgg\",\n  forwardRegex: \"c{2}[atw]{2}g{2}\",\n  reverseRegex: \"c{2}[atw]{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"AlwFI\"],\n  site: \"gaaaynnnnnrtg\",\n  forwardRegex: \"ga{3}[cty][abcdghkmnrstvwy]{5}[agr]tg\",\n  reverseRegex: \"ca[cty][abcdghkmnrstvwy]{5}[agr]t{3}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CviRI\", \"HpyCH4V\", \"HpyF44III\"],\n  site: \"tgca\",\n  forwardRegex: \"tgca\",\n  reverseRegex: \"tgca\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"Bse19I\", \"AteI\", \"NspSAIII\"],\n  site: \"ccatgg\",\n  forwardRegex: \"c{2}atg{2}\",\n  reverseRegex: \"c{2}atg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Srl65DI\", \"Srr17I\", \"Srl55DII\", \"CprJK722I\", \"Srl8DI\", \"PbuMZI\"],\n  site: \"attaat\",\n  forwardRegex: \"at{2}a{2}t\",\n  reverseRegex: \"at{2}a{2}t\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"ClcII\", \"GspAII\", \"NspHIII\", \"Bco6I\", \"NspLI\", \"NspMI\", \"BsaTI\", \"CliII\", \"ApcTR183I\", \"AcaIII\"],\n  site: \"tgcgca\",\n  forwardRegex: \"tgcgca\",\n  reverseRegex: \"tgcgca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CsiI\", \"MabI\", \"SexAI\"],\n  site: \"accwggt\",\n  forwardRegex: \"ac{2}[atw]g{2}t\",\n  reverseRegex: \"ac{2}[atw]g{2}t\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"HgiEII\"],\n  site: \"accnnnnnnggt\",\n  forwardRegex: \"ac{2}[abcdghkmnrstvwy]{6}g{2}t\",\n  reverseRegex: \"ac{2}[abcdghkmnrstvwy]{6}g{2}t\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TseDI\", \"BscRI\", \"Bsp21I\"],\n  site: \"rccggy\",\n  forwardRegex: \"[agr]c{2}g{2}[cty]\",\n  reverseRegex: \"[agr]c{2}g{2}[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bse23I\", \"BsmYI\"],\n  site: \"ccnnnnnnngg\",\n  forwardRegex: \"c{2}[abcdghkmnrstvwy]{7}g{2}\",\n  reverseRegex: \"c{2}[abcdghkmnrstvwy]{7}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NdeI\", \"FauNDI\", \"PfaAII\"],\n  site: \"catatg\",\n  forwardRegex: \"catatg\",\n  reverseRegex: \"catatg\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"VneAI\", \"Uba1326I\"],\n  site: \"rggnccy\",\n  forwardRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  reverseRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SrlI\", \"NgoMIV\", \"SceIII\", \"NgoAIV\", \"MroNI\", \"Eco56I\"],\n  site: \"gccggc\",\n  forwardRegex: \"gc{2}g{2}c\",\n  reverseRegex: \"gc{2}g{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"AsiSI\", \"SfaAI\", \"RgaI\", \"SgfI\"],\n  site: \"gcgatcgc\",\n  forwardRegex: \"gcgatcgc\",\n  reverseRegex: \"gcgatcgc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BtsPI\", \"SaiI\", \"ShaI\"],\n  site: \"gggtc\",\n  forwardRegex: \"g{3}tc\",\n  reverseRegex: \"gac{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Pfl1108I\"],\n  site: \"tcgtag\",\n  forwardRegex: \"tcgtag\",\n  reverseRegex: \"ctacga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoHK31I\", \"Bfi89I\", \"EaeI\", \"CfrI\", \"AcoI\"],\n  site: \"yggccr\",\n  forwardRegex: \"[cty]g{2}c{2}[agr]\",\n  reverseRegex: \"[cty]g{2}c{2}[agr]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"HphI\", \"AsuHPI\"],\n  site: \"ggtga\",\n  forwardRegex: \"g{2}tga\",\n  reverseRegex: \"tcac{2}\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 12,\n  isType2S: true\n}, {\n  aliases: [\"Uba1303I\", \"BstZ5I\", \"BscNI\"],\n  site: \"cgrycg\",\n  forwardRegex: \"cg[agr][cty]cg\",\n  reverseRegex: \"cg[agr][cty]cg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bsp6II\", \"FsfI\", \"BspD6II\", \"Eco112I\", \"Eco125I\"],\n  site: \"ctgaag\",\n  forwardRegex: \"ctga{2}g\",\n  reverseRegex: \"ct{2}cag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BstXI\", \"BstHZ55I\"],\n  site: \"ccannnnnntgg\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{6}tg{2}\",\n  reverseRegex: \"c{2}a[abcdghkmnrstvwy]{6}tg{2}\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Ppu11I\", \"Ppu6I\"],\n  site: \"yacgtr\",\n  forwardRegex: \"[cty]acgt[agr]\",\n  reverseRegex: \"[cty]acgt[agr]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoT104I\", \"SblAI\", \"SblBI\", \"SblCI\", \"Uba1311I\", \"Eco208II\", \"Bst224I\"],\n  site: \"ccwwgg\",\n  forwardRegex: \"c{2}[atw]{2}g{2}\",\n  reverseRegex: \"c{2}[atw]{2}g{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoR124II\"],\n  site: \"gaannnnnnnrtcg\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{7}[agr]tcg\",\n  reverseRegex: \"cga[cty][abcdghkmnrstvwy]{7}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MamI\", \"BseJI\", \"Bse8I\", \"BsrBRI\", \"BsiBI\", \"BsaBI\", \"Bsh1365I\"],\n  site: \"gatnnnnatc\",\n  forwardRegex: \"gat[abcdghkmnrstvwy]{4}atc\",\n  reverseRegex: \"gat[abcdghkmnrstvwy]{4}atc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Ssp5230I\", \"AatII\"],\n  site: \"gacgtc\",\n  forwardRegex: \"gacgtc\",\n  reverseRegex: \"gacgtc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Uba1240I\", \"Bpu1831I\", \"SspM1I\", \"SspM2I\", \"EciAI\", \"SspJI\", \"Eco158II\"],\n  site: \"tacgta\",\n  forwardRegex: \"tacgta\",\n  reverseRegex: \"tacgta\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MaqI\"],\n  site: \"crttgac\",\n  forwardRegex: \"c[agr]t{2}gac\",\n  reverseRegex: \"gtca{2}[cty]g\",\n  topSnipOffset: 28,\n  bottomSnipOffset: 26,\n  isType2S: true\n}, {\n  aliases: [\"CjeNII\"],\n  site: \"gagnnnnngt\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{5}gt\",\n  reverseRegex: \"ac[abcdghkmnrstvwy]{5}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"KpnAI\"],\n  site: \"gaannnnnntgcc\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{6}tgc{2}\",\n  reverseRegex: \"g{2}ca[abcdghkmnrstvwy]{6}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SleI\", \"AjnI\", \"Psp6I\", \"PspGI\", \"SspAI\", \"EcoRII\"],\n  site: \"ccwgg\",\n  forwardRegex: \"c{2}[atw]g{2}\",\n  reverseRegex: \"c{2}[atw]g{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BstFZ438I\", \"Bme585I\", \"SmuI\", \"FauI\"],\n  site: \"cccgc\",\n  forwardRegex: \"c{3}gc\",\n  reverseRegex: \"gcg{3}\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 11,\n  isType2S: true\n}, {\n  aliases: [\"HpyCH4IV\", \"MaeII\"],\n  site: \"acgt\",\n  forwardRegex: \"acgt\",\n  reverseRegex: \"acgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"TaqII\"],\n  site: \"caccca\",\n  forwardRegex: \"cac{3}a\",\n  reverseRegex: \"tg{3}tg\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"UbaN9I\"],\n  site: \"aacgtt\",\n  forwardRegex: \"a{2}cgt{2}\",\n  reverseRegex: \"a{2}cgt{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"DrdII\"],\n  site: \"gaacca\",\n  forwardRegex: \"ga{2}c{2}a\",\n  reverseRegex: \"tg{2}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MalI\", \"DpnI\", \"CfuI\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"AarI\"],\n  isType2S: true,\n  site: \"cacctgc\",\n  forwardRegex: \"cac{2}tgc\",\n  reverseRegex: \"gcag{2}tg\",\n  topSnipOffset: 11,\n  bottomSnipOffset: 15\n}, {\n  aliases: [\"SrfI\"],\n  site: \"gcccgggc\",\n  forwardRegex: \"gc{3}g{3}c\",\n  reverseRegex: \"gc{3}g{3}c\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"TatI\"],\n  site: \"wgtacw\",\n  forwardRegex: \"[atw]gtac[atw]\",\n  reverseRegex: \"[atw]gtac[atw]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"EcoDXXI\"],\n  site: \"tcannnnnnnrttc\",\n  forwardRegex: \"tca[abcdghkmnrstvwy]{7}[agr]t{2}c\",\n  reverseRegex: \"ga{2}[cty][abcdghkmnrstvwy]{7}tga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HindII\", \"HincII\", \"HinJCI\"],\n  site: \"gtyrac\",\n  forwardRegex: \"gt[cty][agr]ac\",\n  reverseRegex: \"gt[cty][agr]ac\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BseMI\", \"Bse3DI\", \"BsrDI\"],\n  site: \"gcaatg\",\n  forwardRegex: \"gca{2}tg\",\n  reverseRegex: \"cat{2}gc\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 6,\n  isType2S: true\n}, {\n  aliases: [\"HalI\", \"Srl32DII\", \"FunII\", \"Ppu111I\", \"EcoRI\", \"RsrI\", \"Kpn49kI\", \"SsoI\", \"Srl55DI\"],\n  site: \"gaattc\",\n  forwardRegex: \"ga{2}t{2}c\",\n  reverseRegex: \"ga{2}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Hpy166III\"],\n  site: \"cctc\",\n  forwardRegex: \"c{2}tc\",\n  reverseRegex: \"gag{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"FspAI\"],\n  site: \"rtgcgcay\",\n  forwardRegex: \"[agr]tgcgca[cty]\",\n  reverseRegex: \"[agr]tgcgca[cty]\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"Eco585I\"],\n  site: \"gccnnnnnntgcg\",\n  forwardRegex: \"gc{2}[abcdghkmnrstvwy]{6}tgcg\",\n  reverseRegex: \"cgca[abcdghkmnrstvwy]{6}g{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PlaDI\"],\n  site: \"catcag\",\n  forwardRegex: \"catcag\",\n  reverseRegex: \"ctgatg\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"Hpy188I\"],\n  site: \"tcnga\",\n  forwardRegex: \"tc[abcdghkmnrstvwy]ga\",\n  reverseRegex: \"tc[abcdghkmnrstvwy]ga\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"PciI\", \"PscI\", \"BspLU11I\"],\n  site: \"acatgt\",\n  forwardRegex: \"acatgt\",\n  reverseRegex: \"acatgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"VchO25I\", \"SnaI\"],\n  site: \"gtatac\",\n  forwardRegex: \"gtatac\",\n  reverseRegex: \"gtatac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TseBI\", \"M.BbvSI\", \"TneI\"],\n  site: \"gcwgc\",\n  forwardRegex: \"gc[atw]gc\",\n  reverseRegex: \"gc[atw]gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"OliI\", \"AleI\"],\n  site: \"cacnnnngtg\",\n  forwardRegex: \"cac[abcdghkmnrstvwy]{4}gtg\",\n  reverseRegex: \"cac[abcdghkmnrstvwy]{4}gtg\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"GlaI\"],\n  site: \"gcgc\",\n  forwardRegex: \"gcgc\",\n  reverseRegex: \"gcgc\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BssGI\", \"BscJI\", \"BstTI\"],\n  site: \"ccannnnnntgg\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{6}tg{2}\",\n  reverseRegex: \"c{2}a[abcdghkmnrstvwy]{6}tg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Tsp4CI\", \"Bst4CI\", \"HpyCH4III\", \"TaaI\"],\n  site: \"acngt\",\n  forwardRegex: \"ac[abcdghkmnrstvwy]gt\",\n  reverseRegex: \"ac[abcdghkmnrstvwy]gt\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"AceIII\"],\n  site: \"cagctc\",\n  forwardRegex: \"cagctc\",\n  reverseRegex: \"gagctg\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 17,\n  isType2S: true\n}, {\n  aliases: [\"BseNI\", \"BsrI\", \"Bse1I\", \"Tsp1I\", \"BsrSI\", \"Bst11I\"],\n  site: \"actgg\",\n  forwardRegex: \"actg{2}\",\n  reverseRegex: \"c{2}agt\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 4,\n  isType2S: true\n}, {\n  aliases: [\"FnuAI\", \"HinfI\", \"CviBI\", \"HhaII\", \"SscL1I\"],\n  site: \"gantc\",\n  forwardRegex: \"ga[abcdghkmnrstvwy]tc\",\n  reverseRegex: \"ga[abcdghkmnrstvwy]tc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"CjuI\"],\n  site: \"caynnnnnrtg\",\n  forwardRegex: \"ca[cty][abcdghkmnrstvwy]{5}[agr]tg\",\n  reverseRegex: \"ca[cty][abcdghkmnrstvwy]{5}[agr]tg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF2I\", \"Bco163I\"],\n  site: \"ctryag\",\n  forwardRegex: \"ct[agr][cty]ag\",\n  reverseRegex: \"ct[agr][cty]ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AanI\", \"PsiI\"],\n  site: \"ttataa\",\n  forwardRegex: \"t{2}ata{2}\",\n  reverseRegex: \"t{2}ata{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"StySPI\"],\n  site: \"aacnnnnnngtrc\",\n  forwardRegex: \"a{2}c[abcdghkmnrstvwy]{6}gt[agr]c\",\n  reverseRegex: \"g[cty]ac[abcdghkmnrstvwy]{6}gt{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpuJI\", \"BstDZ247I\", \"BscGI\"],\n  site: \"cccgt\",\n  forwardRegex: \"c{3}gt\",\n  reverseRegex: \"acg{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Hpy99I\"],\n  site: \"cgwcg\",\n  forwardRegex: \"cg[atw]cg\",\n  reverseRegex: \"cg[atw]cg\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"BceSI\"],\n  site: \"mmcgaag\",\n  forwardRegex: \"[acm]{2}cga{2}g\",\n  reverseRegex: \"ct{2}cg[gkt]{2}\",\n  topSnipOffset: 32,\n  bottomSnipOffset: 34,\n  isType2S: true\n}, {\n  aliases: [\"HaeI\"],\n  site: \"wggccw\",\n  forwardRegex: \"[atw]g{2}c{2}[atw]\",\n  reverseRegex: \"[atw]g{2}c{2}[atw]\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"PspPRI\"],\n  site: \"ccycag\",\n  forwardRegex: \"c{2}[cty]cag\",\n  reverseRegex: \"ctg[agr]g{2}\",\n  topSnipOffset: 21,\n  bottomSnipOffset: 19,\n  isType2S: true\n}, {\n  aliases: [\"FokI\"],\n  site: \"ggatg\",\n  forwardRegex: \"g{2}atg\",\n  reverseRegex: \"catc{2}\",\n  topSnipOffset: 14,\n  bottomSnipOffset: 18,\n  isType2S: true\n}, {\n  aliases: [\"NgoBV\", \"NgoGV\", \"Bsp29I\", \"HpyF44II\", \"Uba1445I\", \"Uba1305I\", \"HpyF73I\", \"BsaEI\", \"BcrI\", \"Rlu3I\", \"BssI\"],\n  site: \"ggnncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]{2}c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]{2}c{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bce1247I\"],\n  site: \"gcnnnnnnngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]{7}gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]{7}gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AasI\", \"DrdI\", \"DseDI\"],\n  site: \"gacnnnnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{6}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{6}gtc\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"M.SssI\"],\n  site: \"cg\",\n  forwardRegex: \"cg\",\n  reverseRegex: \"cg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyF61III\"],\n  site: \"cgwcg\",\n  forwardRegex: \"cg[atw]cg\",\n  reverseRegex: \"cg[atw]cg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AflIII\"],\n  site: \"acrygt\",\n  forwardRegex: \"ac[agr][cty]gt\",\n  reverseRegex: \"ac[agr][cty]gt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Asp700I\", \"BbvAI\", \"MroXI\", \"XmnI\", \"PdmI\"],\n  site: \"gaannnnttc\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{4}t{2}c\",\n  reverseRegex: \"ga{2}[abcdghkmnrstvwy]{4}t{2}c\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"ChaI\"],\n  site: \"gatc\",\n  forwardRegex: \"gatc\",\n  reverseRegex: \"gatc\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"EcoEI\"],\n  site: \"gagnnnnnnnatgc\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{7}atgc\",\n  reverseRegex: \"gcat[abcdghkmnrstvwy]{7}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BspAAII\", \"XbaI\"],\n  site: \"tctaga\",\n  forwardRegex: \"tctaga\",\n  reverseRegex: \"tctaga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Hpy188III\", \"Hpy178III\"],\n  site: \"tcnnga\",\n  forwardRegex: \"tc[abcdghkmnrstvwy]{2}ga\",\n  reverseRegex: \"tc[abcdghkmnrstvwy]{2}ga\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"McaTI\"],\n  site: \"gcgcgc\",\n  forwardRegex: \"gcgcgc\",\n  reverseRegex: \"gcgcgc\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BstZ9I\", \"Uba6I\", \"ApeI\"],\n  site: \"acgcgt\",\n  forwardRegex: \"acgcgt\",\n  reverseRegex: \"acgcgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BspNCI\"],\n  site: \"ccaga\",\n  forwardRegex: \"c{2}aga\",\n  reverseRegex: \"tctg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoHI\", \"Eco1831I\", \"Kpn49kII\"],\n  site: \"ccsgg\",\n  forwardRegex: \"c{2}[cgs]g{2}\",\n  reverseRegex: \"c{2}[cgs]g{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"PpsI\", \"PleI\"],\n  site: \"gagtc\",\n  forwardRegex: \"gagtc\",\n  reverseRegex: \"gactc\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"BfuI\", \"BciVI\"],\n  site: \"gtatcc\",\n  forwardRegex: \"gtatc{2}\",\n  reverseRegex: \"g{2}atac\",\n  topSnipOffset: 12,\n  bottomSnipOffset: 11,\n  isType2S: true\n}, {\n  aliases: [\"TthHB27I\"],\n  site: \"caarca\",\n  forwardRegex: \"ca{2}[agr]ca\",\n  reverseRegex: \"tg[cty]t{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PspXI\"],\n  site: \"vctcgagb\",\n  forwardRegex: \"[acgmrsv]ctcgag[bcgksty]\",\n  reverseRegex: \"[acgmrsv]ctcgag[bcgksty]\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"Lsp1270I\"],\n  site: \"rcatgy\",\n  forwardRegex: \"[agr]catg[cty]\",\n  reverseRegex: \"[agr]catg[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyC1I\", \"BccI\"],\n  site: \"ccatc\",\n  forwardRegex: \"c{2}atc\",\n  reverseRegex: \"gatg{2}\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 10,\n  isType2S: true\n}, {\n  aliases: [\"BseMII\"],\n  site: \"ctcag\",\n  forwardRegex: \"ctcag\",\n  reverseRegex: \"ctgag\",\n  topSnipOffset: 15,\n  bottomSnipOffset: 13,\n  isType2S: true\n}, {\n  aliases: [\"BstENI\", \"EcoNI\", \"XagI\"],\n  site: \"cctnnnnnagg\",\n  forwardRegex: \"c{2}t[abcdghkmnrstvwy]{5}ag{2}\",\n  reverseRegex: \"c{2}t[abcdghkmnrstvwy]{5}ag{2}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"EcoAI\", \"Eco1446I\"],\n  site: \"gagnnnnnnngtca\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{7}gtca\",\n  reverseRegex: \"tgac[abcdghkmnrstvwy]{7}ctc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MmeI\"],\n  site: \"tccrac\",\n  forwardRegex: \"tc{2}[agr]ac\",\n  reverseRegex: \"gt[cty]g{2}a\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"AjiI\", \"BmgBI\", \"BtrI\"],\n  site: \"cacgtc\",\n  forwardRegex: \"cacgtc\",\n  reverseRegex: \"gacgtg\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BlsI\"],\n  site: \"gcngc\",\n  forwardRegex: \"gc[abcdghkmnrstvwy]gc\",\n  reverseRegex: \"gc[abcdghkmnrstvwy]gc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"Bst170I\", \"BsmGI\"],\n  site: \"tgtaca\",\n  forwardRegex: \"tgtaca\",\n  reverseRegex: \"tgtaca\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HpyBII\", \"Hpy166II\", \"Hpy8I\"],\n  site: \"gtnnac\",\n  forwardRegex: \"gt[abcdghkmnrstvwy]{2}ac\",\n  reverseRegex: \"gt[abcdghkmnrstvwy]{2}ac\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"StySKI\"],\n  site: \"cgatnnnnnnngtta\",\n  forwardRegex: \"cgat[abcdghkmnrstvwy]{7}gt{2}a\",\n  reverseRegex: \"ta{2}c[abcdghkmnrstvwy]{7}atcg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Esp23I\", \"Esp16I\"],\n  site: \"cgtctc\",\n  forwardRegex: \"cgtctc\",\n  reverseRegex: \"gagacg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BmgT120I\"],\n  site: \"ggncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BcoAI\", \"BbrPI\", \"PmlI\", \"PspCI\", \"PmaCI\", \"Eco72I\", \"AcvI\"],\n  site: \"cacgtg\",\n  forwardRegex: \"cacgtg\",\n  reverseRegex: \"cacgtg\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"CjeP338II\", \"BscUI\", \"BsmNI\", \"BhaI\"],\n  site: \"gcatc\",\n  forwardRegex: \"gcatc\",\n  reverseRegex: \"gatgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"KasI\", \"SspDI\"],\n  site: \"ggcgcc\",\n  forwardRegex: \"g{2}cgc{2}\",\n  reverseRegex: \"g{2}cgc{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"FmuI\"],\n  site: \"ggncc\",\n  forwardRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  reverseRegex: \"g{2}[abcdghkmnrstvwy]c{2}\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"RseI\", \"MslI\", \"SmiMI\"],\n  site: \"caynnnnrtg\",\n  forwardRegex: \"ca[cty][abcdghkmnrstvwy]{4}[agr]tg\",\n  reverseRegex: \"ca[cty][abcdghkmnrstvwy]{4}[agr]tg\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"NmuCI\", \"Tsp45I\", \"Hpy51I\"],\n  site: \"gtsac\",\n  forwardRegex: \"gt[cgs]ac\",\n  reverseRegex: \"gt[cgs]ac\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Psp5II\", \"PpuMI\", \"PpuXI\", \"Pfl27I\", \"PspPPI\"],\n  site: \"rggwccy\",\n  forwardRegex: \"[agr]g{2}[atw]c{2}[cty]\",\n  reverseRegex: \"[agr]g{2}[atw]c{2}[cty]\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Bba179I\", \"Bst1473I\", \"UbaN10I\"],\n  site: \"wccggw\",\n  forwardRegex: \"[atw]c{2}g{2}[atw]\",\n  reverseRegex: \"[atw]c{2}g{2}[atw]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco912I\"],\n  site: \"cacnnnnntggc\",\n  forwardRegex: \"cac[abcdghkmnrstvwy]{5}tg{2}c\",\n  reverseRegex: \"gc{2}a[abcdghkmnrstvwy]{5}gtg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SsmI\"],\n  site: \"ctgatg\",\n  forwardRegex: \"ctgatg\",\n  reverseRegex: \"catcag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EsaSSI\"],\n  site: \"gaccac\",\n  forwardRegex: \"gac{2}ac\",\n  reverseRegex: \"gtg{2}tc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoDI\"],\n  site: \"ttannnnnnngtcy\",\n  forwardRegex: \"t{2}a[abcdghkmnrstvwy]{7}gtc[cty]\",\n  reverseRegex: \"[agr]gac[abcdghkmnrstvwy]{7}ta{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BsoHI\", \"BscHI\"],\n  site: \"actgg\",\n  forwardRegex: \"actg{2}\",\n  reverseRegex: \"c{2}agt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NmeBI\"],\n  site: \"gacgc\",\n  forwardRegex: \"gacgc\",\n  reverseRegex: \"gcgtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NspBII\", \"MspA1I\"],\n  site: \"cmgckg\",\n  forwardRegex: \"c[acm]gc[gkt]g\",\n  reverseRegex: \"c[acm]gc[gkt]g\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BmgAI\"],\n  site: \"gkgcmc\",\n  forwardRegex: \"g[gkt]gc[acm]c\",\n  reverseRegex: \"g[gkt]gc[acm]c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NmeAIII\"],\n  site: \"gccgag\",\n  forwardRegex: \"gc{2}gag\",\n  reverseRegex: \"ctcg{2}c\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"DrdIV\"],\n  site: \"tacgac\",\n  forwardRegex: \"tacgac\",\n  reverseRegex: \"gtcgta\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"BscQII\"],\n  site: \"gtctc\",\n  forwardRegex: \"gtctc\",\n  reverseRegex: \"gagac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AbsI\"],\n  site: \"cctcgagg\",\n  forwardRegex: \"c{2}tcgag{2}\",\n  reverseRegex: \"c{2}tcgag{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"Psp03I\"],\n  site: \"ggwcc\",\n  forwardRegex: \"g{2}[atw]c{2}\",\n  reverseRegex: \"g{2}[atw]c{2}\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BmtI\", \"BspOI\", \"AceII\"],\n  site: \"gctagc\",\n  forwardRegex: \"gctagc\",\n  reverseRegex: \"gctagc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"GsaI\"],\n  site: \"cccagc\",\n  forwardRegex: \"c{3}agc\",\n  reverseRegex: \"gctg{3}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaF9I\"],\n  site: \"tacnnnnnrtgt\",\n  forwardRegex: \"tac[abcdghkmnrstvwy]{5}[agr]tgt\",\n  reverseRegex: \"aca[cty][abcdghkmnrstvwy]{5}gta\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Hin1II\", \"NlaIII\", \"FaeI\", \"Hsp92II\", \"HpyCH4I\"],\n  site: \"catg\",\n  forwardRegex: \"catg\",\n  reverseRegex: \"catg\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"Bbr7I\"],\n  site: \"gaagac\",\n  forwardRegex: \"ga{2}gac\",\n  reverseRegex: \"gtct{2}c\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 17,\n  isType2S: true\n}, {\n  aliases: [\"Kaz48kI\", \"PssI\"],\n  site: \"rggnccy\",\n  forwardRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  reverseRegex: \"[agr]g{2}[abcdghkmnrstvwy]c{2}[cty]\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BoxI\", \"BstPAI\", \"PshAI\"],\n  site: \"gacnnnngtc\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{4}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{4}gtc\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"SgrDI\"],\n  site: \"cgtcgacg\",\n  forwardRegex: \"cgtcgacg\",\n  reverseRegex: \"cgtcgacg\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"BssIMI\", \"SimI\"],\n  site: \"gggtc\",\n  forwardRegex: \"g{3}tc\",\n  reverseRegex: \"gac{3}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"RleAI\"],\n  site: \"cccaca\",\n  forwardRegex: \"c{3}aca\",\n  reverseRegex: \"tgtg{3}\",\n  topSnipOffset: 18,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"EciI\"],\n  site: \"ggcgga\",\n  forwardRegex: \"g{2}cg{2}a\",\n  reverseRegex: \"tc{2}gc{2}\",\n  topSnipOffset: 17,\n  bottomSnipOffset: 15,\n  isType2S: true\n}, {\n  aliases: [\"Eco57MI\"],\n  site: \"ctgrag\",\n  forwardRegex: \"ctg[agr]ag\",\n  reverseRegex: \"ct[cty]cag\",\n  topSnipOffset: 22,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"AspJI\", \"Ppu1253I\"],\n  site: \"gacgtc\",\n  forwardRegex: \"gacgtc\",\n  reverseRegex: \"gacgtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaF11I\"],\n  site: \"tcgta\",\n  forwardRegex: \"tcgta\",\n  reverseRegex: \"tacga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SetI\"],\n  site: \"asst\",\n  forwardRegex: \"a[cgs]{2}t\",\n  reverseRegex: \"a[cgs]{2}t\",\n  topSnipOffset: 4,\n  bottomSnipOffset: 0\n}, {\n  aliases: [\"PspOMII\"],\n  site: \"cgcccar\",\n  forwardRegex: \"cgc{3}a[agr]\",\n  reverseRegex: \"[cty]tg{3}cg\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"BsxI\"],\n  site: \"actggg\",\n  forwardRegex: \"actg{3}\",\n  reverseRegex: \"c{3}agt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco394I\"],\n  site: \"gacnnnnnrtaay\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{5}[agr]ta{2}[cty]\",\n  reverseRegex: \"[agr]t{2}a[cty][abcdghkmnrstvwy]{5}gtc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"ApyPI\"],\n  site: \"atcgac\",\n  forwardRegex: \"atcgac\",\n  reverseRegex: \"gtcgat\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"AlwNI\", \"CaiI\"],\n  site: \"cagnnnctg\",\n  forwardRegex: \"cag[abcdghkmnrstvwy]{3}ctg\",\n  reverseRegex: \"cag[abcdghkmnrstvwy]{3}ctg\",\n  topSnipOffset: 6,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"TsuI\"],\n  site: \"gcgac\",\n  forwardRegex: \"gcgac\",\n  reverseRegex: \"gtcgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Bca77I\", \"BsaWI\", \"BetI\"],\n  site: \"wccggw\",\n  forwardRegex: \"[atw]c{2}g{2}[atw]\",\n  reverseRegex: \"[atw]c{2}g{2}[atw]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"EcoDR3\"],\n  site: \"tcannnnnnnatcg\",\n  forwardRegex: \"tca[abcdghkmnrstvwy]{7}atcg\",\n  reverseRegex: \"cgat[abcdghkmnrstvwy]{7}tga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SgrAI\"],\n  site: \"crccggyg\",\n  forwardRegex: \"c[agr]c{2}g{2}[cty]g\",\n  reverseRegex: \"c[agr]c{2}g{2}[cty]g\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"M.NgoMXV\"],\n  site: \"gcchr\",\n  forwardRegex: \"gc{2}[achmtwy][agr]\",\n  reverseRegex: \"[cty][adgkrtw]g{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"EcoRD2\"],\n  site: \"gaannnnnnrttc\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{6}[agr]t{2}c\",\n  reverseRegex: \"ga{2}[cty][abcdghkmnrstvwy]{6}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TspGWI\"],\n  site: \"acgga\",\n  forwardRegex: \"acg{2}a\",\n  reverseRegex: \"tc{2}gt\",\n  topSnipOffset: 16,\n  bottomSnipOffset: 14,\n  isType2S: true\n}, {\n  aliases: [\"CviAII\"],\n  site: \"catg\",\n  forwardRegex: \"catg\",\n  reverseRegex: \"catg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"XcmI\"],\n  site: \"ccannnnnnnnntgg\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{9}tg{2}\",\n  reverseRegex: \"c{2}a[abcdghkmnrstvwy]{9}tg{2}\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 7\n}, {\n  aliases: [\"EcoRD3\"],\n  site: \"gaannnnnnnrttc\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{7}[agr]t{2}c\",\n  reverseRegex: \"ga{2}[cty][abcdghkmnrstvwy]{7}t{2}c\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SpoDI\"],\n  site: \"gcggrag\",\n  forwardRegex: \"gcg{2}[agr]ag\",\n  reverseRegex: \"ct[cty]c{2}gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaN12I\"],\n  site: \"cacgag\",\n  forwardRegex: \"cacgag\",\n  reverseRegex: \"ctcgtg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PspFI\"],\n  site: \"cccagc\",\n  forwardRegex: \"c{3}agc\",\n  reverseRegex: \"gctg{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PfoI\"],\n  site: \"tccngga\",\n  forwardRegex: \"tc{2}[abcdghkmnrstvwy]g{2}a\",\n  reverseRegex: \"tc{2}[abcdghkmnrstvwy]g{2}a\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"Sse8647I\"],\n  site: \"aggwcct\",\n  forwardRegex: \"ag{2}[atw]c{2}t\",\n  reverseRegex: \"ag{2}[atw]c{2}t\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"KflI\", \"Sse1825I\", \"SanDI\"],\n  site: \"gggwccc\",\n  forwardRegex: \"g{3}[atw]c{3}\",\n  reverseRegex: \"g{3}[atw]c{3}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"Sth132I\"],\n  site: \"cccg\",\n  forwardRegex: \"c{3}g\",\n  reverseRegex: \"cg{3}\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 12,\n  isType2S: true\n}, {\n  aliases: [\"CdpI\"],\n  site: \"gcggag\",\n  forwardRegex: \"gcg{2}ag\",\n  reverseRegex: \"ctc{2}gc\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"Asp90I\"],\n  site: \"acrygt\",\n  forwardRegex: \"ac[agr][cty]gt\",\n  reverseRegex: \"ac[agr][cty]gt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"M.CviPI\"],\n  site: \"gc\",\n  forwardRegex: \"gc\",\n  reverseRegex: \"gc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"MauBI\"],\n  site: \"cgcgcgcg\",\n  forwardRegex: \"cgcgcgcg\",\n  reverseRegex: \"cgcgcgcg\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 6\n}, {\n  aliases: [\"CfrAI\"],\n  site: \"gcannnnnnnngtgg\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{8}gtg{2}\",\n  reverseRegex: \"c{2}ac[abcdghkmnrstvwy]{8}tgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Eco851I\"],\n  site: \"gtcannnnnntgay\",\n  forwardRegex: \"gtca[abcdghkmnrstvwy]{6}tga[cty]\",\n  reverseRegex: \"[agr]tca[abcdghkmnrstvwy]{6}tgac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BsgI\"],\n  site: \"gtgcag\",\n  forwardRegex: \"gtgcag\",\n  reverseRegex: \"ctgcac\",\n  topSnipOffset: 22,\n  bottomSnipOffset: 20,\n  isType2S: true\n}, {\n  aliases: [\"AquIV\"],\n  site: \"grggaag\",\n  forwardRegex: \"g[agr]g{2}a{2}g\",\n  reverseRegex: \"ct{2}c{2}[cty]c\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"SciI\"],\n  site: \"ctcgag\",\n  forwardRegex: \"ctcgag\",\n  reverseRegex: \"ctcgag\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"VpaK11AI\"],\n  site: \"ggwcc\",\n  forwardRegex: \"g{2}[atw]c{2}\",\n  reverseRegex: \"g{2}[atw]c{2}\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"CviKI\", \"CviJI\", \"CviKI-1\"],\n  site: \"rgcy\",\n  forwardRegex: \"[agr]gc[cty]\",\n  reverseRegex: \"[agr]gc[cty]\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"SnoI\", \"VneI\", \"ApaLI\", \"Alw44I\"],\n  site: \"gtgcac\",\n  forwardRegex: \"gtgcac\",\n  reverseRegex: \"gtgcac\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"BspD6I\"],\n  site: \"gactc\",\n  forwardRegex: \"gactc\",\n  reverseRegex: \"gagtc\",\n  topSnipOffset: 9,\n  bottomSnipOffset: 11,\n  isType2S: true\n}, {\n  aliases: [\"FatI\"],\n  site: \"catg\",\n  forwardRegex: \"catg\",\n  reverseRegex: \"catg\",\n  topSnipOffset: 0,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"ZraI\"],\n  site: \"gacgtc\",\n  forwardRegex: \"gacgtc\",\n  reverseRegex: \"gacgtc\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"HineI\", \"HinfIII\"],\n  site: \"cgaat\",\n  forwardRegex: \"cga{2}t\",\n  reverseRegex: \"at{2}cg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaF12I\"],\n  site: \"ctacnnngtc\",\n  forwardRegex: \"ctac[abcdghkmnrstvwy]{3}gtc\",\n  reverseRegex: \"gac[abcdghkmnrstvwy]{3}gtag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Ppu10I\"],\n  site: \"atgcat\",\n  forwardRegex: \"atgcat\",\n  reverseRegex: \"atgcat\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"ApaBI\"],\n  site: \"gcannnnntgc\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{5}tgc\",\n  reverseRegex: \"gca[abcdghkmnrstvwy]{5}tgc\",\n  topSnipOffset: 8,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"NhaXI\"],\n  site: \"caagrag\",\n  forwardRegex: \"ca{2}g[agr]ag\",\n  reverseRegex: \"ct[cty]ct{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"PabI\"],\n  site: \"gtac\",\n  forwardRegex: \"gtac\",\n  reverseRegex: \"gtac\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"HindI\"],\n  site: \"cac\",\n  forwardRegex: \"cac\",\n  reverseRegex: \"gtg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"M.PhiMx8I\"],\n  site: \"ctssag\",\n  forwardRegex: \"ct[cgs]{2}ag\",\n  reverseRegex: \"ct[cgs]{2}ag\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"RhcI\"],\n  site: \"tcatga\",\n  forwardRegex: \"tcatga\",\n  reverseRegex: \"tcatga\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"KpnI\"],\n  site: \"ggtacc\",\n  forwardRegex: \"g{2}tac{2}\",\n  reverseRegex: \"g{2}tac{2}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BpuDI\", \"Bpu10I\"],\n  site: \"cctnagc\",\n  forwardRegex: \"c{2}t[abcdghkmnrstvwy]agc\",\n  reverseRegex: \"gct[abcdghkmnrstvwy]ag{2}\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"EcoP15I\"],\n  site: \"cagcag\",\n  forwardRegex: \"cagcag\",\n  reverseRegex: \"ctgctg\",\n  topSnipOffset: 31,\n  bottomSnipOffset: 33,\n  isType2S: true\n}, {\n  aliases: [\"Nli3877I\"],\n  site: \"cycgrg\",\n  forwardRegex: \"c[cty]cg[agr]g\",\n  reverseRegex: \"c[cty]cg[agr]g\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"StySEAI\"],\n  site: \"acannnnnntyca\",\n  forwardRegex: \"aca[abcdghkmnrstvwy]{6}t[cty]ca\",\n  reverseRegex: \"tg[agr]a[abcdghkmnrstvwy]{6}tgt\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"M.CviAIV\"],\n  site: \"rgcb\",\n  forwardRegex: \"[agr]gc[bcgksty]\",\n  reverseRegex: \"[acgmrsv]gc[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"Msp16I\"],\n  site: \"tggcca\",\n  forwardRegex: \"tg{2}c{2}a\",\n  reverseRegex: \"tg{2}c{2}a\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"SasI\"],\n  site: \"gaggag\",\n  forwardRegex: \"gag{2}ag\",\n  reverseRegex: \"ctc{2}tc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"AquIII\"],\n  site: \"gaggag\",\n  forwardRegex: \"gag{2}ag\",\n  reverseRegex: \"ctc{2}tc\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 24,\n  isType2S: true\n}, {\n  aliases: [\"FaiI\"],\n  site: \"yatr\",\n  forwardRegex: \"[cty]at[agr]\",\n  reverseRegex: \"[cty]at[agr]\",\n  topSnipOffset: 2,\n  bottomSnipOffset: 2\n}, {\n  aliases: [\"BsbI\"],\n  site: \"caacac\",\n  forwardRegex: \"ca{2}cac\",\n  reverseRegex: \"gtgt{2}g\",\n  topSnipOffset: 27,\n  bottomSnipOffset: 25,\n  isType2S: true\n}, {\n  aliases: [\"NgoAV\"],\n  site: \"gcannnnnnnntgc\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{8}tgc\",\n  reverseRegex: \"gca[abcdghkmnrstvwy]{8}tgc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"BstAPI\"],\n  site: \"gcannnnntgc\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{5}tgc\",\n  reverseRegex: \"gca[abcdghkmnrstvwy]{5}tgc\",\n  topSnipOffset: 7,\n  bottomSnipOffset: 4\n}, {\n  aliases: [\"BsmEI\"],\n  site: \"gagtc\",\n  forwardRegex: \"gagtc\",\n  reverseRegex: \"gactc\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NcuII\"],\n  site: \"cccg\",\n  forwardRegex: \"c{3}g\",\n  reverseRegex: \"cg{3}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"CviMI\", \"CviNI\", \"CviLI\", \"CviOI\"],\n  site: \"rgcy\",\n  forwardRegex: \"[agr]gc[cty]\",\n  reverseRegex: \"[agr]gc[cty]\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"StySGI\"],\n  site: \"taannnnnnrtcg\",\n  forwardRegex: \"ta{2}[abcdghkmnrstvwy]{6}[agr]tcg\",\n  reverseRegex: \"cga[cty][abcdghkmnrstvwy]{6}t{2}a\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaF14I\"],\n  site: \"ccannnnntcg\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{5}tcg\",\n  reverseRegex: \"cga[abcdghkmnrstvwy]{5}tg{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"UbaPI\"],\n  site: \"cgaacg\",\n  forwardRegex: \"cga{2}cg\",\n  reverseRegex: \"cgt{2}cg\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"TspDTI\"],\n  site: \"atgaa\",\n  forwardRegex: \"atga{2}\",\n  reverseRegex: \"t{2}cat\",\n  topSnipOffset: 16,\n  bottomSnipOffset: 14,\n  isType2S: true\n}, {\n  aliases: [\"SspI\"],\n  site: \"aatatt\",\n  forwardRegex: \"a{2}tat{2}\",\n  reverseRegex: \"a{2}tat{2}\",\n  topSnipOffset: 3,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"GdiII\"],\n  site: \"cggccr\",\n  forwardRegex: \"cg{2}c{2}[agr]\",\n  reverseRegex: \"[cty]g{2}c{2}g\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 5\n}, {\n  aliases: [\"StySQI\"],\n  site: \"aacnnnnnnrtayg\",\n  forwardRegex: \"a{2}c[abcdghkmnrstvwy]{6}[agr]ta[cty]g\",\n  reverseRegex: \"c[agr]ta[cty][abcdghkmnrstvwy]{6}gt{2}\",\n  topSnipOffset: 1,\n  bottomSnipOffset: 1\n}, {\n  aliases: [\"NlaCI\"],\n  site: \"catcac\",\n  forwardRegex: \"catcac\",\n  reverseRegex: \"gtgatg\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 23,\n  isType2S: true\n}, {\n  aliases: [\"PacI\"],\n  site: \"ttaattaa\",\n  forwardRegex: \"t{2}a{2}t{2}a{2}\",\n  reverseRegex: \"t{2}a{2}t{2}a{2}\",\n  topSnipOffset: 5,\n  bottomSnipOffset: 3\n}, {\n  aliases: [\"BarI\"],\n  isType2S: true,\n  site: \"gaagnnnnnntac\",\n  forwardRegex: \"ga{2}g[abcdghkmnrstvwy]{6}tac\",\n  reverseRegex: \"gta[abcdghkmnrstvwy]{6}ct{2}c\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20\n}, {\n  aliases: [\"CspCI\"],\n  isType2S: true,\n  site: \"caannnnngtgg\",\n  forwardRegex: \"ca{2}[abcdghkmnrstvwy]{5}gtg{2}\",\n  reverseRegex: \"c{2}ac[abcdghkmnrstvwy]{5}t{2}g\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 22,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 22\n}, {\n  aliases: [\"NmeDI\"],\n  site: \"rccggy\",\n  forwardRegex: \"[agr]c{2}g{2}[cty]\",\n  reverseRegex: \"[agr]c{2}g{2}[cty]\",\n  topSnipOffset: 13,\n  bottomSnipOffset: 18,\n  cutType: 1,\n  usForward: 13,\n  usReverse: 18,\n  isType2S: true\n}, {\n  aliases: [\"CjePI\"],\n  site: \"ccannnnnnntc\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{7}tc\",\n  reverseRegex: \"ga[abcdghkmnrstvwy]{7}tg{2}\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 26,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"CjeI\"],\n  site: \"ccannnnnngt\",\n  forwardRegex: \"c{2}a[abcdghkmnrstvwy]{6}gt\",\n  reverseRegex: \"ac[abcdghkmnrstvwy]{6}tg{2}\",\n  topSnipOffset: 26,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 26,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"PsrI\"],\n  site: \"gaacnnnnnntac\",\n  forwardRegex: \"ga{2}c[abcdghkmnrstvwy]{6}tac\",\n  reverseRegex: \"gta[abcdghkmnrstvwy]{6}gt{2}c\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"ArsI\"],\n  site: \"gacnnnnnnttyg\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{6}t{2}[cty]g\",\n  reverseRegex: \"c[agr]a{2}[abcdghkmnrstvwy]{6}gtc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"TstI\"],\n  site: \"cacnnnnnntcc\",\n  forwardRegex: \"cac[abcdghkmnrstvwy]{6}tc{2}\",\n  reverseRegex: \"g{2}a[abcdghkmnrstvwy]{6}gtg\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"Bsp24I\"],\n  site: \"gacnnnnnntgg\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{6}tg{2}\",\n  reverseRegex: \"c{2}a[abcdghkmnrstvwy]{6}gtc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"AloI\"],\n  site: \"gaacnnnnnntcc\",\n  forwardRegex: \"ga{2}c[abcdghkmnrstvwy]{6}tc{2}\",\n  reverseRegex: \"g{2}a[abcdghkmnrstvwy]{6}gt{2}c\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"FalI\"],\n  site: \"aagnnnnnctt\",\n  forwardRegex: \"a{2}g[abcdghkmnrstvwy]{5}ct{2}\",\n  reverseRegex: \"a{2}g[abcdghkmnrstvwy]{5}ct{2}\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"AjuI\"],\n  site: \"gaannnnnnnttgg\",\n  forwardRegex: \"ga{2}[abcdghkmnrstvwy]{7}t{2}g{2}\",\n  reverseRegex: \"c{2}a{2}[abcdghkmnrstvwy]{7}t{2}c\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"AlfI\"],\n  site: \"gcannnnnntgc\",\n  forwardRegex: \"gca[abcdghkmnrstvwy]{6}tgc\",\n  reverseRegex: \"gca[abcdghkmnrstvwy]{6}tgc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 22,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 22,\n  isType2S: true\n}, {\n  aliases: [\"NgoAVIII\"],\n  site: \"gacnnnnntga\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{5}tga\",\n  reverseRegex: \"tca[abcdghkmnrstvwy]{5}gtc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 22,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 22,\n  isType2S: true\n}, {\n  aliases: [\"HaeIV\"],\n  site: \"gaynnnnnrtc\",\n  forwardRegex: \"ga[cty][abcdghkmnrstvwy]{5}[agr]tc\",\n  reverseRegex: \"ga[cty][abcdghkmnrstvwy]{5}[agr]tc\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"BdaI\"],\n  site: \"tgannnnnntca\",\n  forwardRegex: \"tga[abcdghkmnrstvwy]{6}tca\",\n  reverseRegex: \"tga[abcdghkmnrstvwy]{6}tca\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 22,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 22,\n  isType2S: true\n}, {\n  aliases: [\"PpiI\"],\n  site: \"gaacnnnnnctc\",\n  forwardRegex: \"ga{2}c[abcdghkmnrstvwy]{5}ctc\",\n  reverseRegex: \"gag[abcdghkmnrstvwy]{5}gt{2}c\",\n  topSnipOffset: 25,\n  bottomSnipOffset: 20,\n  cutType: 1,\n  usForward: 25,\n  usReverse: 20,\n  isType2S: true\n}, {\n  aliases: [\"BcgI\"],\n  site: \"cgannnnnntgc\",\n  forwardRegex: \"cga[abcdghkmnrstvwy]{6}tgc\",\n  reverseRegex: \"gca[abcdghkmnrstvwy]{6}tcg\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 22,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 22,\n  isType2S: true\n}, {\n  aliases: [\"BplI\"],\n  site: \"gagnnnnnctc\",\n  forwardRegex: \"gag[abcdghkmnrstvwy]{5}ctc\",\n  reverseRegex: \"gag[abcdghkmnrstvwy]{5}ctc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"BsaXI\"],\n  site: \"acnnnnnctcc\",\n  forwardRegex: \"ac[abcdghkmnrstvwy]{5}ctc{2}\",\n  reverseRegex: \"g{2}ag[abcdghkmnrstvwy]{5}gt\",\n  topSnipOffset: 21,\n  bottomSnipOffset: 18,\n  cutType: 1,\n  usForward: 21,\n  usReverse: 18,\n  isType2S: true\n}, {\n  aliases: [\"Hin4I\"],\n  site: \"gaynnnnnvtc\",\n  forwardRegex: \"ga[cty][abcdghkmnrstvwy]{5}[acgmrsv]tc\",\n  reverseRegex: \"ga[bcgksty][abcdghkmnrstvwy]{5}[agr]tc\",\n  topSnipOffset: 24,\n  bottomSnipOffset: 19,\n  cutType: 1,\n  usForward: 24,\n  usReverse: 19,\n  isType2S: true\n}, {\n  aliases: [\"BaeI\"],\n  site: \"acnnnngtayc\",\n  forwardRegex: \"ac[abcdghkmnrstvwy]{4}gta[cty]c\",\n  reverseRegex: \"g[agr]tac[abcdghkmnrstvwy]{4}gt\",\n  topSnipOffset: 23,\n  bottomSnipOffset: 18,\n  cutType: 1,\n  usForward: 23,\n  usReverse: 18,\n  isType2S: true\n}, {\n  aliases: [\"SdeOSI\"],\n  site: \"gacnnnnrtga\",\n  forwardRegex: \"gac[abcdghkmnrstvwy]{4}[agr]tga\",\n  reverseRegex: \"tca[cty][abcdghkmnrstvwy]{4}gtc\",\n  topSnipOffset: 23,\n  bottomSnipOffset: 21,\n  cutType: 1,\n  usForward: 23,\n  usReverse: 21,\n  isType2S: true\n}];\n\n// aliasedEnzymes.forEach((enz) => {\n//   const is2s = isEnzymeType2S(enz);\n//   if (is2s) {\n//     enz.isType2S = true;\n//   }\n// });\n\n// require(\"jsonfile\").writeFile(\n//   require(\"path\").join(__dirname, \"TEMP.json\"),\n//   aliasedEnzymes,\n//   { spaces: 4 },\n//   function(err) {\n//     if (err) console.error(\"error writing json\", err);\n//   }\n// );\n\nvar aliasedEnzymesByName = {};\n\naliasedEnzymes.forEach(function (enz) {\n  enz.aliases.forEach(function (name) {\n    aliasedEnzymesByName[name.toLowerCase()] = _extends({}, enz, { name: name });\n  });\n});\n\nmodule.exports = aliasedEnzymesByName;","\"use strict\";\n\nvar bsonObjectId = require(\"bson-objectid\");\nvar getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\n// const ac = require('ve-api-check');\n/**\n * @private\n * Finds ORFs in a given DNA forward in a given frame.\n * @param  {Int} frame The frame to look in.\n * @param  {String}sequence The dna sequence.\n * @param  {Int} minimumOrfSize The minimum length of ORF to return.\n * @param  {boolean} forward Should we find forward facing orfs or reverse facing orfs\n * @return {Teselagen.bio.orf.ORF[]} The list of ORFs found.\n */\nmodule.exports = function getOrfsFromSequence(options) {\n  // ac.throw([ac.shape({\n  //     sequence: ac.string,\n  //     minimumOrfSize: ac.posInt,\n  //     forward: ac.bool,\n  //     circular: ac.bool\n  // })], arguments);\n\n  // const frame = options.frame;\n  var sequence = options.sequence;\n  var minimumOrfSize = options.minimumOrfSize;\n  var forward = options.forward;\n  var circular = options.circular;\n  var useAdditionalOrfStartCodons = options.useAdditionalOrfStartCodons;\n\n  var originalSequenceLength = sequence.length;\n  if (!forward) {\n    //we reverse the sequence\n    sequence = getReverseComplementSequenceString(sequence);\n  }\n\n  if (circular) {\n    //we'll pass in double the sequence and then trim excess orfs\n    sequence += sequence;\n  }\n  var re = useAdditionalOrfStartCodons ? /(?=((?:A[TU]G|G[TU]G|C[TU]G)(?:.{3})*?(?:[TU]AG|[TU]AA|[TU]GA)))/gi : /(?=((?:A[TU]G)(?:.{3})*?(?:[TU]AG|[TU]AA|[TU]GA)))/gi;\n  // const str = 'tatgaatgaatgffffffatgfftaaftaafatgfatgfffffsdfatgffatgfffstaafftaafffffffffffffffatgtaaataa\\n\\natgffftaaf\\n\\natgffatgftaafftaa\\n\\natgatgftaafftaa\\n\\natgatgtaataa\\n\\ntttttttttttttaatgatgfffffffffftaa';\n  var m = void 0;\n  var orfRanges = [];\n  //loop through orf hits!\n  /* eslint-disable no-cond-assign*/\n\n  while ((m = re.exec(sequence)) !== null) {\n    //stuff to get the regex to work\n    if (m.index === re.lastIndex) {\n      re.lastIndex++;\n    }\n    //orf logic:\n    var orfLength = m[1].length;\n    if (orfLength >= minimumOrfSize) {\n      //only keep orfs >= to the minimum size\n      var start = m.index;\n      var end = orfLength + start - 1;\n      //normalize the end if it is greater than the original sequence length\n      if (end >= originalSequenceLength) {\n        end -= originalSequenceLength;\n      }\n      if (start < originalSequenceLength) {\n        //only keep orfs that *begin* before the original sequence length (only the case when dealing with circular orfs)\n        orfRanges.push({\n          start: start,\n          end: end,\n          length: m[1].length,\n          internalStartCodonIndices: [],\n          frame: start % 3,\n          forward: forward,\n          annotationTypePlural: \"orfs\",\n          isOrf: true,\n          id: bsonObjectId().str\n        });\n      }\n    }\n  }\n  // pair down the orfs to remove duplicates\n  // and deal with revComp orfs\n  var orfEnds = {};\n  orfRanges.forEach(function (orf, index) {\n    var indexOfAlreadyExistingOrf = orfEnds[orf.end];\n\n    if (typeof indexOfAlreadyExistingOrf !== \"undefined\") {\n      var internalOrf = orf;\n      var containingOrf = orfRanges[indexOfAlreadyExistingOrf];\n      if (containingOrf.length < internalOrf.length) {\n        internalOrf = orfRanges[indexOfAlreadyExistingOrf];\n        containingOrf = orf;\n        orfEnds[orf.end] = index;\n      }\n      var internalStartCodonIndex = forward ? internalOrf.start : originalSequenceLength - internalOrf.start - 1; //use either the start or the end depending on the direction of the internalOrf\n      //we know because of how the regex works that larger orfs come first in the array\n      containingOrf.internalStartCodonIndices = [].concat(containingOrf.internalStartCodonIndices, internalOrf.internalStartCodonIndices, [internalStartCodonIndex]);\n      //set a flag that we'll use to remove all these shorter, duplicated orfs\n      internalOrf.remove = true;\n    } else {\n      orfEnds[orf.end] = index;\n      if (!forward) {\n        // if (originalSequenceLength - orf.end - 1 == 3657) {\n        // }\n        //this check needs to come after the above assignment of orfEnds\n        //flip the start and ends\n        var endHolder = orf.end; //temp variable\n        orf.end = originalSequenceLength - orf.start - 1;\n        orf.start = originalSequenceLength - endHolder - 1;\n      }\n    }\n  });\n  var nonDuplicatedOrfRanges = orfRanges.filter(function (orf) {\n    if (!orf.remove) {\n      return true;\n    }\n    return false;\n  });\n  return nonDuplicatedOrfRanges;\n};","\"use strict\";\n\nvar insertSequenceDataAtPositionOrRange = require(\"./insertSequenceDataAtPositionOrRange\");\n\nmodule.exports = insertSequenceDataAtPositionOrRange;","\"use strict\";\n\nvar cutSequenceByRestrictionEnzyme = require(\"./cutSequenceByRestrictionEnzyme\");\n\nmodule.exports = function getCutsitesFromSequence(sequence, circular, restrictionEnzymes) {\n  var cutsitesByName = {};\n  for (var i = 0; i < restrictionEnzymes.length; i++) {\n    var re = restrictionEnzymes[i];\n    var cutsites = cutSequenceByRestrictionEnzyme(sequence, circular, re);\n    if (cutsites.length) {\n      cutsitesByName[re.name] = cutsites;\n    }\n  }\n  return cutsitesByName;\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    flatMap = _require.flatMap,\n    cloneDeep = _require.cloneDeep;\n\nvar bsonObjectId = require(\"bson-objectid\");\n\nvar _require2 = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength = _require2.normalizePositionByRangeLength,\n    getRangeLength = _require2.getRangeLength;\n\nvar getCutsitesFromSequence = require(\"./getCutsitesFromSequence\");\n\nfunction computeDigestFragments(_ref) {\n  var cutsites = _ref.cutsites,\n      sequenceLength = _ref.sequenceLength,\n      circular = _ref.circular,\n      includeOverAndUnderHangs = _ref.includeOverAndUnderHangs,\n      computePartialDigest = _ref.computePartialDigest,\n      computeDigestDisabled = _ref.computeDigestDisabled,\n      computePartialDigestDisabled = _ref.computePartialDigestDisabled,\n      selectionLayerUpdate = _ref.selectionLayerUpdate,\n      updateSelectedFragment = _ref.updateSelectedFragment;\n\n  var fragments = [];\n  var overlappingEnzymes = [];\n  var pairs = [];\n\n  var sortedCutsites = cutsites.sort(function (a, b) {\n    return a.topSnipPosition - b.topSnipPosition;\n  });\n  if (!circular && cutsites.length) {\n    sortedCutsites.push({\n      id: \"seqTerm_\" + bsonObjectId().str,\n      start: 0,\n      end: 0,\n      overhangBps: \"\",\n      topSnipPosition: 0,\n      bottomSnipPosition: 0,\n      upstreamTopSnip: 0,\n      upstreamBottomSnip: 0,\n      upstreamTopBeforeBottom: false,\n      topSnipBeforeBottom: false,\n      recognitionSiteRange: {\n        start: 0,\n        end: 0\n      },\n      forward: true,\n      name: \"Sequence_Terminus\",\n      restrictionEnzyme: {\n        name: \"Sequence_Terminus\"\n      }\n    });\n  }\n\n  sortedCutsites.forEach(function (cutsite1, index) {\n    if (computePartialDigest && !computePartialDigestDisabled) {\n      sortedCutsites.forEach(function (cs, index2) {\n        if (index2 === index + 1 || index2 === 0) {\n          return;\n        }\n        pairs.push([cutsite1, sortedCutsites[index2]]);\n      });\n    }\n    if (!computeDigestDisabled) {\n      pairs.push([cutsite1, sortedCutsites[index + 1] ? sortedCutsites[index + 1] : sortedCutsites[0]]);\n    }\n  });\n\n  pairs.forEach(function (r) {\n    var cut1 = r[0],\n        cut2 = r[1];\n\n\n    var start = void 0;\n    var end = void 0;\n    var size = void 0;\n    start = normalizePositionByRangeLength(cut1.topSnipPosition, sequenceLength);\n    end = normalizePositionByRangeLength(cut2.topSnipPosition - 1, sequenceLength);\n    size = getRangeLength({ start: start, end: end }, sequenceLength);\n    var overlapsSelf = void 0;\n    if (includeOverAndUnderHangs) {\n      var oldSize = size;\n      start = normalizePositionByRangeLength(cut1.topSnipBeforeBottom ? cut1.topSnipPosition : cut1.bottomSnipPosition, sequenceLength);\n      end = normalizePositionByRangeLength(cut2.topSnipBeforeBottom ? cut2.bottomSnipPosition - 1 : cut2.topSnipPosition - 1, sequenceLength);\n      size = getRangeLength({ start: start, end: end }, sequenceLength);\n      if (oldSize > size) {\n        //we've got a part that wraps on itself\n        overlapsSelf = true;\n        size += sequenceLength;\n      }\n    }\n\n    var isFormedFromLinearEnd = void 0;\n    if (cut1.name === \"Sequence_Terminus\") {\n      cut1 = cloneDeep(cut1);\n      isFormedFromLinearEnd = true;\n      cut1.name = \"Linear_Sequence_Start\";\n      cut1.restrictionEnzyme.name = \"Linear_Sequence_Start\";\n    } else if (cut2.name === \"Sequence_Terminus\") {\n      cut2 = cloneDeep(cut2);\n      isFormedFromLinearEnd = true;\n      cut2.name = \"Linear_Sequence_End\";\n      cut2.restrictionEnzyme.name = \"Linear_Sequence_End\";\n    }\n\n    var id = start + \"-\" + end + \"-\" + size + \"-\";\n    var name = cut1.restrictionEnzyme.name + \" -- \" + cut2.restrictionEnzyme.name + \" \" + size + \" bps\";\n    getRangeLength({ start: start, end: end }, sequenceLength);\n\n    fragments.push({\n      isFormedFromLinearEnd: isFormedFromLinearEnd,\n      madeFromOneCutsite: cut1 === cut2,\n      start: start,\n      end: end,\n      size: size,\n      overlapsSelf: overlapsSelf,\n      id: id,\n      name: name,\n      cut1: cut1,\n      cut2: cut2,\n      onFragmentSelect: selectionLayerUpdate && updateSelectedFragment ? function () {\n        selectionLayerUpdate({\n          start: start,\n          end: end,\n          name: name\n        });\n\n        updateSelectedFragment(id);\n      } : undefined\n    });\n  });\n  fragments.filter(function (fragment) {\n    if (!fragment.size) {\n      overlappingEnzymes.push(fragment);\n      return false;\n    }\n    return true;\n  });\n  return {\n    computePartialDigestDisabled: computePartialDigestDisabled,\n    computeDigestDisabled: computeDigestDisabled,\n    fragments: fragments,\n    overlappingEnzymes: overlappingEnzymes\n  };\n}\n\nfunction getDigestFragsForSeqAndEnzymes(_ref2) {\n  var sequence = _ref2.sequence,\n      circular = _ref2.circular,\n      enzymes = _ref2.enzymes,\n      includeOverAndUnderHangs = _ref2.includeOverAndUnderHangs;\n\n  var cutsitesByName = getCutsitesFromSequence(sequence, circular, enzymes);\n  return computeDigestFragments({\n    includeOverAndUnderHangs: includeOverAndUnderHangs,\n    cutsites: flatMap(cutsitesByName),\n    sequenceLength: sequence.length,\n    circular: circular\n  });\n}\n\nmodule.exports.computeDigestFragments = computeDigestFragments;\nmodule.exports.getDigestFragsForSeqAndEnzymes = getDigestFragsForSeqAndEnzymes;","\"use strict\";\n\nmodule.exports = function getReverseComplementAnnotation(annotation, sequenceLength) {\n  //note this function assumes that the entire sequence (or subsequence) is being reverse complemented\n  //TNR: this is what is happening:\n  //0123456789\n  //-feature--   //normal\n  //--erutaef-   //reverse complemented\n\n  //sequence length = 10\n  //feature start = 1\n  //feature end = 7\n  //so, erutaef start = 2 = 10 - (7+1)\n  //and, erutaef end = 8 = 10 - (1+1)\n\n  return Object.assign({}, annotation, {\n    start: sequenceLength - (annotation.end + 1),\n    end: sequenceLength - (annotation.start + 1),\n    forward: !annotation.forward,\n    strand: annotation.strand === 1 ? -1 : 1\n  });\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"lodash\"),\n    each = _require.each,\n    forEach = _require.forEach,\n    startsWith = _require.startsWith,\n    filter = _require.filter;\n\nvar _require2 = require(\"ve-range-utils\"),\n    getYOffsetForPotentiallyCircularRange = _require2.getYOffsetForPotentiallyCircularRange,\n    splitRangeIntoTwoPartsIfItIsCircular = _require2.splitRangeIntoTwoPartsIfItIsCircular;\n\nmodule.exports = function mapAnnotationsToRows(annotations, sequenceLength, bpsPerRow) {\n  var _ref = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {},\n      splitForwardReverse = _ref.splitForwardReverse;\n\n  var annotationsToRowsMap = {};\n  var yOffsetLevelMap = {};\n  var wrappedAnnotations = {};\n  each(annotations, function (annotation) {\n    var containsLocations = !!(annotation.locations && annotation.locations.length);\n    if (annotation.overlapsSelf) {\n      //if the annotation overlaps itself, first send a fake full spanning annotation thru the mapping function\n      if (!wrappedAnnotations[annotation.id]) {\n        mapAnnotationToRows({\n          wrappedAnnotations: wrappedAnnotations,\n          annotation: {\n            start: 0,\n            end: sequenceLength - 1,\n            id: \"__tempAnnRemoveMe__\" + annotation.id\n          },\n          sequenceLength: sequenceLength,\n          bpsPerRow: bpsPerRow,\n          annotationsToRowsMap: annotationsToRowsMap,\n          yOffsetLevelMap: yOffsetLevelMap,\n          containsLocations: containsLocations,\n          splitForwardReverse: splitForwardReverse\n        });\n        wrappedAnnotations[annotation.id] = true;\n        // annotation.yOffset = wrappedAnnotations[annotation.id];\n      }\n    }\n\n    mapAnnotationToRows({\n      wrappedAnnotations: wrappedAnnotations,\n      annotation: annotation,\n      sequenceLength: sequenceLength,\n      bpsPerRow: bpsPerRow,\n      annotationsToRowsMap: annotationsToRowsMap,\n      yOffsetLevelMap: yOffsetLevelMap,\n      containsLocations: containsLocations,\n      splitForwardReverse: splitForwardReverse\n    });\n    if (containsLocations) {\n      annotation.locations.forEach(function (location) {\n        mapAnnotationToRows({\n          wrappedAnnotations: wrappedAnnotations,\n          annotation: annotation,\n          sequenceLength: sequenceLength,\n          bpsPerRow: bpsPerRow,\n          annotationsToRowsMap: annotationsToRowsMap,\n          yOffsetLevelMap: yOffsetLevelMap,\n          location: location,\n          splitForwardReverse: splitForwardReverse\n        });\n      });\n    }\n  });\n  forEach(annotationsToRowsMap, function (annotationsForRow, i) {\n    annotationsToRowsMap[i] = filter(annotationsForRow, function (ann) {\n      return !startsWith(ann.id, \"__tempAnnRemoveMe__\");\n    });\n  });\n  return annotationsToRowsMap;\n};\n\nfunction mapAnnotationToRows(_ref2) {\n  var wrappedAnnotations = _ref2.wrappedAnnotations,\n      annotation = _ref2.annotation,\n      sequenceLength = _ref2.sequenceLength,\n      bpsPerRow = _ref2.bpsPerRow,\n      annotationsToRowsMap = _ref2.annotationsToRowsMap,\n      yOffsetLevelMap = _ref2.yOffsetLevelMap,\n      location = _ref2.location,\n      containsLocations = _ref2.containsLocations,\n      splitForwardReverse = _ref2.splitForwardReverse;\n\n  var ranges = splitRangeIntoTwoPartsIfItIsCircular(location || annotation, sequenceLength);\n  ranges.forEach(function (range, index) {\n    // if (!isPositiveInteger(range.start)) {}\n    var startingRow = Math.floor(range.start / bpsPerRow);\n    var endingRow = Math.floor(range.end / bpsPerRow);\n    // const numberOfRows = endingRow - startingRow + 1;\n    for (var rowNumber = startingRow; rowNumber <= endingRow; rowNumber++) {\n      if (!annotationsToRowsMap[rowNumber]) {\n        annotationsToRowsMap[rowNumber] = [];\n      }\n      var key = splitForwardReverse ? annotation.forward ? rowNumber + \"_forward\" : rowNumber + \"_reverse\" : rowNumber;\n\n      var annotationsForRow = annotationsToRowsMap[rowNumber];\n      if (!yOffsetLevelMap[key]) {\n        yOffsetLevelMap[key] = [];\n      }\n\n      var yOffset = void 0;\n      var yOffsetsForRow = yOffsetLevelMap[key];\n      var start = rowNumber === startingRow ? range.start : rowNumber * bpsPerRow;\n      var end = rowNumber === endingRow ? range.end : rowNumber * bpsPerRow + bpsPerRow - 1;\n      if (annotation.overlapsSelf) {\n        annotationsForRow.forEach(function (ann) {\n          if (ann.id === \"__tempAnnRemoveMe__\" + annotation.id) {\n            yOffset = ann.yOffset;\n          }\n        });\n      } else {\n        if (location) {\n          //if there's a location then we will just use the previous yOffset for its parent annotation\n          annotationsForRow.forEach(function (ann) {\n            if (ann.id === annotation.id) {\n              yOffset = ann.yOffset;\n            }\n          });\n        } else {\n          //we need to pass both ranges into this function so that we can correctly\n          //get the y-offset for circular features that start and end on the same row\n          //we pass the entire annotation range here and compare it only with ranges that have already been added to the row\n          if (index > 0 && //second half of an annotation range\n          annotationsForRow.length && //there are already annotations within the row\n          annotationsForRow[annotationsForRow.length - 1].annotation === annotation) {\n            //the first chunk of the annotation has already been pushed into the row,\n            //so set the yOffset for the range chunk to the already calculated yOffset\n            yOffset = annotationsForRow[annotationsForRow.length - 1].yOffset;\n          } else {\n            yOffset = getYOffsetForPotentiallyCircularRange(annotation, yOffsetsForRow);\n          }\n          //add the new yOffset to the yOffset array\n          if (!yOffsetsForRow[yOffset]) yOffsetsForRow[yOffset] = [];\n          yOffsetsForRow[yOffset].push({\n            start: start,\n            end: end\n          });\n        }\n      }\n\n      annotationsForRow.push(_extends({\n        id: annotation.id,\n        annotation: annotation,\n        start: start,\n        end: end\n      }, containsLocations && { containsLocations: containsLocations }, location && { isJoinedLocation: !!location }, {\n        yOffset: yOffset,\n        enclosingRangeType: range.type //either \"beginning\", \"end\" or \"beginningAndEnd\"\n      }));\n    }\n  });\n  // return annotationsToRowsMap;\n}","\"use strict\";\n\nvar getComplementSequenceString = require(\"./getComplementSequenceString\");\nvar calculatePercentGc = require(\"./calculatePercentGC\");\n\n// sources of formulas:\n// - https://tmcalculator.neb.com/#!/help\n// - Tm calculation: SantaLucia (1998) PNAS 95:1460-5\n// - salt correction (for monovalent cations): Owczarzy (2004) Biochem 43:3537-54\n\n// primer concentration & monovalent cation concentration in M\nmodule.exports = function calculateNebTm(sequence, primerConc) {\n  var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      monovalentCationConc = _ref.monovalentCationConc;\n\n  try {\n    var checkForDegenerateBases = /[^atgc]/i.test(sequence);\n    if (checkForDegenerateBases) {\n      throw new Error(\"Degenerate bases prohibited in Tm calculation of sequence \" + sequence);\n    }\n    var seq = sequence.toUpperCase().split(\"\");\n    // enthalpy, entropy\n    var h = 0;\n    var s = 0;\n    // adjustments for helix initiation\n    var hi = 0;\n    var si = 0;\n    // R = universal gas constant with units of cal/(K*mol)\n    var r = 1.987;\n    // to convert the units of Tm from kelvin to celsius and vice versa\n    var kelvinToCelsius = -273.15;\n    var celsiusToKelvin = 273.15;\n    // to convert the units of enthalpy from kilocal/mol to cal/mol\n    var kilocalToCal = 1000;\n    var sequenceToEnthalpyMap = {\n      \"AA/TT\": -7.9,\n      \"AT/TA\": -7.2,\n      \"TA/AT\": -7.2,\n      \"CA/GT\": -8.5,\n      \"GT/CA\": -8.4,\n      \"CT/GA\": -7.8,\n      \"GA/CT\": -8.2,\n      \"CG/GC\": -10.6,\n      \"GC/CG\": -9.8,\n      \"GG/CC\": -8.0,\n      \"TT/AA\": -7.9,\n      \"TG/AC\": -8.5,\n      \"AC/TG\": -8.4,\n      \"AG/TC\": -7.8,\n      \"TC/AG\": -8.2,\n      \"CC/GG\": -8.0,\n      initiationWithTerminalGC: 0.1,\n      initiationWithTerminalAT: 2.3\n    };\n    var sequenceToEntropyMap = {\n      \"AA/TT\": -22.2,\n      \"AT/TA\": -20.4,\n      \"TA/AT\": -21.3,\n      \"CA/GT\": -22.7,\n      \"GT/CA\": -22.4,\n      \"CT/GA\": -21.0,\n      \"GA/CT\": -22.2,\n      \"CG/GC\": -27.2,\n      \"GC/CG\": -24.4,\n      \"GG/CC\": -19.9,\n      \"TT/AA\": -22.2,\n      \"TG/AC\": -22.7,\n      \"AC/TG\": -22.4,\n      \"AG/TC\": -21.0,\n      \"TC/AG\": -22.2,\n      \"CC/GG\": -19.9,\n      initiationWithTerminalGC: -2.8,\n      initiationWithTerminalAT: 4.1\n    };\n    for (var i = 0; i < seq.length; i++) {\n      if (i === 0 || i === seq.length - 1) {\n        // first or last nucleotide\n        if (seq[i] === \"G\" || seq[i] === \"C\") {\n          hi += sequenceToEnthalpyMap.initiationWithTerminalGC;\n          si += sequenceToEntropyMap.initiationWithTerminalGC;\n        } else if (seq[i] === \"A\" || seq[i] === \"T\") {\n          hi += sequenceToEnthalpyMap.initiationWithTerminalAT;\n          si += sequenceToEntropyMap.initiationWithTerminalAT;\n        }\n      }\n      if (i < seq.length - 1) {\n        var dimer = seq[i] + seq[i + 1];\n        var complement = getComplementSequenceString(dimer).toUpperCase();\n        var dimerDuplex = dimer + \"/\" + complement;\n        if (!sequenceToEnthalpyMap[dimerDuplex] || !sequenceToEntropyMap[dimerDuplex]) {\n          throw new Error(\"Could not find value for \" + dimerDuplex + \" of sequence \" + sequence);\n        }\n        h += sequenceToEnthalpyMap[dimerDuplex];\n        s += sequenceToEntropyMap[dimerDuplex];\n      }\n    }\n    // this calculated Tm assumes 1 M monovalent cation concentration\n    var deltaH = h + hi;\n    var deltaS = s + si;\n    var numerator = deltaH * kilocalToCal;\n    var denominator = deltaS + r * Math.log(primerConc);\n    var meltingTemp = numerator / denominator + kelvinToCelsius;\n    if (monovalentCationConc) {\n      // adjusting Tm for actual monovalent cation concentration\n      var lnOfMonoConc = Math.log(monovalentCationConc);\n      var gcContent = calculatePercentGc(sequence) / 100;\n      var part = 4.29 * gcContent - 3.95;\n      var saltCorrection = part * Math.pow(10, -5) * lnOfMonoConc + Math.pow(9.4, -6) * Math.pow(lnOfMonoConc, 2);\n      var adjustedMeltingTemp = 1 / (1 / (meltingTemp + celsiusToKelvin) + saltCorrection) + kelvinToCelsius;\n      return adjustedMeltingTemp;\n    } else {\n      return meltingTemp;\n    }\n  } catch (err) {\n    return \"Error calculating Tm for sequence \" + sequence + \": \" + err;\n  }\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength = _require.normalizePositionByRangeLength,\n    getRangeLength = _require.getRangeLength;\n\nmodule.exports = function getDigestFragmentsForCutsites(sequenceLength, circular, cutsites) {\n  var opts = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n\n  var fragments = [];\n  var overlappingEnzymes = [];\n  var pairs = [];\n  if (!cutsites.length) return [];\n  var sortedCutsites = cutsites.sort(function (a, b) {\n    return a.topSnipPosition - b.topSnipPosition;\n  });\n\n  if (!circular) {\n    //if linear, add 2 fake cutsites for the start and end of the seq\n    sortedCutsites = [{\n      topSnipPosition: 0,\n      bottomSnipPosition: 0,\n      overhangSize: 0,\n      type: \"START_OR_END_OF_SEQ\",\n      name: \"START_OF_SEQ\"\n    }].concat(sortedCutsites, [{\n      topSnipPosition: sequenceLength,\n      bottomSnipPosition: sequenceLength,\n      overhangSize: 0,\n      type: \"START_OR_END_OF_SEQ\",\n      name: \"END_OF_SEQ\"\n    }]);\n  }\n\n  sortedCutsites.forEach(function (cutsite1, index) {\n    if (!circular && !sortedCutsites[index + 1]) {\n      return; //don't push a pair if the sequence is linear and we've reached the end of our cutsites array\n    }\n    if (opts.computePartialDigests) {\n      sortedCutsites.forEach(function (cs, index2) {\n        if (index2 === index + 1 || index2 === 0) {\n          return;\n        }\n        pairs.push([cutsite1, sortedCutsites[index2]]);\n      });\n    }\n    pairs.push([cutsite1, sortedCutsites[index + 1] ? sortedCutsites[index + 1] : sortedCutsites[0]]);\n  });\n\n  pairs.forEach(function (_ref) {\n    var cut1 = _ref[0],\n        cut2 = _ref[1];\n\n    var start = normalizePositionByRangeLength(cut1.topSnipPosition, sequenceLength);\n    var end = normalizePositionByRangeLength(cut2.topSnipPosition - 1, sequenceLength);\n    var fragmentRange = { start: start, end: end };\n    var size = getRangeLength(fragmentRange, sequenceLength);\n\n    // const id = uniqid()\n    var id = start + \"-\" + end + \"-\" + size + \"-\";\n\n    // getRangeLength({ start, end }, sequenceLength);\n\n    fragments.push(_extends({\n      // I don't think we can determine containsFive/ThreePrimeRecognitionSite until the inclusion/exclusion of the overhangs is done\n      // containsFivePrimeRecognitionSite: cut1.type !== \"START_OR_END_OF_SEQ\" && isRangeWithinRange(cut1.recognitionSiteRange, fragmentRange, sequenceLength ) ,\n      // containsThreePrimeRecognitionSite: cut2.type !== \"START_OR_END_OF_SEQ\" && isRangeWithinRange(cut1.recognitionSiteRange,  fragmentRange, sequenceLength) ,\n      cut1: _extends({}, cut1, {\n        isOverhangIncludedInFragmentSize: cut1.type !== \"START_OR_END_OF_SEQ\" && cut1.overhangSize > 0 && cut1.topSnipBeforeBottom\n      }),\n      cut2: _extends({}, cut2, {\n        isOverhangIncludedInFragmentSize: cut2.type !== \"START_OR_END_OF_SEQ\" && cut2.overhangSize > 0 && !cut2.topSnipBeforeBottom\n      })\n    }, fragmentRange, {\n      size: size,\n      id: id\n    }));\n  });\n\n  fragments.filter(function (fragment) {\n    if (!fragment.size) {\n      overlappingEnzymes.push(fragment);\n      return false;\n    }\n    return true;\n  });\n  return fragments;\n};","\"use strict\";\n\nvar diffUtils = require(\"./diffUtils\");\n\nvar _require = require(\"./autoAnnotate\"),\n    autoAnnotate = _require.autoAnnotate,\n    convertApELikeRegexToRegex = _require.convertApELikeRegexToRegex,\n    convertProteinSeqToDNAIupac = _require.convertProteinSeqToDNAIupac;\n\nvar _require2 = require(\"./featureTypesAndColors\"),\n    genbankFeatureTypes = _require2.genbankFeatureTypes,\n    getFeatureToColorMap = _require2.getFeatureToColorMap,\n    getFeatureTypes = _require2.getFeatureTypes,\n    getMergedFeatureMap = _require2.getMergedFeatureMap;\n\nmodule.exports.getFeatureToColorMap = getFeatureToColorMap;\nmodule.exports.getFeatureTypes = getFeatureTypes;\nmodule.exports.genbankFeatureTypes = genbankFeatureTypes;\nmodule.exports.getMergedFeatureMap = getMergedFeatureMap;\n/* ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ */\n//tnr: these are deprecated exports and should no longer be used!\nmodule.exports.FeatureTypes = getFeatureTypes();\nmodule.exports.featureColors = getFeatureToColorMap();\n/* ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ */\nmodule.exports.autoAnnotate = autoAnnotate;\nmodule.exports.convertApELikeRegexToRegex = convertApELikeRegexToRegex;\nmodule.exports.convertProteinSeqToDNAIupac = convertProteinSeqToDNAIupac;\nmodule.exports.diffUtils = diffUtils;\nmodule.exports.getDiffFromSeqs = diffUtils.getDiffFromSeqs;\nmodule.exports.patchSeqWithDiff = diffUtils.patchSeqWithDiff;\nmodule.exports.reverseSeqDiff = diffUtils.reverseSeqDiff;\nmodule.exports.getAllInsertionsInSeqReads = require(\"./getAllInsertionsInSeqReads\");\nmodule.exports.annotateSingleSeq = require(\"./annotateSingleSeq\");\nmodule.exports.getDegenerateDnaStringFromAAString = require(\"./getDegenerateDnaStringFromAAString\");\nmodule.exports.getDegenerateRnaStringFromAAString = require(\"./getDegenerateRnaStringFromAAString\");\nmodule.exports.getVirtualDigest = require(\"./getVirtualDigest\");\nmodule.exports.isEnzymeType2S = require(\"./isEnzymeType2S\");\nmodule.exports.insertGapsIntoRefSeq = require(\"./insertGapsIntoRefSeq\");\nmodule.exports.adjustBpsToReplaceOrInsert = require(\"./adjustBpsToReplaceOrInsert\");\nmodule.exports.annotationTypes = require(\"./annotationTypes\");\nmodule.exports.calculatePercentGC = require(\"./calculatePercentGC\");\nmodule.exports.calculateTm = require(\"./calculateTm\");\nmodule.exports.bioData = require(\"./bioData\");\nmodule.exports.cutSequenceByRestrictionEnzyme = require(\"./cutSequenceByRestrictionEnzyme\");\nmodule.exports.deleteSequenceDataAtRange = require(\"./deleteSequenceDataAtRange\");\nmodule.exports.DNAComplementMap = require(\"./DNAComplementMap\");\nmodule.exports.doesEnzymeChopOutsideOfRecognitionSite = require(\"./doesEnzymeChopOutsideOfRecognitionSite\");\nmodule.exports.aliasedEnzymesByName = require(\"./aliasedEnzymesByName\");\nmodule.exports.defaultEnzymesByName = require(\"./defaultEnzymesByName\");\nmodule.exports.generateSequenceData = require(\"./generateSequenceData\");\nmodule.exports.filterAminoAcidSequenceString = require(\"./filterAminoAcidSequenceString\");\nmodule.exports.filterSequenceString = require(\"./filterSequenceString\");\nmodule.exports.findNearestRangeOfSequenceOverlapToPosition = require(\"./findNearestRangeOfSequenceOverlapToPosition\");\nmodule.exports.findOrfsInPlasmid = require(\"./findOrfsInPlasmid\");\nmodule.exports.findSequenceMatches = require(\"./findSequenceMatches\");\nmodule.exports.getAminoAcidDataForEachBaseOfDna = require(\"./getAminoAcidDataForEachBaseOfDna\");\nmodule.exports.getAminoAcidFromSequenceTriplet = require(\"./getAminoAcidFromSequenceTriplet\");\nmodule.exports.getAminoAcidStringFromSequenceString = require(\"./getAminoAcidStringFromSequenceString\");\nmodule.exports.getCodonRangeForAASliver = require(\"./getCodonRangeForAASliver\");\nmodule.exports.getComplementAminoAcidStringFromSequenceString = require(\"./getComplementAminoAcidStringFromSequenceString\");\nmodule.exports.getComplementSequenceAndAnnotations = require(\"./getComplementSequenceAndAnnotations\");\nmodule.exports.getComplementSequenceString = require(\"./getComplementSequenceString\");\nmodule.exports.getCutsitesFromSequence = require(\"./getCutsitesFromSequence\");\nmodule.exports.getCutsiteType = require(\"./getCutsiteType\");\nmodule.exports.computeDigestFragments = require(\"./computeDigestFragments\").computeDigestFragments;\nmodule.exports.getDigestFragsForSeqAndEnzymes = require(\"./computeDigestFragments\").getDigestFragsForSeqAndEnzymes;\nmodule.exports.getInsertBetweenVals = require(\"./getInsertBetweenVals\");\nmodule.exports.getLeftAndRightOfSequenceInRangeGivenPosition = require(\"./getLeftAndRightOfSequenceInRangeGivenPosition\");\nmodule.exports.getOrfsFromSequence = require(\"./getOrfsFromSequence\");\nmodule.exports.getOverlapBetweenTwoSequences = require(\"./getOverlapBetweenTwoSequences\");\nmodule.exports.getPossiblePartsFromSequenceAndEnzymes = require(\"./getPossiblePartsFromSequenceAndEnzymes\");\nmodule.exports.getReverseAminoAcidStringFromSequenceString = require(\"./getReverseAminoAcidStringFromSequenceString\");\nmodule.exports.getReverseComplementAminoAcidStringFromSequenceString = require(\"./getReverseComplementAminoAcidStringFromSequenceString\");\nmodule.exports.getReverseComplementAnnotation = require(\"./getReverseComplementAnnotation\");\nmodule.exports.getReverseComplementSequenceAndAnnotations = require(\"./getReverseComplementSequenceAndAnnotations\");\nmodule.exports.getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\nmodule.exports.getReverseSequenceString = require(\"./getReverseSequenceString\");\nmodule.exports.getSequenceDataBetweenRange = require(\"./getSequenceDataBetweenRange\");\nmodule.exports.guessIfSequenceIsDnaAndNotProtein = require(\"./guessIfSequenceIsDnaAndNotProtein\");\nmodule.exports.insertSequenceDataAtPosition = require(\"./insertSequenceDataAtPosition\");\nmodule.exports.insertSequenceDataAtPositionOrRange = require(\"./insertSequenceDataAtPositionOrRange\");\nmodule.exports.mapAnnotationsToRows = require(\"./mapAnnotationsToRows\");\nmodule.exports.prepareCircularViewData = require(\"./prepareCircularViewData\");\nmodule.exports.prepareRowData = require(\"./prepareRowData\");\nmodule.exports.proteinAlphabet = require(\"./proteinAlphabet\");\nmodule.exports.rotateSequenceDataToPosition = require(\"./rotateSequenceDataToPosition\");\nmodule.exports.rotateBpsToPosition = require(\"./rotateBpsToPosition\");\nmodule.exports.threeLetterSequenceStringToAminoAcidMap = require(\"./threeLetterSequenceStringToAminoAcidMap\");\nmodule.exports.tidyUpSequenceData = require(\"./tidyUpSequenceData\");\nmodule.exports.tidyUpAnnotation = require(\"./tidyUpAnnotation\");\nmodule.exports.condensePairwiseAlignmentDifferences = require(\"./condensePairwiseAlignmentDifferences\");\nmodule.exports.addGapsToSeqReads = require(\"./addGapsToSeqReads\");\nmodule.exports.calculateNebTm = require(\"./calculateNebTm\");\nmodule.exports.calculateNebTa = require(\"./calculateNebTa\");\nmodule.exports.getDigestFragmentsForCutsites = require(\"./getDigestFragmentsForCutsites\");\nmodule.exports.getDigestFragmentsForRestrictionEnzymes = require(\"./getDigestFragmentsForRestrictionEnzymes\");\nmodule.exports.convertDnaCaretPositionOrRangeToAA = require(\"./convertDnaCaretPositionOrRangeToAA\");\nmodule.exports.convertAACaretPositionOrRangeToDna = require(\"./convertAACaretPositionOrRangeToDna\");\nmodule.exports.aminoAcidToDegenerateDnaMap = require(\"./aminoAcidToDegenerateDnaMap\");\nmodule.exports.aminoAcidToDegenerateRnaMap = require(\"./aminoAcidToDegenerateRnaMap\");\nmodule.exports.degenerateDnaToAminoAcidMap = require(\"./degenerateDnaToAminoAcidMap\");\nmodule.exports.degenerateRnaToAminoAcidMap = require(\"./degenerateRnaToAminoAcidMap\");\nmodule.exports.getMassOfAaString = require(\"./getMassOfAaString\");\nmodule.exports.shiftAnnotationsByLen = require(\"./shiftAnnotationsByLen\");\nmodule.exports.adjustAnnotationsToInsert = require(\"./adjustAnnotationsToInsert\");","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    cloneDeep = _require.cloneDeep,\n    forEach = _require.forEach;\n\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\nvar differ = require(\"jsondiffpatch\").create({\n  // cloneDiffValues: true\n});\n\nvar getDiffFromSeqs = function getDiffFromSeqs(oldData, newData) {\n  var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      _ref$ignoreKeys = _ref.ignoreKeys,\n      ignoreKeys = _ref$ignoreKeys === undefined ? [] : _ref$ignoreKeys;\n\n  oldData = tidyUpSequenceData(oldData, {\n    annotationsAsObjects: true,\n    noTranslationData: true\n  });\n  newData = tidyUpSequenceData(newData, {\n    annotationsAsObjects: true,\n    noTranslationData: true\n  });\n\n  [oldData, newData].forEach(function (d) {\n    [\"cutsites\", \"orfs\", \"filteredFeatures\", \"size\", \"fromFileUpload\", \"description\", \"materiallyAvailable\"].concat(ignoreKeys).forEach(function (prop) {\n      delete d[prop];\n    });\n    if (d.translations) {\n      forEach(d.translations, function (translation, key) {\n        if (translation.translationType && translation.translationType !== \"User Created\") {\n          delete d.translations[key];\n        } else {\n          delete translation.aminoAcids;\n        }\n      });\n    }\n  });\n\n  return differ.diff(oldData, newData);\n};\nvar patchSeqWithDiff = function patchSeqWithDiff(oldData, diff) {\n  var _ref2 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      _ref2$ignoreKeys = _ref2.ignoreKeys,\n      ignoreKeys = _ref2$ignoreKeys === undefined ? [] : _ref2$ignoreKeys;\n\n  ignoreKeys.forEach(function (k) {\n    delete diff[k];\n  });\n  return differ.patch(tidyUpSequenceData(cloneDeep(oldData), { annotationsAsObjects: true }), diff);\n};\nvar reverseSeqDiff = function reverseSeqDiff(diff) {\n  return differ.reverse(diff);\n};\n\nmodule.exports = { getDiffFromSeqs: getDiffFromSeqs, patchSeqWithDiff: patchSeqWithDiff, reverseSeqDiff: reverseSeqDiff };","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","'use strict';\n\nvar splitRangeIntoTwoPartsIfItIsCircular = require('./splitRangeIntoTwoPartsIfItIsCircular');\nvar trimRangeByAnotherRange = require('./trimRangeByAnotherRange');\n// const ac = require('ve-api-check'); \n\n//takes in two potentially circular ranges and returns the first one trimmed by the second one\n//returns null if no range is left after the trimming\nmodule.exports = function adjustRangeToDeletionOfAnotherRange(rangeToBeAdjusted, anotherRange, maxLength) {\n    // ac.throw(ac.range, rangeToBeAdjusted)\n    // ac.throw(ac.range, anotherRange)\n    // ac.throw(ac.posInt, maxLength)\n    var trimmedRange = trimRangeByAnotherRange(rangeToBeAdjusted, anotherRange, maxLength);\n    if (trimmedRange) {\n        //if there is a range left after being trimmed, adjust it by the deleted anotherRange\n        //we can make some awesome logical simplifications because we know that the two ranges do not overlap (since we've already trimmed the rangeToBeAdjusted)\n        var nonCircularDeletionRanges = splitRangeIntoTwoPartsIfItIsCircular(anotherRange, maxLength);\n        nonCircularDeletionRanges.forEach(function (nonCircularDeletionRange) {\n            var deletionLength = nonCircularDeletionRange.end - nonCircularDeletionRange.start + 1;\n            if (trimmedRange.start > trimmedRange.end) {\n                //the trimmed range is circular\n                if (nonCircularDeletionRange.start < trimmedRange.end) {\n                    trimmedRange.start -= deletionLength;\n                    trimmedRange.end -= deletionLength;\n                } else if (nonCircularDeletionRange.start < trimmedRange.start) {\n                    trimmedRange.start -= deletionLength;\n                } else {\n                    //do nothing\n                }\n            } else {\n                if (nonCircularDeletionRange.start < trimmedRange.start) {\n                    trimmedRange.start -= deletionLength;\n                    trimmedRange.end -= deletionLength;\n                } else if (nonCircularDeletionRange.start < trimmedRange.end) {\n                    trimmedRange.end -= deletionLength;\n                } else {\n                    //do nothing\n                }\n            }\n        });\n    }\n    return trimmedRange;\n};","\"use strict\";\n\n// const ac = require('ve-api-check'); \nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = function adjustRangeToInsert(rangeToBeAdjusted, insertStart, insertLength) {\n    // ac.throw([ac.range, ac.posInt, ac.posInt], arguments);\n    var newRange = assign({}, rangeToBeAdjusted);\n    if (rangeToBeAdjusted.start > rangeToBeAdjusted.end) {\n        //circular range\n        if (rangeToBeAdjusted.end >= insertStart) {\n            //adjust both start and end\n            newRange.start += insertLength;\n            newRange.end += insertLength;\n        } else if (rangeToBeAdjusted.start >= insertStart) {\n            //adjust just the start\n            newRange.start += insertLength;\n        }\n    } else {\n        if (rangeToBeAdjusted.start >= insertStart) {\n            //adjust both start and end\n            newRange.start += insertLength;\n            newRange.end += insertLength;\n        } else if (rangeToBeAdjusted.end >= insertStart) {\n            //adjust just the end\n            newRange.end += insertLength;\n        }\n    }\n    return newRange;\n};","'use strict';\n\nvar convertRangeIndices = require('./convertRangeIndices');\nmodule.exports = function convertRangeTo0Based(range) {\n  return convertRangeIndices(range, { inclusive1BasedStart: true, inclusive1BasedEnd: true });\n};","'use strict';\n\nvar convertRangeIndices = require('./convertRangeIndices');\nmodule.exports = function convertRangeTo1Based(range) {\n  return convertRangeIndices(range, {}, { inclusive1BasedStart: true, inclusive1BasedEnd: true });\n};","'use strict';\n\nvar getRangeLength = require('./getRangeLength');\nmodule.exports = function doesRangeSpanEntireSequence(range, sequenceLength) {\n  if (getRangeLength(range) === sequenceLength) {\n    return true;\n  }\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    isObject = _require.isObject;\n\nvar isRangeWithinRange = require(\"./isRangeWithinRange\");\nvar isPositionWithinRange = require(\"./isPositionWithinRange\");\n\nmodule.exports = function isRangeOrPositionWithinRange(rangeOrPositionToCheck, containingRange, maxLength, includeStartEdge, includeEndEdge) {\n\n  if (rangeOrPositionToCheck === undefined || rangeOrPositionToCheck === null || containingRange === undefined || containingRange === null) {\n    return false;\n  }\n  if (isObject(rangeOrPositionToCheck)) {\n    return isRangeWithinRange(rangeOrPositionToCheck, containingRange, maxLength);\n  } else {\n    return isPositionWithinRange(rangeOrPositionToCheck, containingRange, maxLength, includeStartEdge, includeEndEdge);\n  }\n};","\"use strict\";\n\nmodule.exports = function doesRangeSpanOrigin(range) {\n  return range.start > range.end;\n};","'use strict';\n\nvar expandOrContractCircularRangeToPosition = require('./expandOrContractCircularRangeToPosition');\nvar expandOrContractNonCircularRangeToPosition = require('./expandOrContractNonCircularRangeToPosition');\nmodule.exports = function expandOrContractRangeToPosition(range, position, maxLength) {\n    if (range.start > range.end) {\n        return expandOrContractCircularRangeToPosition(range, position, maxLength);\n    } else {\n        return expandOrContractNonCircularRangeToPosition(range, position, maxLength);\n    }\n};","'use strict';\n\nvar expandOrContractRangeByLength = require('./expandOrContractRangeByLength');\nvar isRangeWithinRange = require('./isRangeWithinRange');\nvar getOverlapsOfPotentiallyCircularRanges = require('./getOverlapsOfPotentiallyCircularRanges');\nvar translateRange = require('./translateRange');\n\nvar getRangeLength = require('./getRangeLength');\nmodule.exports = function flipRelativeRange(innerRange, outerRange, sequenceLength, options) {\n\tvar isFullyContained = isRangeWithinRange(innerRange, outerRange, sequenceLength);\n\tif (isFullyContained) {\n\t\treturn flipFullyContainedRange(innerRange, outerRange, sequenceLength);\n\t} else {\n\t\t// flip not fully contained range\n\t\treturn flipNonFullyContainedRange(innerRange, outerRange, sequenceLength);\n\t}\n};\n\nfunction flipNonFullyContainedRange(innerRange, outerRange, sequenceLength, options) {\n\tvar outerFullyContained = isRangeWithinRange(outerRange, innerRange, sequenceLength);\n\tvar flippedInnerRange;\n\tif (outerFullyContained) {\n\t\t//special logic\n\t\t// flipFullyContainedRange(outerRange, outerRange, sequenceLength)\n\t\tvar expandBy1 = getRangeLength({\n\t\t\tstart: innerRange.start,\n\t\t\tend: outerRange.start\n\t\t}, sequenceLength) - 1;\n\t\tflippedInnerRange = expandOrContractRangeByLength(outerRange, expandBy1, false, sequenceLength);\n\n\t\tvar expandBy2 = getRangeLength({\n\t\t\tend: innerRange.end,\n\t\t\tstart: outerRange.end\n\t\t}, sequenceLength) - 1;\n\t\tflippedInnerRange = expandOrContractRangeByLength(flippedInnerRange, expandBy2, true, sequenceLength);\n\t} else {\n\t\t//find overlaps of ranges\n\t\tvar overlaps = getOverlapsOfPotentiallyCircularRanges(innerRange, outerRange, sequenceLength);\n\t\t//take first overlap and determine which end of outer range it overlaps\n\t\tif (overlaps.length >= 1) {\n\t\t\tvar overlapExtendsForward;\n\t\t\tvar firstOverlap = overlaps[0];\n\t\t\toverlapExtendsForward = firstOverlap.start !== outerRange.start;\n\t\t\t//flip using fully contained logic\n\t\t\tvar flippedTruncatedInner = flipFullyContainedRange(firstOverlap, outerRange, sequenceLength);\n\t\t\t//extend in the opposite direction\n\t\t\tvar lengthToExtend = getRangeLength(innerRange, sequenceLength) - getRangeLength(flippedTruncatedInner, sequenceLength);\n\t\t\tflippedInnerRange = expandOrContractRangeByLength(flippedTruncatedInner, lengthToExtend, overlapExtendsForward, sequenceLength);\n\t\t} else {\n\t\t\tthrow new Error('This case (relative ranges that do not overlap) is unsupported! ');\n\t\t}\n\t}\n\treturn flippedInnerRange;\n}\n\nfunction flipFullyContainedRange(innerRange, outerRange, sequenceLength, options) {\n\t//translate both ranges by offset such that outer range start = 0\n\tvar translateBy = -outerRange.start;\n\tvar translatedOuterRange = translateRange(outerRange, translateBy, sequenceLength);\n\tvar translatedInnerRange = translateRange(innerRange, translateBy, sequenceLength);\n\n\t//flip like non origin spanning range \n\tvar translatedFlippedInnerRange = flipNonOriginSpanningContainedRange(translatedInnerRange, translatedOuterRange, sequenceLength);\n\n\t//translate inner range back by negative offset \n\tvar flippedInnerRange = translateRange(translatedFlippedInnerRange, -translateBy, sequenceLength);\n\treturn flippedInnerRange;\n}\n\nfunction flipNonOriginSpanningContainedRange(innerRange, outerRange, sequenceLength) {\n\t//non origin spanning, fully contained inner\n\tvar offsetFromStart = innerRange.start - outerRange.start;\n\tvar newInnerEnd = outerRange.end - offsetFromStart;\n\tvar innerRangeLength = getRangeLength(innerRange, sequenceLength);\n\n\treturn {\n\t\tend: newInnerEnd,\n\t\tstart: newInnerEnd - (innerRangeLength - 1)\n\t};\n}\n\n//take 2","'use strict';\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\n\nmodule.exports = function generateRandomRange(minStart, maxEnd, maxLength) {\n\tvar start = getRandomInt(minStart, maxEnd);\n\tvar end;\n\tif (maxLength) {\n\t\tend = normalizePositionByRangeLength(getRandomInt(start, start + maxLength), maxEnd);\n\t} else {\n\t\tend = getRandomInt(minStart, maxEnd);\n\t}\n\treturn {\n\t\tstart: start,\n\t\tend: end\n\t};\n};\n\nfunction getRandomInt(min, max) {\n\treturn Math.floor(Math.random() * (max - min)) + min;\n}","'use strict';\n\n//function that returns the annotation range type\nmodule.exports = function getAnnotationRangeType(annotationRange, enclosingRangeType, forward) {\n    if (annotationRange.start === enclosingRangeType.start) {\n        if (annotationRange.end === enclosingRangeType.end) {\n            return 'beginningAndEnd';\n        } else {\n            if (forward) {\n                return 'start';\n            } else {\n                return 'end';\n            }\n        }\n    } else {\n        if (annotationRange.end === enclosingRangeType.end) {\n            if (forward) {\n                return 'end';\n            } else {\n                return 'start';\n            }\n        } else {\n            return 'middle';\n        }\n    }\n};","'use strict';\n\nvar getRangeLength = require('./getRangeLength');\nvar getOverlapsOfPotentiallyCircularRanges = require('./getOverlapsOfPotentiallyCircularRanges');\nmodule.exports = function getLengthOfOverlappingRegionsBetweenTwoRanges(rangeA, rangeB, maxLength) {\n    var overlaps = getOverlapsOfPotentiallyCircularRanges(rangeA, rangeB, maxLength);\n    return overlaps.reduce(function (counter, overlap) {\n        return counter + getRangeLength(overlap, maxLength);\n    }, 0);\n};","\"use strict\";\n\nmodule.exports = function getPositionFromAngle(angle, rangeMax, isInBetweenPositions) {\n    //percent through sequence * rangeMax\n    var unroundedPostion = angle / Math.PI / 2 * rangeMax;\n    //return either the nearest position, or the nearest \"inBetween\" postion\n    return isInBetweenPositions ? Math.round(unroundedPostion) : Math.floor(unroundedPostion);\n};","\"use strict\";\n\nvar getRangeLength = require(\"./getRangeLength\");\n\nmodule.exports = function getRangeAngles(range, rangeMax) {\n  var _getStartEndAndTotalA = getStartEndAndTotalAngle(range, rangeMax),\n      startAngle = _getStartEndAndTotalA.startAngle,\n      totalAngle = _getStartEndAndTotalA.totalAngle,\n      endAngle = _getStartEndAndTotalA.endAngle;\n\n  return {\n    startAngle: startAngle,\n    totalAngle: totalAngle,\n    endAngle: endAngle,\n    centerAngle: startAngle + totalAngle / 2,\n    locationAngles: range.locations && range.locations.map(function (location) {\n      return getRangeAngles(location, rangeMax);\n    })\n  };\n};\n\nfunction getStartEndAndTotalAngle(range, rangeMax) {\n  var rangeLength = getRangeLength({ start: range.start, end: range.end }, rangeMax);\n\n  return {\n    startAngle: 2 * Math.PI * (range.start / rangeMax),\n    totalAngle: rangeLength / rangeMax * Math.PI * 2,\n    endAngle: 2 * Math.PI * (range.end + 1) / rangeMax //use a +1 here because the angle must encompass the end of the annotation\n  };\n}","\"use strict\";\n\nvar getRangeLength = require(\"./getRangeLength\");\nvar normalizePositionByRangeLength = require(\"./normalizePositionByRangeLength\");\n\nmodule.exports = function getMiddleOfRange(range, rangeMax) {\n  var len = getRangeLength({ start: range.start, end: range.end }, rangeMax);\n  return normalizePositionByRangeLength(range.start + Math.floor(len / 2), rangeMax);\n};","\"use strict\";\n\nmodule.exports = function getRangesBetweenTwoRanges(range1, range2) {\n    // {\n    //     start: 85,\n    //     end: 92\n    // }\n\n    // {\n    //     start: 130,\n    //     end: 189\n    // }\n\n    // start1 - end2\n\n    // start2 - end1\n\n    var newRanges = [];\n    if (!(range1.start > -1 && range1.end > -1 && range2.start > -1 && range2.end > -1)) {\n        return newRanges;\n    }\n    return [{\n        start: range1.start,\n        end: range2.end\n    }, {\n        start: range2.start,\n        end: range1.end\n    }];\n};","'use strict';\n\n// var ac = require('ve-api-check');    \nmodule.exports = function getSequenceWithinRange(range, sequence) {\n    // ac.throw([ac.range, ac.oneOfType([ac.array, ac.string])], arguments);\n    if (range.start < 0 || range.end < 0) return '';\n    if (range.start > range.end) {\n        //circular range \n        var subSequence = sequence.slice(range.start, sequence.length);\n        if (typeof subSequence === 'string') {\n            subSequence += sequence.slice(0, range.end + 1);\n        } else {\n            subSequence = subSequence.concat(sequence.slice(0, range.end + 1));\n        }\n        return subSequence;\n    } else {\n        return sequence.slice(range.start, range.end + 1);\n    }\n};","'use strict';\n\nvar getYOffsetForPotentiallyCircularRange = require('./getYOffsetForPotentiallyCircularRange');\nmodule.exports = function getYOffsetsForPotentiallyCircularRanges(ranges, assignYOffsetToRange) {\n    //adjust the yOffset of the range being pushed in by checking its range against other ranges already in the row\n    var yOffsets = [];\n    var maxYOffset = 0;\n    var yOffsetLevels = []; //yOffsetLevels is an array of arrays (array of yOffset levels holding arrays of ranges)\n    ranges.forEach(function (range) {\n        //loop through y offset levels starting with the 0 level until an empty one is found and push the range into it. If none are found, add another level.\n        var yOffset = getYOffsetForPotentiallyCircularRange(range, yOffsetLevels, assignYOffsetToRange);\n        yOffsets.push(yOffset);\n        if (yOffset > maxYOffset) {\n            maxYOffset = yOffset;\n        }\n        range.yOffset = yOffset;\n        if (!yOffsetLevels[yOffset]) yOffsetLevels[yOffset] = [];\n        yOffsetLevels[yOffset].push(range);\n    });\n    return { yOffsets: yOffsets, maxYOffset: maxYOffset };\n};","'use strict';\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\nvar provideInclusiveOptions = require('./provideInclusiveOptions');\nmodule.exports = provideInclusiveOptions(invertRange);\nfunction invertRange(rangeOrCaret, rangeMax) {\n\tif (rangeOrCaret.start > -1) {\n\t\tvar start = rangeOrCaret.end + 1;\n\t\tvar end = rangeOrCaret.start - 1;\n\t\treturn {\n\t\t\tstart: normalizePositionByRangeLength(start, rangeMax, false),\n\t\t\tend: normalizePositionByRangeLength(end, rangeMax, false)\n\t\t};\n\t} else {\n\t\tif (rangeOrCaret > -1) {\n\t\t\treturn {\n\t\t\t\tstart: normalizePositionByRangeLength(rangeOrCaret, rangeMax, false),\n\t\t\t\tend: normalizePositionByRangeLength(rangeOrCaret - 1, rangeMax, false)\n\t\t\t};\n\t\t}\n\t}\n}","'use strict';\n\n//function to calculate whether a position is closer to the range start than the range end\nvar getShortestDistanceBetweenTwoPositions = require('./getShortestDistanceBetweenTwoPositions');\nmodule.exports = function isPositionCloserToRangeStartThanRangeEnd(position, range, maxLength) {\n    var distanceFromStart = getShortestDistanceBetweenTwoPositions(range.start, position, maxLength);\n    var distanceFromEnd = getShortestDistanceBetweenTwoPositions(range.end, position, maxLength);\n    return distanceFromStart <= distanceFromEnd;\n};","'use strict';\n\nvar getEachPositionInRangeAsArray = require('./getEachPositionInRangeAsArray');\nmodule.exports = function loopEachPositionInRange(range, rangeMax, func) {\n    getEachPositionInRangeAsArray(range, rangeMax).map(func);\n};","'use strict';\n\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\nvar provideInclusiveOptions = require('./provideInclusiveOptions');\n\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nmodule.exports = provideInclusiveOptions(modulateRangeBySequenceLength);\n\nfunction modulateRangeBySequenceLength(range, seqLen) {\n    return assign(range, {\n        start: normalizePositionByRangeLength(range.start, seqLen),\n        end: normalizePositionByRangeLength(range.end, seqLen)\n    });\n}","'use strict';\n\nvar modulatePositionByRange = require('./modulatePositionByRange');\nmodule.exports = function normalizePositionByRangeLength1Based(position, sequenceLength) {\n  return modulatePositionByRange(position, { start: 1, end: sequenceLength });\n};","\"use strict\";\n\n// var ac = require('ve-api-check');\nmodule.exports = function reversePositionInRange(position, rangeLength, isInBetweenPositions) {\n    //isInBetweenPositions refers to:\n    // A T G C\n    // 0 1 2 3    <--  isInBetweenPositions = false is counting the positions themselves\n    //0 1 2 3 4   <--  isInBetweenPositions = true is counting the spaces between positions\n    // ac.throw([\n    //     ac.posInt,\n    //     ac.posInt,\n    //     ac.bool\n    // ], arguments);\n    return rangeLength - position - (isInBetweenPositions ? 0 : 1);\n};","\"use strict\";\n\n// var ac = require('ve-api-check');    \n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nmodule.exports = function trimNumberToFitWithin0ToAnotherNumber(numberToBeTrimmed, max) {\n    // ac.throw([ac.number, ac.number], arguments);\n    if (numberToBeTrimmed < 0) {\n        numberToBeTrimmed = 0;\n    }\n    if (numberToBeTrimmed > max) {\n        numberToBeTrimmed = max;\n    }\n    return numberToBeTrimmed;\n};","\"use strict\";\n\n// const ac = require('ve-api-check');\nvar _require = require(\"lodash\"),\n    assign = _require.assign;\n\nvar _require2 = require('lodash'),\n    identity = _require2.identity;\n\nmodule.exports = function adjustRangeToRotation(rangeToBeAdjusted) {\n  var rotateTo = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var rangeLength = arguments[2];\n\n  // ac.throw([ac.range, ac.posInt, ac.posInt], arguments);\n  var mod = rangeLength ? modulo : identity;\n\n  var newRange = assign({}, rangeToBeAdjusted, {\n    start: mod(rangeToBeAdjusted.start - (rotateTo || 0), rangeLength),\n    end: mod(rangeToBeAdjusted.end - (rotateTo || 0), rangeLength)\n  });\n\n  return newRange;\n};\n\nfunction modulo(n, m) {\n  return (n % m + m) % m;\n}","'use strict';\n\nvar getOverlapsOfPotentiallyCircularRanges = require('./getOverlapsOfPotentiallyCircularRanges');\nvar collapseOverlapsGeneratedFromRangeComparisonIfPossible = require('./collapseOverlapsGeneratedFromRangeComparisonIfPossible');\nvar zeroSubrangeByContainerRange = require('./zeroSubrangeByContainerRange');\nvar normalizePositionByRangeLength = require('./normalizePositionByRangeLength');\n\n//gets the overlapping sections of two ranges and zeroes them to their first point of intersection!\nmodule.exports = function getZeroedRangeOverlaps(annotation, selection, sequenceLength) {\n  var overlaps = collapseOverlapsGeneratedFromRangeComparisonIfPossible(getOverlapsOfPotentiallyCircularRanges(annotation, selection, sequenceLength), sequenceLength, annotation);\n  var zeroedOverlaps = overlaps.map(function (overlap) {\n    return zeroSubrangeByContainerRange(overlap, {\n      start: selection.start,\n      end: normalizePositionByRangeLength(selection.start - 1, sequenceLength)\n    }, sequenceLength);\n  });\n  return zeroedOverlaps;\n};","(function (global, factory) {\n\ttypeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('./empty')) :\n\ttypeof define === 'function' && define.amd ? define(['exports', './empty'], factory) :\n\t(factory((global.jsondiffpatch = {}),global.chalk));\n}(this, (function (exports,chalk) { 'use strict';\n\nchalk = chalk && chalk.hasOwnProperty('default') ? chalk['default'] : chalk;\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) {\n  return typeof obj;\n} : function (obj) {\n  return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n};\n\n\n\n\n\n\n\n\n\n\n\nvar classCallCheck = function (instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n};\n\nvar createClass = function () {\n  function defineProperties(target, props) {\n    for (var i = 0; i < props.length; i++) {\n      var descriptor = props[i];\n      descriptor.enumerable = descriptor.enumerable || false;\n      descriptor.configurable = true;\n      if (\"value\" in descriptor) descriptor.writable = true;\n      Object.defineProperty(target, descriptor.key, descriptor);\n    }\n  }\n\n  return function (Constructor, protoProps, staticProps) {\n    if (protoProps) defineProperties(Constructor.prototype, protoProps);\n    if (staticProps) defineProperties(Constructor, staticProps);\n    return Constructor;\n  };\n}();\n\n\n\n\n\n\n\nvar get = function get(object, property, receiver) {\n  if (object === null) object = Function.prototype;\n  var desc = Object.getOwnPropertyDescriptor(object, property);\n\n  if (desc === undefined) {\n    var parent = Object.getPrototypeOf(object);\n\n    if (parent === null) {\n      return undefined;\n    } else {\n      return get(parent, property, receiver);\n    }\n  } else if (\"value\" in desc) {\n    return desc.value;\n  } else {\n    var getter = desc.get;\n\n    if (getter === undefined) {\n      return undefined;\n    }\n\n    return getter.call(receiver);\n  }\n};\n\nvar inherits = function (subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass);\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      enumerable: false,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass;\n};\n\n\n\n\n\n\n\n\n\n\n\nvar possibleConstructorReturn = function (self, call) {\n  if (!self) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self;\n};\n\n\n\n\n\nvar slicedToArray = function () {\n  function sliceIterator(arr, i) {\n    var _arr = [];\n    var _n = true;\n    var _d = false;\n    var _e = undefined;\n\n    try {\n      for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n        _arr.push(_s.value);\n\n        if (i && _arr.length === i) break;\n      }\n    } catch (err) {\n      _d = true;\n      _e = err;\n    } finally {\n      try {\n        if (!_n && _i[\"return\"]) _i[\"return\"]();\n      } finally {\n        if (_d) throw _e;\n      }\n    }\n\n    return _arr;\n  }\n\n  return function (arr, i) {\n    if (Array.isArray(arr)) {\n      return arr;\n    } else if (Symbol.iterator in Object(arr)) {\n      return sliceIterator(arr, i);\n    } else {\n      throw new TypeError(\"Invalid attempt to destructure non-iterable instance\");\n    }\n  };\n}();\n\n\n\n\n\n\n\n\n\n\n\n\n\nvar toConsumableArray = function (arr) {\n  if (Array.isArray(arr)) {\n    for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) arr2[i] = arr[i];\n\n    return arr2;\n  } else {\n    return Array.from(arr);\n  }\n};\n\nvar Processor = function () {\n  function Processor(options) {\n    classCallCheck(this, Processor);\n\n    this.selfOptions = options || {};\n    this.pipes = {};\n  }\n\n  createClass(Processor, [{\n    key: 'options',\n    value: function options(_options) {\n      if (_options) {\n        this.selfOptions = _options;\n      }\n      return this.selfOptions;\n    }\n  }, {\n    key: 'pipe',\n    value: function pipe(name, pipeArg) {\n      var pipe = pipeArg;\n      if (typeof name === 'string') {\n        if (typeof pipe === 'undefined') {\n          return this.pipes[name];\n        } else {\n          this.pipes[name] = pipe;\n        }\n      }\n      if (name && name.name) {\n        pipe = name;\n        if (pipe.processor === this) {\n          return pipe;\n        }\n        this.pipes[pipe.name] = pipe;\n      }\n      pipe.processor = this;\n      return pipe;\n    }\n  }, {\n    key: 'process',\n    value: function process(input, pipe) {\n      var context = input;\n      context.options = this.options();\n      var nextPipe = pipe || input.pipe || 'default';\n      var lastPipe = void 0;\n      var lastContext = void 0;\n      while (nextPipe) {\n        if (typeof context.nextAfterChildren !== 'undefined') {\n          // children processed and coming back to parent\n          context.next = context.nextAfterChildren;\n          context.nextAfterChildren = null;\n        }\n\n        if (typeof nextPipe === 'string') {\n          nextPipe = this.pipe(nextPipe);\n        }\n        nextPipe.process(context);\n        lastContext = context;\n        lastPipe = nextPipe;\n        nextPipe = null;\n        if (context) {\n          if (context.next) {\n            context = context.next;\n            nextPipe = lastContext.nextPipe || context.pipe || lastPipe;\n          }\n        }\n      }\n      return context.hasResult ? context.result : undefined;\n    }\n  }]);\n  return Processor;\n}();\n\nvar Pipe = function () {\n  function Pipe(name) {\n    classCallCheck(this, Pipe);\n\n    this.name = name;\n    this.filters = [];\n  }\n\n  createClass(Pipe, [{\n    key: 'process',\n    value: function process(input) {\n      if (!this.processor) {\n        throw new Error('add this pipe to a processor before using it');\n      }\n      var debug = this.debug;\n      var length = this.filters.length;\n      var context = input;\n      for (var index = 0; index < length; index++) {\n        var filter = this.filters[index];\n        if (debug) {\n          this.log('filter: ' + filter.filterName);\n        }\n        filter(context);\n        if ((typeof context === 'undefined' ? 'undefined' : _typeof(context)) === 'object' && context.exiting) {\n          context.exiting = false;\n          break;\n        }\n      }\n      if (!context.next && this.resultCheck) {\n        this.resultCheck(context);\n      }\n    }\n  }, {\n    key: 'log',\n    value: function log(msg) {\n      console.log('[jsondiffpatch] ' + this.name + ' pipe, ' + msg);\n    }\n  }, {\n    key: 'append',\n    value: function append() {\n      var _filters;\n\n      (_filters = this.filters).push.apply(_filters, arguments);\n      return this;\n    }\n  }, {\n    key: 'prepend',\n    value: function prepend() {\n      var _filters2;\n\n      (_filters2 = this.filters).unshift.apply(_filters2, arguments);\n      return this;\n    }\n  }, {\n    key: 'indexOf',\n    value: function indexOf(filterName) {\n      if (!filterName) {\n        throw new Error('a filter name is required');\n      }\n      for (var index = 0; index < this.filters.length; index++) {\n        var filter = this.filters[index];\n        if (filter.filterName === filterName) {\n          return index;\n        }\n      }\n      throw new Error('filter not found: ' + filterName);\n    }\n  }, {\n    key: 'list',\n    value: function list() {\n      return this.filters.map(function (f) {\n        return f.filterName;\n      });\n    }\n  }, {\n    key: 'after',\n    value: function after(filterName) {\n      var index = this.indexOf(filterName);\n      var params = Array.prototype.slice.call(arguments, 1);\n      if (!params.length) {\n        throw new Error('a filter is required');\n      }\n      params.unshift(index + 1, 0);\n      Array.prototype.splice.apply(this.filters, params);\n      return this;\n    }\n  }, {\n    key: 'before',\n    value: function before(filterName) {\n      var index = this.indexOf(filterName);\n      var params = Array.prototype.slice.call(arguments, 1);\n      if (!params.length) {\n        throw new Error('a filter is required');\n      }\n      params.unshift(index, 0);\n      Array.prototype.splice.apply(this.filters, params);\n      return this;\n    }\n  }, {\n    key: 'replace',\n    value: function replace(filterName) {\n      var index = this.indexOf(filterName);\n      var params = Array.prototype.slice.call(arguments, 1);\n      if (!params.length) {\n        throw new Error('a filter is required');\n      }\n      params.unshift(index, 1);\n      Array.prototype.splice.apply(this.filters, params);\n      return this;\n    }\n  }, {\n    key: 'remove',\n    value: function remove(filterName) {\n      var index = this.indexOf(filterName);\n      this.filters.splice(index, 1);\n      return this;\n    }\n  }, {\n    key: 'clear',\n    value: function clear() {\n      this.filters.length = 0;\n      return this;\n    }\n  }, {\n    key: 'shouldHaveResult',\n    value: function shouldHaveResult(should) {\n      if (should === false) {\n        this.resultCheck = null;\n        return;\n      }\n      if (this.resultCheck) {\n        return;\n      }\n      var pipe = this;\n      this.resultCheck = function (context) {\n        if (!context.hasResult) {\n          console.log(context);\n          var error = new Error(pipe.name + ' failed');\n          error.noResult = true;\n          throw error;\n        }\n      };\n      return this;\n    }\n  }]);\n  return Pipe;\n}();\n\nvar Context = function () {\n  function Context() {\n    classCallCheck(this, Context);\n  }\n\n  createClass(Context, [{\n    key: 'setResult',\n    value: function setResult(result) {\n      this.result = result;\n      this.hasResult = true;\n      return this;\n    }\n  }, {\n    key: 'exit',\n    value: function exit() {\n      this.exiting = true;\n      return this;\n    }\n  }, {\n    key: 'switchTo',\n    value: function switchTo(next, pipe) {\n      if (typeof next === 'string' || next instanceof Pipe) {\n        this.nextPipe = next;\n      } else {\n        this.next = next;\n        if (pipe) {\n          this.nextPipe = pipe;\n        }\n      }\n      return this;\n    }\n  }, {\n    key: 'push',\n    value: function push(child, name) {\n      child.parent = this;\n      if (typeof name !== 'undefined') {\n        child.childName = name;\n      }\n      child.root = this.root || this;\n      child.options = child.options || this.options;\n      if (!this.children) {\n        this.children = [child];\n        this.nextAfterChildren = this.next || null;\n        this.next = child;\n      } else {\n        this.children[this.children.length - 1].next = child;\n        this.children.push(child);\n      }\n      child.next = this;\n      return this;\n    }\n  }]);\n  return Context;\n}();\n\nvar isArray = typeof Array.isArray === 'function' ? Array.isArray : function (a) {\n  return a instanceof Array;\n};\n\nfunction cloneRegExp(re) {\n  var regexMatch = /^\\/(.*)\\/([gimyu]*)$/.exec(re.toString());\n  return new RegExp(regexMatch[1], regexMatch[2]);\n}\n\nfunction clone(arg) {\n  if ((typeof arg === 'undefined' ? 'undefined' : _typeof(arg)) !== 'object') {\n    return arg;\n  }\n  if (arg === null) {\n    return null;\n  }\n  if (isArray(arg)) {\n    return arg.map(clone);\n  }\n  if (arg instanceof Date) {\n    return new Date(arg.getTime());\n  }\n  if (arg instanceof RegExp) {\n    return cloneRegExp(arg);\n  }\n  var cloned = {};\n  for (var name in arg) {\n    if (Object.prototype.hasOwnProperty.call(arg, name)) {\n      cloned[name] = clone(arg[name]);\n    }\n  }\n  return cloned;\n}\n\nvar DiffContext = function (_Context) {\n  inherits(DiffContext, _Context);\n\n  function DiffContext(left, right) {\n    classCallCheck(this, DiffContext);\n\n    var _this = possibleConstructorReturn(this, (DiffContext.__proto__ || Object.getPrototypeOf(DiffContext)).call(this));\n\n    _this.left = left;\n    _this.right = right;\n    _this.pipe = 'diff';\n    return _this;\n  }\n\n  createClass(DiffContext, [{\n    key: 'setResult',\n    value: function setResult(result) {\n      if (this.options.cloneDiffValues && (typeof result === 'undefined' ? 'undefined' : _typeof(result)) === 'object') {\n        var clone$$1 = typeof this.options.cloneDiffValues === 'function' ? this.options.cloneDiffValues : clone;\n        if (_typeof(result[0]) === 'object') {\n          result[0] = clone$$1(result[0]);\n        }\n        if (_typeof(result[1]) === 'object') {\n          result[1] = clone$$1(result[1]);\n        }\n      }\n      return Context.prototype.setResult.apply(this, arguments);\n    }\n  }]);\n  return DiffContext;\n}(Context);\n\nvar PatchContext = function (_Context) {\n  inherits(PatchContext, _Context);\n\n  function PatchContext(left, delta) {\n    classCallCheck(this, PatchContext);\n\n    var _this = possibleConstructorReturn(this, (PatchContext.__proto__ || Object.getPrototypeOf(PatchContext)).call(this));\n\n    _this.left = left;\n    _this.delta = delta;\n    _this.pipe = 'patch';\n    return _this;\n  }\n\n  return PatchContext;\n}(Context);\n\nvar ReverseContext = function (_Context) {\n  inherits(ReverseContext, _Context);\n\n  function ReverseContext(delta) {\n    classCallCheck(this, ReverseContext);\n\n    var _this = possibleConstructorReturn(this, (ReverseContext.__proto__ || Object.getPrototypeOf(ReverseContext)).call(this));\n\n    _this.delta = delta;\n    _this.pipe = 'reverse';\n    return _this;\n  }\n\n  return ReverseContext;\n}(Context);\n\nvar isArray$1 = typeof Array.isArray === 'function' ? Array.isArray : function (a) {\n  return a instanceof Array;\n};\n\nvar diffFilter = function trivialMatchesDiffFilter(context) {\n  if (context.left === context.right) {\n    context.setResult(undefined).exit();\n    return;\n  }\n  if (typeof context.left === 'undefined') {\n    if (typeof context.right === 'function') {\n      throw new Error('functions are not supported');\n    }\n    context.setResult([context.right]).exit();\n    return;\n  }\n  if (typeof context.right === 'undefined') {\n    context.setResult([context.left, 0, 0]).exit();\n    return;\n  }\n  if (typeof context.left === 'function' || typeof context.right === 'function') {\n    throw new Error('functions are not supported');\n  }\n  context.leftType = context.left === null ? 'null' : _typeof(context.left);\n  context.rightType = context.right === null ? 'null' : _typeof(context.right);\n  if (context.leftType !== context.rightType) {\n    context.setResult([context.left, context.right]).exit();\n    return;\n  }\n  if (context.leftType === 'boolean' || context.leftType === 'number') {\n    context.setResult([context.left, context.right]).exit();\n    return;\n  }\n  if (context.leftType === 'object') {\n    context.leftIsArray = isArray$1(context.left);\n  }\n  if (context.rightType === 'object') {\n    context.rightIsArray = isArray$1(context.right);\n  }\n  if (context.leftIsArray !== context.rightIsArray) {\n    context.setResult([context.left, context.right]).exit();\n    return;\n  }\n\n  if (context.left instanceof RegExp) {\n    if (context.right instanceof RegExp) {\n      context.setResult([context.left.toString(), context.right.toString()]).exit();\n    } else {\n      context.setResult([context.left, context.right]).exit();\n    }\n  }\n};\ndiffFilter.filterName = 'trivial';\n\nvar patchFilter = function trivialMatchesPatchFilter(context) {\n  if (typeof context.delta === 'undefined') {\n    context.setResult(context.left).exit();\n    return;\n  }\n  context.nested = !isArray$1(context.delta);\n  if (context.nested) {\n    return;\n  }\n  if (context.delta.length === 1) {\n    context.setResult(context.delta[0]).exit();\n    return;\n  }\n  if (context.delta.length === 2) {\n    if (context.left instanceof RegExp) {\n      var regexArgs = /^\\/(.*)\\/([gimyu]+)$/.exec(context.delta[1]);\n      if (regexArgs) {\n        context.setResult(new RegExp(regexArgs[1], regexArgs[2])).exit();\n        return;\n      }\n    }\n    context.setResult(context.delta[1]).exit();\n    return;\n  }\n  if (context.delta.length === 3 && context.delta[2] === 0) {\n    context.setResult(undefined).exit();\n  }\n};\npatchFilter.filterName = 'trivial';\n\nvar reverseFilter = function trivialReferseFilter(context) {\n  if (typeof context.delta === 'undefined') {\n    context.setResult(context.delta).exit();\n    return;\n  }\n  context.nested = !isArray$1(context.delta);\n  if (context.nested) {\n    return;\n  }\n  if (context.delta.length === 1) {\n    context.setResult([context.delta[0], 0, 0]).exit();\n    return;\n  }\n  if (context.delta.length === 2) {\n    context.setResult([context.delta[1], context.delta[0]]).exit();\n    return;\n  }\n  if (context.delta.length === 3 && context.delta[2] === 0) {\n    context.setResult([context.delta[0]]).exit();\n  }\n};\nreverseFilter.filterName = 'trivial';\n\nfunction collectChildrenDiffFilter(context) {\n  if (!context || !context.children) {\n    return;\n  }\n  var length = context.children.length;\n  var child = void 0;\n  var result = context.result;\n  for (var index = 0; index < length; index++) {\n    child = context.children[index];\n    if (typeof child.result === 'undefined') {\n      continue;\n    }\n    result = result || {};\n    result[child.childName] = child.result;\n  }\n  if (result && context.leftIsArray) {\n    result._t = 'a';\n  }\n  context.setResult(result).exit();\n}\ncollectChildrenDiffFilter.filterName = 'collectChildren';\n\nfunction objectsDiffFilter(context) {\n  if (context.leftIsArray || context.leftType !== 'object') {\n    return;\n  }\n\n  var name = void 0;\n  var child = void 0;\n  var propertyFilter = context.options.propertyFilter;\n  for (name in context.left) {\n    if (!Object.prototype.hasOwnProperty.call(context.left, name)) {\n      continue;\n    }\n    if (propertyFilter && !propertyFilter(name, context)) {\n      continue;\n    }\n    child = new DiffContext(context.left[name], context.right[name]);\n    context.push(child, name);\n  }\n  for (name in context.right) {\n    if (!Object.prototype.hasOwnProperty.call(context.right, name)) {\n      continue;\n    }\n    if (propertyFilter && !propertyFilter(name, context)) {\n      continue;\n    }\n    if (typeof context.left[name] === 'undefined') {\n      child = new DiffContext(undefined, context.right[name]);\n      context.push(child, name);\n    }\n  }\n\n  if (!context.children || context.children.length === 0) {\n    context.setResult(undefined).exit();\n    return;\n  }\n  context.exit();\n}\nobjectsDiffFilter.filterName = 'objects';\n\nvar patchFilter$1 = function nestedPatchFilter(context) {\n  if (!context.nested) {\n    return;\n  }\n  if (context.delta._t) {\n    return;\n  }\n  var name = void 0;\n  var child = void 0;\n  for (name in context.delta) {\n    child = new PatchContext(context.left[name], context.delta[name]);\n    context.push(child, name);\n  }\n  context.exit();\n};\npatchFilter$1.filterName = 'objects';\n\nvar collectChildrenPatchFilter = function collectChildrenPatchFilter(context) {\n  if (!context || !context.children) {\n    return;\n  }\n  if (context.delta._t) {\n    return;\n  }\n  var length = context.children.length;\n  var child = void 0;\n  for (var index = 0; index < length; index++) {\n    child = context.children[index];\n    if (Object.prototype.hasOwnProperty.call(context.left, child.childName) && child.result === undefined) {\n      delete context.left[child.childName];\n    } else if (context.left[child.childName] !== child.result) {\n      context.left[child.childName] = child.result;\n    }\n  }\n  context.setResult(context.left).exit();\n};\ncollectChildrenPatchFilter.filterName = 'collectChildren';\n\nvar reverseFilter$1 = function nestedReverseFilter(context) {\n  if (!context.nested) {\n    return;\n  }\n  if (context.delta._t) {\n    return;\n  }\n  var name = void 0;\n  var child = void 0;\n  for (name in context.delta) {\n    child = new ReverseContext(context.delta[name]);\n    context.push(child, name);\n  }\n  context.exit();\n};\nreverseFilter$1.filterName = 'objects';\n\nfunction collectChildrenReverseFilter(context) {\n  if (!context || !context.children) {\n    return;\n  }\n  if (context.delta._t) {\n    return;\n  }\n  var length = context.children.length;\n  var child = void 0;\n  var delta = {};\n  for (var index = 0; index < length; index++) {\n    child = context.children[index];\n    if (delta[child.childName] !== child.result) {\n      delta[child.childName] = child.result;\n    }\n  }\n  context.setResult(delta).exit();\n}\ncollectChildrenReverseFilter.filterName = 'collectChildren';\n\n/*\n\nLCS implementation that supports arrays or strings\n\nreference: http://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n\n*/\n\nvar defaultMatch = function defaultMatch(array1, array2, index1, index2) {\n  return array1[index1] === array2[index2];\n};\n\nvar lengthMatrix = function lengthMatrix(array1, array2, match, context) {\n  var len1 = array1.length;\n  var len2 = array2.length;\n  var x = void 0,\n      y = void 0;\n\n  // initialize empty matrix of len1+1 x len2+1\n  var matrix = [len1 + 1];\n  for (x = 0; x < len1 + 1; x++) {\n    matrix[x] = [len2 + 1];\n    for (y = 0; y < len2 + 1; y++) {\n      matrix[x][y] = 0;\n    }\n  }\n  matrix.match = match;\n  // save sequence lengths for each coordinate\n  for (x = 1; x < len1 + 1; x++) {\n    for (y = 1; y < len2 + 1; y++) {\n      if (match(array1, array2, x - 1, y - 1, context)) {\n        matrix[x][y] = matrix[x - 1][y - 1] + 1;\n      } else {\n        matrix[x][y] = Math.max(matrix[x - 1][y], matrix[x][y - 1]);\n      }\n    }\n  }\n  return matrix;\n};\n\nvar backtrack = function backtrack(matrix, array1, array2, index1, index2, context) {\n  if (index1 === 0 || index2 === 0) {\n    return {\n      sequence: [],\n      indices1: [],\n      indices2: []\n    };\n  }\n\n  if (matrix.match(array1, array2, index1 - 1, index2 - 1, context)) {\n    var subsequence = backtrack(matrix, array1, array2, index1 - 1, index2 - 1, context);\n    subsequence.sequence.push(array1[index1 - 1]);\n    subsequence.indices1.push(index1 - 1);\n    subsequence.indices2.push(index2 - 1);\n    return subsequence;\n  }\n\n  if (matrix[index1][index2 - 1] > matrix[index1 - 1][index2]) {\n    return backtrack(matrix, array1, array2, index1, index2 - 1, context);\n  } else {\n    return backtrack(matrix, array1, array2, index1 - 1, index2, context);\n  }\n};\n\nvar get$1 = function get(array1, array2, match, context) {\n  var innerContext = context || {};\n  var matrix = lengthMatrix(array1, array2, match || defaultMatch, innerContext);\n  var result = backtrack(matrix, array1, array2, array1.length, array2.length, innerContext);\n  if (typeof array1 === 'string' && typeof array2 === 'string') {\n    result.sequence = result.sequence.join('');\n  }\n  return result;\n};\n\nvar lcs = {\n  get: get$1\n};\n\nvar ARRAY_MOVE = 3;\n\nvar isArray$2 = typeof Array.isArray === 'function' ? Array.isArray : function (a) {\n  return a instanceof Array;\n};\n\nvar arrayIndexOf = typeof Array.prototype.indexOf === 'function' ? function (array, item) {\n  return array.indexOf(item);\n} : function (array, item) {\n  var length = array.length;\n  for (var i = 0; i < length; i++) {\n    if (array[i] === item) {\n      return i;\n    }\n  }\n  return -1;\n};\n\nfunction arraysHaveMatchByRef(array1, array2, len1, len2) {\n  for (var index1 = 0; index1 < len1; index1++) {\n    var val1 = array1[index1];\n    for (var index2 = 0; index2 < len2; index2++) {\n      var val2 = array2[index2];\n      if (index1 !== index2 && val1 === val2) {\n        return true;\n      }\n    }\n  }\n}\n\nfunction matchItems(array1, array2, index1, index2, context) {\n  var value1 = array1[index1];\n  var value2 = array2[index2];\n  if (value1 === value2) {\n    return true;\n  }\n  if ((typeof value1 === 'undefined' ? 'undefined' : _typeof(value1)) !== 'object' || (typeof value2 === 'undefined' ? 'undefined' : _typeof(value2)) !== 'object') {\n    return false;\n  }\n  var objectHash = context.objectHash;\n  if (!objectHash) {\n    // no way to match objects was provided, try match by position\n    return context.matchByPosition && index1 === index2;\n  }\n  var hash1 = void 0;\n  var hash2 = void 0;\n  if (typeof index1 === 'number') {\n    context.hashCache1 = context.hashCache1 || [];\n    hash1 = context.hashCache1[index1];\n    if (typeof hash1 === 'undefined') {\n      context.hashCache1[index1] = hash1 = objectHash(value1, index1);\n    }\n  } else {\n    hash1 = objectHash(value1);\n  }\n  if (typeof hash1 === 'undefined') {\n    return false;\n  }\n  if (typeof index2 === 'number') {\n    context.hashCache2 = context.hashCache2 || [];\n    hash2 = context.hashCache2[index2];\n    if (typeof hash2 === 'undefined') {\n      context.hashCache2[index2] = hash2 = objectHash(value2, index2);\n    }\n  } else {\n    hash2 = objectHash(value2);\n  }\n  if (typeof hash2 === 'undefined') {\n    return false;\n  }\n  return hash1 === hash2;\n}\n\nvar diffFilter$1 = function arraysDiffFilter(context) {\n  if (!context.leftIsArray) {\n    return;\n  }\n\n  var matchContext = {\n    objectHash: context.options && context.options.objectHash,\n    matchByPosition: context.options && context.options.matchByPosition\n  };\n  var commonHead = 0;\n  var commonTail = 0;\n  var index = void 0;\n  var index1 = void 0;\n  var index2 = void 0;\n  var array1 = context.left;\n  var array2 = context.right;\n  var len1 = array1.length;\n  var len2 = array2.length;\n\n  var child = void 0;\n\n  if (len1 > 0 && len2 > 0 && !matchContext.objectHash && typeof matchContext.matchByPosition !== 'boolean') {\n    matchContext.matchByPosition = !arraysHaveMatchByRef(array1, array2, len1, len2);\n  }\n\n  // separate common head\n  while (commonHead < len1 && commonHead < len2 && matchItems(array1, array2, commonHead, commonHead, matchContext)) {\n    index = commonHead;\n    child = new DiffContext(context.left[index], context.right[index]);\n    context.push(child, index);\n    commonHead++;\n  }\n  // separate common tail\n  while (commonTail + commonHead < len1 && commonTail + commonHead < len2 && matchItems(array1, array2, len1 - 1 - commonTail, len2 - 1 - commonTail, matchContext)) {\n    index1 = len1 - 1 - commonTail;\n    index2 = len2 - 1 - commonTail;\n    child = new DiffContext(context.left[index1], context.right[index2]);\n    context.push(child, index2);\n    commonTail++;\n  }\n  var result = void 0;\n  if (commonHead + commonTail === len1) {\n    if (len1 === len2) {\n      // arrays are identical\n      context.setResult(undefined).exit();\n      return;\n    }\n    // trivial case, a block (1 or more consecutive items) was added\n    result = result || {\n      _t: 'a'\n    };\n    for (index = commonHead; index < len2 - commonTail; index++) {\n      result[index] = [array2[index]];\n    }\n    context.setResult(result).exit();\n    return;\n  }\n  if (commonHead + commonTail === len2) {\n    // trivial case, a block (1 or more consecutive items) was removed\n    result = result || {\n      _t: 'a'\n    };\n    for (index = commonHead; index < len1 - commonTail; index++) {\n      result['_' + index] = [array1[index], 0, 0];\n    }\n    context.setResult(result).exit();\n    return;\n  }\n  // reset hash cache\n  delete matchContext.hashCache1;\n  delete matchContext.hashCache2;\n\n  // diff is not trivial, find the LCS (Longest Common Subsequence)\n  var trimmed1 = array1.slice(commonHead, len1 - commonTail);\n  var trimmed2 = array2.slice(commonHead, len2 - commonTail);\n  var seq = lcs.get(trimmed1, trimmed2, matchItems, matchContext);\n  var removedItems = [];\n  result = result || {\n    _t: 'a'\n  };\n  for (index = commonHead; index < len1 - commonTail; index++) {\n    if (arrayIndexOf(seq.indices1, index - commonHead) < 0) {\n      // removed\n      result['_' + index] = [array1[index], 0, 0];\n      removedItems.push(index);\n    }\n  }\n\n  var detectMove = true;\n  if (context.options && context.options.arrays && context.options.arrays.detectMove === false) {\n    detectMove = false;\n  }\n  var includeValueOnMove = false;\n  if (context.options && context.options.arrays && context.options.arrays.includeValueOnMove) {\n    includeValueOnMove = true;\n  }\n\n  var removedItemsLength = removedItems.length;\n  for (index = commonHead; index < len2 - commonTail; index++) {\n    var indexOnArray2 = arrayIndexOf(seq.indices2, index - commonHead);\n    if (indexOnArray2 < 0) {\n      // added, try to match with a removed item and register as position move\n      var isMove = false;\n      if (detectMove && removedItemsLength > 0) {\n        for (var removeItemIndex1 = 0; removeItemIndex1 < removedItemsLength; removeItemIndex1++) {\n          index1 = removedItems[removeItemIndex1];\n          if (matchItems(trimmed1, trimmed2, index1 - commonHead, index - commonHead, matchContext)) {\n            // store position move as: [originalValue, newPosition, ARRAY_MOVE]\n            result['_' + index1].splice(1, 2, index, ARRAY_MOVE);\n            if (!includeValueOnMove) {\n              // don't include moved value on diff, to save bytes\n              result['_' + index1][0] = '';\n            }\n\n            index2 = index;\n            child = new DiffContext(context.left[index1], context.right[index2]);\n            context.push(child, index2);\n            removedItems.splice(removeItemIndex1, 1);\n            isMove = true;\n            break;\n          }\n        }\n      }\n      if (!isMove) {\n        // added\n        result[index] = [array2[index]];\n      }\n    } else {\n      // match, do inner diff\n      index1 = seq.indices1[indexOnArray2] + commonHead;\n      index2 = seq.indices2[indexOnArray2] + commonHead;\n      child = new DiffContext(context.left[index1], context.right[index2]);\n      context.push(child, index2);\n    }\n  }\n\n  context.setResult(result).exit();\n};\ndiffFilter$1.filterName = 'arrays';\n\nvar compare = {\n  numerically: function numerically(a, b) {\n    return a - b;\n  },\n  numericallyBy: function numericallyBy(name) {\n    return function (a, b) {\n      return a[name] - b[name];\n    };\n  }\n};\n\nvar patchFilter$2 = function nestedPatchFilter(context) {\n  if (!context.nested) {\n    return;\n  }\n  if (context.delta._t !== 'a') {\n    return;\n  }\n  var index = void 0;\n  var index1 = void 0;\n\n  var delta = context.delta;\n  var array = context.left;\n\n  // first, separate removals, insertions and modifications\n  var toRemove = [];\n  var toInsert = [];\n  var toModify = [];\n  for (index in delta) {\n    if (index !== '_t') {\n      if (index[0] === '_') {\n        // removed item from original array\n        if (delta[index][2] === 0 || delta[index][2] === ARRAY_MOVE) {\n          toRemove.push(parseInt(index.slice(1), 10));\n        } else {\n          throw new Error('only removal or move can be applied at original array indices,' + (' invalid diff type: ' + delta[index][2]));\n        }\n      } else {\n        if (delta[index].length === 1) {\n          // added item at new array\n          toInsert.push({\n            index: parseInt(index, 10),\n            value: delta[index][0]\n          });\n        } else {\n          // modified item at new array\n          toModify.push({\n            index: parseInt(index, 10),\n            delta: delta[index]\n          });\n        }\n      }\n    }\n  }\n\n  // remove items, in reverse order to avoid sawing our own floor\n  toRemove = toRemove.sort(compare.numerically);\n  for (index = toRemove.length - 1; index >= 0; index--) {\n    index1 = toRemove[index];\n    var indexDiff = delta['_' + index1];\n    var removedValue = array.splice(index1, 1)[0];\n    if (indexDiff[2] === ARRAY_MOVE) {\n      // reinsert later\n      toInsert.push({\n        index: indexDiff[1],\n        value: removedValue\n      });\n    }\n  }\n\n  // insert items, in reverse order to avoid moving our own floor\n  toInsert = toInsert.sort(compare.numericallyBy('index'));\n  var toInsertLength = toInsert.length;\n  for (index = 0; index < toInsertLength; index++) {\n    var insertion = toInsert[index];\n    array.splice(insertion.index, 0, insertion.value);\n  }\n\n  // apply modifications\n  var toModifyLength = toModify.length;\n  var child = void 0;\n  if (toModifyLength > 0) {\n    for (index = 0; index < toModifyLength; index++) {\n      var modification = toModify[index];\n      child = new PatchContext(context.left[modification.index], modification.delta);\n      context.push(child, modification.index);\n    }\n  }\n\n  if (!context.children) {\n    context.setResult(context.left).exit();\n    return;\n  }\n  context.exit();\n};\npatchFilter$2.filterName = 'arrays';\n\nvar collectChildrenPatchFilter$1 = function collectChildrenPatchFilter(context) {\n  if (!context || !context.children) {\n    return;\n  }\n  if (context.delta._t !== 'a') {\n    return;\n  }\n  var length = context.children.length;\n  var child = void 0;\n  for (var index = 0; index < length; index++) {\n    child = context.children[index];\n    context.left[child.childName] = child.result;\n  }\n  context.setResult(context.left).exit();\n};\ncollectChildrenPatchFilter$1.filterName = 'arraysCollectChildren';\n\nvar reverseFilter$2 = function arraysReverseFilter(context) {\n  if (!context.nested) {\n    if (context.delta[2] === ARRAY_MOVE) {\n      context.newName = '_' + context.delta[1];\n      context.setResult([context.delta[0], parseInt(context.childName.substr(1), 10), ARRAY_MOVE]).exit();\n    }\n    return;\n  }\n  if (context.delta._t !== 'a') {\n    return;\n  }\n  var name = void 0;\n  var child = void 0;\n  for (name in context.delta) {\n    if (name === '_t') {\n      continue;\n    }\n    child = new ReverseContext(context.delta[name]);\n    context.push(child, name);\n  }\n  context.exit();\n};\nreverseFilter$2.filterName = 'arrays';\n\nvar reverseArrayDeltaIndex = function reverseArrayDeltaIndex(delta, index, itemDelta) {\n  if (typeof index === 'string' && index[0] === '_') {\n    return parseInt(index.substr(1), 10);\n  } else if (isArray$2(itemDelta) && itemDelta[2] === 0) {\n    return '_' + index;\n  }\n\n  var reverseIndex = +index;\n  for (var deltaIndex in delta) {\n    var deltaItem = delta[deltaIndex];\n    if (isArray$2(deltaItem)) {\n      if (deltaItem[2] === ARRAY_MOVE) {\n        var moveFromIndex = parseInt(deltaIndex.substr(1), 10);\n        var moveToIndex = deltaItem[1];\n        if (moveToIndex === +index) {\n          return moveFromIndex;\n        }\n        if (moveFromIndex <= reverseIndex && moveToIndex > reverseIndex) {\n          reverseIndex++;\n        } else if (moveFromIndex >= reverseIndex && moveToIndex < reverseIndex) {\n          reverseIndex--;\n        }\n      } else if (deltaItem[2] === 0) {\n        var deleteIndex = parseInt(deltaIndex.substr(1), 10);\n        if (deleteIndex <= reverseIndex) {\n          reverseIndex++;\n        }\n      } else if (deltaItem.length === 1 && deltaIndex <= reverseIndex) {\n        reverseIndex--;\n      }\n    }\n  }\n\n  return reverseIndex;\n};\n\nfunction collectChildrenReverseFilter$1(context) {\n  if (!context || !context.children) {\n    return;\n  }\n  if (context.delta._t !== 'a') {\n    return;\n  }\n  var length = context.children.length;\n  var child = void 0;\n  var delta = {\n    _t: 'a'\n  };\n\n  for (var index = 0; index < length; index++) {\n    child = context.children[index];\n    var name = child.newName;\n    if (typeof name === 'undefined') {\n      name = reverseArrayDeltaIndex(context.delta, child.childName, child.result);\n    }\n    if (delta[name] !== child.result) {\n      delta[name] = child.result;\n    }\n  }\n  context.setResult(delta).exit();\n}\ncollectChildrenReverseFilter$1.filterName = 'arraysCollectChildren';\n\nvar diffFilter$2 = function datesDiffFilter(context) {\n  if (context.left instanceof Date) {\n    if (context.right instanceof Date) {\n      if (context.left.getTime() !== context.right.getTime()) {\n        context.setResult([context.left, context.right]);\n      } else {\n        context.setResult(undefined);\n      }\n    } else {\n      context.setResult([context.left, context.right]);\n    }\n    context.exit();\n  } else if (context.right instanceof Date) {\n    context.setResult([context.left, context.right]).exit();\n  }\n};\ndiffFilter$2.filterName = 'dates';\n\nfunction createCommonjsModule(fn, module) {\n\treturn module = { exports: {} }, fn(module, module.exports), module.exports;\n}\n\nvar diffMatchPatch = createCommonjsModule(function (module) {\nfunction diff_match_patch() {\r\n\r\n  // Defaults.\r\n  // Redefine these in your program to override the defaults.\r\n\r\n  // Number of seconds to map a diff before giving up (0 for infinity).\r\n  this.Diff_Timeout = 1.0;\r\n  // Cost of an empty edit operation in terms of edit characters.\r\n  this.Diff_EditCost = 4;\r\n  // At what point is no match declared (0.0 = perfection, 1.0 = very loose).\r\n  this.Match_Threshold = 0.5;\r\n  // How far to search for a match (0 = exact location, 1000+ = broad match).\r\n  // A match this many characters away from the expected location will add\r\n  // 1.0 to the score (0.0 is a perfect match).\r\n  this.Match_Distance = 1000;\r\n  // When deleting a large block of text (over ~64 characters), how close do\r\n  // the contents have to be to match the expected contents. (0.0 = perfection,\r\n  // 1.0 = very loose).  Note that Match_Threshold controls how closely the\r\n  // end points of a delete need to match.\r\n  this.Patch_DeleteThreshold = 0.5;\r\n  // Chunk size for context length.\r\n  this.Patch_Margin = 4;\r\n\r\n  // The number of bits in an int.\r\n  this.Match_MaxBits = 32;\r\n}\r\n\r\n\r\n//  DIFF FUNCTIONS\r\n\r\n\r\n/**\r\n * The data structure representing a diff is an array of tuples:\r\n * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]\r\n * which means: delete 'Hello', add 'Goodbye' and keep ' world.'\r\n */\r\nvar DIFF_DELETE = -1;\r\nvar DIFF_INSERT = 1;\r\nvar DIFF_EQUAL = 0;\r\n\r\n/** @typedef {{0: number, 1: string}} */\r\ndiff_match_patch.prototype.diff_main = function(text1, text2, opt_checklines,\r\n    opt_deadline) {\r\n  // Set a deadline by which time the diff must be complete.\r\n  if (typeof opt_deadline == 'undefined') {\r\n    if (this.Diff_Timeout <= 0) {\r\n      opt_deadline = Number.MAX_VALUE;\r\n    } else {\r\n      opt_deadline = (new Date).getTime() + this.Diff_Timeout * 1000;\r\n    }\r\n  }\r\n  var deadline = opt_deadline;\r\n\r\n  // Check for null inputs.\r\n  if (text1 == null || text2 == null) {\r\n    throw new Error('Null input. (diff_main)');\r\n  }\r\n\r\n  // Check for equality (speedup).\r\n  if (text1 == text2) {\r\n    if (text1) {\r\n      return [[DIFF_EQUAL, text1]];\r\n    }\r\n    return [];\r\n  }\r\n\r\n  if (typeof opt_checklines == 'undefined') {\r\n    opt_checklines = true;\r\n  }\r\n  var checklines = opt_checklines;\r\n\r\n  // Trim off common prefix (speedup).\r\n  var commonlength = this.diff_commonPrefix(text1, text2);\r\n  var commonprefix = text1.substring(0, commonlength);\r\n  text1 = text1.substring(commonlength);\r\n  text2 = text2.substring(commonlength);\r\n\r\n  // Trim off common suffix (speedup).\r\n  commonlength = this.diff_commonSuffix(text1, text2);\r\n  var commonsuffix = text1.substring(text1.length - commonlength);\r\n  text1 = text1.substring(0, text1.length - commonlength);\r\n  text2 = text2.substring(0, text2.length - commonlength);\r\n\r\n  // Compute the diff on the middle block.\r\n  var diffs = this.diff_compute_(text1, text2, checklines, deadline);\r\n\r\n  // Restore the prefix and suffix.\r\n  if (commonprefix) {\r\n    diffs.unshift([DIFF_EQUAL, commonprefix]);\r\n  }\r\n  if (commonsuffix) {\r\n    diffs.push([DIFF_EQUAL, commonsuffix]);\r\n  }\r\n  this.diff_cleanupMerge(diffs);\r\n  return diffs;\r\n};\r\n\r\n\r\n/**\r\n * Find the differences between two texts.  Assumes that the texts do not\r\n * have any common prefix or suffix.\r\n * @param {string} text1 Old string to be diffed.\r\n * @param {string} text2 New string to be diffed.\r\n * @param {boolean} checklines Speedup flag.  If false, then don't run a\r\n *     line-level diff first to identify the changed areas.\r\n *     If true, then run a faster, slightly less optimal diff.\r\n * @param {number} deadline Time when the diff should be complete by.\r\n * @return {!Array.<!diff_match_patch.Diff>} Array of diff tuples.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_compute_ = function(text1, text2, checklines,\r\n    deadline) {\r\n  var diffs;\r\n\r\n  if (!text1) {\r\n    // Just add some text (speedup).\r\n    return [[DIFF_INSERT, text2]];\r\n  }\r\n\r\n  if (!text2) {\r\n    // Just delete some text (speedup).\r\n    return [[DIFF_DELETE, text1]];\r\n  }\r\n\r\n  var longtext = text1.length > text2.length ? text1 : text2;\r\n  var shorttext = text1.length > text2.length ? text2 : text1;\r\n  var i = longtext.indexOf(shorttext);\r\n  if (i != -1) {\r\n    // Shorter text is inside the longer text (speedup).\r\n    diffs = [[DIFF_INSERT, longtext.substring(0, i)],\r\n             [DIFF_EQUAL, shorttext],\r\n             [DIFF_INSERT, longtext.substring(i + shorttext.length)]];\r\n    // Swap insertions for deletions if diff is reversed.\r\n    if (text1.length > text2.length) {\r\n      diffs[0][0] = diffs[2][0] = DIFF_DELETE;\r\n    }\r\n    return diffs;\r\n  }\r\n\r\n  if (shorttext.length == 1) {\r\n    // Single character string.\r\n    // After the previous speedup, the character can't be an equality.\r\n    return [[DIFF_DELETE, text1], [DIFF_INSERT, text2]];\r\n  }\r\n\r\n  // Check to see if the problem can be split in two.\r\n  var hm = this.diff_halfMatch_(text1, text2);\r\n  if (hm) {\r\n    // A half-match was found, sort out the return data.\r\n    var text1_a = hm[0];\r\n    var text1_b = hm[1];\r\n    var text2_a = hm[2];\r\n    var text2_b = hm[3];\r\n    var mid_common = hm[4];\r\n    // Send both pairs off for separate processing.\r\n    var diffs_a = this.diff_main(text1_a, text2_a, checklines, deadline);\r\n    var diffs_b = this.diff_main(text1_b, text2_b, checklines, deadline);\r\n    // Merge the results.\r\n    return diffs_a.concat([[DIFF_EQUAL, mid_common]], diffs_b);\r\n  }\r\n\r\n  if (checklines && text1.length > 100 && text2.length > 100) {\r\n    return this.diff_lineMode_(text1, text2, deadline);\r\n  }\r\n\r\n  return this.diff_bisect_(text1, text2, deadline);\r\n};\r\n\r\n\r\n/**\r\n * Do a quick line-level diff on both strings, then rediff the parts for\r\n * greater accuracy.\r\n * This speedup can produce non-minimal diffs.\r\n * @param {string} text1 Old string to be diffed.\r\n * @param {string} text2 New string to be diffed.\r\n * @param {number} deadline Time when the diff should be complete by.\r\n * @return {!Array.<!diff_match_patch.Diff>} Array of diff tuples.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_lineMode_ = function(text1, text2, deadline) {\r\n  // Scan the text on a line-by-line basis first.\r\n  var a = this.diff_linesToChars_(text1, text2);\r\n  text1 = a.chars1;\r\n  text2 = a.chars2;\r\n  var linearray = a.lineArray;\r\n\r\n  var diffs = this.diff_main(text1, text2, false, deadline);\r\n\r\n  // Convert the diff back to original text.\r\n  this.diff_charsToLines_(diffs, linearray);\r\n  // Eliminate freak matches (e.g. blank lines)\r\n  this.diff_cleanupSemantic(diffs);\r\n\r\n  // Rediff any replacement blocks, this time character-by-character.\r\n  // Add a dummy entry at the end.\r\n  diffs.push([DIFF_EQUAL, '']);\r\n  var pointer = 0;\r\n  var count_delete = 0;\r\n  var count_insert = 0;\r\n  var text_delete = '';\r\n  var text_insert = '';\r\n  while (pointer < diffs.length) {\r\n    switch (diffs[pointer][0]) {\r\n      case DIFF_INSERT:\r\n        count_insert++;\r\n        text_insert += diffs[pointer][1];\r\n        break;\r\n      case DIFF_DELETE:\r\n        count_delete++;\r\n        text_delete += diffs[pointer][1];\r\n        break;\r\n      case DIFF_EQUAL:\r\n        // Upon reaching an equality, check for prior redundancies.\r\n        if (count_delete >= 1 && count_insert >= 1) {\r\n          // Delete the offending records and add the merged ones.\r\n          diffs.splice(pointer - count_delete - count_insert,\r\n                       count_delete + count_insert);\r\n          pointer = pointer - count_delete - count_insert;\r\n          var a = this.diff_main(text_delete, text_insert, false, deadline);\r\n          for (var j = a.length - 1; j >= 0; j--) {\r\n            diffs.splice(pointer, 0, a[j]);\r\n          }\r\n          pointer = pointer + a.length;\r\n        }\r\n        count_insert = 0;\r\n        count_delete = 0;\r\n        text_delete = '';\r\n        text_insert = '';\r\n        break;\r\n    }\r\n    pointer++;\r\n  }\r\n  diffs.pop();  // Remove the dummy entry at the end.\r\n\r\n  return diffs;\r\n};\r\n\r\n\r\n/**\r\n * Find the 'middle snake' of a diff, split the problem in two\r\n * and return the recursively constructed diff.\r\n * See Myers 1986 paper: An O(ND) Difference Algorithm and Its Variations.\r\n * @param {string} text1 Old string to be diffed.\r\n * @param {string} text2 New string to be diffed.\r\n * @param {number} deadline Time at which to bail if not yet complete.\r\n * @return {!Array.<!diff_match_patch.Diff>} Array of diff tuples.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_bisect_ = function(text1, text2, deadline) {\r\n  // Cache the text lengths to prevent multiple calls.\r\n  var text1_length = text1.length;\r\n  var text2_length = text2.length;\r\n  var max_d = Math.ceil((text1_length + text2_length) / 2);\r\n  var v_offset = max_d;\r\n  var v_length = 2 * max_d;\r\n  var v1 = new Array(v_length);\r\n  var v2 = new Array(v_length);\r\n  // Setting all elements to -1 is faster in Chrome & Firefox than mixing\r\n  // integers and undefined.\r\n  for (var x = 0; x < v_length; x++) {\r\n    v1[x] = -1;\r\n    v2[x] = -1;\r\n  }\r\n  v1[v_offset + 1] = 0;\r\n  v2[v_offset + 1] = 0;\r\n  var delta = text1_length - text2_length;\r\n  // If the total number of characters is odd, then the front path will collide\r\n  // with the reverse path.\r\n  var front = (delta % 2 != 0);\r\n  // Offsets for start and end of k loop.\r\n  // Prevents mapping of space beyond the grid.\r\n  var k1start = 0;\r\n  var k1end = 0;\r\n  var k2start = 0;\r\n  var k2end = 0;\r\n  for (var d = 0; d < max_d; d++) {\r\n    // Bail out if deadline is reached.\r\n    if ((new Date()).getTime() > deadline) {\r\n      break;\r\n    }\r\n\r\n    // Walk the front path one step.\r\n    for (var k1 = -d + k1start; k1 <= d - k1end; k1 += 2) {\r\n      var k1_offset = v_offset + k1;\r\n      var x1;\r\n      if (k1 == -d || (k1 != d && v1[k1_offset - 1] < v1[k1_offset + 1])) {\r\n        x1 = v1[k1_offset + 1];\r\n      } else {\r\n        x1 = v1[k1_offset - 1] + 1;\r\n      }\r\n      var y1 = x1 - k1;\r\n      while (x1 < text1_length && y1 < text2_length &&\r\n             text1.charAt(x1) == text2.charAt(y1)) {\r\n        x1++;\r\n        y1++;\r\n      }\r\n      v1[k1_offset] = x1;\r\n      if (x1 > text1_length) {\r\n        // Ran off the right of the graph.\r\n        k1end += 2;\r\n      } else if (y1 > text2_length) {\r\n        // Ran off the bottom of the graph.\r\n        k1start += 2;\r\n      } else if (front) {\r\n        var k2_offset = v_offset + delta - k1;\r\n        if (k2_offset >= 0 && k2_offset < v_length && v2[k2_offset] != -1) {\r\n          // Mirror x2 onto top-left coordinate system.\r\n          var x2 = text1_length - v2[k2_offset];\r\n          if (x1 >= x2) {\r\n            // Overlap detected.\r\n            return this.diff_bisectSplit_(text1, text2, x1, y1, deadline);\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    // Walk the reverse path one step.\r\n    for (var k2 = -d + k2start; k2 <= d - k2end; k2 += 2) {\r\n      var k2_offset = v_offset + k2;\r\n      var x2;\r\n      if (k2 == -d || (k2 != d && v2[k2_offset - 1] < v2[k2_offset + 1])) {\r\n        x2 = v2[k2_offset + 1];\r\n      } else {\r\n        x2 = v2[k2_offset - 1] + 1;\r\n      }\r\n      var y2 = x2 - k2;\r\n      while (x2 < text1_length && y2 < text2_length &&\r\n             text1.charAt(text1_length - x2 - 1) ==\r\n             text2.charAt(text2_length - y2 - 1)) {\r\n        x2++;\r\n        y2++;\r\n      }\r\n      v2[k2_offset] = x2;\r\n      if (x2 > text1_length) {\r\n        // Ran off the left of the graph.\r\n        k2end += 2;\r\n      } else if (y2 > text2_length) {\r\n        // Ran off the top of the graph.\r\n        k2start += 2;\r\n      } else if (!front) {\r\n        var k1_offset = v_offset + delta - k2;\r\n        if (k1_offset >= 0 && k1_offset < v_length && v1[k1_offset] != -1) {\r\n          var x1 = v1[k1_offset];\r\n          var y1 = v_offset + x1 - k1_offset;\r\n          // Mirror x2 onto top-left coordinate system.\r\n          x2 = text1_length - x2;\r\n          if (x1 >= x2) {\r\n            // Overlap detected.\r\n            return this.diff_bisectSplit_(text1, text2, x1, y1, deadline);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  // Diff took too long and hit the deadline or\r\n  // number of diffs equals number of characters, no commonality at all.\r\n  return [[DIFF_DELETE, text1], [DIFF_INSERT, text2]];\r\n};\r\n\r\n\r\n/**\r\n * Given the location of the 'middle snake', split the diff in two parts\r\n * and recurse.\r\n * @param {string} text1 Old string to be diffed.\r\n * @param {string} text2 New string to be diffed.\r\n * @param {number} x Index of split point in text1.\r\n * @param {number} y Index of split point in text2.\r\n * @param {number} deadline Time at which to bail if not yet complete.\r\n * @return {!Array.<!diff_match_patch.Diff>} Array of diff tuples.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_bisectSplit_ = function(text1, text2, x, y,\r\n    deadline) {\r\n  var text1a = text1.substring(0, x);\r\n  var text2a = text2.substring(0, y);\r\n  var text1b = text1.substring(x);\r\n  var text2b = text2.substring(y);\r\n\r\n  // Compute both diffs serially.\r\n  var diffs = this.diff_main(text1a, text2a, false, deadline);\r\n  var diffsb = this.diff_main(text1b, text2b, false, deadline);\r\n\r\n  return diffs.concat(diffsb);\r\n};\r\n\r\n\r\n/**\r\n * Split two texts into an array of strings.  Reduce the texts to a string of\r\n * hashes where each Unicode character represents one line.\r\n * @param {string} text1 First string.\r\n * @param {string} text2 Second string.\r\n * @return {{chars1: string, chars2: string, lineArray: !Array.<string>}}\r\n *     An object containing the encoded text1, the encoded text2 and\r\n *     the array of unique strings.\r\n *     The zeroth element of the array of unique strings is intentionally blank.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_linesToChars_ = function(text1, text2) {\r\n  var lineArray = [];  // e.g. lineArray[4] == 'Hello\\n'\r\n  var lineHash = {};   // e.g. lineHash['Hello\\n'] == 4\r\n\r\n  // '\\x00' is a valid character, but various debuggers don't like it.\r\n  // So we'll insert a junk entry to avoid generating a null character.\r\n  lineArray[0] = '';\r\n\r\n  /**\r\n   * Split a text into an array of strings.  Reduce the texts to a string of\r\n   * hashes where each Unicode character represents one line.\r\n   * Modifies linearray and linehash through being a closure.\r\n   * @param {string} text String to encode.\r\n   * @return {string} Encoded string.\r\n   * @private\r\n   */\r\n  function diff_linesToCharsMunge_(text) {\r\n    var chars = '';\r\n    // Walk the text, pulling out a substring for each line.\r\n    // text.split('\\n') would would temporarily double our memory footprint.\r\n    // Modifying text would create many large strings to garbage collect.\r\n    var lineStart = 0;\r\n    var lineEnd = -1;\r\n    // Keeping our own length variable is faster than looking it up.\r\n    var lineArrayLength = lineArray.length;\r\n    while (lineEnd < text.length - 1) {\r\n      lineEnd = text.indexOf('\\n', lineStart);\r\n      if (lineEnd == -1) {\r\n        lineEnd = text.length - 1;\r\n      }\r\n      var line = text.substring(lineStart, lineEnd + 1);\r\n      lineStart = lineEnd + 1;\r\n\r\n      if (lineHash.hasOwnProperty ? lineHash.hasOwnProperty(line) :\r\n          (lineHash[line] !== undefined)) {\r\n        chars += String.fromCharCode(lineHash[line]);\r\n      } else {\r\n        chars += String.fromCharCode(lineArrayLength);\r\n        lineHash[line] = lineArrayLength;\r\n        lineArray[lineArrayLength++] = line;\r\n      }\r\n    }\r\n    return chars;\r\n  }\r\n\r\n  var chars1 = diff_linesToCharsMunge_(text1);\r\n  var chars2 = diff_linesToCharsMunge_(text2);\r\n  return {chars1: chars1, chars2: chars2, lineArray: lineArray};\r\n};\r\n\r\n\r\n/**\r\n * Rehydrate the text in a diff from a string of line hashes to real lines of\r\n * text.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @param {!Array.<string>} lineArray Array of unique strings.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_charsToLines_ = function(diffs, lineArray) {\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    var chars = diffs[x][1];\r\n    var text = [];\r\n    for (var y = 0; y < chars.length; y++) {\r\n      text[y] = lineArray[chars.charCodeAt(y)];\r\n    }\r\n    diffs[x][1] = text.join('');\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Determine the common prefix of two strings.\r\n * @param {string} text1 First string.\r\n * @param {string} text2 Second string.\r\n * @return {number} The number of characters common to the start of each\r\n *     string.\r\n */\r\ndiff_match_patch.prototype.diff_commonPrefix = function(text1, text2) {\r\n  // Quick check for common null cases.\r\n  if (!text1 || !text2 || text1.charAt(0) != text2.charAt(0)) {\r\n    return 0;\r\n  }\r\n  // Binary search.\r\n  // Performance analysis: http://neil.fraser.name/news/2007/10/09/\r\n  var pointermin = 0;\r\n  var pointermax = Math.min(text1.length, text2.length);\r\n  var pointermid = pointermax;\r\n  var pointerstart = 0;\r\n  while (pointermin < pointermid) {\r\n    if (text1.substring(pointerstart, pointermid) ==\r\n        text2.substring(pointerstart, pointermid)) {\r\n      pointermin = pointermid;\r\n      pointerstart = pointermin;\r\n    } else {\r\n      pointermax = pointermid;\r\n    }\r\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\r\n  }\r\n  return pointermid;\r\n};\r\n\r\n\r\n/**\r\n * Determine the common suffix of two strings.\r\n * @param {string} text1 First string.\r\n * @param {string} text2 Second string.\r\n * @return {number} The number of characters common to the end of each string.\r\n */\r\ndiff_match_patch.prototype.diff_commonSuffix = function(text1, text2) {\r\n  // Quick check for common null cases.\r\n  if (!text1 || !text2 ||\r\n      text1.charAt(text1.length - 1) != text2.charAt(text2.length - 1)) {\r\n    return 0;\r\n  }\r\n  // Binary search.\r\n  // Performance analysis: http://neil.fraser.name/news/2007/10/09/\r\n  var pointermin = 0;\r\n  var pointermax = Math.min(text1.length, text2.length);\r\n  var pointermid = pointermax;\r\n  var pointerend = 0;\r\n  while (pointermin < pointermid) {\r\n    if (text1.substring(text1.length - pointermid, text1.length - pointerend) ==\r\n        text2.substring(text2.length - pointermid, text2.length - pointerend)) {\r\n      pointermin = pointermid;\r\n      pointerend = pointermin;\r\n    } else {\r\n      pointermax = pointermid;\r\n    }\r\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\r\n  }\r\n  return pointermid;\r\n};\r\n\r\n\r\n/**\r\n * Determine if the suffix of one string is the prefix of another.\r\n * @param {string} text1 First string.\r\n * @param {string} text2 Second string.\r\n * @return {number} The number of characters common to the end of the first\r\n *     string and the start of the second string.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_commonOverlap_ = function(text1, text2) {\r\n  // Cache the text lengths to prevent multiple calls.\r\n  var text1_length = text1.length;\r\n  var text2_length = text2.length;\r\n  // Eliminate the null case.\r\n  if (text1_length == 0 || text2_length == 0) {\r\n    return 0;\r\n  }\r\n  // Truncate the longer string.\r\n  if (text1_length > text2_length) {\r\n    text1 = text1.substring(text1_length - text2_length);\r\n  } else if (text1_length < text2_length) {\r\n    text2 = text2.substring(0, text1_length);\r\n  }\r\n  var text_length = Math.min(text1_length, text2_length);\r\n  // Quick check for the worst case.\r\n  if (text1 == text2) {\r\n    return text_length;\r\n  }\r\n\r\n  // Start by looking for a single character match\r\n  // and increase length until no match is found.\r\n  // Performance analysis: http://neil.fraser.name/news/2010/11/04/\r\n  var best = 0;\r\n  var length = 1;\r\n  while (true) {\r\n    var pattern = text1.substring(text_length - length);\r\n    var found = text2.indexOf(pattern);\r\n    if (found == -1) {\r\n      return best;\r\n    }\r\n    length += found;\r\n    if (found == 0 || text1.substring(text_length - length) ==\r\n        text2.substring(0, length)) {\r\n      best = length;\r\n      length++;\r\n    }\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Do the two texts share a substring which is at least half the length of the\r\n * longer text?\r\n * This speedup can produce non-minimal diffs.\r\n * @param {string} text1 First string.\r\n * @param {string} text2 Second string.\r\n * @return {Array.<string>} Five element Array, containing the prefix of\r\n *     text1, the suffix of text1, the prefix of text2, the suffix of\r\n *     text2 and the common middle.  Or null if there was no match.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.diff_halfMatch_ = function(text1, text2) {\r\n  if (this.Diff_Timeout <= 0) {\r\n    // Don't risk returning a non-optimal diff if we have unlimited time.\r\n    return null;\r\n  }\r\n  var longtext = text1.length > text2.length ? text1 : text2;\r\n  var shorttext = text1.length > text2.length ? text2 : text1;\r\n  if (longtext.length < 4 || shorttext.length * 2 < longtext.length) {\r\n    return null;  // Pointless.\r\n  }\r\n  var dmp = this;  // 'this' becomes 'window' in a closure.\r\n\r\n  /**\r\n   * Does a substring of shorttext exist within longtext such that the substring\r\n   * is at least half the length of longtext?\r\n   * Closure, but does not reference any external variables.\r\n   * @param {string} longtext Longer string.\r\n   * @param {string} shorttext Shorter string.\r\n   * @param {number} i Start index of quarter length substring within longtext.\r\n   * @return {Array.<string>} Five element Array, containing the prefix of\r\n   *     longtext, the suffix of longtext, the prefix of shorttext, the suffix\r\n   *     of shorttext and the common middle.  Or null if there was no match.\r\n   * @private\r\n   */\r\n  function diff_halfMatchI_(longtext, shorttext, i) {\r\n    // Start with a 1/4 length substring at position i as a seed.\r\n    var seed = longtext.substring(i, i + Math.floor(longtext.length / 4));\r\n    var j = -1;\r\n    var best_common = '';\r\n    var best_longtext_a, best_longtext_b, best_shorttext_a, best_shorttext_b;\r\n    while ((j = shorttext.indexOf(seed, j + 1)) != -1) {\r\n      var prefixLength = dmp.diff_commonPrefix(longtext.substring(i),\r\n                                               shorttext.substring(j));\r\n      var suffixLength = dmp.diff_commonSuffix(longtext.substring(0, i),\r\n                                               shorttext.substring(0, j));\r\n      if (best_common.length < suffixLength + prefixLength) {\r\n        best_common = shorttext.substring(j - suffixLength, j) +\r\n            shorttext.substring(j, j + prefixLength);\r\n        best_longtext_a = longtext.substring(0, i - suffixLength);\r\n        best_longtext_b = longtext.substring(i + prefixLength);\r\n        best_shorttext_a = shorttext.substring(0, j - suffixLength);\r\n        best_shorttext_b = shorttext.substring(j + prefixLength);\r\n      }\r\n    }\r\n    if (best_common.length * 2 >= longtext.length) {\r\n      return [best_longtext_a, best_longtext_b,\r\n              best_shorttext_a, best_shorttext_b, best_common];\r\n    } else {\r\n      return null;\r\n    }\r\n  }\r\n\r\n  // First check if the second quarter is the seed for a half-match.\r\n  var hm1 = diff_halfMatchI_(longtext, shorttext,\r\n                             Math.ceil(longtext.length / 4));\r\n  // Check again based on the third quarter.\r\n  var hm2 = diff_halfMatchI_(longtext, shorttext,\r\n                             Math.ceil(longtext.length / 2));\r\n  var hm;\r\n  if (!hm1 && !hm2) {\r\n    return null;\r\n  } else if (!hm2) {\r\n    hm = hm1;\r\n  } else if (!hm1) {\r\n    hm = hm2;\r\n  } else {\r\n    // Both matched.  Select the longest.\r\n    hm = hm1[4].length > hm2[4].length ? hm1 : hm2;\r\n  }\r\n\r\n  // A half-match was found, sort out the return data.\r\n  var text1_a, text1_b, text2_a, text2_b;\r\n  if (text1.length > text2.length) {\r\n    text1_a = hm[0];\r\n    text1_b = hm[1];\r\n    text2_a = hm[2];\r\n    text2_b = hm[3];\r\n  } else {\r\n    text2_a = hm[0];\r\n    text2_b = hm[1];\r\n    text1_a = hm[2];\r\n    text1_b = hm[3];\r\n  }\r\n  var mid_common = hm[4];\r\n  return [text1_a, text1_b, text2_a, text2_b, mid_common];\r\n};\r\n\r\n\r\n/**\r\n * Reduce the number of edits by eliminating semantically trivial equalities.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n */\r\ndiff_match_patch.prototype.diff_cleanupSemantic = function(diffs) {\r\n  var changes = false;\r\n  var equalities = [];  // Stack of indices where equalities are found.\r\n  var equalitiesLength = 0;  // Keeping our own length var is faster in JS.\r\n  /** @type {?string} */\r\n  var lastequality = null;\r\n  // Always equal to diffs[equalities[equalitiesLength - 1]][1]\r\n  var pointer = 0;  // Index of current position.\r\n  // Number of characters that changed prior to the equality.\r\n  var length_insertions1 = 0;\r\n  var length_deletions1 = 0;\r\n  // Number of characters that changed after the equality.\r\n  var length_insertions2 = 0;\r\n  var length_deletions2 = 0;\r\n  while (pointer < diffs.length) {\r\n    if (diffs[pointer][0] == DIFF_EQUAL) {  // Equality found.\r\n      equalities[equalitiesLength++] = pointer;\r\n      length_insertions1 = length_insertions2;\r\n      length_deletions1 = length_deletions2;\r\n      length_insertions2 = 0;\r\n      length_deletions2 = 0;\r\n      lastequality = diffs[pointer][1];\r\n    } else {  // An insertion or deletion.\r\n      if (diffs[pointer][0] == DIFF_INSERT) {\r\n        length_insertions2 += diffs[pointer][1].length;\r\n      } else {\r\n        length_deletions2 += diffs[pointer][1].length;\r\n      }\r\n      // Eliminate an equality that is smaller or equal to the edits on both\r\n      // sides of it.\r\n      if (lastequality && (lastequality.length <=\r\n          Math.max(length_insertions1, length_deletions1)) &&\r\n          (lastequality.length <= Math.max(length_insertions2,\r\n                                           length_deletions2))) {\r\n        // Duplicate record.\r\n        diffs.splice(equalities[equalitiesLength - 1], 0,\r\n                     [DIFF_DELETE, lastequality]);\r\n        // Change second copy to insert.\r\n        diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\r\n        // Throw away the equality we just deleted.\r\n        equalitiesLength--;\r\n        // Throw away the previous equality (it needs to be reevaluated).\r\n        equalitiesLength--;\r\n        pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\r\n        length_insertions1 = 0;  // Reset the counters.\r\n        length_deletions1 = 0;\r\n        length_insertions2 = 0;\r\n        length_deletions2 = 0;\r\n        lastequality = null;\r\n        changes = true;\r\n      }\r\n    }\r\n    pointer++;\r\n  }\r\n\r\n  // Normalize the diff.\r\n  if (changes) {\r\n    this.diff_cleanupMerge(diffs);\r\n  }\r\n  this.diff_cleanupSemanticLossless(diffs);\r\n\r\n  // Find any overlaps between deletions and insertions.\r\n  // e.g: <del>abcxxx</del><ins>xxxdef</ins>\r\n  //   -> <del>abc</del>xxx<ins>def</ins>\r\n  // e.g: <del>xxxabc</del><ins>defxxx</ins>\r\n  //   -> <ins>def</ins>xxx<del>abc</del>\r\n  // Only extract an overlap if it is as big as the edit ahead or behind it.\r\n  pointer = 1;\r\n  while (pointer < diffs.length) {\r\n    if (diffs[pointer - 1][0] == DIFF_DELETE &&\r\n        diffs[pointer][0] == DIFF_INSERT) {\r\n      var deletion = diffs[pointer - 1][1];\r\n      var insertion = diffs[pointer][1];\r\n      var overlap_length1 = this.diff_commonOverlap_(deletion, insertion);\r\n      var overlap_length2 = this.diff_commonOverlap_(insertion, deletion);\r\n      if (overlap_length1 >= overlap_length2) {\r\n        if (overlap_length1 >= deletion.length / 2 ||\r\n            overlap_length1 >= insertion.length / 2) {\r\n          // Overlap found.  Insert an equality and trim the surrounding edits.\r\n          diffs.splice(pointer, 0,\r\n              [DIFF_EQUAL, insertion.substring(0, overlap_length1)]);\r\n          diffs[pointer - 1][1] =\r\n              deletion.substring(0, deletion.length - overlap_length1);\r\n          diffs[pointer + 1][1] = insertion.substring(overlap_length1);\r\n          pointer++;\r\n        }\r\n      } else {\r\n        if (overlap_length2 >= deletion.length / 2 ||\r\n            overlap_length2 >= insertion.length / 2) {\r\n          // Reverse overlap found.\r\n          // Insert an equality and swap and trim the surrounding edits.\r\n          diffs.splice(pointer, 0,\r\n              [DIFF_EQUAL, deletion.substring(0, overlap_length2)]);\r\n          diffs[pointer - 1][0] = DIFF_INSERT;\r\n          diffs[pointer - 1][1] =\r\n              insertion.substring(0, insertion.length - overlap_length2);\r\n          diffs[pointer + 1][0] = DIFF_DELETE;\r\n          diffs[pointer + 1][1] =\r\n              deletion.substring(overlap_length2);\r\n          pointer++;\r\n        }\r\n      }\r\n      pointer++;\r\n    }\r\n    pointer++;\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Look for single edits surrounded on both sides by equalities\r\n * which can be shifted sideways to align the edit to a word boundary.\r\n * e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n */\r\ndiff_match_patch.prototype.diff_cleanupSemanticLossless = function(diffs) {\r\n  /**\r\n   * Given two strings, compute a score representing whether the internal\r\n   * boundary falls on logical boundaries.\r\n   * Scores range from 6 (best) to 0 (worst).\r\n   * Closure, but does not reference any external variables.\r\n   * @param {string} one First string.\r\n   * @param {string} two Second string.\r\n   * @return {number} The score.\r\n   * @private\r\n   */\r\n  function diff_cleanupSemanticScore_(one, two) {\r\n    if (!one || !two) {\r\n      // Edges are the best.\r\n      return 6;\r\n    }\r\n\r\n    // Each port of this function behaves slightly differently due to\r\n    // subtle differences in each language's definition of things like\r\n    // 'whitespace'.  Since this function's purpose is largely cosmetic,\r\n    // the choice has been made to use each language's native features\r\n    // rather than force total conformity.\r\n    var char1 = one.charAt(one.length - 1);\r\n    var char2 = two.charAt(0);\r\n    var nonAlphaNumeric1 = char1.match(diff_match_patch.nonAlphaNumericRegex_);\r\n    var nonAlphaNumeric2 = char2.match(diff_match_patch.nonAlphaNumericRegex_);\r\n    var whitespace1 = nonAlphaNumeric1 &&\r\n        char1.match(diff_match_patch.whitespaceRegex_);\r\n    var whitespace2 = nonAlphaNumeric2 &&\r\n        char2.match(diff_match_patch.whitespaceRegex_);\r\n    var lineBreak1 = whitespace1 &&\r\n        char1.match(diff_match_patch.linebreakRegex_);\r\n    var lineBreak2 = whitespace2 &&\r\n        char2.match(diff_match_patch.linebreakRegex_);\r\n    var blankLine1 = lineBreak1 &&\r\n        one.match(diff_match_patch.blanklineEndRegex_);\r\n    var blankLine2 = lineBreak2 &&\r\n        two.match(diff_match_patch.blanklineStartRegex_);\r\n\r\n    if (blankLine1 || blankLine2) {\r\n      // Five points for blank lines.\r\n      return 5;\r\n    } else if (lineBreak1 || lineBreak2) {\r\n      // Four points for line breaks.\r\n      return 4;\r\n    } else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\r\n      // Three points for end of sentences.\r\n      return 3;\r\n    } else if (whitespace1 || whitespace2) {\r\n      // Two points for whitespace.\r\n      return 2;\r\n    } else if (nonAlphaNumeric1 || nonAlphaNumeric2) {\r\n      // One point for non-alphanumeric.\r\n      return 1;\r\n    }\r\n    return 0;\r\n  }\r\n\r\n  var pointer = 1;\r\n  // Intentionally ignore the first and last element (don't need checking).\r\n  while (pointer < diffs.length - 1) {\r\n    if (diffs[pointer - 1][0] == DIFF_EQUAL &&\r\n        diffs[pointer + 1][0] == DIFF_EQUAL) {\r\n      // This is a single edit surrounded by equalities.\r\n      var equality1 = diffs[pointer - 1][1];\r\n      var edit = diffs[pointer][1];\r\n      var equality2 = diffs[pointer + 1][1];\r\n\r\n      // First, shift the edit as far left as possible.\r\n      var commonOffset = this.diff_commonSuffix(equality1, edit);\r\n      if (commonOffset) {\r\n        var commonString = edit.substring(edit.length - commonOffset);\r\n        equality1 = equality1.substring(0, equality1.length - commonOffset);\r\n        edit = commonString + edit.substring(0, edit.length - commonOffset);\r\n        equality2 = commonString + equality2;\r\n      }\r\n\r\n      // Second, step character by character right, looking for the best fit.\r\n      var bestEquality1 = equality1;\r\n      var bestEdit = edit;\r\n      var bestEquality2 = equality2;\r\n      var bestScore = diff_cleanupSemanticScore_(equality1, edit) +\r\n          diff_cleanupSemanticScore_(edit, equality2);\r\n      while (edit.charAt(0) === equality2.charAt(0)) {\r\n        equality1 += edit.charAt(0);\r\n        edit = edit.substring(1) + equality2.charAt(0);\r\n        equality2 = equality2.substring(1);\r\n        var score = diff_cleanupSemanticScore_(equality1, edit) +\r\n            diff_cleanupSemanticScore_(edit, equality2);\r\n        // The >= encourages trailing rather than leading whitespace on edits.\r\n        if (score >= bestScore) {\r\n          bestScore = score;\r\n          bestEquality1 = equality1;\r\n          bestEdit = edit;\r\n          bestEquality2 = equality2;\r\n        }\r\n      }\r\n\r\n      if (diffs[pointer - 1][1] != bestEquality1) {\r\n        // We have an improvement, save it back to the diff.\r\n        if (bestEquality1) {\r\n          diffs[pointer - 1][1] = bestEquality1;\r\n        } else {\r\n          diffs.splice(pointer - 1, 1);\r\n          pointer--;\r\n        }\r\n        diffs[pointer][1] = bestEdit;\r\n        if (bestEquality2) {\r\n          diffs[pointer + 1][1] = bestEquality2;\r\n        } else {\r\n          diffs.splice(pointer + 1, 1);\r\n          pointer--;\r\n        }\r\n      }\r\n    }\r\n    pointer++;\r\n  }\r\n};\r\n\r\n// Define some regex patterns for matching boundaries.\r\ndiff_match_patch.nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/;\r\ndiff_match_patch.whitespaceRegex_ = /\\s/;\r\ndiff_match_patch.linebreakRegex_ = /[\\r\\n]/;\r\ndiff_match_patch.blanklineEndRegex_ = /\\n\\r?\\n$/;\r\ndiff_match_patch.blanklineStartRegex_ = /^\\r?\\n\\r?\\n/;\r\n\r\n/**\r\n * Reduce the number of edits by eliminating operationally trivial equalities.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n */\r\ndiff_match_patch.prototype.diff_cleanupEfficiency = function(diffs) {\r\n  var changes = false;\r\n  var equalities = [];  // Stack of indices where equalities are found.\r\n  var equalitiesLength = 0;  // Keeping our own length var is faster in JS.\r\n  /** @type {?string} */\r\n  var lastequality = null;\r\n  // Always equal to diffs[equalities[equalitiesLength - 1]][1]\r\n  var pointer = 0;  // Index of current position.\r\n  // Is there an insertion operation before the last equality.\r\n  var pre_ins = false;\r\n  // Is there a deletion operation before the last equality.\r\n  var pre_del = false;\r\n  // Is there an insertion operation after the last equality.\r\n  var post_ins = false;\r\n  // Is there a deletion operation after the last equality.\r\n  var post_del = false;\r\n  while (pointer < diffs.length) {\r\n    if (diffs[pointer][0] == DIFF_EQUAL) {  // Equality found.\r\n      if (diffs[pointer][1].length < this.Diff_EditCost &&\r\n          (post_ins || post_del)) {\r\n        // Candidate found.\r\n        equalities[equalitiesLength++] = pointer;\r\n        pre_ins = post_ins;\r\n        pre_del = post_del;\r\n        lastequality = diffs[pointer][1];\r\n      } else {\r\n        // Not a candidate, and can never become one.\r\n        equalitiesLength = 0;\r\n        lastequality = null;\r\n      }\r\n      post_ins = post_del = false;\r\n    } else {  // An insertion or deletion.\r\n      if (diffs[pointer][0] == DIFF_DELETE) {\r\n        post_del = true;\r\n      } else {\r\n        post_ins = true;\r\n      }\r\n      /*\r\n       * Five types to be split:\r\n       * <ins>A</ins><del>B</del>XY<ins>C</ins><del>D</del>\r\n       * <ins>A</ins>X<ins>C</ins><del>D</del>\r\n       * <ins>A</ins><del>B</del>X<ins>C</ins>\r\n       * <ins>A</del>X<ins>C</ins><del>D</del>\r\n       * <ins>A</ins><del>B</del>X<del>C</del>\r\n       */\r\n      if (lastequality && ((pre_ins && pre_del && post_ins && post_del) ||\r\n                           ((lastequality.length < this.Diff_EditCost / 2) &&\r\n                            (pre_ins + pre_del + post_ins + post_del) == 3))) {\r\n        // Duplicate record.\r\n        diffs.splice(equalities[equalitiesLength - 1], 0,\r\n                     [DIFF_DELETE, lastequality]);\r\n        // Change second copy to insert.\r\n        diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\r\n        equalitiesLength--;  // Throw away the equality we just deleted;\r\n        lastequality = null;\r\n        if (pre_ins && pre_del) {\r\n          // No changes made which could affect previous entry, keep going.\r\n          post_ins = post_del = true;\r\n          equalitiesLength = 0;\r\n        } else {\r\n          equalitiesLength--;  // Throw away the previous equality.\r\n          pointer = equalitiesLength > 0 ?\r\n              equalities[equalitiesLength - 1] : -1;\r\n          post_ins = post_del = false;\r\n        }\r\n        changes = true;\r\n      }\r\n    }\r\n    pointer++;\r\n  }\r\n\r\n  if (changes) {\r\n    this.diff_cleanupMerge(diffs);\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Reorder and merge like edit sections.  Merge equalities.\r\n * Any edit section can move as long as it doesn't cross an equality.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n */\r\ndiff_match_patch.prototype.diff_cleanupMerge = function(diffs) {\r\n  diffs.push([DIFF_EQUAL, '']);  // Add a dummy entry at the end.\r\n  var pointer = 0;\r\n  var count_delete = 0;\r\n  var count_insert = 0;\r\n  var text_delete = '';\r\n  var text_insert = '';\r\n  var commonlength;\r\n  while (pointer < diffs.length) {\r\n    switch (diffs[pointer][0]) {\r\n      case DIFF_INSERT:\r\n        count_insert++;\r\n        text_insert += diffs[pointer][1];\r\n        pointer++;\r\n        break;\r\n      case DIFF_DELETE:\r\n        count_delete++;\r\n        text_delete += diffs[pointer][1];\r\n        pointer++;\r\n        break;\r\n      case DIFF_EQUAL:\r\n        // Upon reaching an equality, check for prior redundancies.\r\n        if (count_delete + count_insert > 1) {\r\n          if (count_delete !== 0 && count_insert !== 0) {\r\n            // Factor out any common prefixies.\r\n            commonlength = this.diff_commonPrefix(text_insert, text_delete);\r\n            if (commonlength !== 0) {\r\n              if ((pointer - count_delete - count_insert) > 0 &&\r\n                  diffs[pointer - count_delete - count_insert - 1][0] ==\r\n                  DIFF_EQUAL) {\r\n                diffs[pointer - count_delete - count_insert - 1][1] +=\r\n                    text_insert.substring(0, commonlength);\r\n              } else {\r\n                diffs.splice(0, 0, [DIFF_EQUAL,\r\n                                    text_insert.substring(0, commonlength)]);\r\n                pointer++;\r\n              }\r\n              text_insert = text_insert.substring(commonlength);\r\n              text_delete = text_delete.substring(commonlength);\r\n            }\r\n            // Factor out any common suffixies.\r\n            commonlength = this.diff_commonSuffix(text_insert, text_delete);\r\n            if (commonlength !== 0) {\r\n              diffs[pointer][1] = text_insert.substring(text_insert.length -\r\n                  commonlength) + diffs[pointer][1];\r\n              text_insert = text_insert.substring(0, text_insert.length -\r\n                  commonlength);\r\n              text_delete = text_delete.substring(0, text_delete.length -\r\n                  commonlength);\r\n            }\r\n          }\r\n          // Delete the offending records and add the merged ones.\r\n          if (count_delete === 0) {\r\n            diffs.splice(pointer - count_insert,\r\n                count_delete + count_insert, [DIFF_INSERT, text_insert]);\r\n          } else if (count_insert === 0) {\r\n            diffs.splice(pointer - count_delete,\r\n                count_delete + count_insert, [DIFF_DELETE, text_delete]);\r\n          } else {\r\n            diffs.splice(pointer - count_delete - count_insert,\r\n                count_delete + count_insert, [DIFF_DELETE, text_delete],\r\n                [DIFF_INSERT, text_insert]);\r\n          }\r\n          pointer = pointer - count_delete - count_insert +\r\n                    (count_delete ? 1 : 0) + (count_insert ? 1 : 0) + 1;\r\n        } else if (pointer !== 0 && diffs[pointer - 1][0] == DIFF_EQUAL) {\r\n          // Merge this equality with the previous one.\r\n          diffs[pointer - 1][1] += diffs[pointer][1];\r\n          diffs.splice(pointer, 1);\r\n        } else {\r\n          pointer++;\r\n        }\r\n        count_insert = 0;\r\n        count_delete = 0;\r\n        text_delete = '';\r\n        text_insert = '';\r\n        break;\r\n    }\r\n  }\r\n  if (diffs[diffs.length - 1][1] === '') {\r\n    diffs.pop();  // Remove the dummy entry at the end.\r\n  }\r\n\r\n  // Second pass: look for single edits surrounded on both sides by equalities\r\n  // which can be shifted sideways to eliminate an equality.\r\n  // e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC\r\n  var changes = false;\r\n  pointer = 1;\r\n  // Intentionally ignore the first and last element (don't need checking).\r\n  while (pointer < diffs.length - 1) {\r\n    if (diffs[pointer - 1][0] == DIFF_EQUAL &&\r\n        diffs[pointer + 1][0] == DIFF_EQUAL) {\r\n      // This is a single edit surrounded by equalities.\r\n      if (diffs[pointer][1].substring(diffs[pointer][1].length -\r\n          diffs[pointer - 1][1].length) == diffs[pointer - 1][1]) {\r\n        // Shift the edit over the previous equality.\r\n        diffs[pointer][1] = diffs[pointer - 1][1] +\r\n            diffs[pointer][1].substring(0, diffs[pointer][1].length -\r\n                                        diffs[pointer - 1][1].length);\r\n        diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\r\n        diffs.splice(pointer - 1, 1);\r\n        changes = true;\r\n      } else if (diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) ==\r\n          diffs[pointer + 1][1]) {\r\n        // Shift the edit over the next equality.\r\n        diffs[pointer - 1][1] += diffs[pointer + 1][1];\r\n        diffs[pointer][1] =\r\n            diffs[pointer][1].substring(diffs[pointer + 1][1].length) +\r\n            diffs[pointer + 1][1];\r\n        diffs.splice(pointer + 1, 1);\r\n        changes = true;\r\n      }\r\n    }\r\n    pointer++;\r\n  }\r\n  // If shifts were made, the diff needs reordering and another shift sweep.\r\n  if (changes) {\r\n    this.diff_cleanupMerge(diffs);\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * loc is a location in text1, compute and return the equivalent location in\r\n * text2.\r\n * e.g. 'The cat' vs 'The big cat', 1->1, 5->8\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @param {number} loc Location within text1.\r\n * @return {number} Location within text2.\r\n */\r\ndiff_match_patch.prototype.diff_xIndex = function(diffs, loc) {\r\n  var chars1 = 0;\r\n  var chars2 = 0;\r\n  var last_chars1 = 0;\r\n  var last_chars2 = 0;\r\n  var x;\r\n  for (x = 0; x < diffs.length; x++) {\r\n    if (diffs[x][0] !== DIFF_INSERT) {  // Equality or deletion.\r\n      chars1 += diffs[x][1].length;\r\n    }\r\n    if (diffs[x][0] !== DIFF_DELETE) {  // Equality or insertion.\r\n      chars2 += diffs[x][1].length;\r\n    }\r\n    if (chars1 > loc) {  // Overshot the location.\r\n      break;\r\n    }\r\n    last_chars1 = chars1;\r\n    last_chars2 = chars2;\r\n  }\r\n  // Was the location was deleted?\r\n  if (diffs.length != x && diffs[x][0] === DIFF_DELETE) {\r\n    return last_chars2;\r\n  }\r\n  // Add the remaining character length.\r\n  return last_chars2 + (loc - last_chars1);\r\n};\r\n\r\n\r\n/**\r\n * Convert a diff array into a pretty HTML report.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @return {string} HTML representation.\r\n */\r\ndiff_match_patch.prototype.diff_prettyHtml = function(diffs) {\r\n  var html = [];\r\n  var pattern_amp = /&/g;\r\n  var pattern_lt = /</g;\r\n  var pattern_gt = />/g;\r\n  var pattern_para = /\\n/g;\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    var op = diffs[x][0];    // Operation (insert, delete, equal)\r\n    var data = diffs[x][1];  // Text of change.\r\n    var text = data.replace(pattern_amp, '&amp;').replace(pattern_lt, '&lt;')\r\n        .replace(pattern_gt, '&gt;').replace(pattern_para, '&para;<br>');\r\n    switch (op) {\r\n      case DIFF_INSERT:\r\n        html[x] = '<ins style=\"background:#e6ffe6;\">' + text + '</ins>';\r\n        break;\r\n      case DIFF_DELETE:\r\n        html[x] = '<del style=\"background:#ffe6e6;\">' + text + '</del>';\r\n        break;\r\n      case DIFF_EQUAL:\r\n        html[x] = '<span>' + text + '</span>';\r\n        break;\r\n    }\r\n  }\r\n  return html.join('');\r\n};\r\n\r\n\r\n/**\r\n * Compute and return the source text (all equalities and deletions).\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @return {string} Source text.\r\n */\r\ndiff_match_patch.prototype.diff_text1 = function(diffs) {\r\n  var text = [];\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    if (diffs[x][0] !== DIFF_INSERT) {\r\n      text[x] = diffs[x][1];\r\n    }\r\n  }\r\n  return text.join('');\r\n};\r\n\r\n\r\n/**\r\n * Compute and return the destination text (all equalities and insertions).\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @return {string} Destination text.\r\n */\r\ndiff_match_patch.prototype.diff_text2 = function(diffs) {\r\n  var text = [];\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    if (diffs[x][0] !== DIFF_DELETE) {\r\n      text[x] = diffs[x][1];\r\n    }\r\n  }\r\n  return text.join('');\r\n};\r\n\r\n\r\n/**\r\n * Compute the Levenshtein distance; the number of inserted, deleted or\r\n * substituted characters.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @return {number} Number of changes.\r\n */\r\ndiff_match_patch.prototype.diff_levenshtein = function(diffs) {\r\n  var levenshtein = 0;\r\n  var insertions = 0;\r\n  var deletions = 0;\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    var op = diffs[x][0];\r\n    var data = diffs[x][1];\r\n    switch (op) {\r\n      case DIFF_INSERT:\r\n        insertions += data.length;\r\n        break;\r\n      case DIFF_DELETE:\r\n        deletions += data.length;\r\n        break;\r\n      case DIFF_EQUAL:\r\n        // A deletion and an insertion is one substitution.\r\n        levenshtein += Math.max(insertions, deletions);\r\n        insertions = 0;\r\n        deletions = 0;\r\n        break;\r\n    }\r\n  }\r\n  levenshtein += Math.max(insertions, deletions);\r\n  return levenshtein;\r\n};\r\n\r\n\r\n/**\r\n * Crush the diff into an encoded string which describes the operations\r\n * required to transform text1 into text2.\r\n * E.g. =3\\t-2\\t+ing  -> Keep 3 chars, delete 2 chars, insert 'ing'.\r\n * Operations are tab-separated.  Inserted text is escaped using %xx notation.\r\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\r\n * @return {string} Delta text.\r\n */\r\ndiff_match_patch.prototype.diff_toDelta = function(diffs) {\r\n  var text = [];\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    switch (diffs[x][0]) {\r\n      case DIFF_INSERT:\r\n        text[x] = '+' + encodeURI(diffs[x][1]);\r\n        break;\r\n      case DIFF_DELETE:\r\n        text[x] = '-' + diffs[x][1].length;\r\n        break;\r\n      case DIFF_EQUAL:\r\n        text[x] = '=' + diffs[x][1].length;\r\n        break;\r\n    }\r\n  }\r\n  return text.join('\\t').replace(/%20/g, ' ');\r\n};\r\n\r\n\r\n/**\r\n * Given the original text1, and an encoded string which describes the\r\n * operations required to transform text1 into text2, compute the full diff.\r\n * @param {string} text1 Source string for the diff.\r\n * @param {string} delta Delta text.\r\n * @return {!Array.<!diff_match_patch.Diff>} Array of diff tuples.\r\n * @throws {!Error} If invalid input.\r\n */\r\ndiff_match_patch.prototype.diff_fromDelta = function(text1, delta) {\r\n  var diffs = [];\r\n  var diffsLength = 0;  // Keeping our own length var is faster in JS.\r\n  var pointer = 0;  // Cursor in text1\r\n  var tokens = delta.split(/\\t/g);\r\n  for (var x = 0; x < tokens.length; x++) {\r\n    // Each token begins with a one character parameter which specifies the\r\n    // operation of this token (delete, insert, equality).\r\n    var param = tokens[x].substring(1);\r\n    switch (tokens[x].charAt(0)) {\r\n      case '+':\r\n        try {\r\n          diffs[diffsLength++] = [DIFF_INSERT, decodeURI(param)];\r\n        } catch (ex) {\r\n          // Malformed URI sequence.\r\n          throw new Error('Illegal escape in diff_fromDelta: ' + param);\r\n        }\r\n        break;\r\n      case '-':\r\n        // Fall through.\r\n      case '=':\r\n        var n = parseInt(param, 10);\r\n        if (isNaN(n) || n < 0) {\r\n          throw new Error('Invalid number in diff_fromDelta: ' + param);\r\n        }\r\n        var text = text1.substring(pointer, pointer += n);\r\n        if (tokens[x].charAt(0) == '=') {\r\n          diffs[diffsLength++] = [DIFF_EQUAL, text];\r\n        } else {\r\n          diffs[diffsLength++] = [DIFF_DELETE, text];\r\n        }\r\n        break;\r\n      default:\r\n        // Blank tokens are ok (from a trailing \\t).\r\n        // Anything else is an error.\r\n        if (tokens[x]) {\r\n          throw new Error('Invalid diff operation in diff_fromDelta: ' +\r\n                          tokens[x]);\r\n        }\r\n    }\r\n  }\r\n  if (pointer != text1.length) {\r\n    throw new Error('Delta length (' + pointer +\r\n        ') does not equal source text length (' + text1.length + ').');\r\n  }\r\n  return diffs;\r\n};\r\n\r\n\r\n//  MATCH FUNCTIONS\r\n\r\n\r\n/**\r\n * Locate the best instance of 'pattern' in 'text' near 'loc'.\r\n * @param {string} text The text to search.\r\n * @param {string} pattern The pattern to search for.\r\n * @param {number} loc The location to search around.\r\n * @return {number} Best match index or -1.\r\n */\r\ndiff_match_patch.prototype.match_main = function(text, pattern, loc) {\r\n  // Check for null inputs.\r\n  if (text == null || pattern == null || loc == null) {\r\n    throw new Error('Null input. (match_main)');\r\n  }\r\n\r\n  loc = Math.max(0, Math.min(loc, text.length));\r\n  if (text == pattern) {\r\n    // Shortcut (potentially not guaranteed by the algorithm)\r\n    return 0;\r\n  } else if (!text.length) {\r\n    // Nothing to match.\r\n    return -1;\r\n  } else if (text.substring(loc, loc + pattern.length) == pattern) {\r\n    // Perfect match at the perfect spot!  (Includes case of null pattern)\r\n    return loc;\r\n  } else {\r\n    // Do a fuzzy compare.\r\n    return this.match_bitap_(text, pattern, loc);\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Locate the best instance of 'pattern' in 'text' near 'loc' using the\r\n * Bitap algorithm.\r\n * @param {string} text The text to search.\r\n * @param {string} pattern The pattern to search for.\r\n * @param {number} loc The location to search around.\r\n * @return {number} Best match index or -1.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.match_bitap_ = function(text, pattern, loc) {\r\n  if (pattern.length > this.Match_MaxBits) {\r\n    throw new Error('Pattern too long for this browser.');\r\n  }\r\n\r\n  // Initialise the alphabet.\r\n  var s = this.match_alphabet_(pattern);\r\n\r\n  var dmp = this;  // 'this' becomes 'window' in a closure.\r\n\r\n  /**\r\n   * Compute and return the score for a match with e errors and x location.\r\n   * Accesses loc and pattern through being a closure.\r\n   * @param {number} e Number of errors in match.\r\n   * @param {number} x Location of match.\r\n   * @return {number} Overall score for match (0.0 = good, 1.0 = bad).\r\n   * @private\r\n   */\r\n  function match_bitapScore_(e, x) {\r\n    var accuracy = e / pattern.length;\r\n    var proximity = Math.abs(loc - x);\r\n    if (!dmp.Match_Distance) {\r\n      // Dodge divide by zero error.\r\n      return proximity ? 1.0 : accuracy;\r\n    }\r\n    return accuracy + (proximity / dmp.Match_Distance);\r\n  }\r\n\r\n  // Highest score beyond which we give up.\r\n  var score_threshold = this.Match_Threshold;\r\n  // Is there a nearby exact match? (speedup)\r\n  var best_loc = text.indexOf(pattern, loc);\r\n  if (best_loc != -1) {\r\n    score_threshold = Math.min(match_bitapScore_(0, best_loc), score_threshold);\r\n    // What about in the other direction? (speedup)\r\n    best_loc = text.lastIndexOf(pattern, loc + pattern.length);\r\n    if (best_loc != -1) {\r\n      score_threshold =\r\n          Math.min(match_bitapScore_(0, best_loc), score_threshold);\r\n    }\r\n  }\r\n\r\n  // Initialise the bit arrays.\r\n  var matchmask = 1 << (pattern.length - 1);\r\n  best_loc = -1;\r\n\r\n  var bin_min, bin_mid;\r\n  var bin_max = pattern.length + text.length;\r\n  var last_rd;\r\n  for (var d = 0; d < pattern.length; d++) {\r\n    // Scan for the best match; each iteration allows for one more error.\r\n    // Run a binary search to determine how far from 'loc' we can stray at this\r\n    // error level.\r\n    bin_min = 0;\r\n    bin_mid = bin_max;\r\n    while (bin_min < bin_mid) {\r\n      if (match_bitapScore_(d, loc + bin_mid) <= score_threshold) {\r\n        bin_min = bin_mid;\r\n      } else {\r\n        bin_max = bin_mid;\r\n      }\r\n      bin_mid = Math.floor((bin_max - bin_min) / 2 + bin_min);\r\n    }\r\n    // Use the result from this iteration as the maximum for the next.\r\n    bin_max = bin_mid;\r\n    var start = Math.max(1, loc - bin_mid + 1);\r\n    var finish = Math.min(loc + bin_mid, text.length) + pattern.length;\r\n\r\n    var rd = Array(finish + 2);\r\n    rd[finish + 1] = (1 << d) - 1;\r\n    for (var j = finish; j >= start; j--) {\r\n      // The alphabet (s) is a sparse hash, so the following line generates\r\n      // warnings.\r\n      var charMatch = s[text.charAt(j - 1)];\r\n      if (d === 0) {  // First pass: exact match.\r\n        rd[j] = ((rd[j + 1] << 1) | 1) & charMatch;\r\n      } else {  // Subsequent passes: fuzzy match.\r\n        rd[j] = (((rd[j + 1] << 1) | 1) & charMatch) |\r\n                (((last_rd[j + 1] | last_rd[j]) << 1) | 1) |\r\n                last_rd[j + 1];\r\n      }\r\n      if (rd[j] & matchmask) {\r\n        var score = match_bitapScore_(d, j - 1);\r\n        // This match will almost certainly be better than any existing match.\r\n        // But check anyway.\r\n        if (score <= score_threshold) {\r\n          // Told you so.\r\n          score_threshold = score;\r\n          best_loc = j - 1;\r\n          if (best_loc > loc) {\r\n            // When passing loc, don't exceed our current distance from loc.\r\n            start = Math.max(1, 2 * loc - best_loc);\r\n          } else {\r\n            // Already passed loc, downhill from here on in.\r\n            break;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    // No hope for a (better) match at greater error levels.\r\n    if (match_bitapScore_(d + 1, loc) > score_threshold) {\r\n      break;\r\n    }\r\n    last_rd = rd;\r\n  }\r\n  return best_loc;\r\n};\r\n\r\n\r\n/**\r\n * Initialise the alphabet for the Bitap algorithm.\r\n * @param {string} pattern The text to encode.\r\n * @return {!Object} Hash of character locations.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.match_alphabet_ = function(pattern) {\r\n  var s = {};\r\n  for (var i = 0; i < pattern.length; i++) {\r\n    s[pattern.charAt(i)] = 0;\r\n  }\r\n  for (var i = 0; i < pattern.length; i++) {\r\n    s[pattern.charAt(i)] |= 1 << (pattern.length - i - 1);\r\n  }\r\n  return s;\r\n};\r\n\r\n\r\n//  PATCH FUNCTIONS\r\n\r\n\r\n/**\r\n * Increase the context until it is unique,\r\n * but don't let the pattern expand beyond Match_MaxBits.\r\n * @param {!diff_match_patch.patch_obj} patch The patch to grow.\r\n * @param {string} text Source text.\r\n * @private\r\n */\r\ndiff_match_patch.prototype.patch_addContext_ = function(patch, text) {\r\n  if (text.length == 0) {\r\n    return;\r\n  }\r\n  var pattern = text.substring(patch.start2, patch.start2 + patch.length1);\r\n  var padding = 0;\r\n\r\n  // Look for the first and last matches of pattern in text.  If two different\r\n  // matches are found, increase the pattern length.\r\n  while (text.indexOf(pattern) != text.lastIndexOf(pattern) &&\r\n         pattern.length < this.Match_MaxBits - this.Patch_Margin -\r\n         this.Patch_Margin) {\r\n    padding += this.Patch_Margin;\r\n    pattern = text.substring(patch.start2 - padding,\r\n                             patch.start2 + patch.length1 + padding);\r\n  }\r\n  // Add one chunk for good luck.\r\n  padding += this.Patch_Margin;\r\n\r\n  // Add the prefix.\r\n  var prefix = text.substring(patch.start2 - padding, patch.start2);\r\n  if (prefix) {\r\n    patch.diffs.unshift([DIFF_EQUAL, prefix]);\r\n  }\r\n  // Add the suffix.\r\n  var suffix = text.substring(patch.start2 + patch.length1,\r\n                              patch.start2 + patch.length1 + padding);\r\n  if (suffix) {\r\n    patch.diffs.push([DIFF_EQUAL, suffix]);\r\n  }\r\n\r\n  // Roll back the start points.\r\n  patch.start1 -= prefix.length;\r\n  patch.start2 -= prefix.length;\r\n  // Extend the lengths.\r\n  patch.length1 += prefix.length + suffix.length;\r\n  patch.length2 += prefix.length + suffix.length;\r\n};\r\n\r\n\r\n/**\r\n * Compute a list of patches to turn text1 into text2.\r\n * Use diffs if provided, otherwise compute it ourselves.\r\n * There are four ways to call this function, depending on what data is\r\n * available to the caller:\r\n * Method 1:\r\n * a = text1, b = text2\r\n * Method 2:\r\n * a = diffs\r\n * Method 3 (optimal):\r\n * a = text1, b = diffs\r\n * Method 4 (deprecated, use method 3):\r\n * a = text1, b = text2, c = diffs\r\n *\r\n * @param {string|!Array.<!diff_match_patch.Diff>} a text1 (methods 1,3,4) or\r\n * Array of diff tuples for text1 to text2 (method 2).\r\n * @param {string|!Array.<!diff_match_patch.Diff>} opt_b text2 (methods 1,4) or\r\n * Array of diff tuples for text1 to text2 (method 3) or undefined (method 2).\r\n * @param {string|!Array.<!diff_match_patch.Diff>} opt_c Array of diff tuples\r\n * for text1 to text2 (method 4) or undefined (methods 1,2,3).\r\n * @return {!Array.<!diff_match_patch.patch_obj>} Array of Patch objects.\r\n */\r\ndiff_match_patch.prototype.patch_make = function(a, opt_b, opt_c) {\r\n  var text1, diffs;\r\n  if (typeof a == 'string' && typeof opt_b == 'string' &&\r\n      typeof opt_c == 'undefined') {\r\n    // Method 1: text1, text2\r\n    // Compute diffs from text1 and text2.\r\n    text1 = /** @type {string} */(a);\r\n    diffs = this.diff_main(text1, /** @type {string} */(opt_b), true);\r\n    if (diffs.length > 2) {\r\n      this.diff_cleanupSemantic(diffs);\r\n      this.diff_cleanupEfficiency(diffs);\r\n    }\r\n  } else if (a && typeof a == 'object' && typeof opt_b == 'undefined' &&\r\n      typeof opt_c == 'undefined') {\r\n    // Method 2: diffs\r\n    // Compute text1 from diffs.\r\n    diffs = /** @type {!Array.<!diff_match_patch.Diff>} */(a);\r\n    text1 = this.diff_text1(diffs);\r\n  } else if (typeof a == 'string' && opt_b && typeof opt_b == 'object' &&\r\n      typeof opt_c == 'undefined') {\r\n    // Method 3: text1, diffs\r\n    text1 = /** @type {string} */(a);\r\n    diffs = /** @type {!Array.<!diff_match_patch.Diff>} */(opt_b);\r\n  } else if (typeof a == 'string' && typeof opt_b == 'string' &&\r\n      opt_c && typeof opt_c == 'object') {\r\n    // Method 4: text1, text2, diffs\r\n    // text2 is not used.\r\n    text1 = /** @type {string} */(a);\r\n    diffs = /** @type {!Array.<!diff_match_patch.Diff>} */(opt_c);\r\n  } else {\r\n    throw new Error('Unknown call format to patch_make.');\r\n  }\r\n\r\n  if (diffs.length === 0) {\r\n    return [];  // Get rid of the null case.\r\n  }\r\n  var patches = [];\r\n  var patch = new diff_match_patch.patch_obj();\r\n  var patchDiffLength = 0;  // Keeping our own length var is faster in JS.\r\n  var char_count1 = 0;  // Number of characters into the text1 string.\r\n  var char_count2 = 0;  // Number of characters into the text2 string.\r\n  // Start with text1 (prepatch_text) and apply the diffs until we arrive at\r\n  // text2 (postpatch_text).  We recreate the patches one by one to determine\r\n  // context info.\r\n  var prepatch_text = text1;\r\n  var postpatch_text = text1;\r\n  for (var x = 0; x < diffs.length; x++) {\r\n    var diff_type = diffs[x][0];\r\n    var diff_text = diffs[x][1];\r\n\r\n    if (!patchDiffLength && diff_type !== DIFF_EQUAL) {\r\n      // A new patch starts here.\r\n      patch.start1 = char_count1;\r\n      patch.start2 = char_count2;\r\n    }\r\n\r\n    switch (diff_type) {\r\n      case DIFF_INSERT:\r\n        patch.diffs[patchDiffLength++] = diffs[x];\r\n        patch.length2 += diff_text.length;\r\n        postpatch_text = postpatch_text.substring(0, char_count2) + diff_text +\r\n                         postpatch_text.substring(char_count2);\r\n        break;\r\n      case DIFF_DELETE:\r\n        patch.length1 += diff_text.length;\r\n        patch.diffs[patchDiffLength++] = diffs[x];\r\n        postpatch_text = postpatch_text.substring(0, char_count2) +\r\n                         postpatch_text.substring(char_count2 +\r\n                             diff_text.length);\r\n        break;\r\n      case DIFF_EQUAL:\r\n        if (diff_text.length <= 2 * this.Patch_Margin &&\r\n            patchDiffLength && diffs.length != x + 1) {\r\n          // Small equality inside a patch.\r\n          patch.diffs[patchDiffLength++] = diffs[x];\r\n          patch.length1 += diff_text.length;\r\n          patch.length2 += diff_text.length;\r\n        } else if (diff_text.length >= 2 * this.Patch_Margin) {\r\n          // Time for a new patch.\r\n          if (patchDiffLength) {\r\n            this.patch_addContext_(patch, prepatch_text);\r\n            patches.push(patch);\r\n            patch = new diff_match_patch.patch_obj();\r\n            patchDiffLength = 0;\r\n            // Unlike Unidiff, our patch lists have a rolling context.\r\n            // http://code.google.com/p/google-diff-match-patch/wiki/Unidiff\r\n            // Update prepatch text & pos to reflect the application of the\r\n            // just completed patch.\r\n            prepatch_text = postpatch_text;\r\n            char_count1 = char_count2;\r\n          }\r\n        }\r\n        break;\r\n    }\r\n\r\n    // Update the current character count.\r\n    if (diff_type !== DIFF_INSERT) {\r\n      char_count1 += diff_text.length;\r\n    }\r\n    if (diff_type !== DIFF_DELETE) {\r\n      char_count2 += diff_text.length;\r\n    }\r\n  }\r\n  // Pick up the leftover patch if not empty.\r\n  if (patchDiffLength) {\r\n    this.patch_addContext_(patch, prepatch_text);\r\n    patches.push(patch);\r\n  }\r\n\r\n  return patches;\r\n};\r\n\r\n\r\n/**\r\n * Given an array of patches, return another array that is identical.\r\n * @param {!Array.<!diff_match_patch.patch_obj>} patches Array of Patch objects.\r\n * @return {!Array.<!diff_match_patch.patch_obj>} Array of Patch objects.\r\n */\r\ndiff_match_patch.prototype.patch_deepCopy = function(patches) {\r\n  // Making deep copies is hard in JavaScript.\r\n  var patchesCopy = [];\r\n  for (var x = 0; x < patches.length; x++) {\r\n    var patch = patches[x];\r\n    var patchCopy = new diff_match_patch.patch_obj();\r\n    patchCopy.diffs = [];\r\n    for (var y = 0; y < patch.diffs.length; y++) {\r\n      patchCopy.diffs[y] = patch.diffs[y].slice();\r\n    }\r\n    patchCopy.start1 = patch.start1;\r\n    patchCopy.start2 = patch.start2;\r\n    patchCopy.length1 = patch.length1;\r\n    patchCopy.length2 = patch.length2;\r\n    patchesCopy[x] = patchCopy;\r\n  }\r\n  return patchesCopy;\r\n};\r\n\r\n\r\n/**\r\n * Merge a set of patches onto the text.  Return a patched text, as well\r\n * as a list of true/false values indicating which patches were applied.\r\n * @param {!Array.<!diff_match_patch.patch_obj>} patches Array of Patch objects.\r\n * @param {string} text Old text.\r\n * @return {!Array.<string|!Array.<boolean>>} Two element Array, containing the\r\n *      new text and an array of boolean values.\r\n */\r\ndiff_match_patch.prototype.patch_apply = function(patches, text) {\r\n  if (patches.length == 0) {\r\n    return [text, []];\r\n  }\r\n\r\n  // Deep copy the patches so that no changes are made to originals.\r\n  patches = this.patch_deepCopy(patches);\r\n\r\n  var nullPadding = this.patch_addPadding(patches);\r\n  text = nullPadding + text + nullPadding;\r\n\r\n  this.patch_splitMax(patches);\r\n  // delta keeps track of the offset between the expected and actual location\r\n  // of the previous patch.  If there are patches expected at positions 10 and\r\n  // 20, but the first patch was found at 12, delta is 2 and the second patch\r\n  // has an effective expected position of 22.\r\n  var delta = 0;\r\n  var results = [];\r\n  for (var x = 0; x < patches.length; x++) {\r\n    var expected_loc = patches[x].start2 + delta;\r\n    var text1 = this.diff_text1(patches[x].diffs);\r\n    var start_loc;\r\n    var end_loc = -1;\r\n    if (text1.length > this.Match_MaxBits) {\r\n      // patch_splitMax will only provide an oversized pattern in the case of\r\n      // a monster delete.\r\n      start_loc = this.match_main(text, text1.substring(0, this.Match_MaxBits),\r\n                                  expected_loc);\r\n      if (start_loc != -1) {\r\n        end_loc = this.match_main(text,\r\n            text1.substring(text1.length - this.Match_MaxBits),\r\n            expected_loc + text1.length - this.Match_MaxBits);\r\n        if (end_loc == -1 || start_loc >= end_loc) {\r\n          // Can't find valid trailing context.  Drop this patch.\r\n          start_loc = -1;\r\n        }\r\n      }\r\n    } else {\r\n      start_loc = this.match_main(text, text1, expected_loc);\r\n    }\r\n    if (start_loc == -1) {\r\n      // No match found.  :(\r\n      results[x] = false;\r\n      // Subtract the delta for this failed patch from subsequent patches.\r\n      delta -= patches[x].length2 - patches[x].length1;\r\n    } else {\r\n      // Found a match.  :)\r\n      results[x] = true;\r\n      delta = start_loc - expected_loc;\r\n      var text2;\r\n      if (end_loc == -1) {\r\n        text2 = text.substring(start_loc, start_loc + text1.length);\r\n      } else {\r\n        text2 = text.substring(start_loc, end_loc + this.Match_MaxBits);\r\n      }\r\n      if (text1 == text2) {\r\n        // Perfect match, just shove the replacement text in.\r\n        text = text.substring(0, start_loc) +\r\n               this.diff_text2(patches[x].diffs) +\r\n               text.substring(start_loc + text1.length);\r\n      } else {\r\n        // Imperfect match.  Run a diff to get a framework of equivalent\r\n        // indices.\r\n        var diffs = this.diff_main(text1, text2, false);\r\n        if (text1.length > this.Match_MaxBits &&\r\n            this.diff_levenshtein(diffs) / text1.length >\r\n            this.Patch_DeleteThreshold) {\r\n          // The end points match, but the content is unacceptably bad.\r\n          results[x] = false;\r\n        } else {\r\n          this.diff_cleanupSemanticLossless(diffs);\r\n          var index1 = 0;\r\n          var index2;\r\n          for (var y = 0; y < patches[x].diffs.length; y++) {\r\n            var mod = patches[x].diffs[y];\r\n            if (mod[0] !== DIFF_EQUAL) {\r\n              index2 = this.diff_xIndex(diffs, index1);\r\n            }\r\n            if (mod[0] === DIFF_INSERT) {  // Insertion\r\n              text = text.substring(0, start_loc + index2) + mod[1] +\r\n                     text.substring(start_loc + index2);\r\n            } else if (mod[0] === DIFF_DELETE) {  // Deletion\r\n              text = text.substring(0, start_loc + index2) +\r\n                     text.substring(start_loc + this.diff_xIndex(diffs,\r\n                         index1 + mod[1].length));\r\n            }\r\n            if (mod[0] !== DIFF_DELETE) {\r\n              index1 += mod[1].length;\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  // Strip the padding off.\r\n  text = text.substring(nullPadding.length, text.length - nullPadding.length);\r\n  return [text, results];\r\n};\r\n\r\n\r\n/**\r\n * Add some padding on text start and end so that edges can match something.\r\n * Intended to be called only from within patch_apply.\r\n * @param {!Array.<!diff_match_patch.patch_obj>} patches Array of Patch objects.\r\n * @return {string} The padding string added to each side.\r\n */\r\ndiff_match_patch.prototype.patch_addPadding = function(patches) {\r\n  var paddingLength = this.Patch_Margin;\r\n  var nullPadding = '';\r\n  for (var x = 1; x <= paddingLength; x++) {\r\n    nullPadding += String.fromCharCode(x);\r\n  }\r\n\r\n  // Bump all the patches forward.\r\n  for (var x = 0; x < patches.length; x++) {\r\n    patches[x].start1 += paddingLength;\r\n    patches[x].start2 += paddingLength;\r\n  }\r\n\r\n  // Add some padding on start of first diff.\r\n  var patch = patches[0];\r\n  var diffs = patch.diffs;\r\n  if (diffs.length == 0 || diffs[0][0] != DIFF_EQUAL) {\r\n    // Add nullPadding equality.\r\n    diffs.unshift([DIFF_EQUAL, nullPadding]);\r\n    patch.start1 -= paddingLength;  // Should be 0.\r\n    patch.start2 -= paddingLength;  // Should be 0.\r\n    patch.length1 += paddingLength;\r\n    patch.length2 += paddingLength;\r\n  } else if (paddingLength > diffs[0][1].length) {\r\n    // Grow first equality.\r\n    var extraLength = paddingLength - diffs[0][1].length;\r\n    diffs[0][1] = nullPadding.substring(diffs[0][1].length) + diffs[0][1];\r\n    patch.start1 -= extraLength;\r\n    patch.start2 -= extraLength;\r\n    patch.length1 += extraLength;\r\n    patch.length2 += extraLength;\r\n  }\r\n\r\n  // Add some padding on end of last diff.\r\n  patch = patches[patches.length - 1];\r\n  diffs = patch.diffs;\r\n  if (diffs.length == 0 || diffs[diffs.length - 1][0] != DIFF_EQUAL) {\r\n    // Add nullPadding equality.\r\n    diffs.push([DIFF_EQUAL, nullPadding]);\r\n    patch.length1 += paddingLength;\r\n    patch.length2 += paddingLength;\r\n  } else if (paddingLength > diffs[diffs.length - 1][1].length) {\r\n    // Grow last equality.\r\n    var extraLength = paddingLength - diffs[diffs.length - 1][1].length;\r\n    diffs[diffs.length - 1][1] += nullPadding.substring(0, extraLength);\r\n    patch.length1 += extraLength;\r\n    patch.length2 += extraLength;\r\n  }\r\n\r\n  return nullPadding;\r\n};\r\n\r\n\r\n/**\r\n * Look through the patches and break up any which are longer than the maximum\r\n * limit of the match algorithm.\r\n * Intended to be called only from within patch_apply.\r\n * @param {!Array.<!diff_match_patch.patch_obj>} patches Array of Patch objects.\r\n */\r\ndiff_match_patch.prototype.patch_splitMax = function(patches) {\r\n  var patch_size = this.Match_MaxBits;\r\n  for (var x = 0; x < patches.length; x++) {\r\n    if (patches[x].length1 <= patch_size) {\r\n      continue;\r\n    }\r\n    var bigpatch = patches[x];\r\n    // Remove the big old patch.\r\n    patches.splice(x--, 1);\r\n    var start1 = bigpatch.start1;\r\n    var start2 = bigpatch.start2;\r\n    var precontext = '';\r\n    while (bigpatch.diffs.length !== 0) {\r\n      // Create one of several smaller patches.\r\n      var patch = new diff_match_patch.patch_obj();\r\n      var empty = true;\r\n      patch.start1 = start1 - precontext.length;\r\n      patch.start2 = start2 - precontext.length;\r\n      if (precontext !== '') {\r\n        patch.length1 = patch.length2 = precontext.length;\r\n        patch.diffs.push([DIFF_EQUAL, precontext]);\r\n      }\r\n      while (bigpatch.diffs.length !== 0 &&\r\n             patch.length1 < patch_size - this.Patch_Margin) {\r\n        var diff_type = bigpatch.diffs[0][0];\r\n        var diff_text = bigpatch.diffs[0][1];\r\n        if (diff_type === DIFF_INSERT) {\r\n          // Insertions are harmless.\r\n          patch.length2 += diff_text.length;\r\n          start2 += diff_text.length;\r\n          patch.diffs.push(bigpatch.diffs.shift());\r\n          empty = false;\r\n        } else if (diff_type === DIFF_DELETE && patch.diffs.length == 1 &&\r\n                   patch.diffs[0][0] == DIFF_EQUAL &&\r\n                   diff_text.length > 2 * patch_size) {\r\n          // This is a large deletion.  Let it pass in one chunk.\r\n          patch.length1 += diff_text.length;\r\n          start1 += diff_text.length;\r\n          empty = false;\r\n          patch.diffs.push([diff_type, diff_text]);\r\n          bigpatch.diffs.shift();\r\n        } else {\r\n          // Deletion or equality.  Only take as much as we can stomach.\r\n          diff_text = diff_text.substring(0,\r\n              patch_size - patch.length1 - this.Patch_Margin);\r\n          patch.length1 += diff_text.length;\r\n          start1 += diff_text.length;\r\n          if (diff_type === DIFF_EQUAL) {\r\n            patch.length2 += diff_text.length;\r\n            start2 += diff_text.length;\r\n          } else {\r\n            empty = false;\r\n          }\r\n          patch.diffs.push([diff_type, diff_text]);\r\n          if (diff_text == bigpatch.diffs[0][1]) {\r\n            bigpatch.diffs.shift();\r\n          } else {\r\n            bigpatch.diffs[0][1] =\r\n                bigpatch.diffs[0][1].substring(diff_text.length);\r\n          }\r\n        }\r\n      }\r\n      // Compute the head context for the next patch.\r\n      precontext = this.diff_text2(patch.diffs);\r\n      precontext =\r\n          precontext.substring(precontext.length - this.Patch_Margin);\r\n      // Append the end context for this patch.\r\n      var postcontext = this.diff_text1(bigpatch.diffs)\r\n                            .substring(0, this.Patch_Margin);\r\n      if (postcontext !== '') {\r\n        patch.length1 += postcontext.length;\r\n        patch.length2 += postcontext.length;\r\n        if (patch.diffs.length !== 0 &&\r\n            patch.diffs[patch.diffs.length - 1][0] === DIFF_EQUAL) {\r\n          patch.diffs[patch.diffs.length - 1][1] += postcontext;\r\n        } else {\r\n          patch.diffs.push([DIFF_EQUAL, postcontext]);\r\n        }\r\n      }\r\n      if (!empty) {\r\n        patches.splice(++x, 0, patch);\r\n      }\r\n    }\r\n  }\r\n};\r\n\r\n\r\n/**\r\n * Take a list of patches and return a textual representation.\r\n * @param {!Array.<!diff_match_patch.patch_obj>} patches Array of Patch objects.\r\n * @return {string} Text representation of patches.\r\n */\r\ndiff_match_patch.prototype.patch_toText = function(patches) {\r\n  var text = [];\r\n  for (var x = 0; x < patches.length; x++) {\r\n    text[x] = patches[x];\r\n  }\r\n  return text.join('');\r\n};\r\n\r\n\r\n/**\r\n * Parse a textual representation of patches and return a list of Patch objects.\r\n * @param {string} textline Text representation of patches.\r\n * @return {!Array.<!diff_match_patch.patch_obj>} Array of Patch objects.\r\n * @throws {!Error} If invalid input.\r\n */\r\ndiff_match_patch.prototype.patch_fromText = function(textline) {\r\n  var patches = [];\r\n  if (!textline) {\r\n    return patches;\r\n  }\r\n  var text = textline.split('\\n');\r\n  var textPointer = 0;\r\n  var patchHeader = /^@@ -(\\d+),?(\\d*) \\+(\\d+),?(\\d*) @@$/;\r\n  while (textPointer < text.length) {\r\n    var m = text[textPointer].match(patchHeader);\r\n    if (!m) {\r\n      throw new Error('Invalid patch string: ' + text[textPointer]);\r\n    }\r\n    var patch = new diff_match_patch.patch_obj();\r\n    patches.push(patch);\r\n    patch.start1 = parseInt(m[1], 10);\r\n    if (m[2] === '') {\r\n      patch.start1--;\r\n      patch.length1 = 1;\r\n    } else if (m[2] == '0') {\r\n      patch.length1 = 0;\r\n    } else {\r\n      patch.start1--;\r\n      patch.length1 = parseInt(m[2], 10);\r\n    }\r\n\r\n    patch.start2 = parseInt(m[3], 10);\r\n    if (m[4] === '') {\r\n      patch.start2--;\r\n      patch.length2 = 1;\r\n    } else if (m[4] == '0') {\r\n      patch.length2 = 0;\r\n    } else {\r\n      patch.start2--;\r\n      patch.length2 = parseInt(m[4], 10);\r\n    }\r\n    textPointer++;\r\n\r\n    while (textPointer < text.length) {\r\n      var sign = text[textPointer].charAt(0);\r\n      try {\r\n        var line = decodeURI(text[textPointer].substring(1));\r\n      } catch (ex) {\r\n        // Malformed URI sequence.\r\n        throw new Error('Illegal escape in patch_fromText: ' + line);\r\n      }\r\n      if (sign == '-') {\r\n        // Deletion.\r\n        patch.diffs.push([DIFF_DELETE, line]);\r\n      } else if (sign == '+') {\r\n        // Insertion.\r\n        patch.diffs.push([DIFF_INSERT, line]);\r\n      } else if (sign == ' ') {\r\n        // Minor equality.\r\n        patch.diffs.push([DIFF_EQUAL, line]);\r\n      } else if (sign == '@') {\r\n        // Start of next patch.\r\n        break;\r\n      } else if (sign === '') {\r\n        // Blank line?  Whatever.\r\n      } else {\r\n        // WTF?\r\n        throw new Error('Invalid patch mode \"' + sign + '\" in: ' + line);\r\n      }\r\n      textPointer++;\r\n    }\r\n  }\r\n  return patches;\r\n};\r\n\r\n\r\n/**\r\n * Class representing one patch operation.\r\n * @constructor\r\n */\r\ndiff_match_patch.patch_obj = function() {\r\n  /** @type {!Array.<!diff_match_patch.Diff>} */\r\n  this.diffs = [];\r\n  /** @type {?number} */\r\n  this.start1 = null;\r\n  /** @type {?number} */\r\n  this.start2 = null;\r\n  /** @type {number} */\r\n  this.length1 = 0;\r\n  /** @type {number} */\r\n  this.length2 = 0;\r\n};\r\n\r\n\r\n/**\r\n * Emmulate GNU diff's format.\r\n * Header: @@ -382,8 +481,9 @@\r\n * Indicies are printed as 1-based, not 0-based.\r\n * @return {string} The GNU diff string.\r\n */\r\ndiff_match_patch.patch_obj.prototype.toString = function() {\r\n  var coords1, coords2;\r\n  if (this.length1 === 0) {\r\n    coords1 = this.start1 + ',0';\r\n  } else if (this.length1 == 1) {\r\n    coords1 = this.start1 + 1;\r\n  } else {\r\n    coords1 = (this.start1 + 1) + ',' + this.length1;\r\n  }\r\n  if (this.length2 === 0) {\r\n    coords2 = this.start2 + ',0';\r\n  } else if (this.length2 == 1) {\r\n    coords2 = this.start2 + 1;\r\n  } else {\r\n    coords2 = (this.start2 + 1) + ',' + this.length2;\r\n  }\r\n  var text = ['@@ -' + coords1 + ' +' + coords2 + ' @@\\n'];\r\n  var op;\r\n  // Escape the body of the patch with %xx notation.\r\n  for (var x = 0; x < this.diffs.length; x++) {\r\n    switch (this.diffs[x][0]) {\r\n      case DIFF_INSERT:\r\n        op = '+';\r\n        break;\r\n      case DIFF_DELETE:\r\n        op = '-';\r\n        break;\r\n      case DIFF_EQUAL:\r\n        op = ' ';\r\n        break;\r\n    }\r\n    text[x + 1] = op + encodeURI(this.diffs[x][1]) + '\\n';\r\n  }\r\n  return text.join('').replace(/%20/g, ' ');\r\n};\r\n\r\n\r\n// The following export code was added by @ForbesLindesay\r\nmodule.exports = diff_match_patch;\r\nmodule.exports['diff_match_patch'] = diff_match_patch;\r\nmodule.exports['DIFF_DELETE'] = DIFF_DELETE;\r\nmodule.exports['DIFF_INSERT'] = DIFF_INSERT;\r\nmodule.exports['DIFF_EQUAL'] = DIFF_EQUAL;\n});\n\n/* global diff_match_patch */\nvar TEXT_DIFF = 2;\nvar DEFAULT_MIN_LENGTH = 60;\nvar cachedDiffPatch = null;\n\nvar getDiffMatchPatch = function getDiffMatchPatch(required) {\n  /* jshint camelcase: false */\n\n  if (!cachedDiffPatch) {\n    var instance = void 0;\n    /* eslint-disable camelcase, new-cap */\n    if (typeof diff_match_patch !== 'undefined') {\n      // already loaded, probably a browser\n      instance = typeof diff_match_patch === 'function' ? new diff_match_patch() : new diff_match_patch.diff_match_patch();\n    } else if (diffMatchPatch) {\n      try {\n        instance = diffMatchPatch && new diffMatchPatch();\n      } catch (err) {\n        instance = null;\n      }\n    }\n    /* eslint-enable camelcase, new-cap */\n    if (!instance) {\n      if (!required) {\n        return null;\n      }\n      var error = new Error('text diff_match_patch library not found');\n      // eslint-disable-next-line camelcase\n      error.diff_match_patch_not_found = true;\n      throw error;\n    }\n    cachedDiffPatch = {\n      diff: function diff(txt1, txt2) {\n        return instance.patch_toText(instance.patch_make(txt1, txt2));\n      },\n      patch: function patch(txt1, _patch) {\n        var results = instance.patch_apply(instance.patch_fromText(_patch), txt1);\n        for (var i = 0; i < results[1].length; i++) {\n          if (!results[1][i]) {\n            var _error = new Error('text patch failed');\n            _error.textPatchFailed = true;\n          }\n        }\n        return results[0];\n      }\n    };\n  }\n  return cachedDiffPatch;\n};\n\nvar diffFilter$3 = function textsDiffFilter(context) {\n  if (context.leftType !== 'string') {\n    return;\n  }\n  var minLength = context.options && context.options.textDiff && context.options.textDiff.minLength || DEFAULT_MIN_LENGTH;\n  if (context.left.length < minLength || context.right.length < minLength) {\n    context.setResult([context.left, context.right]).exit();\n    return;\n  }\n  // large text, try to use a text-diff algorithm\n  var diffMatchPatch$$1 = getDiffMatchPatch();\n  if (!diffMatchPatch$$1) {\n    // diff-match-patch library not available,\n    // fallback to regular string replace\n    context.setResult([context.left, context.right]).exit();\n    return;\n  }\n  var diff = diffMatchPatch$$1.diff;\n  context.setResult([diff(context.left, context.right), 0, TEXT_DIFF]).exit();\n};\ndiffFilter$3.filterName = 'texts';\n\nvar patchFilter$3 = function textsPatchFilter(context) {\n  if (context.nested) {\n    return;\n  }\n  if (context.delta[2] !== TEXT_DIFF) {\n    return;\n  }\n\n  // text-diff, use a text-patch algorithm\n  var patch = getDiffMatchPatch(true).patch;\n  context.setResult(patch(context.left, context.delta[0])).exit();\n};\npatchFilter$3.filterName = 'texts';\n\nvar textDeltaReverse = function textDeltaReverse(delta) {\n  var i = void 0;\n  var l = void 0;\n  var lines = void 0;\n  var line = void 0;\n  var lineTmp = void 0;\n  var header = null;\n  var headerRegex = /^@@ +-(\\d+),(\\d+) +\\+(\\d+),(\\d+) +@@$/;\n  var lineHeader = void 0;\n  lines = delta.split('\\n');\n  for (i = 0, l = lines.length; i < l; i++) {\n    line = lines[i];\n    var lineStart = line.slice(0, 1);\n    if (lineStart === '@') {\n      header = headerRegex.exec(line);\n      lineHeader = i;\n\n      // fix header\n      lines[lineHeader] = '@@ -' + header[3] + ',' + header[4] + ' +' + header[1] + ',' + header[2] + ' @@';\n    } else if (lineStart === '+') {\n      lines[i] = '-' + lines[i].slice(1);\n      if (lines[i - 1].slice(0, 1) === '+') {\n        // swap lines to keep default order (-+)\n        lineTmp = lines[i];\n        lines[i] = lines[i - 1];\n        lines[i - 1] = lineTmp;\n      }\n    } else if (lineStart === '-') {\n      lines[i] = '+' + lines[i].slice(1);\n    }\n  }\n  return lines.join('\\n');\n};\n\nvar reverseFilter$3 = function textsReverseFilter(context) {\n  if (context.nested) {\n    return;\n  }\n  if (context.delta[2] !== TEXT_DIFF) {\n    return;\n  }\n\n  // text-diff, use a text-diff algorithm\n  context.setResult([textDeltaReverse(context.delta[0]), 0, TEXT_DIFF]).exit();\n};\nreverseFilter$3.filterName = 'texts';\n\nvar DiffPatcher = function () {\n  function DiffPatcher(options) {\n    classCallCheck(this, DiffPatcher);\n\n    this.processor = new Processor(options);\n    this.processor.pipe(new Pipe('diff').append(collectChildrenDiffFilter, diffFilter, diffFilter$2, diffFilter$3, objectsDiffFilter, diffFilter$1).shouldHaveResult());\n    this.processor.pipe(new Pipe('patch').append(collectChildrenPatchFilter, collectChildrenPatchFilter$1, patchFilter, patchFilter$3, patchFilter$1, patchFilter$2).shouldHaveResult());\n    this.processor.pipe(new Pipe('reverse').append(collectChildrenReverseFilter, collectChildrenReverseFilter$1, reverseFilter, reverseFilter$3, reverseFilter$1, reverseFilter$2).shouldHaveResult());\n  }\n\n  createClass(DiffPatcher, [{\n    key: 'options',\n    value: function options() {\n      var _processor;\n\n      return (_processor = this.processor).options.apply(_processor, arguments);\n    }\n  }, {\n    key: 'diff',\n    value: function diff(left, right) {\n      return this.processor.process(new DiffContext(left, right));\n    }\n  }, {\n    key: 'patch',\n    value: function patch(left, delta) {\n      return this.processor.process(new PatchContext(left, delta));\n    }\n  }, {\n    key: 'reverse',\n    value: function reverse(delta) {\n      return this.processor.process(new ReverseContext(delta));\n    }\n  }, {\n    key: 'unpatch',\n    value: function unpatch(right, delta) {\n      return this.patch(right, this.reverse(delta));\n    }\n  }, {\n    key: 'clone',\n    value: function clone$$1(value) {\n      return clone(value);\n    }\n  }]);\n  return DiffPatcher;\n}();\n\nvar isArray$3 = typeof Array.isArray === 'function' ? Array.isArray : function (a) {\n  return a instanceof Array;\n};\n\nvar getObjectKeys = typeof Object.keys === 'function' ? function (obj) {\n  return Object.keys(obj);\n} : function (obj) {\n  var names = [];\n  for (var property in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, property)) {\n      names.push(property);\n    }\n  }\n  return names;\n};\n\nvar trimUnderscore = function trimUnderscore(str) {\n  if (str.substr(0, 1) === '_') {\n    return str.slice(1);\n  }\n  return str;\n};\n\nvar arrayKeyToSortNumber = function arrayKeyToSortNumber(key) {\n  if (key === '_t') {\n    return -1;\n  } else {\n    if (key.substr(0, 1) === '_') {\n      return parseInt(key.slice(1), 10);\n    } else {\n      return parseInt(key, 10) + 0.1;\n    }\n  }\n};\n\nvar arrayKeyComparer = function arrayKeyComparer(key1, key2) {\n  return arrayKeyToSortNumber(key1) - arrayKeyToSortNumber(key2);\n};\n\nvar BaseFormatter = function () {\n  function BaseFormatter() {\n    classCallCheck(this, BaseFormatter);\n  }\n\n  createClass(BaseFormatter, [{\n    key: 'format',\n    value: function format(delta, left) {\n      var context = {};\n      this.prepareContext(context);\n      this.recurse(context, delta, left);\n      return this.finalize(context);\n    }\n  }, {\n    key: 'prepareContext',\n    value: function prepareContext(context) {\n      context.buffer = [];\n      context.out = function () {\n        var _buffer;\n\n        (_buffer = this.buffer).push.apply(_buffer, arguments);\n      };\n    }\n  }, {\n    key: 'typeFormattterNotFound',\n    value: function typeFormattterNotFound(context, deltaType) {\n      throw new Error('cannot format delta type: ' + deltaType);\n    }\n  }, {\n    key: 'typeFormattterErrorFormatter',\n    value: function typeFormattterErrorFormatter(context, err) {\n      return err.toString();\n    }\n  }, {\n    key: 'finalize',\n    value: function finalize(_ref) {\n      var buffer = _ref.buffer;\n\n      if (isArray$3(buffer)) {\n        return buffer.join('');\n      }\n    }\n  }, {\n    key: 'recurse',\n    value: function recurse(context, delta, left, key, leftKey, movedFrom, isLast) {\n      var useMoveOriginHere = delta && movedFrom;\n      var leftValue = useMoveOriginHere ? movedFrom.value : left;\n\n      if (typeof delta === 'undefined' && typeof key === 'undefined') {\n        return undefined;\n      }\n\n      var type = this.getDeltaType(delta, movedFrom);\n      var nodeType = type === 'node' ? delta._t === 'a' ? 'array' : 'object' : '';\n\n      if (typeof key !== 'undefined') {\n        this.nodeBegin(context, key, leftKey, type, nodeType, isLast);\n      } else {\n        this.rootBegin(context, type, nodeType);\n      }\n\n      var typeFormattter = void 0;\n      try {\n        typeFormattter = this['format_' + type] || this.typeFormattterNotFound(context, type);\n        typeFormattter.call(this, context, delta, leftValue, key, leftKey, movedFrom);\n      } catch (err) {\n        this.typeFormattterErrorFormatter(context, err, delta, leftValue, key, leftKey, movedFrom);\n        if (typeof console !== 'undefined' && console.error) {\n          console.error(err.stack);\n        }\n      }\n\n      if (typeof key !== 'undefined') {\n        this.nodeEnd(context, key, leftKey, type, nodeType, isLast);\n      } else {\n        this.rootEnd(context, type, nodeType);\n      }\n    }\n  }, {\n    key: 'formatDeltaChildren',\n    value: function formatDeltaChildren(context, delta, left) {\n      var self = this;\n      this.forEachDeltaKey(delta, left, function (key, leftKey, movedFrom, isLast) {\n        self.recurse(context, delta[key], left ? left[leftKey] : undefined, key, leftKey, movedFrom, isLast);\n      });\n    }\n  }, {\n    key: 'forEachDeltaKey',\n    value: function forEachDeltaKey(delta, left, fn) {\n      var keys = getObjectKeys(delta);\n      var arrayKeys = delta._t === 'a';\n      var moveDestinations = {};\n      var name = void 0;\n      if (typeof left !== 'undefined') {\n        for (name in left) {\n          if (Object.prototype.hasOwnProperty.call(left, name)) {\n            if (typeof delta[name] === 'undefined' && (!arrayKeys || typeof delta['_' + name] === 'undefined')) {\n              keys.push(name);\n            }\n          }\n        }\n      }\n      // look for move destinations\n      for (name in delta) {\n        if (Object.prototype.hasOwnProperty.call(delta, name)) {\n          var value = delta[name];\n          if (isArray$3(value) && value[2] === 3) {\n            moveDestinations[value[1].toString()] = {\n              key: name,\n              value: left && left[parseInt(name.substr(1))]\n            };\n            if (this.includeMoveDestinations !== false) {\n              if (typeof left === 'undefined' && typeof delta[value[1]] === 'undefined') {\n                keys.push(value[1].toString());\n              }\n            }\n          }\n        }\n      }\n      if (arrayKeys) {\n        keys.sort(arrayKeyComparer);\n      } else {\n        keys.sort();\n      }\n      for (var index = 0, length = keys.length; index < length; index++) {\n        var key = keys[index];\n        if (arrayKeys && key === '_t') {\n          continue;\n        }\n        var leftKey = arrayKeys ? typeof key === 'number' ? key : parseInt(trimUnderscore(key), 10) : key;\n        var isLast = index === length - 1;\n        fn(key, leftKey, moveDestinations[leftKey], isLast);\n      }\n    }\n  }, {\n    key: 'getDeltaType',\n    value: function getDeltaType(delta, movedFrom) {\n      if (typeof delta === 'undefined') {\n        if (typeof movedFrom !== 'undefined') {\n          return 'movedestination';\n        }\n        return 'unchanged';\n      }\n      if (isArray$3(delta)) {\n        if (delta.length === 1) {\n          return 'added';\n        }\n        if (delta.length === 2) {\n          return 'modified';\n        }\n        if (delta.length === 3 && delta[2] === 0) {\n          return 'deleted';\n        }\n        if (delta.length === 3 && delta[2] === 2) {\n          return 'textdiff';\n        }\n        if (delta.length === 3 && delta[2] === 3) {\n          return 'moved';\n        }\n      } else if ((typeof delta === 'undefined' ? 'undefined' : _typeof(delta)) === 'object') {\n        return 'node';\n      }\n      return 'unknown';\n    }\n  }, {\n    key: 'parseTextDiff',\n    value: function parseTextDiff(value) {\n      var output = [];\n      var lines = value.split('\\n@@ ');\n      for (var i = 0, l = lines.length; i < l; i++) {\n        var line = lines[i];\n        var lineOutput = {\n          pieces: []\n        };\n        var location = /^(?:@@ )?[-+]?(\\d+),(\\d+)/.exec(line).slice(1);\n        lineOutput.location = {\n          line: location[0],\n          chr: location[1]\n        };\n        var pieces = line.split('\\n').slice(1);\n        for (var pieceIndex = 0, piecesLength = pieces.length; pieceIndex < piecesLength; pieceIndex++) {\n          var piece = pieces[pieceIndex];\n          if (!piece.length) {\n            continue;\n          }\n          var pieceOutput = {\n            type: 'context'\n          };\n          if (piece.substr(0, 1) === '+') {\n            pieceOutput.type = 'added';\n          } else if (piece.substr(0, 1) === '-') {\n            pieceOutput.type = 'deleted';\n          }\n          pieceOutput.text = piece.slice(1);\n          lineOutput.pieces.push(pieceOutput);\n        }\n        output.push(lineOutput);\n      }\n      return output;\n    }\n  }]);\n  return BaseFormatter;\n}();\n\n\n\nvar base = Object.freeze({\n\tdefault: BaseFormatter\n});\n\nvar HtmlFormatter = function (_BaseFormatter) {\n  inherits(HtmlFormatter, _BaseFormatter);\n\n  function HtmlFormatter() {\n    classCallCheck(this, HtmlFormatter);\n    return possibleConstructorReturn(this, (HtmlFormatter.__proto__ || Object.getPrototypeOf(HtmlFormatter)).apply(this, arguments));\n  }\n\n  createClass(HtmlFormatter, [{\n    key: 'typeFormattterErrorFormatter',\n    value: function typeFormattterErrorFormatter(context, err) {\n      context.out('<pre class=\"jsondiffpatch-error\">' + err + '</pre>');\n    }\n  }, {\n    key: 'formatValue',\n    value: function formatValue(context, value) {\n      context.out('<pre>' + htmlEscape(JSON.stringify(value, null, 2)) + '</pre>');\n    }\n  }, {\n    key: 'formatTextDiffString',\n    value: function formatTextDiffString(context, value) {\n      var lines = this.parseTextDiff(value);\n      context.out('<ul class=\"jsondiffpatch-textdiff\">');\n      for (var i = 0, l = lines.length; i < l; i++) {\n        var line = lines[i];\n        context.out('<li><div class=\"jsondiffpatch-textdiff-location\">' + ('<span class=\"jsondiffpatch-textdiff-line-number\">' + line.location.line + '</span><span class=\"jsondiffpatch-textdiff-char\">' + line.location.chr + '</span></div><div class=\"jsondiffpatch-textdiff-line\">'));\n        var pieces = line.pieces;\n        for (var pieceIndex = 0, piecesLength = pieces.length; pieceIndex < piecesLength; pieceIndex++) {\n          /* global decodeURI */\n          var piece = pieces[pieceIndex];\n          context.out('<span class=\"jsondiffpatch-textdiff-' + piece.type + '\">' + htmlEscape(decodeURI(piece.text)) + '</span>');\n        }\n        context.out('</div></li>');\n      }\n      context.out('</ul>');\n    }\n  }, {\n    key: 'rootBegin',\n    value: function rootBegin(context, type, nodeType) {\n      var nodeClass = 'jsondiffpatch-' + type + (nodeType ? ' jsondiffpatch-child-node-type-' + nodeType : '');\n      context.out('<div class=\"jsondiffpatch-delta ' + nodeClass + '\">');\n    }\n  }, {\n    key: 'rootEnd',\n    value: function rootEnd(context) {\n      context.out('</div>' + (context.hasArrows ? '<script type=\"text/javascript\">setTimeout(' + (adjustArrows.toString() + ',10);</script>') : ''));\n    }\n  }, {\n    key: 'nodeBegin',\n    value: function nodeBegin(context, key, leftKey, type, nodeType) {\n      var nodeClass = 'jsondiffpatch-' + type + (nodeType ? ' jsondiffpatch-child-node-type-' + nodeType : '');\n      context.out('<li class=\"' + nodeClass + '\" data-key=\"' + leftKey + '\">' + ('<div class=\"jsondiffpatch-property-name\">' + leftKey + '</div>'));\n    }\n  }, {\n    key: 'nodeEnd',\n    value: function nodeEnd(context) {\n      context.out('</li>');\n    }\n\n    /* jshint camelcase: false */\n    /* eslint-disable camelcase */\n\n  }, {\n    key: 'format_unchanged',\n    value: function format_unchanged(context, delta, left) {\n      if (typeof left === 'undefined') {\n        return;\n      }\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatValue(context, left);\n      context.out('</div>');\n    }\n  }, {\n    key: 'format_movedestination',\n    value: function format_movedestination(context, delta, left) {\n      if (typeof left === 'undefined') {\n        return;\n      }\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatValue(context, left);\n      context.out('</div>');\n    }\n  }, {\n    key: 'format_node',\n    value: function format_node(context, delta, left) {\n      // recurse\n      var nodeType = delta._t === 'a' ? 'array' : 'object';\n      context.out('<ul class=\"jsondiffpatch-node jsondiffpatch-node-type-' + nodeType + '\">');\n      this.formatDeltaChildren(context, delta, left);\n      context.out('</ul>');\n    }\n  }, {\n    key: 'format_added',\n    value: function format_added(context, delta) {\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatValue(context, delta[0]);\n      context.out('</div>');\n    }\n  }, {\n    key: 'format_modified',\n    value: function format_modified(context, delta) {\n      context.out('<div class=\"jsondiffpatch-value jsondiffpatch-left-value\">');\n      this.formatValue(context, delta[0]);\n      context.out('</div>' + '<div class=\"jsondiffpatch-value jsondiffpatch-right-value\">');\n      this.formatValue(context, delta[1]);\n      context.out('</div>');\n    }\n  }, {\n    key: 'format_deleted',\n    value: function format_deleted(context, delta) {\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatValue(context, delta[0]);\n      context.out('</div>');\n    }\n  }, {\n    key: 'format_moved',\n    value: function format_moved(context, delta) {\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatValue(context, delta[0]);\n      context.out('</div><div class=\"jsondiffpatch-moved-destination\">' + delta[1] + '</div>');\n\n      // draw an SVG arrow from here to move destination\n      context.out(\n      /* jshint multistr: true */\n      '<div class=\"jsondiffpatch-arrow\" ' + 'style=\"position: relative; left: -34px;\">\\n          <svg width=\"30\" height=\"60\" ' + 'style=\"position: absolute; display: none;\">\\n          <defs>\\n              <marker id=\"markerArrow\" markerWidth=\"8\" markerHeight=\"8\"\\n                 refx=\"2\" refy=\"4\"\\n                     orient=\"auto\" markerUnits=\"userSpaceOnUse\">\\n                  <path d=\"M1,1 L1,7 L7,4 L1,1\" style=\"fill: #339;\" />\\n              </marker>\\n          </defs>\\n          <path d=\"M30,0 Q-10,25 26,50\"\\n            style=\"stroke: #88f; stroke-width: 2px; fill: none; ' + 'stroke-opacity: 0.5; marker-end: url(#markerArrow);\"\\n          ></path>\\n          </svg>\\n      </div>');\n      context.hasArrows = true;\n    }\n  }, {\n    key: 'format_textdiff',\n    value: function format_textdiff(context, delta) {\n      context.out('<div class=\"jsondiffpatch-value\">');\n      this.formatTextDiffString(context, delta[0]);\n      context.out('</div>');\n    }\n  }]);\n  return HtmlFormatter;\n}(BaseFormatter);\n\nfunction htmlEscape(text) {\n  var html = text;\n  var replacements = [[/&/g, '&amp;'], [/</g, '&lt;'], [/>/g, '&gt;'], [/'/g, '&apos;'], [/\"/g, '&quot;']];\n  for (var i = 0; i < replacements.length; i++) {\n    html = html.replace(replacements[i][0], replacements[i][1]);\n  }\n  return html;\n}\n\nvar adjustArrows = function jsondiffpatchHtmlFormatterAdjustArrows(nodeArg) {\n  var node = nodeArg || document;\n  var getElementText = function getElementText(_ref) {\n    var textContent = _ref.textContent,\n        innerText = _ref.innerText;\n    return textContent || innerText;\n  };\n  var eachByQuery = function eachByQuery(el, query, fn) {\n    var elems = el.querySelectorAll(query);\n    for (var i = 0, l = elems.length; i < l; i++) {\n      fn(elems[i]);\n    }\n  };\n  var eachChildren = function eachChildren(_ref2, fn) {\n    var children = _ref2.children;\n\n    for (var i = 0, l = children.length; i < l; i++) {\n      fn(children[i], i);\n    }\n  };\n  eachByQuery(node, '.jsondiffpatch-arrow', function (_ref3) {\n    var parentNode = _ref3.parentNode,\n        children = _ref3.children,\n        style = _ref3.style;\n\n    var arrowParent = parentNode;\n    var svg = children[0];\n    var path = svg.children[1];\n    svg.style.display = 'none';\n    var destination = getElementText(arrowParent.querySelector('.jsondiffpatch-moved-destination'));\n    var container = arrowParent.parentNode;\n    var destinationElem = void 0;\n    eachChildren(container, function (child) {\n      if (child.getAttribute('data-key') === destination) {\n        destinationElem = child;\n      }\n    });\n    if (!destinationElem) {\n      return;\n    }\n    try {\n      var distance = destinationElem.offsetTop - arrowParent.offsetTop;\n      svg.setAttribute('height', Math.abs(distance) + 6);\n      style.top = -8 + (distance > 0 ? 0 : distance) + 'px';\n      var curve = distance > 0 ? 'M30,0 Q-10,' + Math.round(distance / 2) + ' 26,' + (distance - 4) : 'M30,' + -distance + ' Q-10,' + Math.round(-distance / 2) + ' 26,4';\n      path.setAttribute('d', curve);\n      svg.style.display = '';\n    } catch (err) {}\n  });\n};\n\n/* jshint camelcase: true */\n/* eslint-enable camelcase */\n\nvar showUnchanged = function showUnchanged(show, node, delay) {\n  var el = node || document.body;\n  var prefix = 'jsondiffpatch-unchanged-';\n  var classes = {\n    showing: prefix + 'showing',\n    hiding: prefix + 'hiding',\n    visible: prefix + 'visible',\n    hidden: prefix + 'hidden'\n  };\n  var list = el.classList;\n  if (!list) {\n    return;\n  }\n  if (!delay) {\n    list.remove(classes.showing);\n    list.remove(classes.hiding);\n    list.remove(classes.visible);\n    list.remove(classes.hidden);\n    if (show === false) {\n      list.add(classes.hidden);\n    }\n    return;\n  }\n  if (show === false) {\n    list.remove(classes.showing);\n    list.add(classes.visible);\n    setTimeout(function () {\n      list.add(classes.hiding);\n    }, 10);\n  } else {\n    list.remove(classes.hiding);\n    list.add(classes.showing);\n    list.remove(classes.hidden);\n  }\n  var intervalId = setInterval(function () {\n    adjustArrows(el);\n  }, 100);\n  setTimeout(function () {\n    list.remove(classes.showing);\n    list.remove(classes.hiding);\n    if (show === false) {\n      list.add(classes.hidden);\n      list.remove(classes.visible);\n    } else {\n      list.add(classes.visible);\n      list.remove(classes.hidden);\n    }\n    setTimeout(function () {\n      list.remove(classes.visible);\n      clearInterval(intervalId);\n    }, delay + 400);\n  }, delay);\n};\n\nvar hideUnchanged = function hideUnchanged(node, delay) {\n  return showUnchanged(false, node, delay);\n};\n\nvar defaultInstance = void 0;\n\nfunction format(delta, left) {\n  if (!defaultInstance) {\n    defaultInstance = new HtmlFormatter();\n  }\n  return defaultInstance.format(delta, left);\n}\n\n\n\nvar html = Object.freeze({\n\tshowUnchanged: showUnchanged,\n\thideUnchanged: hideUnchanged,\n\tdefault: HtmlFormatter,\n\tformat: format\n});\n\nvar AnnotatedFormatter = function (_BaseFormatter) {\n  inherits(AnnotatedFormatter, _BaseFormatter);\n\n  function AnnotatedFormatter() {\n    classCallCheck(this, AnnotatedFormatter);\n\n    var _this = possibleConstructorReturn(this, (AnnotatedFormatter.__proto__ || Object.getPrototypeOf(AnnotatedFormatter)).call(this));\n\n    _this.includeMoveDestinations = false;\n    return _this;\n  }\n\n  createClass(AnnotatedFormatter, [{\n    key: 'prepareContext',\n    value: function prepareContext(context) {\n      get(AnnotatedFormatter.prototype.__proto__ || Object.getPrototypeOf(AnnotatedFormatter.prototype), 'prepareContext', this).call(this, context);\n      context.indent = function (levels) {\n        this.indentLevel = (this.indentLevel || 0) + (typeof levels === 'undefined' ? 1 : levels);\n        this.indentPad = new Array(this.indentLevel + 1).join('&nbsp;&nbsp;');\n      };\n      context.row = function (json, htmlNote) {\n        context.out('<tr><td style=\"white-space: nowrap;\">' + '<pre class=\"jsondiffpatch-annotated-indent\"' + ' style=\"display: inline-block\">');\n        context.out(context.indentPad);\n        context.out('</pre><pre style=\"display: inline-block\">');\n        context.out(json);\n        context.out('</pre></td><td class=\"jsondiffpatch-delta-note\"><div>');\n        context.out(htmlNote);\n        context.out('</div></td></tr>');\n      };\n    }\n  }, {\n    key: 'typeFormattterErrorFormatter',\n    value: function typeFormattterErrorFormatter(context, err) {\n      context.row('', '<pre class=\"jsondiffpatch-error\">' + err + '</pre>');\n    }\n  }, {\n    key: 'formatTextDiffString',\n    value: function formatTextDiffString(context, value) {\n      var lines = this.parseTextDiff(value);\n      context.out('<ul class=\"jsondiffpatch-textdiff\">');\n      for (var i = 0, l = lines.length; i < l; i++) {\n        var line = lines[i];\n        context.out('<li><div class=\"jsondiffpatch-textdiff-location\">' + ('<span class=\"jsondiffpatch-textdiff-line-number\">' + line.location.line + '</span><span class=\"jsondiffpatch-textdiff-char\">' + line.location.chr + '</span></div><div class=\"jsondiffpatch-textdiff-line\">'));\n        var pieces = line.pieces;\n        for (var pieceIndex = 0, piecesLength = pieces.length; pieceIndex < piecesLength; pieceIndex++) {\n          var piece = pieces[pieceIndex];\n          context.out('<span class=\"jsondiffpatch-textdiff-' + piece.type + '\">' + piece.text + '</span>');\n        }\n        context.out('</div></li>');\n      }\n      context.out('</ul>');\n    }\n  }, {\n    key: 'rootBegin',\n    value: function rootBegin(context, type, nodeType) {\n      context.out('<table class=\"jsondiffpatch-annotated-delta\">');\n      if (type === 'node') {\n        context.row('{');\n        context.indent();\n      }\n      if (nodeType === 'array') {\n        context.row('\"_t\": \"a\",', 'Array delta (member names indicate array indices)');\n      }\n    }\n  }, {\n    key: 'rootEnd',\n    value: function rootEnd(context, type) {\n      if (type === 'node') {\n        context.indent(-1);\n        context.row('}');\n      }\n      context.out('</table>');\n    }\n  }, {\n    key: 'nodeBegin',\n    value: function nodeBegin(context, key, leftKey, type, nodeType) {\n      context.row('&quot;' + key + '&quot;: {');\n      if (type === 'node') {\n        context.indent();\n      }\n      if (nodeType === 'array') {\n        context.row('\"_t\": \"a\",', 'Array delta (member names indicate array indices)');\n      }\n    }\n  }, {\n    key: 'nodeEnd',\n    value: function nodeEnd(context, key, leftKey, type, nodeType, isLast) {\n      if (type === 'node') {\n        context.indent(-1);\n      }\n      context.row('}' + (isLast ? '' : ','));\n    }\n\n    /* jshint camelcase: false */\n\n    /* eslint-disable camelcase */\n\n  }, {\n    key: 'format_unchanged',\n    value: function format_unchanged() {}\n  }, {\n    key: 'format_movedestination',\n    value: function format_movedestination() {}\n  }, {\n    key: 'format_node',\n    value: function format_node(context, delta, left) {\n      // recurse\n      this.formatDeltaChildren(context, delta, left);\n    }\n  }]);\n  return AnnotatedFormatter;\n}(BaseFormatter);\n\n/* eslint-enable camelcase */\n\nvar wrapPropertyName = function wrapPropertyName(name) {\n  return '<pre style=\"display:inline-block\">&quot;' + name + '&quot;</pre>';\n};\n\nvar deltaAnnotations = {\n  added: function added(delta, left, key, leftKey) {\n    var formatLegend = ' <pre>([newValue])</pre>';\n    if (typeof leftKey === 'undefined') {\n      return 'new value' + formatLegend;\n    }\n    if (typeof leftKey === 'number') {\n      return 'insert at index ' + leftKey + formatLegend;\n    }\n    return 'add property ' + wrapPropertyName(leftKey) + formatLegend;\n  },\n  modified: function modified(delta, left, key, leftKey) {\n    var formatLegend = ' <pre>([previousValue, newValue])</pre>';\n    if (typeof leftKey === 'undefined') {\n      return 'modify value' + formatLegend;\n    }\n    if (typeof leftKey === 'number') {\n      return 'modify at index ' + leftKey + formatLegend;\n    }\n    return 'modify property ' + wrapPropertyName(leftKey) + formatLegend;\n  },\n  deleted: function deleted(delta, left, key, leftKey) {\n    var formatLegend = ' <pre>([previousValue, 0, 0])</pre>';\n    if (typeof leftKey === 'undefined') {\n      return 'delete value' + formatLegend;\n    }\n    if (typeof leftKey === 'number') {\n      return 'remove index ' + leftKey + formatLegend;\n    }\n    return 'delete property ' + wrapPropertyName(leftKey) + formatLegend;\n  },\n  moved: function moved(delta, left, key, leftKey) {\n    return 'move from <span title=\"(position to remove at original state)\">' + ('index ' + leftKey + '</span> to <span title=\"(position to insert at final') + (' state)\">index ' + delta[1] + '</span>');\n  },\n  textdiff: function textdiff(delta, left, key, leftKey) {\n    var location = typeof leftKey === 'undefined' ? '' : typeof leftKey === 'number' ? ' at index ' + leftKey : ' at property ' + wrapPropertyName(leftKey);\n    return 'text diff' + location + ', format is <a href=\"https://code.google.com/' + 'p/google-diff-match-patch/wiki/Unidiff\">a variation of Unidiff</a>';\n  }\n};\n\nvar formatAnyChange = function formatAnyChange(context, delta) {\n  var deltaType = this.getDeltaType(delta);\n  var annotator = deltaAnnotations[deltaType];\n  var htmlNote = annotator && annotator.apply(annotator, Array.prototype.slice.call(arguments, 1));\n  var json = JSON.stringify(delta, null, 2);\n  if (deltaType === 'textdiff') {\n    // split text diffs lines\n    json = json.split('\\\\n').join('\\\\n\"+\\n   \"');\n  }\n  context.indent();\n  context.row(json, htmlNote);\n  context.indent(-1);\n};\n\n/* eslint-disable camelcase */\nAnnotatedFormatter.prototype.format_added = formatAnyChange;\nAnnotatedFormatter.prototype.format_modified = formatAnyChange;\nAnnotatedFormatter.prototype.format_deleted = formatAnyChange;\nAnnotatedFormatter.prototype.format_moved = formatAnyChange;\nAnnotatedFormatter.prototype.format_textdiff = formatAnyChange;\nvar defaultInstance$1 = void 0;\n\nfunction format$1(delta, left) {\n  if (!defaultInstance$1) {\n    defaultInstance$1 = new AnnotatedFormatter();\n  }\n  return defaultInstance$1.format(delta, left);\n}\n\n\n\nvar annotated = Object.freeze({\n\tdefault: AnnotatedFormatter,\n\tformat: format$1\n});\n\nvar OPERATIONS = {\n  add: 'add',\n  remove: 'remove',\n  replace: 'replace',\n  move: 'move'\n};\n\nvar JSONFormatter = function (_BaseFormatter) {\n  inherits(JSONFormatter, _BaseFormatter);\n\n  function JSONFormatter() {\n    classCallCheck(this, JSONFormatter);\n\n    var _this = possibleConstructorReturn(this, (JSONFormatter.__proto__ || Object.getPrototypeOf(JSONFormatter)).call(this));\n\n    _this.includeMoveDestinations = true;\n    return _this;\n  }\n\n  createClass(JSONFormatter, [{\n    key: 'prepareContext',\n    value: function prepareContext(context) {\n      get(JSONFormatter.prototype.__proto__ || Object.getPrototypeOf(JSONFormatter.prototype), 'prepareContext', this).call(this, context);\n      context.result = [];\n      context.path = [];\n      context.pushCurrentOp = function (obj) {\n        var op = obj.op,\n            value = obj.value;\n\n        var val = {\n          op: op,\n          path: this.currentPath()\n        };\n        if (typeof value !== 'undefined') {\n          val.value = value;\n        }\n        this.result.push(val);\n      };\n\n      context.pushMoveOp = function (to) {\n        var from = this.currentPath();\n        this.result.push({\n          op: OPERATIONS.move,\n          from: from,\n          path: this.toPath(to)\n        });\n      };\n\n      context.currentPath = function () {\n        return '/' + this.path.join('/');\n      };\n\n      context.toPath = function (toPath) {\n        var to = this.path.slice();\n        to[to.length - 1] = toPath;\n        return '/' + to.join('/');\n      };\n    }\n  }, {\n    key: 'typeFormattterErrorFormatter',\n    value: function typeFormattterErrorFormatter(context, err) {\n      context.out('[ERROR] ' + err);\n    }\n  }, {\n    key: 'rootBegin',\n    value: function rootBegin() {}\n  }, {\n    key: 'rootEnd',\n    value: function rootEnd() {}\n  }, {\n    key: 'nodeBegin',\n    value: function nodeBegin(_ref, key, leftKey) {\n      var path = _ref.path;\n\n      path.push(leftKey);\n    }\n  }, {\n    key: 'nodeEnd',\n    value: function nodeEnd(_ref2) {\n      var path = _ref2.path;\n\n      path.pop();\n    }\n\n    /* jshint camelcase: false */\n    /* eslint-disable camelcase */\n\n  }, {\n    key: 'format_unchanged',\n    value: function format_unchanged() {}\n  }, {\n    key: 'format_movedestination',\n    value: function format_movedestination() {}\n  }, {\n    key: 'format_node',\n    value: function format_node(context, delta, left) {\n      this.formatDeltaChildren(context, delta, left);\n    }\n  }, {\n    key: 'format_added',\n    value: function format_added(context, delta) {\n      context.pushCurrentOp({ op: OPERATIONS.add, value: delta[0] });\n    }\n  }, {\n    key: 'format_modified',\n    value: function format_modified(context, delta) {\n      context.pushCurrentOp({ op: OPERATIONS.replace, value: delta[1] });\n    }\n  }, {\n    key: 'format_deleted',\n    value: function format_deleted(context) {\n      context.pushCurrentOp({ op: OPERATIONS.remove });\n    }\n  }, {\n    key: 'format_moved',\n    value: function format_moved(context, delta) {\n      var to = delta[1];\n      context.pushMoveOp(to);\n    }\n  }, {\n    key: 'format_textdiff',\n    value: function format_textdiff() {\n      throw new Error('Not implemented');\n    }\n  }, {\n    key: 'format',\n    value: function format(delta, left) {\n      var context = {};\n      this.prepareContext(context);\n      this.recurse(context, delta, left);\n      return context.result;\n    }\n  }]);\n  return JSONFormatter;\n}(BaseFormatter);\n\nvar last = function last(arr) {\n  return arr[arr.length - 1];\n};\n\nvar sortBy = function sortBy(arr, pred) {\n  arr.sort(pred);\n  return arr;\n};\n\nvar compareByIndexDesc = function compareByIndexDesc(indexA, indexB) {\n  var lastA = parseInt(indexA, 10);\n  var lastB = parseInt(indexB, 10);\n  if (!(isNaN(lastA) || isNaN(lastB))) {\n    return lastB - lastA;\n  } else {\n    return 0;\n  }\n};\n\nvar opsByDescendingOrder = function opsByDescendingOrder(removeOps) {\n  return sortBy(removeOps, function (a, b) {\n    var splitA = a.path.split('/');\n    var splitB = b.path.split('/');\n    if (splitA.length !== splitB.length) {\n      return splitA.length - splitB.length;\n    } else {\n      return compareByIndexDesc(last(splitA), last(splitB));\n    }\n  });\n};\n\nvar partitionOps = function partitionOps(arr, fns) {\n  var initArr = Array(fns.length + 1).fill().map(function () {\n    return [];\n  });\n  return arr.map(function (item) {\n    var position = fns.map(function (fn) {\n      return fn(item);\n    }).indexOf(true);\n    if (position < 0) {\n      position = fns.length;\n    }\n    return { item: item, position: position };\n  }).reduce(function (acc, item) {\n    acc[item.position].push(item.item);\n    return acc;\n  }, initArr);\n};\nvar isMoveOp = function isMoveOp(_ref3) {\n  var op = _ref3.op;\n  return op === 'move';\n};\nvar isRemoveOp = function isRemoveOp(_ref4) {\n  var op = _ref4.op;\n  return op === 'remove';\n};\n\nvar reorderOps = function reorderOps(diff) {\n  var _partitionOps = partitionOps(diff, [isMoveOp, isRemoveOp]),\n      _partitionOps2 = slicedToArray(_partitionOps, 3),\n      moveOps = _partitionOps2[0],\n      removedOps = _partitionOps2[1],\n      restOps = _partitionOps2[2];\n\n  var removeOpsReverse = opsByDescendingOrder(removedOps);\n  return [].concat(toConsumableArray(removeOpsReverse), toConsumableArray(moveOps), toConsumableArray(restOps));\n};\n\nvar defaultInstance$2 = void 0;\n\nvar format$2 = function format(delta, left) {\n  if (!defaultInstance$2) {\n    defaultInstance$2 = new JSONFormatter();\n  }\n  return reorderOps(defaultInstance$2.format(delta, left));\n};\n\nvar log = function log(delta, left) {\n  console.log(format$2(delta, left));\n};\n\n\n\nvar jsonpatch = Object.freeze({\n\tdefault: JSONFormatter,\n\tpartitionOps: partitionOps,\n\tformat: format$2,\n\tlog: log\n});\n\nfunction chalkColor(name) {\n  return chalk && chalk[name] || function () {\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return args;\n  };\n}\n\nvar colors = {\n  added: chalkColor('green'),\n  deleted: chalkColor('red'),\n  movedestination: chalkColor('gray'),\n  moved: chalkColor('yellow'),\n  unchanged: chalkColor('gray'),\n  error: chalkColor('white.bgRed'),\n  textDiffLine: chalkColor('gray')\n};\n\nvar ConsoleFormatter = function (_BaseFormatter) {\n  inherits(ConsoleFormatter, _BaseFormatter);\n\n  function ConsoleFormatter() {\n    classCallCheck(this, ConsoleFormatter);\n\n    var _this = possibleConstructorReturn(this, (ConsoleFormatter.__proto__ || Object.getPrototypeOf(ConsoleFormatter)).call(this));\n\n    _this.includeMoveDestinations = false;\n    return _this;\n  }\n\n  createClass(ConsoleFormatter, [{\n    key: 'prepareContext',\n    value: function prepareContext(context) {\n      get(ConsoleFormatter.prototype.__proto__ || Object.getPrototypeOf(ConsoleFormatter.prototype), 'prepareContext', this).call(this, context);\n      context.indent = function (levels) {\n        this.indentLevel = (this.indentLevel || 0) + (typeof levels === 'undefined' ? 1 : levels);\n        this.indentPad = new Array(this.indentLevel + 1).join('  ');\n        this.outLine();\n      };\n      context.outLine = function () {\n        this.buffer.push('\\n' + (this.indentPad || ''));\n      };\n      context.out = function () {\n        for (var _len2 = arguments.length, args = Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n          args[_key2] = arguments[_key2];\n        }\n\n        for (var i = 0, l = args.length; i < l; i++) {\n          var lines = args[i].split('\\n');\n          var text = lines.join('\\n' + (this.indentPad || ''));\n          if (this.color && this.color[0]) {\n            text = this.color[0](text);\n          }\n          this.buffer.push(text);\n        }\n      };\n      context.pushColor = function (color) {\n        this.color = this.color || [];\n        this.color.unshift(color);\n      };\n      context.popColor = function () {\n        this.color = this.color || [];\n        this.color.shift();\n      };\n    }\n  }, {\n    key: 'typeFormattterErrorFormatter',\n    value: function typeFormattterErrorFormatter(context, err) {\n      context.pushColor(colors.error);\n      context.out('[ERROR]' + err);\n      context.popColor();\n    }\n  }, {\n    key: 'formatValue',\n    value: function formatValue(context, value) {\n      context.out(JSON.stringify(value, null, 2));\n    }\n  }, {\n    key: 'formatTextDiffString',\n    value: function formatTextDiffString(context, value) {\n      var lines = this.parseTextDiff(value);\n      context.indent();\n      for (var i = 0, l = lines.length; i < l; i++) {\n        var line = lines[i];\n        context.pushColor(colors.textDiffLine);\n        context.out(line.location.line + ',' + line.location.chr + ' ');\n        context.popColor();\n        var pieces = line.pieces;\n        for (var pieceIndex = 0, piecesLength = pieces.length; pieceIndex < piecesLength; pieceIndex++) {\n          var piece = pieces[pieceIndex];\n          context.pushColor(colors[piece.type]);\n          context.out(piece.text);\n          context.popColor();\n        }\n        if (i < l - 1) {\n          context.outLine();\n        }\n      }\n      context.indent(-1);\n    }\n  }, {\n    key: 'rootBegin',\n    value: function rootBegin(context, type, nodeType) {\n      context.pushColor(colors[type]);\n      if (type === 'node') {\n        context.out(nodeType === 'array' ? '[' : '{');\n        context.indent();\n      }\n    }\n  }, {\n    key: 'rootEnd',\n    value: function rootEnd(context, type, nodeType) {\n      if (type === 'node') {\n        context.indent(-1);\n        context.out(nodeType === 'array' ? ']' : '}');\n      }\n      context.popColor();\n    }\n  }, {\n    key: 'nodeBegin',\n    value: function nodeBegin(context, key, leftKey, type, nodeType) {\n      context.pushColor(colors[type]);\n      context.out(leftKey + ': ');\n      if (type === 'node') {\n        context.out(nodeType === 'array' ? '[' : '{');\n        context.indent();\n      }\n    }\n  }, {\n    key: 'nodeEnd',\n    value: function nodeEnd(context, key, leftKey, type, nodeType, isLast) {\n      if (type === 'node') {\n        context.indent(-1);\n        context.out(nodeType === 'array' ? ']' : '}' + (isLast ? '' : ','));\n      }\n      if (!isLast) {\n        context.outLine();\n      }\n      context.popColor();\n    }\n\n    /* jshint camelcase: false */\n    /* eslint-disable camelcase */\n\n  }, {\n    key: 'format_unchanged',\n    value: function format_unchanged(context, delta, left) {\n      if (typeof left === 'undefined') {\n        return;\n      }\n      this.formatValue(context, left);\n    }\n  }, {\n    key: 'format_movedestination',\n    value: function format_movedestination(context, delta, left) {\n      if (typeof left === 'undefined') {\n        return;\n      }\n      this.formatValue(context, left);\n    }\n  }, {\n    key: 'format_node',\n    value: function format_node(context, delta, left) {\n      // recurse\n      this.formatDeltaChildren(context, delta, left);\n    }\n  }, {\n    key: 'format_added',\n    value: function format_added(context, delta) {\n      this.formatValue(context, delta[0]);\n    }\n  }, {\n    key: 'format_modified',\n    value: function format_modified(context, delta) {\n      context.pushColor(colors.deleted);\n      this.formatValue(context, delta[0]);\n      context.popColor();\n      context.out(' => ');\n      context.pushColor(colors.added);\n      this.formatValue(context, delta[1]);\n      context.popColor();\n    }\n  }, {\n    key: 'format_deleted',\n    value: function format_deleted(context, delta) {\n      this.formatValue(context, delta[0]);\n    }\n  }, {\n    key: 'format_moved',\n    value: function format_moved(context, delta) {\n      context.out('==> ' + delta[1]);\n    }\n  }, {\n    key: 'format_textdiff',\n    value: function format_textdiff(context, delta) {\n      this.formatTextDiffString(context, delta[0]);\n    }\n  }]);\n  return ConsoleFormatter;\n}(BaseFormatter);\n\nvar defaultInstance$3 = void 0;\n\nvar format$3 = function format(delta, left) {\n  if (!defaultInstance$3) {\n    defaultInstance$3 = new ConsoleFormatter();\n  }\n  return defaultInstance$3.format(delta, left);\n};\n\nfunction log$1(delta, left) {\n  console.log(format$3(delta, left));\n}\n\n\n\nvar console$1 = Object.freeze({\n\tdefault: ConsoleFormatter,\n\tformat: format$3,\n\tlog: log$1\n});\n\n\n\nvar index = Object.freeze({\n\tbase: base,\n\thtml: html,\n\tannotated: annotated,\n\tjsonpatch: jsonpatch,\n\tconsole: console$1\n});\n\n// use as 2nd parameter for JSON.parse to revive Date instances\nfunction dateReviver(key, value) {\n  var parts = void 0;\n  if (typeof value === 'string') {\n    // eslint-disable-next-line max-len\n    parts = /^(\\d{4})-(\\d{2})-(\\d{2})T(\\d{2}):(\\d{2}):(\\d{2})(?:\\.(\\d*))?(Z|([+-])(\\d{2}):(\\d{2}))$/.exec(value);\n    if (parts) {\n      return new Date(Date.UTC(+parts[1], +parts[2] - 1, +parts[3], +parts[4], +parts[5], +parts[6], +(parts[7] || 0)));\n    }\n  }\n  return value;\n}\n\nfunction create(options) {\n  return new DiffPatcher(options);\n}\n\nvar defaultInstance$4 = void 0;\n\nfunction diff() {\n  if (!defaultInstance$4) {\n    defaultInstance$4 = new DiffPatcher();\n  }\n  return defaultInstance$4.diff.apply(defaultInstance$4, arguments);\n}\n\nfunction patch() {\n  if (!defaultInstance$4) {\n    defaultInstance$4 = new DiffPatcher();\n  }\n  return defaultInstance$4.patch.apply(defaultInstance$4, arguments);\n}\n\nfunction unpatch() {\n  if (!defaultInstance$4) {\n    defaultInstance$4 = new DiffPatcher();\n  }\n  return defaultInstance$4.unpatch.apply(defaultInstance$4, arguments);\n}\n\nfunction reverse() {\n  if (!defaultInstance$4) {\n    defaultInstance$4 = new DiffPatcher();\n  }\n  return defaultInstance$4.reverse.apply(defaultInstance$4, arguments);\n}\n\nfunction clone$1() {\n  if (!defaultInstance$4) {\n    defaultInstance$4 = new DiffPatcher();\n  }\n  return defaultInstance$4.clone.apply(defaultInstance$4, arguments);\n}\n\nexports.DiffPatcher = DiffPatcher;\nexports.formatters = index;\nexports.console = console$1;\nexports.create = create;\nexports.dateReviver = dateReviver;\nexports.diff = diff;\nexports.patch = patch;\nexports.unpatch = unpatch;\nexports.reverse = reverse;\nexports.clone = clone$1;\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"./autoAnnotate\"),\n    autoAnnotate = _require.autoAnnotate;\n\nfunction annotateSingleSeq(_ref) {\n  var _seqsToAnnotateById, _annotationsToCheckBy;\n\n  var fullSeq = _ref.fullSeq,\n      searchSeq = _ref.searchSeq;\n\n  var fullSeqId = fullSeq.id || \"fullSeqId\";\n  var searchSeqId = searchSeq.id || \"searchSeqId\";\n  var results = autoAnnotate({\n    seqsToAnnotateById: (_seqsToAnnotateById = {}, _seqsToAnnotateById[fullSeqId] = _extends({}, fullSeq, {\n      id: fullSeqId\n    }), _seqsToAnnotateById),\n    annotationsToCheckById: (_annotationsToCheckBy = {}, _annotationsToCheckBy[searchSeqId] = _extends({}, searchSeq, {\n      id: searchSeqId\n    }), _annotationsToCheckBy),\n    compareName: false\n  });\n  if (results && results[fullSeqId]) {\n    return {\n      matches: results[fullSeqId]\n    };\n  } else {\n    return { matches: [] };\n  }\n}\nmodule.exports = annotateSingleSeq;","\"use strict\";\n\nvar aminoAcidToDegenerateRnaMap = require(\"./aminoAcidToDegenerateRnaMap\");\n\nmodule.exports = function getDegenerateRnaStringFromAAString(aaString) {\n  return aaString.split(\"\").map(function (char) {\n    return aminoAcidToDegenerateRnaMap[char.toLowerCase()] || \"nnn\";\n  }).join(\"\");\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\n//UNDER CONSTRUCTION\n\nvar _require = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength = _require.normalizePositionByRangeLength,\n    getRangeLength = _require.getRangeLength;\n\nmodule.exports = function getVirtualDigest(_ref) {\n  var cutsites = _ref.cutsites,\n      sequenceLength = _ref.sequenceLength,\n      isCircular = _ref.isCircular,\n      allowPartialDigests = _ref.allowPartialDigests;\n\n  var fragments = [];\n  var overlappingEnzymes = [];\n  var pairs = [];\n  var sortedCutsites = cutsites.sort(function (a, b) {\n    return a.topSnipPosition - b.topSnipPosition;\n  });\n\n  sortedCutsites.forEach(function (cutsite1, index) {\n    if (allowPartialDigests) {\n      sortedCutsites.forEach(function (cutsite2, index2) {\n        pairs.push([cutsite1, cutsite2]);\n      });\n    } else {\n      pairs.push([cutsite1, sortedCutsites[index + 1] ? sortedCutsites[index + 1] : sortedCutsites[0]]);\n    }\n  });\n  // pairs = uniqBy(pairs, ([cut1,cut2]) => {\n  //   return cut1.topSnipPosition > cut2.topSnipPosition ? (cut1.name || \"cut1\") + \"_\" + (cut2.name || \"cut2\") :  (cut2.name || \"cut2\") + \"_\" + (cut1.name || \"cut1\")\n  // })\n\n  pairs.forEach(function (_ref2) {\n    var cut1 = _ref2[0],\n        cut2 = _ref2[1];\n\n    var start = normalizePositionByRangeLength(cut1.topSnipPosition, sequenceLength);\n    var end = normalizePositionByRangeLength(cut2.topSnipPosition - 1, sequenceLength);\n    if (!isCircular && start > end) {\n      //we have a fragment that spans the origin so we need to split it in 2 pieces\n      var frag1 = {\n        start: start,\n        end: sequenceLength - 1,\n        cut1: cut1,\n        cut2: \"endOfSeq\"\n      };\n      var frag2 = {\n        start: 0,\n        end: end,\n        cut1: \"startOfSeq\",\n        cut2: cut2\n      };\n\n      fragments.push(addSizeAndId(frag1, sequenceLength));\n      fragments.push(addSizeAndId(frag2, sequenceLength));\n    } else {\n      var frag = {\n        cut1: cut1,\n        cut2: cut2,\n        start: start,\n        end: end\n      };\n      fragments.push(addSizeAndId(frag, sequenceLength));\n    }\n  });\n  // const sizeMap = {};\n  fragments = fragments.filter(function (fragment) {\n    if (!fragment.size) {\n      overlappingEnzymes.push(fragment);\n      return false;\n    }\n    // if (sizeMap[fragment.size]) {\n    //   sizeMap[fragment.size].push(fragment);\n    //   return false;\n    // } else {\n    //   sizeMap[fragment.size] = [fragment];\n    // }\n    return true;\n  });\n  return {\n    fragments: fragments,\n    overlappingEnzymes: overlappingEnzymes\n  };\n};\n\nfunction addSizeAndId(frag, sequenceLength) {\n  var size = getRangeLength({ start: frag.start, end: frag.end }, sequenceLength);\n  return _extends({}, frag, {\n    size: size,\n    id: frag.start + \"-\" + frag.end + \"-\" + size + \"-\"\n  });\n}","\"use strict\";\n\nmodule.exports = function isEnzymeType2S(e) {\n  return e.site.length < e.topSnipOffset || e.site.length < e.bottomSnipOffset;\n};","module.exports = function spliceSlice(str, index, count, add) {\n  return str.slice(0, index) + (add || \"\") + str.slice(index + count);\n};","\"use strict\";\n\n/* eslint-disable eqeqeq */\n/**\n * DNA melting temperature calculator.\n * @author Nick Elsbree\n * @author Zinovii Dmytriv (original author)\n */\nvar calcTmMethods = {\n  TABLE_BRESLAUER: \"breslauer\",\n  TABLE_SUGIMOTO: \"sugimoto\",\n  TABLE_UNIFIED: \"unified\",\n\n  A: -10.8, // Helix initiation for deltaS\n  R: 1.987, // Gas constant (cal/(K*mol)).\n  C: 0.5e-6, // Oligo concentration. 0.5uM is typical for PCR.\n  Na: 50e-3, // Monovalent salt concentration. 50mM is typical for PCR.\n\n  /**\n   * Calculates temperature for DNA sequence using a given algorithm.\n   * @param  {String} sequence The DNA sequence to use.\n   * @param  {String} type Either Teselagen.bio.tools.TemperatureCalculator.TABLE_BRESLAUER, TABLE_SUGIMOTO, or TABLE_UNIFIED\n   * @param  {Double} A Helix initation for deltaS. Defaults to -10.8.\n   * @param  {Double} R The gas constant, in cal/(K*mol). Defaults to 0.5e-6M.\n   * @param  {Double} Na THe monovalent salt concentration. Defaults to 50e-3M.\n   * @return {Double} Temperature for the given sequence, in Celsius.\n   */\n  calculateTemperature: function calculateTemperature(sequence, type, A, R, C, Na) {\n    if (typeof type === \"undefined\") {\n      type = this.TABLE_BRESLAUER;\n    } else if (type != this.TABLE_BRESLAUER && type != this.TABLE_UNIFIED && type != this.TABLE_SUGIMOTO) {\n      throw new Error(\"Invalid table type!\");\n    }\n\n    if (!A) {\n      A = this.A;\n    }\n    if (!R) {\n      R = this.R;\n    }\n    if (!C) {\n      C = this.C;\n    }\n    if (!Na) {\n      Na = this.Na;\n    }\n\n    var sequenceLength = sequence.length;\n\n    if (sequenceLength == 0) {\n      return 0;\n    }\n\n    var deltaHTable = this.getDeltaHTable(type);\n    var deltaSTable = this.getDeltaSTable(type);\n\n    var neighbors = []; // List goes in order: aa, at, ac, ag, tt, ta, tc, tg, cc, ca, ct, cg, gg, gt, gc\n\n    neighbors.push(this.calculateReps(sequence, \"aa\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"at\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ac\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ag\"));\n\n    neighbors.push(this.calculateReps(sequence, \"tt\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ta\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"tc\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"tg\"));\n\n    neighbors.push(this.calculateReps(sequence, \"cc\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ca\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ct\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"cg\"));\n\n    neighbors.push(this.calculateReps(sequence, \"gg\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"ga\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"gt\"));\n    neighbors.push(this.calculateNumberOfOccurrences(sequence, \"gc\"));\n\n    var sumDeltaH = 0.0;\n    var sumDeltaS = 0.0;\n\n    for (var i = 0; i < 16; i++) {\n      sumDeltaH = sumDeltaH + neighbors[i] * deltaHTable[i];\n      sumDeltaS = sumDeltaS + neighbors[i] * deltaSTable[i];\n    }\n\n    var temperature = -1000.0 * sumDeltaH / (A + -sumDeltaS + R * Math.log(C / 4.0)) - 273.15 + 16.6 * Math.LOG10E * Math.log(Na);\n\n    // If temperature is negative then return 0.\n    if (temperature < 0) {\n      return 0;\n    }\n\n    return temperature.toFixed(2);\n  },\n\n  /**\n   * @private\n   * Function to return deltaH table for given algorithm.\n   * @param {String} type Algorithm to get table for.\n   * @return {Number[]} deltaH table for given algorithm.\n   */\n  getDeltaHTable: function getDeltaHTable(type) {\n    if (type == this.TABLE_BRESLAUER) {\n      return [9.1, 8.6, 6.5, 7.8, 9.1, 6.0, 5.6, 5.8, 11.0, 5.8, 7.8, 11.9, 11.0, 5.6, 6.5, 11.1];\n    } else if (type == this.TABLE_SUGIMOTO) {\n      return [8.0, 5.6, 6.5, 7.8, 8.0, 5.6, 5.6, 5.8, 10.9, 8.2, 6.6, 11.8, 10.9, 6.6, 9.4, 11.9];\n    } else if (type == this.TABLE_UNIFIED) {\n      return [7.9, 7.2, 8.4, 7.8, 7.9, 7.2, 8.2, 8.5, 8.0, 8.5, 7.8, 10.6, 8.0, 8.2, 8.4, 9.8];\n    } else {\n      return null;\n    }\n  },\n\n  /**\n   * @private\n   * Function to return deltaS table for given algorithm.\n   * @param {String} type Algorithm to get table for.\n   * @return {Number[]} deltaS table for given algorithm.\n   */\n  getDeltaSTable: function getDeltaSTable(type) {\n    if (type == this.TABLE_BRESLAUER) {\n      return [24.0, 23.9, 17.3, 20.8, 24.0, 16.9, 13.5, 12.9, 26.6, 12.9, 20.8, 27.8, 26.6, 13.5, 17.3, 26.7];\n    } else if (type == this.TABLE_SUGIMOTO) {\n      return [21.9, 15.2, 17.3, 20.8, 21.9, 15.2, 13.5, 12.9, 28.4, 25.5, 23.5, 29.0, 28.4, 16.4, 25.5, 29.0];\n    } else if (type == this.TABLE_UNIFIED) {\n      return [22.2, 20.4, 22.4, 21.0, 22.2, 21.3, 22.2, 22.7, 19.9, 22.7, 21.0, 27.2, 19.9, 22.2, 22.4, 24.4];\n    } else {\n      return null;\n    }\n  },\n\n  /**\n   * @private\n   * Finds number of occurrences of target in sequence.\n   * Will find repeating sequences, meaning that\n   * calculateReps(\"aaa\", \"aa\") returns 2 rather than 1.\n   * @param  {String} sequence The string to search through.\n   * @param  {String} target   The string to search for.\n   * @return {Int} Number of occurrences of target in sequence, with repeats.\n   */\n  calculateReps: function calculateReps(sequence, target) {\n    var sequenceLength = sequence.length;\n\n    if (sequenceLength == 0) {\n      return 0;\n    }\n\n    var numFound = 0;\n    var seqOffset = 0; // Search offset for finding multiple matches.\n\n    while (true) {\n      var foundSeq = sequence.indexOf(target, seqOffset);\n\n      if (foundSeq == -1) {\n        break;\n      }\n\n      seqOffset = foundSeq + 1;\n      numFound++;\n\n      if (seqOffset > sequenceLength) {\n        break;\n      }\n    }\n\n    return numFound;\n  },\n\n  /**\n   * @private\n   * Counts number of occurrences of target in sequence, without repeating.\n   * @param  {String} sequence The string to search through.\n   * @param  {String} target   The string to search for.\n   * @return {Int} Number of occurrences of target in sequence.\n   */\n  calculateNumberOfOccurrences: function calculateNumberOfOccurrences(sequence, target) {\n    var sequenceLength = sequence.length;\n\n    if (sequenceLength == 0) {\n      return 0;\n    }\n\n    var numberFound = sequence.split(target).length - 1;\n\n    return numberFound;\n  }\n};\n\nmodule.exports = calcTmMethods.calculateTemperature.bind(calcTmMethods);","\"use strict\";\n\nvar insertSequenceDataAtPositionOrRange = require(\"./insertSequenceDataAtPositionOrRange\");\nmodule.exports = function deleteSequenceDataAtRange(sequenceData, range) {\n  return insertSequenceDataAtPositionOrRange({}, sequenceData, range);\n};","\"use strict\";\n\nmodule.exports = function doesEnzymeChopOutsideOfRecognitionSite(enzyme) {\n  if (enzyme.topSnipOffset > enzyme.site.length || enzyme.bottomSnipOffset > enzyme.site.length) {\n    return true;\n  } else {\n    return false;\n  }\n};","\"use strict\";\n\nvar aliasedEnzymesByName = require(\"./aliasedEnzymesByName\");\n\nvar defaultEnzymes = [\"aari\", \"aatii\", \"aaui\", \"accebi\", \"acci\", \"accii\", \"acciii\", \"acsi\", \"afai\", \"aflii\", \"alui\", \"aor13hi\", \"aor51hi\", \"apai\", \"apali\", \"asci\", \"asisi\", \"asp35hi\", \"asp713i\", \"aspmi\", \"atsi\", \"atu1i\", \"atu1ii\", \"avrbi\", \"avrii\", \"bali\", \"bamhi\", \"banii\", \"bari\", \"baui\", \"bbvbi\", \"bcni\", \"bcoki\", \"bdii\", \"bgli\", \"bglii\", \"blni\", \"bme216i\", \"bmet110i\", \"bmgt120i\", \"bmui\", \"bnai\", \"bpu1102i\", \"bpuai\", \"bpub5i\", \"bsai\", \"bsavi\", \"bseri\", \"bsgi\", \"bshhi\", \"bsiwi\", \"bsmbi\", \"bsmfi\", \"bsofi\", \"bsp105i\", \"bsp1286i\", \"bsp139i\", \"bsp1407i\", \"bsp4009i\", \"bsp70i\", \"bsp71i\", \"bspa2i\", \"bspci\", \"bspfni\", \"bspt104i\", \"bspt107i\", \"bsrfi\", \"bsshii\", \"bst1107i\", \"bstb7si\", \"bsthi\", \"bstiz316i\", \"bstli\", \"bstpi\", \"bstri\", \"bstxi\", \"bsu1532i\", \"bsu8565i\", \"bsu90i\", \"btgai\", \"btsci\", \"btsi\", \"bvei\", \"ccini\", \"ccop95i\", \"ceqi\", \"cfr10i\", \"cfr45i\", \"cfr47i\", \"cfr6i\", \"cjuii\", \"clai\", \"cpaai\", \"cpoi\", \"cspai\", \"cspci\", \"ddei\", \"dpni\", \"drai\", \"dsai\", \"dsavi\", \"eaei\", \"eagi\", \"eam1105i\", \"ecidi\", \"ecl37i\", \"eco211i\", \"eco240i\", \"eco241i\", \"eco246i\", \"eco247i\", \"eco52i\", \"eco68i\", \"eco81i\", \"eco93i\", \"ecoicri\", \"ecoo109i\", \"ecoo65i\", \"ecopi\", \"ecoprri\", \"ecori\", \"ecorv\", \"ecot14i\", \"ecot22i\", \"ecoviii\", \"ehei\", \"esphk22i\", \"fbai\", \"fdiii\", \"foki\", \"fsei\", \"haeii\", \"haeiii\", \"hapii\", \"hgiai\", \"hgibi\", \"hhai\", \"hin1i\", \"hincii\", \"hindiii\", \"hinfi\", \"hpai\", \"hpyf13iii\", \"hpyf19ii\", \"hpyf21i\", \"hpyf28i\", \"hpyf29i\", \"hpyf36i\", \"hpyf62i\", \"hpyf65i\", \"hpyii\", \"koyi\", \"kpni\", \"m.bbu297i\", \"m.pmudam\", \"maek81i\", \"mboi\", \"mboii\", \"mfli\", \"mizi\", \"mlui\", \"mph1103ii\", \"msei\", \"msii\", \"mspi\", \"mthai\", \"muni\", \"naei\", \"ncoi\", \"ndai\", \"ndei\", \"nflaii\", \"ngbi\", \"ngobviii\", \"ngodviii\", \"ngoeii\", \"ngotii\", \"nhei\", \"nlaiv\", \"noci\", \"noti\", \"novii\", \"nrui\", \"nsbi\", \"nsici\", \"nsp29132i\", \"paci\", \"pae17ki\", \"pca17ai\", \"pfaaiii\", \"pfl16i\", \"ple214i\", \"pmaci\", \"pmei\", \"pru2i\", \"psb9879i\", \"pshai\", \"pshbi\", \"psp1406i\", \"psp31i\", \"psp33i\", \"psp5i\", \"psti\", \"psuni\", \"pvui\", \"pvuii\", \"ral8i\", \"rsplki\", \"saci\", \"sacii\", \"sali\", \"sapi\", \"sau3ai\", \"sauni\", \"sbai\", \"sbfi\", \"scai\", \"sfii\", \"sflhk115731i\", \"slu1777i\", \"smai\", \"smii\", \"snabi\", \"spei\", \"sphi\", \"srfi\", \"srl61di\", \"sse8387i\", \"ssp2i\", \"sspi\", \"stui\", \"suii\", \"swai\", \"taqi\", \"tauii\", \"tsci\", \"tth111i\", \"tthhb8i\", \"uba1093i\", \"uba1095i\", \"uba1122i\", \"uba1160i\", \"uba1229i\", \"uba1371i\", \"uba1380i\", \"uba1403i\", \"uba1415i\", \"uba1437i\", \"uba1439i\", \"uba1440i\", \"uba36i\", \"uba41i\", \"uba42i\", \"uba89i\", \"uban13i\", \"van91i\", \"vcho66i\", \"vpak11bi\", \"vpakutji\", \"xbai\", \"xcyi\", \"xhoi\", \"xmai\", \"xmli\", \"xphi\", \"xspi\"];\n\nvar defaultEnzymesByName = {};\n\ndefaultEnzymes.forEach(function (name) {\n  defaultEnzymesByName[name] = aliasedEnzymesByName[name];\n});\n\nmodule.exports = defaultEnzymesByName;","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\n// this is throwing a weird eslint error\n\n// var ac = require('ve-api-check');\nvar _require = require(\"ve-range-utils\"),\n    generateRandomRange = _require.generateRandomRange;\n\nvar bsonObjectId = require(\"bson-objectid\");\n\nmodule.exports = function generateSequenceData() {\n  var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {},\n      isProtein = _ref.isProtein,\n      _ref$sequenceLength = _ref.sequenceLength,\n      sequenceLength = _ref$sequenceLength === undefined ? 1000 : _ref$sequenceLength,\n      numFeatures = _ref.numFeatures,\n      numParts = _ref.numParts,\n      numPrimers = _ref.numPrimers,\n      numTranslations = _ref.numTranslations;\n\n  var proteinSequence = isProtein && generateSequence(sequenceLength, true);\n  var sequence = !isProtein && generateSequence(sequenceLength);\n\n  return {\n    circular: isProtein ? false : Math.random() > 0.5,\n    name: \"p-\" + Math.floor(Math.random * 100),\n    description: \"\",\n    isProtein: isProtein,\n    sequence: sequence,\n    proteinSequence: proteinSequence,\n    translations: isProtein ? undefined : generateAnnotations(numTranslations || 5, 0, sequenceLength - 1, sequenceLength / 3),\n    features: generateAnnotations(numFeatures || 10, 0, sequenceLength - 1, sequenceLength / 3),\n    primers: isProtein ? undefined : generateAnnotations(numPrimers || 10, 0, sequenceLength - 1, 50),\n    parts: generateAnnotations(numParts || 10, 0, sequenceLength - 1, sequenceLength / 3)\n  };\n};\n\n// export default tidyUpSequenceData(exampleData)\n\nfunction generateSequence() {\n  var m = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 9;\n  var isProtein = arguments[1];\n\n  var s = \"\";\n  var r = isProtein ? \"\" : \"gatc\";\n  for (var i = 0; i < m; i++) {\n    s += r.charAt(Math.floor(Math.random() * r.length));\n  }\n  return s;\n}\n\nfunction generateAnnotations(numberOfAnnotationsToGenerate, start, end, maxLength) {\n  var result = {};\n  for (var i = 0; i < numberOfAnnotationsToGenerate; i++) {\n    var annotation = generateAnnotation(start, end, maxLength);\n    result[annotation.id] = annotation;\n  }\n  return result;\n}\n\nfunction getRandomInt(min, max) {\n  return Math.floor(Math.random() * (max - min)) + min;\n}\n\nfunction generateAnnotation(start, end, maxLength) {\n  var range = generateRandomRange(start, end, maxLength);\n  return _extends({}, range, {\n    name: getRandomInt(0, 100000).toString(),\n    type: \"misc_feature\",\n    id: bsonObjectId().str,\n    forward: Math.random() > 0.5,\n    notes: {}\n  });\n}\n\n// tnr: this is used to generate a very large, multi-featured sequence\n// var string = \"ggggcccccgggggccc\";\n// var reallyLongFakeSequence = \"\";\n// for (var i = 1; i < 100000; i++) {\n//   reallyLongFakeSequence += string;\n//   if (i % 100 === 0) {\n//     reallyLongFakeSequence += 'taafatg';\n//     sequenceData.features.push({\n//       id: i,\n//       start: parseInt(i * 10),\n//       end: parseInt(i * 10 + 100),\n//       name: 'cooljim',\n//       color: 'green',\n//       forward: true,\n//       annotationType: \"feature\"\n//     });\n//   }\n// }\n// sequenceData.sequence += reallyLongFakeSequence;\n//\n// export default function() {\n//   var baseSeqData = {\n//\n//   }\n//   function seqGen() {\n//\n//   }\n// }\n// \"features\" : [\n//     {\n//         \"name\" : \"1\",\n//         \"type\" : \"misc_feature\",\n//         \"start\" : 1,\n//         \"end\" : 1,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'blue'\n//     },\n//     {\n//         \"name\" : \"2\",\n//         \"type\" : \"misc_feature\",\n//         \"start\" : 1,\n//         \"end\" : 1,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'blue'\n//     },\n//     {\n//         \"name\" : \"3\",\n//         \"type\" : \"misc_feature\",\n//         \"start\" : 1,\n//         \"end\" : 1,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'blue'\n//     },\n//     {\n//         \"name\" : \"4\",\n//         \"type\" : \"misc_feature\",\n//         \"start\" : 1,\n//         \"end\" : 14,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'blue'\n//     },\n//     {\n//         \"name\" : \"5\",\n//         \"type\" : \"misc_feature\",\n//         \"start\" : 1,\n//         \"end\" : 1,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'blue'\n//     },\n//     {\n//         \"name\" : \"6\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c1978fafgw979df000a4f02c7a\",\n//         \"start\" : 4,\n//         \"end\" : 6,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'orange'\n//     },\n//     {\n//         \"name\" : \"housemouserousepouse\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c197897fs9df000a4f02c7a\",\n//         \"start\" : 4,\n//         \"end\" : 6,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'orange'\n//     },\n//     {\n//         \"name\" : \"housemouserousepouse\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c1978979dasdfaf000a4f02c7a\",\n//         \"start\" : 4,\n//         \"end\" : 6,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'orange'\n//     },\n//     {\n//         \"name\" : \"housemouserousepouse\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c197faas8979df000a4f02c7a\",\n//         \"start\" : 4,\n//         \"end\" : 6,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'orange'\n//     },\n//     {\n//         \"name\" : \"housemouserousepouse\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c1978979df000a4f02c7aasd\",\n//         \"start\" : 4,\n//         \"end\" : 6,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'orange'\n//     },\n//     {\n//         \"name\" : \"house\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c1978979df000a4f02c7b\",\n//         \"start\" : 70,\n//         \"end\" : 90,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'green'\n//     },\n//     {\n//         \"name\" : \"weer\",\n//         \"type\" : \"misc_feature\",\n//         \"id\" : \"5590c1d88979df000a4f02f5c\",\n//         \"start\" : 3,\n//         \"end\" : 69,\n//         \"strand\" : 1,\n//         \"notes\" : [],\n//         \"color\": 'red'\n//     }\n// ],","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    normalizeRange = _require.normalizeRange;\n\nfunction findNearestRangeOfSequenceOverlapToPosition(sequenceToSearch, overlapSequence, positionStart, isLinear) {\n  if (!positionStart) positionStart = 0;\n  if (sequenceToSearch.length < overlapSequence.length) {\n    return null;\n  }\n  var regex = new RegExp(overlapSequence, \"ig\");\n  var result;\n  var index;\n  var distance = Infinity;\n  while (result = regex.exec(sequenceToSearch + (isLinear ? \"\" : sequenceToSearch))) {\n    if (result.index > sequenceToSearch.length) break;\n    var newDistance = Math.abs(result.index - positionStart);\n    newDistance = isLinear ? newDistance //if linear, don't check around the origin\n    : Math.min(newDistance, Math.abs(newDistance - sequenceToSearch.length));\n    if (newDistance > distance) {\n      break;\n    }\n    index = result.index;\n    distance = newDistance;\n  }\n  //index is the closest range start\n  return normalizeRange({\n    start: index,\n    end: index + overlapSequence.length - 1\n  }, sequenceToSearch.length);\n}\nmodule.exports = findNearestRangeOfSequenceOverlapToPosition;","\"use strict\";\n\nvar getOrfsFromSequence = require(\"./getOrfsFromSequence.js\");\nmodule.exports = function findOrfsInPlasmid(sequence, circular, minimumOrfSize, useAdditionalOrfStartCodons) {\n  //tnr, we should do the parsing down of the orfs immediately after they're returned from this sequence\n  // const orfs1Forward = eliminateCircularOrfsThatOverlapWithNonCircularOrfs(getOrfsFromSequence(0, doubleForwardSequence, minimumOrfSize, true), maxLength);\n  var forwardOrfs = getOrfsFromSequence({\n    sequence: sequence,\n    minimumOrfSize: minimumOrfSize,\n    forward: true,\n    circular: circular,\n    useAdditionalOrfStartCodons: useAdditionalOrfStartCodons\n  });\n  var reverseOrfs = getOrfsFromSequence({\n    sequence: sequence,\n    minimumOrfSize: minimumOrfSize,\n    forward: false,\n    circular: circular,\n    useAdditionalOrfStartCodons: useAdditionalOrfStartCodons\n  });\n  return forwardOrfs.concat(reverseOrfs);\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _require = require(\"ve-range-utils\"),\n    modulateRangeBySequenceLength = _require.modulateRangeBySequenceLength,\n    flipContainedRange = _require.flipContainedRange;\n\nvar _require2 = require(\"lodash\"),\n    reduce = _require2.reduce,\n    uniqBy = _require2.uniqBy;\n\nvar escapeStringRegexp = require(\"escape-string-regexp\");\nvar getAminoAcidStringFromSequenceString = require(\"./getAminoAcidStringFromSequenceString\");\n\nvar _require3 = require(\"./bioData\"),\n    ambiguous_dna_values = _require3.ambiguous_dna_values,\n    extended_protein_values = _require3.extended_protein_values;\n\nvar getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\n\nmodule.exports = function findSequenceMatches(sequence, searchString) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n\n  var matches = findSequenceMatchesTopStrand(sequence, searchString, options);\n  var searchReverseStrand = options.searchReverseStrand;\n\n\n  if (searchReverseStrand) {\n    var sequenceLength = sequence.length;\n    var reverseSeq = void 0;\n    reverseSeq = getReverseComplementSequenceString(sequence);\n    var reverseMatches = findSequenceMatchesTopStrand(reverseSeq, searchString, options);\n    var flippedReverseMatches = reverseMatches.map(function (range) {\n      return _extends({}, flipContainedRange(range, { start: 0, end: sequenceLength - 1 }, sequenceLength), {\n        bottomStrand: true\n      });\n    });\n    matches = [].concat(matches, flippedReverseMatches);\n  }\n  return matches;\n};\n\nfunction findSequenceMatchesTopStrand(sequence, searchString) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var isCircular = options.isCircular,\n      isAmbiguous = options.isAmbiguous,\n      isProteinSequence = options.isProteinSequence,\n      isProteinSearch = options.isProteinSearch;\n\n  var searchStringToUse = escapeStringRegexp(searchString);\n  if (isAmbiguous) {\n    if (isProteinSearch || isProteinSequence) {\n      searchStringToUse = convertAmbiguousStringToRegex(searchStringToUse, true);\n    } else {\n      //we're searching DNA\n      searchStringToUse = convertAmbiguousStringToRegex(searchStringToUse);\n    }\n  }\n  if (!searchStringToUse) return []; //short circuit if nothing is actually being searched for (eg searching for \"%%\"\")\n  var sequenceToUse = sequence;\n  if (isCircular) {\n    sequenceToUse = sequenceToUse + sequenceToUse;\n  }\n\n  var sequencesToCheck = [{ seqToCheck: sequenceToUse, offset: 0 }];\n  if (isProteinSearch) {\n    sequencesToCheck = [{\n      seqToCheck: getAminoAcidStringFromSequenceString(sequenceToUse),\n      offset: 0\n    }, {\n      seqToCheck: getAminoAcidStringFromSequenceString(sequenceToUse.substr(1)),\n      offset: 1\n    }, {\n      seqToCheck: getAminoAcidStringFromSequenceString(sequenceToUse.substr(2)),\n      offset: 2\n    }];\n  }\n\n  var ranges = [];\n  sequencesToCheck.forEach(function (_ref) {\n    var seqToCheck = _ref.seqToCheck,\n        offset = _ref.offset;\n\n    var reg = new RegExp(searchStringToUse, \"ig\");\n    var match = void 0;\n    var range = void 0;\n    /* eslint-disable no-cond-assign*/\n\n    while ((match = reg.exec(seqToCheck)) !== null) {\n      range = {\n        start: match.index,\n        end: match.index + searchString.length - 1 //this should be the original searchString here j\n      };\n      if (isProteinSearch) {\n        range.start = range.start * 3 + offset;\n        range.end = range.end * 3 + 2 + offset;\n      }\n      ranges.push(modulateRangeBySequenceLength(range, sequence.length));\n      reg.lastIndex = match.index + 1;\n    }\n    /* eslint-enable no-cond-assign*/\n  });\n\n  return uniqBy(ranges, function (e) {\n    return e.start + \"-\" + e.end;\n  });\n}\n\nfunction convertAmbiguousStringToRegex(string, isProtein) {\n  // Search for a DNA subseq in sequence.\n  // use ambiguous values (like N = A or T or C or G, R = A or G etc.)\n  // searches only on forward strand\n  return reduce(string, function (acc, char) {\n    var value = isProtein ? extended_protein_values[char.toUpperCase()] : ambiguous_dna_values[char.toUpperCase()];\n    if (!value) return acc;\n    if (value.length === 1) {\n      acc += value;\n    } else {\n      acc += \"[\" + value + \"]\";\n    }\n    return acc;\n  }, \"\");\n}","'use strict';\n\nvar matchOperatorsRe = /[|\\\\{}()[\\]^$+*?.]/g;\n\nmodule.exports = function (str) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\treturn str.replace(matchOperatorsRe, '\\\\$&');\n};\n","\"use strict\";\n\nmodule.exports = function getCodonRangeForAASliver(aminoAcidPositionInSequence, aminoAcidSliver, AARepresentationOfTranslation, relativeAAPositionInTranslation) {\n  var AASliverOneBefore = AARepresentationOfTranslation[relativeAAPositionInTranslation - 1];\n  if (AASliverOneBefore && AASliverOneBefore.aminoAcidIndex === aminoAcidSliver.aminoAcidIndex) {\n    var AASliverTwoBefore = AARepresentationOfTranslation[relativeAAPositionInTranslation - 2];\n    if (AASliverTwoBefore && AASliverTwoBefore.aminoAcidIndex === aminoAcidSliver.aminoAcidIndex) {\n      return {\n        start: aminoAcidPositionInSequence - 2,\n        end: aminoAcidPositionInSequence\n      };\n    } else {\n      if (aminoAcidSliver.fullCodon === true) {\n        return {\n          start: aminoAcidPositionInSequence - 1,\n          end: aminoAcidPositionInSequence + 1\n        };\n      } else {\n        return {\n          start: aminoAcidPositionInSequence - 1,\n          end: aminoAcidPositionInSequence\n        };\n      }\n    }\n  } else {\n    //no AASliver before with same index\n    if (aminoAcidSliver.fullCodon === true) {\n      //sliver is part of a full codon, so we know the codon will expand 2 more slivers ahead\n      return {\n        start: aminoAcidPositionInSequence,\n        end: aminoAcidPositionInSequence + 2\n      };\n    } else {\n      var AASliverOneAhead = AARepresentationOfTranslation[relativeAAPositionInTranslation - 2];\n      if (AASliverOneAhead && AASliverOneAhead.aminoAcidIndex === aminoAcidSliver.aminoAcidIndex) {\n        return {\n          start: aminoAcidPositionInSequence,\n          end: aminoAcidPositionInSequence + 1\n        };\n      } else {\n        return {\n          start: aminoAcidPositionInSequence,\n          end: aminoAcidPositionInSequence + 1\n        };\n      }\n    }\n  }\n};","\"use strict\";\n\nvar getAminoAcidStringFromSequenceString = require(\"./getAminoAcidStringFromSequenceString\");\n\nmodule.exports = function getComplementAminoAcidStringFromSequenceString(sequenceString) {\n  var aaString = getAminoAcidStringFromSequenceString(sequenceString, true);\n  return aaString.split(\"\").reverse().join(\"\");\n};","\"use strict\";\n\nvar getComplementSequenceString = require(\"./getComplementSequenceString\");\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\n// const ac = require('ve-api-check');\nvar getSequenceDataBetweenRange = require(\"./getSequenceDataBetweenRange\");\n\n// ac.throw([ac.string,ac.bool],arguments);\nmodule.exports = function getComplementSequenceAndAnnotations(pSeqObj) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  var seqObj = tidyUpSequenceData(getSequenceDataBetweenRange(pSeqObj, options.range), options);\n  var newSeqObj = Object.assign({}, seqObj, {\n    sequence: getComplementSequenceString(seqObj.sequence)\n  });\n  return tidyUpSequenceData(newSeqObj, options);\n};","\"use strict\";\n\nmodule.exports = function getCutsiteType(restrictionEnzyme) {\n  var topSnipOffset = restrictionEnzyme.topSnipOffset,\n      bottomSnipOffset = restrictionEnzyme.bottomSnipOffset;\n\n  if (topSnipOffset === bottomSnipOffset) {\n    return \"blunt\";\n  } else if (topSnipOffset < bottomSnipOffset) {\n    return \"5' overhang\";\n  } else {\n    return \"3' overhang\";\n  }\n};","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength1Based = _require.normalizePositionByRangeLength1Based;\n\nmodule.exports = function getInsertBetweenVals(caretPosition, selectionLayer, sequenceLength) {\n  if (selectionLayer.start > -1) {\n    //selection layer\n    return [normalizePositionByRangeLength1Based(selectionLayer.start, sequenceLength), normalizePositionByRangeLength1Based(selectionLayer.end + 2, sequenceLength)];\n  } else if (caretPosition > -1) {\n    return [normalizePositionByRangeLength1Based(caretPosition, sequenceLength), normalizePositionByRangeLength1Based(caretPosition + 1, sequenceLength)];\n  } else {\n    return [sequenceLength, 1];\n  }\n};","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    isPositionWithinRange = _require.isPositionWithinRange,\n    getSequenceWithinRange = _require.getSequenceWithinRange,\n    normalizePositionByRangeLength = _require.normalizePositionByRangeLength,\n    isPositionCloserToRangeStartThanRangeEnd = _require.isPositionCloserToRangeStartThanRangeEnd;\n\nmodule.exports = function getLeftAndRightOfSequenceInRangeGivenPosition(range, position, sequence) {\n  var result = {\n    leftHandSide: \"\",\n    rightHandSide: \"\"\n  };\n  if (isPositionWithinRange(position, range)) {\n    result.leftHandSide = getSequenceWithinRange({\n      start: range.start,\n      end: normalizePositionByRangeLength(position - 1, sequence.length)\n    }, sequence);\n    result.rightHandSide = getSequenceWithinRange({ start: position, end: range.end }, sequence);\n  } else {\n    if (isPositionCloserToRangeStartThanRangeEnd(position, range, sequence.length)) {\n      result.rightHandSide = getSequenceWithinRange(range, sequence);\n    } else {\n      result.leftHandSide = getSequenceWithinRange(range, sequence);\n    }\n  }\n  return result;\n};","\"use strict\";\n\nvar _require = require(\"ve-range-utils\"),\n    modulatePositionByRange = _require.modulatePositionByRange;\n/**\n * This function gets the overlapping of one sequence to another based on sequence equality.\n * \n * @param  {string} sequenceToFind     \n * @param  {string} sequenceToSearchIn \n * @param  {object} options            optional\n * @return {object || null}            null if no overlap exists or a range object with .start and .end properties\n */\n\n\nmodule.exports = function getOverlapBetweenTwoSequences(sequenceToFind, sequenceToSearchIn, options) {\n  options = options || {};\n  sequenceToSearchIn = sequenceToSearchIn.toLowerCase();\n  sequenceToFind = sequenceToFind.toLowerCase();\n  var lengthenedSeqToSearch = sequenceToSearchIn + sequenceToSearchIn;\n  var index = lengthenedSeqToSearch.indexOf(sequenceToFind);\n  if (index > -1) {\n    return {\n      start: index,\n      end: modulatePositionByRange(index + sequenceToFind.length - 1, {\n        start: 0,\n        end: sequenceToSearchIn.length - 1\n      })\n    };\n  } else {\n    return null;\n  }\n};","\"use strict\";\n\nvar getComplementSequenceString = require(\"./getComplementSequenceString\");\n\nvar _require = require(\"ve-range-utils\"),\n    normalizePositionByRangeLength = _require.normalizePositionByRangeLength;\n\nvar cutSequenceByRestrictionEnzyme = require(\"./cutSequenceByRestrictionEnzyme\");\nmodule.exports = function getPossiblePartsFromSequenceAndEnzyme(seqData, restrictionEnzymes) {\n  // ac.throw([\n  //     ac.string,\n  //     ac.bool,\n  //     ac.shape({\n  //         \"name\": ac.string,\n  //         \"site\": ac.string,\n  //         \"forwardRegex\": ac.string,\n  //         \"reverseRegex\": ac.string,\n  //         \"topSnipOffset\": ac.number,\n  //         \"bottomSnipOffset\": ac.number\n  //     })\n  // ], arguments);\n  restrictionEnzymes = restrictionEnzymes.length ? restrictionEnzymes : [restrictionEnzymes];\n  var bps = seqData.sequence;\n  var seqLen = bps.length;\n  var circular = seqData.circular;\n  var cutsites = [];\n  restrictionEnzymes.forEach(function (enzyme) {\n    var newCutsites = cutSequenceByRestrictionEnzyme(bps, circular, enzyme);\n    cutsites = cutsites.concat(newCutsites);\n  });\n  var parts = [];\n  if (cutsites.length < 1) {\n    return parts;\n  } else if (cutsites.length === 1) {\n    parts.push(getPartBetweenEnzymesWithInclusiveOverhangs(cutsites[0], cutsites[0], seqLen));\n    return parts;\n  } else {\n    var pairs = pairwise(cutsites);\n    pairs.forEach(function (pair) {\n      var cut1 = pair[0];\n      var cut2 = pair[1];\n      var part1 = getPartBetweenEnzymesWithInclusiveOverhangs(cut1, cut2, seqLen);\n      var part2 = getPartBetweenEnzymesWithInclusiveOverhangs(cut2, cut1, seqLen);\n      if (circular || !(part1.start > part1.end)) {\n        //only add origin spanning parts if the sequence is circular\n        parts.push(part1);\n      }\n      if (circular || !(part2.start > part2.end)) {\n        //only add origin spanning parts if the sequence is circular\n        parts.push(part2);\n      }\n    });\n    return parts;\n  }\n};\n\nfunction getPartBetweenEnzymesWithInclusiveOverhangs(cut1, cut2, seqLen) {\n  var firstCutOffset = getEnzymeRelativeOffset(cut1.restrictionEnzyme);\n  var secondCutOffset = getEnzymeRelativeOffset(cut2.restrictionEnzyme);\n  var start = cut1.topSnipBeforeBottom ? cut1.topSnipPosition : cut1.bottomSnipPosition;\n  var end = normalizePositionByRangeLength((cut2.topSnipBeforeBottom ? cut2.bottomSnipPosition : cut2.topSnipPosition) - 1, seqLen);\n  return {\n    start: start,\n    start1Based: start + 1,\n    end: end,\n    end1Based: end + 1,\n    firstCut: cut1,\n    //the offset is always counting with 0 being at the top snip position\n    firstCutOffset: firstCutOffset,\n    firstCutOverhang: cut1.overhangBps,\n    firstCutOverhangTop: firstCutOffset > 0 ? cut1.overhangBps : \"\",\n    firstCutOverhangBottom: firstCutOffset < 0 ? getComplementSequenceString(cut1.overhangBps) : \"\",\n    secondCut: cut2,\n    //the offset is always counting with 0 being at the top snip position\n    secondCutOffset: secondCutOffset,\n    secondCutOverhang: cut2.overhangBps,\n    secondCutOverhangTop: secondCutOffset < 0 ? cut2.overhangBps : \"\",\n    secondCutOverhangBottom: secondCutOffset > 0 ? getComplementSequenceString(cut2.overhangBps) : \"\"\n  };\n}\n\nfunction getEnzymeRelativeOffset(enzyme) {\n  //the offset is always counting with 0 being at the top snip position\n  return enzyme.bottomSnipOffset - enzyme.topSnipOffset;\n}\n\nfunction pairwise(list) {\n  if (list.length < 2) {\n    return [];\n  }\n  var first = list[0],\n      rest = list.slice(1),\n      pairs = rest.map(function (x) {\n    return [first, x];\n  });\n  return pairs.concat(pairwise(rest));\n}","\"use strict\";\n\nvar getAminoAcidDataForEachBaseOfDna = require(\"./getAminoAcidDataForEachBaseOfDna\");\n\nmodule.exports = function getReverseAminoAcidStringFromSequenceString(sequenceString) {\n  var aminoAcidsPerBase = getAminoAcidDataForEachBaseOfDna(sequenceString, false);\n  var aaArray = [];\n  var aaString = \"\";\n  aminoAcidsPerBase.forEach(function (aa) {\n    if (!aa.fullCodon) {\n      return;\n    }\n    aaArray[aa.aminoAcidIndex] = aa.aminoAcid.value;\n  });\n  aaString = aaArray.join(\"\");\n  return aaString;\n};","'use strict';\n\nvar getAminoAcidStringFromSequenceString = require('./getAminoAcidStringFromSequenceString');\nvar getReverseComplementSequenceString = require('./getReverseComplementSequenceString');\n\nmodule.exports = function getReverseComplementAminoAcidStringFromSequenceString(sequenceString) {\n  return getAminoAcidStringFromSequenceString(getReverseComplementSequenceString(sequenceString));\n};","\"use strict\";\n\nvar getReverseComplementSequenceString = require(\"./getReverseComplementSequenceString\");\nvar getReverseComplementAnnotation = require(\"./getReverseComplementAnnotation\");\nvar annotationTypes = require(\"./annotationTypes\");\n\nvar _require = require(\"lodash\"),\n    map = _require.map;\n\nvar tidyUpSequenceData = require(\"./tidyUpSequenceData\");\n// const ac = require('ve-api-check');\nvar getSequenceDataBetweenRange = require(\"./getSequenceDataBetweenRange\");\n\n// ac.throw([ac.string,ac.bool],arguments);\nmodule.exports = function getReverseComplementSequenceAndAnnoations(pSeqObj) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  var seqObj = tidyUpSequenceData(getSequenceDataBetweenRange(pSeqObj, options.range), options);\n  var newSeqObj = Object.assign({}, seqObj, {\n    sequence: getReverseComplementSequenceString(seqObj.sequence)\n  }, annotationTypes.reduce(function (acc, type) {\n    if (seqObj[type]) {\n      acc[type] = map(seqObj[type], function (annotation) {\n        return getReverseComplementAnnotation(annotation, seqObj.sequence.length);\n      });\n    }\n    return acc;\n  }, {}));\n  return tidyUpSequenceData(newSeqObj, options);\n};","\"use strict\";\n\nmodule.exports = function getReverseSequenceString(sequence) {\n  var reverseSequenceString = \"\";\n  for (var i = sequence.length - 1; i >= 0; i--) {\n    var revChar = sequence[i];\n    if (!revChar) {\n      revChar = sequence[i];\n      // throw new Error('trying to get the reverse of an invalid base');\n    }\n    reverseSequenceString += revChar;\n  }\n  return reverseSequenceString;\n};","\"use strict\";\n\nvar _require = require(\"./bioData\"),\n    ambiguous_dna_letters = _require.ambiguous_dna_letters;\n\nmodule.exports = function guessIfSequenceIsDnaAndNotProtein(seq) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var _options$threshold = options.threshold,\n      threshold = _options$threshold === undefined ? 0.9 : _options$threshold,\n      loose = options.loose;\n\n  var dnaLetters = options.dnaLetters || loose ? [].concat(ambiguous_dna_letters.split(\"\"), [\"U\"]) : [\"G\", \"A\", \"T\", \"C\", \"U\"];\n  // Guess if the given sequence is DNA or Protein.\n\n  //   It's considered DNA if more than 90% of the sequence is GATCs. The threshold\n  //   is configurable via the threshold parameter. dnaLetters can be used to configure\n  //   which letters are considered DNA; for instance, adding N might be useful if\n  //   you are expecting data with ambiguous bases.\n  var dnaLetterMap = dnaLetters.reduce(function (acc, letter) {\n    acc[letter.toUpperCase()] = true;\n    return acc;\n  }, {});\n  var count = 0;\n  if (!seq || !seq.length) return true;\n  for (var index = 0; index < seq.length; index++) {\n    var letter = seq[index];\n    if (dnaLetterMap[letter.toUpperCase()]) {\n      count = count + 1;\n    }\n  }\n  if (count / seq.length > threshold) {\n    return true; //it is DNA\n  }\n  return false; //it is protein\n};","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    cloneDeep = _require.cloneDeep;\n\nvar _require2 = require(\"ve-range-utils\"),\n    getYOffsetsForPotentiallyCircularRanges = _require2.getYOffsetsForPotentiallyCircularRanges;\n\nvar annotationTypes = require(\"./annotationTypes\");\n//basically just adds yOffsets to the annotations\nmodule.exports = function prepareCircularViewData(sequenceData) {\n  var clonedSeqData = cloneDeep(sequenceData);\n  annotationTypes.forEach(function (annotationType) {\n    if (annotationType !== \"cutsites\") {\n      var maxYOffset = getYOffsetsForPotentiallyCircularRanges(clonedSeqData[annotationType]).maxYOffset;\n      clonedSeqData[annotationType].maxYOffset = maxYOffset;\n    }\n  });\n  return clonedSeqData;\n};","\"use strict\";\n\n// const ac = require('ve-api-check');\n// ac.throw([ac.posInt, ac.posInt, ac.bool], arguments);\nvar mapAnnotationsToRows = require(\"./mapAnnotationsToRows\");\nvar annotationTypes = require(\"./annotationTypes\");\nmodule.exports = function prepareRowData(sequenceData, bpsPerRow) {\n  // ac.throw([ac.sequenceData, ac.posInt], arguments);\n  var sequenceLength = sequenceData.sequence.length;\n  var totalRows = Math.ceil(sequenceLength / bpsPerRow) || 1; //this check makes sure there is always at least 1 row!\n  var rows = [];\n  var rowMap = {};\n  annotationTypes.forEach(function (type) {\n    rowMap[type] = mapAnnotationsToRows(sequenceData[type], sequenceLength, bpsPerRow, { splitForwardReverse: type === \"primers\" });\n  });\n\n  var _loop = function _loop(rowNumber) {\n    var row = {};\n    row.rowNumber = rowNumber;\n    row.start = rowNumber * bpsPerRow;\n    row.end = (rowNumber + 1) * bpsPerRow - 1 < sequenceLength ? (rowNumber + 1) * bpsPerRow - 1 : sequenceLength - 1;\n    if (row.end < 0) {\n      row.end = 0;\n    }\n    annotationTypes.forEach(function (type) {\n      row[type] = rowMap[type][rowNumber] || [];\n    });\n    row.sequence = sequenceData.sequence.slice(row.start, row.end + 1);\n\n    rows[rowNumber] = row;\n  };\n\n  for (var rowNumber = 0; rowNumber < totalRows; rowNumber++) {\n    _loop(rowNumber);\n  }\n  return rows;\n};","\"use strict\";\n\nmodule.exports = function condensePairwiseAlignmentDifferences(referenceSeq, alignedSeq) {\n  var overviewMinimapTrack = [];\n  var referenceSeqSplit = referenceSeq.toLowerCase().split(\"\");\n  var alignedSeqSplit = alignedSeq.toLowerCase().split(\"\");\n  var seqLength = alignedSeq.length;\n  var alignedSeqWithoutLeadingDashes = alignedSeq.replace(/^-+/g, \"\");\n  var alignedSeqWithoutTrailingDashes = alignedSeq.replace(/-+$/g, \"\");\n\n  var startIndex = seqLength - alignedSeqWithoutLeadingDashes.length;\n  var endIndex = seqLength - (seqLength - alignedSeqWithoutTrailingDashes.length);\n  for (var i = 0; i < referenceSeqSplit.length; i++) {\n    if (i < startIndex || i >= endIndex) {\n      overviewMinimapTrack.push(\"W\");\n    } else if (referenceSeqSplit[i] === alignedSeqSplit[i] && referenceSeqSplit[i] !== \"-\" && alignedSeqSplit[i] !== \"-\") {\n      // ACTG match\n      overviewMinimapTrack.push(\"G\");\n    } else if (referenceSeqSplit[i] !== alignedSeqSplit[i] && referenceSeqSplit[i] !== \"-\" && alignedSeqSplit[i] !== \"-\") {\n      // ACTG mismatch\n      overviewMinimapTrack.push(\"R\");\n    } else if (alignedSeqSplit[i] === \"-\") {\n      // deletion\n      overviewMinimapTrack.push(\"R\");\n    } else if (referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] !== \"-\" && i !== referenceSeqSplit.length - 1 && referenceSeqSplit[i + 1] === \"-\") {\n      // insertion (first \"-\" of a >1 insertion)\n      overviewMinimapTrack.push(\"R\");\n    } else if (referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] !== \"-\" && i !== referenceSeqSplit.length - 1 && referenceSeqSplit[i + 1] !== \"-\") {\n      // \"-\" of a one-bp insertion in the middle of the sequence\n      overviewMinimapTrack.push(\"R\");\n      i++;\n    } else if (i === referenceSeqSplit.length - 1 && referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] === \"-\") {\n      // final \"-\" of a >1 insertion at the 3' end of the sequence\n      overviewMinimapTrack.splice(-2, 1);\n    } else if (i === referenceSeqSplit.length - 1 && referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] !== \"-\") {\n      // \"-\" of a one-bp insertion at the 3' end of the sequence\n      overviewMinimapTrack.pop();\n      overviewMinimapTrack.push(\"R\");\n    } else if (referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] === \"-\" && referenceSeqSplit[i + 1] !== \"-\") {\n      // \"-\" at the end of an insertion\n      i++;\n    } else if (referenceSeqSplit[i] === \"-\" && referenceSeqSplit[i - 1] === \"-\") {\n      // insertion (NOT first \"-\" of the insertion)\n      // do nothing, skip over these \"-\"\n    } else {\n      console.error(\"should not reach this step!\");\n    }\n  }\n  return overviewMinimapTrack.join(\"\");\n};","\"use strict\";\n\n// const getAllInsertionsInSeqReads = require(\"./getAllInsertionsInSeqReads.js\");\nvar insertGapsIntoRefSeq = require(\"./insertGapsIntoRefSeq.js\");\n\nvar _require = require(\"lodash\"),\n    cloneDeep = _require.cloneDeep;\n\n// bam.seq: NTGTAAGTCGTGAAAAAANCNNNCATATTNCGGAGGTAAAAATGAAAA...\n// bam.pos: 43\n// bam.cigar: 36M2D917M3I17M7I2M1I6M5I4M1D6M12I8M\n// (note: bam.cigar is null if the sequencing read is unaligned)\n// bam.reversed: true (if reversed)\n\n// refSeq should be an object { name, sequence }\n// seqReads should be an array of objects [{name, seq, pos, cigar}, {name, seq, pos, cigar}, ...]\n// add gaps into sequencing reads before starting bp pos and from own deletions & all seq reads' insertions, minus own insertions\n\n\nmodule.exports = function addGapsToSeqReads(refSeq, seqReads) {\n  // remove unaligned seq reads for now\n  for (var i = 0; i < seqReads.length; i++) {\n    if (seqReads[i].cigar === null) {\n      seqReads.splice(i, 1);\n    }\n  }\n\n  var refSeqWithGaps = insertGapsIntoRefSeq(refSeq.sequence, seqReads);\n  // first object is reference sequence with gaps, to be followed by seq reads with gaps\n  var seqReadsWithGaps = [{ name: refSeq.name, sequence: refSeqWithGaps.toUpperCase() }];\n  seqReads.forEach(function (seqRead) {\n    // get all insertions in seq reads\n    var allInsertionsInSeqReads = [];\n    seqReads.forEach(function (seqRead) {\n      // split cigar string at S, M, D, or I (soft-clipped, match, deletion, or insertion), e.g. [\"5S\", \"2M\", \"3I\", \"39M\", \"3D\"...\"9S\"]\n      var splitSeqRead = seqRead.cigar.match(/([0-9]*[SMDI])/g);\n      // adjust seqRead.pos, aka bp pos where the seq read starts aligning to the ref seq, if bps have been soft-clipped from the beginning of the seq read\n      var adjustedSeqReadPos = cloneDeep(seqRead.pos);\n      if (splitSeqRead[0].slice(-1) === \"S\") {\n        // # in #S at beginning of array, i.e. number of soft-clipped base pairs at beginning of the seq read\n        var numOfBeginningSoftClipped = splitSeqRead[0].slice(0, -1);\n        adjustedSeqReadPos = seqRead.pos - numOfBeginningSoftClipped;\n      }\n      for (var componentI = 0; componentI < splitSeqRead.length; componentI++) {\n        if (splitSeqRead[componentI].slice(-1) === \"I\") {\n          var bpPosOfInsertion = adjustedSeqReadPos;\n          var numberOfInsertions = Number(splitSeqRead[componentI].slice(0, -1));\n          for (var _i = 0; _i < componentI; _i++) {\n            if (splitSeqRead[_i].slice(-1) !== \"I\") {\n              var previousComponentNumber = Number(splitSeqRead[_i].slice(0, -1));\n              bpPosOfInsertion += previousComponentNumber;\n            }\n          }\n          var insertionInfo = {\n            // keeping bpPos 1-based\n            bpPos: bpPosOfInsertion,\n            number: numberOfInsertions\n          };\n          allInsertionsInSeqReads.push(insertionInfo);\n        }\n      }\n    });\n\n    // 1) add gaps before starting bp pos\n    var splitSeqReadChunk = seqRead.cigar.match(/([0-9]*[SMDI])/g);\n    var adjustedSeqReadPos = cloneDeep(seqRead.pos);\n    if (splitSeqReadChunk[0].slice(-1) === \"S\") {\n      // # in #S at beginning of array, i.e. number of soft-clipped base pairs at beginning of the seq read\n      var numOfBeginningSoftClipped = splitSeqReadChunk[0].slice(0, -1);\n      adjustedSeqReadPos = seqRead.pos - numOfBeginningSoftClipped;\n    }\n    var eachSeqReadWithGaps = seqRead.seq.split(\"\");\n    if (adjustedSeqReadPos > 0) {\n      eachSeqReadWithGaps.unshift(\"-\".repeat(adjustedSeqReadPos - 1));\n    }\n    eachSeqReadWithGaps = eachSeqReadWithGaps.join(\"\").split(\"\");\n\n    // 2) add own deletions to own sequence\n    // get own deletions\n    var ownDeletions = [];\n    for (var componentI = 0; componentI < splitSeqReadChunk.length; componentI++) {\n      if (splitSeqReadChunk[componentI].slice(-1) === \"D\") {\n        var bpPosOfDeletion = adjustedSeqReadPos;\n        var numberOfDeletions = Number(splitSeqReadChunk[componentI].slice(0, -1));\n        for (var _i2 = 0; _i2 < componentI; _i2++) {\n          var previousComponentNumber = Number(splitSeqReadChunk[_i2].slice(0, -1));\n          bpPosOfDeletion += previousComponentNumber;\n        }\n        var deletionInfo = {\n          // keeping bpPos 1-based\n          bpPos: bpPosOfDeletion,\n          number: numberOfDeletions\n        };\n        ownDeletions.push(deletionInfo);\n      }\n    }\n    // sort deletions by ascending bp pos\n    var sortedOwnDeletions = ownDeletions.sort(function (a, b) {\n      return a.bpPos - b.bpPos;\n    });\n    // add own deletions to own sequence\n    for (var ownD = 0; ownD < sortedOwnDeletions.length; ownD++) {\n      var _bpPosOfDeletion = sortedOwnDeletions[ownD].bpPos;\n      var _numberOfDeletions = sortedOwnDeletions[ownD].number;\n      // adding gaps at the bp pos\n      var deletionGaps = \"\";\n      for (var gapD = 0; gapD < _numberOfDeletions; gapD++) {\n        deletionGaps += \"-\";\n      }\n      eachSeqReadWithGaps.splice(_bpPosOfDeletion - 1, 0, deletionGaps);\n      eachSeqReadWithGaps = eachSeqReadWithGaps.join(\"\").split(\"\");\n    }\n    eachSeqReadWithGaps = eachSeqReadWithGaps.join(\"\").split(\"\");\n\n    // 3) remove own insertions from own sequence\n    // get own insertions\n    var ownInsertions = [];\n    var ownInsertionsBp = [];\n    for (var _componentI = 0; _componentI < splitSeqReadChunk.length; _componentI++) {\n      if (splitSeqReadChunk[_componentI].slice(-1) === \"I\") {\n        var bpPosOfInsertion = adjustedSeqReadPos;\n        var numberOfInsertions = Number(splitSeqReadChunk[_componentI].slice(0, -1));\n        var nucleotides = [];\n        for (var _i3 = 0; _i3 < _componentI; _i3++) {\n          var _previousComponentNumber = Number(splitSeqReadChunk[_i3].slice(0, -1));\n          bpPosOfInsertion += _previousComponentNumber;\n        }\n        for (var nucI = 0; nucI < numberOfInsertions; nucI++) {\n          nucleotides.push(eachSeqReadWithGaps[bpPosOfInsertion - 1 + nucI]);\n        }\n        var insertionInfo = {\n          // keeping bpPos 1-based\n          bpPos: bpPosOfInsertion,\n          number: numberOfInsertions\n        };\n        var insertionInfoBp = {\n          // keeping bpPos 1-based\n          bpPos: bpPosOfInsertion,\n          number: numberOfInsertions,\n          nucleotides: nucleotides\n        };\n        ownInsertions.push(insertionInfo);\n        ownInsertionsBp.push(insertionInfoBp);\n      }\n    }\n    var ownInsertionsCompare = JSON.parse(JSON.stringify(ownInsertions));\n    // sort own insertions by ascending bp pos\n    var sortedOwnInsertions = ownInsertions.sort(function (a, b) {\n      return a.bpPos - b.bpPos;\n    });\n    var sortedOwnInsertionsBp = ownInsertionsBp.sort(function (a, b) {\n      return a.bpPos - b.bpPos;\n    });\n    // remove own insertions from own sequence\n    for (var ownI = 0; ownI < sortedOwnInsertions.length; ownI++) {\n      var _bpPosOfInsertion = sortedOwnInsertions[ownI].bpPos;\n      var _numberOfInsertions = sortedOwnInsertions[ownI].number;\n      for (var numI = 0; numI < _numberOfInsertions; numI++) {\n        eachSeqReadWithGaps.splice(_bpPosOfInsertion - 1, 1);\n      }\n      for (var posI = ownI + 1; posI < sortedOwnInsertions.length; posI++) {\n        sortedOwnInsertions[posI].bpPos -= _numberOfInsertions;\n      }\n    }\n\n    // 4) add other seq reads' insertions to seq read\n    // get other seq reads' insertions (i.e. all insertions minus duplicates minus own insertions)\n    var otherInsertions = allInsertionsInSeqReads.sort(function (a, b) {\n      return a.bpPos - b.bpPos;\n    });\n    // combine duplicates within all insertions, remove own insertions from all insertions, combine overlap between other insertions & own insertions\n    // first, combine duplicates within all insertions\n    otherInsertions = otherInsertions.filter(function (object, index) {\n      return index === otherInsertions.findIndex(function (obj) {\n        return JSON.stringify(obj) === JSON.stringify(object);\n      });\n    });\n    // 'i < otherInsertions.length - 1' because when at the end of the array, there is no 'i + 1' to compare to\n    for (var _i4 = 0; _i4 < otherInsertions.length - 1; _i4++) {\n      while (otherInsertions[_i4].bpPos === otherInsertions[_i4 + 1].bpPos) {\n        if (otherInsertions[_i4].number > otherInsertions[_i4 + 1].number) {\n          // remove the one with fewer number of gaps from array\n          otherInsertions.splice(_i4 + 1, 1);\n        } else if (otherInsertions[_i4].number < otherInsertions[_i4 + 1].number) {\n          otherInsertions.splice(_i4, 1);\n        } else if (otherInsertions[_i4].number === otherInsertions[_i4 + 1].number) {\n          otherInsertions.splice(_i4, 1);\n        }\n      }\n    }\n    // then remove own insertions from all insertions\n\n    var _loop = function _loop(_otherI) {\n      var insertionInfoIndex = otherInsertions.findIndex(function (e) {\n        return e.bpPos === ownInsertionsCompare[_otherI].bpPos;\n      });\n      if (insertionInfoIndex !== -1) {\n        if (otherInsertions[insertionInfoIndex].number > ownInsertionsCompare[_otherI].number) {\n          otherInsertions[insertionInfoIndex].number = otherInsertions[insertionInfoIndex].number - ownInsertionsCompare[_otherI].number;\n        } else if (otherInsertions[insertionInfoIndex].number <= ownInsertionsCompare[_otherI].number) {\n          otherInsertions.splice(insertionInfoIndex, 1);\n          _otherI--;\n        }\n      }\n      otherI = _otherI;\n    };\n\n    for (var otherI = 0; otherI < ownInsertionsCompare.length; otherI++) {\n      _loop(otherI);\n    }\n    // then combine overlap between other insertions & own insertions\n\n    var _loop2 = function _loop2(_overlapI) {\n      var insertionInfoIndex = otherInsertions.findIndex(function (e) {\n        return e.bpPos === sortedOwnInsertions[_overlapI].bpPos;\n      });\n      if (insertionInfoIndex !== -1) {\n        if (otherInsertions[insertionInfoIndex].number > sortedOwnInsertions[_overlapI].number) {\n          otherInsertions[insertionInfoIndex].number = otherInsertions[insertionInfoIndex].number - sortedOwnInsertions[_overlapI].number;\n        } else if (otherInsertions[insertionInfoIndex].number <= sortedOwnInsertions[_overlapI].number) {\n          otherInsertions.splice(insertionInfoIndex, 1);\n          _overlapI--;\n        }\n      }\n      overlapI = _overlapI;\n    };\n\n    for (var overlapI = 0; overlapI < sortedOwnInsertions.length; overlapI++) {\n      _loop2(overlapI);\n    }\n    // adjust own insertions according to other seq reads' insertions to be added (i.e. for all other reads' insertions with smaller bp pos, +1 to that own insertion's bp pos)\n    var adjustedOwnInsertionsBp = JSON.parse(JSON.stringify(sortedOwnInsertionsBp));\n    for (var _ownI = 0; _ownI < adjustedOwnInsertionsBp.length; _ownI++) {\n      var previousInserts = 0;\n      for (var _i5 = 0; _i5 < _ownI; _i5++) {\n        previousInserts += adjustedOwnInsertionsBp[_i5].number - 1;\n      }\n      adjustedOwnInsertionsBp[_ownI].bpPos = adjustedOwnInsertionsBp[_ownI].bpPos - previousInserts;\n      sortedOwnInsertionsBp[_ownI].bpPos = sortedOwnInsertionsBp[_ownI].bpPos - previousInserts;\n    }\n    for (var otherI = 0; otherI < otherInsertions.length; otherI++) {\n      for (var _ownI2 = 0; _ownI2 < adjustedOwnInsertionsBp.length; _ownI2++) {\n        if (otherInsertions[otherI].bpPos <= sortedOwnInsertionsBp[_ownI2].bpPos) {\n          adjustedOwnInsertionsBp[_ownI2].bpPos += 1;\n        }\n      }\n    }\n    // add other seq reads' insertions to sequence\n    for (var _otherI2 = 0; _otherI2 < otherInsertions.length && otherInsertions[_otherI2].bpPos <= eachSeqReadWithGaps.length; _otherI2++) {\n      var _bpPosOfInsertion2 = otherInsertions[_otherI2].bpPos;\n      var _numberOfInsertions2 = otherInsertions[_otherI2].number;\n      // adding gaps at the bp pos\n      var insertionGaps = \"\";\n      for (var gapI = 0; gapI < _numberOfInsertions2; gapI++) {\n        insertionGaps += \"-\";\n      }\n      eachSeqReadWithGaps.splice(_bpPosOfInsertion2 - 1, 0, insertionGaps);\n      for (var _posI = _otherI2 + 1; _posI < otherInsertions.length; _posI++) {\n        otherInsertions[_posI].bpPos += 1;\n      }\n    }\n\n    // 5) add own insertions to own sequence\n    for (var _ownI3 = 0; _ownI3 < adjustedOwnInsertionsBp.length; _ownI3++) {\n      var _bpPosOfInsertion3 = adjustedOwnInsertionsBp[_ownI3].bpPos;\n      var _nucleotides = adjustedOwnInsertionsBp[_ownI3].nucleotides.join(\"\");\n      eachSeqReadWithGaps.splice(_bpPosOfInsertion3 - 1, 0, _nucleotides);\n    }\n\n    // 6) add gaps after seq read for ref seq's length = seq read's length\n    eachSeqReadWithGaps = eachSeqReadWithGaps.join(\"\").split(\"\");\n    if (eachSeqReadWithGaps.length < refSeqWithGaps.length) {\n      eachSeqReadWithGaps.push(\"-\".repeat(refSeqWithGaps.length - eachSeqReadWithGaps.length));\n    }\n\n    // eachSeqReadWithGaps is a string \"GGGA--GA-C--ACC\"\n    seqReadsWithGaps.push({\n      name: seqRead.name,\n      sequence: eachSeqReadWithGaps.join(\"\"),\n      reversed: seqRead.reversed,\n      cigar: seqRead.cigar\n    });\n  });\n\n  // 7) add gaps before starting bp pos\n  // add gaps based on any seq reads that extend beyond beginning of the ref seq due to soft-clipped reads\n  // a) get the lengths of bps that extend beyond the beginning of the ref seq among all seq reads\n  var seqReadLengthsBeforeRefSeqStart = [];\n  seqReads.forEach(function (seq) {\n    var splitSeqReadChunk = seq.cigar.match(/([0-9]*[SMDI])/g);\n    var adjustedSeqReadPos = cloneDeep(seq.pos);\n    if (splitSeqReadChunk[0].slice(-1) === \"S\") {\n      // # in #S at beginning of array, i.e. number of soft-clipped base pairs at beginning of the seq read\n      var numOfBeginningSoftClipped = splitSeqReadChunk[0].slice(0, -1);\n      adjustedSeqReadPos = seq.pos - numOfBeginningSoftClipped;\n      // number of gaps to add if soft-clipped reads extend beyond beginning of ref seq\n      if (adjustedSeqReadPos < 0) {\n        seqReadLengthsBeforeRefSeqStart.push(Math.abs(adjustedSeqReadPos));\n      }\n    }\n    // number of gaps to add if seqRead.pos is negative (not sure if this is possible with bowtie2 outputs)\n    // if (seq.pos < 0) {\n    //   seqReadLengthsBeforeRefSeqStart.push(Math.abs(seq.pos))\n    // }\n  });\n  // b) add gaps (to both ref seq and seq reads) based on any seq reads that extend beyond beginning of ref seq due to soft-clipped reads\n  var longestSeqReadLength = 0;\n  for (var _i6 = 1; _i6 < seqReadsWithGaps.length; _i6++) {\n    // turn seq read into an array [\"A\", \"T\", \"C\", \"G\"...]\n    var eachSeqReadWithGaps = seqReadsWithGaps[_i6].sequence.split(\"\");\n    var splitSeqReadChunk = seqReads[_i6 - 1].cigar.match(/([0-9]*[SMDI])/g);\n    var adjustedSeqReadPos = cloneDeep(seqReads[_i6 - 1].pos);\n    // longest length of bps that extend beyond the beginning of the ref seq among all seq reads\n    if (seqReadLengthsBeforeRefSeqStart.length > 0) {\n      longestSeqReadLength = Math.max.apply(Math, seqReadLengthsBeforeRefSeqStart);\n    }\n    if (splitSeqReadChunk[0].slice(-1) === \"S\") {\n      // # in #S at beginning of array, i.e. number of soft-clipped base pairs at beginning of the seq read\n      var numOfBeginningSoftClipped = splitSeqReadChunk[0].slice(0, -1);\n      adjustedSeqReadPos = seqReads[_i6 - 1].pos - numOfBeginningSoftClipped;\n      if (adjustedSeqReadPos > 0) {\n        if (longestSeqReadLength > 0) {\n          eachSeqReadWithGaps.unshift(\"-\".repeat(longestSeqReadLength + 1));\n        }\n        seqReadsWithGaps[_i6].sequence = eachSeqReadWithGaps.join(\"\");\n      } else if (adjustedSeqReadPos < 0) {\n        if (longestSeqReadLength > 0) {\n          eachSeqReadWithGaps.unshift(\"-\".repeat(longestSeqReadLength - Math.abs(adjustedSeqReadPos)));\n        }\n        seqReadsWithGaps[_i6].sequence = eachSeqReadWithGaps.join(\"\");\n      }\n    } else {\n      if (longestSeqReadLength > 0) {\n        eachSeqReadWithGaps.unshift(\"-\".repeat(longestSeqReadLength + 1));\n      }\n      seqReadsWithGaps[_i6].sequence = eachSeqReadWithGaps.join(\"\");\n    }\n  }\n\n  // add gaps before ref seq based on the longest length of soft-clipped reads that extend beyond beginning of ref seq\n  if (longestSeqReadLength > 0) {\n    var splitRefSeqWithGaps = seqReadsWithGaps[0].sequence.split(\"\");\n    splitRefSeqWithGaps.unshift(\"-\".repeat(longestSeqReadLength + 1));\n    seqReadsWithGaps[0].sequence = splitRefSeqWithGaps.join(\"\");\n  }\n\n  // 8) check if any seq read is longer than the ref seq, make ref seq & seq reads all the same length\n  var lengthsOfLongerSeqReads = [];\n  for (var _i7 = 1; _i7 < seqReadsWithGaps.length; _i7++) {\n    var _refSeq = seqReadsWithGaps[0];\n    if (seqReadsWithGaps[_i7].sequence.length > _refSeq.sequence.length) {\n      lengthsOfLongerSeqReads.push(seqReadsWithGaps[_i7].sequence.length);\n    }\n  }\n  if (lengthsOfLongerSeqReads.length > 0) {\n    var _longestSeqReadLength = Math.max.apply(Math, lengthsOfLongerSeqReads);\n    for (var _i8 = 0; _i8 < seqReadsWithGaps.length; _i8++) {\n      if (seqReadsWithGaps[_i8].sequence.length < _longestSeqReadLength) {\n        seqReadsWithGaps[_i8].sequence += \"-\".repeat(_longestSeqReadLength - seqReadsWithGaps[_i8].sequence.length);\n      }\n    }\n  }\n  // if any seq read shorter than ref seq, make ref seq & seq reads all the same length\n  for (var _i9 = 1; _i9 < seqReadsWithGaps.length; _i9++) {\n    var _refSeq2 = seqReadsWithGaps[0];\n    if (seqReadsWithGaps[_i9].sequence.length < _refSeq2.sequence.length) {\n      seqReadsWithGaps[_i9].sequence += \"-\".repeat(_refSeq2.sequence.length - seqReadsWithGaps[_i9].sequence.length);\n    }\n  }\n\n  // seqReadsWithGaps is an array of objects containing the ref seq with gaps first and then all seq reads with gaps\n  // e.g. [{ name: \"ref seq\", sequence: \"GG---GA--GA-C--A---CC---\"}, { name: \"r1\", sequence: \"-----GATTGA-C-----------\"}...]\n  return seqReadsWithGaps;\n};","\"use strict\";\n\nvar calculateTm = require(\"./calculateNebTm\");\n\nmodule.exports = function calculateNebTa(sequences, primerConc) {\n  var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      monovalentCationConc = _ref.monovalentCationConc,\n      polymerase = _ref.polymerase;\n\n  try {\n    if (sequences.length !== 2) {\n      throw new Error(sequences.length + \" sequences received when 2 primers were expected\");\n    }\n    var meltingTemperatures = sequences.map(function (seq) {\n      return calculateTm(seq, primerConc, { monovalentCationConc: monovalentCationConc });\n    });\n    meltingTemperatures.sort(function (a, b) {\n      return a - b;\n    });\n    var lowerMeltingTemp = meltingTemperatures[0];\n    var annealingTemp = void 0;\n    if (polymerase === \"Q5\") {\n      // Ta = Tm_lower+1°C is standard for Q5\n      annealingTemp = lowerMeltingTemp + 1;\n      if (annealingTemp > 72) {\n        // \"Annealing temperature for experiments with this enzyme should typically not exceed 72°C\"\n        annealingTemp = 72;\n      }\n    } else {\n      annealingTemp = lowerMeltingTemp - 3;\n    }\n    return annealingTemp;\n  } catch (err) {\n    return \"Error calculating annealing temperature: \" + err;\n  }\n};","\"use strict\";\n\nvar getDigestFragmentsForCutsites = require(\"./getDigestFragmentsForCutsites\");\nvar cutSequenceByRestrictionEnzyme = require(\"./cutSequenceByRestrictionEnzyme\");\n\nvar _require = require(\"lodash\"),\n    flatMap = _require.flatMap;\n\nmodule.exports = function getDigestFragmentsForRestrictionEnzymes(sequence, circular, restrictionEnzymeOrEnzymes, opts) {\n  var restrictionEnzymes = Array.isArray(restrictionEnzymeOrEnzymes) ? restrictionEnzymeOrEnzymes : [restrictionEnzymeOrEnzymes];\n  var cutsites = flatMap(restrictionEnzymes, function (restrictionEnzyme) {\n    return cutSequenceByRestrictionEnzyme(sequence, circular, restrictionEnzyme);\n  });\n  return getDigestFragmentsForCutsites(sequence.length, circular, cutsites, opts);\n};","\"use strict\";\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nmodule.exports = function convertAACaretPositionOrRangeToDna(rangeOrCaret) {\n  if ((typeof rangeOrCaret === \"undefined\" ? \"undefined\" : _typeof(rangeOrCaret)) === \"object\" && rangeOrCaret !== null) {\n    return convertAARangeToDnaRange(_extends({}, rangeOrCaret, {\n      locations: rangeOrCaret.locations ? rangeOrCaret.locations.map(convertAARangeToDnaRange) : undefined\n    }));\n  } else {\n    return convertAACaretPositionToDnaCaretPosition(rangeOrCaret);\n  }\n};\n\nfunction convertAACaretPositionToDnaCaretPosition(caret) {\n  return caret * 3;\n}\n\nfunction convertAARangeToDnaRange(range) {\n  return _extends({}, range, {\n    start: range.start > -1 ? range.start * 3 : range.start,\n    end: range.end > -1 ? range.end * 3 + 2 : range.end\n  });\n}","\"use strict\";\n\nvar _require = require(\"lodash\"),\n    invert = _require.invert;\n\nvar aminoAcidToDegenerateRnaMap = require(\"./aminoAcidToDegenerateRnaMap\");\n\nvar degenerateRnaToAminoAcidMap = invert(aminoAcidToDegenerateRnaMap);\nmodule.exports = degenerateRnaToAminoAcidMap;","\"use strict\";\n\nvar proteinAlphabet = require(\"./proteinAlphabet\");\n\n/**\n * @param {string} aaString A string of amino acid characters\n * @param {number} numsAfterDecimal the number of digits to round to after the decimal point, must be greater than 0\n * @param {boolean} divideByThree divide the final mass by three,\n *  this is useful in situtations where nucelotides are converted to\n *  amino acids in a way that the amino acid appears three times\n * @returns The sum of the mass of all amino acids in the string\n */\nmodule.exports = function getMassOfAaString(aaString) {\n  var numsAfterDecimal = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var divideByThree = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n\n  var sumMass = 0;\n  for (var i = 0; i < aaString.length; i++) {\n    sumMass += proteinAlphabet[aaString[i]].mass;\n  }\n  if (divideByThree) {\n    sumMass /= 3;\n  }\n  return Math.round(sumMass * Math.pow(10, numsAfterDecimal)) / Math.pow(10, numsAfterDecimal);\n};","\"use strict\";\n\nvar _require = require(\"./annotationTypes\"),\n    modifiableTypes = _require.modifiableTypes;\n\nvar adjustAnnotationsToInsert = require(\"./adjustAnnotationsToInsert\");\n\nmodule.exports = function shiftAnnotationsByLen(_ref) {\n  var seqData = _ref.seqData,\n      caretPosition = _ref.caretPosition,\n      insertLength = _ref.insertLength;\n\n  modifiableTypes.forEach(function (annotationType) {\n    var existingAnnotations = seqData[annotationType];\n    seqData[annotationType] = adjustAnnotationsToInsert(existingAnnotations, caretPosition, insertLength);\n  });\n};","export const formName = \"autoAnnotate\";\n","import { formName } from \"./constants\";\nconst {\n  startCase,\n  compose,\n  hideDialog,\n  typeField,\n  pluralize,\n  React,\n  useEffect,\n  DataTable,\n  DialogFooter,\n  withSelectedEntities,\n  withSelectTableRecords,\n  tidyUpAnnotation\n} = window.addOnGlobals;\n\nconst schemaFeatures = [\"name\", typeField, \"start\", \"end\", \"strand\"];\nconst schemaOther = [\"name\", \"start\", \"end\", \"strand\"];\nexport default compose(\n  withSelectedEntities(formName),\n  withSelectTableRecords(formName)\n)(function CreateAnnotationsPage(props) {\n  const {\n    newAnnotations,\n    annotationType,\n    annotationVisibilityShow,\n    beforeAnnotationCreate,\n    handleSubmit,\n    selectTableRecords,\n    sequenceData\n  } = props;\n  const ents = props[`${formName}SelectedEntities`];\n  useEffect(() => {\n    selectTableRecords(newAnnotations);\n  }, [newAnnotations, selectTableRecords]);\n  return (\n    <div className=\"bp3-dialog-body\">\n      <div>\n        The following {annotationType}\n        {newAnnotations.length > 1 ? \"s\" : \"\"} will be added:\n        <DataTable\n          isInfinite\n          formName={formName}\n          entities={newAnnotations.map((e) => ({\n            ...e,\n            start: e.start + 1,\n            end: e.end + 1\n          }))}\n          withCheckboxes\n          schema={annotationType === \"feature\" ? schemaFeatures : schemaOther}\n        ></DataTable>\n      </div>\n      <DialogFooter\n        hideModal={hideDialog}\n        onClick={handleSubmit(async () => {\n          const annotationTypePlural = pluralize(annotationType);\n\n          ents.forEach((newAnnotation, i) => {\n            beforeAnnotationCreate &&\n              beforeAnnotationCreate({\n                annotationTypePlural,\n                annotation: newAnnotation,\n                props: props\n              });\n\n            let conditionals = {};\n            if (ents.length > 1) {\n              if (i === 0) {\n                conditionals = {\n                  batchUndoStart: true\n                };\n              } else if (i === ents.length - 1) {\n                conditionals = {\n                  batchUndoEnd: true\n                };\n              } else {\n                conditionals = {\n                  batchUndoMiddle: true\n                };\n              }\n            }\n            props[`upsert${startCase(annotationType)}`](\n              tidyUpAnnotation(newAnnotation, {\n                sequenceData,\n                annotationType: annotationTypePlural\n              }),\n              conditionals\n            );\n            annotationVisibilityShow(annotationTypePlural);\n          });\n\n          hideDialog();\n        })}\n        text=\"Add\"\n      ></DialogFooter>\n    </div>\n  );\n});\n","/* Copyright (C) 2018 TeselaGen Biotechnology, Inc. */\nconst { Tab, Tabs, wrapDialog, React } = window.addOnGlobals;\n\nconst highlightStyle = {\n  background: \"red\",\n  marginTop: 2\n};\nexport const AutoAnnotateBpMatchingDialog = wrapDialog({\n  title: \"Annotation Matching\"\n})(function ({ isRegex }) {\n  return (\n    <div className=\"bp3-dialog-body\">\n      <Tabs defaultSelectedTabId={isRegex ? \"regex\" : \"iupac\"}>\n        <Tab\n          id=\"iupac\"\n          title=\"IUPAC\"\n          panel={\n            <div>\n              <p>\n                When in standard (IUPAC) mode, annotations are matched\n                case-insensitively. You can use any degenerate IUPAC base pair\n                as well as a couple special characters.\n              </p>\n              <h4>Special Characters:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"1fr 5fr\",\n                  maxHeight: 200,\n                  overflow: \"auto\"\n                }}\n              >\n                <div>#</div>\n                <div>\n                  Any arbitrary string of zero or more bases can be matched\n                  here.\n                </div>\n                <div>{\"<\"}</div>\n                <div>Any bases before a {\"<\"} are considered optional</div>\n                <div>{\">\"}</div>\n                <div>Any bases after a {\">\"} are considered optional</div>\n                <div>M</div> <div>AC</div>\n                <div>R</div> <div>AG</div>\n                <div>W</div> <div>AT</div>\n                <div>S</div> <div>CG</div>\n                <div>Y</div> <div>CT</div>\n                <div>K</div> <div>GT</div>\n                <div>V</div> <div>ACG</div>\n                <div>H</div> <div>ACT</div>\n                <div>D</div> <div>AGT</div>\n                <div>B</div> <div>CGT</div>\n                <div>X</div> <div>GATC</div>\n                <div>N</div> <div>GATC</div>\n                <div>.</div> <div>GATC</div>\n              </div>\n              <br></br>\n              <h4>Examples:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"2fr 5fr\"\n                }}\n              >\n                <h6>Annotation</h6>\n                <h6>\n                  Sequence (matches in <span style={highlightStyle}>red</span>)\n                </h6>\n                <div>AATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>aAkT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCC\n                  <span style={highlightStyle}>AAGT</span>\n                </div>\n                <div>ANT</div>\n                <div>\n                  AA<span style={highlightStyle}>AAT</span>TTTGGGGGCCCCCA\n                  <span style={highlightStyle}>AGT</span>\n                </div>\n                <div>T#C</div>\n                <div>\n                  AAAATTT<span style={highlightStyle}>TGGGGGC</span>CCCCAAGT\n                </div>\n                <div>CA{\"<\"}ATTT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTT</span>TGGGGGCCCCCAAGT\n                </div>\n                <div>\n                  CA{\"<\"}ATT{\">\"}TTGAG\n                </div>\n                <div>\n                  AA<span style={highlightStyle}>AATTTTG</span>GGGGCCCCCAAGT\n                </div>\n              </div>\n\n              <br></br>\n              {/* <ConvertApeToRegexTool></ConvertApeToRegexTool> */}\n            </div>\n          }\n        ></Tab>\n        <Tab\n          id=\"regex\"\n          title=\"Regex\"\n          panel={\n            <div>\n              <p>\n                When in regex mode, you can use any custom regex to match base\n                pairs\n              </p>\n              <p>\n                You can learn more and try out your custom regexes at{\" \"}\n                <a href=\"https://regex101.com/\">https://regex101.com/</a>\n              </p>\n              <br></br>\n              <h4>Examples:</h4>\n              <div\n                style={{\n                  display: \"grid\",\n                  columnGap: 20,\n                  gridTemplateColumns: \"2fr 5fr\"\n                }}\n              >\n                <h6>Annotation</h6>\n                <h6>\n                  Sequence (matches in <span style={highlightStyle}>red</span>)\n                </h6>\n                <div>AATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>aAtT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATT</span>TTGGGGGCCCCCAAGT\n                </div>\n                <div>A.T</div>\n                <div>\n                  AA<span style={highlightStyle}>AAT</span>TTTGGGGGCCCCCA\n                  <span style={highlightStyle}>AGT</span>\n                </div>\n                <div>T.*C</div>\n                <div>\n                  AAAA<span style={highlightStyle}>TTTTGGGGGCCCCC</span>AAGT\n                </div>\n                <div>T[^T]*?C</div>\n                <div>\n                  AAAATTT<span style={highlightStyle}>TGGGGGC</span>CCCCAAGT\n                </div>\n                <div>C?A?ATT</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTT</span>TGGGGGCCCCCAAGT\n                </div>\n                <div>C?A?ATTT?T?C?</div>\n                <div>\n                  AA<span style={highlightStyle}>AATTTT</span>GGGGGCCCCCAAGT\n                </div>\n              </div>\n              <br></br>\n\n              {/* <ConvertApeToRegexTool></ConvertApeToRegexTool> */}\n            </div>\n          }\n        ></Tab>\n      </Tabs>\n    </div>\n  );\n});\n\n// function ConvertApeToRegexTool() {\n//   const [inputVal, setInput] = useState(\"CA<ANT>TTGAG\");\n\n//   let convertedVal = \"\";\n//   try {\n//     convertedVal = convertApELikeRegexToRegex(inputVal);\n//   } catch (error) {\n//     convertedVal = \"Error trying to convert to regex\";\n//   }\n//   return (\n//     <div\n//       style={{\n//         display: \"grid\",\n//         rowGap: 10,\n//         columnGap: 10,\n//         gridTemplateColumns: \"1fr 5fr\"\n//       }}\n//     >\n//       <div>Input:</div>\n//       <TextArea\n//         value={inputVal}\n//         onChange={e => {\n//           setInput(e.target.value.replace(/\\s/g, \"X\"));\n//         }}\n//       ></TextArea>\n\n//       <div>Output:</div>\n//       <div\n//         style={{ maxHeight: 200, overflowWrap: \"anywhere\", overflow: \"auto\" }}\n//       >\n//         {convertedVal}\n//       </div>\n//     </div>\n//   );\n// }\n","/* Copyright (C) 2018 TeselaGen Biotechnology, Inc. */\nimport { parse } from \"papaparse\";\n\nexport const allowedCsvFileTypes = [\".csv\", \".txt\", \".xlsx\"];\n\nexport const isZipFile = (file) => {\n  const type = file.mimetype || file.type;\n  return type === \"application/zip\" || type === \"application/x-zip-compressed\";\n};\n\nexport const getExt = (file) => file.name.split(\".\").pop();\nexport const isExcelFile = (file) => getExt(file) === \"xlsx\";\nexport const isCsvFile = (file) => getExt(file) === \"csv\";\nexport const isTextFile = (file) => [\"text\", \"txt\"].includes(getExt(file));\n\nconst defaultCsvParserOptions = {\n  header: true,\n  skipEmptyLines: \"greedy\",\n  trimHeaders: true,\n  // delimiter: \",\"\n};\n\nexport const parseCsvFile = (csvFile, parserOptions = {}) => {\n  return new Promise((resolve, reject) => {\n    parse(csvFile.originFileObj, {\n      ...defaultCsvParserOptions,\n      complete: (results) => {\n        if (results && results.errors && results.errors.length) {\n          return reject(\"Error in csv: \" + JSON.stringify(results.errors));\n        }\n        resolve(results);\n      },\n      error: (error) => {\n        reject(error);\n      },\n      ...parserOptions\n    });\n  });\n};\n\nexport const parseCsvString = (csvString, parserOptions = {}) => {\n  return parse(csvString, { ...defaultCsvParserOptions, ...parserOptions });\n};\n\nexport const cleanCommaSeparatedCell = (cellData) =>\n  (cellData || \"\")\n    .split(\",\")\n    .map((n) => n.trim())\n    .filter((n) => n);\n\n/**\n * Because the csv rows might not have the same header keys in some cases (extended properties)\n * this function will make sure that each row will have all headers so that the export\n * does not drop fields\n * @param {*} rows\n */\nexport const cleanCsvExport = (rows) => {\n  const allHeaders = [];\n  rows.forEach((row) => {\n    Object.keys(row).forEach((header) => {\n      if (!allHeaders.includes(header)) {\n        allHeaders.push(header);\n      }\n    });\n  });\n  rows.forEach((row) => {\n    allHeaders.forEach((header) => {\n      row[header] = row[header] || \"\";\n    });\n  });\n  return rows;\n};\n\nexport const validateCSVRequiredHeaders = (\n  fields,\n  requiredHeaders,\n  filename\n) => {\n  const missingRequiredHeaders = requiredHeaders.filter((field) => {\n    return !fields.includes(field);\n  });\n  if (missingRequiredHeaders.length) {\n    const name = filename ? `The file ${filename}` : \"CSV file\";\n    return `${name} is missing required headers. (${missingRequiredHeaders.join(\n      \", \"\n    )})`;\n  }\n};\n\nexport const validateCSVRow = (row, requiredHeaders, index) => {\n  const missingRequiredFields = requiredHeaders.filter((field) => !row[field]);\n  if (missingRequiredFields.length) {\n    if (missingRequiredFields.length === 1) {\n      return `Row ${index + 1} is missing the required field \"${\n        missingRequiredFields[0]\n      }\"`;\n    } else {\n      return `Row ${\n        index + 1\n      } is missing these required fields: ${missingRequiredFields.join(\", \")}`;\n    }\n  }\n};\n","/* eslint-disable jsx-a11y/anchor-is-valid */\n/* eslint-disable jsx-a11y/anchor-has-content */\n/* eslint-disable no-throw-literal */\nimport { unparse } from \"papaparse\";\nimport CreateAnnotationsPage from \"./CreateAnnotationsPage\";\nimport { formName } from \"./constants\";\nimport { AutoAnnotateBpMatchingDialog } from \"./AutoAnnotateBpMatchingDialog\";\nimport {\n  parseCsvFile,\n  validateCSVRequiredHeaders,\n  validateCSVRow\n} from \"./fileUtils\";\nimport downloadjs from \"downloadjs\";\nimport { convertProteinSeqToDNAIupac } from \"ve-sequence-utils\";\n\nconst {\n  shortid,\n  FileUploadField,\n  Colors,\n  Tab,\n  Tabs,\n  pluralize,\n  reduxForm,\n  SubmissionError,\n  getFeatureToColorMap,\n  getFeatureTypes,\n  InfoHelper,\n  showConfirmationDialog,\n  wrapDialog,\n  showDialog,\n  withEditorProps,\n  DialogFooter,\n  useState,\n  hideDialog,\n  startCase,\n  compose,\n  React,\n  convertApELikeRegexToRegex,\n  autoAnnotate,\n  useEffect,\n  DataTable,\n  typeField\n} = window.addOnGlobals;\n\nexport function autoAnnotateFeatures() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"feature\"\n    }\n  });\n}\nexport function autoAnnotateParts() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"part\"\n    }\n  });\n}\nexport function autoAnnotatePrimers() {\n  showDialog({\n    ModalComponent: AutoAnnotateModal, //we want to use a ModalComponent here so our addon does not\n    props: {\n      annotationType: \"primer\"\n    }\n  });\n}\n\nexport const AutoAnnotateModal = compose(\n  wrapDialog((p) => ({\n    canEscapeKeyClose: false,\n    title: `Auto Annotate ${startCase(pluralize(p.annotationType))}`\n  })),\n  withEditorProps,\n  reduxForm({ form: formName })\n)((props) => {\n  const {\n    sequenceData,\n    handleSubmit,\n    annotationType = \"feature\",\n    error,\n    getCustomAutoAnnotateList\n  } = props;\n  const [fileType, setSelectedImportType] = useState(\"csvFile\");\n  const [newAnnotations, setNewAnns] = useState(false);\n  const [customAnnResponse, setCustomAnnResponse] = useState();\n  const [loadingCustomAnnList, setLoadingCustomAnnList] = useState();\n  useEffect(() => {\n    (async () => {\n      if (getCustomAutoAnnotateList) {\n        setLoadingCustomAnnList(true);\n        try {\n          const anns = await getCustomAutoAnnotateList(props);\n          setCustomAnnResponse(anns);\n        } catch (e) {\n          window.toastr.warning(\"Error loading custom annotation list\");\n          console.error(`e:`, e);\n        } finally {\n          setLoadingCustomAnnList(false);\n        }\n      }\n    })();\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, []);\n  if (newAnnotations) {\n    return (\n      <CreateAnnotationsPage\n        {...props}\n        newAnnotations={newAnnotations}\n      ></CreateAnnotationsPage>\n    );\n  }\n  return (\n    <div className=\"bp3-dialog-body\">\n      <Tabs\n        renderActiveTabPanelOnly\n        onChange={setSelectedImportType}\n        selectedTabId={fileType}\n      >\n        <Tab\n          panel={\n            <div>\n              <div>\n                Select a CSV file (\n                <a\n                  onClick={() => {\n                    const rows = [\n                      {\n                        name: `Example ${startCase(annotationType)} 1`,\n                        description: \"I'm a description\",\n                        sequence: `gatNNtacaggttt`,\n                        ...(annotationType === \"feature\" && {\n                          type: `cds`\n                        }),\n                        isRegex: false,\n                        matchType: \"dna\"\n                      },\n                      {\n                        name: `Example Protein ${startCase(annotationType)}`,\n                        description: \"I'm a description\",\n                        sequence: `APGSGTGGGSGSAPG`,\n                        ...(annotationType === \"feature\" && {\n                          type: `cds`\n                        }),\n                        isRegex: false,\n                        matchType: \"protein\"\n                      },\n                      {\n                        name: `Example ${startCase(annotationType)} 2`,\n                        description: \"I'm another description\",\n                        sequence: `gat.*tacccc.*aggttt`,\n                        ...(annotationType === \"feature\" && {\n                          type: `cds`\n                        }),\n                        isRegex: true,\n                        matchType: \"dna\"\n                      }\n                    ];\n                    const csv = unparse(rows);\n                    // const blob = new Blob([convert(sequenceData)], { type: \"text/plain\" });\n                    // const filename = `${sequenceData.name || \"Untitled_Sequence\"}.${fileExt}`;\n                    // FileSaver.saveAs(blob, filename);\n                    downloadjs(\n                      csv,\n                      `Example CSV Annotation Upload File.csv`,\n                      \"text/plain\"\n                    );\n                  }}\n                >\n                  download example\n                </a>\n                ) with the following columns:<br></br>\n                <br></br>\n                <div style={{ display: \"flex\" }}>\n                  name,description,sequence,type,\n                  <span style={{ display: \"flex\" }}>\n                    isRegex &nbsp;\n                    <InfoHelper\n                      onClick={(e) => {\n                        e.stopPropagation();\n                        e.preventDefault();\n                        showDialog({\n                          ModalComponent: AutoAnnotateBpMatchingDialog\n                        });\n                      }}\n                      content={\n                        true ? (\n                          <span>\n                            Any valid regexes allowed. Click for more info about\n                            regex matching\n                          </span>\n                        ) : (\n                          `All valid IUPAC bases allowed as well as a couple special characters. Click for more info`\n                        )\n                      }\n                    ></InfoHelper>\n                  </span>\n                  ,matchType\n                </div>\n                <br></br>\n                {annotationType !== \"feature\" && (\n                  <React.Fragment>\n                    <i>Note: the \"type\" column is optional</i>\n                    <br></br>\n                  </React.Fragment>\n                )}\n              </div>\n              <FileUploadField\n                validateAgainstSchema={validateAgainstSchema}\n                name=\"csvFile\"\n                fileLimit={1}\n                isRequired\n                accept=\".csv\"\n              ></FileUploadField>\n            </div>\n          }\n          id=\"csvFile\"\n          title=\"CSV\"\n        ></Tab>\n        <Tab\n          panel={\n            <div>\n              <div>\n                Select an ApE style features .txt file (\n                <a\n                  onClick={() => {\n                    downloadjs(\n                      `T3\tATTAACCCTCACTAAAGGGA\tprimer_bind\tcyan\tgreen\t0\t0\nM13-fwd\tTGTAAAACGACGGCCAGT\tprimer_bind\tcyan\tgreen\t0\t0\nFRT\tGAAGTTCCTATTCTCTAGAAAGTATAGGAACTTC\tmisc_recomb\torchid\tpink\t0\t0`,\n                      `Example APE Feature List Upload File.txt`,\n                      \"text/plain\"\n                    );\n                  }}\n                >\n                  download example\n                </a>\n                ):\n              </div>\n              <FileUploadField\n                fileLimit={1}\n                name=\"apeFile\"\n                isRequired\n                accept=\".txt\"\n              ></FileUploadField>\n              {error && (\n                <div style={{ padding: 5, color: Colors.RED1 }}>{error}</div>\n              )}\n            </div>\n          }\n          id=\"apeFile\"\n          title=\"ApE File\"\n        ></Tab>\n        {getCustomAutoAnnotateList &&\n          (loadingCustomAnnList ? (\n            <Tab disabled title=\"Loading...\"></Tab>\n          ) : (\n            customAnnResponse &&\n            customAnnResponse.list && (\n              <Tab\n                id=\"implementerDefined\"\n                title={customAnnResponse.title || \"Custom List\"}\n                panel={\n                  customAnnResponse.list.length ? (\n                    <div>\n                      <DataTable\n                        isInfinite\n                        schema={\n                          annotationType === \"feature\"\n                            ? customAnnsSchema\n                            : customAnnsSchemaNoType\n                        }\n                        entities={customAnnResponse.list}\n                      ></DataTable>\n                    </div>\n                  ) : (\n                    <div>No Annotations Found</div>\n                  )\n                }\n              ></Tab>\n            )\n          ))}\n      </Tabs>\n      <DialogFooter\n        hideModal={hideDialog}\n        disabled={\n          fileType === \"implementerDefined\" &&\n          !(\n            customAnnResponse &&\n            customAnnResponse.list &&\n            customAnnResponse.list.length\n          )\n        }\n        onClick={handleSubmit(async ({ apeFile, csvFile }) => {\n          let convertNonStandardTypes = false;\n          const annsToCheck = [];\n          try {\n            const validateRow = async (row, rowName) => {\n              const { type = \"\", sequence } = row;\n              let regexConvertedSeq;\n\n              if (annotationType === \"feature\") {\n                const cleanedType = getFeatureTypes().find(\n                  (t) => t.toLowerCase() === type.toLowerCase()\n                );\n                if (!cleanedType) {\n                  if (!convertNonStandardTypes) {\n                    convertNonStandardTypes = await showConfirmationDialog({\n                      cancelButtonText: \"Stop Auto-Annotate\",\n                      text: `Detected that ${rowName} has a non-standard type of ${type}. We will assign it and all subsequent non-standard types to use the misc_feature type instead`\n                    });\n                    if (!convertNonStandardTypes) {\n                      throw {\n                        validationError: `${rowName} specifies the feature type ${type} which is not valid`\n                      };\n                    }\n                  }\n                  row.type = \"misc_feature\";\n                } else {\n                  row.type = cleanedType;\n                }\n              }\n              if (!sequence) {\n                throw {\n                  validationError: `${rowName} did not have a sequence`\n                };\n              }\n              if (row.isRegex && row.isRegex.toUpperCase() === \"TRUE\") {\n                try {\n                  new RegExp(regexConvertedSeq); //just trying out whether the regexConvertedSeq will work as a valid regex\n                } catch (error) {\n                  throw {\n                    validationError: `${rowName} has an invalid sequence/regex. Please fix it manually.`\n                  };\n                }\n                row.isRegex = true;\n              } else {\n                row.isRegex = undefined;\n              }\n              annsToCheck.push(row);\n            };\n            if (fileType === \"implementerDefined\") {\n              for (const [\n                // eslint-disable-next-line no-unused-vars\n                i,\n                // eslint-disable-next-line no-unused-vars\n                { name, sequence, matchType, type, isRegex }\n              ] of customAnnResponse.list.entries()) {\n                await validateRow(\n                  {\n                    name,\n                    sequence,\n                    matchType,\n                    type,\n                    isRegex: isRegex ? \"TRUE\" : \"FALSE\"\n                  },\n                  `Row ${i + 1} (${name})`\n                );\n              }\n            } else if (fileType === \"csvFile\") {\n              const csvHeaders = [\"name\", \"description\", \"sequence\"];\n              if (annotationType === \"feature\") {\n                csvHeaders.push(\"type\");\n              }\n              csvHeaders.push(\"isRegex\");\n              const {\n                data,\n                meta: { fields }\n              } = await parseCsvFile(csvFile[0]);\n              const error = validateCSVRequiredHeaders(fields, csvHeaders);\n              if (error) {\n                throw {\n                  validationError: error\n                };\n              }\n\n              // eslint-disable-next-line no-unused-vars\n              for (const [index, row] of data.entries()) {\n                const error = validateCSVRow(row, csvHeaders, index);\n                if (error) {\n                  throw {\n                    validationError: error\n                  };\n                }\n                await validateRow(row, `Row ${index + 1} (${row.name})`);\n              }\n            } else if (fileType === \"apeFile\") {\n              const { data } = await parseCsvFile(apeFile[0], {\n                header: false\n              });\n              // eslint-disable-next-line no-unused-vars\n              for (const [i, [name, sequence, type]] of data.entries()) {\n                await validateRow(\n                  { name, sequence, type },\n                  `Row ${i + 1} (${name})`\n                );\n              }\n            } else {\n              console.info(`we shouldn't be here!`);\n              console.info(`fileType:`, fileType);\n            }\n\n            if (!annsToCheck.length) {\n              return window.toastr.warning(\n                \"No Annotations Detected on File. Please check that your file is in the correct format.\"\n              );\n            }\n            const annotationsToCheckById = {};\n            annsToCheck.forEach((ann) => {\n              if (ann.matchType === \"protein\") {\n                ann.sequence = convertProteinSeqToDNAIupac(ann.sequence);\n              }\n              const id = shortid();\n              annotationsToCheckById[id] = {\n                ...ann,\n                sequence: ann.isRegex\n                  ? ann.sequence\n                  : convertApELikeRegexToRegex(ann.sequence),\n                id\n              };\n            });\n\n            const seqId = \"placeholderId\";\n            const { [seqId]: newAnns } = autoAnnotate({\n              seqsToAnnotateById: {\n                [seqId]: { ...sequenceData, id: seqId }\n              },\n              annotationsToCheckById\n            });\n\n            if (newAnns && newAnns.length) {\n              setNewAnns(\n                newAnns.map((a) => {\n                  const toRet = {\n                    ...annotationsToCheckById[a.id],\n                    ...a,\n                    forward: a.strand !== -1,\n                    id: shortid()\n                  };\n                  toRet.color =\n                    toRet.color || getFeatureToColorMap()[toRet.type];\n                  return toRet;\n                })\n              );\n            } else {\n              window.toastr.warning(\n                `No ${annotationType}s detected on sequence.`\n              );\n            }\n          } catch (error) {\n            console.error(`error:`, error);\n            if (error.validationError) {\n              throw new SubmissionError({ [fileType]: error.validationError });\n            } else {\n              window.toastr.error(\n                `Error annotating ${annotationType}(s). Double check your file to make sure it is valid!`\n              );\n            }\n          }\n        })}\n        text=\"Annotate\"\n      ></DialogFooter>\n    </div>\n  );\n});\n\nif (!window._ove_addons) window._ove_addons = {};\nwindow._ove_addons.autoAnnotateFeatures = autoAnnotateFeatures;\nwindow._ove_addons.autoAnnotateParts = autoAnnotateParts;\nwindow._ove_addons.autoAnnotatePrimers = autoAnnotatePrimers;\n\nconst customAnnsSchema = [\"name\", \"sequence\", typeField, \"isRegex\"];\nconst customAnnsSchemaNoType = [\"name\", \"sequence\", typeField, \"isRegex\"];\n\nconst validateAgainstSchema = {\n  fields: [\n    {\n      path: \"name\",\n      type: \"string\",\n      isRequired: true\n    },\n    {\n      path: \"description\",\n      type: \"string\"\n    },\n    {\n      path: \"sequence\",\n      type: \"string\",\n      isRequired: true\n    },\n    {\n      path: \"type\",\n      type: \"dropdown\",\n      values: getFeatureTypes(),\n      defaultValue: \"misc_feature\"\n    },\n    {\n      path: \"isRegex\",\n      type: \"boolean\"\n    },\n    {\n      path: \"matchType\",\n      type: \"dropdown\",\n      defaultValue: \"dna\",\n      values: [\"dna\", \"protein\"]\n    }\n  ]\n};\n"],"sourceRoot":""}