rdflib 2.2.10 → 2.2.12-5f141ca2

package/dist/rdflib.min.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["webpack://$rdf/webpack/universalModuleDefinition","webpack://$rdf/webpack/bootstrap","webpack://$rdf/./node_modules/@babel/runtime/helpers/defineProperty.js","webpack://$rdf/./src/types.ts","webpack://$rdf/./src/log.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/assertThisInitialized.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/classCallCheck.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/createClass.js","webpack://$rdf/./src/uri.ts","webpack://$rdf/./src/utils/terms.ts","webpack://$rdf/./src/named-node.ts","webpack://$rdf/./node_modules/@babel/runtime/helpers/getPrototypeOf.js","webpack://$rdf/./src/utils-js.js","webpack://$rdf/./src/node-internal.ts","webpack://$rdf/./node_modules/@babel/runtime/helpers/inherits.js","webpack://$rdf/./src/namespace.ts","webpack://$rdf/./node_modules/@babel/runtime/helpers/possibleConstructorReturn.js","webpack://$rdf/./src/utils.ts","webpack://$rdf/./src/class-order.ts","webpack://$rdf/./src/factories/canonical-data-factory.ts","webpack://$rdf/./src/xsd-internal.js","webpack://$rdf/./src/literal.ts","webpack://$rdf/./src/factories/factory-types.ts","webpack://$rdf/./src/blank-node.ts","webpack://$rdf/./node_modules/n3/src/IRIs.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/typeof.js","webpack://$rdf/./src/variable.ts","webpack://$rdf/./node_modules/jsonld/lib/types.js","webpack://$rdf/./src/utils/termValue.ts","webpack://$rdf/./src/node.ts","webpack://$rdf/./node_modules/jsonld/lib/util.js","webpack://$rdf/./src/store.ts","webpack://$rdf/./node_modules/jsonld/lib/JsonLdError.js","webpack://$rdf/./node_modules/jsonld/lib/graphTypes.js","webpack://$rdf/./src/utils/default-graph-uri.ts","webpack://$rdf/./src/collection.ts","webpack://$rdf/./node_modules/jsonld/lib/url.js","webpack://$rdf/./src/n3parser.js","webpack://$rdf/./src/rdfaparser.js","webpack://$rdf/./src/query.js","webpack://$rdf/./src/default-graph.ts","webpack://$rdf/./node_modules/jsonld/lib/context.js","webpack://$rdf/./src/fetcher.ts","webpack://$rdf/./src/serialize.ts","webpack://$rdf/./node_modules/n3/src/N3DataFactory.js","webpack://$rdf/./src/rdfxmlparser.js","webpack://$rdf/./src/xsd.js","webpack://$rdf/./src/serializer.js","webpack://$rdf/(webpack)/buildin/global.js","webpack://$rdf/./src/statement.ts","webpack://$rdf/./src/parse.ts","webpack://$rdf/./src/formula.ts","webpack://$rdf/./src/factories/extended-term-factory.ts","webpack://$rdf/./node_modules/cross-fetch/dist/browser-ponyfill.js","webpack://$rdf/./node_modules/jsonld/lib/nodeMap.js","webpack://$rdf/./src/patch-parser.js","webpack://$rdf/./node_modules/async/dist/async.mjs","webpack://$rdf/./node_modules/n3/src/N3Writer.js","webpack://$rdf/./src/convert.js","webpack://$rdf/./src/jsonldparser.js","webpack://$rdf/./node_modules/jsonld/lib/jsonld.js","webpack://$rdf/./node_modules/n3/src/N3Util.js","webpack://$rdf/external \"window\"","webpack://$rdf/./node_modules/rdf-canonize/index.js","webpack://$rdf/./node_modules/rdf-canonize/lib/IdentifierIssuer.js","webpack://$rdf/./node_modules/rdf-canonize/lib/NQuads.js","webpack://$rdf/./node_modules/jsonld/lib/constants.js","webpack://$rdf/./src/empty.ts","webpack://$rdf/./src/jsonparser.js","webpack://$rdf/./src/query-to-sparql.js","webpack://$rdf/./src/sparql-to-query.js","webpack://$rdf/./src/update-manager.ts","webpack://$rdf/./src/factories/rdflib-data-factory.ts","webpack://$rdf/./src/updates-via.js","webpack://$rdf/./src/index.ts","webpack://$rdf/./node_modules/@babel/runtime/regenerator/index.js","webpack://$rdf/./node_modules/solid-namespace/index.js","webpack://$rdf/./node_modules/rdf-canonize/lib/URDNA2015.js","webpack://$rdf/./node_modules/setimmediate/setImmediate.js","webpack://$rdf/./node_modules/rdf-canonize/lib/MessageDigest-browser.js","webpack://$rdf/./node_modules/rdf-canonize/lib/Permuter.js","webpack://$rdf/./node_modules/rdf-canonize/lib/URDNA2015Sync.js","webpack://$rdf/./node_modules/jsonld/lib/RequestQueue.js","webpack://$rdf/./node_modules/lru-cache/index.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/asyncToGenerator.js","webpack://$rdf/./node_modules/n3/src/N3Lexer.js","webpack://$rdf/./node_modules/queue-microtask/index.js","webpack://$rdf/./node_modules/@babel/runtime/helpers/setPrototypeOf.js","webpack://$rdf/./node_modules/regenerator-runtime/runtime.js","webpack://$rdf/(webpack)/buildin/harmony-module.js","webpack://$rdf/./node_modules/rdf-canonize/lib/index.js","webpack://$rdf/./node_modules/timers-browserify/main.js","webpack://$rdf/./node_modules/process/browser.js","webpack://$rdf/./node_modules/rdf-canonize/lib/URGNA2012.js","webpack://$rdf/./node_modules/rdf-canonize/lib/URGNA2012Sync.js","webpack://$rdf/./node_modules/jsonld/lib/platform-browser.js","webpack://$rdf/./node_modules/jsonld/lib/documentLoaders/xhr.js","webpack://$rdf/./node_modules/jsonld/lib/ContextResolver.js","webpack://$rdf/./node_modules/jsonld/lib/ResolvedContext.js","webpack://$rdf/./node_modules/yallist/yallist.js","webpack://$rdf/./node_modules/yallist/iterator.js","webpack://$rdf/./node_modules/jsonld/lib/NQuads.js","webpack://$rdf/./node_modules/jsonld/lib/expand.js","webpack://$rdf/./node_modules/jsonld/lib/flatten.js","webpack://$rdf/./node_modules/jsonld/lib/fromRdf.js","webpack://$rdf/./node_modules/jsonld/lib/toRdf.js","webpack://$rdf/./node_modules/canonicalize/lib/canonicalize.js","webpack://$rdf/./node_modules/jsonld/lib/frame.js","webpack://$rdf/./node_modules/jsonld/lib/compact.js","webpack://$rdf/./node_modules/jsonld/lib/JsonLdProcessor.js","webpack://$rdf/./node_modules/buffer/index.js","webpack://$rdf/./node_modules/base64-js/index.js","webpack://$rdf/./node_modules/ieee754/index.js","webpack://$rdf/./node_modules/buffer/node_modules/isarray/index.js","webpack://$rdf/./node_modules/n3/src/N3Parser.js"],"names":["root","factory","exports","module","require","define","amd","window","__WEBPACK_EXTERNAL_MODULE__56__","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","obj","configurable","writable","NamedNodeTermType","BlankNodeTermType","LiteralTermType","VariableTermType","DefaultGraphTermType","CollectionTermType","EmptyTermType","GraphTermType","HTMLContentType","JSONLDContentType","N3ContentType","N3LegacyContentType","NQuadsAltContentType","NQuadsContentType","NTriplesContentType","RDFXMLContentType","SPARQLUpdateContentType","SPARQLUpdateSingleMatchContentType","TurtleContentType","TurtleLegacyContentType","XHTMLContentType","log","debug","x","warn","info","error","success","msg","self","ReferenceError","instance","Constructor","TypeError","_defineProperties","target","props","length","descriptor","protoProps","staticProps","alert","console","docpart","uri","indexOf","slice","document","RDFlibNamedNode","hostpart","u","exec","join","given","base","baseColon","baseScheme","baseSingle","lastSlash","path","baseHash","lastIndexOf","match","replace","protocol","refTo","k","len","len1","q","ref","ref1","commonHost","RegExp","isStatement","isStore","isCollection","isTerm","termType","isRDFlibObject","isVariable","isLiteral","isQuad","isNamedNode","isBlankNode","isSubject","isPredicate","isRDFObject","isGraph","NamedNode","iri","termValue","ClassOrder","Error","includes","str","this","split","Node","_getPrototypeOf","setPrototypeOf","getPrototypeOf","__proto__","string","template","subs","baseA","result","mediaTypeClass","mediaType","trim","linkRelationProperty","relation","callbackify","callbacks","addHook","hook","addCallback","func","push","removeCallback","funcName","splice","insertCallback","unshift","fireCallbacks","args","callback","newCallbacks","replaceCallbacks","apply","DOMParserFactory","DOMParser","ActiveXObject","domToString","node","options","selfClosing","forEach","skipAttributes","dumpNode","out","noEsc","nodeType","hasAttribute","classWithChildText","matches","class","querySelector","element","textContent","skipNodeWithClass","ename","nodeName","toLowerCase","attrList","attributes","atn","test","replaceClassItemWith","source","re","skipClassWithValue","sortAttributes","sort","a","b","localeCompare","childNodes","pop","nodeValue","nl","dtstamp","now","Date","year","getYear","month","getMonth","day","getDate","hour","getUTCHours","minute","getUTCMinutes","second","getSeconds","heavyCompare","y","g","uriMap","nonBlank","signature","lis","statementsMatching","map","st","subject","predicate","concat","undefined","comparison","compareTerms","compareTerm","heavyCompareSPO","output","createElement","body","appendChild","parseXML","parseFromString","contentType","RDFArrayRemove","equals","why","string_startswith","pref","stackString","e","stack","lines","toString","toprint","line","charAt","chunks","bindings","other","classOrder","toCanonical","toNT","subClass","superClass","constructor","Namespace","nsuri","dataFactory","namedNode","ln","_typeof","assertThisInitialized","appliedFactoryMethods","rdf","arrayToStatements","rdfFactory","data","statements","reduce","id","_listObj","listData","nextNode","quad","blankNode","ArrayIndexOf","arr","item","defaultGraph","DefaultGraph","CanonicalDataFactory","supports","Feature","collections","defaultGraphType","equalsMethod","identity","reversibleId","variableType","BlankNode","graph","term","quadToNQ","Variable","nq","termToNQ","Statement","literal","languageOrDatatype","Literal","fromValue","strValue","triple","elements","toNQ","variable","boolean","dateTime","decimal","double","integer","langString","language","datatype","XSD","lang","d2","getUTCFullYear","getUTCMonth","getUTCDate","getUTCSeconds","Math","abs","Number","MAX_SAFE_INTEGER","isInteger","fromDate","fromBoolean","fromNumber","getId","formula","bnodeNew","copyTo","NTAnonymousNodePrefix","fragments","nextId","RDF","SWAP","xsd","type","nil","first","rest","owl","sameAs","forSome","forAll","implies","iterator","Uri","api","isArray","Array","isBoolean","v","isDouble","isNumber","String","isEmptyObject","isObject","keys","isNumeric","isNaN","parseFloat","isFinite","isString","isUndefined","toJS","graphTypes","types","IdentifierIssuer","JsonLdError","REGEX_LINK_HEADERS","REGEX_LINK_HEADER","REGEX_LINK_HEADER_PARAMS","DEFAULTS","accept","clone","rval","Map","set","Set","add","asArray","buildHeaders","headers","some","h","RangeError","assign","Accept","parseLinkHeader","header","entries","params","rel","validateTypeValue","isFrame","every","vv","code","hasProperty","hasValue","val","isList","compareValues","addValue","propertyIsArray","valueIsArray","allowDuplicate","prependValue","getValues","removeProperty","removeValue","values","filter","relabelBlankNodes","input","_labelBlankNodes","issuer","ki","v1","v2","isValue","compareShortestLeast","owlNamespaceURI","handleFP","subj","pred","o1","any","equate","handleIFP","s1","handleRDFType","typeCallback","classActions","done","IndexedFormula","features","opts","propertyActions","redirections","aliases","HTTPRedirects","subjectIndex","predicateIndex","objectIndex","whyIndex","index","namespaces","rdfArrayRemove","dataCallback","dataCallbacks","initPropertyActions","statementsCopy","ea","substitute","cb","patch","patchCallback","ds","targetKB","binding","doPatch","onDonePatch","bad","ds2","sts","remove","where","query","Query","pat","sync","bindingsFound","fetcher","_existentialVariables","addFn","newPropertyAction","proj","actions","arguments","appNode","objNode","predicateCallback","predHash","canon","holds","hash","ix","checkStatementList","from","origin","j","arrayContains","u1","u2","flags","statList","copy","u1in","u2in","replaceWith","bnode","sym","declareExistential","action","toBeFixed","_universalVariables","doc","mentionsURI","myQuery","onDone","indexedFormulaQuery","results","removeStatement","limit","removeStatements","big","small","oldhash","newhash","moveIndex","oldlist","newlist","nowKnownAs","x1","y1","prefix","justOne","list","pattern","wild","iBest","best","pBest","possibles","check","parts","cterm","terms","res","defaultGraphURI","Formula","message","details","super","isSubjectReference","isSimpleGraph","Collection","initial","RdflibBlankNode","closed","shift","collection","parsers","simple","regex","full","parse","parser","parsed","scheme","port","href","authority","normalizedPath","removeDotSegments","prependBase","isAbsolute","transform","substr","fragment","removeBase","baseSegments","iriSegments","last","next","isAbsoluteRegex","isRelative","Utf8","utftext","charCodeAt","fromCharCode","Logic_NS","pyjslib_Tuple","theList","pyjslib_List","pyjslib_Dict","listOfPairs","pyjslib_len","pyjslib_slice","StopIteration","pyjslib_Iterator","li","string_find","assertFudge","condition","desc","encode","encoding","decode","uripath_join","_notNameChars","_notQNameChars","number_syntax","datetime_syntax","interesting","langcode","createSinkParser","store","openFormula","thisDoc","baseURI","genPrefix","metaURI","SinkParser","_bindings","_flags","_store","setGenPrefix","_thisDoc","statementCount","startOfLine","previousLine","_genPrefix","keywords","keywordsSet","_anonymousNodes","_variables","_parentVariables","_reason","_reason2","_baseURI","RDFSink_uniqueURI","_formula","_context","_parentContext","stream","loadBuf","read","buf","startDoc","feed","endDoc","octets","skipSpace","directiveOrStatement","BadSyntax","directive","statement","checkDot","tok","commaSeparatedList","setKeywords","__x","newUniversal","uri_ref2","qname","encodeURI","hexify","qn","setPrefixForURI","property_list","prop","nodeOrLiteral","ch","ahead","here","makeStatement","subjectAlready","bnodeID","objs","objectList","__obj","mylist","first_run","newSet","oldParentContext","parentAnonymousNodes","grandParentVariables","reason2","close","thing_type","verb","pairFudge","dir","ofUris","bareWord","pfx","anonymousNode","symb","uref","delim","strconst","lastIndex","parseInt","dt","startline","res2","ustr","uEscape","UEscape","count","uch","uesc","__OLD_BadSyntax","_str","_i","_why","_uri","lineNo","SyntaxError","characterInFile","syntaxProblem","pre","post","ELEMENT_NODE","ATTRIBUTE_NODE","TEXT_NODE","CDATA_SECTION_NODE","ENTITY_REFERENCE_NODE","ENTITY_NODE","PROCESSING_INSTRUCTION_NODE","COMMENT_NODE","DOCUMENT_NODE","DOCUMENT_TYPE_NODE","DOCUMENT_FRAGMENT_NODE","NOTATION_NODE","RDFaProcessor","kb","subjects","prefixes","blankNodes","htmlOptions","theOne","getTime","vocabulary","blankCounter","langAttributes","namespaceURI","localName","inXHTMLMode","absURIRE","finishedHandlers","init","su","ob","pr","or","toRDFNodeObject","parentNode","mappings","newMappings","dateTimeTypes","matched","colon","substring","NCNAME","curie","parseCURIE","resolveAndNormalize","defaultVocabulary","ignoreTerms","parseTermOrCURIEOrAbsURI","tokenize","parseCURIEOrURI","documentElement","setContext","queue","removeHash","baseURIMap","current","context","parent","listMapping","bnodes","newBlankNode","addTriple","objectURI","skip","newSubject","currentObjectResource","typedResource","prefixesCopied","incomplete","listMappingDifferent","parseURI","vocabAtt","getAttributeNode","baseSubject","spec","att","copyMappings","prefixAtt","parsePrefixMappings","xmlLangAtt","getAttributeNodeNS","relAtt","revAtt","typeofAtt","propertyAtt","datatypeAtt","datetimeAtt","inHTMLMode","contentAtt","aboutAtt","srcAtt","resourceAtt","hrefAtt","inlistAtt","relAttPredicates","parsePredicate","revAttPredicates","parseSafeCURIEOrCURIEOrURI","parentObject","newSubjectOrigin","typeURI","forward","content","PlainLiteralURI","XMLLiteralURI","HTMLLiteralURI","deriveDateTimeType","childContext","listSubject","child","lastChild","previousSibling","copyProperties","getAttribute","setXHTMLContext","doctype","publicId","systemId","setHTMLContext","setXMLContext","setInitialContext","Util","dom","process","nameChar","nameStartChar","parseRDFaDOM","vars","bindingDebug","bindingsDebug","nbs","unifyContents","nbs2","actual","isVar","complexType","defaultDocumentURI","unifyTerm","nb","nb2","bindings2","union","OptionalBranchJunction","originalCallback","trunkBindings","branches","MandatoryBranch","checkAllDone","doCallBacks","reportMatch","reportDone","OptionalBranch","junction","prepare","f","termIndex","ind","nvars","easiestQuery","bindingsSoFar","level","localCallback","branch","pattern_debug","optional","br","matchIndex","fetchResource","requestedTerm","docuri","nowOrWhenFetched","ok","xhr","getState","match2","constraintsSatisfied","constraints","nk","newBindings1","nbs1","nc","onward","trunck","initBindings","setTimeout","isDefaultGraph","util","_isArray","_isObject","_isString","_isUndefined","_isAbsoluteIri","_isRelativeIri","_asArray","_compareShortestLeast","INITIAL_CONTEXT_CACHE","KEYWORD_PATTERN","_expandIri","activeCtx","relativeTo","localCtx","defined","isKeyword","createTermDefinition","vocab","mapping","suffix","_prefix","async","propagate","overrideProtected","cycles","resolved","contextResolver","resolve","documentLoader","previousContext","resolvedContext","ctx","protected","protectedMode","processed","getProcessed","oldActiveCtx","getInitialContext","_protected","setProcessed","processingMode","resolvedImport","processedImport","importCtx","keyCtx","url","has","validKeys","previousMapping","delete","simpleTerm","reverse","kw","_termHasColon","container","validContainers","isValid","hasSet","direction","nest","_deepCompare","x2","x1Array","k1s","k2s","k1","expandIri","JSON","stringify","cached","initialContext","inverse","getInverse","fastCurieMap","irisToTerms","defaultLanguage","defaultDirection","ids","entry","fastCurieEntry","_addPreferredTerm","_buildIriMap","revertToPreviousContext","size","clear","iriMap","idx","letter","typeOrLanguageValue","getContextValue","version","Parsable","CONTENT_TYPE_BY_EXT","getNS","link","http","httph","rdfs","dc","ldp","Handler","response","RDFXMLHandler","responseText","failFetch","resource","RDFParser","original","err","noMeta","doneFetch","mediatypes","XHTMLHandler","title","getElementsByTagName","links","linkData","scripts","rdfParse","noRDFa","XMLHandler","addStatus","req","html","xmlns","HTMLHandler","isXML","docTypeStart","docTypeEnd","isXHTML","isXMLNS","titleMatch","JsonLdHandler","Promise","reject","jsonldParser","TextHandler","N3Handler","N3Parser","defaultHandlers","Fetcher","timeout","_fetch","fetch","global","solidFetcher","solidFetch","crossFetch","requested","timeouts","redirectedTo","fetchQueue","fetchCallbacks","nonexistent","lookedUp","handlers","addHandler","all","load","uriIn","initFetchOptions","initialisedOptions","pendingFetchPromise","originalUri","pendingPromise","force","race","setRequestTimeout","fetchUri","cleanupFetchRequest","then","clearTimeout","_options","isPending","method","toUpperCase","Headers","cache","acceptString","requestedURI","offlineOverride","setCredentials","actualProxyURI","proxyIfNecessary","proxyUsed","unsupportedProtocol","state","status","statusText","dummyResponse","bodyUsed","saveRequestMetadata","handleResponse","errno","handleError","p2","userCallback","referringTerm","fetchResponse","oops","statusMessage","getHours","getMinutes","getMilliseconds","statusNode","the","append","errorMessage","statusCode","meth","encodeURIComponent","linkHeader","reqNode","paramexp","was","lookUpThing","uriSting","serialize","jsonString","webOperation","catch","there","unload","parentURI","folderName","invalidateCache","text","e2","rterm","uris","requests","each","request","anyValue","startsWith","timeNow","responseNode","refresh","clearPreviousData","exp","getHeader","removeMany","removeDocument","handler","register","retriedWithNoCredentials","newOptions","credentials","location","isCrossSite","retryNoCredentials","proxyUri","crossSiteProxy","redirectToProxy","rdfType","locURI","prev","reqURI","redirection","saveResponseMetadata","normalizedContentType","contentLocation","saveErrorResponse","diffLocation","absContentLocation","addType","isImage","handlerForContentType","find","forceContentType","guess","guessContentType","newURI","oldReq","acceptstring","crossSiteProxyTemplate","UI","panes","preferences","isExtension","$SolidTestEnvironment","localSiteMap","lookup","z","pcol","withCredentials","HANDLERS","sz","Serializer","setFlags","n3String","newSts","suggestNamespaces","setBase","executeCallback","statementsToXML","statementsToN3","statementsToNTriples","convert","DEFAULTGRAPH","_blankNodeCounter","DataFactory","languageOrDataType","Term","atPos","datatypeString","dtPos","char","Quad","_subject","_predicate","_object","_graph","toJSON","reify","uriUtil","rdfid","NODE","ARC","addSymbol","isTripleToLoad","loadTriple","listIndex","attributeNode","potentialNode","children","cleanParser","DOCUMENT","ELEMENT","frameFactory","parseDOM","buildFrame","frame","elementURI","el","dig","attrs","TEXT","CDATA_SECTION","addArc","addLiteral","addCollectionArc","removeAttributeNode","parsetype","nv","addBNode","addCollection","bnid2","addNode","about","bnid","rdftype","pframe","candidate","terminateFrame","removeAttribute","createXSD","localFactory","createSerializer","nsKeys","solidNs","suggestPrefix","namespacesUsed","prefixchars","incoming","formulas","fromNT","px","prefixs","canUse","pp","validPrefix","slash","allBnodes","checkMentions","ss","toStr","roots","xNT","fromStr","rootsHash","backslashUify","sorted","rdfns","termToNT","atomicTermToN3","defaultNamespace","predMap","spaces","treeToLine","tree","s2","statementListToTree","stats","rootSubjects","subjectTree","termToN3","propertyTree","objectTree","lastPred","objects","expr","prefixDirectives","explicitURI","treeToString","lastLength","eNotation","stringToN3","symbolToN3","forbidden","forbidden3","forbidden1","canSplit","localid","namesp","keyords","makeUpPrefix","write","session","sources","metaSources","metadata","namespaceCounts","liPrefix","XMLtreeToLine","statementListToXMLTree","subjectXMLTree","escapeForXML","relURI","propertyXMLTree","ap","bp","as","bs","an","bn","number","collectionXMLTree","tag","ns2","XMLtreeToString","Function","DefaultGraphNode","sparqlUpdateParser","n3Parser","N3jsParser","nquadCallback","executeErrorCallback","cause","nquads","tripleCallback","handled","Graph","factoryMethod","anyStatementMatching","bots","bottom","len2","len3","hashString","thisClass","len4","members","ref2","ref3","ref4","ref5","seeds","transitiveClosure","NTtoURI","findMembersNT","findTypesNT","excludePredicateURIs","todo","doneArcs","follow","_features","addAll","provenance","documentString","sups","agenda","tops","ExtendedTermFactory","__self__","F","DOMException","support","Blob","viewClasses","isArrayBufferView","ArrayBuffer","isView","normalizeName","normalizeValue","iteratorFor","items","getOwnPropertyNames","consumed","fileReaderReady","reader","onload","onerror","readBlobAsArrayBuffer","blob","FileReader","promise","readAsArrayBuffer","bufferClone","view","Uint8Array","byteLength","buffer","Body","_initBody","_bodyInit","_bodyText","isPrototypeOf","_bodyBlob","FormData","_bodyFormData","URLSearchParams","DataView","_bodyArrayBuffer","rejected","arrayBuffer","readAsText","chars","readArrayBufferAsText","formData","json","oldValue","thisArg","methods","Request","upcased","signal","referrer","form","bytes","decodeURIComponent","Response","bodyInit","redirectStatuses","redirect","aborted","XMLHttpRequest","abortXhr","abort","rawHeaders","getAllResponseHeaders","responseURL","ontimeout","onabort","open","responseType","setRequestHeader","addEventListener","onreadystatechange","readyState","removeEventListener","send","polyfill","ponyfill","default","createMergedNodeMap","graphs","createNodeMap","mergeNodeMaps","_list","properties","referencedNode","reverseMap","reverseProperty","itemName","mergeNodeMapGraphs","merged","mergedNode","graphNames","graphName","nodeMap","SQNS","clauses","badSyntax","found","initialParams","fn","hasQueueMicrotask","queueMicrotask","hasSetImmediate","setImmediate","hasNextTick","nextTick","fallback","wrap","defer","setImmediate$1","asyncify","isAsync","handlePromise","invokeCallback","wrapAsync","asyncFn","awaitify","arity","cbArgs","applyEach","eachfn","fns","callArgs","that","_asyncMap","iteratee","counter","_iteratee","_","iterCb","isArrayLike","breakLoop","once","wrapper","callFn","createIterator","coll","createArrayIterator","okeys","getIterator","createES2015Iterator","onlyOnce","asyncEachOfLimit","generator","canceled","awaiting","running","replenish","iterDone","iterateeCallback","eachOfLimit","asyncIterator","isAsyncIterable","nextElem","looping","elem","eachOfLimit$2","eachOfArrayLike","completed","iteratorCallback","eachOfGeneric","Infinity","eachOf$1","map$1","applyEach$1","eachOfSeries$1","mapSeries$1","applyEachSeries","PROMISE_SYMBOL","promiseCallback","rej","auto","tasks","concurrency","numTasks","runningTasks","hasError","listeners","readyTasks","readyToCheck","uncheckedDependencies","enqueueTask","task","taskCallback","safeResults","rkey","processQueue","taskFn","runTask","run","getDependents","taskName","dependencies","remainingDependencies","dependencyName","taskListeners","addListener","currentTask","dependent","checkForDeadlocks","FN_ARGS","ARROW_FN_ARGS","FN_ARG_SPLIT","FN_ARG","STRIP_COMMENTS","DLL","head","tail","newNode","insertBefore","setInitial","insertAfter","removeLink","cur","testFn","curr","dll","worker","payload","_worker","numRunning","workersList","events","drain","saturated","unsaturated","empty","off","event","ev","trigger","processingScheduled","_insert","insertAtFront","rejectOnError","started","_tasks","_createCB","idle","_maybeDrain","eventMethod","handleAndRemove","on","isProcessing","paused","datum","min","defineProperties","reduce$1","memo","seq","functions","_functions","newargs","nextargs","mapLimit$1","concatLimit$1","mapResults","concat$1","concatSeries$1","_createTester","getResult","testResult","testPassed","detect$1","bool","detectLimit$1","detectSeries$1","consoleFunc","resultArgs","doWhilst$1","_fn","_test","truth","_withoutIndex","eachLimit$2","eachSeries$1","ensureAsync","innerArgs","every$1","everyLimit$1","everySeries$1","filterArray","truthValues","filterGeneric","_filter","filter$1","filterLimit$1","filterSeries$1","forever$1","errback","groupByLimit$1","mapValuesLimit$1","newObj","_parallel","taskCb","queue$1","Heap","heap","pushCount","MIN_SAFE_INTEGER","smaller","percUp","top","percDown","priority","race$1","reduceRight","array","reversed","reflect","reflectCallback","retVal","reject$2","rejectLimit$1","rejectSeries$1","constant$1","retry","times","intervalFunc","parseTimes","_task","attempt","retryAttempt","errorFilter","acc","interval","some$1","Boolean","someLimit$1","someSeries$1","sortBy$1","criteria","comparator","left","right","timesLimit","range","tryEach$1","whilst$1","waterfall$1","taskIndex","nextTask","autoInject","newTasks","fnIsAsync","hasNoDeps","newTask","src","arg","parseParams","newArgs","cargo","cargoQueue","compose","concatLimit","concatSeries","constant","ignoredArgs","detect","detectLimit","detectSeries","doUntil","doWhilst","eachLimit","eachOf","eachOfSeries","eachSeries","everyLimit","everySeries","filterLimit","filterSeries","forever","groupBy","groupByLimit","groupBySeries","mapLimit","mapSeries","mapValues","mapValuesLimit","mapValuesSeries","memoize","hasher","queues","memoized","unmemoized","parallel","parallelLimit","priorityQueue","reflectAll","rejectLimit","rejectSeries","retryable","series","someLimit","someSeries","sortBy","milliseconds","timer","timedOut","timesSeries","accumulator","tryEach","unmemoize","until","waterfall","whilst","allLimit","allSeries","anyLimit","anySeries","findLimit","findSeries","flatMap","flatMapLimit","flatMapSeries","forEachSeries","forEachLimit","forEachOf","forEachOfSeries","forEachOfLimit","inject","foldl","foldr","select","selectLimit","selectSeries","wrapSync","during","doDuring","N3DataFactory","escapeAll","escapedCharacters","outputStream","_prefixRegex","_lists","lists","_outputStream","_endStream","end","chunk","format","_lineMode","_writeQuad","_writeQuadLine","_baseIRI","baseIRI","_prefixIRIs","addPrefixes","_write","_inDefaultGraph","_encodeIriOrBlank","_encodeObject","_encodePredicate","_encodeSubject","_prefixMatch","quadToString","quads","entity","_encodeQuad","characterReplacer","prefixMatch","_encodeLiteral","addQuad","hasPrefixes","IRIlist","prefixList","prefixIRI","contents","_blockedWrite","singleDone","character","convertToJson","jsonCallback","Parser","n3Writer","Writer","asyncLib","jsonld","fromRDF","convertToNQuads","nquadString","jsonldObjectToTerm","listToCollection","listId","listItem","listToStatements","baseString","flatten","flattened","flatResource","addStatement","createStatement","canonize","platform","ContextResolver","LRU","NQuads","expand","_expand","_flatten","_fromRDF","toRDF","_toRDF","frameMergedOrDefault","_frameMergedOrDefault","cleanupNull","_cleanupNull","_isSubjectReference","_getInitialContext","_processContext","_processingMode","compact","_compact","compactIri","_compactIri","_createNodeMap","_createMergedNodeMap","_mergeNodeMaps","_rdfParsers","_resolvedContextCache","max","_setDefaults","defaults","expanded","compactArrays","compactToRelative","skipExpansion","sharedCache","processContext","compacted","compactionMap","tmp","hasContext","graphAlias","keepFreeFloatingNodes","expansionMap","toResolve","contextsToProcess","expandContext","defaultBase","remoteDoc","documentUrl","contextUrl","remoteContext","embed","explicit","requireAll","omitDefault","bnodesToClear","frameContext","omitGraph","pruneBlankNodeIdentifiers","expandedFrame","frameKeys","is11","framed","framing","normalize","algorithm","inputFormat","parsedInput","produceGeneralizedRdf","dataset","rdfParser","parsedDataset","merge","docs","mergeNodes","_graphs","_nodeMap","_documentLoader","documentLoaders","useDocumentLoader","registerRDFParser","unregisterRDFParser","promises","RequestQueue","JsonLdProcessor","setupGlobals","setupDocumentLoaders","existing","_existing","old","identifier","RDF_LANGSTRING","XSD_STRING","REGEX","_compareTriples","t1","t2","eoln","lineNumber","_unescapeRegex","U","unique","legacyDatasetToQuads","serializeQuad","nquad","_escapeRegex","_escape","termTypeMap","IRI","componentName","oldComponent","newComponent","LINK_HEADER_REL","LINK_HEADER_CONTEXT","RDF_LIST","RDF_FIRST","RDF_REST","RDF_NIL","RDF_TYPE","RDF_PLAIN_LITERAL","RDF_XML_LITERAL","RDF_JSON_LITERAL","RDF_OBJECT","XSD_BOOLEAN","XSD_DOUBLE","XSD_INTEGER","Empty","parseJSON","preds","queryToSPARQL","indent","getPattern","addIndent","getConstraints","foo","describe","getWhere","getOptionals","getSelect","getSPARQL","SPARQLToQuery","SPARQL","testMode","variableHash","makeVar","newVar","isRealText","fixSymbolBrackets","isSymbol","isBnode","isPrefix","isPrefixedSymbol","getPrefix","getSuffix","removeBrackets","spaceDelimit","arrayIndexOf","arrayIndicesOf","getMatchingBracket","ConstraintEqualTo","varstr","ConstraintRegexp","rg","setConstraint","setOptional","opt","setWhere","toTerms","filt","arrayZero","per","stat","sem","stat2","com","stat3","extractStatements","sp","token1","parseLiterals","sin","doub","end2","token2","strarr","replaceKeywords","prefInd","symbol","getPrefixDeclarations","selectLoc","whereLoc","label","setVars","UpdateManager","updater","ifps","fps","patchControl","isHttpUri","definitive","wacAllow","lr","acceptPatch","authorVia","mentioned","stmt","anonymize","statementBnodes","bnodes2","depth","isBlank","bnodeContext2","con","connectedStatements","cacheIfps","bnodeContext1","bnodeContext","anonymizeNT","callbackFunction","statementContext","statementNT","contextWhere","set_object","fire","st0","stText","control","patchControlFor","pendingUpstream","downstreamAction","upstreamCount","linkHeaders","listener","downstreamChangeListeners","setRefreshHandler","reloadAndSync","reloading","outOfDate","retryTimeout","tryReload","reload","wssURI","getUpdatesVia","theHandler","retries","validWssURI","uriJoin","openWebsocket","socket","WebSocket","onopen","requestDownstreamAction","onclose","onmessage","deletions","insertions","thisUpdater","uniqueDocs","uniqueDoc","updates","update","secondTry","errorBody","is","startTime","editable","statementArrayBnodes","whereClause","elapsedTimeMs","updateDav","updateLocalFile","targetURI","candidateTarget","dot","ext","onErrorWasCalled","reloadTimeTotal","reloadTimeCount","RDFlibDataFactory","lit","UpdatesSocket","via","connected","pending","subscribed","onOpen","onClose","onMessage","onError","elt","_send","onUpdate","_decode","_subscribe","UpdatesVia","onHeaders","etag","subscribe","boundDataFactory","NextId","acl","cal","cert","contact","dct","doap","foaf","geo","gpx","icalTZ","meeting","mo","org","pad","prov","qu","trip","rss","sched","schema","sioc","solid","space","tab","tabont","ui","vcard","wf","cco","alias","expansion","MessageDigest","Permuter","_stringHashCompare","blankNodeInfo","canonicalIssuer","hashAlgorithm","_addBlankNodeQuadInfo","component","hashToBlankNodes","nonNormalized","_yield","_hashAndTrackBlankNode","hashes","nonUnique","idList","hashPathList","hasId","hashNDegreeQuads","oldIds","getOldIds","normalized","_useCanonicalId","modifyFirstDegreeComponent","md","digest","related","position","getRelatedPredicate","hashToRelated","createHashToRelated","chosenIssuer","chosenPath","permuter","hasNext","permutation","issuerCopy","recursionList","nextPermutation","_addRelatedBlankNodeHash","hashFirstDegreeQuads","hashRelatedBlankNode","registerImmediate","channel","messagePrefix","onGlobalMessage","nextHandle","tasksByHandle","currentlyRunningATask","attachTo","handle","runIfPresent","postMessage","importScripts","postMessageIsAsynchronous","oldOnMessage","canUsePostMessage","MessageChannel","port1","port2","script","removeChild","random","attachEvent","clearImmediate","crypto","msCrypto","subtle","_content","TextEncoder","hex","padStart","pos","swap","_requests","loader","_loader","Yallist","MAX","LENGTH","LENGTH_CALCULATOR","ALLOW_STALE","MAX_AGE","DISPOSE","NO_DISPOSE_ON_SET","LRU_LIST","CACHE","UPDATE_AGE_ON_GET","naiveLength","doUse","hit","isStale","del","unshiftNode","maxAge","diff","walker","removeNode","Entry","forEachStep","thisp","lc","stale","dispose","noDisposeOnSet","updateAgeOnGet","reset","mL","allowStale","mA","lC","toArray","expiresAt","asyncGeneratorStep","gen","_next","_throw","escapeSequence","escapeReplacements","illegalIriChars","lineModeRegExps","_iri","_unescapedIri","_simpleQuotedString","_langcode","_blank","_newline","_comment","_whitespace","_endOfFile","invalidRegExp","N3Lexer","_simpleApostropheString","_prefixed","_variable","_number","_boolean","_keyword","_sparqlKeyword","_shortPredicates","lineMode","_n3Mode","n3","_comments","comments","_literalClosingPos","inputFinished","_input","outputComments","whiteSpaceMatch","comment","_line","firstChar","matchLength","inconclusive","_previousMarker","_unescape","reportSyntaxError","_parseLiteral","token","previousToken","_syntaxError","invalid","replaced","sequence","unicode4","unicode8","escapedChar","charCode","opening","openingLength","closingPos","backslashCount","raw","issue","_readStartingBom","tokens","_tokenizeToEnd","_pendingBuffer","setEncoding","Buffer","_setPrototypeOf","runtime","Op","hasOwn","$Symbol","iteratorSymbol","asyncIteratorSymbol","toStringTagSymbol","innerFn","outerFn","tryLocsList","protoGenerator","Generator","Context","_invoke","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","record","tryCatch","makeInvokeMethod","GeneratorFunction","GeneratorFunctionPrototype","IteratorPrototype","getProto","NativeIteratorPrototype","Gp","defineIteratorMethods","AsyncIterator","PromiseImpl","previousPromise","callInvokeWithMethodAndArg","invoke","__await","unwrapped","resultName","nextLoc","pushTryEntry","locs","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","iterable","iteratorMethod","displayName","isGeneratorFunction","genFun","ctor","mark","awrap","iter","skipTempReset","stop","rootRecord","exception","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","thrown","delegateYield","regeneratorRuntime","accidentalStrictMode","globalThis","originalModule","webpackPolyfill","URDNA2015","URGNA2012","URDNA2015Sync","URGNA2012Sync","rdfCanonizeNative","_rdfCanonizeNative","useNative","canonical","main","_canonizeSync","canonizeSync","Timeout","clearFn","_id","_clearFn","scope","setInterval","clearInterval","unref","enroll","msecs","_idleTimeoutId","_idleTimeout","unenroll","_unrefActive","active","_onTimeout","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","currentQueue","draining","queueIndex","cleanUpNextTick","drainQueue","marker","runClearTimeout","Item","noop","browser","env","argv","versions","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","cwd","chdir","umask","xhrLoader","secure","wrapLoader","_get","httpStatusCode","alternate","getResponseHeader","linkedContext","ResolvedContext","_throwInvalidLocalContext","perOpCache","allResolved","_resolveRemoteContext","_cacheResolvedContext","tagMap","_fetchContext","_resolveContextUrls","processedCtx","insert","inserted","pushNode","forEachReverse","getReverse","mapReverse","reduceReverse","toArrayReverse","to","ret","sliceReverse","start","deleteCount","nodes","er","_isEmptyObject","_isList","_isValue","_isGraph","_isSubject","_getContextValue","_isKeyword","_addValue","_getValues","_validateTypeValue","REGEX_BCP47","_expandValue","activeProperty","expandedProperty","_expandLanguageMap","languageMap","expandedKey","_expandIndexMap","asGraph","indexKey","propertyIndex","isTypeIndex","insideList","insideIndex","typeScopedContext","mapped","unmappedValue","expandedParent","expandedActiveProperty","propertyScopedCtx","mustRevert","typeKey","_expandObject","nests","unexpandedValue","isJsonType","expandedValue","unmappedProperty","keyword","fromEntries","includedResult","ii","termCtx","nextActiveProperty","nestedValues","validCount","_RDFToObject","useNativeTypes","rdfDirection","endsWith","toFixed","useRdfType","graphMap","referencedOnce","objectIsNode","usages","graphObject","usage","listNodes","nodeKeyCount","listNode","graphSubjects","graphSubject","jsonCanonicalize","_graphToRDF","graphTerm","_objectToRDF","toExponential","_listToRDF","cv","ci","_mergeNodeMapGraphs","_createImplicitFrame","_createsCircularReference","subjectToEmbed","subjectStack","_getFrameFlag","flag","_validateFrame","_filterSubject","wildcard","matchesSome","matchThis","nodeValues","isEmpty","tt","thisFrame","hasDefault","listValue","nodeListValues","lv","_valueMatch","_nodeMatch","_removeEmbed","embeds","uniqueEmbeds","useArray","removeDependents","_addFrameOutput","nodeObject","l1","l2","embedded","bnodeMap","_cleanupPreserve","_filterSubjects","recurse","subframe","oo","preserve","reverseProp","_isSimpleGraph","_removeBase","_prependBase","_checkNestProperty","nestProperty","linked","compactValue","insideReverse","inputCtx","typeContext","compactedType","itemActiveProperty","nestResult","expandedItem","inner","compactedItem","mapObject","containerKey","others","idKey","compactedValue","compactedProperty","expandedIri","isPropertyTermScoped","inverseCtx","containers","typeOrLanguage","commonLanguage","commonType","itemLanguage","itemType","prefs","langDir","containerMap","typeOrLanguageValueMap","_selectTerm","choice","partialMatches","maxPartialLength","td","preserveIndex","keyCount","isValueOnlyKey","hasDefaultLanguage","isValueString","hasNullMapping","base64","ieee754","kMaxLength","TYPED_ARRAY_SUPPORT","createBuffer","encodingOrOffset","allocUnsafe","byteOffset","fromArrayLike","fromArrayBuffer","isEncoding","fromString","isBuffer","checked","fromObject","assertSize","loweredCase","utf8ToBytes","base64ToBytes","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","bidirectionalIndexOf","indexSize","arrLength","valLength","readUInt16BE","foundIndex","hexWrite","offset","remaining","strLen","utf8Write","blitBuffer","asciiWrite","byteArray","asciiToBytes","latin1Write","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","fromByteArray","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","codePoints","decodeCodePointsArray","SlowBuffer","alloc","INSPECT_MAX_BYTES","subarray","typedArraySupport","poolSize","_augment","species","fill","allocUnsafeSlow","_isBuffer","compare","swap16","swap32","swap64","inspect","thisStart","thisEnd","thisCopy","targetCopy","_arr","toHex","checkOffset","checkInt","objectWriteUInt16","littleEndian","objectWriteUInt32","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","sliceLen","readUIntLE","mul","readUIntBE","readUInt8","readUInt16LE","readUInt32LE","readUInt32BE","readIntLE","pow","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUIntLE","writeUIntBE","writeUInt8","floor","writeUInt16LE","writeUInt16BE","writeUInt32LE","writeUInt32BE","writeIntLE","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","INVALID_BASE64_RE","leadSurrogate","toByteArray","stringtrim","base64clean","dst","b64","lens","getLens","validLen","placeHoldersLen","Arr","_byteLength","curByte","revLookup","uint8","extraBytes","encodeChunk","num","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","NaN","rt","LN2","blankNodePrefix","_contextStack","_setBase","initDataFactory","isTurtle","isTriG","isNTriples","isNQuads","isN3","isLineMode","_supportsNamedGraphs","_readPredicateOrNamedGraph","_readPredicate","_supportsQuads","_supportsRDFStar","_resolveRelativeIRI","_blankNodePrefix","_lexer","lexer","_explicitQuantifiers","explicitQuantifiers","fragmentPos","_base","_basePath","_baseRoot","_baseScheme","n3Mode","_inversePredicate","blankPrefix","_prefixes","quantified","_quantified","_error","_callback","_sparqlStyle","_readPrefix","_readBaseIRI","_readSubject","_readNamedGraphLabel","quantifier","_resolveIRI","_namedNode","_blankNode","_saveContext","_readBlankNodeHead","_readListItem","_readPunctuation","N3_FORSOME","_quantifier","_readQuantifierList","N3_FORALL","_literalValue","_completeSubjectLiteral","_literal","_readEntity","_getPathReader","ABBREVIATIONS","_readBlankNodeTail","_readObject","_readDataTypeOrLang","_getContextEndReader","_readGraph","_readBlankNodePunctuation","_emit","_restoreContext","_readPredicateAfterBlank","previousList","_readListItemDataTypeOrLang","_completeObjectLiteral","_completeLiteral","_readCallback","inversePredicate","_readFormulaTail","_readInTopContext","_readQuadPunctuation","_readPrefixIRI","prefixNode","_prefixCallback","_readDeclarationPunctuation","_readNamedGraphBlankLabel","QUANTIFIERS_GRAPH","_readQuantifierPunctuation","afterPath","_afterPath","_readPath","_readForwardPath","_readBackwardPath","_readRDFStarTail","_quad","contextStack","_readRDFStarTailOrGraph","_removeDotSegments","pathStart","segmentStart","quadCallback","prefixCallback"],"mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,EAAQG,QAAQ,WACR,mBAAXC,QAAyBA,OAAOC,IAC9CD,OAAO,CAAC,UAAWJ,GACO,iBAAZC,QACdA,QAAc,KAAID,EAAQG,QAAQ,WAElCJ,EAAW,KAAIC,EAAQD,EAAa,QARtC,CASGO,QAAQ,SAASC,GACpB,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUT,QAGnC,IAAIC,EAASM,EAAiBE,GAAY,CACzCC,EAAGD,EACHE,GAAG,EACHX,QAAS,IAUV,OANAY,EAAQH,GAAUI,KAAKZ,EAAOD,QAASC,EAAQA,EAAOD,QAASQ,GAG/DP,EAAOU,GAAI,EAGJV,EAAOD,QA0Df,OArDAQ,EAAoBM,EAAIF,EAGxBJ,EAAoBO,EAAIR,EAGxBC,EAAoBQ,EAAI,SAAShB,EAASiB,EAAMC,GAC3CV,EAAoBW,EAAEnB,EAASiB,IAClCG,OAAOC,eAAerB,EAASiB,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEV,EAAoBgB,EAAI,SAASxB,GACX,oBAAXyB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAerB,EAASyB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAerB,EAAS,aAAc,CAAE2B,OAAO,KAQvDnB,EAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,EAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFAxB,EAAoBgB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,EAAoBQ,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,EAAoB2B,EAAI,SAASlC,GAChC,IAAIiB,EAASjB,GAAUA,EAAO6B,WAC7B,WAAwB,OAAO7B,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAO,EAAoBQ,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRV,EAAoBW,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG7B,EAAoBgC,EAAI,GAIjBhC,EAAoBA,EAAoBiC,EAAI,I,gBCnErDxC,EAAOD,QAfP,SAAyB0C,EAAKT,EAAKN,GAYjC,OAXIM,KAAOS,EACTtB,OAAOC,eAAeqB,EAAKT,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZqB,cAAc,EACdC,UAAU,IAGZF,EAAIT,GAAON,EAGNe,GAITzC,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,6BCFxE,0sBAAO,IAAMe,EAAoB,YACpBC,EAAoB,YACpBC,EAAkB,UAClBC,EAAmB,WACnBC,EAAuB,eAEvBC,EAAqB,aACrBC,EAAgB,QAChBC,EAAgB,QAWhBC,EAAkB,YAClBC,EAAoB,sBACpBC,EAAgB,UAChBC,EAAsB,iBACtBC,EAAuB,qBACvBC,EAAoB,sBACpBC,EAAsB,wBACtBC,EAAoB,sBACpBC,EAA0B,4BAC1BC,EAAqC,yCACrCC,EAAoB,cACpBC,EAA0B,uBAC1BC,EAAmB,yB,6BCjCjBC,IARH,CACVC,MADU,SACHC,KACPC,KAFU,SAEJD,KACNE,KAHU,SAGJF,KACNG,MAJU,SAIHH,KACPI,QALU,SAKDJ,KACTK,IANU,SAMLL,O,cCFPnE,EAAOD,QARP,SAAgC0E,GAC9B,QAAa,IAATA,EACF,MAAM,IAAIC,eAAe,6DAG3B,OAAOD,GAITzE,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,cCHxE7B,EAAOD,QANP,SAAyB4E,EAAUC,GACjC,KAAMD,aAAoBC,GACxB,MAAM,IAAIC,UAAU,sCAKxB7E,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,cCPxE,SAASiD,EAAkBC,EAAQC,GACjC,IAAK,IAAIvE,EAAI,EAAGA,EAAIuE,EAAMC,OAAQxE,IAAK,CACrC,IAAIyE,EAAaF,EAAMvE,GACvByE,EAAW7D,WAAa6D,EAAW7D,aAAc,EACjD6D,EAAWxC,cAAe,EACtB,UAAWwC,IAAYA,EAAWvC,UAAW,GACjDxB,OAAOC,eAAe2D,EAAQG,EAAWlD,IAAKkD,IAUlDlF,EAAOD,QANP,SAAsB6E,EAAaO,EAAYC,GAG7C,OAFID,GAAYL,EAAkBF,EAAYvC,UAAW8C,GACrDC,GAAaN,EAAkBF,EAAaQ,GACzCR,GAIT5E,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,6BCjBxE,gQAUIwD,EAAQA,GAASC,QAAQrB,IAQtB,SAASsB,EAAQC,GACtB,IAAI/E,EAEJ,OADAA,EAAI+E,EAAIC,QAAQ,MACR,EACCD,EAEAA,EAAIE,MAAM,EAAGjF,GAQjB,SAASkF,EAASxB,GACvB,OAAO,IAAIyB,IAAgBL,EAAQpB,IAO9B,SAAS0B,EAASC,GACvB,IAAIjF,EAAI,uBAAuBkF,KAAKD,GACpC,OAAIjF,EACKA,EAAE,GAEF,GASJ,SAASmF,EAAKC,EAAeC,GAClC,IAAIC,EAAWC,EAAYC,EAChBC,EAAWC,EAClBC,EAAWN,EAAKT,QAAQ,KAI5B,GAHIe,EAAW,IACbN,EAAOA,EAAKR,MAAM,EAAGc,IAEF,IAAjBP,EAAMhB,OACR,OAAOiB,EAET,GAA2B,IAAvBD,EAAMR,QAAQ,KAChB,OAAOS,EAAOD,EAGhB,GADQA,EAAMR,QAAQ,MACT,EACX,OAAOQ,EAGT,GADAE,EAAYD,EAAKT,QAAQ,KACL,IAAhBS,EAAKjB,OACP,OAAOgB,EAET,GAAIE,EAAY,EAEd,OADAd,EAAM,iBAAmBa,EAAO,wBAA0BD,GACnDA,EAGT,GADAG,EAAaF,EAAKR,MAAM,GAAIS,EAAY,GAAK,KACjB,IAAxBF,EAAMR,QAAQ,MAChB,OAAOW,EAAaH,EAEtB,GAAIC,EAAKT,QAAQ,KAAMU,KAAeA,EAAY,GAEhD,IADAE,EAAaH,EAAKT,QAAQ,IAAKU,EAAY,IAC1B,EACf,OAAID,EAAKjB,OAASkB,EAAY,EAAI,EACzBD,EAAO,IAAMD,EAEbG,EAAaH,OAKxB,IADAI,EAAaH,EAAKT,QAAQ,IAAKU,EAAY,IAC1B,EACf,OAAID,EAAKjB,OAASkB,EAAY,EAAI,EACzBD,EAAO,IAAMD,EAEbG,EAAaH,EAI1B,GAA2B,IAAvBA,EAAMR,QAAQ,KAChB,OAAOS,EAAKR,MAAM,EAAGW,GAAcJ,EAIrC,IADAK,GADAC,EAAOL,EAAKR,MAAMW,IACDI,YAAY,MACb,EACd,OAAOL,EAAaH,EAMtB,IAJIK,GAAa,GAAKA,EAAYC,EAAKtB,OAAS,IAC9CsB,EAAOA,EAAKb,MAAM,GAAIY,EAAY,GAAK,MAEzCC,GAAQN,EACDM,EAAKG,MAAM,mBAChBH,EAAOA,EAAKI,QAAQ,iBAAkB,IAIxC,OADAJ,GADAA,EAAOA,EAAKI,QAAQ,QAAS,KACjBA,QAAQ,QAAS,KACtBT,EAAKR,MAAM,EAAGW,GAAcE,EAO9B,SAASK,EAASpB,GACvB,IAAM/E,EAAI+E,EAAIC,QAAQ,KACtB,OAAIhF,EAAI,EACC,KAEA+E,EAAIE,MAAM,EAAGjF,GASjB,SAASoG,EAAMX,EAAcV,GAClC,IACI/E,EACAqG,EACApG,EACAqG,EACAC,EACA9E,EACAhB,EACAqB,EACA0E,EACAC,EACAC,EACA3E,EACA4E,EAAa,IAAIC,OAAO,sCAC5B,IAAKnB,EACH,OAAOV,EAET,GAAIU,IAASV,EACX,MAAO,GAET,IAAK/E,EAAIS,EAAI,EAAG6F,EAAMvB,EAAIP,OAAQ/D,EAAI6F,EAAKtG,IAAMS,EAAG,CAElD,GADUsE,EAAI/E,KACJyF,EAAKzF,GACb,MAGJ,GAAIyF,EAAKR,MAAM,EAAGjF,GAAGiG,MAAMU,MACzBN,EAAItB,EAAIC,QAAQ,OACR,IACNqB,GAAK,GAEPpG,EAAI8E,EAAIC,QAAQ,IAAKqB,EAAI,GACN,MAAftB,EAAI9E,EAAI,IAA8B,MAAhBwF,EAAKxF,EAAI,IAAc8E,EAAIE,MAAM,EAAGhF,KAAOwF,EAAKR,MAAM,EAAGhF,IACjF,OAAO8E,EAAIE,MAAMhF,GAGrB,GAAe,MAAX8E,EAAI/E,IAAcyF,EAAKjB,SAAWxE,EACpC,OAAO+E,EAAIE,MAAMjF,GAEnB,KAAOA,EAAI,GAAoB,MAAf+E,EAAI/E,EAAI,IACtBA,IAEF,GAAIA,EAAI,EACN,OAAO+E,EAET,GAAIU,EAAKT,QAAQ,KAAMhF,EAAI,GAAK,GAAK+E,EAAIC,QAAQ,KAAMhF,EAAI,GAAK,EAC9D,OAAO+E,EAET,GAAIU,EAAKT,QAAQ,IAAKhF,GAAK,EACzB,OAAO+E,EAIT,IAFAtD,EAAI,EAECK,EAAI,EAAGyE,GADZE,EAAMhB,EAAKR,MAAMjF,IACMwE,OAAQ1C,EAAIyE,EAAMzE,IAE7B,MADN2E,EAAI3E,IAENL,IAGJ,GAAU,IAANA,GAAWzB,EAAI+E,EAAIP,QAAqB,MAAXO,EAAI/E,GACnC,MAAO,KAAO+E,EAAIE,MAAMjF,GAE1B,GAAU,IAANyB,GAAWzB,IAAM+E,EAAIP,OACvB,MAAO,KAGT,GADAzC,EAAI,GACAN,EAAI,EACN,IAAK+E,EAAI,EAAGE,EAAOjF,EAAGiF,GAAQ,EAAIF,GAAKE,EAAOF,GAAKE,EAAMA,GAAQ,IAAMF,IAAMA,EAC3EzE,GAAK,MAGT,OAAOA,EAAIgD,EAAIE,MAAMjF,K,qhBChMhB,SAAS6G,EAAY7E,GAC1B,MAAsB,WAAf,IAAOA,IAA4B,OAARA,GAAgB,YAAaA,EAI1D,SAAS8E,EAAQ9E,GACtB,MAAsB,WAAf,IAAOA,IAA4B,OAARA,GAAgB,eAAgBA,EAI7D,SAAS+E,EAAa/E,GAC3B,OAAOgF,EAAOhF,IACRA,EAAaiF,WAAazE,IAI3B,SAAS0E,EAAelF,GAC7B,OAAOA,GAAOtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,cACtDA,EAAIiF,WAAa9E,KACjBH,EAAIiF,WAAa3E,KACjBN,EAAIiF,WAAa7E,KACjBJ,EAAIiF,WAAazE,KACjBR,EAAIiF,WAAa5E,KACjBL,EAAIiF,WAAavE,KAKd,SAASyE,EAAWnF,GACzB,OAAOgF,EAAOhF,IACRA,EAAaiF,WAAa3E,IAI3B,SAAS0E,EAAOhF,GACrB,MAAsB,WAAf,IAAOA,IACD,OAARA,GACA,aAAcA,EAId,SAASoF,EAAUnG,GACxB,OAAQA,EAAegG,WAAa5E,IAI/B,SAASgF,EAAOrF,GACrB,MAAsB,WAAf,IAAOA,IAA4B,OAARA,GAChC,YAAaA,GACV,cAAeA,GACf,WAAYA,EAKZ,SAASsF,EAAYtF,GAC1B,OAAOgF,EAAOhF,IAAyB,cAAjBA,EAAIiF,SAIrB,SAASM,EAAYvF,GAC1B,OAAOgF,EAAOhF,IAAQ,aAAcA,GAAwB,cAAjBA,EAAIiF,SAI1C,SAASO,EAAUxF,GACxB,OAAOgF,EAAOhF,KACZA,EAAIiF,WAAa9E,KACjBH,EAAIiF,WAAa3E,KACjBN,EAAIiF,WAAa7E,KAKd,SAASqF,EAAYzF,GAC1B,OAAOgF,EAAOhF,KACZA,EAAIiF,WAAa9E,KACjBH,EAAIiF,WAAa3E,KAKd,SAASoF,EAAY1F,GAC1B,OAAOgF,EAAOhF,KACZA,EAAIiF,WAAa9E,KACjBH,EAAIiF,WAAa3E,KACjBN,EAAIiF,WAAa7E,KACjBJ,EAAIiF,WAAa5E,KAKd,SAASsF,EAAQ3F,GACtB,OAAOgF,EAAOhF,KACZA,EAAIiF,WAAa9E,KACjBH,EAAIiF,WAAa3E,KACjBN,EAAIiF,WAAa7E,KACjBJ,EAAIiF,WAAa1E,O,4oBC3GAqF,E,gCASnB,WAAaC,GAAa,MAGxB,GAHwB,YACxB,cAAMC,YAAUD,IADQ,sBARW1F,KAQX,wBAPb4F,IAAWH,YAUjB,EAAK3G,MACR,MAAM,IAAI+G,MAAM,6BAGlB,IAAK,EAAK/G,MAAMgH,SAAS,KACvB,MAAM,IAAID,MAAM,kBAAoBH,EAAM,uBAG5C,GAAI,EAAK5G,MAAMgH,SAAS,KAEtB,MAAM,IAAID,MADI,yBAA2BH,EAAM,wCAZzB,S,+BAoB1B,WACG,IAAIK,EAAMC,KAAKlH,MAAMmH,MAAM,KAAK,GAC5BtG,EAAIoG,EAAIjD,MAAM,GAAI,GAAGe,YAAY,KACjCQ,EAAI0B,EAAIlD,QAAQ,MACpB,OAAKwB,GAAK,GAAK1E,EAAI0E,EAAI,GAAM1E,EAAI,EAAU,KACpC,IAAI8F,EAAUM,EAAIjD,MAAM,EAAGnD,EAAI,M,kBAOzC,WACG,IAAIoG,EAAMC,KAAKlH,MAAMmH,MAAM,KAAK,GAC5BtG,EAAIoG,EAAIlD,QAAQ,MACpB,GAAIlD,EAAI,EAAG,MAAM,IAAIkG,MAAM,mDAC3B,IAAIxB,EAAI0B,EAAIlD,QAAQ,IAAKlD,EAAE,GAC3B,OACS,IAAI8F,EADTpB,EAAI,EACe0B,EAAIjD,MAAM,GAAK,IAEfiD,EAAIjD,MAAM,EAAGuB,EAAI,M,iBAQ3C,WACE,OAAI2B,KAAKlH,MAAM+D,QAAQ,KAAO,EACrBmD,KAEA,IAAIP,EAAUO,KAAKlH,MAAMmH,MAAM,KAAK,M,sBAO/C,WACE,MAAO,IAAMD,KAAKlH,MAAQ,M,gBAI5B,WACE,OAAOkH,KAAKlH,MAAMmH,MAAM,KAAK,K,eAI/B,WACE,OAAOD,KAAKlH,O,IAGd,SAAS8D,GACPoD,KAAKlH,MAAQ8D,K,wBAOf,SAAkB9D,GAChB,OAAI,MAAOA,GAGP+F,YAAO/F,GAFFA,EAKF,IAAI2G,EAAU3G,O,GAjGcoH,M,cCVvC,SAASC,EAAgB7H,GAKvB,OAJAlB,EAAOD,QAAUgJ,EAAkB5H,OAAO6H,eAAiB7H,OAAO8H,eAAiB,SAAyB/H,GAC1G,OAAOA,EAAEgI,WAAa/H,OAAO8H,eAAe/H,IAE9ClB,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,EACjEkH,EAAgB7H,GAGzBlB,EAAOD,QAAUgJ,EACjB/I,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,6BCTxE,qyBASMsH,EAAS,CAAEC,SA4RjB,SAAyBlD,EAAMmD,GAG7B,IAFA,IAAIC,EAAQpD,EAAK2C,MAAM,MACnBU,EAAS,GACJ9I,EAAI,EAAEA,EAAI4I,EAAKpE,OAAOxE,IAC7B4I,EAAK5I,IAAM,GACX8I,GAAUD,EAAM7I,GAAK4I,EAAK5I,GAE5B,OAAO8I,EAASD,EAAM5D,MAAM2D,EAAKpE,QAAQe,SA/RpC,SAASwD,EAAeC,GAE7B,OADAA,EAAYA,EAAUZ,MAAM,KAAK,GAAGa,OAC7B,IAAIrB,IAAU,yCAA2CoB,EAAY,aAGvE,SAASE,EAAqBC,GACnC,OAAO,IAAIvB,IAAU,qDAAuDuB,EAASF,QAWhF,SAASG,EAAapH,EAAKqH,GAChCrH,EAAIqH,UAAY,GAChB,IAAK,IAAI3F,EAAI2F,EAAU7E,OAAS,EAAGd,GAAK,EAAGA,IACzC1B,EAAIqH,UAAUA,EAAU3F,IAAM,GAGhC1B,EAAIsH,QAAU,SAAUC,GACjBvH,EAAIqH,UAAUE,KACjBvH,EAAIqH,UAAUE,GAAQ,KAI1BvH,EAAIwH,YAAc,SAAUD,EAAME,GAChCzH,EAAIqH,UAAUE,GAAMG,KAAKD,IAG3BzH,EAAI2H,eAAiB,SAAUJ,EAAMK,GACnC,IAAK,IAAI5J,EAAI,EAAEA,EAAIgC,EAAIqH,UAAUE,GAAM/E,OAAOxE,IAC5C,GAAIgC,EAAIqH,UAAUE,GAAMvJ,GAAGO,OAASqJ,EAElC,OADA5H,EAAIqH,UAAUE,GAAMM,OAAO7J,EAAG,IACvB,EAGX,OAAO,GAGTgC,EAAI8H,eAAiB,SAAUP,EAAME,GACnCzH,EAAIqH,UAAUE,GAAMQ,QAAQN,IAG9BzH,EAAIgI,cAAgB,SAAwBT,EAAMU,GAChD,IAGIvG,EACAwG,EAJAC,EAAe,GACfC,EAAmB,GACnB9D,EAAMtE,EAAIqH,UAAUE,GAAM/E,OAK9B,IAAKd,EAAI4C,EAAM,EAAG5C,GAAK,EAAGA,KAExBwG,EAAWlI,EAAIqH,UAAUE,GAAM7F,KACfwG,EAASG,MAAMrI,EAAKiI,IAClCE,EAAaT,KAAKQ,GAItB,IAAKxG,EAAIyG,EAAa3F,OAAS,EAAGd,GAAK,EAAGA,IACxC0G,EAAiBV,KAAKS,EAAazG,IAGrC,IAAKA,EAAI4C,EAAK5C,EAAI1B,EAAIqH,UAAUE,GAAM/E,OAAQd,IAC5C0G,EAAiBV,KAAK1H,EAAIqH,UAAUE,GAAM7F,IAG5C1B,EAAIqH,UAAUE,GAAQa,GAOnB,SAASE,IACd,OAAI3K,OAAO4K,UACF,IAAIA,cACF5K,OAAO6K,eACT,IAAIA,cAAc,oBAOtB,SAASC,EAAaC,EAAMC,GAEjC,IAAIC,EAAc,IADlBD,EAAUA,GAAW,KAENA,EAAQC,aACrBD,EAAQC,YAAYxC,MAAM,KAAKyC,SAAQ,SAAUpJ,GAC/CmJ,EAAYnJ,IAAK,KAGrB,IAAIqJ,EAAiB,GAMrB,OALIH,GAAWA,EAAQG,gBACrBH,EAAQG,eAAe1C,MAAM,KAAKyC,SAAQ,SAAUpJ,GAClDqJ,EAAerJ,IAAK,KAGjBsJ,EAASL,EAAMC,EAASC,EAAaE,GAGvC,SAASC,EAAUL,EAAMC,EAASC,EAAaE,GACpD,IAAI9K,EACAgL,EAAM,GACNC,EAAQ,EAAE,GACd,QAA6B,IAAlBP,EAAKQ,SAA0B,OAAOF,EACjD,GAAsB,IAAlBN,EAAKQ,UACP,GAAIR,EAAKS,aAAa,UAAaR,GAAWA,EAAQS,oBAAuBV,EAAKW,QAAQV,EAAQS,mBAAmBE,OACnHN,GAAON,EAAKa,cAAcZ,EAAQS,mBAAmBI,SAASC,iBACzD,KAAOd,GAAWA,EAAQe,mBAAsBhB,EAAKW,QAAQ,IAAMV,EAAQe,oBAAqB,CACrG,IAAIC,EAAQjB,EAAKkB,SAASC,cAC1Bb,GAAO,IAAMW,EAEb,IAAIG,EAAW,GACf,IAAK9L,EAAI0K,EAAKqB,WAAWvH,OAAS,EAAGxE,GAAK,EAAGA,IAAK,CAChD,IAAIgM,EAAMtB,EAAKqB,WAAW/L,GAC1B,KAAI8K,GAAkBA,EAAetG,OAAS,GAAKsG,EAAekB,EAAIzL,SAClE,QAAQ0L,KAAKD,EAAIzL,MAArB,CACA,GAAiB,UAAbyL,EAAIzL,MAAqBoK,GAAWA,EAAQuB,sBAA0BF,EAAI/K,MAAMmH,MAAM,KAAKpD,QAAQ2F,EAAQuB,qBAAqBC,SAAW,EAAI,CACjJ,IAAIC,EAAK,IAAIxF,OAAO+D,EAAQuB,qBAAqBC,OAAQ,KACzDH,EAAI/K,MAAQ+K,EAAI/K,MAAMiF,QAAQkG,EAAIzB,EAAQuB,qBAAqB5H,QAAQ2E,OAEtD,UAAb+C,EAAIzL,MAAqBoK,GAAWA,EAAQ0B,oBAAuB1B,EAAQ0B,qBAAuBL,EAAI/K,OAC1G6K,EAASpC,KAAKsC,EAAIzL,KAAO,KAAQyL,EAAI/K,MAAMiF,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,UAAY,MAW5I,GARI4F,EAAStH,OAAS,IAChBmG,GAAWA,EAAQ2B,gBACrBR,EAASS,MAAK,SAAUC,EAAGC,GACzB,OAAOD,EAAEX,cAAca,cAAcD,EAAEZ,kBAG3Cb,GAAO,IAAMc,EAASvG,KAAK,MAEzBqF,GAAeA,EAAYe,MAC7BX,GAAO,UACF,CAIL,IAHAA,GAAO,IACPA,GAAkB,SAAVW,EAAoB,OAAS,GACrCV,EAAMvB,KAAe,UAAViC,GAA+B,WAAVA,GAC3B3L,EAAI,EAAGA,EAAI0K,EAAKiC,WAAWnI,OAAQxE,IAAKgL,GAAOD,EAASL,EAAKiC,WAAW3M,IAC7EiL,EAAM2B,MACN5B,GAAkB,SAAVW,EAAoB,KAAOA,EAAP,MAA4B,KAAOA,EAAQ,WAGtE,GAAsB,IAAlBjB,EAAKQ,SAEdF,GAAO,UAASN,EAAKmC,UAAY,cAC5B,GAAsB,IAAlBnC,EAAKQ,UAAoC,IAAlBR,EAAKQ,SAAgB,CAErD,IAAI4B,EAAKpC,EAAKmC,UAAU3G,QAAQ,OAAQ,IACxC8E,GAAOC,EAAMA,EAAMzG,OAAS,GAAKsI,EAAKA,EAAG5G,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,aAEpGrB,QAAQrB,IAAI,qDAAuDkH,EAAKQ,UACxErG,QAAQrB,IAAIkH,GAEd,OAAOM,EAGF,SAAS+B,IACd,IAAIC,EAAM,IAAIC,KACVC,EAAOF,EAAIG,UAAY,KACvBC,EAAQJ,EAAIK,WAAa,EACzBC,EAAMN,EAAIO,UACVC,EAAOR,EAAIS,cACXC,EAASV,EAAIW,gBACbC,EAASZ,EAAIa,aAMjB,OALIT,EAAQ,KAAIA,EAAQ,IAAMA,GAC1BE,EAAM,KAAIA,EAAM,IAAMA,GACtBE,EAAO,KAAIA,EAAO,IAAMA,GACxBE,EAAS,KAAIA,EAAS,IAAMA,GAC5BE,EAAS,KAAIA,EAAS,IAAMA,GACzBV,EAAO,IAAME,EAAQ,IAAME,EAAM,IACtCE,EAAO,IAAME,EAAS,IAAME,EAAS,IAMlC,SAASE,EAAcpK,EAAGqK,EAAGC,EAAGC,GACrC,IAAIC,EAAW,SAAUxK,GACvB,MAAuB,cAAfA,EAAEuD,SAA4B,KAAOvD,GAE3CyK,EAAY,SAAUzK,GACxB,IAAI0K,EAAMJ,EAAEK,mBAAmB3K,GAAG4K,KAAI,SAAUC,GAC9C,OAAaL,EAASK,EAAGC,SAAW,IAAMN,EAASK,EAAGE,WACpD,IAAMP,EAASK,EAAG7M,WACnBgN,OAAOV,EAAEK,wBAAmBM,OAAWA,EAAWjL,GAAG4K,KAAI,SAAUC,GACpE,OAAaL,EAASK,EAAGC,SAAW,IAAMN,EAASK,EAAGE,WACpD,IAAMP,EAASK,EAAG7M,YAGtB,OADA0M,EAAI7B,OACG6B,EAAI7I,KAAK,OAEZqJ,EAAalO,OAAOkB,UAAUC,eAAe1B,KAAK6N,EAAG,gBACvDA,EAAEa,aAAanL,EAAGqK,GAClBrK,EAAEoL,YAAYf,GAElB,MAAoB,cAAfrK,EAAEuD,UAA6C,cAAf8G,EAAE9G,SAClB,IAAf2H,EAAyB,EACzBT,EAAUzK,GAAKyK,EAAUJ,GAAW,EACpCI,EAAUzK,GAAKyK,EAAUJ,IAAY,EAClCa,EAGHX,GAAUvK,EAAEqB,KAAOgJ,EAAEhJ,KACfkJ,EAAOvK,EAAEqB,MAAQrB,EAAEqB,KAAK2H,cAAcuB,EAAOF,EAAEhJ,MAAQgJ,EAAEhJ,KAE5D6J,EAIJ,SAASG,EAAiBrL,EAAGqK,EAAGC,EAAGC,GACxC,OAAOH,EAAapK,EAAE8K,QAAST,EAAES,QAASR,EAAGC,IAC3CH,EAAapK,EAAE+K,UAAWV,EAAEU,UAAWT,EAAGC,IAC1CH,EAAapK,EAAEhC,OAAQqM,EAAErM,OAAQsM,EAAGC,GAQjC,SAASe,EAAQvO,GACtB,IAAI4F,EAAInB,SAAS+J,cAAc,OAC/B5I,EAAEoF,YAAchL,EAChByE,SAASgK,KAAKC,YAAY9I,GAQrB,SAAS+I,EAAUlH,EAAKyC,GAG7B,OADAA,EAAUA,GAAW,GACgBpL,GAAUA,EAAOD,SAC1C,IAAIiL,aAAY8E,gBAAgBnH,EAAKyC,EAAQ2E,aAAe,0BAGhD,oBAAX3P,QAA0BA,OAAO4K,UAChC,IAAI5K,OAAO4K,UAEX,IAAIA,aAGH8E,gBAAgBnH,EAAK,mBAM/B,SAASqH,EAAgB/C,EAAG9I,GACjC,IAAK,IAAI1D,EAAI,EAAGA,EAAIwM,EAAEhI,OAAQxE,IAG5B,GAAIwM,EAAExM,GAAGwO,QAAQgB,OAAO9L,EAAE8K,UACxBhC,EAAExM,GAAGyO,UAAUe,OAAO9L,EAAE+K,YACxBjC,EAAExM,GAAG0B,OAAO8N,OAAO9L,EAAEhC,SACrB8K,EAAExM,GAAGyP,IAAID,OAAO9L,EAAE+L,KAElB,YADAjD,EAAE3C,OAAO7J,EAAG,GAIhB,MAAM,IAAIgI,MAAM,yCAA2CtE,EAAI,IAAMA,EAAE+L,KAGlE,SAASC,EAAmBxH,EAAKyH,GACtC,OAAQzH,EAAIjD,MAAM,EAAG0K,EAAKnL,UAAYmL,EAmBjC,SAASC,EAAaC,GAC3B,IAAI3H,EAAW2H,EAAI,KACnB,IAAKA,EAAEC,MACL,OAAO5H,EAAM,wBAIf,IAFA,IAAI6H,EAAQF,EAAEC,MAAME,WAAW5H,MAAM,MACjC6H,EAAU,GACLjQ,EAAI,EAAGA,EAAI+P,EAAMvL,OAAQxE,IAAK,CACrC,IAAIkQ,EAAOH,EAAM/P,GACjB,GAAIkQ,EAAKlL,QAAQ,gBAAkB,EAEjC,MAEoB,KAAlBkL,EAAKC,OAAO,KACdD,EAAO,WAAaA,GAEtB,IAAIE,EAASF,EAAK9H,MAAM,KACxB6H,EAAQvG,KAAK0G,GAIf,IAASpQ,EAAI,EAAGA,EAAIiQ,EAAQzL,OAAQxE,IAClCkI,GAAO,KAAO+H,EAAQjQ,GAAG,GAAK,SAAWiQ,EAAQjQ,GAAG,GAEtD,OAAOkI,I,wIC/TqBG,E,WAe5B,WAAsBpH,GAAe,+FACnCkH,KAAKlH,MAAQA,E,sCAOf,SAAmCoP,GAEjC,OADAxL,QAAQrB,IAAI,sBAAwB2E,MAC7BA,O,yBAQT,SAAamI,GACX,OAAInI,KAAKoI,WAAaD,EAAMC,YAClB,EAENpI,KAAKoI,WAAaD,EAAMC,WACnB,EAELpI,KAAKlH,MAAQqP,EAAMrP,OACb,EAENkH,KAAKlH,MAAQqP,EAAMrP,MACd,EAEF,I,oBAOT,SAAQqP,GACN,QAAKA,IAGGnI,KAAKlB,WAAaqJ,EAAMrJ,UAC7BkB,KAAKlH,QAAUqP,EAAMrP,S,wBAO1B,WACE,OAAOkH,KAAKqI,gB,sBAOd,SAASF,GACP,OAAOnI,KAAKqH,OAAOc,K,yBAOrB,WACE,OAAOnI,KAAKsI,S,kBAMd,WACE,OAAOtI,KAAK6H,a,kBAMd,WACE,OAAO7H,KAAKsI,S,sBAMd,WACE,MAAM,IAAIzI,MAAM,gE,SAvGUK,E,wBAAAA,E,gCCX9B,IAAIE,EAAiB,EAAQ,IAiB7BhJ,EAAOD,QAfP,SAAmBoR,EAAUC,GAC3B,GAA0B,mBAAfA,GAA4C,OAAfA,EACtC,MAAM,IAAIvM,UAAU,sDAGtBsM,EAAS9O,UAAYlB,OAAOY,OAAOqP,GAAcA,EAAW/O,UAAW,CACrEgP,YAAa,CACX3P,MAAOyP,EACPxO,UAAU,EACVD,cAAc,KAGd0O,GAAYpI,EAAemI,EAAUC,IAI3CpR,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,6BClBxE,6CAQe,SAASyP,EAAWC,EAAezR,GAChD,IAAM0R,EAAc1R,GAAW,CAAE2R,UAAW,SAAC/P,GAAD,OAAW,IAAIkE,IAAgBlE,KAE3E,OAAO,SAAUgQ,GACf,OAAOF,EAAYC,UAAUF,GAASG,GAAM,Q,gBCZhD,IAAIC,EAAU,EAAQ,IAA0C,QAE5DC,EAAwB,EAAQ,GAYpC5R,EAAOD,QAVP,SAAoC0E,EAAM7D,GACxC,GAAIA,IAA2B,WAAlB+Q,EAAQ/Q,IAAsC,mBAATA,GAChD,OAAOA,EACF,QAAa,IAATA,EACT,MAAM,IAAIiE,UAAU,4DAGtB,OAAO+M,EAAsBnN,IAI/BzE,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,6BCdxE,sHAwDO,IAAMgQ,EAAwB,CACnC,YACA,eACA,UACA,YACA,OACA,WACA,YAGIC,EACG,mDADHA,EAEE,kDAFFA,EAGC,iDAUA,SAASC,EACdC,EACA/C,EACAgD,GAEA,IAAMC,EAAqB,GAgB3B,OAdAD,EAAKE,QAAqB,SAACC,EAAIC,EAAU5R,EAAG6R,GAG1C,IAAIC,EAQJ,OAVAL,EAAW/H,KAAK6H,EAAWQ,KAAKJ,EAAIJ,EAAWP,UAAUK,GAAYQ,EAAS7R,KAG1EA,EAAI6R,EAASrN,OAAS,GACxBsN,EAAWP,EAAWS,YACtBP,EAAW/H,KAAK6H,EAAWQ,KAAKJ,EAAIJ,EAAWP,UAAUK,GAAWS,KAEpEL,EAAW/H,KAAK6H,EAAWQ,KAAKJ,EAAIJ,EAAWP,UAAUK,GAAWE,EAAWP,UAAUK,KAGpFS,IACNtD,GAEIiD,EAGF,SAASQ,EAAcC,EAAKC,GAAqB,IAAfnS,EAAe,uDAAH,EAC/CwE,EAAS0N,EAAI1N,OAEjB,IADIxE,EAAI,IAAGA,EAAIwE,EAASxE,GACjBA,EAAIwE,EAAQxE,IACjB,GAAIkS,EAAIlS,KAAOmS,EACb,OAAOnS,EAGX,OAAQ,I,6BClGK+H,IATX,CACF,QAAW,EACX,WAAc,EACd,MAAS,EACT,UAAa,EACb,UAAa,EACb,SAAY,I,wHCwBRqK,EAAe,IAAIC,IAGnBC,EAAoC,CAExCC,UAAQ,WACLC,IAAQC,aAAc,GADjB,MAELD,IAAQE,kBAAmB,GAFtB,MAGLF,IAAQG,cAAe,GAHlB,MAILH,IAAQI,UAAW,GAJd,MAKLJ,IAAQb,IAAK,GALR,MAMLa,IAAQK,cAAe,GANlB,MAOLL,IAAQM,cAAe,GAPlB,GAcRd,UAhBwC,SAgB9B/Q,GACR,OAAO,IAAI8R,IAAU9R,IAGvBmR,aAAc,kBAAMA,GAKpB5C,OAzBwC,SAyBjChD,EAAeC,GACpB,OAAID,IAAMC,IAAMD,IAAMC,IAIlBpF,YAAOmF,IAAMnF,YAAOoF,MAClBpF,YAAOmF,KAAMnF,YAAOoF,MAEpBtE,KAAKqH,OAAOhD,EAAEgC,QAAS/B,EAAE+B,UACzBrG,KAAKqH,OAAOhD,EAAEiC,UAAWhC,EAAEgC,YAC3BtG,KAAKqH,OAAOhD,EAAE9K,OAAQ+K,EAAE/K,SACxByG,KAAKqH,OAAOhD,EAAEwG,MAAOvG,EAAEuG,WAOzBhM,YAAOwF,KAAMxF,YAAOyF,KACftE,KAAKwJ,GAAGnF,KAAOrE,KAAKwJ,GAAGlF,KAclCkF,GA1DwC,SA0DpCsB,GACF,IAAKA,EACH,MAAO,YAGT,GAAI5L,YAAO4L,GACT,OAAO9K,KAAK+K,SAASD,GAGvB,OAAQA,EAAKhM,UACX,KAAK1E,IACH,MAAO,eACT,KAAKD,IACH,OAAO6Q,IAASnD,SAASiD,GAC3B,QACE,IAAMG,EAAKjL,KAAKkL,SAASJ,GACzB,GAAIG,EACF,OAAOA,EAGT,MAAM,IAAIpL,MAAJ,mCAAsCiL,EAAKhM,SAA3C,QAIZI,OAlFwC,SAkFhCrF,GACN,OAAOA,aAAesR,KAQxBC,QA3FwC,SA4FtCtS,EACAuS,GAEA,GAAqB,iBAAVvS,IAAuBuS,EAChC,OAAOC,IAAQC,UAAUzS,GAG3B,IAAM0S,EAA4B,iBAAV1S,EAAqBA,EAAQ,GAAKA,EAC1D,MAAkC,iBAAvBuS,GACgC,IAArCA,EAAmBxO,QAAQ,KACtB,IAAIyO,IAAQE,EAAUH,GAEtB,IAAIC,IAAQE,EAAU,KAAMxL,KAAK6I,UAAUwC,IAG7C,IAAIC,IAAQE,EAAU,KAAMH,IAQvCxC,UAnHwC,SAmH9B/P,GACR,OAAO,IAAI2G,IAAU3G,IAUvB8Q,KA9HwC,SAmItCvD,EAAYC,EAAc/M,EAAWsR,GACrC,OAAO,IAAIM,IAAU9E,EAASC,EAAW/M,EAAQsR,GAASZ,IAU5DwB,OA9IwC,SA+ItCpF,EACAC,EACA/M,EACAsR,GAEA,OAAO7K,KAAK4J,KAAKvD,EAASC,EAAW/M,EAAQsR,IAG/CE,SAvJwC,SAuJ/B1M,GACP,gBAAU2B,KAAKkL,SAAS7M,EAAEgI,SAA1B,YAAsCrG,KAAKkL,SAAS7M,EAAEiI,WAAtD,YAAoEtG,KAAKkL,SAAS7M,EAAE9E,QAApF,YAA+FyG,KAAKkL,SAAS7M,EAAEwM,OAA/G,OAIFK,SA5JwC,SA4J/BJ,GAAoB,WAC3B,OAAQA,EAAKhM,UACX,KAAK7E,IACH,MAAO,KAAO6Q,EAAKhS,MACrB,KAAKsB,IACH,MAAO,GACT,KAAKE,IACH,MAAO,mDACT,KAAKJ,IACH,OAAOoR,IAAQhD,KAAKwC,GACtB,KAAKvQ,IACL,KAAKP,IACH,MAAO,IAAM8Q,EAAKhS,MAAQ,IAC5B,KAAKuB,IACH,MAAO,IAAOyQ,EAAoBY,SAASvF,KAAI,SAAApN,GAAC,OAAI,EAAKmS,SAASnS,MAAIqE,KAAK,KAAO,IACpF,QACE,MAAM,IAAIyC,MAAJ,sDAAyDiL,EAAKhM,SAA9D,SAKZ6M,KAjLwC,SAiLlCb,GACJ,OAAI9K,KAAKd,OAAO4L,GACP9K,KAAK+K,SAASD,GAGhB9K,KAAKkL,SAASJ,IAOvBc,SA7LwC,SA6L/BxT,GACP,OAAO,IAAI4S,IAAS5S,KAKT+R,O,2OCvOA,GACb0B,QAAS,IAAIpM,IAAU,4CACvBqM,SAAU,IAAIrM,IAAU,6CACxBsM,QAAS,IAAItM,IAAU,4CACvBuM,OAAQ,IAAIvM,IAAU,2CACtBwM,QAAS,IAAIxM,IAAU,4CACvByM,WAAY,IAAIzM,IAAU,yDAC1Bc,OAAQ,IAAId,IAAU,4C,ibCOH6L,E,gCAuBnB,WAAaxS,EAAeqT,EAA0BC,GAAW,yBAC/D,cAAMtT,GADyD,sBAtB9BoB,KAsB8B,wBApBpD0F,IAAW0L,SAoByC,sBAfrCe,EAAI9L,QAeiC,mBAbzD,GAayD,sBAR9C,IAWb4L,GACF,EAAKA,SAAWA,EAChB,EAAKC,SAAWC,EAAIH,YAEpB,EAAKE,SADIA,EACOpP,IAAgBuO,UAAUa,GAE1BC,EAAI9L,OATyC,E,gCAgBjE,WACE,OAAO,IAAI+K,EAAQtL,KAAKlH,MAAOkH,KAAKsM,KAAMtM,KAAKoM,Y,oBAOjD,SAAQjE,GACN,QAAKA,IAIGnI,KAAKlB,WAAaqJ,EAAMrJ,UAC7BkB,KAAKlH,QAAUqP,EAAMrP,OACrBkH,KAAKmM,WAAchE,EAAkBgE,YACnCnM,KAAKoM,WAAcjE,EAAkBiE,UACrCpM,KAAKoM,UAAYpM,KAAKoM,SAAS/E,OAAQc,EAAkBiE,c,gBAOhE,WACE,OAAOpM,KAAKmM,U,IAGd,SAAUA,GACRnM,KAAKmM,SAAWA,GAAY,K,kBAG9B,WACE,OAAOb,EAAQhD,KAAKtI,Q,sBA6BtB,WACE,MAAO,GAAKA,KAAKlH,S,mBA1BnB,SAAasS,GACX,GAA6B,iBAAlBA,EAAQtS,MACjB,MAAO,GAAKsS,EAAQtS,MACf,GAA6B,iBAAlBsS,EAAQtS,MACxB,MAAM,IAAI+G,MAAM,iDACduL,EAAQtS,OAEZ,IAAIiH,EAAMqL,EAAQtS,MAelB,OARAiH,EAAM,KADNA,GADAA,GADAA,GADAA,EAAMA,EAAIhC,QAAQ,MAAO,SACfA,QAAQ,MAAO,QACfA,QAAQ,MAAO,QACfA,QAAQ,MAAO,QACP,IAEdqN,EAAQe,SACVpM,GAAO,IAAMqL,EAAQe,SACXf,EAAQgB,SAAS/E,OAAOgF,EAAI9L,UAEtCR,GAAO,KAAOqL,EAAQgB,SAAS/D,eAE1BtI,I,yBAWT,SAAoBjH,GAElB,OAAO,IAAIwS,EADIxS,EAAQ,IAAM,IACA,KAAMuT,EAAIR,W,sBAOzC,SAAgB/S,GACd,KAAMA,aAAiBgM,MACrB,MAAM,IAAI7I,UAAU,0CAEtB,IAAIsQ,EAAK,SAAUhR,GACjB,OAAQ,IAAM,IAAMA,IAAIuB,MAAM,EAAG,IAKnC,OAAO,IAAIwO,EAHKxS,EAAM0T,iBAAmB,IAAMD,EAAGzT,EAAM2T,cAAgB,GACtE,IAAMF,EAAGzT,EAAM4T,cAAgB,IAAMH,EAAGzT,EAAMwM,eAAiB,IAC/DiH,EAAGzT,EAAM0M,iBAAmB,IAAM+G,EAAGzT,EAAM6T,iBAAmB,IACvC,KAAMN,EAAIP,Y,wBAOrC,SAAkBhT,GAChB,GAAqB,iBAAVA,EACT,MAAM,IAAImD,UAAU,4CAEtB,IAAImQ,EACEZ,EAAW1S,EAAM+O,WAMvB,OAJEuE,EADEZ,EAAS3O,QAAQ,KAAO,GAAK+P,KAAKC,IAAI/T,IAAUgU,OAAOC,iBAC9CD,OAAOE,UAAUlU,GAASuT,EAAIJ,QAAUI,EAAIN,QAE5CM,EAAIL,OAEV,IAAIV,EAAQE,EAAU,KAAMY,K,uBAOrC,SAA6CtT,GAC3C,GAAImG,YAAUnG,GACZ,OAAOA,EAET,WAAeA,IACb,IAAK,SACH,GAAIA,aAAiBgM,KACnB,OAAOwG,EAAQ2B,SAASnU,GAE5B,IAAK,UACH,OAAOwS,EAAQ4B,YAAYpU,GAC7B,IAAK,SACH,OAAOwS,EAAQ6B,WAAWrU,GAC5B,IAAK,SACH,OAAO,IAAIwS,EAAQxS,GAGvB,MAAM,IAAI+G,MAAM,2BAA6B/G,EAAQ,YAArC,IACPA,Q,GA3KwBoH,M,6BCa9B,IAAKmK,EALZ,kC,SAKYA,K,0BAAAA,E,sCAAAA,E,6BAAAA,E,QAAAA,E,oBAAAA,E,6BAAAA,E,8BAAAA,M,moBCnBSO,E,gCAyCnB,WAAapB,GAAuB,yBAClC,cAAMoB,EAAUwC,MAAM5D,IADY,sBAxCCvP,KAwCD,wBAdvB2F,IAAWgL,WAcY,qBAZlB,GAYkB,mBAN5B,GAM4B,E,4BAOpC,WACE,OAAO5K,KAAKlH,O,IAGd,SAAeA,GACbkH,KAAKlH,MAAQA,I,yBAGf,SAAaqP,GACX,OAAInI,KAAKoI,WAAaD,EAAMC,YAClB,EAENpI,KAAKoI,WAAaD,EAAMC,WACnB,EAELpI,KAAKwJ,GAAKrB,EAAMqB,IACV,EAENxJ,KAAKwJ,GAAKrB,EAAMqB,GACX,EAEF,I,kBAOT,SAAM6D,GACJ,IAAIC,EAAW,IAAI1C,EAEnB,OADAyC,EAAQE,OAAOvN,KAAMsN,GACdA,I,yBAGT,WACE,OAAO1C,EAAU4C,sBAAwBxN,KAAKlH,Q,sBAGhD,WACE,OAAO8R,EAAU4C,sBAAwBxN,KAAKwJ,M,oBA/EhD,SAAsBA,GACpB,GAAIA,EAAI,CACN,GAAkB,iBAAPA,EAET,MADA9M,QAAQrB,IAAI,gBAAiBmO,GACvB,IAAI3J,MAAM,sCAAwC2J,GAG1D,GAAIA,EAAG1J,SAAS,KAAM,CAEpB,IAAI2N,EAAYjE,EAAGvJ,MAAM,KACzB,OAAOwN,EAAUA,EAAUpR,OAAS,GAGtC,OAAOmN,EAGT,MAAO,IAAMoB,EAAU8C,a,GAxBYxN,K,IAAlB0K,E,SAKK,G,IALLA,E,wBAMkB,O,6BChBvC,MAAM+C,EAAO,8CACTtB,EAAO,oCACPuB,EAAO,kCAEI,KACbC,IAAK,CACH9B,QAAYM,EAAH,UACTR,QAAYQ,EAAH,UACTL,OAAYK,EAAH,SACTJ,QAAYI,EAAH,UACT9L,OAAY8L,EAAH,UAEXnD,IAAK,CACH4E,KAAeH,EAAH,OACZI,IAAeJ,EAAH,MACZK,MAAeL,EAAH,QACZM,KAAeN,EAAH,OACZzB,WAAeyB,EAAH,cAEdO,IAAK,CACHC,OAAQ,wCAEVxV,EAAG,CACDyV,QAAYR,EAAH,gBACTS,OAAYT,EAAH,gBAEXvS,IAAK,CACHiT,QAAYV,EAAH,iB,cC3Bb,SAAS7E,EAAQlP,GAiBf,MAdsB,mBAAXjB,QAAoD,iBAApBA,OAAO2V,UAChDnX,EAAOD,QAAU4R,EAAU,SAAiBlP,GAC1C,cAAcA,GAGhBzC,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,IAExE7B,EAAOD,QAAU4R,EAAU,SAAiBlP,GAC1C,OAAOA,GAAyB,mBAAXjB,QAAyBiB,EAAI4O,cAAgB7P,QAAUiB,IAAQjB,OAAOa,UAAY,gBAAkBI,GAG3HzC,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,GAGnE8P,EAAQlP,GAGjBzC,EAAOD,QAAU4R,EACjB3R,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,ooBCRnD+R,E,gCAcnB,aAAwB,MAAX5S,EAAW,uDAAJ,GAAI,mBACtB,cAAMA,GADgB,sBAbY+B,KAaZ,kBAVjB,UAUiB,wBATXyF,IAAWoL,UASA,mBARhB,GAQgB,yBAEtB,EAAK1N,KAAO,SACZ,EAAKV,IAAM4R,OAASpW,EAAM,EAAKkF,MAHT,E,kCAMxB,SAAQ6K,GACN,QAAKA,IAIGnI,KAAKlB,WAAaqJ,EAAMrJ,UAAckB,KAAKlH,QAAUqP,EAAMrP,S,wBAGrE,WACE,OAAOkH,KAAK6H,a,wBAGd,SAAYK,GACV,IAAI5J,EACJ,OAAwC,OAAhCA,EAAM4J,EAASlI,KAAKsI,SAAmBhK,EAAM0B,O,sBAGvD,WACE,OAAOgL,EAASnD,SAAS7H,S,uBAG3B,SAAiB4L,GACf,OAAIA,EAAShP,IAAIE,MAAM,EAAG8O,EAAStO,KAAKjB,UAAYuP,EAAStO,KAC3D,WAAWsO,EAAShP,IAAIE,MAAM8O,EAAStO,KAAKjB,SAG9C,WAAWuP,EAAShP,S,GA9CcsD,M,6BCRtC,MAAMuO,EAAM,GACZrX,EAAOD,QAAUsX,EASjBA,EAAIC,QAAUC,MAAMD,QASpBD,EAAIG,UAAYC,GAAmB,kBAANA,GACW,qBAAtCtW,OAAOkB,UAAUoO,SAAS7P,KAAK6W,GASjCJ,EAAIK,SAAWD,GAAKJ,EAAIM,SAASF,MACF,IAA5BG,OAAOH,GAAGhS,QAAQ,MAAe+P,KAAKC,IAAIgC,IAAM,MASnDJ,EAAIQ,cAAgBJ,GAAKJ,EAAIS,SAASL,IAAgC,IAA1BtW,OAAO4W,KAAKN,GAAGxS,OAS3DoS,EAAIM,SAAWF,GAAmB,iBAANA,GACY,oBAAtCtW,OAAOkB,UAAUoO,SAAS7P,KAAK6W,GASjCJ,EAAIW,UAAYP,IAAMQ,MAAMC,WAAWT,KAAOU,SAASV,GASvDJ,EAAIS,SAAWL,GAA2C,oBAAtCtW,OAAOkB,UAAUoO,SAAS7P,KAAK6W,GASnDJ,EAAIe,SAAWX,GAAmB,iBAANA,GACY,oBAAtCtW,OAAOkB,UAAUoO,SAAS7P,KAAK6W,GASjCJ,EAAIgB,YAAcZ,QAAkB,IAANA,G,6BCxFvB,SAASlP,EAAW4C,GACzB,MAAoB,iBAATA,EACFA,EAGFA,EAAKzJ,MANd,mC,6BCFA,mCAgBAoH,IAAKqL,UAAYA,IAEFrL,MAAf,EAEA,IAAMhH,EAAK,CAAE2U,IAAKnF,YAAU,sCAM5BxI,IAAKwP,KAAO,SAAU5E,GACpB,OAAIlM,YAAakM,GACRA,EAAKY,SAASvF,IAAIjG,IAAKwP,MAE3BzQ,YAAU6L,GACXA,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,YACR,MAAf/C,EAAKhS,OAAgC,SAAfgS,EAAKhS,MAEhCgS,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,cAC9B/C,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,SACrB,IAAI/I,KAAKgG,EAAKhS,OAGrBgS,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,aAC5B/C,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,WAC5B/C,EAAKsB,SAAS/E,OAAOnO,EAAG2U,IAAI,YAErBf,OAAOhC,EAAKhS,OAEdgS,EAAKhS,MAfiBgS,I,6BCzB/B,MAAM6E,EAAa,EAAQ,IACrBC,EAAQ,EAAQ,IAEhBC,EAAmB,EAAQ,IAAgBA,iBAC3CC,EAAc,EAAQ,IAGtBC,EAAqB,+BACrBC,EAAoB,gCACpBC,EACJ,sDAEIC,EACK,CACPC,OAAQ,yCAIN1B,EAAM,GACZrX,EAAOD,QAAUsX,EACjBA,EAAIoB,iBAAmBA,EAUvBpB,EAAI2B,MAAQ,SAAStX,GACnB,GAAGA,GAA0B,iBAAVA,EAAoB,CACrC,IAAIuX,EACJ,GAAGT,EAAMlB,QAAQ5V,GAAQ,CACvBuX,EAAO,GACP,IAAI,IAAIxY,EAAI,EAAGA,EAAIiB,EAAMuD,SAAUxE,EACjCwY,EAAKxY,GAAK4W,EAAI2B,MAAMtX,EAAMjB,SAEvB,GAAGiB,aAAiBwX,IAAK,CAC9BD,EAAO,IAAIC,IACX,IAAI,MAAOpS,EAAG2Q,KAAM/V,EAClBuX,EAAKE,IAAIrS,EAAGuQ,EAAI2B,MAAMvB,SAEnB,GAAG/V,aAAiB0X,IAAK,CAC9BH,EAAO,IAAIG,IACX,IAAI,MAAM3B,KAAK/V,EACbuX,EAAKI,IAAIhC,EAAI2B,MAAMvB,SAEhB,GAAGe,EAAMV,SAASpW,GAAQ,CAC/BuX,EAAO,GACP,IAAI,MAAMjX,KAAON,EACfuX,EAAKjX,GAAOqV,EAAI2B,MAAMtX,EAAMM,SAG9BiX,EAAOvX,EAAM+O,WAEf,OAAOwI,EAET,OAAOvX,GAWT2V,EAAIiC,QAAU,SAAS5X,GACrB,OAAO6V,MAAMD,QAAQ5V,GAASA,EAAQ,CAACA,IAYzC2V,EAAIkC,aAAe,CAACC,EAAU,MAI5B,GAHkBrY,OAAO4W,KAAKyB,GAASC,KACrCC,GAAyB,WAApBA,EAAEpN,eAGP,MAAM,IAAIqN,WACR,6CACAb,EAAiBC,OAAS,mBAG9B,OAAO5X,OAAOyY,OAAO,CAACC,OAAQf,EAAiBC,QAASS,IAqB1DnC,EAAIyC,gBAAkBC,IACpB,MAAMd,EAAO,GAEPe,EAAUD,EAAOrT,MAAMiS,GAC7B,IAAI,IAAIlY,EAAI,EAAGA,EAAIuZ,EAAQ/U,SAAUxE,EAAG,CACtC,IAAIiG,EAAQsT,EAAQvZ,GAAGiG,MAAMkS,GAC7B,IAAIlS,EACF,SAEF,MAAM6C,EAAS,CAACxE,OAAQ2B,EAAM,IACxBuT,EAASvT,EAAM,GACrB,KAAOA,EAAQmS,EAAyB9S,KAAKkU,IAC3C1Q,EAAO7C,EAAM,SAAoB0I,IAAb1I,EAAM,GAAoBA,EAAM,GAAKA,EAAM,GAEjE,MAAMwT,EAAM3Q,EAAY,KAAK,GAC1BgO,MAAMD,QAAQ2B,EAAKiB,IACpBjB,EAAKiB,GAAK/P,KAAKZ,GACP0P,EAAK3W,eAAe4X,GAC5BjB,EAAKiB,GAAO,CAACjB,EAAKiB,GAAM3Q,GAExB0P,EAAKiB,GAAO3Q,EAGhB,OAAO0P,GAQT5B,EAAI8C,kBAAoB,CAAC1C,EAAG2C,KAC1B,KAAG5B,EAAMJ,SAASX,IAIfe,EAAMlB,QAAQG,IAAMA,EAAE4C,MAAMC,GAAM9B,EAAMJ,SAASkC,KAApD,CAGA,GAAGF,GAAW5B,EAAMV,SAASL,GAC3B,OAAOtW,OAAO4W,KAAKN,GAAGxS,QACpB,KAAK,EAEH,OACF,KAAK,EAEH,GAAG,aAAcwS,GACfJ,EAAIiC,QAAQ7B,EAAE,aAAa4C,MAAMC,GAAM9B,EAAMJ,SAASkC,IACtD,OAKR,MAAM,IAAI5B,EACR,kHAEwB,qBACxB,CAAC6B,KAAM,qBAAsB7Y,MAAO+V,MAWxCJ,EAAImD,YAAc,CAACvL,EAAS7M,KAC1B,GAAG6M,EAAQ3M,eAAeF,GAAW,CACnC,MAAMV,EAAQuN,EAAQ7M,GACtB,OAASoW,EAAMlB,QAAQ5V,IAAUA,EAAMuD,OAAS,EAElD,OAAO,GAYToS,EAAIoD,SAAW,CAACxL,EAAS7M,EAAUV,KACjC,GAAG2V,EAAImD,YAAYvL,EAAS7M,GAAW,CACrC,IAAIsY,EAAMzL,EAAQ7M,GAClB,MAAMuY,EAASpC,EAAWoC,OAAOD,GACjC,GAAGlC,EAAMlB,QAAQoD,IAAQC,EAAQ,CAC5BA,IACDD,EAAMA,EAAI,UAEZ,IAAI,IAAIja,EAAI,EAAGA,EAAIia,EAAIzV,SAAUxE,EAC/B,GAAG4W,EAAIuD,cAAclZ,EAAOgZ,EAAIja,IAC9B,OAAO,OAGN,IAAI+X,EAAMlB,QAAQ5V,GAEvB,OAAO2V,EAAIuD,cAAclZ,EAAOgZ,GAGpC,OAAO,GAoBTrD,EAAIwD,SAAW,CAAC5L,EAAS7M,EAAUV,EAAO0J,KAexC,GAbK,oBADLA,EAAUA,GAAW,MAEnBA,EAAQ0P,iBAAkB,GAEvB,iBAAkB1P,IACrBA,EAAQ2P,cAAe,GAEpB,mBAAoB3P,IACvBA,EAAQ4P,gBAAiB,GAEtB,iBAAkB5P,IACrBA,EAAQ6P,cAAe,GAGtB7P,EAAQ2P,aACT9L,EAAQ7M,GAAYV,OACf,GAAG8W,EAAMlB,QAAQ5V,GAAQ,CACV,IAAjBA,EAAMuD,QAAgBmG,EAAQ0P,kBAC9B7L,EAAQ3M,eAAeF,KACxB6M,EAAQ7M,GAAY,IAEnBgJ,EAAQ6P,eACTvZ,EAAQA,EAAMyN,OAAOF,EAAQ7M,IAC7B6M,EAAQ7M,GAAY,IAEtB,IAAI,IAAI3B,EAAI,EAAGA,EAAIiB,EAAMuD,SAAUxE,EACjC4W,EAAIwD,SAAS5L,EAAS7M,EAAUV,EAAMjB,GAAI2K,QAEvC,GAAG6D,EAAQ3M,eAAeF,GAAW,CAE1C,MAAMqY,GAAarP,EAAQ4P,gBACzB3D,EAAIoD,SAASxL,EAAS7M,EAAUV,GAG9B8W,EAAMlB,QAAQrI,EAAQ7M,KACtBqY,IAAYrP,EAAQ0P,kBACtB7L,EAAQ7M,GAAY,CAAC6M,EAAQ7M,KAI3BqY,IACCrP,EAAQ6P,aACThM,EAAQ7M,GAAUoI,QAAQ9I,GAE1BuN,EAAQ7M,GAAU+H,KAAKzI,SAK3BuN,EAAQ7M,GAAYgJ,EAAQ0P,gBAAkB,CAACpZ,GAASA,GAY5D2V,EAAI6D,UAAY,CAACjM,EAAS7M,IAAa,GAAG+M,OAAOF,EAAQ7M,IAAa,IAQtEiV,EAAI8D,eAAiB,CAAClM,EAAS7M,YACtB6M,EAAQ7M,IAajBiV,EAAI+D,YAAc,CAACnM,EAAS7M,EAAUV,EAAO0J,KAEtC,oBADLA,EAAUA,GAAW,MAEnBA,EAAQ0P,iBAAkB,GAI5B,MAAMO,EAAShE,EAAI6D,UAAUjM,EAAS7M,GAAUkZ,OAC9ChL,IAAM+G,EAAIuD,cAActK,EAAG5O,IAER,IAAlB2Z,EAAOpW,OACRoS,EAAI8D,eAAelM,EAAS7M,GACF,IAAlBiZ,EAAOpW,QAAiBmG,EAAQ0P,gBAGxC7L,EAAQ7M,GAAYiZ,EAFpBpM,EAAQ7M,GAAYiZ,EAAO,IAa/BhE,EAAIkE,kBAAoB,CAACC,EAAOpQ,IA2EhC,SAASqQ,EAAiBC,EAAQzP,GAChC,GAAGuM,EAAMlB,QAAQrL,GACf,IAAI,IAAIxL,EAAI,EAAGA,EAAIwL,EAAQhH,SAAUxE,EACnCwL,EAAQxL,GAAKgb,EAAiBC,EAAQzP,EAAQxL,SAE3C,GAAG8X,EAAWoC,OAAO1O,GAC1BA,EAAQ,SAAWwP,EAAiBC,EAAQzP,EAAQ,eAC/C,GAAGuM,EAAMV,SAAS7L,GAAU,CAE9BsM,EAAWvQ,YAAYiE,KACxBA,EAAQ,OAASyP,EAAO1F,MAAM/J,EAAQ,SAIxC,MAAM8L,EAAO5W,OAAO4W,KAAK9L,GAASe,OAClC,IAAI,IAAI2O,EAAK,EAAGA,EAAK5D,EAAK9S,SAAU0W,EAAI,CACtC,MAAM3Z,EAAM+V,EAAK4D,GACN,QAAR3Z,IACDiK,EAAQjK,GAAOyZ,EAAiBC,EAAQzP,EAAQjK,MAKtD,OAAOiK,EA/FAwP,EAFPrQ,EAAUA,GAAW,IACEsQ,QAAU,IAAIjD,EAAiB,OACtB+C,GAiBlCnE,EAAIuD,cAAgB,CAACgB,EAAIC,IAEpBD,IAAOC,OAKPtD,EAAWuD,QAAQF,KAAOrD,EAAWuD,QAAQD,IAC9CD,EAAG,YAAcC,EAAG,WACpBD,EAAG,WAAaC,EAAG,UACnBD,EAAG,eAAiBC,EAAG,cACvBD,EAAG,YAAcC,EAAG,eAKnBrD,EAAMV,SAAS8D,IACf,QAASA,GACVpD,EAAMV,SAAS+D,IACd,QAASA,IACHD,EAAG,SAAWC,EAAG,QAc5BxE,EAAI0E,qBAAuB,CAAC9O,EAAGC,IAC1BD,EAAEhI,OAASiI,EAAEjI,QACN,EAEPiI,EAAEjI,OAASgI,EAAEhI,OACP,EAENgI,IAAMC,EACA,EAEDD,EAAIC,GAAM,EAAI,G,2uDCnWxB,IAAM8O,EAAkB,iCAQxB,SAASC,EACPhG,EACAiG,EACAC,EACA1Z,GAEA,IAAI2Z,EAAKnG,EAAQoG,IAAIH,EAAMC,OAAM/M,GACjC,QAAKgN,IAILnG,EAAQqG,OAAOF,EAAI3Z,IACZ,GAIT,SAAS8Z,EACPtG,EACAiG,EACAC,EACA1Z,GAEA,IAAI+Z,EAAKvG,EAAQoG,SAAIjN,EAAW+M,EAAM1Z,GACtC,QAAK+Z,IAILvG,EAAQqG,OAAOE,EAAIN,IACZ,GAGT,SAASO,EACPxG,EACAiG,EACAC,EACA1Z,EACAyN,GAGI+F,EAAQyG,cACTzG,EAAgByG,aAAazG,EAASxT,EAAKyN,GAG9C,IAAI/L,EAAI8R,EAAQ0G,aAAa1G,EAAQ7D,GAAG3P,IACpCma,GAAO,EACX,GAAIzY,EACF,IAAK,IAAI1D,EAAI,EAAGA,EAAI0D,EAAEc,OAAQxE,IAC5Bmc,EAAOA,GAAQzY,EAAE1D,GAAGwV,EAASiG,EAAMC,EAAM1Z,EAAKyN,GAGlD,OAAO0M,E,IAMYC,E,gCAsDnB,WAAaC,GAAiD,MAAxBC,EAAwB,uDAAJ,GAAI,mBAC5D,mBAAM3N,OAAWA,OAAWA,OAAWA,EAAW2N,GADU,+jBAG5D,EAAKC,gBAAkB,GACvB,EAAKL,aAAe,GACpB,EAAKM,aAAe,GACpB,EAAKC,QAAU,GACf,EAAKC,cAAgB,GACrB,EAAKC,aAAe,GACpB,EAAKC,eAAiB,GACtB,EAAKC,YAAc,GACnB,EAAKC,SAAW,GAChB,EAAKC,MAAQ,CACX,EAAKJ,aACL,EAAKC,eACL,EAAKC,YACL,EAAKC,UAEP,EAAKE,WAAa,GAClB,EAAKX,SAAWA,GAAY,GAM5B,EAAKY,eAAiBX,EAAKW,gBAAkB1N,iBACzC+M,EAAKY,eACP,EAAKC,cAAgB,CAACb,EAAKY,eAG7B,EAAKE,oBAAoB,EAAKf,UA9B8B,E,sCA4C9D,SAA6ChM,GAC3C,IAAIgN,EAAiBlV,KAAKsJ,WAAWnD,KAAI,SAAUgP,GACjD,OAAQA,EAAiBC,WAAWlN,MAElCtC,EAAI,IAAIqO,EAEZ,OADArO,EAAE6K,IAAIyE,GACCtP,I,6BAOT,SAAgByP,GACTrV,KAAKgV,gBACRhV,KAAKgV,cAAgB,IAEvBhV,KAAKgV,cAAczT,KAAK8T,K,wBAU1B,SACEC,EAKAnZ,EACAoZ,GAEA,IACIC,EADAC,EAAWzV,KAEX0V,EAA2B,KAE/B,SAASC,EAASC,GAChB,GAAIN,EAAK,OAAY,CACnBE,EAAKF,EAAK,OAGNI,IAASF,EAAKA,EAAGJ,WAAWM,IAEhCF,EAAKA,EAAGlM,WACR,IAAIuM,EAAc,GACdC,EAAMN,EAAGrP,KAAI,SAAUC,GACzB,IAAI2P,EAAMN,EAASvP,mBAAmBE,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ4C,GAC3E,OAAmB,IAAf4Z,EAAI1Z,QAENwZ,EAAItU,KAAK6E,GACF,MAGA2P,EAAI,MAGf,GAAIF,EAAIxZ,OAGN,OAAOkZ,EAAc,6BAA+BM,EAAIzY,KAAK,WAE/D0Y,EAAI3P,KAAI,SAAUC,GAChBqP,EAASO,OAAO5P,MAGhBkP,EAAK,SAEPE,EAAKF,EAAK,OACNI,IAASF,EAAKA,EAAGJ,WAAWM,KAChCF,EAAKA,EAAGlM,YACLnD,KAAI,SAAUC,GACfA,EAAGyE,MAAQ1O,EACXsZ,EAAShF,IAAIrK,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,WAGzD+K,IAEF,GAAIN,EAAMW,MAAO,CAEf,IAAIC,EAAQ,IAAIC,IAAM,SACtBD,EAAME,IAAMd,EAAMW,MAClBC,EAAME,IAAI9M,WAAWnD,KAAI,SAAUC,GACjCA,EAAGyE,MAAQhC,oBAAU1M,EAAOrD,UAG9Bod,EAAMG,MAAO,EAEb,IAAIC,EAA4B,GAEhCb,EAASS,MACPA,GACA,SAAoBR,GACpBY,EAAc/U,KAAKmU,KAGnBD,EAASc,SACT,WACE,OAA6B,IAAzBD,EAAcja,OACTkZ,EAAc,gCAAkCD,EAAMW,OAE3DK,EAAcja,OAAS,EAClBkZ,EAAc,oCAEvBG,EAAUY,EAAc,QACxBX,EAAQJ,YAGZI,EAAQJ,K,gCASZ,SAAmBha,GAGjB,OAFKyE,KAAKwW,wBAAuBxW,KAAKwW,sBAAwB,IAC9DxW,KAAKwW,sBAAsBjV,KAAKhG,GACzBA,I,iCAMT,SAAoB2Y,GAElBlU,KAAKoU,gBAAgBpU,KAAKoJ,WAAWI,GAAGxJ,KAAKoJ,WAAWP,UAAU,qDAChE,CAAEgL,GAGA/J,YAAaoK,EAAU,WAAa,IACtClU,KAAKoU,gBAAgBpU,KAAKoJ,WAAWI,GAAGxJ,KAAKoJ,WAAWP,UAAhB,UAA6BuK,EAA7B,aAA0D,CAChG,SAAU/F,EAASiG,EAAMC,EAAM1Z,EAAKyN,GAGlC,OADA+F,EAAQqG,OAAOJ,EAAMzZ,IACd,KAITiQ,YAAaoK,EAAU,8BAAgC,IACzDlU,KAAK+T,aAAa/T,KAAKoJ,WAAWI,GAAGxJ,KAAKoJ,WAAWP,UAAhB,UAA6BuK,EAA7B,gCAA6E,CAChH,SAAU/F,EAASiG,EAAMC,EAAM1Z,EAAK4c,GAElC,OAAOpJ,EAAQqJ,kBAAkBpD,EAAMK,MAIzC7J,YAAaoK,EAAU,uBAAyB,IAClDlU,KAAK+T,aAAa/T,KAAKoJ,WAAWI,GAAGxJ,KAAKoJ,WAAWP,UAAhB,UAA6BuK,EAA7B,yBAAsE,CACzG,SAAU/F,EAASiG,EAAMqD,EAAM9c,EAAK4c,GAClC,OAAOpJ,EAAQqJ,kBAAkBpD,EAAMD,Q,0BAO/C,SAAcjN,GAEZ,OADApG,KAAKyQ,IAAIrK,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,OAC1C7K,KAAKsJ,WAAWjN,S,iBAazB,SACEiX,EACAC,EACA1Z,EACAyN,GAEA,IAAIzP,EAaA+e,EACAxQ,EAbJ,GAAyB,IAArByQ,UAAUxa,OAAc,CAC1B,GAAIiX,aAAgB3E,MAClB,IAAK9W,EAAI,EAAGA,EAAIyb,EAAKjX,OAAQxE,IAC3BmI,KAAKyQ,IAAI6C,EAAKzb,SAEPqH,YAAOoU,GAChBtT,KAAKyQ,IAAI6C,EAAKjN,QAASiN,EAAKhN,UAAWgN,EAAK/Z,OAAQ+Z,EAAKzI,OAChDlM,YAAQ2U,IACjBtT,KAAKyQ,IAAK6C,EAAahK,YAEzB,OAAOtJ,KAIJsH,IAEHA,EAAMtH,KAAKuW,QAAUvW,KAAKuW,QAAQO,QAAU9W,KAAKoJ,WAAWa,gBAE3C,iBAARqJ,IACTA,EAAOtT,KAAKoJ,WAAWP,UAAUyK,IAEnCC,EAAOrT,IAAKqL,UAAUgI,GACtB,IAAMwD,EAAU7W,IAAKqL,UAAU1R,GAE/B,GADAyN,EAAMpH,IAAKqL,UAAUjE,IAChBjI,YAAUiU,GACb,MAAM,IAAIzT,MAAM,iCAElB,IAAKP,YAAYiU,GACf,MAAM,IAAI1T,MAAJ,oBAAuB0T,EAAvB,6BAER,IAAKxU,YAAegY,GAClB,MAAM,IAAIlX,MAAJ,iBAAoBkX,EAApB,2BAER,IAAKvX,YAAQ8H,GACX,MAAM,IAAIzH,MAAM,2BAGdG,KAAKgX,mBAEPhX,KAAKgX,kBAAkBhX,KAAMuT,EAAMjM,GAGrC,IAAI2P,EAAWjX,KAAKwJ,GAAGxJ,KAAKkX,MAAM3D,IAE9BS,GAAO,EACX,GAFA4C,EAAU5W,KAAKoU,gBAAgB6C,GAI7B,IAAKpf,EAAI,EAAGA,EAAI+e,EAAQva,OAAQxE,IAC9Bmc,EAAOA,GAAQ4C,EAAQ/e,GAAGmI,KAAMsT,EAAMC,EAAMwD,EAASzP,GAGzD,GAAItH,KAAKmX,MAAM7D,EAAMC,EAAMwD,EAASzP,GAElC,OAAO,KAMT,IAAI8P,EAAO,CACTpX,KAAKwJ,GAAGxJ,KAAKkX,MAAM5D,IACnB2D,EACAjX,KAAKwJ,GAAGxJ,KAAKkX,MAAMH,IACnB/W,KAAKwJ,GAAGxJ,KAAKkX,MAAM5P,KAIrB,IADAlB,EAAKpG,KAAKoJ,WAAWQ,KAAK0J,EAAMC,EAAMwD,EAASzP,GAC1CzP,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACtB,IAAIwf,EAAKrX,KAAK4U,MAAM/c,GAChBiZ,EAAIsG,EAAKvf,GACRwf,EAAGvG,KACNuG,EAAGvG,GAAK,IAEVuG,EAAGvG,GAAGvP,KAAK6E,GAMb,GAFApG,KAAKsJ,WAAW/H,KAAK6E,GAEjBpG,KAAKgV,cAAe,WACChV,KAAKgV,eADN,IACtB,2BAA2C,KAAhCjT,EAAgC,QACzCA,EAASqE,IAFW,+BAMxB,OAAOA,I,mBAOT,SAAM0E,GACJ,IAAKA,EAEH,OAAOA,EAET,IAAMlF,EAAI5F,KAAKqU,aAAarU,KAAKwJ,GAAGsB,IACpC,GAAIlF,EACF,OAAOA,EAET,OAAQkF,EAAKhM,UACX,KAAK7E,IACH,OAAO,IAAI2Q,IAAUE,EAAKhS,OAC5B,KAAKuB,IACH,OAAOyQ,EACT,KAAK1Q,IACH,OAAO,IAAI8P,IACb,KAAK5P,IAEL,KAAKC,IACH,OAAOuQ,EACT,KAAK5Q,IACH,OAAO,IAAIoR,IAAQR,EAAKhS,MAAQgS,EAAmBqB,SAAWrB,EAAmBsB,UACnF,KAAKpS,IACH,OAAO,IAAIyF,IAAUqL,EAAKhS,OAC5B,KAAKqB,IACH,OAAO,IAAI6Q,IAASF,EAAKhS,OAC3B,QACE,MAAM,IAAI+G,MAAJ,qDAAwDiL,EAAKhM,c,mBAQzE,WACEkB,KAAKsX,mBAAmBtX,KAAKsJ,YAC7B,IAAK,IAAI3P,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAI0d,EAAKrX,KAAK4U,MAAMjb,GACpB,IAAK,IAAIP,KAAOie,EACVA,EAAG3d,eAAeN,IAEpB4G,KAAKsX,mBAAmBD,EAAGje,GAAMO,M,gCAWzC,SACEoc,EACAwB,QAEa/Q,IAAT+Q,IACFA,EAAO,GAKT,IAHA,IAEInR,EADAoR,EAAS,aADD,CAAC,UAAW,YAAa,SAAU,OACbD,GAAQ,UAEjCE,EAAI,EAAGA,EAAI1B,EAAI1Z,OAAQob,IAAK,CAanC,IAXA,IAAI3M,EAAO,EADX1E,EAAK2P,EAAI0B,IACOpR,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,OACjD6M,EAAgB,SAAUrT,EAAe9I,GAC3C,IAAK,IAAI1D,EAAI,EAAGA,EAAIwM,EAAEhI,OAAQxE,IAC5B,GAAIwM,EAAExM,GAAGwO,QAAQgB,OAAO9L,EAAE8K,UACxBhC,EAAExM,GAAGyO,UAAUe,OAAO9L,EAAE+K,YACxBjC,EAAExM,GAAG0B,OAAO8N,OAAO9L,EAAEhC,SACrB8K,EAAExM,GAAGyP,IAAID,OAAO9L,EAAEsP,OAClB,OAAO,GAIJlR,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIzB,EAAI8H,KAAKkX,MAAMpM,EAAKnR,IACpBmX,EAAI9Q,KAAKwJ,GAAGtR,GACX8H,KAAK4U,MAAMjb,GAAGmX,IAGZ4G,EAAc1X,KAAK4U,MAAMjb,GAAGmX,GAAI1K,GAKzC,IAAKsR,EAAc1X,KAAKsJ,WAAYlD,GAClC,MAAM,IAAIvG,MAAM,qCAAuCuG,EAAK,IAAMA,EAAGyE,MAAQ2M,M,mBAQnF,WACE,OAAOxX,O,0BAGT,SAAa2X,EAAUC,GAErB,OAAIrf,OAAOkB,UAAUC,eAAe1B,KAAK2f,EAAI,eACnCA,EAAYhR,YAAYiR,GAE9BhY,IAAW+X,EAAG7Y,UAAYc,IAAWgY,EAAG9Y,WAClC,EAENc,IAAW+X,EAAG7Y,UAAYc,IAAWgY,EAAG9Y,UACnC,EAEL6Y,EAAG7e,MAAQ8e,EAAG9e,OACR,EAEN6e,EAAG7e,MAAQ8e,EAAG9e,MACT,EAEF,I,oBAWT,SACE0H,EACArE,EACA0b,GAEKA,IAAOA,EAAQ,IACpB,IAAIC,EAAW9X,KAAKkG,mBAAmB1F,IACO,IAA1CsJ,YAAa+N,EAAO,kBACtBC,EAASvR,OAAOvG,KAAKkG,wBAAmBM,OAAWA,EAAWhG,IAEhE,IAAK,IAAI3I,EAAI,EAAGA,EAAIigB,EAASzb,OAAQxE,IAAK,CACxC,IAAIuO,EAAK0R,EAASjgB,GAClB,OAAQuO,EAAG7M,OAAOuF,UAChB,IAAK,YACHkB,KAAKyQ,IAAItU,EAAQiK,EAAGE,UAAWF,EAAG7M,QAClC,MACF,IAAK,UACL,IAAK,YAEL,IAAK,aAEHyG,KAAKyQ,IAAItU,EAAQiK,EAAGE,UAAWF,EAAG7M,OAAOwe,KAAK/X,QAEX,IAAnC8J,YAAa+N,EAAO,WACtB7X,KAAKgW,OAAO5P,M,oBAWlB,SAAO4R,EAAYC,GAIjB,IAAMN,EAAK3X,KAAKkX,MAAMc,GAChBJ,EAAK5X,KAAKkX,MAAMe,GAClB9f,EAAI6H,KAAK0G,aAAaiR,EAAIC,GAC9B,OAAKzf,IAKDA,EAAI,EACC6H,KAAKkY,YAAYN,EAAID,GAErB3X,KAAKkY,YAAYP,EAAIC,M,qBAShC,SAAQ1D,GACN,OAAO,IAAID,EAAeC,K,kBAa5B,WACE,OAAOlU,KAAKsJ,WAAWjN,S,mBAYzB,SACEgK,EACAC,EACA/M,EACAsR,GAEA,OAAO7K,KAAKkG,mBACVhG,IAAKqL,UAAUlF,GACfnG,IAAKqL,UAAUjF,GACfpG,IAAKqL,UAAUhS,GACf2G,IAAKqL,UAAUV,M,yBAQnB,SAAYjO,GACV,IAAIwa,EAAO,IAAMxa,EAAM,IACvB,QAAUoD,KAAKwU,aAAa4C,MAC1BpX,KAAK0U,YAAY0C,MACjBpX,KAAKyU,eAAe2C,K,4BAOxB,SAAexa,GACb,IAAKA,EAAK,OAAOoD,KAAKmY,QACtB,IAAI5c,EAAIyE,KAAKoY,IAAIxb,GAEjB,OAAOoD,KAAKqY,mBAAmB9c,K,+BAQjC,SACEgY,EACA+E,GAQA,IAAIlB,EAAOpX,KAAKwJ,GAAG+J,GACdvT,KAAKoU,gBAAgBgD,KACxBpX,KAAKoU,gBAAgBgD,GAAQ,IAE/BpX,KAAKoU,gBAAgBgD,GAAM7V,KAAK+W,GAIhC,IAFA,IAAIC,EAAYvY,KAAKkG,wBAAmBM,EAAW+M,OAAM/M,GACrDwN,GAAO,EACFnc,EAAI,EAAGA,EAAI0gB,EAAUlc,OAAQxE,IACpCmc,EAAOA,GAAQsE,EAAOtY,KAAMuY,EAAU1gB,GAAGwO,QAASkN,EAAMgF,EAAU1gB,GAAG0B,QAEvE,OAAOya,I,0BAQT,SAAapX,GACX,IAAIrB,EAAIyE,KAAKoY,IAAIxb,GAGjB,OAFKoD,KAAKwY,sBAAqBxY,KAAKwY,oBAAsB,IAC1DxY,KAAKwY,oBAAoBjX,KAAKhG,GACvBA,I,sBAIT,SAAUnD,GACR,OAAO,IAAI4S,IAAS5S,K,wBAQtB,SAAWqgB,GACT,IAAK,IAAI5gB,EAAI,GAAIA,IAAK,CACpB,IAAI+E,EAAM6b,EAAI3f,MAAQ,KAAOjB,EAC7B,IAAKmI,KAAK0Y,YAAY9b,GAAM,OAAOoD,KAAKoY,IAAIxb,M,mBAYhD,SACE+b,EACA5W,EACAwU,EACAqC,GAEA,OAAOC,IAAoB7gB,KAAKgI,KAAM2Y,EAAS5W,EAAUwU,EAASqC,K,uBAQpE,SAAUD,GACR,IAAIG,EAAsB,GAO1B,IAAI9E,GAAO,EAKX,GAHA2E,EAAQtC,MAAO,EAEfwC,IAAoB7gB,KAAKgI,KAAM2Y,GAV/B,SAAuBzQ,GACrB4Q,EAAQvX,KAAK2G,KASuC,MAPtD,WACE8L,GAAO,MAOJA,EACH,MAAM,IAAInU,MAAM,+CAElB,OAAOiZ,I,oBAOT,SAAO1S,GACL,GAAIA,aAAcuI,MAAO,CACvB,IAAK,IAAI9W,EAAI,EAAGA,EAAIuO,EAAG/J,OAAQxE,IAC7BmI,KAAKgW,OAAO5P,EAAGvO,IAEjB,OAAOmI,KAET,GAAIrB,YAAQyH,GACV,OAAOpG,KAAKgW,OAAO5P,EAAGkD,YAExB,IAAIyM,EAAM/V,KAAKkG,mBAAmBE,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,OAC1E,IAAKkL,EAAI1Z,OACP,MAAM,IAAIwD,MAAM,4CAA8CuG,GAGhE,OADApG,KAAK+Y,gBAAgBhD,EAAI,IAClB/V,O,4BAOT,SAAeyY,GAEb,IADA,IAAI1C,EAAc/V,KAAKkG,wBAAmBM,OAAWA,OAAWA,EAAWiS,GAAK3b,QACvEjF,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAC9BmI,KAAK+Y,gBAAgBhD,EAAIle,IAE3B,OAAOmI,O,wBAWT,SACEsT,EACAC,EACA1Z,EACAyN,EACA0R,GASA,IANA,IAAIjD,EAAM/V,KAAKkG,mBAAmBoN,EAAMC,EAAM1Z,EAAKyN,GAAK,GAKpDgC,EAAqB,GAChBzR,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAAKyR,EAAW/H,KAAKwU,EAAIle,IAEzD,IADImhB,IAAO1P,EAAaA,EAAWxM,MAAM,EAAGkc,IACvCnhB,EAAI,EAAGA,EAAIyR,EAAWjN,OAAQxE,IAAKmI,KAAKgW,OAAO1M,EAAWzR,M,2BAUjE,SACEwO,EACAC,EACA/M,EACAsR,GAKA,OAHA7K,KAAKiZ,iBACHjZ,KAAKkG,mBAAmBG,EAASC,EAAW/M,EAAQsR,IAE/C7K,O,6BAUT,SAAgBoG,GAGd,IADA,IAAI0E,EAAO,CAAE1E,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,OAC5ClR,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIzB,EAAI8H,KAAKkX,MAAMpM,EAAKnR,IACpBmX,EAAI9Q,KAAKwJ,GAAGtR,GACX8H,KAAK4U,MAAMjb,GAAGmX,IAGjB9Q,KAAK8U,eAAe9U,KAAK4U,MAAMjb,GAAGmX,GAAI1K,GAI1C,OADApG,KAAK8U,eAAe9U,KAAKsJ,WAAYlD,GAC9BpG,O,8BAOT,SAAiB+V,GACf,IAAK,IAAIle,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAC9BmI,KAAKgW,OAAOD,EAAIle,IAElB,OAAOmI,O,yBAMT,SAAakZ,EAAmBC,GAkB9B,IAhBA,IAAIC,EAAUpZ,KAAKwJ,GAAG0P,GAClBG,EAAUrZ,KAAKwJ,GAAG2P,GAClBG,EAAY,SAAUjC,GACxB,IAAIkC,EAAUlC,EAAG+B,GACjB,GAAKG,EAAL,CAGA,IAAIC,EAAUnC,EAAGgC,GAIfhC,EAAGgC,GAHAG,EAGWD,EAAQhT,OAAOiT,GAFfD,SAITlC,EAAG+B,KAGHvhB,EAAI,EAAGA,EAAI,EAAGA,IACrByhB,EAAUtZ,KAAK4U,MAAM/c,IAGvB,GADAmI,KAAKqU,aAAa+E,GAAWD,EACzBD,EAAIpgB,MAAO,CAMb,GAJKkH,KAAKsU,QAAQ+E,KAChBrZ,KAAKsU,QAAQ+E,GAAW,IAE1BrZ,KAAKsU,QAAQ+E,GAAS9X,KAAK2X,GACvBlZ,KAAKsU,QAAQ8E,GACf,IAAKvhB,EAAI,EAAGA,EAAImI,KAAKsU,QAAQ8E,GAAS/c,OAAQxE,IAC5CmI,KAAKqU,aAAarU,KAAKwJ,GAAGxJ,KAAKsU,QAAQ8E,GAASvhB,KAAOshB,EACvDnZ,KAAKsU,QAAQ+E,GAAS9X,KAAKvB,KAAKsU,QAAQ8E,GAASvhB,IAGrDmI,KAAKyQ,IAAI0I,EAAOnZ,KAAKoY,IAAI,uCAAwCc,GAE7DlZ,KAAKuW,SACPvW,KAAKuW,QAAQkD,WAAWP,EAAKC,GAMjC,OAHAG,EAAUtZ,KAAK+T,cACfuF,EAAUtZ,KAAKoU,kBAER,I,wBAOT,SAAW7Y,GACT,IAAI8I,EAAIrE,KAAKsU,QAAQtU,KAAKwJ,GAAGxJ,KAAKkX,MAAM3b,MAAQ,GAEhD,OADA8I,EAAE9C,KAAKvB,KAAKkX,MAAM3b,IACX8I,I,wBAQT,SAAW9I,EAAcqK,GACvB,GAAIrK,EAAE8L,OAAOzB,GACX,OAAO,EAET,IAAI8T,EAAK1Z,KAAKkX,MAAM3b,GAEpB,IAAKme,EAAI,OAAO,EAChB,IAAIC,EAAK3Z,KAAKkX,MAAMtR,GAEpB,QAAK+T,GACGD,EAAG5gB,QAAU6gB,EAAG7gB,Q,6BAG1B,SAAiB8gB,EAAgBjR,GAIhB,QAAXiR,GAAoB5Z,KAAK6U,WAAL,KAGG,OAAvB+E,EAAO9c,MAAM,EAAG,IAAsC,YAAvB8c,EAAO9c,MAAM,EAAG,KAGnDkD,KAAK6U,WAAW+E,GAAUjR,K,gCAa5B,SACE2K,EACAC,EACA1Z,EACAyN,EACAuS,GAGA,IAKIlgB,EACAmgB,EANA1D,EAAM,CAAE9C,EAAMC,EAAM1Z,EAAKyN,GACzByS,EAAkB,GAClB3C,EAAoB,GACpB4C,EAAiB,GACjB3c,EAAkB,GAGtB,IAAK1D,EAAI,EAAGA,EAAI,EAAGA,IACjBogB,EAAQpgB,GAAKqG,KAAKkX,MAAMhX,IAAKqL,UAAU6K,EAAIzc,KACtCogB,EAAQpgB,IAGX0D,EAAMkE,KAAK5H,GACXyd,EAAKzd,GAAKqG,KAAKwJ,GAAGuQ,EAAQpgB,KAH1BqgB,EAAKzY,KAAK5H,GAMd,GAAqB,IAAjB0D,EAAMhB,OACR,OAAO2D,KAAKsJ,WAEd,GAAqB,IAAjBjM,EAAMhB,OASR,OARA1C,EAAI0D,EAAM,IACVyc,EAAO9Z,KAAK4U,MAAMjb,GAAGyd,EAAKzd,MACdkgB,GACNC,EAAKzd,OAAS,IAChByd,EAAOA,EAAKhd,MAAM,EAAG,IAGzBgd,EAAOA,GAAQ,GAMjB,IACIG,EACApiB,EAFAqiB,EAAO,KAGX,IAAKriB,EAAI,EAAGA,EAAIwF,EAAMhB,OAAQxE,IAAK,CAGjC,GAFA8B,EAAI0D,EAAMxF,KACViiB,EAAO9Z,KAAK4U,MAAMjb,GAAGyd,EAAKzd,KAExB,MAAO,GAELmgB,EAAKzd,OAAS6d,IAChBA,EAAOJ,EAAKzd,OACZ4d,EAAQpiB,GASZ,IALA,IAAIsiB,EAAQ9c,EAAM4c,GACdG,EAAyBpa,KAAK4U,MAAMuF,GAAO/C,EAAK+C,IAChDE,EAAQhd,EAAMP,MAAM,EAAGmd,GAAO1T,OAAOlJ,EAAMP,MAAMmd,EAAQ,IACzDnB,EAAuB,GACvBwB,EAAQ,CAAE,UAAW,YAAa,SAAU,OACvC7C,EAAI,EAAGA,EAAI2C,EAAU/d,OAAQob,IAAK,CACzC,IAAIrR,EAAuBgU,EAAU3C,GAErC,IAAK5f,EAAI,EAAGA,EAAIwiB,EAAMhe,OAAQxE,IAE5B,GADA8B,EAAI0gB,EAAMxiB,IACLmI,KAAKkX,MAAM9Q,EAAGkU,EAAM3gB,KAAK0N,OAAO0S,EAAQpgB,IAAK,CAChDyM,EAAK,KACL,MAGJ,GAAU,MAANA,IACF0S,EAAQvX,KAAK6E,GACTyT,GAAS,MAGjB,OAAOf,I,kBAOT,SAAKhO,GACH,IAAIyP,EAAQva,KAAKkX,MAAMpM,GACnB0P,EAAQxa,KAAKsU,QAAQtU,KAAKwJ,GAAG+Q,IACjC,IAAKA,EAAMzhB,MAAO,MAAO,GACzB,IAAI2hB,EAAM,CAAEF,EAAMzhB,OAClB,GAAI0hB,EACF,IAAK,IAAI3iB,EAAI,EAAGA,EAAI2iB,EAAMne,OAAQxE,IAChC4iB,EAAIlZ,KAAKiZ,EAAM3iB,GAAG+E,KAGtB,OAAO6d,K,4BA56BT,WACE,OAAOC,Q,GA3FiCC,K,IAAvB1G,E,wBAygCrBA,EAAeJ,cAAgBA,G,6BChoC/Bzc,EAAOD,QAAU,cAA0B0I,MAQzC,YACE+a,EAAU,yCACVxiB,EAAO,eACPyiB,EAAU,IACVC,MAAMF,GACN5a,KAAK5H,KAAOA,EACZ4H,KAAK4a,QAAUA,EACf5a,KAAK6a,QAAUA,K,6BCfnB,MAAMjL,EAAQ,EAAQ,IAEhBnB,EAAM,GACZrX,EAAOD,QAAUsX,EASjBA,EAAIpP,UAAYwP,IAKd,GAAGe,EAAMV,SAASL,MACb,WAAYA,GAAO,SAAUA,GAAO,UAAWA,GAAK,CAEvD,OADiBtW,OAAO4W,KAAKN,GAAGxS,OACb,KAAO,QAASwS,GAErC,OAAO,GAUTJ,EAAIsM,mBAAqBlM,GAItBe,EAAMV,SAASL,IAAgC,IAA1BtW,OAAO4W,KAAKN,GAAGxS,QAAiB,QAASwS,EASjEJ,EAAIyE,QAAUrE,GAIZe,EAAMV,SAASL,IAAO,WAAYA,EASpCJ,EAAIsD,OAASlD,GAIXe,EAAMV,SAASL,IAAO,UAAWA,EAOnCJ,EAAIjP,QAAUqP,GAKLe,EAAMV,SAASL,IACpB,WAAYA,GAEmD,IAD/DtW,OAAO4W,KAAKN,GACT6D,OAAOtZ,GAAe,QAARA,GAAyB,WAARA,GAAkBiD,OAQxDoS,EAAIuM,cAAgBnM,GAKXJ,EAAIjP,QAAQqP,MAAQ,QAASA,GAUtCJ,EAAIrP,YAAcyP,KAKbe,EAAMV,SAASL,KACb,QAASA,EACyB,IAA3BA,EAAE,OAAOhS,QAAQ,MAEO,IAA1BtE,OAAO4W,KAAKN,GAAGxS,UAClB,WAAYwS,GAAO,SAAUA,GAAO,UAAWA,K,6BCnHxD,6CAIa6L,EAAkB,oBACC,IAAIjb,IAAUib,I,krBCiBvC,SAASnP,EAAsEzS,GACpF,OAAI,MAAOA,GAIP+F,YAAO/F,GAHFA,EAOL6V,MAAMD,QAAQ5V,GACT,IAAImiB,EAAcniB,GAGpBwS,IAAQC,UAAezS,G,IAQXmiB,E,gCAenB,WAAaC,GAAoC,yBAC/C,eAAOC,IAAgBzN,UAAU7F,YADc,sBAXXxN,KAWW,wBATpCuF,IAAWqb,YASyB,qBAR/B,GAQ+B,yBAPnCE,IAAgB1hB,UAAUkN,aAOS,sBAHjC,IAGiC,mBAFzC,GAKFuU,GAAWA,EAAQ7e,OAAS,GAC9B6e,EAAQxY,SAAQ,SAAAW,GACd,EAAKqI,SAASnK,KAAKgK,EAAalI,OALW,E,4BAUjD,WACE,OAAOrD,KAAKlH,O,IAGd,SAAeA,GACbkH,KAAKlH,MAAQA,I,oBAOf,SAAQuK,GACN,OAAOrD,KAAK0L,SAASnK,KAAK8B,K,mBAM5B,WAEE,OADArD,KAAKob,QAAS,EACPpb,KAAKob,S,mBAMd,WACE,OAAOpb,KAAK0L,SAAS2P,U,wBAOvB,SAAYnT,GAGV,OAAO,IAAI+S,EAFUjb,KAAK0L,SAASvF,KAAI,SAACgP,GAAD,OAAQA,EAAGC,WAAWlN,S,kBAK/D,WACE,OAAO+S,EAAW3S,KAAKtI,Q,sBAWzB,WACE,MAAO,IAAMA,KAAK0L,SAAStO,KAAK,KAAO,M,qBAOzC,SAASiG,GACP,OAAOrD,KAAK0L,SAAS9J,QAAQyB,M,mBAjB/B,SAAaiY,GACX,OAAOH,IAAgB3N,sBAAwB8N,EAAW9R,O,GArEpDtJ,K,IAFW+a,E,WAG0B5gB,M,6BCzC/C,MAAMuV,EAAQ,EAAQ,IAEhBnB,EAAM,GACZrX,EAAOD,QAAUsX,EAOjBA,EAAI8M,QAAU,CACZC,OAAQ,CAENrM,KAAM,CACJ,OAAQ,SAAU,YAAa,OAAQ,QAAS,YAGlDsM,MAAO,yEAETC,KAAM,CACJvM,KAAM,CACJ,OAAQ,WAAY,SAAU,YAAa,OAAQ,OAAQ,WAC3D,WAAY,OAAQ,OAAQ,YAAa,OAAQ,QAAS,YAG5DsM,MAAO,4IAGXhN,EAAIkN,MAAQ,CAAC5b,EAAK6b,KAChB,MAAMC,EAAS,GACTvjB,EAAImW,EAAI8M,QAAQK,GAAU,QAC1B3jB,EAAIK,EAAEmjB,MAAMte,KAAK4C,GACvB,IAAIlI,EAAIS,EAAE6W,KAAK9S,OACf,KAAMxE,KACJgkB,EAAOvjB,EAAE6W,KAAKtX,SAAgB2O,IAATvO,EAAEJ,GAAoB,KAAOI,EAAEJ,GAYtD,OARsB,UAAlBgkB,EAAOC,QAAsC,QAAhBD,EAAOE,MACnB,SAAlBF,EAAOC,QAAqC,OAAhBD,EAAOE,QACpCF,EAAOG,KAAOH,EAAOG,KAAKje,QAAQ,IAAM8d,EAAOE,KAAM,IACrDF,EAAOI,UAAYJ,EAAOI,UAAUle,QAAQ,IAAM8d,EAAOE,KAAM,IAC/DF,EAAOE,KAAO,MAGhBF,EAAOK,eAAiBzN,EAAI0N,kBAAkBN,EAAOle,MAC9Cke,GAWTpN,EAAI2N,YAAc,CAAC9e,EAAMoC,KAEvB,GAAY,OAATpC,EACD,OAAOoC,EAGT,GAAG+O,EAAI4N,WAAW3c,GAChB,OAAOA,EAILpC,IAAQsS,EAAMJ,SAASlS,KACzBA,EAAOmR,EAAIkN,MAAMre,GAAQ,KAI3B,MAAMgU,EAAM7C,EAAIkN,MAAMjc,GAGhB4c,EAAY,CAChBte,SAAUV,EAAKU,UAAY,IAG7B,GAAqB,OAAlBsT,EAAI2K,UACLK,EAAUL,UAAY3K,EAAI2K,UAC1BK,EAAU3e,KAAO2T,EAAI3T,KACrB2e,EAAUpG,MAAQ5E,EAAI4E,WAItB,GAFAoG,EAAUL,UAAY3e,EAAK2e,UAEX,KAAb3K,EAAI3T,KACL2e,EAAU3e,KAAOL,EAAKK,KACL,OAAd2T,EAAI4E,MACLoG,EAAUpG,MAAQ5E,EAAI4E,MAEtBoG,EAAUpG,MAAQ5Y,EAAK4Y,UAEpB,CACL,GAA6B,IAA1B5E,EAAI3T,KAAKd,QAAQ,KAElByf,EAAU3e,KAAO2T,EAAI3T,SAChB,CAEL,IAAIA,EAAOL,EAAKK,KAGhBA,EAAOA,EAAK4e,OAAO,EAAG5e,EAAKE,YAAY,KAAO,IAC1CF,EAAKtB,OAAS,GAAKiB,EAAK2e,YAAkC,MAApBte,EAAK4e,QAAQ,KACrD5e,GAAQ,KAEVA,GAAQ2T,EAAI3T,KAEZ2e,EAAU3e,KAAOA,EAEnB2e,EAAUpG,MAAQ5E,EAAI4E,MAIV,KAAb5E,EAAI3T,OAEL2e,EAAU3e,KAAO8Q,EAAI0N,kBAAkBG,EAAU3e,OAInD,IAAI0S,EAAOiM,EAAUte,SAiBrB,OAhB2B,OAAxBse,EAAUL,YACX5L,GAAQ,KAAOiM,EAAUL,WAE3B5L,GAAQiM,EAAU3e,KACK,OAApB2e,EAAUpG,QACX7F,GAAQ,IAAMiM,EAAUpG,OAEN,OAAjB5E,EAAIkL,WACLnM,GAAQ,IAAMiB,EAAIkL,UAIR,KAATnM,IACDA,EAAO,MAGFA,GAWT5B,EAAIgO,WAAa,CAACnf,EAAMoC,KAEtB,GAAY,OAATpC,EACD,OAAOoC,EAGLpC,IAAQsS,EAAMJ,SAASlS,KACzBA,EAAOmR,EAAIkN,MAAMre,GAAQ,KAI3B,IAAIrG,EAAO,GASX,GARiB,KAAdqG,EAAK0e,KACN/kB,IAASqG,EAAKU,UAAY,IAAM,MAAQV,EAAK2e,WAAa,IAClDvc,EAAI7C,QAAQ,QAEpB5F,GAAQ,MAIe,IAAtByI,EAAI7C,QAAQ5F,GACb,OAAOyI,EAIT,MAAM4R,EAAM7C,EAAIkN,MAAMjc,EAAI6c,OAAOtlB,EAAKoF,SAIhCqgB,EAAepf,EAAK4e,eAAejc,MAAM,KACzC0c,EAAcrL,EAAI4K,eAAejc,MAAM,KACvC2c,EAAQtL,EAAIkL,UAAYlL,EAAI4E,MAAS,EAAI,EAC/C,KAAMwG,EAAargB,OAAS,GAAKsgB,EAAYtgB,OAASugB,GACjDF,EAAa,KAAOC,EAAY,IAGnCD,EAAarB,QACbsB,EAAYtB,QAId,IAAIhL,EAAO,GACX,GAAGqM,EAAargB,OAAS,EAAG,CAG1BqgB,EAAajY,MACb,IAAI,IAAI5M,EAAI,EAAGA,EAAI6kB,EAAargB,SAAUxE,EACxCwY,GAAQ,MAoBZ,OAfAA,GAAQsM,EAAYvf,KAAK,KAGR,OAAdkU,EAAI4E,QACL7F,GAAQ,IAAMiB,EAAI4E,OAEA,OAAjB5E,EAAIkL,WACLnM,GAAQ,IAAMiB,EAAIkL,UAIR,KAATnM,IACDA,EAAO,MAGFA,GAQT5B,EAAI0N,kBAAoBxe,IAItB,GAAmB,IAAhBA,EAAKtB,OACN,MAAO,GAGT,MAAMuW,EAAQjV,EAAKsC,MAAM,KACnB4G,EAAS,GAEf,KAAM+L,EAAMvW,OAAS,GAAG,CACtB,MAAMwgB,EAAOjK,EAAMyI,QACbrH,EAAwB,IAAjBpB,EAAMvW,OAEP,MAATwgB,EAQS,OAATA,EASHhW,EAAOtF,KAAKsb,IARVhW,EAAOpC,MACJuP,GAEDnN,EAAOtF,KAAK,KAXXyS,GAEDnN,EAAOtF,KAAK,IAqBlB,MAHe,MAAZ5D,EAAK,IAAckJ,EAAOxK,OAAS,GAAmB,KAAdwK,EAAO,IAChDA,EAAOjF,QAAQ,IAEI,IAAlBiF,EAAOxK,QAA8B,KAAdwK,EAAO,GACxB,IAGFA,EAAOzJ,KAAK,MAOrB,MAAM0f,EAAkB,uCAWxBrO,EAAI4N,WAAaxN,GAAKe,EAAMJ,SAASX,IAAMiO,EAAgBhZ,KAAK+K,GAUhEJ,EAAIsO,WAAalO,GAAKe,EAAMJ,SAASX,I,iGC/RrC,IAAImO,EAES,SAAUzc,GACfA,EAASA,EAAOxC,QAAQ,QAAQ,MAGhC,IAFA,IAAIkf,EAAU,GAEL3jB,EAAI,EAAGA,EAAIiH,EAAOlE,OAAQ/C,IAAK,CAEpC,IAAIpB,EAAIqI,EAAO2c,WAAW5jB,GAEtBpB,EAAI,IACA+kB,GAAWjO,OAAOmO,aAAajlB,GAE9BA,EAAI,KAASA,EAAI,MAClB+kB,GAAWjO,OAAOmO,aAAcjlB,GAAK,EAAK,KAC1C+kB,GAAWjO,OAAOmO,aAAkB,GAAJjlB,EAAU,OAG1C+kB,GAAWjO,OAAOmO,aAAcjlB,GAAK,GAAM,KAC3C+kB,GAAWjO,OAAOmO,aAAejlB,GAAK,EAAK,GAAM,KACjD+kB,GAAWjO,OAAOmO,aAAkB,GAAJjlB,EAAU,MAKtD,OAAO+kB,GAiCXG,EAAW,sCAIXC,EAAgB,SAASC,GAAW,OAAOA,GAE3CC,EAAe,SAASD,GAAW,OAAOA,GAE1CE,EAAe,SAASC,GACxB,GAAIA,EAAYphB,OAAS,EAC5B,KAAM,0CACH,MAAO,IAGPqhB,EAAc,SAAS9jB,GAAK,OAAOA,EAAEyC,QAErCshB,EAAgB,SAAS5d,EAAKlI,EAAG4f,GACjC,QAAwB,IAAb1X,EAAIjD,MACX,KAAM,wCAAwCiD,EAAI,YAA5C,IAAgEA,GAC1E,YAAiB,IAAL0X,GAA0B,MAAJA,EAAkB1X,EAAIjD,MAAMjF,GACvDkI,EAAIjD,MAAMjF,EAAG4f,IAEpBmG,EAAgB/d,MAAM,8BAEtBge,EAAmB,SAASP,GAO5B,OANAtd,KAAK4c,KAAO,EACZ5c,KAAK8d,GAAKR,EACVtd,KAAK6c,KAAO,WACf,GAAI7c,KAAK4c,MAAQ5c,KAAK8d,GAAGzhB,OAAQ,MAAMuhB,EACvC,OAAO5d,KAAK8d,GAAG9d,KAAK4c,SAEV5c,MAOP+d,EAAc,SAAShe,EAAKnG,GAC5B,OAAOmG,EAAIlD,QAAQjD,IAGnBokB,EAAc,SAASC,EAAWC,GAClC,IAAID,EAAJ,CACA,GAAIC,EAAM,KAAM,4BAA4BA,EAC5C,KAAM,+BASVlP,OAAOvV,UAAU0kB,OAAS,SAASC,GAC/B,GAAgB,SAAZA,EAAqB,KAAM,oCAC/B,OAAOpB,EAAYhd,OAEvBgP,OAAOvV,UAAU4kB,OAAS,SAASD,GAC/B,GAAgB,SAAZA,EAAqB,KAAM,oCAE/B,OAAOpe,MAKX,IAAIse,EAAe,SAAShhB,EAAMD,GAC9B,OAAOmR,OAASnR,EAAOC,IAsD3B,IAUIihB,EAAmBC,0CAOnBC,GAJM,IAAIhgB,OAAO,6BAA8B,KACzC,IAAIA,OAAO,uBAAwB,KACpC,IAAIA,OAAO,WAAY,KACX,IAAIA,OAAO,eAAgB,KAC5B,IAAIA,OAAO,4CAA6C,MACxEigB,EAAkB,IAAIjgB,OAAO,oGAG7BkgB,GADc,IAAIlgB,OAAO,UAAW,KACtB,IAAIA,OAAO,kBAAoB,MAC7CmgB,EAAW,IAAIngB,OAAO,gCAAiC,KAM5CogB,IAJf,SAA0BC,EAAOC,EAAaC,EAASC,EAASC,EAAWC,EAAStH,EAAOvQ,GACvF,OAAO,IAAI8X,EAAWN,EAAOC,EAAaC,EAASC,EAASC,EAAWC,EAAStH,EAAOvQ,IAKpF,IAAM8X,EAAb,WACI,WAAYN,EAAOC,EAAaC,EAASC,EAASC,EAAWC,EAAStH,EAAOvQ,GAAK,iBACpD,IAAfyX,IAA4BA,EAAY,WAC7B,IAAXC,IAAwBA,EAAQ,SACrB,IAAXC,IAAwBA,EAAQ,WACnB,IAAbC,IAA0BA,EAAU,SACzB,IAAXC,IAAwBA,EAAQ,WACvB,IAATtH,IAAsBA,EAAM,SACrB,IAAPvQ,IAAoBA,EAAI,MAKnCtH,KAAKqf,UAAY,IAAI7B,EAAa,IAClCxd,KAAKsf,OAASzH,EACE,IAAXmH,IACDhB,EAAagB,EAAQniB,QAAQ,MAAQ,EAAO,8BAAgCmiB,GAC5Ehf,KAAKqf,UAAU,IAAWL,EAAU,KAExChf,KAAKuf,OAAST,EACVI,GACAJ,EAAMU,aAAaN,GAEvBlf,KAAKyf,SAAWT,EAChBhf,KAAKgE,OAAS8a,EAAM1G,IAAI4G,GACxBhf,KAAK4H,MAAQ,EACb5H,KAAK0f,eAAiB,EACtB1f,KAAK2f,YAAc,EACnB3f,KAAK4f,aAAe,EACpB5f,KAAK6f,WAAaX,EAClBlf,KAAK8f,SAAW,IAAIvC,EAAa,CAAC,IAAK,OAAQ,OAAQ,MAAO,KAAM,KAAM,OAAQ,UAClFvd,KAAK+f,YAAc,EACnB/f,KAAKggB,gBAAkB,IAAIxC,EAAa,IACxCxd,KAAKigB,WAAa,IAAIzC,EAAa,IACnCxd,KAAKkgB,iBAAmB,IAAI1C,EAAa,IACzCxd,KAAKmgB,QAAU7Y,EACftH,KAAKogB,SAAW,KAKZpgB,KAAKqgB,SADLpB,IAIID,GAIgB,MAGxBhB,GAAche,KAAKqgB,UAAcrgB,KAAKqgB,SAASxjB,QAAQ,MAAQ,GACzDmD,KAAK6f,aACH7f,KAAKyf,SACLzf,KAAK6f,WAAgB7f,KAAKyf,SAAW,MAGrCzf,KAAK6f,WAAaS,qBAGN,MAAfvB,EACG/e,KAAKyf,SACLzf,KAAKugB,SAAWzB,EAAMzR,QAAW2R,EAAU,aAG3Chf,KAAKugB,SAAWzB,EAAMzR,UAI1BrN,KAAKugB,SAAWxB,EAEpB/e,KAAKwgB,SAAWxgB,KAAKugB,SACrBvgB,KAAKygB,eAAiB,KAxE9B,gCA4EI,SAAK5oB,GACD,OAAmBmI,KAAK6f,WAAa,KAAU7f,KAAK4H,MAAW,KAAe/P,EAAImI,KAAK2f,YAAiB,KA7EhH,qBA+EI,WACI,OAAO3f,KAAKugB,WAhFpB,wBAkFI,SAAWG,GACP,OAAO1gB,KAAK2gB,QAAQD,EAAOE,UAnFnC,qBAqFI,SAAQC,GAMJ,OAFA7gB,KAAK8gB,WACL9gB,KAAK+gB,KAAKF,GACH7gB,KAAKghB,WA3FpB,kBA6FI,SAAKC,GAYD,IAFA,IAAIlhB,EAAMkhB,EAAO5C,OAAO,SACpBxmB,EAAI,EACAA,GAAK,GAAI,CACb,IAAI4f,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,GAC5B,GAAK4f,EAAI,EACL,OAGJ,IADI5f,EAAImI,KAAKmhB,qBAAqBphB,EAAK0X,IAC9B,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,sCAhHnE,kCAoHI,SAAqB1X,EAAK+Q,GACtB,IAQI2G,EARA5f,EAAImI,KAAKkhB,UAAUnhB,EAAK+Q,GAC5B,OAAKjZ,EAAI,EACEA,GAEP4f,EAAIzX,KAAKqhB,UAAUthB,EAAKlI,KAClB,IAGN4f,EAAIzX,KAAKshB,UAAUvhB,EAAKlI,KAClB,EAHCmI,KAAKuhB,SAASxhB,EAAK0X,GAMvBA,IAjIf,iBAmII,SAAI+J,EAAKzhB,EAAKlI,GAKV,GAAmC,KAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAClBA,EAAOA,EAAI,OAGf,GAAKiS,YAAa9J,KAAK8f,SAAS0B,GAAO,EACnC,OAAQ,EAGhB,IAAItjB,EAAOrG,EAAI6lB,EAAY8D,GAC3B,OAAKzhB,EAAIjD,MAAOjF,EAAGqG,IAAMsjB,GAtKZ,yCAsKoC3kB,QAAQkD,EAAIiI,OAAO9J,KAAO,EAChEA,GAGC,IArJpB,uBAwJI,SAAU6B,EAAKlI,GAEX,IADI4f,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAO4f,EAEX,IAAIgD,EAAM,IAAI8C,EAAa,IAE3B,IADI9F,EAAIzX,KAAKwhB,IAAI,OAAQzhB,EAAKlI,IACrB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,yCAGvD,IADI4f,EAAIzX,KAAKwhB,IAAI,WAAYzhB,EAAKlI,IACzB,EAAI,CAET,IADIA,EAAImI,KAAKyhB,mBAAmB1hB,EAAK0X,EAAGgD,GAAK,IACpC,EACL,MAAM2G,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,mDAMvD,OAJAmI,KAAK0hB,YAAY/D,EAAclD,EAAK,KAAM,OAInC5iB,EAGX,IADI4f,EAAIzX,KAAKwhB,IAAI,SAAUzhB,EAAKlI,IACvB,EAAI,CAET,IADIA,EAAImI,KAAKyhB,mBAAmB1hB,EAAK0X,EAAGgD,GAAK,IACpC,EACL,MAAM2G,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,mCAGvD,IAAI8pB,EAAM,IAAI9D,EAAiBpD,GAC/B,IACI,OAAa,CACT,IAAIlf,EAAIomB,EAAI9E,QAGR/S,YAAa9J,KAAKigB,WAAW1kB,GAAK,GAAMuO,YAAa9J,KAAKkgB,iBAAiB3kB,IAAM,KACjFyE,KAAKigB,WAAW1kB,GAAOyE,KAAKwgB,SAASoB,aAAarmB,KAI5D,MAAOmM,GACL,GAAIA,GAAKkW,EACL,MAAMlW,EAId,OAAO7P,EAGX,IADI4f,EAAIzX,KAAKwhB,IAAI,UAAWzhB,EAAKlI,IACxB,EAAI,CAET,IADIA,EAAImI,KAAKyhB,mBAAmB1hB,EAAK0X,EAAGgD,EAAKza,KAAK6hB,WACzC,EACL,MAAMT,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,oCAGnD8pB,EAAM,IAAI9D,EAAiBpD,GAC/B,IACI,OAAa,CACLlf,EAAIomB,EAAI9E,OAGZ7c,KAAKwgB,SAASnI,mBAAmB9c,IAGvC,MAAOmM,GACL,GAAIA,GAAKkW,EACL,MAAMlW,EAId,OAAO7P,EAGX,IADI4f,EAAIzX,KAAKwhB,IAAI,SAAUzhB,EAAKlI,KACtB,EAAI,CACV,IAKI4f,EALA1e,EAAI,IAAIwkB,EAAa,IAEzB,IADI1lB,EAAImI,KAAK8hB,MAAM/hB,EAAK0X,EAAG1e,IAClB,EACL,MAAMqoB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,gCAGvD,IADIA,EAAIzX,KAAK6hB,SAAS9hB,EAAKlI,EAAGkB,IACrB,EACL,MAAMqoB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,2CAEvD,IAAIqB,EAAKH,EAAE,GAAG6D,IACd,GAAIoD,KAAKqgB,SACDnnB,EAAKolB,EAAate,KAAKqgB,SAAUnnB,QAGrC8kB,EAAa9kB,EAAG2D,QAAQ,MAAQ,EAAI,uDAMxC,OAJAmhB,EAAa9kB,EAAG2D,QAAQ,MAAQ,GAChCmD,KAAKqf,UAAUtmB,EAAE,GAAG,IAAQG,EAE5B8G,KAAK3G,KAAKN,EAAE,GAAG,GA1c3B,SAAiBgH,GACf,OAAOgiB,UAAUhiB,GAycYiiB,CAAO9oB,IACnBue,EAGX,IADIA,EAAIzX,KAAKwhB,IAAI,OAAQzhB,EAAKlI,KACpB,EAAI,CACNkB,EAAI,IAAIwkB,EAAa,IAEzB,IADI1lB,EAAImI,KAAK6hB,SAAS9hB,EAAK0X,EAAG1e,IACrB,EACL,MAAMqoB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,+BAEnDve,EAAKH,EAAE,GAAG6D,IACd,IAAIoD,KAAKqgB,SAIL,MAAMe,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAS,iEAAmEve,EAAQ,KAHhIA,EAAKolB,EAAate,KAAKqgB,SAAUnnB,GAOzC,OAFA8kB,EAAa9kB,EAAG2D,QAAQ,MAAQ,GAChCmD,KAAKqgB,SAAWnnB,EACTrB,EAEX,OAAQ,IA1QhB,kBA4QI,SAAKoqB,EAAIrlB,GACM,IAANqlB,GAGDjiB,KAAKuf,OAAO2C,gBAAgBD,EAAIrlB,KAhR5C,yBAmRI,SAAYsB,GAIE,MAALA,EACD8B,KAAK+f,YAAc,GAGnB/f,KAAK8f,SAAW5hB,EAChB8B,KAAK+f,YAAc,KA5R/B,sBA+RI,cA/RJ,oBAiSI,WAII,OAAO/f,KAAKugB,WArSpB,2BAuSI,SAAc3W,GACVA,EAAK,GAAG6G,IAAI7G,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAI5J,KAAKgE,QAC5ChE,KAAK0f,gBAAkB,IAzS/B,uBA2SI,SAAU3f,EAAKlI,GACX,IAAIc,EAAI,IAAI4kB,EAAa,IAEzB,IADI1lB,EAAImI,KAAKzG,OAAOwG,EAAKlI,EAAGc,IACnB,EACL,OAAOd,EAEX,IAAI4f,EAAIzX,KAAKmiB,cAAcpiB,EAAKlI,EAAGc,EAAE,IACrC,GAAK8e,EAAI,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,yBAEvD,OAAO4f,IArTf,qBAuTI,SAAQ1X,EAAKlI,EAAG4iB,GACZ,OAAOza,KAAKgK,KAAKjK,EAAKlI,EAAG4iB,KAxTjC,kBA0TI,SAAK1a,EAAKlI,EAAG4iB,GAYT,IADIhD,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAO4f,EAEX,IAAI9e,EAAI,IAAI4kB,EAAa,IAEzB,IADI9F,EAAIzX,KAAKwhB,IAAI,MAAOzhB,EAAKlI,KACnB,EAAI,CAEV,IADIA,EAAImI,KAAKoiB,KAAKriB,EAAK0X,EAAG9e,IACjB,EACL,MAAMyoB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,iCAGvD,OADAgD,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAM1kB,EAAE,MAC7Bd,EAGX,IADI4f,EAAIzX,KAAKwhB,IAAI,KAAMzhB,EAAKlI,KAClB,EAAI,CAEV,IADIA,EAAImI,KAAKoiB,KAAKriB,EAAK0X,EAAG9e,IACjB,EACL,MAAMyoB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,kCAGvD,IADIA,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,mDAGvD,IACI4f,EADA5f,EAAI4f,EAER,IADIA,EAAIzX,KAAKwhB,IAAI,KAAMzhB,EAAKlI,IACnB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,mCAGvD,OADA4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAM1kB,EAAE,MAC7B8e,EAGX,IADIA,EAAIzX,KAAKwhB,IAAI,IAAKzhB,EAAKlI,KACjB,EAEN,OADA4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAMrd,KAAKuf,OAAOnH,IAjbvC,sDAkbAX,EAEX,GAAmC,MAA9B1X,EAAIjD,MAAOjF,EAAMA,EAAI,GAEtB,OADA4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAMrd,KAAKuf,OAAOnH,IAAOgF,EAAW,cACtDvlB,EAAI,EAElB,GAAmC,KAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GACtB,MAA6C,KAAxCkI,EAAIjD,MAAUjF,EAAI,EAASA,EAAI,IAChC4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAMrd,KAAKuf,OAAOnH,IAAOgF,EAAW,cACtDvlB,EAAI,IAElB4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAMrd,KAAKuf,OAAOnH,IA5bpC,2CA6bAvgB,EAAI,GAElB,GAAmC,MAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAEtB,OADA4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAASD,EAAW,aACtCvlB,EAAI,EAGlB,IADI4f,EAAIzX,KAAKoiB,KAAKriB,EAAKlI,EAAGc,KAChB,EAEN,OADA8hB,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,KAAM1kB,EAAE,MAC7B8e,EAEX,GAAmC,MAA9B1X,EAAIjD,MAAOjF,EAAMA,EAAI,IAAiD,MAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAC9D,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,iCAEvD,OAAQ,IAnYhB,kBAqYI,SAAK1X,EAAKlI,EAAG4iB,GACT,OAAOza,KAAKgK,KAAKjK,EAAKlI,EAAG4iB,KAtYjC,kBAwYI,SAAK1a,EAAKlI,EAAG4iB,GACT,OAAOza,KAAKrC,KAAKoC,EAAKlI,EAAG4iB,KAzYjC,uBA2YI,SAAU7d,GACN,OAAOoD,KAAKwgB,SAASrI,MAAMvb,EAAKoD,KAAKogB,YA5Y7C,kBA8YI,SAAKrgB,EAAKlI,EAAG4iB,GAMT,IADIhD,EAAIzX,KAAKqiB,cAActiB,EAAKlI,EAAG4iB,IAC1B,EACL,OAAOhD,EAEX,KAAQ,MAAM5a,QAAQkD,EAAIjD,MAAO2a,EAAMA,EAAI,KAAU,GAAI,CACrD,IAAI6K,EAAKviB,EAAIjD,MAAO2a,EAAMA,EAAI,GAC9B,GAAW,KAAN6K,EAAY,CACb,IAAIC,EAAQxiB,EAAIjD,MAAU2a,EAAI,EAASA,EAAI,GAC3C,IAAM8K,GAAWhE,EAAc1hB,QAAQ0lB,IAAU,GAAO,SAAS1lB,QAAQ0lB,GAAS,EAC9E,MAGR,IAEI9K,EAFAnE,EAAOmH,EAAIhW,MACX5K,EAAMmG,KAAK6J,UAAU7J,KAAKwiB,KAAK/K,IAEnC,IADIA,EAAIzX,KAAKuC,KAAKxC,EAAQ0X,EAAI,EAAMgD,IAC3B,EACL,MAAM2G,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,sCAEvD,IAAIlE,EAAOkH,EAAIhW,MACJ,KAAN6d,EACDtiB,KAAKyiB,cAAc,IAAIpF,EAAc,CAACrd,KAAKwgB,SAAUjN,EAAM1Z,EAAKyZ,KAGhEtT,KAAKyiB,cAAc,IAAIpF,EAAc,CAACrd,KAAKwgB,SAAUjN,EAAMD,EAAMzZ,KAErE4gB,EAAIlZ,KAAK1H,GAEb,OAAO4d,IA9af,2BAgbI,SAAc3O,GAKV,GADIgC,EAAO9K,KAAKggB,gBAAgBlX,GAE5B,OAAOgC,EAEX,IAAIA,EAAO9K,KAAKuf,OAAOpH,MAAMrP,GAG7B,OADA9I,KAAKggB,gBAAgBlX,GAAQgC,EACtBA,IA3bf,kBA6bI,SAAK/K,EAAKlI,EAAG4iB,EAAKiI,QACe,IAAlBA,IAA+BA,EAAe,MAOzD,IAAIpP,EAAOoP,EAEX,IADIjL,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAO4f,EAEP5f,EAAI4f,EAAR,IACI6K,EAAKviB,EAAIjD,MAAOjF,EAAMA,EAAI,GAC9B,GAAW,KAANyqB,EAAY,CACb,IAAIK,EAAU3iB,KAAKwiB,KAAK3qB,GAExB,IADI4f,EAAIzX,KAAKkhB,UAAUnhB,EAAQlI,EAAI,IAC1B,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,iBAEvD,GAAmC,KAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GAAe,CACrC,IAAI5f,EAAO4f,EAAI,EACXmL,EAAO,IAAIrF,EAAa,IAG5B,MAFI9F,EAAIzX,KAAK6iB,WAAW9iB,EAAKlI,EAAG+qB,KAEtB,GA6BN,MAAMxB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,iCA5B/Cyb,EAAOsP,EAAK,GAChB,GAAKlF,EAAYkF,GAAQ,EAAI,CAEzB,IAAIE,EAAQ,IAAIjF,EAAiB+E,GACjC,IACI,OAAa,CACT,IAAI/oB,EAAMipB,EAAMjG,OAGhB7c,KAAKyiB,cAAc,IAAIpF,EAAc,CAACrd,KAAKwgB,SAAUxgB,KAAKuf,OAAOnH,IAziB3E,wCAyiBiG9E,EAAMzZ,MAGnG,MAAO6N,GACL,GAAIA,GAAKkW,EACL,MAAMlW,GAMlB,IADI+P,EAAIzX,KAAKkhB,UAAUnhB,EAAK0X,IACnB,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,2CAEvD,GAAmC,KAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,IAAIA,EAAOA,EAAI,EAO3B,GAAa,MAARnE,EACGA,EAAOtT,KAAK6J,UAAU8Y,GAG9B,IADI9qB,EAAImI,KAAKmiB,cAAcpiB,EAAK0X,EAAGnE,IAC1B,EACL,MAAM8N,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,0BAGvD,IADIA,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,gDAEvD,GAAmC,KAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,gBAGvD,OADAgD,EAAIlZ,KAAK+R,GACCmE,EAAI,EAElB,GAAW,KAAN6K,EAAY,CAEb,GAAY,KADFviB,EAAIjD,MAAUjF,EAAI,EAASA,EAAI,GACvB,CAKd,IAHA,IAAI4f,GADJ5f,GAAK,GACU,EACXkrB,EAAS,IAAIxF,EAAa,IAC1ByF,GAAY,IACN,CAEN,IADInrB,EAAImI,KAAKkhB,UAAUnhB,EAAK0X,IACnB,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,2BAEvD,GAAmC,MAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAAgB,CACtC,IAAI4f,EAAO5f,EAAI,EACf,MAEJ,GAAMmrB,EASEA,GAAY,MATF,CACd,GAAmC,KAA9BjjB,EAAIjD,MAAOjF,EAAMA,EAAI,GAItB,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,iBAHnDA,GAAK,EASb,IAAImS,EAAO,IAAIuT,EAAa,IAE5B,IADI9F,EAAIzX,KAAKgK,KAAKjK,EAAKlI,EAAGmS,IACjB,EACL,MAAMoX,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,gCAEvDkrB,EAAOxhB,KAAKyI,EAAK,IAGrB,OADAyQ,EAAIlZ,KAAKvB,KAAKuf,OAAO0D,OAAOF,EAAQ/iB,KAAKwgB,WAClC/I,EAGP,IAAIA,EAAO5f,EAAI,EACXqrB,EAAmBljB,KAAKygB,eAC5BzgB,KAAKygB,eAAiBzgB,KAAKwgB,SAC3B,IAAI2C,EAAuBnjB,KAAKggB,gBAC5BoD,EAAuBpjB,KAAKkgB,iBAChClgB,KAAKkgB,iBAAmBlgB,KAAKigB,WAC7BjgB,KAAKggB,gBAAkB,IAAIxC,EAAa,IACxCxd,KAAKigB,WAAajgB,KAAKigB,WAAWnjB,QAClC,IAAIumB,EAAUrjB,KAAKogB,SAEnB,GADApgB,KAAKogB,SAxoBM,KAyoBE,MAAR9M,EACGA,EAAOtT,KAAKuf,OAAOlS,UAG3B,IADArN,KAAKwgB,SAAWlN,IACN,CAEN,IADIzb,EAAImI,KAAKkhB,UAAUnhB,EAAK0X,IACnB,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,0BAEvD,GAAmC,KAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAAe,CACrC,IAAI4f,EAAO5f,EAAI,EACf,MAGJ,IADI4f,EAAIzX,KAAKmhB,qBAAqBphB,EAAKlI,IAC9B,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,6BAU3D,OAPAmI,KAAKggB,gBAAkBmD,EACvBnjB,KAAKigB,WAAajgB,KAAKkgB,iBACvBlgB,KAAKkgB,iBAAmBkD,EACxBpjB,KAAKwgB,SAAWxgB,KAAKygB,eACrBzgB,KAAKogB,SAAWiD,EAChBrjB,KAAKygB,eAAiByC,EACtBzI,EAAIlZ,KAAK+R,EAAKgQ,SACP7L,EAGf,GAAW,KAAN6K,EAAY,CACb,IAAIiB,EAAavjB,KAAKuf,OAAOzF,KAE7B,GAAY,KADF/Z,EAAIjD,MAAUjF,EAAI,EAASA,EAAI,GACvB,CACV0rB,EAAavjB,KAAKuf,OAAO0D,OAC7BprB,GAAK,EAIT,IAFI4f,EAAO5f,EAAI,EACXkrB,EAAS,IAAIxF,EAAa,MACpB,CAEN,IADI1lB,EAAImI,KAAKkhB,UAAUnhB,EAAK0X,IACnB,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,0BAEvD,GAAmC,KAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GAAe,CACjC4f,EAAO5f,EAAI,EACf,MAEAmS,EAAO,IAAIuT,EAAa,IAE5B,IADI9F,EAAIzX,KAAKgK,KAAKjK,EAAKlI,EAAGmS,IACjB,EACL,MAAMoX,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,gCAEvDkrB,EAAOxhB,KAAKyI,EAAK,IAGrB,OADAyQ,EAAIlZ,KAAKgiB,EAAWR,EAAQ/iB,KAAKwgB,WAC1B/I,EAGX,IADIA,EAAIzX,KAAKwhB,IAAI,OAAQzhB,EAAKlI,KACpB,EACN,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,yEAKvD,IADI4f,EAAIzX,KAAKwhB,IAAI,OAAQzhB,EAAKlI,KACpB,EAEN,OADA4iB,EAAIlZ,MAAK,GACFkW,EAGX,IADIA,EAAIzX,KAAKwhB,IAAI,QAASzhB,EAAKlI,KACrB,EAEN,OADA4iB,EAAIlZ,MAAK,GACFkW,EAEX,GAAa,MAARnE,IACGmE,EAAIzX,KAAK6hB,SAAS9hB,EAAKlI,EAAG4iB,KACpB,EACN,OAAOhD,EAGf,OAAQ,IAtoBhB,2BAwoBI,SAAc1X,EAAKlI,EAAGyb,GAMlB,OAAU,CAEN,IADImE,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,iDAGvD,GAAmC,MAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GAA1B,CAUI5f,EAAI4f,EAAR,IACI5I,EAAI,IAAI0O,EAAa,IAEzB,IADI9F,EAAIzX,KAAKwjB,KAAKzjB,EAAKlI,EAAGgX,KAChB,EACN,OAAOhX,EAEX,IAAI+qB,EAAO,IAAIrF,EAAa,IAE5B,IADI1lB,EAAImI,KAAK6iB,WAAW9iB,EAAK0X,EAAGmL,IACvB,EACL,MAAMxB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,uBAGvD,IAAIqL,EAAQ,IAAIjF,EAAiB+E,GACjC,IACI,OAAa,CACT,IAAI/oB,EAAMipB,EAAMjG,OAGZ4G,EAAY5U,EAAE,GACd6U,EAAMD,EAAU,GAChBrL,EAAMqL,EAAU,GACR,MAAPC,EACD1jB,KAAKyiB,cAAc,IAAIpF,EAAc,CAACrd,KAAKwgB,SAAUpI,EAAK9E,EAAMzZ,KAGhEmG,KAAKyiB,cAAc,IAAIpF,EAAc,CAACrd,KAAKwgB,SAAUpI,EAAKve,EAAKyZ,MAIzE,MAAO5L,GACL,GAAIA,GAAKkW,EACL,MAAMlW,EAKd,IADI+P,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,gCAGvD,GAAmC,KAA9B1X,EAAIjD,MAAOjF,EAAMA,EAAI,GACtB,OAAOA,EAEPA,EAAOA,EAAI,MArDf,CACI,IAEI4f,EAFA5f,EAAO4f,EAAI,EACXgD,EAAM,IAAI8C,EAAa,IAE3B,IADI9F,EAAIzX,KAAKuC,KAAKxC,EAAKlI,EAAG4iB,EAAKnH,IACtB,EACL,MAAM8N,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,qCAEvD,IAAIA,EAAI4f,MA3pBxB,gCA4sBI,SAAmB1X,EAAK0X,EAAGgD,EAAKkJ,GAU5B,IADI9rB,EAAImI,KAAKkhB,UAAUnhB,EAAK0X,IACnB,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,sCAGvD,GAAsB,KAAjBkI,EAAIiI,OAAOnQ,GACZ,OAAO4f,EAEX,GAAIkM,EACA,IAAI9rB,EAAImI,KAAK6hB,SAAS9hB,EAAKlI,EAAG4iB,QAG1B5iB,EAAImI,KAAK4jB,SAAS7jB,EAAKlI,EAAG4iB,GAElC,GAAK5iB,EAAI,EACL,OAAQ,EAEZ,OAAU,CAEN,IADI4f,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAO4f,EAEX,IAAI6K,EAAKviB,EAAIjD,MAAO2a,EAAMA,EAAI,GAC9B,GAAW,KAAN6K,EACD,MAAW,KAANA,GACO,EAEL7K,EAEX,GAAIkM,EACI9rB,EAAImI,KAAK6hB,SAAS9hB,EAAQ0X,EAAI,EAAMgD,QAGpC5iB,EAAImI,KAAK4jB,SAAS7jB,EAAQ0X,EAAI,EAAMgD,GAE5C,GAAK5iB,EAAI,EACL,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,uBAzvBnE,wBA8vBI,SAAWkI,EAAKlI,EAAG4iB,GAEf,IADI5iB,EAAImI,KAAKzG,OAAOwG,EAAKlI,EAAG4iB,IACnB,EACL,OAAQ,EAEZ,OAAU,CACN,IAAIhD,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,GAC5B,GAAK4f,EAAI,EACL,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,0BAGvD,GAAmC,KAA9B1X,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,OAAOA,EAGX,IADI5f,EAAImI,KAAKzG,OAAOwG,EAAQ0X,EAAI,EAAMgD,IAC7B,EACL,OAAO5iB,KA9wBvB,sBAkxBI,SAASkI,EAAKlI,GACV,IAAI4f,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,GAC5B,GAAK4f,EAAI,EACL,OAAOA,EAEX,GAAmC,KAA9B1X,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,OAAUA,EAAI,EAElB,GAAmC,KAA9B1X,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,OAAOA,EAEX,GAAmC,KAA9B1X,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,OAAOA,EAEX,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,oDAhyB3D,sBAmyBI,SAAS1X,EAAKlI,EAAG4iB,GASb,IAAIwH,EAAK,IAAI1E,EAAa,IAE1B,IADI9F,EAAIzX,KAAK8hB,MAAM/hB,EAAKlI,EAAGoqB,KACjB,EAAI,CACV,IAAIwB,EAAYxB,EAAG,GACf4B,EAAMJ,EAAU,GAChB3a,EAAK2a,EAAU,GACnB,GAAY,MAAPI,EAAc,CACf7F,EAAY,EAAG,aACf,IAAI9kB,EAAQ8G,KAAKqgB,SAl1BhB,QAo1BA,CAED,KADInnB,EAAK8G,KAAKqf,UAAUwE,IACb,CACP,GAAY,KAAPA,EAED,OADApJ,EAAIlZ,KAAKvB,KAAK8jB,cAAchb,IACrB2O,EAEX,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAS,UAAYgsB,EAAS,gBAGtF,IAAIE,EAAO/jB,KAAKuf,OAAOnH,IAAOlf,EAAK4P,GAOnC,OANKgB,YAAa9J,KAAKigB,WAAY8D,IAAS,EACxCtJ,EAAIlZ,KAAKvB,KAAKigB,WAAW8D,IAGzBtJ,EAAIlZ,KAAKwiB,GAENtM,EAGX,IADI5f,EAAImI,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAQ,EAEZ,GAAsB,KAAjBkI,EAAIiI,OAAOnQ,GAAY,CACxB,IAAIgX,EAAI,IAAI0O,EAAa,IAEzB,OADI9F,EAAIzX,KAAK4L,SAAS7L,EAAKlI,EAAGgX,IACrB,GACL4L,EAAIlZ,KAAKsN,EAAE,IACJ4I,IAEH,EAEP,GAAsB,KAAjB1X,EAAIiI,OAAOnQ,GAAY,CAG7B,IAFA,IACIuO,EADAvO,EAAOA,EAAI,EAEPA,EAAI6lB,EAAY3d,IAAO,CAC3B,GAAsB,KAAjBA,EAAIiI,OAAOnQ,GAAY,CACxB,IAAImsB,EAAOjkB,EAAIjD,MAAOsJ,EAAIvO,GAC1B,GAAImI,KAAKqgB,SACD2D,EAAO1F,EAAate,KAAKqgB,SAAU2D,QAGvChG,EAAagG,EAAKnnB,QAAQ,MAAQ,EAAI,oDAE1C,GAAmC,KAA9BkD,EAAIjD,MAAUjF,EAAI,EAAMA,IAAkD,KAAjC8lB,EAAcqG,GAAO,EAAG,MAC9DA,EAAUA,EAAO,IAErBD,EAAO/jB,KAAKuf,OAAOnH,IAAI4L,GAO3B,OANKla,YAAa9J,KAAKigB,WAAW8D,IAAS,EACvCtJ,EAAIlZ,KAAKvB,KAAKigB,WAAW8D,IAGzBtJ,EAAIlZ,KAAKwiB,GAEHlsB,EAAI,EAEdA,EAAOA,EAAI,EAEnB,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAG,8BAElD,GAAIzX,KAAK+f,YAAa,CACvB,IACItI,EADA5I,EAAI,IAAI0O,EAAa,IAEzB,IADI9F,EAAIzX,KAAK4jB,SAAS7jB,EAAKlI,EAAGgX,IACrB,EACL,OAAQ,EAEZ,GAAK/E,YAAa9J,KAAK8f,SAAUjR,EAAE,KAAO,EACtC,MAAMuS,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAS,YAAegX,EAAE,GAAQ,uBAGtF,OADA4L,EAAIlZ,KAAKvB,KAAKuf,OAAOnH,IAAOpY,KAAKqf,UAAU,IAAMxQ,EAAE,KAC5C4I,EAGP,OAAQ,IA/3BpB,uBAk4BI,SAAU1X,EAAKlI,GAMX,IADA,IACS4f,EAAK5f,GAAQ,EAAI4f,EAAI1X,EAAI1D,OAAQob,IAAK,CAC3C,IAAI6K,EAAKviB,EAAIiI,OAAOyP,GAGpB,GALa,wCAKE5a,QAAQylB,GAAM,EAAI,CAE7B,GAAoB,MAAhBviB,EAAIiI,OAAOyP,GAaX,OAAOA,EAZP,MAAQA,IAAK,CAET,GAAIA,IAAM1X,EAAI1D,OACV,OAAQ,EAEZ,GAAsB,OAAlB0D,EAAIiI,OAAOyP,GAAa,CACxBzX,KAAK4H,MAAQ5H,KAAK4H,MAAQ,EAC1B,YASU,OAAlB7H,EAAIiI,OAAOyP,KACXzX,KAAK4H,MAAQ5H,KAAK4H,MAAQ,GAItC,OAAQ,IAp6BhB,sBAu6BI,SAAS7H,EAAKlI,EAAG4iB,GAMb,IADIhD,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAQ,EAEZ,GAAmC,KAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,OAAQ,EAEZ,IAAIA,EACA5f,EADA4f,GAAW,EAEf,GAAK,cAAc5a,QAAQkD,EAAIiI,OAAOyP,KAAO,EACzC,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAS,kCAAoC1X,EAAIiI,OAAOyP,GAAQ,MAGpH,KAAQ5f,EAAI6lB,EAAY3d,IAAUwe,EAAc1hB,QAAQkD,EAAIiI,OAAOnQ,IAAM,GACjEA,EAAOA,EAAI,EAEnB,GAA4B,MAAvBmI,KAAKygB,eACN,MAAMW,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAK0X,EAAM,0DAA4D1X,EAAIjD,MAAU2a,EAAI,EAAM5f,IAG9I,OADA4iB,EAAIlZ,KAAKvB,KAAKuf,OAAO3T,SAAS7L,EAAIjD,MAAO2a,EAAG5f,KACrCA,IAh8Bf,sBAk8BI,SAASkI,EAAKlI,EAAG4iB,GAKb,IAAIhD,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,GAC5B,GAAK4f,EAAI,EACL,OAAQ,EAEZ,IAAI6K,EAAKviB,EAAIiI,OAAOyP,GACpB,GAAK,cAAc5a,QAAQylB,IAAO,EAC9B,OAAQ,EAEZ,GAAK/D,EAAc1hB,QAAQylB,IAAO,EAC9B,OAAQ,EAGZ,IADIzqB,EAAI4f,EACA5f,EAAI6lB,EAAY3d,IAAUwe,EAAc1hB,QAAQkD,EAAIiI,OAAOnQ,IAAM,GACjEA,EAAOA,EAAI,EAGnB,OADA4iB,EAAIlZ,KAAKxB,EAAIjD,MAAO2a,EAAG5f,IAChBA,IAv9Bf,mBAy9BI,SAAMkI,EAAKlI,EAAG4iB,GASV,IADI5iB,EAAImI,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAQ,EAEZ,IAAIK,EAAI6H,EAAIiI,OAAOnQ,GACnB,GAAK,eAAegF,QAAQ3E,IAAM,EAC9B,OAAQ,EAEZ,GAAKqmB,EAAc1hB,QAAQ3E,GAAK,EAC5B,KAAI4Q,EAAK5Q,EAET,IADIL,EAAOA,EAAI,EACPA,EAAI6lB,EAAY3d,IAAO,CACvB7H,EAAI6H,EAAIiI,OAAOnQ,GACnB,KAAK0mB,EAAc1hB,QAAQ3E,GAAK,GAK5B,MAJI4Q,EAAQA,EAAK5Q,EACbL,EAAOA,EAAI,QAQnBiR,EAAK,GAEb,GAAKjR,EAAI6lB,EAAY3d,IAA2B,KAAjBA,EAAIiI,OAAOnQ,GAAY,CAClD,IAAIgsB,EAAM/a,EAGV,IAFIjR,EAAOA,EAAI,EACXiR,EAAK,GACDjR,EAAI6lB,EAAY3d,IAAO,CACvB7H,EAAI6H,EAAIiI,OAAOnQ,GACnB,KAAK0mB,EAAc1hB,QAAQ3E,GAAK,GAK5B,MAJI4Q,EAAQA,EAAK5Q,EACbL,EAAOA,EAAI,EAOvB,OADA4iB,EAAIlZ,KAAK,IAAI8b,EAAc,CAACwG,EAAK/a,KAC1BjR,EAGP,OAAIiR,GAAM9I,KAAK+f,aAAgBjW,YAAa9J,KAAK8f,SAAUhX,GAAM,GAC7D2R,EAAIlZ,KAAK,IAAI8b,EAAc,CAAC,GAAIvU,KACzBjR,IAEH,IAhhCpB,oBAmhCI,SAAOkI,EAAKlI,EAAG4iB,GAEX,IADIhD,EAAIzX,KAAKqG,QAAQtG,EAAKlI,EAAG4iB,KACnB,EACN,OAAOhD,EAIP,IADIA,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAQ,EAGJA,EAAI4f,EAAR,IAEAwM,EAAQ,KACR3B,EAAKviB,EAAIiI,OAAOnQ,GACpB,GAAW,KAANyqB,GAAoB,KAANA,EAAY,CAEvB2B,EADAlkB,EAAIjD,MAAMjF,EAAMA,EAAI,GAAOyqB,EAAKA,GACxBA,EAAKA,EAAKA,EAGVA,EAERzqB,EAAOA,EAAI6lB,EAAYuG,GAA3B,IACIR,EAAYzjB,KAAKkkB,SAASnkB,EAAKlI,EAAGosB,GAClCxM,EAAIgM,EAAU,GACd7pB,EAAI6pB,EAAU,GAGlB,OAFAhJ,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQxR,IAEtB6d,EAGP,OAAQ,IAljCxB,2BAsjCI,SAAc1X,EAAKlI,EAAG4iB,GAElB,IADIhD,EAAIzX,KAAKuC,KAAKxC,EAAKlI,EAAG4iB,KAChB,EACN,OAAOhD,EAIP,IADIA,EAAIzX,KAAKkhB,UAAUnhB,EAAKlI,IACnB,EACL,OAAQ,EAGJA,EAAI4f,EAAR,IAEA6K,EAAKviB,EAAIiI,OAAOnQ,GACpB,GAAK,eAAegF,QAAQylB,IAAO,EAAI,CAInC,GAFA5D,EAAgByF,UAAY,EAElB,OADNlsB,EAAIymB,EAAgBvhB,KAAK4C,EAAIjD,MAAMjF,KACtB,CAGb4f,EAAI5f,GADAia,EAAM7Z,EAAE,IACAoE,OACPyV,EAAIjV,QAAQ,MAAQ,EACrB4d,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQ0G,EAAK9R,KAAKuf,OAAOnH,IArmC9C,+CAumCAqC,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQ0G,EAAK9R,KAAKuf,OAAOnH,IAxmClD,+CA2mCG,CAEH,IAKItG,EAJJ,GAFA2M,EAAc0F,UAAY,EAEhB,OADNlsB,EAAIwmB,EAActhB,KAAK4C,EAAIjD,MAAMjF,KAEjC,MAAMupB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,6BAEvD4f,EAAO5f,EAAI4mB,EAAc0F,WACrBrS,EAAM/R,EAAIjD,MAAOjF,EAAG4f,IACf5a,QAAQ,MAAQ,EACrB4d,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQkE,WAAWwC,GAAM9R,KAAKuf,OAAOnH,IAtnC7D,6CAwnCSrY,EAAIjD,MAAOjF,EAAG4f,GAAG5a,QAAQ,MAAQ,EACvC4d,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQkE,WAAWwC,GAAM9R,KAAKuf,OAAOnH,IAxnC3D,8CA2nCCqC,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQgZ,SAAStS,GAAM9R,KAAKuf,OAAOnH,IA7nCzD,8CAgoCP,OAAOX,EAEX,GAAsB,KAAjB1X,EAAIiI,OAAOnQ,GAAa,CACzB,GAAmC,OAA9BkI,EAAIjD,MAAOjF,EAAMA,EAAI,GACtB,IAAIosB,EAAQ,WAGRA,EAAQ,IAEZpsB,EAAOA,EAAI6lB,EAAYuG,GAA3B,IACII,EAAK,KACLZ,EAAYzjB,KAAKkkB,SAASnkB,EAAKlI,EAAGosB,GAClCxM,EAAIgM,EAAU,GACd7pB,EAAI6pB,EAAU,GACdnX,EAAO,KACX,GAAmC,KAA9BvM,EAAIjD,MAAO2a,EAAMA,EAAI,GAAe,CAGrC,IAAIxf,EACJ,GAHA2mB,EAASuF,UAAY,EAGX,OADNlsB,EAAI2mB,EAASzhB,KAAK4C,EAAIjD,MAAS2a,EAAI,KAEnC,MAAM2J,EAAUphB,KAAKyf,SAAU6E,UAAWvkB,EAAKlI,EAAG,uDAElDA,EAAU+mB,EAASuF,UAAY1M,EAAO,EAEtCnL,EAAOvM,EAAIjD,MAAU2a,EAAI,EAAM5f,GAC/B4f,EAAI5f,EAEZ,GAAmC,MAA9BkI,EAAIjD,MAAO2a,EAAMA,EAAI,GACtB,KAAI8M,EAAO,IAAIhH,EAAa,IACxB9F,EAAIzX,KAAK6hB,SAAS9hB,EAAQ0X,EAAI,EAAM8M,GACpCF,EAAKE,EAAK,GAGlB,OADA9J,EAAIlZ,KAAKvB,KAAKuf,OAAOnU,QAAQxR,EAAG0S,GAAQ+X,IACjC5M,EAGP,OAAQ,IAxoCxB,sBA4oCI,SAAS1X,EAAKlI,EAAGosB,GASb,IAHA,IAAIxM,EAAI5f,EACJ2sB,EAAO,GACPF,EAAYtkB,KAAK4H,MACb6P,EAAIiG,EAAY3d,IAAO,CACvBlI,EAAO4f,EAAIiG,EAAYuG,GAC3B,GAAKlkB,EAAIjD,MAAO2a,EAAG5f,IAAMosB,EACrB,OAAO,IAAI5G,EAAc,CAACxlB,EAAG2sB,IAEjC,GAAsB,KAAjBzkB,EAAIiI,OAAOyP,GAAhB,CAOA,GAFAkH,EAAYwF,UAAY,GAChBxF,EAAYxhB,KAAK4C,EAAIjD,MAAM2a,IAE/B,MAAM2J,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAK0X,EAAY,2CAA6C1X,EAAIjD,MAAU2a,EAAI,GAAOA,GAAQ,IAAS1X,EAAIjD,MAAO2a,EAAMA,EAAI,KAEvK5f,EAAU4f,EAAIkH,EAAYwF,UAAe,EACzCK,EAAUA,EAAOzkB,EAAIjD,MAAO2a,EAAG5f,GAEnC,GAAW,MADPyqB,EAAKviB,EAAIiI,OAAOnQ,IAKf,GAAW,MAANyqB,GAIL,GAAW,MAANA,EAAa,CACnB,GAAc,KAAT2B,EACD,MAAM7C,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,mCAEtDmI,KAAK4H,MAAW5H,KAAK4H,MAAQ,EACzB4c,EAAUA,EAAOlC,EACjB7K,EAAO5f,EAAI,EACfmI,KAAK4f,aAAe5f,KAAK2f,YACzB3f,KAAK2f,YAAclI,OAElB,GAAW,MAAN6K,EAAa,CACf7K,EAAO5f,EAAI,EAEf,KADIyqB,EAAKviB,EAAIjD,MAAO2a,EAAMA,EAAI,IAE1B,MAAM2J,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,mCAEtD,IAAIqG,EAAI6f,EAAY,aAAeuE,GACnC,GAAKpkB,GAAK,EAEFsmB,EAAUA,EADJ,mBAAqBxc,OAAO9J,GAElCuZ,EAAOA,EAAI,OAEd,GAAW,KAAN6K,EAEF7K,GADAgM,EAAYzjB,KAAKykB,QAAQ1kB,EAAQ0X,EAAI,EAAM6M,IAC7B,GAEdE,EAAUA,GADVlC,EAAKmB,EAAU,QAGlB,IAAW,KAANnB,EAON,MAAMlB,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,cANnD,IAAI4rB,EAEAnB,EADA7K,GADAgM,EAAYzjB,KAAK0kB,QAAQ3kB,EAAQ0X,EAAI,EAAM6M,IAC7B,GAEdE,EAAUA,GADVlC,EAAKmB,EAAU,WAlCvB,IAAIhM,EAAO5f,EAAI,OAJf,IAAI4f,EAAI5f,OAbR,IAAI2sB,EAAUA,EAAO,IACjB/M,EAAOA,EAAI,EA0DvB,MAAM2J,EAAUphB,KAAKyf,SAAUzf,KAAK4H,MAAO7H,EAAKlI,EAAG,iCAttC3D,qBAwtCI,SAAQkI,EAAKlI,EAAGysB,GAIZ,IAHA,IAAI7M,EAAI5f,EACJ8sB,EAAQ,EACR7rB,EAAQ,EACJ6rB,EAAQ,GAAI,CAChB,IACIrC,EADUviB,EAAIjD,MAAO2a,EAAMA,EAAI,GAClB/T,cACb+T,EAAOA,EAAI,EACf,GAAW,IAAN6K,EACD,MAAMlB,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,kCAEtD,IAAIqG,EAAI6f,EAAY,mBAAoBuE,GACxC,GAAKpkB,EAAI,EACL,MAAMkjB,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,iCAElDiB,EAAsB,GAARA,EAAgBoF,EAC9BymB,EAAWA,EAAQ,EAE3B,IAAIC,EAAM5V,OAAOmO,aAAarkB,GAC9B,OAAO,IAAIukB,EAAc,CAAC5F,EAAGmN,MA3uCrC,qBA6uCI,SAAQ7kB,EAAKlI,EAAGysB,GAIZ,IAHA,IAAI7M,EAAI5f,EACJ8sB,EAAQ,EACR7rB,EAAQ,MACJ6rB,EAAQ,GAAI,CAChB,IACIrC,EADUviB,EAAIjD,MAAO2a,EAAMA,EAAI,GAClB/T,cACb+T,EAAOA,EAAI,EACf,GAAW,IAAN6K,EACD,MAAMlB,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,kCAGtD,GADQkmB,EAAY,mBAAoBuE,GAC/B,EACL,MAAMlB,EAAUphB,KAAKyf,SAAU6E,EAAWvkB,EAAKlI,EAAG,iCAElDiB,EAAWA,EAAQwpB,EACnBqC,EAAWA,EAAQ,EAE3B,IAr2C0BE,EAq2CtBD,GAr2CsBC,EAq2CS,KAAOlH,EAAc7kB,EAAO,EAAG,IAAS,EAp2CxEkW,OAAOmO,aAAa0H,IAq2CvB,OAAO,IAAIxH,EAAc,CAAC5F,EAAGmN,QAhwCrC,KAuwCA,SAASE,EAAgBloB,EAAKgL,EAAO7H,EAAKlI,EAAGyP,GACzCtH,KAAK+kB,KAAOhlB,EAAIoe,OAAO,SACvBne,KAAK+kB,KAAOhlB,EACZC,KAAKglB,GAAKntB,EACVmI,KAAKilB,KAAO3d,EACZtH,KAAK4H,MAAQA,EACb5H,KAAKklB,KAAOtoB,EAsBhB,SAASwkB,EAAUxkB,EAAKgL,EAAO7H,EAAKlI,EAAGyP,GACnC,IAAI6d,EAASvd,EAAQ,EACjBhM,EAA8B,QAAaupB,EAAe,QAAavoB,EAAS,kBAAuB0K,EAAS,UAAgBvH,EAAIjD,MAAOjF,EAAMA,EAAI,IAAY,IACjK6P,EAAI,IAAI0d,YAAYxpB,EAAKgB,EAAMuoB,GAInC,OAHAzd,EAAEyd,OAASA,EACXzd,EAAE2d,gBAAkBxtB,EACpB6P,EAAE4d,cAAgBhe,EACXI,EA3BXod,EAAgBrrB,UAAUoO,SAAW,WACjC,IAAI9H,EAAMC,KAAK+kB,KACXltB,EAAImI,KAAKglB,GACT5e,EAAK,EACT,GAAKvO,EAAI,GACL,KAAI0tB,EAAM,MACNnf,EAAQvO,EAAI,QAGZ0tB,EAAM,GAEd,GAAQ7H,EAAY3d,GAAOlI,EAAO,GAC9B,IAAI2tB,EAAO,WAGPA,EAAO,GAEf,MAAO,yDAA6D,IAAInI,EAAc,CAAIrd,KAAK4H,MAAQ,EAAM5H,KAAKklB,KAAMllB,KAAKilB,KAAMM,EAAKxlB,EAAIjD,MAAOsJ,EAAIvO,GAAIkI,EAAIjD,MAAOjF,EAAMA,EAAI,IAAQ2tB,M,mLCz+C5L,QAAoB,IAATtlB,EACT,IAAIA,EAAO,CACTulB,aAAc,EACdC,eAAgB,EAChBC,UAAW,EACXC,mBAAoB,EACpBC,sBAAuB,EACvBC,YAAa,EACbC,4BAA6B,EAC7BC,aAAc,EACdC,cAAe,EACfC,mBAAoB,GACpBC,uBAAwB,GACxBC,cAAe,I,IAIEC,E,WACnB,WAAaC,EAAI9jB,GAAS,YACxBxC,KAAKwC,QAAUA,GAAW,GAC1BxC,KAAKsmB,GAAKA,EACVtmB,KAAK7D,OAASqG,EAAQrG,QAAU,CAC9B0O,MAAO,CACL0b,SAAU,GACVC,SAAU,GACVhM,MAAO,KAIXxa,KAAKymB,WAAa,GAElBzmB,KAAK0mB,YAAc,CACjB,YAAe,sFAEjB1mB,KAAK2mB,OAAS,MAAQ,IAAI7hB,MAAQ8hB,UAClC5mB,KAAKmM,SAAW,KAChBnM,KAAK6mB,WAAa,KAClB7mB,KAAK8mB,aAAe,EACpB9mB,KAAK+mB,eAAiB,CAAE,CAAEC,aAAc,uCAAwCC,UAAW,SAC3FjnB,KAAKknB,aAAc,EACnBlnB,KAAKmnB,SAAW,gBAChBnnB,KAAKonB,iBAAmB,GACxBpnB,KAAKqnB,O,qCAGP,SAAW7P,EAAQnR,EAASC,EAAW/M,GACrC,IAAI+tB,EAAIC,EAAIC,EAAIC,EAEdH,OADqB,IAAZjhB,EACJ6C,IAAIL,UAAU7I,KAAKwC,QAAQlF,MAE3B0C,KAAK0nB,gBAAgBrhB,GAE5BmhB,EAAKxnB,KAAK0nB,gBAAgBphB,GAC1BihB,EAAKvnB,KAAK0nB,gBAAgBnuB,GAC1BkuB,EAAKve,IAAIL,UAAU7I,KAAKwC,QAAQlF,MAEhC0C,KAAKsmB,GAAG7V,IAAI6W,EAAIE,EAAID,EAAIE,K,0BAG1B,SAAcllB,GAEZ,IADA,IAAI5E,EAAO,GACJ4E,GAAQA,EAAKQ,WAAa7C,EAAK+lB,eACpCtoB,EAAO,IAAM4E,EAAK0kB,UAAYtpB,EAC9B4E,EAAOA,EAAKolB,WAEd,OAAOhqB,I,0BAGT,SAAciqB,GACZ,IAAIC,EAAc,GAClB,IAAK,IAAI3pB,KAAK0pB,EACZC,EAAY3pB,GAAK0pB,EAAS1pB,GAE5B,OAAO2pB,I,4BAGT,c,gCAGA,SAAoB/uB,GAClB,IAAK,IAAIjB,EAAI,EAAGA,EAAIwuB,EAAcyB,cAAczrB,OAAQxE,IAAK,CAE3D,IAAIkwB,EAAU1B,EAAcyB,cAAcjwB,GAAGkiB,QAAQ5c,KAAKrE,GAC1D,GAAIivB,GAAWA,EAAQ,GAAG1rB,SAAWvD,EAAMuD,OAEzC,OAAOgqB,EAAcyB,cAAcjwB,GAAGiW,KAG1C,OAAO,O,kBAGT,c,0BAGA,WAEE,OADA9N,KAAK8mB,eACE,KAAO9mB,KAAK8mB,e,8BAGrB,SAAkBtP,EAAQnR,M,wBAG1B,SAAYvN,EAAO0tB,EAAUlpB,GAC3B,IACIV,EADAorB,EAAQlvB,EAAM+D,QAAQ,KAE1B,GAAImrB,GAAS,EAAG,CACd,IAAIpO,EAAS9gB,EAAMmvB,UAAU,EAAGD,GAChC,GAAe,KAAXpO,EAGF,OADAhd,EAAM4pB,EAAS,KACF5pB,EAAM9D,EAAMmvB,UAAUD,EAAQ,GAAK,KAC3C,GAAe,MAAXpO,EAET,MAAO,KAAO9gB,EAAMmvB,UAAUD,EAAQ,GACjC,GAAI3B,EAAc6B,OAAOpkB,KAAK8V,KACnChd,EAAM4pB,EAAS5M,IAEb,OAAOhd,EAAM9D,EAAMmvB,UAAUD,EAAQ,GAI3C,OAAO,O,6BAGT,SAAiBlvB,EAAO0tB,EAAUlpB,GAChC,IAAI6qB,EAAQnoB,KAAKooB,WAAWtvB,EAAO0tB,EAAUlpB,GAC7C,OAAI6qB,GAGGnoB,KAAKqoB,oBAAoB/qB,EAAMxE,K,4BAGxC,SAAgBA,EAAOwvB,EAAmB9N,EAAOgM,EAAUlpB,EAC3CirB,GACd,GAAc,KAAVzvB,EACF,OAAO,KAET,IAAIwN,EAAYtG,KAAKwoB,yBAAyB1vB,EAAOwvB,EAAmBC,EAAc,KAAO/N,EAAOgM,EAAUlpB,GAC9G,OAAIgJ,GAAyC,IAA5BA,EAAUzJ,QAAQ,MAC1B,KAEFyJ,I,iCAGT,SAAqBvG,EAAK5D,GAIxB,IAHA,IAAIsW,EAASzS,KAAKyoB,SAAS1oB,GACvB6Z,EAAS,KAEJ/hB,EAAI,EAAGA,EAAI4a,EAAOpW,OAAQxE,IACO,MAApC4a,EAAO5a,GAAG4a,EAAO5a,GAAGwE,OAAS,GAC/Bud,EAASnH,EAAO5a,GAAGowB,UAAU,EAAGxV,EAAO5a,GAAGwE,OAAS,GAC1Cud,IACTzd,EAAOyd,GAAU5Z,KAAKwC,QAAQlF,KAAOkR,OAASiE,EAAO5a,GAAImI,KAAKwC,QAAQlF,MAAQmV,EAAO5a,GACrF+hB,EAAS,Q,wCAcf,SAA4B9gB,EAAO0tB,EAAUlpB,GAE3C,MAAwB,OADxBxE,EAAQkH,KAAKc,KAAKhI,IACRkP,OAAO,IAAiD,MAAnClP,EAAMkP,OAAOlP,EAAMuD,OAAS,GAGpC,KADrBvD,GADAA,EAAQA,EAAMmvB,UAAU,EAAGnvB,EAAMuD,OAAS,IAC5ByE,KAAKhI,IACTuD,OACD,KAEK,OAAVvD,EAEKkH,KAAK2mB,OAEP3mB,KAAKooB,WAAWtvB,EAAO0tB,EAAUlpB,GAEjC0C,KAAK0oB,gBAAgB5vB,EAAO0tB,EAAUlpB,K,sCAIjD,SAA0BxE,EAAOwvB,EAAmB9N,EAAOgM,EAAUlpB,GAEnExE,EAAQkH,KAAKc,KAAKhI,GAClB,IAAIqvB,EAAQnoB,KAAKooB,WAAWtvB,EAAO0tB,EAAUlpB,GAC7C,GAAI6qB,EACF,OAAOA,EACF,GAAI3N,EAAO,CAChB,GAAI8N,IAAsBtoB,KAAKmnB,SAAShqB,KAAKrE,GAC3C,OAAOwvB,EAAoBxvB,EAE7B,IAAIgS,EAAO0P,EAAM1hB,GACjB,GAAIgS,EACF,OAAOA,EAIT,GADAA,EAAO0P,EADO1hB,EAAM4K,eAGlB,OAAOoH,EAGX,OAAI9K,KAAKmnB,SAAShqB,KAAKrE,GACdkH,KAAKqoB,oBAAoB/qB,EAAMxE,GAEjC,O,mCAGT,SAAuBA,EAAOwvB,EAAmB9N,EAAOgM,EAAUlpB,GAEhExE,EAAQkH,KAAKc,KAAKhI,GAClB,IAAIqvB,EAAQnoB,KAAKooB,WAAWtvB,EAAO0tB,EAAUlpB,GAC7C,GAAI6qB,EACF,OAAOA,EAEP,IAAIrd,EAAO0P,EAAM1hB,GACjB,OAAIgS,KAIJA,EAAO0P,EADO1hB,EAAM4K,gBAGXoH,EAELwd,IAAsBtoB,KAAKmnB,SAAShqB,KAAKrE,GACpCwvB,EAAoBxvB,EAGxBkH,KAAKqoB,oBAAoB/qB,EAAMxE,M,sBAGxC,SAAU8D,GACR,OAAOA,I,qBAGT,SAAS2F,EAAMC,GAMb,IAAIlF,EADJkF,EAAUA,GAAW,GAEjBD,EAAKQ,WAAa7C,EAAK+lB,eACrB1jB,EAAK0c,UAAYzc,EAAQyc,UAC3Bzc,EAAQyc,QAAU1c,EAAK0c,SAEzB3hB,EAAOiF,EAAK0c,SACZ1c,EAAOA,EAAKomB,iBACF1J,UACR1c,EAAK0c,QAAU3hB,GAEjB0C,KAAK4oB,WAAWrmB,IACPA,EAAKolB,WAAW5kB,WAAa7C,EAAK+lB,eAC3CjmB,KAAK4oB,WAAWrmB,GAElB,IAAIsmB,EAAQ,GAERC,EAAa,SAAU7J,GAEzB,IAAKA,GAAWzc,GAAWA,EAAQyc,QACjC,OAAOzc,EAAQyc,QAGjB,IAAI7H,EAAO6H,EAAQpiB,QAAQ,KAO3B,OANIua,GAAQ,IACV6H,EAAUA,EAAQgJ,UAAU,EAAG7Q,IAE7B5U,GAAWA,EAAQumB,aACrB9J,EAAUzc,EAAQumB,WAAW9J,IAExBA,GAKT,IAHA4J,EAAMtnB,KAAK,CAAEynB,QAASzmB,EACpB0mB,QAASjpB,KAAKuB,KAAK,KAAMunB,EAAWvmB,EAAK0c,YAEpC4J,EAAMxsB,OAAS,GAAG,CACvB,IAAI2N,EAAO6e,EAAMxN,QACjB,GAAIrR,EAAKkf,OAAT,CAEE,GAAIlf,EAAKif,QAAQC,QAAUlf,EAAKif,QAAQC,OAAOC,cAAgBnf,EAAKmf,YAElE,SAGF,IAAK,IAAI7iB,KAAa0D,EAAKmf,YAAa,CACtC,IAAIrP,EAAO9P,EAAKmf,YAAY7iB,GAC5B,GAAoB,IAAhBwT,EAAKzd,OAAT,CAKA,IADA,IAAI+sB,EAAS,GACJvxB,EAAI,EAAGA,EAAIiiB,EAAKzd,OAAQxE,IAC/BuxB,EAAO7nB,KAAKvB,KAAKqpB,gBAGnB,IAAK,IAAIxxB,EAAI,EAAGA,EAAIuxB,EAAO/sB,OAAQxE,IACjCmI,KAAKspB,UAAUtf,EAAKkf,OAAQE,EAAOvxB,GAAI,mDAAoDiiB,EAAKjiB,IAChGmI,KAAKspB,UAAUtf,EAAKkf,OAAQE,EAAOvxB,GAAI,kDAAmD,CAAEiW,KAAMuY,EAAckD,UAAWzwB,MAAQjB,EAAI,EAAKuxB,EAAO/sB,OAAS+sB,EAAOvxB,EAAI,GAAK,mDAE9KmI,KAAKspB,UAAUtf,EAAKkf,OAAQlf,EAAK3D,QAASC,EAAW,CAAEwH,KAAMuY,EAAckD,UAAWzwB,MAAOswB,EAAO,UAZlGppB,KAAKspB,UAAUtf,EAAKkf,OAAQlf,EAAK3D,QAASC,EAAW,CAAEwH,KAAMuY,EAAckD,UAAWzwB,MAAO,wDAVnG,CA0BA,IAAIkwB,EAAUhf,EAAKgf,QACfC,EAAUjf,EAAKif,QAGfO,GAAO,EACPC,EAAa,KACbC,EAAwB,KACxBC,EAAgB,KAChBnD,EAAWyC,EAAQzC,SACnBoD,GAAiB,EACjBC,EAAa,GACbV,EAAcF,EAAQE,YACtBW,GAAwBb,EAAQC,OAChC/c,EAAW8c,EAAQ9c,SACnB0a,EAAaoC,EAAQpC,WAEzBvpB,EAAO0C,KAAK+pB,SAASjB,EAAWE,EAAQ/J,UACxC+J,EAAQhf,KAAO,KAEf,IAAIggB,EAAWhB,EAAQiB,iBAAiB,SACxC,GAAID,EAAU,CACZ,IAAIlxB,EAAQkH,KAAKc,KAAKkpB,EAASlxB,OAC/B,GAAIA,EAAMuD,OAAS,EAAG,CACpBwqB,EAAa/tB,EACb,IAAIoxB,EAAc5sB,EAAK6sB,KAEvBnqB,KAAKspB,UAAUN,EAASkB,EAAa,2CAA4C,CAAEpc,KAAMuY,EAAckD,UAAWzwB,MAAO+tB,SAEzHA,EAAa7mB,KAAK6mB,WAKtB,IAAK,IAAIhvB,EAAI,EAAGA,EAAImxB,EAAQplB,WAAWvH,OAAQxE,IAAK,CAClD,IAAIuyB,EAAMpB,EAAQplB,WAAW/L,GAE7B,GAA+B,MAA3BuyB,EAAI3mB,SAASuE,OAAO,IAAiD,IAAnCoiB,EAAI3mB,SAAS5G,QAAQ,UAAiB,CACrE+sB,IACHpD,EAAWxmB,KAAKqqB,aAAa7D,GAC7BoD,GAAiB,GAEnB,IAAIhQ,EAASwQ,EAAI3mB,SAASwkB,UAAU,GAEhC3pB,EAAM+nB,EAAcvlB,KAAKspB,EAAItxB,OACjC0tB,EAAS5M,GAAU5Z,KAAKwC,QAAQlF,KAAOkR,OAASlQ,EAAK0B,KAAKwC,QAAQlF,MAAQgB,GAI9E,IAAIgsB,EAAYtB,EAAQiB,iBAAiB,UACrCK,IACGV,IACHpD,EAAWxmB,KAAKqqB,aAAa7D,GAC7BoD,GAAiB,GAEnB5pB,KAAKuqB,oBAAoBD,EAAUxxB,MAAO0tB,IAI5C,IADA,IAAIgE,EAAa,KACR3yB,EAAI,GAAI2yB,GAAc3yB,EAAImI,KAAK+mB,eAAe1qB,OAAQxE,IAC7D2yB,EAAaxB,EAAQyB,mBAAmBzqB,KAAK+mB,eAAelvB,GAAGmvB,aAAchnB,KAAK+mB,eAAelvB,GAAGovB,WAEtG,GAAIuD,EAAY,CACd,IAAI1xB,EAAQutB,EAAcvlB,KAAK0pB,EAAW1xB,OAExCqT,EADErT,EAAMuD,OAAS,EACNvD,EAEA,KAGf,IAeIwN,EAAWmM,EAfXiY,EAAS1B,EAAQiB,iBAAiB,OAClCU,EAAS3B,EAAQiB,iBAAiB,OAClCW,EAAY5B,EAAQiB,iBAAiB,UACrCY,EAAc7B,EAAQiB,iBAAiB,YACvCa,EAAc9B,EAAQiB,iBAAiB,YACvCc,EAAc/qB,KAAKgrB,WACnBhC,EAAQiB,iBAAiB,YACzB,KACAgB,EAAajC,EAAQiB,iBAAiB,WACtCiB,EAAWlC,EAAQiB,iBAAiB,SACpCkB,EAASnC,EAAQiB,iBAAiB,OAClCmB,EAAcpC,EAAQiB,iBAAiB,YACvCoB,EAAUrC,EAAQiB,iBAAiB,QACnCqB,EAAYtC,EAAQiB,iBAAiB,UACrCsB,EAAmB,GAEvB,GAAIb,EAAQ,CACVjY,EAASzS,KAAKyoB,SAASiC,EAAO5xB,OAC9B,IAAK,IAAIjB,EAAI,EAAGA,EAAI4a,EAAOpW,OAAQxE,KACjCyO,EAAYtG,KAAKwrB,eAAe/Y,EAAO5a,GAAIgvB,EAAYoC,EAAQzO,MAAOgM,EAAUlpB,EAAM0C,KAAKgrB,YAA8B,OAAhBH,KAEvGU,EAAiBhqB,KAAK+E,GAI5B,IAAImlB,GAAmB,GACvB,GAAId,EAAQ,CACVlY,EAASzS,KAAKyoB,SAASkC,EAAO7xB,OAC9B,IAAK,IAAIjB,GAAI,EAAGA,GAAI4a,EAAOpW,OAAQxE,MACjCyO,EAAYtG,KAAKwrB,eAAe/Y,EAAO5a,IAAIgvB,EAAYoC,EAAQzO,MAAOgM,EAAUlpB,EAAM0C,KAAKgrB,YAAcH,KAEvGY,GAAiBlqB,KAAK+E,GAqH5B,GAhHItG,KAAKgrB,aAAeN,GAAUC,IAAWE,IACX,IAA5BU,EAAiBlvB,SACnBquB,EAAS,MAEqB,IAA5Be,GAAiBpvB,SACnBsuB,EAAS,OAGTD,GAAUC,GAERO,IACFzB,EAAazpB,KAAK0rB,2BAA2BR,EAASpyB,MAAO0tB,EAAUlpB,IAErEstB,IACFjB,EAAgBF,GAEbA,IACCT,EAAQrB,WAAW5kB,WAAa7C,EAAK+lB,cACvCwD,EAAaX,EAAWE,EAAQ/J,SACvBgK,EAAQ0C,eAEjBlC,EAAaX,EAAWE,EAAQrB,WAAW1I,WAAagK,EAAQ0C,aAAe7C,EAAWE,EAAQ/J,SAAWgK,EAAQ0C,eAGrHP,IACF1B,EAAwB1pB,KAAK0rB,2BAA2BN,EAAYtyB,MAAO0tB,EAAUlpB,IAElFosB,IACC2B,EACF3B,EAAwB1pB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUsJ,EAAQvyB,QAChEqyB,EACTzB,EAAwB1pB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUoJ,EAAOryB,SAC/D8xB,GAAcM,GAAclrB,KAAKknB,cAAsC,SAAtB8B,EAAQ/B,WAA8C,SAAtB+B,EAAQ/B,aAClGyC,EAAwB1pB,KAAKqpB,kBAG7BuB,GAAcM,IAAYlrB,KAAKknB,aAAsC,SAAtB8B,EAAQ/B,WAA8C,SAAtB+B,EAAQ/B,UAEhF2D,IAAcM,IACvBvB,EAAgBD,GAFhBC,EAAgBF,IAIToB,GAAgBI,GAAeH,GAsCpCI,IACFzB,EAAazpB,KAAK0rB,2BAA2BR,EAASpyB,MAAO0tB,EAAUlpB,KAEpEmsB,GAAc2B,IACjB3B,EAAazpB,KAAK0rB,2BAA2BN,EAAYtyB,MAAO0tB,EAAUlpB,KAEvEmsB,GAAc4B,IACjB5B,EAAazpB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUsJ,EAAQvyB,UAE3D2wB,GAAc0B,IACjB1B,EAAazpB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUoJ,EAAOryB,SAE1D2wB,IACCT,EAAQrB,WAAW5kB,WAAa7C,EAAK+lB,cACvCwD,EAAaX,EAAWE,EAAQ/J,UACtBjf,KAAKknB,cAAelnB,KAAKgrB,YAAsC,SAAtBhC,EAAQ/B,WAA8C,SAAtB+B,EAAQ/B,UAElF2D,EACTnB,EAAazpB,KAAKqpB,eACTJ,EAAQ0C,eAEjBlC,EAAaX,EAAWE,EAAQrB,WAAW1I,WAAagK,EAAQ0C,aAAe7C,EAAWE,EAAQ/J,SAAWgK,EAAQ0C,aAChHd,IACHrB,GAAO,IAPTC,EAAaX,EAAWE,EAAQrB,WAAW1I,WAAagK,EAAQ0C,aAAe7C,EAAWE,EAAQ/J,SAAWgK,EAAQ0C,cAWrHf,IACFjB,EAAgBF,KAhEdyB,IACFzB,EAAazpB,KAAK0rB,2BAA2BR,EAASpyB,MAAO0tB,EAAUlpB,GACnEstB,IACFjB,EAAgBF,IAGfA,GAAcT,EAAQrB,WAAW5kB,WAAa7C,EAAK+lB,eAK5CwD,GAAcR,EAAQ0C,eAEhClC,EAAaX,EAAWE,EAAQrB,WAAW1I,WAAagK,EAAQ0C,aAAe7C,EAAWE,EAAQ/J,SAAWgK,EAAQ0C,eANrHlC,EAAaX,EAAWE,EAAQ/J,SAC5B2L,IACFjB,EAAgBF,IAMhBmB,IAAcjB,IACZyB,IACFzB,EAAgB3pB,KAAK0rB,2BAA2BN,EAAYtyB,MAAO0tB,EAAUlpB,KAE1EqsB,GAAiB0B,IACpB1B,EAAgB3pB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUsJ,EAAQvyB,UAE9D6wB,GAAiBwB,IACpBxB,EAAgB3pB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUoJ,EAAOryB,SAE7D6wB,IAAkB3pB,KAAKknB,cAAelnB,KAAKgrB,YAAsC,SAAtBhC,EAAQ/B,WAA8C,SAAtB+B,EAAQ/B,YACtG0C,EAAgBF,GAEbE,IACHA,EAAgB3pB,KAAKqpB,gBAEvBK,EAAwBC,IAsCxBF,IAEEyB,GAAYE,GAAezB,GAAe,CAC5C,IAAIngB,GAAKigB,EACLmB,IAAcM,IAAaE,GAAe1B,IAC5ClgB,GAAKkgB,GAGP1pB,KAAK4rB,iBAAiB5C,EAASxf,IAInC,GAAImgB,EAAe,CACjBlX,EAASzS,KAAKyoB,SAASmC,EAAU9xB,OACjC,IAAK,IAAIjB,GAAI,EAAGA,GAAI4a,EAAOpW,OAAQxE,KAAK,CACtC,IAAI0B,GAASyG,KAAKwoB,yBAAyB/V,EAAO5a,IAAIgvB,EAAYoC,EAAQzO,MAAOgM,EAAUlpB,GACvF/D,IACFyG,KAAKspB,UAAUN,EAASW,EAAetD,EAAcwF,QAAS,CAAE/d,KAAMuY,EAAckD,UAAWzwB,MAAOS,MAY5G,GANIkwB,GAAcA,IAAeR,EAAQ0C,eAEvCxC,EAAc,GACdW,GAAuB,GAGrBJ,EAAuB,CACzB,GAAIgB,GAAUY,EACZ,IAAK,IAAIzzB,GAAI,EAAGA,GAAI0zB,EAAiBlvB,OAAQxE,KAAK,CAChD,IAAIiiB,GAAOqP,EAAYoC,EAAiB1zB,KACnCiiB,KACHA,GAAO,GACPqP,EAAYoC,EAAiB1zB,KAAMiiB,IAErCA,GAAKvY,KAAK,CAAEuM,KAAMuY,EAAckD,UAAWzwB,MAAO4wB,SAE/C,GAAIgB,EACT,IAAK,IAAI7yB,GAAI,EAAGA,GAAI0zB,EAAiBlvB,OAAQxE,KAC3CmI,KAAKspB,UAAUN,EAASS,EAAY8B,EAAiB1zB,IAAI,CAAEiW,KAAMuY,EAAckD,UAAWzwB,MAAO4wB,IAGrG,GAAIiB,EACF,IAAK,IAAI9yB,GAAI,EAAGA,GAAI4zB,GAAiBpvB,OAAQxE,KAC3CmI,KAAKspB,UAAUN,EAASU,EAAuB+B,GAAiB5zB,IAAI,CAAEiW,KAAMuY,EAAckD,UAAWzwB,MAAO2wB,QAG3G,CAML,GAJIA,IAAeC,IAA0BgB,GAAUC,KACrDjB,EAAwB1pB,KAAKqpB,gBAG3BqB,GAAUY,EACZ,IAAK,IAAIzzB,GAAI,EAAGA,GAAI0zB,EAAiBlvB,OAAQxE,KAAK,CAChD,IAAIiiB,GAAOqP,EAAYoC,EAAiB1zB,KACnCiiB,KACHA,GAAO,GACPqP,EAAY7iB,GAAawT,IAG3B+P,EAAWtoB,KAAK,CAAE+E,UAAWilB,EAAiB1zB,IAAIiiB,KAAMA,UAErD,GAAI4Q,EACT,IAAK,IAAI7yB,GAAI,EAAGA,GAAI0zB,EAAiBlvB,OAAQxE,KAC3CgyB,EAAWtoB,KAAK,CAAE+E,UAAWilB,EAAiB1zB,IAAIi0B,SAAS,IAG/D,GAAInB,EACF,IAAK,IAAI9yB,GAAI,EAAGA,GAAI4zB,GAAiBpvB,OAAQxE,KAC3CgyB,EAAWtoB,KAAK,CAAE+E,UAAWmlB,GAAiB5zB,IAAIi0B,SAAS,IAKjE,GAAIjB,EAAa,CACf,IAAIze,GAAW,KACX2f,GAAU,KACVjB,GACF1e,GAAiC,KAAtB0e,EAAYhyB,MAAeutB,EAAc2F,gBAAkBhsB,KAAKwoB,yBAAyBsC,EAAYhyB,MAAO+tB,EAAYoC,EAAQzO,MAAOgM,EAAUlpB,GAE1JyuB,GADEhB,IAAgBE,EACRF,EAAYjyB,MAEZsT,KAAaia,EAAc4F,eAAiB7f,KAAaia,EAAc6F,eAAiB,KAAQjB,EAAaA,EAAWnyB,MAAQkwB,EAAQ1lB,aAE3I2nB,GACT7e,GAAWia,EAAc2F,gBACzBD,GAAUd,EAAWnyB,OACZiyB,GACTgB,GAAUhB,EAAYjyB,OACtBsT,GAAWia,EAAc8F,mBAAmBJ,OAE1C3f,GAAWia,EAAc2F,kBAEjBtB,GAAWC,IACjBS,IACFW,GAAU/rB,KAAK0rB,2BAA2BN,EAAYtyB,MAAO0tB,EAAUlpB,KAEpEyuB,IAAWV,EACdU,GAAU/rB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUsJ,EAAQvyB,SACjDizB,IAAWZ,IACrBY,GAAU/rB,KAAKqoB,oBAAoB/qB,EAAMykB,UAAUoJ,EAAOryB,SAExDizB,KACF3f,GAAWia,EAAckD,YAGxBnd,KACCwe,IAAcM,GAChB9e,GAAWia,EAAckD,UACzBwC,GAAUpC,IAEVoC,GAAU/C,EAAQ1lB,YACdtD,KAAKgrB,YAAoC,SAAtBhC,EAAQ/B,YAC7B7a,GAAWia,EAAc8F,mBAAmBJ,KAEzC3f,KACHA,GAAWia,EAAc2F,mBAI/BvZ,EAASzS,KAAKyoB,SAASoC,EAAY/xB,OACnC,IAAK,IAAIjB,GAAI,EAAGA,GAAI4a,EAAOpW,OAAQxE,KAAK,CACtC,IAAIyO,GAAYtG,KAAKwrB,eAAe/Y,EAAO5a,IAAIgvB,EAAYoC,EAAQzO,MAAOgM,EAAUlpB,GACpF,GAAIgJ,GACF,GAAIglB,EAAW,CACb,IAAIxR,GAAOqP,EAAY7iB,IAClBwT,KACHA,GAAO,GACPqP,EAAY7iB,IAAawT,IAE3BA,GAAKvY,KAAM6K,KAAaia,EAAc4F,eAAiB7f,KAAaia,EAAc6F,eAAkB,CAAEpe,KAAM1B,GAAUtT,MAAOkwB,EAAQxkB,YAAe,CAAEsJ,KAAM1B,IAAYia,EAAc2F,gBAAiBlzB,MAAOizB,GAAS5f,SAAUA,SAE7NC,KAAaia,EAAc4F,eAAiB7f,KAAaia,EAAc6F,eACzElsB,KAAKspB,UAAUN,EAASS,EAAYnjB,GAAW,CAAEwH,KAAM1B,GAAUtT,MAAOkwB,EAAQxkB,aAEhFxE,KAAKspB,UAAUN,EAASS,EAAYnjB,GAAW,CAAEwH,KAAM1B,IAAYia,EAAc2F,gBAAiBlzB,MAAOizB,GAAS5f,SAAUA,KAQtI,GAAIsd,IAAeD,EACjB,IAAK,IAAI3xB,GAAI,EAAGA,GAAIoxB,EAAQY,WAAWxtB,OAAQxE,KACzCoxB,EAAQY,WAAWhyB,IAAGiiB,KAGxBmP,EAAQY,WAAWhyB,IAAGiiB,KAAKvY,KAAK,CAAEuM,KAAMuY,EAAckD,UAAWzwB,MAAO2wB,IAC/DR,EAAQY,WAAWhyB,IAAGi0B,QAE/B9rB,KAAKspB,UAAUN,EAASC,EAAQ5iB,QAAS4iB,EAAQY,WAAWhyB,IAAGyO,UAAW,CAAEwH,KAAMuY,EAAckD,UAAWzwB,MAAO2wB,IAGlHzpB,KAAKspB,UAAUN,EAASS,EAAYR,EAAQY,WAAWhyB,IAAGyO,UAAW,CAAEwH,KAAMuY,EAAckD,UAAWzwB,MAAOmwB,EAAQ5iB,UAI3H,IAAI+lB,GAAe,KACfC,GAAc5C,EACdD,IAEF4C,GAAepsB,KAAKuB,KAAK0nB,EAASA,EAAQ5iB,UAG7BslB,aAAe7C,EAAWE,EAAQrB,WAAW1I,WAAagK,EAAQ0C,aAAe7C,EAAWE,EAAQ/J,SAAWgK,EAAQ0C,aACpIS,GAAavC,WAAaZ,EAAQY,WAClCuC,GAAajgB,SAAWA,EACxBigB,GAAa5F,SAAWA,EACxB4F,GAAavF,WAAaA,KAE1BuF,GAAepsB,KAAKuB,KAAK0nB,EAASQ,IACrBkC,aAAejC,GAA0BD,GAAcR,EAAQ5iB,QAC5E+lB,GAAa5F,SAAWA,EACxB4F,GAAavC,WAAaA,EACtBH,IAEF2C,GAAc3C,EACdP,EAAc,GACdW,GAAuB,GAEzBsC,GAAajD,YAAcA,EAC3BiD,GAAajgB,SAAWA,EACxBigB,GAAavF,WAAaA,GAExBiD,GAEFjB,EAAMjnB,QAAQ,CAAEsnB,OAAQF,EAASC,QAASA,EAAS5iB,QAASgmB,GAAalD,YAAaA,IAExF,IAAK,IAAImD,GAAQtD,EAAQuD,UAAWD,GAAOA,GAAQA,GAAME,gBACnDF,GAAMvpB,WAAa7C,EAAKulB,cAG1BoD,EAAMjnB,QAAQ,CAAEonB,QAASsD,GAAOrD,QAASmD,MAI3CpsB,KAAKgrB,YACPhrB,KAAKysB,iBAEP,IAAK,IAAI50B,GAAI,EAAGA,GAAImI,KAAKonB,iBAAiB/qB,OAAQxE,KAChDmI,KAAKonB,iBAAiBvvB,IAAG0K,K,kBAI7B,SAAM2mB,EAAQ7iB,GACZ,MAAO,CACL6iB,OAAQA,EACR7iB,QAASA,IAAY6iB,EAASA,EAAO7iB,QAAU,MAC/CslB,aAAc,KACd9B,WAAY,GACZV,YAAaD,EAASA,EAAOC,YAAc,GAC3Chd,SAAU+c,EAASA,EAAO/c,SAAWnM,KAAKmM,SAC1Cqa,SAAU0C,EAASA,EAAO1C,SAAWxmB,KAAK7D,OAAO0O,MAAM2b,SACvDhM,MAAO0O,EAASA,EAAO1O,MAAQxa,KAAK7D,OAAO0O,MAAM2P,MACjDqM,WAAYqC,EAASA,EAAOrC,WAAa7mB,KAAK6mB,c,iCAIlD,SAAqBvpB,EAAMV,GAEzB,OAAO4R,OAAS5R,EAAKU,K,wBAGvB,SAAYiF,GAEa,SAAnBA,EAAK0kB,WAAyD,mBAAjC1kB,EAAKmqB,aAAa,WACjD1sB,KAAK2sB,kBACuB,SAAnBpqB,EAAK0kB,WAA8C,iCAAtB1kB,EAAKykB,aACnB,oBAAbjqB,UAA4BA,SAAS6vB,QACZ,mCAA9B7vB,SAAS6vB,QAAQC,UAA+E,kDAA9B9vB,SAAS6vB,QAAQE,UACrFpwB,QAAQrB,IAAI,iEACZ2E,KAAK+sB,kBACkC,mCAA9BhwB,SAAS6vB,QAAQC,UAA+E,kDAA9B9vB,SAAS6vB,QAAQE,SAC5F9sB,KAAK2sB,kBAEL3sB,KAAK+sB,iBAGP/sB,KAAK+sB,iBAGP/sB,KAAKgtB,kB,4BAIT,WACEhtB,KAAKitB,oBACLjtB,KAAK+mB,eAAiB,CACpB,CACEC,aAAc,uCACdC,UAAW,QAEb,CAAED,aAAc,KAAMC,UAAW,SAEnCjnB,KAAKknB,aAAc,EACnBlnB,KAAKgrB,YAAa,I,+BAGpB,WACEhrB,KAAK6mB,WAAa,KAElB7mB,KAAK+mB,eAAiB,CACpB,CACEC,aAAc,uCACdC,UAAW,W,6BAKjB,WACEjnB,KAAKitB,oBACLjtB,KAAKknB,aAAc,EACnBlnB,KAAKgrB,YAAa,EAClBhrB,KAAK+mB,eAAiB,CACpB,CACEC,aAAc,uCACdC,UAAW,QACb,CAAED,aAAc,KAAMC,UAAW,SAGnCjnB,KAAK7D,OAAO0O,MAAM2P,MAAlB,UAAuC,+CACvCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,SAAsC,8CACtCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,SAAsC,8CACtCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,QAAqC,6CACrCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,SAAsC,8CACtCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,UAAuC,+CACvCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,MAAmC,2CACnCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,SAAsC,8CACtCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,MAAmC,2CACnCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,QAAqC,6CACrCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,SAAsC,8CACtCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,QAAqC,6CACrCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,WAAwC,gDACxCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,WAAwC,gDACxCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,MAAmC,2CACnCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,IAAiC,yCACjCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,GAAgC,wCAChCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,MAAmC,2CAEnCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,QAAqC,6CACrCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,KAAkC,0CAClCxa,KAAK7D,OAAO0O,MAAM2P,MAAlB,eAA4C,sD,2BAG9C,WACExa,KAAKitB,oBACLjtB,KAAKknB,aAAc,EACnBlnB,KAAKgrB,YAAa,I,sBAGpB,SAAUjrB,GACR,OAAOC,KAAKc,KAAKf,GAAKE,MAAM,S,6BAM9B,SAAiB1E,GAAG,WAClB,QAAiB,IAANA,EAAX,CACA,GAAiB,iBAANA,EACT,MAA0B,OAAtBA,EAAE0sB,UAAU,EAAG,SAC8B,IAApCjoB,KAAKymB,WAAWlrB,EAAE0sB,UAAU,MACrCjoB,KAAKymB,WAAWlrB,EAAE0sB,UAAU,IAAM,IAAIrd,IAAUrP,EAAE0sB,UAAU,KAEvDjoB,KAAKymB,WAAWlrB,EAAE0sB,UAAU,KAE9B/e,IAAIL,UAAUtN,GAEvB,OAAQA,EAAEuS,MACR,KAAKuY,EAAckD,UACjB,MAAgC,OAA5BhuB,EAAEzC,MAAMmvB,UAAU,EAAG,SAC8B,IAA1CjoB,KAAKymB,WAAWlrB,EAAEzC,MAAMmvB,UAAU,MAC3CjoB,KAAKymB,WAAWlrB,EAAEzC,MAAMmvB,UAAU,IAAM,IAAIrd,IAAUrP,EAAEzC,MAAMmvB,UAAU,KAEnEjoB,KAAKymB,WAAWlrB,EAAEzC,MAAMmvB,UAAU,KAEpC/e,IAAIL,UAAUtN,EAAEzC,OACzB,KAAKutB,EAAc2F,gBACjB,OAAO,IAAI1gB,IAAQ/P,EAAEzC,MAAOyC,EAAE4Q,UAAY,IAC5C,KAAKka,EAAc4F,cACnB,KAAK5F,EAAc6F,eACjB,IAAI3rB,EAAS,GAIb,OAHAhI,OAAO4W,KAAK5T,EAAEzC,OAAO4J,SAAQ,SAAA7K,GAC3B0I,GAAU2sB,cAAiB3xB,EAAEzC,MAAMjB,GAAI,EAAK6uB,gBAEvC,IAAIpb,IAAQ/K,EAAQ,GAAI,IAAId,IAAUlE,EAAEuS,OACjD,QACE,OAAO,IAAIxC,IAAQ/P,EAAEzC,MAAO,GAAI,IAAI2G,IAAUlE,EAAEuS,W,kBAItD,SAAM/N,GACJ,OAAOA,EAAIhC,QAAQ,SAAU,IAAIA,QAAQ,SAAU,O,2BAxtBrD,SAAqBovB,EAAK7G,EAAIhpB,GAC5B,IAAI3D,EAAI,IAAI0sB,EAAcC,EAAI,CAAE,KAAQhpB,IAEnC6vB,EAAIlO,UACPkO,EAAIlO,QAAU3hB,GAEhB3D,EAAEyzB,QAAQD,EAAK,CAAElO,QAAS3hB,M,sBA2qB5B,SAAiByC,GACf,OAAOC,KAAKc,KAAKf,GAAKE,MAAM,S,kBAwC9B,SAAaF,GACX,OAAOA,EAAIhC,QAAQ,SAAU,IAAIA,QAAQ,SAAU,Q,KAIvDsoB,EAAc4F,cACZ,wDACF5F,EAAc6F,eAAiB,kDAC/B7F,EAAc2F,gBACZ,0DACF3F,EAAckD,UAAY,oDAC1BlD,EAAcwF,QAAU,kDACxBxF,EAAcgH,SACZ,8DACFhH,EAAciH,cACZ,mgBACFjH,EAAc6B,OAAS,IAAIzpB,OAAO,IAAM4nB,EAAciH,cACpDjH,EAAcgH,SAAW,MAW3BhH,EAAcyB,cAAgB,CAC5B,CAAE/N,QAAS,iGACTjM,KAAM,6CACR,CAAEiM,QAAS,oLACTjM,KAAM,6CACR,CAAEiM,QAAS,2HACTjM,KAAM,yCACR,CAAEiM,QAAS,4FACTjM,KAAM,yCACR,CAAEiM,QAAS,+EACTjM,KAAM,+CACR,CAAEiM,QAAS,gEACTjM,KAAM,2CAGV,IAAMyf,EAAelH,EAAckH,c,mJC75BtBpX,EACX,WAAa/d,EAAMoR,GAAI,YACrBxJ,KAAKoW,IAAM,IAAInC,IACfjU,KAAKwtB,KAAO,GAEZxtB,KAAK5H,KAAOA,EACZ4H,KAAKwJ,GAAKA,GAmBP,SAASqP,EAAqBF,EAAS5W,EAAUwU,EAASqC,GAG/D,SAAS6U,EAAcnpB,GACrB,IACIuK,EADA9O,EAAM,GAEV,IAAK8O,KAAKvK,EACJA,EAAE5K,eAAemV,KACnB9O,GAAO,OAAS8O,EAAI,OAASvK,EAAEuK,IAGnC,OAAO9O,EAGT,SAAS2tB,EAAeC,GACtB,IACI91B,EADAkI,EAAM,aAENzG,EAAIq0B,EAAItxB,OACZ,IAAKxE,EAAI,EAAGA,EAAIyB,EAAGzB,IACjBkI,GAAO0tB,EAAaE,EAAI91B,GAAG,IAAM,QAEnC,OAAOkI,EA2CT,SAAS6tB,EAAe/xB,EAAMsM,EAAOD,EAAUmF,GAC7C,IAAIwgB,EACJ,GAAIhyB,EAAKQ,SAAW8L,EAAM9L,OACxB,MAAO,GAET,IAAKR,EAAKQ,OACR,MAAO,CAAC,CAAE,GAAI,OAEhB,IAAIsxB,EAzCN,SAAoB9xB,EAAMsM,EAAOD,EAAUmF,GACzC,IAAIygB,EAAS5lB,EAASrM,GACtB,QAAe2K,IAAXsnB,EAAsB,CACxB,GAAIjyB,EAAKkyB,MAAO,CACd,IAAIzpB,EAAI,GAER,OADAA,EAAEzI,GAAQsM,EACH,CAAC,CAAE7D,EAAG,OAEfwpB,EAASjyB,EAEX,IAAKiyB,EAAOE,YAOV,OANI3gB,EAAQgH,aAAayZ,KACvBA,EAASzgB,EAAQgH,aAAayZ,IAE5BzgB,EAAQgH,aAAalM,KACvBA,EAAQkF,EAAQgH,aAAalM,IAE3B2lB,EAAOzmB,OAAOc,IAAW2lB,EAAOlxB,KAAOkxB,EAAOlxB,MAAQqxB,IACjD,CAAC,CAAE,GAAI,OAET,GAET,GAAIpyB,aAAgB8S,MAClB,OAAMxG,aAAiBwG,MAGhBif,EAAc/xB,EAAMsM,EAAOD,GAFzB,GAIX,MAAM,IAAIrI,MAAM,yCAaNquB,CAAUryB,EAAK,GAAIsM,EAAM,GAAID,EAAUmF,GACjD,GAAmB,IAAfsgB,EAAItxB,OACN,OAAOsxB,EAET,IACI91B,EAEAs2B,EACA1W,EACAxf,EACA4W,EACAuf,EACAC,EARA5T,EAAM,GAENnhB,EAAIq0B,EAAItxB,OAOZ,IAAKxE,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK,CAGtB,IAAKgX,KADLwf,EAAY,GADZF,EAAKR,EAAI91B,GAAG,GAGNs2B,EAAGz0B,eAAemV,KACpBwf,EAAUxf,GAAKsf,EAAGtf,IAGtB,IAAKA,KAAK3G,EACJA,EAASxO,eAAemV,KAC1Bwf,EAAUxf,GAAK3G,EAAS2G,IAK5B,IADA5W,GADA41B,EAAOD,EAAc/xB,EAAKiB,MAAM,GAAIqL,EAAMrL,MAAM,GAAIuxB,EAAWhhB,IACtDhR,OACJob,EAAI,EAAGA,EAAIxf,EAAGwf,IAAK,CAEtB,IAAK5I,KADLuf,EAAMP,EAAKpW,GAAG,GACJ0W,EACJA,EAAGz0B,eAAemV,KACpBuf,EAAIvf,GAAKsf,EAAGtf,IAGhB4L,EAAIlZ,KAAK,CAAC6sB,EAAK,QAGnB,OAAO3T,EAsBT,SAAS6T,EAAOjqB,EAAGC,GACjB,IACI/I,EADArD,EAAI,GAER,IAAKqD,KAAK8I,EACJA,EAAE3K,eAAe6B,KACnBrD,EAAEqD,GAAK8I,EAAE9I,IAGb,IAAKA,KAAK+I,EACJA,EAAE5K,eAAe6B,KACnBrD,EAAEqD,GAAK+I,EAAE/I,IAGb,OAAOrD,EAGT,SAASq2B,EAAwBC,EAAkBC,GAOjD,OANAzuB,KAAKyuB,cAAgBA,EACrBzuB,KAAKwuB,iBAAmBA,EACxBxuB,KAAK0uB,SAAW,GAIT1uB,KA2BT,SAAS2uB,EAAiB5sB,EAAU6W,GASlC,OARA5Y,KAAK2kB,MAAQ,EACb3kB,KAAKrE,SAAU,EACfqE,KAAKgU,MAAO,EAEZhU,KAAK+B,SAAWA,EAChB/B,KAAK4Y,OAASA,EAGP5Y,KAjCTuuB,EAAuB90B,UAAUm1B,aAAe,WAC9C,IAAI/2B,EACJ,IAAKA,EAAI,EAAGA,EAAImI,KAAK0uB,SAASryB,OAAQxE,IACpC,IAAKmI,KAAK0uB,SAAS72B,GAAGmc,KACpB,OAGJ3Y,IAAIC,MAAM,+BACV0E,KAAK6uB,YAAY7uB,KAAK0uB,SAASryB,OAAS,EAAG2D,KAAKyuB,gBAGlDF,EAAuB90B,UAAUo1B,YAAc,SAAUvqB,EAAG4D,GAC1D,IAAIuP,EACJ,GAAInT,EAAI,EACN,OAAOtE,KAAKwuB,iBAAiBtmB,GAE/B,IAAKuP,EAAI,EAAGA,EAAIzX,KAAK0uB,SAASpqB,GAAGwU,QAAQzc,OAAQob,IAC/CzX,KAAK6uB,YAAYvqB,EAAI,EAAGgqB,EAAMpmB,EAAUlI,KAAK0uB,SAASpqB,GAAGwU,QAAQrB,MAmBrEkX,EAAgBl1B,UAAUq1B,YAAc,SAAU5mB,GAEhDlI,KAAK+B,SAASmG,GACdlI,KAAKrE,SAAU,GAGjBgzB,EAAgBl1B,UAAUs1B,WAAa,WACrC/uB,KAAKgU,MAAO,EACZ3Y,IAAII,KAAK,4CACW+K,IAAhBxG,KAAK4Y,QACP5Y,KAAK4Y,UAKT,IAAIoW,EAAiB,SAAUC,GAM7B,OALAjvB,KAAK2kB,MAAQ,EACb3kB,KAAKgU,MAAO,EACZhU,KAAK8Y,QAAU,GACf9Y,KAAKivB,SAAWA,EAChBA,EAASP,SAASntB,KAAKvB,MAChBA,MAuBT,SAASkvB,EAASC,EAAGnlB,EAAM9B,GACzB,IAAIsS,EAAO4U,EAAWv3B,EAAGw3B,EAxHZ9zB,EACTqK,EAgIJ,IARAoE,EAAKslB,MAAQ,EACbtlB,EAAK4K,MAAQ,KAKb4F,EAAQ,CAACxQ,EAAK3D,QAAS2D,EAAK1D,UAAW0D,EAAKzQ,OAAQyQ,EAAK1C,KACzD+nB,EAAM,CAACF,EAAE3a,aAAc2a,EAAE1a,eAAgB0a,EAAEza,YAAaya,EAAExa,UACrD9c,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACtB,IAAIkB,EAAIyhB,EAAM3iB,GAEd,GAAIkB,EAAE6D,KAAO7D,EAAE6D,MAAQqxB,UAEhB,GAAIl1B,EAAEg1B,YAA2BvnB,IAAhB0B,EAASnP,GAC/BiR,EAAKslB,YACA,CAQL,GA/IA1pB,SAwIA7M,OAvIMyN,KADNZ,EAwImBsC,EAzIV3M,EAyIAif,EAAM3iB,KAtIV0D,EAEFqK,EAsICupB,EAAE9a,aAAa8a,EAAE3lB,GAAGzQ,MACtBA,EAAIo2B,EAAE9a,aAAa8a,EAAE3lB,GAAGzQ,OAE1Bq2B,EAAYC,EAAIx3B,GAAGs3B,EAAE3lB,GAAGzQ,KAItB,OADAiR,EAAK4K,MAAQ,IACN,GAEW,OAAf5K,EAAK4K,OAAoB5K,EAAK4K,MAAMvY,OAAS+yB,EAAU/yB,UAC1D2N,EAAK4K,MAAQwa,IAQnB,OAHmB,OAAfplB,EAAK4K,QACP5K,EAAK4K,MAAQua,EAAE7lB,aAEV,EAMT,SAASimB,EAAc1zB,EAAMsM,GAC3B,OAAItM,EAAKyzB,QAAUnnB,EAAMmnB,MAChBzzB,EAAKyzB,MAAQnnB,EAAMmnB,MAErBzzB,EAAK+Y,MAAMvY,OAAS8L,EAAMyM,MAAMvY,OApEzC2yB,EAAev1B,UAAUq1B,YAAc,SAAU5mB,GAC/ClI,KAAK8Y,QAAQvX,KAAK2G,IAGpB8mB,EAAev1B,UAAUs1B,WAAa,WACpC1zB,IAAIC,MAAM,+CAAiD0E,KAAK8Y,QAAQzc,QAC5C,IAAxB2D,KAAK8Y,QAAQzc,SACf2D,KAAK8Y,QAAQvX,KAAK,IAClBlG,IAAIC,MAAM,wCAEZ0E,KAAKgU,MAAO,EACZhU,KAAKivB,SAASL,gBA4DhB,IAaI9wB,EAAQ,SAARA,EAAkBqxB,EAAGtpB,EAAG2pB,EAAeC,EAAOlZ,EAASmZ,EAAeC,GACxEt0B,IAAIC,MAAM,mCAAqCq0B,EAAOhL,MAAQ,QAAUgL,EAAOC,eAG/E,IAwBI5lB,EACAnS,EAzBAkiB,EAAUlU,EAAEyD,WAChB,GAAuB,IAAnByQ,EAAQ1d,OAAc,CAExB,GADAhB,IAAIC,MAAM,6BAA+BmyB,EAAa+B,IAC5B,IAAtB3pB,EAAEgqB,SAASxzB,OACbszB,EAAOb,YAAYU,OACd,CACLn0B,IAAIC,MAAM,aAAeuK,EAAEgqB,UAC3B,IAEIvrB,EAFA2qB,EAAW,IAAIV,EAAuBxsB,EAAUytB,GAChDM,EAAK,GAET,IAAKxrB,EAAI,EAAGA,EAAIuB,EAAEgqB,SAASxzB,OAAQiI,IACjCwrB,EAAGxrB,GAAK,IAAI0qB,EAAeC,GAC3Ba,EAAGxrB,GAAGsrB,cAAgB/pB,EAAEgqB,SAASvrB,GAEnC,IAAKA,EAAI,EAAGA,EAAIuB,EAAEgqB,SAASxzB,OAAQiI,IACjCwrB,EAAGxrB,GAAGqgB,MAAQmL,EAAGxrB,GAAGqgB,MAAQ,EAC5B7mB,EAAMqxB,EAAGtpB,EAAEgqB,SAASvrB,GAAIkrB,EAAe,GAAIjZ,EAASxU,EAAU+tB,EAAGxrB,IAKrE,OAFAqrB,EAAOhL,aACPtpB,IAAIC,MAAM,6CAA+Cq0B,EAAOhL,MAAQ,QAAUgL,EAAOC,eAM3F,IAAIt2B,EAAIygB,EAAQ1d,OAIhB,GAAIka,EAAS,CACQwZ,EAAnB,IACIC,EAAgB,SAAUC,EAAezmB,GAC3C,IAAI0mB,EAASD,EAAcrzB,IAAIqD,MAAM,KAAK,GAC1CsW,EAAQ4Z,iBAAiBD,OAAQ1pB,GAAW,SAAU4pB,EAAIrpB,EAAMspB,GACzDD,GACH1zB,QAAQrB,IAAI,4BAA8B40B,EAAcrzB,IAAM,eAAiBmK,GAEjFjJ,EAAMqxB,EAAGtpB,EAAG2pB,EAAeC,EAAOlZ,EAChCmZ,EAAeC,OAGrB,IAAK93B,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK,CAEtB,GADAmS,EAAO+P,EAAQliB,QACqB2O,IAAhCgpB,EAAcxlB,EAAK3D,UACnBmpB,EAAcxlB,EAAK3D,SAASzJ,KAAO2Z,GAC4B,gBAA/DA,EAAQ+Z,SAAS3zB,kBAAQ6yB,EAAcxlB,EAAK3D,SAASzJ,MAGvD,YADAozB,EAAcR,EAAcxlB,EAAK3D,UAGnC,QAAmCG,IAA/BgpB,EAAcxlB,EAAKzQ,SACnBi2B,EAAcxlB,EAAKzQ,QAAQqD,KAAO2Z,GAC4B,gBAA9DA,EAAQ+Z,SAAS3zB,kBAAQ6yB,EAAcxlB,EAAKzQ,QAAQqD,MAEtD,YADAozB,EAAcR,EAAcxlB,EAAKzQ,UAKvCg3B,EAAOpB,EAAGtpB,EAAG2pB,EAAeC,EAAOlZ,EAASmZ,EAAeC,IAGzDa,EAAuB,SAAUtoB,EAAUuoB,GAC7C,IACIl1B,EACAuI,EAFA2W,GAAM,EAGV,IAAKlf,KAAK2M,EACJA,EAASxO,eAAe6B,IACtBk1B,EAAYl1B,KACduI,EAAO2sB,EAAYl1B,GAAGuI,QACTA,EAAKoE,EAAS3M,MACzBkf,GAAM,GAKd,OAAOA,GAIL8V,EAAS,SAAUpB,EAAGtpB,EAAG2pB,EAAeC,EAAOlZ,EAASxU,EAAU4tB,GACpE,IAEI93B,EACAqG,EACAwyB,EACA7hB,EACAwf,EACAsC,EACA3mB,EARA+P,EAAUlU,EAAEyD,WACZhQ,EAAIygB,EAAQ1d,OAQhB,IAAKxE,EAAI,EAAGA,EAAIyB,EAAGzB,IAGjBq3B,EAAQC,EAFRnlB,EAAO+P,EAAQliB,GAEE23B,GAGnBzV,EAAQ3V,KAAKmrB,GACbvlB,EAAO+P,EAAQ,GAEf,IAOI7hB,EAPA+V,EAAOkhB,EAAE9hB,UACbY,EAAK4hB,SAAWhqB,EAAEgqB,SAClB5hB,EAAKwiB,YAAc5qB,EAAE4qB,YACrBxiB,EAAK3E,WAAayQ,EAAQjd,MAAM,GAChCzB,IAAIC,MAAMm0B,EAAQ,oBAAsBzlB,EAAK4K,MAAMvY,OAAS,QAAU2N,EACpE,qBAAuByjB,EAAa+B,IAGtC,IACIoB,EACAxqB,EAFAyqB,EAAK7mB,EAAK4K,MAAMvY,OAGhBy0B,EAAS,EAEb,IAAK54B,EAAI,EAAGA,EAAI24B,EAAI34B,IASlB,IARAkO,EAAK4D,EAAK4K,MAAM1c,GAChB04B,EAAOhD,EACL,CAAC5jB,EAAK3D,QAAS2D,EAAK1D,UAAW0D,EAAKzQ,OAAQyQ,EAAK1C,KACjD,CAAClB,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGkB,KAAMkoB,EAAeL,GAChE9zB,IAAII,KAAKg0B,EAAQ,gBAAkBmB,EAAKv0B,OAAS,KAAOqxB,EAAckD,IACtEF,EAAKE,EAAKv0B,OAGL6B,EAAI,EAAGA,EAAIwyB,EAAIxyB,IAGlB,GAFAmwB,EAAY,GACZsC,EAAeC,EAAK1yB,GAAG,GAClBsyB,EAAqBG,EAAc9qB,EAAE4qB,aAGnC,CACL,IAAK5hB,KAAK8hB,EACJA,EAAaj3B,eAAemV,KAC9Bwf,EAAUxf,GAAK8hB,EAAa9hB,IAGhC,IAAKA,KAAK2gB,EACJA,EAAc91B,eAAemV,KAC/Bwf,EAAUxf,GAAK2gB,EAAc3gB,IAIjC8gB,EAAOhL,QACPmM,IACAhzB,EAAMqxB,EAAGlhB,EAAMogB,EAAWoB,EAAQ,KAAMlZ,EAASxU,EAAU4tB,QAf3Dt0B,IAAIC,MAAM,oBAAsBq0B,EAAOhL,OAmB7CgL,EAAOhL,QACQ,IAAXmM,GACFz1B,IAAIC,MAAM,8BAAgC0O,GAE5C3O,IAAIC,MAAM,8BAAgCq0B,EAAOhL,MAAQ,QAAUgL,EAAOC,eACrD,IAAjBD,EAAOhL,QACTtpB,IAAIC,MAAM,oBACVq0B,EAAOZ,eAIPI,EAAInvB,KACR3E,IAAIC,MAAM,YAAc0E,KAAKsJ,WAAWjN,QACxC,IAAI00B,EAAS,IAAIpC,EAAgB5sB,EAAU6W,GAC3CmY,EAAOpM,QACHhM,EAAQtC,KACVvY,EAAMqxB,EAAGxW,EAAQvC,IAAKuC,EAAQvC,IAAI4a,aAAc,GAAIza,EAASxU,EAAUgvB,GAEvEE,YAAW,WACTnzB,EAAMqxB,EAAGxW,EAAQvC,IAAKuC,EAAQvC,IAAI4a,aAAc,GAAIza,EAASxU,EAAUgvB,KACtE,K,+pBCrgBc7mB,E,gCAKnB,aAAe,yBACb,cAAM,IADO,mBAJH,IAIG,sBAHyB9P,KAGzB,iBAFTsgB,KAES,E,uCAIf,WACE,OAAO1a,KAAKlH,Q,sBAGd,WACE,MAAO,mB,GAd+BoH,KAkBnC,SAASgxB,EAAe33B,GAC7B,QAASA,GAAUA,EAAOuF,WAAa1E,M,6BCpBzC,MAAM+2B,EAAO,EAAQ,IACfrhB,EAAc,EAAQ,KAG1BpB,QAAS0iB,EACTliB,SAAUmiB,EACV7hB,SAAU8hB,EACV7hB,YAAa8hB,GACX,EAAQ,KAGVlV,WAAYmV,EACZzU,WAAY0U,EAAc,YAC1BrV,GACE,EAAQ,KAGV1L,QAASghB,EACTve,qBAAsBwe,GACpB,EAAQ,IAENC,EAAwB,IAAIthB,IAE5BuhB,EAAkB,eAElBpjB,EAAM,GAo7BZ,SAASqjB,EAAWC,EAAWj5B,EAAOk5B,EAAYC,EAAUC,EAAS1vB,GAEnE,GAAa,OAAV1J,IAAmBw4B,EAAUx4B,IAAU2V,EAAI0jB,UAAUr5B,GACtD,OAAOA,EAIT,GAAGA,EAAMgF,MAAM+zB,GACb,OAAO,KAYT,GARGI,GAAYA,EAASv4B,eAAeZ,KACd,IAAvBo5B,EAAQx5B,IAAII,IACZ2V,EAAI2jB,qBAAqB,CACvBL,YAAWE,WAAUnnB,KAAMhS,EAAOo5B,UAAS1vB,aAI/CwvB,EAAaA,GAAc,IACbK,MAAO,CACnB,MAAMC,EAAUP,EAAUnK,SAASlvB,IAAII,GAGvC,GAAe,OAAZw5B,EACD,OAAO,KAGT,GAAGjB,EAAUiB,IAAY,QAASA,EAEhC,OAAOA,EAAQ,OAKnB,MAAMtK,EAAQlvB,EAAM+D,QAAQ,KAC5B,GAAGmrB,EAAQ,EAAG,CACZ,MAAMpO,EAAS9gB,EAAMyjB,OAAO,EAAGyL,GACzBuK,EAASz5B,EAAMyjB,OAAOyL,EAAQ,GAIpC,GAAc,MAAXpO,GAA2C,IAAzB2Y,EAAO11B,QAAQ,MAClC,OAAO/D,EAINm5B,GAAYA,EAASv4B,eAAekgB,IACrCnL,EAAI2jB,qBAAqB,CACvBL,YAAWE,WAAUnnB,KAAM8O,EAAQsY,UAAS1vB,YAKhD,MAAM8vB,EAAUP,EAAUnK,SAASlvB,IAAIkhB,GACvC,GAAG0Y,GAAWA,EAAQE,QACpB,OAAOF,EAAQ,OAASC,EAI1B,GAAGf,EAAe14B,GAChB,OAAOA,EAKX,GAAGk5B,EAAWK,OAAS,WAAYN,EACjC,OAAOA,EAAU,UAAYj5B,EAI/B,GAAGk5B,EAAW10B,MAAQ,UAAWy0B,GAC/B,GAAGA,EAAU,SAEX,OAAO3V,EAAYA,EAAY5Z,EAAQlF,KAAMy0B,EAAU,UAAWj5B,QAE/D,GAAGk5B,EAAW10B,KACnB,OAAO8e,EAAY5Z,EAAQlF,KAAMxE,GAGnC,OAAOA,EAngCT1B,EAAOD,QAAUsX,EAcjBA,EAAI2e,QAAUqF,OACZV,YAAWE,WAAUzvB,UACrBkwB,aAAY,EACZC,qBAAoB,EACpBC,SAAS,IAAIpiB,QAGV6gB,EAAUY,IAAa,aAAcA,GACtCb,EAASa,EAAS,eAClBA,EAAWA,EAAS,aAKtB,GAAmB,IAHNP,EAASO,GAGd51B,OACN,OAAO01B,EAIT,MAAMc,QAAiBrwB,EAAQswB,gBAAgBC,QAAQ,CACrDhB,YACA9I,QAASgJ,EACTe,eAAgBxwB,EAAQwwB,eACxB11B,KAAMkF,EAAQlF,OAIb+zB,EAAUwB,EAAS,GAAG91B,WACuB,kBAAvC81B,EAAS,GAAG91B,SAAS,gBAE5B21B,EAAYG,EAAS,GAAG91B,SAAS,eAKnC,IAAIsT,EAAO0hB,EAIPW,GAAcriB,EAAK4iB,kBAErB5iB,EAAOA,EAAKD,QACZC,EAAK4iB,gBAAkBlB,GAGzB,IAAI,MAAMmB,KAAmBL,EAAU,CACrC,IAAK91B,SAAUo2B,GAAOD,EAMtB,GAHAnB,EAAY1hB,EAGD,OAAR8iB,EAAc,CAGf,IAAIR,GAC0C,IAA5Cp6B,OAAO4W,KAAK4iB,EAAUqB,WAAW/2B,OAAc,CAC/C,MAAMg3B,EAAiB7wB,GAAWA,EAAQ6wB,eAAkB,QAC5D,GAAqB,UAAlBA,EACD,MAAM,IAAIvjB,EACR,gFAEA,qBACA,CAAC6B,KAAM,kCACJ,GAAqB,SAAlB0hB,EAA0B,CAElC32B,QAAQlB,KAAK,0CAGb,MAAM83B,EAAYJ,EAAgBK,aAAaxB,GAC/C,GAAGuB,EAAW,CACZjjB,EAAO0hB,EAAYuB,EACnB,SAGF,MAAME,EAAezB,EAErB1hB,EAAO0hB,EAAYtjB,EAAIglB,kBAAkBjxB,GAAS4N,QAClD,IAAI,MAAOtF,EAAM4oB,KACfn7B,OAAO6Y,QAAQoiB,EAAaJ,WACzBM,IACD3B,EAAUnK,SAAS9c,GACjBqmB,EAAK/gB,MAAMojB,EAAa5L,SAAS9c,KAGvCinB,EAAUqB,UAAYjC,EAAK/gB,MAAMojB,EAAaJ,WAG9CF,EAAgBS,aAAaH,EAAcnjB,GAC3C,SAEF,MAAM,IAAIP,EACR,yBACA,qBACA,CAAC6B,KAAM,yBAA0BsX,QAASgJ,EAAUoB,kBAExDhjB,EAAO0hB,EAAYtjB,EAAIglB,kBAAkBjxB,GAAS4N,QAClD,SAIF,MAAMkjB,EAAYJ,EAAgBK,aAAaxB,GAC/C,GAAGuB,EAAW,CACZjjB,EAAO0hB,EAAYuB,EACnB,SASF,GALGjC,EAAU8B,IAAQ,aAAcA,IACjCA,EAAMA,EAAI,cAIR9B,EAAU8B,GACZ,MAAM,IAAIrjB,EACR,sDACA,qBAAsB,CAAC6B,KAAM,wBAAyBsX,QAASkK,IAOnE9iB,EAAOA,EAAKD,QAGZ,MAAM8hB,EAAU,IAAI5hB,IAGpB,GAAG,aAAc6iB,EAAK,CACpB,GAAuB,MAApBA,EAAI,YACL,MAAM,IAAIrjB,EACR,gCAAkCqjB,EAAI,YACtC,4BACA,CAACxhB,KAAM,yBAA0BsX,QAASkK,IAE9C,GAAGpB,EAAU6B,gBACkB,gBAA7B7B,EAAU6B,eACV,MAAM,IAAI9jB,EACR,aAAeqjB,EAAI,YAAc,wBACjCpB,EAAU6B,eACV,gCACA,CAACjiB,KAAM,2BAA4BsX,QAASkK,IAEhD9iB,EAAKujB,eAAiB,cACtBvjB,EAAK,YAAc8iB,EAAI,YACvBjB,EAAQ3hB,IAAI,YAAY,GAQ1B,GAJAF,EAAKujB,eACHvjB,EAAKujB,gBAAkB7B,EAAU6B,eAGhC,UAAWT,EAAK,CACjB,IAAI71B,EAAO61B,EAAI,SAEf,GAAY,OAAT71B,GAAiBk0B,EAAel0B,QAE5B,KAAGm0B,EAAen0B,GAGvB,MAAM,IAAIwS,EACR,+GAEA,qBAAsB,CAAC6B,KAAM,mBAAoBsX,QAASkK,IAL5D71B,EAAO8e,EAAY/L,EAAK,SAAU/S,GAQpC+S,EAAK,SAAW/S,EAChB40B,EAAQ3hB,IAAI,SAAS,GAIvB,GAAG,WAAY4iB,EAAK,CAClB,MAAMr6B,EAAQq6B,EAAI,UAClB,GAAa,OAAVr6B,SACMuX,EAAK,cACP,KAAIihB,EAAUx4B,GACnB,MAAM,IAAIgX,EACR,wFAEA,qBAAsB,CAAC6B,KAAM,wBAAyBsX,QAASkK,IAC5D,IAAI3B,EAAe14B,IAAU2V,EAAImlB,eAAevjB,EAAM,GAC3D,MAAM,IAAIP,EACR,uFAEA,qBAAsB,CAAC6B,KAAM,wBAAyBsX,QAASkK,IAEjE9iB,EAAK,UAAYyhB,EAAWzhB,EAAMvX,EAAO,CAACu5B,OAAO,EAAM/0B,MAAM,QAC3DkJ,OAAWA,EAAWhE,GAE1B0vB,EAAQ3hB,IAAI,UAAU,GAIxB,GAAG,cAAe4iB,EAAK,CACrB,MAAMr6B,EAAQq6B,EAAI,aAClB,GAAa,OAAVr6B,SACMuX,EAAK,iBACP,KAAIihB,EAAUx4B,GACnB,MAAM,IAAIgX,EACR,2FAEA,qBACA,CAAC6B,KAAM,2BAA4BsX,QAASkK,IAE9C9iB,EAAK,aAAevX,EAAM4K,cAE5BwuB,EAAQ3hB,IAAI,aAAa,GAI3B,GAAG,eAAgB4iB,EAAK,CACtB,MAAMr6B,EAAQq6B,EAAI,cAClB,GAAgC,gBAA7BpB,EAAU6B,eACX,MAAM,IAAI9jB,EACR,0DACAiiB,EAAU6B,eACV,qBACA,CAACjiB,KAAM,yBAA0BsX,QAASkK,IAE9C,GAAa,OAAVr6B,SACMuX,EAAK,kBACP,IAAa,QAAVvX,GAA6B,QAAVA,EAC3B,MAAM,IAAIgX,EACR,iGAEA,qBACA,CAAC6B,KAAM,yBAA0BsX,QAASkK,IAE5C9iB,EAAK,cAAgBvX,EAEvBo5B,EAAQ3hB,IAAI,cAAc,GAK5B,GAAG,eAAgB4iB,EAAK,CACtB,MAAMr6B,EAAQq6B,EAAI,cAClB,GAAgC,gBAA7BpB,EAAU6B,eACX,MAAM,IAAI9jB,EACR,0DACAiiB,EAAU6B,eACV,qBACA,CAACjiB,KAAM,wBAAyBsX,QAASkK,IAE7C,GAAoB,kBAAVr6B,EACR,MAAM,IAAIgX,EACR,8DACA,qBACA,CAAC6B,KAAM,2BAA4BsX,QAASgJ,IAEhDC,EAAQ3hB,IAAI,cAAc,GAI5B,GAAG,YAAa4iB,EAAK,CACnB,MAAMr6B,EAAQq6B,EAAI,WAClB,GAAgC,gBAA7BpB,EAAU6B,eACX,MAAM,IAAI9jB,EACR,uDACAiiB,EAAU6B,eACV,qBACA,CAACjiB,KAAM,wBAAyBsX,QAASkK,IAE7C,IAAI7B,EAAUx4B,GACZ,MAAM,IAAIgX,EACR,oDACA,qBACA,CAAC6B,KAAM,wBAAyBsX,QAASgJ,IAI7C,MAAM4B,QAAuBrxB,EAAQswB,gBAAgBC,QAAQ,CAC3DhB,YACA9I,QAASnwB,EACTk6B,eAAgBxwB,EAAQwwB,eACxB11B,KAAMkF,EAAQlF,OAEhB,GAA6B,IAA1Bu2B,EAAex3B,OAChB,MAAM,IAAIyT,EACR,mEACA,qBACA,CAAC6B,KAAM,yBAA0BsX,QAASgJ,IAE9C,MAAM6B,EAAkBD,EAAe,GAAGN,aAAaxB,GACvD,GAAG+B,EAIDX,EAAMW,MACD,CACL,MAAMC,EAAYF,EAAe,GAAG92B,SACpC,GAAG,YAAag3B,EACd,MAAM,IAAIjkB,EACR,qEAEA,qBACA,CAAC6B,KAAM,wBAAyBsX,QAASgJ,IAI7C,IAAI,MAAM74B,KAAO26B,EACXZ,EAAIz5B,eAAeN,KACrB+5B,EAAI/5B,GAAO26B,EAAU36B,IAQzBy6B,EAAe,GAAGF,aAAa5B,EAAWoB,GAG5CjB,EAAQ3hB,IAAI,WAAW,GAMzB2hB,EAAQ3hB,IAAI,aAAc4iB,EAAI,gBAAiB,GAG/C,IAAI,MAAM/5B,KAAO+5B,EAUf,GATA1kB,EAAI2jB,qBAAqB,CACvBL,UAAW1hB,EACX4hB,SAAUkB,EACVroB,KAAM1R,EACN84B,UACA1vB,UACAmwB,sBAGCtB,EAAU8B,EAAI/5B,KAAS,aAAc+5B,EAAI/5B,GAAM,CAChD,MAAM46B,EAASb,EAAI/5B,GAAK,YACxB,IAAIg0B,GAAU,EACd,GAAGkE,EAAU0C,GAAS,CACpB,MAAMC,EAAM7X,EAAY5Z,EAAQlF,KAAM02B,GAEnCpB,EAAOsB,IAAID,GACZ7G,GAAU,EAEVwF,EAAOniB,IAAIwjB,GAIf,GAAG7G,EACD,UACQ3e,EAAI2e,QAAQ,CAChB2E,UAAW1hB,EAAKD,QAChB6hB,SAAUkB,EAAI/5B,GAAK,YACnBu5B,mBAAmB,EACnBnwB,UACAowB,WAEF,MAAMlrB,GACN,MAAM,IAAIoI,EACR,kDACA,qBACA,CACE6B,KAAM,yBACNsX,QAASkK,EAAI/5B,GAAK,YAClB0R,KAAM1R,KAQlB85B,EAAgBS,aAAa5B,EAAW1hB,GAG1C,OAAOA,GAiBT5B,EAAI2jB,qBAAuB,EACzBL,YACAE,WACAnnB,OACAonB,UACA1vB,UACAmwB,qBAAoB,MAEpB,GAAGT,EAAQgC,IAAIppB,GAAO,CAEpB,GAAGonB,EAAQx5B,IAAIoS,GACb,OAGF,MAAM,IAAIgF,EACR,wCACA,yBACA,CAAC6B,KAAM,qBAAsBsX,QAASgJ,EAAUnnB,SAOpD,IAAIhS,EAKJ,GARAo5B,EAAQ3hB,IAAIzF,GAAM,GAIfmnB,EAASv4B,eAAeoR,KACzBhS,EAAQm5B,EAASnnB,IAGP,UAATA,GACAumB,EAAUv4B,IAC0B,UAAnCA,EAAM,eAAiB,SACxB2V,EAAImlB,eAAe7B,EAAW,KAAM,CAErC,MAAMoC,EAAY,CAAC,aAAc,MAAO,cAClChlB,EAAO5W,OAAO4W,KAAKrW,GACzB,GAAmB,IAAhBqW,EAAK9S,QAAgB8S,EAAK0B,KAAK3S,IAAMi2B,EAAUr0B,SAAS5B,IACzD,MAAM,IAAI4R,EACR,yDACA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,EAAUnnB,aAEjD,IAAG2D,EAAI0jB,UAAUrnB,GACtB,MAAM,IAAIgF,EACR,yDACA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,EAAUnnB,SAC/C,GAAGA,EAAKhN,MAAM+zB,GAInB,YAFAn1B,QAAQlB,KAAK,4EACoB,CAACsP,SAE7B,GAAY,KAATA,EACR,MAAM,IAAIgF,EACR,4DACA,qBACA,CAAC6B,KAAM,0BAA2BsX,QAASgJ,IAI/C,MAAMmC,EAAkBrC,EAAUnK,SAASlvB,IAAIoS,GAG5CinB,EAAUnK,SAASsM,IAAIppB,IACxBinB,EAAUnK,SAASyM,OAAOvpB,GAI5B,IAAIwpB,GAAa,EAMjB,IALGhD,EAAUx4B,IAAoB,OAAVA,KACrBw7B,GAAa,EACbx7B,EAAQ,CAAC,MAAOA,KAGdu4B,EAAUv4B,GACZ,MAAM,IAAIgX,EACR,2EAEA,qBACA,CAAC6B,KAAM,0BAA2BsX,QAASgJ,IAI/C,MAAMK,EAAU,GAChBP,EAAUnK,SAASrX,IAAIzF,EAAMwnB,GAC7BA,EAAQiC,SAAU,EAGlB,MAAMJ,EAAY,CAAC,aAAc,MAAO,YAAa,WAAY,SAG9D1lB,EAAImlB,eAAe7B,EAAW,MAC/BoC,EAAU5yB,KACR,WAAY,aAAc,SAAU,QAAS,UAAW,cAG5D,IAAI,MAAMizB,KAAM17B,EACd,IAAIq7B,EAAUr0B,SAAS00B,GACrB,MAAM,IAAI1kB,EACR,8DAAgE0kB,EAChE,qBACA,CAAC7iB,KAAM,0BAA2BsX,QAASgJ,IAMjD,MAAMjK,EAAQld,EAAKjO,QAAQ,KAG3B,GAFAy1B,EAAQmC,cAAiBzM,EAAQ,EAE9B,aAAclvB,EAAO,CACtB,GAAG,QAASA,EACV,MAAM,IAAIgX,EACR,2EACgB,qBAChB,CAAC6B,KAAM,2BAA4BsX,QAASgJ,IAEhD,GAAG,UAAWn5B,EACZ,MAAM,IAAIgX,EACR,6EACkB,qBAClB,CAAC6B,KAAM,2BAA4BsX,QAASgJ,IAEhD,MAAMsC,EAAUz7B,EAAM,YACtB,IAAIw4B,EAAUiD,GACZ,MAAM,IAAIzkB,EACR,sEACA,qBAAsB,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAGjE,IAAIxjB,EAAI0jB,UAAUoC,IAAYA,EAAQz2B,MAAM+zB,GAS1C,OAPAn1B,QAAQlB,KAAK,6EACoB,CAAC+4B,iBAC/BH,EACDrC,EAAUnK,SAASrX,IAAIzF,EAAMspB,GAE7BrC,EAAUnK,SAASyM,OAAOvpB,IAM9B,MAAMtB,EAAKsoB,EACTC,EAAWwC,EAAS,CAAClC,OAAO,EAAM/0B,MAAM,GAAQ20B,EAAUC,EAC1D1vB,GACF,IAAIgvB,EAAehoB,GACjB,MAAM,IAAIsG,EACR,wGAEA,qBAAsB,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAGjEK,EAAQ,OAAS9oB,EACjB8oB,EAAQiC,SAAU,OACb,GAAG,QAASz7B,EAAO,CACxB,IAAI0Q,EAAK1Q,EAAM,OACf,GAAG0Q,IAAO8nB,EAAU9nB,GAClB,MAAM,IAAIsG,EACR,wFAEA,qBAAsB,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAEjE,GAAU,OAAPzoB,EAED8oB,EAAQ,OAAS,SACZ,KAAI7jB,EAAI0jB,UAAU3oB,IAAOA,EAAG1L,MAAM+zB,GASvC,OAPAn1B,QAAQlB,KAAK,6EACoB,CAACgO,YAC/B4qB,EACDrC,EAAUnK,SAASrX,IAAIzF,EAAMspB,GAE7BrC,EAAUnK,SAASyM,OAAOvpB,IAGvB,GAAGtB,IAAOsB,EAAM,CAIrB,GAFAtB,EAAKsoB,EACHC,EAAWvoB,EAAI,CAAC6oB,OAAO,EAAM/0B,MAAM,GAAQ20B,EAAUC,EAAS1vB,IAC5DgvB,EAAehoB,KAAQiF,EAAI0jB,UAAU3oB,GACvC,MAAM,IAAIsG,EACR,+GAEA,qBACA,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAI3C,GAAGnnB,EAAKhN,MAAM,gBAAiB,CAK7B,GAHgBg0B,EACdC,EAAWjnB,EAAM,CAACunB,OAAO,EAAM/0B,MAAM,GACrC20B,EAHkB,IAAI3hB,IAAI4hB,GAAS3hB,IAAIzF,GAAM,GAGtBtI,KACVgH,EACb,MAAM,IAAIsG,EACR,yEAEA,qBACA,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAI7CK,EAAQ,OAAS9oB,EAEjB8oB,EAAQE,QAAW8B,IAChBhC,EAAQmC,eACTjrB,EAAG1L,MAAM,oBAIf,KAAK,QAASw0B,GAEZ,GAAGA,EAAQmC,cAAe,CACxB,MAAM7a,EAAS9O,EAAKyR,OAAO,EAAGyL,GAQ9B,GAPGiK,EAASv4B,eAAekgB,IAEzBnL,EAAI2jB,qBAAqB,CACvBL,YAAWE,WAAUnnB,KAAM8O,EAAQsY,UAAS1vB,YAI7CuvB,EAAUnK,SAASsM,IAAIta,GAAS,CAEjC,MAAM2Y,EAASznB,EAAKyR,OAAOyL,EAAQ,GACnCsK,EAAQ,OAASP,EAAUnK,SAASlvB,IAAIkhB,GAAQ,OAAS2Y,OAGzDD,EAAQ,OAASxnB,OAEd,GAAY,UAATA,EAERwnB,EAAQ,OAASxnB,MACZ,CAEL,KAAK,WAAYinB,GACf,MAAM,IAAIjiB,EACR,6DACA,qBACA,CAAC6B,KAAM,sBAAuBsX,QAASgJ,EAAUnnB,SAGrDwnB,EAAQ,OAASP,EAAU,UAAYjnB,EAc3C,KAT2B,IAAxBhS,EAAM,gBACwB,IAA9Bo5B,EAAQx5B,IAAI,gBAAkD,IAAxBI,EAAM,iBAC7Ci5B,EAAUqB,UAAUtoB,IAAQ,EAC5BwnB,EAAQc,WAAY,GAItBlB,EAAQ3hB,IAAIzF,GAAM,GAEf,UAAWhS,EAAO,CACnB,IAAIgV,EAAOhV,EAAM,SACjB,IAAIw4B,EAAUxjB,GACZ,MAAM,IAAIgC,EACR,oEACA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,IAG5C,GAAa,UAATnkB,GAA6B,UAATA,GACtB,GAAGW,EAAImlB,eAAe7B,EAAW,GAC/B,MAAM,IAAIjiB,EAER,gEAAIhC,0BACJ,qBACA,CAAC6D,KAAM,uBAAwBsX,QAASgJ,SAEvC,GAAY,QAATnkB,GAA2B,WAATA,EAAmB,CAK7C,GAHAA,EAAOgkB,EACLC,EAAWjkB,EAAM,CAACukB,OAAO,EAAM/0B,MAAM,GAAQ20B,EAAUC,EACvD1vB,IACEgvB,EAAe1jB,GACjB,MAAM,IAAIgC,EACR,2EAEA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,IAE5C,GAA0B,IAAvBnkB,EAAKjR,QAAQ,MACd,MAAM,IAAIiT,EACR,+FAEA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,IAK9CK,EAAQ,SAAWxkB,EAGrB,GAAG,eAAgBhV,EAAO,CAExB,MAAM47B,EAAYpD,EAAUx4B,EAAM,eAChC,CAACA,EAAM,eAAkBA,EAAM,eAAiB,GAC5C67B,EAAkB,CAAC,QAAS,OAAQ,SAAU,aACpD,IAAIC,GAAU,EACd,MAAMC,EAASH,EAAU50B,SAAS,QAGlC,GAAG2O,EAAImlB,eAAe7B,EAAW,KAAM,CAIrC,GAHA4C,EAAgBpzB,KAAK,SAAU,MAAO,SAGnCmzB,EAAU50B,SAAS,UACpB,GAAwB,IAArB40B,EAAUr4B,OACX,MAAM,IAAIyT,EACR,mFAEA,qBACA,CAAC6B,KAAM,4BAA6BsX,QAASgJ,SAE5C,GAAGyC,EAAU50B,SAAS,WAC3B,GAAG40B,EAAU7jB,KAAKzX,GACR,WAARA,GAA4B,QAARA,GAAyB,WAARA,GAC7B,SAARA,GACA,MAAM,IAAI0W,EACR,qHAEA,qBACA,CAAC6B,KAAM,4BAA6BsX,QAASgJ,SAIjD2C,GAAWF,EAAUr4B,SAAWw4B,EAAS,EAAI,GAG/C,GAAGH,EAAU50B,SAAS,WAGpBwyB,EAAQ,SAAWA,EAAQ,UAAY,OAGnC,CAAC,MAAO,UAAUxyB,SAASwyB,EAAQ,WACrC,MAAM,IAAIxiB,EACR,+EAEA,qBACA,CAAC6B,KAAM,uBAAwBsX,QAASgJ,SAM9C2C,IAAYxD,EAASt4B,EAAM,eAG3B87B,GAAWF,EAAUr4B,QAAU,EASjC,GALAu4B,GAAWF,EAAUjjB,MAAMvZ,GAAKy8B,EAAgB70B,SAAS5H,IAGzD08B,KAAaC,GAAUH,EAAU50B,SAAS,WAEtC80B,EACF,MAAM,IAAI9kB,EACR,mFAC2B6kB,EAAgBv3B,KAAK,MAChD,qBACA,CAACuU,KAAM,4BAA6BsX,QAASgJ,IAGjD,GAAGK,EAAQiC,UACRG,EAAUjjB,MAAMvZ,GAAK,CAAC,SAAU,QAAQ4H,SAAS5H,IAClD,MAAM,IAAI4X,EACR,2GAC2C,qBAC3C,CAAC6B,KAAM,2BAA4BsX,QAASgJ,IAIhDK,EAAQ,cAAgBoC,EAI1B,GAAG,WAAY57B,EAAO,CACpB,KAAK,eAAgBA,KAAWw5B,EAAQ,cAAcxyB,SAAS,UAC7D,MAAM,IAAIgQ,EAER,iEAAIhX,EAAM,uBAAuBgS,MAAU,qBAC3C,CAAC6G,KAAM,0BAA2BsX,QAASgJ,IAE/C,IAAIX,EAAUx4B,EAAM,YAA+C,IAAjCA,EAAM,UAAU+D,QAAQ,KACxD,MAAM,IAAIiT,EAER,0DAAIhX,EAAM,uBAAuBgS,MAAU,qBAC3C,CAAC6G,KAAM,0BAA2BsX,QAASgJ,IAE/CK,EAAQ,UAAYx5B,EAAM,UAQ5B,GAJG,aAAcA,IACfw5B,EAAQ,YAAcx5B,EAAM,aAG3B,cAAeA,KAAW,UAAWA,GAAQ,CAC9C,IAAIqT,EAAWrT,EAAM,aACrB,GAAgB,OAAbqT,IAAsBmlB,EAAUnlB,GACjC,MAAM,IAAI2D,EACR,6EACqB,qBACrB,CAAC6B,KAAM,2BAA4BsX,QAASgJ,IAIhC,OAAb9lB,IACDA,EAAWA,EAASzI,eAEtB4uB,EAAQ,aAAenmB,EAIzB,GAAG,YAAarT,EAAO,CACrB,GAAGgS,EAAKhN,MAAM,QACZ,MAAM,IAAIgS,EACR,sEACA,qBACA,CAAC6B,KAAM,0BAA2BsX,QAASgJ,IAE/C,GAAGxjB,EAAI0jB,UAAUG,EAAQ,QACvB,MAAM,IAAIxiB,EACR,+DACA,qBACA,CAAC6B,KAAM,0BAA2BsX,QAASgJ,IAE/C,GAA+B,kBAArBn5B,EAAM,WAGd,MAAM,IAAIgX,EACR,qEACA,qBACA,CAAC6B,KAAM,wBAAyBsX,QAASgJ,IAL3CK,EAAQE,SAA+B,IAArB15B,EAAM,WAS5B,GAAG,eAAgBA,EAAO,CACxB,MAAMg8B,EAAYh8B,EAAM,cACxB,GAAiB,OAAdg8B,GAAoC,QAAdA,GAAqC,QAAdA,EAC9C,MAAM,IAAIhlB,EACR,0EAEA,qBACA,CAAC6B,KAAM,yBAA0BsX,QAASgJ,IAE9CK,EAAQ,cAAgBwC,EAG1B,GAAG,UAAWh8B,EAAO,CACnB,MAAMi8B,EAAOj8B,EAAM,SACnB,IAAIw4B,EAAUyD,IAAmB,UAATA,GAA0C,IAAtBA,EAAKl4B,QAAQ,KACvD,MAAM,IAAIiT,EACR,yGAEA,qBACA,CAAC6B,KAAM,sBAAuBsX,QAASgJ,IAE3CK,EAAQ,SAAWyC;2CAIrB;MAAMvrB,EAAK8oB,EAAQ,OACnB,GAAU,aAAP9oB,GAA4B,cAAPA,EACtB,MAAM,IAAIsG,EACR,oEACA,qBAAsB,CAAC6B,KAAM,wBAAyBsX,QAASgJ,IAInE,GAAGmC,GAAmBA,EAAgBhB,YAAcT,IAGlDZ,EAAUqB,UAAUtoB,IAAQ,EAC5BwnB,EAAQc,WAAY,GA4fxB,SAAS4B,EAAatb,EAAIub,GAExB,IAAMvb,GAAoB,iBAAPA,IACbub,GAAoB,iBAAPA,EACjB,OAAOvb,IAAOub,EAGhB,MAAMC,EAAUvmB,MAAMD,QAAQgL,GAC9B,GAAGwb,IAAYvmB,MAAMD,QAAQumB,GAC3B,OAAO,EAET,GAAGC,EAAS,CACV,GAAGxb,EAAGrd,SAAW44B,EAAG54B,OAClB,OAAO,EAET,IAAI,IAAIxE,EAAI,EAAGA,EAAI6hB,EAAGrd,SAAUxE,EAC9B,IAAIm9B,EAAatb,EAAG7hB,GAAIo9B,EAAGp9B,IACzB,OAAO,EAGX,OAAO,EAGT,MAAMs9B,EAAM58B,OAAO4W,KAAKuK,GAClB0b,EAAM78B,OAAO4W,KAAK8lB,GACxB,GAAGE,EAAI94B,SAAW+4B,EAAI/4B,OACpB,OAAO,EAET,IAAI,MAAMg5B,KAAM3b,EAAI,CAClB,IAAI1G,EAAK0G,EAAG2b,GACRpiB,EAAKgiB,EAAGI,GAQZ,GANU,eAAPA,GACE1mB,MAAMD,QAAQsE,IAAOrE,MAAMD,QAAQuE,KACpCD,EAAKA,EAAGlW,QAAQsH,OAChB6O,EAAKA,EAAGnW,QAAQsH,SAGhB4wB,EAAahiB,EAAIC,GACnB,OAAO,EAGX,OAAO,EAriBD+hB,CAAaZ,EAAiB9B,IAAU,CAC1C,MAAMe,EAAiB7wB,GAAWA,EAAQ6wB,eAAkB,QAC5D,GAAqB,UAAlBA,EACD,MAAM,IAAIvjB,EACR,8CAA8ChF,gCAE9C,qBACA,CAAC6G,KAAM,8BAA+BsX,QAASgJ,EAAUnnB,SACtD,GAAqB,SAAlBuoB,EAGR,YADA32B,QAAQlB,KAAK,uCAAwC,CAACsP,SAGxD,MAAM,IAAIgF,EACR,yBACA,qBACA,CAAC6B,KAAM,yBAA0BsX,QAASgJ,EAAUnnB,OAClDuoB,oBAmBV5kB,EAAI6mB,UAAY,CAACvD,EAAWj5B,EAAOk5B,EAAYxvB,IACtCsvB,EAAWC,EAAWj5B,EAAOk5B,OAAYxrB,OAAWA,EACzDhE,GAgHJiM,EAAIglB,kBAAoBjxB,IACtB,MAAMpJ,EAAMm8B,KAAKC,UAAU,CAAC5B,eAAgBpxB,EAAQoxB,iBAC9C6B,EAAS7D,EAAsBl5B,IAAIU,GACzC,GAAGq8B,EACD,OAAOA,EAGT,MAAMC,EAAiB,CACrB9B,eAAgBpxB,EAAQoxB,eACxBhM,SAAU,IAAItX,IACdqlB,QAAS,KACTC,WAoBF,WACE,MAAM7D,EAAY/xB,KAGlB,GAAG+xB,EAAU4D,QACX,OAAO5D,EAAU4D,QAEnB,MAAMA,EAAU5D,EAAU4D,QAAU,GAG9BE,EAAe9D,EAAU8D,aAAe,GACxCC,EAAc,GAGdC,GAAmBhE,EAAU,cAAgB,SAASruB,cAGtDsyB,EAAmBjE,EAAU,cAI7BnK,EAAWmK,EAAUnK,SACrBpN,EAAQ,IAAIoN,EAASzY,QAAQ/K,KAAKutB,GACxC,IAAI,MAAM7mB,KAAQ0P,EAAO,CACvB,MAAM8X,EAAU1K,EAASlvB,IAAIoS,GAC7B,GAAe,OAAZwnB,EACD,SAGF,IAAIoC,EAAYpC,EAAQ,eAAiB,QAGzC,GAFAoC,EAAY,GAAGnuB,OAAOmuB,GAAWtwB,OAAOhH,KAAK,IAEvB,OAAnBk1B,EAAQ,OACT,SAGF,MAAM2D,EAAMvE,EAASY,EAAQ,QAC7B,IAAI,MAAM5yB,KAAOu2B,EAAK,CACpB,IAAIC,EAAQP,EAAQj2B,GACpB,MAAMyyB,EAAY1jB,EAAI0jB,UAAUzyB,GAEhC,GAAIw2B,EAcO/D,GAAcG,EAAQmC,eAE/BqB,EAAYp2B,GAAK6B,KAAKuJ,QAZtB,GAFA6qB,EAAQj2B,GAAOw2B,EAAQ,IAEnB/D,IAAcG,EAAQmC,cAAe,CAEvCqB,EAAYp2B,GAAO,CAACoL,GACpB,MAAMqrB,EAAiB,CAACz2B,MAAK8a,MAAOsb,EAAYp2B,IAC7CA,EAAI,KAAMm2B,EACXA,EAAan2B,EAAI,IAAI6B,KAAK40B,GAE1BN,EAAan2B,EAAI,IAAM,CAACy2B,GAmB9B,GAVID,EAAMxB,KACRwB,EAAMxB,GAAa,CACjB,YAAa,GACb,QAAS,GACT,OAAQ,KAGZwB,EAAQA,EAAMxB,GACd0B,EAAkBtrB,EAAMorB,EAAM,QAAS,SAEpC5D,EAAQiC,QAET6B,EAAkBtrB,EAAMorB,EAAM,SAAU,iBACnC,GAAwB,UAArB5D,EAAQ,SAChB8D,EAAkBtrB,EAAMorB,EAAM,QAAS,SACvCE,EAAkBtrB,EAAMorB,EAAM,aAAc,SAC5CE,EAAkBtrB,EAAMorB,EAAM,SAAU,cACnC,GAAG,UAAW5D,EAEnB8D,EAAkBtrB,EAAMorB,EAAM,SAAU5D,EAAQ,eAC3C,GAAG,cAAeA,GAAW,eAAgBA,EAAS,CAE3D,MAAMnmB,EAAWmmB,EAAQ,aACnBwC,EAAYxC,EAAQ,cAExB8D,EAAkBtrB,EAAMorB,EAAM,aAD7B/pB,GAAY2oB,EAEX,GAAG3oB,KAAY2oB,IAAYpxB,cACrByI,EACoCA,EAASzI,cAC7CoxB,EACoC,IAAIA,EAEJ,aAEtC,cAAexC,EACvB8D,EAAkBtrB,EAAMorB,EAAM,cAC3B5D,EAAQ,cAAgB,SAAS5uB,eAC5B,eAAgB4uB,EACrBA,EAAQ,cACT8D,EAAkBtrB,EAAMorB,EAAM,aAC5B,IAAI5D,EAAQ,eAEd8D,EAAkBtrB,EAAMorB,EAAM,aAAc,SAEtCF,GACRI,EAAkBtrB,EAAMorB,EAAM,aAAc,IAAIF,GAChDI,EAAkBtrB,EAAMorB,EAAM,aAAc,SAC5CE,EAAkBtrB,EAAMorB,EAAM,SAAU,WAGxCE,EAAkBtrB,EAAMorB,EAAM,aAAcH,GAC5CK,EAAkBtrB,EAAMorB,EAAM,aAAc,SAC5CE,EAAkBtrB,EAAMorB,EAAM,SAAU,WAM9C,IAAI,MAAM98B,KAAOy8B,EACfQ,EAAaR,EAAcz8B,EAAK,GAGlC,OAAOu8B,GA9IPvlB,MAuMF,WACE,MAAMkc,EAAQ,GACdA,EAAM1E,SAAWuJ,EAAK/gB,MAAMpQ,KAAK4nB,UACjC0E,EAAMlc,MAAQpQ,KAAKoQ,MACnBkc,EAAMqJ,QAAU,KAChBrJ,EAAMsJ,WAAa51B,KAAK41B,WACxBtJ,EAAM8G,UAAYjC,EAAK/gB,MAAMpQ,KAAKozB,WAC/BpzB,KAAKizB,kBACN3G,EAAM2G,gBAAkBjzB,KAAKizB,gBAAgB7iB,SAE/Ckc,EAAMgK,wBAA0Bt2B,KAAKs2B,wBAClC,UAAWt2B,OACZssB,EAAM,SAAWtsB,KAAK,UAErB,cAAeA,OAChBssB,EAAM,aAAetsB,KAAK,cAEzB,WAAYA,OACbssB,EAAM,UAAYtsB,KAAK,WAEzB,OAAOssB,GA1NPgK,wBAiOF,WACE,IAAIt2B,KAAKizB,gBACP,OAAOjzB,KAET,OAAOA,KAAKizB,gBAAgB7iB,SApO5BgjB,UAAW,IASb,OAziCqC,MAmiClCxB,EAAsB2E,MAGvB3E,EAAsB4E,QAExB5E,EAAsBrhB,IAAInX,EAAKs8B,GACxBA,EA8IP,SAASW,EAAaI,EAAQr9B,EAAKs9B,GACjC,MAAMtlB,EAAUqlB,EAAOr9B,GACjByjB,EAAO4Z,EAAOr9B,GAAO,GAE3B,IAAIsG,EACAi3B,EACJ,IAAI,MAAMT,KAAS9kB,EACjB1R,EAAMw2B,EAAMx2B,IAEVi3B,EADCD,GAAOh3B,EAAIrD,OACH,GAEAqD,EAAIg3B,GAEZC,KAAU9Z,EACXA,EAAK8Z,GAAQp1B,KAAK20B,GAElBrZ,EAAK8Z,GAAU,CAACT,GAIpB,IAAI,MAAM98B,KAAOyjB,EACJ,KAARzjB,GAGHi9B,EAAaxZ,EAAMzjB,EAAKs9B,EAAM,GAWlC,SAASN,EAAkBtrB,EAAMorB,EAAOU,GAClCV,EAAMx8B,eAAek9B,KACvBV,EAAMU,GAAuB9rB,KAuDnC2D,EAAIooB,gBAAkB,CAAC1D,EAAK/5B,EAAK0U,KAE/B,GAAW,OAAR1U,EAAc,CACf,GAAY,aAAT0U,EACD,OAEF,OAAO,KAIT,GAAGqlB,EAAIvL,SAASsM,IAAI96B,GAAM,CACxB,MAAM88B,EAAQ/C,EAAIvL,SAASlvB,IAAIU,GAE/B,GAAGm4B,EAAazjB,GAEd,OAAOooB,EAET,GAAGA,EAAMx8B,eAAeoU,GAEtB,OAAOooB,EAAMpoB,GAKjB,MAAY,cAATA,GAAwBA,KAAQqlB,GAKvB,eAATrlB,GAAyBA,KAAQqlB,EAJ3BA,EAAIrlB,GAQD,aAATA,EAGI,UAHP,GAcFW,EAAImlB,eAAiB,CAAC7B,EAAW+E,IAC5BA,EAAQjvB,YAAc,OACfkqB,EAAU6B,gBAChB7B,EAAU6B,gBAAkB,WAAakD,EAAQjvB,WAEf,gBAA7BkqB,EAAU6B,eAWrBnlB,EAAI0jB,UAAYtjB,IACd,IAAIyiB,EAAUziB,IAAe,MAATA,EAAE,GACpB,OAAO,EAET,OAAOA,GACL,IAAK,QACL,IAAK,aACL,IAAK,WACL,IAAK,WACL,IAAK,aACL,IAAK,SACL,IAAK,YACL,IAAK,SACL,IAAK,MACL,IAAK,YACL,IAAK,SACL,IAAK,QACL,IAAK,YACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,eACL,IAAK,UACL,IAAK,YACL,IAAK,aACL,IAAK,cACL,IAAK,WACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,WACL,IAAK,SACH,OAAO,EAEX,OAAO,I,qwBCx1CT,IAAMkoB,EAAW,CACf,WAAW,EACX,eAAe,EACf,uBAAuB,EACvB,yBAAyB,EACzB,aAAa,EACb,uBAAuB,GAInBC,EAAsB,CAC1B,IAAOj8B,IACP,IAAOA,IACP,GAAM,UACN,IAAO,cACP,GAAM,UACN,IAAO,UACP,KAAQ,YACR,IAAO,YAQHk8B,EAAQ,SAAC//B,GACb,MAAO,CACLggC,KAAMxuB,YAAU,mCAAoCxR,GACpDigC,KAAMzuB,YAAU,mCAAoCxR,GACpDkgC,MAAO1uB,YAAU,oCAAqCxR,GACtDgS,IAAKR,YAAU,8CAA+CxR,GAC9DmgC,KAAM3uB,YAAU,wCAAyCxR,GACzDogC,GAAI5uB,YAAU,mCAAoCxR,GAClDqgC,IAAK7uB,YAAU,4BAA6BxR,KAG1CgC,EAAK+9B,IAyGLO,EAOJ,WAAaC,EAA4BtK,GAAgB,+DACvDntB,KAAKy3B,SAAWA,EAEhBz3B,KAAKmtB,IAAMA,G,IAVTqK,E,sBAcAE,E,yHAWJ,SACEnhB,EAEAohB,EAEAn1B,GAKA,IAAI8jB,EAAK/P,EAAQuI,MAKjB,GAJK9e,KAAKmtB,MACRntB,KAAKmtB,IAAMD,WAAcyK,IAGL,gBADX33B,KAAKmtB,IAAIxE,gBACXllB,SAEP,OAAO8S,EAAQqhB,UAAUp1B,EAAS,uBAChCA,EAAQq1B,SAAU/+B,MAAO,eAE7B,IAAI8iB,EAAS,IAAIkc,IAAUxR,GAC3B,IACE1K,EAAOD,MAAM3b,KAAKmtB,IAAK3qB,EAAQu1B,SAASj/B,MAAO0J,EAAQu1B,UACvD,MAAOC,GACP,OAAOzhB,EAAQqhB,UAAUp1B,EAAS,iCAAmCw1B,EACnE,eAMJ,OAJKx1B,EAAQy1B,QACX3R,EAAG7V,IAAIjO,EAAQu1B,SAAU7+B,EAAGgQ,IAAI,QAAShQ,EAAGg+B,KAAK,eAAgB3gB,EAAQO,SAGpEP,EAAQ2hB,UAAU11B,EAASxC,KAAKy3B,a,uBAzCzC,WACE,MAAO,kB,sBAGT,SAAiBlhB,GACfA,EAAQ4hB,WAAWp9B,KAAqB,CACtC,EAAK,Q,GAPiBy8B,GA6C5BE,EAAc3d,QAAU,IAAItb,OAAO,yB,IAE7B25B,E,yHASJ,SACE7hB,EACAohB,EACAn1B,GAKA,IAAIxB,EAAUuzB,EACTv0B,KAAKmtB,MACRntB,KAAKmtB,IAAMD,WAAcyK,IAE3B,IAAIrR,EAAK/P,EAAQuI,MAGbuZ,EAAQr4B,KAAKmtB,IAAImL,qBAAqB,SACtCD,EAAMh8B,OAAS,GACjBiqB,EAAG7V,IAAIjO,EAAQq1B,SAAU3+B,EAAGo+B,GAAG,SAAUhR,EAAGld,WAAWgC,QAAQitB,EAAM,GAAG/0B,aACtEd,EAAQq1B,UAMZ,IADA,IAAIU,EAAQv4B,KAAKmtB,IAAImL,qBAAqB,QACjC/8B,EAAIg9B,EAAMl8B,OAAS,EAAGd,GAAK,EAAGA,IAErCg5B,GAAU,GADVvzB,EAAWu3B,EAAMh9B,GAAGmxB,aAAa,UAG/B1rB,EAAWu3B,EAAMh9B,GAAGmxB,aAAa,OACjC6H,GAAU,GAERvzB,GACFuV,EAAQiiB,SAASh2B,EAAQu1B,SAAU/2B,EACjCu3B,EAAMh9B,GAAGmxB,aAAa,QAAmBlqB,EAAQq1B,SAAUtD,GAMjE,IADA,IAAIkE,EAAUz4B,KAAKmtB,IAAImL,qBAAqB,UACnCzgC,EAAI,EAAGA,EAAI4gC,EAAQp8B,OAAQxE,IAAK,CACvC,IAAIsP,EAAcsxB,EAAQ5gC,GAAG60B,aAAa,QACtCqK,EAAS5vB,KAEXuxB,YAASD,EAAQ5gC,GAAGyL,YAAuBgjB,EAAI9jB,EAAQu1B,SAASj/B,MAAOqO,GAEvEuxB,YAASD,EAAQ5gC,GAAGyL,YAAuBgjB,EAAI9jB,EAAQu1B,SAASj/B,MAAOqO,IAQ3E,GAJK3E,EAAQy1B,QACX3R,EAAG7V,IAAIjO,EAAQq1B,SAAU3+B,EAAGgQ,IAAI,QAAShQ,EAAGg+B,KAAK,WAAY3gB,EAAQO,UAGlEtU,EAAQm2B,QAAUpL,IACrB,IACEA,YAAavtB,KAAKmtB,IAAK7G,EAAI9jB,EAAQu1B,SAASj/B,OAC5C,MAAOk/B,GAEP,IAAIp8B,EAAM,yBAA2B4G,EAAQq1B,SAAW,cAAgBG,EAAM,MAAQA,EAAIrwB,MAC1F,OAAO4O,EAAQqhB,UAAUp1B,EAA4B5G,EAAK,eAI9D,OAAO2a,EAAQ2hB,UAAU11B,EAA4BxC,KAAKy3B,a,uBAvE5D,WACE,MAAO,iB,sBAGT,SAAiBlhB,GACfA,EAAQ4hB,WAAW/8B,KAAoB,O,GANhBo8B,GA2E3BY,EAAare,QAAU,IAAItb,OAAO,qB,IAE5Bm6B,E,yHAUJ,SACEriB,EACAohB,EACAn1B,GAUA,IAJA,IAAI2qB,EAAMD,WAAcyK,GAIfz/B,EAAI,EAAGA,EAAIi1B,EAAI3oB,WAAWnI,OAAQnE,IAEzC,GAAmC,IAA/Bi1B,EAAI3oB,WAAWtM,GAAG6K,SAAgB,CAEpC,IAAI7J,EAAKi0B,EAAI3oB,WAAWtM,GAAG8uB,aAG3B,GAAI9tB,GAAMA,IAAOA,EAAE,IAKjB,OAJAqd,EAAQsiB,UAAUr2B,EAAQs2B,IACxB,iEAEe,IAAIpB,EAAc13B,KAAKy3B,SAAUtK,GAChCxR,MAAMpF,EAASohB,EAAcn1B,GAGjD,MAMJ,GAAI2qB,EAAIP,UAEmB,SAArBO,EAAIP,QAAQx0B,MACZ+0B,EAAIP,QAAQC,SAAS/uB,MAAM,2BAC3BqvB,EAAIP,QAAQE,SAAShvB,MAAM,mCAK7B,OAJAyY,EAAQsiB,UAAUr2B,EAAQs2B,IACxB,oDAEiB,IAAIV,EAAap4B,KAAKy3B,SAAUtK,GAC/BxR,MAAMpF,EAASohB,EAAcn1B,GAKrD,IAAIu2B,EAAO5L,EAAImL,qBAAqB,QAAQ,GAC5C,GAAIS,EAAM,CACR,IAAIC,EAAQD,EAAKrM,aAAa,SAC9B,GAAIsM,GAASA,EAAMl7B,MAAM,qCAKvB,OAJAyY,EAAQsiB,UAAUr2B,EAAQs2B,IACxB,mEAEiB,IAAIV,EAAap4B,KAAKy3B,SAAUtK,GAC/BxR,MAAMpF,EAASohB,EAAcn1B,GASrD,OAAO+T,EAAQqhB,UAAUp1B,EACvB,iEACAm1B,EAAa76B,MAAM,EAAG,IAAK,Q,uBA5E/B,WACE,MAAO,e,sBAGT,SAAiByZ,GACfA,EAAQ4hB,WAAW,YAAc,CAAE,EAAK,IACxC5hB,EAAQ4hB,WAAW,mBAAqB,CAAE,EAAK,Q,GAP1BX,GAgFzBoB,EAAW7e,QAAU,IAAItb,OAAO,8B,IAE1Bw6B,E,yHAWJ,SACE1iB,EACAohB,EACAn1B,GAMA,IAAI8jB,EAAK/P,EAAQuI,MAIjB,GAAIoa,EAAMvB,GAKR,OAJAphB,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,wFAGZ,IAAIV,EAAap4B,KAAKy3B,UACrB9b,MAAMpF,EAASohB,EAAcn1B,GAInD,GAyKJ,SAAkBm1B,GAChB,IAAMwB,EAAexB,EAAa96B,QAAQ,kBACpCu8B,EAAazB,EAAa96B,QAAQ,KACxC,IAAsB,IAAlBs8B,IAAuC,IAAhBC,GAAqBD,EAAeC,EAC7D,OAAO,EAET,OAA0F,IAAnFzB,EAAapb,OAAO4c,EAAcC,EAAaD,GAAct8B,QAAQ,SA/KtEw8B,CAAQ1B,GAKV,OAJAphB,EAAQsiB,UAAUr2B,EAAQs2B,IACxB,mDAEiB,IAAIV,EAAap4B,KAAKy3B,UACrB9b,MAAMpF,EAASohB,EAAcn1B,GAInD,GA8KJ,SAAkBm1B,GAEhB,QADcA,EAAa75B,MAAM,gFA/K3Bw7B,CAAQ3B,GAKV,OAJAphB,EAAQsiB,UAAUr2B,EAAQs2B,IACxB,oEAEiB,IAAIV,EAAap4B,KAAKy3B,UACrB9b,MAAMpF,EAASohB,EAAcn1B,GAKnD,IAAI+2B,EAAc,IAAI96B,OAAO,8BAA+B,MAAOtB,KAAKw6B,GAQxE,OAPI4B,GACFjT,EAAG7V,IAAIjO,EAAQq1B,SAAU3+B,EAAGo+B,GAAG,SAAUhR,EAAGld,WAAWgC,QAAQmuB,EAAW,IACxE/2B,EAAQq1B,UAEZvR,EAAG7V,IAAIjO,EAAQq1B,SAAU3+B,EAAGgQ,IAAI,QAAShQ,EAAGg+B,KAAK,WAAY3gB,EAAQO,SACrEP,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,+CAExBviB,EAAQ2hB,UAAU11B,EAASxC,KAAKy3B,a,uBA3DzC,WACE,MAAO,gB,sBAGT,SAAiBlhB,GACfA,EAAQ4hB,WAAW,aAAe,CAChC,EAAK,Q,GAPeX,GA+D1ByB,EAAYlf,QAAU,IAAItb,OAAO,a,IAE3B+6B,E,yHASJ,SACEjjB,EACAohB,EACAn1B,EAKAi1B,GAEA,IAAMnR,EAAK/P,EAAQuI,MACnB,OAAO,IAAI2a,SAAQ,SAAC1G,EAAS2G,GAC3B,IACEC,YAAchC,EAAcrR,EAAI9jB,EAAQu1B,SAASj/B,OAAO,WACtDi6B,EAAQxc,EAAQ2hB,UAAU11B,EAASi1B,OAErC,MAAOO,GACP,IAAMp8B,EAAM,yBAA2B4G,EAAQq1B,SAC7C,iBAAmBG,EACrBjF,EAAQxc,EAAQqhB,UAAUp1B,EAAS5G,EAAK,cAAe67B,W,uBA3B7D,WACE,MAAO,kB,sBAET,SAAiBlhB,GACfA,EAAQ4hB,WAAW,uBAAyB,CAC1C,EAAK,Q,GANiBX,GAiC5BgC,EAAczf,QAAU,wB,IAElB6f,E,yHAWJ,SACErjB,EACAohB,EACAn1B,GASA,OAAI02B,EAAMvB,IACRphB,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,YAAct2B,EAAQq1B,SAAtB,qFAId,IAAIe,EAAW54B,KAAKy3B,UACnB9b,MAAMpF,EAASohB,EAAcn1B,IAI7Cm1B,EAAa76B,MAAM,EAAG,KAAKgB,MAAM,WACnCyY,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,uFAGd,IAAIF,EAAW54B,KAAKy3B,UACnB9b,MAAMpF,EAASohB,EAAcn1B,KAIjD+T,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,gDAExBviB,EAAQ2hB,UAAU11B,EAASxC,KAAKy3B,c,uBA3CzC,WACE,MAAO,gB,sBAGT,SAAiBlhB,GACfA,EAAQ4hB,WAAW,cAAgB,CACjC,EAAK,Q,GAPeX,GA+C1BoC,EAAY7f,QAAU,IAAItb,OAAO,c,IAE3Bo7B,E,yHAmBJ,SACEtjB,EACAohB,EACAn1B,EAIAi1B,GAGA,IAAInR,EAAK/P,EAAQuI,MACbnlB,EAAImgC,YAASxT,EAAIA,EAAI9jB,EAAQu1B,SAASj/B,MAAO0J,EAAQu1B,SAASj/B,MAChE,KAAM,KAAM,GAAI,MAElB,IACEa,EAAEgnB,QAAQgX,GACV,MAAOK,GACP,IAAIp8B,EAAM,yBAA2B4G,EAAQq1B,SAC3C,mBAAqBG,EACvB,OAAOzhB,EAAQqhB,UAAUp1B,EAAS5G,EAAK,cAAe67B,GAMxD,OAHAlhB,EAAQsiB,UAAUr2B,EAAQs2B,IAAK,cAAgBn/B,EAAE+lB,eAAiB,eAAiB/lB,EAAEiO,MAAQ,WAC7F2O,EAAQuI,MAAMrO,IAAIjO,EAAQu1B,SAAU7+B,EAAGgQ,IAAI,QAAShQ,EAAGg+B,KAAK,eAAgB3gB,EAAQO,SAE7EP,EAAQ2hB,UAAU11B,EAASxC,KAAKy3B,a,uBA3CzC,WACE,MAAO,c,sBAGT,SAAiBlhB,GACfA,EAAQ4hB,WAAW,WAAa,CAC9B,EAAK,OAOP5hB,EAAQ4hB,WAAW,eAAiB,CAClC,EAAK,O,GAfaX,GA+CxBqC,EAAU9f,QAAU,IAAItb,OAAO,gDAE/B,IAAMs7B,EAAkB,CACtBrC,gBAAeU,eAAcQ,aAAYK,cAAaW,cAAaC,YAAWL,iBAYhF,SAASN,EAAOvB,GAEd,QADcA,EAAa75B,MAAM,oC,IAiFdk8B,E,WA2CnB,WAAalb,GAA8C,WAAvBtc,EAAuB,uDAAJ,GAUrD,GAVyD,0bACzDxC,KAAK8e,MAAQA,GAAS,IAAI7K,IAC1BjU,KAAK9G,GAAK+9B,EAAMj3B,KAAK8e,MAAM1V,YAC3BpJ,KAAKi6B,QAAUz3B,EAAQy3B,SAAW,IAGlCj6B,KAAKk6B,OAAS13B,EAAQ23B,YACW,IAAXC,IAA2BA,EAAOC,cAAgBD,EAAOE,aAC9C,oBAAX9iC,SAA2BA,OAAO6iC,cAAgB7iC,OAAO8iC,aACjEC,KACTv6B,KAAKk6B,OACR,MAAM,IAAIr6B,MAAM,4CAGlBG,KAAK8W,QAAU9W,KAAK8e,MAAM1V,WAAWS,YACrC7J,KAAK8e,MAAMvI,QAAUvW,KACrBA,KAAKw6B,UAAY,GACjBx6B,KAAKy6B,SAAW,GAChBz6B,KAAK06B,aAAe,GACpB16B,KAAK26B,WAAa,GAClB36B,KAAK46B,eAAiB,GACtB56B,KAAK66B,YAAc,GACnB76B,KAAK86B,SAAW,GAChB96B,KAAK+6B,SAAW,GAChB/6B,KAAKm4B,WAAa,CAChB,UAAW,CAAE,EAAK,IAClB,MAAO,CAAE,EAAK,KAMhBjL,cAAiBltB,KAAM,CAAC,UAAW,OAAQ,UAAW,UAAW,SAEjEzH,OAAO4W,KAAK3M,EAAQu4B,UAAYhB,GAAiB5zB,KAAI,SAAA/M,GAAG,OAAI,EAAK4hC,WAAWjB,EAAgB3gC,O,sCAoK9F,SACEwD,GAE2E,WAD3E4F,EAC2E,uDADxD,GAGnB,GADAA,EAAUjK,OAAOyY,OAAO,GAAIxO,GACxB5F,aAAe+R,MACjB,OAAO8qB,QAAQwB,IAAIr+B,EAAIuJ,KAAI,SAAC5K,GAC1B,OAAO,EAAK2/B,KAAK3/B,EAAGhD,OAAOyY,OAAO,GAAIxO,QAI1C,IAAM24B,EAA4Bv+B,EAE9BszB,EAASvwB,YAAUw7B,GACvBjL,EAASA,EAAOjwB,MAAM,KAAK,GAE3BuC,EAAUxC,KAAKo7B,iBAAiBlL,EAAQ1tB,GAExC,IAAM64B,EAAqBr7B,KAAKo7B,iBAAiBlL,EAAQ1tB,GAEzD,OAAOxC,KAAKs7B,oBAAoBpL,EAAQmL,EAAmBpc,QAASoc,K,iCAGtE,SACEz+B,EACA2+B,EACA/4B,GACiB,IACbg5B,EADa,OAkBjB,OAdKh5B,EAAQi5B,OAASz7B,KAAK26B,WAAWY,GACpCC,EAAiBx7B,KAAK26B,WAAWY,IAEjCC,EAAiB/B,QACdiC,KAAK,CACJ17B,KAAK27B,kBAAkB/+B,EAAK4F,GAC5BxC,KAAK47B,SAASh/B,EAAK4F,KAEvBxC,KAAK26B,WAAWY,GAAeC,EAG/Bx7B,KAAK67B,oBAAoBN,OAAa/0B,EAAWxG,KAAKi6B,UAGjDuB,EAAeM,MAAK,SAAAvgC,GAKzB,OAJIqB,KAAO,EAAK69B,WACd,EAAKA,SAAS79B,GAAK8F,QAAQq5B,qBACpB,EAAKtB,SAAS79B,IAEhBrB,O,iCAOX,SACEggC,EACAS,EACA/B,GACA,gBACiBzzB,IAAbw1B,GACFt/B,QAAQlB,KAAK,0BAEfwE,KAAKy6B,SAASc,IAAgBv7B,KAAKy6B,SAASc,IAAgB,IAAIh1B,OAAO0qB,YAAW,WAC3E,EAAKgL,UAAUV,WACX,EAAKZ,WAAWY,KAExBtB,M,8BAGL,SACEr9B,EACA4F,GAEA,IAAI8jB,EAAKtmB,KAAK8e,OAEDtc,EAAQ05B,QAA2C,QAAjC15B,EAAQ05B,OAAOC,gBAE5C35B,EAAQi5B,OAAQ,GAGlBj5B,EAAQq1B,SAAWvR,EAAGld,WAAWP,UAAUjM,GAC3C4F,EAAQyc,QAAUzc,EAAQyc,SAAWriB,EACrC4F,EAAQu1B,SAAWzR,EAAGld,WAAWP,UAAUrG,EAAQyc,SACnDzc,EAAQs2B,IAAMxS,EAAGnO,QACjB3V,EAAQoO,QAAUpO,EAAQoO,SAAW,IAAIwrB,UAErC55B,EAAQ2E,cAEV3E,EAAQoO,QAAQ,gBAAkBpO,EAAQ2E,aAGxC3E,EAAQi5B,QACVj5B,EAAQ65B,MAAQ,YAGlB,IAAIC,EAAet8B,KAAKs8B,eAExB95B,EAAQoO,QAAR,OAA4B0rB,EAE5B,IAAIC,EAAevC,EAAQwC,gBAAgB5/B,GAC3C4F,EAAQ+5B,aAAeA,EAEvBvC,EAAQyC,eAAeF,EAAc/5B,GAErC,IAAIk6B,EAAiB1C,EAAQ2C,iBAAiBJ,GAM9C,OALIA,IAAiBG,IACnBl6B,EAAQo6B,WAAY,GAEtBp6B,EAAQk6B,eAAiBA,EAElBl6B,I,sBAWT,SAAU0tB,EAAgB1tB,GAAkE,WAC1F,IAAK0tB,EACH,OAAOuJ,QAAQC,OAAO,IAAI75B,MAAM,8BAGlC,GAAIm6B,EAAQ6C,oBAAoB3M,GAC9B,OAAOlwB,KAAK43B,UAAUp1B,EAAS,gCAAiC,wBAGlE,IAAIs6B,EAAQ98B,KAAKswB,SAASJ,GAE1B,GAAK1tB,EAAQi5B,aAgCJz7B,KAAK66B,YAAY3K,OAhCN,CAClB,GAAc,YAAV4M,EACF,OAAOrD,QAAQ1G,QAEb/yB,KAAKk4B,UAAU11B,EAAS,CACtBu6B,OAAQ,IACR3M,IAAI,EACJ4M,WAAY,oCAIlB,GAAc,WAAVF,GAAiD,MAA3B98B,KAAKw6B,UAAUtK,GAAiB,CACxD,IAAItV,EAAU,sBAAwB5a,KAAKw6B,UAAUtK,GAEjD+M,EAAkC,CACpChJ,IAAK/D,EAEL6M,OAAQ/8B,KAAKw6B,UAAUtK,GACvB8M,WAAYpiB,EACZ+c,aAAc/c,EACdhK,QAAS,IAAIwrB,UACbhM,IAAI,EACJrpB,KAAM,KACNm2B,UAAU,EACV3G,KAAM,EACN0D,QAAS,GAEX,OAAOj6B,KAAK43B,UAAUp1B,EAASoY,EAC7B5a,KAAKw6B,UAAUtK,GAAS+M,IAO9Bj9B,KAAK6B,cAAc,UAAW,CAACquB,IAE/BlwB,KAAKw6B,UAAUtK,IAAU,EAEpB1tB,EAAQy1B,QACXj4B,KAAKm9B,oBAAoBjN,EAAQ1tB,GAGnC,IAAMk6B,EAAmBl6B,EAAnBk6B,eASN,OAAO18B,KAAKk6B,OAAQwC,EAA2Bl6B,GAC5Cs5B,MAAK,SAAArE,GAAQ,OAAI,EAAK2F,eAAe3F,EAAUvH,EAAQ1tB,MACxD,SAAA9G,GAEE,IAAIuhC,EAAkC,CACpChJ,IAAKyI,EACLK,OAAQ,IACRC,YAAathC,EAAMtD,MAAQ,mBAAqB,MAC7CsD,EAAM2hC,OAAS3hC,EAAMiW,MAAQjW,EAAMoS,MACtC6pB,aAAcj8B,EAAMkf,QACpBhK,QAAS,IAAIwrB,UACbhM,IAAI,EACJrpB,KAAM,KACNm2B,UAAU,EACV3G,KAAM,EACN0D,QAAS,GAGX,OADAv9B,QAAQrB,IAAI,aAAeqhC,EAAiB,+BAAiChhC,GACtE,EAAK4hC,YAAYL,EAAe/M,EAAQ1tB,Q,8BAsCrD,SACE24B,EACAoC,EACAC,GAEM,IADNh7B,EACM,uDADa,GAEb5F,EAAM+C,YAAUw7B,GAEJ,mBAAPoC,EAETC,EAAeD,OACQ,IAAPA,IAEPp+B,YAAYo+B,GAErB/6B,EAAQi7B,cAAgBF,EAGxB/6B,EAAU+6B,GAGXv9B,KAAKk7B,KAAKt+B,EAAK4F,GACbs5B,MAAK,SAAC4B,GACL,GAAIF,EACF,GAAIE,EACF,GAAKA,EAA2BtN,GAC9BoN,GAAa,EAAM,KAAME,OACpB,CAEL,IAAIC,EAAO,sBAAwBD,EAAcX,OAAS,KAAOW,EAAcV,WAAa,IACxFU,EAAc/F,eAChBgG,GAAQ,IAAMD,EAAc/F,cAE9Bj7B,QAAQrB,IAAIsiC,EAAO,aAAe/gC,GAClC4gC,GAAa,EAAOG,EAAMD,OAEvB,CACL,IAAIC,EAAQ,4CACZjhC,QAAQrB,IAAIsiC,GACZH,GAAa,EAAOG,OAGvB,SAAU3F,GACX,IAAIpd,EAAUod,EAAIpd,SAAWod,EAAIgF,WACjCpiB,EAAU,oBAAsBhe,EAAM,KAAOge,EAC7Cle,QAAQrB,IAAIuf,GACRod,EAAIP,UAAYO,EAAIP,SAASsF,SAC/BniB,GAAW,YAAcod,EAAIP,SAASsF,QAEvCS,GAAqB,EAAO5iB,EAASod,EAAIP,e,uBAShD,SAAWqB,EAAgB8E,GAEzB,IAAI/4B,EAAM,IAAIC,KACd84B,EAAgB,IAAM/4B,EAAIg5B,WAAa,IAAMh5B,EAAIi5B,aAAe,IAC9Dj5B,EAAIa,aAAe,IAAMb,EAAIk5B,kBAAoB,KAAOH,EAE1D,IAAItX,EAAKtmB,KAAK8e,MAERkf,EAAa1X,EAAG2X,IAAInF,EAAK94B,KAAK9G,GAAGg+B,KAAK,WACxCt4B,YAAao/B,GACfA,EAAWE,OAAO5X,EAAGld,WAAWgC,QAAQwyB,IAExCviC,IAAIG,KAAK,8BAAgCwiC,EAAa,IAAMJ,K,uBAYhE,SACEp7B,EAIA27B,EACAC,EACA3G,GAEAz3B,KAAK64B,UAAUr2B,EAAQs2B,IAAKqF,GAEvB37B,EAAQy1B,QACXj4B,KAAK8e,MAAMrO,IACTjO,EAAQu1B,SACR/3B,KAAK9G,GAAGg+B,KAAK,SACbl3B,KAAK8e,MAAM1V,WAAWgC,QAAQ+yB,IAIlC,IAAIE,GAAQ77B,EAAQ05B,QAAU,OAAOC,eAChB,QAATkC,GAA2B,SAATA,KAGtB77B,EAAgBq1B,SAASxwB,OAAO7E,EAAQu1B,UAK9C/3B,KAAKw6B,UAAUhsB,UAAYhM,EAAQu1B,SAASj/B,QAAUslC,EACtDp+B,KAAK6B,cAAc,OAAQ,CAACW,EAAQu1B,SAASj/B,MAAOqlC,KAGtD,IAAInG,EAAkB,IAAIn4B,MAAM,YAAcs+B,GAO9C,OAJAnG,EAAI+E,OAASqB,EACbpG,EAAIgF,WAAamB,EACjBnG,EAAIP,SAAWA,EAERgC,QAAQC,OAAO1B,K,sBAKxB,SACEuD,EACAjqB,EACA1U,EACA0K,EACAitB,GAEA,GAAK33B,EAAL,CACA,IACI0J,EADAggB,EAAKtmB,KAAK8e,MAGVjlB,EAAMysB,EAAGld,WAAWP,UAAU2F,OAAS5R,EAAK2+B,EAAYziC,QAE5D,GAAY,cAARwY,GAA+B,YAARA,GAA6B,SAARA,GACpC,gBAARA,EAAuB,CACzB,GAAIzX,EAAIf,QAAUyiC,EAAYziC,MAAS,OACvCwN,EAAYtG,KAAK9G,GAAGm+B,KAAK,gBAEzB/wB,EADiB,SAARgL,EACGgV,EAAGld,WAAWP,UAAU,mDAKxByd,EAAGld,WAAWP,UACxB2F,OAAS8vB,mBAAmBhtB,GAC1B,oDAGFijB,EACFjO,EAAG7V,IAAI5W,EAAKyM,EAAWi1B,EAAaj0B,GAEpCgf,EAAG7V,IAAI8qB,EAAaj1B,EAAWzM,EAAKyN,M,6BAIxC,SACEi3B,EACAhD,EACAiD,GAEA,GAAKD,EAAL,CASA,IACME,EAAW,6EAEXv7B,EAAUq7B,EAAWzgC,MAHX,kGAKhB,GAAe,MAAXoF,EAEJ,IAAK,IAAIrL,EAAI,EAAGA,EAAIqL,EAAQ7G,OAAQxE,IAAK,CACvC,IAAIoI,EAAQiD,EAAQrL,GAAGoI,MAAM,KACzB+b,EAAO/b,EAAM,GAAGgoB,UAAU,GAE1BruB,EADKqG,EAAM,GACJnC,MAAM2gC,GACjB,GAAS,MAAL7kC,EAAW,OACf,IAAK,IAAI6d,EAAI,EAAGA,EAAI7d,EAAEyC,OAAQob,IAAK,CACjC,IAGInG,EAHI1X,EAAE6d,GACSxX,MAAM,KAEJ,GAAGlC,QAAQ,QAAS,IACzCiC,KAAKw4B,SAAS+C,EAAajqB,EAAK0K,EAAMwiB,Q,uBAK5C,SACEh8B,EAIAi1B,GASA,OAPAz3B,KAAK64B,UAAUr2B,EAAQs2B,IAAK,SAC5B94B,KAAKw6B,UAAUh4B,EAAQu1B,SAASj/B,OAAS,OAEzCkH,KAAK6B,cAAc,OAAQ,CAACW,EAAQu1B,SAASj/B,QAE7C2+B,EAASqB,IAAMt2B,EAAQs2B,IAEhBrB,I,wBAQT,SAAYiH,EAAmB75B,GACzB7E,KAAK86B,SAAS4D,EAAI5lC,OAEfkH,KAAK86B,SAASj2B,EAAI/L,QACrBkH,KAAK2+B,YAAY95B,EAAK65B,GAEf1+B,KAAK86B,SAASj2B,EAAI/L,SACtBkH,KAAK86B,SAAS4D,EAAI5lC,QACrBkH,KAAK2+B,YAAYD,EAAK75B,M,qBAQ5B,SACEjI,GAEmB,WADnB4F,EACmB,uDADA,GAEbo8B,EAAWj/B,YAAU/C,GACvB6b,EAAM,IAAIzb,IAAgB4hC,GAAUnmB,MAExC,OADAjW,EAAQ2E,YAAc3E,EAAQ,iBAAmBA,EAAQ,iBAAmBA,EAAQ2E,aAAejM,IACvE,wBAAxBsH,EAAQ2E,YACH,IAAIsyB,SAAQ,SAAC1G,EAAS2G,GAC3BmF,YAAUpmB,EAAK,EAAKqG,MAAOrG,EAAI7b,IAAK4F,EAAQ2E,aAAa,SAAC6wB,EAAK8G,GACzD9G,EACF0B,EAAO1B,IAGPx1B,EAAQ6G,KAAOy1B,EACf,EAAKC,aAAa,MAAOniC,EAAK4F,GAC3Bs5B,MAAK,SAACrhB,GAAD,OAASsY,EAAQtY,MACtBukB,OAAM,SAACtjC,GAAD,OAAWg+B,EAAOh+B,cAKnC8G,EAAQ6G,KAAOw1B,YAAUpmB,EAAKzY,KAAK8e,MAAOrG,EAAI3f,MAAO0J,EAAQ2E,aACtDnH,KAAK++B,aAAa,MAAOH,EAAUp8B,M,qBAG5C,SAASggB,EAAcyc,EAAe93B,GAAwC,WAC5E,OAAOnH,KAAK++B,aAAa,MAAOvc,GAC7BsZ,MAAK,SAACn7B,GACL,OAAO,EAAKo+B,aACV,MACAE,EAAO,CAAE51B,KAAM1I,EAAOg3B,aAAcxwB,qB,oBAI5C,SAAQvK,EAAa4F,GAA8C,WACjE,OAAOxC,KAAK++B,aAAa,SAAUniC,EAAK4F,GACrCs5B,MAAK,SAAArE,GAKJ,OAJA,EAAK+C,UAAU59B,GAAO,IACtB,EAAKi+B,YAAYj+B,IAAO,EACxB,EAAKsiC,OAAO,EAAKpgB,MAAM1V,WAAWP,UAAUjM,IAErC66B,O,gDASb,WACEhf,GADF,iCAAApU,EAAA,6DAEE8C,EAFF,+BAEgBjM,IACdmO,EAHF,+BAGS,GAEDkN,EAAUvW,KALlB,kBAOyBuW,EAAQ2kB,KAAKziB,GAPtC,OAOQgf,EAPR,0DAUgC,MAAxB,KAAIA,SAASsF,OAVrB,wBAWMrgC,QAAQrB,IAAI,yDAA2Dod,GAX7E,oBAayBlC,EAAQwoB,aAAa,MAAOtmB,EAAI3f,MAAO,CAACuQ,OAAMlC,gBAbvE,QAaQswB,EAbR,gEAeQ/6B,QAAQrB,IAAI,iCAAmCod,EAAM,KAAzC,MAfpB,2BAkBalC,EAAQikB,UAAU/hB,EAAI3f,OAlBnC,kBAoBa2+B,GApBb,cAsBM/6B,QAAQrB,IAAI,8CAAgDod,EAAM,KAAtD,MAtBlB,sCA2BSgf,GA3BT,iE,2EAmCA,SACE0H,EACAC,EACA/1B,GAEA,IAAIuH,EAAU,CAEZ,eAAgB1V,IAChB,KAAQ8E,KAAK9G,GAAGq+B,IAAI,kBAAoB,gBAGtC6H,IACFxuB,EAAO,KAAWwuB,GAIpB,IAAI58B,EAAmB,CAAEoO,WAMzB,OAJIvH,IACF7G,EAAQuE,KAAOsC,GAGVrJ,KAAK++B,aAAa,OAAQI,EAAW38B,K,6BAG9C,SAAiB9C,GACf,IAAM9C,EAAM+C,YAAUD,GACNM,KAEJ26B,YAFI36B,KAEkB26B,WAAW/9B,KAC3CF,QAAQrB,IAAI,sCAAwCuB,GAEnB,aALnBoD,KAIQ26B,WAAW/9B,GACtB,qBALGoD,KAMG26B,WAAW/9B,WANdoD,KAQG26B,WAAW/9B,GAC1BF,QAAQrB,IAAI,2CAA6CuB,KAE3D,GAXcoD,KAWFw6B,UAAU59B,IAAmC,SAX3CoD,KAWwBw6B,UAAU59B,IACtB,WAZZoD,KAYPw6B,UAAU59B,IAAgD,MAZnDoD,KAYgCw6B,UAAU59B,GAAc,CACrE,IAAIhB,EAAM,qDAbGoE,KAamDw6B,UAAU59B,GAAhE,0BAA+FA,EAC1GF,QAAQhB,MAAME,eAdAoE,KAiBCw6B,UAAU59B,UAjBXoD,KAkBC66B,YAAYj+B,K,0BAW/B,SACEs/B,EACAf,GAG2B,IAD3B34B,EAC2B,uDADR,GAEb5F,EAAM+C,YAAUw7B,GACtB34B,EAAQ05B,OAASA,EACjB15B,EAAQuE,KAAOvE,EAAQ6G,MAAQ7G,EAAQuE,KACvCvE,EAAQi5B,OAAQ,EAChB,IAAMllB,EAAUvW,KAEhB,GAAIwC,EAAQuE,OAASvE,EAAQ2E,YAC3B,MAAM,IAAItH,MAAM,+DAQlB,OANI2C,EAAQ2E,cACT3E,EAAgBoO,QAAUpO,EAAQoO,SAAW,GAC7CpO,EAAgBoO,QAAQ,gBAAkBpO,EAAQ2E,aAErD6yB,EAAQyC,eAAe7/B,EAAK4F,GAErB,IAAIi3B,SAAQ,SAAU1G,EAAS2G,GACpCnjB,EAAQ2jB,OAAOt9B,EAAK4F,GAASs5B,MAAK,SAAArE,GAChC,GAAIA,EAASrH,GACI,QAAX8L,GAA+B,UAAXA,GAAiC,SAAXA,GAAgC,WAAXA,GACjE3lB,EAAQ8oB,gBAAiBziC,GAEvB66B,EAAS6H,KACX7H,EAAS6H,OAAOxD,MAAK,SAAAzyB,GACnBouB,EAASE,aAAetuB,EACxB0pB,EAAQ0E,MAGV1E,EAAQ0E,OAEL,CACL,IAAI77B,EAAM,cAAgB67B,EAASsF,OAC/BtF,EAASuF,aAAYphC,GAAO,KAAO67B,EAASuF,WAAa,KAC7DphC,GAAO,OAASsgC,EAAS,QAAUt/B,EAAM,IACrC66B,EAASE,eAAc/7B,GAAO,KAAO67B,EAASE,cAClD,IAAI4H,EAAiB,IAAI1/B,MAAMjE,GAC/B2jC,EAAG9H,SAAWA,EACdiC,EAAO6F,OAER,SAACvH,GAEF0B,EAAO,IAAI75B,MADD,mBAAqBq8B,EAAS,QAAUt/B,EAAM,KAAOo7B,Y,yBAerE,SACEltB,EACA00B,GACyC,WACrCC,EAAOz/B,KAAK8e,MAAM2gB,KAAK30B,GAQ3B,OAPA20B,EAAOA,EAAKt5B,KAAI,SAAAjJ,GAAC,OAAIsR,UAAYtR,OAE5BwF,SAAQ,SAAAxF,GACX,EAAK49B,SAAS59B,IAAK,KAId8C,KAAKk7B,KAAKuE,EAAM,CAAEhC,cAAe+B,M,uBAW1C,SACE/mB,EACAtH,GAMA,IAJA,IAAMmV,EAAKtmB,KAAK8e,MACVoR,EAAiBzX,EAAI3f,MACrB4mC,EAAWpZ,EAAGqZ,UAAKn5B,EAAWxG,KAAK9G,GAAGg+B,KAAK,gBAAiB5Q,EAAGld,WAAWgC,QAAQ8kB,IAE/Ev3B,EAAI,EAAGA,EAAI+mC,EAASrjC,OAAQ1D,IAAK,CACxC,IAAIinC,EAAUF,EAAS/mC,GACvB,QAAgB6N,IAAZo5B,EAAuB,CACzB,IAAInI,EAAWnR,EAAG7S,IAAImsB,EAAS5/B,KAAK9G,GAAGg+B,KAAK,aAC5C,QAAiB1wB,IAAbixB,GAA0BnR,EAAGuZ,SAASpI,EAAUz3B,KAAK9G,GAAGi+B,KAAK,YAAe7Q,EAAGuZ,SAASpI,EAAUz3B,KAAK9G,GAAGi+B,KAAK,WAAsB2I,WAAW,KAAM,CAExJ,IAAIhnB,EAAUwN,EAAGqZ,KAAKlI,EAAUz3B,KAAK9G,GAAGk+B,MAAMjmB,EAAOzN,gBAErD,OAAIoV,EAAQzc,OACHyc,EAAQ3S,KAAI,SAAA0I,GAAO,OAAOA,EAAE/V,SAG9B,Q,iCAOf,SACEo3B,EACA1tB,GAEA,IAAIs2B,EAAMt2B,EAAQs2B,IACdxS,EAAKtmB,KAAK8e,MACV0gB,EAAQh9B,EAAQi7B,cAEpBz9B,KAAK64B,UAAUr2B,EAAQs2B,IAAK,WAAat2B,EAAQoO,QAAR,QAErCzR,YAAYqgC,IACdlZ,EAAG7V,IAAI6V,EAAGld,WAAWP,UAAUqnB,GAASlwB,KAAK9G,GAAGg+B,KAAK,eAAgBsI,EAAOx/B,KAAK8W,SAG/EtU,EAAQu1B,UAAYv1B,EAAQu1B,SAASj/B,QAAUo3B,GACjD5J,EAAG7V,IAAIqoB,EAAK94B,KAAK9G,GAAGg+B,KAAK,cAAe5Q,EAAGld,WAAWgC,QAAQ5I,EAAQu1B,SAASj/B,OAC7EkH,KAAK8W,SAGT,IAAMjS,EAAM,IAAIC,KACVi7B,EAAU,IAAMl7B,EAAIg5B,WAAa,IAAMh5B,EAAIi5B,aAAe,IAC9Dj5B,EAAIa,aAAe,KAErB4gB,EAAG7V,IAAIqoB,EAAK94B,KAAK9G,GAAGm+B,KAAK,SACvB/Q,EAAGld,WAAWgC,QAAQ20B,EAAU,gBAAkB7P,GAASlwB,KAAK8W,SAGlEwP,EAAG7V,IAAIqoB,EAAK94B,KAAK9G,GAAGg+B,KAAK,gBAAiB5Q,EAAGld,WAAWgC,QAAQ8kB,GAASlwB,KAAK8W,SAC9EwP,EAAG7V,IAAIqoB,EAAK94B,KAAK9G,GAAGg+B,KAAK,UAAW5Q,EAAGhL,aAActb,KAAK8W,W,kCAG5D,SACE2gB,EACAj1B,GAIW,WACL8jB,EAAKtmB,KAAK8e,MAEZkhB,EAAe1Z,EAAGnO,QAsBtB,OApBAmO,EAAG7V,IAAIjO,EAAQs2B,IAAK94B,KAAK9G,GAAGg+B,KAAK,YAAa8I,EAAcA,GAC5D1Z,EAAG7V,IAAIuvB,EAAchgC,KAAK9G,GAAGi+B,KAAK,UAClC7Q,EAAGld,WAAWgC,QAAQqsB,EAASsF,QAAgBiD,GAC/C1Z,EAAG7V,IAAIuvB,EAAchgC,KAAK9G,GAAGi+B,KAAK,cAClC7Q,EAAGld,WAAWgC,QAAQqsB,EAASuF,YAAagD,GAG5CvI,EAAS7mB,QAAQlO,SAAQ,SAAC5J,EAAOqY,GAC/BmV,EAAG7V,IAAIuvB,EAAc,EAAK9mC,GAAGk+B,MAAMjmB,GAAS,EAAK2N,MAAM1V,WAAWgC,QAAQtS,GAAQknC,GAEnE,iBAAX7uB,GACFmV,EAAG7V,IACDjO,EAAQq1B,SACR,EAAK3+B,GAAGgQ,IAAI,QACZod,EAAGld,WAAWP,UAAUqkB,iBAAoBp0B,GAAOA,OACnDknC,MAKCA,I,2BAGT,SAAel1B,GACb,IAAI20B,EAAOz/B,KAAK8e,MAAM2gB,KAAK30B,GAC3B,QAAoB,IAAT20B,EACT,IAAK,IAAI5nC,EAAI,EAAGA,EAAI4nC,EAAKpjC,OAAQxE,IAC/BmI,KAAKigC,QAAQjgC,KAAK8e,MAAM1V,WAAWP,UAAU2F,UAAYixB,EAAK5nC,Q,qBAWpE,SACEiT,EACA0yB,GAEAx9B,KAAK6B,cAAc,UAAWgV,WAE9B7W,KAAKmwB,iBAAiBrlB,EAAM,CAAE2wB,OAAO,EAAMyE,mBAAmB,GAC5D1C,K,8BAQJ,SACE1yB,EACA0yB,GAEA,IAAI2C,EAAMngC,KAAKogC,UAAUt1B,EAAM,YAC1Bq1B,GAAQ,IAAIr7B,KAAKq7B,EAAI,IAAIvZ,YAAe,IAAI9hB,MAAO8hB,UACtD5mB,KAAKigC,QAAQn1B,EAAM0yB,GAEnBA,GAAa,EAAM,cAAe,M,qBAItC,SAAS1yB,GACP9K,KAAK8e,MAAMuhB,gBAAW75B,OAAWA,OAAWA,EAAWsE,GACnDA,EAAKhS,cACAkH,KAAKw6B,UAAUhsB,UAAY1D,EAAKhS,QAEzCkH,KAAK6B,cAAc,UAAWgV,a,sBAGhC,SAAUqZ,GACR,YAAsC,IAA3BlwB,KAAKw6B,UAAUtK,GACjB,eAC6B,IAA3BlwB,KAAKw6B,UAAUtK,GACjB,YAC6B,SAA3BlwB,KAAKw6B,UAAUtK,GACjB,UAC6B,eAA3BlwB,KAAKw6B,UAAUtK,GACjBlwB,KAAKswB,SAAStwB,KAAK06B,aAAaxK,IAEhC,W,uBAIX,SAAWA,GAIT,OAAkC,IAA3BlwB,KAAKw6B,UAAUtK,K,oBAGxB,SAAQplB,GACN9K,KAAK8e,MAAMwhB,eAAex1B,UACnB9K,KAAKw6B,UAAU1vB,EAAKhS,S,wBAG7B,SAAYynC,GACVvgC,KAAK+6B,SAASx5B,KAAKg/B,GAClBA,EAAgBC,SAASxgC,Q,gCAG5B,SACEkwB,EACA1tB,GAEA9F,QAAQrB,IAAI,mDAAqDmH,EAAQq1B,UAEzEr1B,EAAQi+B,0BAA2B,SAE5BzgC,KAAKw6B,UAAUtK,UACflwB,KAAK26B,WAAWzK,GAEvB,IAAIwQ,EAAanoC,OAAOyY,OAAO,GAAIxO,EAAS,CAAEm+B,YAAa,SAK3D,OAHA3gC,KAAK64B,UAAUr2B,EAAQs2B,IACrB,sEAEK94B,KAAKk7B,KAAKhL,EAAQwQ,K,yBAO3B,SAAa9jC,GAEX,GAAwB,oBAAbG,WAA6BA,SAAS6jC,SAC/C,OAAO,EAGT,IAAM3jC,EAAWuR,WACXgU,EAAO,GAAKzlB,SAAS6jC,SAC3B,OAAQ3jC,EAASulB,IAASvlB,EAASL,IAAQK,EAASulB,MAAWvlB,EAASL,K,yBAO1E,SACE66B,EACAvH,EACA1tB,GAEA,GAAIxC,KAAK6gC,YAAY3Q,GAAS,CAE5B,GAAI1tB,EAAQm+B,aAAuC,YAAxBn+B,EAAQm+B,cAA8Bn+B,EAAQi+B,yBACvE,OAAOzgC,KAAK8gC,mBAAmB5Q,EAAQ1tB,GAIzC,IAAIu+B,EAAW/G,EAAQgH,eAAe9Q,GAEtC,GAAI6Q,IAAav+B,EAAQo6B,UAGvB,OAFAlgC,QAAQrB,IAAI,sCAAwC0lC,GAE7C/gC,KAAKihC,gBAAgBF,EAAUv+B,GAI1C,IAAIoY,EAWJ,OAVI6c,aAAoB53B,MACtB+a,EAAU,gBAAkB6c,EAAS7c,SAErCA,EAAU6c,EAASuF,WACfvF,EAASE,eACX/c,GAAW,IAAJ,OAAQ6c,EAASE,gBAKrB33B,KAAK43B,UAAUp1B,EAASoY,EAAU6c,EAAsBsF,QAAU,IAAMtF,K,qBAIjF,SACEyJ,EACApI,EACAxS,EACA6a,GAEA,IAAIC,EAAOtI,EACX,GAAIqI,EAAQ,CACV,IAAIE,EAAS/a,EAAG7S,IAAI2tB,EAAMphC,KAAK9G,GAAGg+B,KAAK,iBACnCmK,GAAUA,EAAOvoC,QAAUqoC,GAC7B7a,EAAG7V,IAAI6V,EAAGld,WAAWP,UAAUs4B,GAASnhC,KAAK9G,GAAGgQ,IAAI,QAASg4B,EAASlhC,KAAK8W,SAG/E,OAAS,CACP,IAAM2B,EAAM6N,EAAG7S,IAAI2tB,EAAMphC,KAAK9G,GAAGg+B,KAAK,iBAKtC,GAJIze,GAAOA,EAAI3f,OACbwtB,EAAG7V,IAAI6V,EAAGld,WAAWP,UAAU4P,EAAI3f,OAAQkH,KAAK9G,GAAGgQ,IAAI,QAASg4B,EAASlhC,KAAK8W,WAEhFsqB,EAAO9a,EAAG7S,SAAIjN,EAAW8f,EAAGld,WAAWP,UAAU,qDAAsDu4B,IAC1F,MACb,IAAI3J,EAAWnR,EAAG7S,IAAI2tB,EAAM9a,EAAGld,WAAWP,UAAU,6CACpD,IAAK4uB,EAAY,MACjB,IAAI6J,EAAchb,EAAG7S,IAAKgkB,EAAwBnR,EAAGld,WAAWP,UAAU,2CAC1E,IAAKy4B,EAAe,MAEpB,GAAqB,QAAhBA,GAA2C,QAAhBA,EAA0B,S,4BAO9D,SACE7J,EACAvH,EACA1tB,GAC2D,WAErD8jB,EAAKtmB,KAAK8e,MACVlO,EAAW6mB,EAAsB7mB,QAEjC4tB,EAAUh8B,EAAQs2B,IAElBkH,EAAehgC,KAAKuhC,qBAAqB9J,EAAUj1B,GAEnD2E,EAAcnH,KAAKwhC,sBAAsBh/B,EAASoO,IAAY,GAChE6wB,EAAkB7wB,EAAQlY,IAAI,oBAMlC,GAAwB,IAApB++B,EAASsF,OAEX,OADArgC,QAAQrB,IAAI,+BAAiC60B,GACtClwB,KAAKs9B,YAAY7F,EAAUvH,EAAQ1tB,GAG5C,GAAIi1B,EAASsF,QAAU,IAMrB,OALwB,MAApBtF,EAASsF,SACX/8B,KAAK66B,YAAYr4B,EAAQu1B,SAASj/B,QAAS,EAC3CkH,KAAK66B,YAAY3K,IAAU,GAGtBlwB,KAAK0hC,kBAAkBjK,EAAUuI,GACrClE,MAAK,WACJ,IAAIqC,EAAe37B,EAAQq1B,SAAW,IAAMJ,EAASuF,WAErD,OAAO,EAAKpF,UAAUp1B,EAAS27B,EAAc1G,EAASsF,OAAQtF,MAIpE,IAAIkK,EAA8B,KAC9BC,EAAoC,KAOxC,GANIH,IACFG,EAAqBpzB,OAASizB,EAAiBvR,MACpBA,IACzByR,EAAeC,GAGK,MAApBnK,EAASsF,OAAgB,CAC3B/8B,KAAK6hC,QAAQ7hC,KAAK9G,GAAGg+B,KAAK,YAA0BsH,EAASlY,EAAI4J,GAC7DyR,GACF3hC,KAAK6hC,QAAQ7hC,KAAK9G,GAAGg+B,KAAK,YAA0BsH,EAASlY,EAC3Dqb,GAIAn/B,EAAQ09B,mBACV5Z,EAAGga,eAAe99B,EAAQq1B,UAG5B,IAAIiK,EAAU36B,EAAYrH,SAAS,WACjCqH,EAAYrH,SAAS,mBAEnBqH,GAAe26B,IACjB9hC,KAAK6hC,QAAQvb,EAAGld,WAAWP,UAAU,kCAAmC21B,EAASlY,EAC/E4J,GACEyR,GACF3hC,KAAK6hC,QAAQvb,EAAGld,WAAWP,UAAU,kCAAmC21B,EAASlY,EAC/Eqb,IAMR,GAAIF,EAAiB,CACnB,IAAKj/B,EAAQi5B,OAASkG,GAAiE,SAAjD3hC,KAAKw6B,UAAUoH,GAKnD,OAAO5hC,KAAKk4B,UAAU11B,EAASi1B,GAGjCz3B,KAAKw6B,UAAUoH,IAAgC,EAGjD5hC,KAAKkR,gBAAgBN,EAAQlY,IAAI,QAAmB8J,EAAQu1B,SAAUyG,GAEtE,IAAI+B,EAAUvgC,KAAK+hC,sBAAsB56B,EAAaswB,GAEtD,OAAK8I,EAME9I,EACJ6H,OAEAxD,MAAK,SAAAnE,GAEJ,OADAF,EAASE,aAAeA,EAChB4I,EAAsB5kB,MAAM,EAAMgc,EAAcn1B,EAASi1B,OATnEz3B,KAAK64B,UAAU2F,EAAS,gCACjBx+B,KAAKk4B,UAAU11B,EAASi1B,M,+BAYnC,SACEA,EACAuI,GACe,WACX1Z,EAAKtmB,KAAK8e,MAEd,OAAO2Y,EAAS6H,OACbxD,MAAK,SAAA/P,GACAA,EAAQ1vB,OAAS,IACnBiqB,EAAG7V,IAAIuvB,EAAc,EAAK9mC,GAAGi+B,KAAK,WAAY7Q,EAAGld,WAAWgC,QAAQ2gB,GAAUiU,Q,mCAKtF,SAAuB74B,EAAqBswB,GAC1C,IAAKtwB,EACH,OAAO,KAGT,IAAIqwB,EAAUx3B,KAAK+6B,SAASiH,MAAK,SAAAzB,GAC/B,OAAOp5B,EAAYrJ,MAAMyiC,EAAQxmB,YAInC,OAAOyd,EAAU,IAAIA,EAAQC,GAAY,O,8BAG3C,SAAkB76B,GAChB,OAAOo6B,EAAoBp6B,EAAIqD,MAAM,KAAKwE,S,mCAG5C,SACEjC,EACAoO,GAEA,GAAIpO,EAAQy/B,iBACV,OAAOz/B,EAAQy/B,iBAGjB,IAAI96B,EAAcyJ,EAAQlY,IAAI,gBAC9B,IAAKyO,GAAeA,EAAYrH,SAAS,4BAA6B,CACpE,IAAIoiC,EAAQliC,KAAKmiC,iBAAiB3/B,EAAQq1B,SAAS/+B,OAEnD,GAAIopC,EACF,OAAOA,EAIX,IAAIlkC,EAAWwQ,WAAahM,EAAQq1B,SAAS/+B,OAE7C,OAAKqO,GAAe,CAAC,OAAQ,UAAUrH,SAAS9B,GACvC,WAGFmJ,I,6BAMT,SACEi7B,EACA5/B,GACwC,WACxCxC,KAAK64B,UAAUr2B,EAAQs2B,IAAK,mCAAqCsJ,EAAS,KAE1E5/B,EAAQo6B,WAAY,EAEpB,IAAMtW,EAAKtmB,KAAK8e,MACVujB,EAAS7/B,EAAQs2B,IAElBt2B,EAAQy1B,SACX3R,EAAG7V,IAAI4xB,EAAQriC,KAAK9G,GAAGg+B,KAAK,gBAAiB5Q,EAAGld,WAAWP,UAAUu5B,GAASC,GAC9EriC,KAAK64B,UAAUwJ,EAAQ,8BAGzBriC,KAAKw6B,UAAUh4B,EAAQq1B,SAAS/+B,OAAS,aACzCkH,KAAK06B,aAAal4B,EAAQq1B,SAAS/+B,OAASspC,EAE5C,IAAI1B,EAAanoC,OAAOyY,OAAO,GAAIxO,GAGnC,OAFAk+B,EAAWzhB,QAAUzc,EAAQq1B,SAAS/+B,MAE/BkH,KAAK47B,SAASwG,EAAQ1B,GAC1B5E,MAAK,SAAArE,GAKJ,OAJKiJ,EAAWzI,QACd3R,EAAG7V,IAAI4xB,EAAQ,EAAKnpC,GAAGg+B,KAAK,qBAAsBwJ,EAAW5H,IAAK,EAAKhiB,SAGlE2gB,O,+BAIb,SACE76B,EACA4F,GAI8B,WAC9B,OAAO,IAAIi3B,SAAQ,SAAC1G,GAClB,EAAK0H,SAAS79B,IAAQ,EAAK69B,SAAS79B,IAAQ,IAAI2J,OAAO0qB,YAAW,YAC5D,EAAKgL,UAAUr/B,IACd4F,EAAQi+B,0BACRj+B,EAAQo6B,WACX7J,EAAQ,EAAK6E,UAAUp1B,EAAf,qBAAsC5F,EAAtC,cAAuD,cAEhE,EAAKq9B,e,8BAIZ,SACEr9B,EACAmF,GAEK/B,KAAK46B,eAAeh+B,GAGvBoD,KAAK46B,eAAeh+B,GAAK2E,KAAKQ,GAF9B/B,KAAK46B,eAAeh+B,GAAO,CAACmF,K,0BAMhC,WACE,IAAIugC,EAAe,GAEnB,IAAK,IAAIzhC,KAAab,KAAKm4B,WAOzB,IAAK,IAAI3+B,IANY,KAAjB8oC,IACFA,GAAgB,MAGlBA,GAAgBzhC,EAEKb,KAAKm4B,WAAWt3B,GACnCyhC,GAAgB,IAAM9oC,EAAW,IAAMwG,KAAKm4B,WAAWt3B,GAAWrH,GAItE,OAAO8oC,K,6BAx2CT,SAAuB1lC,GACrB,OAAIo9B,EAAQuI,uBACHvI,EAAQuI,uBACZxkC,QAAQ,QAASugC,mBAAmB1hC,SAEvC,I,6BAIJ,SAAwBA,GAMtB,IAEI4lC,EAFAjG,EAAe3/B,EAiBnB,MAdsB,oBAAXpF,QAA0BA,OAAOirC,QAAUD,EAAKhrC,OAAOirC,MAAMD,KACtEA,EAAGE,aAAeF,EAAGE,YAAYhqC,IAAI,8BACJ,YAA7B6jC,EAAaz/B,MAAM,EAAG,IAAkD,eAA9By/B,EAAaz/B,MAAM,EAAG,MAClEy/B,EAAe,oBAAsBA,EAAaz/B,MAAM,GACxDzB,IAAIG,KAAK,uDACP+gC,EAAe,MASdA,I,8BAGT,SAAyB3/B,GACvB,IAAI4lC,EACJ,GACoB,oBAAXhrC,QACNA,OAAeirC,QACfD,EAAMhrC,OAAeirC,MAAMD,KAC5BA,EAAGG,YAEH,OAAO/lC,EAGT,GAAqC,oBAA1BgmC,uBACTA,sBAAsBC,aAAc,CAEpC,IAgBMj9B,EAdS,SAATk9B,EAAUxoB,EAAO1F,GACrB,IAAImuB,EAAInuB,EAAM0F,EAAMe,SAEpB,OAAK0nB,EAEY,iBAANA,EACFA,EAAIzoB,EAAMld,KAAK,KAGnBkd,EAEEwoB,EAAOxoB,EAAOyoB,GAFA,KANJ,KAWTD,CAhBKlmC,EAAIqD,MAAM,KAAKnD,MAAM,GAgBT8lC,sBAAsBC,cAEjD,GAAIj9B,EACF,OAAOA,EAOX,OAAIo0B,EAAQuI,wBACY,oBAAbxlC,UAA4BA,SAAS6jC,UACH,YAAxC,GAAK7jC,SAAS6jC,UAAU9jC,MAAM,EAAG,IACd,UAApBF,EAAIE,MAAM,EAAG,GACRk9B,EAAQuI,uBACZxkC,QAAQ,QAASugC,mBAAmB1hC,IAGlCA,I,iCAOT,SAA4BA,GAC1B,IAAIomC,EAAOx0B,WAAa5R,GAExB,MAAiB,QAATomC,GAA2B,WAATA,GAA8B,QAATA,I,4BAOjD,SAAuBzG,GAA6C,IAAvB/5B,EAAuB,uDAAJ,QAOlCgE,IAAxBhE,EAAQm+B,mBACsBn6B,IAA5BhE,EAAQygC,gBACVzgC,EAAQm+B,YAAcn+B,EAAQygC,gBAAkB,UAAY,OAE5DzgC,EAAQm+B,YAAc,e,SA/LT3G,E,uBAAAA,E,kCAAAA,E,iCA+7CrBA,EAAQkJ,SAAWnJ,EACnBC,EAAQhD,oBAAsBA,I,+CCtoE9B,6DAqBe,SAAS6H,EAEtB1iC,EAEAmqB,EACAhpB,EAKA6J,EACApF,EACAS,GAQAlF,EAAOA,GAAQnB,EAAOrD,MACtB,IAAMqb,EAAO3R,GAAW,GACxB2E,EAAcA,GAAejM,IAE7B,IACE,IAAIioC,EAAKC,YAAW9c,GACfnS,EAAa0D,OAAOsrB,EAAGE,SAAUlvB,EAAa0D,OACnD,IACIyrB,EADAC,EAASjd,EAAIpgB,wBAAmBM,OAAWA,OAAWA,EAAWrK,GAIrE,OAFAgnC,EAAGK,kBAAkBld,EAAIzR,YACzBsuB,EAAGM,QAAQnmC,GACH6J,GACN,KAAKpM,IAEH,OAAO2oC,EAAgB,KADNP,EAAGQ,gBAAgBJ,IAEtC,KAAK7oC,IACL,KAAKC,IAEH,OAAO+oC,EAAgB,KADNP,EAAGS,eAAeL,IAErC,KAAKroC,IACL,KAAKC,IAGH,OAFAgoC,EAAGE,SAAS,MAELK,EAAgB,KADNP,EAAGS,eAAeL,IAErC,KAAKzoC,IAGH,OAFAqoC,EAAGE,SAAS,cAELK,EAAgB,KADNP,EAAGU,qBAAqBN,IAE3C,KAAK9oC,IACH0oC,EAAGE,SAAS,cACZC,EAAWH,EAAGU,qBAAqBN,GAEnCO,gBAAsBR,EAAUvhC,GAChC,MACF,KAAKlH,IACL,KAAKD,IAGH,OAFAuoC,EAAGE,SAAS,gBAELK,EAAgB,KADNP,EAAGU,qBAAqBN,IAK3C,QACE,MAAM,IAAI1jC,MAAM,2BAA6BsH,EAAc,mCAE/D,MAAO6wB,GACP,GAAIj2B,EAEF,OAAOA,EAASi2B,OAAKxxB,GAEvB,MAAMwxB,EAGR,SAAS0L,EAAiB1L,EAA+Br3B,GACvD,OAAIoB,OACFA,EAASi2B,EAAKr3B,GAGPA,K,6BCnGb,oDAKA,MAAM,IAAEuI,EAAG,IAAE2E,GAAQ,IAGrB,IAAIk2B,EACAC,EAAoB,EAExB,MAIMC,EAAc,CAClBp7B,UAkTF,SAAmBnJ,GACjB,OAAO,IAAID,EAAUC,IAlTrBmK,UAsTF,SAAmBzR,GACjB,OAAO,IAAIwS,EAAUxS,GAAQ,MAAM4rC,MAtTnCp4B,SAwVF,SAAkBxT,GAChB,OAAO,IAAI4S,EAAS5S,IAxVpBgT,QAyTF,SAAiBtS,EAAOorC,GAEtB,GAAkC,iBAAvBA,EACT,OAAO,IAAI54B,EAAQ,IAAIxS,MAAUorC,EAAmBxgC,iBAGtD,IAAI0I,EAAW83B,EAAqBA,EAAmBprC,MAAQ,GAC9C,KAAbsT,IAEmB,kBAAVtT,EACTsT,EAAWyB,EAAIhC,QAES,iBAAV/S,IACVgU,OAAOyC,SAASzW,GAClBsT,EAAWU,OAAOE,UAAUlU,GAAS+U,EAAI5B,QAAU4B,EAAI7B,QAEvDI,EAAWyB,EAAI7B,OACVc,OAAOuC,MAAMvW,KAChBA,EAAQA,EAAQ,EAAI,MAAQ,WAMpC,MAAqB,KAAbsT,GAAmBA,IAAayB,EAAItN,OAC1C,IAAI+K,EAAQ,IAAIxS,MAChB,IAAIwS,EAAQ,IAAIxS,OAAWsT,MAlV7BnC,aA2VF,WACE,OAAO85B,GA3VPn6B,OACA6B,OAAQ7B,GAEK,MAGR,MAAMu6B,EACX,YAAY36B,GACVxJ,KAAKwJ,GAAKA,EAIZ,YACE,OAAOxJ,KAAKwJ,GAId,OAAOrB,GAGL,OAAIA,aAAiBg8B,EACZnkC,KAAKwJ,KAAOrB,EAAMqB,KAElBrB,GAASnI,KAAKlB,WAAaqJ,EAAMrJ,UACxBkB,KAAKlH,QAAaqP,EAAMrP,MAI5C,SACE,MAAO,CACLgG,SAAUkB,KAAKlB,SACfhG,MAAUkH,KAAKlH,QAOd,MAAM2G,UAAkB0kC,EAE7B,eACE,MAAO,aAKJ,MAAM74B,UAAgB64B,EAE3B,eACE,MAAO,UAIT,YACE,OAAOnkC,KAAKwJ,GAAGye,UAAU,EAAGjoB,KAAKwJ,GAAG3L,YAAY,MAIlD,eAEE,MAAM2L,EAAKxJ,KAAKwJ,GAChB,IAAI46B,EAAQ56B,EAAG3L,YAAY,KAAO,EAElC,OAAOumC,EAAQ56B,EAAGnN,QAA0B,MAAhBmN,EAAG46B,KAAmB56B,EAAG+S,OAAO6nB,GAAO1gC,cAAgB,GAIrF,eACE,OAAO,IAAIjE,EAAUO,KAAKqkC,gBAI5B,qBAEE,MAAM76B,EAAKxJ,KAAKwJ,GAAI86B,EAAQ96B,EAAG3L,YAAY,KAAO,EAC5C0mC,EAAOD,EAAQ96B,EAAGnN,OAASmN,EAAG86B,GAAS,GAE7C,MAAgB,MAATC,EAAe/6B,EAAG+S,OAAO+nB,EAAQ,GAEvB,MAATC,EAAe12B,EAAItN,OAAS2I,EAAIgD,WAI1C,OAAO/D,GAGL,OAAIA,aAAiBmD,EACZtL,KAAKwJ,KAAOrB,EAAMqB,KAElBrB,KAAWA,EAAMiE,UACRpM,KAAKlB,WAAaqJ,EAAMrJ,UACxBkB,KAAKlH,QAAaqP,EAAMrP,OACxBkH,KAAKmM,WAAahE,EAAMgE,UACxBnM,KAAKoM,SAAStT,QAAUqP,EAAMiE,SAAStT,MAG3D,SACE,MAAO,CACLgG,SAAUkB,KAAKlB,SACfhG,MAAUkH,KAAKlH,MACfqT,SAAUnM,KAAKmM,SACfC,SAAU,CAAEtN,SAAU,YAAahG,MAAOkH,KAAKqkC,kBAM9C,MAAMz5B,UAAkBu5B,EAC7B,YAAY/rC,GACV0iB,MAAM,KAAK1iB,GAIb,eACE,MAAO,YAIT,YACE,OAAO4H,KAAKwJ,GAAG+S,OAAO,IAInB,MAAMvR,UAAiBm5B,EAC5B,YAAY/rC,GACV0iB,MAAM,IAAI1iB,GAIZ,eACE,MAAO,WAIT,YACE,OAAO4H,KAAKwJ,GAAG+S,OAAO,IA0B1BwnB,EAAe,IArBR,cAA2BI,EAChC,cAEE,OADArpB,MAAM,IACCipB,GAAgB/jC,KAIzB,eACE,MAAO,eAIT,OAAOmI,GAIL,OAAQnI,OAASmI,KAAaA,GAAUnI,KAAKlB,WAAaqJ,EAAMrJ,WAmF7D,MAAM0lC,UAAaL,EACxB,YAAY99B,EAASC,EAAW/M,EAAQsR,GACtCiQ,MAAM,IACN9a,KAAKykC,SAAap+B,EAClBrG,KAAK0kC,WAAap+B,EAClBtG,KAAK2kC,QAAaprC,EAClByG,KAAK4kC,OAAa/5B,GAASk5B,EAI7B,eACE,MAAO,OAGT,cACE,OAAO/jC,KAAKykC,SAGd,gBACE,OAAOzkC,KAAK0kC,WAGd,aACE,OAAO1kC,KAAK2kC,QAGd,YACE,OAAO3kC,KAAK4kC,OAId,SACE,MAAO,CACL9lC,SAAWkB,KAAKlB,SAChBuH,QAAWrG,KAAKykC,SAASI,SACzBv+B,UAAWtG,KAAK0kC,WAAWG,SAC3BtrC,OAAWyG,KAAK2kC,QAAQE,SACxBh6B,MAAW7K,KAAK4kC,OAAOC,UAK3B,OAAO18B,GACL,QAASA,GAASnI,KAAKykC,SAASp9B,OAAOc,EAAM9B,UAC3BrG,KAAK0kC,WAAWr9B,OAAOc,EAAM7B,YAC7BtG,KAAK2kC,QAAQt9B,OAAOc,EAAM5O,SAC1ByG,KAAK4kC,OAAOv9B,OAAOc,EAAM0C,QAkE/C,SAASjB,EAAKvD,EAASC,EAAW/M,EAAQsR,GACxC,OAAO,IAAI25B,EAAKn+B,EAASC,EAAW/M,EAAQsR,K,0HCzTzBitB,E,WAMnB,WAAYhZ,GAAO,YAGjB9e,KAAK8e,MAAQA,EACb9e,KAAKopB,OAAS,GACdppB,KAAKsH,IAAM,KACXtH,KAAK8kC,OAAQ,E,wCAyBf,SAAalpB,EAAQsN,EAAQ7lB,GAC3B,MAAO,CAAC,KAAQ,EAAG,IAAO,EAAG,OAAU6lB,EAAQ,OAAUtN,EAAQ,MAASA,EAAOkD,MAAO,QAAWzb,EACjG,UAAa,EAAG,KAAQ,KAAM,KAAQ,KAAM,KAAQ,KAAM,SAAY,KAAM,UAAa,EAAG,MAAS,KAAM,SAAY,KAAM,YAAc,EAC3I,eAAkB,WACZrD,KAAKsb,YACPtb,KAAKuC,KAAK+gB,SAEoD,UAAa,SAAUxV,EAAMlR,GAC7FA,EAAMmoC,OAAanoC,EAAKoD,KAAK1C,MAC7B0C,KAAKuC,KAAOvC,KAAK8e,MAAM1G,IAAIxb,GAE3BoD,KAAK+C,SAAW+K,GAC2C,WAAc,WAMzE,GALI9N,KAAKkpB,OAAOA,OAAO5N,WACrBtb,KAAKkpB,OAAOA,OAAO3mB,KAAK27B,OAAOl+B,KAAKuC,MAEpCvC,KAAK8e,MAAMrO,IAAIzQ,KAAKkpB,OAAOA,OAAO3mB,KAAMvC,KAAKkpB,OAAO3mB,KAAMvC,KAAKuC,KAAMvC,KAAK4b,OAAOtU,KAE1D,MAArBtH,KAAKkpB,OAAO8b,MAAe,CAE7B,IAAIv5B,EAASzL,KAAK8e,MAAM1G,IAAI2sB,OAAa,IAAM/kC,KAAKkpB,OAAO8b,MAAOhlC,KAAK1C,OACvE0C,KAAK8e,MAAMrO,IAAIhF,EAAQzL,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,QAAS3N,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,aAAc3N,KAAK4b,OAAOtU,KAC9HtH,KAAK8e,MAAMrO,IAAIhF,EAAQzL,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,WAAY3N,KAAKkpB,OAAOA,OAAO3mB,KAAMvC,KAAK4b,OAAOtU,KAC1GtH,KAAK8e,MAAMrO,IAAIhF,EAAQzL,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,aAAc3N,KAAKkpB,OAAO3mB,KAAMvC,KAAK4b,OAAOtU,KAErGtH,KAAK8e,MAAMrO,IAAIhF,EAAQzL,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,UAAW3N,KAAKuC,KAAMvC,KAAK4b,OAAOtU,OAE5C,eAAkB,WACnE,OAAuB,MAAftH,KAAKkpB,QAAwC,MAAtBlpB,KAAKkpB,OAAOA,QAAkBlpB,KAAK+C,WAAa/C,KAAKilC,MAAQjlC,KAAKkpB,OAAOnmB,WACxG/C,KAAKklC,KAAOllC,KAAKkpB,OAAOA,OAAOnmB,WAAa/C,KAAKilC,MACA,QAAW,SAAUroC,GACtEoD,KAAKmlC,UAAUnlC,KAAKilC,KAAMroC,GACtBoD,KAAKolC,kBACPplC,KAAKqlC,cAE4C,cAAiB,WACpErlC,KAAK+C,SAAW/C,KAAKilC,KACrBjlC,KAAKuC,KAAOvC,KAAK8e,MAAMxD,aACvBtb,KAAKsb,YAAa,EACdtb,KAAKolC,kBACPplC,KAAKqlC,cAE2C,iBAAoB,WACtErlC,KAAK+C,SAAW/C,KAAKklC,KACoB,SAAY,SAAU17B,GACrD,MAANA,EAC4B,MAA1BxJ,KAAK4b,OAAOwN,OAAO5f,GACrBxJ,KAAKuC,KAAOvC,KAAK4b,OAAOwN,OAAO5f,GAE/BxJ,KAAKuC,KAAOvC,KAAK4b,OAAOwN,OAAO5f,GAAMxJ,KAAK8e,MAAM3G,QAGlDnY,KAAKuC,KAAOvC,KAAK8e,MAAM3G,QAEzBnY,KAAK+C,SAAW/C,KAAKilC,KACjBjlC,KAAKolC,kBACPplC,KAAKqlC,cAE6C,OAAU,SAAUzoC,GACpEA,IAAQk7B,EAAU5+B,GAAGyU,IAAM,OAC7B/Q,EAAMk7B,EAAU5+B,GAAGyU,IAAM,IAAM3N,KAAKkpB,OAAOoc,UAC3CtlC,KAAKkpB,OAAOoc,aAGdtlC,KAAKmlC,UAAUnlC,KAAKklC,IAAKtoC,IACkB,WAAc,SAAU9D,GAC/DkH,KAAKkpB,OAAO9c,UAAYpM,KAAKkpB,OAAO9c,WAAa0rB,EAAU5+B,GAAGyU,IAAK,aACrE3N,KAAKuC,KAAOvC,KAAK8e,MAAM1T,QAAQtS,EAAOkH,KAAK8e,MAAM1G,IAAIpY,KAAKkpB,OAAO9c,WAEjEpM,KAAKuC,KAAOvC,KAAK8e,MAAM1T,QAAQtS,EAAOkH,KAAKsM,MAE7CtM,KAAK+C,SAAW/C,KAAKilC,KACjBjlC,KAAKolC,kBACPplC,KAAKqlC,iB,gCAOb,SAAmB9iC,EAAM3F,EAAKxE,GAC5B,IAAImtC,EAAgB,KACpB,GAAIhjC,EAAKkoB,mBACP8a,EAAgBhjC,EAAKkoB,mBAAmB7tB,EAAKxE,QAI7C,IAFA,IACIotC,EADA5hC,EAAarB,EAAKqB,WAEb/L,EAAI,EAAEA,EAAI+L,EAAWvH,SAAUxE,EAEtC,IADA2tC,EAAgB5hC,EAAW/L,IACTmvB,eAAiBpqB,IACrB4oC,EAAc5rB,OAAW4rB,EAAc5rB,OAAS,IAAMxhB,EAAQA,KACzDotC,EAAc/hC,SAAU,CACvC8hC,EAAgBC,EAChB,MAKR,OAAOD,I,mBAUT,SAAMxoC,EAAUO,EAAMgK,GACpB,IAEIrQ,EAFAwuC,EAAW1oC,EAASyH,WAGxB,GAFAxE,KAAK0lC,cAED3oC,EAASgG,WAAa+0B,EAAU/0B,SAAS4iC,UAC3C,IAAK,IAAIztC,EAAI,EAAEA,EAAIutC,EAASppC,OAAOnE,IACjC,GAAIutC,EAASvtC,GAAG6K,WAAa+0B,EAAU/0B,SAAS6iC,QAAS,CACvD3uC,EAAOwuC,EAASvtC,GAChB,WAGC,IAAI6E,EAASgG,WAAa+0B,EAAU/0B,SAAS6iC,QAGlD,MAAM,IAAI/lC,MAAM,iCAAmCvC,EAAO,eAF1DrG,EAAO8F,EAKTiD,KAAKsH,IAAMA,EACX,IAAI6nB,EAAInvB,KAAK6lC,aAAa7lC,MAK1B,OAJAA,KAAK1C,KAAOA,EACZ6xB,EAAE7xB,KAAOA,EACT6xB,EAAE7iB,KAAO,KACTtM,KAAK8lC,SAAS9lC,KAAK+lC,WAAW5W,EAAGl4B,KAC1B,I,sBAGT,SAAS+uC,GAoBP,IAlBA,IAAIhB,EACAiB,EAAa,SAAUC,GACzB,IAAIvlC,EAAS,GACb,GAAuB,MAAnBulC,EAAGlf,aACL,MAAM,IAAInnB,MAAM,0CAA4CqmC,EAAGjf,UAAY,OAASjnB,KAAK1C,MAW3F,OATI4oC,EAAGlf,eACLrmB,GAAkBulC,EAAGlf,cAEnBkf,EAAGjf,UACLtmB,GAAkBulC,EAAGjf,UACZif,EAAGziC,WACRyiC,EAAGziC,SAAS5G,QAAQ,MAAQ,EAAE8D,GAAkBulC,EAAGziC,SAASxD,MAAM,KAAK,GACtEU,GAAkBulC,EAAGziC,UAErB9C,GACPtH,KAAK2G,MACHmmC,GAAM,EACHH,EAAM9c,QAAQ,CACnB,IAAIiE,EAAM6Y,EAAM3iC,QACZ+iC,EAAQjZ,EAAIvpB,WAChB,GAAIupB,EAAIpqB,WAAa+0B,EAAU/0B,SAASsjC,MAAQlZ,EAAIpqB,WAAa+0B,EAAU/0B,SAASujC,cAE9EN,EAAM9c,OAAOnmB,WAAaijC,EAAMf,OAElCe,EAAMO,OAAOzO,EAAU5+B,GAAGyU,IAAM,SAChCq4B,EAAQhmC,KAAK+lC,WAAWC,IAE1BA,EAAMQ,WAAWrZ,EAAIzoB,gBAChB,GAAIuhC,EAAW9Y,KAAS2K,EAAU5+B,GAAGyU,IAAM,MAQhD,GANIq4B,EAAM9c,QAAU8c,EAAM9c,OAAO5N,aAE/B0qB,EAAMS,oBACNT,EAAQhmC,KAAK+lC,WAAWC,EAAOA,EAAM3iC,UAC/B6lB,OAAO7lB,QAAU,MAEpB2iC,EAAM9c,QAAW8c,EAAM9c,OAAOnmB,UAAYijC,EAAM9c,OAAOnmB,WAAaijC,EAAMd,IAwCxE,CAELc,EAAMO,OAAON,EAAW9Y,IACpBntB,KAAK8kC,QACPE,EAAQhlC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,SAErDq4B,EAAMhB,MAAQA,EAAMtgC,UACpByoB,EAAIuZ,oBAAoB1B,IAG5B,IAAI2B,EAAY3mC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,aAC3DvB,EAAWpM,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,YAK9D,GAJIvB,IACF45B,EAAM55B,SAAWA,EAAS1H,UAC1ByoB,EAAIuZ,oBAAoBt6B,IAEtBu6B,EAAW,CACb,IAAIC,EAAKD,EAAUjiC,UACR,YAAPkiC,GACFZ,EAAM55B,SAAW0rB,EAAU5+B,GAAGyU,IAAM,cACpCq4B,EAAQhmC,KAAK+lC,WAAWC,IAElBQ,WAAWrZ,EAAI3oB,YACrB2hC,GAAM,GACU,aAAPS,IACTZ,EAAQhmC,KAAK+lC,WAAWC,EAAOA,EAAM3iC,UAC/B6lB,OAAO7lB,QAAU,KACvB2iC,EAAMa,YACU,eAAPD,KACTZ,EAAQhmC,KAAK+lC,WAAWC,EAAOA,EAAM3iC,UAC/B6lB,OAAO7lB,QAAU,KACvB2iC,EAAMc,iBAER3Z,EAAIuZ,oBAAoBC,GAE1B,GAAqB,IAAjBP,EAAM/pC,OAAc,CACtB,IAAIw7B,EAAW73B,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,YAC1Do5B,EAAQ/mC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,UAC3Dq4B,EAAQhmC,KAAK+lC,WAAWC,GACpBnO,GACFmO,EAAMgB,QAAQnP,EAASnzB,WACvByoB,EAAIuZ,oBAAoB7O,IAEpBkP,GACFf,EAAMa,SAASE,EAAMriC,WACrByoB,EAAIuZ,oBAAoBK,IAExBf,EAAMa,WAGV,IAAK,IAAIntB,EAAK0sB,EAAM/pC,OAAS,EAAGqd,GAAM,EAAGA,IAAM,CAC7C,IAAIyV,EAAInvB,KAAK+lC,WAAWC,GACxB7W,EAAEoX,OAAON,EAAWG,EAAM1sB,KACtBusB,EAAWG,EAAM1sB,MAASoe,EAAU5+B,GAAGyU,IAAM,OAC9C3N,KAAK+lC,WAAW5W,GAAI6X,QAAQZ,EAAM1sB,GAAIhV,WAEtC1E,KAAK+lC,WAAW5W,GAAIqX,WAAWJ,EAAM1sB,GAAIhV,iBAGX,IAA1ByoB,EAAI3oB,WAAWnI,QACvB2D,KAAK+lC,WAAWC,GAAQQ,WAAW,QApG4C,CAElF,IAAIS,EAAQjnC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,SAE3D,GADAq3B,EAAQhlC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,MACnDs5B,GAASjC,EACX,MAAM,IAAInlC,MAAM,cAAgBstB,EAAI1pB,SAApB,qGAGlB,IAAKwjC,GAASjC,EACZgB,EAAMgB,QAAQ,IAAMhC,EAAMtgC,WAC1ByoB,EAAIuZ,oBAAoB1B,QACnB,GAAa,MAATiC,GAA0B,MAATjC,EAAe,CACzC,IAAIkC,EAAOlnC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,UACtDu5B,GACFlB,EAAMa,SAASK,EAAKxiC,WACpByoB,EAAIuZ,oBAAoBQ,IAExBlB,EAAMa,gBAGRb,EAAMgB,QAAQC,EAAMviC,WACpByoB,EAAIuZ,oBAAoBO,GAG1B,IAAIE,EAAUnnC,KAAKyqB,mBAAmB0C,EAAK2K,EAAU5+B,GAAGyU,IAAK,QACzDmqB,EAAU5+B,GAAGyU,IAAM,gBAAkBs4B,EAAW9Y,KAClDga,EAAU,CAAC,UAAalB,EAAW9Y,KAEtB,MAAXga,IACFnnC,KAAK8e,MAAMrO,IAAIu1B,EAAMzjC,KAAMvC,KAAK8e,MAAM1G,IAAI0f,EAAU5+B,GAAGyU,IAAM,QAAS3N,KAAK8e,MAAM1G,IAAI2sB,OAAaoC,EAAQziC,UACxGshC,EAAM1oC,OAAQ0C,KAAKsH,KACjB6/B,EAAQ1jC,UACV0pB,EAAIuZ,oBAAoBS,IAI5B,IAAK,IAAI5rC,EAAI6qC,EAAM/pC,OAAS,EAAGd,GAAK,EAAGA,IACrCyE,KAAK8e,MAAMrO,IAAIu1B,EAAMzjC,KAAMvC,KAAK8e,MAAM1G,IAAI6tB,EAAWG,EAAM7qC,KAAMyE,KAAK8e,MAAM1T,QAAQg7B,EAAM7qC,GAAGmJ,UAC3FshC,EAAM15B,MAAOtM,KAAKsH,KAoE1B,IADA6lB,EAAM6Y,EAAM3iC,QACL2iC,EAAM9c,QAAQ,CAEnB,IADA,IAAIke,EAASpB,EACC,MAAP7Y,GAELA,GADA6Y,EAAQA,EAAM9c,QACF7lB,QAEd,IAAIgkC,EAAYla,EAAI3oB,YAAc2oB,EAAI3oB,WAAWwhC,EAAMzZ,WACvD,GAAK8a,GAAclB,EAOZ,KAAKkB,EAAUtkC,WAAa+0B,EAAU/0B,SAAS6iC,SACpDyB,EAAUtkC,WAAa+0B,EAAU/0B,SAASsjC,MAC1CgB,EAAUtkC,WAAa+0B,EAAU/0B,SAASujC,iBACxCe,EAAUtkC,WAAa+0B,EAAU/0B,SAASsjC,MAC5CgB,EAAUtkC,WAAa+0B,EAAU/0B,SAASujC,eAChB,IAA1BnZ,EAAI3oB,WAAWnI,QAEV,CAEL2pC,EAAMzZ,YACNyZ,EAAQhmC,KAAK+lC,WAAWqB,EAAQja,EAAI3oB,WAAWwhC,EAAMzZ,UAAY,IACjE,MALAyZ,EAAMzZ,gBAbgB,CAEtB,GADAyZ,EAAMsB,mBACAtB,EAAQA,EAAM9c,QAClB,MAEFiE,EAAM6Y,EAAM3iC,QACZ8iC,GAAM,O,yBAsBd,WACEnmC,KAAKopB,OAAS,GACdppB,KAAKsH,IAAM,O,wBAOb,SAAW4hB,EAAQ7lB,GACjB,IAAI2iC,EAAQhmC,KAAK6lC,aAAa7lC,KAAMkpB,EAAQ7lB,GAK5C,GAJI6lB,IACF8c,EAAM1oC,KAAO4rB,EAAO5rB,KACpB0oC,EAAM15B,KAAO4c,EAAO5c,OAEjBjJ,GAAWA,EAAQN,WAAa+0B,EAAU/0B,SAASsjC,MACtDhjC,EAAQN,WAAa+0B,EAAU/0B,SAASujC,cACxC,OAAON,EAET,IAAII,EAAQ/iC,EAAQO,WAChBtG,EAAO+F,EAAQ4mB,iBAAiB,YACxB,MAAR3sB,IACF0oC,EAAM1oC,KAAOA,EAAKoH,UAClBrB,EAAQkkC,gBAAgB,aAE1B,IAAIj7B,EAAOjJ,EAAQ4mB,iBAAiB,YACxB,MAAR3d,IACF05B,EAAM15B,KAAOA,EAAK5H,UAClBrB,EAAQkkC,gBAAgB,aAG1B,IAAK,IAAIhsC,EAAI6qC,EAAM/pC,OAAS,EAAEd,GAAK,EAAEA,IACnC,GAAuC,QAAnC6qC,EAAM7qC,GAAGkI,SAAS8Y,OAAO,EAAG,GAAc,CAC5C,GAAkC,WAA9B6pB,EAAM7qC,GAAGnD,KAAK0E,MAAM,EAAG,GAAiB,CAC1C,IAAIF,EAAMwpC,EAAM7qC,GAAGmJ,UACf1E,KAAK1C,OAAMV,EAAMmoC,OAAanoC,EAAKoD,KAAK1C,OAC5C0C,KAAK8e,MAAMoD,gBAAgBkkB,EAAM7qC,GAAGnD,KAAK0E,MAAM,GAAIF,GAGrDyG,EAAQqjC,oBAAoBN,EAAM7qC,IAGtC,OAAOyqC,M,SAzYUlO,E,KAkBP,CAAC,IAAO,8CAA+C,KAAQ,0C,IAlBxDA,E,WAuBD,CAAC,QAAW,EAAG,UAAa,EAAG,KAAQ,EACvD,cAAiB,EAAG,iBAAoB,EACxC,OAAU,EAAG,uBAA0B,EACvC,QAAW,EAAG,SAAY,EAAG,cAAiB,GAChD,kBAAqB,GAAI,SAAY,M,0ICrFhC,SAAS0P,IAA+C,IAArCC,EAAqC,uDAAtBt9B,IACvC,MAAO,CACL0B,QAAS47B,EAAa5+B,UAAU,4CAChCiD,SAAU27B,EAAa5+B,UACrB,6CAEFkD,QAAS07B,EAAa5+B,UAAU,4CAChCmD,OAAQy7B,EAAa5+B,UAAU,2CAC/BoD,QAASw7B,EAAa5+B,UAAU,4CAChCqD,WAAYu7B,EAAa5+B,UACvB,yDAEFtI,OAAQknC,EAAa5+B,UAAU,4CAIhB2+B,EAAUr9B,KAA7B,I,iBCFe,SAASu9B,EAAiB5oB,GACvC,OAAO,IAAIskB,EAAWtkB,GAGjB,IAAMskB,EAAb,WACE,WAAYtkB,GAAO,sCA+LF,0CA/LE,yBAiMhB9e,KAAKwe,eAAiB,KAjMN,uBAufL,IAAI/f,OAAO,2BAvfN,sBAyfN,IAAIA,OAAO,qCAzfL,sBA0fN,IAAIA,OAAO,iCAzftBuB,KAAK6X,MAAQ,GACb7X,KAAK1C,KAAO,KAEZ0C,KAAKwmB,SAAW,GAChBxmB,KAAK6U,WAAa,GAClB,IAAM8yB,EAASpvC,OAAO4W,KAAKy4B,OAC3B,IAAK,IAAM/vC,KAAK8vC,EAAQ,CACtB,IAAM/qC,EAAMgrC,MAAUD,EAAO9vC,IAAI,IAC3B+hB,EAAS+tB,EAAO9vC,GACtBmI,KAAKwmB,SAAS5pB,GAAOgd,EACrB5Z,KAAK6U,WAAW+E,GAAUhd,EAG5BoD,KAAK6nC,cAAc,MAAO,+CAC1B7nC,KAAK6nC,cAAc,MAAO,iCAE1B7nC,KAAK8nC,eAAiB,GACtB9nC,KAAK8f,SAAW,CAAC,KACjB9f,KAAK+nC,YAAc,uDACnB/nC,KAAKgoC,SAAW,KAChBhoC,KAAKioC,SAAW,GAChBjoC,KAAK8e,MAAQA,EACb9e,KAAKoJ,WAAa0V,EAAM1V,YAAce,IACtCnK,KAAK6N,IAAM25B,EAAUxnC,KAAKoJ,YAzB9B,mCA4BE,SAAQ9L,GAEN,OADA0C,KAAK1C,KAAOA,EACL0C,OA9BX,sBAiCE,SAAS6X,GAEP,OADA7X,KAAK6X,MAAQA,GAAS,GACf7X,OAnCX,mBAsCE,SAAMzE,GACJ,IAAI3B,EAAI2B,EAAE+M,OAIV,MAHmB,UAAf/M,EAAEuD,WACJkB,KAAKioC,SAASruC,GAAK2B,GAEd3B,IA3CX,qBA8CE,SAAQA,GACN,GAAa,MAATA,EAAE,GAAY,CAChB,IAAI2B,EAAIyE,KAAKioC,SAASruC,GAEtB,OADK2B,GAAGmB,QAAQrB,IAAI,yBAA2BzB,GACxC2B,EAET,OAAOyE,KAAK8e,MAAMopB,OAAOtuC,KApD7B,2BA4DE,SAAcggB,EAAQhd,GACO,YAAvBgd,EAAO9c,MAAM,EAAG,IACO,OAAvB8c,EAAO9c,MAAM,EAAG,IACf8c,GAAWhd,IACZgd,KAAU5Z,KAAK6U,YAAcjY,KAAOoD,KAAKwmB,WAC7CxmB,KAAKwmB,SAAS5pB,GAAOgd,EACrB5Z,KAAK6U,WAAW+E,GAAUhd,MAlE9B,+BAsEE,SAAkBiY,GAChB,IAAK,IAAIszB,KAAMtzB,EACb7U,KAAK6nC,cAAcM,EAAItzB,EAAWszB,IAEpC,OAAOnoC,OA1EX,4BA6EE,WACE,IAAIrG,EAAGT,EACP,IAAKS,KAAKqG,KAAK6U,WACb,GAAI7U,KAAKwmB,SAASxmB,KAAK6U,WAAWlb,MAAQA,EACxC,MAAM,IAAIkG,MAAM,gCAAkClG,EAAI,KACpDqG,KAAK6U,WAAWlb,GAAK,KAAOqG,KAAKwmB,SAASxmB,KAAK6U,WAAWlb,IAAM,KAGtE,IAAKT,KAAM8G,KAAKwmB,SACd,GAAIxmB,KAAK6U,WAAW7U,KAAKwmB,SAASttB,MAASA,EACzC,MAAM,IAAI2G,MAAM,gCAAkC3G,EAAK,KACrD8G,KAAKooC,QAAQlvC,GAAM,KAAO8G,KAAK6U,WAAW7U,KAAKwmB,SAASttB,IAAO,OAxFzE,0BA8FE,SAAa0D,GACX,IAAIjD,EAAIiD,EASR,IAAIyrC,EARJ,SAAuBC,GACrB,QAAKtoC,KAAKuoC,YAAYzkC,KAAKwkC,KAChB,OAAPA,MACAA,KAAMtoC,KAAK6U,cACf7U,KAAKwmB,SAAS5pB,GAAO0rC,EACrBtoC,KAAK6U,WAAWyzB,GAAM1rC,EACf0rC,MAEiBjvC,KAAK2G,MAE3B,KAAKnD,QAAQlD,EAAEA,EAAE0C,OAAS,KAAO,IAAG1C,EAAIA,EAAEmD,MAAM,GAAI,IACxD,IAAI0rC,EAAQ7uC,EAAEkE,YAAY,KACtB2qC,GAAS,IAAG7uC,EAAIA,EAAEmD,MAAM0rC,EAAQ,IAEpC,IADA,IAAI3wC,EAAI,EACDA,EAAI8B,EAAE0C,QACP2D,KAAK+nC,YAAYlrC,QAAQlD,EAAE9B,KAC7BA,IAOJ,IAFA8B,EAAIA,EAAEmD,MAAM,EAAGjF,IAETwE,OAAS,GAAMgsC,EAAO1uC,GAAK,OAAOA,EACxC,GAAI0uC,EAAO1uC,EAAEmD,MAAM,EAAG,IAAK,OAAOnD,EAAEmD,MAAM,EAAG,GAC7C,GAAIurC,EAAO1uC,EAAEmD,MAAM,EAAG,IAAK,OAAOnD,EAAEmD,MAAM,EAAG,GAC7C,GAAIurC,EAAO1uC,EAAEmD,MAAM,EAAG,IAAK,OAAOnD,EAAEmD,MAAM,EAAG,GAC7C,GAAIurC,EAAO1uC,EAAEmD,MAAM,EAAG,IAAK,OAAOnD,EAAEmD,MAAM,EAAG,GAC7C,GAAIurC,EAAO1uC,EAAEmD,MAAM,EAAG,IAAK,OAAOnD,EAAEmD,MAAM,EAAG,GACxCkD,KAAKuoC,YAAYzkC,KAAKnK,KACzBA,EAAI,KAEN,IAAK,IAAI8d,EAAI,GAAKA,IAAK,GAAI4wB,EAAO1uC,EAAEmD,MAAM,EAAG,GAAK2a,GAAI,OAAO9d,EAAEmD,MAAM,EAAG,GAAK2a,IAhIjF,0BAmIE,SAAa1B,GAYX,IAXA,IAAIiyB,EAAW,GACXzhB,EAAW,GACXkiB,EAAY,GASP5wC,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAAK,CACnC,IAAIuO,EAAK2P,EAAIle,GACT6wC,EAAgB,SAAUntC,GACvBysC,EAAStuC,eAAe6B,KAAIysC,EAASzsC,GAAK,IAC/CysC,EAASzsC,GAAGgG,KAAK6E,EAAGC,UAEZ,CAACD,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,QACpC4M,KAAI,SAAUP,GACG,cAAfA,EAAE9G,SACJ2pC,EAAU7iC,EAAE0C,SAAU,EACE,eAAf1C,EAAE9G,UACX8G,EAAE8F,SAAShJ,SAAQ,SAAUqgC,GAC3B2F,EAAc3F,SAIpB2F,EAAc3yB,EAAIle,GAAG0B,QACrB,IAAIovC,EAAKpiB,EAASvmB,KAAK4oC,MAAMxiC,EAAGC,UAC3BsiC,IAAIA,EAAK,IACdA,EAAGpnC,KAAK6E,GACRmgB,EAASvmB,KAAK4oC,MAAMxiC,EAAGC,UAAYsiC,EAGrC,IAAIE,EAAQ,GACZ,IAAK,IAAIC,KAAOviB,EACd,GAAKA,EAAS7sB,eAAeovC,GAA7B,CACA,IAAIljC,EAAI5F,KAAK+oC,QAAQD,GACD,cAAfljC,EAAE9G,UAA8BkpC,EAASpiC,IAA8B,IAAvBoiC,EAASpiC,GAAGvJ,QAC/DwsC,EAAMtnC,KAAKqE,GAIf5F,KAAKgoC,SAAWA,EAIhB,IADA,IAAIgB,EAAY,GACP9qC,EAAI,EAAGA,EAAI2qC,EAAMxsC,OAAQ6B,IAChC8qC,EAAUH,EAAM3qC,GAAGoK,SAAU,EAE/B,MAAO,CAAC,MAASugC,EAAO,SAAYtiB,EACpC,UAAayiB,EAAW,SAAYhB,KAvLxC,kBA4LE,SAAK7Y,GACH,OAAOnvB,KAAK4jC,eAAezU,EAAE7lB,cA7LjC,yBAoME,SAAY1M,GAQV,MAAO,KANLA,EADEoD,KAAK6X,MAAMhb,QAAQ,KAAO,GAAKmD,KAAK1C,KAChCkR,QAAUxO,KAAK1C,KAAMV,GAClBoD,KAAK6X,MAAMhb,QAAQ,MAAQ,EAkvB1C,SAAwBkD,GAGtB,IAFA,IACI7B,EADAuc,EAAM,GAED5iB,EAAI,EAAGA,EAAIkI,EAAI1D,OAAQxE,IAC9BqG,EAAI6B,EAAImd,WAAWrlB,GAEjB4iB,GADEvc,EAAI,MACC,OAAS,WAAaA,EAAE2J,SAAS,KAAK/K,OAAO,GAC3CoB,EAAI,IACN,OAAS,OAASA,EAAE2J,SAAS,KAAK/K,OAAO,GAEzCiD,EAAIlI,GAGf,OAAO4iB,EA9vBGwuB,CAAcrsC,GA8uBjBmlB,UA5uBUnlB,IAEI,MA5MvB,kCA+ME,SAAqBmZ,GACnB,IAAImzB,EAASnzB,EAAIjZ,QACjBosC,EAAO9kC,OAoBP,IAnBA,IAAIrE,EAAM,GACNopC,EAAQ,8CACRttC,EAAOmE,KACPsmB,EAAKtmB,KAAK8e,MACV5nB,EAAU8I,KAAKoJ,WACfggC,EAAW,SAAXA,EAAqB7tC,GACvB,GAAmB,eAAfA,EAAEuD,SACJ,OAAOjD,EAAKwtC,eAAe9tC,GAI7B,IAFA,IAAIue,EAAOve,EAAEmQ,SACTuC,EAAOqY,EAAGlO,IAAI+wB,EAAQ,QACjBtxC,EAAIiiB,EAAKzd,OAAS,EAAGxE,GAAK,EAAGA,IAAK,CACzC,IAAIsgB,EAAQjhB,EAAQ2S,YACpB9J,GAAOqpC,EAASjxB,GAAS,IAAMixB,EAAS9iB,EAAGlO,IAAI+wB,EAAQ,UAAY,IAAMC,EAAStvB,EAAKjiB,IAAM,MAC7FkI,GAAOqpC,EAASjxB,GAAS,IAAMixB,EAAS9iB,EAAGlO,IAAI+wB,EAAQ,SAAW,IAAMC,EAASn7B,GAAQ,MACzFA,EAAOkK,EAET,OAAOtc,EAAKwtC,eAAep7B,IAEpBpW,EAAI,EAAGA,EAAIqxC,EAAO7sC,OAAQxE,IAAK,CACtC,IAAIuO,EAAK8iC,EAAOrxC,GACZ+B,EAAI,GACRA,GAAKwvC,EAAShjC,EAAGC,SAAW,IAC5BzM,GAAKwvC,EAAShjC,EAAGE,WAAa,IAC9B1M,GAAKwvC,EAAShjC,EAAG7M,QAAU,IACvByG,KAAK6X,MAAMhb,QAAQ,MAAQ,IAC7BjD,GAAKwvC,EAAShjC,EAAGkB,KAAO,KAG1BvH,GADAnG,GAAK,MAGP,OAAOmG,IAjPX,4BAoPE,SAAegW,GACb,IAEIuQ,EAAKtmB,KAAK8e,MAEVhZ,EAAS,CAAC,kDAAmD,UAIjEiQ,EAAI3R,MAHM,SAAU7I,EAAGqK,GACrB,OAAOsnB,kBAAqB3xB,EAAGqK,EAAG0gB,EAAIxgB,MAIpC9F,KAAK1C,OAAS0C,KAAKspC,mBACrBtpC,KAAKspC,iBAAmBtpC,KAAK1C,KAAO,KAGtC,IAAIisC,EAAU,GACVvpC,KAAK6X,MAAMhb,QAAQ,KAAO,IAC5B0sC,EAAQ,wCAA0C,KAEhDvpC,KAAK6X,MAAMhb,QAAQ,KAAO,IAC5B0sC,EAAQ,mDAAqD,KAE3DvpC,KAAK6X,MAAMhb,QAAQ,KAAO,IAC5B0sC,EAAQ,8CAAgD,MAI1D,IAAIC,EAAS,SAAUlwC,GAErB,IADA,IAAIM,EAAI,GACC/B,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK+B,GAAK,IACjC,OAAOA,GAGL6vC,EAAa,SAAbA,EAAuBC,GAEzB,IADA,IAAI3pC,EAAM,GACDlI,EAAI,EAAGA,EAAI6xC,EAAKrtC,OAAQxE,IAAK,CACpC,IAAI83B,EAAS+Z,EAAK7xC,GACd8xC,EAAwB,iBAAXha,EAAuBA,EAAS8Z,EAAW9Z,GAE5D,GAAU,IAAN93B,EAAS,CACX,IAAIyqB,EAAKviB,EAAIjD,OAAO,IAAM,IACf,MAAP6sC,GAAqB,MAAPA,IAEA,MAAPA,GAAgB,cAAc7pC,SAASwiB,MAGhDviB,GAAO,KAGXA,GAAO4pC,EAET,OAAO5pC,GA8DT,IAAI6pC,EAVJ,SAAoCtgC,GAIlC,IAHA,IAAIugC,EAAQ7pC,KAAK8pC,aAAaxgC,GAC1Bu/B,EAAQgB,EAAMhB,MACd/vB,EAAU,GACLjhB,EAAI,EAAGA,EAAIgxC,EAAMxsC,OAAQxE,IAAK,CACrC,IAAIZ,EAAO4xC,EAAMhxC,GACjBihB,EAAQvX,KAAKwoC,EAAY9yC,EAAM4yC,IAEjC,OAAO/wB,GAE2Czf,KAAK2G,MAGzD,SAAS+pC,EAAa1jC,EAASwjC,GAC7B,MAAyB,cAArBxjC,EAAQvH,UAA6B+qC,EAAM7B,SAAS3hC,GAGjD,CAAE2jC,EAAS3jC,EAASwjC,IAAStjC,OAAO,CAAC0jC,EAAa5jC,EAASwjC,KAAStjC,OAAO,CAAC,MAF1E2jC,EAAW7jC,EAASwjC,GAAO,GAAMtjC,OAAO,CAAC,MAiCpD,IAAI0jC,EA5BJ,SAA6B5jC,EAASwjC,GACpC,IAAI/wB,EAAU,GACVqxB,EAAW,KACXp0B,EAAM8zB,EAAMtjB,SAASvmB,KAAK4oC,MAAMviC,KAAa,GACjD,QAAmB,IAAR0P,EACT,MAAM,IAAIlW,MAAM,4BAA8BwG,GAIhD,IADA,IAAI+jC,EAAU,GACLvyC,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAAK,CACnC,IAAIuO,EAAK2P,EAAIle,GACTuO,EAAGE,UAAU1J,MAAQutC,EACvBC,EAAQ7oC,KAAK,MAET4oC,IACFrxB,EAAUA,EAAQvS,OAAO,CAAC6jC,IAAU7jC,OAAO,CAAC,MAC5C6jC,EAAU,IAEZtxB,EAAQvX,KAAKgoC,EAAQnjC,EAAGE,UAAU1J,KAC9B2sC,EAAQnjC,EAAGE,UAAU1J,KAAOotC,EAAS5jC,EAAGE,UAAWujC,KAEzDM,EAAW/jC,EAAGE,UAAU1J,IACxBwtC,EAAQ7oC,KAAK2oC,EAAW9jC,EAAG7M,OAAQswC,IAGrC,OADA/wB,EAAUA,EAAQvS,OAAO,CAAC6jC,KAIU/wC,KAAK2G,MAc3C,IAAIkqC,EAZJ,SAA0BrwC,EAAKgwC,EAAOpO,GACpC,MAAqB,cAAjB5hC,EAAIiF,WACL28B,QAAyCj1B,IAAhCqjC,EAAMb,UAAUnvC,EAAIyO,QAOzB0hC,EAASnwC,EAAKgwC,GANfA,EAAMtjB,SAASvmB,KAAK4oC,MAAM/uC,IACrB,CAAC,IAAKowC,EAAapwC,EAAKgwC,GAAQ,KAEhC,MAMqBxwC,KAAK2G,MAsBvCojC,EAAW3pC,UAAUuwC,SAAWA,EAChC,IAAIA,EArBJ,SAAwBK,EAAMR,GAC5B,IAAIhyC,EAAG4iB,EACP,OAAQ4vB,EAAKvrC,UACX,IAAK,QAGH,OADA2b,GADAA,EAAM,CAAC,MACGlU,OAAOqjC,EAAoBS,EAAK/gC,cAC/B/C,OAAO,CAAC,MAErB,IAAK,aAEH,IADAkU,EAAM,CAAC,KACF5iB,EAAI,EAAGA,EAAIwyC,EAAK3+B,SAASrP,OAAQxE,IACpC4iB,EAAIlZ,KAAK,CAAE2oC,EAAWG,EAAK3+B,SAAS7T,GAAIgyC,KAG1C,OADApvB,EAAIlZ,KAAK,KACFkZ,EAET,QACE,OAAOza,KAAKqpC,eAAegB,KAIHhxC,KAAK2G,MAenC,IAAIsqC,EAbJ,WACE,IAAIvqC,EAAM,GAIV,IAAK,IAAI7G,KAHL8G,KAAKspC,mBACPvpC,GAAO,aAAeC,KAAKuqC,YAAYvqC,KAAKspC,kBAAoB,OAEnDtpC,KAAKwmB,SACbxmB,KAAKwmB,SAAS9sB,eAAeR,IAC7B8G,KAAK8nC,eAAe5uC,KACzB6G,GAAO,WAAaC,KAAKwmB,SAASttB,GAAM,KAAO8G,KAAKuqC,YAAYrxC,GAC9D,OAEJ,OAAO6G,EAAM,MAE+B1G,KAAK2G,MAE/C0pC,EAAOE,EAAoB7zB,GAC/B,OAAOu0B,IAvJY,SAAfE,EAAyBd,EAAMja,GACjC,IAAI1vB,EAAM,GACN0qC,EAAa,SACHjkC,IAAVipB,IAAqBA,GAAS,GAClC,IAAK,IAAI53B,EAAI,EAAGA,EAAI6xC,EAAKrtC,OAAQxE,IAAK,CACpC,IAAI83B,EAAS+Z,EAAK7xC,GAClB,GAAsB,iBAAX83B,EAAqB,CAC9B,IAAIpT,EAASiuB,EAAa7a,EAAQF,EAAQ,GAC1C,GACElT,EAAOlgB,OAAS,IA9DZ,GADC,EA+DkCozB,IACrClT,EAAO1f,QAAQ,OAAS,EAAG,CAC7B,IAAIkL,EAAO0hC,EAAW9Z,GAClB5nB,EAAK1L,OAjEL,GADC,EAkE+BozB,IAClCE,EAAS5nB,EACTwU,EAAS,IAGTA,IAAQkuB,EAAa,KACzB1qC,GAAOwc,EAET,GAAsB,iBAAXoT,EAAqB,CAC9B,GAAsB,IAAlBA,EAAOtzB,QAAkC,OAAlB0D,EAAIjD,OAAO,IAChC,MAAMD,QAAQ8yB,IAAW,EAAG,CAC9B5vB,EAAMA,EAAIjD,MAAM,GAAI,GAAK6yB,EAAS,KAClC8a,GAAc,EACd,SAGJ,GAAIA,EAlFG,EAkFoBhb,EAAQ,GACjCgb,EAAa9a,EAAOtzB,OAAS,EAlFzB,IAkFsC,KAAKQ,QAAQkD,EAAIA,EAAI1D,OAAS,IAAM,EAC9E0D,EAAMA,EAAIjD,MAAM,GAAI,GAAK,IAAM6yB,EAAS,KACxC8a,GAAc9a,EAAOtzB,OAAS,MACzB,CACL,IAAI0L,EAAOyhC,EAvFN,EAuFsB/Z,GAASE,EACpC5vB,GAAOgI,EAAO,KACd0iC,EAAa1iC,EAAK1L,OACdozB,EAAQ,IACV1vB,GAAO,KACP0qC,EAAa,OAKrB,OAAO1qC,EA4GmByqC,CAAad,KAlc7C,4BAucE,SAAgBW,EAAMR,GACpB,OAAQQ,EAAKvrC,UACX,IAAK,YACL,IAAK,WACH,OAAOurC,EAAK/hC,OACd,IAAK,UACH,IAAIwJ,EAAMu4B,EAAKvxC,MACf,GAAmB,iBAARgZ,EACT,MAAM,IAAI7V,UAAU,8CAGtB,GAAIouC,EAAKj+B,UAAYpM,KAAK6X,MAAMhb,QAAQ,KAAO,EAC7C,OAAQwtC,EAAKj+B,SAASxP,KAEpB,IAAK,2CACH,OAAOkV,EAET,IAAK,2CAEH,OADIA,EAAIjV,QAAQ,KAAO,IAAGiV,GAAO,MAC1BA,EAET,IAAK,0CAEH,IAAM44B,EAAY54B,EAAIpO,cAAc7G,QAAQ,KAAO,EAGnD,OAFIiV,EAAIjV,QAAQ,KAAO,IAAM6tC,IAAW54B,GAAO,MAC1C44B,IAAW54B,GAAO,MAChBA,EAGT,IAAK,2CACH,MAAsB,MAAfu4B,EAAKvxC,MAAgB,OAAS,QAG3C,IAAIiH,EAAMC,KAAK2qC,WAAWN,EAAKvxC,OAM/B,OALIuxC,EAAKl+B,SACPpM,GAAO,IAAMsqC,EAAKl+B,SACRk+B,EAAKj+B,SAAS/E,OAAOrH,KAAK6N,IAAItN,UACxCR,GAAO,KAAOC,KAAKqpC,eAAegB,EAAKj+B,SAAUy9B,IAE5C9pC,EACT,IAAK,YACH,OAAOC,KAAK4qC,WAAWP,GACzB,QACE,MAAM,IAAIxqC,MAAM,0CAA4CwqC,EAAO,iBAAmBA,EAAKvrC,aAlfnG,wBA4fE,SAAWiB,EAAK8X,GACTA,IAAOA,EAAQ,KACpB,IACIhgB,EAAG4f,EAAGvZ,EACN+lB,EACA4mB,EAHApwB,EAAM,GAcV,IAVI1a,EAAI1D,OAAS,IACK,MAAlB0D,EAAIjD,OAAO,IACX+a,EAAMhb,QAAQ,KAAO,IACpBkD,EAAIlD,QAAQ,MAAQ,GAAKkD,EAAIlD,QAAQ,KAAO,IAC/ConB,EAAQ,MACR4mB,EAAY7qC,KAAK8qC,aAEjB7mB,EAAQ,IACR4mB,EAAY7qC,KAAK+qC,YAEdlzC,EAAI,EAAGA,EAAIkI,EAAI1D,QAAS,CAG3B,GAFAwuC,EAAU1mB,UAAY,EAEb,MADD0mB,EAAU1tC,KAAK4C,EAAIjD,MAAMjF,IAClB,MACf4f,EAAI5f,EAAIgzC,EAAU1mB,UAAY,EAC9B1J,GAAO1a,EAAIjD,MAAMjF,EAAG4f,GACpB,IAAI6K,EAAKviB,EAAI0X,GACF,MAAP6K,GAAwB,QAAV2B,GAA2C,QAAxBlkB,EAAIjD,MAAM2a,EAAGA,EAAI,GACpDgD,GAAO6H,GAEPpkB,EAAI,kBAAkBrB,QAAQylB,KACrB,EACP7H,GAAO,KAAO,YAAYvc,GAEtB2Z,EAAMhb,QAAQ,MAAQ,EACxB4d,GAAO,OAAS,MACd6H,EAAGpF,WAAW,GAAGrV,SAAS,IAAInE,eAAe5G,OAAO,GAEtD2d,GAAO6H,EAIbzqB,EAAI4f,EAAI,EAEV,OAAOwM,EAAQxJ,EAAM1a,EAAIjD,MAAMjF,GAAKosB,IApiBxC,wBAwiBE,SAAY1oB,GACV,IAAIqB,EAAMrB,EAAEqB,IACR6a,EAAI7a,EAAIC,QAAQ,KAIpB,GAHI4a,EAAI,GAAKzX,KAAK6X,MAAMhb,QAAQ,KAAO,IACrC4a,EAAI7a,EAAIiB,YAAY,MAElB4Z,GAAK,GAAKzX,KAAK6X,MAAMhb,QAAQ,KAAO,IAEb,IAAxBD,EAAIC,QAAQ,SAAuC,IAAtBD,EAAIC,QAAQ,OAAuC,IAAxBD,EAAIC,QAAQ,SAAgB,CAErF,IADA,IAAImuC,GAAW,EACN9sC,EAAIuZ,EAAI,EAAGvZ,EAAItB,EAAIP,OAAQ6B,IAClC,GAAI8B,KAAKue,cAAc1hB,QAAQD,EAAIsB,KAAO,EAAG,CAC3C8sC,GAAW,EACX,MAYJ,GAAIA,EAAU,CACZ,IAAIC,EAAUruC,EAAIE,MAAM2a,EAAI,GACxByzB,EAAStuC,EAAIE,MAAM,EAAG2a,EAAI,GAC9B,GAAIzX,KAAKspC,kBAAoBtpC,KAAKspC,mBAAqB4B,GACnDlrC,KAAK6X,MAAMhb,QAAQ,KAAO,EAC5B,OAAImD,KAAK6X,MAAMhb,QAAQ,MAAQ,GAC7BmD,KAAKmrC,QAAQtuC,QAAQouC,GAAW,EACzBA,EAEF,IAAMA,EAGf,IAAIrxB,EAAS5Z,KAAKwmB,SAAS0kB,GAE3B,GADKtxB,IAAQA,EAAS5Z,KAAKorC,aAAaF,IACpCtxB,EAEF,OADA5Z,KAAK8nC,eAAeoD,IAAU,EACvBtxB,EAAS,IAAMqxB,GAK5B,OAAOjrC,KAAKuqC,YAAY3tC,KAtlB5B,wBA6lBE,SAAWyuC,GACT,IAAI/kB,EAAKtmB,KAAK8e,MACVvI,EAAU+P,EAAG/P,QACb+0B,EAAU/0B,GAAWA,EAAQO,QAI7By0B,EAAUvrC,KAAK8e,MAAMlK,MAAM,GAC/B,IAAK,IAAIhb,KAAK2xC,EAAS,CACrB,IAAIvnC,EAASsiB,EAAG4hB,OAAOtuC,GACnB0xC,GAAWtnC,EAAOqD,OAAOikC,IAC7BD,EAAM,KAAOrrC,KAAKqpC,eAAerlC,GAAU,IACzChE,KAAKqpC,eAAe/iB,EAAGlO,IAAI,iDACzB,MAAQpY,KAAK4jC,eAAetd,EAAGpgB,wBAC/BM,OAAWA,OAAWA,EAAWxC,IAAW,SAKlDsiB,EAAGpgB,wBAAmBM,EACpB8f,EAAGlO,IAAI,iDAAiDjS,KACxD,SAAUC,GACRilC,EAAM,MAAQjlC,EAAG7M,OAAOT,MAAQ,sBAChC,IAAIid,EAAMuQ,EAAGpgB,wBAAmBM,OAAWA,OAAWA,EAAWJ,EAAGC,SACpEglC,EAAMrrC,KAAK4jC,eAAe5jC,KAAK4jC,eAAe7tB,KAC9Cs1B,EAAM,WAKV,IAAIG,EAAc,GACdF,GAASE,EAAYjqC,KAAK+pC,GAC9B,IAAIG,EAAW,GACfD,EAAYrlC,KAAI,SAAUnC,GACxBynC,EAAWA,EAASllC,OAAO+f,EAAGpgB,wBAAmBM,OAAWA,OAAWA,EAAWxC,OAEpFqnC,EAAMrrC,KAAK4jC,eAAe6H,MAjoB9B,6BAsoBE,SAAgB11B,GACd,IAGI21B,EAAkB,GACtBA,EAAgB,gDAAiD,EAEjE,IAAIC,EAAW,+CAIXnC,EAAS,SAAUlwC,GAErB,IADA,IAAIM,EAAI,GACC/B,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK+B,GAAK,IACjC,OAAOA,GAGLgyC,EAAgB,SAAhBA,EAA0BlC,GAE5B,IADA,IAAI3pC,EAAM,GACDlI,EAAI,EAAGA,EAAI6xC,EAAKrtC,OAAQxE,IAAK,CACpC,IAAI83B,EAAS+Z,EAAK7xC,GAElBkI,GAD4B,iBAAX4vB,EAAuBA,EAASic,EAAcjc,GAGjE,OAAO5vB,GAmDT,IAAI8rC,EAXJ,SAAuCviC,GACrCtJ,KAAK6nC,cAAc,MAAO,+CAI1B,IAHA,IAAIgC,EAAQ7pC,KAAK8pC,aAAaxgC,GAC1Bu/B,EAAQgB,EAAMhB,MACd/vB,EAAU,GACLjhB,EAAI,EAAGA,EAAIgxC,EAAMxsC,OAAQxE,IAAK,CACrC,IAAIZ,EAAO4xC,EAAMhxC,GACjBihB,EAAQvX,KAAKuqC,EAAe70C,EAAM4yC,IAEpC,OAAO/wB,GAEiDzf,KAAK2G,MAE/D,SAAS+rC,EAAchsC,GACrB,YAAmB,IAARA,EAA4B,mBAChCA,EAAIhC,QAAQ,UAAU,SAAU9F,GACrC,OAAQA,EAAE,IACR,IAAK,IACH,MAAO,QACT,IAAK,IACH,MAAO,OACT,IAAK,IACH,MAAO,aAQf,IAAI+zC,EAHJ,SAAuBlhC,GACrB,OAAOihC,EAAc/rC,KAAK1C,KAAQ4vB,MAASjvB,MAAM+B,KAAK1C,KAAMwN,EAAKlO,KAAOkO,EAAKlO,MAErDvD,KAAK2G,MA2G/B,IAAI8rC,EAxGJ,SAA+BzlC,EAASwjC,GACtC,IACI/7B,EAAM/U,EAAGqN,EAAImN,EADbuF,EAAU,GAEV/C,EAAM8zB,EAAMtjB,SAASvmB,KAAK4oC,MAAMviC,IACpC,QAAmB,IAAR0P,EACT,OAAOk2B,EAAgB5lC,EAASwjC,GAUlC9zB,EAAI3R,MAAK,SAAUC,EAAGC,GACpB,IAAI4nC,EAAK7nC,EAAEiC,UAAU1J,IACjBuvC,EAAK7nC,EAAEgC,UAAU1J,IACrB,GAAIsvC,EAAGjkB,UAAU,EAAG0jB,EAAStvC,UAAYsvC,GAAYQ,EAAGlkB,UAAU,EAAG0jB,EAAStvC,UAAYsvC,EACxF,OAAOO,EAAG3nC,cAAc4nC,GAG1B,IAAIC,EAAKF,EAAGjkB,UAAU0jB,EAAStvC,QAC3BgwC,EAAKF,EAAGlkB,UAAU0jB,EAAStvC,QAC3BiwC,EAAKloB,SAASgoB,EAAI,IAClBG,EAAKnoB,SAASioB,EAAI,IACtB,OAAIh9B,MAAMi9B,IAAOj9B,MAAMk9B,IACrBD,IAAOF,GAAMG,IAAOF,EACbH,EAAG3nC,cAAc4nC,GAGnBG,EAAKC,KAGd,IAAK,IAAI10C,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAG9B,GAAyB,qDAFzBuO,EAAK2P,EAAIle,IAEFyO,UAAU1J,KAA8DkR,GAA+B,cAAvB1H,EAAG7M,OAAOuF,SAAjG,CAOA,IADAyU,EAAOnN,EAAGE,WACD1J,IAAI2f,OAAO,EAAGovB,EAAStvC,UAAYsvC,EAAU,CACpD,IAAIa,EAASj5B,EAAK3W,IAAI2f,OAAOovB,EAAStvC,QAGlCmwC,IADYpoB,SAASooB,EAAQ,IACR3kC,aAGvB0L,EAAOvT,KAAKoJ,WAAWP,UAAU,kDAKrC,OADA9P,EAAI+oB,EAAMvO,GACFnN,EAAG7M,OAAOuF,UAChB,IAAK,YAEDga,EADuC,IAArC+wB,EAAM7B,SAAS5hC,EAAG7M,QAAQ8C,OAClByc,EAAQvS,OAAO,CAAC,IAAMxN,EAAI,6BAClC+yC,EAAe1lC,EAAG7M,OAAQswC,GAC1B,KAAO9wC,EAAI,MAEH+f,EAAQvS,OAAO,CAAC,IAAMxN,EAAI,gBAClCqN,EAAG7M,OAAO+O,OAAOxL,MAAM,GAAK,QAEhC,MACF,IAAK,YACHgc,EAAUA,EAAQvS,OAAO,CAAC,IAAMxN,EAAI,kBAClCizC,EAAO5lC,EAAG7M,QAAU,QACtB,MACF,IAAK,UACHuf,EAAUA,EAAQvS,OAAO,CAAC,IAAMxN,GAC/BqN,EAAG7M,OAAO6S,SAAS/E,OAAOrH,KAAK6N,IAAItN,QAChC,GACA,kBAAoBwrC,EAAa3lC,EAAG7M,OAAO6S,SAASxP,KAAO,MAC9DwJ,EAAG7M,OAAO4S,SAAW,cAAgB/F,EAAG7M,OAAO4S,SAAW,IAAM,IACjE,IAAM4/B,EAAa3lC,EAAG7M,OAAOT,OAC7B,KAAOC,EAAI,MACX,MACF,IAAK,aACH+f,EAAUA,EAAQvS,OAAO,CAAC,IAAMxN,EAAI,+BAClC0zC,EAAkBrmC,EAAG7M,OAAQswC,GAC7B,KAAO9wC,EAAI,MACb,MACF,QACE,MAAM,IAAI8G,MAAM,kCAAoCuG,EAAG7M,OAAOuF,SAAW,mBAhD3EgP,EAAO1H,EAAG7M,OAoDd,IAAImzC,EAAM5+B,EAAOgU,EAAMhU,GAAQ,kBAE3Bs4B,EAAQ,GASZ,MARyB,cAArB//B,EAAQvH,SACL+qC,EAAM7B,SAAS3hC,IAA+C,IAAnCwjC,EAAM7B,SAAS3hC,GAAShK,SACtD+pC,EAAQ,gBAAkB//B,EAAQiC,OAAOxL,MAAM,GAAK,KAGtDspC,EAAQ,eAAiB4F,EAAO3lC,GAAW,IAGtC,CAAE,IAAMqmC,EAAMtG,EAAQ,KAAM7/B,OAAO,CAACuS,IAAUvS,OAAO,CAAC,KAAOmmC,EAAM,OAGlCrzC,KAAK2G,MAE/C,SAASysC,EAAmBpmC,EAASwjC,GAEnC,IADA,IAAIpvB,EAAM,GACD5iB,EAAI,EAAGA,EAAIwO,EAAQqF,SAASrP,OAAQxE,IAC3C4iB,EAAIlZ,KAAKuqC,EAAezlC,EAAQqF,SAAS7T,GAAIgyC,IAE/C,OAAOpvB,EA4CT,IAAIwxB,EAxCJ,SAAgC5lC,EAASwjC,GACvC,IAAI/wB,EAAU,GACV/C,EAAM8zB,EAAMtjB,SAASvmB,KAAK4oC,MAAMviC,IACpC,IAAK0P,EAAK,OAAO+C,EACjB/C,EAAI3R,OACJ,IAAK,IAAIvM,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAAK,CACnC,IAAIuO,EAAK2P,EAAIle,GACb,OAAQuO,EAAG7M,OAAOuF,UAChB,IAAK,YAEDga,EADE+wB,EAAMb,UAAU5iC,EAAG7M,OAAO+O,QAClBwQ,EAAQvS,OAAO,CAAC,IAAMub,EAAM1b,EAAGE,WAAa,gBAAkBF,EAAG7M,OAAO+O,OAAOxL,MAAM,GAAK,KAClG,KAAOglB,EAAM1b,EAAGE,WAAa,MAErBwS,EAAQvS,OAAO,CAAC,IAAMub,EAAM1b,EAAGE,WAAa,6BACpD2lC,EAAgB7lC,EAAG7M,OAAQswC,GAC3B,KAAO/nB,EAAM1b,EAAGE,WAAa,MAEjC,MACF,IAAK,YACHwS,EAAUA,EAAQvS,OAAO,CAAC,IAAMub,EAAM1b,EAAGE,WAAa,kBACpD0lC,EAAO5lC,EAAG7M,QAAU,QACtB,MACF,IAAK,UACHuf,EAAUA,EAAQvS,OAAO,CAAC,IAAMub,EAAM1b,EAAGE,YACtCF,EAAG7M,OAAO6S,SAAS/E,OAAOrH,KAAK6N,IAAItN,QAAU,GAAK,kBAAoBwrC,EAAa3lC,EAAG7M,OAAO6S,SAAStT,OAAS,MAC/GsN,EAAG7M,OAAO4S,SAAW,cAAgB/F,EAAG7M,OAAO4S,SAAW,IAAM,IACjE,IAAM4/B,EAAa3lC,EAAG7M,OAAOT,OAC7B,KAAOgpB,EAAM1b,EAAGE,WAAa,MAC/B,MACF,IAAK,aACHwS,EAAUA,EAAQvS,OAAO,CAAC,IAAMub,EAAM1b,EAAGE,WAAa,+BACpDmmC,EAAkBrmC,EAAG7M,OAAQswC,GAC7B,KAAO/nB,EAAM1b,EAAGE,WAAa,MAC/B,MACF,QACE,MAAM,IAAIzG,MAAM,kCAAoCuG,EAAG7M,OAAOuF,SAAW,cAG/E,OAAOga,GAEmCzf,KAAK2G,MA2BjD,IAAI8hB,EAzBJ,SAAsBhX,GACpB,IAAIlO,EAAMkO,EAAKlO,IAEX6a,EAAI7a,EAAIC,QAAQ,KAIpB,GAHI4a,EAAI,GAAKzX,KAAK6X,MAAMhb,QAAQ,KAAO,IACrC4a,EAAI7a,EAAIiB,YAAY,MAElB4Z,EAAI,EAAG,MAAM,IAAI5X,MAAM,6BAA+BjD,EAAM,KAEhE,IAAK,IAAIsB,EAAIuZ,EAAI,EAAGvZ,EAAItB,EAAIP,OAAQ6B,IAClC,GAAI8B,KAAKue,cAAc1hB,QAAQD,EAAIsB,KAAO,EACxC,MAAM,IAAI2B,MAAM,sBAAwBjD,EAAIsB,GAAK,qCAAuCtB,GAG5F,IAAIquC,EAAUruC,EAAIE,MAAM2a,EAAI,GACxByzB,EAAStuC,EAAIE,MAAM,EAAG2a,EAAI,GAC9B,GAAIzX,KAAKspC,kBAAoBtpC,KAAKspC,mBAAqB4B,GACrDlrC,KAAK6X,MAAMhb,QAAQ,KAAO,EAC1B,OAAOouC,EAET,IAAIrxB,EAAS5Z,KAAKwmB,SAAS0kB,GAG3B,OAFKtxB,IAAQA,EAAS5Z,KAAKorC,aAAaF,IACxCQ,EAAgBR,IAAU,EACnBtxB,EAAS,IAAMqxB,GAEA5xC,KAAK2G,MAIzB0pC,EAAOmC,EAAuB91B,GAC9BhW,EAAM,WAIV,IAAK,IAAI7G,KAHL8G,KAAKspC,mBACPvpC,GAAO,WAAagsC,EAAa/rC,KAAKspC,kBAAoB,KAE7CoC,EACb,GAAKA,EAAgBhyC,eAAeR,GAApC,CAEA,IAAIyzC,EAAO3sC,KAAK1C,MAAQ0C,KAAK6X,MAAM/X,SAAS,KAAQotB,MAASjvB,MAAM+B,KAAK1C,KAAMpE,GAAMA,EACpF6G,GAAO,YAAcC,KAAKwmB,SAASttB,GAAM,KAAO6yC,EAAaY,GAAO,IAKtE,OA7QsB,SAAlBC,EAA4BlD,EAAMja,GACpC,IACI1nB,EADAhI,EAAM,GAEN0qC,EAAa,IACZhb,IAAOA,EAAQ,GACpB,IAAK,IAAI53B,EAAI,EAAGA,EAAI6xC,EAAKrtC,OAAQxE,IAAK,CACpC,IAAI83B,EAAS+Z,EAAK7xC,GAClB,GAAsB,iBAAX83B,EAAqB,CAC9B,IAAIpT,EAASqwB,EAAgBjd,EAAQF,EAAQ,GAE3ClT,EAAOlgB,OAAS,IApCZ,GADC,EAqCkCozB,IACvClT,EAAO1f,QAAQ,OAAS,IACxBkL,EAAO6jC,EAAcjc,IACZtzB,OAvCL,GADC,EAwC+BozB,IAClCE,EAAS,MAAQ5nB,EACjBwU,EAAS,IAGTA,IAAQkuB,EAAa,KACzB1qC,GAAOwc,EAEa,iBAAXoT,IACL8a,EAjDG,EAiDoBhb,EAAQ,GACjC1vB,EAAMA,EAAIjD,MAAM,GAAI,GAAK,IAAM6yB,EAAS,KACxC8a,GAAc9a,EAAOtzB,OAAS,IAG9B0D,IADAgI,EAAOyhC,EArDF,EAqDkB/Z,GAASE,GAClB,KACd8a,EAAa1iC,EAAK1L,SAKxB,OAAO0D,EA4OF6sC,CADK,CAFZ7sC,GAAO,IAEW2pC,EAAM,eACO,OA/6BnC,M,cCpBA,IAAI7jC,EAGJA,EAAI,WACH,OAAO7F,KADJ,GAIJ,IAEC6F,EAAIA,GAAK,IAAIgnC,SAAS,cAAb,GACR,MAAOnlC,GAEc,iBAAXlQ,SAAqBqO,EAAIrO,QAOrCJ,EAAOD,QAAU0O,G,0ICPXoE,EAAe,IAAI6iC,IAGJ3hC,E,WAwCnB,WACE9E,EACAC,EACA/M,EACAsR,GACA,uHACA7K,KAAKqG,QAAUnG,IAAKqL,UAAUlF,GAC9BrG,KAAKsG,UAAYpG,IAAKqL,UAAUjF,GAChCtG,KAAKzG,OAAS2G,IAAKqL,UAAUhS,GAC7ByG,KAAK6K,MAAiBrE,MAATqE,EAAqBZ,EAAe/J,IAAKqL,UAAUV,G,6BAIlE,WACE,OAAO7K,KAAK6K,O,IAGd,SAAShF,GACP7F,KAAK6K,MAAQhF,I,oBAOf,SAAQsC,GACN,OACEA,EAAM9B,QAAQgB,OAAOrH,KAAKqG,UAC1B8B,EAAM7B,UAAUe,OAAOrH,KAAKsG,YAC5B6B,EAAM5O,OAAO8N,OAAOrH,KAAKzG,SACzB4O,EAAM0C,MAAMxD,OAAOrH,KAAK6K,S,wBAQ5B,SAAY3C,GACV,IAAMtC,EAAI,IAAIuF,EACZnL,KAAKqG,QAAQ+O,WAAWlN,GACxBlI,KAAKsG,UAAU8O,WAAWlN,GAC1BlI,KAAKzG,OAAO6b,WAAWlN,GACvBgpB,YAAelxB,KAAK6K,OAAS7K,KAAK6K,MAC/B7K,KAAK6K,MAAYuK,WAAWlN,IAGjC,OADAxL,QAAQrB,IAAI,4BAA8BuK,GACnCA,I,yBAIT,WACE,IAAI4U,EAAQ,CACVxa,KAAKqG,QAAQgC,cACbrI,KAAKsG,UAAU+B,cACfrI,KAAKzG,OAAO8O,eAKd,OAHIrI,KAAK6K,OAAS7K,KAAK6K,MAAM/L,WAAa1E,KACtCogB,EAAMjZ,KAAKvB,KAAK6K,MAAMxC,eAEnBmS,EAAMpd,KAAK,KAAO,O,kBAI3B,WACE,MAAO,CACL4C,KAAKqG,QAAQiC,OACbtI,KAAKsG,UAAUgC,OACftI,KAAKzG,OAAO+O,QACZlL,KAAK,KAAO,O,kBAIhB,WACE,MAAO,CACL4C,KAAKqG,QAAQiC,OACbtI,KAAKsG,UAAUgC,OACftI,KAAKzG,OAAO+O,OACZ4oB,YAAelxB,KAAK6K,OAAS,GAAM7K,KAAK6K,MAAYvC,QACpDlL,KAAK,KAAO,O,sBAIhB,WACE,OAAO4C,KAAKsI,W,mCC3IhB,8GA0Be,SAASqT,EACtB5b,EACAumB,EACAhpB,GAGA,IAFA6J,EAEA,uDAFoC,cACpCpF,EACA,uCAEAoF,GADAA,EAAcA,GAAejM,KACH+E,MAAM,KAAK,GACrC,IACE,GAAIkH,IAAgBzM,KAAiByM,IAAgBjM,IAAmB,CACtE,IAAIvB,EAAImgC,YAASxT,EAAIA,EAAIhpB,EAAMA,EAAM,KAAM,KAAM,GAAI,MACrD3D,EAAEgnB,QAAQ5gB,GACV2jC,SACK,GAAIv8B,IAAgBpM,IAAmB,CAC5C,IAAI6gB,EAAS,IAAIkc,IAAUxR,GAC3B1K,EAAOD,MAAMuR,WAAcntB,GAAMzC,EAAMgpB,EAAGlO,IAAI9a,IAC9ComC,SACK,GAAIv8B,IAAgB/L,IACzBmyB,YAAaL,WAAcntB,EAAK,CAACoH,YAAa/L,MAAoBkrB,EAAIhpB,GACtEomC,SACK,GAAIv8B,IAAgB3M,IACzB+yB,YAAaL,WAAcntB,EAAK,CAACoH,YAAa3M,MAAmB8rB,EAAIhpB,GACrEomC,SACK,GAAKv8B,IAAgBnM,KAA6BmM,IAAgBlM,IACvE8xC,YAAmBhtC,EAAKumB,EAAIhpB,GAC5BomC,SACK,GAAIv8B,IAAgB1M,IACzBk/B,YAAa55B,EAAKumB,EAAIhpB,EAAMomC,OACvB,IAAIv8B,IAAgBtM,KAChBsM,IAAgBvM,IAGpB,WAAoB4L,IAAhBW,EACH,IAAItH,MAAM,4BAEV,IAAIA,MAAM,2BAA6BsH,EAAc,QAL3D,IAAI6lC,EAAW,IAAIC,IAAW,CAAE/1C,QAAS+sC,MACzCiJ,EAAc,KAAMntC,IAMtB,MAAO2H,GAEPylC,EAAqBzlC,GAgBvB,SAASg8B,IACH3hC,GACFA,EAAS,KAAMukB,GAMnB,SAAS6mB,EAAsBzlC,GAC7B,GAEEP,IAAgB1M,KAEhB0M,IAAgBtM,KAEhBsM,IAAgBvM,IAChB,CACA,IAAImH,EAEG,CACL,IAAIw9B,EAAK,IAAI1/B,MAAW6H,EAAI,2BAA6BpK,EAAO,QAAU6J,GAG1E,MADAo4B,EAAG6N,MAAQ1lC,EACL63B,EALNx9B,EAAS2F,EAAG4e,IAoBlB,SAAS4mB,EAAelV,EAAoBqV,GACtCrV,GACDj2B,EAA0Bi2B,EAAK1R,GAElC,IACE0mB,EAASrxB,MAAM0xB,EAAQC,GACvB,MAAOtV,GACNj2B,EAA0Bi2B,EAAK1R,IAIpC,SAASgnB,EAAgBtV,EAAYvsB,GAC/BA,EACF6a,EAAG7V,IAAIhF,EAAOpF,QAASoF,EAAOnF,UAAWmF,EAAOlS,OAAQkS,EAAOZ,OAE9D9I,EAA0Bi2B,EAAK1R,GAlEnC3K,EAAc4xB,QAAS,CACtB,WAAW,EACX,eAAe,EACf,uBAAuB,EACvB,yBAAyB,EACzB,aAAa,EACb,6BAA6B,EAC7B,0CAA0C,EAC1C,uBAAuB,EACvB,sBAAuB,EACvB,uBAAwB,K,stDCzBP5yB,E,gCAiCnB,aAMI,MALKrR,EAKL,uDALoC,GAC/BmnB,EAIL,uDAJuC,GAClCO,EAGL,uDAHwC,GACnCnB,EAEL,uDAFoC,GACtC1b,EACE,uDADkB,GAClB,aACF,cAAM,KANC7K,aAKL,EAJKmnB,cAIL,EAHKO,eAGL,EAFKnB,WAEL,sBAtC6Bt1B,KAsC7B,wBApCSqF,IAAW4tC,OAoCpB,gDA3BI,GA2BJ,gBArBC9kC,KAqBD,gCAGF,EAAKU,WAAc+K,GAAQA,EAAK/K,YAAee,IAH7C,UAKyBlB,KALzB,yBAKQwkC,EALR,QAMA,EAAKA,GAAiB,wBAAa,IAAKrkC,YAAWqkC,GAAhB,qBADrC,2BAAkD,IALhD,uC,+BAgBJ,SACEpnC,EACAC,EACA/M,EACAsR,GACkC,WAIlC,OAHyB,IAArBgM,UAAUxa,QACXgK,EAAmB3D,SAAQ,SAAA0D,GAAE,OAAI,EAAKqK,IAAIrK,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,OAAQ6M,EAAGyE,UAE9E7K,KAAKsJ,WAAW/H,KAAKvB,KAAKoJ,WAAWQ,KAAKvD,EAASC,EAAW/M,EAAQsR,M,0BAM/E,SAAcyW,GACZ,OAAOthB,KAAKyQ,IAAI6Q,K,mBAOlB,SAAO9X,GACL,OAAOxJ,KAAKoJ,WAAWS,UAAUL,K,oBAOnC,SAAQF,GAA0B,WAChCA,EAAW5G,SAAQ,SAAAkH,GACjB,EAAK6G,IAAI7G,EAAKvD,QAASuD,EAAKtD,UAAWsD,EAAKrQ,OAAQqQ,EAAKiB,Y,iBAgB7D,SACEjR,EACAD,EACArB,EACAuN,GAEA,IAAMO,EAAKpG,KAAK0tC,qBAAqB9zC,EAAGD,EAAGrB,EAAGuN,GAC9C,OAAU,MAANO,EACK,KACO,MAALxM,EACFwM,EAAGC,QACI,MAAL1M,EACFyM,EAAGE,UACI,MAALhO,EACF8N,EAAG7M,OAGL,O,sBAUT,SACEK,EACAD,EACArB,EACAuN,GAEA,IAAMD,EAAI5F,KAAKyT,IAAI7Z,EAAGD,EAAGrB,EAAGuN,GAC5B,OAAOD,EAAIA,EAAE9M,WAAQ,I,mBAUvB,SACEc,EACAD,EACArB,EACAuN,GAEA,IAAMD,EAAI5F,KAAKyT,IAAI7Z,EAAGD,EAAGrB,EAAGuN,GAC5B,OAAOD,EAAI1F,IAAKwP,KAAK9J,QAAK,I,kCAM5B,SACEhM,EACAD,EACArB,EACAuN,GAEA,IAAItK,EAAIyE,KAAKkG,mBAAmBtM,EAAGD,EAAGrB,EAAGuN,GAAG,GAC5C,GAAKtK,GAAkB,IAAbA,EAAEc,OAIZ,OAAOd,EAAE,K,gBAQX,SAAIuP,GACF,OAAO9K,KAAKoJ,WAAWI,GAAGsB,K,gCAc5B,SACElR,EACAD,EACArB,EACAuN,EACAgU,GAEA,IAAM9D,EAAM/V,KAAKsJ,WAAWoJ,QAAO,SAAAtM,GAAE,QACjCxM,GAAKA,EAAEyN,OAAOjB,EAAGC,aACjB1M,GAAKA,EAAE0N,OAAOjB,EAAGE,eACjBhO,GAAKA,EAAE+O,OAAOjB,EAAG7M,YACjBsM,GAAKA,EAAEwB,OAAOjB,EAAGyE,WAGrB,OAAIgP,EACoB,IAAf9D,EAAI1Z,OAAe,GAAK,CAAC0Z,EAAI,IAG/BA,I,4BAUT,SAAgBnG,GACd,IAAI+9B,EACAC,EAEA/1C,EACAsG,EAEAsC,EACAoO,EAEJ,IAAK,IAAI3Q,KADTyvC,EAAO,GACO/9B,EACZ,GAAKA,EAAMlW,eAAewE,GAA1B,CASA,IARA2Q,EAAIe,EAAM1R,GAMV0vC,GAAS,EACT/1C,EAAI,EACCsG,GAPLsC,EAAOT,KAAK2/B,UACV,EACA3/B,KAAKoJ,WAAWP,UAAU,mDAC1B7I,KAAKoJ,WAAWP,UAAU3K,KAIZ7B,OAAQxE,EAAIsG,EAAKtG,IAG/B,GAFM4I,EAAK5I,GACD+E,OACCgT,EAAO,CAChBg+B,GAAS,EACT,MAGAA,IACFD,EAAKzvC,GAAK2Q,GAGd,OAAO8+B,I,wBAIT,WACE,OAAO,IAAI1yB,M,kBAeb,SACErhB,EACAD,EACArB,EACAuN,GAEA,IAAMiT,EAAkB,GACpB/C,EAAM/V,KAAKkG,mBAAmBtM,EAAGD,EAAGrB,EAAGuN,GAAG,GAC9C,GAAS,MAALjM,EACF,IAAK,IAAI/B,EAAI,EAAGsG,EAAM4X,EAAI1Z,OAAQxE,EAAIsG,EAAKtG,IACzCihB,EAAQvX,KAAKwU,EAAIle,GAAGwO,cAEjB,GAAS,MAAL1M,EACT,IAAK,IAAI7B,EAAI,EAAGsG,EAAO2X,EAAI1Z,OAAQvE,EAAIsG,EAAMtG,IAC3CghB,EAAQvX,KAAKwU,EAAIje,GAAGwO,gBAEjB,GAAS,MAALhO,EACT,IAAK,IAAIL,EAAI,EAAG41C,EAAO93B,EAAI1Z,OAAQpE,EAAI41C,EAAM51C,IAC3C6gB,EAAQvX,KAAKwU,EAAI9d,GAAGsB,aAEjB,GAAS,MAALsM,EACT,IAAK,IAAIxH,EAAI,EAAGyvC,EAAO/3B,EAAI1Z,OAAQgC,EAAIyvC,EAAMzvC,IAC3Cya,EAAQvX,KAAK,IAAI9B,IAAUsW,EAAI1X,GAAGwM,MAAM/R,QAI5C,OAAOggB,I,oBAOT,SAAO3Q,GACL,QAAKA,GAGEnI,KAAK+tC,eAAiB5lC,EAAM4lC,e,2BAYrC,SAAeC,GACb,IAAIH,EACAI,EACAh2C,EACAi2C,EACA36B,EACAjV,EACAC,EACA4vC,EACAC,EACAC,EACAC,EACAC,EACAnoC,EACAlJ,EAKJ,IAAK,IAAInE,KAJTw1C,EAAQ,IACFP,EAAU1lC,SAAU,EAC1B4lC,EAAU,GACV5vC,EAAM0B,KAAKwuC,kBAAkBD,EAAOvuC,KAAKoJ,WAAWP,UAAU,oDAAoD,GAEhH,GAAKvK,EAAI5E,eAAeX,GAAxB,CAIA,IAAK,IAAIlB,EAAI,EAAGsG,GAHhBI,EAAOyB,KAAKkG,wBAAmB,EAC7BlG,KAAKoJ,WAAWP,UAAU,mDAC1B7I,KAAKkoC,OAAOnvC,KACasD,OAAQxE,EAAIsG,EAAKtG,IAE1Cq2C,GADA9nC,EAAK7H,EAAK1G,IACCwO,QAAQiC,QAAUlC,EAK/B,IAAK,IAAItO,EAAI,EAAGsG,GAHhB+vC,EAAOnuC,KAAK2/B,UAAK,EACf3/B,KAAKoJ,WAAWP,UAAU,+CAC1B7I,KAAKkoC,OAAOnvC,KACcsD,OAAQvE,EAAIsG,EAAMtG,IAG5C,IAFAyb,EAAO46B,EAAKr2C,GAEPG,EAAI,EAAG41C,GADZO,EAAOpuC,KAAKkG,wBAAmB,EAAQqN,IACflX,OAAQpE,EAAI41C,EAAM51C,IAExCi2C,GADA9nC,EAAKgoC,EAAKn2C,IACCoO,QAAQiC,QAAUlC,EAMjC,IAAK,IAAI/H,EAAI,EAAGyvC,GAHhBO,EAAOruC,KAAK2/B,UAAK,EACf3/B,KAAKoJ,WAAWP,UAAU,8CAC1B7I,KAAKkoC,OAAOnvC,KACcsD,OAAQgC,EAAIyvC,EAAMzvC,IAG5C,IAFAkV,EAAO86B,EAAKhwC,GAEPnB,EAAI,EAAG+wC,GADZK,EAAOtuC,KAAKkG,wBAAmB,EAAQqN,IACflX,OAAQa,EAAI+wC,EAAM/wC,IAExCgxC,GADA9nC,EAAKkoC,EAAKpxC,IACC3D,OAAO+O,QAAUlC,EAKlC,OAAO8nC,I,4BAYT,SAAe7nC,GACb,OAAOrG,KAAKyuC,QAAQzuC,KAAK0uC,cAAcroC,M,8BAUzC,SAAiBA,GACf,IAAIuJ,EAAQ,GAEZ,OADAA,EAAMvJ,EAAQiC,SAAU,EACjBtI,KAAKwuC,kBACV5+B,EACA5P,KAAKoJ,WAAWP,UAAU,oDAC1B,K,gCAYJ,SAAmBxC,GACjB,IAAIuJ,EAAQ,GAEZ,OADAA,EAAMvJ,EAAQiC,SAAU,EACjBtI,KAAKwuC,kBAAkB5+B,EAC5B5P,KAAKoJ,WAAWP,UAAU,oDAAoD,K,yBAYlF,SAAaxC,GACX,IAGI/H,EACAC,EACA4vC,EACAC,EACAhoC,EACAwJ,EAEJA,EAAQ,GAER,IAAK,IAAI/X,EAAI,EAAGsG,GADhBG,EAAM0B,KAAKkG,mBAAmBG,OAAS,OAAQ,IACrBhK,OAAQxE,EAAIsG,EAAKtG,IAEzC,GALQ,qDAIRuO,EAAK9H,EAAIzG,IACFyO,UAAU1J,IACfgT,EAAMxJ,EAAG7M,OAAO+O,QAAUlC,OAM1B,IAAK,IAAItO,EAAI,EAAGsG,GAJhBG,EAAOyB,KAAK2/B,KACVv5B,EAAGE,UACHtG,KAAKoJ,WAAWP,UAAU,iDAEAxM,OAAQvE,EAAIsG,EAAMtG,IAE5C8X,EADQrR,EAAKzG,GACDwQ,QAAUlC,EAK5B,IAAK,IAAInO,EAAI,EAAG41C,GADhBM,EAAOnuC,KAAKkG,wBAAmB,OAAQ,EAAQG,IACnBhK,OAAQpE,EAAI41C,EAAM51C,IAAK,CACjDmO,EAAK+nC,EAAKl2C,GAKV,IAAK,IAAIoG,EAAI,EAAGyvC,GAJhBM,EAAOpuC,KAAK2/B,KACVv5B,EAAGE,UACHtG,KAAKoJ,WAAWP,UAAU,gDAEAxM,OAAQgC,EAAIyvC,EAAMzvC,IAE5CuR,EADSw+B,EAAK/vC,GACDiK,QAAUlC,EAG3B,OAAOpG,KAAKwuC,kBACV5+B,EACA5P,KAAKoJ,WAAWP,UAAU,oDAC1B,K,0BAcJ,SAAaxC,GACX,OAAOrG,KAAKyuC,QAAQzuC,KAAK2uC,YAAYtoC,M,iCASvC,SACEA,EACAoS,EACAm2B,GAEAA,EAAuBA,GAAwB,GA6B/C,IA5BA,IAAIC,EAAO,CAACxoC,GACR2N,EAAiC,GACjC86B,EAAsC,GACtCnuC,EAAsB,GACtB9E,EAAOmE,KACP+uC,EAAS,SAAUxzC,GACrB,IAAIstB,EAAQ,SAAUttB,GACD,cAAfA,EAAEuD,UAA6BkV,EAAKzY,EAAEzC,SACxCkb,EAAKzY,EAAEzC,QAAS,EAChB+1C,EAAKttC,KAAKhG,KAGVwa,EAAMla,EAAKqK,mBAAmB,KAAM,KAAM3K,EAAGkd,GAC9ClS,OAAO1K,EAAKqK,mBAAmB3K,EAAG,KAAM,KAAMkd,KACjD1C,EAAMA,EAAIrD,QAAO,SAAUtM,GACzB,GAAIwoC,EAAsBxoC,EAAGE,UAAUxN,OAAQ,OAAO,EACtD,IAAIse,EAAQhR,EAAiBkC,OAC7B,OAAIwmC,EAAS13B,KACb03B,EAAS13B,IAAQ,GACV,OAGL1U,SAAQ,SAAU0D,GACpByiB,EAAMziB,EAAGC,SACTwiB,EAAMziB,EAAG7M,WAEXoH,EAASA,EAAO4F,OAAOwP,IAElB84B,EAAKxyC,QACV0yC,EAAOF,EAAKxzB,SAGd,OAAO1a,I,qBAQT,SAAQquC,GACN,OAAO,IAAIr0B,I,oBASb,SAAQ5a,GACN,IAAIskB,EAAInmB,EAAGoO,EACX,OAAQvM,EAAI,IACV,IAAK,IACH,OAAOC,KAAKoY,IAAIrY,EAAIjD,MAAM,GAAI,IAChC,IAAK,IAIH,GAHAwP,OAAO,EACP+X,OAAK,GACLnmB,EAAI6B,EAAIlC,YAAY,MACZkC,EAAI1D,OAAS,EACnB,GAAmB,MAAf0D,EAAI7B,EAAI,GACVoO,EAAOvM,EAAIjD,MAAMoB,EAAI,OAChB,IAAgC,OAA5B6B,EAAIjD,MAAMoB,EAAI,EAAGA,EAAI,GAG9B,MAAM,IAAI2B,MAAM,iCAAmCE,GAFnDskB,EAAKrkB,KAAKkoC,OAAOnoC,EAAIjD,MAAMoB,EAAI,IASnC,OADA6B,GADAA,GADAA,GADAA,EAAMA,EAAIjD,MAAM,EAAGoB,IACTH,QAAQ,OAAQ,MAChBA,QAAQ,OAAQ,OAChBA,QAAQ,QAAS,MACpBiC,KAAKoJ,WAAWgC,QAAQrL,EAAKuM,GAAQ+X,GAC9C,IAAK,IACH,OAAOrkB,KAAKoJ,WAAWS,UAAU9J,EAAIjD,MAAM,IAC7C,IAAK,IACH,OAAO,IAAIkO,IAASjL,EAAIjD,MAAM,IAElC,MAAM,IAAI+C,MAAM,0BAA4BE,K,mBAI9C,SAAOnG,EAAgBD,EAAIrB,EAAIuN,GAC7B,IAAIhO,EACJ,GAAyB,IAArBgf,UAAUxa,OAAc,CAC1B,IAAKzC,EACH,OAAO,EAET,GAAIA,aAAa+U,MAAO,CACtB,IAAK9W,EAAI,EAAGA,EAAI+B,EAAEyC,OAAQxE,IACxB,IAAKmI,KAAKmX,MAAMvd,EAAE/B,IAChB,OAAO,EAGX,OAAO,EACF,GAAI6G,YAAY9E,GACrB,OAAOoG,KAAKmX,MAAMvd,EAAEyM,QAASzM,EAAE0M,UAAW1M,EAAEL,OAAQK,EAAEiR,OACjD,GAAIjR,EAAE0P,WACX,OAAOtJ,KAAKmX,MAAMvd,EAAE0P,YAIxB,IAAIlD,EAAKpG,KAAK0tC,qBAAqB9zC,EAAGD,EAAGrB,EAAGuN,GAC5C,OAAa,MAANO,I,4BAMT,SAAgBkb,GACd,OAAOthB,KAAKmX,MACVmK,EAAUjb,QACVib,EAAUhb,UACVgb,EAAU/nB,OACV+nB,EAAUzW,S,kBAUd,SAAM4H,EAAQwW,GACZ,GAAIA,EAAQ7f,WAAWgB,SAAnB,YAA4C,CAC9C,IAAMkR,EAAa2N,EAAQ7f,WAAWkS,aAItC,OAHA7I,EAAO/P,SAAQ,SAAUoP,GACvBwJ,EAAW4iB,OAAOpsB,MAEbwJ,EAEP,IAAM/Y,EAAO0mB,EAAQ7f,WAAWS,YAC1BP,EAAaH,YAAkB8f,EAAQ7f,WAAY7G,EAAMkQ,GAE/D,OADAwW,EAAQgmB,OAAO3lC,GACR/G,I,qBAUX,SAASxJ,GACP,IAAImF,EAAG2Q,EACH4wB,EAAO,GACX,IAAKvhC,KAAKnF,EACHA,EAAEW,eAAewE,KACtB2Q,EAAI9V,EAAEmF,GACO,MAATA,EAAE,KACJuhC,EAAKvhC,EAAEpB,MAAM,GAAI,IAAM+R,IAG3B,OAAO4wB,I,uBAST,SAAWniC,EAAM6J,EAAa+nC,GAC5B,IAAIC,EACAp5B,EACAotB,EASJ,QARAA,EAAKC,YAAWpjC,OACbwjC,kBAAkBxjC,KAAK9G,IAC1BiqC,EAAGM,QAAQnmC,GAETyY,EADEm5B,EACIlvC,KAAKkG,wBAAmB,OAAQ,OAAQ,EAAQgpC,GAEhDlvC,KAAKsJ,WAGE,MAAfnC,EAAsBA,EAAc,WAClC,IAAK,sBACHgoC,EAAiBhM,EAAGQ,gBAAgB5tB,GACpC,MACF,IAAK,UACL,IAAK,cACHo5B,EAAiBhM,EAAGS,eAAe7tB,GACnC,MACF,QACE,MAAM,IAAIlW,MAAM,2BAA6BsH,EAC3C,mBAEN,OAAOgoC,I,wBAOT,SAAqCjnC,GACnC,IAAIgN,EAAiBlV,KAAKsJ,WAAWnD,KAAI,SAAUgP,GACjD,OAAQA,EAAiBC,WAAWlN,MAEtCxL,QAAQrB,IAAI,yBAA2B6Z,GACvC,IAAMtP,EAAI,IAAI+U,EAGd,OAFA/U,EAAEqpC,OAAO/5B,GACTxY,QAAQrB,IAAI,6BAA+BuK,GACpCA,I,iBAGT,SAAKhJ,EAAaxE,GAChB,GAAIA,EACF,MAAM,IAAIyH,MAAM,gFAElB,OAAOG,KAAKoJ,WAAWP,UAAUjM,K,iBAUnC,SACEhD,EACAD,EACArB,EACAuN,GAEA,IAAItK,EAAIyE,KAAKyT,IAAI7Z,EAAGD,EAAGrB,EAAGuN,GAK1B,OAJS,MAALtK,GACFF,IAAIK,MAAM,6BAA+B9B,EAAI,IAAMD,EAAI,IAAMrB,EAAI,MAG5DiD,I,+BAWT,SACEgzC,EACAjoC,EACAqvB,GAIA,IAAS99B,EAAGsG,EAAKvE,EAAGw1C,EAAMr2C,EACtBs2C,EAAS,GACb92C,OAAOyY,OAAOq+B,EAAQd,GAEtB,IADA,IAAIv6B,EAAO,KACE,CAOX,GAAS,OANTjb,EAAK,WACH,IAAK,IAAIY,KAAK01C,EACZ,GAAKA,EAAO31C,eAAeC,GAC3B,OAAOA,EAHN,IAOH,OAAOqa,EAKT,IAAKnc,EAAI,EAAGsG,GAHZixC,EAAOzZ,EACL31B,KAAK2/B,UAAK,EAAQr5B,EAAWtG,KAAKkoC,OAAOnvC,IACvCiH,KAAK2/B,KAAK3/B,KAAKkoC,OAAOnvC,GAAsBuN,IACzBjK,OAAQxE,EAAIsG,EAAKtG,KAEtC+B,EADMw1C,EAAKv3C,GACHyQ,UACC0L,GAGLpa,KAAKy1C,IAGTA,EAAOz1C,GAAKy1C,EAAOt2C,IAErBib,EAAKjb,GAAKs2C,EAAOt2C,UACVs2C,EAAOt2C,M,yBAUlB,SAAY6W,GAKV,IAAI/X,EAEAqG,EACAC,EACA7E,EACAgF,EACAgxC,EACAzgC,EAEJ,IAAK3Q,KADLoxC,EAAO,GACG1/B,EACR,GAAKA,EAAMlW,eAAewE,GAA1B,CAOA,IANA2Q,EAAIe,EAAM1R,GACV5E,EAAI,EAKCzB,EAAI,EAAGsG,GAJZG,EAAM0B,KAAK2/B,KACT3/B,KAAKoJ,WAAWP,UAAU3K,GAC1B8B,KAAKoJ,WAAWP,UAAU,qDAENxM,OAAQxE,EAAIsG,EAAKtG,IAErC,GAAc,kDADVyG,EAAIzG,GACF+E,IAAyD,CAC7DtD,IACA,MAGCA,IACHg2C,EAAKpxC,GAAK2Q,GASd,OANIygC,EAAK,yDACAA,EAAK,iDAEVA,EAAK,+CACAA,EAAK,uCAEPA,I,sBAMT,WACE,MAAO,IAAMtvC,KAAKsJ,WAAWlM,KAAK,MAAQ,M,sBAO5C,SAAgBhF,GACd,OAAO,IAAI4S,IAAS5S,K,qBAUtB,SACEwB,EACAD,EACArB,EACAuN,GAEA,OAAO7F,KAAKkG,mBAAmBtM,EAAGD,EAAGrB,EAAGuN,GAAG,GAAOxJ,W,GAj2BjB6D,M,kqBCrCrC,IAAMqvC,EAAyC,EAAH,KACvCplC,KADuC,IAG1CC,UAAQ,WACLC,IAAQC,aAAc,GADjB,MAELD,IAAQE,kBAAmB,GAFtB,MAGLF,IAAQG,cAAe,GAHlB,MAILH,IAAQI,UAAW,GAJd,MAKLJ,IAAQb,IAAK,GALR,MAMLa,IAAQK,cAAe,GANlB,MAOLL,IAAQM,cAAe,GAPlB,GAcR2Q,WAjB0C,SAiB9B5P,GACV,OAAO,IAAIuP,IAAWvP,IAGxBlC,GArB0C,SAqBtCsB,GAA6C,WAC/C,OAAIlM,YAAakM,GACf,YAAYA,EAAKY,SAASvF,KAAI,SAACuB,GAC7B,OAAO,EAAK8B,GAAG9B,MAAMtK,KAAK,MAD5B,MAIE4B,YAAW8L,GACNE,IAASnD,SAASiD,GAGpBX,IAAqBX,GAAGsB,IAGjCI,SAlC0C,SAkChCJ,GACR,OAAIA,EAAKhM,WAAazE,IACb4gB,IAAW3S,KAAKwC,GAGlBX,IAAqBe,SAASJ,MAI1BykC,O,cC5Df,IAAInV,EAAyB,oBAATv+B,KAAuBA,KAAOmE,KAC9CwvC,EAAW,WACf,SAASC,IACTzvC,KAAKm6B,OAAQ,EACbn6B,KAAK0vC,aAAetV,EAAOsV,aAG3B,OADAD,EAAEh2C,UAAY2gC,EACP,IAAIqV,EANI,IAQf,SAAU5zC,IAEQ,SAAU1E,GAE1B,IAAIw4C,EACY,oBAAqB9zC,EADjC8zC,EAEQ,WAAY9zC,GAAQ,aAAcjD,OAF1C+2C,EAIA,eAAgB9zC,GAChB,SAAUA,GACV,WACE,IAEE,OADA,IAAI+zC,MACG,EACP,MAAOloC,GACP,OAAO,GALX,GANAioC,EAcQ,aAAc9zC,EAdtB8zC,EAeW,gBAAiB9zC,EAOhC,GAAI8zC,EACF,IAAIE,EAAc,CAChB,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,yBAGEC,EACFC,YAAYC,QACZ,SAASn2C,GACP,OAAOA,GAAOg2C,EAAYhzC,QAAQtE,OAAOkB,UAAUoO,SAAS7P,KAAK6B,KAAS,GAIhF,SAASo2C,EAAc73C,GAIrB,GAHoB,iBAATA,IACTA,EAAO4W,OAAO5W,IAEZ,4BAA4B0L,KAAK1L,GACnC,MAAM,IAAI6D,UAAU,0CAEtB,OAAO7D,EAAKsL,cAGd,SAASwsC,EAAep3C,GAItB,MAHqB,iBAAVA,IACTA,EAAQkW,OAAOlW,IAEVA,EAIT,SAASq3C,EAAYC,GACnB,IAAI7hC,EAAW,CACbsO,KAAM,WACJ,IAAI/jB,EAAQs3C,EAAM/0B,QAClB,MAAO,CAACrH,UAAgBxN,IAAV1N,EAAqBA,MAAOA,KAU9C,OANI62C,IACFphC,EAAS3V,OAAO2V,UAAY,WAC1B,OAAOA,IAIJA,EAGT,SAAS6tB,EAAQxrB,GACf5Q,KAAKmG,IAAM,GAEPyK,aAAmBwrB,EACrBxrB,EAAQlO,SAAQ,SAAS5J,EAAOV,GAC9B4H,KAAKk+B,OAAO9lC,EAAMU,KACjBkH,MACM2O,MAAMD,QAAQkC,GACvBA,EAAQlO,SAAQ,SAASyO,GACvBnR,KAAKk+B,OAAO/sB,EAAO,GAAIA,EAAO,MAC7BnR,MACM4Q,GACTrY,OAAO83C,oBAAoBz/B,GAASlO,SAAQ,SAAStK,GACnD4H,KAAKk+B,OAAO9lC,EAAMwY,EAAQxY,MACzB4H,MAgEP,SAASswC,EAASvpC,GAChB,GAAIA,EAAKm2B,SACP,OAAOzD,QAAQC,OAAO,IAAIz9B,UAAU,iBAEtC8K,EAAKm2B,UAAW,EAGlB,SAASqT,EAAgBC,GACvB,OAAO,IAAI/W,SAAQ,SAAS1G,EAAS2G,GACnC8W,EAAOC,OAAS,WACd1d,EAAQyd,EAAO7vC,SAEjB6vC,EAAOE,QAAU,WACfhX,EAAO8W,EAAO90C,WAKpB,SAASi1C,EAAsBC,GAC7B,IAAIJ,EAAS,IAAIK,WACbC,EAAUP,EAAgBC,GAE9B,OADAA,EAAOO,kBAAkBH,GAClBE,EAoBT,SAASE,EAAYnwB,GACnB,GAAIA,EAAI/jB,MACN,OAAO+jB,EAAI/jB,MAAM,GAEjB,IAAIm0C,EAAO,IAAIC,WAAWrwB,EAAIswB,YAE9B,OADAF,EAAK1gC,IAAI,IAAI2gC,WAAWrwB,IACjBowB,EAAKG,OAIhB,SAASC,IA0FP,OAzFArxC,KAAKk9B,UAAW,EAEhBl9B,KAAKsxC,UAAY,SAASvqC,GAhM5B,IAAoBlN,EAiMhBmG,KAAKuxC,UAAYxqC,EACZA,EAEsB,iBAATA,EAChB/G,KAAKwxC,UAAYzqC,EACR4oC,GAAgBC,KAAKn2C,UAAUg4C,cAAc1qC,GACtD/G,KAAK0xC,UAAY3qC,EACR4oC,GAAoBgC,SAASl4C,UAAUg4C,cAAc1qC,GAC9D/G,KAAK4xC,cAAgB7qC,EACZ4oC,GAAwBkC,gBAAgBp4C,UAAUg4C,cAAc1qC,GACzE/G,KAAKwxC,UAAYzqC,EAAKc,WACb8nC,GAAuBA,KA5MlB91C,EA4M6CkN,IA3MjD+qC,SAASr4C,UAAUg4C,cAAc53C,KA4M3CmG,KAAK+xC,iBAAmBf,EAAYjqC,EAAKqqC,QAEzCpxC,KAAKuxC,UAAY,IAAI3B,KAAK,CAAC5vC,KAAK+xC,oBACvBpC,IAAwBI,YAAYt2C,UAAUg4C,cAAc1qC,IAAS+oC,EAAkB/oC,IAChG/G,KAAK+xC,iBAAmBf,EAAYjqC,GAEpC/G,KAAKwxC,UAAYzqC,EAAOxO,OAAOkB,UAAUoO,SAAS7P,KAAK+O,GAhBvD/G,KAAKwxC,UAAY,GAmBdxxC,KAAK4Q,QAAQlY,IAAI,kBACA,iBAATqO,EACT/G,KAAK4Q,QAAQL,IAAI,eAAgB,4BACxBvQ,KAAK0xC,WAAa1xC,KAAK0xC,UAAU5jC,KAC1C9N,KAAK4Q,QAAQL,IAAI,eAAgBvQ,KAAK0xC,UAAU5jC,MACvC6hC,GAAwBkC,gBAAgBp4C,UAAUg4C,cAAc1qC,IACzE/G,KAAK4Q,QAAQL,IAAI,eAAgB,qDAKnCo/B,IACF3vC,KAAK4wC,KAAO,WACV,IAAIoB,EAAW1B,EAAStwC,MACxB,GAAIgyC,EACF,OAAOA,EAGT,GAAIhyC,KAAK0xC,UACP,OAAOjY,QAAQ1G,QAAQ/yB,KAAK0xC,WACvB,GAAI1xC,KAAK+xC,iBACd,OAAOtY,QAAQ1G,QAAQ,IAAI6c,KAAK,CAAC5vC,KAAK+xC,oBACjC,GAAI/xC,KAAK4xC,cACd,MAAM,IAAI/xC,MAAM,wCAEhB,OAAO45B,QAAQ1G,QAAQ,IAAI6c,KAAK,CAAC5vC,KAAKwxC,cAI1CxxC,KAAKiyC,YAAc,WACjB,OAAIjyC,KAAK+xC,iBACAzB,EAAStwC,OAASy5B,QAAQ1G,QAAQ/yB,KAAK+xC,kBAEvC/xC,KAAK4wC,OAAO9U,KAAK6U,KAK9B3wC,KAAKs/B,KAAO,WACV,IA3FoBsR,EAClBJ,EACAM,EAyFEkB,EAAW1B,EAAStwC,MACxB,GAAIgyC,EACF,OAAOA,EAGT,GAAIhyC,KAAK0xC,UACP,OAjGkBd,EAiGI5wC,KAAK0xC,UAhG3BlB,EAAS,IAAIK,WACbC,EAAUP,EAAgBC,GAC9BA,EAAO0B,WAAWtB,GACXE,EA8FE,GAAI9wC,KAAK+xC,iBACd,OAAOtY,QAAQ1G,QA5FrB,SAA+BlS,GAI7B,IAHA,IAAIowB,EAAO,IAAIC,WAAWrwB,GACtBsxB,EAAQ,IAAIxjC,MAAMsiC,EAAK50C,QAElBxE,EAAI,EAAGA,EAAIo5C,EAAK50C,OAAQxE,IAC/Bs6C,EAAMt6C,GAAKmX,OAAOmO,aAAa8zB,EAAKp5C,IAEtC,OAAOs6C,EAAM/0C,KAAK,IAqFSg1C,CAAsBpyC,KAAK+xC,mBAC7C,GAAI/xC,KAAK4xC,cACd,MAAM,IAAI/xC,MAAM,wCAEhB,OAAO45B,QAAQ1G,QAAQ/yB,KAAKwxC,YAI5B7B,IACF3vC,KAAKqyC,SAAW,WACd,OAAOryC,KAAKs/B,OAAOxD,KAAKzd,KAI5Bre,KAAKsyC,KAAO,WACV,OAAOtyC,KAAKs/B,OAAOxD,KAAKvG,KAAK5Z,QAGxB3b,KA1MTo8B,EAAQ3iC,UAAUykC,OAAS,SAAS9lC,EAAMU,GACxCV,EAAO63C,EAAc73C,GACrBU,EAAQo3C,EAAep3C,GACvB,IAAIy5C,EAAWvyC,KAAKmG,IAAI/N,GACxB4H,KAAKmG,IAAI/N,GAAQm6C,EAAWA,EAAW,KAAOz5C,EAAQA,GAGxDsjC,EAAQ3iC,UAAkB,OAAI,SAASrB,UAC9B4H,KAAKmG,IAAI8pC,EAAc73C,KAGhCgkC,EAAQ3iC,UAAUf,IAAM,SAASN,GAE/B,OADAA,EAAO63C,EAAc73C,GACd4H,KAAKk0B,IAAI97B,GAAQ4H,KAAKmG,IAAI/N,GAAQ,MAG3CgkC,EAAQ3iC,UAAUy6B,IAAM,SAAS97B,GAC/B,OAAO4H,KAAKmG,IAAIzM,eAAeu2C,EAAc73C,KAG/CgkC,EAAQ3iC,UAAU8W,IAAM,SAASnY,EAAMU,GACrCkH,KAAKmG,IAAI8pC,EAAc73C,IAAS83C,EAAep3C,IAGjDsjC,EAAQ3iC,UAAUiJ,QAAU,SAASX,EAAUywC,GAC7C,IAAK,IAAIp6C,KAAQ4H,KAAKmG,IAChBnG,KAAKmG,IAAIzM,eAAetB,IAC1B2J,EAAS/J,KAAKw6C,EAASxyC,KAAKmG,IAAI/N,GAAOA,EAAM4H,OAKnDo8B,EAAQ3iC,UAAU0V,KAAO,WACvB,IAAIihC,EAAQ,GAIZ,OAHApwC,KAAK0C,SAAQ,SAAS5J,EAAOV,GAC3Bg4C,EAAM7uC,KAAKnJ,MAEN+3C,EAAYC,IAGrBhU,EAAQ3iC,UAAUgZ,OAAS,WACzB,IAAI29B,EAAQ,GAIZ,OAHApwC,KAAK0C,SAAQ,SAAS5J,GACpBs3C,EAAM7uC,KAAKzI,MAENq3C,EAAYC,IAGrBhU,EAAQ3iC,UAAU2X,QAAU,WAC1B,IAAIg/B,EAAQ,GAIZ,OAHApwC,KAAK0C,SAAQ,SAAS5J,EAAOV,GAC3Bg4C,EAAM7uC,KAAK,CAACnJ,EAAMU,OAEbq3C,EAAYC,IAGjBT,IACFvT,EAAQ3iC,UAAUb,OAAO2V,UAAY6tB,EAAQ3iC,UAAU2X,SAqJzD,IAAIqhC,EAAU,CAAC,SAAU,MAAO,OAAQ,UAAW,OAAQ,OAO3D,SAASC,EAAQ9/B,EAAOpQ,GAEtB,IAPuB05B,EACnByW,EAMA5rC,GADJvE,EAAUA,GAAW,IACFuE,KAEnB,GAAI6L,aAAiB8/B,EAAS,CAC5B,GAAI9/B,EAAMsqB,SACR,MAAM,IAAIjhC,UAAU,gBAEtB+D,KAAKi0B,IAAMrhB,EAAMqhB,IACjBj0B,KAAK2gC,YAAc/tB,EAAM+tB,YACpBn+B,EAAQoO,UACX5Q,KAAK4Q,QAAU,IAAIwrB,EAAQxpB,EAAMhC,UAEnC5Q,KAAKk8B,OAAStpB,EAAMspB,OACpBl8B,KAAKhH,KAAO4Z,EAAM5Z,KAClBgH,KAAK4yC,OAAShgC,EAAMggC,OACf7rC,GAA2B,MAAnB6L,EAAM2+B,YACjBxqC,EAAO6L,EAAM2+B,UACb3+B,EAAMsqB,UAAW,QAGnBl9B,KAAKi0B,IAAMjlB,OAAO4D,GAYpB,GATA5S,KAAK2gC,YAAcn+B,EAAQm+B,aAAe3gC,KAAK2gC,aAAe,eAC1Dn+B,EAAQoO,SAAY5Q,KAAK4Q,UAC3B5Q,KAAK4Q,QAAU,IAAIwrB,EAAQ55B,EAAQoO,UAErC5Q,KAAKk8B,QAjCkBA,EAiCO15B,EAAQ05B,QAAUl8B,KAAKk8B,QAAU,MAhC3DyW,EAAUzW,EAAOC,cACdsW,EAAQ51C,QAAQ81C,IAAY,EAAIA,EAAUzW,GAgCjDl8B,KAAKhH,KAAOwJ,EAAQxJ,MAAQgH,KAAKhH,MAAQ,KACzCgH,KAAK4yC,OAASpwC,EAAQowC,QAAU5yC,KAAK4yC,OACrC5yC,KAAK6yC,SAAW,MAEK,QAAhB7yC,KAAKk8B,QAAoC,SAAhBl8B,KAAKk8B,SAAsBn1B,EACvD,MAAM,IAAI9K,UAAU,6CAEtB+D,KAAKsxC,UAAUvqC,GAOjB,SAASsX,EAAOtX,GACd,IAAI+rC,EAAO,IAAInB,SAYf,OAXA5qC,EACGjG,OACAb,MAAM,KACNyC,SAAQ,SAASqwC,GAChB,GAAIA,EAAO,CACT,IAAI9yC,EAAQ8yC,EAAM9yC,MAAM,KACpB7H,EAAO6H,EAAMob,QAAQtd,QAAQ,MAAO,KACpCjF,EAAQmH,EAAM7C,KAAK,KAAKW,QAAQ,MAAO,KAC3C+0C,EAAK5U,OAAO8U,mBAAmB56C,GAAO46C,mBAAmBl6C,QAGxDg6C,EAqBT,SAASG,EAASC,EAAU1wC,GACrBA,IACHA,EAAU,IAGZxC,KAAK8N,KAAO,UACZ9N,KAAK+8B,YAA4Bv2B,IAAnBhE,EAAQu6B,OAAuB,IAAMv6B,EAAQu6B,OAC3D/8B,KAAKowB,GAAKpwB,KAAK+8B,QAAU,KAAO/8B,KAAK+8B,OAAS,IAC9C/8B,KAAKg9B,WAAa,eAAgBx6B,EAAUA,EAAQw6B,WAAa,KACjEh9B,KAAK4Q,QAAU,IAAIwrB,EAAQ55B,EAAQoO,SACnC5Q,KAAKi0B,IAAMzxB,EAAQyxB,KAAO,GAC1Bj0B,KAAKsxC,UAAU4B,GAjDjBR,EAAQj5C,UAAU2W,MAAQ,WACxB,OAAO,IAAIsiC,EAAQ1yC,KAAM,CAAC+G,KAAM/G,KAAKuxC,aAmCvCF,EAAKr5C,KAAK06C,EAAQj5C,WAgBlB43C,EAAKr5C,KAAKi7C,EAASx5C,WAEnBw5C,EAASx5C,UAAU2W,MAAQ,WACzB,OAAO,IAAI6iC,EAASjzC,KAAKuxC,UAAW,CAClCxU,OAAQ/8B,KAAK+8B,OACbC,WAAYh9B,KAAKg9B,WACjBpsB,QAAS,IAAIwrB,EAAQp8B,KAAK4Q,SAC1BqjB,IAAKj0B,KAAKi0B,OAIdgf,EAASv3C,MAAQ,WACf,IAAI+7B,EAAW,IAAIwb,EAAS,KAAM,CAAClW,OAAQ,EAAGC,WAAY,KAE1D,OADAvF,EAAS3pB,KAAO,QACT2pB,GAGT,IAAI0b,EAAmB,CAAC,IAAK,IAAK,IAAK,IAAK,KAE5CF,EAASG,SAAW,SAASnf,EAAK8I,GAChC,IAA0C,IAAtCoW,EAAiBt2C,QAAQkgC,GAC3B,MAAM,IAAIhsB,WAAW,uBAGvB,OAAO,IAAIkiC,EAAS,KAAM,CAAClW,OAAQA,EAAQnsB,QAAS,CAACgwB,SAAU3M,MAGjE98B,EAAQu4C,aAAe7zC,EAAK6zC,aAC5B,IACE,IAAIv4C,EAAQu4C,aACZ,MAAO1X,GACP7gC,EAAQu4C,aAAe,SAAS90B,EAASxiB,GACvC4H,KAAK4a,QAAUA,EACf5a,KAAK5H,KAAOA,EACZ,IAAIsD,EAAQmE,MAAM+a,GAClB5a,KAAK2H,MAAQjM,EAAMiM,OAErBxQ,EAAQu4C,aAAaj2C,UAAYlB,OAAOY,OAAO0G,MAAMpG,WACrDtC,EAAQu4C,aAAaj2C,UAAUgP,YAActR,EAAQu4C,aAGvD,SAASvV,EAAMvnB,EAAOyU,GACpB,OAAO,IAAIoS,SAAQ,SAAS1G,EAAS2G,GACnC,IAAIkG,EAAU,IAAI8S,EAAQ9/B,EAAOyU,GAEjC,GAAIuY,EAAQgT,QAAUhT,EAAQgT,OAAOS,QACnC,OAAO3Z,EAAO,IAAIviC,EAAQu4C,aAAa,UAAW,eAGpD,IAAIrf,EAAM,IAAIijB,eAEd,SAASC,IACPljB,EAAImjB,QAGNnjB,EAAIogB,OAAS,WACX,IAxFgBgD,EAChB7iC,EAuFIpO,EAAU,CACZu6B,OAAQ1M,EAAI0M,OACZC,WAAY3M,EAAI2M,WAChBpsB,SA3Fc6iC,EA2FQpjB,EAAIqjB,yBAA2B,GA1FvD9iC,EAAU,IAAIwrB,EAGQqX,EAAW11C,QAAQ,eAAgB,KACzCkC,MAAM,SAASyC,SAAQ,SAASqF,GAClD,IAAIuS,EAAQvS,EAAK9H,MAAM,KACnB7G,EAAMkhB,EAAMe,QAAQva,OACxB,GAAI1H,EAAK,CACP,IAAIN,EAAQwhB,EAAMld,KAAK,KAAK0D,OAC5B8P,EAAQstB,OAAO9kC,EAAKN,OAGjB8X,IAgFHpO,EAAQyxB,IAAM,gBAAiB5D,EAAMA,EAAIsjB,YAAcnxC,EAAQoO,QAAQlY,IAAI,iBAC3E,IAAIqO,EAAO,aAAcspB,EAAMA,EAAIoH,SAAWpH,EAAIsH,aAClD5E,EAAQ,IAAIkgB,EAASlsC,EAAMvE,KAG7B6tB,EAAIqgB,QAAU,WACZhX,EAAO,IAAIz9B,UAAU,4BAGvBo0B,EAAIujB,UAAY,WACdla,EAAO,IAAIz9B,UAAU,4BAGvBo0B,EAAIwjB,QAAU,WACZna,EAAO,IAAIviC,EAAQu4C,aAAa,UAAW,gBAG7Crf,EAAIyjB,KAAKlU,EAAQ1D,OAAQ0D,EAAQ3L,KAAK,GAEV,YAAxB2L,EAAQe,YACVtQ,EAAI4S,iBAAkB,EACW,SAAxBrD,EAAQe,cACjBtQ,EAAI4S,iBAAkB,GAGpB,iBAAkB5S,GAAOsf,IAC3Btf,EAAI0jB,aAAe,QAGrBnU,EAAQhvB,QAAQlO,SAAQ,SAAS5J,EAAOV,GACtCi4B,EAAI2jB,iBAAiB57C,EAAMU,MAGzB8mC,EAAQgT,SACVhT,EAAQgT,OAAOqB,iBAAiB,QAASV,GAEzCljB,EAAI6jB,mBAAqB,WAEA,IAAnB7jB,EAAI8jB,YACNvU,EAAQgT,OAAOwB,oBAAoB,QAASb,KAKlDljB,EAAIgkB,UAAkC,IAAtBzU,EAAQ2R,UAA4B,KAAO3R,EAAQ2R,cAIvEpX,EAAMma,UAAW,EAEZz4C,EAAKs+B,QACRt+B,EAAKs+B,MAAQA,EACbt+B,EAAKugC,QAAUA,EACfvgC,EAAK62C,QAAUA,EACf72C,EAAKo3C,SAAWA,GAGlB97C,EAAQilC,QAAUA,EAClBjlC,EAAQu7C,QAAUA,EAClBv7C,EAAQ87C,SAAWA,EACnB97C,EAAQgjC,MAAQA,EAEhB5hC,OAAOC,eAAerB,EAAS,aAAc,CAAE2B,OAAO,IA5gBvC,CAghBf,IAlhBF,CAmhBG02C,GACHA,EAASrV,MAAMoa,UAAW,SAEnB/E,EAASrV,MAAMma,SAGtB,IAAInhB,EAAMqc,GACVr4C,EAAUg8B,EAAIgH,OACNqa,QAAUrhB,EAAIgH,MACtBhjC,EAAQgjC,MAAQhH,EAAIgH,MACpBhjC,EAAQilC,QAAUjJ,EAAIiJ,QACtBjlC,EAAQu7C,QAAUvf,EAAIuf,QACtBv7C,EAAQ87C,SAAW9f,EAAI8f,SACvB77C,EAAOD,QAAUA,G,6BCpiBjB,MAAM,UAACg7B,GAAa,EAAQ,IACtBxiB,EAAa,EAAQ,IACrBC,EAAQ,EAAQ,IAChBuhB,EAAO,EAAQ,IACfrhB,EAAc,EAAQ,IAEtBrB,EAAM,GACZrX,EAAOD,QAAUsX,EAWjBA,EAAIgmC,oBAAsB,CAAC7hC,EAAOpQ,KAIhC,MAAMsQ,GAHNtQ,EAAUA,GAAW,IAGEsQ,QAAU,IAAIqe,EAAKthB,iBAAiB,OACrD6kC,EAAS,CAAC,WAAY,IAI5B,OAHAjmC,EAAIkmC,cAAc/hC,EAAO8hC,EAAQ,WAAY5hC,GAGtCrE,EAAImmC,cAAcF,IAc3BjmC,EAAIkmC,cAAgB,CAAC/hC,EAAO8hC,EAAQ7pC,EAAOiI,EAAQ1a,EAAM0hB,KAEvD,GAAGlK,EAAMlB,QAAQkE,GAAQ,CACvB,IAAI,MAAMrQ,KAAQqQ,EAChBnE,EAAIkmC,cAAcpyC,EAAMmyC,EAAQ7pC,EAAOiI,OAAQtM,EAAWsT,GAE5D,OAIF,IAAIlK,EAAMV,SAAS0D,GAIjB,YAHGkH,GACDA,EAAKvY,KAAKqR,IAMd,GAAGjD,EAAWuD,QAAQN,GAAQ,CAC5B,GAAG,UAAWA,EAAO,CACnB,IAAI9E,EAAO8E,EAAM,SAES,IAAvB9E,EAAKjR,QAAQ,QACd+V,EAAM,SAAW9E,EAAOgF,EAAO1F,MAAMU,IAMzC,YAHGgM,GACDA,EAAKvY,KAAKqR,IAGP,GAAGkH,GAAQnK,EAAWoC,OAAOa,GAAQ,CAC1C,MAAMiiC,EAAQ,GAGd,OAFApmC,EAAIkmC,cAAc/hC,EAAM,SAAU8hC,EAAQ7pC,EAAOiI,EAAQ1a,EAAMy8C,QAC/D/6B,EAAKvY,KAAK,CAAC,QAASszC,IAOtB,GAAG,UAAWjiC,EAAO,CACnB,MAAMhD,EAAQgD,EAAM,SACpB,IAAI,MAAM9E,KAAQ8B,EACU,IAAvB9B,EAAKjR,QAAQ,OACdiW,EAAO1F,MAAMU,GAMhB8B,EAAMH,YAAYrX,KACnBA,EAAOuX,EAAWvQ,YAAYwT,GAC5BE,EAAO1F,MAAMwF,EAAM,QAAUA,EAAM,QAIpCkH,GACDA,EAAKvY,KAAK,CAAC,MAAOnJ,IAIpB,MAAMmuB,EAAWmuB,EAAO7pC,GAClBxE,EAAUkgB,EAASnuB,GAAQmuB,EAASnuB,IAAS,GACnDiO,EAAQ,OAASjO,EACjB,MAAM08C,EAAav8C,OAAO4W,KAAKyD,GAAOxO,OACtC,IAAI,IAAI5K,KAAYs7C,EAAY,CAE9B,GAAgB,QAAbt7C,EACD,SAIF,GAAgB,aAAbA,EAAyB,CAC1B,MAAMu7C,EAAiB,CAAC,MAAO38C,GACzB48C,EAAapiC,EAAM,YACzB,IAAI,MAAMqiC,KAAmBD,EAAY,CACvC,MAAM5E,EAAQ4E,EAAWC,GACzB,IAAI,MAAMjrC,KAAQomC,EAAO,CACvB,IAAI8E,EAAWlrC,EAAK,OACjB2F,EAAWvQ,YAAY4K,KACxBkrC,EAAWpiC,EAAO1F,MAAM8nC,IAE1BzmC,EAAIkmC,cAAc3qC,EAAM0qC,EAAQ7pC,EAAOiI,EAAQoiC,GAC/C/jB,EAAKlf,SACHsU,EAAS2uB,GAAWD,EAAiBF,EACrC,CAAC7iC,iBAAiB,EAAME,gBAAgB,KAG9C,SAIF,GAAgB,WAAb5Y,EAAuB,CAEnBpB,KAAQs8C,IACXA,EAAOt8C,GAAQ,IAEjBqW,EAAIkmC,cAAc/hC,EAAMpZ,GAAWk7C,EAAQt8C,EAAM0a,GACjD,SAIF,GAAgB,cAAbtZ,EAA0B,CAC3BiV,EAAIkmC,cAAc/hC,EAAMpZ,GAAWk7C,EAAQ7pC,EAAOiI,GAClD,SAIF,GAAgB,UAAbtZ,GAAwB24B,EAAU34B,GAAW,CAC9C,GAAgB,WAAbA,GAAyBA,KAAY6M,IACrCuM,EAAMpZ,KAAc6M,EAAQ7M,IAC7BoZ,EAAMpZ,GAAU,SAAW6M,EAAQ7M,GAAU,QAC7C,MAAM,IAAIsW,EACR,gEACA,qBACA,CAAC6B,KAAM,sBAAuBtL,YAElCA,EAAQ7M,GAAYoZ,EAAMpZ,GAC1B,SAIF,MAAM4wC,EAAUx3B,EAAMpZ,GAQtB,GAL8B,IAA3BA,EAASqD,QAAQ,QAClBrD,EAAWsZ,EAAO1F,MAAM5T,IAIJ,IAAnB4wC,EAAQ/tC,OAIX,IAAI,IAAI/D,KAAK8xC,EAOX,GANgB,UAAb5wC,IAEDlB,EAAyB,IAApBA,EAAEuE,QAAQ,MAAeiW,EAAO1F,MAAM9U,GAAKA,GAI/CqX,EAAWtQ,UAAU/G,IAAMqX,EAAWoL,mBAAmBziB,GAAI,CAE9D,GAAG,QAASA,IAAMA,EAAE,OAClB,SAIF,MAAMkR,EAAKmG,EAAWvQ,YAAY9G,GAChCwa,EAAO1F,MAAM9U,EAAE,QAAUA,EAAE,OAG7B64B,EAAKlf,SACH5L,EAAS7M,EAAU,CAAC,MAAOgQ,GAC3B,CAAC0I,iBAAiB,EAAME,gBAAgB,IAC1C3D,EAAIkmC,cAAcr8C,EAAGo8C,EAAQ7pC,EAAOiI,EAAQtJ,QACvC,GAAGmG,EAAWuD,QAAQ5a,GAC3B64B,EAAKlf,SACH5L,EAAS7M,EAAUlB,EACnB,CAAC4Z,iBAAiB,EAAME,gBAAgB,SACrC,GAAGzC,EAAWoC,OAAOzZ,GAAI,CAE9B,MAAMu8C,EAAQ,GACdpmC,EAAIkmC,cAAcr8C,EAAE,SAAUo8C,EAAQ7pC,EAAOiI,EAAQ1a,EAAMy8C,GAC3Dv8C,EAAI,CAAC,QAASu8C,GACd1jB,EAAKlf,SACH5L,EAAS7M,EAAUlB,EACnB,CAAC4Z,iBAAiB,EAAME,gBAAgB,SAG1C3D,EAAIkmC,cAAcr8C,EAAGo8C,EAAQ7pC,EAAOiI,EAAQ1a,GAC5C+4B,EAAKlf,SACH5L,EAAS7M,EAAUlB,EAAG,CAAC4Z,iBAAiB,EAAME,gBAAgB,SAzClE+e,EAAKlf,SAAS5L,EAAS7M,EAAU,GAAI,CAAC0Y,iBAAiB,MAuD7DzD,EAAI0mC,mBAAqBT,IACvB,MAAMU,EAAS,GACf,IAAI,MAAMh9C,KAAQG,OAAO4W,KAAKulC,GAAQtwC,OACpC,IAAI,MAAMoF,KAAMjR,OAAO4W,KAAKulC,EAAOt8C,IAAOgM,OAAQ,CAChD,MAAM7B,EAAOmyC,EAAOt8C,GAAMoR,GACrBA,KAAM4rC,IACTA,EAAO5rC,GAAM,CAAC,MAAOA,IAEvB,MAAM6rC,EAAaD,EAAO5rC,GAE1B,IAAI,MAAMhQ,KAAYjB,OAAO4W,KAAK5M,GAAM6B,OACtC,GAAG+tB,EAAU34B,IAA0B,UAAbA,EAExB67C,EAAW77C,GAAY23B,EAAK/gB,MAAM7N,EAAK/I,SAGvC,IAAI,MAAMV,KAASyJ,EAAK/I,GACtB23B,EAAKlf,SACHojC,EAAY77C,EAAU23B,EAAK/gB,MAAMtX,GACjC,CAACoZ,iBAAiB,EAAME,gBAAgB,IAOpD,OAAOgjC,GAGT3mC,EAAImmC,cAAgBF,IAElB,MAAMzqC,EAAeyqC,EAAO,YACtBY,EAAa/8C,OAAO4W,KAAKulC,GAAQtwC,OACvC,IAAI,MAAMmxC,KAAaD,EAAY,CACjC,GAAiB,aAAdC,EACD,SAEF,MAAMC,EAAUd,EAAOa,GACvB,IAAIlvC,EAAU4D,EAAasrC,GACvBlvC,EAKQ,WAAYA,IACtBA,EAAQ,UAAY,IALpB4D,EAAasrC,GAAalvC,EAAU,CAClC,MAAOkvC,EACP,SAAU,IAKd,MAAM1qC,EAAQxE,EAAQ,UACtB,IAAI,MAAMmD,KAAMjR,OAAO4W,KAAKqmC,GAASpxC,OAAQ,CAC3C,MAAM7B,EAAOizC,EAAQhsC,GAEjBmG,EAAWoL,mBAAmBxY,IAChCsI,EAAMtJ,KAAKgB,IAIjB,OAAO0H,I,6BChST,sDAUe,SAAS8iC,EAAoBhtC,EAAKumB,EAAIhpB,GACnD,IAAIzF,EAAG4f,EAAGvZ,EACN4hB,EAAW,CAAE,SAAU,SAAU,SACjC21B,EAAO/sC,YAAU,mCACjB/O,EAAImgC,YAASxT,EAAIA,EAAIhpB,EAAMA,EAAM,KAAM,KAAM,GAAI,MACjDo4C,EAAU,GAEVC,EAAY,SAAU/4C,EAAKgL,EAAO7H,EAAKlI,EAAGyP,GAC5C,MAAQ,SAAWM,EAAQ,GAAK,QAAUhL,EAAM,sBAChD0K,EAAM,aAAevH,EAAIjD,MAAMjF,EAAIA,EAAI,IAAO,KAShDA,EAAI,EACJ,IAAIqe,EAAQoQ,EAAGlO,IAAI9a,EAAO,UAG1B,IAFAo4C,EAAO,MAAYx/B,IAEN,CAGX,IADAuB,EAAI9d,EAAEunB,UAAUnhB,EAAKlI,IACb,EACN,OAAO69C,EAGT,GAAe,MAAX31C,EAAI0X,GAAY,CAElB,IADA5f,EAAI8B,EAAEunB,UAAUnhB,EAAK0X,EAAI,IACjB,EACN,OAAOi+B,EAETj+B,EAAI5f,EAEN,IAAI+9C,GAAQ,EACZ,IAAK13C,EAAI,EAAGA,EAAI4hB,EAASzjB,OAAQ6B,IAAK,CACpC,IAAI9E,EAAM0mB,EAAS5hB,GACnB,GAAI6B,EAAIjD,MAAM2a,EAAGA,EAAIre,EAAIiD,UAAYjD,EAAK,CAExC,IADAvB,EAAI8B,EAAEunB,UAAUnhB,EAAK0X,EAAIre,EAAIiD,SACrB,EACN,MAAMs5C,EAAUh8C,EAAE8lB,SAAU9lB,EAAEiO,MAAO7H,EAAK0X,EAAIre,EAAIiD,OAAQ,iCAAmCjD,GAE/F,IAAc,WAARA,GAA8B,WAARA,IAA8C,SAAxB2G,EAAIjD,MAAMjF,EAAGA,EAAI,GAAe,CAEhF,IADA4f,EAAI9d,EAAEunB,UAAUnhB,EAAKlI,EAAI,IACjB,EACN,MAAM89C,EAAUh8C,EAAE8lB,SAAU9lB,EAAEiO,MAAO7H,EAAKlI,EAAI,EAAG,kCAAoCuB,GAEvFvB,EAAI4f,EAEN,IAAI8M,EAAO,GAGX,IAFA9M,EAAI9d,EAAE4I,KAAKxC,EAAKlI,EAAG0sB,IAEX,EACN,MAAMoxB,EAAUh8C,EAAE8lB,SAAU9lB,EAAEiO,MAAO7H,EAAKlI,EACxC,oCAAsCuB,GAE1Cs8C,EAAQt8C,EAAIsK,eAAiB6gB,EAAK,GAClC+B,EAAG7V,IAAIyF,EAAOu/B,EAAKr8C,EAAIsK,eAAgB6gB,EAAK,IAE5CqxB,GAAQ,EACR/9C,EAAI4f,GAGR,IAAKm+B,GAAiC,YAAxB71C,EAAIjD,MAAM2a,EAAGA,EAAI,GAAkB,CAE/C,IADA5f,EAAI8B,EAAE0nB,UAAUthB,EAAK0X,IACb,EACN,MAAMk+B,EAAUh8C,EAAE8lB,SAAU9lB,EAAEiO,MAAO7H,EAAKlI,EACxC,oCAGJA,EAAI8B,EAAE4nB,SAASxhB,EAAKlI,GAEpB+9C,GAAQ,EAEV,IAAKA,EAEH,MAAMD,EAAUh8C,EAAE8lB,SAAU9lB,EAAEiO,MAAO7H,EAAK0X,EACxC,0CAA4C1X,EAAIjD,MAAM2a,GAAG3a,MAAM,EAAG,IAAM,Q,6BCxChF,SAAS+4C,EAAeC,GACpB,OAAO,YAAah0C,GAChB,IAAIC,EAAWD,EAAK2C,MACpB,OAAOqxC,EAAG99C,KAAKgI,KAAM8B,EAAMC,I,uGAMnC,IAAIg0C,EAA8C,mBAAnBC,gBAAiCA,eAC5DC,EAA0C,mBAAjBC,cAA+BA,aACxDC,EAAiC,iBAAZ/oB,SAAoD,mBAArBA,QAAQgpB,SAEhE,SAASC,EAASP,GACd7kB,WAAW6kB,EAAI,GAGnB,SAASQ,EAAKC,GACV,MAAO,CAACT,KAAOh0C,IAASy0C,EAAM,IAAMT,KAAMh0C,IAe9C,IAAI00C,EAAiBF,EAVjBP,EACSC,eACFC,EACEC,aACFC,EACE/oB,QAAQgpB,SAERC,GA6Db,SAASI,EAASn1C,GACd,OAAIo1C,EAAQp1C,GACD,YAAaQ,GAChB,MAAMC,EAAWD,EAAK2C,MAEtB,OAAOkyC,EADSr1C,EAAKY,MAAMlC,KAAM8B,GACHC,IAI/B8zC,GAAc,SAAU/zC,EAAMC,GACjC,IAAIpB,EACJ,IACIA,EAASW,EAAKY,MAAMlC,KAAM8B,GAC5B,MAAO4F,GACL,OAAO3F,EAAS2F,GAGpB,GAAI/G,GAAiC,mBAAhBA,EAAOm7B,KACxB,OAAO6a,EAAch2C,EAAQoB,GAE7BA,EAAS,KAAMpB,MAK3B,SAASg2C,EAAc7F,EAAS/uC,GAC5B,OAAO+uC,EAAQhV,KAAKhjC,IAChB89C,EAAe70C,EAAU,KAAMjJ,IAChCk/B,IACC4e,EAAe70C,EAAUi2B,GAAOA,EAAIpd,QAAUod,EAAM,IAAIn4B,MAAMm4B,MAItE,SAAS4e,EAAe70C,EAAUrG,EAAO5C,GACrC,IACIiJ,EAASrG,EAAO5C,GAClB,MAAOk/B,GACLwe,EAAe9uC,IAAO,MAAMA,GAAKswB,IAIzC,SAAS0e,EAAQZ,GACb,MAAkC,kBAA3BA,EAAGl9C,OAAOC,aAWrB,SAASg+C,EAAUC,GACf,GAAuB,mBAAZA,EAAwB,MAAM,IAAIj3C,MAAM,uBACnD,OAAO62C,EAAQI,GAAWL,EAASK,GAAWA,EAKlD,SAASC,EAAUD,EAASE,EAAQF,EAAQz6C,QACxC,IAAK26C,EAAO,MAAM,IAAIn3C,MAAM,sBAe5B,OAdA,YAAuBiC,GACnB,MAA+B,mBAApBA,EAAKk1C,EAAQ,GACbF,EAAQ50C,MAAMlC,KAAM8B,GAGxB,IAAI23B,QAAQ,CAAC1G,EAAS2G,KACzB53B,EAAKk1C,EAAQ,GAAK,CAAChf,KAAQif,KACvB,GAAIjf,EAAK,OAAO0B,EAAO1B,GACvBjF,EAAQkkB,EAAO56C,OAAS,EAAI46C,EAASA,EAAO,KAEhDH,EAAQ50C,MAAMlC,KAAM8B,MAOhC,SAASo1C,EAAWC,GAChB,OAAO,SAAmBC,KAAQC,GAO9B,OANWN,GAAS,SAAUh1C,GAC1B,IAAIu1C,EAAOt3C,KACX,OAAOm3C,EAAOC,EAAK,CAACtB,EAAIzgC,KACpBwhC,EAAUf,GAAI5zC,MAAMo1C,EAAMD,EAAS9wC,OAAO8O,KAC3CtT,OAMf,SAASw1C,EAAUJ,EAAQptC,EAAKytC,EAAUz1C,GACtCgI,EAAMA,GAAO,GACb,IAAI+O,EAAU,GACV2+B,EAAU,EACVC,EAAYb,EAAUW,GAE1B,OAAOL,EAAOptC,EAAK,CAACjR,EAAO6+C,EAAGC,KAC1B,IAAIhjC,EAAQ6iC,IACZC,EAAU5+C,EAAO,CAACk/B,EAAKnpB,KACnBiK,EAAQlE,GAAS/F,EACjB+oC,EAAO5f,MAEZA,IACCj2B,EAASi2B,EAAKlf,KAItB,SAAS++B,EAAY/+C,GACjB,OAAOA,GACqB,iBAAjBA,EAAMuD,QACbvD,EAAMuD,QAAU,GAChBvD,EAAMuD,OAAS,GAAM,EAK7B,MAAMy7C,EAAY,GAElB,SAASC,EAAKjC,GACV,SAASkC,KAAYl2C,GACjB,GAAW,OAAPg0C,EAAJ,CACA,IAAImC,EAASnC,EACbA,EAAK,KACLmC,EAAO/1C,MAAMlC,KAAM8B,IAGvB,OADAvJ,OAAOyY,OAAOgnC,EAASlC,GAChBkC,EAuCX,SAASE,EAAeC,GACpB,GAAIN,EAAYM,GACZ,OAlCR,SAA6BA,GACzB,IAAItgD,GAAK,EACLsG,EAAMg6C,EAAK97C,OACf,OAAO,WACH,QAASxE,EAAIsG,EAAM,CAACrF,MAAOq/C,EAAKtgD,GAAIuB,IAAKvB,GAAK,MA8BvCugD,CAAoBD,GAG/B,IAlB0Bt+C,EACtBw+C,EACAxgD,EACAsG,EAeAoQ,EAzCR,SAAsB4pC,GAClB,OAAOA,EAAKv/C,OAAO2V,WAAa4pC,EAAKv/C,OAAO2V,YAwC7B+pC,CAAYH,GAC3B,OAAO5pC,EA9BX,SAA8BA,GAC1B,IAAI1W,GAAK,EACT,OAAO,WACH,IAAImS,EAAOuE,EAASsO,OACpB,OAAI7S,EAAKgK,KACE,MACXnc,IACO,CAACiB,MAAOkR,EAAKlR,MAAOM,IAAKvB,KAuBlB0gD,CAAqBhqC,IAlBnC8pC,GADsBx+C,EAmB8Cs+C,GAlBtD5/C,OAAO4W,KAAKtV,GAAO,GACjChC,GAAK,EACLsG,EAAMk6C,EAAMh8C,OACT,SAASwgB,IACZ,IAAIzjB,EAAMi/C,IAAQxgD,GAClB,MAAY,cAARuB,EACOyjB,IAEJhlB,EAAIsG,EAAM,CAACrF,MAAOe,EAAIT,GAAMA,OAAO,OAalD,SAASo/C,EAAS1C,GACd,OAAO,YAAah0C,GAChB,GAAW,OAAPg0C,EAAa,MAAM,IAAIj2C,MAAM,gCACjC,IAAIo4C,EAASnC,EACbA,EAAK,KACLmC,EAAO/1C,MAAMlC,KAAM8B,IAK3B,SAAS22C,EAAiBC,EAAW1/B,EAAOw+B,EAAUz1C,GAClD,IAAIiS,GAAO,EACP2kC,GAAW,EACXC,GAAW,EACXC,EAAU,EACVniB,EAAM,EAEV,SAASoiB,IAEDD,GAAW7/B,GAAS4/B,GAAY5kC,IAEpC4kC,GAAW,EACXF,EAAU77B,OAAOif,KAAK,EAAEhjC,QAAOkb,KAAM+kC,MAEjC,IAAIJ,IAAY3kC,EAAhB,CAEA,GADA4kC,GAAW,EACPG,EAMA,OALA/kC,GAAO,OACH6kC,GAAW,GAEX92C,EAAS,OAIjB82C,IACArB,EAAS1+C,EAAO49B,EAAKsiB,GACrBtiB,IACAoiB,OACD9Z,MAAM1B,IAGb,SAAS0b,EAAiBhhB,EAAKr3B,GAG3B,GADAk4C,GAAW,GACPF,EACJ,OAAI3gB,EAAYsF,EAAYtF,IAEhB,IAARA,GACAhkB,GAAO,OACP2kC,GAAW,IAIXh4C,IAAWm3C,GAAc9jC,GAAQ6kC,GAAW,GAC5C7kC,GAAO,EAEAjS,EAAS,YAEpB+2C,IAGJ,SAASxb,EAAYtF,GACb2gB,IACJC,GAAW,EACX5kC,GAAO,EACPjS,EAASi2B,IAGb8gB,IAGJ,IAAIG,EAAejgC,GACR,CAACnf,EAAK29C,EAAUz1C,KAEnB,GADAA,EAAWg2C,EAAKh2C,GACZiX,GAAS,EACT,MAAM,IAAIjI,WAAW,2CAEzB,IAAKlX,EACD,OAAOkI,EAAS,MAEpB,GAjN8B,mBAiNTlI,EAjNfjB,OAAOC,aAkNT,OAAO4/C,EAAiB5+C,EAAKmf,EAAOw+B,EAAUz1C,GAElD,GAjNR,SAAyBlI,GACrB,MAA4C,mBAA9BA,EAAIjB,OAAOsgD,eAgNjBC,CAAgBt/C,GAChB,OAAO4+C,EAAiB5+C,EAAIjB,OAAOsgD,iBAAkBlgC,EAAOw+B,EAAUz1C,GAE1E,IAAIq3C,EAAWlB,EAAer+C,GAC1Bma,GAAO,EACP2kC,GAAW,EACXE,EAAU,EACVQ,GAAU,EAEd,SAASL,EAAiBhhB,EAAKl/B,GAC3B,IAAI6/C,EAEJ,GADAE,GAAW,EACP7gB,EACAhkB,GAAO,EACPjS,EAASi2B,QAER,IAAY,IAARA,EACLhkB,GAAO,EACP2kC,GAAW,MAEV,IAAI7/C,IAAUg/C,GAAc9jC,GAAQ6kC,GAAW,EAEhD,OADA7kC,GAAO,EACAjS,EAAS,MAEVs3C,GACNP,KAIR,SAASA,IAEL,IADAO,GAAU,EACHR,EAAU7/B,IAAUhF,GAAM,CAC7B,IAAIslC,EAAOF,IACX,GAAa,OAATE,EAKA,OAJAtlC,GAAO,OACH6kC,GAAW,GACX92C,EAAS,OAIjB82C,GAAW,EACXrB,EAAS8B,EAAKxgD,MAAOwgD,EAAKlgD,IAAKo/C,EAASQ,IAE5CK,GAAU,EAGdP,KA6BR,IAAIS,EAAgBxC,GAJpB,SAAuBoB,EAAMn/B,EAAOw+B,EAAUz1C,GAC1C,OAAOk3C,EAAYjgC,EAAZigC,CAAmBd,EAAMtB,EAAUW,GAAWz1C,KAGb,GAG5C,SAASy3C,EAAgBrB,EAAMX,EAAUz1C,GACrCA,EAAWg2C,EAAKh2C,GAChB,IAAI6S,EAAQ,EACR6kC,EAAY,GACZ,OAACp9C,GAAU87C,EACXQ,GAAW,EAKf,SAASe,EAAiB1hB,EAAKl/B,IACf,IAARk/B,IACA2gB,GAAW,IAEE,IAAbA,IACA3gB,EACAj2B,EAASi2B,KACCyhB,IAAcp9C,GAAWvD,IAAUg/C,GAC7C/1C,EAAS,OAIjB,IAhBe,IAAX1F,GACA0F,EAAS,MAeN6S,EAAQvY,EAAQuY,IACnB4iC,EAASW,EAAKvjC,GAAQA,EAAO4jC,EAASkB,IAK9C,SAASC,EAAexB,EAAMX,EAAUz1C,GACpC,OAAOw3C,EAAcpB,EAAMyB,IAAUpC,EAAUz1C,GAqHnD,IAAI83C,EAAW9C,GALf,SAAgBoB,EAAMX,EAAUz1C,GAE5B,OAD2B81C,EAAYM,GAAQqB,EAAkBG,GACrCxB,EAAMtB,EAAUW,GAAWz1C,KAG3B,GA0HhC,IAAI+3C,EAAQ/C,GAHZ,SAAcoB,EAAMX,EAAUz1C,GAC1B,OAAOw1C,EAAUsC,EAAU1B,EAAMX,EAAUz1C,KAErB,GAyCtBg4C,EAAc7C,EAAU4C,GAuB5B,IAAIE,EAAiBjD,GAHrB,SAAsBoB,EAAMX,EAAUz1C,GAClC,OAAOw3C,EAAcpB,EAAM,EAAGX,EAAUz1C,KAEA,GAwB5C,IAAIk4C,EAAclD,GAHlB,SAAoBoB,EAAMX,EAAUz1C,GAChC,OAAOw1C,EAAUyC,EAAgB7B,EAAMX,EAAUz1C,KAEf,GAqBlCm4C,EAAkBhD,EAAU+C,GAEhC,MAAME,EAAiBvhD,OAAO,mBAE9B,SAASwhD,IACL,IAAIrnB,EAAS2G,EACb,SAAS33B,EAAUi2B,KAAQl2B,GACvB,GAAIk2B,EAAK,OAAO0B,EAAO1B,GACvBjF,EAAQjxB,EAAKzF,OAAS,EAAIyF,EAAOA,EAAK,IAQ1C,OALAC,EAASo4C,GAAkB,IAAI1gB,QAAQ,CAAChf,EAAK4/B,KACzCtnB,EAAUtY,EACVif,EAAS2gB,IAGNt4C,EAoJX,SAASu4C,EAAKC,EAAOC,EAAaz4C,GACH,iBAAhBy4C,IAEPz4C,EAAWy4C,EACXA,EAAc,MAElBz4C,EAAWg2C,EAAKh2C,GAAYq4C,KAC5B,IAAIK,EAAWliD,OAAO4W,KAAKorC,GAAOl+C,OAClC,IAAKo+C,EACD,OAAO14C,EAAS,MAEfy4C,IACDA,EAAcC,GAGlB,IAAI3hC,EAAU,GACV4hC,EAAe,EACf/B,GAAW,EACXgC,GAAW,EAEXC,EAAYriD,OAAOY,OAAO,MAE1B0hD,EAAa,GAGbC,EAAe,GAEfC,EAAwB,GAuC5B,SAASC,EAAY5hD,EAAK6hD,GACtBJ,EAAWt5C,KAAK,IA+BpB,SAAiBnI,EAAK6hD,GAClB,GAAIN,EAAU,OAEd,IAAIO,EAAe1C,EAAS,CAACxgB,KAAQr3B,KAEjC,GADA+5C,KACY,IAAR1iB,EAOJ,GAHIr3B,EAAOtE,OAAS,KACfsE,GAAUA,GAEXq3B,EAAK,CACL,IAAImjB,EAAc,GAOlB,GANA5iD,OAAO4W,KAAK2J,GAASpW,QAAQ04C,IACzBD,EAAYC,GAAQtiC,EAAQsiC,KAEhCD,EAAY/hD,GAAOuH,EACnBg6C,GAAW,EACXC,EAAYriD,OAAOY,OAAO,MACtBw/C,EAAU,OACd52C,EAASi2B,EAAKmjB,QAEdriC,EAAQ1f,GAAOuH,GA7BHi6C,EA8BCxhD,IA9BsB,IAC7BsJ,QAAQozC,GAAMA,KAC5BuF,SAUQ1C,GAAW,IAsBnB+B,IACA,IAAIY,EAASzE,EAAUoE,EAAKA,EAAK5+C,OAAS,IACtC4+C,EAAK5+C,OAAS,EACdi/C,EAAOxiC,EAASoiC,GAEhBI,EAAOJ,GAhEWK,CAAQniD,EAAK6hD,IAGvC,SAASI,IACL,IAAI1C,EAAJ,CACA,GAA0B,IAAtBkC,EAAWx+C,QAAiC,IAAjBq+C,EAC3B,OAAO34C,EAAS,KAAM+W,GAE1B,KAAM+hC,EAAWx+C,QAAUq+C,EAAeF,GAAa,CACzCK,EAAWx/B,OACrBmgC,KAiFR,SAASC,EAAcC,GACnB,IAAI/6C,EAAS,GAOb,OANApI,OAAO4W,KAAKorC,GAAO73C,QAAQtJ,IACvB,MAAM6hD,EAAOV,EAAMnhD,GACfuV,MAAMD,QAAQusC,IAASA,EAAKp+C,QAAQ6+C,IAAa,GACjD/6C,EAAOY,KAAKnI,KAGbuH,EAGX,OA5IApI,OAAO4W,KAAKorC,GAAO73C,QAAQtJ,IACvB,IAAI6hD,EAAOV,EAAMnhD,GACjB,IAAKuV,MAAMD,QAAQusC,GAIf,OAFAD,EAAY5hD,EAAK,CAAC6hD,SAClBH,EAAav5C,KAAKnI,GAItB,IAAIuiD,EAAeV,EAAKn+C,MAAM,EAAGm+C,EAAK5+C,OAAS,GAC3Cu/C,EAAwBD,EAAat/C,OACzC,GAA8B,IAA1Bu/C,EAGA,OAFAZ,EAAY5hD,EAAK6hD,QACjBH,EAAav5C,KAAKnI,GAGtB2hD,EAAsB3hD,GAAOwiD,EAE7BD,EAAaj5C,QAAQm5C,IACjB,IAAKtB,EAAMsB,GACP,MAAM,IAAIh8C,MAAM,oBAAsBzG,EAClC,oCACAyiD,EAAiB,QACjBF,EAAav+C,KAAK,QA8BlC,SAAqBs+C,EAAU5F,GAC3B,IAAIgG,EAAgBlB,EAAUc,GACzBI,IACDA,EAAgBlB,EAAUc,GAAY,IAG1CI,EAAcv6C,KAAKu0C,GAlCfiG,CAAYF,EAAgB,KAEM,MAD9BD,GAEIZ,EAAY5hD,EAAK6hD,SA8EjC,WAII,IAAIe,EACAvE,EAAU,EACd,KAAOqD,EAAaz+C,QAChB2/C,EAAclB,EAAar2C,MAC3BgzC,IACAgE,EAAcO,GAAat5C,QAAQu5C,IACY,KAArClB,EAAsBkB,IACxBnB,EAAav5C,KAAK06C,KAK9B,GAAIxE,IAAYgD,EACZ,MAAM,IAAI56C,MACN,iEA1FZq8C,GACAb,IAyGOt5C,EAASo4C,GAGpB,IAAIgC,EAAU,gEACVC,EAAgB,8CAChBC,EAAe,IACfC,EAAS,eACTC,EAAiB,mCAgJrB,MAAMC,EACF,cACIx8C,KAAKy8C,KAAOz8C,KAAK08C,KAAO,KACxB18C,KAAK3D,OAAS,EAGlB,WAAWkG,GAQP,OAPIA,EAAK6+B,KAAM7+B,EAAK6+B,KAAKvkB,KAAOta,EAAKsa,KAChC7c,KAAKy8C,KAAOl6C,EAAKsa,KAClBta,EAAKsa,KAAMta,EAAKsa,KAAKukB,KAAO7+B,EAAK6+B,KAChCphC,KAAK08C,KAAOn6C,EAAK6+B,KAEtB7+B,EAAK6+B,KAAO7+B,EAAKsa,KAAO,KACxB7c,KAAK3D,QAAU,EACRkG,EAGX,QACI,KAAMvC,KAAKy8C,MAAMz8C,KAAKqb,QACtB,OAAOrb,KAGX,YAAYuC,EAAMo6C,GACdA,EAAQvb,KAAO7+B,EACfo6C,EAAQ9/B,KAAOta,EAAKsa,KAChBta,EAAKsa,KAAMta,EAAKsa,KAAKukB,KAAOub,EAC3B38C,KAAK08C,KAAOC,EACjBp6C,EAAKsa,KAAO8/B,EACZ38C,KAAK3D,QAAU,EAGnB,aAAakG,EAAMo6C,GACfA,EAAQvb,KAAO7+B,EAAK6+B,KACpBub,EAAQ9/B,KAAOta,EACXA,EAAK6+B,KAAM7+B,EAAK6+B,KAAKvkB,KAAO8/B,EAC3B38C,KAAKy8C,KAAOE,EACjBp6C,EAAK6+B,KAAOub,EACZ38C,KAAK3D,QAAU,EAGnB,QAAQkG,GACAvC,KAAKy8C,KAAMz8C,KAAK48C,aAAa58C,KAAKy8C,KAAMl6C,GACvCs6C,EAAW78C,KAAMuC,GAG1B,KAAKA,GACGvC,KAAK08C,KAAM18C,KAAK88C,YAAY98C,KAAK08C,KAAMn6C,GACtCs6C,EAAW78C,KAAMuC,GAG1B,QACI,OAAOvC,KAAKy8C,MAAQz8C,KAAK+8C,WAAW/8C,KAAKy8C,MAG7C,MACI,OAAOz8C,KAAK08C,MAAQ18C,KAAK+8C,WAAW/8C,KAAK08C,MAG7C,UACI,MAAO,IAAI18C,MAGf,EAAEpH,OAAO2V,YAEL,IADA,IAAIyuC,EAAMh9C,KAAKy8C,KACRO,SACGA,EAAI3zC,KACV2zC,EAAMA,EAAIngC,KAIlB,OAAQogC,GAEJ,IADA,IAAIC,EAAOl9C,KAAKy8C,KACVS,GAAM,CACR,IAAI,KAACrgC,GAAQqgC,EACTD,EAAOC,IACPl9C,KAAK+8C,WAAWG,GAEpBA,EAAOrgC,EAEX,OAAO7c,MAIf,SAAS68C,EAAWM,EAAK56C,GACrB46C,EAAI9gD,OAAS,EACb8gD,EAAIV,KAAOU,EAAIT,KAAOn6C,EAG1B,SAASsmB,EAAMu0B,EAAQ5C,EAAa6C,GAChC,GAAmB,MAAf7C,EACAA,EAAc,OAEb,GAAmB,IAAhBA,EACJ,MAAM,IAAIzpC,WAAW,gCAGzB,IAAIusC,EAAUzG,EAAUuG,GACpBG,EAAa,EACbC,EAAc,GAClB,MAAMC,EAAS,CACX/hD,MAAO,GACPgiD,MAAO,GACPC,UAAW,GACXC,YAAa,GACbC,MAAO,IAeX,SAASC,EAAKC,EAAOxd,GACjB,OAAKwd,EACAxd,OACLkd,EAAOM,GAASN,EAAOM,GAAOrrC,OAAOsrC,GAAMA,IAAOzd,IAD7Bkd,EAAOM,GAAS,GADlBxlD,OAAO4W,KAAKsuC,GAAQ/6C,QAAQs7C,GAAMP,EAAOO,GAAM,IAKtE,SAASC,EAASF,KAAUj8C,GACxB27C,EAAOM,GAAOr7C,QAAQ69B,GAAWA,KAAWz+B,IAGhD,IAAIo8C,GAAsB,EAC1B,SAASC,EAAQ90C,EAAM+0C,EAAeC,EAAet8C,GACjD,GAAgB,MAAZA,GAAwC,mBAAbA,EAC3B,MAAM,IAAIlC,MAAM,oCAIpB,IAAI4a,EAAK4/B,EACT,SAASD,EAAiBpiB,KAAQl2B,GAG9B,OAAIk2B,EAAYqmB,EAAgBhE,EAAIriB,GAAOvd,IACvC3Y,EAAKzF,QAAU,EAAUoe,EAAI3Y,EAAK,SACtC2Y,EAAI3Y,GARRzD,EAAEigD,SAAU,EAWZ,IAAIt0C,EAAO,CACPX,OACAtH,SAAUs8C,EACNjE,EACCr4C,GAAYq4C,GAiBrB,GAdIgE,EACA//C,EAAEkgD,OAAO38C,QAAQoI,GAEjB3L,EAAEkgD,OAAOh9C,KAAKyI,GAGbk0C,IACDA,GAAsB,EACtB1H,EAAe,KACX0H,GAAsB,EACtB7/C,EAAE+uB,aAINixB,IAAkBt8C,EAClB,OAAO,IAAI03B,QAAQ,CAAC1G,EAAS2G,KACzBjf,EAAMsY,EACNsnB,EAAM3gB,IAKlB,SAAS8kB,EAAUjE,GACf,OAAO,SAAUviB,KAAQl2B,GACrBy7C,GAAc,EAEd,IAAK,IAAI1lD,EAAI,EAAGC,EAAIyiD,EAAMl+C,OAAQxE,EAAIC,EAAGD,IAAK,CAC1C,IAAIojD,EAAOV,EAAM1iD,GAEb+c,EAAQ4oC,EAAY3gD,QAAQo+C,GAClB,IAAVrmC,EACA4oC,EAAYniC,QACLzG,EAAQ,GACf4oC,EAAY97C,OAAOkT,EAAO,GAG9BqmC,EAAKl5C,SAASi2B,KAAQl2B,GAEX,MAAPk2B,GACAimB,EAAQ,QAASjmB,EAAKijB,EAAK5xC,MAI/Bk0C,GAAel/C,EAAEm8C,YAAcn8C,EAAE+yC,QACjC6M,EAAQ,eAGR5/C,EAAEogD,QACFR,EAAQ,SAEZ5/C,EAAE+uB,WAIV,SAASsxB,EAAYr1C,GACjB,QAAoB,IAAhBA,EAAKhN,SAAgBgC,EAAEogD,UAEvBjI,EAAe,IAAMyH,EAAQ,WACtB,GAKf,MAAMU,EAAevmD,GAAUmoC,IAC3B,IAAKA,EACD,OAAO,IAAI9G,QAAQ,CAAC1G,EAAS2G,MA1GrC,SAAeqkB,EAAOxd,GAClB,MAAMqe,EAAkB,IAAI98C,KACxBg8C,EAAIC,EAAOa,GACXre,KAAWz+B,IAEf27C,EAAOM,GAAOx8C,KAAKq9C,GAsGX7G,CAAK3/C,EAAM,CAAC4/B,EAAK3uB,KACb,GAAI2uB,EAAK,OAAO0B,EAAO1B,GACvBjF,EAAQ1pB,OAIpBy0C,EAAI1lD,GArHR,SAAa2lD,EAAOxd,GAChBkd,EAAOM,GAAOx8C,KAAKg/B,GAqHnBse,CAAGzmD,EAAMmoC,IAIb,IAAIue,GAAe,EACfzgD,EAAI,CACJkgD,OAAQ,IAAI/B,EACZ,EAAE5jD,OAAO2V,kBACElQ,EAAEkgD,OAAO3lD,OAAO2V,aAE3BisC,cACA6C,UACAjM,OAAQoJ,EAAc,EACtB8D,SAAS,EACTS,QAAQ,EACR,KAAM11C,EAAMtH,GACR,GAAI4M,MAAMD,QAAQrF,GAAO,CACrB,GAAIq1C,EAAYr1C,GAAO,OACvB,OAAOA,EAAKlD,IAAI64C,GAASb,EAAQa,GAAO,GAAO,EAAOj9C,IAE1D,OAAOo8C,EAAQ90C,GAAM,GAAO,EAAOtH,IAEvC,UAAWsH,EAAMtH,GACb,GAAI4M,MAAMD,QAAQrF,GAAO,CACrB,GAAIq1C,EAAYr1C,GAAO,OACvB,OAAOA,EAAKlD,IAAI64C,GAASb,EAAQa,GAAO,GAAO,EAAMj9C,IAEzD,OAAOo8C,EAAQ90C,GAAM,GAAO,EAAMtH,IAEtC,OACI+7C,IACAz/C,EAAEkgD,OAAOV,SAEb,QAASx0C,EAAMtH,GACX,GAAI4M,MAAMD,QAAQrF,GAAO,CACrB,GAAIq1C,EAAYr1C,GAAO,OACvB,OAAOA,EAAKlD,IAAI64C,GAASb,EAAQa,GAAO,GAAM,EAAOj9C,IAEzD,OAAOo8C,EAAQ90C,GAAM,GAAM,EAAOtH,IAEtC,aAAcsH,EAAMtH,GAChB,GAAI4M,MAAMD,QAAQrF,GAAO,CACrB,GAAIq1C,EAAYr1C,GAAO,OACvB,OAAOA,EAAKlD,IAAI64C,GAASb,EAAQa,GAAO,GAAM,EAAMj9C,IAExD,OAAOo8C,EAAQ90C,GAAM,GAAM,EAAMtH,IAErC,OAAQk7C,GACJ5+C,EAAEkgD,OAAOvoC,OAAOinC,IAEpB,UAGI,IAAI6B,EAAJ,CAIA,IADAA,GAAe,GACRzgD,EAAE0gD,QAAUxB,EAAal/C,EAAEm8C,aAAen8C,EAAEkgD,OAAOliD,QAAO,CAC7D,IAAIk+C,EAAQ,GAAIlxC,EAAO,GACnBvR,EAAIuG,EAAEkgD,OAAOliD,OACbgC,EAAEg/C,UAASvlD,EAAI8U,KAAKqyC,IAAInnD,EAAGuG,EAAEg/C,UACjC,IAAK,IAAIxlD,EAAI,EAAGA,EAAIC,EAAGD,IAAK,CACxB,IAAI0K,EAAOlE,EAAEkgD,OAAOljC,QACpBk/B,EAAMh5C,KAAKgB,GACXi7C,EAAYj8C,KAAKgB,GACjB8G,EAAK9H,KAAKgB,EAAK8G,MAGnBk0C,GAAc,EAEU,IAApBl/C,EAAEkgD,OAAOliD,QACT4hD,EAAQ,SAGRV,IAAel/C,EAAEm8C,aACjByD,EAAQ,aAGZ,IAAI5oC,EAAKmjC,EAASgG,EAAUjE,IAC5B+C,EAAQj0C,EAAMgM,GAElBypC,GAAe,IAEnBziD,OAAO,IACIgC,EAAEkgD,OAAOliD,OAEpBw8C,QAAQ,IACG0E,EAEXC,YAAY,IACDA,EAEXiB,KAAI,IACOpgD,EAAEkgD,OAAOliD,OAASkhD,IAAe,EAE5C,QACIl/C,EAAE0gD,QAAS,GAEf,UACqB,IAAb1gD,EAAE0gD,SACN1gD,EAAE0gD,QAAS,EACXvI,EAAen4C,EAAE+uB,YA0BzB,OAtBA70B,OAAO2mD,iBAAiB7gD,EAAG,CACvBs/C,UAAW,CACP5jD,UAAU,EACVjB,MAAO6lD,EAAY,cAEvBf,YAAa,CACT7jD,UAAU,EACVjB,MAAO6lD,EAAY,gBAEvBd,MAAO,CACH9jD,UAAU,EACVjB,MAAO6lD,EAAY,UAEvBjB,MAAO,CACH3jD,UAAU,EACVjB,MAAO6lD,EAAY,UAEvBjjD,MAAO,CACH3B,UAAU,EACVjB,MAAO6lD,EAAY,YAGpBtgD,EA8OX,IAAI8gD,EAAWpI,GAVf,SAAgBoB,EAAMiH,EAAM5H,EAAUz1C,GAClCA,EAAWg2C,EAAKh2C,GAChB,IAAI21C,EAAYb,EAAUW,GAC1B,OAAOwC,EAAe7B,EAAM,CAAC58C,EAAG1D,EAAG+/C,KAC/BF,EAAU0H,EAAM7jD,EAAG,CAACy8B,EAAKnpB,KACrBuwC,EAAOvwC,EACP+oC,EAAO5f,MAEZA,GAAOj2B,EAASi2B,EAAKonB,MAEI,GAwChC,SAASC,KAAOC,GACZ,IAAIC,EAAaD,EAAUn5C,IAAI0wC,GAC/B,OAAO,YAAa/0C,GAChB,IAAIw1C,EAAOt3C,KAEPqV,EAAKvT,EAAKA,EAAKzF,OAAS,GAc5B,MAbiB,mBAANgZ,EACPvT,EAAK2C,MAEL4Q,EAAK+kC,IAGT+E,EAASI,EAAYz9C,EAAM,CAAC09C,EAAS1J,EAAI8B,KACrC9B,EAAG5zC,MAAMo1C,EAAMkI,EAAQj5C,OAAO,CAACyxB,KAAQynB,KACnC7H,EAAO5f,EAAKynB,OAGpB,CAACznB,EAAKlf,IAAYzD,EAAG2iB,KAAQlf,IAEtBzD,EAAG8kC,IAqElB,IAAIuF,EAAa3I,GAHjB,SAAmBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACtC,OAAOw1C,EAAU0B,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAErB,GAwCpC,IAAI49C,EAAgB5I,GAlBpB,SAAqBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACxC,IAAI21C,EAAYb,EAAUW,GAC1B,OAAOkI,EAAWvH,EAAMn/B,EAAO,CAAClH,EAAK8lC,KACjCF,EAAU5lC,EAAK,CAACkmB,KAAQl2B,IAChBk2B,EAAY4f,EAAO5f,GAChB4f,EAAO5f,EAAKl2B,KAExB,CAACk2B,EAAK4nB,KAEL,IADA,IAAIj/C,EAAS,GACJ9I,EAAI,EAAGA,EAAI+nD,EAAWvjD,OAAQxE,IAC/B+nD,EAAW/nD,KACX8I,EAASA,EAAO4F,UAAUq5C,EAAW/nD,KAI7C,OAAOkK,EAASi2B,EAAKr3B,OAGa,GAmG1C,IAAIk/C,EAAW9I,GAHf,SAAgBoB,EAAMX,EAAUz1C,GAC5B,OAAO49C,EAAcxH,EAAMyB,IAAUpC,EAAUz1C,KAEnB,GAyBhC,IAAI+9C,EAAiB/I,GAHrB,SAAsBoB,EAAMX,EAAUz1C,GAClC,OAAO49C,EAAcxH,EAAM,EAAGX,EAAUz1C,KAEA,GAmD5C,SAASg+C,EAAc1lC,EAAO2lC,GAC1B,MAAO,CAAC7I,EAAQptC,EAAK2tC,EAAWriC,KAC5B,IACI4qC,EADAC,GAAa,EAEjB,MAAM1I,EAAWX,EAAUa,GAC3BP,EAAOptC,EAAK,CAACjR,EAAO6+C,EAAG51C,KACnBy1C,EAAS1+C,EAAO,CAACk/B,EAAKr3B,IACdq3B,IAAe,IAARA,EAAsBj2B,EAASi2B,GAEtC3d,EAAM1Z,KAAYs/C,GAClBC,GAAa,EACbD,EAAaD,GAAU,EAAMlnD,GACtBiJ,EAAS,KAAM+1C,SAE1B/1C,MAELi2B,IACC,GAAIA,EAAK,OAAO3iB,EAAG2iB,GACnB3iB,EAAG,KAAM6qC,EAAaD,EAAaD,GAAU,OA+EzD,IAAIG,EAAWpJ,GAHf,SAAgBoB,EAAMX,EAAUz1C,GAC5B,OAAOg+C,EAAcK,GAAQA,EAAM,CAAC3lC,EAAKzQ,IAASA,EAA3C+1C,CAAiDlG,EAAU1B,EAAMX,EAAUz1C,KAEtD,GA4BhC,IAAIs+C,EAAgBtJ,GAHpB,SAAqBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACxC,OAAOg+C,EAAcK,GAAQA,EAAM,CAAC3lC,EAAKzQ,IAASA,EAA3C+1C,CAAiD9G,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAEtD,GA2B1C,IAAIu+C,GAAiBvJ,GAJrB,SAAsBoB,EAAMX,EAAUz1C,GAClC,OAAOg+C,EAAcK,GAAQA,EAAM,CAAC3lC,EAAKzQ,IAASA,EAA3C+1C,CAAiD9G,EAAY,GAAId,EAAMX,EAAUz1C,KAGhD,GAE5C,SAASw+C,GAAYnoD,GACjB,MAAO,CAAC09C,KAAOh0C,IAAS+0C,EAAUf,EAAVe,IAAiB/0C,EAAM,CAACk2B,KAAQwoB,KAE7B,iBAAZ9jD,UAEHs7B,EAEIt7B,QAAQhB,OACRgB,QAAQhB,MAAMs8B,GAEXt7B,QAAQtE,IACfooD,EAAW99C,QAAQnH,GAAKmB,QAAQtE,GAAMmD,OAmCtD,IAAImoB,GAAM68B,GAAY,OAgDtB,IAAIE,GAAa1J,GAvBjB,SAAkBS,EAAU1zC,EAAM/B,GAC9BA,EAAWy2C,EAASz2C,GACpB,IAEI+W,EAFA4nC,EAAM7J,EAAUW,GAChBmJ,EAAQ9J,EAAU/yC,GAGtB,SAAS+Y,EAAKmb,KAAQl2B,GAClB,GAAIk2B,EAAK,OAAOj2B,EAASi2B,IACb,IAARA,IACJlf,EAAUhX,EACV6+C,KAAS7+C,EAAMuY,IAGnB,SAASA,EAAM2d,EAAK4oB,GAChB,OAAI5oB,EAAYj2B,EAASi2B,IACb,IAARA,EACC4oB,OACLF,EAAI7jC,GADe9a,EAAS,QAAS+W,QADrC,EAKJ,OAAOuB,EAAM,MAAM,KAGa,GA+BpC,SAASwmC,GAAcrJ,GACnB,MAAO,CAAC1+C,EAAO8b,EAAO7S,IAAay1C,EAAS1+C,EAAOiJ,GA0GvD,IAAI49B,GAAOoX,GAJX,SAAmBoB,EAAMX,EAAUz1C,GAC/B,OAAO83C,EAAS1B,EAAM0I,GAAchK,EAAUW,IAAYz1C,KAG/B,GA0B/B,IAAI++C,GAAc/J,GAHlB,SAAqBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACxC,OAAOk3C,EAAYjgC,EAAZigC,CAAmBd,EAAM0I,GAAchK,EAAUW,IAAYz1C,KAEhC,GA4BxC,IAAIg/C,GAAehK,GAHnB,SAAoBoB,EAAMX,EAAUz1C,GAChC,OAAO++C,GAAY3I,EAAM,EAAGX,EAAUz1C,KAEF,GAqCxC,SAASi/C,GAAYlL,GACjB,OAAIY,EAAQZ,GAAYA,EACjB,YAAah0C,GAChB,IAAIC,EAAWD,EAAK2C,MAChB4R,GAAO,EACXvU,EAAKP,KAAK,IAAI0/C,KACN5qC,EACAmgC,EAAe,IAAMz0C,KAAYk/C,IAEjCl/C,KAAYk/C,KAGpBnL,EAAG5zC,MAAMlC,KAAM8B,GACfuU,GAAO,GAqGf,IAAI6qC,GAAUnK,GAHd,SAAeoB,EAAMX,EAAUz1C,GAC3B,OAAOg+C,EAAcK,IAASA,EAAM3lC,IAAQA,EAArCslC,CAA0ClG,EAAU1B,EAAMX,EAAUz1C,KAEjD,GA0B9B,IAAIo/C,GAAepK,GAHnB,SAAoBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACvC,OAAOg+C,EAAcK,IAASA,EAAM3lC,IAAQA,EAArCslC,CAA0C9G,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAEjD,GAyBxC,IAAIq/C,GAAgBrK,GAHpB,SAAqBoB,EAAMX,EAAUz1C,GACjC,OAAOg+C,EAAcK,IAASA,EAAM3lC,IAAQA,EAArCslC,CAA0C/F,EAAgB7B,EAAMX,EAAUz1C,KAE3C,GAE1C,SAASs/C,GAAYlK,EAAQptC,EAAKytC,EAAUz1C,GACxC,IAAIu/C,EAAc,IAAI3yC,MAAM5E,EAAI1N,QAChC86C,EAAOptC,EAAK,CAACxO,EAAGqZ,EAAOgjC,KACnBJ,EAASj8C,EAAG,CAACy8B,EAAKnpB,KACdyyC,EAAY1sC,KAAW/F,EACvB+oC,EAAO5f,MAEZA,IACC,GAAIA,EAAK,OAAOj2B,EAASi2B,GAEzB,IADA,IAAIlf,EAAU,GACLjhB,EAAI,EAAGA,EAAIkS,EAAI1N,OAAQxE,IACxBypD,EAAYzpD,IAAIihB,EAAQvX,KAAKwI,EAAIlS,IAEzCkK,EAAS,KAAM+W,KAIvB,SAASyoC,GAAcpK,EAAQgB,EAAMX,EAAUz1C,GAC3C,IAAI+W,EAAU,GACdq+B,EAAOgB,EAAM,CAAC58C,EAAGqZ,EAAOgjC,KACpBJ,EAASj8C,EAAG,CAACy8B,EAAKnpB,KACd,GAAImpB,EAAK,OAAO4f,EAAO5f,GACnBnpB,GACAiK,EAAQvX,KAAK,CAACqT,QAAO9b,MAAOyC,IAEhCq8C,EAAO5f,MAEZA,IACC,GAAIA,EAAK,OAAOj2B,EAASi2B,GACzBj2B,EAAS,KAAM+W,EACV1U,KAAK,CAACC,EAAGC,IAAMD,EAAEuQ,MAAQtQ,EAAEsQ,OAC3BzO,IAAI0I,GAAKA,EAAE/V,UAIxB,SAAS0oD,GAAQrK,EAAQgB,EAAMX,EAAUz1C,GAErC,OADa81C,EAAYM,GAAQkJ,GAAcE,IACjCpK,EAAQgB,EAAMtB,EAAUW,GAAWz1C,GA0ErD,IAAI0/C,GAAW1K,GAHf,SAAiBoB,EAAMX,EAAUz1C,GAC7B,OAAOy/C,GAAQ3H,EAAU1B,EAAMX,EAAUz1C,KAEb,GAyBhC,IAAI2/C,GAAgB3K,GAHpB,SAAsBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACzC,OAAOy/C,GAAQvI,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAEb,GAuB1C,IAAI4/C,GAAiB5K,GAHrB,SAAuBoB,EAAMX,EAAUz1C,GACnC,OAAOy/C,GAAQxH,EAAgB7B,EAAMX,EAAUz1C,KAEP,GA4C5C,IAAI6/C,GAAY7K,GAXhB,SAAiBjB,EAAI+L,GACjB,IAAI7tC,EAAOwkC,EAASqJ,GAChB5G,EAAOpE,EAAUmK,GAAYlL,IAOjC,OALA,SAASj5B,EAAKmb,GACV,GAAIA,EAAK,OAAOhkB,EAAKgkB,IACT,IAARA,GACJijB,EAAKp+B,GAEFA,KAEuB,GAmDlC,IAAIilC,GAAiB/K,GA7BrB,SAAsBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACzC,IAAI21C,EAAYb,EAAUW,GAC1B,OAAOkI,EAAWvH,EAAMn/B,EAAO,CAAClH,EAAK8lC,KACjCF,EAAU5lC,EAAK,CAACkmB,EAAK5+B,IACb4+B,EAAY4f,EAAO5f,GAChB4f,EAAO5f,EAAK,CAAC5+B,MAAK0Y,UAE9B,CAACkmB,EAAK4nB,KAKL,IAJA,IAAIj/C,EAAS,IAET,eAACjH,GAAkBnB,OAAOkB,UAErB5B,EAAI,EAAGA,EAAI+nD,EAAWvjD,OAAQxE,IACnC,GAAI+nD,EAAW/nD,GAAI,CACf,IAAI,IAACuB,GAAOwmD,EAAW/nD,IACnB,IAACia,GAAO8tC,EAAW/nD,GAEnB6B,EAAe1B,KAAK2I,EAAQvH,GAC5BuH,EAAOvH,GAAKmI,KAAKuQ,GAEjBnR,EAAOvH,GAAO,CAAC0Y,GAK3B,OAAO/P,EAASi2B,EAAKr3B,OAIe,GAmJ5C,IAAItF,GAAMklD,GAAY,OAqCtB,IAAIwB,GAAmBhL,GAbvB,SAAwBl9C,EAAKmf,EAAOw+B,EAAUz1C,GAC1CA,EAAWg2C,EAAKh2C,GAChB,IAAIigD,EAAS,GACTtK,EAAYb,EAAUW,GAC1B,OAAOyB,EAAYjgC,EAAZigC,CAAmBp/C,EAAK,CAACiY,EAAK1Y,EAAKyjB,KACtC66B,EAAU5lC,EAAK1Y,EAAK,CAAC4+B,EAAKr3B,KACtB,GAAIq3B,EAAK,OAAOnb,EAAKmb,GACrBgqB,EAAO5oD,GAAOuH,EACdkc,EAAKmb,MAEVA,GAAOj2B,EAASi2B,EAAKgqB,MAGoB,GAoRhD,IAAI5L,GAAWE,EARXH,EACW/oB,QAAQgpB,SACZH,EACIC,aAEAG,GAKX4L,GAAYlL,EAAS,CAACI,EAAQoD,EAAOx4C,KACrC,IAAI+W,EAAU++B,EAAY0C,GAAS,GAAK,GAExCpD,EAAOoD,EAAO,CAACU,EAAM7hD,EAAK8oD,KACtBrL,EAAUoE,EAAVpE,CAAgB,CAAC7e,KAAQr3B,KACjBA,EAAOtE,OAAS,KACfsE,GAAUA,GAEfmY,EAAQ1f,GAAOuH,EACfuhD,EAAOlqB,MAEZA,GAAOj2B,EAASi2B,EAAKlf,KACzB,GA2UH,SAASqpC,GAAS/E,EAAQ5C,GACtB,IAAI8C,EAAUzG,EAAUuG,GACxB,OAAOv0B,EAAM,CAACunB,EAAO/6B,KACjBioC,EAAQlN,EAAM,GAAI/6B,IACnBmlC,EAAa,GAKpB,MAAM4H,GACF,cACIpiD,KAAKqiD,KAAO,GACZriD,KAAKsiD,UAAYx1C,OAAOy1C,iBAG5B,aACI,OAAOviD,KAAKqiD,KAAKhmD,OAGrB,QAEI,OADA2D,KAAKqiD,KAAO,GACLriD,KAGX,OAAO4U,GACH,IAAIjb,EAEJ,KAAOib,EAAQ,GAAK4tC,GAAQxiD,KAAKqiD,KAAKztC,GAAQ5U,KAAKqiD,KAAK1oD,EAAE,GAAOib,MAAU,CACvE,IAAI7b,EAAIiH,KAAKqiD,KAAKztC,GAClB5U,KAAKqiD,KAAKztC,GAAS5U,KAAKqiD,KAAK1oD,GAC7BqG,KAAKqiD,KAAK1oD,GAAKZ,EAEf6b,EAAQjb,GAIhB,SAASib,GACL,IAAI9c,EAEJ,MAAQA,EAmEE,GAnEQ8c,GAmEX,IAnEqB5U,KAAKqiD,KAAKhmD,SAC9BvE,EAAE,EAAIkI,KAAKqiD,KAAKhmD,QAAUmmD,GAAQxiD,KAAKqiD,KAAKvqD,EAAE,GAAIkI,KAAKqiD,KAAKvqD,MAC5DA,GAAM,IAGN0qD,GAAQxiD,KAAKqiD,KAAKztC,GAAQ5U,KAAKqiD,KAAKvqD,MALE,CAS1C,IAAIiB,EAAIiH,KAAKqiD,KAAKztC,GAClB5U,KAAKqiD,KAAKztC,GAAS5U,KAAKqiD,KAAKvqD,GAC7BkI,KAAKqiD,KAAKvqD,GAAKiB,EAEf6b,EAAQ9c,GAIhB,KAAKyK,GACDA,EAAK+/C,YAActiD,KAAKsiD,UACxBtiD,KAAKqiD,KAAK9gD,KAAKgB,GACfvC,KAAKyiD,OAAOziD,KAAKqiD,KAAKhmD,OAAO,GAGjC,QAAQkG,GACJ,OAAOvC,KAAKqiD,KAAK9gD,KAAKgB,GAG1B,QACI,IAAKmgD,GAAO1iD,KAAKqiD,KAMjB,OAJAriD,KAAKqiD,KAAK,GAAKriD,KAAKqiD,KAAKriD,KAAKqiD,KAAKhmD,OAAO,GAC1C2D,KAAKqiD,KAAK59C,MACVzE,KAAK2iD,SAAS,GAEPD,EAGX,UACI,MAAO,IAAI1iD,MAGf,EAAEpH,OAAO2V,YACL,IAAK,IAAI1W,EAAI,EAAGA,EAAImI,KAAKqiD,KAAKhmD,OAAQxE,UAC5BmI,KAAKqiD,KAAKxqD,GAAGwR,KAI3B,OAAQ4zC,GACJ,IAAIxlC,EAAI,EACR,IAAK,IAAI5f,EAAI,EAAGA,EAAImI,KAAKqiD,KAAKhmD,OAAQxE,IAC7BolD,EAAOj9C,KAAKqiD,KAAKxqD,MAClBmI,KAAKqiD,KAAK5qC,GAAKzX,KAAKqiD,KAAKxqD,GACzB4f,KAIRzX,KAAKqiD,KAAK3gD,OAAO+V,GAEjB,IAAK,IAAI5f,EAAI,GAAOmI,KAAKqiD,KAAKhmD,OAAO,GAAIxE,GAAK,EAAGA,IAC7CmI,KAAK2iD,SAAS9qD,GAGlB,OAAOmI,MAQf,SAAS,GAAOnI,GACZ,OAASA,EAAE,GAAI,GAAG,EAGtB,SAAS2qD,GAAQjnD,EAAGqK,GAChB,OAAIrK,EAAEqnD,WAAah9C,EAAEg9C,SACVrnD,EAAEqnD,SAAWh9C,EAAEg9C,SAGfrnD,EAAE+mD,UAAY18C,EAAE08C,UAsH/B,IAAIO,GAAS9L,GATb,SAAcwD,EAAOx4C,GAEjB,GADAA,EAAWg2C,EAAKh2C,IACX4M,MAAMD,QAAQ6rC,GAAQ,OAAOx4C,EAAS,IAAI9F,UAAU,yDACzD,IAAKs+C,EAAMl+C,OAAQ,OAAO0F,IAC1B,IAAK,IAAIlK,EAAI,EAAGC,EAAIyiD,EAAMl+C,OAAQxE,EAAIC,EAAGD,IACrCg/C,EAAU0D,EAAM1iD,GAAhBg/C,CAAoB90C,KAIA,GAyB5B,SAAS+gD,GAAaC,EAAO3D,EAAM5H,EAAUz1C,GACzC,IAAIihD,EAAW,IAAID,GAAOxuB,UAC1B,OAAO4qB,EAAS6D,EAAU5D,EAAM5H,EAAUz1C,GA0C9C,SAASkhD,GAAQnN,GACb,IAAI4K,EAAM7J,EAAUf,GACpB,OAAOD,GAAc,SAAmB/zC,EAAMohD,GAgB1C,OAfAphD,EAAKP,KAAK,CAAC7F,KAAUu7C,KACjB,IAAIkM,EAAS,GAIb,GAHIznD,IACAynD,EAAOznD,MAAQA,GAEfu7C,EAAO56C,OAAS,EAAE,CAClB,IAAIvD,EAAQm+C,EACRA,EAAO56C,QAAU,KAChBvD,GAASm+C,GAEdkM,EAAOrqD,MAAQA,EAEnBoqD,EAAgB,KAAMC,KAGnBzC,EAAIx+C,MAAMlC,KAAM8B,MAoF/B,SAAS43B,GAAOyd,EAAQptC,EAAK2tC,EAAW31C,GACpC,MAAMy1C,EAAWX,EAAUa,GAC3B,OAAO8J,GAAQrK,EAAQptC,EAAK,CAACjR,EAAOuc,KAChCmiC,EAAS1+C,EAAO,CAACk/B,EAAKnpB,KAClBwG,EAAG2iB,GAAMnpB,MAEd9M,GAoEP,IAAIqhD,GAAWrM,GAHf,SAAmBoB,EAAMX,EAAUz1C,GAC/B,OAAO23B,GAAOmgB,EAAU1B,EAAMX,EAAUz1C,KAEV,GAyBlC,IAAIshD,GAAgBtM,GAHpB,SAAsBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACzC,OAAO23B,GAAOuf,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAEZ,GAuB1C,IAAIuhD,GAAiBvM,GAHrB,SAAuBoB,EAAMX,EAAUz1C,GACnC,OAAO23B,GAAOsgB,EAAgB7B,EAAMX,EAAUz1C,KAEN,GAE5C,SAASwhD,GAAWzqD,GAChB,OAAO,WACH,OAAOA,GA4Ff,SAAS0qD,GAAMrvC,EAAM8mC,EAAMl5C,GACvB,IAAIS,EAAU,CACVihD,MALc,EAMdC,aAAcH,GALG,IAgBrB,GARI1sC,UAAUxa,OAAS,GAAqB,mBAAT8X,GAC/BpS,EAAWk5C,GAAQb,IACnBa,EAAO9mC,IAEPwvC,GAAWnhD,EAAS2R,GACpBpS,EAAWA,GAAYq4C,KAGP,mBAATa,EACP,MAAM,IAAIp7C,MAAM,qCAGpB,IAAI+jD,EAAQ/M,EAAUoE,GAElB4I,EAAU,EACd,SAASC,IACLF,EAAM,CAAC5rB,KAAQl2B,MACC,IAARk2B,IACAA,GAAO6rB,IAAYrhD,EAAQihD,QACI,mBAAvBjhD,EAAQuhD,aACZvhD,EAAQuhD,YAAY/rB,IACxB/G,WAAW6yB,EAActhD,EAAQkhD,aAAaG,EAAU,IAExD9hD,EAASi2B,KAAQl2B,MAM7B,OADAgiD,IACO/hD,EAASo4C,GAGpB,SAASwJ,GAAWK,EAAKjrD,GACrB,GAAiB,iBAANA,EACPirD,EAAIP,OAAS1qD,EAAE0qD,OA3CD,EA6CdO,EAAIN,aAAqC,mBAAf3qD,EAAEkrD,SACxBlrD,EAAEkrD,SACFV,IAAYxqD,EAAEkrD,UA9CD,GAgDjBD,EAAID,YAAchrD,EAAEgrD,gBACjB,IAAiB,iBAANhrD,GAA+B,iBAANA,EAGvC,MAAM,IAAI8G,MAAM,qCAFhBmkD,EAAIP,OAAS1qD,GAnDC,GA6XtB,IAAImrD,GAASnN,GAHb,SAAcoB,EAAMX,EAAUz1C,GAC1B,OAAOg+C,EAAcoE,QAAS1pC,GAAOA,EAA9BslC,CAAmClG,EAAU1B,EAAMX,EAAUz1C,KAE5C,GA2B5B,IAAIqiD,GAAcrN,GAHlB,SAAmBoB,EAAMn/B,EAAOw+B,EAAUz1C,GACtC,OAAOg+C,EAAcoE,QAAS1pC,GAAOA,EAA9BslC,CAAmC9G,EAAYjgC,GAAQm/B,EAAMX,EAAUz1C,KAE5C,GA0BtC,IAAIsiD,GAAetN,GAHnB,SAAoBoB,EAAMX,EAAUz1C,GAChC,OAAOg+C,EAAcoE,QAAS1pC,GAAOA,EAA9BslC,CAAmC/F,EAAgB7B,EAAMX,EAAUz1C,KAEtC,GAyKxC,IAAIuiD,GAAWvN,GAjBf,SAAiBoB,EAAMX,EAAUz1C,GAC7B,IAAI21C,EAAYb,EAAUW,GAC1B,OAAOsC,EAAM3B,EAAM,CAAC58C,EAAGq8C,KACnBF,EAAUn8C,EAAG,CAACy8B,EAAKusB,KACf,GAAIvsB,EAAK,OAAO4f,EAAO5f,GACvB4f,EAAO5f,EAAK,CAACl/B,MAAOyC,EAAGgpD,gBAE5B,CAACvsB,EAAKlf,KACL,GAAIkf,EAAK,OAAOj2B,EAASi2B,GACzBj2B,EAAS,KAAM+W,EAAQ1U,KAAKogD,GAAYr+C,IAAI0I,GAAKA,EAAE/V,UAGvD,SAAS0rD,EAAWC,EAAMC,GACtB,IAAIrgD,EAAIogD,EAAKF,SAAUjgD,EAAIogD,EAAMH,SACjC,OAAOlgD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAI,KAGR,GAmGhC,SAASqgD,GAAWhgC,EAAO3L,EAAOw+B,EAAUz1C,GACxC,IAAI21C,EAAYb,EAAUW,GAC1B,OAAOkI,EA3BX,SAAenpB,GAEX,IADA,IAAI51B,EAASgO,MAAM4nB,GACZA,KACH51B,EAAO41B,GAAQA,EAEnB,OAAO51B,EAsBWikD,CAAMjgC,GAAQ3L,EAAO0+B,EAAW31C,GAyQtD,IAAI8iD,GAAY9N,GAlBhB,SAAiBwD,EAAOx4C,GACpB,IACIpB,EADAjF,EAAQ,KAEZ,OAAOqlD,GAAaxG,EAAO,CAACU,EAAMiH,KAC9BrL,EAAUoE,EAAVpE,CAAgB,CAAC7e,KAAQl2B,KACrB,IAAY,IAARk2B,EAAe,OAAOkqB,EAAOlqB,GAE7Bl2B,EAAKzF,OAAS,GACbsE,GAAUmB,EAEXnB,EAASmB,EAEbpG,EAAQs8B,EACRkqB,EAAOlqB,EAAM,KAAO,OAEzB,IAAMj2B,EAASrG,EAAOiF,OAgF7B,IAAImkD,GAAW/N,GAtBf,SAAgBjzC,EAAM0zC,EAAUz1C,GAC5BA,EAAWy2C,EAASz2C,GACpB,IAAI2+C,EAAM7J,EAAUW,GAChBmJ,EAAQ9J,EAAU/yC,GAClBgV,EAAU,GAEd,SAAS+D,EAAKmb,KAAQ/pB,GAClB,GAAI+pB,EAAK,OAAOj2B,EAASi2B,GACzBlf,EAAU7K,GACE,IAAR+pB,GACJ2oB,EAAMtmC,GAGV,SAASA,EAAM2d,EAAK4oB,GAChB,OAAI5oB,EAAYj2B,EAASi2B,IACb,IAARA,EACC4oB,OACLF,EAAI7jC,GADe9a,EAAS,QAAS+W,QADrC,EAKJ,OAAO6nC,EAAMtmC,KAEe,GA6HhC,IAAI0qC,GAAchO,GAtBlB,SAAoBwD,EAAOx4C,GAEvB,GADAA,EAAWg2C,EAAKh2C,IACX4M,MAAMD,QAAQ6rC,GAAQ,OAAOx4C,EAAS,IAAIlC,MAAM,8DACrD,IAAK06C,EAAMl+C,OAAQ,OAAO0F,IAC1B,IAAIijD,EAAY,EAEhB,SAASC,EAASnjD,GACH+0C,EAAU0D,EAAMyK,KAC3B/J,IAAQn5C,EAAM02C,EAAS37B,IAG3B,SAASA,EAAKmb,KAAQl2B,GAClB,IAAY,IAARk2B,EACJ,OAAIA,GAAOgtB,IAAczK,EAAMl+C,OACpB0F,EAASi2B,KAAQl2B,QAE5BmjD,EAASnjD,GAGbmjD,EAAS,OAwJE,GA5GH,CACR/iD,MAnoLJ,SAAe4zC,KAAOh0C,GAClB,MAAO,IAAIu1C,IAAavB,KAAMh0C,KAAQu1C,IAmoLtCH,UAAW6C,EACXG,kBACAzD,WACA6D,OACA4K,WAz6IJ,SAAoB3K,EAAOx4C,GACvB,IAAIojD,EAAW,GAqCf,OAnCA5sD,OAAO4W,KAAKorC,GAAO73C,QAAQtJ,IACvB,IACIiY,EADAiqC,EAASf,EAAMnhD,GAEfgsD,EAAY1O,EAAQ4E,GACpB+J,GACED,GAA+B,IAAlB9J,EAAOj/C,QACrB+oD,GAA+B,IAAlB9J,EAAOj/C,OAEzB,GAAIsS,MAAMD,QAAQ4sC,GACdjqC,EAAS,IAAIiqC,GACbA,EAASjqC,EAAO5M,MAEhB0gD,EAAS/rD,GAAOiY,EAAO9K,OAAO8K,EAAOhV,OAAS,EAAIipD,EAAUhK,QACzD,GAAI+J,EAEPF,EAAS/rD,GAAOkiD,MACb,CAEH,GADAjqC,EArHZ,SAAqB/P,GACjB,MAAMikD,EAAMjkD,EAAKuG,WAAW9J,QAAQw+C,EAAgB,IACpD,IAAIz+C,EAAQynD,EAAIznD,MAAMq+C,GAItB,GAHKr+C,IACDA,EAAQynD,EAAIznD,MAAMs+C,KAEjBt+C,EAAO,MAAM,IAAI+B,MAAM,gDAAkD0lD,GAC9E,IAAK,CAAEzjD,GAAQhE,EACf,OAAOgE,EACF/D,QAAQ,MAAO,IACfkC,MAAMo8C,GACNl2C,IAAKq/C,GAAQA,EAAIznD,QAAQu+C,EAAQ,IAAIx7C,QA0GzB2kD,CAAYnK,GACE,IAAlBA,EAAOj/C,SAAiB+oD,GAAgC,IAAlB/zC,EAAOhV,OAC9C,MAAM,IAAIwD,MAAM,0DAIfulD,GAAW/zC,EAAO5M,MAEvB0gD,EAAS/rD,GAAOiY,EAAO9K,OAAO++C,GAGlC,SAASA,EAAQxsC,EAASopC,GACtB,IAAIwD,EAAUr0C,EAAOlL,IAAI/N,GAAQ0gB,EAAQ1gB,IACzCstD,EAAQnkD,KAAK2gD,GACbrL,EAAUyE,EAAVzE,IAAqB6O,MAItBpL,EAAK6K,EAAUpjD,IAo4ItB4jD,MA5+HJ,SAAevI,EAAQC,GACnB,OAAOx0B,EAAMu0B,EAAQ,EAAGC,IA4+HxBuI,WAn7HJ,SAAiBxI,EAAQ5C,EAAa6C,GAClC,OAAOx0B,EAAMu0B,EAAQ5C,EAAa6C,IAm7HlCwI,QA5sHJ,YAAoB/jD,GAChB,OAAOu9C,KAAOv9C,EAAKyyB,YA4sHnBhuB,OAAQs5C,EACRiG,YAAanG,EACboG,aAAcjG,EACdkG,SAr+GJ,YAAqBlkD,GACjB,OAAO,YAAamkD,GAEhB,OADeA,EAAYxhD,KACpB1C,CAAS,QAASD,KAm+G7BokD,OAAQ/F,EACRgG,YAAa9F,EACb+F,aAAc9F,GACd58B,OACA2iC,QAptGJ,SAAiB7O,EAAU1zC,EAAM/B,GAC7B,MAAM4+C,EAAQ9J,EAAU/yC,GACxB,OAAO28C,GAAWjJ,EAAU,IAAI11C,KAC5B,MAAMuT,EAAKvT,EAAK2C,MAChBk8C,KAAS7+C,EAAM,CAACk2B,EAAK4oB,IAAUvrC,EAAI2iB,GAAM4oB,KAC1C7+C,IAgtGHukD,SAAU7F,GACV9gB,QACA4mB,UAAWzF,GACX0F,OAAQ3M,EACRZ,YAAaM,EACbkN,aAAczM,EACd0M,WAAY3F,GACZC,eACAvvC,MAAOyvC,GACPyF,WAAYxF,GACZyF,YAAaxF,GACb1uC,OAAQ+uC,GACRoF,YAAanF,GACboF,aAAcnF,GACdoF,QAASnF,GACToF,QAphFJ,SAAkB7O,EAAMX,EAAUz1C,GAC9B,OAAO+/C,GAAe3J,EAAMyB,IAAUpC,EAAUz1C,IAohFhDklD,aAAcnF,GACdoF,cA//EJ,SAAwB/O,EAAMX,EAAUz1C,GACpC,OAAO+/C,GAAe3J,EAAM,EAAGX,EAAUz1C,IA+/EzC1G,OACA8K,IAAK2zC,EACLqN,SAAUzH,EACV0H,UAAWnN,EACXoN,UAvzEJ,SAAmBxtD,EAAK29C,EAAUz1C,GAC9B,OAAOggD,GAAiBloD,EAAK+/C,IAAUpC,EAAUz1C,IAuzEjDulD,eAAgBvF,GAChBwF,gBAjyEJ,SAAyB1tD,EAAK29C,EAAUz1C,GACpC,OAAOggD,GAAiBloD,EAAK,EAAG29C,EAAUz1C,IAiyE1CylD,QAtvEJ,SAAiB1R,EAAI2R,EAAS54C,IAAKA,IAC/B,IAAIuwC,EAAO7mD,OAAOY,OAAO,MACrBuuD,EAASnvD,OAAOY,OAAO,MACvBunD,EAAM7J,EAAUf,GAChB6R,EAAW9R,EAAc,CAAC/zC,EAAMC,KAChC,IAAI3I,EAAMquD,KAAU3lD,GAChB1I,KAAOgmD,EACP5I,EAAe,IAAMz0C,EAAS,QAASq9C,EAAKhmD,KACrCA,KAAOsuD,EACdA,EAAOtuD,GAAKmI,KAAKQ,IAEjB2lD,EAAOtuD,GAAO,CAAC2I,GACf2+C,KAAO5+C,EAAM,CAACk2B,KAAQwoB,KAEbxoB,IACDonB,EAAKhmD,GAAOonD,GAEhB,IAAIniD,EAAIqpD,EAAOtuD,UACRsuD,EAAOtuD,GACd,IAAK,IAAIvB,EAAI,EAAGC,EAAIuG,EAAEhC,OAAQxE,EAAIC,EAAGD,IACjCwG,EAAExG,GAAGmgC,KAAQwoB,QAO7B,OAFAmH,EAASvI,KAAOA,EAChBuI,EAASC,WAAa9R,EACf6R,GA4tEPvR,YACAyR,SAlgEJ,SAAkBtN,EAAOx4C,GACrB,OAAOkgD,GAAUpI,EAAUU,EAAOx4C,IAkgElC+lD,cA3+DJ,SAAuBvN,EAAOvhC,EAAOjX,GACjC,OAAOkgD,GAAUhJ,EAAYjgC,GAAQuhC,EAAOx4C,IA2+D5CgmD,cAzsDJ,SAAuB3K,EAAQ5C,GAE3B,IAAIn8C,EAAI8jD,GAAQ/E,EAAQ5C,GACpB0D,GAAsB,EAwC1B,OAtCA7/C,EAAEkgD,OAAS,IAAI6D,GAGf/jD,EAAEkD,KAAO,SAAS8H,EAAMu5C,EAAW,EAAG7gD,EAAW,UAC7C,GAAwB,mBAAbA,EACP,MAAM,IAAIlC,MAAM,oCAMpB,GAJAxB,EAAEigD,SAAU,EACP3vC,MAAMD,QAAQrF,KACfA,EAAO,CAACA,IAEQ,IAAhBA,EAAKhN,QAAgBgC,EAAEogD,OAEvB,OAAOjI,EAAe,IAAMn4C,EAAEq/C,SAGlC,IAAK,IAAI7lD,EAAI,EAAGC,EAAIuR,EAAKhN,OAAQxE,EAAIC,EAAGD,IAAK,CACzC,IAAImS,EAAO,CACPX,KAAMA,EAAKxR,GACX+qD,WACA7gD,YAGJ1D,EAAEkgD,OAAOh9C,KAAKyI,GAGbk0C,IACDA,GAAsB,EACtB1H,EAAe,KACX0H,GAAsB,EACtB7/C,EAAE+uB,qBAMP/uB,EAAEuD,QAEFvD,GA+pDPwqB,MAAOs5B,GACPzmB,KAAMmnB,GACNt5C,OAAQ41C,EACR2D,eACAG,WACA+E,WAt9CJ,SAAoBzN,GAChB,IAAIzhC,EASJ,OARInK,MAAMD,QAAQ6rC,GACdzhC,EAAUyhC,EAAMp0C,IAAI88C,KAEpBnqC,EAAU,GACVvgB,OAAO4W,KAAKorC,GAAO73C,QAAQtJ,IACvB0f,EAAQ1f,GAAO6pD,GAAQjrD,KAAKgI,KAAMu6C,EAAMnhD,OAGzC0f,GA68CP4gB,OAAQ0pB,GACR6E,YAAa5E,GACb6E,aAAc5E,GACdE,SACA2E,UAjqCJ,SAAoBh0C,EAAM8mC,GACjBA,IACDA,EAAO9mC,EACPA,EAAO,MAEX,IAAI6iC,EAAS7iC,GAAQA,EAAK6iC,OAAUiE,EAAK5+C,OACrCq6C,EAAQuE,KACRjE,GAAS,GAEb,IAAI4M,EAAQ/M,EAAUoE,GACtB,OAAOpF,EAAc,CAAC/zC,EAAMC,KAKxB,SAASu5C,EAAOjmC,GACZuuC,KAAS9hD,EAAMuT,GAMnB,OAXIvT,EAAKzF,OAAS26C,EAAQ,GAAiB,MAAZj1C,KAC3BD,EAAKP,KAAKQ,GACVA,EAAWq4C,KAMXjmC,EAAMqvC,GAAMrvC,EAAMmnC,EAAQv5C,GACzByhD,GAAMlI,EAAQv5C,GAEZA,EAASo4C,MA4oCpBkF,MACA+I,OAp+BJ,SAAgB7N,EAAOx4C,GACnB,OAAOkgD,GAAUjI,EAAgBO,EAAOx4C,IAo+BxCm0C,aAAcM,EACd3lC,KAAMqzC,GACNmE,UAAWjE,GACXkE,WAAYjE,GACZkE,OAAQjE,GACRrqB,QAznBJ,SAAiB6c,EAAS0R,EAAc/sD,GACpC,IAAIq6C,EAAKe,EAAUC,GAEnB,OAAOjB,EAAc,CAAC/zC,EAAMC,KACxB,IACI0mD,EADAC,GAAW,EAcf5mD,EAAKP,KAAK,IAAI01C,KACLyR,IACD3mD,KAAYk1C,GACZlb,aAAa0sB,MAKrBA,EAAQx3B,YAnBR,WACI,IAAI74B,EAAO0+C,EAAQ1+C,MAAQ,YACvBsD,EAAS,IAAImE,MAAM,sBAAwBzH,EAAO,gBACtDsD,EAAMiW,KAAO,YACTlW,IACAC,EAAMD,KAAOA,GAEjBitD,GAAW,EACX3mD,EAASrG,KAWuB8sD,GACpC1S,KAAMh0C,MA+lBV2hD,MA5hBJ,SAAgBnqD,EAAGk+C,EAAUz1C,GACzB,OAAO4iD,GAAWrrD,EAAGsgD,IAAUpC,EAAUz1C,IA4hBzC4iD,cACAgE,YA3gBJ,SAAsBrvD,EAAGk+C,EAAUz1C,GAC/B,OAAO4iD,GAAWrrD,EAAG,EAAGk+C,EAAUz1C,IA2gBlCua,UAjYJ,SAAoB67B,EAAMyQ,EAAapR,EAAUz1C,GACzC8U,UAAUxa,QAAU,GAA4B,mBAAhBusD,IAChC7mD,EAAWy1C,EACXA,EAAWoR,EACXA,EAAcj6C,MAAMD,QAAQypC,GAAQ,GAAK,IAE7Cp2C,EAAWg2C,EAAKh2C,GAAYq4C,KAC5B,IAAI1C,EAAYb,EAAUW,GAK1B,OAHAqC,EAAS1B,EAAM,CAACtpC,EAAG3Q,EAAGmX,KAClBqiC,EAAUkR,EAAa/5C,EAAG3Q,EAAGmX,IAC9B2iB,GAAOj2B,EAASi2B,EAAK4wB,IACjB7mD,EAASo4C,IAsXhB0O,QAAShE,GACTiE,UA7SJ,SAAmBhT,GACf,MAAO,IAAIh0C,KACCg0C,EAAG8R,YAAc9R,MAAOh0C,IA4SpCinD,MAvMJ,SAAejlD,EAAM0zC,EAAUz1C,GAC3B,MAAM4+C,EAAQ9J,EAAU/yC,GACxB,OAAOghD,GAAUzvC,GAAOsrC,EAAM,CAAC3oB,EAAK4oB,IAAUvrC,EAAI2iB,GAAM4oB,IAASpJ,EAAUz1C,IAsM3EinD,UAAWjE,GACXkE,OAAQnE,GAGR7pB,IAAKimB,GACLgI,SAAU/H,GACVgI,UAAW/H,GACX3tC,IAAKywC,GACLkF,SAAUhF,GACViF,UAAWhF,GACXriB,KAAMme,EACNmJ,UAAWjJ,EACXkJ,WAAYjJ,GACZkJ,QAAS3J,EACT4J,aAAc9J,EACd+J,cAAe5J,EACfp9C,QAASi9B,GACTgqB,cAAe5I,GACf6I,aAAc9I,GACd+I,UAAWhQ,EACXiQ,gBAAiB9P,EACjB+P,eAAgBxQ,EAChByQ,OAAQ7K,EACR8K,MAAO9K,EACP+K,MAAOpH,GACPqH,OAAQ1I,GACR2I,YAAa1I,GACb2I,aAAc1I,GACd2I,SAAU7T,EACV8T,OAAQzF,GACR0F,SAAU/J,I,yDCnxLd,MAAM1c,GAAe0mB,GAAA,EAAcxgD,gBAE7B,IAAEf,GAAG,IAAE2E,IAAQ,KAGf,GAAY,4CACd68C,GAAY,+DACZC,GAAoB,CAClB,KAAM,OAAQ,IAAK,MAAO,KAAM,MAChC,KAAM,MAAO,KAAM,MAAO,KAAM,MAAO,KAAM,OAInD,MAAM,WAAuB,KAG3B,SACE,OAAO,GAKI,MAAM,GACnB,YAAYC,EAAcpoD,GAWxB,GATAxC,KAAK6qD,aAAe,MAGhBD,GAA8C,mBAAvBA,EAAavf,QACtC7oC,EAAUooD,EAAcA,EAAe,MACzCpoD,EAAUA,GAAW,GACrBxC,KAAK8qD,OAAStoD,EAAQuoD,MAGjBH,EASH5qD,KAAKgrD,cAAgBJ,EACrB5qD,KAAKirD,gBAA6BzkD,IAAhBhE,EAAQ0oD,OAA6B1oD,EAAQ0oD,QAV9C,CACjB,IAAIrkD,EAAS,GACb7G,KAAKgrD,cAAgB,CACnB,MAAMG,EAAO/sC,EAAUpK,GAAQnN,GAAUskD,EAAOn3C,GAAQA,KACxDk3C,IAAKl3C,IAAUA,GAAQA,EAAK,KAAMnN,KAEpC7G,KAAKirD,YAAa,EAQpBjrD,KAAKykC,SAAW,KACX,eAAiB3gC,KAAKtB,EAAQ4oD,SAQjCprD,KAAKqrD,WAAY,EACjBrrD,KAAKsrD,WAAatrD,KAAKurD,iBARvBvrD,KAAKqrD,WAAY,EACjBrrD,KAAK4kC,OAASb,GACd/jC,KAAKwrD,SAAWhpD,EAAQipD,QACxBzrD,KAAK0rD,YAAcnzD,OAAOY,OAAO,MACjCqJ,EAAQgkB,UAAYxmB,KAAK2rD,YAAYnpD,EAAQgkB,WAWjD,sBACE,OAAOud,GAAa18B,OAAOrH,KAAK4kC,QAIlC,OAAOrkC,EAAQwB,GACb/B,KAAKgrD,cAAc3f,MAAM9qC,EAAQ,OAAQwB,GAI3C,WAAWsE,EAASC,EAAW/M,EAAQsR,EAAOmJ,GAC5C,IAEOnJ,EAAMxD,OAAOrH,KAAK4kC,UAErB5kC,KAAK4rD,QAA0B,OAAlB5rD,KAAKykC,SAAoB,GAAMzkC,KAAK6rD,gBAAkB,MAAQ,UAC9D9nB,GAAa18B,OAAOwD,GAAS,GAAQ7K,KAAK8rD,kBAAkBjhD,GAA1B,SAC/C7K,KAAK4kC,OAAS/5B,EACd7K,KAAKykC,SAAW,MAGdp+B,EAAQgB,OAAOrH,KAAKykC,UAElBn+B,EAAUe,OAAOrH,KAAK0kC,YACxB1kC,KAAK4rD,OAAO,KAAK5rD,KAAK+rD,cAAcxyD,GAAWya,GAG/ChU,KAAK4rD,OAAO,UACA5rD,KAAKgsD,iBAAiBhsD,KAAK0kC,WAAap+B,MACxCtG,KAAK+rD,cAAcxyD,KAAWya,GAI5ChU,KAAK4rD,OAAO,IAAsB,OAAlB5rD,KAAKykC,SAAoB,GAAK,OAClCzkC,KAAKisD,eAAejsD,KAAKykC,SAAWp+B,MACpCrG,KAAKgsD,iBAAiBhsD,KAAK0kC,WAAap+B,MACxCtG,KAAK+rD,cAAcxyD,KAAWya,GAE9C,MAAOtY,GAASsY,GAAQA,EAAKtY,IAI/B,eAAe2K,EAASC,EAAW/M,EAAQsR,EAAOmJ,UAEzChU,KAAKksD,aACZlsD,KAAK4rD,OAAO5rD,KAAKmsD,aAAa9lD,EAASC,EAAW/M,EAAQsR,GAAQmJ,GAIpE,aAAa3N,EAASC,EAAW/M,EAAQsR,GACvC,MAAQ,GAAG7K,KAAKisD,eAAe5lD,MACvBrG,KAAK8rD,kBAAkBxlD,MACvBtG,KAAK+rD,cAAcxyD,KAChBsR,GAASA,EAAM/R,MAAQ,IAAIkH,KAAK8rD,kBAAkBjhD,SAAe,SAI9E,cAAcuhD,GACZ,OAAOA,EAAMjmD,IAAIpN,GACRiH,KAAKmsD,aAAapzD,EAAEsN,QAAStN,EAAEuN,UAAWvN,EAAEQ,OAAQR,EAAE8R,QAC5DzN,KAAK,IAIV,eAAeivD,GACb,MAA2B,SAApBA,EAAOvtD,SACZkB,KAAKssD,YAAYD,GAAUrsD,KAAK8rD,kBAAkBO,GAItD,kBAAkBA,GAEhB,GAAwB,cAApBA,EAAOvtD,SAIT,OAFIkB,KAAK8qD,QAAWuB,EAAOvzD,SAASkH,KAAK8qD,SACvCuB,EAASrsD,KAAK8Z,KAAK9Z,KAAK8qD,OAAOuB,EAAOvzD,SACjC,OAAQuzD,EAASA,EAAO7iD,GAAK,KAAK6iD,EAAOvzD,MAElD,IAAI4G,EAAM2sD,EAAOvzD,MAEbkH,KAAKwrD,UAAY9rD,EAAIogC,WAAW9/B,KAAKwrD,YACvC9rD,EAAMA,EAAI6c,OAAOvc,KAAKwrD,SAASnvD,SAE7B,GAAOyH,KAAKpE,KACdA,EAAMA,EAAI3B,QAAQ2sD,GAAW6B,KAE/B,MAAMC,EAAcxsD,KAAK6qD,aAAa1tD,KAAKuC,GAC3C,OAAQ8sD,EACCA,EAAY,GAAWxsD,KAAK0rD,YAAYc,EAAY,IAAMA,EAAY,GAArD9sD,EADJ,IAAIA,KAK5B,eAAe0L,GAEb,IAAItS,EAAQsS,EAAQtS,MAKpB,GAJI,GAAOgL,KAAKhL,KACdA,EAAQA,EAAMiF,QAAQ2sD,GAAW6B,KAG/BnhD,EAAQe,SACV,MAAO,IAAIrT,MAAUsS,EAAQe,WAG/B,GAAInM,KAAKqrD,WAEP,GAAIjgD,EAAQgB,SAAStT,QAAU+U,GAAItN,OACjC,MAAO,IAAIzH,UAIb,OAAQsS,EAAQgB,SAAStT,OACzB,KAAK+U,GAAItN,OACP,MAAO,IAAIzH,KACb,KAAK+U,GAAIhC,QACP,GAAc,SAAV/S,GAA8B,UAAVA,EACtB,OAAOA,EACT,MACF,KAAK+U,GAAI5B,QACP,GAAI,aAAanI,KAAKhL,GACpB,OAAOA,EACT,MACF,KAAK+U,GAAI9B,QACP,GAAI,kBAAkBjI,KAAKhL,GACzB,OAAOA,EACT,MACF,KAAK+U,GAAI7B,OACP,GAAI,yCAAyClI,KAAKhL,GAChD,OAAOA,EAMb,MAAO,IAAIA,OAAWkH,KAAK8rD,kBAAkB1gD,EAAQgB,YAIvD,iBAAiB9F,GACf,OAAOA,EAAUxN,QAAUoQ,GAAI4E,KAAO,IAAM9N,KAAK8rD,kBAAkBxlD,GAIrE,cAAc/M,GACZ,OAAQA,EAAOuF,UACf,IAAK,OACH,OAAOkB,KAAKssD,YAAY/yD,GAC1B,IAAK,UACH,OAAOyG,KAAKysD,eAAelzD,GAC7B,QACE,OAAOyG,KAAK8rD,kBAAkBvyD,IAKlC,aAAY,QAAE8M,EAAO,UAAEC,EAAS,OAAE/M,EAAM,MAAEsR,IACxC,MAAO,KACL7K,KAAKisD,eAAe5lD,MACpBrG,KAAKgsD,iBAAiB1lD,MACtBtG,KAAK+rD,cAAcxyD,KACnB,aAAesR,GAAS,GAAK,IAAI7K,KAAK8rD,kBAAkBjhD,OAI5D,gBACE,MAAM,IAAIhL,MAAM,oDAIlB,QAAQwG,EAASC,EAAW/M,EAAQsR,EAAOmJ,QAE1BxN,IAAXjN,EACFyG,KAAKsrD,WAAWjlD,EAAQA,QAASA,EAAQC,UAAWD,EAAQ9M,OAAQ8M,EAAQwE,MAAOvE,GAE3D,mBAAVuE,EACd7K,KAAKsrD,WAAWjlD,EAASC,EAAW/M,EAAQwqC,GAAcl5B,GAG1D7K,KAAKsrD,WAAWjlD,EAASC,EAAW/M,EAAQsR,GAASk5B,GAAc/vB,GAIvE,SAASo4C,GACP,IAAK,IAAIv0D,EAAI,EAAGA,EAAIu0D,EAAM/vD,OAAQxE,IAChCmI,KAAK0sD,QAAQN,EAAMv0D,IAIvB,UAAU+hB,EAAQla,EAAKsU,GACrB,MAAMwS,EAAW,GACjBA,EAAS5M,GAAUla,EACnBM,KAAK2rD,YAAYnlC,EAAUxS,GAI7B,YAAYwS,EAAUxS,GAEpB,IAAKhU,KAAK0rD,YACR,OAAO13C,GAAQA,IAGjB,IAAI24C,GAAc,EAClB,IAAK,IAAI/yC,KAAU4M,EAAU,CAC3B,IAAI9mB,EAAM8mB,EAAS5M,GACA,iBAARla,IACTA,EAAMA,EAAI5G,OACZ6zD,GAAc,EAEQ,OAAlB3sD,KAAKykC,WACPzkC,KAAK4rD,OAAO5rD,KAAK6rD,gBAAkB,MAAQ,SAC3C7rD,KAAKykC,SAAW,KAAMzkC,KAAK4kC,OAAS,IAGtC5kC,KAAK0rD,YAAYhsD,GAAQka,GAAU,IACnC5Z,KAAK4rD,OAAO,WAAWhyC,MAAWla,SAGpC,GAAIitD,EAAa,CACf,IAAIC,EAAU,GAAIC,EAAa,GAC/B,IAAK,MAAMC,KAAa9sD,KAAK0rD,YAC3BkB,GAAWA,EAAU,IAAIE,EAAcA,EACvCD,IAAeA,EAAa,IAAM,IAAM7sD,KAAK0rD,YAAYoB,GAE3DF,EAAUA,EAAQ7uD,QAAQ,0BAA2B,QACrDiC,KAAK6qD,aAAe,IAAIpsD,OAAO,OAAOouD,cACFD,iCAGtC5sD,KAAK4rD,OAAOe,EAAc,KAAO,GAAI34C,GAIvC,MAAM1N,EAAW/M,GACf,IAA0B+yB,EAAOjwB,EAA7BopC,EAAWn/B,EAWf,YATkBE,IAAdF,EACFm/B,EAAW,GAEJn/B,EAAUxH,SACjB2mC,EAAW,CAAC,CAAEn/B,UAAWA,EAAW/M,OAAQA,IAEnC,WAAY+M,IACrBm/B,EAAW,CAACn/B,IAENjK,EAASopC,EAASppC,QAE1B,KAAK,EACH,OAAO,IAAI,GAAe,MAE5B,KAAK,EAEH,GADAiwB,EAAQmZ,EAAS,KACXnZ,EAAM/yB,kBAAkB,IAC5B,OAAO,IAAI,GAAe,KAAKyG,KAAKgsD,iBAAiB1/B,EAAMhmB,cACjCtG,KAAK+rD,cAAcz/B,EAAM/yB,aAEvD,QACE,IAAIwzD,EAAW,IAEf,IAAK,IAAIl1D,EAAI,EAAGA,EAAIwE,EAAQxE,IAC1By0B,EAAQmZ,EAAS5tC,GAEby0B,EAAMhmB,UAAUe,OAAOf,GACzBymD,GAAY,KAAK/sD,KAAK+rD,cAAcz/B,EAAM/yB,SAG1CwzD,GAAY,IAAIl1D,EAAI,QAAU,QAClBmI,KAAKgsD,iBAAiB1/B,EAAMhmB,cAC5BtG,KAAK+rD,cAAcz/B,EAAM/yB,UACrC+M,EAAYgmB,EAAMhmB,WAGtB,OAAO,IAAI,GAAkBymD,EAAH,QAK9B,KAAKrhD,GACH,MAAMrP,EAASqP,GAAYA,EAASrP,QAAU,EAAG0wD,EAAW,IAAIp+C,MAAMtS,GACtE,IAAK,IAAIxE,EAAI,EAAGA,EAAIwE,EAAQxE,IAC1Bk1D,EAASl1D,GAAKmI,KAAK+rD,cAAcrgD,EAAS7T,IAC5C,OAAO,IAAI,GAAe,IAAIk1D,EAAS3vD,KAAK,SAI9C,IAAI4W,GAEoB,OAAlBhU,KAAKykC,WACPzkC,KAAK4rD,OAAO5rD,KAAK6rD,gBAAkB,MAAQ,SAC3C7rD,KAAKykC,SAAW,MAGlBzkC,KAAK4rD,OAAS5rD,KAAKgtD,cAGnB,IAAIC,EAAaj5C,GAAQ,EAAEtY,EAAOiF,KAAassD,EAAa,KAAMj5C,EAAKtY,EAAOiF,KAC9E,GAAIX,KAAKirD,WACP,IAAM,OAAOjrD,KAAKgrD,cAAcE,IAAI+B,GACpC,MAAOvxD,IAETuxD,GAAcA,KAKlB,SAASV,GAAkBW,GAEzB,IAAIvsD,EAASgqD,GAAkBuC,GAc/B,YAbe1mD,IAAX7F,IAEuB,IAArBusD,EAAU7wD,QACZsE,EAASusD,EAAUhwC,WAAW,GAAGrV,SAAS,IAC1ClH,EAAS,UAAU4b,OAAO,EAAG,EAAI5b,EAAOtE,QAAUsE,IAIlDA,GAA+C,MAApCusD,EAAUhwC,WAAW,GAAK,OAC1BgwC,EAAUhwC,WAAW,GAAK,MAAQrV,SAAS,IACtDlH,EAAS,cAAc4b,OAAO,EAAG,GAAK5b,EAAOtE,QAAUsE,IAGpDA,ECjYF,SAASwsD,GAAe7pB,EAAU8pB,GACvC,IAAItuB,EACAkO,EAAW,IAAIqgB,KACfC,EAAW,IAAIC,GAAO,CACxBnC,OAAQ,YAEVoC,GAASxE,UAAU,CACjB,SAAUjnD,GACRirC,EAASrxB,MAAM2nB,GAAU,SAAU5nC,EAAOkO,EAAM4c,GAC1C9qB,EACFqG,EAASrG,GACS,OAATkO,EACT0jD,EAASZ,QAAQ9iD,GAEjB0jD,EAASpC,IAAInpD,OAInB,SAAUpB,EAAQoB,GAChB,IACE0rD,KAAOC,QAAQ/sD,EAAQ,CACrByqD,OAAQ,uBACPtvB,MAAK,SAACn7B,GACPoB,EAAS,KAAMpB,MAEjB,MAAOq3B,GACPj2B,EAASi2B,KAGb,SAAUsa,EAAMvwC,GACd+8B,EAAavJ,KAAKC,UAAU8c,GAC5B8a,EAAa,KAAMtuB,MAEpB,SAAU9G,EAAKr3B,GAChBysD,EAAap1B,EAAK8G,MAKf,SAAS6uB,GAAiBrqB,EAAU4J,GACzC,IAAI0gB,EACA5gB,EAAW,IAAIqgB,KACfC,EAAW,IAAIC,GAAO,CACxBnC,OAAQ,YAEVoC,GAASxE,UAAU,CACjB,SAAUjnD,GACRirC,EAASrxB,MAAM2nB,GAAU,SAAU5nC,EAAO+P,EAAQ+a,GAC5C9qB,EACFqG,EAASrG,GACS,OAATkO,KACT0jD,EAASZ,QAAQ9iD,MAEjB0jD,EAASpC,IAAInpD,OAInB,SAAUpB,EAAQoB,GAEhBmrC,EAAc,KADd0gB,EAAcjtD,MAGf,SAAUq3B,EAAKr3B,GAChBusC,EAAclV,EAAK41B,Q,6BClEvB,+DAUO,SAASC,EAAoBvnC,EAAIzsB,GACtC,MAAmB,iBAARA,EACFysB,EAAGld,WAAWgC,QAAQvR,GAG3BtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,UACE,IAA1CysB,EAAGld,WAAWgB,SAAd,YAuCR,SAA2Bkc,EAAIzsB,GAC7B,IAAK8U,MAAMD,QAAQ7U,GACjB,MAAM,IAAIoC,UAAU,2BAEtB,OAAOqqB,EAAGld,WAAWkS,WAAWzhB,EAAIsM,KAAI,SAAC7N,GAAD,OAAOu1D,EAAmBvnC,EAAIhuB,OA1C3Dw1D,CAAiBxnC,EAAIzsB,EAAI,UA4BtC,SAA2BysB,EAAIzsB,GAC7B,IAAMk0D,EAASl0D,EAAI,OAASysB,EAAGld,WAAWP,UAAUhP,EAAI,QAAUysB,EAAGld,WAAWS,YAE1EumC,EAAQv2C,EAAI,SAASsM,KAAK,SAAA6nD,GAAQ,OAAIH,EAAmBvnC,EAAI0nC,MAC7D1kD,EAAaH,YAAkBmd,EAAGld,WAAY2kD,EAAQ3d,GAG5D,OAFA9pB,EAAG2oB,OAAO3lC,GAEHykD,EAhCEE,CAAiB3nC,EAAIzsB,GAG1BtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,OACrCysB,EAAGld,WAAWP,UAAUhP,EAAI,QAGjCtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,aACrCysB,EAAGld,WAAWgC,QAAQvR,EAAI,UAAWA,EAAI,cAG9CtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,SACrCysB,EAAGld,WAAWgC,QAAQvR,EAAI,UAAWysB,EAAGld,WAAWP,UAAUhP,EAAI,WAGtEtB,OAAOkB,UAAUC,eAAe1B,KAAK6B,EAAK,UACrCysB,EAAGld,WAAWgC,QAAQvR,EAAI,WAG5BysB,EAAGld,WAAWgC,QAAQvR,GA4BhB,SAAS8/B,EAAc55B,EAAKumB,EAAIhpB,EAAMyE,GACnD,IAAMmsD,EAAa5wD,GAAQ/E,OAAOkB,UAAUC,eAAe1B,KAAKsF,EAAM,YAClEA,EAAKxE,MACLwE,EAEJ,OAAOmwD,IACJU,QAAQ54B,KAAK5Z,MAAM5b,GAAM,KAAM,CAAEzC,KAAM4wD,IACvCpyB,MAAK,SAACsyB,GAAD,OAAeA,EAAU7kD,QAAO,SAACuV,EAAOuvC,GAK5C,IAJA,IAAM7kD,EAAK6kD,EAAa,OACpB/nC,EAAGld,WAAWP,UAAUwlD,EAAa,QACrC/nC,EAAGld,WAAWS,YAElB,MAAuBtR,OAAO4W,KAAKk/C,GAAnC,eAAkD,CAA7C,IAAM70D,EAAQ,KACjB,GAAiB,QAAbA,EAAJ,CAGA,IAAMV,EAAQu1D,EAAa70D,GAC3B,GAAImV,MAAMD,QAAQ5V,GAChB,IAAK,IAAIjB,EAAI,EAAGA,EAAIiB,EAAMuD,OAAQxE,IAChCyuB,EAAGgoC,aAAaC,EAAgBjoC,EAAI9c,EAAIhQ,EAAUV,EAAMjB,GAAIyF,SAG9DgpB,EAAGgoC,aAAaC,EAAgBjoC,EAAI9c,EAAIhQ,EAAUV,EAAOwE,KAI7D,OAAOgpB,IACNA,MACFwV,KAAK/5B,GACLi9B,MAAMj9B,GAWX,SAASwsD,EAAgBjoC,EAAI9c,EAAIhQ,EAAUV,EAAOwE,GAChD,IAAIgJ,EAAW/M,EAQf,MAPiB,UAAbC,GACF8M,EAAYggB,EAAGld,WAAWP,UAAU,mDACpCtP,EAAS+sB,EAAGld,WAAWP,UAAU/P,KAEjCwN,EAAYggB,EAAGld,WAAWP,UAAUrP,GACpCD,EAASs0D,EAAmBvnC,EAAIxtB,IAE3BwtB,EAAGld,WAAWQ,KAAKJ,EAAIlD,EAAW/M,EAAQ+sB,EAAGld,WAAWP,UAAUvL,M;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACjF3E,MAAMkxD,EAAW,EAAQ,IACnBC,EAAW,EAAQ,IACnBt9B,EAAO,EAAQ,IACfu9B,EAAkB,EAAQ,IAC1B7+C,EAAmBshB,EAAKthB,iBACxBC,EAAc,EAAQ,IACtB6+C,EAAM,EAAQ,IACdC,EAAS,EAAQ,KAEhBC,OAAQC,GAAW,EAAQ,KAC3BX,QAASY,GAAY,EAAQ,KAC7BrB,QAASsB,GAAY,EAAQ,KAC7BC,MAAOC,GAAU,EAAQ,KAG9BC,qBAAsBC,EACtBC,YAAaC,GACX,EAAQ,KAGV5gD,QAAS0iB,EACTliB,SAAUmiB,EACV7hB,SAAU8hB,GACR,EAAQ,KAGVvW,mBAAoBw0C,GAClB,EAAQ,KAGVj6B,UAAWxD,EACX2B,kBAAmB+7B,EACnBpiC,QAASqiC,EACT77B,eAAgB87B,GACd,EAAQ,KAGVC,QAASC,EACTC,WAAYC,GACV,EAAQ,KAGVnb,cAAeob,EACftb,oBAAqBub,EACrBpb,cAAeqb,GACb,EAAQ,IAINjY,EAAU,SAASyV,GAGzB,MAAMyC,EAAc,GAKdC,EAAwB,IAAIxB,EAAI,CAACyB,IADC,MAg5BxC,SAASC,EAAa7tD,GAAS,eAC7BwwB,EAAiBy6B,EAAOz6B,kBACrBs9B,IAEH,OAAO/3D,OAAOyY,OAAO,GAAI,CAACgiB,kBAAiBs9B,EAAU9tD,GAIvD,OAt3BAirD,EAAOkC,QAAUl9B,eAAe7f,EAAOugB,EAAK3wB,GAC1C,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,yCAGtB,GAAW,OAARk3B,EACD,MAAM,IAAIrjB,EACR,2CACA,sBAAuB,CAAC6B,KAAM,0BAIlC,GAAa,OAAViB,EACD,OAAO,KAyBT,IAAI29C,GArBJ/tD,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjC49C,eAAe,EACfC,mBAAmB,EACnB5lD,OAAO,EACP6lD,eAAe,EACfx5B,MAAM,EACNpkB,OAAQ,IAAIjD,EAAiB,OAC7BijB,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,OAEPj5B,OAGT10B,EAAQkuD,eAAgB,GAEtBluD,EAAQiuD,0BACHjuD,EAAQlF,KAMfizD,EADC/tD,EAAQkuD,cACE99C,QAEM66C,EAAOoB,OAAOj8C,EAAOpQ,GAIxC,MAAMuvB,QAAkB07B,EAAOmD,eAC7BpB,EAAmBhtD,GAAU2wB,EAAK3wB,GAGpC,IAAIquD,QAAkBjB,EAAS,CAC7B79B,YACA1uB,QAASktD,EACT/tD,UACAsuD,cAAetuD,EAAQsuD,gBAItBtuD,EAAQguD,gBAAkBhuD,EAAQqI,OAASumB,EAASy/B,GAC7B,IAArBA,EAAUx0D,OAEXw0D,EAAYA,EAAU,GACO,IAArBA,EAAUx0D,SAElBw0D,EAAY,IAENruD,EAAQqI,OAASwmB,EAAUw/B,KAEnCA,EAAY,CAACA,IAIZx/B,EAAU8B,IAAQ,aAAcA,IACjCA,EAAMA,EAAI,aAIZA,EAAMhC,EAAK/gB,MAAM+iB,GACb/B,EAAS+B,KACXA,EAAM,CAACA,IAGT,MAAM49B,EAAM59B,EACZA,EAAM,GACN,IAAI,IAAIt7B,EAAI,EAAGA,EAAIk5D,EAAI10D,SAAUxE,IAC3Bw5B,EAAU0/B,EAAIl5D,KAAOU,OAAO4W,KAAK4hD,EAAIl5D,IAAIwE,OAAS,IACpD82B,EAAI5xB,KAAKwvD,EAAIl5D,IAKjB,MAAMm5D,EAAc79B,EAAI92B,OAAS,EAMjC,GALkB,IAAf82B,EAAI92B,SACL82B,EAAMA,EAAI,IAIT/B,EAASy/B,GAAY,CAEtB,MAAMI,EAAanB,EAAY,CAC7B/9B,YAAWryB,IAAK,SAAUsyB,WAAY,CAACK,OAAO,KAE1CxnB,EAAQgmD,EACdA,EAAY,GACTG,IACDH,EAAU,YAAc19B,GAE1B09B,EAAUI,GAAcpmD,OACnB,GAAGwmB,EAAUw/B,IAAcG,EAAY,CAE5C,MAAMnmD,EAAQgmD,EACdA,EAAY,CAAC,WAAY19B,GACzB,IAAI,MAAM/5B,KAAOyR,EACfgmD,EAAUz3D,GAAOyR,EAAMzR,GAI3B,OAAOy3D,GAqBTpD,EAAOoB,OAASp8B,eAAe7f,EAAOpQ,GACpC,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,yCASM,KAL5BuG,EAAU6tD,EAAa7tD,EAAS,CAC9B0uD,uBAAuB,EACvBp+B,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,OAEPgB,eACT3uD,EAAQ2uD,kBAAe3qD,GAIzB,MAAM4qD,EAAY,GAGZC,EAAoB,GAG1B,GAAG,kBAAmB7uD,EAAS,CAC7B,MAAM8uD,EAAgBngC,EAAK/gB,MAAM5N,EAAQ8uD,eACtCjgC,EAAUigC,IAAkB,aAAcA,EAC3CF,EAAUE,cAAgBA,EAE1BF,EAAUE,cAAgB,CAAC,WAAYA,GAEzCD,EAAkB9vD,KAAK6vD,EAAUE,eAInC,IAAIC,EACJ,GAAIjgC,EAAU1e,GAGP,CAEL,MAAM4+C,QAAkB/D,EAAO/0D,IAAIka,EAAOpQ,GAC1C+uD,EAAcC,EAAUC,YACxBL,EAAUx+C,MAAQ4+C,EAAUz0D,SACzBy0D,EAAUE,aAEXN,EAAUO,cAAgB,CAAC,WAAYH,EAAUE,YACjDL,EAAkB9vD,KAAK6vD,EAAUO,qBATnCP,EAAUx+C,MAAQue,EAAK/gB,MAAMwC,GAc1B,SAAUpQ,IACbA,EAAQlF,KAAOi0D,GAAe,IAIhC,IAAIx/B,EAAYy9B,EAAmBhtD,GACnC,IAAI,MAAMyvB,KAAYo/B,EACpBt/B,QAAkB09B,EAAgB,CAAC19B,YAAWE,WAAUzvB,YAI1D,IAAI+tD,QAAiBzB,EAAQ,CAC3B/8B,YACA1uB,QAAS+tD,EAAUx+C,MACnBpQ,UACA2uD,aAAc3uD,EAAQ2uD,eAgBxB,OAZG9/B,EAAUk/B,IAAc,WAAYA,GACJ,IAAjCh4D,OAAO4W,KAAKohD,GAAUl0D,OACtBk0D,EAAWA,EAAS,UACC,OAAbA,IACRA,EAAW,IAITn/B,EAASm/B,KACXA,EAAW,CAACA,IAGPA,GAgBT9C,EAAOU,QAAU17B,eAAe7f,EAAOugB,EAAK3wB,GAC1C,GAAGqU,UAAUxa,OAAS,EACpB,OAAO,IAAIJ,UAAU,yCAIrBk3B,EADgB,mBAARA,EACF,KAEAA,GAAO,KAIf3wB,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjCkgB,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,MAIlB,MAAMI,QAAiB9C,EAAOoB,OAAOj8C,EAAOpQ,GAGtC4rD,EAAYW,EAASwB,GAE3B,GAAW,OAARp9B,EAED,OAAOi7B,EAIT5rD,EAAQqI,OAAQ,EAChBrI,EAAQkuD,eAAgB,EACxB,MAAMG,QAAkBpD,EAAOkC,QAAQvB,EAAWj7B,EAAK3wB,GAEvD,OAAOquD,GAqBTpD,EAAOznB,MAAQvT,eAAe7f,EAAOozB,EAAOxjC,GAC1C,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,uCAgBtB,GAZAuG,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjCg/C,MAAO,QACPC,UAAU,EACVC,YAAY,EACZC,aAAa,EACbC,cAAe,GACfl/B,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,MAIf7+B,EAAU0U,GAAQ,CAEnB,MAAMwrB,QAAkB/D,EAAO/0D,IAAIstC,EAAOxjC,GAG1C,GAFAwjC,EAAQwrB,EAAUz0D,SAEfy0D,EAAUE,WAAY,CAEvB,IAAIv+B,EAAM6S,EAAM,YACZ7S,EAEM/B,EAAS+B,GACjBA,EAAI5xB,KAAKiwD,EAAUE,YAEnBv+B,EAAM,CAACA,EAAKq+B,EAAUE,YAJtBv+B,EAAMq+B,EAAUE,WAMlB1rB,EAAM,YAAc7S,GAIxB,MAAM8+B,EAAejsB,GAAQA,EAAM,aAAoB,GAGjDjU,QAAkB07B,EAAOmD,eAC7BpB,EAAmBhtD,GAAUyvD,EAAczvD,GAGzCA,EAAQ9I,eAAe,eACzB8I,EAAQ0vD,UAAYxC,EAAgB39B,EAAW,MAE7CvvB,EAAQ9I,eAAe,+BACzB8I,EAAQ2vD,0BAA4BzC,EAAgB39B,EAAW,MAIjE,MAAMw+B,QAAiB9C,EAAOoB,OAAOj8C,EAAOpQ,GAGtC2R,EAAO,IAAI3R,GACjB2R,EAAK3C,SAAU,EACf2C,EAAK+8C,uBAAwB,EAC7B,MAAMkB,QAAsB3E,EAAOoB,OAAO7oB,EAAO7xB,GAI3Ck+C,EAAY95D,OAAO4W,KAAK62B,GAC3B7/B,IAAI/M,GAAO04B,EAAWC,EAAW34B,EAAK,CAACi5B,OAAO,KACjDle,EAAKihC,QAAUid,EAAUvyD,SAAS,UAClCqU,EAAKm+C,KAAO5C,EAAgB39B,EAAW,KAGvC,MAAMwgC,EAASnD,EAAsBmB,EAAU6B,EAAej+C,GAE9DA,EAAKtJ,OAASrI,EAAQ0vD,UACtB/9C,EAAKu8C,eAAgB,EACrBv8C,EAAK+iB,KAAO,GACZ/iB,EAAKq+C,SAAU,EACf,IAAI3B,QAAkBpD,EAAOkC,QAAQ4C,EAAQN,EAAc99C,GAM3D,OAHAA,EAAK+iB,KAAO,GACZ25B,EAAYvB,EAAauB,EAAW18C,GAE7B08C,GAkBTpD,EAAOv2B,KAAOzE,eAAe7f,EAAOugB,EAAK3wB,GAGvC,MAAMwjC,EAAQ,GAKd,OAJG7S,IACD6S,EAAM,YAAc7S,GAEtB6S,EAAM,UAAY,QACXynB,EAAOznB,MAAMpzB,EAAOozB,EAAOxjC,IA2BpCirD,EAAOgF,UAAYhF,EAAOe,SAAW/7B,eAAe7f,EAAOpQ,GACzD,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,0CAWtB,GAAG,gBAPHuG,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjC8/C,UAAW,YACXhC,eAAe,EACf59B,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,OAEW,CAC3B,GAA2B,wBAAxB3tD,EAAQmwD,aACe,uBAAxBnwD,EAAQmwD,YACR,MAAM,IAAI7iD,EACR,yCACA,wBAGJ,MAAM8iD,EAAchE,EAAOjzC,MAAM/I,GAGjC,OAAO47C,EAASA,SAASoE,EAAapwD,GAIxC,MAAM2R,EAAO,IAAI3R,UACV2R,EAAKi3C,OACZj3C,EAAK0+C,uBAAwB,EAC7B,MAAMC,QAAgBrF,EAAOwB,MAAMr8C,EAAOuB,GAG1C,OAAOq6C,EAASA,SAASsE,EAAStwD,IAmBpCirD,EAAOC,QAAUj7B,eAAeqgC,EAAStwD,GACvC,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,kDAItBuG,EAAU6tD,EAAa7tD,EAAS,CAC9B4oD,OAAQ95B,EAAUwhC,GAAW,2BAAwBtsD,IAGvD,MAAM,OAAC4kD,GAAU5oD,EACjB,IAAI,UAACuwD,GAAavwD,EAGlB,GAAG4oD,GAGD,GADA2H,EAAYA,GAAa7C,EAAY9E,IACjC2H,EACF,MAAM,IAAIjjD,EACR,wBACA,uBAAwB,CAACs7C,gBAI7B2H,EAAY,IAAMD,EAIpB,MAAME,QAAsBD,EAAUD,GACtC,OAAO9D,EAASgE,EAAexwD,IAqBjCirD,EAAOwB,MAAQx8B,eAAe7f,EAAOpQ,GACnC,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,gDAYtB,IAAIs0D,EAEFA,GAVF/tD,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjC89C,eAAe,EACf59B,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,OAKPO,cACE99C,QAGM66C,EAAOoB,OAAOj8C,EAAOpQ,GAIxC,MAAMswD,EAAU5D,EAAOqB,EAAU/tD,GACjC,GAAGA,EAAQ4oD,OAAQ,CACjB,GAAsB,wBAAnB5oD,EAAQ4oD,QACU,uBAAnB5oD,EAAQ4oD,OACR,OAAOwD,EAAO/vB,UAAUi0B,GAE1B,MAAM,IAAIhjD,EACR,yBACA,uBAAwB,CAACs7C,OAAQ5oD,EAAQ4oD,SAG7C,OAAO0H,GAmBTrF,EAAO9Y,cAAgBliB,eAAe7f,EAAOpQ,GAC3C,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,iDAItBuG,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAMg0B,EAAU1e,GAASA,EAAQ,GACjCkgB,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,MAIlB,MAAMI,QAAiB9C,EAAOoB,OAAOj8C,EAAOpQ,GAE5C,OAAOwtD,EAAqBO,EAAU/tD,IAwBxCirD,EAAOwF,MAAQxgC,eAAeygC,EAAM//B,EAAK3wB,GACvC,GAAGqU,UAAUxa,OAAS,EACpB,MAAM,IAAIJ,UAAU,uCAEtB,IAAIm1B,EAAS8hC,GACX,MAAM,IAAIj3D,UAAU,6CAIpBk3B,EADgB,mBAARA,EACF,KAEAA,GAAO,KAIf3wB,EAAU6tD,EAAa7tD,EAAS,CAC9BswB,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,MAIlB,MAAMI,QAAiB92B,QAAQwB,IAAIi4B,EAAK/sD,IAAIsS,IAC1C,MAAMtE,EAAO,IAAI3R,GACjB,OAAOirD,EAAOoB,OAAOp2C,EAAKtE,MAG5B,IAAIg/C,GAAa,EACd,eAAgB3wD,IACjB2wD,EAAa3wD,EAAQ2wD,YAGvB,MAAMrgD,EAAStQ,EAAQsQ,QAAU,IAAIjD,EAAiB,OAChD6kC,EAAS,CAAC,WAAY,IAE5B,IAAI,IAAI78C,EAAI,EAAGA,EAAI04D,EAASl0D,SAAUxE,EAAG,CAEvC,MAAM4gB,EAAM0Y,EAAKxe,kBAAkB49C,EAAS14D,GAAI,CAC9Cib,OAAQ,IAAIjD,EAAiB,MAAQhY,EAAI,OAKrCu7D,EAAWD,GAAoB,IAANt7D,EAAW68C,EAAS,CAAC,WAAY,IAGhE,GAFAqb,EAAet3C,EAAK26C,EAAS,WAAYtgD,GAEtCsgD,IAAY1e,EAEb,IAAI,MAAMa,KAAa6d,EAAS,CAC9B,MAAMC,EAAWD,EAAQ7d,GACzB,KAAKA,KAAab,GAAS,CACzBA,EAAOa,GAAa8d,EACpB,SAEF,MAAM7d,EAAUd,EAAOa,GACvB,IAAI,MAAMn8C,KAAOi6D,EACVj6D,KAAOo8C,IACVA,EAAQp8C,GAAOi6D,EAASj6D,KAQlC,MAAM6Q,EAAegmD,EAAevb,GAG9B0Z,EAAY,GACZj/C,EAAO5W,OAAO4W,KAAKlF,GAAc7F,OACvC,IAAI,IAAI2O,EAAK,EAAGA,EAAK5D,EAAK9S,SAAU0W,EAAI,CACtC,MAAMxQ,EAAO0H,EAAakF,EAAK4D,IAE3Bw8C,EAAoBhtD,IACtB6rD,EAAU7sD,KAAKgB,GAInB,GAAW,OAAR4wB,EACD,OAAOi7B,EAIT5rD,EAAQqI,OAAQ,EAChBrI,EAAQkuD,eAAgB,EACxB,MAAMG,QAAkBpD,EAAOkC,QAAQvB,EAAWj7B,EAAK3wB,GAEvD,OAAOquD,GAUTt4D,OAAOC,eAAei1D,EAAQ,iBAAkB,CAC9C/0D,IAAK,IAAM+0D,EAAO6F,gBAClB/iD,IAAK1B,GAAK4+C,EAAO6F,gBAAkBzkD,IAGrC4+C,EAAOz6B,eAAiBP,UACtB,MAAM,IAAI3iB,EACR,yFACkC,2BAClC,CAAC6B,KAAM,0BAA2BsiB,SAatCw5B,EAAO/0D,IAAM+5B,eAAewB,EAAKzxB,GAC/B,IAAI04B,EAEFA,EADmC,mBAA3B14B,EAAQwwB,eACTxwB,EAAQwwB,eAERy6B,EAAOz6B,eAGhB,MAAMw+B,QAAkBt2B,EAAKjH,GAE7B,IACE,IAAIu9B,EAAUz0D,SACZ,MAAM,IAAI+S,EACR,6CACA,6BAEDwhB,EAAUkgC,EAAUz0D,YACrBy0D,EAAUz0D,SAAWw4B,KAAK5Z,MAAM61C,EAAUz0D,WAE5C,MAAM2K,GACN,MAAM,IAAIoI,EACR,sDACA,2BAA4B,CAC1B6B,KAAM,0BACNy7B,MAAO1lC,EACP8pD,cAIN,OAAOA,GAeT/D,EAAOmD,eAAiBn+B,eACtBV,EAAWE,EAAUzvB,GASrB,OAPAA,EAAU6tD,EAAa7tD,EAAS,CAC9BlF,KAAM,GACNw1B,gBAAiB,IAAI47B,EACnB,CAACiC,YAAaR,MAIF,OAAbl+B,EACMu9B,EAAmBhtD,IAI5ByvB,EAAWd,EAAK/gB,MAAM6hB,GACjBZ,EAAUY,IAAa,aAAcA,IACxCA,EAAW,CAAC,WAAYA,IAGnBw9B,EAAgB,CAAC19B,YAAWE,WAAUzvB,cAI/CirD,EAAO52B,gBAAkB,EAAQ,IAAaA,gBAK9C42B,EAAO8F,gBAAkB,GASzB9F,EAAO+F,kBAAoB,SAAS1lD,GAClC,KAAKA,KAAQ2/C,EAAO8F,iBAClB,MAAM,IAAIzjD,EACR,kCAAoChC,EAAO,IAC3C,+BACA,CAACA,SAIL2/C,EAAOz6B,eAAiBy6B,EAAO8F,gBAAgBzlD,GAAM5L,MACnDurD,EAAQ9+C,MAAMlV,UAAUqD,MAAM9E,KAAK6e,UAAW,KAalD42C,EAAOgG,kBAAoB,SAAStsD,EAAayU,GAC/Cs0C,EAAY/oD,GAAeyU,GAQ7B6xC,EAAOiG,oBAAsB,SAASvsD,UAC7B+oD,EAAY/oD,IAIrBsmD,EAAOgG,kBAAkB,sBAAuB7E,EAAOjzC,OACvD8xC,EAAOgG,kBAAkB,qBAAsB7E,EAAOjzC,OAGtD8xC,EAAOx5B,IAAM,EAAQ,IAGrBw5B,EAAOt8B,KAAOA,EAEd54B,OAAOyY,OAAOy8C,EAAQt8B,GAGtBs8B,EAAOkG,SAAWlG,EAGlBA,EAAOmG,aAAe,EAAQ,IAG9BnG,EAAOoG,gBAAkB,EAAQ,GAAR,CAA6BpG,GAEtDgB,EAASqF,aAAarG,GACtBgB,EAASsF,qBAAqBtG,GAUvBA,GAMDv2D,EAAU,WACd,OAAO8gD,GAAQ,WACb,OAAO9gD,QAKX8gD,EAAQ9gD,GAERE,EAAOD,QAAUD,G,6BClgCjB,wCAyBO,SAASg6B,EAAepmB,GAC7B,QAASA,GAA0B,iBAAlBA,EAAKhM,W,cC1BxB1H,EAAOD,QAAUM,G,gBCOjBL,EAAOD,QAAU,EAAQ,K,6BCFzBC,EAAOD,QAAU,MAAM0Y,EASrB,YAAY+J,EAAQo6C,EAAW,IAAI1jD,IAAOmnC,EAAU,GAClDz3C,KAAK4Z,OAASA,EACd5Z,KAAKi0D,UAAYD,EACjBh0D,KAAKy3C,QAAUA,EAQjB,QACE,MAAM,OAAC79B,EAAM,UAAEq6C,EAAS,QAAExc,GAAWz3C,KACrC,OAAO,IAAI6P,EAAiB+J,EAAQ,IAAItJ,IAAI2jD,GAAYxc,GAW1D,MAAMyc,GAEJ,MAAMF,EAAWE,GAAOl0D,KAAKi0D,UAAUv7D,IAAIw7D,GAC3C,GAAGF,EACD,OAAOA,EAIT,MAAMG,EAAan0D,KAAK4Z,OAAS5Z,KAAKy3C,QAQtC,OAPAz3C,KAAKy3C,UAGFyc,GACDl0D,KAAKi0D,UAAU1jD,IAAI2jD,EAAKC,GAGnBA,EAYT,MAAMD,GACJ,OAAOl0D,KAAKi0D,UAAU//B,IAAIggC,GAS5B,YACE,MAAO,IAAIl0D,KAAKi0D,UAAU9kD,W,6BCvE9B,MAEMilD,EAAiBzmD,wDACjB0mD,EAAa,0CAQbC,EAAQ,GAsTd,SAASC,EAAgBC,EAAIC,GAE3B,OAAKD,EAAGnuD,QAAQvH,WAAa21D,EAAGpuD,QAAQvH,UACtC01D,EAAGj7D,OAAOuF,WAAa21D,EAAGl7D,OAAOuF,WAI9B01D,EAAGnuD,QAAQvN,QAAU27D,EAAGpuD,QAAQvN,OACnC07D,EAAGluD,UAAUxN,QAAU27D,EAAGnuD,UAAUxN,OACpC07D,EAAGj7D,OAAOT,QAAU27D,EAAGl7D,OAAOT,QAnUb,YAsUhB07D,EAAGj7D,OAAOuF,UAKV01D,EAAGj7D,OAAO6S,SAAStN,WAAa21D,EAAGl7D,OAAO6S,SAAStN,UACnD01D,EAAGj7D,OAAO4S,WAAasoD,EAAGl7D,OAAO4S,UACjCqoD,EAAGj7D,OAAO6S,SAAStT,QAAU27D,EAAGl7D,OAAO6S,SAAStT,QAxRnDw7D,EAAMI,KAAO,0BACbJ,EAAMzW,MAAQ,IAAIp/C,OAAO,aAGzB61D,EAAM1qD,KAAO,IAAInL,OACf,8wBAGJrH,EAAOD,QAAU,MAAMy3D,EAQrB,aAAah8C,GAEX,MAAMkgD,EAAU,GAEVpe,EAAS,GAGT9sC,EAAQgL,EAAM3S,MAAMq0D,EAAMI,MAChC,IAAIC,EAAa,EACjB,IAAI,MAAM5sD,KAAQH,EAAO,CAIvB,GAHA+sD,IAGGL,EAAMzW,MAAM/5C,KAAKiE,GAClB,SAIF,MAAMjK,EAAQiK,EAAKjK,MAAMw2D,EAAM1qD,MAC/B,GAAa,OAAV9L,EACD,MAAM,IAAI+B,MAAM,+BAAiC80D,EAAa,KAIhE,MAAM/qD,EAAO,CAACvD,QAAS,KAAMC,UAAW,KAAM/M,OAAQ,KAAMsR,MAAO,MAuDnE,QApDgBrE,IAAb1I,EAAM,GACP8L,EAAKvD,QAAU,CAACvH,SAnGA,YAmG2BhG,MAAOgF,EAAM,IAExD8L,EAAKvD,QAAU,CAACvH,SApGA,YAoG2BhG,MAAOgF,EAAM,IAI1D8L,EAAKtD,UAAY,CAACxH,SAzGA,YAyG2BhG,MAAOgF,EAAM,SAG1C0I,IAAb1I,EAAM,GACP8L,EAAKrQ,OAAS,CAACuF,SA7GC,YA6G0BhG,MAAOgF,EAAM,SAClC0I,IAAb1I,EAAM,GACd8L,EAAKrQ,OAAS,CAACuF,SA9GC,YA8G0BhG,MAAOgF,EAAM,KAEvD8L,EAAKrQ,OAAS,CACZuF,SAhHW,UAiHXhG,WAAO0N,EACP4F,SAAU,CACRtN,SArHY,mBAwHA0H,IAAb1I,EAAM,GACP8L,EAAKrQ,OAAO6S,SAAStT,MAAQgF,EAAM,QACd0I,IAAb1I,EAAM,IACd8L,EAAKrQ,OAAO6S,SAAStT,MAAQs7D,EAC7BxqD,EAAKrQ,OAAO4S,SAAWrO,EAAM,IAE7B8L,EAAKrQ,OAAO6S,SAAStT,MAAQu7D,EAE/BzqD,EAAKrQ,OAAOT,MAAkBgF,EAAM,GAwOjCC,QAAQ62D,GAAgB,SAAS92D,EAAO6T,EAAMzU,EAAG23D,GACxD,GAAGljD,EACD,OAAOA,GACL,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,IACjB,IAAK,IAAM,MAAO,IAClB,IAAK,KAAM,MAAO,KAGtB,GAAGzU,EACD,OAAO8R,OAAOmO,aAAaiH,SAASlnB,EAAG,KAEzC,GAAG23D,EAED,MAAM,IAAIh1D,MAAM,iCAtPA2G,IAAb1I,EAAM,GACP8L,EAAKiB,MAAQ,CACX/L,SAtIc,YAuIdhG,MAAOgF,EAAM,SAEO0I,IAAd1I,EAAM,IACd8L,EAAKiB,MAAQ,CACX/L,SA1Ic,YA2IdhG,MAAOgF,EAAM,KAGf8L,EAAKiB,MAAQ,CACX/L,SA7IiB,eA8IjBhG,MAAO,IAKN8Q,EAAKiB,MAAM/R,SAAS47C,EAGlB,CACL,IAAIogB,GAAS,EACb,MAAM1I,EAAQ1X,EAAO9qC,EAAKiB,MAAM/R,OAChC,IAAI,MAAMuF,KAAK+tD,EACb,GAAGmI,EAAgBl2D,EAAGuL,GAAO,CAC3BkrD,GAAS,EACT,MAGDA,IACD1I,EAAM7qD,KAAKqI,GACXkpD,EAAQvxD,KAAKqI,SAbf8qC,EAAO9qC,EAAKiB,MAAM/R,OAAS,CAAC8Q,GAC5BkpD,EAAQvxD,KAAKqI,GAiBjB,OAAOkpD,EAUT,iBAAiBA,GACXnkD,MAAMD,QAAQokD,KAChBA,EAAUlE,EAAOmG,qBAAqBjC,IAExC,MAAM1G,EAAQ,GACd,IAAI,MAAMxiD,KAAQkpD,EAChB1G,EAAM7qD,KAAKqtD,EAAOoG,cAAcprD,IAElC,OAAOwiD,EAAMhoD,OAAOhH,KAAK,IAU3B,qBAAqBwM,GACnB,MAAMhQ,EAAIgQ,EAAKvD,QACT1M,EAAIiQ,EAAKtD,UACThO,EAAIsR,EAAKrQ,OACTsM,EAAI+D,EAAKiB,MAEf,IAAIoqD,EAAQ,GAqCZ,MAhPoB,cA8MjBr7D,EAAEkF,SACHm2D,GAAS,IAAIr7D,EAAEd,SAEfm8D,GAAS,GAAGr7D,EAAEd,MAIhBm8D,GAAS,KAAKt7D,EAAEb,UArNI,cAwNjBR,EAAEwG,SACHm2D,GAAS,IAAI38D,EAAEQ,SAxNG,cAyNVR,EAAEwG,SACVm2D,GAAS38D,EAAEQ,OAEXm8D,GAAS,IA0Hf,SAAiBr7D,GACf,OAAOA,EAAEmE,QAAQm3D,GAAc,SAASp3D,GACtC,OAAOA,GACL,IAAK,IAAK,MAAO,MACjB,IAAK,KAAM,MAAO,OAClB,IAAK,KAAM,MAAO,MAClB,IAAK,KAAM,MAAO,UAhILq3D,CAAQ78D,EAAEQ,UACpBR,EAAE8T,SAAStT,QAAUs7D,EACnB97D,EAAE6T,WACH8oD,GAAS,IAAI38D,EAAE6T,UAET7T,EAAE8T,SAAStT,QAAUu7D,IAC7BY,GAAS,MAAM38D,EAAE8T,SAAStT,WAnOV,cAyOjB+M,EAAE/G,SACHm2D,GAAS,KAAKpvD,EAAE/M,SAzOE,cA0OV+M,EAAE/G,WACVm2D,GAAS,IAAIpvD,EAAE/M,OAGjBm8D,GAAS,OACFA,EAWT,4BAA4BnC,GAC1B,MAAM1G,EAAQ,GAERgJ,EAAc,CAClB,aA9PkB,YA+PlBC,IAhQkB,YAiQlBjqD,QA/Pe,WAkQjB,IAAI,MAAMmqC,KAAaud,EAAS,CACdA,EAAQvd,GAChB7yC,QAAQ+I,IACd,MAAM7B,EAAO,GACb,IAAI,MAAM0rD,KAAiB7pD,EAAQ,CACjC,MAAM8pD,EAAe9pD,EAAO6pD,GACtBE,EAAe,CACnB12D,SAAUs2D,EAAYG,EAAaznD,MACnChV,MAAOy8D,EAAaz8D,OA1QX,YA4QR08D,EAAa12D,WACd02D,EAAappD,SAAW,CACtBtN,SAhRU,aAkRT,aAAcy2D,IACfC,EAAappD,SAAStT,MAAQy8D,EAAanpD,UAE1C,aAAcmpD,GACV,aAAcA,IACjBC,EAAappD,SAAStT,MAAQs7D,GAEhCoB,EAAarpD,SAAWopD,EAAappD,UAC3B,aAAcopD,IACxBC,EAAappD,SAAStT,MAAQu7D,IAGlCzqD,EAAK0rD,GAAiBE,EAGtB5rD,EAAKiB,MADU,aAAd0qC,EACY,CACXz2C,SA/Re,eAgSfhG,MAAO,IAGI,CACXgG,SAAUy2C,EAAUzV,WAAW,MAtSnB,YADA,YAySZhnC,MAAOy8C,GAGX6W,EAAM7qD,KAAKqI,KAIf,OAAOwiD,IAmCX,MAAM8I,EAAe,aAerB,MAAMN,EACJ,wE,6BCzWF,MAAMjnD,EAAM,8CACNtB,EAAM,oCAEZjV,EAAOD,QAAU,CAEfs+D,gBAAiB,uCAEjBC,oBAAqB,uCAErB/nD,MACAgoD,SAAUhoD,EAAM,OAChBioD,UAAWjoD,EAAM,QACjBkoD,SAAUloD,EAAM,OAChBmoD,QAASnoD,EAAM,MACfooD,SAAUpoD,EAAM,OAChBqoD,kBAAmBroD,EAAM,eACzBsoD,gBAAiBtoD,EAAM,aACvBuoD,iBAAkBvoD,EAAM,OACxBwoD,WAAYxoD,EAAM,SAClBymD,eAAgBzmD,EAAM,aAEtBtB,MACA+pD,YAAa/pD,EAAM,UACnBgqD,WAAYhqD,EAAM,SAClBiqD,YAAajqD,EAAM,UACnBgoD,WAAYhoD,EAAM,W,8sGCvBCkqD,E,gCAGnB,aAAe,yBACb,cAAM,IADO,sBAFkBj8D,KAElB,E,oCAIf,WACE,MAAO,S,GARwB4F,K,wBCPpB,EACN,CACLs2D,UAAW,SAAUntD,EAAMrF,EAAQ8a,GACjC,IAAIzY,EAASC,EAAW/M,EACpB6vB,EAAS,GACT9hB,EAAMwX,EAAM1G,IAAIpU,GACpB,IAAK,IAAIzI,KAAK8N,EAAM,CACM,IAApB9N,EAAEsB,QAAQ,MACRusB,EAAO7tB,GACT8K,EAAU+iB,EAAO7tB,IAEjB8K,EAAUyY,EAAM3G,MAAM5c,GACtB6tB,EAAO7tB,GAAK8K,GAGdA,EAAUyY,EAAM1G,IAAI7c,GAEtB,IAAIk7D,EAAQptD,EAAK9N,GACjB,IAAK,IAAIqK,KAAK6wD,EAAO,CACnB,IAAIrsB,EAAUqsB,EAAM7wD,GAEpB,IAAK,IAAIm9B,KADTz8B,EAAYwY,EAAM1G,IAAIxS,GACRwkC,EAAS,CACrB,IAAIvwC,EAAMuwC,EAAQrH,GAClB,GAAiB,QAAblpC,EAAIiU,KACNvU,EAASulB,EAAM1G,IAAIve,EAAIf,OACvBgmB,EAAMrO,IAAIpK,EAASC,EAAW/M,EAAQ+N,QACjC,GAAiB,cAAbzN,EAAIiU,KACTsb,EAAOvvB,EAAIf,OACbS,EAAS6vB,EAAOvvB,EAAIf,QAEpBS,EAASulB,EAAM3G,MAAMte,EAAIf,OACzBswB,EAAOvvB,EAAIf,OAASS,GAEtBulB,EAAMrO,IAAIpK,EAASC,EAAW/M,EAAQ+N,OACjC,IAAiB,YAAbzN,EAAIiU,KAWb,MAAM,IAAIjO,MAAM,+BAAiCkjC,EAAEj1B,MARjDvU,EADEM,EAAIuS,SACG0S,EAAM1T,QAAQvR,EAAIf,WAAO0N,EAAWsY,EAAM1G,IAAIve,EAAIuS,WAClDvS,EAAIyS,KACJwS,EAAM1T,QAAQvR,EAAIf,MAAOe,EAAIyS,MAE7BwS,EAAM1T,QAAQvR,EAAIf,OAE7BgmB,EAAMrO,IAAIpK,EAASC,EAAW/M,EAAQ+N,S,8DCzCrC,SAASovD,EAAexgD,GACrC,IAAIygD,EAAS,EAUb,SAASC,EAAYxgD,GACnB,IAAIrW,EAAM,GACNqG,EAAKgQ,EAAI9M,WACb,IAAK,IAAI/N,KAAK6K,EACZ/K,IAAIC,MAAM,oBAAsB8K,GAChCrG,GAAO82D,IAAczwD,EAAG7K,GAAK,KAE/B,OAAOwE,EAGT,SAAS+2D,EAAgB1gD,GACvB,IAAIrW,EAAM,GACV,IAAK,IAAI8O,KAAKuH,EAAIqa,YAAa,CAC7B,IAAIsmC,EAAM3gD,EAAIqa,YAAY5hB,GAC1B9O,GAAO82D,IAAc,YAAcE,EAAIC,SAASnoD,GAAzCgoD,QAET,OAAO92D,EAmBT,SAASk3D,EAAU7gD,GACjB,IAAIrW,EAAM82D,mBAOV,OANAF,IACA52D,GAAO62D,EAAWxgD,GAClBrW,GAAO+2D,EAAe1gD,GACtBrW,GArBF,SAASm3D,EAAc9gD,GAErB,IADA,IAAIrW,EAAM,GACDxE,EAAI,EAAGA,EAAI6a,EAAIyZ,SAASxzB,OAAQd,IAEvCF,IAAIC,MAAM,wBACVyE,GAAO82D,oBACPF,IACA52D,GAAO62D,EAAWxgD,EAAIyZ,SAASt0B,IAC/BwE,GAAO+2D,EAAe1gD,EAAIyZ,SAASt0B,IACnCwE,GAAOm3D,EAAa9gD,EAAIyZ,SAASt0B,IACjCo7D,IACA52D,GAAO82D,UAET,OAAO92D,EAQAm3D,CAAa9gD,GACpBugD,IACA52D,GAAO,IAIT,SAAS82D,IAEP,IADA,IAAI92D,EAAM,GACDlI,EAAI,EAAGA,EAAI8+D,EAAQ9+D,IAC1BkI,GAAO,OAET,OAAOA,EAOT,OAJA,SAAoBmW,GAClB,OAhEF,SAAoBA,GAElB,IADA,IAAInW,EAAM82D,IAAc,UACfh/D,EAAI,EAAGA,EAAIqe,EAAMsX,KAAKnxB,OAAQxE,IACrCkI,GAAOmW,EAAMsX,KAAK31B,GAAK,IAGzB,OADAkI,GAAO,KA2DAo3D,CAAUjhD,GAAS+gD,EAAS/gD,EAAME,KAGpCghD,CAAUlhD,G,oCCrDJ,SAASmhD,EAAeC,EAAQC,EAAUjxC,GAEvD,IAAIkxC,EAAe,GACnB,SAASC,EAASr/D,GAChB,GAAIo/D,EAAap/D,GACf,OAAOo/D,EAAap/D,GAEtB,IAAIs/D,EAASpxC,EAAG1a,SAASxT,GAEzB,OADAo/D,EAAap/D,GAAQs/D,EACdA,EAIT,SAASC,EAAY7sD,GACnB,MAAwB,iBAATA,GAAqBA,EAAKhN,MAAM,YAEjD,SAASiwB,EAAOjjB,GACd,MAAwB,iBAATA,GAAqBA,EAAKhN,MAAM,WAEjD,SAAS85D,EAAmB9sD,GAC1B,MAAoB,iBAATA,EACFA,EAAK/M,QAAQ,QAAS,KAAKA,QAAQ,QAAS,KAE5C+M,EAGX,SAAS+sD,EAAU/sD,GACjB,MAAwB,iBAATA,GAAqBA,EAAKhN,MAAM,aAEjD,SAASg6D,EAAShtD,GAChB,MAAwB,iBAATA,IAAsBA,EAAKhN,MAAM,QAAUgN,EAAKhN,MAAM,OAEvE,SAASi6D,EAAUjtD,GACjB,MAAwB,iBAATA,GAAqBA,EAAKhN,MAAM,MAEjD,SAASk6D,EAAkBltD,GACzB,MAAwB,iBAATA,GAAqBA,EAAKhN,MAAM,kBAEjD,SAASm6D,EAAWntD,GAElB,OADQA,EAAK7K,MAAM,KACV,GAEX,SAASi4D,EAAWptD,GAElB,OADQA,EAAK7K,MAAM,KACV,GAEX,SAASk4D,EAAgBrtD,GACvB,OAAI+sD,EAAS/sD,GACJA,EAAKhO,MAAM,EAAGgO,EAAKzO,OAAS,GAE5ByO,EAqEX,SAASstD,EAAcr4D,GACrBA,EAAMA,EAAIhC,QAAQ,MAAO,OACtBA,QAAQ,MAAO,OACfA,QAAQ,KAAM,MACdA,QAAQ,KAAM,MACdA,QAAQ,KAAM,OACdA,QAAQ,KAAM,OACdA,QAAQ,YAAa,KACrBA,QAAQ,MAAO,OACfA,QAAQ,OAAQ,OAChBA,QAAQ,MAAO,OAClB1C,IAAII,KAAK,gCAAkCsE,GAC3C,IAAI0a,EAAM,GACNqV,EAAK/vB,EAAIE,MAAM,KACnB,IAAK,IAAI1E,KAAKu0B,EACR6nC,EAAW7nC,EAAGv0B,MAChBkf,EAAMA,EAAIlU,OAAOupB,EAAGv0B,KAGxB,OAAOkf,EAqET,SAAS49C,EAAct4D,EAAKgK,GAC1B,IAAK,IAAIlS,EAAI,EAAGA,EAAIkS,EAAI1N,OAAQxE,IAC9B,GAAsB,iBAAXkS,EAAIlS,IAGXkS,EAAIlS,GAAG6L,gBAAkB3D,EAAI2D,cAC/B,OAAO7L,EAIX,OAAO,KAIT,SAASygE,EAAgBv4D,EAAKgK,GAE5B,IADA,IAAIslB,EAAM,GACDx3B,EAAI,EAAGA,EAAIkS,EAAI1N,OAAQxE,IACR,iBAAXkS,EAAIlS,IAGXkS,EAAIlS,GAAG6L,gBAAkB3D,EAAI2D,eAC/B2rB,EAAI9tB,KAAK1J,GAGb,OAAOw3B,EAqCT,SAASkpC,EAAoBxuD,EAAK+pC,EAAMxwB,GACtCjoB,IAAII,KAAK,uCAAyC6nB,EAAQ,OAASvZ,GAEnE,IADA,IAAI6K,EAAQ,EACH/c,EAAI,EAAGA,EAAIkS,EAAI1N,OAAQxE,IAO9B,GANIkS,EAAIlS,KAAOi8C,GACbl/B,IAEE7K,EAAIlS,KAAOyrB,GACb1O,IAEEA,EAAQ,EACV,OAAO/c,EAIX,OADAwD,IAAIK,MAAM,sDACH,EAgCT,SAAS88D,EAAmB1/D,GAO1B,OANAkH,KAAKg3D,SAAW,SAAUyB,GACxB,OAAOA,EAAS,MAAQ3/D,EAAMwP,QAEhCtI,KAAK8D,KAAO,SAAUgH,GACpB,OAAOhS,EAAMuO,OAAOyD,IAEf9K,KAIT,SAAS04D,EAAkB5/D,GACzBkH,KAAKg3D,SAAW,SAAUyB,GACxB,MAAO,YAAc3/D,EAAQ,OAAS2/D,EAAS,MAEjDz4D,KAAK8D,KAAO,SAAUgH,GACpB,IAEI6tD,EAAK,IAAIl6D,OAFH3F,GAGV,QAAIgS,EAAKhS,OACA6/D,EAAG70D,KAAKgH,EAAKhS,QAO1B,SAAS8/D,EAAehmD,EAAOwD,GACR,IAAjBxD,EAAMvW,QAAsC,aAAtBuW,EAAM,GAAG9T,UACV,cAAtB8T,EAAM,GAAG9T,UAAkD,YAAtB8T,EAAM,GAAG9T,SAarB,IAAjB8T,EAAMvW,QAAoC,iBAAbuW,EAAM,IACjB,WAA3BA,EAAM,GAAGlP,eACI,MAAbkP,EAAM,IAA2B,MAAbA,EAAM,IAA2B,MAAbA,EAAM,IACxB,aAAtBA,EAAM,GAAG9T,UAAiD,YAAtB8T,EAAM,GAAG9T,WAC7CzD,IAAIC,MAAM,qBAAuBsX,GACjCwD,EAAIqa,YAAY7d,EAAM,IAAM,IAAI8lD,EAAiB9lD,EAAM,GAAG9Z,QAjBzC,MAAb8Z,EAAM,IAGc,MAAbA,EAAM,IAGO,MAAbA,EAAM,IALfvX,IAAIC,MAAM,qBAAuBsX,GACjCwD,EAAIqa,YAAY7d,EAAM,IAAM,IAAI4lD,EAAkB5lD,EAAM,KAQxDvX,IAAIG,KAAK,8CAAgDoX,GAa/D,SAASimD,EAAar+C,EAAOpE,GAC3B/a,IAAIC,MAAM,mBAAqBkf,EAAQ,yBACvC,IAAIs+C,EAAMxyC,EAAGjZ,UACb0rD,EAASv+C,EAAOs+C,GAChB1iD,EAAIyZ,SAAStuB,KAAKu3D,GAGpB,SAASC,EAAUnmD,EAAOwD,GACxB,IACI80C,EAEA4N,EAHAt+C,EA1NN,SAAkB5H,GAEhB,IADA,IAAI6H,EAAM,GACDlf,EAAI,EAAGA,EAAIqX,EAAMvW,OAAQd,IACR,iBAAbqX,EAAMrX,IAIjBqX,EAAMrX,GAAKq8D,EAAkBhlD,EAAMrX,IAC/BwyB,EAAMnb,EAAMrX,IACdkf,EAAIlf,GAAKk8D,EAAQ7kD,EAAMrX,GAAGuB,MAAM,IACvBg7D,EAAQllD,EAAMrX,KACvBF,IAAII,KAAKmX,EAAMrX,GAAK,+BACpBkf,EAAIlf,GAAK+qB,EAAGnO,SACH0/C,EAASjlD,EAAMrX,KACxBF,IAAII,KAAKmX,EAAMrX,GAAK,gCACpBkf,EAAIlf,GAAK+qB,EAAGlO,IAAI+/C,EAAevlD,EAAMrX,MAC5By8D,EAAiBplD,EAAMrX,KAChCF,IAAII,KAAKmX,EAAMrX,GAAK,wCAChBirB,EAASyxC,EAAUrlD,EAAMrX,KAC3Bkf,EAAIlf,GAAK+qB,EAAGlO,IAAIxF,EAAMrX,GAAKirB,EAASyxC,EAAUrlD,EAAMrX,KAClD28D,EAAUtlD,EAAMrX,MAElBF,IAAIK,MAAM,iBAAmBkX,EAAMrX,GAAK,gBACtC08D,EAAUrlD,EAAMrX,IAAM,0CACxBkf,EAAIlf,GAAKqX,EAAMrX,KAGjBkf,EAAIlf,GAAKqX,EAAMrX,IAvBfkf,EAAIlf,GAAKqX,EAAMrX,GA0BnB,OAAOkf,EA4LKu+C,CAAQpmD,GAKpB,IAHAvX,IAAIC,MAAM,UAAYkf,GAGf69C,EAAa,WAAY79C,IAC9Bs+C,EAAMT,EAAa,WAAY79C,GAC/Bnf,IAAIC,MAAM,QAAUw9D,EAAM,IAAMt+C,EAAMs+C,GAAO,OAASt+C,GAC/B,MAAnBA,EAAMs+C,EAAM,IACdz9D,IAAIG,KAAK,wCAA0Cs9D,IAGxC,KADb5N,EAAMqN,EAAmB/9C,EAAM1d,MAAMg8D,EAAM,GAAI,IAAK,MAElDz9D,IAAIK,MAAM,+BAAiCo9D,IAE3CD,EAAYr+C,EAAM1d,MAAMg8D,EAAM,EAAGA,EAAM,EAAI5N,GAAM90C,GAEjD0iD,EAAMT,EAAa,WAAY79C,GAC/B0wC,EAAMqN,EAAmB/9C,EAAM1d,MAAMg8D,EAAM,GAAI,IAAK,KACpDt+C,EAAM9Y,OAAOo3D,EAAK5N,EAAM,IAI5B,IADA7vD,IAAIC,MAAM,0BAA4Bkf,GAC/B69C,EAAa,SAAU79C,IAAQ,CACpC,IAAIy+C,EAAOZ,EAAa,SAAU79C,GACV,MAApBA,EAAMy+C,EAAO,IACf59D,IAAIG,KAAK,sCAAwCy9D,IAGtC,KADb/N,EAAMqN,EAAmB/9C,EAAM1d,MAAMm8D,EAAO,GAAI,IAAK,MAEnD59D,IAAIK,MAAM,+BAAiCu9D,IAE3CL,EAAcp+C,EAAM1d,MAAMm8D,EAAO,EAAGA,EAAO,EAAI/N,GAAM90C,GACrD6iD,EAAOZ,EAAa,SAAU79C,GAC9B0wC,EAAMqN,EAAmB/9C,EAAM1d,MAAMm8D,EAAO,GAAI,IAAK,KACrDz+C,EAAM9Y,OAAOu3D,EAAM/N,EAAM,IAG7B7vD,IAAIC,MAAM,sCAAwCkf,GAIpD,SAA4BA,EAAOnN,GACjC,IAAI6rD,EAAY,IAAIvqD,MAAM,GAC1BuqD,EAAU,IAAM,EAGhB,IAFA,IAAIC,EAAMD,EAAU3yD,OAAO+xD,EAAe,IAAK99C,IAC3C4+C,EAAO,GACF79D,EAAI,EAAGA,EAAI49D,EAAI98D,OAAS,EAAGd,IAClC69D,EAAK79D,GAAKif,EAAM1d,MAAMq8D,EAAI59D,GAAK,EAAG49D,EAAI59D,EAAI,IAG5C,IAAKA,KAAK69D,EAAM,CACd/9D,IAAII,KAAK,SAAWF,EAAI,MAAQ69D,EAAK79D,IACrC,IAAI+X,EAAO8lD,EAAK79D,GAAG,GACnB69D,EAAK79D,GAAGmG,OAAO,EAAG,GAClB,IAAI23D,EAAMH,EAAU3yD,OAAO+xD,EAAe,IAAKc,EAAK79D,KACpD89D,EAAI93D,KAAK63D,EAAK79D,GAAGc,QAEjB,IADA,IAAIi9D,EAAQ,GACH1zD,EAAI,EAAGA,EAAIyzD,EAAIh9D,OAAS,EAAGuJ,IAClC0zD,EAAM1zD,GAAKwzD,EAAK79D,GAAGuB,MAAMu8D,EAAIzzD,GAAK,EAAGyzD,EAAIzzD,EAAI,IAE/C,IAAKrK,KAAK+9D,EAAO,CACfj+D,IAAII,KAAK,OAASF,EAAI,MAAQ69D,EAAK79D,IACnC,IAAIgY,EAAO+lD,EAAM/9D,GAAG,GACpB+9D,EAAM/9D,GAAGmG,OAAO,EAAG,GACnB,IAAI63D,EAAML,EAAU3yD,OAAO+xD,EAAe,IAAKgB,EAAM/9D,KACrDg+D,EAAIh4D,KAAK+3D,EAAM/9D,GAAGc,QAClB,IAAIm9D,EAAQ,GACZ,IAAK5zD,EAAI,EAAGA,EAAI2zD,EAAIl9D,OAAS,EAAGuJ,IAC9B4zD,EAAM5zD,GAAK0zD,EAAM/9D,GAAGuB,MAAMy8D,EAAI3zD,GAAK,EAAG2zD,EAAI3zD,EAAI,IAEhD,IAAKrK,KAAKi+D,EAAO,CACf,IAAI3/D,EAAM2/D,EAAMj+D,GAAG,GACnBF,IAAII,KAAK,QAAU6X,EAAO,SAAWC,EAAO,QAAU1Z,GACtDwT,EAAQoD,IAAI6C,EAAMC,EAAM1Z,MAnC9B4/D,CAAkBj/C,EAAOpE,GA0C3B/a,IAAII,KAAK,mBAAqB67D,GAC9B,IAAIj5D,EAAI,IAAI8X,IACRujD,EA5QJ,SAAmB35D,GACjB,IAAI45D,EA1IN,SAASC,EAAe75D,GAEtB,IAAI85D,GAA6B,IAAtB95D,EAAIlD,QAAQ,KACnB,KACAkD,EAAIlD,QAAQ,KACZi9D,GAA8B,IAAtB/5D,EAAIlD,QAAQ,KACpB,KACAkD,EAAIlD,QAAQ,KAEhB,IAAKg9D,IAAQC,EAAM,CACjB,IAAIz1D,EAAI,IAAIsK,MAAM,GAElB,OADAtK,EAAE,GAAKtE,EACAsE,EAET,IACIyrB,EACAT,EAFA5U,EAAM,IAAI9L,MAAM,GAGpB,IAAKkrD,GAAQC,GAAQA,EAAOD,EAC1B/pC,EAAK,IACLT,EAAMyqC,MACD,IAAKA,KAASD,GAAOA,EAAMC,GAKhC,OADAz+D,IAAIK,MAAM,sBACH+e,EAJPqV,EAAK,IACLT,EAAMwqC,EAKRp/C,EAAI,GAAK1a,EAAIjD,MAAM,EAAGuyB,GACtB,IAMI0qC,EANA7O,EAAMnrD,EAAIjD,MAAMuyB,EAAM,GAAGxyB,QAAQizB,GACrC,OAAa,IAATo7B,GACF7vD,IAAIK,MAAM,4DAA8DqE,GACjEA,IAILA,EAAIjD,MAAMouD,EAAM77B,EAAM,GAAGvxB,MAAM,UACjCi8D,EAAOh6D,EAAIjD,MAAMouD,EAAM77B,EAAM,GAAGxyB,QAAQ,KAExC4d,EAAI,GAAK6L,EAAGlb,QACVrL,EAAIjD,MAAMuyB,EAAM,EAAGA,EAAM,EAAI67B,GAC7B5kC,EAAGlO,IAAI+/C,EACLp4D,EAAIjD,MAAMuyB,EAAM,EAAI67B,EAAK77B,EAAM,EAAI67B,EAAM6O,MAI7Ct/C,EAAMA,EAAIlU,OAAOqzD,EAAc75D,EAAIjD,MAAMouD,EAAM77B,EAAM,EAAI0qC,MAChDh6D,EAAIjD,MAAMouD,EAAM77B,EAAM,GAAGvxB,MAAM,OACxCi8D,EAAOh6D,EAAIjD,MAAMouD,EAAM77B,EAAM,GAAGxyB,QAAQ,KAExC4d,EAAI,GAAK6L,EAAGlb,QACVrL,EAAIjD,MAAMuyB,EAAM,EAAGA,EAAM,EAAI67B,GAC7BnrD,EAAIjD,MAAMuyB,EAAM,EAAI67B,EAAK77B,EAAM,EAAI67B,EAAM6O,GAAO,MAGlDt/C,EAAMA,EAAIlU,OACRqzD,EAAc75D,EAAIjD,MAAMouD,EAAM77B,EAAM,EAAI0qC,OAG1Ct/C,EAAI,GAAK6L,EAAGlb,QAAQrL,EAAIjD,MAAMuyB,EAAM,EAAGA,EAAM,EAAI67B,IACjD7vD,IAAII,KAAK,kBAAoBgf,EAAI,IACjCA,EAAMA,EAAIlU,OAAOqzD,EAAc75D,EAAIjD,MAAMouD,EAAM77B,EAAM,MAEhD5U,GA4EMm/C,CAAc75D,GACvBi6D,EAAS,GACb,IAAK,IAAIz+D,KAAKo+D,EAEVK,EADuB,iBAAdL,EAAOp+D,GACPy+D,EAAOzzD,OAAO6xD,EAAauB,EAAOp+D,KAElCy+D,EAAOzzD,OAAOozD,EAAOp+D,IAKlC,OAFAy+D,EA5DF,SAA0BpnD,GAExB,IADA,IAAIqnD,EAASrnD,EACJrX,EAAI,EAAGA,EAAI0+D,EAAO59D,OAAQd,IAIjC,GAHkB,MAAd0+D,EAAO1+D,KACT0+D,EAAO1+D,GAAK,qDAEI,OAAd0+D,EAAO1+D,IAAiC,OAAlB0+D,EAAO1+D,EAAI,GAAa,CAChD0+D,EAAOv4D,OAAOnG,EAAG,GACjB0+D,EAAOv4D,OAAOnG,EAAI,EAAG,GACrB,IAAI3B,EAAIqgE,EAAO1+D,EAAI,GACnB0+D,EAAO1+D,EAAI,GAAK0+D,EAAO1+D,EAAI,GAC3B0+D,EAAO1+D,EAAI,GAAK3B,EAGpB,OAAOqgE,EA8CEC,CAAgBF,GACzB3+D,IAAII,KAAK,kBAAoBu+D,GACtBA,EAgQAvxC,CAAS6uC,GACd9wC,EApNJ,SAAgC5T,GAC9B,IAAIunD,EAAU7B,EAAe,SAAU1lD,GACnC6H,EAAM,GACV,IAAK,IAAI5iB,KAAKsiE,EAAS,CACrB,IAAI91D,EAAIuO,EAAMunD,EAAQtiE,GAAK,GACvByM,EAAIsO,EAAMunD,EAAQtiE,GAAK,GAC3B,GAAKkgE,EAAS1zD,GAEP,GAAKwzD,EAASvzD,GAEd,CACLjJ,IAAII,KAAK,iBAAmB4I,EAAI,OAASC,GACzC,IAAIkD,EAAOywD,EAAU5zD,GACjB+1D,EAASjC,EAAe7zD,GAC5BmW,EAAIjT,GAAQ4yD,OALZ/+D,IAAIK,MAAM,0BAA4B4I,QAFtCjJ,IAAIK,MAAM,0BAA4B2I,GAU1C,OAAOoW,EAmMM4/C,CAAsBX,GAChClzC,EAAStd,MACZsd,EAAStd,IAAM,+CAEZsd,EAAS6Q,OACZ7Q,EAAS6Q,KAAO,yCAElB,IAAIijC,EAAYjC,EAAa,SAAUqB,GACnCa,EAAWlC,EAAa,QAASqB,GACrC,GAAIY,EAAY,GAAKC,EAAW,GAAKD,EAAYC,EAE/C,OADAl/D,IAAIK,MAAM,iEACH,EAMT,GAnPA,SAAkBkX,EAAOsD,GAEvB,IAAK,IAAI3a,KADTF,IAAII,KAAK,gBAAkBmX,GACbA,EACZ,GAAImb,EAAMnb,EAAMrX,IAAK,CACnBF,IAAII,KAAK,SAAWmX,EAAMrX,GAAK,mCAC/B,IAAIsT,EAAI4oD,EAAQ7kD,EAAMrX,GAAGuB,MAAM,IAC/BoZ,EAAMsX,KAAKjsB,KAAKsN,GAChBA,EAAE2rD,MAAQ5nD,EAAMrX,GAAGuB,MAAM,QAEzBzB,IAAIG,KAAK,wCAA0CoX,EAAMrX,IAsO/Dk/D,CAAQf,EAAG58D,MAAMw9D,EAAY,EAAGC,GAAWl8D,GAE3C06D,EAASW,EAAG58D,MAAMy9D,EAAW,EAAGb,EAAGr9D,OAAS,GAAIgC,EAAE+X,KAE9CmhD,EACF,OAAOl5D,EAGT,IAAK,IAAI9C,KAAK8C,EAAE+X,IAAI9M,WAAY,CAC9B,IAAIlD,EAAK/H,EAAE+X,IAAI9M,WAAW/N,GACE,cAAxB6K,EAAGC,QAAQvH,UACTwnB,EAAG/P,SACL+P,EAAG/P,QAAQooB,YAAYv4B,EAAGC,QAAS,UAAYD,EAAGC,SAG3B,cAAvBD,EAAG7M,OAAOuF,UACRwnB,EAAG/P,SACL+P,EAAG/P,QAAQooB,YAAYv4B,EAAG7M,OAAQ,UAAY6M,EAAG7M,QAKvD,OAAO8E,E,2lCCzdYq8D,E,WAiBnB,WAAa57C,GAEX,GAFmC,2IACnCA,EAAQA,GAAS,IAAI7K,KACX0mD,QACR,MAAM,IAAI96D,MAAM,wDAEZif,EAA+BvI,UAClCuI,EAA+BvI,QAAU,IAAIyjB,IAAQlb,IAExD9e,KAAK8e,MAAQA,EACbA,EAAM67C,QAAU36D,KAChBA,KAAK46D,KAAO,GACZ56D,KAAK66D,IAAM,GACX76D,KAAK9G,GAAK,GACV8G,KAAK9G,GAAGg+B,KAAOxuB,YAAU,oCACzB1I,KAAK9G,GAAGi+B,KAAOzuB,YAAU,oCACzB1I,KAAK9G,GAAGk+B,MAAQ1uB,YAAU,qCAC1B1I,KAAK9G,GAAGq+B,IAAM7uB,YAAU,6BACxB1I,KAAK9G,GAAGgQ,IAAMR,YAAU,+CACxB1I,KAAK9G,GAAGm+B,KAAO3uB,YAAU,yCACzB1I,KAAK9G,GAAGgQ,IAAMR,YAAU,+CACxB1I,KAAK9G,GAAGgV,IAAMxF,YAAU,kCAExB1I,KAAK86D,aAAe,G,2CAGtB,SAAiBriD,GAIf,OAHKzY,KAAK86D,aAAariD,EAAI3f,SACzBkH,KAAK86D,aAAariD,EAAI3f,OAAS,IAE1BkH,KAAK86D,aAAariD,EAAI3f,S,uBAG/B,SAAU8D,GACR,MAA2B,SAAnBA,EAAIE,MAAM,EAAE,K,sBAetB,SAAUF,EAAyB0pB,GACjC,IAAK1pB,EACH,OAAO,EAOT,GALK0pB,IACHA,EAAKtmB,KAAK8e,OAEZliB,EAAM+C,YAAU/C,IAEVoD,KAAK+6D,UAAUn+D,IACf0pB,EAAGnP,MACHnX,KAAK8e,MAAM1V,WAAWP,UAAUjM,GAChCoD,KAAK8e,MAAM1V,WAAWP,UAAU,mDAChC7I,KAAK8e,MAAM1V,WAAWP,UAAU,4DAClC,MAAO,YASX,IALA,IAAI+2B,EAIA1D,EAHA8+B,GAAa,EAEbt7B,EAAWpZ,EAAGqZ,UAAKn5B,EAAWxG,KAAK9G,GAAGg+B,KAAK,gBAAiBv6B,kBAAQC,IAE/DjE,EAAI,EAAGA,EAAI+mC,EAASrjC,OAAQ1D,IAEnC,QAAgB6N,KADhBo5B,EAAUF,EAAS/mC,IACQ,CACzB,IAAI8+B,EAAWnR,EAAG7S,IAAImsB,EAAS5/B,KAAK9G,GAAGg+B,KAAK,aAC5C,QAAgB1wB,IAAZo5B,EAAuB,CACzB,IAAIq7B,EAAW30C,EAAGuZ,SAASpI,EAAUz3B,KAAK9G,GAAGk+B,MAAM,cACnD,GAAI6jC,EAAU,WACIA,EAASh7D,MAAM,MADnB,IACZ,2BAAqC,KAC/Bi7D,EAD+B,QACtBj7D,MAAM,KACnB,GAAIi7D,EAAG,GAAGp7D,SAAS,UAAYo7D,EAAG,GAAGp7D,SAAS,WAAao7D,EAAG,GAAGp7D,SAAS,UAExE,OAAO,GALC,+BASd,IAAIq7D,EAAc70C,EAAGqZ,KAAKlI,EAAUz3B,KAAK9G,GAAGk+B,MAAM,iBAClD,GAAI+jC,EAAY9+D,OACd,IAAK,IAAIxE,EAAI,EAAGA,EAAIsjE,EAAY9+D,OAAQxE,IAAK,CAE3C,IADAqkC,EAASi/B,EAAYtjE,GAAGiB,MAAMgI,QACnBjE,QAAQ,8BAAgC,EAAG,MAAO,SAC7D,GAAIq/B,EAAOr/B,QAAQ,2CAA6C,EAAG,MAAO,SAG9E,IAAIu+D,EAAY90C,EAAGqZ,KAAKlI,EAAUz3B,KAAK9G,GAAGk+B,MAAM,kBAChD,GAAIgkC,EAAU/+D,OACZ,IAAK,IAAIxE,EAAI,EAAGA,EAAIujE,EAAU/+D,OAAQxE,IAAK,CAEzC,IADAqkC,EAASk/B,EAAUvjE,GAAGiB,MAAMgI,QACjBjE,QAAQ,WAAa,EAC9B,MAAO,SAET,GAAIq/B,EAAOr/B,QAAQ,QAAU,EAC3B,MAAO,MAKb,IAAMmD,KAAK+6D,UAAUn+D,GACnB,QAAKq+D,GACO,YAGd,IAAIl+B,EAASzW,EAAGqZ,KAAKlI,EAAUz3B,KAAK9G,GAAGi+B,KAAK,WAC5C,GAAI4F,EAAO1gC,OACT,IAAK,IAAIxE,EAAI,EAAGA,EAAIklC,EAAO1gC,OAAQxE,IAEf,MAAdklC,EAAOllC,IAA4B,MAAdklC,EAAOllC,KAC9BmjE,GAAa,IAUzB,GAAwB,IAApBt7B,EAASrjC,aAGX,GAAI2+D,EACF,OAAO,I,uBAOb,SAAWnhE,GACT,MAAoC,OAA5BA,EAAIyO,OAAOiU,OAAO,EAAG,IAAevc,KAAKq7D,UAAUxhE,GACvD,IAAMA,EAAIyO,OAAOiU,OAAO,GACxB1iB,EAAIyO,S,yBAGV,SAAagzD,GACX,OAAOt7D,KAAKu7D,UAAUD,EAAKj1D,SAAW,IACpCrG,KAAKu7D,UAAUD,EAAKh1D,WAAa,IACjCtG,KAAKu7D,UAAUD,EAAK/hE,QAAU,O,6BAOlC,SAAiB6M,GACf,MAAO,CAACA,EAAGC,QAASD,EAAGE,UAAWF,EAAG7M,QAAQmZ,QAAO,SAAUnX,GAC5D,OAAO6D,YAAY7D,Q,kCAQvB,SAAsBwa,GAEpB,IADA,IAAIqT,EAAsB,GACjBvxB,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAC9BuxB,EAASA,EAAO7iB,OAAOvG,KAAKw7D,gBAAgBzlD,EAAIle,KAElDuxB,EAAOhlB,OAEP,IADA,IAAIq3D,EAAuB,GAClBhkD,EAAI,EAAGA,EAAI2R,EAAO/sB,OAAQob,IACvB,IAANA,GAAY2R,EAAO3R,GAAGpQ,OAAO+hB,EAAO3R,EAAI,KAC1CgkD,EAAQl6D,KAAK6nB,EAAO3R,IAGxB,OAAOgkD,I,uBAOT,WACEz7D,KAAK46D,KAAO,GAGZ,IAFA,IAAIv2D,EAAIrE,KAAK8e,MAAM6gB,UAAKn5B,EAAWxG,KAAK9G,GAAGgQ,IAAI,QAC7ClJ,KAAK9G,GAAGgV,IAAI,8BACLrW,EAAI,EAAGA,EAAIwM,EAAEhI,OAAQxE,IAC5BmI,KAAK46D,KAAKv2D,EAAExM,GAAGiB,QAAS,EAE1BkH,KAAK66D,IAAM,GACXx2D,EAAIrE,KAAK8e,MAAM6gB,UAAKn5B,EAAWxG,KAAK9G,GAAGgQ,IAAI,QAASlJ,KAAK9G,GAAGgV,IAAI,uBAChE,IAAK,IAAIrW,EAAI,EAAGA,EAAIwM,EAAEhI,OAAQxE,IAC5BmI,KAAK66D,IAAIx2D,EAAExM,GAAGiB,QAAS,I,2BAQ3B,SAAeyC,EAAGyI,EAAQ03D,GAOxB,IAHA,IACI91D,EACA6U,EAFA1E,EAAM/V,KAAK8e,MAAM5Y,wBAAmBM,OAAWA,EAAWjL,EAAGyI,GAGxDnM,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAC9B,GAAImI,KAAK66D,IAAI9kD,EAAIle,GAAGyO,UAAUxN,OAAQ,CAEpC,KADA8M,EAAImQ,EAAIle,GAAGwO,SACJs1D,QACL,MAAO,CAAE5lD,EAAIle,IAEf,GAAI6jE,IACFjhD,EAAMza,KAAK47D,cAAch2D,EAAG5B,EAAQ03D,EAAQ,IAE1C,OAAOjhD,EAAIlU,OAAO,CAAEwP,EAAIle,KAMhCke,EAAM/V,KAAK8e,MAAM5Y,mBAAmB3K,OAAGiL,OAAWA,EAAWxC,GAC7D,IAAK,IAAInM,EAAI,EAAGA,EAAIke,EAAI1Z,OAAQxE,IAC9B,GAAImI,KAAK46D,KAAK7kD,EAAIle,GAAGyO,UAAUxN,OAAQ,CAErC,KADA8M,EAAImQ,EAAIle,GAAG0B,QACJoiE,QACL,MAAO,CAAE5lD,EAAIle,IAEf,GAAI6jE,IACFjhD,EAAMza,KAAK47D,cAAch2D,EAAG5B,EAAQ03D,EAAQ,IAE1C,OAAOjhD,EAAIlU,OAAO,CAAEwP,EAAIle,KAKhC,OAAO,O,2BAOT,SAAe0D,EAAGyI,GAGhB,IAAK,IAAI03D,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACtC,IAAIG,EAAM77D,KAAK47D,cAAcrgE,EAAGyI,EAAQ03D,GACxC,GAAY,OAARG,EAAc,OAAOA,EAG3B,OAAO77D,KAAK8e,MAAMg9C,oBAAoBvgE,EAAGyI,K,uBAO3C,SAAWzI,GACT,OAAqE,IAA9DyE,KAAK8e,MAAM5Y,mBAAmB3K,EAAG,KAAM,KAAM,MAAMc,QACN,IAAlD2D,KAAK8e,MAAM5Y,mBAAmB,KAAM3K,GAAGc,QACiB,IAAxD2D,KAAK8e,MAAM5Y,mBAAmB,KAAM,KAAM3K,GAAGc,S,0BAMjD,SAAc+sB,EAAQ3Q,GACpB,IAAIwQ,EAAU,GACd,GAAIG,EAAO/sB,OAAQ,CACjB2D,KAAK+7D,YACL,IAAK,IAAIlkE,EAAI,EAAGA,EAAIuxB,EAAO/sB,OAAQxE,IAAK,CACtC,IAAIsgB,EAAQiR,EAAOvxB,GACdmI,KAAKq7D,UAAUljD,KACpB8Q,EAAUA,EAAQ1iB,OAAOvG,KAAKg8D,cAAc7jD,EAAOM,MAGvD,OAAOwQ,I,8BAOT,SAAkB7iB,GAChB,IAAIgjB,EAASppB,KAAKw7D,gBAAgBp1D,GAClC,OAAOpG,KAAKi8D,aAAa7yC,EAAQhjB,EAAGyE,S,0BAMtC,SAAcoe,GACZ,IAAI0xC,EAAU36D,KACd,OAASipB,GAA8B,IAAnBA,EAAQ5sB,OAExB,WACF4sB,EAAQ9iB,KAAI,SAAU5K,GACpB,OAAOo/D,EAAQuB,YAAY3gE,MAC1B6B,KAAK,MAAQ,OAJd,K,kBAUN,SACER,EACAsZ,EACAimD,GACe,WACf,OAAO1iC,QAAQ1G,UACZ+I,MAAK,WACJ,IAAKl/B,EACH,MAAM,IAAIiD,MAAM,8CAAgDqW,GAIlE,IAAI1T,EAAU,CACZy1B,QAAQ,EACR9wB,YAAa,4BACbJ,KAAMmP,GAGR,OAAO,EAAK4I,MAAMvI,QAAQwoB,aAAa,QAASniC,EAAK4F,MAEtDs5B,MAAK,SAAArE,GACJ,IAAKA,EAASrH,GAAI,CAChB,IAAIxV,EAAU,qCAAuChe,EAAM,YACzD66B,EAASsF,OAAS,KAAOtF,EAASuF,WAClC,mBAAqB9mB,EAEvB,MAAM,IAAIrW,MAAM+a,GAKlBuhD,EAAiBv/D,EAAK66B,EAASrH,GAAIqH,EAASE,aAAwBF,MAErEuH,OAAM,SAAAhH,GACLmkC,EAAiBv/D,GAAK,EAAOo7B,EAAIpd,QAASod,Q,8BAYhD,SAAkB1W,GAChB,IAAIA,GAAcA,EAAUzW,MAA5B,CAGA,IAAI8vD,EAAU36D,KACVipB,EAAUjpB,KAAKo8D,iBAAiB96C,GAEpC,MAAO,CACLA,UAAWA,EAAY,CAACA,EAAUjb,QAASib,EAAUhb,UAAWgb,EAAU/nB,OAAQ+nB,EAAUzW,YAASrE,EACrG61D,YAAa/6C,EAAYthB,KAAKk8D,YAAY56C,QAAa9a,EACvDyP,MAAO0kD,EAAQ2B,aAAarzC,GAE5BszC,WAAY,SAAU1iE,EAAKsiE,GACzB,IAAIjmD,EAAQlW,KAAKiW,MACjBC,GAAS,iBAAmBlW,KAAKq8D,YAAc,SAC/CnmD,GAAS,iBAEPlW,KAAKu7D,UAAUv7D,KAAKshB,UAAU,IAAM,IAEpCthB,KAAKu7D,UAAUv7D,KAAKshB,UAAU,IAAM,IAEpCthB,KAAKu7D,UAAU1hE,GANR,UAQT8gE,EAAQ6B,KAAMx8D,KAAKshB,UAAsE,GAAGxoB,MAAOod,EAAOimD,Q,8BAKhH,SAAkB/1D,EAAU+1D,GAC1B,IAAIM,EAAMr2D,aAAcuI,MAAQvI,EAAG,GAAKA,EACpC8P,EAAQlW,KAAKs8D,aAAat8D,KAAKo8D,iBAAiBK,IAEpD,GAAIr2D,aAAcuI,MAAO,CAEvB,IADA,IAAI+tD,EAAS,GACJ7kE,EAAI,EAAGA,EAAIuO,EAAG/J,OAAQxE,IAAK6kE,GAAUt2D,EAAGvO,GAAK,KACtDqe,GAAS,iBAAmBwmD,EAAS,YAErCxmD,GAAS,iBACPlW,KAAKu7D,UAAUn1D,EAAGC,SAAW,IAC7BrG,KAAKu7D,UAAUn1D,EAAGE,WAAa,IAC/BtG,KAAKu7D,UAAUn1D,EAAG7M,QAHX,UAMXyG,KAAKw8D,KAAKC,EAAI5xD,MAAM/R,MAAOod,EAAOimD,K,8BAGpC,SAAkB/1D,EAAmB+1D,GACnC,IAAIM,EAAMr2D,aAAcuI,MAAQvI,EAAG,GAAKA,EACpC8P,EAAQlW,KAAKs8D,aAAat8D,KAAKo8D,iBAAiBK,IAEpD,GAAIr2D,aAAcuI,MAAO,CAEvB,IADA,IAAI+tD,EAAS,GACJ7kE,EAAI,EAAGA,EAAIuO,EAAG/J,OAAQxE,IAAK6kE,GAAUt2D,EAAGvO,GAAK,KACtDqe,GAAS,iBAAmBwmD,EAAS,YAErCxmD,GAAS,iBACPlW,KAAKu7D,UAAUn1D,EAAGC,SAAW,IAC7BrG,KAAKu7D,UAAUn1D,EAAGE,WAAa,IAC/BtG,KAAKu7D,UAAUn1D,EAAG7M,QAHX,UAMXyG,KAAKw8D,KAAKC,EAAI5xD,MAAM/R,MAAOod,EAAOimD,K,qCAcpC,SAAyB1jD,EAAgBH,GACvC,IAAIqkD,EAAU38D,KAAK48D,gBAAgBnkD,GACnC,GAAKkkD,EAAQE,gBAGX,GAAIF,EAAQG,kBACV,GAAI,GAAKH,EAAQG,kBAAqB,GAAKxkD,EACzC,MAAM,IAAIzY,MAAM,wDAGlB88D,EAAQG,iBAAmBxkD,OAP7BA,EAAOG,K,gCAgBX,SAAoBA,GACJzY,KAAK48D,gBAAgBnkD,GAC3BskD,cAAgB,I,2BAG1B,SAAetkD,GACb,IAAIukD,EAAch9D,KAAK8e,MAAMvI,QAAQ6pB,UAAU3nB,EAAK,eACpD,OAAKukD,GAAgBA,EAAY3gE,OAC1B2gE,EAAY,GAAGl8D,OAD0B,O,yCAIlD,SAA6B2X,EAAgBwkD,GAAgB,WACvDN,EAAU38D,KAAK48D,gBAAgBnkD,GAC9BkkD,EAAQO,4BAA6BP,EAAQO,0BAA4B,IAC9EP,EAAQO,0BAA0B37D,KAAK07D,GACvCj9D,KAAKm9D,kBAAkB1kD,GAAK,SAACA,GAC3B,EAAK2kD,cAAc3kD,Q,2BAIvB,SAAeA,GACb,IAAIkkD,EAAU38D,KAAK48D,gBAAgBnkD,GAC/BkiD,EAAU36D,KAEd,GAAI28D,EAAQU,UAEVV,EAAQW,WAAY,MAFtB,CAKAX,EAAQU,WAAY,EACpB,IAAIE,EAAe,KACH,SAAZC,IAEF7C,EAAQ8C,OAAO9C,EAAQ77C,MAAOrG,GAAK,SAAU2X,EAAIxV,EAAS6c,GACxD,GAAIrH,EAAI,CACN,GAAIusC,EAAQO,0BACV,IAAK,IAAIrlE,EAAI,EAAGA,EAAI8kE,EAAQO,0BAA0B7gE,OAAQxE,IAE5D8kE,EAAQO,0BAA0BrlE,KAGtC8kE,EAAQU,WAAY,EAChBV,EAAQW,YAEVX,EAAQW,WAAY,EACpBE,UAGFb,EAAQU,WAAY,EACkB,IAAjC5lC,EAAsBsF,SAGzB4/B,EAAQU,WAAY,EACpBE,GAA8B,EAC9BtsC,WAAWusC,EAAWD,OAQ9BC,M,+BAoBF,SAAmB/kD,EAAgB8nB,GACjC,IAAIm9B,EAAS19D,KAAK29D,cAAcllD,GAE5BmlD,EAAar9B,EACb1kC,EAAOmE,KACP26D,EAAU36D,KACVu9D,EAAe,KACfM,EAAU,EAEd,IAAKH,EAEH,OAAO,EAIT,IAAMI,GADNJ,EAASK,eAAQL,EAAQjlD,EAAI3f,QACFiF,QAAQ,SAAU,OAAOA,QAAQ,UAAW,QAuEvE,OApEoB,SAAhBigE,IAEF,IAAIC,EACJ,GAAyB,oBAAdC,UACTD,EAAS,IAAIC,UAAUJ,OAClB,IAAsB,oBAAXtmE,SAA0BA,OAAO0mE,UAIjD,OAHAD,EAAUzmE,OAAe0mE,UAAUJ,GAKrCG,EAAOE,OAAS,WAEdZ,EAAe,KACfv9D,KAAKq0C,KAAK,OAAS57B,EAAI3f,OACnB+kE,GAEFlD,EAAQyD,wBAAwB3lD,EAAKmlD,IAGzC,IAAIjB,EAAU9gE,EAAK+gE,gBAAgBnkD,GACnCkkD,EAAQI,cAAgB,EAExBkB,EAAOvtB,QAAU,SAAkB1Y,KAiBnCimC,EAAOI,QAAU,SAAUtgB,GAGzBwf,GAAgB,EAChBM,GAAW,EAEX5sC,YAAW,WAET+sC,MACCT,IAELU,EAAOK,UAAY,SAAU1iE,GAC3B,GAAIA,EAAIyN,MAAiC,QAAzBzN,EAAIyN,KAAKvM,MAAM,EAAG,GAAc,CAC9C,GAAI,kBAAmB6/D,IACrBA,EAAQI,eAAiB,EACrBJ,EAAQI,eAAiB,GAE3B,OAIJJ,EAAQI,cAAgB,EACxBlhE,EAAKuiE,wBAAwB3lD,EAAKmlD,KAIxCI,IAEO,I,wBAYT,SACEO,GAEiB,IADjBC,EACiB,uDADsB,GAEjCtL,EAAOqL,EAAUh4D,OAAOi4D,GAAYr4D,KAAI,SAAAC,GAAE,OAAIA,EAAGkB,OACjDm3D,EAAcz+D,KACd0+D,EAA+B,GACrCxL,EAAKxwD,SAAQ,SAAA+V,GACJimD,EAAW18B,MAAK,SAAA28B,GAAS,OAAIA,EAAUt3D,OAAOoR,OAAOimD,EAAWn9D,KAAKkX,MAE9E,IAAMmmD,EAAUF,EAAWv4D,KAAI,SAAAsS,GAAG,OAChCgmD,EAAYI,OAAON,EAAU7rD,QAAO,SAAAtM,GAAE,OAAIA,EAAGkB,IAAID,OAAOoR,MACtD+lD,EAAW9rD,QAAO,SAAAtM,GAAE,OAAIA,EAAGkB,IAAID,OAAOoR,UAI1C,OAHImmD,EAAQviE,OAAS,GACnBK,QAAQrB,IAAR,2BAAgCujE,EAAQviE,OAAxC,aAAmDqiE,IAE9CjlC,QAAQwB,IAAI2jC,K,oBAYrB,SACIL,EACAC,EACAz8D,EAMA+8D,GACoB,WACtB,IAAK/8D,EAAU,CACb,IAAI08D,EAAcz+D,KAClB,OAAO,IAAIy5B,SAAQ,SAAU1G,EAAS2G,GACpC+kC,EAAYI,OAAON,EAAWC,GAAY,SAAU5hE,EAAKwzB,EAAI2uC,GACtD3uC,EAGH2C,IAFA2G,EAAO,IAAI75B,MAAMk/D,UAQzB,IACE,IAAIz4C,EAAKtmB,KAAK8e,MACVtJ,EAAM+oD,EACN5/D,YAAQ4/D,GAAaA,EAAUj1D,WAC7Bi1D,aAAqB5vD,MAAQ4vD,EAAY,CAAEA,GAF3B,GAGlBS,EAAMR,EACN7/D,YAAQ6/D,GAAcA,EAAWl1D,WAC/Bk1D,aAAsB7vD,MAAQ6vD,EAAa,CAAEA,GAF5B,GAGvB,KAAMhpD,aAAc7G,OAClB,MAAM,IAAI9O,MAAM,cAAgB,IAAQ2V,GAAM,KAAOA,GAEvD,KAAMwpD,aAAcrwD,OAClB,MAAM,IAAI9O,MAAM,cAAgB,IAAQm/D,GAAM,KAAOA,GAEvD,GAAkB,IAAdxpD,EAAGnZ,QAA8B,IAAd2iE,EAAG3iE,OACxB,OAAO0F,EAAS,MAAM,GAExB,IAAI0W,EAAMjD,EAAGnZ,OAASmZ,EAAG,GAAG3K,MAAQm0D,EAAG,GAAGn0D,MAC1C,IAAK4N,EAAK,CACR,IAAImC,EAAU,sEAAwEpF,EAAG,GAAK,KAAOwpD,EAAG,GAExG,MAAM,IAAIn/D,MAAM+a,GAElB,IAAI+hD,EAAU38D,KAAK48D,gBAAgBnkD,GAC/BwmD,EAAYn6D,KAAKD,MAEjBzI,EAAQ,CAAC,UAAW,YAAa,SAAU,OAE3Cs5C,EAAU,CAAE,OAAUlgC,EAAI,OAAUwpD,GAD5B,CAAC,SAAU,UAEjB74D,KAAI,SAAUqd,GAClBkyB,EAAQlyB,GAAMrd,KAAI,SAAUC,GAC1B,IAAKqS,EAAIpR,OAAOjB,EAAGyE,OACjB,MAAM,IAAIhL,MAAM,uBAAyB4Y,EACvC,kCAAoCrS,EAAGyE,OAE3CzO,EAAM+J,KAAI,SAAUic,GAClB,QAAwB,IAAbhc,EAAGgc,GACZ,MAAM,IAAIviB,MAAM,qBAAuBuiB,EAAO,2BAMtD,IAAIpkB,EAAWgC,KAAKk/D,SAASzmD,EAAI3f,MAAOwtB,GACxC,IAAiB,IAAbtoB,EACF,MAAM,IAAI6B,MAAM,4CAA+C4Y,GAEjE,QAAiBjS,IAAbxI,EAAwB,CAC1B,GAAI8gE,EACF,MAAM,IAAIj/D,MAAM,kBAAoB4Y,EAAM,+DAY5C,YATCzY,KAAK8e,MAAMvI,QAAQ2kB,KAAKziB,GAA2BqjB,MAAK,SAAArE,GACvD,EAAKonC,OAAON,EAAWC,EAAYz8D,GAAU,MAC5C,SAAAi2B,GACC,GAA4B,MAAxBA,EAAIP,SAASsF,OAGf,MAAM,IAAIl9B,MAAJ,gDAAmD4Y,EAAnD,6BAA2Euf,IAFjF,EAAK6mC,OAAON,EAAWC,EAAYz8D,GAAU,MAM9C,GAAK/D,EAAoBnB,QAAQ,WAAa,EAAG,CACtD,IAAIusB,EAAsB,GACtB5T,EAAGnZ,SAAQ+sB,EAASppB,KAAKm/D,qBAAqB3pD,IAC9CwpD,EAAG3iE,SAAQ+sB,EAASA,EAAO7iB,OAAOvG,KAAKm/D,qBAAqBH,KAChE,IAAI/1C,EAAUjpB,KAAKi8D,aAAa7yC,EAAQ3Q,GACpC2mD,EAAcp/D,KAAKs8D,aAAarzC,GAChC/S,EAAQ,GACZ,GAAIkpD,EAAY/iE,OAAQ,CACtB,GAAImZ,EAAGnZ,OAAQ,CACb6Z,GAAS,YACT,IAAK,IAAIre,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7Bqe,GAASlW,KAAKk8D,YAAY1mD,EAAG3d,IAAM,KAErCqe,GAAS,OAEX,GAAI8oD,EAAG3iE,OAAQ,CACb6Z,GAAS,YACT,IAAK,IAAIre,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7Bqe,GAASlW,KAAKk8D,YAAY8C,EAAGnnE,IAAM,KAErCqe,GAAS,OAEXA,GAASkpD,MACJ,CACL,GAAI5pD,EAAGnZ,OAAQ,CACb6Z,GAAS,iBACT,IAAK,IAAIre,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7Bqe,GAASlW,KAAKk8D,YAAY1mD,EAAG3d,IAAM,KAErCqe,GAAS,QAEX,GAAI8oD,EAAG3iE,OAAQ,CACTmZ,EAAGnZ,SAAQ6Z,GAAS,OACxBA,GAAS,iBACT,IAAK,IAAIre,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7Bqe,GAASlW,KAAKk8D,YAAY8C,EAAGnnE,IAAM,KAErCqe,GAAS,QAIbymD,EAAQE,gBAAkBF,EAAQE,gBAAkBF,EAAQE,gBAAkB,EAAI,EAC9E,kBAAmBF,IACrBA,EAAQI,eAAiB,GAI3B/8D,KAAKw8D,KAAK/jD,EAAI3f,MAAOod,GAAO,SAACtZ,EAAKjB,EAASoL,EAAM0wB,GAK/C,GAJCA,EAAiB4nC,cAAgBv6D,KAAKD,MAAQo6D,EAC/CviE,QAAQrB,IAAI,8BACTM,EAAU,WAAa,YAAe87B,EAAsBsF,OAC7D,YAAetF,EAAiB4nC,cAAgB,MAC9C1jE,EAAS,CACX,IACE2qB,EAAGtQ,OAAOR,GACV,MAAO9N,GACP/L,GAAU,EACVoL,EAAO,gCAAkCyO,EAAGnZ,OAAS,kBAAoBqL,EAE3E,IAAK,IAAI7P,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7ByuB,EAAG7V,IAAIuuD,EAAGnnE,GAAGwO,QAAS24D,EAAGnnE,GAAGyO,UAAW04D,EAAGnnE,GAAG0B,OAAQkf,GAOzD,GAHA1W,EAASnF,EAAKjB,EAASoL,EAAM0wB,GAC7BklC,EAAQE,iBAAmB,EAEK,IAA5BF,EAAQE,iBAAyBF,EAAQG,iBAAkB,CAC7D,IAAIA,EAAmBH,EAAQG,wBACxBH,EAAQG,iBAEfA,EAAiBrkD,YAGhB,GAAKza,EAAoBnB,QAAQ,QAAU,EAChDmD,KAAKs/D,UAAU7mD,EAAKjD,EAAIwpD,EAAIj9D,OACvB,CACL,KAAK/D,EAAoBnB,QAAQ,cAAgB,GAU/C,MAAM,IAAIgD,MAAM,2BAA6B7B,EAAW,SAAWya,GATnE,IACEzY,KAAKu/D,gBAAgB9mD,EAAKjD,EAAIwpD,EAAIj9D,GAClC,MAAO2F,GACP3F,EAAS0W,EAAI3f,OAAO,EAClB,wCAA0C2f,EAAI3f,MAAQ,SAQ9D,MAAO4O,GACP3F,OAASyE,GAAW,EAAO,wBAA0BkB,EAAI,KACvDwlB,cAAiBxlB,O,uBAIvB,SACE+Q,EACAjD,EACAwpD,EACA7C,GAEA,IAAI71C,EAAKtmB,KAAK8e,MAEV8gB,EAAUtZ,EAAG7S,IAAIgF,EAAKzY,KAAK9G,GAAGg+B,KAAK,YACvC,IAAK0I,EACH,MAAM,IAAI//B,MAAM,mDACd4Y,GAEJ,IAAIgf,EAAWnR,EAAG7S,IAAImsB,EAAsB5/B,KAAK9G,GAAGg+B,KAAK,aACzD,IAAKO,EACH,OAAO,KAMT,IAJA,IAAItwB,EAAemf,EAAG2X,IAAIxG,EAAUz3B,KAAK9G,GAAGk+B,MAAM,iBAAyBt+B,MAGvEyqC,EAASjd,EAAGpgB,wBAAmBM,OAAWA,OAAWA,EAAWiS,GAAK3b,QAChEjF,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7Bq1B,iBAAoBqW,EAAQ/tB,EAAG3d,IAEjC,IAAK,IAAIA,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7B0rC,EAAOhiC,KAAKy9D,EAAGnnE,IAGjB,IAII2nE,EAJErwB,EAAiBnvC,KAAK6+B,UAAUpmB,EAAI3f,MAAOyqC,EAAQp8B,GAGrDs4D,EAAkBn5C,EAAG2X,IAAIxG,EAAUz3B,KAAK9G,GAAGk+B,MAAM,qBAEjDqoC,IACFD,EAAYzB,eAAQ0B,EAAgB3mE,MAAO0mE,IAG7C,IAAIh9D,EAAU,CACZ2E,cACA8wB,QAAQ,EACRlxB,KAAMooC,GAGR,OAAO7oB,EAAG/P,QAAQwoB,aAAa,MAAOygC,EAAWh9D,GAC9Cs5B,MAAK,SAAArE,GACJ,IAAKA,EAASrH,GACZ,MAAM,IAAIvwB,MAAM43B,EAAS/7B,OAG3B,IAAK,IAAI7D,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7ByuB,EAAGtQ,OAAOR,EAAG3d,IAEf,IAAK,IAAIA,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7ByuB,EAAG7V,IAAIuuD,EAAGnnE,GAAGwO,QAAS24D,EAAGnnE,GAAGyO,UAAW04D,EAAGnnE,GAAG0B,OAAQkf,GAGvD0jD,EAAiB1jD,EAAI3f,MAAO2+B,EAASrH,GAAIqH,EAASE,aAAcF,MAEjEuH,OAAM,SAAAhH,GACLmkC,EAAiB1jD,EAAI3f,OAAO,EAAOk/B,EAAIpd,QAASod,Q,6BAYtD,SAAiBvf,EAAgBjD,EAAIwpD,EAAI7C,GAOvC,IANA,IAAM71C,EAAKtmB,KAAK8e,MAIZykB,EAASjd,EAAGpgB,wBAAmBM,OAAWA,OAAWA,EAAWiS,GAAK3b,QAEhEjF,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7Bq1B,iBAAoBqW,EAAQ/tB,EAAI3d,IAElC,IAAK,IAAIA,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7B0rC,EAAOhiC,KAAKy9D,EAAInnE,IAGlB,IAAI6nE,EAAMjnD,EAAI3f,MAAM+E,YAAY,KAChC,GAAI6hE,EAAM,EACR,MAAM,IAAI7/D,MAAM,0CAA4C4Y,EAAI3f,OAElE,IAAI6mE,EAAMlnD,EAAI3f,MAAMgE,MAAM4iE,EAAM,GAE5Bv4D,EAAc6yB,IAAQhD,oBAAqB2oC,GAC/C,IAAKx4D,EACH,MAAM,IAAItH,MAAM,mBAAqB8/D,EAAM,iCAG7C,IAAMxwB,EAAiBnvC,KAAK6+B,UAAUpmB,EAAI3f,MAAOyqC,EAAQp8B,GAEzDmf,EAAG/P,QAAQwoB,aAAa,MAAMtmB,EAAI3f,MAAM,CACtC,KAAcq2C,EACdhoC,YAAcA,IACb20B,MAAM,SAACrE,GACR,IAAIA,EAASrH,GAAI,OAAO+rC,EAAiB1jD,EAAI3f,OAAM,EAAM2+B,EAAS/7B,OAClE,IAAK,IAAI7D,EAAI,EAAGA,EAAI2d,EAAGnZ,OAAQxE,IAC7ByuB,EAAGtQ,OAAOR,EAAG3d,IAEf,IAAK,IAAIA,EAAI,EAAGA,EAAImnE,EAAG3iE,OAAQxE,IAC7ByuB,EAAG7V,IAAIuuD,EAAGnnE,GAAGwO,QAAS24D,EAAGnnE,GAAGyO,UAAW04D,EAAGnnE,GAAG0B,OAAQkf,GAEvD0jD,EAAiB1jD,EAAI3f,OAAO,EAAM,S,uBAStC,SAAW8D,EAAayM,EAAuBlC,GAC7C,IACIgoC,EADE7oB,EAAKtmB,KAAK8e,MAGhB,GAAoB,iBAATzV,EACT,OAAOA,EAIT,IAAI85B,EAAKC,YAAW9c,GAGpB,OAFA6c,EAAGK,kBAAkBld,EAAGzR,YACxBsuB,EAAGM,QAAQ7mC,GACHuK,GACN,IAAK,WACL,IAAK,sBACHgoC,EAAiBhM,EAAGQ,gBAAgBt6B,GACpC,MACF,IAAK,UACL,IAAK,cACL,IAAK,uBACL,IAAK,iBACH8lC,EAAiBhM,EAAGS,eAAev6B,GACnC,MACF,QACE,MAAM,IAAIxJ,MAAM,gBAAkBsH,EAChC,yCAGN,OAAOgoC,I,iBAMT,SACE12B,EACApP,EACAlC,EACApF,GACe,IAEXotC,EAFW,OACT7oB,EAAKtmB,KAAK8e,MAGhB,OAAO2a,QAAQ1G,UACZ+I,MAAK,WAGJ,OAFAqT,EAAiB,EAAKtQ,UAAUpmB,EAAI3f,MAAOuQ,EAAMlC,GAE1Cmf,EAAG/P,QACPwoB,aAAa,MAAOtmB,EAAI3f,MAAO,CAAEqO,cAAaJ,KAAMooC,OAExDrT,MAAK,SAAArE,GACJ,IAAKA,EAASrH,GACZ,OAAOruB,EAAS0W,EAAI3f,MAAO2+B,EAASrH,GAAIqH,EAAS/7B,MAAO+7B,UAGnDnR,EAAG/P,QAAQskB,YAAYpiB,EAAI3f,cAC3BwtB,EAAG/P,QAAQikB,UAAU/hB,EAAI3f,OAEZ,iBAATuQ,GACTA,EAAKlD,KAAI,SAACC,GACRkgB,EAAGgoC,aAAaloD,MAIpBrE,EAAS0W,EAAI3f,MAAO2+B,EAASrH,GAAI,GAAIqH,MAEtCuH,OAAM,SAAAhH,GACLj2B,EAAS0W,EAAI3f,OAAO,EAAOk/B,EAAIpd,c,oBAgBrC,SACE0L,EACA7N,EACA0jD,GAEA,IAAI8C,EAAYn6D,KAAKD,MAQpByhB,EAAW/P,QAAQ4Z,iBAAiB1X,EAAI3f,MANzB,CACd2iC,OAAO,EACPxD,QAAQ,EACRiI,mBAAmB,IAGoC,SAAU9P,EAAarpB,EAAY0wB,GAC1F,GAAKrH,EAIE,GAAIqH,EAASmoC,kBAAwC,MAApBnoC,EAASsF,OAI/Co/B,GAAiB,EAAO,kCAAoCp1D,EAAM0wB,OAC7D,CACL,IAAI4nC,EAAgBv6D,KAAKD,MAAQo6D,EAE5BxmD,EAAIonD,kBAAiBpnD,EAAIonD,gBAAkB,GAC3CpnD,EAAIqnD,kBAAiBrnD,EAAIqnD,gBAAkB,GAEhDrnD,EAAIonD,iBAAmBR,EACvB5mD,EAAIqnD,iBAAmB,EAMvB3D,GAAiB,QApBjBA,GAAiB,EAAO,yBAA2Bp1D,EAAM0wB,U,klBC5kCjE,IA8CesoC,GA9C+B,GAAH,MACtCxwB,KADsC,IAQzCh5B,QARyC,SAQhCuI,EAAuBtc,GAC9B,OAAO,IAAIw3B,IAAQlb,EAAOtc,IAM5BqI,MAfyC,WAesB,IAAxDqJ,EAAwD,4DAA7C1N,EAAW2N,EAAkC,4DAA3B3N,EAClC,OAAO,IAAIyN,IAAeC,EAAUC,GAAQ,CAAC/K,WAAYmmC,OAS3DywB,IAzByC,SAyBpCluD,EAAaxF,EAAe+X,GAC/B,OAAOrkB,KAAKoL,QAAQ,GAAK0G,EAAKxF,GAAQ+X,IAUxCje,GApCyC,SAqCvCC,EACAC,EACA/M,EACAsR,GAEA,OAAO7K,KAAK4J,KAAKvD,EAASC,EAAW/M,EAAQsR,MChDpCo1D,GAAb,WACE,WAAa/2C,EAAQg3C,GAAK,YACxBlgE,KAAKkpB,OAASA,EACdlpB,KAAKkgE,IAAMA,EACXlgE,KAAKmgE,WAAY,EACjBngE,KAAKogE,QAAU,GACfpgE,KAAKqgE,WAAa,GAClBrgE,KAAKi+D,OAAS,GACd,IACEj+D,KAAKi+D,OAAS,IAAIC,UAAUgC,GAC5BlgE,KAAKi+D,OAAOE,OAASn+D,KAAKsgE,OAC1BtgE,KAAKi+D,OAAOI,QAAUr+D,KAAKugE,QAC3BvgE,KAAKi+D,OAAOK,UAAYt+D,KAAKwgE,UAC7BxgE,KAAKi+D,OAAOvtB,QAAU1wC,KAAKygE,QAC3B,MAAO/kE,GACPsE,KAAKygE,QAAQ/kE,IAfnB,mCAkBE,SAAS2C,GACP,IAAIqiE,EACA7oE,EACAqG,EACAvF,EACA2F,EACAC,EACAsQ,EAYJ,IAAKhX,KAXLc,EAAI,GACJ2F,EAAO,WACL,IAAImZ,EAAGtZ,EAAKG,EAAKwa,EAGjB,IADAA,EAAU,GACLrB,EAAI,EAAGtZ,GAFZG,EAAMD,EAAE4B,MAAM,MAEQ5D,OAAQob,EAAItZ,EAAKsZ,IACrCipD,EAAMpiE,EAAImZ,GACVqB,EAAQvX,KAAKm/D,EAAIzgE,MAAM,MAEzB,OAAO6Y,EARF,GAWL4nD,EAAMpiE,EAAIzG,GAGVgX,GAFAtQ,EAAO,CAACy0C,mBAAmB0tB,EAAI,IAAK1tB,mBAAmB0tB,EAAI,MAElD,GACG,MAAR/nE,EAFJuF,EAAIK,EAAK,MAGP5F,EAAEuF,GAAK,IAETvF,EAAEuF,GAAGqD,KAAKsN,GAEZ,OAAOlW,IA/CX,mBAiDE,SAAOujC,EAAQt/B,EAAKyM,GAClB,IAAI/L,EAAMsd,EAEV,OADAA,EAAU,CAACshB,EAAQt/B,EAAKyM,GAAMjM,KAAK,KACS,mBAA7BE,EAAO0C,KAAKi+D,QAAQ5pB,KAAsB/2C,EAAK+2C,KAAKz5B,QAAW,IApDlF,wBAsDE,SAAYhe,GAGV,OAFAoD,KAAK2gE,MAAM,MAAO/jE,EAAK,IACvBoD,KAAKqgE,WAAWzjE,IAAO,EAChBoD,KAAKqgE,WAAWzjE,KAzD3B,qBA2DE,SAAS8K,GACP,IAAI9K,EAEJ,IAAKA,KADLoD,KAAKmgE,WAAY,EACLngE,KAAKqgE,WACfrgE,KAAKogE,QAAQxjE,IAAO,EAGtB,OADAoD,KAAKqgE,WAAa,GACXrgE,KAAKqgE,aAlEhB,qBAoEE,SAAS34D,GACP,MAAM,IAAI7H,MAAM,UAAY6H,KArEhC,uBAuEE,SAAWA,GACT,IAAIpK,EAAMsd,EAEV,MAAmB,UADnBA,EAAUlT,EAAE2B,KAAKpJ,MAAM,MACX,GACkC,mBAA7B3C,EAAO0C,KAAKi+D,QAAQ5pB,KAAsB/2C,EAAK+2C,KAAK,QAAUz5B,EAAQ9d,MAAM,GAAGM,KAAK,WAAQ,EACnF,QAAfwd,EAAQ,GACV5a,KAAKkpB,OAAO03C,SAAShmD,EAAQ,GAAI5a,KAAK6gE,QAAQjmD,EAAQ,UADxD,IA5EX,oBAgFE,SAAQlT,GACN,IAAIoR,EAASlc,EAGb,IAAKA,KAFLoD,KAAKmgE,WAAY,EACjBrnD,EAAU,GACE9Y,KAAKogE,eACRpgE,KAAKogE,QAAQxjE,GACpBkc,EAAQvX,KAAKvB,KAAK8gE,WAAWlkE,IAE/B,OAAOkc,IAxFX,uBA0FE,SAAWlc,GACT,OAAIoD,KAAKmgE,UACAngE,KAAK8gE,WAAWlkE,IAEvBoD,KAAKogE,QAAQxjE,IAAO,EACboD,KAAKogE,QAAQxjE,QA/F1B,KAoGamkE,GAAb,WACE,WAAaxqD,GAAS,YACpBvW,KAAKuW,QAAUA,EACfvW,KAAK6K,MAAQ,GACb7K,KAAKkgE,IAAM,GACXlgE,KAAKuW,QAAQlV,YAAY,UAAWrB,KAAKghE,WAL7C,qCAOE,SAAW7oE,GACT,IAAI8oE,EAAMrkE,EAAKsjE,EACf,OAAiB,MAAb/nE,EAAEyY,SAGmB,oBAAdstD,WAA2C,OAAdA,YAGxC+C,EAAO9oE,EAAEyY,QAAF,KACPsvD,EAAM/nE,EAAEyY,QAAQ,eAChBhU,EAAMzE,EAAEyE,IACJqkE,GAAQf,IACVlgE,KAAK6K,MAAMjO,GAAO,CAChBqkE,KAAMA,EACNf,IAAKA,GAEPlgE,KAAKwgC,SAAS0/B,EAAKtjE,MAbZ,IAVb,sBA2BE,SAAUA,EAAKzE,GACb,OAAO6H,KAAKuW,QAAQ0pB,QAAQgE,GAAYp7B,UAAUjM,MA5BtD,sBA8BE,SAAUsjE,EAAKtjE,GAIb,OAHqB,MAAjBoD,KAAKkgE,IAAIA,KACXlgE,KAAKkgE,IAAIA,GAAO,IAAID,GAAcjgE,KAAMkgE,IAEnClgE,KAAKkgE,IAAIA,GAAKgB,UAAUtkE,OAlCnC,K,SCtEMukE,GAAmB,GACzB,IAAK,IAAM/oE,MAAQ6rC,GACgB,mBAAtBA,GAAY7rC,MACrB+oE,GAAiB/oE,IAAQ6rC,GAAY7rC,IAAMiB,KAAK4qC,KAEpD,IACE1tB,GAWE4qD,GAXF5qD,QACA1L,GAUEs2D,GAVFt2D,MACAm1D,GASEmB,GATFnB,IACA55D,GAQE+6D,GARF/6D,GACAyC,GAOEs4D,GAPFt4D,UACA+C,GAMEu1D,GANFv1D,SACA/B,GAKEs3D,GALFt3D,UACAI,GAIEk3D,GAJFl3D,aACAmB,GAGE+1D,GAHF/1D,QACAxB,GAEEu3D,GAFFv3D,KACA6B,GACE01D,GADF11D,OAGI4B,GAAU,IAAIsN,IACdutB,GAAS,SAAAnoC,GAAG,OAAIsN,GAAQ66B,OAAOnoC,IAE/B+K,GAAO5K,IAAKqL,UAIZ61D,GAASx2D,IAAU8C,Q,gBC7DzBtW,EAAOD,QAAU,EAAQ,K,cCezB,MAAMmd,EAAU,CACd+sD,IAAK,iCACL7b,IAAK,gCACLpZ,GAAI,yCACJk1B,IAAK,sCACLC,KAAM,kCACNC,QAAS,8CACTlqC,GAAI,mCACJmqC,IAAK,4BACLC,KAAM,gCACNC,KAAM,6BACNC,IAAK,2CACLC,IAAK,gCACL1qC,KAAM,mCACNC,MAAO,oCACP0qC,OAAQ,yCACRvqC,IAAK,4BACLL,KAAM,mCACN77B,IAAK,sCACL0mE,QAAS,oCACTC,GAAI,+BACJC,IAAK,4BACL/zD,IAAK,iCACLg0D,IAAK,gCACL5sD,MAAO,kCACP6sD,KAAM,6BACNC,GAAI,0CACJC,KAAM,iCACNn5D,IAAK,8CACLmuB,KAAM,wCACNirC,IAAK,2BACLC,MAAO,qCACPC,OAAQ,qBACRC,KAAM,2BACNC,MAAO,oCACPC,MAAO,kCACPvJ,KAAM,mCACNwJ,IAAK,mCACLC,OAAQ,mCACRC,GAAI,2BACJC,MAAO,mCACPC,GAAI,qCACJn1D,IAAK,oCACLo1D,IAAK,2DAkBP7rE,EAAOD,QAZP,SAAgB+R,EAAM,CAAEL,UAAW3L,GAAKA,IACtC,MAAM2X,EAAa,GACnB,IAAK,MAAMquD,KAAS5uD,EAAS,CAC3B,MAAM6uD,EAAY7uD,EAAQ4uD,GAC1BruD,EAAWquD,GAAS,SAAUj8C,EAAY,IACxC,OAAO/d,EAAIL,UAAUs6D,EAAYl8C,IAIrC,OAAOpS,I,8BCzET,YAKA,MAAMhF,EAAmB,EAAQ,IAC3BuzD,EAAgB,EAAQ,IACxBC,EAAW,EAAQ,IACnBzU,EAAS,EAAQ,IAmfvB,SAAS0U,EAAmBj/D,EAAGC,GAC7B,OAAOD,EAAE+S,KAAO9S,EAAE8S,MAAQ,EAAI/S,EAAE+S,KAAO9S,EAAE8S,KAAO,EAAI,EAlftDhgB,EAAOD,QAAU,MACf,cACE6I,KAAK5H,KAAO,YACZ4H,KAAKujE,cAAgB,IAAIjzD,IACzBtQ,KAAKwjE,gBAAkB,IAAI3zD,EAAiB,UAC5C7P,KAAKyjE,cAAgB,SACrBzjE,KAAKosD,MAAQ,KAIf,WAAW0G,GACT9yD,KAAKosD,MAAQ0G,EAIb,IAAI,MAAMlpD,KAAQkpD,EAIhB9yD,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKvD,UAClDrG,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKrQ,SAClDyG,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKiB,QAkBpD,MAAM+4D,EAAmB,IAAItzD,IACvBuzD,EAAgB,IAAI7jE,KAAKujE,cAAcp0D,QAC7C,IAAItX,EAAI,EACR,IAAI,MAAM2R,KAAMq6D,IAEThsE,EAAI,KAAQ,SACTmI,KAAK8jE,eAGP9jE,KAAK+jE,uBAAuB,CAACv6D,KAAIo6D,qBAKzC,MAAMI,EAAS,IAAIJ,EAAiBz0D,QAAQ/K,OAEtC6/D,EAAY,GAClB,IAAI,MAAM7sD,KAAQ4sD,EAAQ,CAGxB,MAAME,EAASN,EAAiBlrE,IAAI0e,GACpC,GAAG8sD,EAAO7nE,OAAS,EAAG,CACpB4nE,EAAU1iE,KAAK2iE,GACf,SAOF,MAAM16D,EAAK06D,EAAO,GAClBlkE,KAAKwjE,gBAAgBp2D,MAAM5D,GAY7B,IAAI,MAAM06D,KAAUD,EAAW,CAG7B,MAAME,EAAe,GAGrB,IAAI,MAAM36D,KAAM06D,EAAQ,CAGtB,GAAGlkE,KAAKwjE,gBAAgBY,MAAM56D,GAC5B,SAKF,MAAMsJ,EAAS,IAAIjD,EAAiB,OAKpCiD,EAAO1F,MAAM5D,GAIb,MAAM7I,QAAeX,KAAKqkE,iBAAiB76D,EAAIsJ,GAC/CqxD,EAAa5iE,KAAKZ,GAKpBwjE,EAAa//D,KAAKk/D,GAClB,IAAI,MAAM3iE,KAAUwjE,EAAc,CAMhC,MAAMG,EAAS3jE,EAAOmS,OAAOyxD,YAC7B,IAAI,MAAM/6D,KAAM86D,EACdtkE,KAAKwjE,gBAAgBp2D,MAAM5D,IAWjC,MAAMg7D,EAAa,GACnB,IAAI,MAAM56D,KAAQ5J,KAAKosD,MAAO,CAK5B,MAAM/tD,EAAI,IAAIuL,GACdvL,EAAEgI,QAAUrG,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAEgI,UAC/ChI,EAAE9E,OAASyG,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAE9E,SAC9C8E,EAAEwM,MAAQ7K,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAEwM,QAE7C25D,EAAWjjE,KAAKqtD,EAAOoG,cAAc32D,IAOvC,OAHAmmE,EAAWpgE,OAGJogE,EAAWpnE,KAAK,IAIzB,2BAA2BoM,GAGzB,MAAM6jC,EAAS,GAIT5xC,EAAOuE,KAAKujE,cAAc7qE,IAAI8Q,GAC9B4iD,EAAQ3wD,EAAK2wD,MAGnB,IAAI,MAAMxiD,KAAQwiD,EAAO,CAMvB,MAAMr0C,EAAO,CACX1R,QAAS,KAAMC,UAAWsD,EAAKtD,UAAW/M,OAAQ,KAAMsR,MAAO,MAKjEkN,EAAK1R,QAAUrG,KAAK0kE,2BAClBl7D,EAAII,EAAKvD,QAAS,WACpB0R,EAAKxe,OAASyG,KAAK0kE,2BACjBl7D,EAAII,EAAKrQ,OAAQ,UACnBwe,EAAKlN,MAAQ7K,KAAK0kE,2BAChBl7D,EAAII,EAAKiB,MAAO,SAClBwiC,EAAO9rC,KAAKqtD,EAAOoG,cAAcj9C,IAInCs1B,EAAOjpC,OAIP,MAAMugE,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAClC,IAAI,MAAMxO,KAAS5nB,EACjBs3B,EAAG9F,OAAO5J,GAGZ,OADAx5D,EAAK2b,WAAautD,EAAGC,SACdnpE,EAAK2b,KAId,2BAA2BytD,EAASj7D,EAAMkJ,EAAQgyD,GAKhD,IAAIt7D,EAEFA,EADCxJ,KAAKwjE,gBAAgBY,MAAMS,GACvB7kE,KAAKwjE,gBAAgBp2D,MAAMy3D,GACxB/xD,EAAOsxD,MAAMS,GAChB/xD,EAAO1F,MAAMy3D,GAEb7kE,KAAKujE,cAAc7qE,IAAImsE,GAASztD,KAKvC,MAAMutD,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAclC,OAbAkB,EAAG9F,OAAOiG,GAIM,MAAbA,GACDH,EAAG9F,OAAO7+D,KAAK+kE,oBAAoBn7D,IAIrC+6D,EAAG9F,OAAOr1D,GAIHm7D,EAAGC,SAIZ,uBAAuBp7D,EAAIsJ,GAIzB,MAAM6xD,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAC5BuB,QAAsBhlE,KAAKilE,oBAAoBz7D,EAAIsJ,GAOnDkxD,EAAS,IAAIgB,EAAc71D,QAAQ/K,OACzC,IAAI,MAAMgT,KAAQ4sD,EAAQ,CAExBW,EAAG9F,OAAOznD,GAGV,IAGI8tD,EAHAC,EAAa,GAMjB,MAAMC,EAAW,IAAI/B,EAAS2B,EAActsE,IAAI0e,IAChD,IAAIvf,EAAI,EACR,KAAMutE,EAASC,WAAW,CACxB,MAAMC,EAAcF,EAASvoD,SAExBhlB,EAAI,GAAM,SACPmI,KAAK8jE,SAIb,IAAIyB,EAAazyD,EAAO1C,QAGpBzS,EAAO,GAIX,MAAM6nE,EAAgB,GAGtB,IAAIC,GAAkB,EACtB,IAAI,MAAMZ,KAAWS,EAuBnB,GApBGtlE,KAAKwjE,gBAAgBY,MAAMS,GAC5BlnE,GAAQqC,KAAKwjE,gBAAgBp2D,MAAMy3D,IAK/BU,EAAWnB,MAAMS,IACnBW,EAAcjkE,KAAKsjE,GAIrBlnE,GAAQ4nE,EAAWn4D,MAAMy3D,IASF,IAAtBM,EAAW9oE,QAAgBsB,EAAOwnE,EAAY,CAC/CM,GAAkB,EAClB,MAIJ,IAAGA,EAAH,CAKA,IAAI,MAAMZ,KAAWW,EAAe,CAIlC,MAAM7kE,QAAeX,KAAKqkE,iBAAiBQ,EAASU,GAmBpD,GAfA5nE,GAAQ4nE,EAAWn4D,MAAMy3D,GAGzBlnE,GAAQ,IAAIgD,EAAOyW,QAInBmuD,EAAa5kE,EAAOmS,OAQK,IAAtBqyD,EAAW9oE,QAAgBsB,EAAOwnE,EAAY,CAC/CM,GAAkB,EAClB,OAIDA,IAOsB,IAAtBN,EAAW9oE,QAAgBsB,EAAOwnE,KACnCA,EAAaxnE,EACbunE,EAAeK,IAKnBZ,EAAG9F,OAAOsG,GAGVryD,EAASoyD,EAKX,MAAO,CAAC9tD,WAAYutD,EAAGC,SAAU9xD,UAInC,2BAA2BtJ,EAAIm6D,GAC7B,MAA0B,cAAvBA,EAAU7kE,SACJ6kE,EAOF,CACL7kE,SAAU,YACVhG,MAAO6qE,EAAU7qE,QAAU0Q,EAAK,MAAQ,OAK5C,oBAAoBI,GAClB,MAAO,IAAIA,EAAKtD,UAAUxN,SAI5B,0BAA0B0Q,EAAIsJ,GAG5B,MAAMkyD,EAAgB,IAAI10D,IAIpB87C,EAAQpsD,KAAKujE,cAAc7qE,IAAI8Q,GAAI4iD,MAGzC,IAAIv0D,EAAI,EACR,IAAI,MAAM+R,KAAQwiD,IAEXv0D,EAAI,KAAQ,SACTmI,KAAK8jE,eAMPrqC,QAAQwB,IAAI,CAChBj7B,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKvD,QAASy+D,SAAU,IACzCt7D,KAAIsJ,SAAQkyD,kBAEdhlE,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKrQ,OAAQurE,SAAU,IACxCt7D,KAAIsJ,SAAQkyD,kBAEdhlE,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKiB,MAAOi6D,SAAU,IACvCt7D,KAAIsJ,SAAQkyD,oBAKlB,OAAOA,EAGT,8BAA6B,GAACx7D,EAAE,iBAAEo6D,IAGhC,MAAMxsD,QAAapX,KAAK2lE,qBAAqBn8D,GAIvC06D,EAASN,EAAiBlrE,IAAI0e,GAChC8sD,EAGFA,EAAO3iE,KAAKiI,GAFZo6D,EAAiBrzD,IAAI6G,EAAM,CAAC5N,IAMhC,uBAAsB,KAACI,EAAI,UAAE+5D,IAC3B,GAA0B,cAAvBA,EAAU7kE,SACX,OAEF,MAAM0K,EAAKm6D,EAAU7qE,MACf2C,EAAOuE,KAAKujE,cAAc7qE,IAAI8Q,GACjC/N,EACDA,EAAK2wD,MAAM37C,IAAI7G,GAEf5J,KAAKujE,cAAchzD,IAAI/G,EAAI,CAAC4iD,MAAO,IAAI57C,IAAI,CAAC5G,IAAQwN,KAAM,OAI9D,gCACE,KAACxN,EAAI,UAAE+5D,EAAS,SAAEmB,EAAQ,GAAEt7D,EAAE,OAAEsJ,EAAM,cAAEkyD,IACxC,GAA4B,cAAvBrB,EAAU7kE,UAA4B6kE,EAAU7qE,QAAU0Q,EAC7D,OAOF,MAAMq7D,EAAUlB,EAAU7qE,MACpBse,QAAapX,KAAK4lE,qBACtBf,EAASj7D,EAAMkJ,EAAQgyD,GAKnB1zD,EAAU4zD,EAActsE,IAAI0e,GAC/BhG,EACDA,EAAQ7P,KAAKsjE,GAEbG,EAAcz0D,IAAI6G,EAAM,CAACytD,IAI7B,iBAAgB,UAAClB,IACf,MAA0B,cAAvBA,EAAU7kE,UACV6kE,EAAU7qE,MAAMgnC,WAAW9/B,KAAKwjE,gBAAgB5pD,QAM5C+pD,EALE,CACL7kE,SAAU,YACVhG,MAAOkH,KAAKwjE,gBAAgBp2D,MAAMu2D,EAAU7qE,QAMlD,eACE,OAAO,IAAI2gC,QAAQ1G,GAAWmjB,EAAanjB,Q,gDCvf/C,6BACI,aAEA,IAAIqH,EAAO8b,aAAX,CAIA,IAII2vB,EA6HI9sC,EAZA+sC,EArBAC,EACAC,EAjGJC,EAAa,EACbC,EAAgB,GAChBC,GAAwB,EACxB1tD,EAAM2hB,EAAOr9B,SAoJbqpE,EAAW7tE,OAAO8H,gBAAkB9H,OAAO8H,eAAe+5B,GAC9DgsC,EAAWA,GAAYA,EAASn1C,WAAam1C,EAAWhsC,EAGf,qBAArC,GAAGvyB,SAAS7P,KAAKoiC,EAAOhN,SApFxBy4C,EAAoB,SAASQ,GACzBj5C,EAAQgpB,UAAS,WAAckwB,EAAaD,QAIpD,WAGI,GAAIjsC,EAAOmsC,cAAgBnsC,EAAOosC,cAAe,CAC7C,IAAIC,GAA4B,EAC5BC,EAAetsC,EAAOkkC,UAM1B,OALAlkC,EAAOkkC,UAAY,WACfmI,GAA4B,GAEhCrsC,EAAOmsC,YAAY,GAAI,KACvBnsC,EAAOkkC,UAAYoI,EACZD,GAwEJE,GAIAvsC,EAAOwsC,iBA9CVd,EAAU,IAAIc,gBACVC,MAAMvI,UAAY,SAASvgB,GAE/BuoB,EADavoB,EAAM10C,OAIvBw8D,EAAoB,SAASQ,GACzBP,EAAQgB,MAAMP,YAAYF,KA2CvB5tD,GAAO,uBAAwBA,EAAI3R,cAAc,WAtCpDiyB,EAAOtgB,EAAIkQ,gBACfk9C,EAAoB,SAASQ,GAGzB,IAAIU,EAAStuD,EAAI3R,cAAc,UAC/BigE,EAAO7yB,mBAAqB,WACxBoyB,EAAaD,GACbU,EAAO7yB,mBAAqB,KAC5Bnb,EAAKiuC,YAAYD,GACjBA,EAAS,MAEbhuC,EAAK/xB,YAAY+/D,KAKrBlB,EAAoB,SAASQ,GACzBp1C,WAAWq1C,EAAc,EAAGD,KAlD5BN,EAAgB,gBAAkBn5D,KAAKq6D,SAAW,IAClDjB,EAAkB,SAASjoB,GACvBA,EAAM/5C,SAAWo2B,GACK,iBAAf2jB,EAAM10C,MACyB,IAAtC00C,EAAM10C,KAAKxM,QAAQkpE,IACnBO,GAAcvoB,EAAM10C,KAAKvM,MAAMipE,EAAc1pE,UAIjD+9B,EAAO6Z,iBACP7Z,EAAO6Z,iBAAiB,UAAW+xB,GAAiB,GAEpD5rC,EAAO8sC,YAAY,YAAalB,GAGpCH,EAAoB,SAASQ,GACzBjsC,EAAOmsC,YAAYR,EAAgBM,EAAQ,OAgEnDD,EAASlwB,aA1KT,SAAsBn0C,GAEI,mBAAbA,IACTA,EAAW,IAAI8qC,SAAS,GAAK9qC,IAI/B,IADA,IAAID,EAAO,IAAI6M,MAAMkI,UAAUxa,OAAS,GAC/BxE,EAAI,EAAGA,EAAIiK,EAAKzF,OAAQxE,IAC7BiK,EAAKjK,GAAKgf,UAAUhf,EAAI,GAG5B,IAAIojD,EAAO,CAAEl5C,SAAUA,EAAUD,KAAMA,GAGvC,OAFAokE,EAAcD,GAAchrB,EAC5B4qB,EAAkBI,GACXA,KA6JTG,EAASe,eAAiBA,EA1J1B,SAASA,EAAed,UACbH,EAAcG,GAyBzB,SAASC,EAAaD,GAGlB,GAAIF,EAGAl1C,WAAWq1C,EAAc,EAAGD,OACzB,CACH,IAAIprB,EAAOirB,EAAcG,GACzB,GAAIprB,EAAM,CACNkrB,GAAwB,EACxB,KAjCZ,SAAalrB,GACT,IAAIl5C,EAAWk5C,EAAKl5C,SAChBD,EAAOm5C,EAAKn5C,KAChB,OAAQA,EAAKzF,QACb,KAAK,EACD0F,IACA,MACJ,KAAK,EACDA,EAASD,EAAK,IACd,MACJ,KAAK,EACDC,EAASD,EAAK,GAAIA,EAAK,IACvB,MACJ,KAAK,EACDC,EAASD,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAChC,MACJ,QACIC,EAASG,WAnDrB,EAmDsCJ,IAiBlB05C,CAAIP,GACN,QACEksB,EAAed,GACfF,GAAwB,MAvE5C,CAyLkB,oBAATtqE,UAAyC,IAAXu+B,EAAyBp6B,KAAOo6B,EAASv+B,Q,qDCpLhF,EAAQ,IAER,MAAMurE,EAASvrE,KAAKurE,QAAUvrE,KAAKwrE,SAInCjwE,EAAOD,QAAU,MAMf,YAAYu7D,GAGV,IAAK0U,IAAUA,EAAOE,OACpB,MAAM,IAAIznE,MAAM,4BAElB,GAAiB,WAAd6yD,EACD1yD,KAAK0yD,UAAY,CAACt6D,KAAM,eACnB,IAAiB,SAAds6D,EAGR,MAAM,IAAI7yD,MAAM,wBAAwB6yD,OAFxC1yD,KAAK0yD,UAAY,CAACt6D,KAAM,SAI1B4H,KAAKunE,SAAW,GAGlB,OAAO3rE,GACLoE,KAAKunE,UAAY3rE,EAGnB,eACE,MAAMyN,GAAO,IAAIm+D,aAAcrpD,OAAOne,KAAKunE,UACrCn2B,EAAS,IAAIF,iBACXk2B,EAAOE,OAAO1C,OAAO5kE,KAAK0yD,UAAWrpD,IAE7C,IAAIo+D,EAAM,GACV,IAAI,IAAI5vE,EAAI,EAAGA,EAAIu5C,EAAO/0C,SAAUxE,EAClC4vE,GAAOr2B,EAAOv5C,GAAGgQ,SAAS,IAAI6/D,SAAS,EAAG,KAE5C,OAAOD,K,6BCvCXrwE,EAAOD,QAAU,MAOf,YAAY2iB,GAEV9Z,KAAKgpB,QAAUlP,EAAK1V,OAEpBpE,KAAKgU,MAAO,EAEZhU,KAAK0jB,IAAM,IAAIpT,IACf,IAAI,IAAIzY,EAAI,EAAGA,EAAIiiB,EAAKzd,SAAUxE,EAChCmI,KAAK0jB,IAAInT,IAAIuJ,EAAKjiB,IAAI,GAS1B,UACE,OAAQmI,KAAKgU,KASf,OAEE,MAAM,QAACgV,EAAO,IAAEtF,GAAO1jB,KACjBqQ,EAAO2Y,EAAQlsB,QAOrB,IAAIoB,EAAI,KACJypE,EAAM,EACV,MAAMtrE,EAAS2sB,EAAQ3sB,OACvB,IAAI,IAAIxE,EAAI,EAAGA,EAAIwE,IAAUxE,EAAG,CAC9B,MAAMwL,EAAU2lB,EAAQnxB,GAClB4sD,EAAO/gC,EAAIhrB,IAAI2K,IACX,OAANnF,GAAcmF,EAAUnF,KACxBumD,GAAQ5sD,EAAI,GAAKwL,EAAU2lB,EAAQnxB,EAAI,KACvC4sD,GAAQ5sD,EAAKwE,EAAS,GAAMgH,EAAU2lB,EAAQnxB,EAAI,MACpDqG,EAAImF,EACJskE,EAAM9vE,GAKV,GAAS,OAANqG,EACD8B,KAAKgU,MAAO,MACP,CAEL,MAAM4zD,EAAOlkD,EAAIhrB,IAAIwF,GAAKypE,EAAM,EAAIA,EAAM,EAC1C3+C,EAAQ2+C,GAAO3+C,EAAQ4+C,GACvB5+C,EAAQ4+C,GAAQ1pE,EAGhB,IAAI,MAAMmF,KAAW2lB,EAChB3lB,EAAUnF,GACXwlB,EAAInT,IAAIlN,GAAUqgB,EAAIhrB,IAAI2K,IAKhC,OAAOgN,K,6BC7EX,MAAMR,EAAmB,EAAQ,IAC3BuzD,EAAgB,EAAQ,IACxBC,EAAW,EAAQ,IACnBzU,EAAS,EAAQ,IA6dvB,SAAS0U,EAAmBj/D,EAAGC,GAC7B,OAAOD,EAAE+S,KAAO9S,EAAE8S,MAAQ,EAAI/S,EAAE+S,KAAO9S,EAAE8S,KAAO,EAAI,EA5dtDhgB,EAAOD,QAAU,MACf,cACE6I,KAAK5H,KAAO,YACZ4H,KAAKujE,cAAgB,IAAIjzD,IACzBtQ,KAAKwjE,gBAAkB,IAAI3zD,EAAiB,UAC5C7P,KAAKyjE,cAAgB,SACrBzjE,KAAKosD,MAAQ,KAIf,KAAK0G,GACH9yD,KAAKosD,MAAQ0G,EAIb,IAAI,MAAMlpD,KAAQkpD,EAIhB9yD,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKvD,UAClDrG,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKrQ,SAClDyG,KAAK0jE,sBAAsB,CAAC95D,OAAM+5D,UAAW/5D,EAAKiB,QAkBpD,MAAM+4D,EAAmB,IAAItzD,IACvBuzD,EAAgB,IAAI7jE,KAAKujE,cAAcp0D,QAC7C,IAAI,MAAM3F,KAAMq6D,EAEd7jE,KAAK+jE,uBAAuB,CAACv6D,KAAIo6D,qBAKnC,MAAMI,EAAS,IAAIJ,EAAiBz0D,QAAQ/K,OAEtC6/D,EAAY,GAClB,IAAI,MAAM7sD,KAAQ4sD,EAAQ,CAGxB,MAAME,EAASN,EAAiBlrE,IAAI0e,GACpC,GAAG8sD,EAAO7nE,OAAS,EAAG,CACpB4nE,EAAU1iE,KAAK2iE,GACf,SAOF,MAAM16D,EAAK06D,EAAO,GAClBlkE,KAAKwjE,gBAAgBp2D,MAAM5D,GAY7B,IAAI,MAAM06D,KAAUD,EAAW,CAG7B,MAAME,EAAe,GAGrB,IAAI,MAAM36D,KAAM06D,EAAQ,CAGtB,GAAGlkE,KAAKwjE,gBAAgBY,MAAM56D,GAC5B,SAKF,MAAMsJ,EAAS,IAAIjD,EAAiB,OAKpCiD,EAAO1F,MAAM5D,GAIb,MAAM7I,EAASX,KAAKqkE,iBAAiB76D,EAAIsJ,GACzCqxD,EAAa5iE,KAAKZ,GAKpBwjE,EAAa//D,KAAKk/D,GAClB,IAAI,MAAM3iE,KAAUwjE,EAAc,CAMhC,MAAMG,EAAS3jE,EAAOmS,OAAOyxD,YAC7B,IAAI,MAAM/6D,KAAM86D,EACdtkE,KAAKwjE,gBAAgBp2D,MAAM5D,IAWjC,MAAMg7D,EAAa,GACnB,IAAI,MAAM56D,KAAQ5J,KAAKosD,MAAO,CAK5B,MAAM/tD,EAAI,IAAIuL,GACdvL,EAAEgI,QAAUrG,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAEgI,UAC/ChI,EAAE9E,OAASyG,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAE9E,SAC9C8E,EAAEwM,MAAQ7K,KAAKykE,gBAAgB,CAACd,UAAWtlE,EAAEwM,QAE7C25D,EAAWjjE,KAAKqtD,EAAOoG,cAAc32D,IAOvC,OAHAmmE,EAAWpgE,OAGJogE,EAAWpnE,KAAK,IAIzB,qBAAqBoM,GAGnB,MAAM6jC,EAAS,GAIT5xC,EAAOuE,KAAKujE,cAAc7qE,IAAI8Q,GAC9B4iD,EAAQ3wD,EAAK2wD,MAGnB,IAAI,MAAMxiD,KAAQwiD,EAAO,CAMvB,MAAMr0C,EAAO,CACX1R,QAAS,KAAMC,UAAWsD,EAAKtD,UAAW/M,OAAQ,KAAMsR,MAAO,MAKjEkN,EAAK1R,QAAUrG,KAAK0kE,2BAClBl7D,EAAII,EAAKvD,QAAS,WACpB0R,EAAKxe,OAASyG,KAAK0kE,2BACjBl7D,EAAII,EAAKrQ,OAAQ,UACnBwe,EAAKlN,MAAQ7K,KAAK0kE,2BAChBl7D,EAAII,EAAKiB,MAAO,SAClBwiC,EAAO9rC,KAAKqtD,EAAOoG,cAAcj9C,IAInCs1B,EAAOjpC,OAIP,MAAMugE,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAClC,IAAI,MAAMxO,KAAS5nB,EACjBs3B,EAAG9F,OAAO5J,GAGZ,OADAx5D,EAAK2b,KAAOutD,EAAGC,SACRnpE,EAAK2b,KAId,qBAAqBytD,EAASj7D,EAAMkJ,EAAQgyD,GAK1C,IAAIt7D,EAEFA,EADCxJ,KAAKwjE,gBAAgBY,MAAMS,GACvB7kE,KAAKwjE,gBAAgBp2D,MAAMy3D,GACxB/xD,EAAOsxD,MAAMS,GAChB/xD,EAAO1F,MAAMy3D,GAEb7kE,KAAKujE,cAAc7qE,IAAImsE,GAASztD,KAKvC,MAAMutD,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAclC,OAbAkB,EAAG9F,OAAOiG,GAIM,MAAbA,GACDH,EAAG9F,OAAO7+D,KAAK+kE,oBAAoBn7D,IAIrC+6D,EAAG9F,OAAOr1D,GAIHm7D,EAAGC,SAIZ,iBAAiBp7D,EAAIsJ,GAInB,MAAM6xD,EAAK,IAAIvB,EAAcpjE,KAAKyjE,eAC5BuB,EAAgBhlE,KAAKilE,oBAAoBz7D,EAAIsJ,GAO7CkxD,EAAS,IAAIgB,EAAc71D,QAAQ/K,OACzC,IAAI,MAAMgT,KAAQ4sD,EAAQ,CAExBW,EAAG9F,OAAOznD,GAGV,IAGI8tD,EAHAC,EAAa,GAMjB,MAAMC,EAAW,IAAI/B,EAAS2B,EAActsE,IAAI0e,IAChD,KAAMguD,EAASC,WAAW,CACxB,MAAMC,EAAcF,EAASvoD,OAG7B,IAAI0oD,EAAazyD,EAAO1C,QAGpBzS,EAAO,GAIX,MAAM6nE,EAAgB,GAGtB,IAAIC,GAAkB,EACtB,IAAI,MAAMZ,KAAWS,EAuBnB,GApBGtlE,KAAKwjE,gBAAgBY,MAAMS,GAC5BlnE,GAAQqC,KAAKwjE,gBAAgBp2D,MAAMy3D,IAK/BU,EAAWnB,MAAMS,IACnBW,EAAcjkE,KAAKsjE,GAIrBlnE,GAAQ4nE,EAAWn4D,MAAMy3D,IASF,IAAtBM,EAAW9oE,QAAgBsB,EAAOwnE,EAAY,CAC/CM,GAAkB,EAClB,MAIJ,IAAGA,EAAH,CAKA,IAAI,MAAMZ,KAAWW,EAAe,CAIlC,MAAM7kE,EAASX,KAAKqkE,iBAAiBQ,EAASU,GAmB9C,GAfA5nE,GAAQ4nE,EAAWn4D,MAAMy3D,GAGzBlnE,GAAQ,IAAIgD,EAAOyW,QAInBmuD,EAAa5kE,EAAOmS,OAQK,IAAtBqyD,EAAW9oE,QAAgBsB,EAAOwnE,EAAY,CAC/CM,GAAkB,EAClB,OAIDA,IAOsB,IAAtBN,EAAW9oE,QAAgBsB,EAAOwnE,KACnCA,EAAaxnE,EACbunE,EAAeK,IAKnBZ,EAAG9F,OAAOsG,GAGVryD,EAASoyD,EAKX,MAAO,CAAC9tD,KAAMutD,EAAGC,SAAU9xD,UAI7B,2BAA2BtJ,EAAIm6D,GAC7B,MAA0B,cAAvBA,EAAU7kE,SACJ6kE,EAOF,CACL7kE,SAAU,YACVhG,MAAO6qE,EAAU7qE,QAAU0Q,EAAK,MAAQ,OAK5C,oBAAoBI,GAClB,MAAO,IAAIA,EAAKtD,UAAUxN,SAI5B,oBAAoB0Q,EAAIsJ,GAGtB,MAAMkyD,EAAgB,IAAI10D,IAIpB87C,EAAQpsD,KAAKujE,cAAc7qE,IAAI8Q,GAAI4iD,MAGzC,IAAI,MAAMxiD,KAAQwiD,EAKhBpsD,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKvD,QAASy+D,SAAU,IACzCt7D,KAAIsJ,SAAQkyD,kBAEdhlE,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKrQ,OAAQurE,SAAU,IACxCt7D,KAAIsJ,SAAQkyD,kBAEdhlE,KAAK0lE,yBAAyB,CAC5B97D,OAAM+5D,UAAW/5D,EAAKiB,MAAOi6D,SAAU,IACvCt7D,KAAIsJ,SAAQkyD,kBAIhB,OAAOA,EAGT,wBAAuB,GAACx7D,EAAE,iBAAEo6D,IAG1B,MAAMxsD,EAAOpX,KAAK2lE,qBAAqBn8D,GAIjC06D,EAASN,EAAiBlrE,IAAI0e,GAChC8sD,EAGFA,EAAO3iE,KAAKiI,GAFZo6D,EAAiBrzD,IAAI6G,EAAM,CAAC5N,IAMhC,uBAAsB,KAACI,EAAI,UAAE+5D,IAC3B,GAA0B,cAAvBA,EAAU7kE,SACX,OAEF,MAAM0K,EAAKm6D,EAAU7qE,MACf2C,EAAOuE,KAAKujE,cAAc7qE,IAAI8Q,GACjC/N,EACDA,EAAK2wD,MAAM37C,IAAI7G,GAEf5J,KAAKujE,cAAchzD,IAAI/G,EAAI,CAAC4iD,MAAO,IAAI57C,IAAI,CAAC5G,IAAQwN,KAAM,OAI9D,0BACE,KAACxN,EAAI,UAAE+5D,EAAS,SAAEmB,EAAQ,GAAEt7D,EAAE,OAAEsJ,EAAM,cAAEkyD,IACxC,GAA4B,cAAvBrB,EAAU7kE,UAA4B6kE,EAAU7qE,QAAU0Q,EAC7D,OAOF,MAAMq7D,EAAUlB,EAAU7qE,MACpBse,EAAOpX,KAAK4lE,qBAAqBf,EAASj7D,EAAMkJ,EAAQgyD,GAKxD1zD,EAAU4zD,EAActsE,IAAI0e,GAC/BhG,EACDA,EAAQ7P,KAAKsjE,GAEbG,EAAcz0D,IAAI6G,EAAM,CAACytD,IAI7B,iBAAgB,UAAClB,IACf,MAA0B,cAAvBA,EAAU7kE,UACV6kE,EAAU7qE,MAAMgnC,WAAW9/B,KAAKwjE,gBAAgB5pD,QAM5C+pD,EALE,CACL7kE,SAAU,YACVhG,MAAOkH,KAAKwjE,gBAAgBp2D,MAAMu2D,EAAU7qE,W,6BCzdpD1B,EAAOD,QAAU,MAIf,cACE6I,KAAK6nE,UAAY,GAGnB,WAAWC,GACT,MAAMjsE,EAAOmE,KAEb,OADAnE,EAAKksE,QAAUD,EACR,WACL,OAAOjsE,EAAK4U,IAAIvO,MAAMrG,EAAMgb,YAIhC,UAAUod,GACR,IAAI6c,EAAU9wC,KAAK6nE,UAAU5zC,GAC7B,GAAG6c,EAED,OAAOrX,QAAQ1G,QAAQ+d,GAIzBA,EAAU9wC,KAAK6nE,UAAU5zC,GAAOj0B,KAAK+nE,QAAQ9zC,GAE7C,IACE,aAAa6c,EACb,eACO9wC,KAAK6nE,UAAU5zC,O,6BC/B5B,MAAM+zC,EAAU,EAAQ,IAElBC,EAAMrvE,OAAO,OACbsvE,EAAStvE,OAAO,UAChBuvE,EAAoBvvE,OAAO,oBAC3BwvE,EAAcxvE,OAAO,cACrByvE,EAAUzvE,OAAO,UACjB0vE,EAAU1vE,OAAO,WACjB2vE,EAAoB3vE,OAAO,kBAC3B4vE,EAAW5vE,OAAO,WAClB6vE,EAAQ7vE,OAAO,SACf8vE,EAAoB9vE,OAAO,kBAE3B+vE,EAAc,IAAM,EAkP1B,MAAMjwE,EAAM,CAACmD,EAAMzC,EAAKwvE,KACtB,MAAMrmE,EAAO1G,EAAK4sE,GAAO/vE,IAAIU,GAC7B,GAAImJ,EAAM,CACR,MAAMsmE,EAAMtmE,EAAKzJ,MACjB,GAAIgwE,EAAQjtE,EAAMgtE,IAEhB,GADAE,EAAIltE,EAAM0G,IACL1G,EAAKusE,GACR,YAEEQ,IACE/sE,EAAK6sE,KACPnmE,EAAKzJ,MAAM+L,IAAMC,KAAKD,OACxBhJ,EAAK2sE,GAAUQ,YAAYzmE,IAG/B,OAAOsmE,EAAI/vE,QAITgwE,EAAU,CAACjtE,EAAMgtE,KACrB,IAAKA,IAASA,EAAII,SAAWptE,EAAKwsE,GAChC,OAAO,EAET,MAAMa,EAAOpkE,KAAKD,MAAQgkE,EAAIhkE,IAC9B,OAAOgkE,EAAII,OAASC,EAAOL,EAAII,OAC3BptE,EAAKwsE,IAAaa,EAAOrtE,EAAKwsE,IAG9BvnE,EAAOjF,IACX,GAAIA,EAAKqsE,GAAUrsE,EAAKosE,GACtB,IAAK,IAAIkB,EAASttE,EAAK2sE,GAAU9rB,KAC/B7gD,EAAKqsE,GAAUrsE,EAAKosE,IAAmB,OAAXkB,GAAkB,CAI9C,MAAM/nC,EAAO+nC,EAAO/nC,KACpB2nC,EAAIltE,EAAMstE,GACVA,EAAS/nC,IAKT2nC,EAAM,CAACltE,EAAM0G,KACjB,GAAIA,EAAM,CACR,MAAMsmE,EAAMtmE,EAAKzJ,MACb+C,EAAKysE,IACPzsE,EAAKysE,GAASO,EAAIzvE,IAAKyvE,EAAI/vE,OAE7B+C,EAAKqsE,IAAWW,EAAIxsE,OACpBR,EAAK4sE,GAAOp0C,OAAOw0C,EAAIzvE,KACvByC,EAAK2sE,GAAUY,WAAW7mE,KAI9B,MAAM8mE,EACJ,YAAajwE,EAAKN,EAAOuD,EAAQwI,EAAKokE,GACpCjpE,KAAK5G,IAAMA,EACX4G,KAAKlH,MAAQA,EACbkH,KAAK3D,OAASA,EACd2D,KAAK6E,IAAMA,EACX7E,KAAKipE,OAASA,GAAU,GAI5B,MAAMK,EAAc,CAACztE,EAAMi6C,EAAIvzC,EAAMgnE,KACnC,IAAIV,EAAMtmE,EAAKzJ,MACXgwE,EAAQjtE,EAAMgtE,KAChBE,EAAIltE,EAAM0G,GACL1G,EAAKusE,KACRS,OAAMriE,IAENqiE,GACF/yB,EAAG99C,KAAKuxE,EAAOV,EAAI/vE,MAAO+vE,EAAIzvE,IAAKyC,IAGvCzE,EAAOD,QAnTP,MACE,YAAaqL,GAOX,GANuB,iBAAZA,IACTA,EAAU,CAAE4tD,IAAK5tD,IAEdA,IACHA,EAAU,IAERA,EAAQ4tD,MAA+B,iBAAhB5tD,EAAQ4tD,KAAoB5tD,EAAQ4tD,IAAM,GACnE,MAAM,IAAIn0D,UAAU,qCAEV+D,KAAKioE,GAAOzlE,EAAQ4tD,KAAOxW,IAAvC,MAEM4vB,EAAKhnE,EAAQnG,QAAUssE,EAG7B,GAFA3oE,KAAKmoE,GAAoC,mBAAPqB,EAAqBb,EAAca,EACrExpE,KAAKooE,GAAe5lE,EAAQinE,QAAS,EACjCjnE,EAAQymE,QAAoC,iBAAnBzmE,EAAQymE,OACnC,MAAM,IAAIhtE,UAAU,2BACtB+D,KAAKqoE,GAAW7lE,EAAQymE,QAAU,EAClCjpE,KAAKsoE,GAAW9lE,EAAQknE,QACxB1pE,KAAKuoE,GAAqB/lE,EAAQmnE,iBAAkB,EACpD3pE,KAAK0oE,GAAqBlmE,EAAQonE,iBAAkB,EACpD5pE,KAAK6pE,QAIP,QAASC,GACP,GAAkB,iBAAPA,GAAmBA,EAAK,EACjC,MAAM,IAAI7tE,UAAU,qCAEtB+D,KAAKioE,GAAO6B,GAAMlwB,IAClB94C,EAAKd,MAEP,UACE,OAAOA,KAAKioE,GAGd,eAAgB8B,GACd/pE,KAAKooE,KAAiB2B,EAExB,iBACE,OAAO/pE,KAAKooE,GAGd,WAAY4B,GACV,GAAkB,iBAAPA,EACT,MAAM,IAAI/tE,UAAU,wCAEtB+D,KAAKqoE,GAAW2B,EAChBlpE,EAAKd,MAEP,aACE,OAAOA,KAAKqoE,GAId,qBAAsB4B,GACF,mBAAPA,IACTA,EAAKtB,GAEHsB,IAAOjqE,KAAKmoE,KACdnoE,KAAKmoE,GAAqB8B,EAC1BjqE,KAAKkoE,GAAU,EACfloE,KAAKwoE,GAAU9lE,QAAQmmE,IACrBA,EAAIxsE,OAAS2D,KAAKmoE,GAAmBU,EAAI/vE,MAAO+vE,EAAIzvE,KACpD4G,KAAKkoE,IAAWW,EAAIxsE,UAGxByE,EAAKd,MAEP,uBAA0B,OAAOA,KAAKmoE,GAEtC,aAAgB,OAAOnoE,KAAKkoE,GAC5B,gBAAmB,OAAOloE,KAAKwoE,GAAUnsE,OAEzC,SAAUy5C,EAAIyzB,GACZA,EAAQA,GAASvpE,KACjB,IAAK,IAAImpE,EAASnpE,KAAKwoE,GAAU9rB,KAAiB,OAAXysB,GAAkB,CACvD,MAAM/nC,EAAO+nC,EAAO/nC,KACpBkoC,EAAYtpE,KAAM81C,EAAIqzB,EAAQI,GAC9BJ,EAAS/nC,GAIb,QAAS0U,EAAIyzB,GACXA,EAAQA,GAASvpE,KACjB,IAAK,IAAImpE,EAASnpE,KAAKwoE,GAAU/rB,KAAiB,OAAX0sB,GAAkB,CACvD,MAAMtsD,EAAOssD,EAAOtsD,KACpBysD,EAAYtpE,KAAM81C,EAAIqzB,EAAQI,GAC9BJ,EAAStsD,GAIb,OACE,OAAO7c,KAAKwoE,GAAU0B,UAAU/jE,IAAIjI,GAAKA,EAAE9E,KAG7C,SACE,OAAO4G,KAAKwoE,GAAU0B,UAAU/jE,IAAIjI,GAAKA,EAAEpF,OAG7C,QACMkH,KAAKsoE,IACLtoE,KAAKwoE,IACLxoE,KAAKwoE,GAAUnsE,QACjB2D,KAAKwoE,GAAU9lE,QAAQmmE,GAAO7oE,KAAKsoE,GAASO,EAAIzvE,IAAKyvE,EAAI/vE,QAG3DkH,KAAKyoE,GAAS,IAAIn4D,IAClBtQ,KAAKwoE,GAAY,IAAIR,EACrBhoE,KAAKkoE,GAAU,EAGjB,OACE,OAAOloE,KAAKwoE,GAAUriE,IAAI0iE,IACxBC,EAAQ9oE,KAAM6oE,IAAe,CAC3B3qE,EAAG2qE,EAAIzvE,IACPyV,EAAGg6D,EAAI/vE,MACP4O,EAAGmhE,EAAIhkE,KAAOgkE,EAAII,QAAU,KAC3BiB,UAAUx3D,OAAO5B,GAAKA,GAG7B,UACE,OAAO9Q,KAAKwoE,GAGd,IAAKpvE,EAAKN,EAAOmwE,GAGf,IAFAA,EAASA,GAAUjpE,KAAKqoE,KAEQ,iBAAXY,EACnB,MAAM,IAAIhtE,UAAU,2BAEtB,MAAM4I,EAAMokE,EAASnkE,KAAKD,MAAQ,EAC5B1G,EAAM6B,KAAKmoE,GAAmBrvE,EAAOM,GAE3C,GAAI4G,KAAKyoE,GAAOv0C,IAAI96B,GAAM,CACxB,GAAI+E,EAAM6B,KAAKioE,GAEb,OADAc,EAAI/oE,KAAMA,KAAKyoE,GAAO/vE,IAAIU,KACnB,EAGT,MACM4Q,EADOhK,KAAKyoE,GAAO/vE,IAAIU,GACXN,MAgBlB,OAZIkH,KAAKsoE,KACFtoE,KAAKuoE,IACRvoE,KAAKsoE,GAASlvE,EAAK4Q,EAAKlR,QAG5BkR,EAAKnF,IAAMA,EACXmF,EAAKi/D,OAASA,EACdj/D,EAAKlR,MAAQA,EACbkH,KAAKkoE,IAAW/pE,EAAM6L,EAAK3N,OAC3B2N,EAAK3N,OAAS8B,EACd6B,KAAKtH,IAAIU,GACT0H,EAAKd,OACE,EAGT,MAAM6oE,EAAM,IAAIQ,EAAMjwE,EAAKN,EAAOqF,EAAK0G,EAAKokE,GAG5C,OAAIJ,EAAIxsE,OAAS2D,KAAKioE,IAChBjoE,KAAKsoE,IACPtoE,KAAKsoE,GAASlvE,EAAKN,IAEd,IAGTkH,KAAKkoE,IAAWW,EAAIxsE,OACpB2D,KAAKwoE,GAAU5mE,QAAQinE,GACvB7oE,KAAKyoE,GAAOl4D,IAAInX,EAAK4G,KAAKwoE,GAAU/rB,MACpC37C,EAAKd,OACE,GAGT,IAAK5G,GACH,IAAK4G,KAAKyoE,GAAOv0C,IAAI96B,GAAM,OAAO,EAClC,MAAMyvE,EAAM7oE,KAAKyoE,GAAO/vE,IAAIU,GAAKN,MACjC,OAAQgwE,EAAQ9oE,KAAM6oE,GAGxB,IAAKzvE,GACH,OAAOV,EAAIsH,KAAM5G,GAAK,GAGxB,KAAMA,GACJ,OAAOV,EAAIsH,KAAM5G,GAAK,GAGxB,MACE,MAAMmJ,EAAOvC,KAAKwoE,GAAU9rB,KAC5B,OAAKn6C,GAGLwmE,EAAI/oE,KAAMuC,GACHA,EAAKzJ,OAHH,KAMX,IAAKM,GACH2vE,EAAI/oE,KAAMA,KAAKyoE,GAAO/vE,IAAIU,IAG5B,KAAM2Q,GAEJ/J,KAAK6pE,QAEL,MAAMhlE,EAAMC,KAAKD,MAEjB,IAAK,IAAI/M,EAAIiS,EAAI1N,OAAS,EAAGvE,GAAK,EAAGA,IAAK,CACxC,MAAM+wE,EAAM9+D,EAAIjS,GACVqyE,EAAYtB,EAAInhE,GAAK,EAC3B,GAAkB,IAAdyiE,EAEFnqE,KAAKuQ,IAAIs4D,EAAI3qE,EAAG2qE,EAAIh6D,OACjB,CACH,MAAMo6D,EAASkB,EAAYtlE,EAEvBokE,EAAS,GACXjpE,KAAKuQ,IAAIs4D,EAAI3qE,EAAG2qE,EAAIh6D,EAAGo6D,KAM/B,QACEjpE,KAAKyoE,GAAO/lE,QAAQ,CAAC5J,EAAOM,IAAQV,EAAIsH,KAAM5G,GAAK,O,cC9PvD,SAASgxE,EAAmBC,EAAKt3C,EAAS2G,EAAQ4wC,EAAOC,EAAQnxE,EAAKosD,GACpE,IACE,IAAI/pD,EAAO4uE,EAAIjxE,GAAKosD,GAChB1sD,EAAQ2C,EAAK3C,MACjB,MAAO4C,GAEP,YADAg+B,EAAOh+B,GAILD,EAAKuY,KACP+e,EAAQj6B,GAER2gC,QAAQ1G,QAAQj6B,GAAOgjC,KAAKwuC,EAAOC,GAwBvCnzE,EAAOD,QApBP,SAA2B2+C,GACzB,OAAO,WACL,IAAIj6C,EAAOmE,KACP8B,EAAO+U,UACX,OAAO,IAAI4iB,SAAQ,SAAU1G,EAAS2G,GACpC,IAAI2wC,EAAMv0B,EAAG5zC,MAAMrG,EAAMiG,GAEzB,SAASwoE,EAAMxxE,GACbsxE,EAAmBC,EAAKt3C,EAAS2G,EAAQ4wC,EAAOC,EAAQ,OAAQzxE,GAGlE,SAASyxE,EAAOvyC,GACdoyC,EAAmBC,EAAKt3C,EAAS2G,EAAQ4wC,EAAOC,EAAQ,QAASvyC,GAGnEsyC,OAAM9jE,QAMZpP,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,8BCrCxE,2EAIA,MAAM,IAAE4U,GAAQ,IAGV28D,EAAiB,mDACjBC,EAAqB,CACzB,KAAM,KAAM,IAAK,IAAK,IAAK,IAC3B,EAAK,KAAM,EAAK,KAAM,EAAK,KAAM,EAAK,KAAM,EAAK,KACjD,EAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAK,IAAK,IAAK,IACjE,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IACjE,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAEzCC,EAAkB,6BAElBC,EAAkB,CACtBC,MAAM,EACNC,eAAe,EACfC,qBAAqB,EACrBC,WAAW,EACXC,QAAQ,EACRC,UAAU,EACVC,UAAU,EACVC,aAAa,EACbC,YAAY,GAERC,EAAgB,MAGP,MAAMC,EACnB,YAAY9oE,GAwBV,GArBAxC,KAAK4qE,KAAO,oCACZ5qE,KAAK6qE,cAAgB,0CACrB7qE,KAAK8qE,oBAAsB,2BAC3B9qE,KAAKurE,wBAA0B,2BAC/BvrE,KAAK+qE,UAAY,4CACjB/qE,KAAKwyB,QAAU,6XACfxyB,KAAKwrE,UAAY,qjCACjBxrE,KAAKyrE,UAAY,gZACjBzrE,KAAKgrE,OAAS,+ZACdhrE,KAAK0rE,QAAU,kFACf1rE,KAAK2rE,SAAW,4CAChB3rE,KAAK4rE,SAAW,uBAChB5rE,KAAK6rE,eAAiB,oCACtB7rE,KAAK8rE,iBAAmB,4BACxB9rE,KAAKirE,SAAW,4CAChBjrE,KAAKkrE,SAAW,cAChBlrE,KAAKmrE,YAAc,UACnBnrE,KAAKorE,WAAa,mBAClB5oE,EAAUA,GAAW,GAGjBxC,KAAKqrD,YAAc7oD,EAAQupE,SAAU,CACvC/rE,KAAKgsE,SAAU,EAEf,IAAK,MAAM5yE,KAAO4G,OACV5G,KAAOuxE,IAAoB3qE,KAAK5G,aAAgBqF,SACpDuB,KAAK5G,GAAOiyE,QAKhBrrE,KAAKgsE,SAAyB,IAAfxpE,EAAQypE,GAGzBjsE,KAAKksE,YAAc1pE,EAAQ2pE,SAE3BnsE,KAAKosE,mBAAqB,EAM5B,eAAerqE,EAAUsqE,GAEvB,IAAIz5D,EAAQ5S,KAAKssE,OACjB,MAAMC,EAAiBvsE,KAAKksE,UAC5B,OAAa,CAEX,IAAIM,EAAiBC,EACrB,KAAOD,EAAkBxsE,KAAKirE,SAAS9tE,KAAKyV,IAEtC25D,IAAmBE,EAAUzsE,KAAKkrE,SAAS/tE,KAAKqvE,EAAgB,MAClEzqE,EAAS,KAAM,CAAEgG,KAAM/H,KAAK0sE,MAAO5+D,KAAM,UAAWhV,MAAO2zE,EAAQ,GAAI7yD,OAAQ,KAEjFhH,EAAQA,EAAM2J,OAAOiwD,EAAgB,GAAGnwE,OAAQuW,EAAMvW,QACtD2D,KAAK0sE,QAOP,IAJKF,IAAoBA,EAAkBxsE,KAAKmrE,YAAYhuE,KAAKyV,MAC/DA,EAAQA,EAAM2J,OAAOiwD,EAAgB,GAAGnwE,OAAQuW,EAAMvW,SAGpD2D,KAAKorE,WAAWtnE,KAAK8O,GAQvB,OANIy5D,IAEEE,IAAmBE,EAAUzsE,KAAKkrE,SAAS/tE,KAAKyV,KAClD7Q,EAAS,KAAM,CAAEgG,KAAM/H,KAAK0sE,MAAO5+D,KAAM,UAAWhV,MAAO2zE,EAAQ,GAAI7yD,OAAQ,KACjF7X,EAAS6Q,EAAQ,KAAM,CAAE7K,KAAM/H,KAAK0sE,MAAO5+D,KAAM,MAAOhV,MAAO,GAAI8gB,OAAQ,MAEtE5Z,KAAKssE,OAAS15D,EAIvB,MAAM7K,EAAO/H,KAAK0sE,MAAOC,EAAY/5D,EAAM,GAC3C,IAAI9E,EAAO,GAAIhV,EAAQ,GAAI8gB,EAAS,GAChC9b,EAAQ,KAAM8uE,EAAc,EAAGC,GAAe,EAClD,OAAQF,GACR,IAAK,IAEH,GAAI/5D,EAAMvW,OAAS,EACjB,MAEG,GAAiB,MAAbuW,EAAM,GAUV,CACC5S,KAAKgsE,UACPY,EAAc,EACd9+D,EAAO,KAET,MAXA,GAHA9N,KAAK8sE,gBAAkB,KAEvBl6D,EAAQA,EAAM2J,OAAO,GACJ,MAAb3J,EAAM,GAAY,CACpBi6D,GAAe,EACf,MAYN,IAAK,IAEH,GAAI/uE,EAAQkC,KAAK6qE,cAAc1tE,KAAKyV,GAClC9E,EAAO,MAAOhV,EAAQgF,EAAM,QAEzB,GAAIA,EAAQkC,KAAK4qE,KAAKztE,KAAKyV,GAAQ,CAEtC,GADA9Z,EAAQkH,KAAK+sE,UAAUjvE,EAAM,IACf,OAAVhF,GAAkB4xE,EAAgB5mE,KAAKhL,GACzC,OAAOk0E,EAAkBhtE,MAC3B8N,EAAO,WAGA8E,EAAMvW,OAAS,GAAkB,MAAbuW,EAAM,IACjC9E,EAAO,KAAM8+D,EAAc,GAEpB5sE,KAAKgsE,SAAWp5D,EAAMvW,OAAS,GAAkB,MAAbuW,EAAM,KACjD9E,EAAO,UAAW8+D,EAAc,EAAG9zE,EAAQ,KAC7C,MAEF,IAAK,IACC8Z,EAAMvW,OAAS,GAAkB,MAAbuW,EAAM,KAC5B9E,EAAO,KAAM8+D,EAAc,GAC7B,MAEF,IAAK,MAIE9uE,EAAQkC,KAAKgrE,OAAO7tE,KAAKyV,KAC1By5D,IAAkBvuE,EAAQkC,KAAKgrE,OAAO7tE,KAAQyV,EAAH,SAC7C9E,EAAO,QAAS8L,EAAS,IAAK9gB,EAAQgF,EAAM,IAC9C,MAEF,IAAK,IAEH,GAAIA,EAAQkC,KAAK8qE,oBAAoB3tE,KAAKyV,GACxC9Z,EAAQgF,EAAM,QAId,KADGhF,QAAO8zE,eAAgB5sE,KAAKitE,cAAcr6D,IAC/B,OAAV9Z,EACF,OAAOk0E,EAAkBhtE,MAEf,OAAVlC,GAAkC,IAAhB8uE,IACpB9+D,EAAO,UACP9N,KAAKosE,mBAAqB,GAE5B,MAEF,IAAK,IACH,IAAKpsE,KAAKqrD,UAAW,CAEnB,GAAIvtD,EAAQkC,KAAKurE,wBAAwBpuE,KAAKyV,GAC5C9Z,EAAQgF,EAAM,QAId,KADGhF,QAAO8zE,eAAgB5sE,KAAKitE,cAAcr6D,IAC/B,OAAV9Z,EACF,OAAOk0E,EAAkBhtE,MAEf,OAAVlC,GAAkC,IAAhB8uE,IACpB9+D,EAAO,UACP9N,KAAKosE,mBAAqB,GAG9B,MAEF,IAAK,IAECpsE,KAAKgsE,UAAYluE,EAAQkC,KAAKyrE,UAAUtuE,KAAKyV,MAC/C9E,EAAO,MAAOhV,EAAQgF,EAAM,IAC9B,MAEF,IAAK,IAE0B,YAAzBkC,KAAK8sE,kBAAkChvE,EAAQkC,KAAK+qE,UAAU5tE,KAAKyV,KACrE9E,EAAO,WAAYhV,EAAQgF,EAAM,KAE1BA,EAAQkC,KAAK4rE,SAASzuE,KAAKyV,MAClC9E,EAAOhQ,EAAM,IACf,MAEF,IAAK,IAEH,GAAqB,IAAjB8U,EAAMvW,OAAegwE,EAAiBz5D,EAAM,GAAK,KAAOA,EAAM,GAAK,IAAM,CAC3E9E,EAAO,IACP8+D,EAAc,EACd,MAIJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KAIC9uE,EAAQkC,KAAK0rE,QAAQvuE,KAAKyV,IAC1By5D,IAAkBvuE,EAAQkC,KAAK0rE,QAAQvuE,KAAQyV,EAAH,SAC9C9E,EAAO,UAAWhV,EAAQgF,EAAM,GAChC8b,EAA8B,iBAAb9b,EAAM,GAAkB+P,EAAI7B,OACd,iBAAblO,EAAM,GAAkB+P,EAAI9B,QAAU8B,EAAI5B,SAE9D,MAEF,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KAECnO,EAAQkC,KAAK6rE,eAAe1uE,KAAKyV,IACnC9E,EAAOhQ,EAAM,GAAGq+B,cAEhB0wC,GAAe,EACjB,MAEF,IAAK,IACL,IAAK,KAEC/uE,EAAQkC,KAAK2rE,SAASxuE,KAAKyV,KAC7B9E,EAAO,UAAWhV,EAAQgF,EAAM,GAAI8b,EAAS/L,EAAIhC,SAEjDghE,GAAe,EACjB,MAEF,IAAK,KAEC/uE,EAAQkC,KAAK8rE,iBAAiB3uE,KAAKyV,KACrC9E,EAAO,eAAgBhV,EAAQ,KAE/B+zE,GAAe,EACjB,MAEF,IAAK,IAEC7sE,KAAKgsE,SAAWp5D,EAAMvW,OAAS,IACjCyR,EAAO,eACU,MAAb8E,EAAM,IACRg6D,EAAc,EAAG9zE,EAAQ,MAEzB8zE,EAAc,EAAG9zE,EAAQ,MAE7B,MAEF,IAAK,IACH,IAAKkH,KAAKgsE,QACR,MACJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACEhsE,KAAKqrD,YACRuhB,EAAc,EACd9+D,EAAO6+D,GAET,MAEF,QACEE,GAAe,EAkBjB,GAdIA,IAE4B,YAAzB7sE,KAAK8sE,iBAA0D,WAAzB9sE,KAAK8sE,mBAC3ChvE,EAAQkC,KAAKwyB,QAAQr1B,KAAKyV,MAKrB9U,EAAQkC,KAAKwrE,UAAUruE,KAAKyV,KAC7By5D,IAAkBvuE,EAAQkC,KAAKwrE,UAAUruE,KAAQyV,EAAH,SACrD9E,EAAO,WAAY8L,EAAS9b,EAAM,IAAM,GAAIhF,EAAQkH,KAAK+sE,UAAUjvE,EAAM,MANzEgQ,EAAO,SAAUhV,EAAQgF,EAAM,IAAM,KAUZ,OAAzBkC,KAAK8sE,gBACP,OAAQh/D,GACR,IAAK,WAAYA,EAAO,OAAW,MACnC,IAAK,MAAYA,EAAO,UAAW,MACnC,QAAiBA,EAAO,GAK1B,IAAKA,EAIH,OAAIu+D,IAAmB,YAAYvoE,KAAK8O,IAAU,QAAQ9O,KAAK8O,GACtDo6D,EAAkBhtE,MAElBA,KAAKssE,OAAS15D,EAIzB,MAAMs6D,EAAQ,CAAEnlE,KAAMA,EAAM+F,KAAMA,EAAMhV,MAAOA,EAAO8gB,OAAQA,GAC9D7X,EAAS,KAAMmrE,GACfltE,KAAKmtE,cAAgBD,EACrBltE,KAAK8sE,gBAAkBh/D,EAEvB8E,EAAQA,EAAM2J,OAAOqwD,GAAe9uE,EAAM,GAAGzB,OAAQuW,EAAMvW,QAI7D,SAAS2wE,EAAkBnxE,GAAQkG,EAASlG,EAAKuxE,aAAa,OAAOjwE,KAAKyV,GAAO,MAInF,UAAU5I,GACR,IAAIqjE,GAAU,EACd,MAAMC,EAAWtjE,EAAKjM,QAAQysE,EAAgB,CAAC+C,EAAUC,EAAUC,EAAUC,KAE3E,GAAwB,iBAAbF,EACT,OAAOx+D,OAAOmO,aAAarQ,OAAOsX,SAASopD,EAAU,KAEvD,GAAwB,iBAAbC,EAAuB,CAChC,IAAIE,EAAW7gE,OAAOsX,SAASqpD,EAAU,IACzC,OAAOE,GAAY,MAAS3+D,OAAOmO,aAAarQ,OAAOsX,SAASqpD,EAAU,KACxEz+D,OAAOmO,aAAa,QAAWwwD,GAAY,QAAY,IAAK,OAAqB,KAAXA,IAG1E,OAAID,KAAejD,EACVA,EAAmBiD,IAE5BL,GAAU,EACH,MAET,OAAOA,EAAU,KAAOC,EAI1B,cAAc16D,GAEZ,GAAIA,EAAMvW,QAAU,EAAG,CAErB,MAAMuxE,EAAUh7D,EAAM9U,MAAM,qBAAqB,GAC3C+vE,EAAgBD,EAAQvxE,OAG9B,IAAIyxE,EAAalhE,KAAKwjD,IAAIpwD,KAAKosE,mBAAoByB,GACnD,MAAQC,EAAal7D,EAAM/V,QAAQ+wE,EAASE,IAAe,GAAG,CAE5D,IAAIC,EAAiB,EACrB,KAAkD,OAA3Cn7D,EAAMk7D,EAAaC,EAAiB,IACzCA,IAIF,GAAIA,EAAiB,GAAM,EAAG,CAE5B,MAAMC,EAAMp7D,EAAMqV,UAAU4lD,EAAeC,GACrClmE,EAAQomE,EAAI/tE,MAAM,cAAc5D,OAAS,EACzCuwE,EAAckB,EAAaD,EAEjC,GAAsB,IAAlBA,GAAiC,IAAVjmE,GACL,IAAlBimE,GAAuB7tE,KAAKqrD,UAC9B,MAEF,OADArrD,KAAK0sE,OAAS9kE,EACP,CAAE9O,MAAOkH,KAAK+sE,UAAUiB,GAAMpB,eAEvCkB,IAEF9tE,KAAKosE,mBAAqBx5D,EAAMvW,OAASwxE,EAAgB,EAE3D,MAAO,CAAE/0E,MAAO,GAAI8zE,YAAa,GAInC,aAAaqB,GACXjuE,KAAKssE,OAAS,KACd,MAAMt0C,EAAM,IAAIn4B,MAAM,eAAeouE,cAAkBjuE,KAAK0sE,UAM5D,OALA10C,EAAI/O,QAAU,CACZikD,WAAO1mE,EACPuB,KAAM/H,KAAK0sE,MACXS,cAAentE,KAAKmtE,eAEfn1C,EAIT,iBAAiBplB,GACf,OAAOA,EAAMktB,WAAW,UAAYltB,EAAM2J,OAAO,GAAK3J,EAOxD,SAASA,EAAO7Q,GAId,GAHA/B,KAAK0sE,MAAQ,EAGQ,iBAAV95D,EAAoB,CAG7B,GAFA5S,KAAKssE,OAAStsE,KAAKkuE,iBAAiBt7D,GAEZ,mBAAb7Q,EAGN,CACH,MAAMosE,EAAS,GACf,IAAIzyE,EAEJ,GADAsE,KAAKouE,eAAe,CAAC1mE,EAAG3O,IAAM2O,EAAKhM,EAAQgM,EAAKymE,EAAO5sE,KAAKxI,IAAI,GAC5D2C,EAAO,MAAMA,EACjB,OAAOyyE,EAPP,IAAe,IAAMnuE,KAAKouE,eAAersE,GAAU,SAYrD/B,KAAKquE,eAAiB,KACW,mBAAtBz7D,EAAM07D,aACf17D,EAAM07D,YAAY,QAEpB17D,EAAMisC,GAAG,OAAQx1C,IACK,OAAhBrJ,KAAKssE,QAAmC,IAAhBjjE,EAAKhN,SAE3B2D,KAAKquE,iBACPhlE,EAAOklE,EAAOhoE,OAAO,CAACvG,KAAKquE,eAAgBhlE,IAC3CrJ,KAAKquE,eAAiB,MAGI,IAAxBhlE,EAAKA,EAAKhN,OAAS,GACrB2D,KAAKquE,eAAiBhlE,QAKK,IAAhBrJ,KAAKssE,OACdtsE,KAAKssE,OAAStsE,KAAKkuE,iBAAiC,iBAAT7kE,EAAoBA,EAAOA,EAAKxB,YAE3E7H,KAAKssE,QAAUjjE,EACjBrJ,KAAKouE,eAAersE,GAAU,OAKpC6Q,EAAMisC,GAAG,MAAO,KACa,iBAAhB7+C,KAAKssE,QACdtsE,KAAKouE,eAAersE,GAAU,KAElC6Q,EAAMisC,GAAG,QAAS98C,O,2CC3exB;AACA,IAAI+uC,EAEJ15C,EAAOD,QAAoC,mBAAnB6+C,eACpBA,eAAe38C,KAAuB,oBAAX7B,OAAyBA,OAAS4iC,GAE7D/kB,IAAOy7B,IAAYA,EAAUrX,QAAQ1G,YACpC+I,KAAKzmB,GACL2pB,MAAMhH,GAAO/G,WAAW,KAAQ,MAAM+G,GAAO,M,kECRlD,SAASw2C,EAAgBl2E,EAAGqB,GAO1B,OANAvC,EAAOD,QAAUq3E,EAAkBj2E,OAAO6H,gBAAkB,SAAyB9H,EAAGqB,GAEtF,OADArB,EAAEgI,UAAY3G,EACPrB,GAGTlB,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,EACjEu1E,EAAgBl2E,EAAGqB,GAG5BvC,EAAOD,QAAUq3E,EACjBp3E,EAAOD,QAAiB,QAAIC,EAAOD,QAASC,EAAOD,QAAQ8B,YAAa,G,gBCJxE,IAAIw1E,EAAW,SAAUt3E,GACvB,aAEA,IAAIu3E,EAAKn2E,OAAOkB,UACZk1E,EAASD,EAAGh1E,eAEZk1E,EAA4B,mBAAXh2E,OAAwBA,OAAS,GAClDi2E,EAAiBD,EAAQrgE,UAAY,aACrCugE,EAAsBF,EAAQ11B,eAAiB,kBAC/C61B,EAAoBH,EAAQ/1E,aAAe,gBAE/C,SAASvB,EAAOuC,EAAKT,EAAKN,GAOxB,OANAP,OAAOC,eAAeqB,EAAKT,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZqB,cAAc,EACdC,UAAU,IAELF,EAAIT,GAEb,IAEE9B,EAAO,GAAI,IACX,MAAO0gC,GACP1gC,EAAS,SAASuC,EAAKT,EAAKN,GAC1B,OAAOe,EAAIT,GAAON,GAItB,SAASw9C,EAAK04B,EAASC,EAASpzE,EAAMqzE,GAEpC,IAAIC,EAAiBF,GAAWA,EAAQx1E,qBAAqB21E,EAAYH,EAAUG,EAC/E12B,EAAYngD,OAAOY,OAAOg2E,EAAe11E,WACzCwvB,EAAU,IAAIomD,EAAQH,GAAe,IAMzC,OAFAx2B,EAAU42B,QAuMZ,SAA0BN,EAASnzE,EAAMotB,GACvC,IAAI6T,EAhLuB,iBAkL3B,OAAO,SAAgBZ,EAAQspB,GAC7B,GAjLoB,cAiLhB1oB,EACF,MAAM,IAAIj9B,MAAM,gCAGlB,GApLoB,cAoLhBi9B,EAA6B,CAC/B,GAAe,UAAXZ,EACF,MAAMspB,EAKR,OAAO+pB,IAMT,IAHAtmD,EAAQiT,OAASA,EACjBjT,EAAQu8B,IAAMA,IAED,CACX,IAAIgqB,EAAWvmD,EAAQumD,SACvB,GAAIA,EAAU,CACZ,IAAIC,EAAiBC,EAAoBF,EAAUvmD,GACnD,GAAIwmD,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,SACzC,OAAOF,GAIX,GAAuB,SAAnBxmD,EAAQiT,OAGVjT,EAAQ2mD,KAAO3mD,EAAQ4mD,MAAQ5mD,EAAQu8B,SAElC,GAAuB,UAAnBv8B,EAAQiT,OAAoB,CACrC,GApNqB,mBAoNjBY,EAEF,MADAA,EAlNc,YAmNR7T,EAAQu8B,IAGhBv8B,EAAQ6mD,kBAAkB7mD,EAAQu8B,SAEN,WAAnBv8B,EAAQiT,QACjBjT,EAAQ8mD,OAAO,SAAU9mD,EAAQu8B,KAGnC1oB,EA7NkB,YA+NlB,IAAIkzC,EAASC,EAASjB,EAASnzE,EAAMotB,GACrC,GAAoB,WAAhB+mD,EAAOliE,KAAmB,CAO5B,GAJAgvB,EAAQ7T,EAAQjV,KAlOA,YAFK,iBAwOjBg8D,EAAOxqB,MAAQmqB,EACjB,SAGF,MAAO,CACL72E,MAAOk3E,EAAOxqB,IACdxxC,KAAMiV,EAAQjV,MAGS,UAAhBg8D,EAAOliE,OAChBgvB,EAhPgB,YAmPhB7T,EAAQiT,OAAS,QACjBjT,EAAQu8B,IAAMwqB,EAAOxqB,OA/QP0qB,CAAiBlB,EAASnzE,EAAMotB,GAE7CyvB,EAcT,SAASu3B,EAASn6B,EAAIj8C,EAAK2rD,GACzB,IACE,MAAO,CAAE13C,KAAM,SAAU03C,IAAK1P,EAAG99C,KAAK6B,EAAK2rD,IAC3C,MAAOxtB,GACP,MAAO,CAAElqB,KAAM,QAAS03C,IAAKxtB,IAhBjC7gC,EAAQm/C,KAAOA,EAoBf,IAOIq5B,EAAmB,GAMvB,SAASP,KACT,SAASe,KACT,SAASC,KAIT,IAAIC,EAAoB,GACxB/4E,EAAO+4E,EAAmBxB,GAAgB,WACxC,OAAO7uE,QAGT,IAAIswE,EAAW/3E,OAAO8H,eAClBkwE,EAA0BD,GAAYA,EAASA,EAAS79D,EAAO,MAC/D89D,GACAA,IAA4B7B,GAC5BC,EAAO32E,KAAKu4E,EAAyB1B,KAGvCwB,EAAoBE,GAGtB,IAAIC,EAAKJ,EAA2B32E,UAClC21E,EAAU31E,UAAYlB,OAAOY,OAAOk3E,GAYtC,SAASI,EAAsBh3E,GAC7B,CAAC,OAAQ,QAAS,UAAUiJ,SAAQ,SAASw5B,GAC3C5kC,EAAOmC,EAAWyiC,GAAQ,SAASspB,GACjC,OAAOxlD,KAAKsvE,QAAQpzC,EAAQspB,SAkClC,SAASkrB,EAAch4B,EAAWi4B,GAgChC,IAAIC,EAgCJ5wE,KAAKsvE,QA9BL,SAAiBpzC,EAAQspB,GACvB,SAASqrB,IACP,OAAO,IAAIF,GAAY,SAAS59C,EAAS2G,IAnC7C,SAASo3C,EAAO50C,EAAQspB,EAAKzyB,EAAS2G,GACpC,IAAIs2C,EAASC,EAASv3B,EAAUxc,GAASwc,EAAW8M,GACpD,GAAoB,UAAhBwqB,EAAOliE,KAEJ,CACL,IAAInN,EAASqvE,EAAOxqB,IAChB1sD,EAAQ6H,EAAO7H,MACnB,OAAIA,GACiB,iBAAVA,GACP61E,EAAO32E,KAAKc,EAAO,WACd63E,EAAY59C,QAAQj6B,EAAMi4E,SAASj1C,MAAK,SAAShjC,GACtDg4E,EAAO,OAAQh4E,EAAOi6B,EAAS2G,MAC9B,SAAS1B,GACV84C,EAAO,QAAS94C,EAAKjF,EAAS2G,MAI3Bi3C,EAAY59C,QAAQj6B,GAAOgjC,MAAK,SAASk1C,GAI9CrwE,EAAO7H,MAAQk4E,EACfj+C,EAAQpyB,MACP,SAASjF,GAGV,OAAOo1E,EAAO,QAASp1E,EAAOq3B,EAAS2G,MAvBzCA,EAAOs2C,EAAOxqB,KAiCZsrB,CAAO50C,EAAQspB,EAAKzyB,EAAS2G,MAIjC,OAAOk3C,EAaLA,EAAkBA,EAAgB90C,KAChC+0C,EAGAA,GACEA,KAkHV,SAASnB,EAAoBF,EAAUvmD,GACrC,IAAIiT,EAASszC,EAASjhE,SAAS0a,EAAQiT,QACvC,QA3TE11B,IA2TE01B,EAAsB,CAKxB,GAFAjT,EAAQumD,SAAW,KAEI,UAAnBvmD,EAAQiT,OAAoB,CAE9B,GAAIszC,EAASjhE,SAAiB,SAG5B0a,EAAQiT,OAAS,SACjBjT,EAAQu8B,SAtUZh/C,EAuUIkpE,EAAoBF,EAAUvmD,GAEP,UAAnBA,EAAQiT,QAGV,OAAOyzC,EAIX1mD,EAAQiT,OAAS,QACjBjT,EAAQu8B,IAAM,IAAIvpD,UAChB,kDAGJ,OAAO0zE,EAGT,IAAIK,EAASC,EAAS/zC,EAAQszC,EAASjhE,SAAU0a,EAAQu8B,KAEzD,GAAoB,UAAhBwqB,EAAOliE,KAIT,OAHAmb,EAAQiT,OAAS,QACjBjT,EAAQu8B,IAAMwqB,EAAOxqB,IACrBv8B,EAAQumD,SAAW,KACZG,EAGT,IAAIl0E,EAAOu0E,EAAOxqB,IAElB,OAAM/pD,EAOFA,EAAKuY,MAGPiV,EAAQumD,EAASyB,YAAcx1E,EAAK3C,MAGpCmwB,EAAQpM,KAAO2yD,EAAS0B,QAQD,WAAnBjoD,EAAQiT,SACVjT,EAAQiT,OAAS,OACjBjT,EAAQu8B,SA1XVh/C,GAoYFyiB,EAAQumD,SAAW,KACZG,GANEl0E,GA3BPwtB,EAAQiT,OAAS,QACjBjT,EAAQu8B,IAAM,IAAIvpD,UAAU,oCAC5BgtB,EAAQumD,SAAW,KACZG,GAoDX,SAASwB,EAAaC,GACpB,IAAIl7C,EAAQ,CAAEm7C,OAAQD,EAAK,IAEvB,KAAKA,IACPl7C,EAAMo7C,SAAWF,EAAK,IAGpB,KAAKA,IACPl7C,EAAMq7C,WAAaH,EAAK,GACxBl7C,EAAMs7C,SAAWJ,EAAK,IAGxBpxE,KAAKyxE,WAAWlwE,KAAK20B,GAGvB,SAASw7C,EAAcx7C,GACrB,IAAI85C,EAAS95C,EAAMy7C,YAAc,GACjC3B,EAAOliE,KAAO,gBACPkiE,EAAOxqB,IACdtvB,EAAMy7C,WAAa3B,EAGrB,SAASX,EAAQH,GAIflvE,KAAKyxE,WAAa,CAAC,CAAEJ,OAAQ,SAC7BnC,EAAYxsE,QAAQyuE,EAAcnxE,MAClCA,KAAK6pE,OAAM,GA8Bb,SAASp3D,EAAOm/D,GACd,GAAIA,EAAU,CACZ,IAAIC,EAAiBD,EAAS/C,GAC9B,GAAIgD,EACF,OAAOA,EAAe75E,KAAK45E,GAG7B,GAA6B,mBAAlBA,EAAS/0D,KAClB,OAAO+0D,EAGT,IAAKviE,MAAMuiE,EAASv1E,QAAS,CAC3B,IAAIxE,GAAK,EAAGglB,EAAO,SAASA,IAC1B,OAAShlB,EAAI+5E,EAASv1E,QACpB,GAAIsyE,EAAO32E,KAAK45E,EAAU/5E,GAGxB,OAFAglB,EAAK/jB,MAAQ84E,EAAS/5E,GACtBglB,EAAK7I,MAAO,EACL6I,EAOX,OAHAA,EAAK/jB,WA1eT0N,EA2eIqW,EAAK7I,MAAO,EAEL6I,GAGT,OAAOA,EAAKA,KAAOA,GAKvB,MAAO,CAAEA,KAAM0yD,GAIjB,SAASA,IACP,MAAO,CAAEz2E,WA1fP0N,EA0fyBwN,MAAM,GA+MnC,OA7mBAm8D,EAAkB12E,UAAY22E,EAC9B94E,EAAOk5E,EAAI,cAAeJ,GAC1B94E,EAAO84E,EAA4B,cAAeD,GAClDA,EAAkB2B,YAAcx6E,EAC9B84E,EACArB,EACA,qBAaF53E,EAAQ46E,oBAAsB,SAASC,GACrC,IAAIC,EAAyB,mBAAXD,GAAyBA,EAAOvpE,YAClD,QAAOwpE,IACHA,IAAS9B,GAG2B,uBAAnC8B,EAAKH,aAAeG,EAAK75E,QAIhCjB,EAAQ+6E,KAAO,SAASF,GAQtB,OAPIz5E,OAAO6H,eACT7H,OAAO6H,eAAe4xE,EAAQ5B,IAE9B4B,EAAO1xE,UAAY8vE,EACnB94E,EAAO06E,EAAQjD,EAAmB,sBAEpCiD,EAAOv4E,UAAYlB,OAAOY,OAAOq3E,GAC1BwB,GAOT76E,EAAQg7E,MAAQ,SAAS3sB,GACvB,MAAO,CAAEurB,QAASvrB,IAsEpBirB,EAAsBC,EAAcj3E,WACpCnC,EAAOo5E,EAAcj3E,UAAWq1E,GAAqB,WACnD,OAAO9uE,QAET7I,EAAQu5E,cAAgBA,EAKxBv5E,EAAQs7B,MAAQ,SAASu8C,EAASC,EAASpzE,EAAMqzE,EAAayB,QACxC,IAAhBA,IAAwBA,EAAcl3C,SAE1C,IAAI24C,EAAO,IAAI1B,EACbp6B,EAAK04B,EAASC,EAASpzE,EAAMqzE,GAC7ByB,GAGF,OAAOx5E,EAAQ46E,oBAAoB9C,GAC/BmD,EACAA,EAAKv1D,OAAOif,MAAK,SAASn7B,GACxB,OAAOA,EAAOqT,KAAOrT,EAAO7H,MAAQs5E,EAAKv1D,WAuKjD4zD,EAAsBD,GAEtBl5E,EAAOk5E,EAAIzB,EAAmB,aAO9Bz3E,EAAOk5E,EAAI3B,GAAgB,WACzB,OAAO7uE,QAGT1I,EAAOk5E,EAAI,YAAY,WACrB,MAAO,wBAkCTr5E,EAAQgY,KAAO,SAAS5V,GACtB,IAAI4V,EAAO,GACX,IAAK,IAAI/V,KAAOG,EACd4V,EAAK5N,KAAKnI,GAMZ,OAJA+V,EAAKolB,UAIE,SAAS1X,IACd,KAAO1N,EAAK9S,QAAQ,CAClB,IAAIjD,EAAM+V,EAAK1K,MACf,GAAIrL,KAAOG,EAGT,OAFAsjB,EAAK/jB,MAAQM,EACbyjB,EAAK7I,MAAO,EACL6I,EAQX,OADAA,EAAK7I,MAAO,EACL6I,IAsCX1lB,EAAQsb,OAASA,EAMjB48D,EAAQ51E,UAAY,CAClBgP,YAAa4mE,EAEbxF,MAAO,SAASwI,GAcd,GAbAryE,KAAKohC,KAAO,EACZphC,KAAK6c,KAAO,EAGZ7c,KAAK4vE,KAAO5vE,KAAK6vE,WArgBjBrpE,EAsgBAxG,KAAKgU,MAAO,EACZhU,KAAKwvE,SAAW,KAEhBxvE,KAAKk8B,OAAS,OACdl8B,KAAKwlD,SA1gBLh/C,EA4gBAxG,KAAKyxE,WAAW/uE,QAAQgvE,IAEnBW,EACH,IAAK,IAAIj6E,KAAQ4H,KAEQ,MAAnB5H,EAAK4P,OAAO,IACZ2mE,EAAO32E,KAAKgI,KAAM5H,KACjBiX,OAAOjX,EAAK0E,MAAM,MACrBkD,KAAK5H,QAphBXoO,IA0hBF8rE,KAAM,WACJtyE,KAAKgU,MAAO,EAEZ,IACIu+D,EADYvyE,KAAKyxE,WAAW,GACLE,WAC3B,GAAwB,UAApBY,EAAWzkE,KACb,MAAMykE,EAAW/sB,IAGnB,OAAOxlD,KAAKqQ,MAGdy/D,kBAAmB,SAAS0C,GAC1B,GAAIxyE,KAAKgU,KACP,MAAMw+D,EAGR,IAAIvpD,EAAUjpB,KACd,SAASqmE,EAAOoM,EAAKC,GAYnB,OAXA1C,EAAOliE,KAAO,QACdkiE,EAAOxqB,IAAMgtB,EACbvpD,EAAQpM,KAAO41D,EAEXC,IAGFzpD,EAAQiT,OAAS,OACjBjT,EAAQu8B,SArjBZh/C,KAwjBYksE,EAGZ,IAAK,IAAI76E,EAAImI,KAAKyxE,WAAWp1E,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CACpD,IAAIq+B,EAAQl2B,KAAKyxE,WAAW55E,GACxBm4E,EAAS95C,EAAMy7C,WAEnB,GAAqB,SAAjBz7C,EAAMm7C,OAIR,OAAOhL,EAAO,OAGhB,GAAInwC,EAAMm7C,QAAUrxE,KAAKohC,KAAM,CAC7B,IAAIuxC,EAAWhE,EAAO32E,KAAKk+B,EAAO,YAC9B08C,EAAajE,EAAO32E,KAAKk+B,EAAO,cAEpC,GAAIy8C,GAAYC,EAAY,CAC1B,GAAI5yE,KAAKohC,KAAOlL,EAAMo7C,SACpB,OAAOjL,EAAOnwC,EAAMo7C,UAAU,GACzB,GAAItxE,KAAKohC,KAAOlL,EAAMq7C,WAC3B,OAAOlL,EAAOnwC,EAAMq7C,iBAGjB,GAAIoB,GACT,GAAI3yE,KAAKohC,KAAOlL,EAAMo7C,SACpB,OAAOjL,EAAOnwC,EAAMo7C,UAAU,OAG3B,KAAIsB,EAMT,MAAM,IAAI/yE,MAAM,0CALhB,GAAIG,KAAKohC,KAAOlL,EAAMq7C,WACpB,OAAOlL,EAAOnwC,EAAMq7C,gBAU9BxB,OAAQ,SAASjiE,EAAM03C,GACrB,IAAK,IAAI3tD,EAAImI,KAAKyxE,WAAWp1E,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CACpD,IAAIq+B,EAAQl2B,KAAKyxE,WAAW55E,GAC5B,GAAIq+B,EAAMm7C,QAAUrxE,KAAKohC,MACrButC,EAAO32E,KAAKk+B,EAAO,eACnBl2B,KAAKohC,KAAOlL,EAAMq7C,WAAY,CAChC,IAAIsB,EAAe38C,EACnB,OAIA28C,IACU,UAAT/kE,GACS,aAATA,IACD+kE,EAAaxB,QAAU7rB,GACvBA,GAAOqtB,EAAatB,aAGtBsB,EAAe,MAGjB,IAAI7C,EAAS6C,EAAeA,EAAalB,WAAa,GAItD,OAHA3B,EAAOliE,KAAOA,EACdkiE,EAAOxqB,IAAMA,EAETqtB,GACF7yE,KAAKk8B,OAAS,OACdl8B,KAAK6c,KAAOg2D,EAAatB,WAClB5B,GAGF3vE,KAAK8yE,SAAS9C,IAGvB8C,SAAU,SAAS9C,EAAQwB,GACzB,GAAoB,UAAhBxB,EAAOliE,KACT,MAAMkiE,EAAOxqB,IAcf,MAXoB,UAAhBwqB,EAAOliE,MACS,aAAhBkiE,EAAOliE,KACT9N,KAAK6c,KAAOmzD,EAAOxqB,IACM,WAAhBwqB,EAAOliE,MAChB9N,KAAKqQ,KAAOrQ,KAAKwlD,IAAMwqB,EAAOxqB,IAC9BxlD,KAAKk8B,OAAS,SACdl8B,KAAK6c,KAAO,OACa,WAAhBmzD,EAAOliE,MAAqB0jE,IACrCxxE,KAAK6c,KAAO20D,GAGP7B,GAGToD,OAAQ,SAASxB,GACf,IAAK,IAAI15E,EAAImI,KAAKyxE,WAAWp1E,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CACpD,IAAIq+B,EAAQl2B,KAAKyxE,WAAW55E,GAC5B,GAAIq+B,EAAMq7C,aAAeA,EAGvB,OAFAvxE,KAAK8yE,SAAS58C,EAAMy7C,WAAYz7C,EAAMs7C,UACtCE,EAAcx7C,GACPy5C,IAKb,MAAS,SAAS0B,GAChB,IAAK,IAAIx5E,EAAImI,KAAKyxE,WAAWp1E,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CACpD,IAAIq+B,EAAQl2B,KAAKyxE,WAAW55E,GAC5B,GAAIq+B,EAAMm7C,SAAWA,EAAQ,CAC3B,IAAIrB,EAAS95C,EAAMy7C,WACnB,GAAoB,UAAhB3B,EAAOliE,KAAkB,CAC3B,IAAIklE,EAAShD,EAAOxqB,IACpBksB,EAAcx7C,GAEhB,OAAO88C,GAMX,MAAM,IAAInzE,MAAM,0BAGlBozE,cAAe,SAASrB,EAAUX,EAAYC,GAa5C,OAZAlxE,KAAKwvE,SAAW,CACdjhE,SAAUkE,EAAOm/D,GACjBX,WAAYA,EACZC,QAASA,GAGS,SAAhBlxE,KAAKk8B,SAGPl8B,KAAKwlD,SA9rBPh/C,GAisBOmpE,IAQJx4E,EA9sBK,CAqtBiBC,EAAOD,SAGtC,IACE+7E,mBAAqBzE,EACrB,MAAO0E,GAWmB,iBAAfC,WACTA,WAAWF,mBAAqBzE,EAEhC5hC,SAAS,IAAK,yBAAdA,CAAwC4hC,K,cC/uB5Cr3E,EAAOD,QAAU,SAASk8E,GACzB,IAAKA,EAAeC,gBAAiB,CACpC,IAAIl8E,EAASmB,OAAOY,OAAOk6E,GAEtBj8E,EAAOquC,WAAUruC,EAAOquC,SAAW,IACxCltC,OAAOC,eAAepB,EAAQ,SAAU,CACvCqB,YAAY,EACZC,IAAK,WACJ,OAAOtB,EAAOU,KAGhBS,OAAOC,eAAepB,EAAQ,KAAM,CACnCqB,YAAY,EACZC,IAAK,WACJ,OAAOtB,EAAOS,KAGhBU,OAAOC,eAAepB,EAAQ,UAAW,CACxCqB,YAAY,IAEbrB,EAAOk8E,gBAAkB,EAE1B,OAAOl8E,I,6BCcR,MAAMm8E,EAAY,EAAQ,IACpBC,EAAY,EAAQ,IACpBC,EAAgB,EAAQ,IACxBC,EAAgB,EAAQ,IAG9B,IAAIC,EACJ,IACEA,EAAoB,EAAQ,IAC5B,MAAMjsE,IAER,MAAM+G,EAAM,GACZrX,EAAOD,QAAUsX,EAGjBA,EAAImgD,OAAS,EAAQ,IACrBngD,EAAIoB,iBAAmB,EAAQ,IAS/BpB,EAAImlE,mBAAqB,SAASnlE,GAIhC,OAHGA,IACDklE,EAAoBllE,GAEfklE,GAcTllE,EAAI+/C,SAAW/7B,eAAeqgC,EAAStwD,GAMrC,GAJImM,MAAMD,QAAQokD,KAChBA,EAAUrkD,EAAImgD,OAAOmG,qBAAqBjC,IAGzCtwD,EAAQqxE,UAAW,CACpB,IAAIF,EACF,MAAM,IAAI9zE,MAAM,qCAGlB,OAAO,IAAI45B,QAAQ,CAAC1G,EAAS2G,IAC3Bi6C,EAAkBnlB,SAASsE,EAAStwD,EAAS,CAACw1B,EAAK87C,IACjD97C,EAAM0B,EAAO1B,GAAOjF,EAAQ+gD,KAGlC,GAAyB,cAAtBtxE,EAAQkwD,UACT,OAAO,IAAI6gB,EAAU/wE,GAASuxE,KAAKjhB,GAErC,GAAyB,cAAtBtwD,EAAQkwD,UACT,OAAO,IAAI8gB,EAAUhxE,GAASuxE,KAAKjhB,GAErC,KAAK,cAAetwD,GAClB,MAAM,IAAI3C,MAAM,wDAElB,MAAM,IAAIA,MACR,mDAAqD2C,EAAQkwD,YAgBjEjkD,EAAIulE,cAAgB,SAASlhB,EAAStwD,GAMpC,GAJImM,MAAMD,QAAQokD,KAChBA,EAAUrkD,EAAImgD,OAAOmG,qBAAqBjC,IAGzCtwD,EAAQqxE,UAAW,CACpB,GAAGF,EACD,OAAOA,EAAkBM,aAAanhB,EAAStwD,GAEjD,MAAM,IAAI3C,MAAM,qCAElB,GAAyB,cAAtB2C,EAAQkwD,UACT,OAAO,IAAI+gB,EAAcjxE,GAASuxE,KAAKjhB,GAEzC,GAAyB,cAAtBtwD,EAAQkwD,UACT,OAAO,IAAIghB,EAAclxE,GAASuxE,KAAKjhB,GAEzC,KAAK,cAAetwD,GAClB,MAAM,IAAI3C,MAAM,wDAElB,MAAM,IAAIA,MACR,mDAAqD2C,EAAQkwD,a,iBC/IjE,iCAC6B,oBAAT72D,MAAwBA,MAChCrE,OACR0K,EAAQ2qC,SAASpzC,UAAUyI,MAiB/B,SAASgyE,EAAQ1qE,EAAI2qE,GACnBn0E,KAAKo0E,IAAM5qE,EACXxJ,KAAKq0E,SAAWF,EAflBh9E,EAAQ85B,WAAa,WACnB,OAAO,IAAIijD,EAAQhyE,EAAMlK,KAAKi5B,WAAYqjD,EAAOz9D,WAAYklB,eAE/D5kC,EAAQo9E,YAAc,WACpB,OAAO,IAAIL,EAAQhyE,EAAMlK,KAAKu8E,YAAaD,EAAOz9D,WAAY29D,gBAEhEr9E,EAAQ4kC,aACR5kC,EAAQq9E,cAAgB,SAASv6C,GAC3BA,GACFA,EAAQ3W,SAQZ4wD,EAAQz6E,UAAUg7E,MAAQP,EAAQz6E,UAAU6E,IAAM,aAClD41E,EAAQz6E,UAAU6pB,MAAQ,WACxBtjB,KAAKq0E,SAASr8E,KAAKs8E,EAAOt0E,KAAKo0E,MAIjCj9E,EAAQu9E,OAAS,SAAS1qE,EAAM2qE,GAC9B54C,aAAa/xB,EAAK4qE,gBAClB5qE,EAAK6qE,aAAeF,GAGtBx9E,EAAQ29E,SAAW,SAAS9qE,GAC1B+xB,aAAa/xB,EAAK4qE,gBAClB5qE,EAAK6qE,cAAgB,GAGvB19E,EAAQ49E,aAAe59E,EAAQ69E,OAAS,SAAShrE,GAC/C+xB,aAAa/xB,EAAK4qE,gBAElB,IAAID,EAAQ3qE,EAAK6qE,aACbF,GAAS,IACX3qE,EAAK4qE,eAAiB3jD,YAAW,WAC3BjnB,EAAKirE,YACPjrE,EAAKirE,eACNN,KAKP,EAAQ,IAIRx9E,EAAQ++C,aAAgC,oBAATr6C,MAAwBA,KAAKq6C,mBAClB,IAAX9b,GAA0BA,EAAO8b,cACxCl2C,MAAQA,KAAKk2C,aACrC/+C,EAAQgwE,eAAkC,oBAATtrE,MAAwBA,KAAKsrE,qBAClB,IAAX/sC,GAA0BA,EAAO+sC,gBACxCnnE,MAAQA,KAAKmnE,iB,gCC7DvC,IAOI+N,EACAC,EARA/nD,EAAUh2B,EAAOD,QAAU,GAU/B,SAASi+E,IACL,MAAM,IAAIv1E,MAAM,mCAEpB,SAASw1E,IACL,MAAM,IAAIx1E,MAAM,qCAsBpB,SAASy1E,EAAWC,GAChB,GAAIL,IAAqBjkD,WAErB,OAAOA,WAAWskD,EAAK,GAG3B,IAAKL,IAAqBE,IAAqBF,IAAqBjkD,WAEhE,OADAikD,EAAmBjkD,WACZA,WAAWskD,EAAK,GAE3B,IAEI,OAAOL,EAAiBK,EAAK,GAC/B,MAAM7tE,GACJ,IAEI,OAAOwtE,EAAiBl9E,KAAK,KAAMu9E,EAAK,GAC1C,MAAM7tE,GAEJ,OAAOwtE,EAAiBl9E,KAAKgI,KAAMu1E,EAAK,MAvCnD,WACG,IAEQL,EADsB,mBAAfjkD,WACYA,WAEAmkD,EAEzB,MAAO1tE,GACLwtE,EAAmBE,EAEvB,IAEQD,EADwB,mBAAjBp5C,aACcA,aAEAs5C,EAE3B,MAAO3tE,GACLytE,EAAqBE,GAjB7B,GAwEA,IAEIG,EAFA3sD,EAAQ,GACR4sD,GAAW,EAEXC,GAAc,EAElB,SAASC,IACAF,GAAaD,IAGlBC,GAAW,EACPD,EAAan5E,OACbwsB,EAAQ2sD,EAAajvE,OAAOsiB,GAE5B6sD,GAAc,EAEd7sD,EAAMxsB,QACNu5E,KAIR,SAASA,IACL,IAAIH,EAAJ,CAGA,IAAIx7C,EAAUq7C,EAAWK,GACzBF,GAAW,EAGX,IADA,IAAIt3E,EAAM0qB,EAAMxsB,OACV8B,GAAK,CAGP,IAFAq3E,EAAe3sD,EACfA,EAAQ,KACC6sD,EAAav3E,GACdq3E,GACAA,EAAaE,GAAYl6B,MAGjCk6B,GAAc,EACdv3E,EAAM0qB,EAAMxsB,OAEhBm5E,EAAe,KACfC,GAAW,EAnEf,SAAyBI,GACrB,GAAIV,IAAuBp5C,aAEvB,OAAOA,aAAa85C,GAGxB,IAAKV,IAAuBE,IAAwBF,IAAuBp5C,aAEvE,OADAo5C,EAAqBp5C,aACdA,aAAa85C,GAExB,IAEWV,EAAmBU,GAC5B,MAAOnuE,GACL,IAEI,OAAOytE,EAAmBn9E,KAAK,KAAM69E,GACvC,MAAOnuE,GAGL,OAAOytE,EAAmBn9E,KAAKgI,KAAM61E,KAgD7CC,CAAgB77C,IAiBpB,SAAS87C,EAAKR,EAAKxyB,GACf/iD,KAAKu1E,IAAMA,EACXv1E,KAAK+iD,MAAQA,EAYjB,SAASizB,KA5BT5oD,EAAQgpB,SAAW,SAAUm/B,GACzB,IAAIzzE,EAAO,IAAI6M,MAAMkI,UAAUxa,OAAS,GACxC,GAAIwa,UAAUxa,OAAS,EACnB,IAAK,IAAIxE,EAAI,EAAGA,EAAIgf,UAAUxa,OAAQxE,IAClCiK,EAAKjK,EAAI,GAAKgf,UAAUhf,GAGhCgxB,EAAMtnB,KAAK,IAAIw0E,EAAKR,EAAKzzE,IACJ,IAAjB+mB,EAAMxsB,QAAiBo5E,GACvBH,EAAWM,IASnBG,EAAKt8E,UAAU+hD,IAAM,WACjBx7C,KAAKu1E,IAAIrzE,MAAM,KAAMlC,KAAK+iD,QAE9B31B,EAAQiL,MAAQ,UAChBjL,EAAQ6oD,SAAU,EAClB7oD,EAAQ8oD,IAAM,GACd9oD,EAAQ+oD,KAAO,GACf/oD,EAAQ0J,QAAU,GAClB1J,EAAQgpD,SAAW,GAInBhpD,EAAQyxB,GAAKm3B,EACb5oD,EAAQ2uB,YAAci6B,EACtB5oD,EAAQ2qB,KAAOi+B,EACf5oD,EAAQ0wB,IAAMk4B,EACd5oD,EAAQipD,eAAiBL,EACzB5oD,EAAQkpD,mBAAqBN,EAC7B5oD,EAAQmpD,KAAOP,EACf5oD,EAAQopD,gBAAkBR,EAC1B5oD,EAAQqpD,oBAAsBT,EAE9B5oD,EAAQwtB,UAAY,SAAUxiD,GAAQ,MAAO,IAE7Cg1B,EAAQ1X,QAAU,SAAUtd,GACxB,MAAM,IAAIyH,MAAM,qCAGpButB,EAAQspD,IAAM,WAAc,MAAO,KACnCtpD,EAAQupD,MAAQ,SAAUjzD,GACtB,MAAM,IAAI7jB,MAAM,mCAEpButB,EAAQwpD,MAAQ,WAAa,OAAO,I,6BClLpC,MAAMrD,EAAY,EAAQ,IAE1Bn8E,EAAOD,QAAU,cAAwBo8E,EACvC,cACEz4D,QACA9a,KAAK5H,KAAO,YACZ4H,KAAKyjE,cAAgB,OAIvB,2BAA2Bj6D,EAAIm6D,EAAWvqE,GACxC,MAA0B,cAAvBuqE,EAAU7kE,SACJ6kE,EAEE,UAARvqE,EACM,CACL0F,SAAU,YACVhG,MAAO,OAGJ,CACLgG,SAAU,YACVhG,MAAQ6qE,EAAU7qE,QAAU0Q,EAAK,MAAQ,OAK7C,oBAAoBI,GAClB,OAAOA,EAAKtD,UAAUxN,MAIxB,0BAA0B0Q,EAAIsJ,GAG5B,MAAMkyD,EAAgB,IAAI10D,IAIpB87C,EAAQpsD,KAAKujE,cAAc7qE,IAAI8Q,GAAI4iD,MAGzC,IAAIv0D,EAAI,EACR,IAAI,MAAM+R,KAAQwiD,EAAO,CAKvB,IAAI0Y,EACAD,EACJ,GAA6B,cAA1Bj7D,EAAKvD,QAAQvH,UAA4B8K,EAAKvD,QAAQvN,QAAU0Q,EACjEq7D,EAAUj7D,EAAKvD,QAAQvN,MACvBgsE,EAAW,QACN,IACoB,cAAzBl7D,EAAKrQ,OAAOuF,UAA4B8K,EAAKrQ,OAAOT,QAAU0Q,EAS9D,SAJAq7D,EAAUj7D,EAAKrQ,OAAOT,MACtBgsE,EAAW,MAMRjtE,EAAI,KAAQ,SACTmI,KAAK8jE,SAKb,MAAM1sD,QAAapX,KAAK4lE,qBACtBf,EAASj7D,EAAMkJ,EAAQgyD,GACnB1zD,EAAU4zD,EAActsE,IAAI0e,GAC/BhG,EACDA,EAAQ7P,KAAKsjE,GAEbG,EAAcz0D,IAAI6G,EAAM,CAACytD,IAI7B,OAAOG,K,6BClFX,MAAMyO,EAAgB,EAAQ,IAE9Br8E,EAAOD,QAAU,cAA4Bs8E,EAC3C,cACE34D,QACA9a,KAAK5H,KAAO,YACZ4H,KAAKyjE,cAAgB,OAIvB,2BAA2Bj6D,EAAIm6D,EAAWvqE,GACxC,MAA0B,cAAvBuqE,EAAU7kE,SACJ6kE,EAEE,UAARvqE,EACM,CACL0F,SAAU,YACVhG,MAAO,OAGJ,CACLgG,SAAU,YACVhG,MAAQ6qE,EAAU7qE,QAAU0Q,EAAK,MAAQ,OAK7C,oBAAoBI,GAClB,OAAOA,EAAKtD,UAAUxN,MAIxB,oBAAoB0Q,EAAIsJ,GAGtB,MAAMkyD,EAAgB,IAAI10D,IAIpB87C,EAAQpsD,KAAKujE,cAAc7qE,IAAI8Q,GAAI4iD,MAGzC,IAAI,MAAMxiD,KAAQwiD,EAAO,CAKvB,IAAI0Y,EACAD,EACJ,GAA6B,cAA1Bj7D,EAAKvD,QAAQvH,UAA4B8K,EAAKvD,QAAQvN,QAAU0Q,EACjEq7D,EAAUj7D,EAAKvD,QAAQvN,MACvBgsE,EAAW,QACN,IACoB,cAAzBl7D,EAAKrQ,OAAOuF,UAA4B8K,EAAKrQ,OAAOT,QAAU0Q,EAS9D,SAJAq7D,EAAUj7D,EAAKrQ,OAAOT,MACtBgsE,EAAW,IAQb,MAAM1tD,EAAOpX,KAAK4lE,qBAAqBf,EAASj7D,EAAMkJ,EAAQgyD,GACxD1zD,EAAU4zD,EAActsE,IAAI0e,GAC/BhG,EACDA,EAAQ7P,KAAKsjE,GAEbG,EAAcz0D,IAAI6G,EAAM,CAACytD,IAI7B,OAAOG,K,6CC5EX,MAAM6R,EAAY,EAAQ,IAEpBpoE,EAAM,GACZrX,EAAOD,QAAUsX,EAOjBA,EAAIslD,qBAAuB,SAAStG,GACL,oBAAnBna,iBACRma,EAAO8F,gBAAgBljC,IAAMwmD,EAE7BppB,EAAO+F,kBAAkB,SAS7B/kD,EAAIqlD,aAAe,SAASrG,QAEe,IAA/B2lB,WAAWvf,iBACnBt7D,OAAOC,eAAe46E,WAAY,kBAAmB,CACnDr5E,UAAU,EACVtB,YAAY,EACZqB,cAAc,EACdhB,MAAO20D,EAAOoG,oB,6BC9BpB,MAAM,gBAAC3iD,EAAe,aAAEP,GAAgB,EAAQ,KAC1C,oBAAC+kD,GAAuB,EAAQ,IAChC5lD,EAAc,EAAQ,IACtB8jD,EAAe,EAAQ,KACvB,YAACx3C,GAAe,EAAQ,IAExBpM,EAAoB,mBAa1B5Y,EAAOD,QAAU,EACf2/E,SACAlmE,UAAU,GACVyf,OACE,CAACzf,QAAS,OACZA,EAAUD,EAAaC,GAEvB,OADc,IAAIgjD,GACLmjB,YAEbtkD,eAAeq1C,EAAO7zC,GACpB,GAA4B,IAAzBA,EAAIp3B,QAAQ,UAA4C,IAA1Bo3B,EAAIp3B,QAAQ,UAC3C,MAAM,IAAIiT,EACR,6EAEA,oBAAqB,CAAC6B,KAAM,0BAA2BsiB,QAE3D,GAAG6iD,GAAmC,IAAzB7iD,EAAIp3B,QAAQ,SACvB,MAAM,IAAIiT,EACR,8FAEA,oBAAqB,CAAC6B,KAAM,0BAA2BsiB,QAG3D,IAAI6E,EACJ,IACEA,QAuDN,SAAczI,EAAK4D,EAAKrjB,GAEtB,MAAMkoB,EAAM,IADZzI,EAAMA,GAAOijB,gBAEb,OAAO,IAAI7Z,QAAQ,CAAC1G,EAAS2G,KAC3BZ,EAAI2X,OAAS,IAAM1d,EAAQ+F,GAC3BA,EAAI4X,QAAU1Y,GAAO0B,EAAO1B,GAC5Bc,EAAIgb,KAAK,MAAO7f,GAAK,GACrB,IAAI,MAAM/1B,KAAK0S,EACbkoB,EAAIkb,iBAAiB91C,EAAG0S,EAAQ1S,IAElC46B,EAAIub,SAjEU2iC,CAAK3mD,EAAK4D,EAAKrjB,GAC3B,MAAMlJ,GACN,MAAM,IAAIoI,EACR,oDACA,2BACA,CAAC6B,KAAM,0BAA2BsiB,MAAKmZ,MAAO1lC,IAGlD,GAAGoxB,EAAIiE,QAAU,IACf,MAAM,IAAIjtB,EACR,kCAAoCgpB,EAAIkE,WACxC,2BAA4B,CAC1BrrB,KAAM,0BACNsiB,MACAgjD,eAAgBn+C,EAAIiE,SAI1B,IAAItkB,EAAM,CAACi5C,WAAY,KAAMD,YAAax9B,EAAKl3B,SAAU+7B,EAAIrB,UACzDy/C,EAAY,KAGhB,MAAM/vE,EAAc2xB,EAAIq+C,kBAAkB,gBAC1C,IAAI54C,EACDvuB,EAAkBlM,KAAKg1B,EAAI4a,2BAC5BnV,EAAazF,EAAIq+C,kBAAkB,SAErC,GAAG54C,GAA8B,wBAAhBp3B,EAAuC,CAEtD,MAAM61D,EAAc9rD,EAAgBqtB,GAC9B64C,EAAgBpa,EAAYtH,GAClC,GAAG/mD,MAAMD,QAAQ0oE,GACf,MAAM,IAAItnE,EACR,mFAEA,oBACA,CAAC6B,KAAM,gCAAiCsiB,QAEzCmjD,IACD3+D,EAAIi5C,WAAa0lB,EAAcj7E,QAIjC+6E,EAAYla,EAAuB,UAChCka,GACiB,uBAAlBA,EAAUppE,QACR3G,GAAe,IAAIrJ,MAAM,iCAC3B2a,QAAYqvD,EAAO1rD,EAAY6X,EAAKijD,EAAU/6E,UAIlD,OAAOsc,O,6BC/FX,MACE/J,QAAS0iB,EACTliB,SAAUmiB,EACV7hB,SAAU8hB,GACR,EAAQ,KAEV5gB,QAASghB,GACP,EAAQ,KACN,YAACtV,GAAe,EAAQ,IACxBtM,EAAc,EAAQ,IACtBunE,EAAkB,EAAQ,IAmMhC,SAASC,EAA0BnkD,GACjC,MAAM,IAAIrjB,EACR,sDACA,qBAAsB,CACpB6B,KAAM,wBAAyBsX,QAASkK,IAnM9C/7B,EAAOD,QAAU,MAMf,aAAY,YAACw5D,IACX3wD,KAAKu3E,WAAa,IAAIjnE,IACtBtQ,KAAK2wD,YAAcA,EAGrB,eAAc,UACZ5+B,EAAS,QAAE9I,EAAO,eAAE+J,EAAc,KAAE11B,EAAI,OAAEs1B,EAAS,IAAIpiB,MAGpDyY,GAAWoI,EAAUpI,IAAYA,EAAQ,cAC1CA,EAAUA,EAAQ,aAIpBA,EAAUyI,EAASzI,GAGnB,MAAMuuD,EAAc,GACpB,IAAI,MAAMrkD,KAAOlK,EAAS,CACxB,GAAGqI,EAAU6B,GAAM,CAEjB,IAAIN,EAAW7yB,KAAKg3E,KAAK7jD,GACrBN,IAEFA,QAAiB7yB,KAAKy3E,sBACpB,CAAC1lD,YAAWkC,IAAKd,EAAKH,iBAAgB11B,OAAMs1B,YAI7CxB,EAASyB,GACV2kD,EAAYj2E,QAAQsxB,GAEpB2kD,EAAYj2E,KAAKsxB,GAEnB,SAEF,GAAW,OAARM,EAAc,CAEfqkD,EAAYj2E,KAAK,IAAI81E,EAAgB,CAACt6E,SAAU,QAChD,SAEEs0B,EAAU8B,IACZmkD,EAA0BruD,GAG5B,MAAM7vB,EAAMm8B,KAAKC,UAAUrC,GAC3B,IAAIN,EAAW7yB,KAAKg3E,KAAK59E,GACrBy5B,IAEFA,EAAW,IAAIwkD,EAAgB,CAACt6E,SAAUo2B,IAC1CnzB,KAAK03E,sBAAsB,CAACt+E,MAAKy5B,WAAU6Z,IAAK,YAElD8qC,EAAYj2E,KAAKsxB,GAGnB,OAAO2kD,EAGT,KAAKp+E,GAGH,IAAIy5B,EAAW7yB,KAAKu3E,WAAW7+E,IAAIU,GACnC,IAAIy5B,EAAU,CAEZ,MAAM8kD,EAAS33E,KAAK2wD,YAAYj4D,IAAIU,GACjCu+E,IACD9kD,EAAW8kD,EAAOj/E,IAAI,UACnBm6B,GACD7yB,KAAKu3E,WAAWhnE,IAAInX,EAAKy5B,IAI/B,OAAOA,EAGT,uBAAsB,IAACz5B,EAAG,SAAEy5B,EAAQ,IAAE6Z,IAEpC,GADA1sC,KAAKu3E,WAAWhnE,IAAInX,EAAKy5B,QACdrsB,IAARkmC,EAAmB,CACpB,IAAIirC,EAAS33E,KAAK2wD,YAAYj4D,IAAIU,GAC9Bu+E,IACFA,EAAS,IAAIrnE,IACbtQ,KAAK2wD,YAAYpgD,IAAInX,EAAKu+E,IAE5BA,EAAOpnE,IAAIm8B,EAAK7Z,GAElB,OAAOA,EAGT,6BAA4B,UAACd,EAAS,IAAEkC,EAAG,eAAEjB,EAAc,KAAE11B,EAAI,OAAEs1B,IAEjEqB,EAAM7X,EAAY9e,EAAM22B,GACxB,MAAM,QAAChL,EAAO,UAAEuoC,SAAmBxxD,KAAK43E,cACtC,CAAC7lD,YAAWkC,MAAKjB,iBAAgBJ,YA4GvC,SAASilD,GAAoB,QAAC5uD,EAAO,KAAE3rB,IACrC,IAAI2rB,EACF,OAGF,MAAMkK,EAAMlK,EAAQ,YAEpB,GAAGqI,EAAU6B,GAEX,YADAlK,EAAQ,YAAc7M,EAAY9e,EAAM61B,IAI1C,GAAG/B,EAAS+B,GAAM,CAChB,IAAI,IAAIt7B,EAAI,EAAGA,EAAIs7B,EAAI92B,SAAUxE,EAAG,CAClC,MAAMwL,EAAU8vB,EAAIt7B,GACjBy5B,EAAUjuB,GACX8vB,EAAIt7B,GAAKukB,EAAY9e,EAAM+F,GAG1BguB,EAAUhuB,IACXw0E,EAAoB,CAAC5uD,QAAS,CAAC,WAAY5lB,GAAU/F,SAGzD,OAGF,IAAI+zB,EAAU8B,GAEZ,OAIF,IAAI,MAAMroB,KAAQqoB,EAChB0kD,EAAoB,CAAC5uD,QAASkK,EAAIroB,GAAOxN,UAzIzCu6E,CAAoB,CAAC5uD,UAAS3rB,KAD9BA,EAAOk0D,EAAUC,aAAex9B,IAIhC,MAAMpB,QAAiB7yB,KAAK+yB,QAC1B,CAAChB,YAAW9I,UAAS+J,iBAAgB11B,OAAMs1B,WAE7C,OADA5yB,KAAK03E,sBAAsB,CAACt+E,IAAK66B,EAAKpB,WAAU6Z,IAAK8kB,EAAU9kB,MACxD7Z,EAGT,qBAAoB,UAACd,EAAS,IAAEkC,EAAG,eAAEjB,EAAc,OAAEJ,IAEnD,GAAGA,EAAO2D,KAnHW,GAoHnB,MAAM,IAAIzmB,EACR,4CACA,yBACA,CACE6B,KAAmC,gBAA7BogB,EAAU6B,eACd,gCACA,mBACFw8B,IA3He,KAiIrB,GAAGx9B,EAAOsB,IAAID,GACZ,MAAM,IAAInkB,EACR,mCACA,yBACA,CACE6B,KAAmC,gBAA7BogB,EAAU6B,eACd,8BACA,mBACFK,QAON,IAAIhL,EACAuoC,EAHJ5+B,EAAOniB,IAAIwjB,GAKX,IACEu9B,QAAkBx+B,EAAeiB,GACjChL,EAAUuoC,EAAUz0D,UAAY,KAE7Bu0B,EAAUrI,KACXA,EAAUsM,KAAK5Z,MAAMsN,IAEvB,MAAMvhB,GACN,MAAM,IAAIoI,EACR,iUAMA,oBACA,CAAC6B,KAAM,gCAAiCsiB,MAAKmZ,MAAO1lC,IAIxD,IAAI2pB,EAAUpI,GACZ,MAAM,IAAInZ,EACR,kHAEA,oBAAqB,CAAC6B,KAAM,yBAA0BsiB,QAkB1D,OAXEhL,EAHG,aAAcA,EAGP,CAAC,WAAYA,EAAQ,aAFrB,CAAC,WAAY,IAMtBuoC,EAAUE,aACPtgC,EAASnI,EAAQ,eACnBA,EAAQ,YAAc,CAACA,EAAQ,cAEjCA,EAAQ,YAAY1nB,KAAKiwD,EAAUE,aAG9B,CAACzoC,UAASuoC,gB,6BCzMrB,MAAM7C,EAAM,EAAQ,IAIpBv3D,EAAOD,QAAU,MAMf,aAAY,SAAC4F,IACXiD,KAAKjD,SAAWA,EAGhBiD,KAAKq8B,MAAQ,IAAIsyB,EAAI,CAACyB,IAZE,KAe1B,aAAar+B,GACX,OAAO/xB,KAAKq8B,MAAM3jC,IAAIq5B,GAGxB,aAAaA,EAAW+lD,GACtB93E,KAAKq8B,MAAM9rB,IAAIwhB,EAAW+lD,M,6BCrB9B,SAAS9P,EAASluD,GAChB,IAAIje,EAAOmE,KASX,GARMnE,aAAgBmsE,IACpBnsE,EAAO,IAAImsE,GAGbnsE,EAAK6gD,KAAO,KACZ7gD,EAAK4gD,KAAO,KACZ5gD,EAAKQ,OAAS,EAEVyd,GAAgC,mBAAjBA,EAAKpX,QACtBoX,EAAKpX,SAAQ,SAAUsH,GACrBnO,EAAK0F,KAAKyI,WAEP,GAAI6M,UAAUxa,OAAS,EAC5B,IAAK,IAAIxE,EAAI,EAAGC,EAAI+e,UAAUxa,OAAQxE,EAAIC,EAAGD,IAC3CgE,EAAK0F,KAAKsV,UAAUhf,IAIxB,OAAOgE,EAoVT,SAASk8E,EAAQl8E,EAAM0G,EAAMzJ,GAC3B,IAAIk/E,EAAWz1E,IAAS1G,EAAK4gD,KAC3B,IAAIv8C,EAAKpH,EAAO,KAAMyJ,EAAM1G,GAC5B,IAAIqE,EAAKpH,EAAOyJ,EAAMA,EAAKsa,KAAMhhB,GAWnC,OATsB,OAAlBm8E,EAASn7D,OACXhhB,EAAK6gD,KAAOs7B,GAEQ,OAAlBA,EAAS52C,OACXvlC,EAAK4gD,KAAOu7B,GAGdn8E,EAAKQ,SAEE27E,EAGT,SAASz2E,EAAM1F,EAAMmO,GACnBnO,EAAK6gD,KAAO,IAAIx8C,EAAK8J,EAAMnO,EAAK6gD,KAAM,KAAM7gD,GACvCA,EAAK4gD,OACR5gD,EAAK4gD,KAAO5gD,EAAK6gD,MAEnB7gD,EAAKQ,SAGP,SAASuF,EAAS/F,EAAMmO,GACtBnO,EAAK4gD,KAAO,IAAIv8C,EAAK8J,EAAM,KAAMnO,EAAK4gD,KAAM5gD,GACvCA,EAAK6gD,OACR7gD,EAAK6gD,KAAO7gD,EAAK4gD,MAEnB5gD,EAAKQ,SAGP,SAAS6D,EAAMpH,EAAOsoC,EAAMvkB,EAAM/C,GAChC,KAAM9Z,gBAAgBE,GACpB,OAAO,IAAIA,EAAKpH,EAAOsoC,EAAMvkB,EAAM/C,GAGrC9Z,KAAK8Z,KAAOA,EACZ9Z,KAAKlH,MAAQA,EAETsoC,GACFA,EAAKvkB,KAAO7c,KACZA,KAAKohC,KAAOA,GAEZphC,KAAKohC,KAAO,KAGVvkB,GACFA,EAAKukB,KAAOphC,KACZA,KAAK6c,KAAOA,GAEZ7c,KAAK6c,KAAO,KAjahBzlB,EAAOD,QAAU6wE,EAEjBA,EAAQ9nE,KAAOA,EACf8nE,EAAQ7uE,OAAS6uE,EAyBjBA,EAAQvuE,UAAU2vE,WAAa,SAAU7mE,GACvC,GAAIA,EAAKuX,OAAS9Z,KAChB,MAAM,IAAIH,MAAM,oDAGlB,IAAIgd,EAAOta,EAAKsa,KACZukB,EAAO7+B,EAAK6+B,KAsBhB,OApBIvkB,IACFA,EAAKukB,KAAOA,GAGVA,IACFA,EAAKvkB,KAAOA,GAGVta,IAASvC,KAAKy8C,OAChBz8C,KAAKy8C,KAAO5/B,GAEVta,IAASvC,KAAK08C,OAChB18C,KAAK08C,KAAOtb,GAGd7+B,EAAKuX,KAAKzd,SACVkG,EAAKsa,KAAO,KACZta,EAAK6+B,KAAO,KACZ7+B,EAAKuX,KAAO,KAEL+C,GAGTmrD,EAAQvuE,UAAUuvE,YAAc,SAAUzmE,GACxC,GAAIA,IAASvC,KAAKy8C,KAAlB,CAIIl6C,EAAKuX,MACPvX,EAAKuX,KAAKsvD,WAAW7mE,GAGvB,IAAIk6C,EAAOz8C,KAAKy8C,KAChBl6C,EAAKuX,KAAO9Z,KACZuC,EAAKsa,KAAO4/B,EACRA,IACFA,EAAKrb,KAAO7+B,GAGdvC,KAAKy8C,KAAOl6C,EACPvC,KAAK08C,OACR18C,KAAK08C,KAAOn6C,GAEdvC,KAAK3D,WAGP2rE,EAAQvuE,UAAUw+E,SAAW,SAAU11E,GACrC,GAAIA,IAASvC,KAAK08C,KAAlB,CAIIn6C,EAAKuX,MACPvX,EAAKuX,KAAKsvD,WAAW7mE,GAGvB,IAAIm6C,EAAO18C,KAAK08C,KAChBn6C,EAAKuX,KAAO9Z,KACZuC,EAAK6+B,KAAOsb,EACRA,IACFA,EAAK7/B,KAAOta,GAGdvC,KAAK08C,KAAOn6C,EACPvC,KAAKy8C,OACRz8C,KAAKy8C,KAAOl6C,GAEdvC,KAAK3D,WAGP2rE,EAAQvuE,UAAU8H,KAAO,WACvB,IAAK,IAAI1J,EAAI,EAAGC,EAAI+e,UAAUxa,OAAQxE,EAAIC,EAAGD,IAC3C0J,EAAKvB,KAAM6W,UAAUhf,IAEvB,OAAOmI,KAAK3D,QAGd2rE,EAAQvuE,UAAUmI,QAAU,WAC1B,IAAK,IAAI/J,EAAI,EAAGC,EAAI+e,UAAUxa,OAAQxE,EAAIC,EAAGD,IAC3C+J,EAAQ5B,KAAM6W,UAAUhf,IAE1B,OAAOmI,KAAK3D,QAGd2rE,EAAQvuE,UAAUgL,IAAM,WACtB,GAAKzE,KAAK08C,KAAV,CAIA,IAAIjiC,EAAMza,KAAK08C,KAAK5jD,MAQpB,OAPAkH,KAAK08C,KAAO18C,KAAK08C,KAAKtb,KAClBphC,KAAK08C,KACP18C,KAAK08C,KAAK7/B,KAAO,KAEjB7c,KAAKy8C,KAAO,KAEdz8C,KAAK3D,SACEoe,IAGTutD,EAAQvuE,UAAU4hB,MAAQ,WACxB,GAAKrb,KAAKy8C,KAAV,CAIA,IAAIhiC,EAAMza,KAAKy8C,KAAK3jD,MAQpB,OAPAkH,KAAKy8C,KAAOz8C,KAAKy8C,KAAK5/B,KAClB7c,KAAKy8C,KACPz8C,KAAKy8C,KAAKrb,KAAO,KAEjBphC,KAAK08C,KAAO,KAEd18C,KAAK3D,SACEoe,IAGTutD,EAAQvuE,UAAUiJ,QAAU,SAAUozC,EAAIyzB,GACxCA,EAAQA,GAASvpE,KACjB,IAAK,IAAImpE,EAASnpE,KAAKy8C,KAAM5kD,EAAI,EAAc,OAAXsxE,EAAiBtxE,IACnDi+C,EAAG99C,KAAKuxE,EAAOJ,EAAOrwE,MAAOjB,EAAGmI,MAChCmpE,EAASA,EAAOtsD,MAIpBmrD,EAAQvuE,UAAUy+E,eAAiB,SAAUpiC,EAAIyzB,GAC/CA,EAAQA,GAASvpE,KACjB,IAAK,IAAImpE,EAASnpE,KAAK08C,KAAM7kD,EAAImI,KAAK3D,OAAS,EAAc,OAAX8sE,EAAiBtxE,IACjEi+C,EAAG99C,KAAKuxE,EAAOJ,EAAOrwE,MAAOjB,EAAGmI,MAChCmpE,EAASA,EAAO/nC,MAIpB4mC,EAAQvuE,UAAUf,IAAM,SAAUY,GAChC,IAAK,IAAIzB,EAAI,EAAGsxE,EAASnpE,KAAKy8C,KAAiB,OAAX0sB,GAAmBtxE,EAAIyB,EAAGzB,IAE5DsxE,EAASA,EAAOtsD,KAElB,GAAIhlB,IAAMyB,GAAgB,OAAX6vE,EACb,OAAOA,EAAOrwE,OAIlBkvE,EAAQvuE,UAAU0+E,WAAa,SAAU7+E,GACvC,IAAK,IAAIzB,EAAI,EAAGsxE,EAASnpE,KAAK08C,KAAiB,OAAXysB,GAAmBtxE,EAAIyB,EAAGzB,IAE5DsxE,EAASA,EAAO/nC,KAElB,GAAIvpC,IAAMyB,GAAgB,OAAX6vE,EACb,OAAOA,EAAOrwE,OAIlBkvE,EAAQvuE,UAAU0M,IAAM,SAAU2vC,EAAIyzB,GACpCA,EAAQA,GAASvpE,KAEjB,IADA,IAAIya,EAAM,IAAIutD,EACLmB,EAASnpE,KAAKy8C,KAAiB,OAAX0sB,GAC3B1uD,EAAIlZ,KAAKu0C,EAAG99C,KAAKuxE,EAAOJ,EAAOrwE,MAAOkH,OACtCmpE,EAASA,EAAOtsD,KAElB,OAAOpC,GAGTutD,EAAQvuE,UAAU2+E,WAAa,SAAUtiC,EAAIyzB,GAC3CA,EAAQA,GAASvpE,KAEjB,IADA,IAAIya,EAAM,IAAIutD,EACLmB,EAASnpE,KAAK08C,KAAiB,OAAXysB,GAC3B1uD,EAAIlZ,KAAKu0C,EAAG99C,KAAKuxE,EAAOJ,EAAOrwE,MAAOkH,OACtCmpE,EAASA,EAAO/nC,KAElB,OAAO3mB,GAGTutD,EAAQvuE,UAAU8P,OAAS,SAAUusC,EAAI56B,GACvC,IAAI8oC,EACAmlB,EAASnpE,KAAKy8C,KAClB,GAAI5lC,UAAUxa,OAAS,EACrB2nD,EAAM9oC,MACD,KAAIlb,KAAKy8C,KAId,MAAM,IAAIxgD,UAAU,8CAHpBktE,EAASnpE,KAAKy8C,KAAK5/B,KACnBmnC,EAAMhkD,KAAKy8C,KAAK3jD,MAKlB,IAAK,IAAIjB,EAAI,EAAc,OAAXsxE,EAAiBtxE,IAC/BmsD,EAAMlO,EAAGkO,EAAKmlB,EAAOrwE,MAAOjB,GAC5BsxE,EAASA,EAAOtsD,KAGlB,OAAOmnC,GAGTgkB,EAAQvuE,UAAU4+E,cAAgB,SAAUviC,EAAI56B,GAC9C,IAAI8oC,EACAmlB,EAASnpE,KAAK08C,KAClB,GAAI7lC,UAAUxa,OAAS,EACrB2nD,EAAM9oC,MACD,KAAIlb,KAAK08C,KAId,MAAM,IAAIzgD,UAAU,8CAHpBktE,EAASnpE,KAAK08C,KAAKtb,KACnB4iB,EAAMhkD,KAAK08C,KAAK5jD,MAKlB,IAAK,IAAIjB,EAAImI,KAAK3D,OAAS,EAAc,OAAX8sE,EAAiBtxE,IAC7CmsD,EAAMlO,EAAGkO,EAAKmlB,EAAOrwE,MAAOjB,GAC5BsxE,EAASA,EAAO/nC,KAGlB,OAAO4iB,GAGTgkB,EAAQvuE,UAAUywE,QAAU,WAE1B,IADA,IAAIngE,EAAM,IAAI4E,MAAM3O,KAAK3D,QAChBxE,EAAI,EAAGsxE,EAASnpE,KAAKy8C,KAAiB,OAAX0sB,EAAiBtxE,IACnDkS,EAAIlS,GAAKsxE,EAAOrwE,MAChBqwE,EAASA,EAAOtsD,KAElB,OAAO9S,GAGTi+D,EAAQvuE,UAAU6+E,eAAiB,WAEjC,IADA,IAAIvuE,EAAM,IAAI4E,MAAM3O,KAAK3D,QAChBxE,EAAI,EAAGsxE,EAASnpE,KAAK08C,KAAiB,OAAXysB,EAAiBtxE,IACnDkS,EAAIlS,GAAKsxE,EAAOrwE,MAChBqwE,EAASA,EAAO/nC,KAElB,OAAOr3B,GAGTi+D,EAAQvuE,UAAUqD,MAAQ,SAAUya,EAAMghE,IACxCA,EAAKA,GAAMv4E,KAAK3D,QACP,IACPk8E,GAAMv4E,KAAK3D,SAEbkb,EAAOA,GAAQ,GACJ,IACTA,GAAQvX,KAAK3D,QAEf,IAAIm8E,EAAM,IAAIxQ,EACd,GAAIuQ,EAAKhhE,GAAQghE,EAAK,EACpB,OAAOC,EAELjhE,EAAO,IACTA,EAAO,GAELghE,EAAKv4E,KAAK3D,SACZk8E,EAAKv4E,KAAK3D,QAEZ,IAAK,IAAIxE,EAAI,EAAGsxE,EAASnpE,KAAKy8C,KAAiB,OAAX0sB,GAAmBtxE,EAAI0f,EAAM1f,IAC/DsxE,EAASA,EAAOtsD,KAElB,KAAkB,OAAXssD,GAAmBtxE,EAAI0gF,EAAI1gF,IAAKsxE,EAASA,EAAOtsD,KACrD27D,EAAIj3E,KAAK4nE,EAAOrwE,OAElB,OAAO0/E,GAGTxQ,EAAQvuE,UAAUg/E,aAAe,SAAUlhE,EAAMghE,IAC/CA,EAAKA,GAAMv4E,KAAK3D,QACP,IACPk8E,GAAMv4E,KAAK3D,SAEbkb,EAAOA,GAAQ,GACJ,IACTA,GAAQvX,KAAK3D,QAEf,IAAIm8E,EAAM,IAAIxQ,EACd,GAAIuQ,EAAKhhE,GAAQghE,EAAK,EACpB,OAAOC,EAELjhE,EAAO,IACTA,EAAO,GAELghE,EAAKv4E,KAAK3D,SACZk8E,EAAKv4E,KAAK3D,QAEZ,IAAK,IAAIxE,EAAImI,KAAK3D,OAAQ8sE,EAASnpE,KAAK08C,KAAiB,OAAXysB,GAAmBtxE,EAAI0gF,EAAI1gF,IACvEsxE,EAASA,EAAO/nC,KAElB,KAAkB,OAAX+nC,GAAmBtxE,EAAI0f,EAAM1f,IAAKsxE,EAASA,EAAO/nC,KACvDo3C,EAAIj3E,KAAK4nE,EAAOrwE,OAElB,OAAO0/E,GAGTxQ,EAAQvuE,UAAUiI,OAAS,SAAUg3E,EAAOC,KAAgBC,GACtDF,EAAQ14E,KAAK3D,SACfq8E,EAAQ14E,KAAK3D,OAAS,GAEpBq8E,EAAQ,IACVA,EAAQ14E,KAAK3D,OAASq8E,GAGxB,IAAK,IAAI7gF,EAAI,EAAGsxE,EAASnpE,KAAKy8C,KAAiB,OAAX0sB,GAAmBtxE,EAAI6gF,EAAO7gF,IAChEsxE,EAASA,EAAOtsD,KAGlB,IAAI27D,EAAM,GACV,IAAS3gF,EAAI,EAAGsxE,GAAUtxE,EAAI8gF,EAAa9gF,IACzC2gF,EAAIj3E,KAAK4nE,EAAOrwE,OAChBqwE,EAASnpE,KAAKopE,WAAWD,GAEZ,OAAXA,IACFA,EAASnpE,KAAK08C,MAGZysB,IAAWnpE,KAAKy8C,MAAQ0sB,IAAWnpE,KAAK08C,OAC1CysB,EAASA,EAAO/nC,MAGlB,IAASvpC,EAAI,EAAGA,EAAI+gF,EAAMv8E,OAAQxE,IAChCsxE,EAAS4O,EAAO/3E,KAAMmpE,EAAQyP,EAAM/gF,IAEtC,OAAO2gF,GAGTxQ,EAAQvuE,UAAU86B,QAAU,WAG1B,IAFA,IAAIkoB,EAAOz8C,KAAKy8C,KACZC,EAAO18C,KAAK08C,KACPysB,EAAS1sB,EAAiB,OAAX0sB,EAAiBA,EAASA,EAAO/nC,KAAM,CAC7D,IAAIznC,EAAIwvE,EAAO/nC,KACf+nC,EAAO/nC,KAAO+nC,EAAOtsD,KACrBssD,EAAOtsD,KAAOljB,EAIhB,OAFAqG,KAAKy8C,KAAOC,EACZ18C,KAAK08C,KAAOD,EACLz8C,MA2DT,IAEE,EAAQ,GAAR,CAAyBgoE,GACzB,MAAO6Q,M,6BCxaTzhF,EAAOD,QAAU,SAAU6wE,GACzBA,EAAQvuE,UAAUb,OAAO2V,UAAY,YACnC,IAAK,IAAI46D,EAASnpE,KAAKy8C,KAAM0sB,EAAQA,EAASA,EAAOtsD,WAC7CssD,EAAOrwE,S,6BCEnB1B,EAAOD,QAAU,EAAQ,IAAgBy3D,Q,6BCDzC,MAAM9+C,EAAc,EAAQ,KAG1BpB,QAAS0iB,EACTliB,SAAUmiB,EACVpiB,cAAe6pE,EACftpE,SAAU8hB,EACV7hB,YAAa8hB,GACX,EAAQ,KAGVxf,OAAQgnE,EACR7lE,QAAS8lE,EACTx5E,QAASy5E,EACT55E,UAAW65E,GACT,EAAQ,KAGV5jD,UAAWxD,EACX+E,gBAAiBsiD,EACjBhnD,UAAWinD,EACXhsD,QAASqiC,EACT77B,eAAgB87B,GACd,EAAQ,KAGVrzC,WAAYmV,GACV,EAAQ,KAGVvf,SAAUonE,EACV3oE,QAASghB,EACTpf,UAAWgnE,EACX/nE,kBAAmBgoE,GACjB,EAAQ,IAEN9qE,EAAM,GACZrX,EAAOD,QAAUsX,EACjB,MAAM+qE,EAAc,sCA62BpB,SAASC,GAAa,UAAC1nD,EAAS,eAAE2nD,EAAc,MAAE5gF,EAAK,QAAE0J,IAEvD,GAAG1J,QACD,OAAO,KAIT,MAAM6gF,EAAmB7nD,EACvBC,EAAW2nD,EAAgB,CAACrnD,OAAO,GAAO7vB,GAC5C,GAAwB,QAArBm3E,EACD,OAAO7nD,EAAWC,EAAWj5B,EAAO,CAACwE,MAAM,GAAOkF,GAC7C,GAAwB,UAArBm3E,EACR,OAAO7nD,EAAWC,EAAWj5B,EAAO,CAACu5B,OAAO,EAAM/0B,MAAM,GAAOkF,GAIjE,MAAMsL,EAAOqrE,EAAiBpnD,EAAW2nD,EAAgB,SAGzD,IAAa,QAAT5rE,GAAuC,WAArB6rE,IAAkCroD,EAAUx4B,GAChE,MAAO,CAAC,MAAOg5B,EAAWC,EAAWj5B,EAAO,CAACwE,MAAM,GAAOkF,IAG5D,GAAY,WAATsL,GAAqBwjB,EAAUx4B,GAChC,MAAO,CACL,MAAOg5B,EAAWC,EAAWj5B,EAAO,CAACu5B,OAAO,EAAM/0B,MAAM,GAAOkF,IAKnE,GAAG42E,EAAWO,GACZ,OAAO7gF,EAGT,MAAMuX,EAAO,GAEb,GAAGvC,IAAS,CAAC,MAAO,SAAU,SAAShO,SAASgO,GAE9CuC,EAAK,SAAWvC,OACX,GAAGwjB,EAAUx4B,GAAQ,CAE1B,MAAMqT,EAAWgtE,EAAiBpnD,EAAW2nD,EAAgB,aAC7C,OAAbvtE,IACDkE,EAAK,aAAelE,GAEtB,MAAM2oB,EAAYqkD,EAAiBpnD,EAAW2nD,EAAgB,cAC7C,OAAd5kD,IACDzkB,EAAK,cAAgBykB,GASzB,MALI,CAAC,UAAW,SAAU,UAAUh1B,gBAAgBhH,KAClDA,EAAQA,EAAM+O,YAEhBwI,EAAK,UAAYvX,EAEVuX,EAaT,SAASupE,EAAmB7nD,EAAW8nD,EAAa/kD,EAAWtyB,GAC7D,MAAM6N,EAAO,GACPlB,EAAO5W,OAAO4W,KAAK0qE,GAAaz1E,OACtC,IAAI,MAAMhL,KAAO+V,EAAM,CACrB,MAAM2qE,EAAchoD,EAAWC,EAAW34B,EAAK,CAACi5B,OAAO,GAAO7vB,GAC9D,IAAIsP,EAAM+nE,EAAYzgF,GAClBg4B,EAAStf,KACXA,EAAM,CAACA,IAET,IAAI,MAAM9H,KAAQ8H,EAAK,CACrB,GAAY,OAAT9H,EAED,SAEF,IAAIsnB,EAAUtnB,GACZ,MAAM,IAAI8F,EACR,+DACA,qBACA,CAAC6B,KAAM,6BAA8BkoE,gBAEzC,MAAM/nE,EAAM,CAAC,SAAU9H,GACJ,UAAhB8vE,IACDhoE,EAAI,aAAe1Y,EAAIsK,eAEtBoxB,IACDhjB,EAAI,cAAgBgjB,GAEtBzkB,EAAK9O,KAAKuQ,IAGd,OAAOzB,EAGToiB,eAAesnD,GACb,UAAChoD,EAAS,QAAEvvB,EAAO,eAAEk3E,EAAc,MAAE5gF,EAAK,aAAEq4D,EAAY,QAAE6oB,EAAO,SAC/DC,EAAQ,cAAEC,IACZ,MAAM7pE,EAAO,GACPlB,EAAO5W,OAAO4W,KAAKrW,GAAOsL,OAC1B+1E,EAA2B,UAAbF,EACpB,IAAI,IAAI7gF,KAAO+V,EAAM,CAEnB,GAAGgrE,EAAa,CACd,MAAMhnD,EAAMgmD,EAAiBpnD,EAAW34B,EAAK,YACzCm4B,EAAa4B,KACfpB,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAUkB,EACVT,WAAW,EACXlwB,aAKN,IAgBIs3E,EAhBAhoE,EAAMhZ,EAAMM,GACZg4B,EAAStf,KACXA,EAAM,CAACA,IAGTA,QAAYrD,EAAIogD,OAAO,CACrB98B,YACA2nD,iBACAr2E,QAASyO,EACTtP,UACA43E,YAAY,EACZC,aAAa,EACblpB,iBAOE2oB,EAFDI,EACU,UAAR9gF,EACa,QAEAqgF,EACZ,CAAC1nD,YAAW2nD,eAAgBO,EAAUnhF,MAAOM,EAAKoJ,YAGxCsvB,EAAWC,EAAW34B,EAAK,CAACi5B,OAAO,GAAO7vB,GAG1C,QAAby3E,EAED7gF,EAAM04B,EAAWC,EAAW34B,EAAK,CAACkE,MAAM,GAAOkF,GACvC23E,IACR/gF,EAAM0gF,GAGR,IAAI,IAAI9vE,KAAQ8H,EAAK,CAKnB,GAHGkoE,IAAYf,EAASjvE,KACtBA,EAAO,CAAC,SAAU,CAACA,KAEL,UAAbiwE,EACkB,UAAhBH,IAEO9vE,EAAK,SACbA,EAAK,SAAW,CAAC5Q,GAAKmN,OAAOyD,EAAK,UAElCA,EAAK,SAAW,CAAC5Q,QAEd,IAAG4/E,EAAShvE,KAChB,CAAC,YAAa,QAAS,UAAUlK,SAASm6E,GAC3C,MAAM,IAAInqE,EAER,wEAAYmqE,MACZ,qBACA,CAACtoE,KAAM,uBAAwB7Y,MAAOkR,IAChCkwE,EAGW,UAAhBJ,GAEDT,EAAUrvE,EAAMkwE,EAAeJ,EAAa,CAC1C5nE,iBAAiB,EACjBG,cAAc,IAGM,UAAhBynE,GAA6BG,KAAYjwE,IACjDA,EAAKiwE,GAAY7gF,GAEnBiX,EAAK9O,KAAKyI,IAGd,OAAOqG,EAthCT5B,EAAIogD,OAASp8B,OACXV,YACA2nD,iBAAiB,KACjBr2E,UACAb,UAAU,GACV43E,cAAa,EACbC,eAAc,EACdC,oBAAoB,KACpBnpB,eAAe,aAGf,GAAG9tD,QACD,OAAO,KAQT,GAJsB,aAAnBq2E,IACDl3E,EAAUjK,OAAOyY,OAAO,GAAIxO,EAAS,CAACgP,SAAS,MAG7C4f,EAAS/tB,KAAaguB,EAAUhuB,GAAU,CAE5C,IAAI+2E,IAAkC,OAAnBV,GAEF,WADf5nD,EAAWC,EAAW2nD,EAAgB,CAACrnD,OAAO,GAC5C7vB,IAAwB,CAC1B,MAAM+3E,QAAeppB,EAAa,CAChCqpB,cAAen3E,EACf0uB,YACA2nD,iBACAl3E,UACA43E,eAEF,YAAc5zE,IAAX+zE,EACM,KAEFA,EAIT,OAAOd,EAAa,CAAC1nD,YAAW2nD,iBAAgB5gF,MAAOuK,EAASb,YAIlE,GAAG4uB,EAAS/tB,GAAU,CACpB,IAAIgN,EAAO,GACX,MAAMqkB,EAAYykD,EAChBpnD,EAAW2nD,EAAgB,eAAiB,GAC9CU,EAAaA,GAAc1lD,EAAU50B,SAAS,SAC9C,IAAI,IAAIjI,EAAI,EAAGA,EAAIwL,EAAQhH,SAAUxE,EAAG,CAEtC,IAAI6P,QAAU+G,EAAIogD,OAAO,CACvB98B,YACA2nD,iBACAr2E,QAASA,EAAQxL,GACjB2K,UACA2uD,eACAkpB,cACAC,sBAECF,GAAchpD,EAAS1pB,KACxBA,EAAI,CAAC,QAASA,IAGP,OAANA,IACDA,QAAUypD,EAAa,CACrBqpB,cAAen3E,EAAQxL,GACvBk6B,YACA2nD,iBACAxwD,OAAQ7lB,EACRuR,MAAO/c,EACP2K,UACAi4E,eAAgBpqE,EAChB+pE,oBAEO5zE,IAANkB,KAKF0pB,EAAS1pB,GACV2I,EAAOA,EAAK9J,OAAOmB,GAEnB2I,EAAK9O,KAAKmG,IAGd,OAAO2I,EAMT,MAAMqqE,EAAyB5oD,EAC7BC,EAAW2nD,EAAgB,CAACrnD,OAAO,GAAO7vB,GAGtCm4E,EACJxB,EAAiBpnD,EAAW2nD,EAAgB,YAM9CY,EAAoBA,IACjBvoD,EAAUkB,gBAAkBlB,EAAY,MAC3C,IAAI5iB,EAAO5W,OAAO4W,KAAK9L,GAASe,OAC5Bw2E,GAAcP,EAClB,GAAGO,GAAcN,GAAqBnrE,EAAK9S,QAAU,IAClD8S,EAAKrP,SAAS,YACf,IAAI,MAAM1G,KAAO+V,EAAM,CACrB,MAAMwqE,EAAmB7nD,EACvBwoD,EAAmBlhF,EAAK,CAACi5B,OAAO,GAAO7vB,GACzC,GAAwB,WAArBm3E,EAA+B,CAEhCiB,GAAa,EACb7oD,EAAYuoD,EACZ,MAEF,GAAwB,QAArBX,GAA8C,IAAhBxqE,EAAK9S,OAAc,CAElDu+E,GAAa,EACb,OAKHA,IAED7oD,EAAYA,EAAUuE,2BAIpB/E,EAAaopD,KACf5oD,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAU0oD,EACVjoD,WAAW,EACXC,mBAAmB,EACnBnwB,aAKD,aAAca,IACf0uB,QAAkB09B,EAChB,CAAC19B,YAAWE,SAAU5uB,EAAQ,YAAab,aAI/C83E,EAAoBvoD,EAGpB,IAAI8oD,EAAU,KAGd,IAAI,MAAMzhF,KAAO+V,EAAM,CAErB,GAAwB,UADC2iB,EAAWC,EAAW34B,EAAK,CAACi5B,OAAO,GAAO7vB,GAClC,CAG/Bq4E,EAAUA,GAAWzhF,EACrB,MAAMN,EAAQuK,EAAQjK,GAChBwW,EACJjB,MAAMD,QAAQ5V,GACXA,EAAMuD,OAAS,EAAIvD,EAAMgE,QAAQsH,OAAStL,EAAS,CAACA,GACzD,IAAI,MAAMgV,KAAQ8B,EAAO,CACvB,MAAMujB,EAAMgmD,EAAiBmB,EAAmBxsE,EAAM,YAClDyjB,EAAa4B,KACfpB,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAUkB,EACV3wB,UACAkwB,WAAW,OAQrB,IAAIriB,EAAO,SAgKboiB,eAAeqoD,GAAc,UAC3B/oD,EAAS,eACT2nD,EAAc,uBACdgB,EAAsB,QACtBr3E,EAAO,eACPo3E,EAAc,QACdj4E,EAAU,GAAE,WACZ43E,EAAU,QACVS,EAAO,kBACPP,EAAiB,aACjBnpB,IAEA,MAAMhiD,EAAO5W,OAAO4W,KAAK9L,GAASe,OAC5B22E,EAAQ,GACd,IAAIC,EAGJ,MAAMC,EAAa53E,EAAQw3E,IAGK,UAF9B/oD,EAAWC,EACRX,EAAS/tB,EAAQw3E,IAAYx3E,EAAQw3E,GAAS,GAAKx3E,EAAQw3E,GAC5D,CAACxoD,OAAO,GAAO7vB,GAEnB,IAAI,MAAMpJ,KAAO+V,EAAM,CACrB,IACI+rE,EADApiF,EAAQuK,EAAQjK,GAIpB,GAAW,aAARA,EACD,SAIF,IAAIugF,EAAmB7nD,EAAWC,EAAW34B,EAAK,CAACi5B,OAAO,GAAO7vB,GAGjE,IAAwB,OAArBm3E,IACCnoD,EAAemoD,KAAqBP,EAAWO,MAEjDA,EAAmBxoB,EAAa,CAC9BgqB,iBAAkB/hF,EAClB24B,YACA2nD,iBACAxwD,OAAQ7lB,EACRb,UACA43E,aACAthF,QACA2hF,wBAEsBj0E,IAArBmzE,GACD,SAIJ,GAAGP,EAAWO,GAAmB,CAC/B,GAA8B,aAA3Be,EACD,MAAM,IAAI5qE,EACR,2EACa,qBACb,CAAC6B,KAAM,+BAAgC7Y,UAE3C,GAAG6gF,KAAoBc,GACC,cAArBd,GACqB,UAArBA,EACD,MAAM,IAAI7pE,EACR,uDACA,qBACA,CAAC6B,KAAM,qBAAsBypE,QAASzB,IAK5C,GAAwB,QAArBA,EAA4B,CAC7B,IAAIroD,EAAUx4B,GAAQ,CACpB,IAAI0J,EAAQgP,QACV,MAAM,IAAI1B,EACR,qDACA,qBAAsB,CAAC6B,KAAM,oBAAqB7Y,UAEtD,GAAGu4B,EAAUv4B,IAEX,IAAIggF,EAAehgF,GACjB,MAAM,IAAIgX,EACR,sFAEA,qBAAsB,CAAC6B,KAAM,oBAAqB7Y,cAEjD,KAAGs4B,EAASt4B,GAQjB,MAAM,IAAIgX,EACR,sFAEA,qBAAsB,CAAC6B,KAAM,oBAAqB7Y,UAVpD,IAAIA,EAAM2Y,MAAM5C,GAAKyiB,EAAUziB,IAC7B,MAAM,IAAIiB,EACR,sFAEA,qBAAsB,CAAC6B,KAAM,oBAAqB7Y,WAU1DugF,EACEoB,EAAgB,MAChB/oD,EAAS54B,GAAOqN,IAAI0I,GAClByiB,EAAUziB,GAAKijB,EAAWC,EAAWljB,EAAG,CAACvR,MAAM,GAAOkF,GAAWqM,GACnE,CAACqD,gBAAiB1P,EAAQgP,UAC5B,SAGF,GAAwB,UAArBmoE,EAA8B,CAG5BtoD,EAAUv4B,KACXA,EAAQP,OAAO8iF,YAAY9iF,OAAO6Y,QAAQtY,GAAOqN,IAAI,EAAEjI,EAAG2Q,KAAO,CAC/DijB,EAAWwoD,EAAmBp8E,EAAG,CAACm0B,OAAO,IACzCX,EAAS7iB,GAAG1I,IAAIuL,GACdogB,EAAWwoD,EAAmB5oE,EAAI,CAACpU,MAAM,EAAM+0B,OAAO,SAI5DknD,EAAmBzgF,EAAO0J,EAAQgP,SAClC6nE,EACEoB,EAAgB,QAChB/oD,EAAS54B,GAAOqN,IAAI0I,GAClByiB,EAAUziB,GACRijB,EAAWwoD,EAAmBzrE,EAC5B,CAACvR,MAAM,EAAM+0B,OAAO,GAAO7vB,GAAWqM,GAC5C,CAACqD,gBAAiB1P,EAAQgP,UAC5B,SAMF,GAAwB,cAArBmoE,GAAoCjqB,EAAgB39B,EAAW,KAAM,CACtE,MAAMupD,EAAiB5pD,QAAejjB,EAAIogD,OAAO,CAC/C98B,YACA2nD,iBACAr2E,QAASvK,EACT0J,UACA2uD,kBAIF,IAAImqB,EAAe7pE,MAAM5C,GAAKqqE,EAAWrqE,IACvC,MAAM,IAAIiB,EACR,2EAEA,qBAAsB,CAAC6B,KAAM,0BAA2B7Y,UAG5DugF,EACEoB,EAAgB,YAAaa,EAAgB,CAACppE,iBAAiB,IACjE,SAIF,GAAwB,WAArBynE,IACCtoD,EAAUv4B,KAAUs4B,EAASt4B,GAC/B,MAAM,IAAIgX,EACR,4EAEA,qBAAsB,CAAC6B,KAAM,uBAAwB7Y,UAGzD,GAAwB,WAArB6gF,EAA+B,CAGhCqB,EAAkBliF,EACfmiF,GAAcvrB,EAAgB39B,EAAW,KAE1C0oD,EAAe,UAAY3hF,EAE3BugF,EACEoB,EAAgB,SAAU3hF,EAAO,CAACoZ,gBAAiB1P,EAAQgP,UAE/D,SAKF,GAAwB,cAArBmoE,EAAkC,CACnC,GAAa,OAAV7gF,EAED,SAEF,IAAIw4B,EAAUx4B,KAAW0J,EAAQgP,QAC/B,MAAM,IAAI1B,EACR,8DACA,qBACA,CAAC6B,KAAM,iCAAkC7Y,UAG7CA,EAAQ44B,EAAS54B,GAAOqN,IAAI0I,GAAKyiB,EAAUziB,GAAKA,EAAEnL,cAAgBmL,GAGlE,IAAI,MAAMvC,KAAQxT,EACbw4B,EAAUhlB,KAAUA,EAAKxO,MAAM07E,IAChC98E,QAAQlB,KAAK,kCAAkC8Q,GAInD+sE,EACEoB,EAAgB,YAAa3hF,EAAO,CAACoZ,gBAAiB1P,EAAQgP,UAChE,SAIF,GAAwB,eAArBmoE,EAAmC,CACpC,IAAIroD,EAAUx4B,KAAW0J,EAAQgP,QAC/B,MAAM,IAAI1B,EACR,+DACA,qBACA,CAAC6B,KAAM,yBAA0B7Y,UAGrCA,EAAQ44B,EAAS54B,GAGjB,IAAI,MAAM4qB,KAAO5qB,EACf,GAAGw4B,EAAU5N,IAAgB,QAARA,GAAyB,QAARA,EACpC,MAAM,IAAI5T,EACR,+DACA,qBACA,CAAC6B,KAAM,yBAA0B7Y,UAIvCugF,EACEoB,EAAgB,aAAc3hF,EAC9B,CAACoZ,gBAAiB1P,EAAQgP,UAC5B,SAIF,GAAwB,WAArBmoE,EAA+B,CAChC,IAAIroD,EAAUx4B,GACZ,MAAM,IAAIgX,EACR,2DACA,qBACA,CAAC6B,KAAM,uBAAwB7Y,UAEnCugF,EAAUoB,EAAgB,SAAU3hF,GACpC,SAIF,GAAwB,aAArB6gF,EAAiC,CAClC,IAAItoD,EAAUv4B,GACZ,MAAM,IAAIgX,EACR,8DACA,qBAAsB,CAAC6B,KAAM,yBAA0B7Y,UAY3D,GATAoiF,QAAsBzsE,EAAIogD,OAAO,CAC/B98B,YACA2nD,eACA,WACAr2E,QAASvK,EACT0J,UACA2uD,iBAGC,aAAc+pB,EACf,IAAI,MAAM1hF,KAAY0hF,EAAc,YAClC7B,EACEoB,EAAgBjhF,EAAU0hF,EAAc,YAAY1hF,GACpD,CAAC0Y,iBAAiB,IAMxB,IAAI8iC,EAAaylC,EAAe,aAAe,KAC/C,IAAI,MAAMjhF,KAAY0hF,EAAe,CACnC,GAAgB,aAAb1hF,EACD,SAEgB,OAAfw7C,IACDA,EAAaylC,EAAe,YAAc,IAE5CpB,EAAUrkC,EAAYx7C,EAAU,GAAI,CAAC0Y,iBAAiB,IACtD,MAAMk+B,EAAQ8qC,EAAc1hF,GAC5B,IAAI,IAAI+hF,EAAK,EAAGA,EAAKnrC,EAAM/zC,SAAUk/E,EAAI,CACvC,MAAMvxE,EAAOomC,EAAMmrC,GACnB,GAAGvC,EAAShvE,IAAS+uE,EAAQ/uE,GAC3B,MAAM,IAAI8F,EACR,6EACuB,qBACvB,CAAC6B,KAAM,iCAAkC7Y,MAAOoiF,IAEpD7B,EAAUrkC,EAAYx7C,EAAUwQ,EAAM,CAACkI,iBAAiB,KAI5D,SAIF,GAAwB,UAArBynE,EAA8B,CAC/BoB,EAAMx5E,KAAKnI,GACX,SAIF,IAAIoiF,EAAUzpD,EACd,MAAMoB,EAAMgmD,EAAiBpnD,EAAW34B,EAAK,YACzCm4B,EAAa4B,KACfqoD,QAAgB/rB,EAAgB,CAC9B19B,YACAE,SAAUkB,EACVT,WAAW,EACXC,mBAAmB,EACnBnwB,aAIJ,MAAMkyB,EAAYykD,EAAiBqC,EAASpiF,EAAK,eAAiB,GAElE,GAAGs7B,EAAU50B,SAAS,cAAgBuxB,EAAUv4B,GAAQ,CACtD,MAAMg8B,EAAYqkD,EAAiBqC,EAASpiF,EAAK,cAEjD8hF,EAAgBtB,EAAmB4B,EAAS1iF,EAAOg8B,EAAWtyB,QACzD,GAAGkyB,EAAU50B,SAAS,WAAauxB,EAAUv4B,GAAQ,CAE1D,MAAMkhF,EAAUtlD,EAAU50B,SAAS,UAC7Bm6E,EAAWd,EAAiBqC,EAASpiF,EAAK,WAAa,SACvD8gF,EAA6B,WAAbD,GACpBnoD,EAAWC,EAAWkoD,EAAU,CAAC5nD,OAAO,GAAO7vB,GAEjD04E,QAAsBnB,EAAgB,CACpChoD,UAAWypD,EACXh5E,UACAk3E,eAAgBtgF,EAChBN,QACAq4D,eACA6oB,UACAC,WACAC,uBAEG,GAAGxlD,EAAU50B,SAAS,QAAUuxB,EAAUv4B,GAAQ,CAEvD,MAAMkhF,EAAUtlD,EAAU50B,SAAS,UACnCo7E,QAAsBnB,EAAgB,CACpChoD,UAAWypD,EACXh5E,UACAk3E,eAAgBtgF,EAChBN,QACAq4D,eACA6oB,UACAC,SAAU,aAEP,GAAGvlD,EAAU50B,SAAS,UAAYuxB,EAAUv4B,GAEjDoiF,QAAsBnB,EAAgB,CAEpChoD,UAAWypD,EAAQllD,0BACnB9zB,UACAk3E,eAAgBtgF,EAChBN,QACAq4D,eACA6oB,SAAS,EACTC,SAAU,cAEP,CAEL,MAAMloE,EAA+B,UAArB4nE,EAChB,GAAG5nE,GAA+B,SAArB4nE,EAA6B,CACxC,IAAI8B,EAAqB/B,EACtB3nE,GAAqC,WAA3B2oE,IACXe,EAAqB,MAEvBP,QAAsBzsE,EAAIogD,OAAO,CAC/B98B,UAAWypD,EACX9B,eAAgB+B,EAChBp4E,QAASvK,EACT0J,UACA43E,WAAYroE,EACZo/C,sBAIF+pB,EAD8C,UAA9C/B,EAAiBpnD,EAAW34B,EAAK,SACjB,CACd,QAAS,QACT,SAAUN,SAIU2V,EAAIogD,OAAO,CAC/B98B,UAAWypD,EACX9B,eAAgBtgF,EAChBiK,QAASvK,EACT0J,UACA43E,YAAY,EACZjpB,iBAMN,GAAqB,OAAlB+pB,GAA+C,WAArBvB,IAE3BuB,EAAgB/pB,EAAa,CAC3BqpB,cAAe1hF,EACf6gF,mBACA5nD,UAAWypD,EACX9B,iBACAxwD,OAAQ7lB,EACRb,UACA43E,aACAhhF,MACAqhF,wBAEmBj0E,IAAlB00E,GAwBL,GAlBwB,UAArBvB,IAAiCZ,EAAQmC,IAC1CxmD,EAAU50B,SAAS,WAEnBo7E,EAAgB,CAAC,QAASxpD,EAASwpD,KAMlCxmD,EAAU50B,SAAS,YACnB40B,EAAU7jB,KAAKzX,GAAe,QAARA,GAAyB,WAARA,KAExC8hF,EAAgBxpD,EAASwpD,GACtB/0E,IAAI0I,IAAK,CAAE,SAAU6iB,EAAS7iB,OAKhC2sE,EAAQ5zD,SAASsM,IAAI96B,IAAQoiF,EAAQ5zD,SAASlvB,IAAIU,GAAKm7B,QAA1D,CACE,MAAMygB,EACJylC,EAAe,YAAcA,EAAe,aAAe,GAC7DS,EAAgBxpD,EAASwpD,GACzB,IAAI,IAAIK,EAAK,EAAGA,EAAKL,EAAc7+E,SAAUk/E,EAAI,CAC/C,MAAMvxE,EAAOkxE,EAAcK,GAC3B,GAAGvC,EAAShvE,IAAS+uE,EAAQ/uE,GAC3B,MAAM,IAAI8F,EACR,6EACuB,qBACvB,CAAC6B,KAAM,iCAAkC7Y,MAAOoiF,IAEpD7B,EAAUrkC,EAAY2kC,EAAkB3vE,EAAM,CAACkI,iBAAiB,UAOpEmnE,EAAUoB,EAAgBd,EAAkBuB,EAAe,CACzDhpE,iBAAiB,IAMrB,GAAG,WAAYuoE,EACb,GAA+B,UAA5BA,EAAe,UAAwB/qB,EAAgB39B,EAAW,WAG9D,IAAIV,EAAU2pD,IAAoB5pD,EAAS4pD,MAC/Cx4E,EAAQgP,QACT,MAAM,IAAI1B,EACR,4EAEA,qBACA,CAAC6B,KAAM,6BAA8B7Y,MAAOkiF,IAKlD,IAAI,MAAM5hF,KAAO2hF,EAAO,CACtB,MAAMW,EAAetqD,EAAS/tB,EAAQjK,IAAQiK,EAAQjK,GAAO,CAACiK,EAAQjK,IACtE,IAAI,MAAMwtC,KAAM80C,EAAc,CAC5B,IAAIrqD,EAAUuV,IAAOruC,OAAO4W,KAAKy3B,GAAI/1B,KAAK3S,GACa,WAArD4zB,EAAWC,EAAW7zB,EAAG,CAACm0B,OAAO,GAAO7vB,IACxC,MAAM,IAAIsN,EACR,8DACA,qBACA,CAAC6B,KAAM,sBAAuB7Y,MAAO8tC,UAEnCk0C,EAAc,CAClB/oD,YACA2nD,iBACAgB,yBACAr3E,QAASujC,EACT6zC,iBACAj4E,UACA43E,aACAE,oBACAO,UACA1pB,mBAjpBA2pB,CAAc,CAClB/oD,YACA2nD,iBACAgB,yBACAr3E,UACAo3E,eAAgBpqE,EAChB7N,UACA43E,aACAS,UACAP,oBACAnpB,iBAGFhiD,EAAO5W,OAAO4W,KAAKkB,GACnB,IAAIsU,EAAQxV,EAAK9S,OAEjB,GAAG,WAAYgU,EAAM,CAEnB,GAAG,UAAWA,IAAS,cAAeA,GAAQ,eAAgBA,GAC5D,MAAM,IAAIP,EACR,8HAEA,qBAAsB,CAAC6B,KAAM,uBAAwBtO,QAASgN,IAElE,IAAIsrE,EAAah3D,EAAQ,EAazB,GAZG,UAAWtU,IACZsrE,GAAc,GAEb,WAAYtrE,IACbsrE,GAAc,GAEb,cAAetrE,IAChBsrE,GAAc,GAEb,eAAgBtrE,IACjBsrE,GAAc,GAEE,IAAfA,EACD,MAAM,IAAI7rE,EACR,8JAGA,qBAAsB,CAAC6B,KAAM,uBAAwBtO,QAASgN,IAElE,MAAMoC,EAA4B,OAAnBpC,EAAK,UAAqB,GAAKqhB,EAASrhB,EAAK,WACtDT,EAAQ0pE,EAAWjpE,EAAM,SAG/B,GAAGq/C,EAAgB39B,EAAW,MAAQniB,EAAM9P,SAAS,UAClC,IAAjB8P,EAAMvT,aAED,GAAqB,IAAlBoW,EAAOpW,OAAc,CAC7B,MAAMk+E,QAAeppB,EAAa,CAChCqpB,cAAenqE,EACf0hB,YACA2nD,iBACAr2E,UACAb,UACA43E,eAGA/pE,OADY7J,IAAX+zE,EACMA,EAEA,SAEJ,KAAI9nE,EAAOhB,MAAM5C,GAAMyiB,EAAUziB,IAAMiqE,EAAejqE,KAC3D,cAAewB,EAEf,MAAM,IAAIP,EACR,+DACA,qBACA,CAAC6B,KAAM,gCAAiCtO,QAASgN,IAC9C,IAAIT,EAAM6B,MAAM1Y,GACpBy4B,EAAez4B,MAAQu4B,EAAUv4B,IAA0B,IAApBA,EAAE8D,QAAQ,QAClDi8E,EAAe//E,IACf,MAAM,IAAI+W,EACR,yHAEA,qBAAsB,CAAC6B,KAAM,sBAAuBtO,QAASgN,UAE5D,GAAG,UAAWA,IAAS+gB,EAAS/gB,EAAK,UAE1CA,EAAK,SAAW,CAACA,EAAK,eACjB,GAAG,SAAUA,GAAQ,UAAWA,EAAM,CAE3C,GAAGsU,EAAQ,IAAiB,IAAVA,KAAe,WAAYtU,IAC3C,MAAM,IAAIP,EACR,0IAEa,qBACb,CAAC6B,KAAM,6BAA8BtO,QAASgN,IAG/C,SAAUA,IACXA,EAAOA,EAAK,QACZlB,EAAO5W,OAAO4W,KAAKkB,GACnBsU,EAAQxV,EAAK9S,aAEV,GAAa,IAAVsoB,GAAe,cAAetU,EAAM,CAE5C,MAAMkqE,QAAeppB,EAAa9gD,EAAM,CACtCmqE,cAAenqE,EACf0hB,YACA2nD,iBACAr2E,UACAb,UACA43E,eAGA/pE,OADY7J,IAAX+zE,EACMA,EAEA,KAMX,GAAGlpD,EAAUhhB,KACV7N,EAAQ0uD,wBAA0BkpB,IACf,OAAnBV,GAAsD,WAA3BgB,KAEf,IAAV/1D,GAAe,WAAYtU,GAAQ,UAAWA,GACpC,IAAVsU,GAAe,QAAStU,GAAO,CAChC,MAAMkqE,QAAeppB,EAAa,CAChCqpB,cAAenqE,EACf0hB,YACA2nD,iBACAr2E,UACAb,UACA43E,eAGA/pE,OADY7J,IAAX+zE,EACMA,EAEA,KAKb,OAAOlqE,I,6BC7XT,MACE0K,mBAAoBw0C,GAClB,EAAQ,KAGV9a,oBAAqBub,GACnB,EAAQ,IAENvhD,EAAM,GACZrX,EAAOD,QAAUsX,EASjBA,EAAI0/C,QAAUv7C,IACZ,MAAM3I,EAAe+lD,EAAqBp9C,GAGpCw7C,EAAY,GACZj/C,EAAO5W,OAAO4W,KAAKlF,GAAc7F,OACvC,IAAI,IAAI2O,EAAK,EAAGA,EAAK5D,EAAK9S,SAAU0W,EAAI,CACtC,MAAMxQ,EAAO0H,EAAakF,EAAK4D,IAE3Bw8C,EAAoBhtD,IACtB6rD,EAAU7sD,KAAKgB,GAGnB,OAAO6rD,I,6BC/BT,MAAMt+C,EAAc,EAAQ,IACtBH,EAAa,EAAQ,IACrBC,EAAQ,EAAQ,IAChBuhB,EAAO,EAAQ,KAGf,SAEJwkC,EAAQ,UACRC,EAAS,SACTC,EAAQ,QACRC,EAAO,SACPC,EAAQ,iBAGRG,EAAgB,YAKhBE,EAAW,WACXC,EAAU,YACVC,EAAW,WACXjC,GACE,EAAQ,IAENmlB,EAAc,sCAEd/qE,EAAM,GAuPZ,SAASmtE,EAAatjF,EAAGujF,EAAgBC,GAEvC,GAAGxjF,EAAEwG,SAASi9E,SAAS,QACrB,MAAO,CAAC,MAAOzjF,EAAEQ,OAInB,MAAMuX,EAAO,CAAC,SAAU/X,EAAEQ,OAG1B,GAAGR,EAAE6T,SACHkE,EAAK,aAAe/X,EAAE6T,aACjB,CACL,IAAI2B,EAAOxV,EAAE8T,SAAStT,MAItB,GAHIgV,IACFA,EAAOumD,GAENvmD,IAASooD,EAAkB,CAC5BpoD,EAAO,QACP,IACEuC,EAAK,UAAYklB,KAAK5Z,MAAMtL,EAAK,WACjC,MAAM3I,GACN,MAAM,IAAIoI,EACR,oCACA,4BACA,CAAC6B,KAAM,uBAAwB7Y,MAAOuX,EAAK,UAAW+8B,MAAO1lC,KAInE,GAAGm0E,EAAgB,CACjB,GAAG/tE,IAASsoD,EACY,SAAnB/lD,EAAK,UACNA,EAAK,WAAY,EACU,UAAnBA,EAAK,YACbA,EAAK,WAAY,QAEd,GAAGT,EAAMR,UAAUiB,EAAK,WAC7B,GAAGvC,IAASwoD,EAAa,CACvB,MAAMz+D,EAAIusB,SAAS/T,EAAK,UAAW,IAChCxY,EAAEmkF,QAAQ,KAAO3rE,EAAK,YACvBA,EAAK,UAAYxY,QAEXiW,IAASuoD,IACjBhmD,EAAK,UAAYf,WAAWe,EAAK,YAIjC,CAAC+lD,EAAaE,EAAaD,EAAYhC,GAAYv0D,SAASgO,KAC9DuC,EAAK,SAAWvC,QAEb,GAAoB,kBAAjBguE,GACRhuE,EAAKgyB,WAAW,+BAAgC,CAChD,MAAO,CAAE3zB,EAAU2oB,GAAahnB,EAAK7N,MAAM,QACxCkM,EAAS9P,OAAS,IACnBgU,EAAK,aAAelE,EAChBA,EAASrO,MAAM07E,IACjB98E,QAAQlB,KAAK,kCAAkC2Q,IAGnDkE,EAAK,cAAgBykB,OACbhnB,IAASumD,IACjBhkD,EAAK,SAAWvC,GAIpB,OAAOuC,EAvTTjZ,EAAOD,QAAUsX,EAUjBA,EAAIi/C,QAAUj7B,MACZqgC,GAEEmpB,cAAa,EACbJ,kBAAiB,EACjBC,eAAe,SAGjB,MAAM7xE,EAAe,GACfiyE,EAAW,CAAC,WAAYjyE,GACxBkyE,EAAiB,GAEvB,IAAI,MAAMvyE,KAAQkpD,EAAS,CAEzB,MAAM16D,EAAgC,iBAAxBwR,EAAKiB,MAAM/L,SACvB,WAAa8K,EAAKiB,MAAM/R,MACrBV,KAAQ8jF,IACXA,EAAS9jF,GAAQ,IAEP,aAATA,GAAyBA,KAAQ6R,IAClCA,EAAa7R,GAAQ,CAAC,MAAOA,IAG/B,MAAMo9C,EAAU0mC,EAAS9jF,GAGnBwB,EAAIgQ,EAAKvD,QAAQvN,MACjBa,EAAIiQ,EAAKtD,UAAUxN,MACnBR,EAAIsR,EAAKrQ,OAEVK,KAAK47C,IACRA,EAAQ57C,GAAK,CAAC,MAAOA,IAEvB,MAAM2I,EAAOizC,EAAQ57C,GAEfwiF,EAAe9jF,EAAEwG,SAASi9E,SAAS,QAKzC,GAJGK,KAAkB9jF,EAAEQ,SAAS08C,KAC9BA,EAAQl9C,EAAEQ,OAAS,CAAC,MAAOR,EAAEQ,QAG5Ba,IAAMo8D,IAAakmB,GAAcG,EAAc,CAChDjrD,EAAKlf,SAAS1P,EAAM,QAASjK,EAAEQ,MAAO,CAACoZ,iBAAiB,IACxD,SAGF,MAAMpZ,EAAQ8iF,EAAatjF,EAAGujF,EAAgBC,GAK9C,GAJA3qD,EAAKlf,SAAS1P,EAAM5I,EAAGb,EAAO,CAACoZ,iBAAiB,IAI7CkqE,EACD,GAAG9jF,EAAEQ,QAAUg9D,EAAS,CAEtB,MAAMv8D,EAASi8C,EAAQl9C,EAAEQ,OACpB,WAAYS,IACfA,EAAO8iF,OAAS,IAElB9iF,EAAO8iF,OAAO96E,KAAK,CACjBgB,OACA/I,SAAUG,EACVb,eAEMR,EAAEQ,SAASqjF,EAEnBA,EAAe7jF,EAAEQ,QAAS,EAG1BqjF,EAAe7jF,EAAEQ,OAAS,CACxByJ,OACA/I,SAAUG,EACVb,SAwER,IAAI,MAAMV,KAAQ8jF,EAAU,CAC1B,MAAMI,EAAcJ,EAAS9jF,GAG7B,KAAK09D,KAAWwmB,GACd,SAIF,MAAMvuE,EAAMuuE,EAAYxmB,GACxB,GAAI/nD,EAAIsuE,OAAR,CAGA,IAAI,IAAIE,KAASxuE,EAAIsuE,OAAQ,CAC3B,IAAI95E,EAAOg6E,EAAMh6E,KACb/I,EAAW+iF,EAAM/iF,SACjBijD,EAAO8/B,EAAMzjF,MACjB,MAAMghB,EAAO,GACP0iE,EAAY,GAQlB,IAAIC,EAAelkF,OAAO4W,KAAK5M,GAAMlG,OACrC,KAAM7C,IAAaq8D,GACjBjmD,EAAMV,SAASitE,EAAe55E,EAAK,UACnCqN,EAAMlB,QAAQnM,EAAKqzD,KAA0C,IAA3BrzD,EAAKqzD,GAAWv5D,QAClDuT,EAAMlB,QAAQnM,EAAKszD,KAAwC,IAA1BtzD,EAAKszD,GAAUx5D,SAC9B,IAAjBogF,GACmB,IAAjBA,GAAsB7sE,EAAMlB,QAAQnM,EAAK,WACjB,IAAzBA,EAAK,SAASlG,QAAgBkG,EAAK,SAAS,KAAOozD,KACrD77C,EAAKvY,KAAKgB,EAAKqzD,GAAW,IAC1B4mB,EAAUj7E,KAAKgB,EAAK,QAGpBg6E,EAAQJ,EAAe55E,EAAK,QAC5BA,EAAOg6E,EAAMh6E,KACb/I,EAAW+iF,EAAM/iF,SACjBijD,EAAO8/B,EAAMzjF,MACb2jF,EAAelkF,OAAO4W,KAAK5M,GAAMlG,OAG7BsT,EAAWvQ,YAAYmD,aAMtBk6C,EAAK,OACZA,EAAK,SAAW3iC,EAAKya,UACrB,IAAI,MAAMmoD,KAAYF,SACbF,EAAYI,UAIhB3uE,EAAIsuE,QAGb,MAAM17E,EAAS,GACT4lB,EAAWhuB,OAAO4W,KAAKlF,GAAc7F,OAC3C,IAAI,MAAMiC,KAAWkgB,EAAU,CAC7B,MAAMhkB,EAAO0H,EAAa5D,GAC1B,GAAGA,KAAW61E,EAAU,CACtB,MAAMrxE,EAAQtI,EAAK,UAAY,GACzB+5E,EAAcJ,EAAS71E,GACvBs2E,EAAgBpkF,OAAO4W,KAAKmtE,GAAal4E,OAC/C,IAAI,MAAMw4E,KAAgBD,EAAe,CACvC,MAAMp6E,EAAO+5E,EAAYM,GAErBjtE,EAAWoL,mBAAmBxY,IAChCsI,EAAMtJ,KAAKgB,IAKboN,EAAWoL,mBAAmBxY,IAChC5B,EAAOY,KAAKgB,GAIhB,OAAO5B,I,6BCxQT,MAAM,cAACg0C,GAAiB,EAAQ,KAC1B,UAACxiB,GAAa,EAAQ,IACtBxiB,EAAa,EAAQ,IACrBktE,EAAmB,EAAQ,IAC3BjtE,EAAQ,EAAQ,IAChBuhB,EAAO,EAAQ,KAEf,UAGJykC,EAAS,SACTC,EAAQ,QACRC,EAAO,SACPC,EAAQ,iBAGRG,EAAgB,eAEhB9B,EAAc,YAGdgC,EAAW,WACXC,EAAU,YACVC,EAAW,WACXjC,GACE,EAAQ,KAGVh4C,WAAYmV,GACV,EAAQ,IAEN/iB,EAAM,GAmDZ,SAASquE,EAAYhqB,EAASjoD,EAAOkyE,EAAWjqE,EAAQtQ,GACtD,MAAMyzB,EAAM19B,OAAO4W,KAAKtE,GAAOzG,OAC/B,IAAI,MAAMoF,KAAMysB,EAAK,CACnB,MAAM1zB,EAAOsI,EAAMrB,GACbsrC,EAAav8C,OAAO4W,KAAK5M,GAAM6B,OACrC,IAAI,IAAI5K,KAAYs7C,EAAY,CAC9B,MAAM1E,EAAQ7tC,EAAK/I,GACnB,GAAgB,UAAbA,EACDA,EAAWu8D,OACN,GAAG5jC,EAAU34B,GAClB,SAGF,IAAI,MAAMwQ,KAAQomC,EAAO,CAEvB,MAAM/pC,EAAU,CACdvH,SAAU0K,EAAGs2B,WAAW,MAAQ,YAAc,YAC9ChnC,MAAO0Q,GAIT,IAAIgoB,EAAehoB,GACjB,SAIF,MAAMlD,EAAY,CAChBxH,SAAUtF,EAASsmC,WAAW,MAAQ,YAAc,YACpDhnC,MAAOU,GAIT,IAAIg4B,EAAeh4B,GACjB,SAIF,GAA0B,cAAvB8M,EAAUxH,WACV0D,EAAQqwD,sBACT,SAIF,MAAMt5D,EACJyjF,EAAahzE,EAAM8I,EAAQggD,EAASiqB,EAAWv6E,EAAQs5E,cAEtDviF,GACDu5D,EAAQvxD,KAAK,CACX8E,UACAC,YACA/M,SACAsR,MAAOkyE,OA8EnB,SAASC,EAAahzE,EAAM8I,EAAQggD,EAASiqB,EAAWjB,GACtD,MAAMviF,EAAS,GAGf,GAAGoW,EAAWuD,QAAQlJ,GAAO,CAC3BzQ,EAAOuF,SAAW,UAClBvF,EAAOT,WAAQ0N,EACfjN,EAAO6S,SAAW,CAChBtN,SAAU,aAEZ,IAAIhG,EAAQkR,EAAK,UACjB,MAAMoC,EAAWpC,EAAK,UAAY,KAGlC,GAAgB,UAAboC,EACD7S,EAAOT,MAAQ+jF,EAAiB/jF,GAChCS,EAAO6S,SAAStT,MAAQo9D,OACnB,GAAGtmD,EAAMhB,UAAU9V,GACxBS,EAAOT,MAAQA,EAAM+O,WACrBtO,EAAO6S,SAAStT,MAAQsT,GAAYgqD,OAC/B,GAAGxmD,EAAMd,SAAShW,IAAUsT,IAAaiqD,EAC1CzmD,EAAMd,SAAShW,KACjBA,EAAQwW,WAAWxW,IAGrBS,EAAOT,MAAQA,EAAMmkF,cAAc,IAAIl/E,QAAQ,aAAc,OAC7DxE,EAAO6S,SAAStT,MAAQsT,GAAYiqD,OAC/B,GAAGzmD,EAAMb,SAASjW,GACvBS,EAAOT,MAAQA,EAAMkjF,QAAQ,GAC7BziF,EAAO6S,SAAStT,MAAQsT,GAAYkqD,OAC/B,GAAoB,kBAAjBwlB,GACR,eAAgB9xE,EAAM,CACtB,MAAMoC,EAAW,+BACdpC,EAAK,cAAgB,IACtB,IAAIA,EAAK,cACXzQ,EAAO6S,SAAStT,MAAQsT,EACxB7S,EAAOT,MAAQA,MACP,cAAekR,GACvBzQ,EAAOT,MAAQA,EACfS,EAAO6S,SAAStT,MAAQsT,GAAYgoD,EACpC76D,EAAO4S,SAAWnC,EAAK,eAEvBzQ,EAAOT,MAAQA,EACfS,EAAO6S,SAAStT,MAAQsT,GAAYioD,QAEjC,GAAG1kD,EAAWoC,OAAO/H,GAAO,CACjC,MAAM6qC,EAzGV,SAAoB/6B,EAAMhH,EAAQggD,EAASiqB,EAAWjB,GACpD,MAAM9tE,EAAQ,CAAClP,SAAU,YAAahG,MAAO88D,GACvC3nD,EAAO,CAACnP,SAAU,YAAahG,MAAO+8D,GACtC9nD,EAAM,CAACjP,SAAU,YAAahG,MAAOg9D,GAErCl5C,EAAO9C,EAAKrV,MAEZ9D,EAASic,EAAO,CAAC9d,SAAU,YAAahG,MAAOga,EAAO1F,SAAWW,EACvE,IAAI1H,EAAU1F,EAEd,IAAI,MAAMqJ,KAAQ8P,EAAM,CACtB,MAAMvgB,EAASyjF,EAAahzE,EAAM8I,EAAQggD,EAASiqB,EAAWjB,GACxDj/D,EAAO,CAAC/d,SAAU,YAAahG,MAAOga,EAAO1F,SACnD0lD,EAAQvxD,KAAK,CACX8E,UACAC,UAAW0H,EACXzU,SACAsR,MAAOkyE,IAETjqB,EAAQvxD,KAAK,CACX8E,UACAC,UAAW2H,EACX1U,OAAQsjB,EACRhS,MAAOkyE,IAET12E,EAAUwW,EAIZ,GAAGD,EAAM,CACP,MAAMrjB,EAASyjF,EAAapgE,EAAM9J,EAAQggD,EAASiqB,EAAWjB,GAC9DhpB,EAAQvxD,KAAK,CACX8E,UACAC,UAAW0H,EACXzU,SACAsR,MAAOkyE,IAETjqB,EAAQvxD,KAAK,CACX8E,UACAC,UAAW2H,EACX1U,OAAQwU,EACRlD,MAAOkyE,IAIX,OAAOp8E,EA6DHu8E,CAAWlzE,EAAK,SAAU8I,EAAQggD,EAASiqB,EAAWjB,GACxDviF,EAAOuF,SAAW+1C,EAAM/1C,SACxBvF,EAAOT,MAAQ+7C,EAAM/7C,UAChB,CAEL,MAAM0Q,EAAKoG,EAAMV,SAASlF,GAAQA,EAAK,OAASA,EAChDzQ,EAAOuF,SAAW0K,EAAGs2B,WAAW,MAAQ,YAAc,YACtDvmC,EAAOT,MAAQ0Q,EAIjB,MAAuB,cAApBjQ,EAAOuF,UAA6B0yB,EAAej4B,EAAOT,OAItDS,EAHE,KA9OXnC,EAAOD,QAAUsX,EAUjBA,EAAIwgD,MAAQ,CAACr8C,EAAOpQ,KAElB,MAAMsQ,EAAS,IAAIqe,EAAKthB,iBAAiB,OACnC2lC,EAAU,CAAC,WAAY,IAC7Bb,EAAc/hC,EAAO4iC,EAAS,WAAY1iC,GAE1C,MAAMggD,EAAU,GACVxd,EAAa/8C,OAAO4W,KAAKqmC,GAASpxC,OACxC,IAAI,MAAMmxC,KAAaD,EAAY,CACjC,IAAIynC,EACJ,GAAiB,aAAdxnC,EACDwnC,EAAY,CAACj+E,SAAU,eAAgBhG,MAAO,QACzC,KAAG04B,EAAe+jB,GASvB,SAPEwnC,EADCxnC,EAAUzV,WAAW,MACV,CAAChhC,SAAU,aAEX,CAACA,SAAU,aAEzBi+E,EAAUjkF,MAAQy8C,EAKpBunC,EAAYhqB,EAAStd,EAAQD,GAAYwnC,EAAWjqE,EAAQtQ,GAG9D,OAAOswD,I,6BCrET17D,EAAOD,QAAU,SAAS0nC,EAAWtlC,GACnC,OAAe,OAAXA,GAAqC,iBAAXA,GAAwC,MAAjBA,EAAOsrC,OACnDtP,KAAKC,UAAUj8B,GAGpBoV,MAAMD,QAAQnV,GACT,IAAMA,EAAOgQ,OAAO,CAACxQ,EAAGokF,EAAIC,IAG1BrkF,GAFc,IAAPqkF,EAAW,GAAK,KAEXv+C,OADEr4B,IAAP22E,GAAkC,iBAAPA,EAAkB,KAAOA,GAEjE,IAAM,IAGJ,IAAM5kF,OAAO4W,KAAK5V,GAAQ6K,OAAOmF,OAAO,CAACxQ,EAAGokF,EAAIC,KACrD,QAAmB52E,IAAfjN,EAAO4jF,IACe,iBAAf5jF,EAAO4jF,GAChB,OAAOpkF,EAGT,OAAOA,GADoB,IAAbA,EAAEsD,OAAe,GAAK,KACjBwiC,EAAUs+C,GAAM,IAAMt+C,EAAUtlC,EAAO4jF,KACzD,IAAM,M,6BCnBX,MAAM,UAAChrD,GAAa,EAAQ,IACtBxiB,EAAa,EAAQ,IACrBC,EAAQ,EAAQ,IAChBuhB,EAAO,EAAQ,IACf8C,EAAM,EAAQ,IACdnkB,EAAc,EAAQ,KAE1B6kC,cAAeob,EACf5a,mBAAoBkoC,GAClB,EAAQ,IAEN5uE,EAAM,GA0WZ,SAAS6uE,EAAqBzlE,GAC5B,MAAMmuB,EAAQ,GACd,IAAI,MAAM5sC,KAAOye,OACGrR,IAAfqR,EAAMze,KACP4sC,EAAM,IAAM5sC,GAAO,CAACye,EAAMze,KAG9B,MAAO,CAAC4sC,GAaV,SAASu3C,EAA0BC,EAAgB3yE,EAAO4yE,GACxD,IAAI,IAAI5lF,EAAI4lF,EAAaphF,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CAChD,MAAMwO,EAAUo3E,EAAa5lF,GAC7B,GAAGwO,EAAQwE,QAAUA,GACnBxE,EAAQA,QAAQ,SAAWm3E,EAAe,OAC1C,OAAO,EAGX,OAAO,EAYT,SAASE,EAAc13C,EAAOxjC,EAASpK,GACrC,MAAMulF,EAAO,IAAMvlF,EACnB,IAAIiY,EAAQstE,KAAQ33C,EAAQA,EAAM23C,GAAM,GAAKn7E,EAAQpK,GACrD,GAAY,UAATA,EAKD,IAAY,IAATiY,EACDA,EAAO,aACF,IAAY,IAATA,EACRA,EAAO,cACF,GAAY,YAATA,GAA+B,WAATA,GAA8B,UAATA,GAC1C,WAATA,GAA8B,UAATA,GAA6B,UAATA,EACzC,MAAM,IAAIP,EACR,mDACA,qBAAsB,CAAC6B,KAAM,uBAAwBq0B,UAG3D,OAAO31B,EAQT,SAASutE,EAAe53C,GACtB,IAAIp2B,EAAMlB,QAAQs3B,IAA2B,IAAjBA,EAAM3pC,SAAiBuT,EAAMV,SAAS82B,EAAM,IACtE,MAAM,IAAIl2B,EACR,mEACA,qBAAsB,CAACk2B,UAG3B,GAAG,QAASA,EAAM,GAChB,IAAI,MAAMx8B,KAAM2nB,EAAKzgB,QAAQs1B,EAAM,GAAG,QAEpC,IAAKp2B,EAAMV,SAAS1F,KAAOyqB,EAAI5X,WAAW7S,IACvCoG,EAAMJ,SAAShG,IAA4B,IAArBA,EAAG3M,QAAQ,MAClC,MAAM,IAAIiT,EACR,gDACA,qBAAsB,CAAC6B,KAAM,gBAAiBq0B,UAKtD,GAAG,UAAWA,EAAM,GAClB,IAAI,MAAMl4B,KAAQqjB,EAAKzgB,QAAQs1B,EAAM,GAAG,UAEtC,IAAKp2B,EAAMV,SAASpB,KAASmmB,EAAI5X,WAAWvO,IACzC8B,EAAMJ,SAAS1B,IAAgC,IAAvBA,EAAKjR,QAAQ,MACtC,MAAM,IAAIiT,EACR,kDACA,qBAAsB,CAAC6B,KAAM,gBAAiBq0B,UA8CxD,SAAS63C,EAAe/gD,EAAOz2B,EAAS2/B,EAAOnuB,GAE7C,IAAIimE,GAAW,EACXC,GAAc,EAElB,IAAI,MAAM3kF,KAAO4sC,EAAO,CACtB,IAAIg4C,GAAY,EAChB,MAAMC,EAAa9sD,EAAK7e,UAAUjM,EAASjN,GACrC8kF,EAAgD,IAAtC/sD,EAAK7e,UAAU0zB,EAAO5sC,GAAKiD,OAE3C,GAAW,QAARjD,GAOD,GALGwW,EAAMX,cAAc+2B,EAAM,OAAO,IAAM,IACxCg4C,GAAY,EACJh4C,EAAM,OAAO3pC,QAAU,IAC/B2hF,EAAYh4C,EAAM,OAAOlmC,SAASm+E,EAAW,MAE3CpmE,EAAMi6C,WACR,OAAOksB,OAEJ,GAAW,UAAR5kF,EAAiB,CAIzB,GADA0kF,GAAW,EACRI,EAAS,CACV,GAAGD,EAAW5hF,OAAS,EAErB,OAAO,EAET2hF,GAAY,OACP,GAA6B,IAA1Bh4C,EAAM,SAAS3pC,QACvBuT,EAAMX,cAAc+2B,EAAM,SAAS,IAEnCg4C,EAAYC,EAAW5hF,OAAS,OAGhC,IAAI,MAAMyR,KAAQk4B,EAAM,SAGpBg4C,KAFCpuE,EAAMV,SAASpB,MAAS,aAAcA,MAI3BkwE,GAAaC,EAAWptE,KAAKstE,GAAMA,IAAOrwE,IAI5D,IAAI+J,EAAMi6C,WACR,OAAOksB,MAEJ,IAAG7rD,EAAU/4B,GAClB,SACK,CAEL,MAAMglF,EAAYjtD,EAAK7e,UAAU0zB,EAAO5sC,GAAK,GAC7C,IAAIilF,GAAa,EAWjB,GAVGD,IACDR,EAAe,CAACQ,IAChBC,EAAa,aAAcD,GAI7BN,GAAW,EAIc,IAAtBG,EAAW5hF,QAAgBgiF,EAC5B,SAIF,GAAGJ,EAAW5hF,OAAS,GAAK6hF,EAC1B,OAAO,EAGT,QAAiB13E,IAAd43E,EAAyB,CAG1B,GAAGH,EAAW5hF,OAAS,EACrB,OAAO,EAET2hF,GAAY,OAEZ,GAAGruE,EAAWoC,OAAOqsE,GAAY,CAC/B,MAAME,EAAYF,EAAU,SAAS,GACrC,GAAGzuE,EAAWoC,OAAOksE,EAAW,IAAK,CACnC,MAAMM,EAAiBN,EAAW,GAAG,SAElCtuE,EAAWuD,QAAQorE,GAEpBN,EAAYO,EAAe1tE,KAAK2tE,GAAMC,EAAYH,EAAWE,KACrD7uE,EAAWtQ,UAAUi/E,IAC7B3uE,EAAWoL,mBAAmBujE,MAC9BN,EAAYO,EAAe1tE,KAAK2tE,GAAME,EACpC5hD,EAAOwhD,EAAWE,EAAI3mE,WAI5BmmE,EADQruE,EAAWuD,QAAQkrE,GACfH,EAAWptE,KAAK+1B,GAAM63C,EAAYL,EAAWx3C,IACjDj3B,EAAWoL,mBAAmBqjE,GAEpCH,EAAWptE,KAAK+1B,GAAM83C,EAAW5hD,EAAOshD,EAAWx3C,EAAI/uB,MACjDjI,EAAMV,SAASkvE,IACXH,EAAW5hF,OAAS,GAQtC,IAAI2hF,GAAanmE,EAAMi6C,WACrB,OAAO,EAGTisB,EAAcA,GAAeC,EAI/B,OAAOF,GAAYC,EASrB,SAASY,EAAa7hD,EAAOtzB,GAE3B,MAAMo1E,EAAS9hD,EAAM+hD,aAAa/hD,EAAMjyB,OAClC+mD,EAAQgtB,EAAOp1E,GACf0f,EAAS0oC,EAAM1oC,OACf1vB,EAAWo4D,EAAMp4D,SAGjB6M,EAAU,CAAC,MAAOmD,GAGxB,GAAGoG,EAAMlB,QAAQwa,IAEf,IAAI,IAAIrxB,EAAI,EAAGA,EAAIqxB,EAAO7sB,SAAUxE,EAClC,GAAGs5B,EAAKnf,cAAckX,EAAOrxB,GAAIwO,GAAU,CACzC6iB,EAAOrxB,GAAKwO,EACZ,WAGC,CAEL,MAAMy4E,EAAWlvE,EAAMlB,QAAQwa,EAAO1vB,IACtC23B,EAAK3e,YAAY0W,EAAQ1vB,EAAU6M,EAAS,CAAC6L,gBAAiB4sE,IAC9D3tD,EAAKlf,SAASiX,EAAQ1vB,EAAU6M,EAAS,CAAC6L,gBAAiB4sE,IAI7D,MAAMC,EAAmBv1E,IAEvB,MAAMysB,EAAM19B,OAAO4W,KAAKyvE,GACxB,IAAI,MAAM/hE,KAAQoZ,EACbpZ,KAAQ+hE,GAAUhvE,EAAMV,SAAS0vE,EAAO/hE,GAAMqM,SAC/C01D,EAAO/hE,GAAMqM,OAAO,SAAW1f,WACxBo1E,EAAO/hE,GACdkiE,EAAiBliE,KAIvBkiE,EAAiBv1E;;;;;;;;GAwEnB,SAASw1E,EAAgB91D,EAAQ1vB,EAAUqN,GACtC+I,EAAMV,SAASga,GAChBiI,EAAKlf,SAASiX,EAAQ1vB,EAAUqN,EAAQ,CAACqL,iBAAiB,IAE1DgX,EAAO3nB,KAAKsF,GAYhB,SAAS63E,EAAW5hD,EAAO/iB,EAASjhB,EAAO+e,GACzC,KAAK,QAAS/e,GACZ,OAAO,EAET,MAAMmmF,EAAaniD,EAAMvW,SAASztB,EAAM,QACxC,OAAOmmF,GAAcpB,EAAe/gD,EAAOmiD,EAAYllE,EAASlC,GAkBlE,SAAS4mE,EAAY1kE,EAASjhB,GAC5B,MAAMka,EAAKla,EAAM,UACX07D,EAAK17D,EAAM,SACXomF,EAAKpmF,EAAM,aACXma,EAAK8G,EAAQ,UAChBnK,EAAMlB,QAAQqL,EAAQ,WACrBA,EAAQ,UAAY,CAACA,EAAQ,WAC/B,GACI06C,EAAK16C,EAAQ,SAChBnK,EAAMlB,QAAQqL,EAAQ,UACrBA,EAAQ,SAAW,CAACA,EAAQ,UAC9B,GACIolE,EAAKplE,EAAQ,aAChBnK,EAAMlB,QAAQqL,EAAQ,cACrBA,EAAQ,aAAe,CAACA,EAAQ,cAClC,GAEF,OAAiB,IAAd9G,EAAG5W,QAA8B,IAAdo4D,EAAGp4D,QAA8B,IAAd8iF,EAAG9iF,WAGvC4W,EAAGnT,SAASkT,KAAOpD,EAAMX,cAAcgE,EAAG,WAGzCuhD,GAAoB,IAAdC,EAAGp4D,QAAgBo4D,EAAG30D,SAAS00D,IAAOA,GAChD5kD,EAAMX,cAAcwlD,EAAG,UAGnByqB,GAAoB,IAAdC,EAAG9iF,QAAgB8iF,EAAGr/E,SAASo/E,IAAOA,GAChDtvE,EAAMX,cAAckwE,EAAG,MAnyB3B/nF,EAAOD,QAAUsX,EAWjBA,EAAI0gD,qBAAuB,CAACv8C,EAAOozB,EAAOxjC,KAExC,MAAMs6B,EAAQ,CACZt6B,UACA48E,UAAU,EACVv0E,MAAO,WACPqxE,SAAU,CAAC,WAAY,IACvBuB,aAAc,GACdvmD,KAAM,GACNmoD,SAAU,IAKNvsE,EAAS,IAAIqe,EAAKthB,iBAAiB,OACzCkgD,EAAen9C,EAAOkqB,EAAMo/C,SAAU,WAAYppE,GAC/CtQ,EAAQ4yC,SACTtY,EAAMo/C,SAAS,WAAamB,EAAoBvgD,EAAMo/C,UACtDp/C,EAAMjyB,MAAQ,WAEhBiyB,EAAMvW,SAAWuW,EAAMo/C,SAASp/C,EAAMjyB,OAGtC,MAAM0nD,EAAS,GAYf,OAXA9jD,EAAIu3B,MAAMlJ,EAAOvkC,OAAO4W,KAAK2tB,EAAMvW,UAAUniB,OAAQ4hC,EAAOusB,GAGzD/vD,EAAQ2vD,4BAET3vD,EAAQwvD,cACNz5D,OAAO4W,KAAK2tB,EAAMuiD,UAAU3sE,OAAOlJ,GAAoC,IAA9BszB,EAAMuiD,SAAS71E,GAAInN;;AAIhEmG,EAAQ00B,KAAO,GAsnBjB,SAASooD,EAAiB1sE,EAAOpQ,GAE/B,GAAGoN,EAAMlB,QAAQkE,GACf,OAAOA,EAAMzM,IAAIrN,GAASwmF,EAAiBxmF,EAAO0J,IAGpD,GAAGoN,EAAMV,SAAS0D,GAAQ;;AAExB,GAAG,cAAeA,EAChB,OAAOA,EAAM,aAAa,GAI5B,GAAGjD,EAAWuD,QAAQN,GACpB,OAAOA,EAIT,GAAGjD,EAAWoC,OAAOa,GAEnB,OADAA,EAAM,SAAW0sE,EAAiB1sE,EAAM,SAAUpQ,GAC3CoQ,EAIT,GAAG,QAASA,EAAO,CACjB,MAAMpJ,EAAKoJ,EAAM,OACjB,GAAGpQ,EAAQ00B,KAAKx9B,eAAe8P,GAAK,CAClC,MAAMktB,EAAMl0B,EAAQ00B,KAAK1tB,GAAI3M,QAAQ+V,GACrC,IAAY,IAAT8jB,EAED,OAAOl0B,EAAQ00B,KAAK1tB,GAAIktB,GAG1Bl0B,EAAQ00B,KAAK1tB,GAAIjI,KAAKqR,QAGtBpQ,EAAQ00B,KAAK1tB,GAAM,CAACoJ,GAKxB,IAAI,MAAMwP,KAAQxP,EAEJ,QAATwP,GAAkB5f,EAAQwvD,cAAclyD,SAAS8S,EAAMwP,WACjDxP,EAAM,OAIfA,EAAMwP,GAAQk9D,EAAiB1sE,EAAMwP,GAAO5f,GAGhD,OAAOoQ,EAxqBA0sE,CAAiB/sB,EAAQ/vD,IAYlCiM,EAAIu3B,MAAQ,CAAClJ,EAAOvW,EAAUyf,EAAO9c,EAAQ1vB,EAAW,QAEtDokF,EAAe53C,GACfA,EAAQA,EAAM,GAGd,MAAMxjC,EAAUs6B,EAAMt6B,QAChBqV,EAAQ,CACZ+5C,MAAO8rB,EAAc13C,EAAOxjC,EAAS,SACrCqvD,SAAU6rB,EAAc13C,EAAOxjC,EAAS,YACxCsvD,WAAY4rB,EAAc13C,EAAOxjC,EAAS,eAIxCs6B,EAAM5F,KAAKx9B,eAAeojC,EAAMjyB,SAClCiyB,EAAM5F,KAAK4F,EAAMjyB,OAAS,IAE5B,MAAMqsB,EAAO4F,EAAM5F,KAAK4F,EAAMjyB,OAGxB3H,EAwYR,SAAyB45B,EAAOvW,EAAUyf,EAAOnuB,GAE/C,MAAMxH,EAAO,GACb,IAAI,MAAM7G,KAAM+c,EAAU,CACxB,MAAMlgB,EAAUy2B,EAAMo/C,SAASp/C,EAAMjyB,OAAOrB,GACzCq0E,EAAe/gD,EAAOz2B,EAAS2/B,EAAOnuB,KACvCxH,EAAK7G,GAAMnD,GAGf,OAAOgK,EAjZSkvE,CAAgBziD,EAAOvW,EAAUyf,EAAOnuB,GAGlDoe,EAAM19B,OAAO4W,KAAKjM,GAASkB,OACjC,IAAI,MAAMoF,KAAMysB,EAAK,CACnB,MAAM5vB,EAAUnD,EAAQsG,GAWxB,GANgB,OAAbhQ,EACDsjC,EAAM+hD,aAAe,CAAC,CAAC/hD,EAAMjyB,OAAQ,IAErCiyB,EAAM+hD,aAAa/hD,EAAMjyB,OAASiyB,EAAM+hD,aAAa/hD,EAAMjyB,QAAU,GAGpD,UAAhBgN,EAAM+5C,OAAqBpoD,KAAM0tB,EAAM,CAMxC8nD,EAAgB91D,EAAQ1vB,EAAU09B,EAAK1tB,IACvC,SAIF,MAAM3C,EAAS,CAAC,MAAO2C,GAOvB,GANwB,IAArBA,EAAG3M,QAAQ,OACZs0B,EAAKlf,SAAS6qB,EAAMuiD,SAAU71E,EAAI3C,EAAQ,CAACqL,iBAAiB,IAE9DglB,EAAK1tB,GAAM3C,GAGS,WAAhBgR,EAAM+5C,OAAsC,UAAhB/5C,EAAM+5C,QAAsB90B,EAAMw1B,KAChE,MAAM,IAAIxiD,EACR,mDACA,qBAAsB,CAAC6B,KAAM,uBAAwBq0B,UAGzD,GAAIlJ,EAAMsiD,WAAYtiD,EAAM+hD,aAAa/hD,EAAMjyB,OAAOnR,eAAe8P,GAUrE,IAAGszB,EAAMsiD,UACU,WAAhBvnE,EAAM+5C,QACP2rB,EAA0Bl3E,EAASy2B,EAAMjyB,MAAOiyB,EAAM2gD,cAMxD,IAAG3gD,EAAMsiD,UACU,UAAfvnE,EAAM+5C,OAAoC,SAAf/5C,EAAM+5C,QAClC90B,EAAM+hD,aAAa/hD,EAAMjyB,OAAOnR,eAAe8P,GAFlD,CAqBA,GAbmB,UAAhBqO,EAAM+5C,OAEJpoD,KAAMszB,EAAM+hD,aAAa/hD,EAAMjyB,QAChC8zE,EAAa7hD,EAAOtzB,GAIxBszB,EAAM+hD,aAAa/hD,EAAMjyB,OAAOrB,GAAM,CAAC0f,SAAQ1vB,YAG/CsjC,EAAM2gD,aAAal8E,KAAK,CAAC8E,UAASwE,MAAOiyB,EAAMjyB,QAG5CrB,KAAMszB,EAAMo/C,SAAU,CACvB,IAAIsD,GAAU,EACVC,EAAW,KACV,WAAYz5C,GAIfy5C,EAAWz5C,EAAM,UAAU,GAC3Bw5C,IAAmB,YAAPh2E,GAA2B,aAAPA,GAC5BoG,EAAMV,SAASuwE,KACjBA,EAAW,MANbD,EAA0B,YAAhB1iD,EAAMjyB,MAChB40E,EAAW,IASVD,GAED/wE,EAAIu3B,MACF,IAAIlJ,EAAOjyB,MAAOrB,EAAI41E,UAAU,GAChC7mF,OAAO4W,KAAK2tB,EAAMo/C,SAAS1yE,IAAKpF,OAAQ,CAACq7E,GAAW54E,EAAQ,UAK/D,cAAem/B,GAChBv3B,EAAIu3B,MACF,IAAIlJ,EAAOsiD,UAAU,GACrB74D,EAAUyf,EAAM,aAAcn/B,EAAQ,aAI1C,IAAI,MAAMub,KAAQ7pB,OAAO4W,KAAK9I,GAASjC,OAErC,GAAG+tB,EAAU/P,IAGX,GAFAvb,EAAOub,GAAQ+O,EAAK/gB,MAAM/J,EAAQ+b,IAEtB,UAATA,EAED,IAAI,MAAMtU,KAAQzH,EAAQ,SACE,IAAvByH,EAAKjR,QAAQ,OACds0B,EAAKlf,SACH6qB,EAAMuiD,SAAUvxE,EAAMjH,EAAQ,CAACqL,iBAAiB,SAQ1D,IAAG2F,EAAMg6C,UAAczvC,KAAQ4jB,EAK/B,IAAI,MAAM1tC,KAAK+N,EAAQ+b,GAAO,CAC5B,MAAMq9D,EAAYr9D,KAAQ4jB,EACxBA,EAAM5jB,GAAQk7D,EAAqBzlE,GAGrC,GAAGlI,EAAWoC,OAAOzZ,GAAI,CACvB,MAAMmnF,EACHz5C,EAAM5jB,IAAS4jB,EAAM5jB,GAAM,IAAM4jB,EAAM5jB,GAAM,GAAG,SAC/C4jB,EAAM5jB,GAAM,GAAG,SACfk7D,EAAqBzlE,GAGnBiC,EAAO,CAAC,QAAS,IACvBklE,EAAgBn4E,EAAQub,EAAMtI,GAG9B,MAAMyrC,EAAMjtD,EAAE,SACd,IAAI,MAAMonF,KAAMn6B,EACX51C,EAAWoL,mBAAmB2kE,GAE/BjxE,EAAIu3B,MACF,IAAIlJ,EAAOsiD,UAAU,GACrB,CAACM,EAAG,QAASD,EAAU3lE,EAAM,SAG/BklE,EAAgBllE,EAAM,QAASqX,EAAK/gB,MAAMsvE,SAGtC/vE,EAAWoL,mBAAmBziB,GAEtCmW,EAAIu3B,MACF,IAAIlJ,EAAOsiD,UAAU,GACrB,CAAC9mF,EAAE,QAASmnF,EAAU54E,EAAQub,GACxBq8D,EAAYgB,EAAS,GAAInnF,IAEjC0mF,EAAgBn4E,EAAQub,EAAM+O,EAAK/gB,MAAM9X,IAM/C,IAAI,MAAM8pB,KAAQ7pB,OAAO4W,KAAK62B,GAAO5hC,OAAQ,CAE3C,GAAY,UAATge,GACD,IAAIxS,EAAMV,SAAS82B,EAAM5jB,GAAM,OAC1B,aAAc4jB,EAAM5jB,GAAM,IAC7B,cAGG,GAAG+P,EAAU/P,GAClB,SAKF,MAAMvF,EAAOmpB,EAAM5jB,GAAM,IAAM,GAE/B,IADsBs7D,EAAc7gE,EAAMra,EAAS,kBAC5B4f,KAAQvb,GAAS,CACtC,IAAI84E,EAAW,QACZ,aAAc9iE,IACf8iE,EAAWxuD,EAAK/gB,MAAMyM,EAAK,cAEzBjN,EAAMlB,QAAQixE,KAChBA,EAAW,CAACA,IAEd94E,EAAOub,GAAQ,CAAC,CAAC,YAAau9D,KAMlC,IAAI,MAAMC,KAAernF,OAAO4W,KAAK62B,EAAM,aAAe,IAAI5hC,OAAQ,CACpE,MAAMq7E,EAAWz5C,EAAM,YAAY45C,GACnC,IAAI,MAAMv5E,KAAW9N,OAAO4W,KAAK2tB,EAAMvW,UAAW,CAE9C4K,EAAK7e,UAAUwqB,EAAMvW,SAASlgB,GAAUu5E,GAC5B/uE,KAAKhC,GAAKA,EAAE,SAAWrF,KAEnC3C,EAAO,YAAcA,EAAO,aAAe,GAC3CsqB,EAAKlf,SACHpL,EAAO,YAAa+4E,EAAa,GAAI,CAAC1tE,iBAAiB,IACzDzD,EAAIu3B,MACF,IAAIlJ,EAAOsiD,UAAU,GACrB,CAAC/4E,GAAUo5E,EAAU54E,EAAO,YAAY+4E,GACxCpmF,KAMRwlF,EAAgB91D,EAAQ1vB,EAAUqN,GAGlCi2B,EAAM2gD,aAAah5E,WApKjBu6E,EAAgB91D,EAAQ1vB,EAAUqN,QARlCm4E,EAAgB91D,EAAQ1vB,EAAUqN,KAwLxC4H,EAAI4gD,YAAc,CAACz8C,EAAOpQ,KAExB,GAAGoN,EAAMlB,QAAQkE,GAAQ,CAEvB,OADgBA,EAAMzM,IAAI0I,GAAKJ,EAAI4gD,YAAYxgD,EAAGrM,IACnCkQ,OAAO7D,GAAKA,GAG7B,GAAa,UAAV+D,EACD,OAAO,KAGT,GAAGhD,EAAMV,SAAS0D,GAAQ,CAExB,GAAG,QAASA,EAAO,CACjB,MAAMpJ,EAAKoJ,EAAM,OACjB,GAAGpQ,EAAQ00B,KAAKx9B,eAAe8P,GAAK,CAClC,MAAMktB,EAAMl0B,EAAQ00B,KAAK1tB,GAAI3M,QAAQ+V,GACrC,IAAY,IAAT8jB,EAED,OAAOl0B,EAAQ00B,KAAK1tB,GAAIktB,GAG1Bl0B,EAAQ00B,KAAK1tB,GAAIjI,KAAKqR,QAGtBpQ,EAAQ00B,KAAK1tB,GAAM,CAACoJ,GAIxB,IAAI,MAAMxZ,KAAOwZ,EACfA,EAAMxZ,GAAOqV,EAAI4gD,YAAYz8C,EAAMxZ,GAAMoJ,GAG7C,OAAOoQ,I,6BCxWT,MAAM9C,EAAc,EAAQ,KAG1BpB,QAAS0iB,EACTliB,SAAUmiB,EACV7hB,SAAU8hB,EACV7hB,YAAa8hB,GACX,EAAQ,KAGVxf,OAAQgnE,EACR7lE,QAAS8lE,EACTx5E,QAASy5E,EACTj+D,cAAe6kE,EACf9kE,mBAAoBw0C,GAClB,EAAQ,KAGVj6B,UAAWxD,EACX+E,gBAAiBsiD,EACjBhnD,UAAWinD,EACXhsD,QAASqiC,EACT77B,eAAgB87B,GACd,EAAQ,KAGVjzC,WAAYqjE,EACZ1jE,YAAa2jE,GACX,EAAQ,KAGV9tE,SAAUonE,EACV3oE,QAASghB,EACTve,qBAAsBwe,GACpB,EAAQ,IAENljB,EAAM,GAymCZ,SAASuxE,EAAmBjuD,EAAWkuD,EAAcz9E,GACnD,GAAmE,UAAhEsvB,EAAWC,EAAWkuD,EAAc,CAAC5tD,OAAO,GAAO7vB,GACpD,MAAM,IAAIsN,EACR,sFAEA,qBAAsB,CAAC6B,KAAM,wBA7mCnCva,EAAOD,QAAUsX,EAejBA,EAAIkhD,QAAUl9B,OACZV,YACA2nD,iBAAiB,KACjBr2E,UACAb,UAAU,GACVsuD,gBAAgB,aAGhB,GAAG1/B,EAAS/tB,GAAU,CACpB,IAAIgN,EAAO,GACX,IAAI,IAAIxY,EAAI,EAAGA,EAAIwL,EAAQhH,SAAUxE,EAAG,CAEtC,IAAIg5D,QAAkBpiD,EAAIkhD,QAAQ,CAChC59B,YACA2nD,iBACAr2E,QAASA,EAAQxL,GACjB2K,UACAsuD,kBAEe,OAAdD,IACDA,QAAkBC,EAAc,CAC9B0pB,cAAen3E,EAAQxL,GACvBk6B,YACA2nD,iBACAxwD,OAAQ7lB,EACRuR,MAAO/c,EACP2K,iBAEegE,IAAdqqD,IAILxgD,EAAK9O,KAAKsvD,GAEZ,GAAGruD,EAAQguD,eAAiC,IAAhBngD,EAAKhU,OAAc,CAIrB,KAFN88E,EAChBpnD,EAAW2nD,EAAgB,eAAiB,IACjCr9E,SACXgU,EAAOA,EAAK,IAGhB,OAAOA,EAIT,MAAM8iB,EAAMgmD,EAAiBpnD,EAAW2nD,EAAgB,YAYxD,GAXInoD,EAAa4B,KACfpB,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAUkB,EACVT,WAAW,EACXC,mBAAmB,EACnBnwB,aAKD6uB,EAAUhuB,GAAU,CACrB,GAAGb,EAAQ00B,MAAQ,QAAS7zB,GAC1Bb,EAAQ00B,KAAKx9B,eAAe2J,EAAQ,QAAS,CAE7C,MAAM68E,EAAS19E,EAAQ00B,KAAK7zB,EAAQ,QACpC,IAAI,IAAIxL,EAAI,EAAGA,EAAIqoF,EAAO7jF,SAAUxE,EAClC,GAAGqoF,EAAOroF,GAAG04D,WAAaltD,EACxB,OAAO68E,EAAOroF,GAAGg5D,UAMvB,GAAGmoB,EAAS31E,IAAYksD,EAAoBlsD,GAAU,CACpD,MAAMgN,EACJ5B,EAAI0xE,aAAa,CAACpuD,YAAW2nD,iBAAgB5gF,MAAOuK,EAASb,YAQ/D,OAPGA,EAAQ00B,MAAQq4B,EAAoBlsD,KAEhCb,EAAQ00B,KAAKx9B,eAAe2J,EAAQ,UACvCb,EAAQ00B,KAAK7zB,EAAQ,QAAU,IAEjCb,EAAQ00B,KAAK7zB,EAAQ,QAAQ9B,KAAK,CAACgvD,SAAUltD,EAASwtD,UAAWxgD,KAE5DA,EAKT,GAAG0oE,EAAQ11E,GAAU,CAGnB,IAFkB81E,EAChBpnD,EAAW2nD,EAAgB,eAAiB,IACjC55E,SAAS,SACpB,OAAO2O,EAAIkhD,QAAQ,CACjB59B,YACA2nD,iBACAr2E,QAASA,EAAQ,SACjBb,UACAsuD,kBAMN,MAAMsvB,EAAoC,aAAnB1G,EAEjBrpE,EAAO,GAGPgwE,EAAWtuD,EAIbinD,EAAS31E,IAAaksD,EAAoBlsD,KAC5C0uB,EAAYA,EAAUuE,2BAIxB,MAAMqkD,EACJxB,EAAiBkH,EAAU3G,EAAgB,YACzCnoD,EAAaopD,KACf5oD,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAU0oD,EACVjoD,WAAW,EACXC,mBAAmB,EACnBnwB,aAIDA,EAAQ00B,MAAQ,QAAS7zB,IAEtBb,EAAQ00B,KAAKx9B,eAAe2J,EAAQ,UACtCb,EAAQ00B,KAAK7zB,EAAQ,QAAU,IAEjCb,EAAQ00B,KAAK7zB,EAAQ,QAAQ9B,KAAK,CAACgvD,SAAUltD,EAASwtD,UAAWxgD,KAMnE,IAAIT,EAAQvM,EAAQ,UAAY,GAC7BuM,EAAMvT,OAAS,IAChBuT,EAAQjB,MAAM4I,KAAK3H,GAAOxL,QAI5B,MAAMk8E,EAAcvuD,EACpB,IAAI,MAAMjkB,KAAQ8B,EAAO,CACvB,MAAM2wE,EAAgB9xE,EAAIohD,WACxB,CAAC99B,UAAWuuD,EAAa5gF,IAAKoO,EAAMkkB,WAAY,CAACK,OAAO,KAGpDc,EAAMgmD,EAAiBkH,EAAUE,EAAe,YAClDhvD,EAAa4B,KACfpB,QAAkB09B,EAAgB,CAChC19B,YACAE,SAAUkB,EACV3wB,UACAkwB,WAAW,KAMjB,MAAMvjB,EAAO5W,OAAO4W,KAAK9L,GAASe,OAClC,IAAI,MAAMu1E,KAAoBxqE,EAAM,CAClC,MAAM+rE,EAAgB73E,EAAQs2E,GAG9B,GAAwB,QAArBA,EAqBH,GAAwB,UAArBA,EA6BH,GAAwB,aAArBA,EAsCH,GAAwB,cAArBA,EAiBH,GAAwB,WAArBA,EAoBH,GAAwB,WAArBA,GAAsD,UAArBA,GACb,cAArBA,GACAP,EAAWO,GAFb,CAIE,MAAMzW,EAAQz0D,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAKi6E,EACL3nD,WAAY,CAACK,OAAO,KAEtBgnD,EAAUhpE,EAAM6yD,EAAOgY,OATzB,CAcA,IAAI9pD,EAAS8pD,GACX,MAAM,IAAIprE,EACR,4DACA,sBAIJ,GAA4B,IAAzBorE,EAAc7+E,OAAc,CAC7B,MAAMmkF,EAAqB/xE,EAAIohD,WAAW,CACxC99B,YACAryB,IAAKi6E,EACL7gF,MAAOoiF,EACPlpD,WAAY,CAACK,OAAO,GACpBkC,QAAS6rD,IAELH,EAAeluD,EAAUnK,SAASsM,IAAIssD,GAC1CzuD,EAAUnK,SAASlvB,IAAI8nF,GAAoB,SAAW,KACxD,IAAIC,EAAapwE,EACd4vE,IACDD,EAAmBjuD,EAAWkuD,EAAcz9E,GACxC6uB,EAAUhhB,EAAK4vE,MACjB5vE,EAAK4vE,GAAgB,IAEvBQ,EAAapwE,EAAK4vE,IAEpB5G,EACEoH,EAAYD,EAAoBtF,EAAe,CAC7ChpE,iBAAiB,IAKvB,IAAI,MAAMwuE,KAAgBxF,EAAe,CAEvC,MAAMsF,EAAqB/xE,EAAIohD,WAAW,CACxC99B,YACAryB,IAAKi6E,EACL7gF,MAAO4nF,EACP1uD,WAAY,CAACK,OAAO,GACpBkC,QAAS6rD,IAKLH,EAAeluD,EAAUnK,SAASsM,IAAIssD,GAC1CzuD,EAAUnK,SAASlvB,IAAI8nF,GAAoB,SAAW,KACxD,IAAIC,EAAapwE,EACd4vE,IACDD,EAAmBjuD,EAAWkuD,EAAcz9E,GACxC6uB,EAAUhhB,EAAK4vE,MACjB5vE,EAAK4vE,GAAgB,IAEvBQ,EAAapwE,EAAK4vE,IAGpB,MAAMvrD,EAAYykD,EAChBpnD,EAAWyuD,EAAoB,eAAiB,GAG5ChhF,EAAUy5E,EAASyH,GACnB3uE,EAASgnE,EAAQ2H,GACvB,IAAIC,EACD5uE,EACD4uE,EAAQD,EAAa,SACblhF,IACRmhF,EAAQD,EAAa,WAIvB,IAAIE,QAAsBnyE,EAAIkhD,QAAQ,CACpC59B,YACA2nD,eAAgB8G,EAChBn9E,QAAU0O,GAAUvS,EAAWmhF,EAAQD,EACvCl+E,UACAsuD,kBAIF,GAAG/+C,EAAQ,CAMT,GAJIqf,EAASwvD,KACXA,EAAgB,CAACA,IAGflsD,EAAU50B,SAAS,SAkBhB,CACLu5E,EAAUoH,EAAYD,EAAoBI,EAAe,CACvDzuE,cAAc,EACdC,gBAAgB,IAElB,SArBAwuE,EAAgB,CACd,CAACnyE,EAAIohD,WAAW,CACd99B,YACAryB,IAAK,QACLsyB,WAAY,CAACK,OAAO,MACjBuuD,GAIJ,WAAYF,IACbE,EAAcnyE,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAK,SACLsyB,WAAY,CAACK,OAAO,MAChBquD,EAAa,WAYzB,GAAGlhF,EACD,GAAGk1B,EAAU50B,SAAS,YAAc40B,EAAU50B,SAAS,QACrD40B,EAAU50B,SAAS,WAAa+/E,EAAea,IAAgB,CAE/D,IAAIG,EACDJ,EAAW/mF,eAAe8mF,GAC3BK,EAAYJ,EAAWD,GAEvBC,EAAWD,GAAsBK,EAAY,GAI/C,MAAMznF,GAAOs7B,EAAU50B,SAAS,OAC9B4gF,EAAa,OAASA,EAAa,YACnCjyE,EAAIohD,WAAW,CAAC99B,YAAWryB,IAAK,QAC9BsyB,WAAY,CAACK,OAAO,KAIxBgnD,EACEwH,EAAWznF,EAAKwnF,EAAe,CAC7B1uE,iBACI1P,EAAQguD,eAAiB97B,EAAU50B,SAAS,eAE5C40B,EAAU50B,SAAS,WAC3B+/E,EAAea,IAKZtvD,EAASwvD,IAAkBA,EAAcvkF,OAAS,IACnDukF,EAAgB,CAAC,YAAaA,IAEhCvH,EACEoH,EAAYD,EAAoBI,EAAe,CAC7C1uE,iBACI1P,EAAQguD,eAAiB97B,EAAU50B,SAAS,YAKjDsxB,EAASwvD,IAA2C,IAAzBA,EAAcvkF,QAC1CmG,EAAQguD,gBACRowB,EAAgBA,EAAc,IAEhCA,EAAgB,CACd,CAACnyE,EAAIohD,WAAW,CACd99B,YACAryB,IAAK,SACLsyB,WAAY,CAACK,OAAO,MACjBuuD,GAIJ,QAASF,IACVE,EAAcnyE,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAK,MACLsyB,WAAY,CAACK,OAAO,MAChBquD,EAAa,QAIlB,WAAYA,IACbE,EAAcnyE,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAK,SACLsyB,WAAY,CAACK,OAAO,MAChBquD,EAAa,WAErBrH,EACEoH,EAAYD,EAAoBI,EAAe,CAC7C1uE,iBACI1P,EAAQguD,eAAiB97B,EAAU50B,SAAS,gBAGjD,GAAG40B,EAAU50B,SAAS,cAC3B40B,EAAU50B,SAAS,WAAa40B,EAAU50B,SAAS,QACnD40B,EAAU50B,SAAS,SAAU,CAG7B,IAAI+gF,EAOAznF,EACJ,GAPGqnF,EAAW/mF,eAAe8mF,GAC3BK,EAAYJ,EAAWD,GAEvBC,EAAWD,GAAsBK,EAAY,GAI5CnsD,EAAU50B,SAAS,aAGjBk5E,EAAS4H,KACVA,EAAgBA,EAAc,WAEhCxnF,EAAMsnF,EAAa,kBACd,GAAGhsD,EAAU50B,SAAS,UAAW,CACtC,MAAMm6E,EAAWd,EACfpnD,EAAWyuD,EAAoB,WAAa,SACxCM,EAAeryE,EAAIohD,WACvB,CAAC99B,YAAWryB,IAAKu6E,EAAUjoD,WAAY,CAACK,OAAO,KACjD,GAAgB,WAAb4nD,EACD7gF,EAAMsnF,EAAa,iBACZE,EAAcE,OAChB,CACL,IAAIC,EAEJ,IADC3nF,KAAQ2nF,GAAUrvD,EAASkvD,EAAc3G,IAAa,IACnD3oD,EAAUl4B,GAIZ,OAAO2nF,EAAO1kF,QACZ,KAAK,SACIukF,EAAc3G,GACrB,MACF,KAAK,EACH2G,EAAc3G,GAAY8G,EAAO,GACjC,MACF,QACEH,EAAc3G,GAAY8G,OAV9B3nF,EAAM,WAeL,GAAGs7B,EAAU50B,SAAS,OAAQ,CACnC,MAAMkhF,EAAQvyE,EAAIohD,WAAW,CAAC99B,YAAWryB,IAAK,MAC5CsyB,WAAY,CAACK,OAAO,KACtBj5B,EAAMwnF,EAAcI,UACbJ,EAAcI,QAChB,GAAGtsD,EAAU50B,SAAS,SAAU,CACrC,MAAM+6E,EAAUpsE,EAAIohD,WAAW,CAC7B99B,YACAryB,IAAK,QACLsyB,WAAY,CAACK,OAAO,KAEtB,IAAIziB,EAEJ,QADCxW,KAAQwW,GAAS8hB,EAASkvD,EAAc/F,IAAY,IAC9CjrE,EAAMvT,QACX,KAAK,SACIukF,EAAc/F,GACrB,MACF,KAAK,EACH+F,EAAc/F,GAAWjrE,EAAM,GAC/B,MACF,QACEgxE,EAAc/F,GAAWjrE,EAMY,IAAtCrX,OAAO4W,KAAKyxE,GAAevkF,QAC5B,QAASqkF,IACTE,QAAsBnyE,EAAIkhD,QAAQ,CAChC59B,YACA2nD,eAAgB8G,EAChBn9E,QAAS,CAAC,MAAOq9E,EAAa,QAC9Bl+E,UACAsuD,mBAMF13D,IACFA,EAAMqV,EAAIohD,WAAW,CAAC99B,YAAWryB,IAAK,QACpCsyB,WAAY,CAACK,OAAO,MAIxBgnD,EACEwH,EAAWznF,EAAKwnF,EAAe,CAC7B1uE,gBAAiBwiB,EAAU50B,SAAS,cAEnC,CAIL,MAAM4O,GAAYlM,EAAQguD,eACxB97B,EAAU50B,SAAS,SAAW40B,EAAU50B,SAAS,UAChDsxB,EAASwvD,IAA2C,IAAzBA,EAAcvkF,QACrB,UAArBs9E,GAAqD,WAArBA,EAGlCN,EACEoH,EAAYD,EAAoBI,EAChC,CAAC1uE,gBAAiBxD,UA5UxB,CAIE,IAFkByqE,EAChBpnD,EAAW2nD,EAAgB,eAAiB,IACjC55E,SAAS,UACpB,SAIF,MAAMojE,EAAQz0D,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAKi6E,EACL3nD,WAAY,CAACK,OAAO,KAEtBgnD,EAAUhpE,EAAM6yD,EAAOgY,OA/BzB,CAEE,MAAM+F,QAAuBxyE,EAAIkhD,QAAQ,CACvC59B,YACA2nD,iBACAr2E,QAAS63E,EACT14E,UACAsuD,kBAGG1/B,EAAS6vD,IAA6C,IAA1BA,EAAe5kF,QAC9Cg9E,EAAUhpE,EAAMspE,EAAkBsH,OAjDtC,CAEE,MAAMA,QAAuBxyE,EAAIkhD,QAAQ,CACvC59B,YACA2nD,eAAgB,WAChBr2E,QAAS63E,EACT14E,UACAsuD,kBAIF,IAAI,MAAMowB,KAAqBD,EAC7B,GAAGlvD,EAAUnK,SAASsM,IAAIgtD,IACxBnvD,EAAUnK,SAASlvB,IAAIwoF,GAAmB3sD,QAAS,CACnD,MAAMz7B,EAAQmoF,EAAeC,GAGvBpC,GAFY3F,EAChBpnD,EAAWmvD,EAAmB,eAAiB,IAErCphF,SAAS,UAAY0C,EAAQguD,cACzC6oB,EACEhpE,EAAM6wE,EAAmBpoF,EAAO,CAACoZ,gBAAiB4sE,WAC7CmC,EAAeC,GAI1B,GAAG3oF,OAAO4W,KAAK8xE,GAAgB5kF,OAAS,EAAG,CAEzC,MAAM6mE,EAAQz0D,EAAIohD,WAAW,CAC3B99B,YACAryB,IAAKi6E,EACL3nD,WAAY,CAACK,OAAO,KAEtBgnD,EAAUhpE,EAAM6yD,EAAO+d,QA7D3B,CAEE,IAAIA,EAAiBvvD,EAASwpD,GAAe/0E,IAC3Cg7E,GAAe1yE,EAAIohD,WAAW,CAC5B99B,UAAWsuD,EACX3gF,IAAKyhF,EACLnvD,WAAY,CAACK,OAAO,MAEK,IAA1B4uD,EAAe5kF,SAChB4kF,EAAiBA,EAAe,IAIlC,MAAM/d,EAAQz0D,EAAIohD,WAChB,CAAC99B,YAAWryB,IAAK,QAASsyB,WAAY,CAACK,OAAO,KAQ1C3jB,GAPYyqE,EAChBpnD,EAAWmxC,EAAO,eAAiB,IAIzBpjE,SAAS,SACnB4vD,EAAgB39B,EAAW,MAEbX,EAAS6vD,IAA4C,IAAzB/F,EAAc7+E,OAC1Dg9E,EAAUhpE,EAAM6yD,EAAO+d,EAAgB,CAAC/uE,gBAAiBxD,QA7C3D,CACE,IAAIuyE,EAAiBvvD,EAASwpD,GAAe/0E,IAC3Cg7E,GAAe1yE,EAAIohD,WAAW,CAC5B99B,YACAryB,IAAKyhF,EACLnvD,WAAY,CAACK,OAAO,GACpB/0B,KAAMkF,EAAQlF,QAEW,IAA1B2jF,EAAe5kF,SAChB4kF,EAAiBA,EAAe,IAOlC5wE,EAHc5B,EAAIohD,WAChB,CAAC99B,YAAWryB,IAAK,MAAOsyB,WAAY,CAACK,OAAO,MAEhC4uD,GA0alB,OAAO5wE,EAIT,OAAOhN,GAiBToL,EAAIohD,WAAa,EACf99B,YACAryB,MACA5G,QAAQ,KACRk5B,aAAa,CAACK,OAAO,GACrBkC,WAAU,EACVj3B,OAAO,SAGP,GAAW,OAARoC,EACD,OAAOA,EAKNqyB,EAAUqvD,sBAAwBrvD,EAAUkB,kBAC7ClB,EAAYA,EAAUkB,iBAGxB,MAAMouD,EAAatvD,EAAU6D,aAG7B,GAAGwjD,EAAW15E,IACZA,KAAO2hF,GACP,UAAWA,EAAW3hF,IACtB,UAAW2hF,EAAW3hF,GAAK,UAC3B,UAAW2hF,EAAW3hF,GAAK,SAAS,SACpC,OAAO2hF,EAAW3hF,GAAK,SAAS,SAAS,SAI3C,GAAGsyB,EAAWK,OAAS3yB,KAAO2hF,EAAY,CACxC,MAAMtrD,EAAkBhE,EAAU,cAAgB,QAG5CuvD,EAAa,GAChBjwD,EAAUv4B,IAAU,WAAYA,KAAW,WAAYA,IACxDwoF,EAAW//E,KAAK,SAAU,cAIzB8vB,EAAUv4B,IAAU,cAAeA,IACpCA,EAAQA,EAAM,aAAa,IAK1BmgF,EAASngF,IAEP,WAAYA,GACbwoF,EAAW//E,KACT,eAAgB,mBAAoB,SAAU,cAG/C,QAASzI,GACVwoF,EAAW//E,KACT,YAAa,iBAEjB+/E,EAAW//E,KAAK,SAAU,aAAc,QAEnC,WAAYzI,GACfwoF,EAAW//E,KACT,eAAgB,mBAAoB,SAAU,cAG7C,QAASzI,GACZwoF,EAAW//E,KAAK,YAAa,kBAEvB8vB,EAAUv4B,KAAWkgF,EAASlgF,IACtCwoF,EAAW//E,KAAK,MAAO,UAAW,QAAS,aAI7C,IAAIggF,EAAiB,YACjB3qD,EAAsB,QAE1B,GAAGrC,EACDgtD,EAAiB,QACjB3qD,EAAsB,WACtB0qD,EAAW//E,KAAK,aACX,GAAGw3E,EAAQjgF,GAAQ,CAGnB,WAAYA,GACfwoF,EAAW//E,KAAK,SAElB,MAAMuY,EAAOhhB,EAAM,SACnB,GAAmB,IAAhBghB,EAAKzd,OAGNklF,EAAiB,OACjB3qD,EAAsB,YACjB,CACL,IAAI4qD,EAAkC,IAAhB1nE,EAAKzd,OAAgB05B,EAAkB,KACzD0rD,EAAa,KACjB,IAAI,IAAI5pF,EAAI,EAAGA,EAAIiiB,EAAKzd,SAAUxE,EAAG,CACnC,MAAMmS,EAAO8P,EAAKjiB,GAClB,IAAI6pF,EAAe,QACfC,EAAW,QACf,GAAG3I,EAAShvE,GACV,GAAG,eAAgBA,EAAM,CAGvB03E,EAAe,IAFD13E,EAAK,cAAgB,IAAItG,iBAC3BsG,EAAK,oBAET,cAAeA,EACvB03E,EAAe13E,EAAK,aAAatG,cACzB,UAAWsG,EACnB23E,EAAW33E,EAAK,SAGhB03E,EAAe,aAGjBC,EAAW,MAcb,GAZsB,OAAnBH,EACDA,EAAiBE,EACTA,IAAiBF,GAAkBxI,EAAShvE,KACpDw3E,EAAiB,SAED,OAAfC,EACDA,EAAaE,EACLA,IAAaF,IACrBA,EAAa,SAIO,UAAnBD,GAA6C,UAAfC,EAC/B,MAGJD,EAAiBA,GAAkB,QACnCC,EAAaA,GAAc,QACT,UAAfA,GACDF,EAAiB,QACjB3qD,EAAsB6qD,GAEtB7qD,EAAsB4qD,OAGrB,CACL,GAAGxI,EAASlgF,GACV,GAAG,cAAeA,KAAW,WAAYA,GAAQ,CAC/CwoF,EAAW//E,KAAK,YAAa,iBAC7Bq1B,EAAsB99B,EAAM,aAC5B,MAAM4qB,EAAM5qB,EAAM,cACf4qB,IACDkT,EAAsB,GAAGA,KAAuBlT,SAE1C,eAAgB5qB,KAAW,WAAYA,GAC/C89B,EAAsB,IAAI99B,EAAM,cACxB,UAAWA,IACnByoF,EAAiB,QACjB3qD,EAAsB99B,EAAM,eAG9ByoF,EAAiB,QACjB3qD,EAAsB,MAExB0qD,EAAW//E,KAAK,QAIlB+/E,EAAW//E,KAAK,SAIb8vB,EAAUv4B,MAAY,WAAYA,IAEnCwoF,EAAW//E,KAAK,SAAU,cAIzBy3E,EAASlgF,IAAwC,IAA9BP,OAAO4W,KAAKrW,GAAOuD,QAEvCilF,EAAW//E,KAAK,YAAa,iBAG/B,MAAMuJ,EA2OV,SACEinB,EAAWryB,EAAK5G,EAAOwoF,EAAYC,EAAgB3qD,GACxB,OAAxBA,IACDA,EAAsB,SAIxB,MAAMgrD,EAAQ,GAGd,IAA4B,QAAxBhrD,GAAyD,aAAxBA,IACnCvF,EAAUv4B,IAAU,QAASA,EAAO,CAET,aAAxB89B,GACDgrD,EAAMrgF,KAAK,YAGb,MAAMuJ,EAAO2D,EAAIohD,WACf,CAAC99B,YAAWryB,IAAK5G,EAAM,OAAQk5B,WAAY,CAACK,OAAO,KAClDN,EAAUnK,SAASsM,IAAIppB,IACxBinB,EAAUnK,SAASlvB,IAAIoS,IACvBinB,EAAUnK,SAASlvB,IAAIoS,GAAM,SAAWhS,EAAM,OAE9C8oF,EAAMrgF,KAAKW,MAAM0/E,EAAO,CAAC,SAAU,QAGnCA,EAAMrgF,KAAKW,MAAM0/E,EAAO,CAAC,MAAO,eAE7B,CACLA,EAAMrgF,KAAKq1B,GAGX,MAAMirD,EAAUD,EAAM5/C,KAAKkE,GAAMA,EAAGpmC,SAAS,MAC1C+hF,GAEDD,EAAMrgF,KAAKsgF,EAAQ9jF,QAAQ,UAAW,MAG1C6jF,EAAMrgF,KAAK,SAEX,MAAMugF,EAAe/vD,EAAU4D,QAAQj2B,GACvC,IAAI,MAAMg1B,KAAa4sD,EAAY,CAEjC,KAAK5sD,KAAaotD,GAChB,SAGF,MAAMC,EAAyBD,EAAaptD,GAAW6sD,GACvD,IAAI,MAAM/5E,KAAQo6E,EAEhB,GAAKp6E,KAAQu6E,EAKb,OAAOA,EAAuBv6E,GAIlC,OAAO,KAtSQw6E,CACXjwD,EAAWryB,EAAK5G,EAAOwoF,EAAYC,EAAgB3qD,GACrD,GAAY,OAAT9rB,EACD,OAAOA,EAKX,GAAGknB,EAAWK,OACT,WAAYN,EAAW,CAExB,MAAMM,EAAQN,EAAU,UACxB,GAA0B,IAAvBryB,EAAI7C,QAAQw1B,IAAgB3yB,IAAQ2yB,EAAO,CAE5C,MAAME,EAAS7yB,EAAI6c,OAAO8V,EAAMh2B,QAChC,IAAI01B,EAAUnK,SAASsM,IAAI3B,GACzB,OAAOA,GAOf,IAAI0vD,EAAS,KAEb,MAAMC,EAAiB,GACvB,IAAIzrD,EAAS1E,EAAU8D,aAGvB,MAAMssD,EAAmBziF,EAAIrD,OAAS,EACtC,IAAI,IAAIxE,EAAI,EAAGA,EAAIsqF,GAAoBziF,EAAI7H,KAAM4+B,IAAU5+B,EACzD4+B,EAASA,EAAO/2B,EAAI7H,IACjB,KAAM4+B,GACPyrD,EAAe3gF,KAAKk1B,EAAO,IAAI,IAInC,IAAI,IAAI5+B,EAAIqqF,EAAe7lF,OAAS,EAAGxE,GAAK,IAAKA,EAAG,CAClD,MAAMq+B,EAAQgsD,EAAerqF,GACvB2iB,EAAQ0b,EAAM1b,MACpB,IAAI,MAAM1P,KAAQ0P,EAAO,CAKvB,MAAM2N,EAAQrd,EAAO,IAAMpL,EAAI6c,OAAO2Z,EAAMx2B,IAAIrD,QACzB01B,EAAUnK,SAASlvB,IAAIoS,GAAM0nB,WAChDT,EAAUnK,SAASsM,IAAI/L,IACd,OAAVrvB,GAAkBi5B,EAAUnK,SAASlvB,IAAIyvB,GAAO,SAAWzoB,KAI9B,OAAXuiF,GACnBtwD,EAAsBxJ,EAAO85D,GAAU,KACvCA,EAAS95D,IAMf,GAAc,OAAX85D,EACD,OAAOA,EAKT,IAAI,MAAOn3E,EAAMs3E,KAAOrwD,EAAUnK,SAChC,GAAGw6D,GAAMA,EAAG5vD,SAAW9yB,EAAIogC,WAAWh1B,EAAO,KAC3C,MAAM,IAAIgF,EACR,iBAAiBpQ,4BAA8BoL,MAC/C,qBACA,CAAC6G,KAAM,2BAA4BsX,QAAS8I,IAKlD,OAAIC,EAAWK,MAcR3yB,EAbF,UAAWqyB,EACRA,EAAU,SAIL+tD,EAAYC,EAAaziF,EAAMy0B,EAAU,UAAWryB,GAFpDA,EAKFogF,EAAYxiF,EAAMoC,IAmB/B+O,EAAI0xE,aAAe,EAAEpuD,YAAW2nD,iBAAgB5gF,QAAO0J,cAErD,GAAGw2E,EAASlgF,GAAQ,CAElB,MAAMgV,EAAOqrE,EAAiBpnD,EAAW2nD,EAAgB,SACnDvtE,EAAWgtE,EAAiBpnD,EAAW2nD,EAAgB,aACvD5kD,EAAYqkD,EAAiBpnD,EAAW2nD,EAAgB,cACxDhlD,EACJykD,EAAiBpnD,EAAW2nD,EAAgB,eAAiB,GAGzD2I,EAAgB,WAAYvpF,IAAU47B,EAAU50B,SAAS,UAG/D,IAAIuiF,GAA0B,UAATv0E,EAAkB,CAErC,GAAGhV,EAAM,WAAagV,EACpB,OAAOhV,EAAM,UAEf,GAAG,cAAeA,GAASA,EAAM,eAAiBqT,GAC/C,eAAgBrT,GAASA,EAAM,gBAAkBg8B,EAClD,OAAOh8B,EAAM,UAEf,GAAG,cAAeA,GAASA,EAAM,eAAiBqT,EAChD,OAAOrT,EAAM,UAEf,GAAG,eAAgBA,GAASA,EAAM,gBAAkBg8B,EAClD,OAAOh8B,EAAM,UAQjB,MAAMwpF,EAAW/pF,OAAO4W,KAAKrW,GAAOuD,OAC9BkmF,EAA+B,IAAbD,GACR,IAAbA,GAAkB,WAAYxpF,IAAUupF,EACrCG,EAAsB,cAAezwD,EACrC0wD,EAAgBnxD,EAAUx4B,EAAM,WAChC4pF,EAAkB3wD,EAAUnK,SAASsM,IAAIwlD,IACW,OAAxD3nD,EAAUnK,SAASlvB,IAAIghF,GAAgB,aACzC,GAAG6I,GACQ,UAATz0E,KACE00E,IAAuBC,GAAiBC,GAC1C,OAAO5pF,EAAM,UAGf,MAAMuX,EAAO,GA4Cb,OAzCGgyE,IACDhyE,EAAK5B,EAAIohD,WAAW,CAClB99B,YACAryB,IAAK,SACLsyB,WAAY,CAACK,OAAO,MAChBv5B,EAAM,WAGX,UAAWA,EAEZuX,EAAK5B,EAAIohD,WAAW,CAClB99B,YACAryB,IAAK,QACLsyB,WAAY,CAACK,OAAO,MAChB5jB,EAAIohD,WACR,CAAC99B,YAAWryB,IAAK5G,EAAM,SAAUk5B,WAAY,CAACK,OAAO,KAC/C,cAAev5B,IAEvBuX,EAAK5B,EAAIohD,WAAW,CAClB99B,YACAryB,IAAK,YACLsyB,WAAY,CAACK,OAAO,MAChBv5B,EAAM,cAGX,eAAgBA,IAEjBuX,EAAK5B,EAAIohD,WAAW,CAClB99B,YACAryB,IAAK,aACLsyB,WAAY,CAACK,OAAO,MAChBv5B,EAAM,eAIduX,EAAK5B,EAAIohD,WAAW,CAClB99B,YACAryB,IAAK,SACLsyB,WAAY,CAACK,OAAO,MAChBv5B,EAAM,UAELuX,EAIT,MAAMspE,EAAmB7nD,EAAWC,EAAW2nD,EAAgB,CAACrnD,OAAO,GACrE7vB,GACIsL,EAAOqrE,EAAiBpnD,EAAW2nD,EAAgB,SACnD7oB,EAAYpiD,EAAIohD,WAAW,CAC/B99B,YACAryB,IAAK5G,EAAM,OACXk5B,WAAY,CAACK,MAAgB,WAATvkB,GACpBxQ,KAAMkF,EAAQlF,OAGhB,MAAY,QAATwQ,GAA2B,WAATA,GAA0C,WAArB6rE,EACjC9oB,EAGF,CACL,CAACpiD,EAAIohD,WAAW,CACd99B,YACAryB,IAAK,MACLsyB,WAAY,CAACK,OAAO,MACjBw+B,K,6BCvjCTz5D,EAAOD,QAAUs2D,IACf,MAAMoG,EACJ,WACE,MAAO,4BA0CX,OAvCAt7D,OAAOC,eAAeq7D,EAAiB,YAAa,CAClD95D,UAAU,EACVtB,YAAY,IAEdF,OAAOC,eAAeq7D,EAAgBp6D,UAAW,cAAe,CAC9DM,UAAU,EACVtB,YAAY,EACZqB,cAAc,EACdhB,MAAO+6D,IASTA,EAAgBlE,QAAU,SAAS/8C,EAAOugB,GACxC,OAAGtc,UAAUxa,OAAS,EACbo9B,QAAQC,OACb,IAAIz9B,UAAU,0CAEXwxD,EAAOkC,QAAQ/8C,EAAOugB,IAE/B0gC,EAAgBhF,OAAS,SAASj8C,GAChC,OAAGiE,UAAUxa,OAAS,EACbo9B,QAAQC,OACb,IAAIz9B,UAAU,yCAEXwxD,EAAOoB,OAAOj8C,IAEvBihD,EAAgB1F,QAAU,SAASv7C,GACjC,OAAGiE,UAAUxa,OAAS,EACbo9B,QAAQC,OACb,IAAIz9B,UAAU,0CAEXwxD,EAAOU,QAAQv7C,IAGjBihD,I,8BClDT;;;;;;;AAUA,IAAI8uB,EAAS,EAAQ,KACjBC,EAAU,EAAQ,KAClBl0E,EAAU,EAAQ,KAmDtB,SAASm0E,IACP,OAAOtU,EAAOuU,oBACV,WACA,WAGN,SAASC,EAAczrC,EAAMj7C,GAC3B,GAAIwmF,IAAexmF,EACjB,MAAM,IAAI0U,WAAW,8BAcvB,OAZIw9D,EAAOuU,qBAETxrC,EAAO,IAAIpG,WAAW70C,IACjBiE,UAAYiuE,EAAO90E,WAGX,OAAT69C,IACFA,EAAO,IAAIi3B,EAAOlyE,IAEpBi7C,EAAKj7C,OAASA,GAGTi7C,EAaT,SAASi3B,EAAQ/oB,EAAKw9B,EAAkB3mF,GACtC,KAAKkyE,EAAOuU,qBAAyB9iF,gBAAgBuuE,GACnD,OAAO,IAAIA,EAAO/oB,EAAKw9B,EAAkB3mF,GAI3C,GAAmB,iBAARmpD,EAAkB,CAC3B,GAAgC,iBAArBw9B,EACT,MAAM,IAAInjF,MACR,qEAGJ,OAAOojF,EAAYjjF,KAAMwlD,GAE3B,OAAOjuC,EAAKvX,KAAMwlD,EAAKw9B,EAAkB3mF,GAW3C,SAASkb,EAAM+/B,EAAMx+C,EAAOkqF,EAAkB3mF,GAC5C,GAAqB,iBAAVvD,EACT,MAAM,IAAImD,UAAU,yCAGtB,MAA2B,oBAAhB8zC,aAA+Bj3C,aAAiBi3C,YA6H7D,SAA0BuH,EAAMyL,EAAOmgC,EAAY7mF,GAGjD,GAFA0mD,EAAM5R,WAEF+xC,EAAa,GAAKngC,EAAM5R,WAAa+xC,EACvC,MAAM,IAAInyE,WAAW,6BAGvB,GAAIgyC,EAAM5R,WAAa+xC,GAAc7mF,GAAU,GAC7C,MAAM,IAAI0U,WAAW,6BAIrBgyC,OADiBv8C,IAAf08E,QAAuC18E,IAAXnK,EACtB,IAAI60C,WAAW6R,QACHv8C,IAAXnK,EACD,IAAI60C,WAAW6R,EAAOmgC,GAEtB,IAAIhyC,WAAW6R,EAAOmgC,EAAY7mF,GAGxCkyE,EAAOuU,qBAETxrC,EAAOyL,GACFziD,UAAYiuE,EAAO90E,UAGxB69C,EAAO6rC,EAAc7rC,EAAMyL,GAE7B,OAAOzL,EAvJE8rC,CAAgB9rC,EAAMx+C,EAAOkqF,EAAkB3mF,GAGnC,iBAAVvD,EAwFb,SAAqBw+C,EAAM/2C,EAAQ6d,GACT,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,QAGb,IAAKmwD,EAAO8U,WAAWjlE,GACrB,MAAM,IAAIniB,UAAU,8CAGtB,IAAII,EAAwC,EAA/B80C,EAAW5wC,EAAQ6d,GAG5B0P,GAFJwpB,EAAOyrC,EAAazrC,EAAMj7C,IAERgvC,MAAM9qC,EAAQ6d,GAE5B0P,IAAWzxB,IAIbi7C,EAAOA,EAAKx6C,MAAM,EAAGgxB,IAGvB,OAAOwpB,EA5GEgsC,CAAWhsC,EAAMx+C,EAAOkqF,GAsJnC,SAAqB1rC,EAAMz9C,GACzB,GAAI00E,EAAOgV,SAAS1pF,GAAM,CACxB,IAAIsE,EAA4B,EAAtBqlF,EAAQ3pF,EAAIwC,QAGtB,OAAoB,KAFpBi7C,EAAOyrC,EAAazrC,EAAMn5C,IAEjB9B,QAITxC,EAAIke,KAAKu/B,EAAM,EAAG,EAAGn5C,GAHZm5C,EAOX,GAAIz9C,EAAK,CACP,GAA4B,oBAAhBk2C,aACRl2C,EAAIu3C,kBAAkBrB,aAAgB,WAAYl2C,EACpD,MAA0B,iBAAfA,EAAIwC,SA+8CLyV,EA/8CkCjY,EAAIwC,SAg9CrCyV,EA/8CFixE,EAAazrC,EAAM,GAErB6rC,EAAc7rC,EAAMz9C,GAG7B,GAAiB,WAAbA,EAAIiU,MAAqBY,EAAQ7U,EAAIwP,MACvC,OAAO85E,EAAc7rC,EAAMz9C,EAAIwP,MAw8CrC,IAAgByI,EAp8Cd,MAAM,IAAI7V,UAAU,sFA9KbwnF,CAAWnsC,EAAMx+C,GA4B1B,SAAS4qF,EAAYntD,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAIt6B,UAAU,oCACf,GAAIs6B,EAAO,EAChB,MAAM,IAAIxlB,WAAW,wCA4BzB,SAASkyE,EAAa3rC,EAAM/gB,GAG1B,GAFAmtD,EAAWntD,GACX+gB,EAAOyrC,EAAazrC,EAAM/gB,EAAO,EAAI,EAAoB,EAAhBitD,EAAQjtD,KAC5Cg4C,EAAOuU,oBACV,IAAK,IAAIjrF,EAAI,EAAGA,EAAI0+B,IAAQ1+B,EAC1By/C,EAAKz/C,GAAK,EAGd,OAAOy/C,EAwCT,SAAS6rC,EAAe7rC,EAAMyL,GAC5B,IAAI1mD,EAAS0mD,EAAM1mD,OAAS,EAAI,EAA4B,EAAxBmnF,EAAQzgC,EAAM1mD,QAClDi7C,EAAOyrC,EAAazrC,EAAMj7C,GAC1B,IAAK,IAAIxE,EAAI,EAAGA,EAAIwE,EAAQxE,GAAK,EAC/By/C,EAAKz/C,GAAgB,IAAXkrD,EAAMlrD,GAElB,OAAOy/C,EA+DT,SAASksC,EAASnnF,GAGhB,GAAIA,GAAUwmF,IACZ,MAAM,IAAI9xE,WAAW,0DACa8xE,IAAah7E,SAAS,IAAM,UAEhE,OAAgB,EAATxL,EAsFT,SAAS80C,EAAY5wC,EAAQ6d,GAC3B,GAAImwD,EAAOgV,SAAShjF,GAClB,OAAOA,EAAOlE,OAEhB,GAA2B,oBAAhB0zC,aAA6D,mBAAvBA,YAAYC,SACxDD,YAAYC,OAAOzvC,IAAWA,aAAkBwvC,aACnD,OAAOxvC,EAAO4wC,WAEM,iBAAX5wC,IACTA,EAAS,GAAKA,GAGhB,IAAIpC,EAAMoC,EAAOlE,OACjB,GAAY,IAAR8B,EAAW,OAAO,EAItB,IADA,IAAIwlF,GAAc,IAEhB,OAAQvlE,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOjgB,EACT,IAAK,OACL,IAAK,QACL,UAAKqI,EACH,OAAOo9E,EAAYrjF,GAAQlE,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAAN8B,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAO0lF,EAActjF,GAAQlE,OAC/B,QACE,GAAIsnF,EAAa,OAAOC,EAAYrjF,GAAQlE,OAC5C+hB,GAAY,GAAKA,GAAU1a,cAC3BigF,GAAc,GAMtB,SAASG,EAAc1lE,EAAUs6D,EAAOxtB,GACtC,IAAIy4B,GAAc,EAclB,SALcn9E,IAAVkyE,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQ14E,KAAK3D,OACf,MAAO,GAOT,SAJYmK,IAAR0kD,GAAqBA,EAAMlrD,KAAK3D,UAClC6uD,EAAMlrD,KAAK3D,QAGT6uD,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACTwtB,KAAW,GAGT,MAAO,GAKT,IAFKt6D,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAO2lE,EAAS/jF,KAAM04E,EAAOxtB,GAE/B,IAAK,OACL,IAAK,QACH,OAAO84B,EAAUhkF,KAAM04E,EAAOxtB,GAEhC,IAAK,QACH,OAAO+4B,EAAWjkF,KAAM04E,EAAOxtB,GAEjC,IAAK,SACL,IAAK,SACH,OAAOg5B,EAAYlkF,KAAM04E,EAAOxtB,GAElC,IAAK,SACH,OAAOi5B,EAAYnkF,KAAM04E,EAAOxtB,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOk5B,EAAapkF,KAAM04E,EAAOxtB,GAEnC,QACE,GAAIy4B,EAAa,MAAM,IAAI1nF,UAAU,qBAAuBmiB,GAC5DA,GAAYA,EAAW,IAAI1a,cAC3BigF,GAAc,GAStB,SAAS/b,EAAMtjE,EAAGhL,EAAGrB,GACnB,IAAIJ,EAAIyM,EAAEhL,GACVgL,EAAEhL,GAAKgL,EAAErM,GACTqM,EAAErM,GAAKJ,EAmIT,SAASwsF,EAAsBjzC,EAAQt/B,EAAKoxE,EAAY9kE,EAAUsF,GAEhE,GAAsB,IAAlB0tB,EAAO/0C,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAf6mF,GACT9kE,EAAW8kE,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAEhBA,GAAcA,EACV7zE,MAAM6zE,KAERA,EAAax/D,EAAM,EAAK0tB,EAAO/0C,OAAS,GAItC6mF,EAAa,IAAGA,EAAa9xC,EAAO/0C,OAAS6mF,GAC7CA,GAAc9xC,EAAO/0C,OAAQ,CAC/B,GAAIqnB,EAAK,OAAQ,EACZw/D,EAAa9xC,EAAO/0C,OAAS,OAC7B,GAAI6mF,EAAa,EAAG,CACzB,IAAIx/D,EACC,OAAQ,EADJw/D,EAAa,EAUxB,GALmB,iBAARpxE,IACTA,EAAMy8D,EAAOh3D,KAAKzF,EAAKsM,IAIrBmwD,EAAOgV,SAASzxE,GAElB,OAAmB,IAAfA,EAAIzV,QACE,EAEHg8D,EAAajnB,EAAQt/B,EAAKoxE,EAAY9kE,EAAUsF,GAClD,GAAmB,iBAAR5R,EAEhB,OADAA,GAAY,IACRy8D,EAAOuU,qBACiC,mBAAjC5xC,WAAWz3C,UAAUoD,QAC1B6mB,EACKwtB,WAAWz3C,UAAUoD,QAAQ7E,KAAKo5C,EAAQt/B,EAAKoxE,GAE/ChyC,WAAWz3C,UAAUoE,YAAY7F,KAAKo5C,EAAQt/B,EAAKoxE,GAGvD7qB,EAAajnB,EAAQ,CAAEt/B,GAAOoxE,EAAY9kE,EAAUsF,GAG7D,MAAM,IAAIznB,UAAU,wCAGtB,SAASo8D,EAActuD,EAAK+H,EAAKoxE,EAAY9kE,EAAUsF,GACrD,IA0BI7rB,EA1BAysF,EAAY,EACZC,EAAYx6E,EAAI1N,OAChBmoF,EAAY1yE,EAAIzV,OAEpB,QAAiBmK,IAAb4X,IAEe,UADjBA,EAAWpP,OAAOoP,GAAU1a,gBACY,UAAb0a,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAIrU,EAAI1N,OAAS,GAAKyV,EAAIzV,OAAS,EACjC,OAAQ,EAEVioF,EAAY,EACZC,GAAa,EACbC,GAAa,EACbtB,GAAc,EAIlB,SAAStiE,EAAMC,EAAKhpB,GAClB,OAAkB,IAAdysF,EACKzjE,EAAIhpB,GAEJgpB,EAAI4jE,aAAa5sF,EAAIysF,GAKhC,GAAI5gE,EAAK,CACP,IAAIghE,GAAc,EAClB,IAAK7sF,EAAIqrF,EAAYrrF,EAAI0sF,EAAW1sF,IAClC,GAAI+oB,EAAK7W,EAAKlS,KAAO+oB,EAAK9O,GAAqB,IAAhB4yE,EAAoB,EAAI7sF,EAAI6sF,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa7sF,GAChCA,EAAI6sF,EAAa,IAAMF,EAAW,OAAOE,EAAaJ,OAEtC,IAAhBI,IAAmB7sF,GAAKA,EAAI6sF,GAChCA,GAAc,OAKlB,IADIxB,EAAasB,EAAYD,IAAWrB,EAAaqB,EAAYC,GAC5D3sF,EAAIqrF,EAAYrrF,GAAK,EAAGA,IAAK,CAEhC,IADA,IAAI+9C,GAAQ,EACHn+B,EAAI,EAAGA,EAAI+sE,EAAW/sE,IAC7B,GAAImJ,EAAK7W,EAAKlS,EAAI4f,KAAOmJ,EAAK9O,EAAK2F,GAAI,CACrCm+B,GAAQ,EACR,MAGJ,GAAIA,EAAO,OAAO/9C,EAItB,OAAQ,EAeV,SAAS8sF,EAAU9jE,EAAKtgB,EAAQqkF,EAAQvoF,GACtCuoF,EAAS93E,OAAO83E,IAAW,EAC3B,IAAIC,EAAYhkE,EAAIxkB,OAASuoF,EACxBvoF,GAGHA,EAASyQ,OAAOzQ,IACHwoF,IACXxoF,EAASwoF,GAJXxoF,EAASwoF,EASX,IAAIC,EAASvkF,EAAOlE,OACpB,GAAIyoF,EAAS,GAAM,EAAG,MAAM,IAAI7oF,UAAU,sBAEtCI,EAASyoF,EAAS,IACpBzoF,EAASyoF,EAAS,GAEpB,IAAK,IAAIjtF,EAAI,EAAGA,EAAIwE,IAAUxE,EAAG,CAC/B,IAAIgkB,EAASuI,SAAS7jB,EAAOgc,OAAW,EAAJ1kB,EAAO,GAAI,IAC/C,GAAIwX,MAAMwM,GAAS,OAAOhkB,EAC1BgpB,EAAI+jE,EAAS/sF,GAAKgkB,EAEpB,OAAOhkB,EAGT,SAASktF,EAAWlkE,EAAKtgB,EAAQqkF,EAAQvoF,GACvC,OAAO2oF,EAAWpB,EAAYrjF,EAAQsgB,EAAIxkB,OAASuoF,GAAS/jE,EAAK+jE,EAAQvoF,GAG3E,SAAS4oF,EAAYpkE,EAAKtgB,EAAQqkF,EAAQvoF,GACxC,OAAO2oF,EAq6BT,SAAuBjlF,GAErB,IADA,IAAImlF,EAAY,GACPrtF,EAAI,EAAGA,EAAIkI,EAAI1D,SAAUxE,EAEhCqtF,EAAU3jF,KAAyB,IAApBxB,EAAImd,WAAWrlB,IAEhC,OAAOqtF,EA36BWC,CAAa5kF,GAASsgB,EAAK+jE,EAAQvoF,GAGvD,SAAS+oF,EAAavkE,EAAKtgB,EAAQqkF,EAAQvoF,GACzC,OAAO4oF,EAAWpkE,EAAKtgB,EAAQqkF,EAAQvoF,GAGzC,SAASgpF,EAAaxkE,EAAKtgB,EAAQqkF,EAAQvoF,GACzC,OAAO2oF,EAAWnB,EAActjF,GAASsgB,EAAK+jE,EAAQvoF,GAGxD,SAASipF,EAAWzkE,EAAKtgB,EAAQqkF,EAAQvoF,GACvC,OAAO2oF,EAk6BT,SAAyBjlF,EAAKwlF,GAG5B,IAFA,IAAIrtF,EAAGstF,EAAIC,EACPP,EAAY,GACPrtF,EAAI,EAAGA,EAAIkI,EAAI1D,WACjBkpF,GAAS,GAAK,KADa1tF,EAGhCK,EAAI6H,EAAImd,WAAWrlB,GACnB2tF,EAAKttF,GAAK,EACVutF,EAAKvtF,EAAI,IACTgtF,EAAU3jF,KAAKkkF,GACfP,EAAU3jF,KAAKikF,GAGjB,OAAON,EA/6BWQ,CAAenlF,EAAQsgB,EAAIxkB,OAASuoF,GAAS/jE,EAAK+jE,EAAQvoF,GAkF9E,SAAS8nF,EAAatjE,EAAK63D,EAAOxtB,GAChC,OAAc,IAAVwtB,GAAextB,IAAQrqC,EAAIxkB,OACtBsmF,EAAOgD,cAAc9kE,GAErB8hE,EAAOgD,cAAc9kE,EAAI/jB,MAAM47E,EAAOxtB,IAIjD,SAAS84B,EAAWnjE,EAAK63D,EAAOxtB,GAC9BA,EAAMt+C,KAAKqyC,IAAIp+B,EAAIxkB,OAAQ6uD,GAI3B,IAHA,IAAIzwC,EAAM,GAEN5iB,EAAI6gF,EACD7gF,EAAIqzD,GAAK,CACd,IAQM06B,EAAYC,EAAWC,EAAYC,EARrCC,EAAYnlE,EAAIhpB,GAChBouF,EAAY,KACZC,EAAoBF,EAAY,IAAQ,EACvCA,EAAY,IAAQ,EACpBA,EAAY,IAAQ,EACrB,EAEJ,GAAInuF,EAAIquF,GAAoBh7B,EAG1B,OAAQg7B,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EAEyB,MAAV,KADlBJ,EAAa/kE,EAAIhpB,EAAI,OAEnBkuF,GAA6B,GAAZC,IAAqB,EAAoB,GAAbJ,GACzB,MAClBK,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa/kE,EAAIhpB,EAAI,GACrBguF,EAAYhlE,EAAIhpB,EAAI,GACQ,MAAV,IAAb+tF,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZC,IAAoB,IAAoB,GAAbJ,IAAsB,EAAmB,GAAZC,GACrD,OAAUE,EAAgB,OAAUA,EAAgB,SACtEE,EAAYF,GAGhB,MACF,KAAK,EACHH,EAAa/kE,EAAIhpB,EAAI,GACrBguF,EAAYhlE,EAAIhpB,EAAI,GACpBiuF,EAAajlE,EAAIhpB,EAAI,GACO,MAAV,IAAb+tF,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZC,IAAoB,IAAqB,GAAbJ,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,GAClF,OAAUC,EAAgB,UAC5CE,EAAYF,GAMJ,OAAdE,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbxrE,EAAIlZ,KAAK0kF,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBxrE,EAAIlZ,KAAK0kF,GACTpuF,GAAKquF,EAGP,OAQF,SAAgCC,GAC9B,IAAIhoF,EAAMgoF,EAAW9pF,OACrB,GAAI8B,GAJqB,KAKvB,OAAO6Q,OAAOmO,aAAajb,MAAM8M,OAAQm3E,GAI3C,IAAI1rE,EAAM,GACN5iB,EAAI,EACR,KAAOA,EAAIsG,GACTsc,GAAOzL,OAAOmO,aAAajb,MACzB8M,OACAm3E,EAAWrpF,MAAMjF,EAAGA,GAdC,OAiBzB,OAAO4iB,EAvBA2rE,CAAsB3rE,GA98B/BtjB,EAAQo3E,OAASA,EACjBp3E,EAAQkvF,WAoTR,SAAqBhqF,IACdA,GAAUA,IACbA,EAAS,GAEX,OAAOkyE,EAAO+X,OAAOjqF,IAvTvBlF,EAAQovF,kBAAoB,GA0B5BhY,EAAOuU,yBAAqDt8E,IAA/B4zB,EAAO0oD,oBAChC1oD,EAAO0oD,oBAQX,WACE,IACE,IAAI/4E,EAAM,IAAImnC,WAAW,GAEzB,OADAnnC,EAAIzJ,UAAY,CAACA,UAAW4wC,WAAWz3C,UAAWs9D,IAAK,WAAc,OAAO,KACvD,KAAdhtD,EAAIgtD,OACiB,mBAAjBhtD,EAAIy8E,UACuB,IAAlCz8E,EAAIy8E,SAAS,EAAG,GAAGr1C,WACvB,MAAOzpC,GACP,OAAO,GAfP++E,GAKJtvF,EAAQ0rF,WAAaA,IAkErBtU,EAAOmY,SAAW,KAGlBnY,EAAOoY,SAAW,SAAU58E,GAE1B,OADAA,EAAIzJ,UAAYiuE,EAAO90E,UAChBsQ,GA2BTwkE,EAAOh3D,KAAO,SAAUze,EAAOkqF,EAAkB3mF,GAC/C,OAAOkb,EAAK,KAAMze,EAAOkqF,EAAkB3mF,IAGzCkyE,EAAOuU,sBACTvU,EAAO90E,UAAU6G,UAAY4wC,WAAWz3C,UACxC80E,EAAOjuE,UAAY4wC,WACG,oBAAXt4C,QAA0BA,OAAOguF,SACxCrY,EAAO31E,OAAOguF,WAAarY,GAE7Bh2E,OAAOC,eAAe+1E,EAAQ31E,OAAOguF,QAAS,CAC5C9tF,MAAO,KACPgB,cAAc,KAiCpBy0E,EAAO+X,MAAQ,SAAU/vD,EAAMswD,EAAMzoE,GACnC,OArBF,SAAgBk5B,EAAM/gB,EAAMswD,EAAMzoE,GAEhC,OADAslE,EAAWntD,GACPA,GAAQ,EACHwsD,EAAazrC,EAAM/gB,QAEf/vB,IAATqgF,EAIyB,iBAAbzoE,EACV2kE,EAAazrC,EAAM/gB,GAAMswD,KAAKA,EAAMzoE,GACpC2kE,EAAazrC,EAAM/gB,GAAMswD,KAAKA,GAE7B9D,EAAazrC,EAAM/gB,GAQnB+vD,CAAM,KAAM/vD,EAAMswD,EAAMzoE,IAiBjCmwD,EAAO0U,YAAc,SAAU1sD,GAC7B,OAAO0sD,EAAY,KAAM1sD,IAK3Bg4C,EAAOuY,gBAAkB,SAAUvwD,GACjC,OAAO0sD,EAAY,KAAM1sD,IAiH3Bg4C,EAAOgV,SAAW,SAAmBj/E,GACnC,QAAe,MAALA,IAAaA,EAAEyiF,YAG3BxY,EAAOyY,QAAU,SAAkB3iF,EAAGC,GACpC,IAAKiqE,EAAOgV,SAASl/E,KAAOkqE,EAAOgV,SAASj/E,GAC1C,MAAM,IAAIrI,UAAU,6BAGtB,GAAIoI,IAAMC,EAAG,OAAO,EAKpB,IAHA,IAAI/I,EAAI8I,EAAEhI,OACNuJ,EAAItB,EAAEjI,OAEDxE,EAAI,EAAGsG,EAAMyO,KAAKqyC,IAAI1jD,EAAGqK,GAAI/N,EAAIsG,IAAOtG,EAC/C,GAAIwM,EAAExM,KAAOyM,EAAEzM,GAAI,CACjB0D,EAAI8I,EAAExM,GACN+N,EAAItB,EAAEzM,GACN,MAIJ,OAAI0D,EAAIqK,GAAW,EACfA,EAAIrK,EAAU,EACX,GAGTgzE,EAAO8U,WAAa,SAAqBjlE,GACvC,OAAQpP,OAAOoP,GAAU1a,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,IAIb6qE,EAAOhoE,OAAS,SAAiBuT,EAAMzd,GACrC,IAAKqS,EAAQoL,GACX,MAAM,IAAI7d,UAAU,+CAGtB,GAAoB,IAAhB6d,EAAKzd,OACP,OAAOkyE,EAAO+X,MAAM,GAGtB,IAAIzuF,EACJ,QAAe2O,IAAXnK,EAEF,IADAA,EAAS,EACJxE,EAAI,EAAGA,EAAIiiB,EAAKzd,SAAUxE,EAC7BwE,GAAUyd,EAAKjiB,GAAGwE,OAItB,IAAI+0C,EAASm9B,EAAO0U,YAAY5mF,GAC5BsrE,EAAM,EACV,IAAK9vE,EAAI,EAAGA,EAAIiiB,EAAKzd,SAAUxE,EAAG,CAChC,IAAIgpB,EAAM/G,EAAKjiB,GACf,IAAK02E,EAAOgV,SAAS1iE,GACnB,MAAM,IAAI5kB,UAAU,+CAEtB4kB,EAAI9I,KAAKq5B,EAAQu2B,GACjBA,GAAO9mD,EAAIxkB,OAEb,OAAO+0C,GA8CTm9B,EAAOp9B,WAAaA,EA0EpBo9B,EAAO90E,UAAUstF,WAAY,EAQ7BxY,EAAO90E,UAAUwtF,OAAS,WACxB,IAAI9oF,EAAM6B,KAAK3D,OACf,GAAI8B,EAAM,GAAM,EACd,MAAM,IAAI4S,WAAW,6CAEvB,IAAK,IAAIlZ,EAAI,EAAGA,EAAIsG,EAAKtG,GAAK,EAC5B+vE,EAAK5nE,KAAMnI,EAAGA,EAAI,GAEpB,OAAOmI,MAGTuuE,EAAO90E,UAAUytF,OAAS,WACxB,IAAI/oF,EAAM6B,KAAK3D,OACf,GAAI8B,EAAM,GAAM,EACd,MAAM,IAAI4S,WAAW,6CAEvB,IAAK,IAAIlZ,EAAI,EAAGA,EAAIsG,EAAKtG,GAAK,EAC5B+vE,EAAK5nE,KAAMnI,EAAGA,EAAI,GAClB+vE,EAAK5nE,KAAMnI,EAAI,EAAGA,EAAI,GAExB,OAAOmI,MAGTuuE,EAAO90E,UAAU0tF,OAAS,WACxB,IAAIhpF,EAAM6B,KAAK3D,OACf,GAAI8B,EAAM,GAAM,EACd,MAAM,IAAI4S,WAAW,6CAEvB,IAAK,IAAIlZ,EAAI,EAAGA,EAAIsG,EAAKtG,GAAK,EAC5B+vE,EAAK5nE,KAAMnI,EAAGA,EAAI,GAClB+vE,EAAK5nE,KAAMnI,EAAI,EAAGA,EAAI,GACtB+vE,EAAK5nE,KAAMnI,EAAI,EAAGA,EAAI,GACtB+vE,EAAK5nE,KAAMnI,EAAI,EAAGA,EAAI,GAExB,OAAOmI,MAGTuuE,EAAO90E,UAAUoO,SAAW,WAC1B,IAAIxL,EAAuB,EAAd2D,KAAK3D,OAClB,OAAe,IAAXA,EAAqB,GACA,IAArBwa,UAAUxa,OAAqB2nF,EAAUhkF,KAAM,EAAG3D,GAC/CynF,EAAa5hF,MAAMlC,KAAM6W,YAGlC03D,EAAO90E,UAAU4N,OAAS,SAAiB/C,GACzC,IAAKiqE,EAAOgV,SAASj/E,GAAI,MAAM,IAAIrI,UAAU,6BAC7C,OAAI+D,OAASsE,GACsB,IAA5BiqE,EAAOyY,QAAQhnF,KAAMsE,IAG9BiqE,EAAO90E,UAAU2tF,QAAU,WACzB,IAAIrnF,EAAM,GACNqwD,EAAMj5D,EAAQovF,kBAKlB,OAJIvmF,KAAK3D,OAAS,IAChB0D,EAAMC,KAAK6H,SAAS,MAAO,EAAGuoD,GAAKtyD,MAAM,SAASV,KAAK,KACnD4C,KAAK3D,OAAS+zD,IAAKrwD,GAAO,UAEzB,WAAaA,EAAM,KAG5BwuE,EAAO90E,UAAUutF,QAAU,SAAkB7qF,EAAQu8E,EAAOxtB,EAAKm8B,EAAWC,GAC1E,IAAK/Y,EAAOgV,SAASpnF,GACnB,MAAM,IAAIF,UAAU,6BAgBtB,QAbcuK,IAAVkyE,IACFA,EAAQ,QAEElyE,IAAR0kD,IACFA,EAAM/uD,EAASA,EAAOE,OAAS,QAEfmK,IAAd6gF,IACFA,EAAY,QAEE7gF,IAAZ8gF,IACFA,EAAUtnF,KAAK3D,QAGbq8E,EAAQ,GAAKxtB,EAAM/uD,EAAOE,QAAUgrF,EAAY,GAAKC,EAAUtnF,KAAK3D,OACtE,MAAM,IAAI0U,WAAW,sBAGvB,GAAIs2E,GAAaC,GAAW5O,GAASxtB,EACnC,OAAO,EAET,GAAIm8B,GAAaC,EACf,OAAQ,EAEV,GAAI5O,GAASxtB,EACX,OAAO,EAQT,GAAIlrD,OAAS7D,EAAQ,OAAO,EAS5B,IAPA,IAAIZ,GAJJ+rF,KAAa,IADbD,KAAe,GAMXzhF,GAPJslD,KAAS,IADTwtB,KAAW,GASPv6E,EAAMyO,KAAKqyC,IAAI1jD,EAAGqK,GAElB2hF,EAAWvnF,KAAKlD,MAAMuqF,EAAWC,GACjCE,EAAarrF,EAAOW,MAAM47E,EAAOxtB,GAE5BrzD,EAAI,EAAGA,EAAIsG,IAAOtG,EACzB,GAAI0vF,EAAS1vF,KAAO2vF,EAAW3vF,GAAI,CACjC0D,EAAIgsF,EAAS1vF,GACb+N,EAAI4hF,EAAW3vF,GACf,MAIJ,OAAI0D,EAAIqK,GAAW,EACfA,EAAIrK,EAAU,EACX,GA6HTgzE,EAAO90E,UAAUqG,SAAW,SAAmBgS,EAAKoxE,EAAY9kE,GAC9D,OAAoD,IAA7Cpe,KAAKnD,QAAQiV,EAAKoxE,EAAY9kE,IAGvCmwD,EAAO90E,UAAUoD,QAAU,SAAkBiV,EAAKoxE,EAAY9kE,GAC5D,OAAOimE,EAAqBrkF,KAAM8R,EAAKoxE,EAAY9kE,GAAU,IAG/DmwD,EAAO90E,UAAUoE,YAAc,SAAsBiU,EAAKoxE,EAAY9kE,GACpE,OAAOimE,EAAqBrkF,KAAM8R,EAAKoxE,EAAY9kE,GAAU,IAkD/DmwD,EAAO90E,UAAU4xC,MAAQ,SAAgB9qC,EAAQqkF,EAAQvoF,EAAQ+hB,GAE/D,QAAe5X,IAAXo+E,EACFxmE,EAAW,OACX/hB,EAAS2D,KAAK3D,OACduoF,EAAS,OAEJ,QAAep+E,IAAXnK,GAA0C,iBAAXuoF,EACxCxmE,EAAWwmE,EACXvoF,EAAS2D,KAAK3D,OACduoF,EAAS,MAEJ,KAAIr1E,SAASq1E,GAWlB,MAAM,IAAI/kF,MACR,2EAXF+kF,GAAkB,EACdr1E,SAASlT,IACXA,GAAkB,OACDmK,IAAb4X,IAAwBA,EAAW,UAEvCA,EAAW/hB,EACXA,OAASmK,GASb,IAAIq+E,EAAY7kF,KAAK3D,OAASuoF,EAG9B,SAFep+E,IAAXnK,GAAwBA,EAASwoF,KAAWxoF,EAASwoF,GAEpDtkF,EAAOlE,OAAS,IAAMA,EAAS,GAAKuoF,EAAS,IAAOA,EAAS5kF,KAAK3D,OACrE,MAAM,IAAI0U,WAAW,0CAGlBqN,IAAUA,EAAW,QAG1B,IADA,IAAIulE,GAAc,IAEhB,OAAQvlE,GACN,IAAK,MACH,OAAOumE,EAAS3kF,KAAMO,EAAQqkF,EAAQvoF,GAExC,IAAK,OACL,IAAK,QACH,OAAO0oF,EAAU/kF,KAAMO,EAAQqkF,EAAQvoF,GAEzC,IAAK,QACH,OAAO4oF,EAAWjlF,KAAMO,EAAQqkF,EAAQvoF,GAE1C,IAAK,SACL,IAAK,SACH,OAAO+oF,EAAYplF,KAAMO,EAAQqkF,EAAQvoF,GAE3C,IAAK,SAEH,OAAOgpF,EAAYrlF,KAAMO,EAAQqkF,EAAQvoF,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOipF,EAAUtlF,KAAMO,EAAQqkF,EAAQvoF,GAEzC,QACE,GAAIsnF,EAAa,MAAM,IAAI1nF,UAAU,qBAAuBmiB,GAC5DA,GAAY,GAAKA,GAAU1a,cAC3BigF,GAAc,IAKtBpV,EAAO90E,UAAUorC,OAAS,WACxB,MAAO,CACL/2B,KAAM,SACNzE,KAAMsF,MAAMlV,UAAUqD,MAAM9E,KAAKgI,KAAKynF,MAAQznF,KAAM,KA4GxD,SAASikF,EAAYpjE,EAAK63D,EAAOxtB,GAC/B,IAAIstB,EAAM,GACVttB,EAAMt+C,KAAKqyC,IAAIp+B,EAAIxkB,OAAQ6uD,GAE3B,IAAK,IAAIrzD,EAAI6gF,EAAO7gF,EAAIqzD,IAAOrzD,EAC7B2gF,GAAOxpE,OAAOmO,aAAsB,IAAT0D,EAAIhpB,IAEjC,OAAO2gF,EAGT,SAAS0L,EAAarjE,EAAK63D,EAAOxtB,GAChC,IAAIstB,EAAM,GACVttB,EAAMt+C,KAAKqyC,IAAIp+B,EAAIxkB,OAAQ6uD,GAE3B,IAAK,IAAIrzD,EAAI6gF,EAAO7gF,EAAIqzD,IAAOrzD,EAC7B2gF,GAAOxpE,OAAOmO,aAAa0D,EAAIhpB,IAEjC,OAAO2gF,EAGT,SAASuL,EAAUljE,EAAK63D,EAAOxtB,GAC7B,IAAI/sD,EAAM0iB,EAAIxkB,SAETq8E,GAASA,EAAQ,KAAGA,EAAQ,KAC5BxtB,GAAOA,EAAM,GAAKA,EAAM/sD,KAAK+sD,EAAM/sD,GAGxC,IADA,IAAI0E,EAAM,GACDhL,EAAI6gF,EAAO7gF,EAAIqzD,IAAOrzD,EAC7BgL,GAAO6kF,EAAM7mE,EAAIhpB,IAEnB,OAAOgL,EAGT,SAASuhF,EAAcvjE,EAAK63D,EAAOxtB,GAGjC,IAFA,IAAInY,EAAQlyB,EAAI/jB,MAAM47E,EAAOxtB,GACzBzwC,EAAM,GACD5iB,EAAI,EAAGA,EAAIk7C,EAAM12C,OAAQxE,GAAK,EACrC4iB,GAAOzL,OAAOmO,aAAa41B,EAAMl7C,GAAoB,IAAfk7C,EAAMl7C,EAAI,IAElD,OAAO4iB,EA0CT,SAASktE,EAAa/C,EAAQjlB,EAAKtjE,GACjC,GAAKuoF,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAI7zE,WAAW,sBAC3D,GAAI6zE,EAASjlB,EAAMtjE,EAAQ,MAAM,IAAI0U,WAAW,yCA+JlD,SAAS62E,EAAU/mE,EAAK/nB,EAAO8rF,EAAQjlB,EAAKvP,EAAKnR,GAC/C,IAAKsvB,EAAOgV,SAAS1iE,GAAM,MAAM,IAAI5kB,UAAU,+CAC/C,GAAInD,EAAQs3D,GAAOt3D,EAAQmmD,EAAK,MAAM,IAAIluC,WAAW,qCACrD,GAAI6zE,EAASjlB,EAAM9+C,EAAIxkB,OAAQ,MAAM,IAAI0U,WAAW,sBAkDtD,SAAS82E,EAAmBhnE,EAAK/nB,EAAO8rF,EAAQkD,GAC1ChvF,EAAQ,IAAGA,EAAQ,MAASA,EAAQ,GACxC,IAAK,IAAIjB,EAAI,EAAG4f,EAAI7K,KAAKqyC,IAAIp+B,EAAIxkB,OAASuoF,EAAQ,GAAI/sF,EAAI4f,IAAK5f,EAC7DgpB,EAAI+jE,EAAS/sF,IAAMiB,EAAS,KAAS,GAAKgvF,EAAejwF,EAAI,EAAIA,MAClC,GAA5BiwF,EAAejwF,EAAI,EAAIA,GA8B9B,SAASkwF,EAAmBlnE,EAAK/nB,EAAO8rF,EAAQkD,GAC1ChvF,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5C,IAAK,IAAIjB,EAAI,EAAG4f,EAAI7K,KAAKqyC,IAAIp+B,EAAIxkB,OAASuoF,EAAQ,GAAI/sF,EAAI4f,IAAK5f,EAC7DgpB,EAAI+jE,EAAS/sF,GAAMiB,IAAuC,GAA5BgvF,EAAejwF,EAAI,EAAIA,GAAU,IAmJnE,SAASmwF,EAAcnnE,EAAK/nB,EAAO8rF,EAAQjlB,EAAKvP,EAAKnR,GACnD,GAAI2lC,EAASjlB,EAAM9+C,EAAIxkB,OAAQ,MAAM,IAAI0U,WAAW,sBACpD,GAAI6zE,EAAS,EAAG,MAAM,IAAI7zE,WAAW,sBAGvC,SAASk3E,EAAYpnE,EAAK/nB,EAAO8rF,EAAQkD,EAAcI,GAKrD,OAJKA,GACHF,EAAannE,EAAK/nB,EAAO8rF,EAAQ,GAEnChC,EAAQv3C,MAAMxqB,EAAK/nB,EAAO8rF,EAAQkD,EAAc,GAAI,GAC7ClD,EAAS,EAWlB,SAASuD,EAAatnE,EAAK/nB,EAAO8rF,EAAQkD,EAAcI,GAKtD,OAJKA,GACHF,EAAannE,EAAK/nB,EAAO8rF,EAAQ,GAEnChC,EAAQv3C,MAAMxqB,EAAK/nB,EAAO8rF,EAAQkD,EAAc,GAAI,GAC7ClD,EAAS,EA/clBrW,EAAO90E,UAAUqD,MAAQ,SAAgB47E,EAAOxtB,GAC9C,IAoBIk9B,EApBAjqF,EAAM6B,KAAK3D,OAqBf,IApBAq8E,IAAUA,GAGE,GACVA,GAASv6E,GACG,IAAGu6E,EAAQ,GACdA,EAAQv6E,IACjBu6E,EAAQv6E,IANV+sD,OAAc1kD,IAAR0kD,EAAoB/sD,IAAQ+sD,GASxB,GACRA,GAAO/sD,GACG,IAAG+sD,EAAM,GACVA,EAAM/sD,IACf+sD,EAAM/sD,GAGJ+sD,EAAMwtB,IAAOxtB,EAAMwtB,GAGnBnK,EAAOuU,qBACTsF,EAASpoF,KAAKwmF,SAAS9N,EAAOxtB,IACvB5qD,UAAYiuE,EAAO90E,cACrB,CACL,IAAI4uF,EAAWn9B,EAAMwtB,EACrB0P,EAAS,IAAI7Z,EAAO8Z,OAAU7hF,GAC9B,IAAK,IAAI3O,EAAI,EAAGA,EAAIwwF,IAAYxwF,EAC9BuwF,EAAOvwF,GAAKmI,KAAKnI,EAAI6gF,GAIzB,OAAO0P,GAWT7Z,EAAO90E,UAAU6uF,WAAa,SAAqB1D,EAAQzzC,EAAY+2C,GACrEtD,GAAkB,EAClBzzC,GAA0B,EACrB+2C,GAAUP,EAAY/C,EAAQzzC,EAAYnxC,KAAK3D,QAKpD,IAHA,IAAIyV,EAAM9R,KAAK4kF,GACX2D,EAAM,EACN1wF,EAAI,IACCA,EAAIs5C,IAAeo3C,GAAO,MACjCz2E,GAAO9R,KAAK4kF,EAAS/sF,GAAK0wF,EAG5B,OAAOz2E,GAGTy8D,EAAO90E,UAAU+uF,WAAa,SAAqB5D,EAAQzzC,EAAY+2C,GACrEtD,GAAkB,EAClBzzC,GAA0B,EACrB+2C,GACHP,EAAY/C,EAAQzzC,EAAYnxC,KAAK3D,QAKvC,IAFA,IAAIyV,EAAM9R,KAAK4kF,IAAWzzC,GACtBo3C,EAAM,EACHp3C,EAAa,IAAMo3C,GAAO,MAC/Bz2E,GAAO9R,KAAK4kF,IAAWzzC,GAAco3C,EAGvC,OAAOz2E,GAGTy8D,EAAO90E,UAAUgvF,UAAY,SAAoB7D,EAAQsD,GAEvD,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpC2D,KAAK4kF,IAGdrW,EAAO90E,UAAUivF,aAAe,SAAuB9D,EAAQsD,GAE7D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpC2D,KAAK4kF,GAAW5kF,KAAK4kF,EAAS,IAAM,GAG7CrW,EAAO90E,UAAUgrF,aAAe,SAAuBG,EAAQsD,GAE7D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACnC2D,KAAK4kF,IAAW,EAAK5kF,KAAK4kF,EAAS,IAG7CrW,EAAO90E,UAAUkvF,aAAe,SAAuB/D,EAAQsD,GAG7D,OAFKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,SAElC2D,KAAK4kF,GACT5kF,KAAK4kF,EAAS,IAAM,EACpB5kF,KAAK4kF,EAAS,IAAM,IACD,SAAnB5kF,KAAK4kF,EAAS,IAGrBrW,EAAO90E,UAAUmvF,aAAe,SAAuBhE,EAAQsD,GAG7D,OAFKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QAEpB,SAAf2D,KAAK4kF,IACT5kF,KAAK4kF,EAAS,IAAM,GACrB5kF,KAAK4kF,EAAS,IAAM,EACrB5kF,KAAK4kF,EAAS,KAGlBrW,EAAO90E,UAAUovF,UAAY,SAAoBjE,EAAQzzC,EAAY+2C,GACnEtD,GAAkB,EAClBzzC,GAA0B,EACrB+2C,GAAUP,EAAY/C,EAAQzzC,EAAYnxC,KAAK3D,QAKpD,IAHA,IAAIyV,EAAM9R,KAAK4kF,GACX2D,EAAM,EACN1wF,EAAI,IACCA,EAAIs5C,IAAeo3C,GAAO,MACjCz2E,GAAO9R,KAAK4kF,EAAS/sF,GAAK0wF,EAM5B,OAFIz2E,IAFJy2E,GAAO,OAESz2E,GAAOlF,KAAKk8E,IAAI,EAAG,EAAI33C,IAEhCr/B,GAGTy8D,EAAO90E,UAAUsvF,UAAY,SAAoBnE,EAAQzzC,EAAY+2C,GACnEtD,GAAkB,EAClBzzC,GAA0B,EACrB+2C,GAAUP,EAAY/C,EAAQzzC,EAAYnxC,KAAK3D,QAKpD,IAHA,IAAIxE,EAAIs5C,EACJo3C,EAAM,EACNz2E,EAAM9R,KAAK4kF,IAAW/sF,GACnBA,EAAI,IAAM0wF,GAAO,MACtBz2E,GAAO9R,KAAK4kF,IAAW/sF,GAAK0wF,EAM9B,OAFIz2E,IAFJy2E,GAAO,OAESz2E,GAAOlF,KAAKk8E,IAAI,EAAG,EAAI33C,IAEhCr/B,GAGTy8D,EAAO90E,UAAUuvF,SAAW,SAAmBpE,EAAQsD,GAErD,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACtB,IAAf2D,KAAK4kF,IAC0B,GAA5B,IAAO5kF,KAAK4kF,GAAU,GADK5kF,KAAK4kF,IAI3CrW,EAAO90E,UAAUwvF,YAAc,SAAsBrE,EAAQsD,GACtDA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QAC3C,IAAIyV,EAAM9R,KAAK4kF,GAAW5kF,KAAK4kF,EAAS,IAAM,EAC9C,OAAc,MAAN9yE,EAAsB,WAANA,EAAmBA,GAG7Cy8D,EAAO90E,UAAUyvF,YAAc,SAAsBtE,EAAQsD,GACtDA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QAC3C,IAAIyV,EAAM9R,KAAK4kF,EAAS,GAAM5kF,KAAK4kF,IAAW,EAC9C,OAAc,MAAN9yE,EAAsB,WAANA,EAAmBA,GAG7Cy8D,EAAO90E,UAAU0vF,YAAc,SAAsBvE,EAAQsD,GAG3D,OAFKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QAEnC2D,KAAK4kF,GACV5kF,KAAK4kF,EAAS,IAAM,EACpB5kF,KAAK4kF,EAAS,IAAM,GACpB5kF,KAAK4kF,EAAS,IAAM,IAGzBrW,EAAO90E,UAAU2vF,YAAc,SAAsBxE,EAAQsD,GAG3D,OAFKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QAEnC2D,KAAK4kF,IAAW,GACrB5kF,KAAK4kF,EAAS,IAAM,GACpB5kF,KAAK4kF,EAAS,IAAM,EACpB5kF,KAAK4kF,EAAS,IAGnBrW,EAAO90E,UAAU4vF,YAAc,SAAsBzE,EAAQsD,GAE3D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpCumF,EAAQhiE,KAAK5gB,KAAM4kF,GAAQ,EAAM,GAAI,IAG9CrW,EAAO90E,UAAU6vF,YAAc,SAAsB1E,EAAQsD,GAE3D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpCumF,EAAQhiE,KAAK5gB,KAAM4kF,GAAQ,EAAO,GAAI,IAG/CrW,EAAO90E,UAAU8vF,aAAe,SAAuB3E,EAAQsD,GAE7D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpCumF,EAAQhiE,KAAK5gB,KAAM4kF,GAAQ,EAAM,GAAI,IAG9CrW,EAAO90E,UAAU+vF,aAAe,SAAuB5E,EAAQsD,GAE7D,OADKA,GAAUP,EAAY/C,EAAQ,EAAG5kF,KAAK3D,QACpCumF,EAAQhiE,KAAK5gB,KAAM4kF,GAAQ,EAAO,GAAI,IAS/CrW,EAAO90E,UAAUgwF,YAAc,SAAsB3wF,EAAO8rF,EAAQzzC,EAAY+2C,IAC9EpvF,GAASA,EACT8rF,GAAkB,EAClBzzC,GAA0B,EACrB+2C,IAEHN,EAAS5nF,KAAMlH,EAAO8rF,EAAQzzC,EADfvkC,KAAKk8E,IAAI,EAAG,EAAI33C,GAAc,EACO,GAGtD,IAAIo3C,EAAM,EACN1wF,EAAI,EAER,IADAmI,KAAK4kF,GAAkB,IAAR9rF,IACNjB,EAAIs5C,IAAeo3C,GAAO,MACjCvoF,KAAK4kF,EAAS/sF,GAAMiB,EAAQyvF,EAAO,IAGrC,OAAO3D,EAASzzC,GAGlBo9B,EAAO90E,UAAUiwF,YAAc,SAAsB5wF,EAAO8rF,EAAQzzC,EAAY+2C,IAC9EpvF,GAASA,EACT8rF,GAAkB,EAClBzzC,GAA0B,EACrB+2C,IAEHN,EAAS5nF,KAAMlH,EAAO8rF,EAAQzzC,EADfvkC,KAAKk8E,IAAI,EAAG,EAAI33C,GAAc,EACO,GAGtD,IAAIt5C,EAAIs5C,EAAa,EACjBo3C,EAAM,EAEV,IADAvoF,KAAK4kF,EAAS/sF,GAAa,IAARiB,IACVjB,GAAK,IAAM0wF,GAAO,MACzBvoF,KAAK4kF,EAAS/sF,GAAMiB,EAAQyvF,EAAO,IAGrC,OAAO3D,EAASzzC,GAGlBo9B,EAAO90E,UAAUkwF,WAAa,SAAqB7wF,EAAO8rF,EAAQsD,GAMhE,OALApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,IAAM,GACjDrW,EAAOuU,sBAAqBhqF,EAAQ8T,KAAKg9E,MAAM9wF,IACpDkH,KAAK4kF,GAAmB,IAAR9rF,EACT8rF,EAAS,GAWlBrW,EAAO90E,UAAUowF,cAAgB,SAAwB/wF,EAAO8rF,EAAQsD,GAUtE,OATApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,MAAQ,GACpDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAmB,IAAR9rF,EAChBkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAE9B+uF,EAAkB7nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAUqwF,cAAgB,SAAwBhxF,EAAO8rF,EAAQsD,GAUtE,OATApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,MAAQ,GACpDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAW9rF,IAAU,EAC1BkH,KAAK4kF,EAAS,GAAc,IAAR9rF,GAEpB+uF,EAAkB7nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAUlBrW,EAAO90E,UAAUswF,cAAgB,SAAwBjxF,EAAO8rF,EAAQsD,GAYtE,OAXApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,WAAY,GACxDrW,EAAOuU,qBACT9iF,KAAK4kF,EAAS,GAAM9rF,IAAU,GAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,EAC9BkH,KAAK4kF,GAAmB,IAAR9rF,GAEhBivF,EAAkB/nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAUuwF,cAAgB,SAAwBlxF,EAAO8rF,EAAQsD,GAYtE,OAXApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,WAAY,GACxDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAW9rF,IAAU,GAC1BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,EAC9BkH,KAAK4kF,EAAS,GAAc,IAAR9rF,GAEpBivF,EAAkB/nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAUwwF,WAAa,SAAqBnxF,EAAO8rF,EAAQzzC,EAAY+2C,GAG5E,GAFApvF,GAASA,EACT8rF,GAAkB,GACbsD,EAAU,CACb,IAAIlvE,EAAQpM,KAAKk8E,IAAI,EAAG,EAAI33C,EAAa,GAEzCy2C,EAAS5nF,KAAMlH,EAAO8rF,EAAQzzC,EAAYn4B,EAAQ,GAAIA,GAGxD,IAAInhB,EAAI,EACJ0wF,EAAM,EACN2B,EAAM,EAEV,IADAlqF,KAAK4kF,GAAkB,IAAR9rF,IACNjB,EAAIs5C,IAAeo3C,GAAO,MAC7BzvF,EAAQ,GAAa,IAARoxF,GAAsC,IAAzBlqF,KAAK4kF,EAAS/sF,EAAI,KAC9CqyF,EAAM,GAERlqF,KAAK4kF,EAAS/sF,IAAOiB,EAAQyvF,GAAQ,GAAK2B,EAAM,IAGlD,OAAOtF,EAASzzC,GAGlBo9B,EAAO90E,UAAU0wF,WAAa,SAAqBrxF,EAAO8rF,EAAQzzC,EAAY+2C,GAG5E,GAFApvF,GAASA,EACT8rF,GAAkB,GACbsD,EAAU,CACb,IAAIlvE,EAAQpM,KAAKk8E,IAAI,EAAG,EAAI33C,EAAa,GAEzCy2C,EAAS5nF,KAAMlH,EAAO8rF,EAAQzzC,EAAYn4B,EAAQ,GAAIA,GAGxD,IAAInhB,EAAIs5C,EAAa,EACjBo3C,EAAM,EACN2B,EAAM,EAEV,IADAlqF,KAAK4kF,EAAS/sF,GAAa,IAARiB,IACVjB,GAAK,IAAM0wF,GAAO,MACrBzvF,EAAQ,GAAa,IAARoxF,GAAsC,IAAzBlqF,KAAK4kF,EAAS/sF,EAAI,KAC9CqyF,EAAM,GAERlqF,KAAK4kF,EAAS/sF,IAAOiB,EAAQyvF,GAAQ,GAAK2B,EAAM,IAGlD,OAAOtF,EAASzzC,GAGlBo9B,EAAO90E,UAAU2wF,UAAY,SAAoBtxF,EAAO8rF,EAAQsD,GAO9D,OANApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,KAAO,KAClDrW,EAAOuU,sBAAqBhqF,EAAQ8T,KAAKg9E,MAAM9wF,IAChDA,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCkH,KAAK4kF,GAAmB,IAAR9rF,EACT8rF,EAAS,GAGlBrW,EAAO90E,UAAU4wF,aAAe,SAAuBvxF,EAAO8rF,EAAQsD,GAUpE,OATApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,OAAS,OACrDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAmB,IAAR9rF,EAChBkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAE9B+uF,EAAkB7nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAU6wF,aAAe,SAAuBxxF,EAAO8rF,EAAQsD,GAUpE,OATApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,OAAS,OACrDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAW9rF,IAAU,EAC1BkH,KAAK4kF,EAAS,GAAc,IAAR9rF,GAEpB+uF,EAAkB7nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAU8wF,aAAe,SAAuBzxF,EAAO8rF,EAAQsD,GAYpE,OAXApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,YAAa,YACzDrW,EAAOuU,qBACT9iF,KAAK4kF,GAAmB,IAAR9rF,EAChBkH,KAAK4kF,EAAS,GAAM9rF,IAAU,EAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,IAE9BivF,EAAkB/nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAGlBrW,EAAO90E,UAAU+wF,aAAe,SAAuB1xF,EAAO8rF,EAAQsD,GAapE,OAZApvF,GAASA,EACT8rF,GAAkB,EACbsD,GAAUN,EAAS5nF,KAAMlH,EAAO8rF,EAAQ,EAAG,YAAa,YACzD9rF,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GACxCy1E,EAAOuU,qBACT9iF,KAAK4kF,GAAW9rF,IAAU,GAC1BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,GAC9BkH,KAAK4kF,EAAS,GAAM9rF,IAAU,EAC9BkH,KAAK4kF,EAAS,GAAc,IAAR9rF,GAEpBivF,EAAkB/nF,KAAMlH,EAAO8rF,GAAQ,GAElCA,EAAS,GAgBlBrW,EAAO90E,UAAUgxF,aAAe,SAAuB3xF,EAAO8rF,EAAQsD,GACpE,OAAOD,EAAWjoF,KAAMlH,EAAO8rF,GAAQ,EAAMsD,IAG/C3Z,EAAO90E,UAAUixF,aAAe,SAAuB5xF,EAAO8rF,EAAQsD,GACpE,OAAOD,EAAWjoF,KAAMlH,EAAO8rF,GAAQ,EAAOsD,IAWhD3Z,EAAO90E,UAAUkxF,cAAgB,SAAwB7xF,EAAO8rF,EAAQsD,GACtE,OAAOC,EAAYnoF,KAAMlH,EAAO8rF,GAAQ,EAAMsD,IAGhD3Z,EAAO90E,UAAUmxF,cAAgB,SAAwB9xF,EAAO8rF,EAAQsD,GACtE,OAAOC,EAAYnoF,KAAMlH,EAAO8rF,GAAQ,EAAOsD,IAIjD3Z,EAAO90E,UAAUse,KAAO,SAAe5b,EAAQ0uF,EAAanS,EAAOxtB,GAQjE,GAPKwtB,IAAOA,EAAQ,GACfxtB,GAAe,IAARA,IAAWA,EAAMlrD,KAAK3D,QAC9BwuF,GAAe1uF,EAAOE,SAAQwuF,EAAc1uF,EAAOE,QAClDwuF,IAAaA,EAAc,GAC5B3/B,EAAM,GAAKA,EAAMwtB,IAAOxtB,EAAMwtB,GAG9BxtB,IAAQwtB,EAAO,OAAO,EAC1B,GAAsB,IAAlBv8E,EAAOE,QAAgC,IAAhB2D,KAAK3D,OAAc,OAAO,EAGrD,GAAIwuF,EAAc,EAChB,MAAM,IAAI95E,WAAW,6BAEvB,GAAI2nE,EAAQ,GAAKA,GAAS14E,KAAK3D,OAAQ,MAAM,IAAI0U,WAAW,6BAC5D,GAAIm6C,EAAM,EAAG,MAAM,IAAIn6C,WAAW,2BAG9Bm6C,EAAMlrD,KAAK3D,SAAQ6uD,EAAMlrD,KAAK3D,QAC9BF,EAAOE,OAASwuF,EAAc3/B,EAAMwtB,IACtCxtB,EAAM/uD,EAAOE,OAASwuF,EAAcnS,GAGtC,IACI7gF,EADAsG,EAAM+sD,EAAMwtB,EAGhB,GAAI14E,OAAS7D,GAAUu8E,EAAQmS,GAAeA,EAAc3/B,EAE1D,IAAKrzD,EAAIsG,EAAM,EAAGtG,GAAK,IAAKA,EAC1BsE,EAAOtE,EAAIgzF,GAAe7qF,KAAKnI,EAAI6gF,QAEhC,GAAIv6E,EAAM,MAASowE,EAAOuU,oBAE/B,IAAKjrF,EAAI,EAAGA,EAAIsG,IAAOtG,EACrBsE,EAAOtE,EAAIgzF,GAAe7qF,KAAKnI,EAAI6gF,QAGrCxnC,WAAWz3C,UAAU8W,IAAIvY,KACvBmE,EACA6D,KAAKwmF,SAAS9N,EAAOA,EAAQv6E,GAC7B0sF,GAIJ,OAAO1sF,GAOTowE,EAAO90E,UAAUotF,KAAO,SAAe/0E,EAAK4mE,EAAOxtB,EAAK9sC,GAEtD,GAAmB,iBAARtM,EAAkB,CAS3B,GARqB,iBAAV4mE,GACTt6D,EAAWs6D,EACXA,EAAQ,EACRxtB,EAAMlrD,KAAK3D,QACa,iBAAR6uD,IAChB9sC,EAAW8sC,EACXA,EAAMlrD,KAAK3D,QAEM,IAAfyV,EAAIzV,OAAc,CACpB,IAAIsV,EAAOG,EAAIoL,WAAW,GACtBvL,EAAO,MACTG,EAAMH,GAGV,QAAiBnL,IAAb4X,GAA8C,iBAAbA,EACnC,MAAM,IAAIniB,UAAU,6BAEtB,GAAwB,iBAAbmiB,IAA0BmwD,EAAO8U,WAAWjlE,GACrD,MAAM,IAAIniB,UAAU,qBAAuBmiB,OAErB,iBAARtM,IAChBA,GAAY,KAId,GAAI4mE,EAAQ,GAAK14E,KAAK3D,OAASq8E,GAAS14E,KAAK3D,OAAS6uD,EACpD,MAAM,IAAIn6C,WAAW,sBAGvB,GAAIm6C,GAAOwtB,EACT,OAAO14E,KAQT,IAAInI,EACJ,GANA6gF,KAAkB,EAClBxtB,OAAc1kD,IAAR0kD,EAAoBlrD,KAAK3D,OAAS6uD,IAAQ,EAE3Cp5C,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKja,EAAI6gF,EAAO7gF,EAAIqzD,IAAOrzD,EACzBmI,KAAKnI,GAAKia,MAEP,CACL,IAAIihC,EAAQw7B,EAAOgV,SAASzxE,GACxBA,EACA8xE,EAAY,IAAIrV,EAAOz8D,EAAKsM,GAAUvW,YACtC1J,EAAM40C,EAAM12C,OAChB,IAAKxE,EAAI,EAAGA,EAAIqzD,EAAMwtB,IAAS7gF,EAC7BmI,KAAKnI,EAAI6gF,GAAS3lC,EAAMl7C,EAAIsG,GAIhC,OAAO6B,MAMT,IAAI8qF,EAAoB,qBAmBxB,SAASpD,EAAOpuF,GACd,OAAIA,EAAI,GAAW,IAAMA,EAAEuO,SAAS,IAC7BvO,EAAEuO,SAAS,IAGpB,SAAS+7E,EAAarjF,EAAQglF,GAE5B,IAAIU,EADJV,EAAQA,GAAS3rC,IAMjB,IAJA,IAAIv9C,EAASkE,EAAOlE,OAChB0uF,EAAgB,KAChBh4C,EAAQ,GAEHl7C,EAAI,EAAGA,EAAIwE,IAAUxE,EAAG,CAI/B,IAHAouF,EAAY1lF,EAAO2c,WAAWrlB,IAGd,OAAUouF,EAAY,MAAQ,CAE5C,IAAK8E,EAAe,CAElB,GAAI9E,EAAY,MAAQ,EAEjBV,GAAS,IAAM,GAAGxyC,EAAMxxC,KAAK,IAAM,IAAM,KAC9C,SACK,GAAI1J,EAAI,IAAMwE,EAAQ,EAEtBkpF,GAAS,IAAM,GAAGxyC,EAAMxxC,KAAK,IAAM,IAAM,KAC9C,SAIFwpF,EAAgB9E,EAEhB,SAIF,GAAIA,EAAY,MAAQ,EACjBV,GAAS,IAAM,GAAGxyC,EAAMxxC,KAAK,IAAM,IAAM,KAC9CwpF,EAAgB9E,EAChB,SAIFA,EAAkE,OAArD8E,EAAgB,OAAU,GAAK9E,EAAY,YAC/C8E,IAEJxF,GAAS,IAAM,GAAGxyC,EAAMxxC,KAAK,IAAM,IAAM,KAMhD,GAHAwpF,EAAgB,KAGZ9E,EAAY,IAAM,CACpB,IAAKV,GAAS,GAAK,EAAG,MACtBxyC,EAAMxxC,KAAK0kF,QACN,GAAIA,EAAY,KAAO,CAC5B,IAAKV,GAAS,GAAK,EAAG,MACtBxyC,EAAMxxC,KACJ0kF,GAAa,EAAM,IACP,GAAZA,EAAmB,UAEhB,GAAIA,EAAY,MAAS,CAC9B,IAAKV,GAAS,GAAK,EAAG,MACtBxyC,EAAMxxC,KACJ0kF,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,SAEhB,MAAIA,EAAY,SASrB,MAAM,IAAIpmF,MAAM,sBARhB,IAAK0lF,GAAS,GAAK,EAAG,MACtBxyC,EAAMxxC,KACJ0kF,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,MAOzB,OAAOlzC,EA4BT,SAAS8wC,EAAe9jF,GACtB,OAAO4iF,EAAOqI,YAhIhB,SAAsBjrF,GAIpB,IAFAA,EAUF,SAAqBA,GACnB,OAAIA,EAAIe,KAAaf,EAAIe,OAClBf,EAAIhC,QAAQ,aAAc,IAZ3BktF,CAAWlrF,GAAKhC,QAAQ+sF,EAAmB,KAEzCzuF,OAAS,EAAG,MAAO,GAE3B,KAAO0D,EAAI1D,OAAS,GAAM,GACxB0D,GAAY,IAEd,OAAOA,EAuHmBmrF,CAAYnrF,IAGxC,SAASilF,EAAYz/B,EAAK4lC,EAAKvG,EAAQvoF,GACrC,IAAK,IAAIxE,EAAI,EAAGA,EAAIwE,KACbxE,EAAI+sF,GAAUuG,EAAI9uF,QAAYxE,GAAK0tD,EAAIlpD,UADhBxE,EAE5BszF,EAAItzF,EAAI+sF,GAAUr/B,EAAI1tD,GAExB,OAAOA,K,+CCrvDTV,EAAQg6C,WAuCR,SAAqBi6C,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,GA1ClDr0F,EAAQ6zF,YAiDR,SAAsBI,GACpB,IAAIr6B,EAcAl5D,EAbAwzF,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBthF,EAAM,IAAI0hF,EAVhB,SAAsBL,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,EAS9BE,CAAYN,EAAKG,EAAUC,IAEzCG,EAAU,EAGVxtF,EAAMqtF,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAK1zF,EAAI,EAAGA,EAAIsG,EAAKtG,GAAK,EACxBk5D,EACG66B,EAAUR,EAAIluE,WAAWrlB,KAAO,GAChC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,KAAO,GACpC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,KAAO,EACrC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,IAC/BkS,EAAI4hF,KAAc56B,GAAO,GAAM,IAC/BhnD,EAAI4hF,KAAc56B,GAAO,EAAK,IAC9BhnD,EAAI4hF,KAAmB,IAAN56B,EAGK,IAApBy6B,IACFz6B,EACG66B,EAAUR,EAAIluE,WAAWrlB,KAAO,EAChC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,KAAO,EACvCkS,EAAI4hF,KAAmB,IAAN56B,GAGK,IAApBy6B,IACFz6B,EACG66B,EAAUR,EAAIluE,WAAWrlB,KAAO,GAChC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,KAAO,EACpC+zF,EAAUR,EAAIluE,WAAWrlB,EAAI,KAAO,EACvCkS,EAAI4hF,KAAc56B,GAAO,EAAK,IAC9BhnD,EAAI4hF,KAAmB,IAAN56B,GAGnB,OAAOhnD,GA3FT5S,EAAQwuF,cAkHR,SAAwBkG,GAQtB,IAPA,IAAI96B,EACA5yD,EAAM0tF,EAAMxvF,OACZyvF,EAAa3tF,EAAM,EACnBmc,EAAQ,GAIHziB,EAAI,EAAGg2C,EAAO1vC,EAAM2tF,EAAYj0F,EAAIg2C,EAAMh2C,GAH9B,MAInByiB,EAAM/Y,KAAKwqF,EAAYF,EAAOh0F,EAAIA,EAJf,MAIqCg2C,EAAOA,EAAQh2C,EAJpD,QAQF,IAAfi0F,GACF/6B,EAAM86B,EAAM1tF,EAAM,GAClBmc,EAAM/Y,KACJuhC,EAAOiuB,GAAO,GACdjuB,EAAQiuB,GAAO,EAAK,IACpB,OAEsB,IAAf+6B,IACT/6B,GAAO86B,EAAM1tF,EAAM,IAAM,GAAK0tF,EAAM1tF,EAAM,GAC1Cmc,EAAM/Y,KACJuhC,EAAOiuB,GAAO,IACdjuB,EAAQiuB,GAAO,EAAK,IACpBjuB,EAAQiuB,GAAO,EAAK,IACpB,MAIJ,OAAOz2C,EAAMld,KAAK,KAzIpB,IALA,IAAI0lC,EAAS,GACT8oD,EAAY,GACZH,EAA4B,oBAAfv6C,WAA6BA,WAAaviC,MAEvDgD,EAAO,mEACF9Z,EAAI,EAAGsG,EAAMwT,EAAKtV,OAAQxE,EAAIsG,IAAOtG,EAC5CirC,EAAOjrC,GAAK8Z,EAAK9Z,GACjB+zF,EAAUj6E,EAAKuL,WAAWrlB,IAAMA,EAQlC,SAASyzF,EAASF,GAChB,IAAIjtF,EAAMitF,EAAI/uF,OAEd,GAAI8B,EAAM,EAAI,EACZ,MAAM,IAAI0B,MAAM,kDAKlB,IAAI0rF,EAAWH,EAAIvuF,QAAQ,KAO3B,OANkB,IAAd0uF,IAAiBA,EAAWptF,GAMzB,CAACotF,EAJcA,IAAaptF,EAC/B,EACA,EAAKotF,EAAW,GAsEtB,SAASQ,EAAaF,EAAOnT,EAAOxtB,GAGlC,IAFA,IAAI6F,EARoBi7B,EASpBnlF,EAAS,GACJhP,EAAI6gF,EAAO7gF,EAAIqzD,EAAKrzD,GAAK,EAChCk5D,GACI86B,EAAMh0F,IAAM,GAAM,WAClBg0F,EAAMh0F,EAAI,IAAM,EAAK,QACP,IAAfg0F,EAAMh0F,EAAI,IACbgP,EAAOtF,KAdFuhC,GADiBkpD,EAeMj7B,IAdT,GAAK,IACxBjuB,EAAOkpD,GAAO,GAAK,IACnBlpD,EAAOkpD,GAAO,EAAI,IAClBlpD,EAAa,GAANkpD,IAaT,OAAOnlF,EAAOzJ,KAAK,IAjGrBwuF,EAAU,IAAI1uE,WAAW,IAAM,GAC/B0uE,EAAU,IAAI1uE,WAAW,IAAM,I;;AClB/B/lB,EAAQypB,KAAO,SAAUwwB,EAAQwzC,EAAQqH,EAAMC,EAAMC,GACnD,IAAIzkF,EAAGzP,EACHm0F,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACT10F,EAAIo0F,EAAQE,EAAS,EAAK,EAC1Bh0F,EAAI8zF,GAAQ,EAAI,EAChBryF,EAAIw3C,EAAOwzC,EAAS/sF,GAOxB,IALAA,GAAKM,EAELuP,EAAI9N,GAAM,IAAO2yF,GAAU,EAC3B3yF,KAAQ2yF,EACRA,GAASH,EACFG,EAAQ,EAAG7kF,EAAS,IAAJA,EAAW0pC,EAAOwzC,EAAS/sF,GAAIA,GAAKM,EAAGo0F,GAAS,GAKvE,IAHAt0F,EAAIyP,GAAM,IAAO6kF,GAAU,EAC3B7kF,KAAQ6kF,EACRA,GAASL,EACFK,EAAQ,EAAGt0F,EAAS,IAAJA,EAAWm5C,EAAOwzC,EAAS/sF,GAAIA,GAAKM,EAAGo0F,GAAS,GAEvE,GAAU,IAAN7kF,EACFA,EAAI,EAAI4kF,MACH,IAAI5kF,IAAM2kF,EACf,OAAOp0F,EAAIu0F,IAAsB5yC,KAAdhgD,GAAK,EAAI,GAE5B3B,GAAQ2U,KAAKk8E,IAAI,EAAGoD,GACpBxkF,GAAQ4kF,EAEV,OAAQ1yF,GAAK,EAAI,GAAK3B,EAAI2U,KAAKk8E,IAAI,EAAGphF,EAAIwkF,IAG5C/0F,EAAQk0C,MAAQ,SAAU+F,EAAQt4C,EAAO8rF,EAAQqH,EAAMC,EAAMC,GAC3D,IAAIzkF,EAAGzP,EAAGC,EACNk0F,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBI,EAAe,KAATP,EAAct/E,KAAKk8E,IAAI,GAAI,IAAMl8E,KAAKk8E,IAAI,GAAI,IAAM,EAC1DjxF,EAAIo0F,EAAO,EAAKE,EAAS,EACzBh0F,EAAI8zF,EAAO,GAAK,EAChBryF,EAAId,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQ8T,KAAKC,IAAI/T,GAEbuW,MAAMvW,IAAUA,IAAU8gD,KAC5B3hD,EAAIoX,MAAMvW,GAAS,EAAI,EACvB4O,EAAI2kF,IAEJ3kF,EAAIkF,KAAKg9E,MAAMh9E,KAAKvR,IAAIvC,GAAS8T,KAAK8/E,KAClC5zF,GAASZ,EAAI0U,KAAKk8E,IAAI,GAAIphF,IAAM,IAClCA,IACAxP,GAAK,IAGLY,GADE4O,EAAI4kF,GAAS,EACNG,EAAKv0F,EAELu0F,EAAK7/E,KAAKk8E,IAAI,EAAG,EAAIwD,IAEpBp0F,GAAK,IACfwP,IACAxP,GAAK,GAGHwP,EAAI4kF,GAASD,GACfp0F,EAAI,EACJyP,EAAI2kF,GACK3kF,EAAI4kF,GAAS,GACtBr0F,GAAMa,EAAQZ,EAAK,GAAK0U,KAAKk8E,IAAI,EAAGoD,GACpCxkF,GAAQ4kF,IAERr0F,EAAIa,EAAQ8T,KAAKk8E,IAAI,EAAGwD,EAAQ,GAAK1/E,KAAKk8E,IAAI,EAAGoD,GACjDxkF,EAAI,IAIDwkF,GAAQ,EAAG96C,EAAOwzC,EAAS/sF,GAAS,IAAJI,EAAUJ,GAAKM,EAAGF,GAAK,IAAKi0F,GAAQ,GAI3E,IAFAxkF,EAAKA,GAAKwkF,EAAQj0F,EAClBm0F,GAAQF,EACDE,EAAO,EAAGh7C,EAAOwzC,EAAS/sF,GAAS,IAAJ6P,EAAU7P,GAAKM,EAAGuP,GAAK,IAAK0kF,GAAQ,GAE1Eh7C,EAAOwzC,EAAS/sF,EAAIM,IAAU,IAAJyB,I,cCnF5B,IAAIiO,EAAW,GAAGA,SAElBzQ,EAAOD,QAAUwX,MAAMD,SAAW,SAAU3E,GAC1C,MAA6B,kBAAtBlC,EAAS7P,KAAK+R,K,6BCHvB,8DAKA,IAAI4iF,EAAkB,EAGP,MAAM7yD,EACnB,YAAYt3B,GACVxC,KAAK4sF,cAAgB,GACrB5sF,KAAK4kC,OAAS,KAGdpiC,EAAUA,GAAW,GACrBxC,KAAK6sF,SAASrqF,EAAQipD,SACtBjpD,EAAQtL,SAAW41F,EAAgB9sF,KAAMwC,EAAQtL,SAGjD,MAAMk0D,EAAoC,iBAAnB5oD,EAAQ4oD,OAClB5oD,EAAQ4oD,OAAOttD,MAAM,QAAQ,GAAG4F,cAAgB,GACzDqpF,EAAW,SAASjpF,KAAKsnD,GAAS4hC,EAAS,OAAOlpF,KAAKsnD,GACvD6hC,EAAa,SAASnpF,KAAKsnD,GAAS8hC,EAAW,OAAOppF,KAAKsnD,GAC3D+hC,EAAOntF,KAAKgsE,QAAU,KAAKloE,KAAKsnD,GAChCgiC,EAAaH,GAAcC,GACzBltF,KAAKqtF,uBAAyBN,GAAYI,MAC9CntF,KAAKstF,2BAA6BttF,KAAKutF,gBAEzCvtF,KAAKwtF,iBAAmBT,GAAYC,GAAUC,GAAcE,GAE5DntF,KAAKytF,iBAA8B,KAAXriC,GAAiB,WAAWtnD,KAAKsnD,GAErDgiC,IACFptF,KAAK0tF,oBAAsBhuF,GAAgB,MAC7CM,KAAK2tF,iBAAsD,iBAA5BnrF,EAAQmqF,gBAA+B,GAC5CnqF,EAAQmqF,gBAAgB5uF,QAAQ,UAAW,MACrEiC,KAAK4tF,OAASprF,EAAQqrF,OAAS,IAAI,IAAQ,CAAE9hB,SAAUqhB,EAAYnhB,GAAIkhB,IAEvEntF,KAAK8tF,uBAAyBtrF,EAAQurF,oBAMxC,+BACEpB,EAAkB,EAMpB,SAASlhC,GACP,GAAKA,EAIA,CAEH,MAAMuiC,EAAcviC,EAAQ5uD,QAAQ,KAChCmxF,GAAe,IACjBviC,EAAUA,EAAQlvC,OAAO,EAAGyxE,IAE9BhuF,KAAKiuF,MAAQxiC,EACbzrD,KAAKkuF,UAAcziC,EAAQ5uD,QAAQ,KAAO,EAAI4uD,EAC3BA,EAAQ1tD,QAAQ,oBAAqB,IACxD0tD,EAAUA,EAAQ3tD,MAAM,8CACxBkC,KAAKmuF,UAAc1iC,EAAQ,GAC3BzrD,KAAKouF,YAAc3iC,EAAQ,QAd3BzrD,KAAKiuF,MAAQ,GACbjuF,KAAKkuF,UAAY,GAmBrB,aAAapgF,EAAMjD,EAAOxE,EAASC,EAAW/M,GAC5C,MAAM80F,EAASruF,KAAKgsE,QACpBhsE,KAAK4sF,cAAcrrF,KAAK,CACtB8E,QAASA,EAASC,UAAWA,EAAW/M,OAAQA,EAChDsR,MAAOA,EAAOiD,KAAMA,EACpB6nB,UAAS04D,GAASruF,KAAKsuF,kBACvBC,YAAaF,EAASruF,KAAKwuF,UAAU72C,EAAI,GACzC82C,WAAYJ,EAASruF,KAAK0uF,YAAc,OAGtCL,IAEFruF,KAAKsuF,mBAAoB,EAGzBtuF,KAAKwuF,UAAU72C,EAAK33C,KAAK4kC,OAAY5kC,KAAK4kC,OAAOp7B,GAAG+S,OAAO,GAAzB,IAAiC,IAEnEvc,KAAK0uF,YAAcn2F,OAAOY,OAAO6G,KAAK0uF,cAM1C,kBACE,MAAMzlE,EAAUjpB,KAAK4sF,cAAcnoF,MAAO4pF,EAASruF,KAAKgsE,QACxDhsE,KAAKykC,SAAaxb,EAAQ5iB,QAC1BrG,KAAK0kC,WAAazb,EAAQ3iB,UAC1BtG,KAAK2kC,QAAa1b,EAAQ1vB,OAC1ByG,KAAK4kC,OAAa3b,EAAQpe,MAEtBwjF,IACFruF,KAAKsuF,kBAAoBrlE,EAAQ0M,QACjC31B,KAAKwuF,UAAU72C,EAAI1uB,EAAQslE,YAC3BvuF,KAAK0uF,YAAczlE,EAAQwlE,YAK/B,kBAAkBvhB,GAChB,OAAQA,EAAMp/D,MAEd,IAAK,MACH,OAAoB,OAAhB9N,KAAK4kC,OACA5kC,KAAK2uF,OAAO,iBAAkBzhB,WAChCltE,KAAKwuF,UAAU72C,EACf33C,KAAK4uF,UAAU,KAAM,KAAM5uF,KAAKwuF,YAEzC,IAAK,SACHxuF,KAAK6uF,cAAe,EACtB,IAAK,UACH,OAAO7uF,KAAK8uF,YAEd,IAAK,OACH9uF,KAAK6uF,cAAe,EACtB,IAAK,QACH,OAAO7uF,KAAK+uF,aAEd,IAAK,IACH,GAAI/uF,KAAKqtF,qBAGP,OAFArtF,KAAK4kC,OAAS,GACd5kC,KAAKykC,SAAW,KACTzkC,KAAKgvF,aAEhB,IAAK,QACH,GAAIhvF,KAAKqtF,qBACP,OAAOrtF,KAAKivF,qBAEhB,QACE,OAAOjvF,KAAKgvF,aAAa9hB,IAK7B,YAAYA,EAAOgiB,GACjB,IAAIp2F,EACJ,OAAQo0E,EAAMp/D,MAEd,IAAK,MACL,IAAK,UACH,MAAMpO,EAAMM,KAAKmvF,YAAYjiB,EAAMp0E,OACnC,GAAY,OAAR4G,EACF,OAAOM,KAAK2uF,OAAO,cAAezhB,GACpCp0E,EAAQkH,KAAKovF,WAAW1vF,GACxB,MAEF,IAAK,OACL,IAAK,WACH,MAAMka,EAAS5Z,KAAKwuF,UAAUthB,EAAMtzD,QACpC,QAAepT,IAAXoT,EACF,OAAO5Z,KAAK2uF,OAAO,qBAAqBzhB,EAAMtzD,WAAYszD,GAC5Dp0E,EAAQkH,KAAKovF,WAAWx1E,EAASszD,EAAMp0E,OACvC,MAEF,IAAK,QACHA,EAAQkH,KAAKqvF,WAAWrvF,KAAKwuF,UAAUthB,EAAMtzD,QAAUszD,EAAMp0E,OAC7D,MAEF,IAAK,MACHA,EAAQkH,KAAKyrE,UAAUyB,EAAMp0E,MAAMyjB,OAAO,IAC1C,MAEF,QACE,OAAOvc,KAAK2uF,OAAO,2BAA2BzhB,EAAMp/D,KAAQo/D,GAK9D,OAFKgiB,GAAclvF,KAAKgsE,SAAYlzE,EAAM0Q,MAAMxJ,KAAK0uF,cACnD51F,EAAQkH,KAAK0uF,YAAY51F,EAAM0Q,KAC1B1Q,EAIT,aAAao0E,GAEX,OADAltE,KAAK0kC,WAAa,KACVwoC,EAAMp/D,MACd,IAAK,IAIH,OAFA9N,KAAKsvF,aAAa,QAAStvF,KAAK4kC,OACd5kC,KAAKykC,SAAWzkC,KAAKqvF,aAAc,KAAM,MACpDrvF,KAAKuvF,mBACd,IAAK,IAIH,OAFAvvF,KAAKsvF,aAAa,OAAQtvF,KAAK4kC,OAAQ5kC,KAAK81D,QAAS,KAAM,MAC3D91D,KAAKykC,SAAW,KACTzkC,KAAKwvF,cACd,IAAK,IAEH,OAAKxvF,KAAKgsE,SAEVhsE,KAAKsvF,aAAa,UAAWtvF,KAAK4kC,OAChB5kC,KAAK4kC,OAAS5kC,KAAKqvF,aAAc,KAAM,MAClDrvF,KAAKgvF,cAHHhvF,KAAK2uF,OAAO,mBAAoBzhB,GAI3C,IAAK,IAEH,OAAOltE,KAAKyvF,iBAAiBviB,GAC/B,IAAK,WACH,OAAKltE,KAAKgsE,SAEVhsE,KAAKykC,SAAW,KAChBzkC,KAAK0kC,WAAa1kC,KAAK0vF,WACvB1vF,KAAK2vF,YAAc3vF,KAAKqvF,WACjBrvF,KAAK4vF,qBAJH5vF,KAAK2uF,OAAO,wBAAyBzhB,GAKhD,IAAK,UACH,OAAKltE,KAAKgsE,SAEVhsE,KAAKykC,SAAW,KAChBzkC,KAAK0kC,WAAa1kC,KAAK6vF,UACvB7vF,KAAK2vF,YAAc3vF,KAAKyrE,UACjBzrE,KAAK4vF,qBAJH5vF,KAAK2uF,OAAO,uBAAwBzhB,GAK/C,IAAK,UACH,IAAKltE,KAAKgsE,QACR,OAAOhsE,KAAK2uF,OAAO,qBAAsBzhB,GAE3C,GAA4B,IAAxBA,EAAMtzD,OAAOvd,OAEf,OADA2D,KAAK8vF,cAAgB5iB,EAAMp0E,MACpBkH,KAAK+vF,wBAGZ/vF,KAAKykC,SAAWzkC,KAAKgwF,SAAS9iB,EAAMp0E,MAAOkH,KAAKovF,WAAWliB,EAAMtzD,SAEnE,MACF,IAAK,KACH,OAAK5Z,KAAKytF,kBAEVztF,KAAKsvF,aAAa,KAAMtvF,KAAK4kC,OAAQ,KAAM,KAAM,MACjD5kC,KAAK4kC,OAAS,KACP5kC,KAAKgvF,cAHHhvF,KAAK2uF,OAAO,yBAA0BzhB,GAIjD,QAEE,QAAkD1mE,KAA7CxG,KAAKykC,SAAWzkC,KAAKiwF,YAAY/iB,IACpC,OAEF,GAAIltE,KAAKgsE,QACP,OAAOhsE,KAAKkwF,eAAelwF,KAAKstF,4BAKpC,OAAOttF,KAAKstF,2BAId,eAAepgB,GACb,MAAMp/D,EAAOo/D,EAAMp/D,KACnB,OAAQA,GACR,IAAK,UACH9N,KAAKsuF,mBAAoB,EAC3B,IAAK,eACHtuF,KAAK0kC,WAAa1kC,KAAKmwF,cAAcjjB,EAAMp0E,OAC3C,MACF,IAAK,IACL,IAAK,IACL,IAAK,IAEH,OAAwB,OAApBkH,KAAK0kC,WACA1kC,KAAK2uF,OAAO,cAAc7gF,EAAQo/D,IAC3CltE,KAAKykC,SAAW,KACA,MAAT32B,EAAe9N,KAAKowF,mBAAmBljB,GAASltE,KAAKyvF,iBAAiBviB,IAC/E,IAAK,IAEH,OAA2B,OAApBltE,KAAK0kC,WAAsB1kC,KAAKutF,eAChCvtF,KAAK2uF,OAAO,+BAAgCzhB,GACrD,IAAK,QACH,IAAKltE,KAAKgsE,QACR,OAAOhsE,KAAK2uF,OAAO,qCAAsCzhB,GAC7D,QACE,QAAoD1mE,KAA/CxG,KAAK0kC,WAAa1kC,KAAKiwF,YAAY/iB,IACtC,OAGJ,OAAOltE,KAAKqwF,YAId,YAAYnjB,GACV,OAAQA,EAAMp/D,MACd,IAAK,UAEH,GAA4B,IAAxBo/D,EAAMtzD,OAAOvd,OAEf,OADA2D,KAAK8vF,cAAgB5iB,EAAMp0E,MACpBkH,KAAKswF,oBAIZtwF,KAAK2kC,QAAU3kC,KAAKgwF,SAAS9iB,EAAMp0E,MAAOkH,KAAKovF,WAAWliB,EAAMtzD,SAClE,MACF,IAAK,IAIH,OAFA5Z,KAAKsvF,aAAa,QAAStvF,KAAK4kC,OAAQ5kC,KAAKykC,SAAUzkC,KAAK0kC,WAC1C1kC,KAAKykC,SAAWzkC,KAAKqvF,cAChCrvF,KAAKuvF,mBACd,IAAK,IAIH,OAFAvvF,KAAKsvF,aAAa,OAAQtvF,KAAK4kC,OAAQ5kC,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK81D,SAC5E91D,KAAKykC,SAAW,KACTzkC,KAAKwvF,cACd,IAAK,IAEH,OAAKxvF,KAAKgsE,SAEVhsE,KAAKsvF,aAAa,UAAWtvF,KAAK4kC,OAAQ5kC,KAAKykC,SAAUzkC,KAAK0kC,WAC5C1kC,KAAK4kC,OAAS5kC,KAAKqvF,cAC9BrvF,KAAKgvF,cAHHhvF,KAAK2uF,OAAO,mBAAoBzhB,GAI3C,IAAK,KACH,OAAKltE,KAAKytF,kBAEVztF,KAAKsvF,aAAa,KAAMtvF,KAAK4kC,OAAQ5kC,KAAKykC,SAAUzkC,KAAK0kC,WAAY,MACrE1kC,KAAK4kC,OAAS,KACP5kC,KAAKgvF,cAHHhvF,KAAK2uF,OAAO,yBAA0BzhB,GAIjD,QAEE,QAAiD1mE,KAA5CxG,KAAK2kC,QAAU3kC,KAAKiwF,YAAY/iB,IACnC,OAEF,GAAIltE,KAAKgsE,QACP,OAAOhsE,KAAKkwF,eAAelwF,KAAKuwF,wBAEpC,OAAOvwF,KAAKuwF,uBAId,2BAA2BrjB,GACzB,MAAsB,MAAfA,EAAMp/D,KAAe9N,KAAKwwF,WAAWtjB,GAASltE,KAAKutF,eAAergB,GAI3E,WAAWA,GACT,MAAmB,MAAfA,EAAMp/D,KACD9N,KAAK2uF,OAAO,0BAA0BzhB,EAAMp/D,KAAQo/D,IAE7DltE,KAAK4kC,OAAS5kC,KAAKykC,SAAUzkC,KAAKykC,SAAW,KACtCzkC,KAAKgvF,cAId,mBAAmB9hB,GACjB,MAAmB,MAAfA,EAAMp/D,MACR9N,KAAKykC,SAAW,KACTzkC,KAAKowF,mBAAmBljB,KAG/BltE,KAAK0kC,WAAa,KACX1kC,KAAKutF,eAAergB,IAK/B,mBAAmBA,GACjB,GAAmB,MAAfA,EAAMp/D,KACR,OAAO9N,KAAKywF,0BAA0BvjB,GAGlB,OAAlBltE,KAAKykC,UACPzkC,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK2kC,QAAS3kC,KAAK4kC,QAGhE,MAAMiZ,EAA4B,OAApB79C,KAAK0kC,WAGnB,OAFA1kC,KAAK2wF,kBAEgB,OAAjB3wF,KAAK2kC,QAEAkZ,EAAQ79C,KAAKstF,2BAA6BttF,KAAK4wF,yBAG/C5wF,KAAKuwF,uBAIhB,yBAAyBrjB,GACvB,OAAQA,EAAMp/D,MACd,IAAK,IACL,IAAK,IAGH,OADA9N,KAAKykC,SAAW,KACTzkC,KAAKyvF,iBAAiBviB,GAC/B,QACE,OAAOltE,KAAKutF,eAAergB,IAK/B,cAAcA,GACZ,IAAIljE,EAAO,KACP8P,EAAO,KACP+C,EAAO7c,KAAKwvF,cAChB,MAAMqB,EAAe7wF,KAAKykC,SACtB98B,EAAQ3H,KAAK4sF,cACb1jE,EAASvhB,EAAMA,EAAMtL,OAAS,GAElC,OAAQ6wE,EAAMp/D,MACd,IAAK,IAEH9N,KAAKsvF,aAAa,QAAStvF,KAAK4kC,OACd9qB,EAAO9Z,KAAKqvF,aAAcrvF,KAAK41D,UAC/B51D,KAAKykC,SAAWz6B,EAAOhK,KAAKqvF,cAC9CxyE,EAAO7c,KAAKuvF,mBACZ,MACF,IAAK,IAEHvvF,KAAKsvF,aAAa,OAAQtvF,KAAK4kC,OACb9qB,EAAO9Z,KAAKqvF,aAAcrvF,KAAK41D,UAAW51D,KAAK81D,SACjE91D,KAAKykC,SAAW,KAChB,MACF,IAAK,IAQH,GANAzkC,KAAK2wF,kBAGgB,IAAjBhpF,EAAMtL,QAAiD,SAAjCsL,EAAMA,EAAMtL,OAAS,GAAGyR,MAChD9N,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK2kC,QAAS3kC,KAAK4kC,QAExC,OAApB5kC,KAAK0kC,YAIP,GAFA7nB,EAAO7c,KAAKutF,eAERvtF,KAAKykC,WAAazkC,KAAK81D,QACzB,OAAOj5C,OAMT,GAFAA,EAAO7c,KAAKuwF,uBAERvwF,KAAK2kC,UAAY3kC,KAAK81D,QACxB,OAAOj5C,EAGX/C,EAAO9Z,KAAK81D,QACZ,MACF,IAAK,UAEyB,IAAxBoX,EAAMtzD,OAAOvd,QACf2D,KAAK8vF,cAAgB5iB,EAAMp0E,MAC3B+jB,EAAO7c,KAAK8wF,8BAIZ9mF,EAAOhK,KAAKgwF,SAAS9iB,EAAMp0E,MAAOkH,KAAKovF,WAAWliB,EAAMtzD,SACxDiD,EAAO7c,KAAKuwF,wBAEd,MACF,IAAK,IAEH,OAAKvwF,KAAKgsE,SAEVhsE,KAAKsvF,aAAa,UAAWtvF,KAAK4kC,OAAQ5kC,KAAKykC,SAAUzkC,KAAK0kC,WAC5C1kC,KAAK4kC,OAAS5kC,KAAKqvF,cAC9BrvF,KAAKgvF,cAHHhvF,KAAK2uF,OAAO,mBAAoBzhB,GAI3C,QACE,QAAyC1mE,KAApCwD,EAAOhK,KAAKiwF,YAAY/iB,IAC3B,OAoBJ,GAhBa,OAATpzD,IACF9Z,KAAKykC,SAAW3qB,EAAO9Z,KAAKqvF,cAGT,OAAjBwB,EAEuB,OAArB3nE,EAAO5iB,UACT4iB,EAAO7iB,QAAUyT,EAEjBoP,EAAO3vB,OAASugB,EAIlB9Z,KAAK0wF,MAAMG,EAAc7wF,KAAK61D,SAAU/7C,EAAM9Z,KAAK4kC,QAGxC,OAAT56B,EAAe,CAEjB,GAAIhK,KAAKgsE,UAA2B,QAAfkB,EAAMp/D,MAAiC,aAAfo/D,EAAMp/D,MAKjD,OAHA9N,KAAKsvF,aAAa,OAAQtvF,KAAK4kC,OAAQ9qB,EAAM9Z,KAAK41D,UAAW5rD,GAC7DhK,KAAKykC,SAAWz6B,EAAMhK,KAAK0kC,WAAa,KAEjC1kC,KAAKkwF,eAAelwF,KAAKwvF,eAGlCxvF,KAAK0wF,MAAM52E,EAAM9Z,KAAK41D,UAAW5rD,EAAMhK,KAAK4kC,QAE9C,OAAO/nB,EAIT,oBAAoBqwD,GAClB,OAAOltE,KAAK+wF,uBAAuB7jB,GAAO,GAK5C,4BAA4BA,GAC1B,OAAOltE,KAAK+wF,uBAAuB7jB,GAAO,GAI5C,iBAAiBA,GAEf,IAAI9hE,EAAUpL,KAAKgwF,SAAShwF,KAAK8vF,eAEjC,OAAQ5iB,EAAMp/D,MAEd,IAAK,OACL,IAAK,UACH,MAAM1B,EAAWpM,KAAKiwF,YAAY/iB,GAClC,QAAiB1mE,IAAb4F,EAAwB,OAC5BhB,EAAUpL,KAAKgwF,SAAShwF,KAAK8vF,cAAe1jF,GAC5C8gE,EAAQ,KACR,MAEF,IAAK,WACH9hE,EAAUpL,KAAKgwF,SAAShwF,KAAK8vF,cAAe5iB,EAAMp0E,OAClDo0E,EAAQ,KAIV,MAAO,CAAEA,QAAO9hE,WAIlB,wBAAwB8hE,GAEtB,OADAltE,KAAKykC,SAAWzkC,KAAKgxF,iBAAiB9jB,GAAO9hE,QACtCpL,KAAKstF,2BAId,uBAAuBpgB,EAAOlf,GAC5B,MAAMvU,EAAYz5C,KAAKgxF,iBAAiB9jB,GACxC,GAAKzzB,EASL,OAPAz5C,KAAK2kC,QAAU8U,EAAUruC,QAIrB4iD,GACFhuD,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK41D,UAAW51D,KAAK2kC,QAAS3kC,KAAK4kC,QAEvC,OAApB6U,EAAUyzB,MACLltE,KAAKuwF,wBAGZvwF,KAAKixF,cAAgBjxF,KAAKuwF,uBACnBvwF,KAAKixF,cAAcx3C,EAAUyzB,QAKxC,iBAAiBA,GACf,MAAmB,MAAfA,EAAMp/D,KACD9N,KAAKyvF,iBAAiBviB,IAGT,OAAlBltE,KAAKykC,UACPzkC,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK2kC,QAAS3kC,KAAK4kC,QAGhE5kC,KAAK2wF,kBAGmB,OAAjB3wF,KAAK2kC,QAAmB3kC,KAAKutF,eAAiBvtF,KAAKuwF,wBAI5D,iBAAiBrjB,GACf,IAAIrwD,EAAMhS,EAAQ7K,KAAK4kC,OACvB,MAAMv+B,EAAUrG,KAAKykC,SAAUysD,EAAmBlxF,KAAKsuF,kBACvD,OAAQphB,EAAMp/D,MAEd,IAAK,IACH,GAAoB,OAAhB9N,KAAK4kC,OACP,OAAO5kC,KAAK2uF,OAAO,2BAA4BzhB,GACjD,GAAIltE,KAAKgsE,QACP,OAAOhsE,KAAKmxF,iBAAiBjkB,GAC/BltE,KAAK4kC,OAAS,KAEhB,IAAK,IACH5kC,KAAKykC,SAAW,KAChB5nB,EAAO7c,KAAK4sF,cAAcvwF,OAAS2D,KAAKgvF,aAAehvF,KAAKoxF,kBACxDF,IAAkBlxF,KAAKsuF,mBAAoB,GAC/C,MAEF,IAAK,IACHzxE,EAAO7c,KAAKutF,eACZ,MAEF,IAAK,IACH1wE,EAAO7c,KAAKqwF,YACZ,MACF,QAEE,GAAIrwF,KAAKwtF,gBAAkC,OAAhBxtF,KAAK4kC,aAAyDp+B,KAArCqE,EAAQ7K,KAAKiwF,YAAY/iB,IAAuB,CAClGrwD,EAAO7c,KAAKqxF,qBACZ,MAEF,OAAOrxF,KAAK2uF,OAAO,mCAAmC3uF,KAAK2kC,QAAQn7B,MAAO0jE,GAG5E,GAAgB,OAAZ7mE,EAAkB,CACpB,MAAMC,EAAYtG,KAAK0kC,WAAYnrC,EAASyG,KAAK2kC,QAC5CusD,EAGHlxF,KAAK0wF,MAAMn3F,EAAS+M,EAAWD,EAASwE,GAFxC7K,KAAK0wF,MAAMrqF,EAASC,EAAW/M,EAASsR,GAI5C,OAAOgS,EAIT,0BAA0BqwD,GACxB,IAAIrwD,EACJ,OAAQqwD,EAAMp/D,MAEd,IAAK,IACH+O,EAAO7c,KAAKutF,eACZ,MAEF,IAAK,IACH1wE,EAAO7c,KAAKqwF,YACZ,MACF,QACE,OAAOrwF,KAAK2uF,OAAO,mCAAmC3uF,KAAK2kC,QAAQn7B,MAAO0jE,GAI5E,OADAltE,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK2kC,QAAS3kC,KAAK4kC,QACvD/nB,EAIT,qBAAqBqwD,GACnB,MAAmB,MAAfA,EAAMp/D,KACD9N,KAAK2uF,OAAO,8BAA+BzhB,GAC7CltE,KAAKoxF,kBAId,YAAYlkB,GACV,MAAmB,WAAfA,EAAMp/D,KACD9N,KAAK2uF,OAAO,oCAAqCzhB,IAC1DltE,KAAKwyB,QAAU06C,EAAMp0E,MACdkH,KAAKsxF,gBAId,eAAepkB,GACb,GAAmB,QAAfA,EAAMp/D,KACR,OAAO9N,KAAK2uF,OAAO,kCAAkC3uF,KAAKwyB,YAAa06C,GACzE,MAAMqkB,EAAavxF,KAAKiwF,YAAY/iB,GAGpC,OAFAltE,KAAKwuF,UAAUxuF,KAAKwyB,SAAW++D,EAAWz4F,MAC1CkH,KAAKwxF,gBAAgBxxF,KAAKwyB,QAAS++D,GAC5BvxF,KAAKyxF,4BAId,aAAavkB,GACX,MAAMxtE,EAAqB,QAAfwtE,EAAMp/D,MAAkB9N,KAAKmvF,YAAYjiB,EAAMp0E,OAC3D,OAAK4G,GAELM,KAAK6sF,SAASntF,GACPM,KAAKyxF,6BAFHzxF,KAAK2uF,OAAO,gDAAiDzhB,GAMxE,qBAAqBA,GACnB,OAAQA,EAAMp/D,MACd,IAAK,MACL,IAAK,QACL,IAAK,WACH,OAAO9N,KAAKgvF,aAAa9hB,GAAQltE,KAAKwwF,WACxC,IAAK,IACH,OAAOxwF,KAAK0xF,0BACd,QACE,OAAO1xF,KAAK2uF,OAAO,sBAAuBzhB,IAK9C,0BAA0BA,GACxB,MAAmB,MAAfA,EAAMp/D,KACD9N,KAAK2uF,OAAO,sBAAuBzhB,IAC5CltE,KAAKykC,SAAWzkC,KAAKqvF,aACdrvF,KAAKwwF,YAId,4BAA4BtjB,GAE1B,OAAIltE,KAAK6uF,cACP7uF,KAAK6uF,cAAe,EACb7uF,KAAKoxF,kBAAkBlkB,IAGb,MAAfA,EAAMp/D,KACD9N,KAAK2uF,OAAO,yCAA0CzhB,GACxDltE,KAAKoxF,kBAId,oBAAoBlkB,GAClB,IAAI7gB,EACJ,OAAQ6gB,EAAMp/D,MACd,IAAK,MACL,IAAK,WACH,QAAiDtH,KAA5C6lD,EAASrsD,KAAKiwF,YAAY/iB,GAAO,IACpC,MACJ,QACE,OAAOltE,KAAK2uF,OAAO,cAAczhB,EAAMp/D,KAAQo/D,GAkBjD,OAfKltE,KAAK8tF,sBAKc,OAAlB9tF,KAAKykC,SACPzkC,KAAK0wF,MAAM1wF,KAAK4kC,QAAU5kC,KAAK+jC,aAAc/jC,KAAK0kC,WACvC1kC,KAAKykC,SAAWzkC,KAAKqvF,aAAcrvF,KAAK2xF,mBAGnD3xF,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK61D,SACpB71D,KAAKykC,SAAWzkC,KAAKqvF,aAAcrvF,KAAK2xF,mBAErD3xF,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK41D,UAAWvJ,EAAQrsD,KAAK2xF,oBAZvD3xF,KAAK0uF,YAAYriC,EAAO7iD,IAAMxJ,KAAK2vF,YAAY3vF,KAAKqvF,aAAav2F,OAc5DkH,KAAK4xF,2BAId,2BAA2B1kB,GAEzB,MAAmB,MAAfA,EAAMp/D,KACD9N,KAAK4vF,qBAIR5vF,KAAK8tF,uBACP9tF,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK61D,SAAU71D,KAAK81D,QAAS91D,KAAK2xF,mBAC5D3xF,KAAKykC,SAAW,MAGlBzkC,KAAKixF,cAAgBjxF,KAAKuwF,uBACnBvwF,KAAKixF,cAAc/jB,IAK9B,eAAe2kB,GAEb,OADA7xF,KAAK8xF,WAAaD,EACX7xF,KAAK+xF,UAId,UAAU7kB,GACR,OAAQA,EAAMp/D,MAEd,IAAK,IAAK,OAAO9N,KAAKgyF,iBAEtB,IAAK,IAAK,OAAOhyF,KAAKiyF,kBAEtB,QACE,MAAMtqF,EAAQ3H,KAAK4sF,cAAe1jE,EAASvhB,EAAMtL,QAAUsL,EAAMA,EAAMtL,OAAS,GAEhF,GAAI6sB,GAA0B,SAAhBA,EAAOpb,KAAiB,CAEpC,MAAM9D,EAAOhK,KAAKykC,SAElBzkC,KAAK2wF,kBAEL3wF,KAAK0wF,MAAM1wF,KAAKykC,SAAUzkC,KAAK41D,UAAW5rD,EAAMhK,KAAK4kC,QAEvD,OAAO5kC,KAAK8xF,WAAW5kB,IAK3B,iBAAiBA,GACf,IAAI7mE,EAASC,EACb,MAAM/M,EAASyG,KAAKqvF,aAEpB,QAA8C7oF,KAAzCF,EAAYtG,KAAKiwF,YAAY/iB,IAUlC,OAPwB,OAApBltE,KAAK0kC,YACPr+B,EAAUrG,KAAKykC,SAAUzkC,KAAKykC,SAAWlrC,IAGzC8M,EAAUrG,KAAK2kC,QAAU3kC,KAAK2kC,QAAWprC,GAE3CyG,KAAK0wF,MAAMrqF,EAASC,EAAW/M,EAAQyG,KAAK4kC,QACrC5kC,KAAK+xF,UAId,kBAAkB7kB,GAChB,MAAM7mE,EAAUrG,KAAKqvF,aACrB,IAAI/oF,EAAW/M,EAEf,QAA8CiN,KAAzCF,EAAYtG,KAAKiwF,YAAY/iB,IAUlC,OAPwB,OAApBltE,KAAK0kC,YACPnrC,EAASyG,KAAKykC,SAAUzkC,KAAKykC,SAAWp+B,IAGxC9M,EAASyG,KAAK2kC,QAAU3kC,KAAK2kC,QAAWt+B,GAE1CrG,KAAK0wF,MAAMrqF,EAASC,EAAW/M,EAAQyG,KAAK4kC,QACrC5kC,KAAK+xF,UAId,wBAAwB7kB,GACtB,MAAmB,OAAfA,EAAMp/D,KAEJ9N,KAAKwtF,gBAAkC,OAAhBxtF,KAAK4kC,aAA+Dp+B,KAA3CxG,KAAK4kC,OAAS5kC,KAAKiwF,YAAY/iB,IAC1EltE,KAAKkyF,iBACPlyF,KAAK2uF,OAAO,0BAA0B3uF,KAAK2kC,QAAQn7B,MAAO0jE,GAE5DltE,KAAKkyF,iBAAiBhlB,GAI/B,iBAAiBA,GACf,GAAmB,OAAfA,EAAMp/D,KACR,OAAO9N,KAAK2uF,OAAO,uBAAuBzhB,EAAMp/D,KAAQo/D,GAE1D,MAAMtjE,EAAO5J,KAAKmyF,MAAMnyF,KAAKykC,SAAUzkC,KAAK0kC,WAAY1kC,KAAK2kC,QAC3D3kC,KAAK4kC,QAAU5kC,KAAK+jC,cAGtB,OAFA/jC,KAAK2wF,kBAEiB,OAAlB3wF,KAAKykC,UACPzkC,KAAKykC,SAAW76B,EACT5J,KAAKutF,iBAIZvtF,KAAK2kC,QAAU/6B,EACR5J,KAAKuwF,wBAKhB,uBACE,MAAM6B,EAAepyF,KAAK4sF,cAC1B,IAAKwF,EAAa/1F,OAChB,OAAO2D,KAAKyvF,iBAEd,OAAQ2C,EAAaA,EAAa/1F,OAAS,GAAGyR,MAC9C,IAAK,QACH,OAAO9N,KAAKowF,mBACd,IAAK,OACH,OAAOpwF,KAAKwvF,cACd,IAAK,UACH,OAAOxvF,KAAKmxF,iBACd,IAAK,KACH,OAAOnxF,KAAKqyF,yBAKhB,MAAMhsF,EAASC,EAAW/M,EAAQsR,GAChC7K,KAAK4uF,UAAU,KAAM5uF,KAAKmyF,MAAM9rF,EAASC,EAAW/M,EAAQsR,GAAS7K,KAAK+jC,eAI5E,OAAOnpB,EAASsyD,GACd,MAAMl1C,EAAM,IAAIn4B,MAAM,GAAG+a,aAAmBsyD,EAAMnlE,SAClDiwB,EAAI/O,QAAU,CACZikD,MAAOA,EACPnlE,KAAMmlE,EAAMnlE,KACZolE,cAAentE,KAAK4tF,OAAOzgB,eAE7BntE,KAAK4uF,UAAU52D,GACfh4B,KAAK4uF,UAAY5Y,EAInB,YAAYt2E,GACV,MAAO,uBAAuBoE,KAAKpE,GAAOA,EAAMM,KAAK0tF,oBAAoBhuF,GAK3E,oBAAoBA,GAElB,IAAKA,EAAIrD,OACP,OAAO2D,KAAKiuF,MAEd,OAAQvuF,EAAI,IAEZ,IAAK,IAAK,OAAOM,KAAKiuF,MAAQvuF,EAE9B,IAAK,IAAK,OAAOM,KAAKiuF,MAAMlwF,QAAQ,aAAc2B,GAElD,IAAK,IAEH,OAAmB,MAAXA,EAAI,GAAaM,KAAKouF,YAAcpuF,KAAKmuF,WAAanuF,KAAKsyF,mBAAmB5yF,GAExF,QAEE,MAAQ,WAAWoE,KAAKpE,GAAQ,KAAOM,KAAKsyF,mBAAmBtyF,KAAKkuF,UAAYxuF,IAKpF,mBAAmBA,GAEjB,IAAK,uBAAuBoE,KAAKpE,GAC/B,OAAOA,EAGT,MAAMrD,EAASqD,EAAIrD,OACnB,IAAIsE,EAAS,GAAI9I,GAAK,EAAG06F,GAAa,EAAGC,EAAe,EAAG31E,EAAO,IAElE,KAAOhlB,EAAIwE,GAAQ,CACjB,OAAQwgB,GAER,IAAK,IACH,GAAI01E,EAAY,GAEG,MAAb7yF,IAAM7H,IAA2B,MAAb6H,IAAM7H,GAE5B,MAAQ06F,EAAY16F,EAAI,GAAKwE,GAA6B,MAAnBqD,EAAI6yF,IACzC16F,EAAI06F,EAEV,MAEF,IAAK,IACL,IAAK,IACH16F,EAAIwE,EACJ,MAEF,IAAK,IACH,GAAmB,MAAfqD,EAAI7H,EAAI,GAEV,OADAglB,EAAOnd,EAAU,KAAJ7H,GACLglB,GAER,IAAK,IACHlc,GAAUjB,EAAIuoB,UAAUuqE,EAAc36F,EAAI,GAC1C26F,EAAe36F,EAAI,EACnB,MAEF,UAAK2O,EACL,IAAK,IACL,IAAK,IACH,OAAO7F,EAASjB,EAAIuoB,UAAUuqE,EAAc36F,GAAK6H,EAAI6c,OAAO1kB,EAAI,GAElE,IAAK,IAEH,GADAglB,EAAOnd,EAAU,KAAJ7H,QACA2O,IAATqW,GAA+B,MAATA,GAAyB,MAATA,GAAyB,MAATA,EAAc,CAMtE,GALAlc,GAAUjB,EAAIuoB,UAAUuqE,EAAc36F,EAAI,IAErC26F,EAAe7xF,EAAO9C,YAAY,OAAS00F,IAC9C5xF,EAASA,EAAO4b,OAAO,EAAGi2E,IAEf,MAAT31E,EACF,MAAO,GAAGlc,KAAUjB,EAAI6c,OAAO1kB,EAAI,KACrC26F,EAAe36F,EAAI,IAK3BglB,EAAOnd,IAAM7H,GAEf,OAAO8I,EAASjB,EAAIuoB,UAAUuqE,GAMhC,MAAM5/E,EAAO6/E,EAAcC,GAazB,GAVA1yF,KAAKixF,cAAgBjxF,KAAKoxF,kBAC1BpxF,KAAK6uF,cAAe,EACpB7uF,KAAKwuF,UAAYj2F,OAAOY,OAAO,MAC/B6G,KAAKwuF,UAAU72C,EAAI33C,KAAK2tF,iBAAmB3tF,KAAK2tF,iBAAiBpxE,OAAO,GAC7B,IAAIowE,OAC/C3sF,KAAKwxF,gBAAkBkB,GAAkB1c,EACzCh2E,KAAKsuF,mBAAoB,EACzBtuF,KAAK0uF,YAAcn2F,OAAOY,OAAO,OAG5Bs5F,EAAc,CACjB,MAAMrmC,EAAQ,GACd,IAAI1wD,EAKJ,GAJAsE,KAAK4uF,UAAY,CAAClnF,EAAG3O,KAAQ2O,EAAKhM,EAAQgM,EAAK3O,GAAKqzD,EAAM7qD,KAAKxI,IAC/DiH,KAAK4tF,OAAOnlE,SAAS7V,GAAOnB,MAAMy7D,GACzBltE,KAAKixF,cAAgBjxF,KAAKixF,cAAc/jB,IAE7CxxE,EAAO,MAAMA,EACjB,OAAO0wD,EAITpsD,KAAK4uF,UAAY6D,EACjBzyF,KAAK4tF,OAAOnlE,SAAS7V,EAAO,CAAClX,EAAOwxE,KACpB,OAAVxxE,GACFsE,KAAK4uF,UAAUlzF,GAAQsE,KAAK4uF,UAAY5Y,GACjCh2E,KAAKixF,gBACZjxF,KAAKixF,cAAgBjxF,KAAKixF,cAAc/jB,OAMhD,SAAS8I,KAGT,SAAS8W,EAAgBlxE,EAAQ1kB,GAE/B,MAAM2R,EAAY3R,EAAQ2R,UAC1B+S,EAAOwzE,WAAevmF,EACtB+S,EAAOyzE,WAAen4F,EAAQ2S,UAC9B+R,EAAOo0E,SAAe94F,EAAQkU,QAC9BwQ,EAAO6vD,UAAev0E,EAAQ0U,SAC9BgQ,EAAOu2E,MAAej7F,EAAQ0S,KAC9BgS,EAAOmoB,aAAe7sC,EAAQ+S,eAG9B2R,EAAOg6C,UAAa/sD,EAAU,IAAWK,IAAI8E,OAC7C4N,EAAOi6C,SAAahtD,EAAU,IAAWK,IAAI+E,MAC7C2N,EAAOk6C,QAAajtD,EAAU,IAAWK,IAAI6E,KAC7C6N,EAAOi0E,UAAahnF,EAAU,IAAWlQ,EAAE0V,QAC3CuN,EAAO8zE,WAAa7mF,EAAU,IAAWlQ,EAAEyV,SAC3CwN,EAAOu0E,cAAgB,CACrB,EAAKtnF,EAAU,IAAWK,IAAI4E,MAC9B,IAAKjF,EAAU,IAAWqF,IAAIC,QAC9B,IAAKtF,EAAU,IAAWxN,IAAIiT,UAEhCsN,EAAO+1E,kBAAoB9oF,EAAU,sBAEvCikF,EAAgBhzD,EAASrgC,UAAW","file":"rdflib.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"window\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"window\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"$rdf\"] = factory(require(\"window\"));\n\telse\n\t\troot[\"$rdf\"] = factory(root[\"window\"]);\n})(window, function(__WEBPACK_EXTERNAL_MODULE__56__) {\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 = 75);\n","function _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nmodule.exports = _defineProperty;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","import Node from './node-internal'\nimport RDFlibVariable from './variable'\nimport RDFlibBlankNode from './blank-node'\nimport Collection from './collection'\nimport RDFlibLiteral from './literal'\nimport RDFlibNamedNode from './named-node'\nimport RDFlibDefaultGraph from './default-graph'\nimport { DataFactory } from './factories/factory-types'\nimport IndexedFormula from './store'\nimport Fetcher from './fetcher'\nimport Statement from './statement'\nimport Empty from './empty'\nimport { NamedNode, Term, Quad_Subject, Quad_Predicate, Quad_Object, Quad_Graph } from './tf-types'\n\nexport const NamedNodeTermType = \"NamedNode\" as const\nexport const BlankNodeTermType = \"BlankNode\" as const\nexport const LiteralTermType = \"Literal\" as const\nexport const VariableTermType = \"Variable\" as const\nexport const DefaultGraphTermType = \"DefaultGraph\" as const\n// Non-RDF/JS types:\nexport const CollectionTermType = \"Collection\" as const\nexport const EmptyTermType = \"Empty\" as const\nexport const GraphTermType = \"Graph\" as const\n\nexport type TermType = typeof NamedNodeTermType\n  | typeof BlankNodeTermType\n  | typeof LiteralTermType\n  | typeof VariableTermType\n  | typeof DefaultGraphTermType\n  | typeof CollectionTermType\n  | typeof EmptyTermType\n  | typeof GraphTermType\n\nexport const HTMLContentType = \"text/html\" as const\nexport const JSONLDContentType = \"application/ld+json\" as const\nexport const N3ContentType = \"text/n3\" as const\nexport const N3LegacyContentType = \"application/n3\" as const\nexport const NQuadsAltContentType = \"application/nquads\" as const\nexport const NQuadsContentType = \"application/n-quads\" as const\nexport const NTriplesContentType = \"application/n-triples\" as const\nexport const RDFXMLContentType = \"application/rdf+xml\" as const\nexport const SPARQLUpdateContentType = \"application/sparql-update\" as const\nexport const SPARQLUpdateSingleMatchContentType = \"application/sparql-update-single-match\" as const\nexport const TurtleContentType = \"text/turtle\" as const\nexport const TurtleLegacyContentType = \"application/x-turtle\" as const\nexport const XHTMLContentType = \"application/xhtml+xml\" as const\n\n/**\n * A valid mime type header\n */\nexport type ContentType = typeof RDFXMLContentType\n  | typeof HTMLContentType\n  | typeof JSONLDContentType\n  | typeof N3ContentType\n  | typeof N3LegacyContentType\n  | typeof NQuadsAltContentType\n  | typeof NQuadsContentType\n  | typeof SPARQLUpdateContentType\n  | typeof SPARQLUpdateSingleMatchContentType\n  | typeof TurtleContentType\n  | typeof TurtleLegacyContentType\n  | typeof XHTMLContentType\n\n/** A type for values that serves as inputs */\nexport type ValueType = Term | Node | Date | string | number | boolean | undefined | null | Collection\n\n/**\n * In this project, there exist two types for the same kind of RDF concept.\n * We have RDF/JS spec types (standardized, generic), and RDFlib types (internal, specific).\n * When deciding which type to use in a function, it is preferable to accept generic inputs,\n * whenever possible, and provide strict outputs.\n * In some ways, the TF types in here are a bit more strict.\n * Variables are missing, and the statement requires specific types of terms (e.g. NamedNode instead of Term).\n */\n\n/** An RDF/JS Subject */\nexport type SubjectType = RDFlibBlankNode | RDFlibNamedNode | RDFlibVariable\n/** An RDF/JS Predicate */\nexport type PredicateType = RDFlibNamedNode | RDFlibVariable\n/** An RDF/JS Object */\nexport type ObjectType = RDFlibNamedNode | RDFlibLiteral | Collection | RDFlibBlankNode | RDFlibVariable | Empty\n/** An RDF/JS Graph */\nexport type GraphType = RDFlibDefaultGraph | RDFlibNamedNode | RDFlibVariable // | Formula\n\nexport interface Bindings {\n  [id: string]: Term;\n}\n\n/** All the types that a .fromValue() method might return */\nexport type FromValueReturns<C extends Node = any> = Term | undefined | null | Collection<C>\n\nexport interface IRDFlibDataFactory extends DataFactory<\n  RDFlibNamedNode | RDFlibBlankNode | RDFlibLiteral | Collection | Statement\n> {\n  fetcher: (store: IndexedFormula, options: any) => Fetcher\n  lit: (val: string, lang?: string, dt?: NamedNode) => RDFlibLiteral\n  graph: (features?, opts?) => IndexedFormula\n  st: (\n    subject: Quad_Subject,\n    predicate: Quad_Predicate,\n    object: Quad_Object,\n    graph?: Quad_Graph\n  ) => Statement\n}\n","/**\n * A Dummy log\n * @module log\n */\nconst log = {\n  debug (x) {},\n  warn (x) {},\n  info (x) {},\n  error (x) {},\n  success (x) {},\n  msg (x) {},\n}\nexport default log\n","function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n\n  return self;\n}\n\nmodule.exports = _assertThisInitialized;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\n\nmodule.exports = _classCallCheck;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","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\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}\n\nmodule.exports = _createClass;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","/*\n * Implements URI-specific functions\n *\n * See RFC 2386\n *\n * See also:\n *   http://www.w3.org/2005/10/ajaw/uri.js\n *   http://www.w3.org/2000/10/swap/uripath.py\n *\n */\nvar alert = alert || console.log\n\nimport RDFlibNamedNode from './named-node'\n\n/**\n * Gets the document part of an URI\n * @param uri The URI\n */\nexport function docpart(uri: string): string {\n  var i: number\n  i = uri.indexOf('#')\n  if (i < 0) {\n    return uri\n  } else {\n    return uri.slice(0, i)\n  }\n}\n\n/**\n * Gets the document part of an URI as a named node\n * @param x - The URI\n */\nexport function document(x: string): RDFlibNamedNode {\n  return new RDFlibNamedNode(docpart(x))\n}\n\n/**\n * Gets the hostname in an URI\n * @param u The URI\n */\nexport function hostpart(u: string): string {\n  var m = /[^\\/]*\\/\\/([^\\/]*)\\//.exec(u)\n  if (m) {\n    return m[1]\n  } else {\n    return ''\n  }\n}\n\n/**\n * Joins an URI with a base\n * @param given - The relative part\n * @param base - The base URI\n */\nexport function join(given: string, base: string): string {\n  var baseColon, baseScheme, baseSingle\n  var colon, lastSlash, path\n  var baseHash = base.indexOf('#')\n  if (baseHash > 0) {\n    base = base.slice(0, baseHash)\n  }\n  if (given.length === 0) {\n    return base\n  }\n  if (given.indexOf('#') === 0) {\n    return base + given\n  }\n  colon = given.indexOf(':')\n  if (colon >= 0) {\n    return given\n  }\n  baseColon = base.indexOf(':')\n  if (base.length === 0) {\n    return given\n  }\n  if (baseColon < 0) {\n    alert('Invalid base: ' + base + ' in join with given: ' + given)\n    return given\n  }\n  baseScheme = base.slice(0, +baseColon + 1 || 9e9)\n  if (given.indexOf('//') === 0) {\n    return baseScheme + given\n  }\n  if (base.indexOf('//', baseColon) === baseColon + 1) {\n    baseSingle = base.indexOf('/', baseColon + 3)\n    if (baseSingle < 0) {\n      if (base.length - baseColon - 3 > 0) {\n        return base + '/' + given\n      } else {\n        return baseScheme + given\n      }\n    }\n  } else {\n    baseSingle = base.indexOf('/', baseColon + 1)\n    if (baseSingle < 0) {\n      if (base.length - baseColon - 1 > 0) {\n        return base + '/' + given\n      } else {\n        return baseScheme + given\n      }\n    }\n  }\n  if (given.indexOf('/') === 0) {\n    return base.slice(0, baseSingle) + given\n  }\n  path = base.slice(baseSingle)\n  lastSlash = path.lastIndexOf('/')\n  if (lastSlash < 0) {\n    return baseScheme + given\n  }\n  if (lastSlash >= 0 && lastSlash < path.length - 1) {\n    path = path.slice(0, +lastSlash + 1 || 9e9)\n  }\n  path += given\n  while (path.match(/[^\\/]*\\/\\.\\.\\//)) {\n    path = path.replace(/[^\\/]*\\/\\.\\.\\//, '')\n  }\n  path = path.replace(/\\.\\//g, '')\n  path = path.replace(/\\/\\.$/, '/')\n  return base.slice(0, baseSingle) + path\n}\n\n/**\n * Gets the protocol part of an URI\n * @param uri The URI\n */\nexport function protocol(uri: string): string | null {\n  const i = uri.indexOf(':')\n  if (i < 0) {\n    return null\n  } else {\n    return uri.slice(0, i)\n  }\n}\n\n/**\n * Gets a relative uri\n * @param base The base URI\n * @param uri The absolute URI\n */\nexport function refTo(base: string, uri: string): string {\n  var c: string,\n      i: number,\n      k: number,\n      l: number,\n      len: number,\n      len1: number,\n      n: number,\n      o: number,\n      p: number,\n      q: number,\n      ref: string,\n      ref1: number,\n      s: string\n  var commonHost = new RegExp('^[-_a-zA-Z0-9.]+:(//[^/]*)?/[^/]*$')\n  if (!base) {\n    return uri\n  }\n  if (base === uri) {\n    return ''\n  }\n  for (i = o = 0, len = uri.length; o < len; i = ++o) {\n    const c = uri[i]\n    if (c !== base[i]) {\n      break\n    }\n  }\n  if (base.slice(0, i).match(commonHost)) {\n    k = uri.indexOf('//')\n    if (k < 0) {\n      k = -2\n    }\n    l = uri.indexOf('/', k + 2)\n    if (uri[l + 1] !== '/' && base[l + 1] !== '/' && uri.slice(0, l) === base.slice(0, l)) {\n      return uri.slice(l)\n    }\n  }\n  if (uri[i] === '#' && base.length === i) {\n    return uri.slice(i)\n  }\n  while (i > 0 && uri[i - 1] !== '/') {\n    i--\n  }\n  if (i < 3) {\n    return uri\n  }\n  if (base.indexOf('//', i - 2) > 0 || uri.indexOf('//', i - 2) > 0) {\n    return uri\n  }\n  if (base.indexOf(':', i) > 0) {\n    return uri\n  }\n  n = 0\n  ref = base.slice(i)\n  for (p = 0, len1 = ref.length; p < len1; p++) {\n    c = ref[p]\n    if (c === '/') {\n      n++\n    }\n  }\n  if (n === 0 && i < uri.length && uri[i] === '#') {\n    return './' + uri.slice(i)\n  }\n  if (n === 0 && i === uri.length) {\n    return './'\n  }\n  s = ''\n  if (n > 0) {\n    for (q = 1, ref1 = n; ref1 >= 1 ? q <= ref1 : q >= ref1; ref1 >= 1 ? ++q : --q) {\n      s += '../'\n    }\n  }\n  return s + uri.slice(i)\n}\n","import {\n  ObjectType, CollectionTermType, NamedNodeTermType, VariableTermType, BlankNodeTermType, LiteralTermType, GraphTermType, DefaultGraphTermType,\n} from '../types'\nimport Collection from '../collection'\nimport IndexedFormula from '../store'\nimport Statement from '../statement'\nimport {\n  BlankNode,\n  Quad_Graph,\n  Literal,\n  NamedNode,\n  Quad_Object,\n  Quad_Predicate,\n  Quad,\n  Quad_Subject,\n  Term,\n  Variable,\n} from '../tf-types'\n\n/** TypeGuard for RDFLib Statements */\nexport function isStatement(obj): obj is Statement {\n  return typeof obj === 'object' && obj !== null && 'subject' in obj\n}\n\n/** TypeGuard for RDFlib Stores */\nexport function isStore(obj): obj is IndexedFormula {\n  return typeof obj === 'object' && obj !== null && 'statements' in obj\n}\n\n/** TypeGuard for RDFLib Collections */\nexport function isCollection(obj: any): obj is Collection<any> {\n  return isTerm(obj)\n    && (obj as Term).termType === CollectionTermType\n}\n\n/** TypeGuard for valid RDFlib Object types, also allows Collections */\nexport function isRDFlibObject(obj: any): obj is ObjectType {\n  return obj && Object.prototype.hasOwnProperty.call(obj, 'termType') && (\n    obj.termType === NamedNodeTermType ||\n    obj.termType === VariableTermType ||\n    obj.termType === BlankNodeTermType ||\n    obj.termType === CollectionTermType ||\n    obj.termType === LiteralTermType ||\n    obj.termType === GraphTermType\n  )\n}\n\n/** TypeGuard for RDFLib Variables */\nexport function isVariable(obj: any): obj is Variable {\n  return isTerm(obj)\n    && (obj as Term).termType === VariableTermType\n}\n\n/** TypeGuard for RDF/JS spec Terms */\nexport function isTerm(obj: any): obj is Term {\n  return typeof obj === 'object'\n    && obj !== null\n    && 'termType' in obj\n}\n\n/** TypeGuard for RDF/JS spec Literals */\nexport function isLiteral(value: any): value is Literal {\n  return (value as Term).termType === LiteralTermType\n}\n\n/** TypeGuard for RDF/JS spec Quads */\nexport function isQuad(obj: any): obj is Quad<any, any, any, any> {\n  return typeof obj === \"object\" && obj !== null && (\n    'subject' in obj\n    && 'predicate' in obj\n    && 'object' in obj\n  )\n}\n\n/** TypeGuard for RDF/JS spec NamedNodes */\nexport function isNamedNode(obj: any): obj is NamedNode {\n  return isTerm(obj) && obj.termType === 'NamedNode'\n}\n\n/** TypeGuard for RDF/JS spec BlankNodes */\nexport function isBlankNode(obj: any): obj is BlankNode {\n  return isTerm(obj) && 'termType' in obj && obj.termType === 'BlankNode'\n}\n\n/** TypeGuard for valid RDF/JS spec Subject types */\nexport function isSubject(obj: any): obj is Quad_Subject {\n  return isTerm(obj) && (\n    obj.termType === NamedNodeTermType ||\n    obj.termType === VariableTermType ||\n    obj.termType === BlankNodeTermType\n  )\n}\n\n/** TypeGuard for valid RDF/JS spec Predicate types */\nexport function isPredicate(obj: any): obj is Quad_Predicate {\n  return isTerm(obj) && (\n    obj.termType === NamedNodeTermType ||\n    obj.termType === VariableTermType\n  )\n}\n\n/** TypeGuard for valid RDF/JS spec Object types */\nexport function isRDFObject(obj: any): obj is Quad_Object {\n  return isTerm(obj) && (\n    obj.termType === NamedNodeTermType ||\n    obj.termType === VariableTermType ||\n    obj.termType === BlankNodeTermType ||\n    obj.termType === LiteralTermType\n  )\n}\n\n/** TypeGuard for valid RDF/JS Graph types */\nexport function isGraph(obj: any): obj is Quad_Graph {\n  return isTerm(obj) && (\n    obj.termType === NamedNodeTermType ||\n    obj.termType === VariableTermType ||\n    obj.termType === BlankNodeTermType ||\n    obj.termType === DefaultGraphTermType\n  )\n}\n","import ClassOrder from './class-order'\nimport Node from './node-internal'\nimport { NamedNodeTermType } from './types'\nimport { termValue } from './utils/termValue'\nimport { NamedNode as TFNamedNode } from './tf-types'\nimport { isTerm } from './utils/terms'\n\n/**\n * A named (IRI) RDF node\n */\nexport default class NamedNode extends Node implements TFNamedNode {\n  termType: typeof NamedNodeTermType = NamedNodeTermType\n  classOrder = ClassOrder.NamedNode\n\n  /**\n   * Create a named (IRI) RDF Node\n   * @constructor\n   * @param iri - The IRI for this node\n   */\n  constructor (iri: string) {\n    super(termValue(iri))\n\n    if (!this.value) {\n      throw new Error('Missing IRI for NamedNode')\n    }\n\n    if (!this.value.includes(':')) {\n      throw new Error('NamedNode IRI \"' + iri + '\" must be absolute.')\n    }\n\n    if (this.value.includes(' ')) {\n      var message = 'Error: NamedNode IRI \"' + iri + '\" must not contain unencoded spaces.'\n      throw new Error(message)\n    }\n  }\n\n  /**\n   * Returns an $rdf node for the containing directory, ending in slash.\n   */\n  dir (): NamedNode | null {\n     var str = this.value.split('#')[0]\n     var p = str.slice(0, -1).lastIndexOf('/')\n     var q = str.indexOf('//')\n     if ((q >= 0 && p < q + 2) || p < 0) return null\n     return new NamedNode(str.slice(0, p + 1))\n   }\n\n  /**\n   * Returns an NN for the whole web site, ending in slash.\n   * Contrast with the \"origin\" which does NOT have a trailing slash\n   */\n  site (): NamedNode {\n     var str = this.value.split('#')[0]\n     var p = str.indexOf('//')\n     if (p < 0) throw new Error('This URI does not have a web site part (origin)')\n     var q = str.indexOf('/', p+2)\n     if (q < 0) {\n       return new NamedNode(str.slice(0) + '/')   // Add slash to a bare origin\n     } else {\n       return new NamedNode(str.slice(0, q + 1))\n     }\n   }\n\n  /**\n   * Creates the fetchable named node for the document.\n   * Removes everything from the # anchor tag.\n   */\n  doc (): NamedNode {\n    if (this.value.indexOf('#') < 0) {\n      return this\n    } else {\n      return new NamedNode(this.value.split('#')[0])\n    }\n  }\n\n  /**\n   * Returns the URI including <brackets>\n   */\n  toString (): string {\n    return '<' + this.value + '>'\n  }\n\n  /** The local identifier with the document */\n  id (): string {\n    return this.value.split('#')[1]\n  }\n\n  /** Alias for value, favored by Tim */\n  get uri (): string {\n    return this.value\n  }\n\n  set uri (uri: string) {\n    this.value = uri\n  }\n\n  /**\n   * Creates a named node from the specified input value\n   * @param value - An input value\n   */\n  static fromValue (value) {\n    if (typeof value === 'undefined' || value === null) {\n      return value\n    }\n    if (isTerm(value)) {\n      return value\n    }\n    return new NamedNode(value)\n  }\n}\n","function _getPrototypeOf(o) {\n  module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  module.exports[\"default\"] = module.exports, module.exports.__esModule = true;\n  return _getPrototypeOf(o);\n}\n\nmodule.exports = _getPrototypeOf;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","/**\n * Utility functions for $rdf\n * @module util\n */\nimport { docpart } from './uri'\nimport log from './log'\nimport * as uri from './uri'\nimport NamedNode from './named-node'\n\nconst string = { template: stringTemplate }\n\nexport { log, uri, string }\n\nexport function mediaTypeClass(mediaType){\n  mediaType = mediaType.split(';')[0].trim()  // remove media type parameters\n  return new NamedNode('http://www.w3.org/ns/iana/media-types/' + mediaType + '#Resource')\n}\n\nexport function linkRelationProperty(relation){\n  return new NamedNode('http://www.w3.org/ns/iana/link-relations/relation#' + relation.trim())\n}\n\n/**\n * Adds callback functionality to an object.\n * Callback functions are indexed by a 'hook' string.\n * They return true if they want to be called again.\n * @method callbackify\n * @param obj {Object}\n * @param callbacks {Array<string>}\n */\nexport function callbackify (obj, callbacks) {\n  obj.callbacks = {}\n  for (var x = callbacks.length - 1; x >= 0; x--) {\n    obj.callbacks[callbacks[x]] = []\n  }\n\n  obj.addHook = function (hook) {\n    if (!obj.callbacks[hook]) {\n      obj.callbacks[hook] = []\n    }\n  }\n\n  obj.addCallback = function (hook, func) {\n    obj.callbacks[hook].push(func)\n  }\n\n  obj.removeCallback = function (hook, funcName) {\n    for (var i = 0;i < obj.callbacks[hook].length;i++) {\n      if (obj.callbacks[hook][i].name === funcName) {\n        obj.callbacks[hook].splice(i, 1)\n        return true\n      }\n    }\n    return false\n  }\n\n  obj.insertCallback = function (hook, func) {\n    obj.callbacks[hook].unshift(func)\n  }\n\n  obj.fireCallbacks = function fireCallbacks (hook, args) {\n    var newCallbacks = []\n    var replaceCallbacks = []\n    var len = obj.callbacks[hook].length\n    var x\n    let callback\n\n    // log.info('!@$ Firing '+hook+' call back with length'+len)\n    for (x = len - 1; x >= 0; x--) {\n      // log.info('@@ Firing '+hook+' callback '+ obj.callbacks[hook][x])\n      callback = obj.callbacks[hook][x]\n      if (callback && callback.apply(obj, args)) {\n        newCallbacks.push(callback)\n      }\n    }\n\n    for (x = newCallbacks.length - 1; x >= 0; x--) {\n      replaceCallbacks.push(newCallbacks[x])\n    }\n\n    for (x = len; x < obj.callbacks[hook].length; x++) {\n      replaceCallbacks.push(obj.callbacks[hook][x])\n    }\n\n    obj.callbacks[hook] = replaceCallbacks\n  }\n}\n\n/**\n * Returns a DOM parser based on current runtime environment.\n */\nexport function DOMParserFactory () {\n  if (window.DOMParser) {\n    return new DOMParser()\n  } else if (window.ActiveXObject) {\n    return new ActiveXObject('Microsoft.XMLDOM')\n  } else {\n    return false\n  }\n}\n\n// From https://github.com/linkeddata/dokieli\nexport function domToString (node, options) {\n  options = options || {}\n  var selfClosing = []\n  if (options && options.selfClosing) {\n    options.selfClosing.split(' ').forEach(function (n) {\n      selfClosing[n] = true\n    })\n  }\n  var skipAttributes = []\n  if (options && options.skipAttributes) {\n    options.skipAttributes.split(' ').forEach(function (n) {\n      skipAttributes[n] = true\n    })\n  }\n  return dumpNode(node, options, selfClosing, skipAttributes)\n}\n\nexport function dumpNode (node, options, selfClosing, skipAttributes) {\n  var i\n  var out = ''\n  var noEsc = [ false ]\n  if (typeof node.nodeType === 'undefined') return out\n  if (node.nodeType === 1) {\n    if (node.hasAttribute('class') && (options && options.classWithChildText) && node.matches(options.classWithChildText.class)) {\n      out += node.querySelector(options.classWithChildText.element).textContent\n    } else if (!((options && options.skipNodeWithClass) && node.matches('.' + options.skipNodeWithClass))) {\n      var ename = node.nodeName.toLowerCase()\n      out += '<' + ename\n\n      var attrList = []\n      for (i = node.attributes.length - 1; i >= 0; i--) {\n        var atn = node.attributes[i]\n        if (skipAttributes && skipAttributes.length > 0 && skipAttributes[atn.name]) continue\n        if (/^\\d+$/.test(atn.name)) continue\n        if (atn.name === 'class' && (options && options.replaceClassItemWith) && (atn.value.split(' ').indexOf(options.replaceClassItemWith.source) > -1)) {\n          var re = new RegExp(options.replaceClassItemWith.source, 'g')\n          atn.value = atn.value.replace(re, options.replaceClassItemWith.target).trim()\n        }\n        if (!(atn.name === 'class' && (options && options.skipClassWithValue) && options.skipClassWithValue === atn.value)) {\n          attrList.push(atn.name + '=\\'' + atn.value.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;').replace(/'/g, '&quot;') + '\\'')\n        }\n      }\n      if (attrList.length > 0) {\n        if (options && options.sortAttributes) {\n          attrList.sort(function (a, b) {\n            return a.toLowerCase().localeCompare(b.toLowerCase())\n          })\n        }\n        out += ' ' + attrList.join(' ')\n      }\n      if (selfClosing && selfClosing.ename) {\n        out += ' />'\n      } else {\n        out += '>'\n        out += (ename === 'html') ? '\\n  ' : ''\n        noEsc.push(ename === 'style' || ename === 'script')\n        for (i = 0; i < node.childNodes.length; i++) out += dumpNode(node.childNodes[i])\n        noEsc.pop()\n        out += (ename === 'body') ? '</' + ename + '>' + '\\n' : '</' + ename + '>'\n      }\n    }\n  } else if (node.nodeType === 8) {\n    // FIXME: If comments are not tabbed in source, a new line is not prepended\n    out += '<!--' + node.nodeValue + '-->'\n  } else if (node.nodeType === 3 || node.nodeType === 4) {\n    // XXX: Remove new lines which were added after DOM ready\n    var nl = node.nodeValue.replace(/\\n+$/, '')\n    out += noEsc[noEsc.length - 1] ? nl : nl.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;')\n  } else {\n    console.log('Warning; Cannot handle serialising nodes of type: ' + node.nodeType)\n    console.log(node)\n  }\n  return out\n}\n\nexport function dtstamp () {\n  var now = new Date()\n  var year = now.getYear() + 1900\n  var month = now.getMonth() + 1\n  var day = now.getDate()\n  var hour = now.getUTCHours()\n  var minute = now.getUTCMinutes()\n  var second = now.getSeconds()\n  if (month < 10) month = '0' + month\n  if (day < 10) day = '0' + day\n  if (hour < 10) hour = '0' + hour\n  if (minute < 10) minute = '0' + minute\n  if (second < 10) second = '0' + second\n  return year + '-' + month + '-' + day + 'T' +\n    hour + ':' + minute + ':' + second + 'Z'\n}\n\n/**\n * Compares statements (heavy comparison for repeatable canonical ordering)\n */\nexport function heavyCompare (x, y, g, uriMap) {\n  var nonBlank = function (x) {\n    return (x.termType === 'BlankNode') ? null : x\n  }\n  var signature = function (x) {\n    var lis = g.statementsMatching(x).map(function (st) {\n      return ('' + nonBlank(st.subject) + ' ' + nonBlank(st.predicate) +\n        ' ' + nonBlank(st.object))\n    }).concat(g.statementsMatching(undefined, undefined, x).map(function (st) {\n      return ('' + nonBlank(st.subject) + ' ' + nonBlank(st.predicate) +\n        ' ' + nonBlank(st.object))\n    }))\n    lis.sort()\n    return lis.join('\\n')\n  }\n  const comparison = Object.prototype.hasOwnProperty.call(g, \"compareTerms\")\n    ? g.compareTerms(x, y)\n    : x.compareTerm(y)\n\n  if ((x.termType === 'BlankNode') && (y.termType === 'BlankNode')) {\n    if (comparison === 0) return 0 // Same\n    if (signature(x) > signature(y)) return +1\n    if (signature(x) < signature(y)) return -1\n    return comparison  // Too bad -- this order not canonical.\n    // throw \"different bnodes indistinquishable for sorting\"\n  } else {\n    if (uriMap && x.uri && y.uri){\n      return (uriMap[x.uri] || x.uri).localeCompare(uriMap[y.uri] || y.uri)\n    }\n    return comparison\n  }\n}\n\nexport function heavyCompareSPO (x, y, g, uriMap) {\n  return heavyCompare(x.subject, y.subject, g, uriMap) ||\n    heavyCompare(x.predicate, y.predicate, g, uriMap) ||\n    heavyCompare(x.object, y.object, g, uriMap)\n}\n\n/**\n * Defines a simple debugging function\n * @method output\n * @param o {String}\n */\nexport function output (o) {\n  var k = document.createElement('div')\n  k.textContent = o\n  document.body.appendChild(k)\n}\n\nimport { DOMParser } from 'xmldom'\n\n/**\n * Returns a DOM from parsex XML.\n */\nexport function parseXML (str, options) {\n  var dparser\n  options = options || {}\n  if (typeof module !== 'undefined' && module && module.exports) { // Node.js\n    var dom = new DOMParser().parseFromString(str, options.contentType || 'application/xhtml+xml')\n    return dom\n  } else {\n    if (typeof window !== 'undefined' && window.DOMParser) {\n      dparser = new window.DOMParser() // seems to actually work\n    } else {\n      dparser = new DOMParser() // Doc says this works\n    }\n  }\n  return dparser.parseFromString(str, 'application/xml')\n}\n\n/**\n * Removes all statements equal to x from a\n */\nexport function RDFArrayRemove (a, x) {\n  for (var i = 0; i < a.length; i++) {\n    // TODO: This used to be the following, which didnt always work..why\n    // if(a[i] === x)\n    if (a[i].subject.equals(x.subject) &&\n      a[i].predicate.equals(x.predicate) &&\n      a[i].object.equals(x.object) &&\n      a[i].why.equals(x.why)) {\n      a.splice(i, 1)\n      return\n    }\n  }\n  throw new Error('RDFArrayRemove: Array did not contain ' + x + ' ' + x.why)\n}\n\nexport function string_startswith (str, pref) { // missing library routines\n  return (str.slice(0, pref.length) === pref)\n}\n\n/**\n * C++, python style %s -> subs\n */\nfunction stringTemplate (base, subs) {\n  var baseA = base.split('%s')\n  var result = ''\n  for (var i = 0;i < subs.length;i++) {\n    subs[i] += ''\n    result += baseA[i] + subs[i]\n  }\n  return result + baseA.slice(subs.length).join()\n}\n\n\n// Stack dump on errors - to pass errors back\n\nexport function stackString (e) {\n  var str = '' + e + '\\n'\n  if (!e.stack) {\n    return str + 'No stack available.\\n'\n  }\n  var lines = e.stack.toString().split('\\n')\n  var toprint = []\n  for (var i = 0; i < lines.length; i++) {\n    var line = lines[i]\n    if (line.indexOf('ecmaunit.js') > -1) {\n      // remove useless bit of traceback\n      break\n    }\n    if (line.charAt(0) == '(') {\n      line = 'function' + line\n    }\n    var chunks = line.split('@')\n    toprint.push(chunks)\n  }\n  // toprint.reverse();  No - I prefer the latest at the top by the error message -tbl\n\n  for (var i = 0; i < toprint.length; i++) {\n    str += '  ' + toprint[i][1] + '\\n    ' + toprint[i][0]\n  }\n  return str\n}\n","import { ValueType, Bindings, FromValueReturns, TermType } from './types'\nimport { Term } from './tf-types'\n\n/**\n * The superclass of all RDF Statement objects, that is\n * NamedNode, Literal, BlankNode, etc.\n * Should not be instantiated directly.\n * Also called Term.\n * @link https://rdf.js.org/data-model-spec/#term-interface\n * @class Node\n */\nexport default abstract class Node {\n  // Specified in './node.ts' to prevent circular dependency\n  static fromValue: <T extends FromValueReturns>(value: ValueType) => T\n  // Specified in './node.ts' to prevent circular dependency\n  static toJS: (term: any) => Date | Number | string | boolean | object | Array<Date | Number | string | boolean | object>;\n\n  /** The type of node */\n  termType!: TermType;\n\n  /** The class order for this node */\n  classOrder!: number;\n\n  /** The node's value */\n  value: string;\n\n  protected constructor(value: string) {\n    this.value = value\n  }\n\n  /**\n   * Creates the substituted node for this one, according to the specified bindings\n   * @param bindings - Bindings of identifiers to nodes\n   */\n  substitute <T extends Node = Node>(bindings: Bindings): T {\n    console.log('@@@ node substitute' + this)\n    return this as unknown as T\n  }\n\n  /**\n   * Compares this node with another\n   * @see {equals} to check if two nodes are equal\n   * @param other - The other node\n   */\n  compareTerm (other: Node): number {\n    if (this.classOrder < other.classOrder) {\n      return -1\n    }\n    if (this.classOrder > other.classOrder) {\n      return +1\n    }\n    if (this.value < other.value) {\n      return -1\n    }\n    if (this.value > other.value) {\n      return +1\n    }\n    return 0\n  }\n\n  /**\n   * Compares whether the two nodes are equal\n   * @param other The other node\n   */\n  equals (other: Term): boolean {\n    if (!other) {\n      return false\n    }\n    return (this.termType === other.termType) &&\n      (this.value === other.value)\n  }\n\n  /**\n   * Creates a hash for this node\n   * @deprecated use {rdfFactory.id} instead if possible\n   */\n  hashString (): string {\n    return this.toCanonical()\n  }\n\n  /**\n   * Compares whether this node is the same as the other one\n   * @param other - Another node\n   */\n  sameTerm(other: Node): boolean {\n    return this.equals(other)\n\n  }\n\n  /**\n   * Creates a canonical string representation of this node\n   */\n  toCanonical (): string {\n    return this.toNT()\n  }\n\n  /**\n   * Creates a n-triples string representation of this node\n   */\n  toNT (): string {\n    return this.toString()\n  }\n\n  /**\n   * Creates a n-quads string representation of this node\n   */\n  toNQ (): string {\n    return this.toNT();\n  }\n\n  /**\n   * Creates a string representation of this node\n   */\n  toString (): string {\n    throw new Error('Node.toString() is abstract - see the subclasses instead')\n  }\n}\n","var setPrototypeOf = require(\"./setPrototypeOf.js\");\n\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}\n\nmodule.exports = _inherits;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","import RDFlibNamedNode from './named-node'\nimport { RdfJsDataFactory, NamedNode } from './tf-types'\n\n/**\n * Gets a namespace for the specified namespace's URI\n * @param nsuri - The URI for the namespace\n * @param [factory] - The factory for creating named nodes with\n */\nexport default function Namespace (nsuri: string, factory?: RdfJsDataFactory): (ln: string) => NamedNode {\n  const dataFactory = factory || { namedNode: (value) => new RDFlibNamedNode(value) as NamedNode }\n\n  return function (ln: string): NamedNode {\n    return dataFactory.namedNode(nsuri + (ln || ''))\n  }\n}\n","var _typeof = require(\"@babel/runtime/helpers/typeof\")[\"default\"];\n\nvar assertThisInitialized = require(\"./assertThisInitialized.js\");\n\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  } else if (call !== void 0) {\n    throw new TypeError(\"Derived constructors may only return object or undefined\");\n  }\n\n  return assertThisInitialized(self);\n}\n\nmodule.exports = _possibleConstructorReturn;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","import Fetcher from './fetcher'\nimport log from './log'\nimport { docpart } from './uri'\nimport { string_startswith } from './utils-js'\nimport { RdfJsDataFactory, Quad, Quad_Subject, Term } from './tf-types'\n\n/** RDF/JS spec Typeguards */\n\n/**\n * Loads ontologies of the data we load (this is the callback from the kb to\n * the fetcher).\n */\nexport function AJAR_handleNewTerm (kb: { fetcher: Fetcher }, p, requestedBy) {\n  var sf: Fetcher | null = null\n  if (typeof kb.fetcher !== 'undefined') {\n    sf = kb.fetcher\n  } else {\n    return\n  }\n  if (p.termType !== 'NamedNode') return\n  var docuri = docpart(p.uri)\n  var fixuri\n  if (p.uri.indexOf('#') < 0) { // No hash\n    // @@ major hack for dbpedia Categories, which spread indefinitely\n    if (string_startswith(p.uri, 'http://dbpedia.org/resource/Category:')) return\n\n    /*\n      if (string_startswith(p.uri, 'http://xmlns.com/foaf/0.1/')) {\n      fixuri = \"http://dig.csail.mit.edu/2005/ajar/ajaw/test/foaf\"\n      // should give HTTP 303 to ontology -- now is :-)\n      } else\n    */\n    if (string_startswith(p.uri,\n            'http://purl.org/dc/elements/1.1/') ||\n          string_startswith(p.uri, 'http://purl.org/dc/terms/')) {\n      fixuri = 'http://dublincore.org/2005/06/13/dcq'\n    // dc fetched multiple times\n    } else if (string_startswith(p.uri, 'http://xmlns.com/wot/0.1/')) {\n      fixuri = 'http://xmlns.com/wot/0.1/index.rdf'\n    } else if (string_startswith(p.uri, 'http://web.resource.org/cc/')) {\n      //            log.warn(\"creative commons links to html instead of rdf. doesn't seem to content-negotiate.\")\n      fixuri = 'http://web.resource.org/cc/schema.rdf'\n    }\n  }\n  if (fixuri) {\n    docuri = fixuri\n  }\n  if (sf && (sf as Fetcher).getState(docuri) !== 'unrequested') return\n\n  if (fixuri) { // only give warning once: else happens too often\n    log.warn('Assuming server still broken, faking redirect of <' + p.uri +\n      '> to <' + docuri + '>')\n  }\n\n  return (sf as any).fetch(docuri, { referringTerm: requestedBy })\n}\n\nexport const appliedFactoryMethods = [\n  'blankNode',\n  'defaultGraph',\n  'literal',\n  'namedNode',\n  'quad',\n  'variable',\n  'supports',\n]\n\nconst rdf = {\n  first: 'http://www.w3.org/1999/02/22-rdf-syntax-ns#first',\n  rest: 'http://www.w3.org/1999/02/22-rdf-syntax-ns#rest',\n  nil: 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil'\n}\n\n/**\n * Expands an array of Terms to a set of statements representing the rdf:list.\n * @param rdfFactory - The factory to use\n * @param subject - The iri of the first list item.\n * @param data - The terms to expand into the list.\n * @return The {data} as a set of statements.\n */\nexport function arrayToStatements(\n  rdfFactory: RdfJsDataFactory,\n  subject: Quad_Subject,\n  data: Term[]\n): Quad[] {\n  const statements: Quad[] = []\n\n  data.reduce<Quad_Subject>((id, _listObj, i, listData) => {\n    statements.push(rdfFactory.quad(id, rdfFactory.namedNode(rdf.first), listData[i]))\n\n    let nextNode\n    if (i < listData.length - 1) {\n      nextNode = rdfFactory.blankNode()\n      statements.push(rdfFactory.quad(id, rdfFactory.namedNode(rdf.rest), nextNode))\n    } else {\n      statements.push(rdfFactory.quad(id, rdfFactory.namedNode(rdf.rest), rdfFactory.namedNode(rdf.nil)))\n    }\n\n    return nextNode\n  }, subject)\n\n  return statements\n}\n\nexport function ArrayIndexOf (arr, item, i: number = 0) {\n  var length = arr.length\n  if (i < 0) i = length + i\n  for (; i < length; i++) {\n    if (arr[i] === item) {\n      return i\n    }\n  }\n  return -1\n}\n","/**\n* Class orders\n*/\nconst ClassOrder: {\n  [id: string]: number;\n} = {\n  'Literal': 1,\n  'Collection': 3,\n  'Graph': 4,\n  'NamedNode': 5,\n  'BlankNode': 6,\n  'Variable': 7\n}\n\nexport default ClassOrder\n","import BlankNode from '../blank-node'\nimport Literal from '../literal'\nimport NamedNode from '../named-node'\nimport Statement from '../statement'\nimport Variable from '../variable'\nimport {\n  SubjectType,\n  PredicateType,\n  ObjectType,\n  GraphType,\n  EmptyTermType,\n  DefaultGraphTermType,\n  VariableTermType,\n  BlankNodeTermType,\n  LiteralTermType,\n  NamedNodeTermType,\n  CollectionTermType,\n  GraphTermType,\n} from '../types'\nimport DefaultGraph from '../default-graph'\nimport {\n  Comparable,\n  DataFactory,\n  DefaultFactoryTypes,\n  Feature,\n} from './factory-types'\nimport { isQuad, isTerm } from '../utils/terms'\nimport { NamedNode as TFNamedNode, Quad, Term } from '../tf-types'\nimport Collection from \"../collection\";\n\nexport { defaultGraphURI } from '../utils/default-graph-uri'\n\n/**\n * Gets the default graph\n */\nconst defaultGraph = new DefaultGraph()\n\n/** A basic internal RDFlib datafactory, which does not support Collections  */\nconst CanonicalDataFactory: DataFactory = {\n\n  supports: {\n    [Feature.collections]: false,\n    [Feature.defaultGraphType]: false,\n    [Feature.equalsMethod]: true,\n    [Feature.identity]: false,\n    [Feature.id]: true,\n    [Feature.reversibleId]: false,\n    [Feature.variableType]: true,\n  },\n\n  /**\n   * Creates a new blank node\n   * @param value - The blank node's identifier\n   */\n  blankNode(value?: string): BlankNode {\n    return new BlankNode(value)\n  },\n\n  defaultGraph: () => defaultGraph,\n\n  /**\n   * Compares to (rdf) objects for equality.\n   */\n  equals(a: Comparable, b: Comparable): boolean {\n    if (a === b || !a || !b) {\n      return true\n    }\n\n    if (isQuad(a) || isQuad(b)) {\n      if (isQuad(a) && isQuad(b)) {\n        return (\n          this.equals(a.subject, b.subject) &&\n          this.equals(a.predicate, b.predicate) &&\n          this.equals(a.object, b.object) &&\n          this.equals(a.graph, b.graph)\n        )\n      }\n\n      return false\n    }\n\n    if (isTerm(a) && isTerm(b)) {\n      return this.id(a) === this.id(b)\n    }\n\n    return false\n  },\n\n  /**\n   * Generates a uniquely identifiably *idempotent* string for the given {term}.\n   *\n   * Equivalent to [[Term.hashString]]\n   *\n   * @example Use this to associate data with a term in an object\n   *   { obj[id(term)] = \"myData\" }\n   */\n  id (term: Term | Statement | undefined): string {\n    if (!term) {\n      return 'undefined'\n    }\n\n    if (isQuad(term)) {\n      return this.quadToNQ(term)\n    }\n\n    switch (term.termType) {\n      case DefaultGraphTermType:\n        return 'defaultGraph'\n      case VariableTermType:\n        return Variable.toString(term)\n      default:\n        const nq = this.termToNQ(term)\n        if (nq) {\n          return nq\n        }\n\n        throw new Error(`Can't id term with type '${term.termType}'`)\n    }\n  },\n\n  isQuad (obj: any): obj is Statement {\n    return obj instanceof Statement\n  },\n\n  /**\n   * Creates a new literal node. Does some JS literal parsing for ease of use.\n   * @param value - The lexical value\n   * @param languageOrDatatype - Either the language or the datatype\n   */\n  literal(\n    value: string | number | boolean | Date,\n    languageOrDatatype?: string | TFNamedNode\n  ): Literal {\n    if (typeof value !== \"string\" && !languageOrDatatype) {\n      return Literal.fromValue(value)\n    }\n\n    const strValue = typeof value === 'string' ? value : '' + value\n    if (typeof languageOrDatatype === 'string') {\n      if (languageOrDatatype.indexOf(':') === -1) {\n        return new Literal(strValue, languageOrDatatype)\n      } else {\n        return new Literal(strValue, null, this.namedNode(languageOrDatatype))\n      }\n    } else {\n      return new Literal(strValue, null, languageOrDatatype)\n    }\n  },\n\n  /**\n   * Creates a new named node\n   * @param value - The new named node\n   */\n  namedNode(value: string): NamedNode {\n    return new NamedNode(value)\n  },\n\n  /**\n   * Creates a new statement\n   * @param subject - The subject\n   * @param predicate - The predicate\n   * @param object - The object\n   * @param graph - The containing graph\n   */\n  quad<\n    S extends SubjectType = SubjectType,\n    P extends PredicateType = PredicateType,\n    O extends ObjectType = ObjectType,\n    G extends GraphType = GraphType\n  >(subject: S, predicate: P, object: O, graph?: G): Statement<S, P, O, G | DefaultGraph> {\n    return new Statement(subject, predicate, object, graph || defaultGraph)\n  },\n\n  /**\n   * Creates a new statement\n   * @param subject - The subject\n   * @param predicate - The predicate\n   * @param object - The object\n   * @param graph - The containing graph\n   */\n  triple(\n    subject: Term | SubjectType,\n    predicate: Term | PredicateType,\n    object: Term | ObjectType,\n    graph?: Term | GraphType\n  ): Statement {\n    return this.quad(subject, predicate, object, graph)\n  },\n\n  quadToNQ(q: Statement | Quad): string {\n    return `${this.termToNQ(q.subject)} ${this.termToNQ(q.predicate)} ${this.termToNQ(q.object)} ${this.termToNQ(q.graph)} .`;\n  },\n\n  /** Stringify a {term} to n-quads serialization. */\n  termToNQ(term: Term): string {\n    switch (term.termType) {\n      case BlankNodeTermType:\n        return '_:' + term.value\n      case DefaultGraphTermType:\n        return ''\n      case EmptyTermType:\n        return '<http://www.w3.org/1999/02/22-rdf-syntax-ns#nil>'\n      case LiteralTermType:\n        return Literal.toNT(term as Literal)\n      case GraphTermType:\n      case NamedNodeTermType:\n        return '<' + term.value + '>'\n      case CollectionTermType:\n        return '(' + (term as Collection).elements.map(t => this.termToNQ(t)).join(' ') + ')'\n      default:\n        throw new Error(`Can't serialize nonstandard term type (was '${term.termType}')`)\n    }\n  },\n\n  /** Convert an rdf object (term or quad) to n-quads serialization. */\n  toNQ (term: Term | (DefaultFactoryTypes & Variable)): string {\n    if (this.isQuad(term)) {\n      return this.quadToNQ(term);\n    }\n\n    return this.termToNQ(term);\n  },\n\n  /**\n   * Creates a new variable\n   * @param name - The name for the variable\n   */\n  variable(name?: string): Variable {\n    return new Variable(name)\n  },\n}\n\n/** Contains the factory methods as defined in the spec, plus id */\nexport default CanonicalDataFactory\n","import NamedNode from './named-node';\n\nexport default {\n  boolean: new NamedNode('http://www.w3.org/2001/XMLSchema#boolean'),\n  dateTime: new NamedNode('http://www.w3.org/2001/XMLSchema#dateTime'),\n  decimal: new NamedNode('http://www.w3.org/2001/XMLSchema#decimal'),\n  double: new NamedNode('http://www.w3.org/2001/XMLSchema#double'),\n  integer: new NamedNode('http://www.w3.org/2001/XMLSchema#integer'),\n  langString: new NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#langString'),\n  string: new NamedNode('http://www.w3.org/2001/XMLSchema#string'),\n}\n","import ClassOrder from './class-order'\nimport RDFlibNamedNode from './named-node'\nimport Node from './node-internal'\nimport {\n  FromValueReturns,\n  LiteralTermType,\n  ValueType\n} from './types'\nimport { isLiteral } from './utils/terms'\nimport XSD from './xsd-internal'\nimport { Literal as TFLiteral, Term } from './tf-types'\n\n/**\n * An RDF literal, containing some value which isn't expressed as an IRI.\n * @link https://rdf.js.org/data-model-spec/#literal-interface\n */\nexport default class Literal extends Node implements TFLiteral {\n  termType: typeof LiteralTermType = LiteralTermType\n\n  classOrder = ClassOrder.Literal\n\n  /**\n   * The literal's datatype as a named node\n   */\n  datatype: RDFlibNamedNode = XSD.string\n\n  isVar = 0\n\n  /**\n   * The language for the literal\n   */\n  language: string = ''\n\n  /**\n   * Initializes a literal\n   * @param value - The literal's lexical value\n   * @param language - The language for the literal. Defaults to ''.\n   * @param datatype - The literal's datatype as a named node. Defaults to xsd:string.\n   */\n  constructor (value: string, language?: string | null, datatype?) {\n    super(value)\n\n    if (language) {\n      this.language = language\n      this.datatype = XSD.langString\n    } else if (datatype) {\n      this.datatype = RDFlibNamedNode.fromValue(datatype)\n    } else {\n      this.datatype = XSD.string\n    }\n  }\n\n  /**\n   * Gets a copy of this literal\n   */\n  copy (): Literal {\n    return new Literal(this.value, this.lang, this.datatype)\n  }\n\n  /**\n   * Gets whether two literals are the same\n   * @param other The other statement\n   */\n  equals (other: Term): boolean {\n    if (!other) {\n      return false\n    }\n\n    return (this.termType === other.termType) &&\n      (this.value === other.value) &&\n      (this.language === (other as Literal).language) &&\n      ((!this.datatype && !(other as Literal).datatype) ||\n        (this.datatype && this.datatype.equals((other as Literal).datatype)))\n  }\n\n  /**\n   * The language for the literal\n   * @deprecated use {language} instead\n   */\n  get lang (): string {\n    return this.language\n  }\n\n  set lang (language: string) {\n    this.language = language || ''\n  }\n\n  toNT(): string {\n    return Literal.toNT(this)\n  }\n\n  /** Serializes a literal to an N-Triples string */\n  static toNT (literal: Literal): string {\n    if (typeof literal.value === 'number') {\n      return '' + literal.value\n    } else if (typeof literal.value !== 'string') {\n      throw new Error('Value of RDF literal is not string or number: ' +\n        literal.value)\n    }\n    var str = literal.value\n    // #x22 (\"), #x5C (\\), #x0A (\\n) and #xD (\\r) are disallowed and need to be replaced\n    // see https://www.w3.org/TR/n-triples/#grammar-production-STRING_LITERAL_QUOTE\n    str = str.replace(/\\\\/g, '\\\\\\\\')\n    str = str.replace(/\\\"/g, '\\\\\"')\n    str = str.replace(/\\n/g, '\\\\n')\n    str = str.replace(/\\r/g, '\\\\r')\n    str = '\"' + str + '\"'\n\n    if (literal.language) {\n      str += '@' + literal.language\n    } else if (!literal.datatype.equals(XSD.string)) {\n      // Only add datatype if it's not a string\n      str += '^^' + literal.datatype.toCanonical()\n    }\n    return str\n  }\n\n  toString () {\n    return '' + this.value\n  }\n\n  /**\n   * Builds a literal node from a boolean value\n   * @param value - The value\n   */\n  static fromBoolean (value: boolean): Literal {\n    let strValue = value ? '1' : '0'\n    return new Literal(strValue, null, XSD.boolean)\n  }\n\n  /**\n   * Builds a literal node from a date value\n   * @param value The value\n   */\n  static fromDate(value: Date): Literal {\n    if (!(value instanceof Date)) {\n      throw new TypeError('Invalid argument to Literal.fromDate()')\n    }\n    let d2 = function (x) {\n      return ('' + (100 + x)).slice(1, 3)\n    }\n    let date = '' + value.getUTCFullYear() + '-' + d2(value.getUTCMonth() + 1) +\n      '-' + d2(value.getUTCDate()) + 'T' + d2(value.getUTCHours()) + ':' +\n      d2(value.getUTCMinutes()) + ':' + d2(value.getUTCSeconds()) + 'Z'\n    return new Literal(date, null, XSD.dateTime)\n  }\n\n  /**\n   * Builds a literal node from a number value\n   * @param value - The value\n   */\n  static fromNumber(value: number): Literal {\n    if (typeof value !== 'number') {\n      throw new TypeError('Invalid argument to Literal.fromNumber()')\n    }\n    let datatype: RDFlibNamedNode\n    const strValue = value.toString()\n    if (strValue.indexOf('e') < 0 && Math.abs(value) <= Number.MAX_SAFE_INTEGER) {\n      datatype = Number.isInteger(value) ? XSD.integer : XSD.decimal\n    } else {\n      datatype = XSD.double\n    }\n    return new Literal(strValue, null, datatype)\n  }\n\n  /**\n   * Builds a literal node from an input value\n   * @param value - The input value\n   */\n  static fromValue<T extends FromValueReturns>(value: ValueType): T {\n    if (isLiteral(value)) {\n      return value as unknown as T\n    }\n    switch (typeof value) {\n      case 'object':\n        if (value instanceof Date) {\n          return Literal.fromDate(value) as unknown as T\n        }\n      case 'boolean':\n        return Literal.fromBoolean(value as boolean) as unknown as T\n      case 'number':\n        return Literal.fromNumber(value as number) as unknown as T\n      case 'string':\n        return new Literal(value) as unknown as T\n    }\n\n    throw new Error(\"Can't make literal from \" + value + ' of type ' +\n      typeof value)\n  }\n}\n","import Literal from '../literal'\nimport Statement from '../statement'\nimport NamedNode from '../named-node'\nimport BlankNode from '../blank-node'\nimport Variable from '../variable'\nimport DefaultGraph from '../default-graph'\nimport {\n  BlankNode as TFBlankNode,\n  RdfJsDataFactory,\n  Literal as TFLiteral,\n  NamedNode as TFNamedNode,\n  Quad,\n  Term,\n  Variable as TFVariable,\n} from '../tf-types'\n\nexport type Comparable = Term | TFNamedNode | TFBlankNode | TFLiteral | Quad | undefined | null\n\nexport type DefaultFactoryTypes = NamedNode | BlankNode | Literal | Variable | Statement\n\nexport type Indexable = number | string\n\nexport type Namespace = (term:string) => TFNamedNode\n\n/** A set of features that may be supported by a Data Factory */\nexport type SupportTable = Record<Feature, boolean>\n\nexport type TFIDFactoryTypes = TFNamedNode | TFBlankNode | TFLiteral | Quad | TFVariable | Term\n\nexport enum Feature {\n  /** Whether the factory supports termType:Collection terms */\n  collections = \"COLLECTIONS\",\n  /** Whether the factory supports termType:DefaultGraph terms */\n  defaultGraphType = \"DEFAULT_GRAPH_TYPE\",\n  /** Whether the factory supports equals on produced instances */\n  equalsMethod = \"EQUALS_METHOD\",\n  /** Whether the factory can create a unique idempotent identifier for the given term. */\n  id = \"ID\",\n  /**\n   * Whether the factory will return the same instance for subsequent calls.\n   * This implies `===`, which means methods like `indexOf` can be used.\n   */\n  identity = \"IDENTITY\",\n  /** Whether the factory supports mapping ids back to instances (should adhere to the identity setting) */\n  reversibleId = \"REVERSIBLE_ID\",\n  /** Whether the factory supports termType:Variable terms */\n  variableType = \"VARIABLE_TYPE\",\n}\n\n/**\n * Defines a DataFactory as used in rdflib, based on the RDF/JS: Data model specification,\n * but with additional extensions\n *\n * bnIndex is optional but useful.\n */\nexport interface DataFactory<\n  FactoryTypes = DefaultFactoryTypes,\n  IndexType = Indexable\n> extends RdfJsDataFactory {\n  /**\n   * BlankNode index\n   * @private\n  */\n  bnIndex?: number\n\n  supports: SupportTable\n\n  namedNode(value: string): NamedNode\n\n  blankNode(value?: string): BlankNode\n\n  literal(value: string, languageOrDatatype?: string | TFNamedNode): Literal\n\n  variable(value: string): Variable,\n\n  defaultGraph(): DefaultGraph,\n\n  isQuad(obj: any): obj is Statement\n\n  equals(a: Comparable, b: Comparable): boolean\n\n  toNQ(term: Term | FactoryTypes): string\n\n  quad(\n    subject: Term,\n    predicate: Term,\n    object: Term,\n    graph?: Term,\n  ): Statement;\n\n  quadToNQ(term: Statement | Quad): string\n\n  termToNQ(term: Term): string\n\n  /**\n   * Generates a unique session-idempotent identifier for the given object.\n   *\n   * @example NQ serialization (reversible from value)\n   * @example MD5 hash of termType + value (irreversible from value, map needed)\n   *\n   * @return {Indexable} A unique value which must also be a valid JS object key type.\n   */\n  id(obj: Term | FactoryTypes): IndexType\n}\n","import ClassOrder from './class-order'\nimport Node from './node-internal'\nimport IndexedFormula from './store'\nimport { BlankNodeTermType } from './types'\nimport { BlankNode as TFBlankNode } from './tf-types'\n\n/**\n * An RDF blank node is a Node without a URI\n * @link https://rdf.js.org/data-model-spec/#blanknode-interface\n */\nexport default class BlankNode extends Node implements TFBlankNode {\n  termType: typeof BlankNodeTermType = BlankNodeTermType;\n  /**\n   * The next unique identifier for blank nodes\n   */\n  static nextId: number = 0;\n  static NTAnonymousNodePrefix: '_:' = '_:'\n\n  private static getId (id: string | unknown): string {\n    if (id) {\n      if (typeof id !== 'string') {\n        console.log('Bad blank id:', id)\n        throw new Error('Bad id argument to new blank node: ' + id)\n      }\n\n      if (id.includes('#')) {\n        // Is a URI with hash fragment\n        let fragments = id.split('#')\n        return fragments[fragments.length - 1]\n      }\n\n      return id\n    }\n\n    return 'n' + BlankNode.nextId++\n  }\n\n  classOrder = ClassOrder.BlankNode\n  /** Whether this is a blank node */\n  isBlank: number = 1\n  /**\n   * This type of node is a variable.\n   *\n   * Note that the existence of this property already indicates that it is a variable.\n   */\n  isVar = 1\n\n  /**\n   * Initializes this node\n   * @param [id] The identifier for the blank node\n   */\n  constructor (id?: string | unknown) {\n    super(BlankNode.getId(id))\n  }\n\n  /**\n   * The identifier for the blank node\n   */\n  public get id (): string {\n    return this.value\n  }\n\n  public set id (value: string) {\n    this.value = value\n  }\n\n  compareTerm (other: BlankNode): number {\n    if (this.classOrder < other.classOrder) {\n      return -1\n    }\n    if (this.classOrder > other.classOrder) {\n      return +1\n    }\n    if (this.id < other.id) {\n      return -1\n    }\n    if (this.id > other.id) {\n      return +1\n    }\n    return 0\n  }\n\n  /**\n   * Gets a copy of this blank node in the specified formula\n   * @param formula The formula\n   */\n  copy (formula: IndexedFormula): BlankNode { // depends on the formula\n    var bnodeNew = new BlankNode()\n    formula.copyTo(this, bnodeNew)\n    return bnodeNew\n  }\n\n  toCanonical () {\n    return BlankNode.NTAnonymousNodePrefix + this.value\n  }\n\n  toString () {\n    return BlankNode.NTAnonymousNodePrefix + this.id\n  }\n}\n","const RDF  = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',\n    XSD  = 'http://www.w3.org/2001/XMLSchema#',\n    SWAP = 'http://www.w3.org/2000/10/swap/';\n\nexport default {\n  xsd: {\n    decimal: `${XSD}decimal`,\n    boolean: `${XSD}boolean`,\n    double:  `${XSD}double`,\n    integer: `${XSD}integer`,\n    string:  `${XSD}string`,\n  },\n  rdf: {\n    type:       `${RDF}type`,\n    nil:        `${RDF}nil`,\n    first:      `${RDF}first`,\n    rest:       `${RDF}rest`,\n    langString: `${RDF}langString`,\n  },\n  owl: {\n    sameAs: 'http://www.w3.org/2002/07/owl#sameAs',\n  },\n  r: {\n    forSome: `${SWAP}reify#forSome`,\n    forAll:  `${SWAP}reify#forAll`,\n  },\n  log: {\n    implies: `${SWAP}log#implies`,\n  },\n};\n","function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    module.exports = _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n\n    module.exports[\"default\"] = module.exports, module.exports.__esModule = true;\n  } else {\n    module.exports = _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n\n    module.exports[\"default\"] = module.exports, module.exports.__esModule = true;\n  }\n\n  return _typeof(obj);\n}\n\nmodule.exports = _typeof;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","import ClassOrder from './class-order'\nimport Node from './node-internal'\nimport { VariableTermType } from './types'\nimport * as Uri from './uri'\nimport { Variable as TFVariable } from './tf-types'\n\n/**\n* Variables are placeholders used in patterns to be matched.\n* In cwm they are symbols which are the formula's list of quantified variables.\n* In sparql they are not visibly URIs.  Here we compromise, by having\n* a common special base URI for variables. Their names are uris,\n* but the ? notation has an implicit base uri of 'varid:'\n*/\nexport default class Variable extends Node implements TFVariable {\n  termType: typeof VariableTermType = VariableTermType\n\n  /** The base string for a variable's name */\n  base = 'varid:'\n  classOrder = ClassOrder.Variable\n  isVar = 1\n  /** The unique identifier of this variable */\n  uri: string\n\n  /**\n   * Initializes this variable\n   * @param name The variable's name\n   */\n  constructor (name = '') {\n    super(name)\n    this.base = 'varid:'\n    this.uri = Uri.join(name, this.base)\n  }\n\n  equals (other) {\n    if (!other) {\n      return false\n    }\n\n    return (this.termType === other.termType) && (this.value === other.value)\n  }\n\n  hashString () {\n    return this.toString()\n  }\n\n  substitute (bindings) {\n    var ref\n    return (ref = bindings[this.toNT()]) != null ? ref : this\n  }\n\n  toString () {\n    return Variable.toString(this)\n  }\n\n  static toString (variable) {\n    if (variable.uri.slice(0, variable.base.length) === variable.base) {\n      return `?${variable.uri.slice(variable.base.length)}`\n    }\n\n    return `?${variable.uri}`\n  }\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Returns true if the given value is an Array.\n *\n * @param v the value to check.\n *\n * @return true if the value is an Array, false if not.\n */\napi.isArray = Array.isArray;\n\n/**\n * Returns true if the given value is a Boolean.\n *\n * @param v the value to check.\n *\n * @return true if the value is a Boolean, false if not.\n */\napi.isBoolean = v => (typeof v === 'boolean' ||\n  Object.prototype.toString.call(v) === '[object Boolean]');\n\n/**\n * Returns true if the given value is a double.\n *\n * @param v the value to check.\n *\n * @return true if the value is a double, false if not.\n */\napi.isDouble = v => api.isNumber(v) &&\n  (String(v).indexOf('.') !== -1 || Math.abs(v) >= 1e21);\n\n/**\n * Returns true if the given value is an empty Object.\n *\n * @param v the value to check.\n *\n * @return true if the value is an empty Object, false if not.\n */\napi.isEmptyObject = v => api.isObject(v) && Object.keys(v).length === 0;\n\n/**\n * Returns true if the given value is a Number.\n *\n * @param v the value to check.\n *\n * @return true if the value is a Number, false if not.\n */\napi.isNumber = v => (typeof v === 'number' ||\n  Object.prototype.toString.call(v) === '[object Number]');\n\n/**\n * Returns true if the given value is numeric.\n *\n * @param v the value to check.\n *\n * @return true if the value is numeric, false if not.\n */\napi.isNumeric = v => !isNaN(parseFloat(v)) && isFinite(v);\n\n/**\n * Returns true if the given value is an Object.\n *\n * @param v the value to check.\n *\n * @return true if the value is an Object, false if not.\n */\napi.isObject = v => Object.prototype.toString.call(v) === '[object Object]';\n\n/**\n * Returns true if the given value is a String.\n *\n * @param v the value to check.\n *\n * @return true if the value is a String, false if not.\n */\napi.isString = v => (typeof v === 'string' ||\n  Object.prototype.toString.call(v) === '[object String]');\n\n/**\n * Returns true if the given value is undefined.\n *\n * @param v the value to check.\n *\n * @return true if the value is undefined, false if not.\n */\napi.isUndefined = v => typeof v === 'undefined';\n","import { Term } from '../tf-types'\n\n/** Retrieve the value of a term, or self if already a string. */\nexport function termValue (node: Term | string): string {\n  if (typeof node === 'string') {\n    return node\n  }\n\n  return node.value\n}\n","// This file attaches all functionality to Node\n// that would otherwise require circular dependencies.\nimport { fromValue } from './collection'\nimport Node from './node-internal'\nimport Namespace from './namespace'\nimport { isCollection, isLiteral } from './utils/terms'\nimport { Term } from './tf-types'\n\n/**\n * Creates an RDF Node from a native javascript value.\n * RDF Nodes are returned unchanged, undefined returned as itself.\n * @method fromValue\n * @static\n * @param value {Node|Date|String|Number|Boolean|Undefined}\n * @return {Node|Collection}\n */\nNode.fromValue = fromValue;\n\nexport default Node\n\nconst ns = { xsd: Namespace('http://www.w3.org/2001/XMLSchema#') }\n\n/**\n * Gets the javascript object equivalent to a node\n * @param term The RDF node\n */\nNode.toJS = function (term: Term): Term | boolean | number | Date | string | any[] {\n  if (isCollection(term)) {\n    return term.elements.map(Node.toJS) // Array node (not standard RDFJS)\n  }\n  if (!isLiteral(term)) return term\n  if (term.datatype.equals(ns.xsd('boolean'))) {\n    return term.value === '1' || term.value === 'true'\n  }\n  if (term.datatype.equals(ns.xsd('dateTime')) ||\n    term.datatype.equals(ns.xsd('date'))) {\n    return new Date(term.value)\n  }\n  if (\n    term.datatype.equals(ns.xsd('integer')) ||\n    term.datatype.equals(ns.xsd('float')) ||\n    term.datatype.equals(ns.xsd('decimal'))\n  ) {\n    return Number(term.value)\n  }\n  return term.value\n}\n","/*\n * Copyright (c) 2017-2019 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst graphTypes = require('./graphTypes');\nconst types = require('./types');\n// TODO: move `IdentifierIssuer` to its own package\nconst IdentifierIssuer = require('rdf-canonize').IdentifierIssuer;\nconst JsonLdError = require('./JsonLdError');\n\n// constants\nconst REGEX_LINK_HEADERS = /(?:<[^>]*?>|\"[^\"]*?\"|[^,])+/g;\nconst REGEX_LINK_HEADER = /\\s*<([^>]*?)>\\s*(?:;\\s*(.*))?/;\nconst REGEX_LINK_HEADER_PARAMS =\n  /(.*?)=(?:(?:\"([^\"]*?)\")|([^\"]*?))\\s*(?:(?:;\\s*)|$)/g;\n\nconst DEFAULTS = {\n  headers: {\n    accept: 'application/ld+json, application/json'\n  }\n};\n\nconst api = {};\nmodule.exports = api;\napi.IdentifierIssuer = IdentifierIssuer;\n\n/**\n * Clones an object, array, Map, Set, or string/number. If a typed JavaScript\n * object is given, such as a Date, it will be converted to a string.\n *\n * @param value the value to clone.\n *\n * @return the cloned value.\n */\napi.clone = function(value) {\n  if(value && typeof value === 'object') {\n    let rval;\n    if(types.isArray(value)) {\n      rval = [];\n      for(let i = 0; i < value.length; ++i) {\n        rval[i] = api.clone(value[i]);\n      }\n    } else if(value instanceof Map) {\n      rval = new Map();\n      for(const [k, v] of value) {\n        rval.set(k, api.clone(v));\n      }\n    } else if(value instanceof Set) {\n      rval = new Set();\n      for(const v of value) {\n        rval.add(api.clone(v));\n      }\n    } else if(types.isObject(value)) {\n      rval = {};\n      for(const key in value) {\n        rval[key] = api.clone(value[key]);\n      }\n    } else {\n      rval = value.toString();\n    }\n    return rval;\n  }\n  return value;\n};\n\n/**\n * Ensure a value is an array. If the value is an array, it is returned.\n * Otherwise, it is wrapped in an array.\n *\n * @param value the value to return as an array.\n *\n * @return the value as an array.\n */\napi.asArray = function(value) {\n  return Array.isArray(value) ? value : [value];\n};\n\n/**\n * Builds an HTTP headers object for making a JSON-LD request from custom\n * headers and asserts the `accept` header isn't overridden.\n *\n * @param headers an object of headers with keys as header names and values\n *          as header values.\n *\n * @return an object of headers with a valid `accept` header.\n */\napi.buildHeaders = (headers = {}) => {\n  const hasAccept = Object.keys(headers).some(\n    h => h.toLowerCase() === 'accept');\n\n  if(hasAccept) {\n    throw new RangeError(\n      'Accept header may not be specified; only \"' +\n      DEFAULTS.headers.accept + '\" is supported.');\n  }\n\n  return Object.assign({Accept: DEFAULTS.headers.accept}, headers);\n};\n\n/**\n * Parses a link header. The results will be key'd by the value of \"rel\".\n *\n * Link: <http://json-ld.org/contexts/person.jsonld>;\n * rel=\"http://www.w3.org/ns/json-ld#context\"; type=\"application/ld+json\"\n *\n * Parses as: {\n *   'http://www.w3.org/ns/json-ld#context': {\n *     target: http://json-ld.org/contexts/person.jsonld,\n *     type: 'application/ld+json'\n *   }\n * }\n *\n * If there is more than one \"rel\" with the same IRI, then entries in the\n * resulting map for that \"rel\" will be arrays.\n *\n * @param header the link header to parse.\n */\napi.parseLinkHeader = header => {\n  const rval = {};\n  // split on unbracketed/unquoted commas\n  const entries = header.match(REGEX_LINK_HEADERS);\n  for(let i = 0; i < entries.length; ++i) {\n    let match = entries[i].match(REGEX_LINK_HEADER);\n    if(!match) {\n      continue;\n    }\n    const result = {target: match[1]};\n    const params = match[2];\n    while((match = REGEX_LINK_HEADER_PARAMS.exec(params))) {\n      result[match[1]] = (match[2] === undefined) ? match[3] : match[2];\n    }\n    const rel = result['rel'] || '';\n    if(Array.isArray(rval[rel])) {\n      rval[rel].push(result);\n    } else if(rval.hasOwnProperty(rel)) {\n      rval[rel] = [rval[rel], result];\n    } else {\n      rval[rel] = result;\n    }\n  }\n  return rval;\n};\n\n/**\n * Throws an exception if the given value is not a valid @type value.\n *\n * @param v the value to check.\n */\napi.validateTypeValue = (v, isFrame) => {\n  if(types.isString(v)) {\n    return;\n  }\n\n  if(types.isArray(v) && v.every(vv => types.isString(vv))) {\n    return;\n  }\n  if(isFrame && types.isObject(v)) {\n    switch(Object.keys(v).length) {\n      case 0:\n        // empty object is wildcard\n        return;\n      case 1:\n        // default entry is all strings\n        if('@default' in v &&\n          api.asArray(v['@default']).every(vv => types.isString(vv))) {\n          return;\n        }\n    }\n  }\n\n  throw new JsonLdError(\n    'Invalid JSON-LD syntax; \"@type\" value must a string, an array of ' +\n    'strings, an empty object, ' +\n    'or a default object.', 'jsonld.SyntaxError',\n    {code: 'invalid type value', value: v});\n};\n\n/**\n * Returns true if the given subject has the given property.\n *\n * @param subject the subject to check.\n * @param property the property to look for.\n *\n * @return true if the subject has the given property, false if not.\n */\napi.hasProperty = (subject, property) => {\n  if(subject.hasOwnProperty(property)) {\n    const value = subject[property];\n    return (!types.isArray(value) || value.length > 0);\n  }\n  return false;\n};\n\n/**\n * Determines if the given value is a property of the given subject.\n *\n * @param subject the subject to check.\n * @param property the property to check.\n * @param value the value to check.\n *\n * @return true if the value exists, false if not.\n */\napi.hasValue = (subject, property, value) => {\n  if(api.hasProperty(subject, property)) {\n    let val = subject[property];\n    const isList = graphTypes.isList(val);\n    if(types.isArray(val) || isList) {\n      if(isList) {\n        val = val['@list'];\n      }\n      for(let i = 0; i < val.length; ++i) {\n        if(api.compareValues(value, val[i])) {\n          return true;\n        }\n      }\n    } else if(!types.isArray(value)) {\n      // avoid matching the set of values with an array value parameter\n      return api.compareValues(value, val);\n    }\n  }\n  return false;\n};\n\n/**\n * Adds a value to a subject. If the value is an array, all values in the\n * array will be added.\n *\n * @param subject the subject to add the value to.\n * @param property the property that relates the value to the subject.\n * @param value the value to add.\n * @param [options] the options to use:\n *        [propertyIsArray] true if the property is always an array, false\n *          if not (default: false).\n *        [valueIsArray] true if the value to be added should be preserved as\n *          an array (lists) (default: false).\n *        [allowDuplicate] true to allow duplicates, false not to (uses a\n *          simple shallow comparison of subject ID or value) (default: true).\n *        [prependValue] false to prepend value to any existing values.\n *          (default: false)\n */\napi.addValue = (subject, property, value, options) => {\n  options = options || {};\n  if(!('propertyIsArray' in options)) {\n    options.propertyIsArray = false;\n  }\n  if(!('valueIsArray' in options)) {\n    options.valueIsArray = false;\n  }\n  if(!('allowDuplicate' in options)) {\n    options.allowDuplicate = true;\n  }\n  if(!('prependValue' in options)) {\n    options.prependValue = false;\n  }\n\n  if(options.valueIsArray) {\n    subject[property] = value;\n  } else if(types.isArray(value)) {\n    if(value.length === 0 && options.propertyIsArray &&\n      !subject.hasOwnProperty(property)) {\n      subject[property] = [];\n    }\n    if(options.prependValue) {\n      value = value.concat(subject[property]);\n      subject[property] = [];\n    }\n    for(let i = 0; i < value.length; ++i) {\n      api.addValue(subject, property, value[i], options);\n    }\n  } else if(subject.hasOwnProperty(property)) {\n    // check if subject already has value if duplicates not allowed\n    const hasValue = (!options.allowDuplicate &&\n      api.hasValue(subject, property, value));\n\n    // make property an array if value not present or always an array\n    if(!types.isArray(subject[property]) &&\n      (!hasValue || options.propertyIsArray)) {\n      subject[property] = [subject[property]];\n    }\n\n    // add new value\n    if(!hasValue) {\n      if(options.prependValue) {\n        subject[property].unshift(value);\n      } else {\n        subject[property].push(value);\n      }\n    }\n  } else {\n    // add new value as set or single value\n    subject[property] = options.propertyIsArray ? [value] : value;\n  }\n};\n\n/**\n * Gets all of the values for a subject's property as an array.\n *\n * @param subject the subject.\n * @param property the property.\n *\n * @return all of the values for a subject's property as an array.\n */\napi.getValues = (subject, property) => [].concat(subject[property] || []);\n\n/**\n * Removes a property from a subject.\n *\n * @param subject the subject.\n * @param property the property.\n */\napi.removeProperty = (subject, property) => {\n  delete subject[property];\n};\n\n/**\n * Removes a value from a subject.\n *\n * @param subject the subject.\n * @param property the property that relates the value to the subject.\n * @param value the value to remove.\n * @param [options] the options to use:\n *          [propertyIsArray] true if the property is always an array, false\n *            if not (default: false).\n */\napi.removeValue = (subject, property, value, options) => {\n  options = options || {};\n  if(!('propertyIsArray' in options)) {\n    options.propertyIsArray = false;\n  }\n\n  // filter out value\n  const values = api.getValues(subject, property).filter(\n    e => !api.compareValues(e, value));\n\n  if(values.length === 0) {\n    api.removeProperty(subject, property);\n  } else if(values.length === 1 && !options.propertyIsArray) {\n    subject[property] = values[0];\n  } else {\n    subject[property] = values;\n  }\n};\n\n/**\n * Relabels all blank nodes in the given JSON-LD input.\n *\n * @param input the JSON-LD input.\n * @param [options] the options to use:\n *          [issuer] an IdentifierIssuer to use to label blank nodes.\n */\napi.relabelBlankNodes = (input, options) => {\n  options = options || {};\n  const issuer = options.issuer || new IdentifierIssuer('_:b');\n  return _labelBlankNodes(issuer, input);\n};\n\n/**\n * Compares two JSON-LD values for equality. Two JSON-LD values will be\n * considered equal if:\n *\n * 1. They are both primitives of the same type and value.\n * 2. They are both @values with the same @value, @type, @language,\n *   and @index, OR\n * 3. They both have @ids they are the same.\n *\n * @param v1 the first value.\n * @param v2 the second value.\n *\n * @return true if v1 and v2 are considered equal, false if not.\n */\napi.compareValues = (v1, v2) => {\n  // 1. equal primitives\n  if(v1 === v2) {\n    return true;\n  }\n\n  // 2. equal @values\n  if(graphTypes.isValue(v1) && graphTypes.isValue(v2) &&\n    v1['@value'] === v2['@value'] &&\n    v1['@type'] === v2['@type'] &&\n    v1['@language'] === v2['@language'] &&\n    v1['@index'] === v2['@index']) {\n    return true;\n  }\n\n  // 3. equal @ids\n  if(types.isObject(v1) &&\n    ('@id' in v1) &&\n    types.isObject(v2) &&\n    ('@id' in v2)) {\n    return v1['@id'] === v2['@id'];\n  }\n\n  return false;\n};\n\n/**\n * Compares two strings first based on length and then lexicographically.\n *\n * @param a the first string.\n * @param b the second string.\n *\n * @return -1 if a < b, 1 if a > b, 0 if a === b.\n */\napi.compareShortestLeast = (a, b) => {\n  if(a.length < b.length) {\n    return -1;\n  }\n  if(b.length < a.length) {\n    return 1;\n  }\n  if(a === b) {\n    return 0;\n  }\n  return (a < b) ? -1 : 1;\n};\n\n/**\n * Labels the blank nodes in the given value using the given IdentifierIssuer.\n *\n * @param issuer the IdentifierIssuer to use.\n * @param element the element with blank nodes to rename.\n *\n * @return the element.\n */\nfunction _labelBlankNodes(issuer, element) {\n  if(types.isArray(element)) {\n    for(let i = 0; i < element.length; ++i) {\n      element[i] = _labelBlankNodes(issuer, element[i]);\n    }\n  } else if(graphTypes.isList(element)) {\n    element['@list'] = _labelBlankNodes(issuer, element['@list']);\n  } else if(types.isObject(element)) {\n    // relabel blank node\n    if(graphTypes.isBlankNode(element)) {\n      element['@id'] = issuer.getId(element['@id']);\n    }\n\n    // recursively apply to all keys\n    const keys = Object.keys(element).sort();\n    for(let ki = 0; ki < keys.length; ++ki) {\n      const key = keys[ki];\n      if(key !== '@id') {\n        element[key] = _labelBlankNodes(issuer, element[key]);\n      }\n    }\n  }\n\n  return element;\n}\n","/*  Identity management and indexing for RDF\n *\n * This file provides  IndexedFormula a formula (set of triples) which\n * indexed by predicate, subject and object.\n *\n * It \"smushes\"  (merges into a single node) things which are identical\n * according to owl:sameAs or an owl:InverseFunctionalProperty\n * or an owl:FunctionalProperty\n *\n *\n *  2005-10 Written Tim Berners-Lee\n *  2007    Changed so as not to munge statements from documents when smushing\n *  2019    Converted to typescript\n *\n *\n*/\n\n/** @module store */\n\nimport ClassOrder from './class-order'\nimport { defaultGraphURI } from './factories/canonical-data-factory'\nimport Formula, { FormulaOpts } from './formula'\nimport { ArrayIndexOf } from './utils'\nimport { RDFArrayRemove } from './utils-js'\nimport {\n  isRDFlibObject,\n  isStore,\n  isGraph,\n  isPredicate,\n  isQuad,\n  isSubject\n} from './utils/terms'\nimport Node from './node'\nimport Variable from './variable'\nimport { Query, indexedFormulaQuery } from './query'\nimport UpdateManager from './update-manager'\nimport {\n  Bindings, BlankNodeTermType, CollectionTermType, DefaultGraphTermType, EmptyTermType, GraphTermType, LiteralTermType, NamedNodeTermType, VariableTermType\n} from './types'\nimport Statement from './statement'\nimport { Indexable } from './factories/factory-types'\nimport NamedNode from './named-node'\nimport Fetcher from './fetcher'\nimport {\n  Quad_Graph,\n  Literal as TFLiteral,\n  NamedNode as TFNamedNode,\n  Quad_Object,\n  Quad_Predicate,\n  Quad,\n  Quad_Subject,\n  Term,\n} from './tf-types'\nimport { namedNode } from './index'\nimport BlankNode from './blank-node'\nimport DefaultGraph from './default-graph'\nimport Empty from './empty'\nimport Literal from './literal'\nimport Collection from './collection'\n\nconst owlNamespaceURI = 'http://www.w3.org/2002/07/owl#'\n\ntype FeaturesType = Array<('sameAs' | 'InverseFunctionalProperty' | 'FunctionalProperty')> | undefined\n\nexport { defaultGraphURI }\n// var link_ns = 'http://www.w3.org/2007/ont/link#'\n\n// Handle Functional Property\nfunction handleFP (\n  formula: IndexedFormula,\n  subj: Quad_Subject,\n  pred: Quad_Predicate,\n  obj: Quad_Object\n): boolean {\n  var o1 = formula.any(subj, pred, undefined)\n  if (!o1) {\n    return false // First time with this value\n  }\n  // log.warn(\"Equating \"+o1.uri+\" and \"+obj.uri + \" because FP \"+pred.uri);  //@@\n  formula.equate(o1, obj)\n  return true\n} // handleFP\n\n// Handle Inverse Functional Property\nfunction handleIFP (\n  formula: IndexedFormula,\n  subj: Quad_Subject,\n  pred: Quad_Predicate,\n  obj: Quad_Object\n): boolean {\n  var s1 = formula.any(undefined, pred, obj)\n  if (!s1) {\n    return false // First time with this value\n  }\n  // log.warn(\"Equating \"+s1.uri+\" and \"+subj.uri + \" because IFP \"+pred.uri);  //@@\n  formula.equate(s1, subj)\n  return true\n} // handleIFP\n\nfunction handleRDFType (\n  formula: IndexedFormula,\n  subj: Quad_Subject,\n  pred: Quad_Predicate,\n  obj: Quad_Object,\n  why: Quad_Graph\n) {\n  //@ts-ignore this method does not seem to exist in this library\n  if (formula.typeCallback) {\n    (formula as any).typeCallback(formula, obj, why)\n  }\n\n  var x = formula.classActions[formula.id(obj)]\n  var done = false\n  if (x) {\n    for (var i = 0; i < x.length; i++) {\n      done = done || x[i](formula, subj, pred, obj, why)\n    }\n  }\n  return done // statement given is not needed if true\n}\n\n/**\n * Indexed Formula aka Store\n */\nexport default class IndexedFormula extends Formula { // IN future - allow pass array of statements to constructor\n  /**\n   * An UpdateManager initialised to this store\n   */\n  updater?: UpdateManager\n\n  /**\n   * Dictionary of namespace prefixes\n   */\n  namespaces: {[key: string]: string}\n\n  /** Map of iri predicates to functions to call when adding { s type X } */\n  classActions: { [k: string]: Function[] }\n  /** Map of iri predicates to functions to call when getting statement with {s X o} */\n  propertyActions: { [k: string]: Function[] }\n  /** Redirect to lexically smaller equivalent symbol */\n  redirections: any[]\n  /** Reverse mapping to redirection: aliases for this */\n  aliases: any[]\n  /** Redirections we got from HTTP */\n  HTTPRedirects: Statement[]\n  /** Array of statements with this X as subject */\n  subjectIndex: Statement[]\n  /** Array of statements with this X as predicate */\n  predicateIndex: Statement[]\n  /** Array of statements with this X as object */\n  objectIndex: Statement[]\n  /** Array of statements with X as provenance */\n  whyIndex: Statement[]\n  index: [\n    Statement[],\n    Statement[],\n    Statement[],\n    Statement[]\n  ]\n  features: FeaturesType\n  static handleRDFType: Function\n  _universalVariables?: NamedNode[]\n  _existentialVariables?: BlankNode[]\n\n  /** Function to remove quads from the store arrays with */\n  private rdfArrayRemove: (arr: Quad[], q: Quad) => void\n  /** Callbacks which are triggered after a statement has been added to the store */\n  private dataCallbacks?: Array<(q: Quad) => void>\n\n  /**\n   * Creates a new formula\n   * @param features - What sort of automatic processing to do? Array of string\n   * @param features.sameAs - Smush together A and B nodes whenever { A sameAs B }\n   * @param opts\n   * @param [opts.rdfFactory] - The data factory that should be used by the store\n   * @param [opts.rdfArrayRemove] - Function which removes statements from the store\n   * @param [opts.dataCallback] - Callback when a statement is added to the store, will not trigger when adding duplicates\n   */\n  constructor (features?: FeaturesType, opts: FormulaOpts = {}) {\n    super(undefined, undefined, undefined, undefined, opts)\n\n    this.propertyActions = {}\n    this.classActions = {}\n    this.redirections = []\n    this.aliases = []\n    this.HTTPRedirects = []\n    this.subjectIndex = []\n    this.predicateIndex = []\n    this.objectIndex = []\n    this.whyIndex = []\n    this.index = [\n      this.subjectIndex,\n      this.predicateIndex,\n      this.objectIndex,\n      this.whyIndex\n    ]\n    this.namespaces = {} // Dictionary of namespace prefixes\n    this.features = features || [ // By default, devs do not expect these features.\n// See https://github.com/linkeddata/rdflib.js/issues/458\n//      'sameAs',\n//      'InverseFunctionalProperty',\n//      'FunctionalProperty',\n    ]\n    this.rdfArrayRemove = opts.rdfArrayRemove || RDFArrayRemove\n    if (opts.dataCallback) {\n      this.dataCallbacks = [opts.dataCallback]\n    }\n\n    this.initPropertyActions(this.features)\n  }\n\n  /**\n   * Gets the URI of the default graph\n   */\n  static get defaultGraphURI(): string {\n    return defaultGraphURI\n  }\n\n  /**\n   * Gets this graph with the bindings substituted\n   * @param bindings The bindings\n   */\n  substitute <T extends Node = IndexedFormula>(bindings: Bindings): T {\n    var statementsCopy = this.statements.map(function (ea: Quad) {\n      return (ea as Statement).substitute(bindings)\n    })\n    var y = new IndexedFormula()\n    y.add(statementsCopy)\n    return y as unknown as T\n  }\n\n  /**\n   * Add a callback which will be triggered after a statement has been added to the store.\n   * @param cb\n   */\n  addDataCallback(cb: (q: Quad) => void): void {\n    if (!this.dataCallbacks) {\n      this.dataCallbacks = []\n    }\n    this.dataCallbacks.push(cb)\n  }\n\n  /**\n   * Apply a set of statements to be deleted and to be inserted\n   *\n   * @param patch - The set of statements to be deleted and to be inserted\n   * @param target - The name of the document to patch\n   * @param patchCallback - Callback to be called when patching is complete\n   */\n  applyPatch(\n    patch: {\n        delete?: ReadonlyArray<Statement>,\n        patch?: ReadonlyArray<Statement>,\n        where?: any\n    },\n    target: TFNamedNode,\n    patchCallback: (errorString?: string) => void\n  ): void {\n    var targetKB = this\n    var ds\n    var binding: Bindings | null = null\n\n    function doPatch (onDonePatch: (errorString?: string) => void) {\n      if (patch['delete']) {\n        ds = patch['delete']\n        // console.log(bindingDebug(binding))\n        // console.log('ds before substitute: ' + ds)\n        if (binding) ds = ds.substitute(binding)\n        // console.log('applyPatch: delete: ' + ds)\n        ds = ds.statements as Statement[]\n        var bad: Quad[] = []\n        var ds2 = ds.map(function (st: Quad) { // Find the actual statements in the store\n          var sts = targetKB.statementsMatching(st.subject, st.predicate, st.object, target)\n          if (sts.length === 0) {\n            // log.info(\"NOT FOUND deletable \" + st)\n            bad.push(st)\n            return null\n          } else {\n            // log.info(\"Found deletable \" + st)\n            return sts[0]\n          }\n        })\n        if (bad.length) {\n          // console.log('Could not find to delete ' + bad.length + 'statements')\n          // console.log('despite ' + targetKB.statementsMatching(bad[0].subject, bad[0].predicate)[0])\n          return patchCallback('Could not find to delete: ' + bad.join('\\n or '))\n        }\n        ds2.map(function (st: Quad) {\n          targetKB.remove(st)\n        })\n      }\n      if (patch['insert']) {\n        // log.info(\"doPatch insert \"+patch['insert'])\n        ds = patch['insert']\n        if (binding) ds = ds.substitute(binding)\n        ds = ds.statements\n        ds.map(function (st: Quad) {\n          st.graph = target\n          targetKB.add(st.subject, st.predicate, st.object, st.graph)\n        })\n      }\n      onDonePatch()\n    }\n    if (patch.where) {\n      // log.info(\"Processing WHERE: \" + patch.where + '\\n')\n      var query = new Query('patch')\n      query.pat = patch.where\n      query.pat.statements.map(function (st) {\n        st.graph = namedNode(target.value)\n      })\n      //@ts-ignore TODO: add sync property to Query when converting Query to typescript\n      query.sync = true\n\n      var bindingsFound: Bindings[] = []\n\n      targetKB.query(\n        query,\n        function onBinding (binding) {\n        bindingsFound.push(binding)\n        // console.log('   got a binding: ' + bindingDebug(binding))\n      },\n        targetKB.fetcher,\n        function onDone () {\n          if (bindingsFound.length === 0) {\n            return patchCallback('No match found to be patched:' + patch.where)\n          }\n          if (bindingsFound.length > 1) {\n            return patchCallback('Patch ambiguous. No patch done.')\n          }\n          binding = bindingsFound[0]\n          doPatch(patchCallback)\n        })\n    } else {\n      doPatch(patchCallback)\n    }\n  }\n\n  /**\n   * N3 allows for declaring blank nodes, this function enables that support\n   *\n   * @param x The blank node to be declared, supported in N3\n   */\n  declareExistential(x: BlankNode): BlankNode {\n    if (!this._existentialVariables) this._existentialVariables = []\n    this._existentialVariables.push(x)\n    return x\n  }\n\n  /**\n   * @param features\n   */\n  initPropertyActions(features: FeaturesType) {\n    // If the predicate is #type, use handleRDFType to create a typeCallback on the object\n    this.propertyActions[this.rdfFactory.id(this.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'))] =\n      [ handleRDFType ]\n\n    // Assumption: these terms are not redirected @@fixme\n    if (ArrayIndexOf(features, 'sameAs') >= 0) {\n      this.propertyActions[this.rdfFactory.id(this.rdfFactory.namedNode(`${owlNamespaceURI}sameAs`))] = [\n        function (formula, subj, pred, obj, why) {\n          // log.warn(\"Equating \"+subj.uri+\" sameAs \"+obj.uri);  //@@\n          formula.equate(subj, obj)\n          return true // true if statement given is NOT needed in the store\n        }\n      ] // sameAs -> equate & don't add to index\n    }\n    if (ArrayIndexOf(features, 'InverseFunctionalProperty') >= 0) {\n      this.classActions[this.rdfFactory.id(this.rdfFactory.namedNode(`${owlNamespaceURI}InverseFunctionalProperty`))] = [\n        function (formula, subj, pred, obj, addFn) {\n          // yes subj not pred!\n          return formula.newPropertyAction(subj, handleIFP)\n        }\n      ] // IFP -> handleIFP, do add to index\n    }\n    if (ArrayIndexOf(features, 'FunctionalProperty') >= 0) {\n      this.classActions[this.rdfFactory.id(this.rdfFactory.namedNode(`${owlNamespaceURI}FunctionalProperty`))] = [\n        function (formula, subj, proj, obj, addFn) {\n          return formula.newPropertyAction(subj, handleFP)\n        }\n      ] // FP => handleFP, do add to index\n    }\n  }\n\n  /** @deprecated Use {add} instead */\n  addStatement (st: Quad): number {\n    this.add(st.subject, st.predicate, st.object, st.graph)\n    return this.statements.length\n  }\n\n  /**\n   * Adds a triple (quad) to the store.\n   *\n   * @param subj - The thing about which the fact a relationship is asserted.\n   *        Also accepts a statement or an array of Statements.\n   * @param pred - The relationship which is asserted\n   * @param obj - The object of the relationship, e.g. another thing or a value. If passed a string, this will become a literal.\n   * @param why - The document in which the triple (S,P,O) was or will be stored on the web\n   * @returns The statement added to the store, or the store\n   */\n  add (\n    subj: Quad_Subject | Quad | Quad[] | Statement | Statement[],\n    pred?: Quad_Predicate,\n    obj?: Term | string,\n    why?: Quad_Graph\n  ): Statement | null | this | number {\n    var i: number\n    if (arguments.length === 1) {\n      if (subj instanceof Array) {\n        for (i = 0; i < subj.length; i++) {\n          this.add(subj[i])\n        }\n      } else if (isQuad(subj)) {\n        this.add(subj.subject, subj.predicate, subj.object, subj.graph)\n      } else if (isStore(subj)) {\n        this.add((subj as any).statements)\n      }\n      return this\n    }\n    var actions: Function[]\n    var st: Statement\n    if (!why) {\n      // system generated\n      why = this.fetcher ? this.fetcher.appNode : this.rdfFactory.defaultGraph()\n    }\n    if (typeof subj == 'string') {\n      subj = this.rdfFactory.namedNode(subj)\n    }\n    pred = Node.fromValue(pred)\n    const objNode = Node.fromValue(obj) as Term\n    why = Node.fromValue(why)\n    if (!isSubject(subj)) {\n      throw new Error('Subject is not a subject type')\n    }\n    if (!isPredicate(pred)) {\n      throw new Error(`Predicate ${pred} is not a predicate type`)\n    }\n    if (!isRDFlibObject(objNode)) {\n      throw new Error(`Object ${objNode} is not an object type`)\n    }\n    if (!isGraph(why)) {\n      throw new Error(\"Why is not a graph type\")\n    }\n    //@ts-ignore This is not used internally\n    if (this.predicateCallback) {\n      //@ts-ignore This is not used internally\n      this.predicateCallback(this, pred, why)\n    }\n    // Action return true if the statement does not need to be added\n    var predHash = this.id(this.canon(pred!))\n    actions = this.propertyActions[predHash] // Predicate hash\n    var done = false\n    if (actions) {\n      // alert('type: '+typeof actions +' @@ actions='+actions)\n      for (i = 0; i < actions.length; i++) {\n        done = done || actions[i](this, subj, pred, objNode, why)\n      }\n    }\n    if (this.holds(subj, pred, objNode, why)) { // Takes time but saves duplicates\n      // console.log('rdflib: Ignoring dup! {' + subj + ' ' + pred + ' ' + obj + ' ' + why + '}')\n      return null // @@better to return self in all cases?\n    }\n    // If we are tracking provenance, every thing should be loaded into the store\n    // if (done) return this.rdfFactory.quad(subj, pred, obj, why)\n    // Don't put it in the store\n    // still return this statement for owl:sameAs input\n    var hash = [\n      this.id(this.canon(subj)),\n      predHash,\n      this.id(this.canon(objNode)),\n      this.id(this.canon(why))\n    ]\n    // @ts-ignore this will fail if you pass a collection and the factory does not allow Collections\n    st = this.rdfFactory.quad(subj, pred, objNode, why)\n    for (i = 0; i < 4; i++) {\n      var ix = this.index[i]\n      var h = hash[i]\n      if (!ix[h]) {\n        ix[h] = []\n      }\n      ix[h].push(st) // Set of things with this as subject, etc\n    }\n\n    // log.debug(\"ADDING    {\"+subj+\" \"+pred+\" \"+objNode+\"} \"+why)\n    this.statements.push(st)\n\n    if (this.dataCallbacks) {\n      for (const callback of this.dataCallbacks) {\n        callback(st)\n      }\n    }\n\n    return st\n  }\n\n  /**\n   * Returns the symbol with canonical URI as smushed\n   * @param term - An RDF node\n   */\n  canon(term?: Term): Node {\n    if (!term) {\n      // @@ TODO Should improve this to return proper value - doing this to keep it backward compatible\n      return term as unknown as Node\n    }\n    const y = this.redirections[this.id(term)]\n    if (y) {\n      return y\n    }\n    switch (term.termType) {\n      case BlankNodeTermType:\n        return new BlankNode(term.value)\n      case CollectionTermType:\n        return term as Collection // non-RDF/JS type, should just need to cast\n      case DefaultGraphTermType:\n        return new DefaultGraph()\n      case EmptyTermType: // non-RDF/JS type, should just need to cast\n        return term as Empty\n      case GraphTermType: // non-RDF/JS type, should just need to cast\n        return term as IndexedFormula\n      case LiteralTermType:\n        return new Literal(term.value, (term as TFLiteral).language, (term as TFLiteral).datatype)\n      case NamedNodeTermType:\n        return new NamedNode(term.value)\n      case VariableTermType:\n        return new Variable(term.value)\n      default:\n        throw new Error(`Term Type not recognized for canonization: ${term.termType}`)\n    }\n  }\n\n\n  /**\n   * Checks this formula for consistency\n   */\n  check(): void {\n    this.checkStatementList(this.statements)\n    for (var p = 0; p < 4; p++) {\n      var ix = this.index[p]\n      for (var key in ix) {\n        if (ix.hasOwnProperty(key)) {\n          // @ts-ignore should this pass an array or a single statement? checkStateMentsList expects an array.\n          this.checkStatementList(ix[key], p)\n        }\n      }\n    }\n  }\n\n  /**\n   * Checks a list of statements for consistency\n   * @param sts - The list of statements to check\n   * @param from - An index with the array ['subject', 'predicate', 'object', 'why']\n   */\n  checkStatementList(\n    sts: ReadonlyArray<Quad>,\n    from?: number\n  ): boolean | void {\n    if (from === undefined) {\n      from = 0\n    }\n    var names = ['subject', 'predicate', 'object', 'why']\n    var origin = ' found in ' + names[from] + ' index.'\n    var st: Quad\n    for (var j = 0; j < sts.length; j++) {\n      st = sts[j]\n      var term = [ st.subject, st.predicate, st.object, st.graph ]\n      var arrayContains = function (a: Array<any>, x: Quad) {\n        for (var i = 0; i < a.length; i++) {\n          if (a[i].subject.equals(x.subject) &&\n            a[i].predicate.equals(x.predicate) &&\n            a[i].object.equals(x.object) &&\n            a[i].why.equals(x.graph)) {\n            return true\n          }\n        }\n      }\n      for (var p = 0; p < 4; p++) {\n        var c = this.canon(term[p])\n        var h = this.id(c)\n        if (!this.index[p][h]) {\n          // throw new Error('No ' + name[p] + ' index for statement ' + st + '@' + st.why + origin)\n        } else {\n          if (!arrayContains(this.index[p][h], st)) {\n            // throw new Error('Index for ' + name[p] + ' does not have statement ' + st + '@' + st.why + origin)\n          }\n        }\n      }\n      if (!arrayContains(this.statements, st)) {\n        throw new Error('Statement list does not statement ' + st + '@' + st.graph + origin)\n      }\n    }\n  }\n\n  /**\n   * Closes this formula (and return it)\n   */\n  close(): IndexedFormula {\n    return this\n  }\n\n  compareTerms(u1: Term, u2: Term): number {\n    // Keep compatibility with downstream classOrder changes\n    if (Object.prototype.hasOwnProperty.call(u1, \"compareTerm\")) {\n      return (u1 as Node).compareTerm(u2 as Node)\n    }\n    if (ClassOrder[u1.termType] < ClassOrder[u2.termType]) {\n      return -1\n    }\n    if (ClassOrder[u1.termType] > ClassOrder[u2.termType]) {\n      return +1\n    }\n    if (u1.value < u2.value) {\n      return -1\n    }\n    if (u1.value > u2.value) {\n      return +1\n    }\n    return 0\n  }\n\n\n  /**\n   * replaces @template with @target and add appropriate triples\n   * removes no triples by default and is a one-direction replication\n   * @param template node to copy\n   * @param target node to copy to\n   * @param flags Whether or not to do a two-directional copy and/or delete triples\n   */\n  copyTo(\n    template: Quad_Subject,\n    target: Quad_Subject,\n    flags?: Array<('two-direction' | 'delete')>\n  ): void {\n    if (!flags) flags = []\n    var statList = this.statementsMatching(template)\n    if (ArrayIndexOf(flags, 'two-direction') !== -1) {\n      statList.concat(this.statementsMatching(undefined, undefined, template))\n    }\n    for (var i = 0; i < statList.length; i++) {\n      var st = statList[i]\n      switch (st.object.termType) {\n        case 'NamedNode':\n          this.add(target, st.predicate, st.object)\n          break\n        case 'Literal':\n        case 'BlankNode':\n        // @ts-ignore Collections can appear here\n        case 'Collection':\n          // @ts-ignore Possible bug: copy is not available on Collections\n          this.add(target, st.predicate, st.object.copy(this))\n      }\n      if (ArrayIndexOf(flags, 'delete') !== -1) {\n        this.remove(st)\n      }\n    }\n  }\n\n  /**\n   * Simplify graph in store when we realize two identifiers are equivalent\n   * We replace the bigger with the smaller.\n   * @param u1in The first node\n   * @param u2in The second node\n   */\n  equate(u1in: Term, u2in : Term): boolean {\n    // log.warn(\"Equating \"+u1+\" and \"+u2); // @@\n    // @@JAMBO Must canonicalize the uris to prevent errors from a=b=c\n    // 03-21-2010\n    const u1 = this.canon(u1in) as Quad_Subject\n    const u2 = this.canon(u2in) as Quad_Subject\n    var d = this.compareTerms(u1, u2)\n    if (!d) {\n      return true // No information in {a = a}\n    }\n    // var big\n    // var small\n    if (d < 0) { // u1 less than u2\n      return this.replaceWith(u2, u1)\n    } else {\n      return this.replaceWith(u1, u2)\n    }\n  }\n\n  /**\n   * Creates a new empty indexed formula\n   * Only applicable for IndexedFormula, but TypeScript won't allow a subclass to override a property\n   * @param features The list of features\n   */\n  formula(features: FeaturesType): IndexedFormula {\n    return new IndexedFormula(features)\n  }\n\n  /**\n   * Returns the number of statements contained in this IndexedFormula.\n   * (Getter proxy to this.statements).\n   * Usage:\n   *    ```\n   *    var kb = rdf.graph()\n   *    kb.length  // -> 0\n   *    ```\n   * @returns {Number}\n   */\n  get length (): number {\n    return this.statements.length\n  }\n\n  /**\n   * Returns any quads matching the given arguments.\n   * Standard RDFJS spec method for Source objects, implemented as an\n   * alias to `statementsMatching()`\n   * @param subject The subject\n   * @param predicate The predicate\n   * @param object The object\n   * @param graph The graph that contains the statement\n   */\n  match(\n    subject?: Quad_Subject | null,\n    predicate?: Quad_Predicate | null,\n    object?: Quad_Object | null,\n    graph?: Quad_Graph | null\n  ): Quad[] {\n    return this.statementsMatching(\n      Node.fromValue(subject),\n      Node.fromValue(predicate),\n      Node.fromValue(object),\n      Node.fromValue(graph)\n    )\n  }\n\n  /**\n   * Find out whether a given URI is used as symbol in the formula\n   * @param uri The URI to look for\n   */\n  mentionsURI(uri: string): boolean {\n    var hash = '<' + uri + '>'\n    return (!!this.subjectIndex[hash] ||\n    !!this.objectIndex[hash] ||\n    !!this.predicateIndex[hash])\n  }\n\n  /**\n   * Existentials are BNodes - something exists without naming\n   * @param uri An URI\n   */\n  newExistential(uri: string): Term {\n    if (!uri) return this.bnode()\n    var x = this.sym(uri)\n    // @ts-ignore x should be blanknode, but is namedNode.\n    return this.declareExistential(x)\n  }\n\n  /**\n   * Adds a new property action\n   * @param pred the predicate that the function should be triggered on\n   * @param action the function that should trigger\n   */\n  newPropertyAction(\n    pred: Quad_Predicate,\n    action: (\n      store: IndexedFormula,\n      subject: Quad_Subject,\n      predicate: Quad_Predicate,\n      object: Quad_Object\n    ) => boolean\n  ): boolean {\n    // log.debug(\"newPropertyAction:  \"+pred)\n    var hash = this.id(pred)\n    if (!this.propertyActions[hash]) {\n      this.propertyActions[hash] = []\n    }\n    this.propertyActions[hash].push(action)\n    // Now apply the function to to statements already in the store\n    var toBeFixed = this.statementsMatching(undefined, pred, undefined)\n    var done = false\n    for (var i = 0; i < toBeFixed.length; i++) { // NOT optimized - sort toBeFixed etc\n      done = done || action(this, toBeFixed[i].subject, pred, toBeFixed[i].object)\n    }\n    return done\n  }\n\n  /**\n   * Creates a new universal node\n   * Universals are Variables\n   * @param uri An URI\n   */\n  newUniversal(uri: string): TFNamedNode {\n    var x = this.sym(uri)\n    if (!this._universalVariables) this._universalVariables = []\n    this._universalVariables.push(x)\n    return x\n  }\n\n  // convenience function used by N3 parser\n  variable (name: string) {\n    return new Variable(name)\n  }\n\n  /**\n   * Find an unused id for a file being edited: return a symbol\n   * (Note: Slow iff a lot of them -- could be O(log(k)) )\n   * @param doc A document named node\n   */\n  nextSymbol(doc: TFNamedNode): TFNamedNode {\n    for (var i = 0; ;i++) {\n      var uri = doc.value + '#n' + i\n      if (!this.mentionsURI(uri)) return this.sym(uri)\n    }\n  }\n\n  /**\n   * Query this store asynchronously, return bindings in callback\n   *\n   * @param myQuery The query to be run\n   * @param callback Function to call when bindings\n   * @param Fetcher | null  If you want the query to do link following\n   * @param onDone OBSOLETE - do not use this // @@ Why not ?? Called when query complete\n   */\n  query(\n    myQuery: Query,\n    callback: (bindings: Bindings) => void,\n    fetcher?: Fetcher | null,\n    onDone?: () => void\n  ): void {\n    return indexedFormulaQuery.call(this, myQuery, callback, fetcher, onDone)\n  }\n\n  /**\n   * Query this store synchronously and return bindings\n   *\n   * @param myQuery The query to be run\n   */\n  querySync(myQuery: Query): any[] {\n    var results: Bindings[] = []\n    function saveBinginds (bindings: Bindings) {\n      results.push(bindings)\n    }\n    function onDone () {\n      done = true\n    }\n    var done = false\n    // @ts-ignore TODO: Add .sync to Query\n    myQuery.sync = true\n\n    indexedFormulaQuery.call(this, myQuery, saveBinginds, null, onDone)\n    if (!done) {\n      throw new Error('Sync query should have called done function')\n    }\n    return results\n  }\n\n  /**\n   * Removes one or multiple statement(s) from this formula\n   * @param st - A Statement or array of Statements to remove\n   */\n  remove(st: Quad | Quad[]): IndexedFormula {\n    if (st instanceof Array) {\n      for (var i = 0; i < st.length; i++) {\n        this.remove(st[i])\n      }\n      return this\n    }\n    if (isStore(st)) {\n      return this.remove(st.statements)\n    }\n    var sts = this.statementsMatching(st.subject, st.predicate, st.object, st.graph)\n    if (!sts.length) {\n      throw new Error('Statement to be removed is not on store: ' + st)\n    }\n    this.removeStatement(sts[0])\n    return this\n  }\n\n  /**\n   * Removes all statements in a doc\n   * @param doc - The document / graph\n   */\n  removeDocument(doc: Quad_Graph): IndexedFormula {\n    var sts: Quad[] = this.statementsMatching(undefined, undefined, undefined, doc).slice() // Take a copy as this is the actual index\n    for (var i = 0; i < sts.length; i++) {\n      this.removeStatement(sts[i])\n    }\n    return this\n  }\n\n  /**\n   * Remove all statements matching args (within limit) *\n   * @param subj The subject\n   * @param pred The predicate\n   * @param obj The object\n   * @param why The graph that contains the statement\n   * @param limit The number of statements to remove\n   */\n  removeMany(\n    subj?: Quad_Subject | null,\n    pred?: Quad_Predicate | null,\n    obj?: Quad_Object | null,\n    why?: Quad_Graph | null,\n    limit?: number\n  ): void {\n    // log.debug(\"entering removeMany w/ subj,pred,obj,why,limit = \" + subj +\", \"+ pred+\", \" + obj+\", \" + why+\", \" + limit)\n    var sts = this.statementsMatching(subj, pred, obj, why, false)\n    // This is a subtle bug that occurred in updateCenter.js too.\n    // The fact is, this.statementsMatching returns this.whyIndex instead of a copy of it\n    // but for perfromance consideration, it's better to just do that\n    // so make a copy here.\n    var statements: Quad[] = []\n    for (var i = 0; i < sts.length; i++) statements.push(sts[i])\n    if (limit) statements = statements.slice(0, limit)\n    for (i = 0; i < statements.length; i++) this.remove(statements[i])\n  }\n\n  /**\n   * Remove all matching statements\n   * @param subject The subject\n   * @param predicate The predicate\n   * @param object The object\n   * @param graph The graph that contains the statement\n   */\n  removeMatches(\n    subject?: Quad_Subject | null,\n    predicate?: Quad_Predicate | null,\n    object?: Quad_Object | null,\n    graph?: Quad_Graph | null\n  ): IndexedFormula {\n    this.removeStatements(\n      this.statementsMatching(subject, predicate, object, graph)\n    )\n    return this\n  }\n\n  /**\n   * Remove a particular statement object from the store\n   *\n   * @param st - a statement which is already in the store and indexed.\n   *        Make sure you only use this for these.\n   *        Otherwise, you should use remove() above.\n   */\n  removeStatement(st: Quad): IndexedFormula {\n    // log.debug(\"entering remove w/ st=\" + st)\n    var term = [ st.subject, st.predicate, st.object, st.graph ]\n    for (var p = 0; p < 4; p++) {\n      var c = this.canon(term[p])\n      var h = this.id(c)\n      if (!this.index[p][h]) {\n        // log.warn (\"Statement removal: no index '+p+': \"+st)\n      } else {\n        this.rdfArrayRemove(this.index[p][h], st)\n      }\n    }\n    this.rdfArrayRemove(this.statements, st)\n    return this\n  }\n\n  /**\n   * Removes statements\n   * @param sts The statements to remove\n   */\n  removeStatements(sts: ReadonlyArray<Quad>): IndexedFormula {\n    for (var i = 0; i < sts.length; i++) {\n      this.remove(sts[i])\n    }\n    return this\n  }\n\n  /**\n   * Replace big with small, obsoleted with obsoleting.\n   */\n  replaceWith (big: Quad_Subject, small: Quad_Subject): boolean {\n    // log.debug(\"Replacing \"+big+\" with \"+small) // this.id(@@\n    var oldhash = this.id(big)\n    var newhash = this.id(small)\n    var moveIndex = function (ix) {\n      var oldlist = ix[oldhash]\n      if (!oldlist) {\n        return // none to move\n      }\n      var newlist = ix[newhash]\n      if (!newlist) {\n        ix[newhash] = oldlist\n      } else {\n        ix[newhash] = oldlist.concat(newlist)\n      }\n      delete ix[oldhash]\n    }\n    // the canonical one carries all the indexes\n    for (var i = 0; i < 4; i++) {\n      moveIndex(this.index[i])\n    }\n    this.redirections[oldhash] = small\n    if (big.value) {\n      // @@JAMBO: must update redirections,aliases from sub-items, too.\n      if (!this.aliases[newhash]) {\n        this.aliases[newhash] = []\n      }\n      this.aliases[newhash].push(big) // Back link\n      if (this.aliases[oldhash]) {\n        for (i = 0; i < this.aliases[oldhash].length; i++) {\n          this.redirections[this.id(this.aliases[oldhash][i])] = small\n          this.aliases[newhash].push(this.aliases[oldhash][i])\n        }\n      }\n      this.add(small, this.sym('http://www.w3.org/2007/ont/link#uri'), big)\n      // If two things are equal, and one is requested, we should request the other.\n      if (this.fetcher) {\n        this.fetcher.nowKnownAs(big, small)\n      }\n    }\n    moveIndex(this.classActions)\n    moveIndex(this.propertyActions)\n    // log.debug(\"Equate done. \"+big+\" to be known as \"+small)\n    return true // true means the statement does not need to be put in\n  }\n\n  /**\n   * Return all equivalent URIs by which this is known\n   * @param x A named node\n   */\n  allAliases(x: NamedNode): NamedNode[] {\n    var a = this.aliases[this.id(this.canon(x))] || []\n    a.push(this.canon(x))\n    return a\n  }\n\n  /**\n   * Compare by canonical URI as smushed\n   * @param x A named node\n   * @param y Another named node\n   */\n  sameThings(x: NamedNode, y: NamedNode): boolean {\n    if (x.equals(y)) {\n      return true\n    }\n    var x1 = this.canon(x)\n    //    alert('x1='+x1)\n    if (!x1) return false\n    var y1 = this.canon(y)\n    //    alert('y1='+y1); //@@\n    if (!y1) return false\n    return (x1.value === y1.value)\n  }\n\n  setPrefixForURI (prefix: string, nsuri: string): void {\n    // TODO: This is a hack for our own issues, which ought to be fixed\n    // post-release\n    // See http://dig.csail.mit.edu/cgi-bin/roundup.cgi/$rdf/issue227\n    if (prefix === 'tab' && this.namespaces['tab']) {\n      return\n    } // There are files around with long badly generated prefixes like this\n    if (prefix.slice(0, 2) === 'ns' || prefix.slice(0, 7) === 'default') {\n      return\n    }\n    this.namespaces[prefix] = nsuri\n  }\n\n  /** Search the Store\n   *\n   * ALL CONVENIENCE LOOKUP FUNCTIONS RELY ON THIS!\n   * @param subj - A node to search for as subject, or if null, a wildcard\n   * @param pred - A node to search for as predicate, or if null, a wildcard\n   * @param obj - A node to search for as object, or if null, a wildcard\n   * @param why - A node to search for as graph, or if null, a wildcard\n   * @param justOne - flag - stop when found one rather than get all of them?\n   * @returns An array of nodes which match the wildcard position\n   */\n  statementsMatching (\n    subj?: Quad_Subject | null,\n    pred?: Quad_Predicate | null,\n    obj?: Quad_Object | null,\n    why?: Quad_Graph | null,\n    justOne?: boolean\n  ): Statement[] {\n    // log.debug(\"Matching {\"+subj+\" \"+pred+\" \"+obj+\"}\")\n    var pat = [ subj, pred, obj, why ]\n    var pattern: Term[] = []\n    var hash: Indexable[] = []\n    var wild: number[] = [] // wildcards\n    var given: number[] = [] // Not wild\n    var p: number\n    var list\n    for (p = 0; p < 4; p++) {\n      pattern[p] = this.canon(Node.fromValue(pat[p]))\n      if (!pattern[p]) {\n        wild.push(p)\n      } else {\n        given.push(p)\n        hash[p] = this.id(pattern[p])\n      }\n    }\n    if (given.length === 0) {\n      return this.statements\n    }\n    if (given.length === 1) { // Easy too, we have an index for that\n      p = given[0]\n      list = this.index[p][hash[p]]\n      if (list && justOne) {\n        if (list.length > 1) {\n          list = list.slice(0, 1)\n        }\n      }\n      list = list || []\n      return list\n    }\n    // Now given.length is 2, 3 or 4.\n    // We hope that the scale-free nature of the data will mean we tend to get\n    // a short index in there somewhere!\n    var best = 1e10 // really bad\n    var iBest\n    var i\n    for (i = 0; i < given.length; i++) {\n      p = given[i] // Which part we are dealing with\n      list = this.index[p][hash[p]]\n      if (!list) {\n        return [] // No occurrences\n      }\n      if (list.length < best) {\n        best = list.length\n        iBest = i // (not p!)\n      }\n    }\n    // Ok, we have picked the shortest index but now we have to filter it\n    var pBest = given[iBest]\n    var possibles: Statement[] = this.index[pBest][hash[pBest]]\n    var check = given.slice(0, iBest).concat(given.slice(iBest + 1)) // remove iBest\n    var results: Statement[] = []\n    var parts = [ 'subject', 'predicate', 'object', 'why' ]\n    for (var j = 0; j < possibles.length; j++) {\n      var st: Statement | null = possibles[j]\n\n      for (i = 0; i < check.length; i++) { // for each position to be checked\n        p = check[i]\n        if (!this.canon(st[parts[p]]).equals(pattern[p])) {\n          st = null\n          break\n        }\n      }\n      if (st != null) {\n        results.push(st)\n        if (justOne) break\n      }\n    }\n    return results\n  }\n\n  /**\n   * A list of all the URIs by which this thing is known\n   * @param term\n   */\n  uris(term: Quad_Subject): string[] {\n    var cterm = this.canon(term)\n    var terms = this.aliases[this.id(cterm)]\n    if (!cterm.value) return []\n    var res = [ cterm.value ]\n    if (terms) {\n      for (var i = 0; i < terms.length; i++) {\n        res.push(terms[i].uri)\n      }\n    }\n    return res\n  }\n}\nIndexedFormula.handleRDFType = handleRDFType\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nmodule.exports = class JsonLdError extends Error {\n  /**\n   * Creates a JSON-LD Error.\n   *\n   * @param msg the error message.\n   * @param type the error type.\n   * @param details the error details.\n   */\n  constructor(\n    message = 'An unspecified JSON-LD error occurred.',\n    name = 'jsonld.Error',\n    details = {}) {\n    super(message);\n    this.name = name;\n    this.message = message;\n    this.details = details;\n  }\n};\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst types = require('./types');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Returns true if the given value is a subject with properties.\n *\n * @param v the value to check.\n *\n * @return true if the value is a subject with properties, false if not.\n */\napi.isSubject = v => {\n  // Note: A value is a subject if all of these hold true:\n  // 1. It is an Object.\n  // 2. It is not a @value, @set, or @list.\n  // 3. It has more than 1 key OR any existing key is not @id.\n  if(types.isObject(v) &&\n    !(('@value' in v) || ('@set' in v) || ('@list' in v))) {\n    const keyCount = Object.keys(v).length;\n    return (keyCount > 1 || !('@id' in v));\n  }\n  return false;\n};\n\n/**\n * Returns true if the given value is a subject reference.\n *\n * @param v the value to check.\n *\n * @return true if the value is a subject reference, false if not.\n */\napi.isSubjectReference = v =>\n  // Note: A value is a subject reference if all of these hold true:\n  // 1. It is an Object.\n  // 2. It has a single key: @id.\n  (types.isObject(v) && Object.keys(v).length === 1 && ('@id' in v));\n\n/**\n * Returns true if the given value is a @value.\n *\n * @param v the value to check.\n *\n * @return true if the value is a @value, false if not.\n */\napi.isValue = v =>\n  // Note: A value is a @value if all of these hold true:\n  // 1. It is an Object.\n  // 2. It has the @value property.\n  types.isObject(v) && ('@value' in v);\n\n/**\n * Returns true if the given value is a @list.\n *\n * @param v the value to check.\n *\n * @return true if the value is a @list, false if not.\n */\napi.isList = v =>\n  // Note: A value is a @list if all of these hold true:\n  // 1. It is an Object.\n  // 2. It has the @list property.\n  types.isObject(v) && ('@list' in v);\n\n/**\n * Returns true if the given value is a @graph.\n *\n * @return true if the value is a @graph, false if not.\n */\napi.isGraph = v => {\n  // Note: A value is a graph if all of these hold true:\n  // 1. It is an object.\n  // 2. It has an `@graph` key.\n  // 3. It may have '@id' or '@index'\n  return types.isObject(v) &&\n    '@graph' in v &&\n    Object.keys(v)\n      .filter(key => key !== '@id' && key !== '@index').length === 1;\n};\n\n/**\n * Returns true if the given value is a simple @graph.\n *\n * @return true if the value is a simple @graph, false if not.\n */\napi.isSimpleGraph = v => {\n  // Note: A value is a simple graph if all of these hold true:\n  // 1. It is an object.\n  // 2. It has an `@graph` key.\n  // 3. It has only 1 key or 2 keys where one of them is `@index`.\n  return api.isGraph(v) && !('@id' in v);\n};\n\n/**\n * Returns true if the given value is a blank node.\n *\n * @param v the value to check.\n *\n * @return true if the value is a blank node, false if not.\n */\napi.isBlankNode = v => {\n  // Note: A value is a blank node if all of these hold true:\n  // 1. It is an Object.\n  // 2. If it has an @id key its value begins with '_:'.\n  // 3. It has no keys OR is not a @value, @set, or @list.\n  if(types.isObject(v)) {\n    if('@id' in v) {\n      return (v['@id'].indexOf('_:') === 0);\n    }\n    return (Object.keys(v).length === 0 ||\n      !(('@value' in v) || ('@set' in v) || ('@list' in v)));\n  }\n  return false;\n};\n","// Prevents circular dependencies between data-factory-internal and statement\n\nimport NamedNode from '../named-node'\n\nexport const defaultGraphURI = 'chrome:theSession'\nexport const defaultGraphNode = new NamedNode(defaultGraphURI)\n","import RdflibBlankNode from './blank-node'\nimport ClassOrder from './class-order'\nimport Literal from './literal'\nimport Node from './node-internal'\nimport {\n  Bindings,\n  CollectionTermType,\n  FromValueReturns,\n  ValueType\n} from './types'\nimport Variable from './variable'\nimport { isTerm } from './utils/terms'\nimport { Term } from './tf-types'\n\n/**\n * Creates an RDF Node from a native javascript value.\n * RDF Nodes are returned unchanged, undefined returned as itself.\n * Arrays return Collections.\n * Strings, numbers and booleans return Literals.\n * @param value {Node|Date|String|Number|Boolean|Undefined}\n * @return {Node|Collection}\n */\nexport function fromValue <T extends FromValueReturns<C> = any, C extends Node = any>(value: ValueType): T {\n  if (typeof value === 'undefined' || value === null) {\n    return value as T\n  }\n\n  if (isTerm(value)) {  // a Node subclass or a Collection\n    return value as T\n  }\n\n  if (Array.isArray(value)) {\n    return new Collection<C>(value) as T\n  }\n\n  return Literal.fromValue<any>(value)\n}\n\n/**\n * A collection of other RDF nodes\n *\n * Use generic T to control the contents of the array.\n */\nexport default class Collection<\n  T extends Node = Node | RdflibBlankNode | Collection<any> | Literal | Variable\n> extends Node implements Term {\n  static termType: typeof CollectionTermType = CollectionTermType\n  termType: typeof CollectionTermType = CollectionTermType\n\n  classOrder = ClassOrder.Collection\n  closed: boolean = false\n  compareTerm = RdflibBlankNode.prototype.compareTerm\n  /**\n   * The nodes in this collection\n   */\n  elements: T[] = []\n  isVar = 0\n\n  constructor (initial?: ReadonlyArray<ValueType>) {\n    super((RdflibBlankNode.nextId++).toString())\n\n    if (initial && initial.length > 0) {\n      initial.forEach(element => {\n        this.elements.push(fromValue<T>(element))\n      })\n    }\n  }\n\n  public get id (): string {\n    return this.value\n  }\n\n  public set id (value) {\n    this.value = value\n  }\n\n  /**\n   * Appends an element to this collection\n   * @param element - The new element\n   */\n  append (element: T): number {\n    return this.elements.push(element)\n  }\n\n  /**\n   * Closes this collection\n   */\n  close (): boolean {\n    this.closed = true\n    return this.closed\n  }\n\n  /**\n   * Removes the first element from the collection (and return it)\n   */\n  shift (): T | undefined {\n    return this.elements.shift()\n  }\n\n  /**\n   * Creates a new Collection with the substituting bindings applied\n   * @param bindings - The bindings to substitute\n   */\n  substitute (bindings: Bindings) {\n    const elementsCopy = this.elements.map((ea) => ea.substitute(bindings))\n\n    return new Collection(elementsCopy) as Collection<Node | Collection<any> | Literal | Variable>\n  }\n\n  toNT () {\n    return Collection.toNT(this)\n  }\n\n  static toNT (collection) {\n    return RdflibBlankNode.NTAnonymousNodePrefix + collection.id\n  }\n\n  /**\n   * Serializes the collection to a string.\n   * Surrounded by (parentheses) and separated by spaces.\n   */\n  toString () {\n    return '(' + this.elements.join(' ') + ')'\n  }\n\n  /**\n   * Prepends the specified element to the collection's front\n   * @param element - The element to prepend\n   */\n  unshift (element: T): number {\n    return this.elements.unshift(element)\n  }\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst types = require('./types');\n\nconst api = {};\nmodule.exports = api;\n\n// define URL parser\n// parseUri 1.2.2\n// (c) Steven Levithan <stevenlevithan.com>\n// MIT License\n// with local jsonld.js modifications\napi.parsers = {\n  simple: {\n    // RFC 3986 basic parts\n    keys: [\n      'href', 'scheme', 'authority', 'path', 'query', 'fragment'\n    ],\n    /* eslint-disable-next-line max-len */\n    regex: /^(?:([^:\\/?#]+):)?(?:\\/\\/([^\\/?#]*))?([^?#]*)(?:\\?([^#]*))?(?:#(.*))?/\n  },\n  full: {\n    keys: [\n      'href', 'protocol', 'scheme', 'authority', 'auth', 'user', 'password',\n      'hostname', 'port', 'path', 'directory', 'file', 'query', 'fragment'\n    ],\n    /* eslint-disable-next-line max-len */\n    regex: /^(([^:\\/?#]+):)?(?:\\/\\/((?:(([^:@]*)(?::([^:@]*))?)?@)?([^:\\/?#]*)(?::(\\d*))?))?(?:(((?:[^?#\\/]*\\/)*)([^?#]*))(?:\\?([^#]*))?(?:#(.*))?)/\n  }\n};\napi.parse = (str, parser) => {\n  const parsed = {};\n  const o = api.parsers[parser || 'full'];\n  const m = o.regex.exec(str);\n  let i = o.keys.length;\n  while(i--) {\n    parsed[o.keys[i]] = (m[i] === undefined) ? null : m[i];\n  }\n\n  // remove default ports in found in URLs\n  if((parsed.scheme === 'https' && parsed.port === '443') ||\n    (parsed.scheme === 'http' && parsed.port === '80')) {\n    parsed.href = parsed.href.replace(':' + parsed.port, '');\n    parsed.authority = parsed.authority.replace(':' + parsed.port, '');\n    parsed.port = null;\n  }\n\n  parsed.normalizedPath = api.removeDotSegments(parsed.path);\n  return parsed;\n};\n\n/**\n * Prepends a base IRI to the given relative IRI.\n *\n * @param base the base IRI.\n * @param iri the relative IRI.\n *\n * @return the absolute IRI.\n */\napi.prependBase = (base, iri) => {\n  // skip IRI processing\n  if(base === null) {\n    return iri;\n  }\n  // already an absolute IRI\n  if(api.isAbsolute(iri)) {\n    return iri;\n  }\n\n  // parse base if it is a string\n  if(!base || types.isString(base)) {\n    base = api.parse(base || '');\n  }\n\n  // parse given IRI\n  const rel = api.parse(iri);\n\n  // per RFC3986 5.2.2\n  const transform = {\n    protocol: base.protocol || ''\n  };\n\n  if(rel.authority !== null) {\n    transform.authority = rel.authority;\n    transform.path = rel.path;\n    transform.query = rel.query;\n  } else {\n    transform.authority = base.authority;\n\n    if(rel.path === '') {\n      transform.path = base.path;\n      if(rel.query !== null) {\n        transform.query = rel.query;\n      } else {\n        transform.query = base.query;\n      }\n    } else {\n      if(rel.path.indexOf('/') === 0) {\n        // IRI represents an absolute path\n        transform.path = rel.path;\n      } else {\n        // merge paths\n        let path = base.path;\n\n        // append relative path to the end of the last directory from base\n        path = path.substr(0, path.lastIndexOf('/') + 1);\n        if((path.length > 0 || base.authority) && path.substr(-1) !== '/') {\n          path += '/';\n        }\n        path += rel.path;\n\n        transform.path = path;\n      }\n      transform.query = rel.query;\n    }\n  }\n\n  if(rel.path !== '') {\n    // remove slashes and dots in path\n    transform.path = api.removeDotSegments(transform.path);\n  }\n\n  // construct URL\n  let rval = transform.protocol;\n  if(transform.authority !== null) {\n    rval += '//' + transform.authority;\n  }\n  rval += transform.path;\n  if(transform.query !== null) {\n    rval += '?' + transform.query;\n  }\n  if(rel.fragment !== null) {\n    rval += '#' + rel.fragment;\n  }\n\n  // handle empty base\n  if(rval === '') {\n    rval = './';\n  }\n\n  return rval;\n};\n\n/**\n * Removes a base IRI from the given absolute IRI.\n *\n * @param base the base IRI.\n * @param iri the absolute IRI.\n *\n * @return the relative IRI if relative to base, otherwise the absolute IRI.\n */\napi.removeBase = (base, iri) => {\n  // skip IRI processing\n  if(base === null) {\n    return iri;\n  }\n\n  if(!base || types.isString(base)) {\n    base = api.parse(base || '');\n  }\n\n  // establish base root\n  let root = '';\n  if(base.href !== '') {\n    root += (base.protocol || '') + '//' + (base.authority || '');\n  } else if(iri.indexOf('//')) {\n    // support network-path reference with empty base\n    root += '//';\n  }\n\n  // IRI not relative to base\n  if(iri.indexOf(root) !== 0) {\n    return iri;\n  }\n\n  // remove root from IRI and parse remainder\n  const rel = api.parse(iri.substr(root.length));\n\n  // remove path segments that match (do not remove last segment unless there\n  // is a hash or query)\n  const baseSegments = base.normalizedPath.split('/');\n  const iriSegments = rel.normalizedPath.split('/');\n  const last = (rel.fragment || rel.query) ? 0 : 1;\n  while(baseSegments.length > 0 && iriSegments.length > last) {\n    if(baseSegments[0] !== iriSegments[0]) {\n      break;\n    }\n    baseSegments.shift();\n    iriSegments.shift();\n  }\n\n  // use '../' for each non-matching base segment\n  let rval = '';\n  if(baseSegments.length > 0) {\n    // don't count the last segment (if it ends with '/' last path doesn't\n    // count and if it doesn't end with '/' it isn't a path)\n    baseSegments.pop();\n    for(let i = 0; i < baseSegments.length; ++i) {\n      rval += '../';\n    }\n  }\n\n  // prepend remaining segments\n  rval += iriSegments.join('/');\n\n  // add query and hash\n  if(rel.query !== null) {\n    rval += '?' + rel.query;\n  }\n  if(rel.fragment !== null) {\n    rval += '#' + rel.fragment;\n  }\n\n  // handle empty base\n  if(rval === '') {\n    rval = './';\n  }\n\n  return rval;\n};\n\n/**\n * Removes dot segments from a URL path.\n *\n * @param path the path to remove dot segments from.\n */\napi.removeDotSegments = path => {\n  // RFC 3986 5.2.4 (reworked)\n\n  // empty path shortcut\n  if(path.length === 0) {\n    return '';\n  }\n\n  const input = path.split('/');\n  const output = [];\n\n  while(input.length > 0) {\n    const next = input.shift();\n    const done = input.length === 0;\n\n    if(next === '.') {\n      if(done) {\n        // ensure output has trailing /\n        output.push('');\n      }\n      continue;\n    }\n\n    if(next === '..') {\n      output.pop();\n      if(done) {\n        // ensure output has trailing /\n        output.push('');\n      }\n      continue;\n    }\n\n    output.push(next);\n  }\n\n  // if path was absolute, ensure output has leading /\n  if(path[0] === '/' && output.length > 0 && output[0] !== '') {\n    output.unshift('');\n  }\n  if(output.length === 1 && output[0] === '') {\n    return '/';\n  }\n\n  return output.join('/');\n};\n\n// TODO: time better isAbsolute/isRelative checks using full regexes:\n// http://jmrware.com/articles/2009/uri_regexp/URI_regex.html\n\n// regex to check for absolute IRI (starting scheme and ':') or blank node IRI\nconst isAbsoluteRegex = /^([A-Za-z][A-Za-z0-9+-.]*|_):[^\\s]*$/;\n\n/**\n * Returns true if the given value is an absolute IRI or blank node IRI, false\n * if not.\n * Note: This weak check only checks for a correct starting scheme.\n *\n * @param v the value to check.\n *\n * @return true if the value is an absolute IRI, false if not.\n */\napi.isAbsolute = v => types.isString(v) && isAbsoluteRegex.test(v);\n\n/**\n * Returns true if the given value is a relative IRI, false if not.\n * Note: this is a weak check.\n *\n * @param v the value to check.\n *\n * @return true if the value is a relative IRI, false if not.\n */\napi.isRelative = v => types.isString(v);\n","/**\n*\n*  UTF-8 data encode / decode\n*  http://www.webtoolkit.info/\n*\n**/\nimport * as Uri from './uri'\nimport { ArrayIndexOf } from './utils'\n\nfunction hexify (str) { // also used in parser\n  return encodeURI(str);\n}\n\nvar Utf8 = {\n    // public method for url encoding\n    encode : function (string) {\n        string = string.replace(/\\r\\n/g,\"\\n\");\n        var utftext = \"\";\n\n        for (var n = 0; n < string.length; n++) {\n\n            var c = string.charCodeAt(n);\n\n            if (c < 128) {\n                    utftext += String.fromCharCode(c);\n            }\n            else if((c > 127) && (c < 2048)) {\n                    utftext += String.fromCharCode((c >> 6) | 192);\n                    utftext += String.fromCharCode((c & 63) | 128);\n            }\n            else {\n                    utftext += String.fromCharCode((c >> 12) | 224);\n                    utftext += String.fromCharCode(((c >> 6) & 63) | 128);\n                    utftext += String.fromCharCode((c & 63) | 128);\n            }\n\n        }\n\n        return utftext;\n    },\n    // public method for url decoding\n    decode : function (utftext) {\n        var string = \"\";\n        var i = 0;\n\n        while ( i < utftext.length ) {\n\n                var c = utftext.charCodeAt(i);\n                if (c < 128) {\n                        string += String.fromCharCode(c);\n                        i++;\n                }\n                else if((c > 191) && (c < 224)) {\n                        string += String.fromCharCode(((c & 31) << 6)\n                            | (utftext.charCodeAt(i+1) & 63));\n                        i += 2;\n                }\n                else {\n                        string += String.fromCharCode(((c & 15) << 12)\n                            | ((utftext.charCodeAt(i+1) & 63) << 6)\n                            | (utftext.charCodeAt(i+2) & 63));\n                        i += 3;\n                }\n        }\n        return string;\n    }\n}// Things we need to define to make converted pythn code work in js\n// environment of $rdf\n\nvar RDFSink_forSomeSym = \"http://www.w3.org/2000/10/swap/log#forSome\";\nvar RDFSink_forAllSym = \"http://www.w3.org/2000/10/swap/log#forAll\";\nvar Logic_NS = \"http://www.w3.org/2000/10/swap/log#\";\n\n//  pyjs seems to reference runtime library which I didn't find\n\nvar pyjslib_Tuple = function(theList) { return theList };\n\nvar pyjslib_List = function(theList) { return theList };\n\nvar pyjslib_Dict = function(listOfPairs) {\n    if (listOfPairs.length > 0)\n\tthrow \"missing.js: oops nnonempty dict not imp\";\n    return [];\n}\n\nvar pyjslib_len = function(s) { return s.length }\n\nvar pyjslib_slice = function(str, i, j) {\n    if (typeof str.slice == 'undefined')\n        throw '@@ mising.js: No .slice function for '+str+' of type '+(typeof str)\n    if ((typeof j == 'undefined') || (j ==null)) return str.slice(i);\n    return str.slice(i, j) // @ exactly the same spec?\n}\nvar StopIteration = Error('dummy error stop iteration');\n\nvar pyjslib_Iterator = function(theList) {\n    this.last = 0;\n    this.li = theList;\n    this.next = function() {\n\tif (this.last == this.li.length) throw StopIteration;\n\treturn this.li[this.last++];\n    }\n    return this;\n};\n\nvar ord = function(str) {\n    return str.charCodeAt(0)\n}\n\nvar string_find = function(str, s) {\n    return str.indexOf(s)\n}\n\nvar assertFudge = function(condition, desc) {\n    if (condition) return;\n    if (desc) throw \"python Assertion failed: \"+desc;\n    throw \"(python) Assertion failed.\";\n}\n\n\nvar stringFromCharCode = function(uesc) {\n    return String.fromCharCode(uesc);\n}\n\n\nString.prototype.encode = function(encoding) {\n    if (encoding != 'utf-8') throw \"UTF8_converter: can only do utf-8\"\n    return Utf8.encode(this);\n}\nString.prototype.decode = function(encoding) {\n    if (encoding != 'utf-8') throw \"UTF8_converter: can only do utf-8\"\n    //return Utf8.decode(this);\n    return this;\n}\n\n\n\nvar uripath_join = function(base, given) {\n    return Uri.join(given, base)  // sad but true\n}\n\nvar becauseSubexpression = null; // No reason needed\nvar diag_tracking = 0;\nvar diag_chatty_flag = 0;\nvar diag_progress = function(str) { /*$rdf.log.debug(str);*/ }\n\n// why_BecauseOfData = function(doc, reason) { return doc };\n\n\nvar RDF_type_URI = \"http://www.w3.org/1999/02/22-rdf-syntax-ns#type\";\nvar DAML_sameAs_URI = \"http://www.w3.org/2002/07/owl#sameAs\";\n\n/*\nfunction SyntaxError(details) {\n    return new __SyntaxError(details);\n}\n*/\n\nfunction __SyntaxError(details) {\n    this.details = details\n}\n\n/*\n\n$Id: n3parser.js 14561 2008-02-23 06:37:26Z kennyluck $\n\nHAND EDITED FOR CONVERSION TO JAVASCRIPT\n\nThis module implements a Nptation3 parser, and the final\npart of a notation3 serializer.\n\nSee also:\n\nNotation 3\nhttp://www.w3.org/DesignIssues/Notation3\n\nClosed World Machine - and RDF Processor\nhttp://www.w3.org/2000/10/swap/cwm\n\nTo DO: See also \"@@\" in comments\n\n- Clean up interfaces\n______________________________________________\n\nModule originally by Dan Connolly, includeing notation3\nparser and RDF generator. TimBL added RDF stream model\nand N3 generation, replaced stream model with use\nof common store/formula API.  Yosi Scharf developped\nthe module, including tests and test harness.\n\n*/\n\nvar ADDED_HASH = \"#\";\nvar LOG_implies_URI = \"http://www.w3.org/2000/10/swap/log#implies\";\nvar INTEGER_DATATYPE = \"http://www.w3.org/2001/XMLSchema#integer\";\nvar FLOAT_DATATYPE = \"http://www.w3.org/2001/XMLSchema#double\";\nvar DECIMAL_DATATYPE = \"http://www.w3.org/2001/XMLSchema#decimal\";\nvar DATE_DATATYPE = \"http://www.w3.org/2001/XMLSchema#date\";\nvar DATETIME_DATATYPE = \"http://www.w3.org/2001/XMLSchema#dateTime\";\nvar BOOLEAN_DATATYPE = \"http://www.w3.org/2001/XMLSchema#boolean\";\nvar option_noregen = 0;\nvar _notQNameChars = \"\\t\\r\\n !\\\"#$%&'()*.,+/;<=>?@[\\\\]^`{|}~\";\nvar _notNameChars =  ( _notQNameChars + \":\" ) ;\nvar _rdfns = \"http://www.w3.org/1999/02/22-rdf-syntax-ns#\";\nvar N3CommentCharacter = \"#\";\nvar eol = new RegExp(\"^[ \\\\t]*(#[^\\\\n]*)?\\\\r?\\\\n\", 'g');\nvar eof = new RegExp(\"^[ \\\\t]*(#[^\\\\n]*)?$\", 'g');\nvar ws = new RegExp(\"^[ \\\\t]*\", 'g');\nvar signed_integer = new RegExp(\"^[-+]?[0-9]+\", 'g');\nvar number_syntax = new RegExp(\"^([-+]?[0-9]+)(\\\\.[0-9]+)?(e[-+]?[0-9]+)?\", 'g');\nvar datetime_syntax = new RegExp('^[0-9][0-9][0-9][0-9]-[0-9][0-9]-[0-9][0-9](T[0-9][0-9]:[0-9][0-9](:[0-9][0-9](\\\\.[0-9]*)?)?)?Z?');\n\nvar digitstring = new RegExp(\"^[0-9]+\", 'g');\nvar interesting = new RegExp(\"[\\\\\\\\\\\\r\\\\n\\\\\\\"]\", 'g');\nvar langcode = new RegExp(\"^[a-zA-Z0-9]+(-[a-zA-Z0-9]+)*\", 'g');\n\nfunction createSinkParser(store, openFormula, thisDoc, baseURI, genPrefix, metaURI, flags, why) {\n    return new SinkParser(store, openFormula, thisDoc, baseURI, genPrefix, metaURI, flags, why);\n}\n\nexport default createSinkParser;\n\nexport class SinkParser {\n    constructor(store, openFormula, thisDoc, baseURI, genPrefix, metaURI, flags, why) {\n        if (typeof openFormula == 'undefined') openFormula=null;\n        if (typeof thisDoc == 'undefined') thisDoc=\"\";\n        if (typeof baseURI == 'undefined') baseURI=null;\n        if (typeof genPrefix == 'undefined') genPrefix=\"\";\n        if (typeof metaURI == 'undefined') metaURI=null;\n        if (typeof flags == 'undefined') flags=\"\";\n        if (typeof why == 'undefined') why=null;\n        /*\n        note: namespace names should *not* end in #;\n        the # will get added during qname processing */\n\n        this._bindings = new pyjslib_Dict([]);\n        this._flags = flags;\n        if ((thisDoc != \"\")) {\n            assertFudge((thisDoc.indexOf(\":\") >= 0),  ( \"Document URI not absolute: \" + thisDoc ) );\n            this._bindings[\"\"] = (  ( thisDoc + \"#\" ) );\n        }\n        this._store = store;\n        if (genPrefix) {\n            store.setGenPrefix(genPrefix);\n        }\n        this._thisDoc = thisDoc;\n        this.source = store.sym(thisDoc);\n        this.lines = 0;\n        this.statementCount = 0;\n        this.startOfLine = 0;\n        this.previousLine = 0;\n        this._genPrefix = genPrefix;\n        this.keywords = new pyjslib_List([\"a\", \"this\", \"bind\", \"has\", \"is\", \"of\", \"true\", \"false\"]);\n        this.keywordsSet = 0;\n        this._anonymousNodes = new pyjslib_Dict([]);\n        this._variables = new pyjslib_Dict([]);\n        this._parentVariables = new pyjslib_Dict([]);\n        this._reason = why;\n        this._reason2 = null;\n        if (diag_tracking) {\n            this._reason2 = why_BecauseOfData(store.sym(thisDoc), this._reason);\n        }\n        if (baseURI) {\n            this._baseURI = baseURI;\n        }\n        else {\n            if (thisDoc) {\n                this._baseURI = thisDoc;\n            }\n            else {\n                this._baseURI = null;\n            }\n        }\n        assertFudge(!(this._baseURI) || (this._baseURI.indexOf(\":\") >= 0));\n        if (!(this._genPrefix)) {\n            if (this._thisDoc) {\n                this._genPrefix =  ( this._thisDoc + \"#_g\" ) ;\n            }\n            else {\n                this._genPrefix = RDFSink_uniqueURI();\n            }\n        }\n        if ((openFormula == null)) {\n            if (this._thisDoc) {\n                this._formula = store.formula( ( thisDoc + \"#_formula\" ) );\n            }\n            else {\n                this._formula = store.formula();\n            }\n        }\n        else {\n            this._formula = openFormula;\n        }\n        this._context = this._formula;\n        this._parentContext = null;\n    }\n\n\n    here(i) {\n        return  (  (  (  ( this._genPrefix + \"_L\" )  + this.lines )  + \"C\" )  +  (  ( i - this.startOfLine )  + 1 )  ) ;\n    };\n    formula() {\n        return this._formula;\n    };\n    loadStream(stream) {\n        return this.loadBuf(stream.read());\n    };\n    loadBuf(buf) {\n        /*\n        Parses a buffer and returns its top level formula*/\n\n        this.startDoc();\n        this.feed(buf);\n        return this.endDoc();\n    };\n    feed(octets) {\n        /*\n        Feed an octet stream tothe parser\n\n        if BadSyntax is raised, the string\n        passed in the exception object is the\n        remainder after any statements have been parsed.\n        So if there is more data to feed to the\n        parser, it should be straightforward to recover.*/\n\n        var str = octets.decode(\"utf-8\");\n        var i = 0;\n        while ((i >= 0)) {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                return;\n            }\n            var i = this.directiveOrStatement(str, j);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected directive or statement\");\n            }\n        }\n    };\n    directiveOrStatement(str, h) {\n        var i = this.skipSpace(str, h);\n        if ((i < 0)) {\n            return i;\n        }\n        var j = this.directive(str, i);\n        if ((j >= 0)) {\n            return this.checkDot(str, j);\n        }\n        var j = this.statement(str, i);\n        if ((j >= 0)) {\n            return this.checkDot(str, j);\n        }\n        return j;\n    };\n    tok(tok, str, i) {\n        /*\n        Check for keyword.  Space must have been stripped on entry and\n        we must not be at end of file.*/\n        var whitespace = \"\\t\\n\\v\\f\\r \";\n        if ((str.slice( i,  ( i + 1 ) ) == \"@\")) {\n            var i =  ( i + 1 ) ;\n        }\n        else {\n            if ((ArrayIndexOf(this.keywords,tok) < 0)) {\n                return -1;\n            }\n        }\n        var k =  ( i + pyjslib_len(tok) ) ;\n        if ((str.slice( i, k) == tok) && (_notQNameChars.indexOf(str.charAt(k)) >= 0)) {\n            return k;\n        }\n        else {\n            return -1;\n        }\n    };\n    directive(str, i) {\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return j;\n        }\n        var res = new pyjslib_List([]);\n        var j = this.tok(\"bind\", str, i);\n        if ((j > 0)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, i, \"keyword bind is obsolete: use @prefix\");\n        }\n        var j = this.tok(\"keywords\", str, i);\n        if ((j > 0)) {\n            var i = this.commaSeparatedList(str, j, res, false);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"'@keywords' needs comma separated list of words\");\n            }\n            this.setKeywords(pyjslib_slice(res, null, null));\n            if ((diag_chatty_flag > 80)) {\n                diag_progress(\"Keywords \", this.keywords);\n            }\n            return i;\n        }\n        var j = this.tok(\"forAll\", str, i);\n        if ((j > 0)) {\n            var i = this.commaSeparatedList(str, j, res, true);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"Bad variable list after @forAll\");\n            }\n\n            var __x = new pyjslib_Iterator(res);\n            try {\n                while (true) {\n                    var x = __x.next();\n\n\n                    if (ArrayIndexOf(this._variables,x) < 0 || (ArrayIndexOf(this._parentVariables,x) >= 0)) {\n                        this._variables[x] = ( this._context.newUniversal(x));\n                    }\n\n                }\n            } catch (e) {\n                if (e != StopIteration) {\n                    throw e;\n                }\n            }\n\n            return i;\n        }\n        var j = this.tok(\"forSome\", str, i);\n        if ((j > 0)) {\n            var i = this.commaSeparatedList(str, j, res, this.uri_ref2);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"Bad variable list after @forSome\");\n            }\n\n            var __x = new pyjslib_Iterator(res);\n            try {\n                while (true) {\n                    var x = __x.next();\n\n\n                    this._context.declareExistential(x);\n\n                }\n            } catch (e) {\n                if (e != StopIteration) {\n                    throw e;\n                }\n            }\n\n            return i;\n        }\n        var j = this.tok(\"prefix\", str, i);\n        if ((j >= 0)) {\n            var t = new pyjslib_List([]);\n            var i = this.qname(str, j, t);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected qname after @prefix\");\n            }\n            var j = this.uri_ref2(str, i, t);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected <uriref> after @prefix _qname_\");\n            }\n            var ns = t[1].uri;\n            if (this._baseURI) {\n                var ns = uripath_join(this._baseURI, ns);\n            }\n            else {\n                assertFudge((ns.indexOf(\":\") >= 0), \"With no base URI, cannot handle relative URI for NS\");\n            }\n            assertFudge((ns.indexOf(\":\") >= 0));\n            this._bindings[t[0][0]] = ( ns);\n\n            this.bind(t[0][0], hexify(ns));\n            return j;\n        }\n        var j = this.tok(\"base\", str, i);\n        if ((j >= 0)) {\n            var t = new pyjslib_List([]);\n            var i = this.uri_ref2(str, j, t);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected <uri> after @base \");\n            }\n            var ns = t[0].uri;\n            if (this._baseURI) {\n                var ns = uripath_join(this._baseURI, ns);\n            }\n            else {\n                throw BadSyntax(this._thisDoc, this.lines, str, j,  (  ( \"With no previous base URI, cannot use relative URI in @base  <\" + ns )  + \">\" ) );\n            }\n            assertFudge((ns.indexOf(\":\") >= 0));\n            this._baseURI = ns;\n            return i;\n        }\n        return -1;\n    };\n    bind(qn, uri) {\n        if ((qn == \"\")) {\n        }\n        else {\n            this._store.setPrefixForURI(qn, uri);\n        }\n    };\n    setKeywords(k) {\n        /*\n        Takes a list of strings*/\n\n        if ((k == null)) {\n            this.keywordsSet = 0;\n        }\n        else {\n            this.keywords = k;\n            this.keywordsSet = 1;\n        }\n    };\n    startDoc() {\n    };\n    endDoc() {\n        /*\n        Signal end of document and stop parsing. returns formula*/\n\n        return this._formula;\n    };\n    makeStatement(quad) {\n        quad[0].add(quad[2], quad[1], quad[3], this.source);\n        this.statementCount += 1;\n    };\n    statement(str, i) {\n        var r = new pyjslib_List([]);\n        var i = this.object(str, i, r);\n        if ((i < 0)) {\n            return i;\n        }\n        var j = this.property_list(str, i, r[0]);\n        if ((j < 0)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected propertylist\");\n        }\n        return j;\n    };\n    subject(str, i, res) {\n        return this.item(str, i, res);\n    };\n    verb(str, i, res) {\n        /*\n        has _prop_\n        is _prop_ of\n        a\n        =\n        _prop_\n        >- prop ->\n        <- prop -<\n        _operator_*/\n\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return j;\n        }\n        var r = new pyjslib_List([]);\n        var j = this.tok(\"has\", str, i);\n        if ((j >= 0)) {\n            var i = this.prop(str, j, r);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected property after 'has'\");\n            }\n            res.push(new pyjslib_Tuple([\"->\", r[0]]));\n            return i;\n        }\n        var j = this.tok(\"is\", str, i);\n        if ((j >= 0)) {\n            var i = this.prop(str, j, r);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected <property> after 'is'\");\n            }\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"End of file found, expected property after 'is'\");\n                return j;\n            }\n            var i = j;\n            var j = this.tok(\"of\", str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected 'of' after 'is' <prop>\");\n            }\n            res.push(new pyjslib_Tuple([\"<-\", r[0]]));\n            return j;\n        }\n        var j = this.tok(\"a\", str, i);\n        if ((j >= 0)) {\n            res.push(new pyjslib_Tuple([\"->\", this._store.sym(RDF_type_URI)]));\n            return j;\n        }\n        if ((str.slice( i,  ( i + 2 ) ) == \"<=\")) {\n            res.push(new pyjslib_Tuple([\"<-\", this._store.sym( ( Logic_NS + \"implies\" ) )]));\n            return  ( i + 2 ) ;\n        }\n        if ((str.slice( i,  ( i + 1 ) ) == \"=\")) {\n            if ((str.slice(  ( i + 1 ) ,  ( i + 2 ) ) == \">\")) {\n                res.push(new pyjslib_Tuple([\"->\", this._store.sym( ( Logic_NS + \"implies\" ) )]));\n                return  ( i + 2 ) ;\n            }\n            res.push(new pyjslib_Tuple([\"->\", this._store.sym(DAML_sameAs_URI)]));\n            return  ( i + 1 ) ;\n        }\n        if ((str.slice( i,  ( i + 2 ) ) == \":=\")) {\n            res.push(new pyjslib_Tuple([\"->\",  ( Logic_NS + \"becomes\" ) ]));\n            return  ( i + 2 ) ;\n        }\n        var j = this.prop(str, i, r);\n        if ((j >= 0)) {\n            res.push(new pyjslib_Tuple([\"->\", r[0]]));\n            return j;\n        }\n        if ((str.slice( i,  ( i + 2 ) ) == \">-\") || (str.slice( i,  ( i + 2 ) ) == \"<-\")) {\n            throw BadSyntax(this._thisDoc, this.lines, str, j, \">- ... -> syntax is obsolete.\");\n        }\n        return -1;\n    };\n    prop(str, i, res) {\n        return this.item(str, i, res);\n    };\n    item(str, i, res) {\n        return this.path(str, i, res);\n    };\n    blankNode(uri) {\n        return this._context.bnode(uri, this._reason2);\n    };\n    path(str, i, res) {\n        /*\n        Parse the path production.\n        */\n\n        var j = this.nodeOrLiteral(str, i, res);\n        if ((j < 0)) {\n            return j;\n        }\n        while ((\"!^.\".indexOf(str.slice( j,  ( j + 1 ) )) >= 0)) {\n            var ch = str.slice( j,  ( j + 1 ) );\n            if ((ch == \".\")) {\n                var ahead = str.slice(  ( j + 1 ) ,  ( j + 2 ) );\n                if (!(ahead) || (_notNameChars.indexOf(ahead) >= 0) && (\":?<[{(\".indexOf(ahead) < 0)) {\n                    break;\n                }\n            }\n            var subj = res.pop();\n            var obj = this.blankNode(this.here(j));\n            var j = this.node(str,  ( j + 1 ) , res);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"EOF found in middle of path syntax\");\n            }\n            var pred = res.pop();\n            if ((ch == \"^\")) {\n                this.makeStatement(new pyjslib_Tuple([this._context, pred, obj, subj]));\n            }\n            else {\n                this.makeStatement(new pyjslib_Tuple([this._context, pred, subj, obj]));\n            }\n            res.push(obj);\n        }\n        return j;\n    };\n    anonymousNode(ln) {\n        /*\n        Remember or generate a term for one of these _: anonymous nodes*/\n\n        var term = this._anonymousNodes[ln];\n        if (term) {\n            return term;\n        }\n        var term = this._store.bnode(ln);\n        // var term = this._store.bnode(this._context, this._reason2); eh?\n        this._anonymousNodes[ln] = ( term);\n        return term;\n    };\n    node(str, i, res, subjectAlready) {\n        if (typeof subjectAlready == 'undefined') subjectAlready=null;\n        /*\n        Parse the <node> production.\n        Space is now skipped once at the beginning\n        instead of in multipe calls to self.skipSpace().\n        */\n\n        var subj = subjectAlready;\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return j;\n        }\n        var i = j;\n        var ch = str.slice( i,  ( i + 1 ) );\n        if ((ch == \"[\")) {\n            var bnodeID = this.here(i);\n            var j = this.skipSpace(str,  ( i + 1 ) );\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"EOF after '['\");\n            }\n            if ((str.slice( j,  ( j + 1 ) ) == \"=\")) {\n                var i =  ( j + 1 ) ;\n                var objs = new pyjslib_List([]);\n                var j = this.objectList(str, i, objs);\n\n                if ((j >= 0)) {\n                    var subj = objs[0];\n                    if ((pyjslib_len(objs) > 1)) {\n\n                        var __obj = new pyjslib_Iterator(objs);\n                        try {\n                            while (true) {\n                                var obj = __obj.next();\n\n\n                                this.makeStatement(new pyjslib_Tuple([this._context, this._store.sym(DAML_sameAs_URI), subj, obj]));\n\n                            }\n                        } catch (e) {\n                            if (e != StopIteration) {\n                                throw e;\n                            }\n                        }\n\n                    }\n                    var j = this.skipSpace(str, j);\n                    if ((j < 0)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"EOF when objectList expected after [ = \");\n                    }\n                    if ((str.slice( j,  ( j + 1 ) ) == \";\")) {\n                        var j =  ( j + 1 ) ;\n                    }\n                }\n                else {\n                    throw BadSyntax(this._thisDoc, this.lines, str, i, \"objectList expected after [= \");\n                }\n            }\n            if ((subj == null)) {\n                var subj = this.blankNode(bnodeID);\n            }\n            var i = this.property_list(str, j, subj);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"property_list expected\");\n            }\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"EOF when ']' expected after [ <propertyList>\");\n            }\n            if ((str.slice( j,  ( j + 1 ) ) != \"]\")) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"']' expected\");\n            }\n            res.push(subj);\n            return  ( j + 1 ) ;\n        }\n        if ((ch == \"{\")) {\n            var ch2 = str.slice(  ( i + 1 ) ,  ( i + 2 ) );\n            if ((ch2 == \"$\")) {\n                i += 1;\n                var j =  ( i + 1 ) ;\n                var mylist = new pyjslib_List([]);\n                var first_run = true;\n                while (1) {\n                    var i = this.skipSpace(str, j);\n                    if ((i < 0)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"needed '$}', found end.\");\n                    }\n                    if ((str.slice( i,  ( i + 2 ) ) == \"$}\")) {\n                        var j =  ( i + 2 ) ;\n                        break;\n                    }\n                    if (!(first_run)) {\n                        if ((str.slice( i,  ( i + 1 ) ) == \",\")) {\n                            i += 1;\n                        }\n                        else {\n                            throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected: ','\");\n                        }\n                    }\n                    else {\n                        var first_run = false;\n                    }\n                    var item = new pyjslib_List([]);\n                    var j = this.item(str, i, item);\n                    if ((j < 0)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected item in set or '$}'\");\n                    }\n                    mylist.push(item[0]);\n                }\n                res.push(this._store.newSet(mylist, this._context));\n                return j;\n            }\n            else {\n                var j =  ( i + 1 ) ;\n                var oldParentContext = this._parentContext;\n                this._parentContext = this._context;\n                var parentAnonymousNodes = this._anonymousNodes;\n                var grandParentVariables = this._parentVariables;\n                this._parentVariables = this._variables;\n                this._anonymousNodes = new pyjslib_Dict([]);\n                this._variables = this._variables.slice();\n                var reason2 = this._reason2;\n                this._reason2 = becauseSubexpression;\n                if ((subj == null)) {\n                    var subj = this._store.formula();\n                }\n                this._context = subj;\n                while (1) {\n                    var i = this.skipSpace(str, j);\n                    if ((i < 0)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"needed '}', found end.\");\n                    }\n                    if ((str.slice( i,  ( i + 1 ) ) == \"}\")) {\n                        var j =  ( i + 1 ) ;\n                        break;\n                    }\n                    var j = this.directiveOrStatement(str, i);\n                    if ((j < 0)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected statement or '}'\");\n                    }\n                }\n                this._anonymousNodes = parentAnonymousNodes;\n                this._variables = this._parentVariables;\n                this._parentVariables = grandParentVariables;\n                this._context = this._parentContext;\n                this._reason2 = reason2;\n                this._parentContext = oldParentContext;\n                res.push(subj.close());\n                return j;\n            }\n        }\n        if ((ch == \"(\")) {\n            var thing_type = this._store.list;\n            var ch2 = str.slice(  ( i + 1 ) ,  ( i + 2 ) );\n            if ((ch2 == \"$\")) {\n                var thing_type = this._store.newSet;\n                i += 1;\n            }\n            var j =  ( i + 1 ) ;\n            var mylist = new pyjslib_List([]);\n            while (1) {\n                var i = this.skipSpace(str, j);\n                if ((i < 0)) {\n                    throw BadSyntax(this._thisDoc, this.lines, str, i, \"needed ')', found end.\");\n                }\n                if ((str.slice( i,  ( i + 1 ) ) == \")\")) {\n                    var j =  ( i + 1 ) ;\n                    break;\n                }\n                var item = new pyjslib_List([]);\n                var j = this.item(str, i, item);\n                if ((j < 0)) {\n                    throw BadSyntax(this._thisDoc, this.lines, str, i, \"expected item in list or ')'\");\n                }\n                mylist.push(item[0]);\n            }\n            res.push(thing_type(mylist, this._context));\n            return j;\n        }\n        var j = this.tok(\"this\", str, i);\n        if ((j >= 0)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, i, \"Keyword 'this' was ancient N3. Now use @forSome and @forAll keywords.\");\n            res.push(this._context);\n            return j;\n        }\n        var j = this.tok(\"true\", str, i);\n        if ((j >= 0)) {\n            res.push(true);\n            return j;\n        }\n        var j = this.tok(\"false\", str, i);\n        if ((j >= 0)) {\n            res.push(false);\n            return j;\n        }\n        if ((subj == null)) {\n            var j = this.uri_ref2(str, i, res);\n            if ((j >= 0)) {\n                return j;\n            }\n        }\n        return -1;\n    };\n    property_list(str, i, subj) {\n        /*\n        Parse property list\n        Leaves the terminating punctuation in the buffer\n        */\n\n        while (1) {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"EOF found when expected verb in property list\");\n                return j;\n            }\n            if ((str.slice( j,  ( j + 2 ) ) == \":-\")) {\n                var i =  ( j + 2 ) ;\n                var res = new pyjslib_List([]);\n                var j = this.node(str, i, res, subj);\n                if ((j < 0)) {\n                    throw BadSyntax(this._thisDoc, this.lines, str, i, \"bad {} or () or [] node after :- \");\n                }\n                var i = j;\n                continue;\n            }\n            var i = j;\n            var v = new pyjslib_List([]);\n            var j = this.verb(str, i, v);\n            if ((j <= 0)) {\n                return i;\n            }\n            var objs = new pyjslib_List([]);\n            var i = this.objectList(str, j, objs);\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"objectList expected\");\n            }\n\n            var __obj = new pyjslib_Iterator(objs);\n            try {\n                while (true) {\n                    var obj = __obj.next();\n\n\n                    var pairFudge = v[0];\n                    var dir = pairFudge[0];\n                    var sym = pairFudge[1];\n                    if ((dir == \"->\")) {\n                        this.makeStatement(new pyjslib_Tuple([this._context, sym, subj, obj]));\n                    }\n                    else {\n                        this.makeStatement(new pyjslib_Tuple([this._context, sym, obj, subj]));\n                    }\n\n                }\n            } catch (e) {\n                if (e != StopIteration) {\n                    throw e;\n                }\n            }\n\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"EOF found in list of objects\");\n                return j;\n            }\n            if ((str.slice( i,  ( i + 1 ) ) != \";\")) {\n                return i;\n            }\n            var i =  ( i + 1 ) ;\n        }\n    };\n    commaSeparatedList(str, j, res, ofUris) {\n        /*\n        return value: -1 bad syntax; >1 new position in str\n        res has things found appended\n\n        Used to use a final value of the function to be called, e.g. this.bareWord\n        but passing the function didn't work fo js converion pyjs\n        */\n\n        var i = this.skipSpace(str, j);\n        if ((i < 0)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, i, \"EOF found expecting comma sep list\");\n            return i;\n        }\n        if ((str.charAt(i) == \".\")) {\n            return j;\n        }\n        if (ofUris) {\n            var i = this.uri_ref2(str, i, res);\n        }\n        else {\n            var i = this.bareWord(str, i, res);\n        }\n        if ((i < 0)) {\n            return -1;\n        }\n        while (1) {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                return j;\n            }\n            var ch = str.slice( j,  ( j + 1 ) );\n            if ((ch != \",\")) {\n                if ((ch != \".\")) {\n                    return -1;\n                }\n                return j;\n            }\n            if (ofUris) {\n                var i = this.uri_ref2(str,  ( j + 1 ) , res);\n            }\n            else {\n                var i = this.bareWord(str,  ( j + 1 ) , res);\n            }\n            if ((i < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i, \"bad list content\");\n                return i;\n            }\n        }\n    };\n    objectList(str, i, res) {\n        var i = this.object(str, i, res);\n        if ((i < 0)) {\n            return -1;\n        }\n        while (1) {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, j, \"EOF found after object\");\n                return j;\n            }\n            if ((str.slice( j,  ( j + 1 ) ) != \",\")) {\n                return j;\n            }\n            var i = this.object(str,  ( j + 1 ) , res);\n            if ((i < 0)) {\n                return i;\n            }\n        }\n    };\n    checkDot(str, i) {\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return j;\n        }\n        if ((str.slice( j,  ( j + 1 ) ) == \".\")) {\n            return  ( j + 1 ) ;\n        }\n        if ((str.slice( j,  ( j + 1 ) ) == \"}\")) {\n            return j;\n        }\n        if ((str.slice( j,  ( j + 1 ) ) == \"]\")) {\n            return j;\n        }\n        throw BadSyntax(this._thisDoc, this.lines, str, j, \"expected '.' or '}' or ']' at end of statement\");\n        return i;\n    };\n    uri_ref2(str, i, res) {\n        /*\n        Generate uri from n3 representation.\n\n        Note that the RDF convention of directly concatenating\n        NS and local name is now used though I prefer inserting a '#'\n        to make the namesapces look more like what XML folks expect.\n        */\n\n        var qn = new pyjslib_List([]);\n        var j = this.qname(str, i, qn);\n        if ((j >= 0)) {\n            var pairFudge = qn[0];\n            var pfx = pairFudge[0];\n            var ln = pairFudge[1];\n            if ((pfx == null)) {\n                assertFudge(0, \"not used?\");\n                var ns =  ( this._baseURI + ADDED_HASH ) ;\n            }\n            else {\n                var ns = this._bindings[pfx];\n                if (!(ns)) {\n                    if ((pfx == \"_\")) {\n                        res.push(this.anonymousNode(ln));\n                        return j;\n                    }\n                    throw BadSyntax(this._thisDoc, this.lines, str, i,  (  ( \"Prefix \" + pfx )  + \" not bound.\" ) );\n                }\n            }\n            var symb = this._store.sym( ( ns + ln ) );\n            if ((ArrayIndexOf(this._variables, symb) >= 0)) {\n                res.push(this._variables[symb]);\n            }\n            else {\n                res.push(symb);\n            }\n            return j;\n        }\n        var i = this.skipSpace(str, i);\n        if ((i < 0)) {\n            return -1;\n        }\n        if ((str.charAt(i) == \"?\")) {\n            var v = new pyjslib_List([]);\n            var j = this.variable(str, i, v);\n            if ((j > 0)) {\n                res.push(v[0]);\n                return j;\n            }\n            return -1;\n        }\n        else if ((str.charAt(i) == \"<\")) {\n            var i =  ( i + 1 ) ;\n            var st = i;\n            while ((i < pyjslib_len(str))) {\n                if ((str.charAt(i) == \">\")) {\n                    var uref = str.slice( st, i);\n                    if (this._baseURI) {\n                        var uref = uripath_join(this._baseURI, uref);\n                    }\n                    else {\n                        assertFudge((uref.indexOf(\":\") >= 0), \"With no base URI, cannot deal with relative URIs\");\n                    }\n                    if ((str.slice(  ( i - 1 ) , i) == \"#\") && !((pyjslib_slice(uref, -1, null) == \"#\"))) {\n                        var uref =  ( uref + \"#\" ) ;\n                    }\n                    var symb = this._store.sym(uref);\n                    if ((ArrayIndexOf(this._variables,symb) >= 0)) {\n                        res.push(this._variables[symb]);\n                    }\n                    else {\n                        res.push(symb);\n                    }\n                    return  ( i + 1 ) ;\n                }\n                var i =  ( i + 1 ) ;\n            }\n            throw BadSyntax(this._thisDoc, this.lines, str, j, \"unterminated URI reference\");\n        }\n        else if (this.keywordsSet) {\n            var v = new pyjslib_List([]);\n            var j = this.bareWord(str, i, v);\n            if ((j < 0)) {\n                return -1;\n            }\n            if ((ArrayIndexOf(this.keywords, v[0]) >= 0)) {\n                throw BadSyntax(this._thisDoc, this.lines, str, i,  (  ( \"Keyword \\\"\" + v[0] )  + \"\\\" not allowed here.\" ) );\n            }\n            res.push(this._store.sym( ( this._bindings[\"\"] + v[0] ) ));\n            return j;\n        }\n        else {\n            return -1;\n        }\n    };\n    skipSpace(str, i) {\n        /*\n        Skip white space, newlines and comments.\n        return -1 if EOF, else position of first non-ws character*/\n\n        var whitespace = ' \\n\\r\\t\\f\\x0b\\xa0\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u200b\\u2028\\u2029\\u3000';\n        for (var j = (i ? i : 0); j < str.length; j++) {\n            var ch = str.charAt(j);\n            // console.log(\"    skipspace j= \"+j + \" i= \" + i + \" n= \" + str.length);\n            // console.log(\" skipspace ch <\" + ch + \">\");\n            if (whitespace.indexOf(ch) < 0 ) { //not ws\n                // console.log(\" skipspace 2 ch <\" + ch + \">\");\n                if( str.charAt(j)==='#' ) {\n                    for (;; j++) {\n                        // console.log(\"    skipspace2 j= \"+j + \" i= \" + i + \" n= \" + str.length);\n                        if (j === str.length) {\n                            return -1; // EOF\n                        }\n                        if (str.charAt(j) === '\\n') {\n                            this.lines = this.lines + 1;\n                            break;\n                        }\n                    };\n                } else { // Not hash - something interesting\n                    // console.log(\" skipspace 3 ch <\" + ch + \">\");\n                    return j\n                }\n            } else { // Whitespace\n                // console.log(\" skipspace 5 ch <\" + ch + \">\");\n                if (str.charAt(j) === '\\n') {\n                    this.lines = this.lines + 1;\n                }\n            }\n        } // next j\n        return -1; // EOF\n    };\n\n    variable(str, i, res) {\n        /*\n        ?abc -> variable(:abc)\n        */\n\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return -1;\n        }\n        if ((str.slice( j,  ( j + 1 ) ) != \"?\")) {\n            return -1;\n        }\n        var j =  ( j + 1 ) ;\n        var i = j;\n        if ((\"0123456789-\".indexOf(str.charAt(j)) >= 0)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, j,  (  ( \"Varible name can't start with '\" + str.charAt(j) )  + \"s'\" ) );\n            return -1;\n        }\n        while ((i < pyjslib_len(str)) && (_notNameChars.indexOf(str.charAt(i)) < 0)) {\n            var i =  ( i + 1 ) ;\n        }\n        if ((this._parentContext == null)) {\n            throw BadSyntax(this._thisDoc, this.lines, str, j,  ( \"Can't use ?xxx syntax for variable in outermost level: \" + str.slice(  ( j - 1 ) , i) ) );\n        }\n        res.push(this._store.variable(str.slice( j, i)));\n        return i;\n    };\n    bareWord(str, i, res) {\n        /*\n        abc -> :abc\n        */\n\n        var j = this.skipSpace(str, i);\n        if ((j < 0)) {\n            return -1;\n        }\n        var ch = str.charAt(j);\n        if ((\"0123456789-\".indexOf(ch) >= 0)) {\n            return -1;\n        }\n        if ((_notNameChars.indexOf(ch) >= 0)) {\n            return -1;\n        }\n        var i = j;\n        while ((i < pyjslib_len(str)) && (_notNameChars.indexOf(str.charAt(i)) < 0)) {\n            var i =  ( i + 1 ) ;\n        }\n        res.push(str.slice( j, i));\n        return i;\n    };\n    qname(str, i, res) {\n        /*\n\n        xyz:def -> ('xyz', 'def')\n        If not in keywords and keywordsSet: def -> ('', 'def')\n        :def -> ('', 'def')\n        */\n\n        var i = this.skipSpace(str, i);\n        if ((i < 0)) {\n            return -1;\n        }\n        var c = str.charAt(i);\n        if ((\"0123456789-+\".indexOf(c) >= 0)) {\n            return -1;\n        }\n        if ((_notNameChars.indexOf(c) < 0)) {\n            var ln = c;\n            var i =  ( i + 1 ) ;\n            while ((i < pyjslib_len(str))) {\n                var c = str.charAt(i);\n                if ((_notNameChars.indexOf(c) < 0)) {\n                    var ln =  ( ln + c ) ;\n                    var i =  ( i + 1 ) ;\n                }\n                else {\n                    break;\n                }\n            }\n        }\n        else {\n            var ln = \"\";\n        }\n        if ((i < pyjslib_len(str)) && (str.charAt(i) == \":\")) {\n            var pfx = ln;\n            var i =  ( i + 1 ) ;\n            var ln = \"\";\n            while ((i < pyjslib_len(str))) {\n                var c = str.charAt(i);\n                if ((_notNameChars.indexOf(c) < 0)) {\n                    var ln =  ( ln + c ) ;\n                    var i =  ( i + 1 ) ;\n                }\n                else {\n                    break;\n                }\n            }\n            res.push(new pyjslib_Tuple([pfx, ln]));\n            return i;\n        }\n        else {\n            if (ln && this.keywordsSet && (ArrayIndexOf(this.keywords, ln) < 0)) {\n                res.push(new pyjslib_Tuple([\"\", ln]));\n                return i;\n            }\n            return -1;\n        }\n    };\n    object(str, i, res) {\n        var j = this.subject(str, i, res);\n        if ((j >= 0)) {\n            return j;\n        }\n        else {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                return -1;\n            }\n            else {\n                var i = j;\n            }\n            var delim = null\n            let ch = str.charAt(i)\n            if ((ch == \"\\\"\" || ch == \"'\")) {\n                if (str.slice(i,  ( i + 3 ) == ch + ch)) {\n                    delim = ch + ch + ch;\n                }\n                else {\n                    delim = ch;\n                }\n                var i =  ( i + pyjslib_len(delim) ) ;\n                var pairFudge = this.strconst(str, i, delim);\n                var j = pairFudge[0];\n                var s = pairFudge[1];\n                res.push(this._store.literal(s));\n                diag_progress(\"New string const \", s, j);\n                return j;\n            }\n            else {\n                return -1;\n            }\n        }\n    };\n    nodeOrLiteral(str, i, res) {\n        var j = this.node(str, i, res);\n        if ((j >= 0)) {\n            return j;\n        }\n        else {\n            var j = this.skipSpace(str, i);\n            if ((j < 0)) {\n                return -1;\n            }\n            else {\n                var i = j;\n            }\n            var ch = str.charAt(i);\n            if ((\"-+0987654321\".indexOf(ch) >= 0)) {\n\n                datetime_syntax.lastIndex = 0;\n                var m = datetime_syntax.exec(str.slice(i));\n                if ((m != null)) {\n                    // j =  ( i + datetime_syntax.lastIndex ) ;\n                    var val = m[0];\n                    j = i + val.length;\n                    if ((val.indexOf(\"T\") >= 0)) {\n                        res.push(this._store.literal(val, this._store.sym(DATETIME_DATATYPE)));\n                    } else {\n                        res.push(this._store.literal(val, this._store.sym(DATE_DATATYPE)));\n                    }\n\n                } else {\n                    number_syntax.lastIndex = 0;\n                    var m = number_syntax.exec(str.slice(i));\n                    if ((m == null)) {\n                        throw BadSyntax(this._thisDoc, this.lines, str, i, \"Bad number or date syntax\");\n                    }\n                    j =  ( i + number_syntax.lastIndex ) ;\n                    var val = str.slice( i, j);\n                    if ((val.indexOf(\"e\") >= 0)) {\n                        res.push(this._store.literal(parseFloat(val), this._store.sym(FLOAT_DATATYPE)));\n                    }\n                    else if ((str.slice( i, j).indexOf(\".\") >= 0)) {\n                        res.push(this._store.literal(parseFloat(val), this._store.sym(DECIMAL_DATATYPE)));\n                    }\n                    else {\n                        res.push(this._store.literal(parseInt(val), this._store.sym(INTEGER_DATATYPE)));\n                    }\n                };\n                return j; // Where we have got up to\n            }\n            if ((str.charAt(i) == \"\\\"\")) {\n                if ((str.slice( i,  ( i + 3 ) ) == \"\\\"\\\"\\\"\")) {\n                    var delim = \"\\\"\\\"\\\"\";\n                }\n                else {\n                    var delim = \"\\\"\";\n                }\n                var i =  ( i + pyjslib_len(delim) ) ;\n                var dt = null;\n                var pairFudge = this.strconst(str, i, delim);\n                var j = pairFudge[0];\n                var s = pairFudge[1];\n                var lang = null;\n                if ((str.slice( j,  ( j + 1 ) ) == \"@\")) {\n                    langcode.lastIndex = 0;\n\n                    var m = langcode.exec(str.slice( ( j + 1 ) ));\n                    if ((m == null)) {\n                        throw BadSyntax(this._thisDoc, startline, str, i, \"Bad language code syntax on string literal, after @\");\n                    }\n                    var i =  (  ( langcode.lastIndex + j )  + 1 ) ;\n\n                    var lang = str.slice(  ( j + 1 ) , i);\n                    var j = i;\n                }\n                if ((str.slice( j,  ( j + 2 ) ) == \"^^\")) {\n                    var res2 = new pyjslib_List([]);\n                    var j = this.uri_ref2(str,  ( j + 2 ) , res2);\n                    var dt = res2[0];\n                }\n                res.push(this._store.literal(s, lang || dt));\n                return j;\n            }\n            else {\n                return -1;\n            }\n        }\n    };\n    strconst(str, i, delim) {\n        /*\n        parse an N3 string constant delimited by delim.\n        return index, val\n        */\n\n        var j = i;\n        var ustr = \"\";\n        var startline = this.lines;\n        while ((j < pyjslib_len(str))) {\n            var i =  ( j + pyjslib_len(delim) ) ;\n            if ((str.slice( j, i) == delim)) {\n                return new pyjslib_Tuple([i, ustr]);\n            }\n            if ((str.charAt(j) == \"\\\"\")) {\n                var ustr =  ( ustr + \"\\\"\" ) ;\n                var j =  ( j + 1 ) ;\n                continue;\n            }\n            interesting.lastIndex = 0;\n            var m = interesting.exec(str.slice(j));\n            if (!(m)) {\n                throw BadSyntax(this._thisDoc, startline, str, j,  (  (  ( \"Closing quote missing in string at ^ in \" + str.slice(  ( j - 20 ) , j) )  + \"^\" )  + str.slice( j,  ( j + 20 ) ) ) );\n            }\n            var i =  (  ( j + interesting.lastIndex )  - 1 ) ;\n            var ustr =  ( ustr + str.slice( j, i) ) ;\n            var ch = str.charAt(i);\n            if ((ch == \"\\\"\")) {\n                var j = i;\n                continue;\n            }\n            else if ((ch == \"\\r\")) {\n                var j =  ( i + 1 ) ;\n                continue;\n            }\n            else if ((ch == \"\\n\")) {\n                if ((delim == \"\\\"\")) {\n                    throw BadSyntax(this._thisDoc, startline, str, i, \"newline found in string literal\");\n                }\n                this.lines =  ( this.lines + 1 ) ;\n                var ustr =  ( ustr + ch ) ;\n                var j =  ( i + 1 ) ;\n                this.previousLine = this.startOfLine;\n                this.startOfLine = j;\n            }\n            else if ((ch == \"\\\\\")) {\n                var j =  ( i + 1 ) ;\n                var ch = str.slice( j,  ( j + 1 ) );\n                if (!(ch)) {\n                    throw BadSyntax(this._thisDoc, startline, str, i, \"unterminated string literal (2)\");\n                }\n                var k = string_find(\"abfrtvn\\\\\\\"\", ch);\n                if ((k >= 0)) {\n                    var uch = \"\\a\\b\\f\\r\\t\\v\\n\\\\\\\"\".charAt(k);\n                    var ustr =  ( ustr + uch ) ;\n                    var j =  ( j + 1 ) ;\n                }\n                else if ((ch == \"u\")) {\n                    var pairFudge = this.uEscape(str,  ( j + 1 ) , startline);\n                    var j = pairFudge[0];\n                    var ch = pairFudge[1];\n                    var ustr =  ( ustr + ch ) ;\n                }\n                else if ((ch == \"U\")) {\n                    var pairFudge = this.UEscape(str,  ( j + 1 ) , startline);\n                    var j = pairFudge[0];\n                    var ch = pairFudge[1];\n                    var ustr =  ( ustr + ch ) ;\n                }\n                else {\n                    throw BadSyntax(this._thisDoc, this.lines, str, i, \"bad escape\");\n                }\n            }\n        }\n        throw BadSyntax(this._thisDoc, this.lines, str, i, \"unterminated string literal\");\n    };\n    uEscape(str, i, startline) {\n        var j = i;\n        var count = 0;\n        var value = 0;\n        while ((count < 4)) {\n            var chFudge = str.slice( j,  ( j + 1 ) );\n            var ch = chFudge.toLowerCase();\n            var j =  ( j + 1 ) ;\n            if ((ch == \"\")) {\n                throw BadSyntax(this._thisDoc, startline, str, i, \"unterminated string literal(3)\");\n            }\n            var k = string_find(\"0123456789abcdef\", ch);\n            if ((k < 0)) {\n                throw BadSyntax(this._thisDoc, startline, str, i, \"bad string literal hex escape\");\n            }\n            var value =  (  ( value * 16 )  + k ) ;\n            var count =  ( count + 1 ) ;\n        }\n        var uch = String.fromCharCode(value);\n        return new pyjslib_Tuple([j, uch]);\n    };\n    UEscape(str, i, startline) {\n        var j = i;\n        var count = 0;\n        var value = \"\\\\U\";\n        while ((count < 8)) {\n            var chFudge = str.slice( j,  ( j + 1 ) );\n            var ch = chFudge.toLowerCase();\n            var j =  ( j + 1 ) ;\n            if ((ch == \"\")) {\n                throw BadSyntax(this._thisDoc, startline, str, i, \"unterminated string literal(3)\");\n            }\n            var k = string_find(\"0123456789abcdef\", ch);\n            if ((k < 0)) {\n                throw BadSyntax(this._thisDoc, startline, str, i, \"bad string literal hex escape\");\n            }\n            var value =  ( value + ch ) ;\n            var count =  ( count + 1 ) ;\n        }\n        var uch = stringFromCharCode( (  ( \"0x\" + pyjslib_slice(value, 2, 10) )  - 0 ) );\n        return new pyjslib_Tuple([j, uch]);\n    };\n}\n\nfunction OLD_BadSyntax(uri, lines, str, i, why) {\n    return new __OLD_BadSyntax(uri, lines, str, i, why);\n}\nfunction __OLD_BadSyntax(uri, lines, str, i, why) {\n    this._str = str.encode(\"utf-8\");\n    this._str = str;\n    this._i = i;\n    this._why = why;\n    this.lines = lines;\n    this._uri = uri;\n}\n__OLD_BadSyntax.prototype.toString = function() {\n    var str = this._str;\n    var i = this._i;\n    var st = 0;\n    if ((i > 60)) {\n        var pre = \"...\";\n        var st =  ( i - 60 ) ;\n    }\n    else {\n        var pre = \"\";\n    }\n    if (( ( pyjslib_len(str) - i )  > 60)) {\n        var post = \"...\";\n    }\n    else {\n        var post = \"\";\n    }\n    return \"Line %i of <%s>: Bad syntax (%s) at ^ in:\\n\\\"%s%s^%s%s\\\"\" % new pyjslib_Tuple([ ( this.lines + 1 ) , this._uri, this._why, pre, str.slice( st, i), str.slice( i,  ( i + 60 ) ), post]);\n}\n\nfunction BadSyntax(uri, lines, str, i, why) {\n    let lineNo = lines + 1\n    let msg =  (  (  (  (  (  (  (  ( \"Line \" +  ( lineNo )  )  + \" of <\" )  + uri )  + \">: Bad syntax: \" )  + why )  + \"\\nat: \\\"\" )  + str.slice( i,  ( i + 30 ) ) )  + \"\\\"\" ) ;\n    let e = new SyntaxError(msg, uri , lineNo)\n    e.lineNo = lineNo\n    e.characterInFile = i\n    e.syntaxProblem = why\n    return e\n}\n\nfunction stripCR(str) {\n    var res = \"\";\n\n    var __ch = new pyjslib_Iterator(str);\n    try {\n        while (true) {\n            var ch = __ch.next();\n\n\n            if ((ch != \"\\r\")) {\n                var res =  ( res + ch ) ;\n            }\n\n        }\n    } catch (e) {\n        if (e != StopIteration) {\n            throw e;\n        }\n    }\n\n    return res;\n}\n\n\nfunction dummyWrite(x) {\n}\n\n","//  RDFa Parser for rdflib.js\n\n// Originally by: Alex Milowski\n// From https://github.com/alexmilowski/green-turtle\n// Converted: timbl 2015-08-25 not yet working\n// Added wrapper: csarven 2016-05-09 working\n\n// RDFaProcessor.prototype = new Object() // Was URIResolver\n\n// RDFaProcessor.prototype.constructor=RDFaProcessor\n\n// options.base = base URI    not really an option, shopuld always be set.\n//\n\nimport BlankNode from './blank-node'\nimport Literal from './literal'\nimport NamedNode from './named-node'\nimport * as Uri from './uri'\nimport * as Util from './utils-js'\nimport rdf from './factories/canonical-data-factory'\n\nif (typeof Node === 'undefined') { //  @@@@@@ Global. Interface to xmldom.\n  var Node = {\n    ELEMENT_NODE: 1,\n    ATTRIBUTE_NODE: 2,\n    TEXT_NODE: 3,\n    CDATA_SECTION_NODE: 4,\n    ENTITY_REFERENCE_NODE: 5,\n    ENTITY_NODE: 6,\n    PROCESSING_INSTRUCTION_NODE: 7,\n    COMMENT_NODE: 8,\n    DOCUMENT_NODE: 9,\n    DOCUMENT_TYPE_NODE: 10,\n    DOCUMENT_FRAGMENT_NODE: 11,\n    NOTATION_NODE: 12\n  }\n}\n\nexport default class RDFaProcessor {\n  constructor (kb, options) {\n    this.options = options || {}\n    this.kb = kb\n    this.target = options.target || {\n      graph: {\n        subjects: {},\n        prefixes: {},\n        terms: {}\n      }\n    }\n    // XXX: Added to track bnodes\n    this.blankNodes = []\n    // XXX: Added for normalisation\n    this.htmlOptions = {\n      'selfClosing': 'br img input area base basefont col colgroup source wbr isindex link meta param hr'\n    }\n    this.theOne = '_:' + (new Date()).getTime()\n    this.language = null\n    this.vocabulary = null\n    this.blankCounter = 0\n    this.langAttributes = [ { namespaceURI: 'http://www.w3.org/XML/1998/namespace', localName: 'lang' } ]\n    this.inXHTMLMode = false\n    this.absURIRE = /[\\w\\_\\-]+:\\S+/\n    this.finishedHandlers = []\n    this.init()\n  }\n\n  addTriple (origin, subject, predicate, object) {\n    var su, ob, pr, or\n    if (typeof subject === 'undefined') {\n      su = rdf.namedNode(this.options.base)\n    } else {\n      su = this.toRDFNodeObject(subject)\n    }\n    pr = this.toRDFNodeObject(predicate)\n    ob = this.toRDFNodeObject(object)\n    or = rdf.namedNode(this.options.base)\n    // console.log('Adding { ' + su + ' ' + pr + ' ' + ob + ' ' + or + ' }')\n    this.kb.add(su, pr, ob, or)\n  }\n\n  ancestorPath (node) {\n    var path = ''\n    while (node && node.nodeType !== Node.DOCUMENT_NODE) {\n      path = '/' + node.localName + path\n      node = node.parentNode\n    }\n    return path\n  }\n\n  copyMappings (mappings) {\n    var newMappings = {}\n    for (var k in mappings) {\n      newMappings[k] = mappings[k]\n    }\n    return newMappings\n  }\n\n  copyProperties () {\n  }\n\n  deriveDateTimeType (value) {\n    for (var i = 0; i < RDFaProcessor.dateTimeTypes.length; i++) {\n      // console.log(\"Checking \"+value+\" against \"+RDFaProcessor.dateTimeTypes[i].type)\n      var matched = RDFaProcessor.dateTimeTypes[i].pattern.exec(value)\n      if (matched && matched[0].length === value.length) {\n        // console.log(\"Matched!\")\n        return RDFaProcessor.dateTimeTypes[i].type\n      }\n    }\n    return null\n  }\n\n  init () {\n  }\n\n  newBlankNode () {\n    this.blankCounter++\n    return '_:' + this.blankCounter\n  }\n\n  newSubjectOrigin (origin, subject) {\n  }\n\n  parseCURIE (value, prefixes, base) {\n    var colon = value.indexOf(':')\n    var uri\n    if (colon >= 0) {\n      var prefix = value.substring(0, colon)\n      if (prefix === '') {\n        // default prefix\n        uri = prefixes['']\n        return uri ? uri + value.substring(colon + 1) : null\n      } else if (prefix === '_') {\n        // blank node\n        return '_:' + value.substring(colon + 1)\n      } else if (RDFaProcessor.NCNAME.test(prefix)) {\n        uri = prefixes[prefix]\n        if (uri) {\n          return uri + value.substring(colon + 1)\n        }\n      }\n    }\n    return null\n  }\n\n  parseCURIEOrURI (value, prefixes, base) {\n    var curie = this.parseCURIE(value, prefixes, base)\n    if (curie) {\n      return curie\n    }\n    return this.resolveAndNormalize(base, value)\n  }\n\n  parsePredicate (value, defaultVocabulary, terms, prefixes, base,\n                  ignoreTerms) {\n    if (value === '') {\n      return null\n    }\n    var predicate = this.parseTermOrCURIEOrAbsURI(value, defaultVocabulary, ignoreTerms ? null : terms, prefixes, base)\n    if (predicate && predicate.indexOf('_:') === 0) {\n      return null\n    }\n    return predicate\n  }\n\n  parsePrefixMappings (str, target) {\n    var values = this.tokenize(str)\n    var prefix = null\n    // var uri = null\n    for (var i = 0; i < values.length; i++) {\n      if (values[i][values[i].length - 1] === ':') {\n        prefix = values[i].substring(0, values[i].length - 1)\n      } else if (prefix) {\n        target[prefix] = this.options.base ? Uri.join(values[i], this.options.base) : values[i]\n        prefix = null\n      }\n    }\n  }\n\n  static parseRDFaDOM (dom, kb, base) {\n    var p = new RDFaProcessor(kb, { 'base': base })\n    //  Cannot assign to read only property 'baseURI' of object '#<XMLDocument>':\n    if (!dom.baseURI) { // Note this became a read-only attribute some time before 2018\n      dom.baseURI = base // oinly set if not already set\n    }\n    p.process(dom, { baseURI: base})\n  }\n\n  parseSafeCURIEOrCURIEOrURI (value, prefixes, base) {\n    value = this.trim(value)\n    if (value.charAt(0) === '[' && value.charAt(value.length - 1) === ']') {\n      value = value.substring(1, value.length - 1)\n      value = value.trim(value)\n      if (value.length === 0) {\n        return null\n      }\n      if (value === '_:') {\n        // the one node\n        return this.theOne\n      }\n      return this.parseCURIE(value, prefixes, base)\n    } else {\n      return this.parseCURIEOrURI(value, prefixes, base)\n    }\n  }\n\n  parseTermOrCURIEOrAbsURI (value, defaultVocabulary, terms, prefixes, base) {\n    // alert(\"Parsing \"+value+\" with default vocab \"+defaultVocabulary)\n    value = this.trim(value)\n    var curie = this.parseCURIE(value, prefixes, base)\n    if (curie) {\n      return curie\n    } else if (terms) {\n      if (defaultVocabulary && !this.absURIRE.exec(value)) {\n        return defaultVocabulary + value\n      }\n      var term = terms[value]\n      if (term) {\n        return term\n      }\n      var lcvalue = value.toLowerCase()\n      term = terms[lcvalue]\n      if (term) {\n        return term\n      }\n    }\n    if (this.absURIRE.exec(value)) {\n      return this.resolveAndNormalize(base, value)\n    }\n    return null\n  }\n\n  parseTermOrCURIEOrURI (value, defaultVocabulary, terms, prefixes, base) {\n    // alert(\"Parsing \"+value+\" with default vocab \"+defaultVocabulary)\n    value = this.trim(value)\n    var curie = this.parseCURIE(value, prefixes, base)\n    if (curie) {\n      return curie\n    } else {\n      var term = terms[value]\n      if (term) {\n        return term\n      }\n      var lcvalue = value.toLowerCase()\n      term = terms[lcvalue]\n      if (term) {\n        return term\n      }\n      if (defaultVocabulary && !this.absURIRE.exec(value)) {\n        return defaultVocabulary + value\n      }\n    }\n    return this.resolveAndNormalize(base, value)\n  }\n\n  parseURI (uri) {\n    return uri // We just use strings as URIs, not objects now.\n  }\n\n  process (node, options) {\n    /*\n    if (!window.console) {\n       window.console = { log: function() {} }\n    } */\n    options = options || {}\n    var base\n    if (node.nodeType === Node.DOCUMENT_NODE) {\n      if (node.baseURI && !options.baseURI) {\n        options.baseURI = node.baseURI  // be defensive as DOM implementations vary\n      }\n      base = node.baseURI\n      node = node.documentElement\n      if (!node.baseURI) {\n        node.baseURI = base\n      }\n      this.setContext(node)\n    } else if (node.parentNode.nodeType === Node.DOCUMENT_NODE) {\n      this.setContext(node)\n    }\n    var queue = []\n    // Fix for Firefox that includes the hash in the base URI\n    var removeHash = function (baseURI) {\n      // Fix for undefined baseURI property\n      if (!baseURI && options && options.baseURI) {\n        return options.baseURI\n      }\n\n      var hash = baseURI.indexOf('#')\n      if (hash >= 0) {\n        baseURI = baseURI.substring(0, hash)\n      }\n      if (options && options.baseURIMap) {\n        baseURI = options.baseURIMap(baseURI)\n      }\n      return baseURI\n    }\n    queue.push({ current: node,\n      context: this.push(null, removeHash(node.baseURI))\n    })\n    while (queue.length > 0) {\n      var item = queue.shift()\n      if (item.parent) {\n        // Sequence Step 14: list triple generation\n        if (item.context.parent && item.context.parent.listMapping === item.listMapping) {\n          // Skip a child context with exactly the same mapping\n          continue\n        }\n        // console.log(\"Generating lists for \"+item.subject+\", tag \"+item.parent.localName)\n        for (let predicate in item.listMapping) {\n          var list = item.listMapping[predicate]\n          if (list.length === 0) {\n            this.addTriple(item.parent, item.subject, predicate, { type: RDFaProcessor.objectURI, value: 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil' })\n            continue\n          }\n          var bnodes = []\n          for (let i = 0; i < list.length; i++) {\n            bnodes.push(this.newBlankNode())\n          // this.newSubject(item.parent,bnodes[i])\n          }\n          for (let i = 0; i < bnodes.length; i++) {\n            this.addTriple(item.parent, bnodes[i], 'http://www.w3.org/1999/02/22-rdf-syntax-ns#first', list[i])\n            this.addTriple(item.parent, bnodes[i], 'http://www.w3.org/1999/02/22-rdf-syntax-ns#rest', { type: RDFaProcessor.objectURI, value: (i + 1) < bnodes.length ? bnodes[i + 1] : 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil' })\n          }\n          this.addTriple(item.parent, item.subject, predicate, { type: RDFaProcessor.objectURI, value: bnodes[0] })\n        }\n        continue\n      }\n      var current = item.current\n      var context = item.context\n      // console.log(\"Tag: \"+current.localName+\", listMapping=\"+JSON.stringify(context.listMapping))\n      // Sequence Step 1\n      var skip = false\n      var newSubject = null\n      var currentObjectResource = null\n      var typedResource = null\n      var prefixes = context.prefixes\n      var prefixesCopied = false\n      var incomplete = []\n      var listMapping = context.listMapping\n      var listMappingDifferent = !context.parent\n      var language = context.language\n      var vocabulary = context.vocabulary\n      // TODO: the \"base\" element may be used for HTML+RDFa 1.1\n      base = this.parseURI(removeHash(current.baseURI))\n      current.item = null\n      // Sequence Step 2: set the default vocabulary\n      var vocabAtt = current.getAttributeNode('vocab')\n      if (vocabAtt) {\n        let value = this.trim(vocabAtt.value)\n        if (value.length > 0) {\n          vocabulary = value\n          var baseSubject = base.spec\n          // this.newSubject(current,baseSubject)\n          this.addTriple(current, baseSubject, 'http://www.w3.org/ns/rdfa#usesVocabulary', { type: RDFaProcessor.objectURI, value: vocabulary })\n        } else {\n          vocabulary = this.vocabulary\n        }\n      }\n      // Sequence Step 3: IRI mappings\n      // handle xmlns attributes\n      for (var i = 0; i < current.attributes.length; i++) {\n        var att = current.attributes[i]\n        // if (att.namespaceURI==\"http://www.w3.org/2000/xmlns/\") {\n        if (att.nodeName.charAt(0) === 'x' && att.nodeName.indexOf('xmlns:') === 0) {\n          if (!prefixesCopied) {\n            prefixes = this.copyMappings(prefixes)\n            prefixesCopied = true\n          }\n          var prefix = att.nodeName.substring(6)\n          // TODO: resolve relative?\n          var ref = RDFaProcessor.trim(att.value)\n          prefixes[prefix] = this.options.base ? Uri.join(ref, this.options.base) : ref\n        }\n      }\n      // Handle prefix mappings (@prefix)\n      var prefixAtt = current.getAttributeNode('prefix')\n      if (prefixAtt) {\n        if (!prefixesCopied) {\n          prefixes = this.copyMappings(prefixes)\n          prefixesCopied = true\n        }\n        this.parsePrefixMappings(prefixAtt.value, prefixes)\n      }\n      // Sequence Step 4: language\n      var xmlLangAtt = null\n      for (let i = 0; !xmlLangAtt && i < this.langAttributes.length; i++) {\n        xmlLangAtt = current.getAttributeNodeNS(this.langAttributes[i].namespaceURI, this.langAttributes[i].localName)\n      }\n      if (xmlLangAtt) {\n        let value = RDFaProcessor.trim(xmlLangAtt.value)\n        if (value.length > 0) {\n          language = value\n        } else {\n          language = null\n        }\n      }\n      var relAtt = current.getAttributeNode('rel')\n      var revAtt = current.getAttributeNode('rev')\n      var typeofAtt = current.getAttributeNode('typeof')\n      var propertyAtt = current.getAttributeNode('property')\n      var datatypeAtt = current.getAttributeNode('datatype')\n      var datetimeAtt = this.inHTMLMode\n        ? current.getAttributeNode('datetime')\n        : null\n      var contentAtt = current.getAttributeNode('content')\n      var aboutAtt = current.getAttributeNode('about')\n      var srcAtt = current.getAttributeNode('src')\n      var resourceAtt = current.getAttributeNode('resource')\n      var hrefAtt = current.getAttributeNode('href')\n      var inlistAtt = current.getAttributeNode('inlist')\n      var relAttPredicates = []\n      var predicate, values\n      if (relAtt) {\n        values = this.tokenize(relAtt.value)\n        for (let i = 0; i < values.length; i++) {\n          predicate = this.parsePredicate(values[i], vocabulary, context.terms, prefixes, base, this.inHTMLMode && propertyAtt !== null)\n          if (predicate) {\n            relAttPredicates.push(predicate)\n          }\n        }\n      }\n      var revAttPredicates = []\n      if (revAtt) {\n        values = this.tokenize(revAtt.value)\n        for (let i = 0; i < values.length; i++) {\n          predicate = this.parsePredicate(values[i], vocabulary, context.terms, prefixes, base, this.inHTMLMode && propertyAtt)\n          if (predicate) {\n            revAttPredicates.push(predicate)\n          }\n        }\n      }\n      // Section 3.1, bullet 7\n      if (this.inHTMLMode && (relAtt || revAtt) && propertyAtt) {\n        if (relAttPredicates.length === 0) {\n          relAtt = null\n        }\n        if (revAttPredicates.length === 0) {\n          revAtt = null\n        }\n      }\n      if (relAtt || revAtt) {\n        // Sequence Step 6: establish new subject and value\n        if (aboutAtt) {\n          newSubject = this.parseSafeCURIEOrCURIEOrURI(aboutAtt.value, prefixes, base)\n        }\n        if (typeofAtt) {\n          typedResource = newSubject\n        }\n        if (!newSubject) {\n          if (current.parentNode.nodeType === Node.DOCUMENT_NODE) {\n            newSubject = removeHash(current.baseURI)\n          } else if (context.parentObject) {\n            // TODO: Verify: If the xml:base has been set and the parentObject is the baseURI of the parent, then the subject needs to be the new base URI\n            newSubject = removeHash(current.parentNode.baseURI) === context.parentObject ? removeHash(current.baseURI) : context.parentObject\n          }\n        }\n        if (resourceAtt) {\n          currentObjectResource = this.parseSafeCURIEOrCURIEOrURI(resourceAtt.value, prefixes, base)\n        }\n        if (!currentObjectResource) {\n          if (hrefAtt) {\n            currentObjectResource = this.resolveAndNormalize(base, encodeURI(hrefAtt.value))\n          } else if (srcAtt) {\n            currentObjectResource = this.resolveAndNormalize(base, encodeURI(srcAtt.value))\n          } else if (typeofAtt && !aboutAtt && !(this.inXHTMLMode && (current.localName === 'head' || current.localName === 'body'))) {\n            currentObjectResource = this.newBlankNode()\n          }\n        }\n        if (typeofAtt && !aboutAtt && this.inXHTMLMode && (current.localName === 'head' || current.localName === 'body')) {\n          typedResource = newSubject\n        } else if (typeofAtt && !aboutAtt) {\n          typedResource = currentObjectResource\n        }\n      } else if (propertyAtt && !contentAtt && !datatypeAtt) {\n        // Sequence Step 5.1: establish a new subject\n        if (aboutAtt) {\n          newSubject = this.parseSafeCURIEOrCURIEOrURI(aboutAtt.value, prefixes, base)\n          if (typeofAtt) {\n            typedResource = newSubject\n          }\n        }\n        if (!newSubject && current.parentNode.nodeType === Node.DOCUMENT_NODE) {\n          newSubject = removeHash(current.baseURI)\n          if (typeofAtt) {\n            typedResource = newSubject\n          }\n        } else if (!newSubject && context.parentObject) {\n          // TODO: Verify: If the xml:base has been set and the parentObject is the baseURI of the parent, then the subject needs to be the new base URI\n          newSubject = removeHash(current.parentNode.baseURI) === context.parentObject ? removeHash(current.baseURI) : context.parentObject\n        }\n        if (typeofAtt && !typedResource) {\n          if (resourceAtt) {\n            typedResource = this.parseSafeCURIEOrCURIEOrURI(resourceAtt.value, prefixes, base)\n          }\n          if (!typedResource && hrefAtt) {\n            typedResource = this.resolveAndNormalize(base, encodeURI(hrefAtt.value))\n          }\n          if (!typedResource && srcAtt) {\n            typedResource = this.resolveAndNormalize(base, encodeURI(srcAtt.value))\n          }\n          if (!typedResource && (this.inXHTMLMode || this.inHTMLMode) && (current.localName === 'head' || current.localName === 'body')) {\n            typedResource = newSubject\n          }\n          if (!typedResource) {\n            typedResource = this.newBlankNode()\n          }\n          currentObjectResource = typedResource\n        }\n      // console.log(current.localName+\", newSubject=\"+newSubject+\", typedResource=\"+typedResource+\", currentObjectResource=\"+currentObjectResource)\n      } else {\n        // Sequence Step 5.2: establish a new subject\n        if (aboutAtt) {\n          newSubject = this.parseSafeCURIEOrCURIEOrURI(aboutAtt.value, prefixes, base)\n        }\n        if (!newSubject && resourceAtt) {\n          newSubject = this.parseSafeCURIEOrCURIEOrURI(resourceAtt.value, prefixes, base)\n        }\n        if (!newSubject && hrefAtt) {\n          newSubject = this.resolveAndNormalize(base, encodeURI(hrefAtt.value))\n        }\n        if (!newSubject && srcAtt) {\n          newSubject = this.resolveAndNormalize(base, encodeURI(srcAtt.value))\n        }\n        if (!newSubject) {\n          if (current.parentNode.nodeType === Node.DOCUMENT_NODE) {\n            newSubject = removeHash(current.baseURI)\n          } else if ((this.inXHTMLMode || this.inHTMLMode) && (current.localName === 'head' || current.localName === 'body')) {\n            newSubject = removeHash(current.parentNode.baseURI) === context.parentObject ? removeHash(current.baseURI) : context.parentObject\n          } else if (typeofAtt) {\n            newSubject = this.newBlankNode()\n          } else if (context.parentObject) {\n            // TODO: Verify: If the xml:base has been set and the parentObject is the baseURI of the parent, then the subject needs to be the new base URI\n            newSubject = removeHash(current.parentNode.baseURI) === context.parentObject ? removeHash(current.baseURI) : context.parentObject\n            if (!propertyAtt) {\n              skip = true\n            }\n          }\n        }\n        if (typeofAtt) {\n          typedResource = newSubject\n        }\n      }\n      // console.log(current.tagName+\": newSubject=\"+newSubject+\", currentObjectResource=\"+currentObjectResource+\", typedResource=\"+typedResource+\", skip=\"+skip)\n      // var rdfaData = null\n      if (newSubject) {\n        // this.newSubject(current,newSubject)\n        if (aboutAtt || resourceAtt || typedResource) {\n          var id = newSubject\n          if (typeofAtt && !aboutAtt && !resourceAtt && currentObjectResource) {\n            id = currentObjectResource\n          }\n          // console.log(\"Setting data attribute for \"+current.localName+\" for subject \"+id)\n          this.newSubjectOrigin(current, id)\n        }\n      }\n      // Sequence Step 7: generate type triple\n      if (typedResource) {\n        values = this.tokenize(typeofAtt.value)\n        for (let i = 0; i < values.length; i++) {\n          var object = this.parseTermOrCURIEOrAbsURI(values[i], vocabulary, context.terms, prefixes, base)\n          if (object) {\n            this.addTriple(current, typedResource, RDFaProcessor.typeURI, { type: RDFaProcessor.objectURI, value: object })\n          }\n        }\n      }\n      // Sequence Step 8: new list mappings if there is a new subject\n      // console.log(\"Step 8: newSubject=\"+newSubject+\", context.parentObject=\"+context.parentObject)\n      if (newSubject && newSubject !== context.parentObject) {\n        // console.log(\"Generating new list mapping for \"+newSubject)\n        listMapping = {}\n        listMappingDifferent = true\n      }\n      // Sequence Step 9: generate object triple\n      if (currentObjectResource) {\n        if (relAtt && inlistAtt) {\n          for (let i = 0; i < relAttPredicates.length; i++) {\n            let list = listMapping[relAttPredicates[i]]\n            if (!list) {\n              list = []\n              listMapping[relAttPredicates[i]] = list\n            }\n            list.push({ type: RDFaProcessor.objectURI, value: currentObjectResource })\n          }\n        } else if (relAtt) {\n          for (let i = 0; i < relAttPredicates.length; i++) {\n            this.addTriple(current, newSubject, relAttPredicates[i], { type: RDFaProcessor.objectURI, value: currentObjectResource })\n          }\n        }\n        if (revAtt) {\n          for (let i = 0; i < revAttPredicates.length; i++) {\n            this.addTriple(current, currentObjectResource, revAttPredicates[i], { type: RDFaProcessor.objectURI, value: newSubject })\n          }\n        }\n      } else {\n        // Sequence Step 10: incomplete triples\n        if (newSubject && !currentObjectResource && (relAtt || revAtt)) {\n          currentObjectResource = this.newBlankNode()\n        // alert(current.tagName+\": generated blank node, newSubject=\"+newSubject+\" currentObjectResource=\"+currentObjectResource)\n        }\n        if (relAtt && inlistAtt) {\n          for (let i = 0; i < relAttPredicates.length; i++) {\n            let list = listMapping[relAttPredicates[i]]\n            if (!list) {\n              list = []\n              listMapping[predicate] = list\n            }\n            // console.log(\"Adding incomplete list for \"+predicate)\n            incomplete.push({ predicate: relAttPredicates[i], list: list })\n          }\n        } else if (relAtt) {\n          for (let i = 0; i < relAttPredicates.length; i++) {\n            incomplete.push({ predicate: relAttPredicates[i], forward: true })\n          }\n        }\n        if (revAtt) {\n          for (let i = 0; i < revAttPredicates.length; i++) {\n            incomplete.push({ predicate: revAttPredicates[i], forward: false })\n          }\n        }\n      }\n      // Step 11: Current property values\n      if (propertyAtt) {\n        var datatype = null\n        var content = null\n        if (datatypeAtt) {\n          datatype = datatypeAtt.value === '' ? RDFaProcessor.PlainLiteralURI : this.parseTermOrCURIEOrAbsURI(datatypeAtt.value, vocabulary, context.terms, prefixes, base)\n          if (datetimeAtt && !contentAtt) {\n            content = datetimeAtt.value\n          } else {\n            content = datatype === RDFaProcessor.XMLLiteralURI || datatype === RDFaProcessor.HTMLLiteralURI ? null : (contentAtt ? contentAtt.value : current.textContent)\n          }\n        } else if (contentAtt) {\n          datatype = RDFaProcessor.PlainLiteralURI\n          content = contentAtt.value\n        } else if (datetimeAtt) {\n          content = datetimeAtt.value\n          datatype = RDFaProcessor.deriveDateTimeType(content)\n          if (!datatype) {\n            datatype = RDFaProcessor.PlainLiteralURI\n          }\n        } else if (!relAtt && !revAtt) {\n          if (resourceAtt) {\n            content = this.parseSafeCURIEOrCURIEOrURI(resourceAtt.value, prefixes, base)\n          }\n          if (!content && hrefAtt) {\n            content = this.resolveAndNormalize(base, encodeURI(hrefAtt.value))\n          } else if (!content && srcAtt) {\n            content = this.resolveAndNormalize(base, encodeURI(srcAtt.value))\n          }\n          if (content) {\n            datatype = RDFaProcessor.objectURI\n          }\n        }\n        if (!datatype) {\n          if (typeofAtt && !aboutAtt) {\n            datatype = RDFaProcessor.objectURI\n            content = typedResource\n          } else {\n            content = current.textContent\n            if (this.inHTMLMode && current.localName === 'time') {\n              datatype = RDFaProcessor.deriveDateTimeType(content)\n            }\n            if (!datatype) {\n              datatype = RDFaProcessor.PlainLiteralURI\n            }\n          }\n        }\n        values = this.tokenize(propertyAtt.value)\n        for (let i = 0; i < values.length; i++) {\n          let predicate = this.parsePredicate(values[i], vocabulary, context.terms, prefixes, base)\n          if (predicate) {\n            if (inlistAtt) {\n              let list = listMapping[predicate]\n              if (!list) {\n                list = []\n                listMapping[predicate] = list\n              }\n              list.push((datatype === RDFaProcessor.XMLLiteralURI || datatype === RDFaProcessor.HTMLLiteralURI) ? { type: datatype, value: current.childNodes } : { type: datatype || RDFaProcessor.PlainLiteralURI, value: content, language: language })\n            } else {\n              if (datatype === RDFaProcessor.XMLLiteralURI || datatype === RDFaProcessor.HTMLLiteralURI) {\n                this.addTriple(current, newSubject, predicate, { type: datatype, value: current.childNodes })\n              } else {\n                this.addTriple(current, newSubject, predicate, { type: datatype || RDFaProcessor.PlainLiteralURI, value: content, language: language })\n              // console.log(newSubject+\" \"+predicate+\"=\"+content)\n              }\n            }\n          }\n        }\n      }\n      // Sequence Step 12: complete incomplete triples with new subject\n      if (newSubject && !skip) {\n        for (let i = 0; i < context.incomplete.length; i++) {\n          if (context.incomplete[i].list) {\n            // console.log(\"Adding subject \"+newSubject+\" to list for \"+context.incomplete[i].predicate)\n            // TODO: it is unclear what to do here\n            context.incomplete[i].list.push({ type: RDFaProcessor.objectURI, value: newSubject })\n          } else if (context.incomplete[i].forward) {\n            // console.log(current.tagName+\": completing forward triple \"+context.incomplete[i].predicate+\" with object=\"+newSubject)\n            this.addTriple(current, context.subject, context.incomplete[i].predicate, { type: RDFaProcessor.objectURI, value: newSubject })\n          } else {\n            // console.log(current.tagName+\": completing reverse triple with object=\"+context.subject)\n            this.addTriple(current, newSubject, context.incomplete[i].predicate, { type: RDFaProcessor.objectURI, value: context.subject })\n          }\n        }\n      }\n      var childContext = null\n      var listSubject = newSubject\n      if (skip) {\n        // TODO: should subject be null?\n        childContext = this.push(context, context.subject)\n        // TODO: should the entObject be passed along?  If not, then intermediary children will keep properties from being associated with incomplete triples.\n        // TODO: Verify: if the current baseURI has changed and the parentObject is the parent's base URI, then the baseURI should change\n        childContext.parentObject = removeHash(current.parentNode.baseURI) === context.parentObject ? removeHash(current.baseURI) : context.parentObject\n        childContext.incomplete = context.incomplete\n        childContext.language = language\n        childContext.prefixes = prefixes\n        childContext.vocabulary = vocabulary\n      } else {\n        childContext = this.push(context, newSubject)\n        childContext.parentObject = currentObjectResource || (newSubject || context.subject)\n        childContext.prefixes = prefixes\n        childContext.incomplete = incomplete\n        if (currentObjectResource) {\n          // console.log(\"Generating new list mapping for \"+currentObjectResource)\n          listSubject = currentObjectResource\n          listMapping = {}\n          listMappingDifferent = true\n        }\n        childContext.listMapping = listMapping\n        childContext.language = language\n        childContext.vocabulary = vocabulary\n      }\n      if (listMappingDifferent) {\n        // console.log(\"Pushing list parent \"+current.localName)\n        queue.unshift({ parent: current, context: context, subject: listSubject, listMapping: listMapping })\n      }\n      for (var child = current.lastChild; child; child = child.previousSibling) {\n        if (child.nodeType === Node.ELEMENT_NODE) {\n          // console.log(\"Pushing child \"+child.localName)\n          // child.baseURI = current.baseURI\n          queue.unshift({ current: child, context: childContext })\n        }\n      }\n    }\n    if (this.inHTMLMode) {\n      this.copyProperties()\n    }\n    for (let i = 0; i < this.finishedHandlers.length; i++) {\n      this.finishedHandlers[i](node)\n    }\n  }\n\n  push (parent, subject) {\n    return {\n      parent: parent,\n      subject: subject || (parent ? parent.subject : null),\n      parentObject: null,\n      incomplete: [],\n      listMapping: parent ? parent.listMapping : {},\n      language: parent ? parent.language : this.language,\n      prefixes: parent ? parent.prefixes : this.target.graph.prefixes,\n      terms: parent ? parent.terms : this.target.graph.terms,\n      vocabulary: parent ? parent.vocabulary : this.vocabulary\n    }\n  }\n\n  resolveAndNormalize (base, uri) {\n    // console.log(\"Joining \" + uri + \" to \" + base + \" making \" +  Uri.join(uri, base))\n    return Uri.join(uri, base) // @@ normalize?\n  }\n\n  setContext (node) {\n    // We only recognized XHTML+RDFa 1.1 if the version is set propertyly\n    if (node.localName === 'html' && node.getAttribute('version') === 'XHTML+RDFa 1.1') {\n      this.setXHTMLContext()\n    } else if (node.localName === 'html' || node.namespaceURI === 'http://www.w3.org/1999/xhtml') {\n      if (typeof document !== 'undefined' && document.doctype) {\n        if (document.doctype.publicId === '-//W3C//DTD XHTML+RDFa 1.0//EN' && document.doctype.systemId === 'http://www.w3.org/MarkUp/DTD/xhtml-rdfa-1.dtd') {\n          console.log('WARNING: RDF 1.0 is not supported.  Defaulting to HTML5 mode.')\n          this.setHTMLContext()\n        } else if (document.doctype.publicId === '-//W3C//DTD XHTML+RDFa 1.1//EN' && document.doctype.systemId === 'http://www.w3.org/MarkUp/DTD/xhtml-rdfa-2.dtd') {\n          this.setXHTMLContext()\n        } else {\n          this.setHTMLContext()\n        }\n      } else {\n        this.setHTMLContext()\n      }\n    } else {\n      this.setXMLContext()\n    }\n  }\n\n  setHTMLContext () {\n    this.setInitialContext()\n    this.langAttributes = [\n      {\n        namespaceURI: 'http://www.w3.org/XML/1998/namespace',\n        localName: 'lang'\n      },\n      { namespaceURI: null, localName: 'lang' }\n    ]\n    this.inXHTMLMode = false\n    this.inHTMLMode = true\n  }\n\n  setInitialContext () {\n    this.vocabulary = null\n    // By default, the prefixes are terms are loaded to the RDFa 1.1. standard within the graph constructor\n    this.langAttributes = [\n      {\n        namespaceURI: 'http://www.w3.org/XML/1998/namespace',\n        localName: 'lang'\n      }\n    ]\n  }\n\n  setXHTMLContext () {\n    this.setInitialContext()\n    this.inXHTMLMode = true\n    this.inHTMLMode = false\n    this.langAttributes = [\n      {\n        namespaceURI: 'http://www.w3.org/XML/1998/namespace',\n        localName: 'lang' },\n      { namespaceURI: null, localName: 'lang' }\n    ]\n    // From http://www.w3.org/2011/rdfa-context/xhtml-rdfa-1.1\n    this.target.graph.terms['alternate'] = 'http://www.w3.org/1999/xhtml/vocab#alternate'\n    this.target.graph.terms['appendix'] = 'http://www.w3.org/1999/xhtml/vocab#appendix'\n    this.target.graph.terms['bookmark'] = 'http://www.w3.org/1999/xhtml/vocab#bookmark'\n    this.target.graph.terms['cite'] = 'http://www.w3.org/1999/xhtml/vocab#cite'\n    this.target.graph.terms['chapter'] = 'http://www.w3.org/1999/xhtml/vocab#chapter'\n    this.target.graph.terms['contents'] = 'http://www.w3.org/1999/xhtml/vocab#contents'\n    this.target.graph.terms['copyright'] = 'http://www.w3.org/1999/xhtml/vocab#copyright'\n    this.target.graph.terms['first'] = 'http://www.w3.org/1999/xhtml/vocab#first'\n    this.target.graph.terms['glossary'] = 'http://www.w3.org/1999/xhtml/vocab#glossary'\n    this.target.graph.terms['help'] = 'http://www.w3.org/1999/xhtml/vocab#help'\n    this.target.graph.terms['icon'] = 'http://www.w3.org/1999/xhtml/vocab#icon'\n    this.target.graph.terms['index'] = 'http://www.w3.org/1999/xhtml/vocab#index'\n    this.target.graph.terms['last'] = 'http://www.w3.org/1999/xhtml/vocab#last'\n    this.target.graph.terms['license'] = 'http://www.w3.org/1999/xhtml/vocab#license'\n    this.target.graph.terms['meta'] = 'http://www.w3.org/1999/xhtml/vocab#meta'\n    this.target.graph.terms['next'] = 'http://www.w3.org/1999/xhtml/vocab#next'\n    this.target.graph.terms['prev'] = 'http://www.w3.org/1999/xhtml/vocab#prev'\n    this.target.graph.terms['previous'] = 'http://www.w3.org/1999/xhtml/vocab#previous'\n    this.target.graph.terms['section'] = 'http://www.w3.org/1999/xhtml/vocab#section'\n    this.target.graph.terms['stylesheet'] = 'http://www.w3.org/1999/xhtml/vocab#stylesheet'\n    this.target.graph.terms['subsection'] = 'http://www.w3.org/1999/xhtml/vocab#subsection'\n    this.target.graph.terms['start'] = 'http://www.w3.org/1999/xhtml/vocab#start'\n    this.target.graph.terms['top'] = 'http://www.w3.org/1999/xhtml/vocab#top'\n    this.target.graph.terms['up'] = 'http://www.w3.org/1999/xhtml/vocab#up'\n    this.target.graph.terms['p3pv1'] = 'http://www.w3.org/1999/xhtml/vocab#p3pv1'\n    // other\n    this.target.graph.terms['related'] = 'http://www.w3.org/1999/xhtml/vocab#related'\n    this.target.graph.terms['role'] = 'http://www.w3.org/1999/xhtml/vocab#role'\n    this.target.graph.terms['transformation'] = 'http://www.w3.org/1999/xhtml/vocab#transformation'\n  }\n\n  setXMLContext () {\n    this.setInitialContext()\n    this.inXHTMLMode = false\n    this.inHTMLMode = false\n  }\n\n  tokenize (str) {\n    return this.trim(str).split(/\\s+/)\n  }\n  static tokenize (str) {\n    return this.trim(str).split(/\\s+/)\n  }\n\n  toRDFNodeObject (x) {\n    if (typeof x === 'undefined') return undefined\n    if (typeof x === 'string') {\n      if (x.substring(0, 2) === '_:') {\n        if (typeof this.blankNodes[x.substring(2)] === 'undefined') {\n          this.blankNodes[x.substring(2)] = new BlankNode(x.substring(2))\n        }\n        return this.blankNodes[x.substring(2)]\n      }\n      return rdf.namedNode(x)\n    }\n    switch (x.type) {\n      case RDFaProcessor.objectURI:\n        if (x.value.substring(0, 2) === '_:') {\n          if (typeof this.blankNodes[x.value.substring(2)] === 'undefined') {\n            this.blankNodes[x.value.substring(2)] = new BlankNode(x.value.substring(2))\n          }\n          return this.blankNodes[x.value.substring(2)]\n        }\n        return rdf.namedNode(x.value)\n      case RDFaProcessor.PlainLiteralURI:\n        return new Literal(x.value, x.language || '')\n      case RDFaProcessor.XMLLiteralURI:\n      case RDFaProcessor.HTMLLiteralURI:\n        var string = ''\n        Object.keys(x.value).forEach(i => {\n          string += Util.domToString(x.value[i], this.htmlOptions)\n        })\n        return new Literal(string, '', new NamedNode(x.type))\n      default:\n        return new Literal(x.value, '', new NamedNode(x.type))\n    }\n  }\n\n  trim (str) {\n    return str.replace(/^\\s\\s*/, '').replace(/\\s\\s*$/, '')\n  }\n  static trim (str) {\n    return str.replace(/^\\s\\s*/, '').replace(/\\s\\s*$/, '')\n  }\n}\n\nRDFaProcessor.XMLLiteralURI =\n  'http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral'\nRDFaProcessor.HTMLLiteralURI = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#HTML'\nRDFaProcessor.PlainLiteralURI =\n  'http://www.w3.org/1999/02/22-rdf-syntax-ns#PlainLiteral'\nRDFaProcessor.objectURI = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#object'\nRDFaProcessor.typeURI = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type'\nRDFaProcessor.nameChar =\n  '[-A-Z_a-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD\\u10000-\\uEFFFF\\.0-9\\u00B7\\u0300-\\u036F\\u203F-\\u2040]'\nRDFaProcessor.nameStartChar =\n  '[\\u0041-\\u005A\\u0061-\\u007A\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u00FF\\u0100-\\u0131\\u0134-\\u013E\\u0141-\\u0148\\u014A-\\u017E\\u0180-\\u01C3\\u01CD-\\u01F0\\u01F4-\\u01F5\\u01FA-\\u0217\\u0250-\\u02A8\\u02BB-\\u02C1\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03CE\\u03D0-\\u03D6\\u03DA\\u03DC\\u03DE\\u03E0\\u03E2-\\u03F3\\u0401-\\u040C\\u040E-\\u044F\\u0451-\\u045C\\u045E-\\u0481\\u0490-\\u04C4\\u04C7-\\u04C8\\u04CB-\\u04CC\\u04D0-\\u04EB\\u04EE-\\u04F5\\u04F8-\\u04F9\\u0531-\\u0556\\u0559\\u0561-\\u0586\\u05D0-\\u05EA\\u05F0-\\u05F2\\u0621-\\u063A\\u0641-\\u064A\\u0671-\\u06B7\\u06BA-\\u06BE\\u06C0-\\u06CE\\u06D0-\\u06D3\\u06D5\\u06E5-\\u06E6\\u0905-\\u0939\\u093D\\u0958-\\u0961\\u0985-\\u098C\\u098F-\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09DC-\\u09DD\\u09DF-\\u09E1\\u09F0-\\u09F1\\u0A05-\\u0A0A\\u0A0F-\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32-\\u0A33\\u0A35-\\u0A36\\u0A38-\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8B\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2-\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AE0\\u0B05-\\u0B0C\\u0B0F-\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32-\\u0B33\\u0B36-\\u0B39\\u0B3D\\u0B5C-\\u0B5D\\u0B5F-\\u0B61\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99-\\u0B9A\\u0B9C\\u0B9E-\\u0B9F\\u0BA3-\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB5\\u0BB7-\\u0BB9\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C33\\u0C35-\\u0C39\\u0C60-\\u0C61\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CDE\\u0CE0-\\u0CE1\\u0D05-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D28\\u0D2A-\\u0D39\\u0D60-\\u0D61\\u0E01-\\u0E2E\\u0E30\\u0E32-\\u0E33\\u0E40-\\u0E45\\u0E81-\\u0E82\\u0E84\\u0E87-\\u0E88\\u0E8A\\u0E8D\\u0E94-\\u0E97\\u0E99-\\u0E9F\\u0EA1-\\u0EA3\\u0EA5\\u0EA7\\u0EAA-\\u0EAB\\u0EAD-\\u0EAE\\u0EB0\\u0EB2-\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0F40-\\u0F47\\u0F49-\\u0F69\\u10A0-\\u10C5\\u10D0-\\u10F6\\u1100\\u1102-\\u1103\\u1105-\\u1107\\u1109\\u110B-\\u110C\\u110E-\\u1112\\u113C\\u113E\\u1140\\u114C\\u114E\\u1150\\u1154-\\u1155\\u1159\\u115F-\\u1161\\u1163\\u1165\\u1167\\u1169\\u116D-\\u116E\\u1172-\\u1173\\u1175\\u119E\\u11A8\\u11AB\\u11AE-\\u11AF\\u11B7-\\u11B8\\u11BA\\u11BC-\\u11C2\\u11EB\\u11F0\\u11F9\\u1E00-\\u1E9B\\u1EA0-\\u1EF9\\u1F00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2126\\u212A-\\u212B\\u212E\\u2180-\\u2182\\u3041-\\u3094\\u30A1-\\u30FA\\u3105-\\u312C\\uAC00-\\uD7A3\\u4E00-\\u9FA5\\u3007\\u3021-\\u3029_]'\nRDFaProcessor.NCNAME = new RegExp('^' + RDFaProcessor.nameStartChar +\n  RDFaProcessor.nameChar + '*$')\n\n/*\nRDFaProcessor.prototype.resolveAndNormalize = function(base,href) {\n   var u = base.resolve(href)\n   var parsed = this.parseURI(u)\n   parsed.normalize()\n   return parsed.spec\n}\n*/\n\nRDFaProcessor.dateTimeTypes = [\n  { pattern: /-?P(?:[0-9]+Y)?(?:[0-9]+M)?(?:[0-9]+D)?(?:T(?:[0-9]+H)?(?:[0-9]+M)?(?:[0-9]+(?:\\.[0-9]+)?S)?)?/,\n    type: 'http://www.w3.org/2001/XMLSchema#duration' },\n  { pattern: /-?(?:[1-9][0-9][0-9][0-9]|0[1-9][0-9][0-9]|00[1-9][0-9]|000[1-9])-[0-9][0-9]-[0-9][0-9]T(?:[0-1][0-9]|2[0-4]):[0-5][0-9]:[0-5][0-9](?:\\.[0-9]+)?(?:Z|[+\\-][0-9][0-9]:[0-9][0-9])?/,\n    type: 'http://www.w3.org/2001/XMLSchema#dateTime' },\n  { pattern: /-?(?:[1-9][0-9][0-9][0-9]|0[1-9][0-9][0-9]|00[1-9][0-9]|000[1-9])-[0-9][0-9]-[0-9][0-9](?:Z|[+\\-][0-9][0-9]:[0-9][0-9])?/,\n    type: 'http://www.w3.org/2001/XMLSchema#date' },\n  { pattern: /(?:[0-1][0-9]|2[0-4]):[0-5][0-9]:[0-5][0-9](?:\\.[0-9]+)?(?:Z|[+\\-][0-9][0-9]:[0-9][0-9])?/,\n    type: 'http://www.w3.org/2001/XMLSchema#time' },\n  { pattern: /-?(?:[1-9][0-9][0-9][0-9]|0[1-9][0-9][0-9]|00[1-9][0-9]|000[1-9])-[0-9][0-9]/,\n    type: 'http://www.w3.org/2001/XMLSchema#gYearMonth' },\n  { pattern: /-?[1-9][0-9][0-9][0-9]|0[1-9][0-9][0-9]|00[1-9][0-9]|000[1-9]/,\n    type: 'http://www.w3.org/2001/XMLSchema#gYear' }\n]\n\nconst parseRDFaDOM = RDFaProcessor.parseRDFaDOM\nexport { parseRDFaDOM }\n","// Matching a formula against another formula\n// Assync as well as Synchronously\n//\n// W3C open source licence 2005.\n//\n// This builds on term.js, match.js (and identity.js?)\n// to allow a query of a formula.\n//\n// Here we introduce for the first time a subclass of term: variable.\n//\n// SVN ID: $Id: query.js 25116 2008-11-15 16:13:48Z timbl $\n\n//  Variable\n//\n// Compare with BlankNode.  They are similar, but a variable\n// stands for something whose value is to be returned.\n// Also, users name variables and want the same name back when stuff is printed\n/* jsl:option explicit */ // Turn on JavaScriptLint variable declaration checking\n\nimport IndexedFormula  from './store'\nimport { defaultGraphURI as defaultDocumentURI } from './utils/default-graph-uri'\nimport log from './log'\nimport { docpart } from './uri'\n\n/**\n * Query class, for tracking queries the user has in the UI.\n */\nexport class Query {\n  constructor (name, id) {\n    this.pat = new IndexedFormula() // The pattern to search for\n    this.vars = [] // Used by UI code but not in query.js\n    //    this.orderBy = [] // Not used yet\n    this.name = name\n    this.id = id\n  }\n}\n\n/**\n * This function will match a pattern to the current Store\n *\n * The callback function is called whenever a match is found\n * When fetcher is supplied this will be called to load from the web\n * any new nodes as they are discovered.  This will cause the query to traverse the\n * graph of linked data, sometimes called \"Link Following Query\"\n *\n * @param myQuery - a knowledgebase containing a pattern to use as query\n * @param callback - whenever the pattern in myQuery is met this is called with\n *  the new bindings as parameter\n * @param fetcher? - If and only if,  you want link following, give a fetcher\n *                which has been created for the quadstore being queried.\n * @param onDone -  callback when query finished\n */\nexport function indexedFormulaQuery (myQuery, callback, fetcher, onDone) {\n  /** Debug strings\n  */\n  function bindingDebug (b) {\n    var str = ''\n    var v\n    for (v in b) {\n      if (b.hasOwnProperty(v)) {\n        str += '    ' + v + ' -> ' + b[v]\n      }\n    }\n    return str\n  }\n\n  function bindingsDebug (nbs) {\n    var str = 'Bindings: '\n    var i\n    var n = nbs.length\n    for (i = 0; i < n; i++) {\n      str += bindingDebug(nbs[i][0]) + ';\\n\\t'\n    }\n    return str\n  } // bindingsDebug\n\n  /** Unification\n   *\n   * Unification finds all bindings such that when the binding is applied\n   * to one term it is equal to the other.\n   * @returns {Arrray}-  a list of bindings, where a binding is an associative array\n   *  mapping variuable to value.\n   */\n  function unifyTerm (self, other, bindings, formula) {\n    var actual = bindings[self]\n    if (actual === undefined) { // Not mapped\n      if (self.isVar) {\n        var b = []\n        b[self] = other\n        return [[ b, null ]] // Match\n      }\n      actual = self\n    }\n    if (!actual.complexType) {\n      if (formula.redirections[actual]) {\n        actual = formula.redirections[actual]\n      }\n      if (formula.redirections[other]) {\n        other = formula.redirections[other]\n      }\n      if (actual.equals(other) || (actual.uri && actual.uri === defaultDocumentURI)) { // Used to mean 'any graph' in a query\n        return [[ [], null ]]\n      }\n      return []\n    }\n    if (self instanceof Array) {\n      if (!(other instanceof Array)) {\n        return []\n      }\n      return unifyContents(self, other, bindings)\n    }\n    throw new Error('query.js: oops - code not written yet')\n  // return undefined;  // for lint - no jslint objects to unreachables\n  //    return actual.unifyContents(other, bindings)\n  } // unifyTerm\n\n  function unifyContents (self, other, bindings, formula) {\n    var nbs2\n    if (self.length !== other.length) {\n      return [] // no way\n    }\n    if (!self.length) {\n      return [[ [], null ]] // Success\n    }\n    var nbs = unifyTerm(self[0], other[0], bindings, formula)\n    if (nbs.length === 0) {\n      return nbs\n    }\n    var res = []\n    var i\n    var n = nbs.length\n    var nb\n    var j\n    var m\n    var v\n    var nb2\n    var bindings2\n    for (i = 0; i < n; i++) { // for each possibility from the first term\n      nb = nbs[i][0] // new bindings\n      bindings2 = []\n      for (v in nb) {\n        if (nb.hasOwnProperty(v)) {\n          bindings2[v] = nb[v] // copy\n        }\n      }\n      for (v in bindings) {\n        if (bindings.hasOwnProperty(v)) {\n          bindings2[v] = bindings[v] // copy\n        }\n      }\n      nbs2 = unifyContents(self.slice(1), other.slice(1), bindings2, formula)\n      m = nbs2.length\n      for (j = 0; j < m; j++) {\n        nb2 = nbs2[j][0] // @@@@ no idea whether this is used or right\n        for (v in nb) {\n          if (nb.hasOwnProperty(v)) {\n            nb2[v] = nb[v]\n          }\n        }\n        res.push([nb2, null])\n      }\n    }\n    return res\n  } // unifyContents\n\n  //  Matching\n  //\n  // Matching finds all bindings such that when the binding is applied\n  // to one term it is equal to the other term.  We only match formulae.\n\n  /** if x is not in the bindings array, return the var; otherwise, return the bindings **/\n  function bind (x, binding) {\n    var y = binding[x]\n    if (y === undefined) {\n      return x\n    }\n    return y\n  }\n\n  // When there are OPTIONAL clauses, we must return bindings without them if none of them\n  // succeed. However, if any of them do succeed, we should not.  (This is what branchCount()\n  // tracked. The problem currently is (2011/7) that when several optionals exist, and they\n  // all match, multiple sets of bindings are returned, each with one optional filled in.)\n\n  function union (a, b) {\n    var c = {}\n    var x\n    for (x in a) {\n      if (a.hasOwnProperty(x)) {\n        c[x] = a[x]\n      }\n    }\n    for (x in b) {\n      if (b.hasOwnProperty(x)) {\n        c[x] = b[x]\n      }\n    }\n    return c\n  }\n\n  function OptionalBranchJunction (originalCallback, trunkBindings) {\n    this.trunkBindings = trunkBindings\n    this.originalCallback = originalCallback\n    this.branches = []\n    // this.results = []; // result[i] is an array of bindings for branch i\n    // this.done = {};  // done[i] means all/any results are in for branch i\n    // this.count = {}\n    return this\n  }\n\n  OptionalBranchJunction.prototype.checkAllDone = function () {\n    var i\n    for (i = 0; i < this.branches.length; i++) {\n      if (!this.branches[i].done) {\n        return\n      }\n    }\n    log.debug('OPTIONAL BIDNINGS ALL DONE:')\n    this.doCallBacks(this.branches.length - 1, this.trunkBindings)\n  }\n  // Recrursively generate the cross product of the bindings\n  OptionalBranchJunction.prototype.doCallBacks = function (b, bindings) {\n    var j\n    if (b < 0) {\n      return this.originalCallback(bindings)\n    }\n    for (j = 0; j < this.branches[b].results.length; j++) {\n      this.doCallBacks(b - 1, union(bindings, this.branches[b].results[j]))\n    }\n  }\n\n  // A mandatory branch is the normal one, where callbacks\n  // are made immediately and no junction is needed.\n  // Might be useful for onFinsihed callback for query API.\n  function MandatoryBranch (callback, onDone) {\n    this.count = 0\n    this.success = false\n    this.done = false\n    // this.results = []\n    this.callback = callback\n    this.onDone = onDone\n    // this.junction = junction\n    // junction.branches.push(this)\n    return this\n  }\n\n  MandatoryBranch.prototype.reportMatch = function (bindings) {\n    // log.error(\"@@@@ query.js 1\"); // @@\n    this.callback(bindings)\n    this.success = true\n  }\n\n  MandatoryBranch.prototype.reportDone = function () {\n    this.done = true\n    log.info('Mandatory query branch finished.***')\n    if (this.onDone !== undefined) {\n      this.onDone()\n    }\n  }\n\n  // An optional branch hoards its results.\n  var OptionalBranch = function (junction) {\n    this.count = 0\n    this.done = false\n    this.results = []\n    this.junction = junction\n    junction.branches.push(this)\n    return this\n  }\n\n  OptionalBranch.prototype.reportMatch = function (bindings) {\n    this.results.push(bindings)\n  }\n\n  OptionalBranch.prototype.reportDone = function () {\n    log.debug('Optional branch finished - results.length = ' + this.results.length)\n    if (this.results.length === 0) { // This is what optional means: if no hits,\n      this.results.push({}) // mimic success, but with no bindings\n      log.debug(\"Optional branch FAILED - that's OK.\")\n    }\n    this.done = true\n    this.junction.checkAllDone()\n  }\n\n  /** prepare -- sets the index of the item to the possible matches\n   * @param f - formula\n   * @param item - an Statement, possibly w/ vars in it\n   * @param bindings - Bindings so far\n   * @returns false if the query fails -- there are no items that match\n  */\n  function prepare (f, item, bindings) {\n    var terms, termIndex, i, ind\n    item.nvars = 0\n    item.index = null\n    // if (!f.statements) log.warn(\"@@@ prepare: f is \"+f)\n    //    log.debug(\"Prepare: f has \"+ f.statements.length)\n    // log.debug(\"Prepare: Kb size \"+f.statements.length+\" Preparing \"+item)\n\n    terms = [item.subject, item.predicate, item.object, item.why]\n    ind = [f.subjectIndex, f.predicateIndex, f.objectIndex, f.whyIndex]\n    for (i = 0; i < 4; i++) {\n      let t = terms[i]\n      // console.log(\"  Prepare (\" + t + \") \"+(t in bindings))\n      if (t.uri && t.uri === defaultDocumentURI) { // chrome:session\n        // console.log('     query: Ignoring slot ' + i)\n      } else if (t.isVar && !(bindings[t] !== undefined)) {\n        item.nvars++\n      } else {\n        t = bind(terms[i], bindings) // returns the RDF binding if bound, otherwise itself\n        // if (terms[i]!=bind(terms[i],bindings) alert(\"Term: \"+terms[i]+\"Binding: \"+bind(terms[i], bindings))\n        if (f.redirections[f.id(t)]) {\n          t = f.redirections[f.id(t)] // redirect\n        }\n        termIndex = ind[i][f.id(t)]\n\n        if (!termIndex) {\n          item.index = []\n          return false // Query line cannot match\n        }\n        if ((item.index === null) || (item.index.length > termIndex.length)) { // Find smallest index\n          item.index = termIndex\n        }\n      }\n    }\n\n    if (item.index === null) { // All 4 are variables?\n      item.index = f.statements\n    }\n    return true\n  } // prepare\n\n  /** sorting function -- negative if self is easier **/\n  // We always prefer to start with a URI to be able to browse a graph\n  // this is why we put off items with more variables till later.\n  function easiestQuery (self, other) {\n    if (self.nvars !== other.nvars) {\n      return self.nvars - other.nvars\n    }\n    return self.index.length - other.index.length\n  }\n\n  var matchIndex = 0 // index\n  /** matches a pattern formula against the knowledge base, e.g. to find matches for table-view\n  *\n  * @param f - knowledge base formula\n  * @param g - pattern formula (may have vars)\n  * @param bindingsSoFar  - bindings accumulated in matching to date\n  * @param level - spaces to indent stuff also lets you know what level of recursion you're at\n  * @param fetcher - function (term, requestedBy) If you want link following\n  * @param localCallback - function(bindings, pattern, branch) called on sucess\n  * @returns nothing\n  *\n  * Will fetch linked data from the web iff the knowledge base an associated source fetcher (f.fetcher)\n  ***/\n  var match = function (f, g, bindingsSoFar, level, fetcher, localCallback, branch) {\n    log.debug('Match begins, Branch count now: ' + branch.count + ' for ' + branch.pattern_debug)\n\n    // log.debug(\"match: f has \"+f.statements.length+\", g has \"+g.statements.length)\n    var pattern = g.statements\n    if (pattern.length === 0) { // when it's satisfied all the pattern triples\n      log.debug('FOUND MATCH WITH BINDINGS:' + bindingDebug(bindingsSoFar))\n      if (g.optional.length === 0) {\n        branch.reportMatch(bindingsSoFar)\n      } else {\n        log.debug('OPTIONAL: ' + g.optional)\n        var junction = new OptionalBranchJunction(callback, bindingsSoFar) // @@ won't work with nested optionals? nest callbacks\n        var br = []\n        var b\n        for (b = 0; b < g.optional.length; b++) {\n          br[b] = new OptionalBranch(junction) // Allocate branches to prevent premature ending\n          br[b].pattern_debug = g.optional[b] // for diagnotics only\n        }\n        for (b = 0; b < g.optional.length; b++) {\n          br[b].count = br[b].count + 1 // Count how many matches we have yet to complete\n          match(f, g.optional[b], bindingsSoFar, '', fetcher, callback, br[b])\n        }\n      }\n      branch.count--\n      log.debug('Match ends -- success , Branch count now: ' + branch.count + ' for ' + branch.pattern_debug)\n      return // Success\n    }\n\n    var item\n    var i\n    var n = pattern.length\n    // log.debug(level + \"Match \"+n+\" left, bs so far:\"+bindingDebug(bindingsSoFar))\n\n    // Follow links from variables in query\n    if (fetcher) { // Fetcher is used to fetch URIs, function first term is a URI term, second is the requester\n      var id = 'match' + matchIndex++\n      var fetchResource = function (requestedTerm, id) {\n        var docuri = requestedTerm.uri.split('#')[0]\n        fetcher.nowOrWhenFetched(docuri, undefined, function (ok, body, xhr) {\n          if (!ok) {\n            console.log('Error following link to <' + requestedTerm.uri + '> in query: ' + body)\n          }\n          match(f, g, bindingsSoFar, level, fetcher, // match not match2 to look up any others necessary.\n            localCallback, branch)\n        })\n      }\n      for (i = 0; i < n; i++) {\n        item = pattern[i] // for each of the triples in the query\n        if (bindingsSoFar[item.subject] !== undefined &&\n            bindingsSoFar[item.subject].uri && fetcher &&\n            fetcher.getState(docpart(bindingsSoFar[item.subject].uri)) === 'unrequested') {\n          // fetch the subject info and return to id\n          fetchResource(bindingsSoFar[item.subject], id)\n          return // only look up one per line this time, but we will come back again though match\n        }\n        if (bindingsSoFar[item.object] !== undefined &&\n            bindingsSoFar[item.object].uri && fetcher &&\n            fetcher.getState(docpart(bindingsSoFar[item.object].uri)) === 'unrequested') {\n          fetchResource(bindingsSoFar[item.object], id)\n          return\n        }\n      }\n    } // if fetcher\n    match2(f, g, bindingsSoFar, level, fetcher, localCallback, branch)\n  } // match\n\n  var constraintsSatisfied = function (bindings, constraints) {\n    var res = true\n    var x\n    var test\n    for (x in bindings) {\n      if (bindings.hasOwnProperty(x)) {\n        if (constraints[x]) {\n          test = constraints[x].test\n          if (test && !test(bindings[x])) {\n            res = false\n          }\n        }\n      }\n    }\n    return res\n  }\n\n  /** match2 -- stuff after the fetch **/\n  var match2 = function (f, g, bindingsSoFar, level, fetcher, callback, branch) { // post fetch\n    var pattern = g.statements\n    var n = pattern.length\n    var i\n    var k\n    var nk\n    var v\n    var bindings2\n    var newBindings1\n    var item\n    for (i = 0; i < n; i++) { // For each statement left in the query, run prepare\n      item = pattern[i]\n      // log.info('match2: item=' + item + ', bindingsSoFar=' + bindingDebug(bindingsSoFar))\n      prepare(f, item, bindingsSoFar)\n      // if (item.index) console.log('     item.index.length ' + item.index.length)\n    }\n    pattern.sort(easiestQuery)\n    item = pattern[0]\n    // log.debug(\"Sorted pattern:\\n\"+pattern)\n    var rest = f.formula()\n    rest.optional = g.optional\n    rest.constraints = g.constraints\n    rest.statements = pattern.slice(1) // No indexes: we will not query g.\n    log.debug(level + 'match2 searching ' + item.index.length + ' for ' + item +\n      '; bindings so far=' + bindingDebug(bindingsSoFar))\n    // var results = []\n    var c\n    var nc = item.index.length\n    var nbs1\n    var st\n    var onward = 0\n    // var x\n    for (c = 0; c < nc; c++) { // For each candidate statement\n      st = item.index[c] // for each statement in the item's index, spawn a new match with that binding\n      nbs1 = unifyContents(\n        [item.subject, item.predicate, item.object, item.why],\n        [st.subject, st.predicate, st.object, st.why], bindingsSoFar, f)\n      log.info(level + ' From first: ' + nbs1.length + ': ' + bindingsDebug(nbs1))\n      nk = nbs1.length\n      // branch.count += nk\n      // log.debug(\"Branch count bumped \"+nk+\" to: \"+branch.count)\n      for (k = 0; k < nk; k++) { // For each way that statement binds\n        bindings2 = []\n        newBindings1 = nbs1[k][0]\n        if (!constraintsSatisfied(newBindings1, g.constraints)) {\n          // branch.count--\n          log.debug('Branch count CS: ' + branch.count)\n        } else {\n          for (v in newBindings1) {\n            if (newBindings1.hasOwnProperty(v)) {\n              bindings2[v] = newBindings1[v] // copy\n            }\n          }\n          for (v in bindingsSoFar) {\n            if (bindingsSoFar.hasOwnProperty(v)) {\n              bindings2[v] = bindingsSoFar[v] // copy\n            }\n          }\n\n          branch.count++ // Count how many matches we have yet to complete\n          onward++\n          match(f, rest, bindings2, level + '  ', fetcher, callback, branch) // call match\n        }\n      }\n    }\n    branch.count--\n    if (onward === 0) {\n      log.debug('Match2 fails completely on ' + item)\n    }\n    log.debug('Match2 ends, Branch count: ' + branch.count + ' for ' + branch.pattern_debug)\n    if (branch.count === 0) {\n      log.debug('Branch finished.')\n      branch.reportDone()\n    }\n  } // match2\n  // ////////////////////////// Body of query()  ///////////////////////\n  var f = this\n  log.debug('Query on ' + this.statements.length)\n  var trunck = new MandatoryBranch(callback, onDone)\n  trunck.count++ // count one branch to complete at the moment\n  if (myQuery.sync) {\n    match(f, myQuery.pat, myQuery.pat.initBindings, '', fetcher, callback, trunck)\n  } else { // Give up thread: Allow other activities to run\n    setTimeout(function () {\n      match(f, myQuery.pat, myQuery.pat.initBindings, '', fetcher, callback, trunck)\n    }, 0)\n  }\n\n   // returns nothing; callback does the work\n} // query\n","import Node from './node-internal'\nimport { DefaultGraphTermType } from './types'\nimport { DefaultGraph as TFDefaultGraph } from './tf-types'\nimport { defaultGraphURI } from './utils/default-graph-uri'\n\n/** The RDF default graph */\nexport default class DefaultGraph extends Node implements TFDefaultGraph {\n  value: '' = '';\n  termType: typeof DefaultGraphTermType = DefaultGraphTermType;\n  uri = defaultGraphURI\n\n  constructor () {\n    super('')\n  }\n\n  toCanonical () {\n    return this.value\n  }\n\n  toString () {\n    return 'DefaultGraph';\n  }\n}\n\nexport function isDefaultGraph(object: any): object is DefaultGraph {\n  return !!object && object.termType === DefaultGraphTermType;\n}\n","/*\n * Copyright (c) 2017-2019 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst util = require('./util');\nconst JsonLdError = require('./JsonLdError');\n\nconst {\n  isArray: _isArray,\n  isObject: _isObject,\n  isString: _isString,\n  isUndefined: _isUndefined\n} = require('./types');\n\nconst {\n  isAbsolute: _isAbsoluteIri,\n  isRelative: _isRelativeIri,\n  prependBase\n} = require('./url');\n\nconst {\n  asArray: _asArray,\n  compareShortestLeast: _compareShortestLeast\n} = require('./util');\n\nconst INITIAL_CONTEXT_CACHE = new Map();\nconst INITIAL_CONTEXT_CACHE_MAX_SIZE = 10000;\nconst KEYWORD_PATTERN = /^@[a-zA-Z]+$/;\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Processes a local context and returns a new active context.\n *\n * @param activeCtx the current active context.\n * @param localCtx the local context to process.\n * @param options the context processing options.\n * @param propagate `true` if `false`, retains any previously defined term,\n *   which can be rolled back when the descending into a new node object.\n * @param overrideProtected `false` allows protected terms to be modified.\n *\n * @return a Promise that resolves to the new active context.\n */\napi.process = async ({\n  activeCtx, localCtx, options,\n  propagate = true,\n  overrideProtected = false,\n  cycles = new Set()\n}) => {\n  // normalize local context to an array of @context objects\n  if(_isObject(localCtx) && '@context' in localCtx &&\n    _isArray(localCtx['@context'])) {\n    localCtx = localCtx['@context'];\n  }\n  const ctxs = _asArray(localCtx);\n\n  // no contexts in array, return current active context w/o changes\n  if(ctxs.length === 0) {\n    return activeCtx;\n  }\n\n  // resolve contexts\n  const resolved = await options.contextResolver.resolve({\n    activeCtx,\n    context: localCtx,\n    documentLoader: options.documentLoader,\n    base: options.base\n  });\n\n  // override propagate if first resolved context has `@propagate`\n  if(_isObject(resolved[0].document) &&\n    typeof resolved[0].document['@propagate'] === 'boolean') {\n    // retrieve early, error checking done later\n    propagate = resolved[0].document['@propagate'];\n  }\n\n  // process each context in order, update active context\n  // on each iteration to ensure proper caching\n  let rval = activeCtx;\n\n  // track the previous context\n  // if not propagating, make sure rval has a previous context\n  if(!propagate && !rval.previousContext) {\n    // clone `rval` context before updating\n    rval = rval.clone();\n    rval.previousContext = activeCtx;\n  }\n\n  for(const resolvedContext of resolved) {\n    let {document: ctx} = resolvedContext;\n\n    // update active context to one computed from last iteration\n    activeCtx = rval;\n\n    // reset to initial context\n    if(ctx === null) {\n      // We can't nullify if there are protected terms and we're\n      // not allowing overrides (e.g. processing a property term scoped context)\n      if(!overrideProtected &&\n        Object.keys(activeCtx.protected).length !== 0) {\n        const protectedMode = (options && options.protectedMode) || 'error';\n        if(protectedMode === 'error') {\n          throw new JsonLdError(\n            'Tried to nullify a context with protected terms outside of ' +\n            'a term definition.',\n            'jsonld.SyntaxError',\n            {code: 'invalid context nullification'});\n        } else if(protectedMode === 'warn') {\n          // FIXME: remove logging and use a handler\n          console.warn('WARNING: invalid context nullification');\n\n          // get processed context from cache if available\n          const processed = resolvedContext.getProcessed(activeCtx);\n          if(processed) {\n            rval = activeCtx = processed;\n            continue;\n          }\n\n          const oldActiveCtx = activeCtx;\n          // copy all protected term definitions to fresh initial context\n          rval = activeCtx = api.getInitialContext(options).clone();\n          for(const [term, _protected] of\n            Object.entries(oldActiveCtx.protected)) {\n            if(_protected) {\n              activeCtx.mappings[term] =\n                util.clone(oldActiveCtx.mappings[term]);\n            }\n          }\n          activeCtx.protected = util.clone(oldActiveCtx.protected);\n\n          // cache processed result\n          resolvedContext.setProcessed(oldActiveCtx, rval);\n          continue;\n        }\n        throw new JsonLdError(\n          'Invalid protectedMode.',\n          'jsonld.SyntaxError',\n          {code: 'invalid protected mode', context: localCtx, protectedMode});\n      }\n      rval = activeCtx = api.getInitialContext(options).clone();\n      continue;\n    }\n\n    // get processed context from cache if available\n    const processed = resolvedContext.getProcessed(activeCtx);\n    if(processed) {\n      rval = activeCtx = processed;\n      continue;\n    }\n\n    // dereference @context key if present\n    if(_isObject(ctx) && '@context' in ctx) {\n      ctx = ctx['@context'];\n    }\n\n    // context must be an object by now, all URLs retrieved before this call\n    if(!_isObject(ctx)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context must be an object.',\n        'jsonld.SyntaxError', {code: 'invalid local context', context: ctx});\n    }\n\n    // TODO: there is likely a `previousContext` cloning optimization that\n    // could be applied here (no need to copy it under certain conditions)\n\n    // clone context before updating it\n    rval = rval.clone();\n\n    // define context mappings for keys in local context\n    const defined = new Map();\n\n    // handle @version\n    if('@version' in ctx) {\n      if(ctx['@version'] !== 1.1) {\n        throw new JsonLdError(\n          'Unsupported JSON-LD version: ' + ctx['@version'],\n          'jsonld.UnsupportedVersion',\n          {code: 'invalid @version value', context: ctx});\n      }\n      if(activeCtx.processingMode &&\n        activeCtx.processingMode === 'json-ld-1.0') {\n        throw new JsonLdError(\n          '@version: ' + ctx['@version'] + ' not compatible with ' +\n          activeCtx.processingMode,\n          'jsonld.ProcessingModeConflict',\n          {code: 'processing mode conflict', context: ctx});\n      }\n      rval.processingMode = 'json-ld-1.1';\n      rval['@version'] = ctx['@version'];\n      defined.set('@version', true);\n    }\n\n    // if not set explicitly, set processingMode to \"json-ld-1.1\"\n    rval.processingMode =\n      rval.processingMode || activeCtx.processingMode;\n\n    // handle @base\n    if('@base' in ctx) {\n      let base = ctx['@base'];\n\n      if(base === null || _isAbsoluteIri(base)) {\n        // no action\n      } else if(_isRelativeIri(base)) {\n        base = prependBase(rval['@base'], base);\n      } else {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; the value of \"@base\" in a ' +\n          '@context must be an absolute IRI, a relative IRI, or null.',\n          'jsonld.SyntaxError', {code: 'invalid base IRI', context: ctx});\n      }\n\n      rval['@base'] = base;\n      defined.set('@base', true);\n    }\n\n    // handle @vocab\n    if('@vocab' in ctx) {\n      const value = ctx['@vocab'];\n      if(value === null) {\n        delete rval['@vocab'];\n      } else if(!_isString(value)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; the value of \"@vocab\" in a ' +\n          '@context must be a string or null.',\n          'jsonld.SyntaxError', {code: 'invalid vocab mapping', context: ctx});\n      } else if(!_isAbsoluteIri(value) && api.processingMode(rval, 1.0)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; the value of \"@vocab\" in a ' +\n          '@context must be an absolute IRI.',\n          'jsonld.SyntaxError', {code: 'invalid vocab mapping', context: ctx});\n      } else {\n        rval['@vocab'] = _expandIri(rval, value, {vocab: true, base: true},\n          undefined, undefined, options);\n      }\n      defined.set('@vocab', true);\n    }\n\n    // handle @language\n    if('@language' in ctx) {\n      const value = ctx['@language'];\n      if(value === null) {\n        delete rval['@language'];\n      } else if(!_isString(value)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; the value of \"@language\" in a ' +\n          '@context must be a string or null.',\n          'jsonld.SyntaxError',\n          {code: 'invalid default language', context: ctx});\n      } else {\n        rval['@language'] = value.toLowerCase();\n      }\n      defined.set('@language', true);\n    }\n\n    // handle @direction\n    if('@direction' in ctx) {\n      const value = ctx['@direction'];\n      if(activeCtx.processingMode === 'json-ld-1.0') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @direction not compatible with ' +\n          activeCtx.processingMode,\n          'jsonld.SyntaxError',\n          {code: 'invalid context member', context: ctx});\n      }\n      if(value === null) {\n        delete rval['@direction'];\n      } else if(value !== 'ltr' && value !== 'rtl') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; the value of \"@direction\" in a ' +\n          '@context must be null, \"ltr\", or \"rtl\".',\n          'jsonld.SyntaxError',\n          {code: 'invalid base direction', context: ctx});\n      } else {\n        rval['@direction'] = value;\n      }\n      defined.set('@direction', true);\n    }\n\n    // handle @propagate\n    // note: we've already extracted it, here we just do error checking\n    if('@propagate' in ctx) {\n      const value = ctx['@propagate'];\n      if(activeCtx.processingMode === 'json-ld-1.0') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @propagate not compatible with ' +\n          activeCtx.processingMode,\n          'jsonld.SyntaxError',\n          {code: 'invalid context entry', context: ctx});\n      }\n      if(typeof value !== 'boolean') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @propagate value must be a boolean.',\n          'jsonld.SyntaxError',\n          {code: 'invalid @propagate value', context: localCtx});\n      }\n      defined.set('@propagate', true);\n    }\n\n    // handle @import\n    if('@import' in ctx) {\n      const value = ctx['@import'];\n      if(activeCtx.processingMode === 'json-ld-1.0') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @import not compatible with ' +\n          activeCtx.processingMode,\n          'jsonld.SyntaxError',\n          {code: 'invalid context entry', context: ctx});\n      }\n      if(!_isString(value)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @import must be a string.',\n          'jsonld.SyntaxError',\n          {code: 'invalid @import value', context: localCtx});\n      }\n\n      // resolve contexts\n      const resolvedImport = await options.contextResolver.resolve({\n        activeCtx,\n        context: value,\n        documentLoader: options.documentLoader,\n        base: options.base\n      });\n      if(resolvedImport.length !== 1) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @import must reference a single context.',\n          'jsonld.SyntaxError',\n          {code: 'invalid remote context', context: localCtx});\n      }\n      const processedImport = resolvedImport[0].getProcessed(activeCtx);\n      if(processedImport) {\n        // Note: if the same context were used in this active context\n        // as a reference context, then processed_input might not\n        // be a dict.\n        ctx = processedImport;\n      } else {\n        const importCtx = resolvedImport[0].document;\n        if('@import' in importCtx) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax: ' +\n            'imported context must not include @import.',\n            'jsonld.SyntaxError',\n            {code: 'invalid context entry', context: localCtx});\n        }\n\n        // merge ctx into importCtx and replace rval with the result\n        for(const key in importCtx) {\n          if(!ctx.hasOwnProperty(key)) {\n            ctx[key] = importCtx[key];\n          }\n        }\n\n        // Note: this could potenially conflict if the import\n        // were used in the same active context as a referenced\n        // context and an import. In this case, we\n        // could override the cached result, but seems unlikely.\n        resolvedImport[0].setProcessed(activeCtx, ctx);\n      }\n\n      defined.set('@import', true);\n    }\n\n    // handle @protected; determine whether this sub-context is declaring\n    // all its terms to be \"protected\" (exceptions can be made on a\n    // per-definition basis)\n    defined.set('@protected', ctx['@protected'] || false);\n\n    // process all other keys\n    for(const key in ctx) {\n      api.createTermDefinition({\n        activeCtx: rval,\n        localCtx: ctx,\n        term: key,\n        defined,\n        options,\n        overrideProtected\n      });\n\n      if(_isObject(ctx[key]) && '@context' in ctx[key]) {\n        const keyCtx = ctx[key]['@context'];\n        let process = true;\n        if(_isString(keyCtx)) {\n          const url = prependBase(options.base, keyCtx);\n          // track processed contexts to avoid scoped context recursion\n          if(cycles.has(url)) {\n            process = false;\n          } else {\n            cycles.add(url);\n          }\n        }\n        // parse context to validate\n        if(process) {\n          try {\n            await api.process({\n              activeCtx: rval.clone(),\n              localCtx: ctx[key]['@context'],\n              overrideProtected: true,\n              options,\n              cycles\n            });\n          } catch(e) {\n            throw new JsonLdError(\n              'Invalid JSON-LD syntax; invalid scoped context.',\n              'jsonld.SyntaxError',\n              {\n                code: 'invalid scoped context',\n                context: ctx[key]['@context'],\n                term: key\n              });\n          }\n        }\n      }\n    }\n\n    // cache processed result\n    resolvedContext.setProcessed(activeCtx, rval);\n  }\n\n  return rval;\n};\n\n/**\n * Creates a term definition during context processing.\n *\n * @param activeCtx the current active context.\n * @param localCtx the local context being processed.\n * @param term the term in the local context to define the mapping for.\n * @param defined a map of defining/defined keys to detect cycles and prevent\n *          double definitions.\n * @param {Object} [options] - creation options.\n * @param {string} [options.protectedMode=\"error\"] - \"error\" to throw error\n *   on `@protected` constraint violation, \"warn\" to allow violations and\n *   signal a warning.\n * @param overrideProtected `false` allows protected terms to be modified.\n */\napi.createTermDefinition = ({\n  activeCtx,\n  localCtx,\n  term,\n  defined,\n  options,\n  overrideProtected = false,\n}) => {\n  if(defined.has(term)) {\n    // term already defined\n    if(defined.get(term)) {\n      return;\n    }\n    // cycle detected\n    throw new JsonLdError(\n      'Cyclical context definition detected.',\n      'jsonld.CyclicalContext',\n      {code: 'cyclic IRI mapping', context: localCtx, term});\n  }\n\n  // now defining term\n  defined.set(term, false);\n\n  // get context term value\n  let value;\n  if(localCtx.hasOwnProperty(term)) {\n    value = localCtx[term];\n  }\n\n  if(term === '@type' &&\n     _isObject(value) &&\n     (value['@container'] || '@set') === '@set' &&\n     api.processingMode(activeCtx, 1.1)) {\n\n    const validKeys = ['@container', '@id', '@protected'];\n    const keys = Object.keys(value);\n    if(keys.length === 0 || keys.some(k => !validKeys.includes(k))) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; keywords cannot be overridden.',\n        'jsonld.SyntaxError',\n        {code: 'keyword redefinition', context: localCtx, term});\n    }\n  } else if(api.isKeyword(term)) {\n    throw new JsonLdError(\n      'Invalid JSON-LD syntax; keywords cannot be overridden.',\n      'jsonld.SyntaxError',\n      {code: 'keyword redefinition', context: localCtx, term});\n  } else if(term.match(KEYWORD_PATTERN)) {\n    // FIXME: remove logging and use a handler\n    console.warn('WARNING: terms beginning with \"@\" are reserved' +\n      ' for future use and ignored', {term});\n    return;\n  } else if(term === '') {\n    throw new JsonLdError(\n      'Invalid JSON-LD syntax; a term cannot be an empty string.',\n      'jsonld.SyntaxError',\n      {code: 'invalid term definition', context: localCtx});\n  }\n\n  // keep reference to previous mapping for potential `@protected` check\n  const previousMapping = activeCtx.mappings.get(term);\n\n  // remove old mapping\n  if(activeCtx.mappings.has(term)) {\n    activeCtx.mappings.delete(term);\n  }\n\n  // convert short-hand value to object w/@id\n  let simpleTerm = false;\n  if(_isString(value) || value === null) {\n    simpleTerm = true;\n    value = {'@id': value};\n  }\n\n  if(!_isObject(value)) {\n    throw new JsonLdError(\n      'Invalid JSON-LD syntax; @context term values must be ' +\n      'strings or objects.',\n      'jsonld.SyntaxError',\n      {code: 'invalid term definition', context: localCtx});\n  }\n\n  // create new mapping\n  const mapping = {};\n  activeCtx.mappings.set(term, mapping);\n  mapping.reverse = false;\n\n  // make sure term definition only has expected keywords\n  const validKeys = ['@container', '@id', '@language', '@reverse', '@type'];\n\n  // JSON-LD 1.1 support\n  if(api.processingMode(activeCtx, 1.1)) {\n    validKeys.push(\n      '@context', '@direction', '@index', '@nest', '@prefix', '@protected');\n  }\n\n  for(const kw in value) {\n    if(!validKeys.includes(kw)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a term definition must not contain ' + kw,\n        'jsonld.SyntaxError',\n        {code: 'invalid term definition', context: localCtx});\n    }\n  }\n\n  // always compute whether term has a colon as an optimization for\n  // _compactIri\n  const colon = term.indexOf(':');\n  mapping._termHasColon = (colon > 0);\n\n  if('@reverse' in value) {\n    if('@id' in value) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a @reverse term definition must not ' +\n        'contain @id.', 'jsonld.SyntaxError',\n        {code: 'invalid reverse property', context: localCtx});\n    }\n    if('@nest' in value) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a @reverse term definition must not ' +\n        'contain @nest.', 'jsonld.SyntaxError',\n        {code: 'invalid reverse property', context: localCtx});\n    }\n    const reverse = value['@reverse'];\n    if(!_isString(reverse)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a @context @reverse value must be a string.',\n        'jsonld.SyntaxError', {code: 'invalid IRI mapping', context: localCtx});\n    }\n\n    if(!api.isKeyword(reverse) && reverse.match(KEYWORD_PATTERN)) {\n      // FIXME: remove logging and use a handler\n      console.warn('WARNING: values beginning with \"@\" are reserved' +\n        ' for future use and ignored', {reverse});\n      if(previousMapping) {\n        activeCtx.mappings.set(term, previousMapping);\n      } else {\n        activeCtx.mappings.delete(term);\n      }\n      return;\n    }\n\n    // expand and add @id mapping\n    const id = _expandIri(\n      activeCtx, reverse, {vocab: true, base: false}, localCtx, defined,\n      options);\n    if(!_isAbsoluteIri(id)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a @context @reverse value must be an ' +\n        'absolute IRI or a blank node identifier.',\n        'jsonld.SyntaxError', {code: 'invalid IRI mapping', context: localCtx});\n    }\n\n    mapping['@id'] = id;\n    mapping.reverse = true;\n  } else if('@id' in value) {\n    let id = value['@id'];\n    if(id && !_isString(id)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; a @context @id value must be an array ' +\n        'of strings or a string.',\n        'jsonld.SyntaxError', {code: 'invalid IRI mapping', context: localCtx});\n    }\n    if(id === null) {\n      // reserve a null term, which may be protected\n      mapping['@id'] = null;\n    } else if(!api.isKeyword(id) && id.match(KEYWORD_PATTERN)) {\n      // FIXME: remove logging and use a handler\n      console.warn('WARNING: values beginning with \"@\" are reserved' +\n        ' for future use and ignored', {id});\n      if(previousMapping) {\n        activeCtx.mappings.set(term, previousMapping);\n      } else {\n        activeCtx.mappings.delete(term);\n      }\n      return;\n    } else if(id !== term) {\n      // expand and add @id mapping\n      id = _expandIri(\n        activeCtx, id, {vocab: true, base: false}, localCtx, defined, options);\n      if(!_isAbsoluteIri(id) && !api.isKeyword(id)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; a @context @id value must be an ' +\n          'absolute IRI, a blank node identifier, or a keyword.',\n          'jsonld.SyntaxError',\n          {code: 'invalid IRI mapping', context: localCtx});\n      }\n\n      // if term has the form of an IRI it must map the same\n      if(term.match(/(?::[^:])|\\//)) {\n        const termDefined = new Map(defined).set(term, true);\n        const termIri = _expandIri(\n          activeCtx, term, {vocab: true, base: false},\n          localCtx, termDefined, options);\n        if(termIri !== id) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; term in form of IRI must ' +\n            'expand to definition.',\n            'jsonld.SyntaxError',\n            {code: 'invalid IRI mapping', context: localCtx});\n        }\n      }\n\n      mapping['@id'] = id;\n      // indicate if this term may be used as a compact IRI prefix\n      mapping._prefix = (simpleTerm &&\n        !mapping._termHasColon &&\n        id.match(/[:\\/\\?#\\[\\]@]$/));\n    }\n  }\n\n  if(!('@id' in mapping)) {\n    // see if the term has a prefix\n    if(mapping._termHasColon) {\n      const prefix = term.substr(0, colon);\n      if(localCtx.hasOwnProperty(prefix)) {\n        // define parent prefix\n        api.createTermDefinition({\n          activeCtx, localCtx, term: prefix, defined, options\n        });\n      }\n\n      if(activeCtx.mappings.has(prefix)) {\n        // set @id based on prefix parent\n        const suffix = term.substr(colon + 1);\n        mapping['@id'] = activeCtx.mappings.get(prefix)['@id'] + suffix;\n      } else {\n        // term is an absolute IRI\n        mapping['@id'] = term;\n      }\n    } else if(term === '@type') {\n      // Special case, were we've previously determined that container is @set\n      mapping['@id'] = term;\n    } else {\n      // non-IRIs *must* define @ids if @vocab is not available\n      if(!('@vocab' in activeCtx)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; @context terms must define an @id.',\n          'jsonld.SyntaxError',\n          {code: 'invalid IRI mapping', context: localCtx, term});\n      }\n      // prepend vocab to term\n      mapping['@id'] = activeCtx['@vocab'] + term;\n    }\n  }\n\n  // Handle term protection\n  if(value['@protected'] === true ||\n    (defined.get('@protected') === true && value['@protected'] !== false)) {\n    activeCtx.protected[term] = true;\n    mapping.protected = true;\n  }\n\n  // IRI mapping now defined\n  defined.set(term, true);\n\n  if('@type' in value) {\n    let type = value['@type'];\n    if(!_isString(type)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; an @context @type value must be a string.',\n        'jsonld.SyntaxError',\n        {code: 'invalid type mapping', context: localCtx});\n    }\n\n    if((type === '@json' || type === '@none')) {\n      if(api.processingMode(activeCtx, 1.0)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; an @context @type value must not be ' +\n          `\"${type}\" in JSON-LD 1.0 mode.`,\n          'jsonld.SyntaxError',\n          {code: 'invalid type mapping', context: localCtx});\n      }\n    } else if(type !== '@id' && type !== '@vocab') {\n      // expand @type to full IRI\n      type = _expandIri(\n        activeCtx, type, {vocab: true, base: false}, localCtx, defined,\n        options);\n      if(!_isAbsoluteIri(type)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; an @context @type value must be an ' +\n          'absolute IRI.',\n          'jsonld.SyntaxError',\n          {code: 'invalid type mapping', context: localCtx});\n      }\n      if(type.indexOf('_:') === 0) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; an @context @type value must be an IRI, ' +\n          'not a blank node identifier.',\n          'jsonld.SyntaxError',\n          {code: 'invalid type mapping', context: localCtx});\n      }\n    }\n\n    // add @type to mapping\n    mapping['@type'] = type;\n  }\n\n  if('@container' in value) {\n    // normalize container to an array form\n    const container = _isString(value['@container']) ?\n      [value['@container']] : (value['@container'] || []);\n    const validContainers = ['@list', '@set', '@index', '@language'];\n    let isValid = true;\n    const hasSet = container.includes('@set');\n\n    // JSON-LD 1.1 support\n    if(api.processingMode(activeCtx, 1.1)) {\n      validContainers.push('@graph', '@id', '@type');\n\n      // check container length\n      if(container.includes('@list')) {\n        if(container.length !== 1) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; @context @container with @list must ' +\n            'have no other values',\n            'jsonld.SyntaxError',\n            {code: 'invalid container mapping', context: localCtx});\n        }\n      } else if(container.includes('@graph')) {\n        if(container.some(key =>\n          key !== '@graph' && key !== '@id' && key !== '@index' &&\n          key !== '@set')) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; @context @container with @graph must ' +\n            'have no other values other than @id, @index, and @set',\n            'jsonld.SyntaxError',\n            {code: 'invalid container mapping', context: localCtx});\n        }\n      } else {\n        // otherwise, container may also include @set\n        isValid &= container.length <= (hasSet ? 2 : 1);\n      }\n\n      if(container.includes('@type')) {\n        // If mapping does not have an @type,\n        // set it to @id\n        mapping['@type'] = mapping['@type'] || '@id';\n\n        // type mapping must be either @id or @vocab\n        if(!['@id', '@vocab'].includes(mapping['@type'])) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; container: @type requires @type to be ' +\n            '@id or @vocab.',\n            'jsonld.SyntaxError',\n            {code: 'invalid type mapping', context: localCtx});\n        }\n      }\n    } else {\n      // in JSON-LD 1.0, container must not be an array (it must be a string,\n      // which is one of the validContainers)\n      isValid &= !_isArray(value['@container']);\n\n      // check container length\n      isValid &= container.length <= 1;\n    }\n\n    // check against valid containers\n    isValid &= container.every(c => validContainers.includes(c));\n\n    // @set not allowed with @list\n    isValid &= !(hasSet && container.includes('@list'));\n\n    if(!isValid) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context @container value must be ' +\n        'one of the following: ' + validContainers.join(', '),\n        'jsonld.SyntaxError',\n        {code: 'invalid container mapping', context: localCtx});\n    }\n\n    if(mapping.reverse &&\n      !container.every(c => ['@index', '@set'].includes(c))) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context @container value for a @reverse ' +\n        'type definition must be @index or @set.', 'jsonld.SyntaxError',\n        {code: 'invalid reverse property', context: localCtx});\n    }\n\n    // add @container to mapping\n    mapping['@container'] = container;\n  }\n\n  // property indexing\n  if('@index' in value) {\n    if(!('@container' in value) || !mapping['@container'].includes('@index')) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @index without @index in @container: ' +\n        `\"${value['@index']}\" on term \"${term}\".`, 'jsonld.SyntaxError',\n        {code: 'invalid term definition', context: localCtx});\n    }\n    if(!_isString(value['@index']) || value['@index'].indexOf('@') === 0) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @index must expand to an IRI: ' +\n        `\"${value['@index']}\" on term \"${term}\".`, 'jsonld.SyntaxError',\n        {code: 'invalid term definition', context: localCtx});\n    }\n    mapping['@index'] = value['@index'];\n  }\n\n  // scoped contexts\n  if('@context' in value) {\n    mapping['@context'] = value['@context'];\n  }\n\n  if('@language' in value && !('@type' in value)) {\n    let language = value['@language'];\n    if(language !== null && !_isString(language)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context @language value must be ' +\n        'a string or null.', 'jsonld.SyntaxError',\n        {code: 'invalid language mapping', context: localCtx});\n    }\n\n    // add @language to mapping\n    if(language !== null) {\n      language = language.toLowerCase();\n    }\n    mapping['@language'] = language;\n  }\n\n  // term may be used as a prefix\n  if('@prefix' in value) {\n    if(term.match(/:|\\//)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context @prefix used on a compact IRI term',\n        'jsonld.SyntaxError',\n        {code: 'invalid term definition', context: localCtx});\n    }\n    if(api.isKeyword(mapping['@id'])) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; keywords may not be used as prefixes',\n        'jsonld.SyntaxError',\n        {code: 'invalid term definition', context: localCtx});\n    }\n    if(typeof value['@prefix'] === 'boolean') {\n      mapping._prefix = value['@prefix'] === true;\n    } else {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context value for @prefix must be boolean',\n        'jsonld.SyntaxError',\n        {code: 'invalid @prefix value', context: localCtx});\n    }\n  }\n\n  if('@direction' in value) {\n    const direction = value['@direction'];\n    if(direction !== null && direction !== 'ltr' && direction !== 'rtl') {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @direction value must be ' +\n        'null, \"ltr\", or \"rtl\".',\n        'jsonld.SyntaxError',\n        {code: 'invalid base direction', context: localCtx});\n    }\n    mapping['@direction'] = direction;\n  }\n\n  if('@nest' in value) {\n    const nest = value['@nest'];\n    if(!_isString(nest) || (nest !== '@nest' && nest.indexOf('@') === 0)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; @context @nest value must be ' +\n        'a string which is not a keyword other than @nest.',\n        'jsonld.SyntaxError',\n        {code: 'invalid @nest value', context: localCtx});\n    }\n    mapping['@nest'] = nest;\n  }\n\n  // disallow aliasing @context and @preserve\n  const id = mapping['@id'];\n  if(id === '@context' || id === '@preserve') {\n    throw new JsonLdError(\n      'Invalid JSON-LD syntax; @context and @preserve cannot be aliased.',\n      'jsonld.SyntaxError', {code: 'invalid keyword alias', context: localCtx});\n  }\n\n  // Check for overriding protected terms\n  if(previousMapping && previousMapping.protected && !overrideProtected) {\n    // force new term to continue to be protected and see if the mappings would\n    // be equal\n    activeCtx.protected[term] = true;\n    mapping.protected = true;\n    if(!_deepCompare(previousMapping, mapping)) {\n      const protectedMode = (options && options.protectedMode) || 'error';\n      if(protectedMode === 'error') {\n        throw new JsonLdError(\n          `Invalid JSON-LD syntax; tried to redefine \"${term}\" which is a ` +\n          'protected term.',\n          'jsonld.SyntaxError',\n          {code: 'protected term redefinition', context: localCtx, term});\n      } else if(protectedMode === 'warn') {\n        // FIXME: remove logging and use a handler\n        console.warn('WARNING: protected term redefinition', {term});\n        return;\n      }\n      throw new JsonLdError(\n        'Invalid protectedMode.',\n        'jsonld.SyntaxError',\n        {code: 'invalid protected mode', context: localCtx, term,\n          protectedMode});\n    }\n  }\n};\n\n/**\n * Expands a string to a full IRI. The string may be a term, a prefix, a\n * relative IRI, or an absolute IRI. The associated absolute IRI will be\n * returned.\n *\n * @param activeCtx the current active context.\n * @param value the string to expand.\n * @param relativeTo options for how to resolve relative IRIs:\n *          base: true to resolve against the base IRI, false not to.\n *          vocab: true to concatenate after @vocab, false not to.\n * @param {Object} [options] - processing options.\n *\n * @return the expanded value.\n */\napi.expandIri = (activeCtx, value, relativeTo, options) => {\n  return _expandIri(activeCtx, value, relativeTo, undefined, undefined,\n    options);\n};\n\n/**\n * Expands a string to a full IRI. The string may be a term, a prefix, a\n * relative IRI, or an absolute IRI. The associated absolute IRI will be\n * returned.\n *\n * @param activeCtx the current active context.\n * @param value the string to expand.\n * @param relativeTo options for how to resolve relative IRIs:\n *          base: true to resolve against the base IRI, false not to.\n *          vocab: true to concatenate after @vocab, false not to.\n * @param localCtx the local context being processed (only given if called\n *          during context processing).\n * @param defined a map for tracking cycles in context definitions (only given\n *          if called during context processing).\n * @param {Object} [options] - processing options.\n *\n * @return the expanded value.\n */\nfunction _expandIri(activeCtx, value, relativeTo, localCtx, defined, options) {\n  // already expanded\n  if(value === null || !_isString(value) || api.isKeyword(value)) {\n    return value;\n  }\n\n  // ignore non-keyword things that look like a keyword\n  if(value.match(KEYWORD_PATTERN)) {\n    return null;\n  }\n\n  // define term dependency if not defined\n  if(localCtx && localCtx.hasOwnProperty(value) &&\n    defined.get(value) !== true) {\n    api.createTermDefinition({\n      activeCtx, localCtx, term: value, defined, options\n    });\n  }\n\n  relativeTo = relativeTo || {};\n  if(relativeTo.vocab) {\n    const mapping = activeCtx.mappings.get(value);\n\n    // value is explicitly ignored with a null mapping\n    if(mapping === null) {\n      return null;\n    }\n\n    if(_isObject(mapping) && '@id' in mapping) {\n      // value is a term\n      return mapping['@id'];\n    }\n  }\n\n  // split value into prefix:suffix\n  const colon = value.indexOf(':');\n  if(colon > 0) {\n    const prefix = value.substr(0, colon);\n    const suffix = value.substr(colon + 1);\n\n    // do not expand blank nodes (prefix of '_') or already-absolute\n    // IRIs (suffix of '//')\n    if(prefix === '_' || suffix.indexOf('//') === 0) {\n      return value;\n    }\n\n    // prefix dependency not defined, define it\n    if(localCtx && localCtx.hasOwnProperty(prefix)) {\n      api.createTermDefinition({\n        activeCtx, localCtx, term: prefix, defined, options\n      });\n    }\n\n    // use mapping if prefix is defined\n    const mapping = activeCtx.mappings.get(prefix);\n    if(mapping && mapping._prefix) {\n      return mapping['@id'] + suffix;\n    }\n\n    // already absolute IRI\n    if(_isAbsoluteIri(value)) {\n      return value;\n    }\n  }\n\n  // prepend vocab\n  if(relativeTo.vocab && '@vocab' in activeCtx) {\n    return activeCtx['@vocab'] + value;\n  }\n\n  // prepend base\n  if(relativeTo.base && '@base' in activeCtx) {\n    if(activeCtx['@base']) {\n      // The null case preserves value as potentially relative\n      return prependBase(prependBase(options.base, activeCtx['@base']), value);\n    }\n  } else if(relativeTo.base) {\n    return prependBase(options.base, value);\n  }\n\n  return value;\n}\n\n/**\n * Gets the initial context.\n *\n * @param options the options to use:\n *          [base] the document base IRI.\n *\n * @return the initial context.\n */\napi.getInitialContext = options => {\n  const key = JSON.stringify({processingMode: options.processingMode});\n  const cached = INITIAL_CONTEXT_CACHE.get(key);\n  if(cached) {\n    return cached;\n  }\n\n  const initialContext = {\n    processingMode: options.processingMode,\n    mappings: new Map(),\n    inverse: null,\n    getInverse: _createInverseContext,\n    clone: _cloneActiveContext,\n    revertToPreviousContext: _revertToPreviousContext,\n    protected: {}\n  };\n  // TODO: consider using LRU cache instead\n  if(INITIAL_CONTEXT_CACHE.size === INITIAL_CONTEXT_CACHE_MAX_SIZE) {\n    // clear whole cache -- assumes scenario where the cache fills means\n    // the cache isn't being used very efficiently anyway\n    INITIAL_CONTEXT_CACHE.clear();\n  }\n  INITIAL_CONTEXT_CACHE.set(key, initialContext);\n  return initialContext;\n\n  /**\n   * Generates an inverse context for use in the compaction algorithm, if\n   * not already generated for the given active context.\n   *\n   * @return the inverse context.\n   */\n  function _createInverseContext() {\n    const activeCtx = this;\n\n    // lazily create inverse\n    if(activeCtx.inverse) {\n      return activeCtx.inverse;\n    }\n    const inverse = activeCtx.inverse = {};\n\n    // variables for building fast CURIE map\n    const fastCurieMap = activeCtx.fastCurieMap = {};\n    const irisToTerms = {};\n\n    // handle default language\n    const defaultLanguage = (activeCtx['@language'] || '@none').toLowerCase();\n\n    // handle default direction\n    const defaultDirection = activeCtx['@direction'];\n\n    // create term selections for each mapping in the context, ordered by\n    // shortest and then lexicographically least\n    const mappings = activeCtx.mappings;\n    const terms = [...mappings.keys()].sort(_compareShortestLeast);\n    for(const term of terms) {\n      const mapping = mappings.get(term);\n      if(mapping === null) {\n        continue;\n      }\n\n      let container = mapping['@container'] || '@none';\n      container = [].concat(container).sort().join('');\n\n      if(mapping['@id'] === null) {\n        continue;\n      }\n      // iterate over every IRI in the mapping\n      const ids = _asArray(mapping['@id']);\n      for(const iri of ids) {\n        let entry = inverse[iri];\n        const isKeyword = api.isKeyword(iri);\n\n        if(!entry) {\n          // initialize entry\n          inverse[iri] = entry = {};\n\n          if(!isKeyword && !mapping._termHasColon) {\n            // init IRI to term map and fast CURIE prefixes\n            irisToTerms[iri] = [term];\n            const fastCurieEntry = {iri, terms: irisToTerms[iri]};\n            if(iri[0] in fastCurieMap) {\n              fastCurieMap[iri[0]].push(fastCurieEntry);\n            } else {\n              fastCurieMap[iri[0]] = [fastCurieEntry];\n            }\n          }\n        } else if(!isKeyword && !mapping._termHasColon) {\n          // add IRI to term match\n          irisToTerms[iri].push(term);\n        }\n\n        // add new entry\n        if(!entry[container]) {\n          entry[container] = {\n            '@language': {},\n            '@type': {},\n            '@any': {}\n          };\n        }\n        entry = entry[container];\n        _addPreferredTerm(term, entry['@any'], '@none');\n\n        if(mapping.reverse) {\n          // term is preferred for values using @reverse\n          _addPreferredTerm(term, entry['@type'], '@reverse');\n        } else if(mapping['@type'] === '@none') {\n          _addPreferredTerm(term, entry['@any'], '@none');\n          _addPreferredTerm(term, entry['@language'], '@none');\n          _addPreferredTerm(term, entry['@type'], '@none');\n        } else if('@type' in mapping) {\n          // term is preferred for values using specific type\n          _addPreferredTerm(term, entry['@type'], mapping['@type']);\n        } else if('@language' in mapping && '@direction' in mapping) {\n          // term is preferred for values using specific language and direction\n          const language = mapping['@language'];\n          const direction = mapping['@direction'];\n          if(language && direction) {\n            _addPreferredTerm(term, entry['@language'],\n              `${language}_${direction}`.toLowerCase());\n          } else if(language) {\n            _addPreferredTerm(term, entry['@language'], language.toLowerCase());\n          } else if(direction) {\n            _addPreferredTerm(term, entry['@language'], `_${direction}`);\n          } else {\n            _addPreferredTerm(term, entry['@language'], '@null');\n          }\n        } else if('@language' in mapping) {\n          _addPreferredTerm(term, entry['@language'],\n            (mapping['@language'] || '@null').toLowerCase());\n        } else if('@direction' in mapping) {\n          if(mapping['@direction']) {\n            _addPreferredTerm(term, entry['@language'],\n              `_${mapping['@direction']}`);\n          } else {\n            _addPreferredTerm(term, entry['@language'], '@none');\n          }\n        } else if(defaultDirection) {\n          _addPreferredTerm(term, entry['@language'], `_${defaultDirection}`);\n          _addPreferredTerm(term, entry['@language'], '@none');\n          _addPreferredTerm(term, entry['@type'], '@none');\n        } else {\n          // add entries for no type and no language\n          _addPreferredTerm(term, entry['@language'], defaultLanguage);\n          _addPreferredTerm(term, entry['@language'], '@none');\n          _addPreferredTerm(term, entry['@type'], '@none');\n        }\n      }\n    }\n\n    // build fast CURIE map\n    for(const key in fastCurieMap) {\n      _buildIriMap(fastCurieMap, key, 1);\n    }\n\n    return inverse;\n  }\n\n  /**\n   * Runs a recursive algorithm to build a lookup map for quickly finding\n   * potential CURIEs.\n   *\n   * @param iriMap the map to build.\n   * @param key the current key in the map to work on.\n   * @param idx the index into the IRI to compare.\n   */\n  function _buildIriMap(iriMap, key, idx) {\n    const entries = iriMap[key];\n    const next = iriMap[key] = {};\n\n    let iri;\n    let letter;\n    for(const entry of entries) {\n      iri = entry.iri;\n      if(idx >= iri.length) {\n        letter = '';\n      } else {\n        letter = iri[idx];\n      }\n      if(letter in next) {\n        next[letter].push(entry);\n      } else {\n        next[letter] = [entry];\n      }\n    }\n\n    for(const key in next) {\n      if(key === '') {\n        continue;\n      }\n      _buildIriMap(next, key, idx + 1);\n    }\n  }\n\n  /**\n   * Adds the term for the given entry if not already added.\n   *\n   * @param term the term to add.\n   * @param entry the inverse context typeOrLanguage entry to add to.\n   * @param typeOrLanguageValue the key in the entry to add to.\n   */\n  function _addPreferredTerm(term, entry, typeOrLanguageValue) {\n    if(!entry.hasOwnProperty(typeOrLanguageValue)) {\n      entry[typeOrLanguageValue] = term;\n    }\n  }\n\n  /**\n   * Clones an active context, creating a child active context.\n   *\n   * @return a clone (child) of the active context.\n   */\n  function _cloneActiveContext() {\n    const child = {};\n    child.mappings = util.clone(this.mappings);\n    child.clone = this.clone;\n    child.inverse = null;\n    child.getInverse = this.getInverse;\n    child.protected = util.clone(this.protected);\n    if(this.previousContext) {\n      child.previousContext = this.previousContext.clone();\n    }\n    child.revertToPreviousContext = this.revertToPreviousContext;\n    if('@base' in this) {\n      child['@base'] = this['@base'];\n    }\n    if('@language' in this) {\n      child['@language'] = this['@language'];\n    }\n    if('@vocab' in this) {\n      child['@vocab'] = this['@vocab'];\n    }\n    return child;\n  }\n\n  /**\n   * Reverts any type-scoped context in this active context to the previous\n   * context.\n   */\n  function _revertToPreviousContext() {\n    if(!this.previousContext) {\n      return this;\n    }\n    return this.previousContext.clone();\n  }\n};\n\n/**\n * Gets the value for the given active context key and type, null if none is\n * set or undefined if none is set and type is '@context'.\n *\n * @param ctx the active context.\n * @param key the context key.\n * @param [type] the type of value to get (eg: '@id', '@type'), if not\n *          specified gets the entire entry for a key, null if not found.\n *\n * @return the value, null, or undefined.\n */\napi.getContextValue = (ctx, key, type) => {\n  // invalid key\n  if(key === null) {\n    if(type === '@context') {\n      return undefined;\n    }\n    return null;\n  }\n\n  // get specific entry information\n  if(ctx.mappings.has(key)) {\n    const entry = ctx.mappings.get(key);\n\n    if(_isUndefined(type)) {\n      // return whole entry\n      return entry;\n    }\n    if(entry.hasOwnProperty(type)) {\n      // return entry value for type\n      return entry[type];\n    }\n  }\n\n  // get default language\n  if(type === '@language' && type in ctx) {\n    return ctx[type];\n  }\n\n  // get default direction\n  if(type === '@direction' && type in ctx) {\n    return ctx[type];\n  }\n\n  if(type === '@context') {\n    return undefined;\n  }\n  return null;\n};\n\n/**\n * Processing Mode check.\n *\n * @param activeCtx the current active context.\n * @param version the string or numeric version to check.\n *\n * @return boolean.\n */\napi.processingMode = (activeCtx, version) => {\n  if(version.toString() >= '1.1') {\n    return !activeCtx.processingMode ||\n      activeCtx.processingMode >= 'json-ld-' + version.toString();\n  } else {\n    return activeCtx.processingMode === 'json-ld-1.0';\n  }\n};\n\n/**\n * Returns whether or not the given value is a keyword.\n *\n * @param v the value to check.\n *\n * @return true if the value is a keyword, false if not.\n */\napi.isKeyword = v => {\n  if(!_isString(v) || v[0] !== '@') {\n    return false;\n  }\n  switch(v) {\n    case '@base':\n    case '@container':\n    case '@context':\n    case '@default':\n    case '@direction':\n    case '@embed':\n    case '@explicit':\n    case '@graph':\n    case '@id':\n    case '@included':\n    case '@index':\n    case '@json':\n    case '@language':\n    case '@list':\n    case '@nest':\n    case '@none':\n    case '@omitDefault':\n    case '@prefix':\n    case '@preserve':\n    case '@protected':\n    case '@requireAll':\n    case '@reverse':\n    case '@set':\n    case '@type':\n    case '@value':\n    case '@version':\n    case '@vocab':\n      return true;\n  }\n  return false;\n};\n\nfunction _deepCompare(x1, x2) {\n  // compare `null` or primitive types directly\n  if((!(x1 && typeof x1 === 'object')) ||\n     (!(x2 && typeof x2 === 'object'))) {\n    return x1 === x2;\n  }\n  // x1 and x2 are objects (also potentially arrays)\n  const x1Array = Array.isArray(x1);\n  if(x1Array !== Array.isArray(x2)) {\n    return false;\n  }\n  if(x1Array) {\n    if(x1.length !== x2.length) {\n      return false;\n    }\n    for(let i = 0; i < x1.length; ++i) {\n      if(!_deepCompare(x1[i], x2[i])) {\n        return false;\n      }\n    }\n    return true;\n  }\n  // x1 and x2 are non-array objects\n  const k1s = Object.keys(x1);\n  const k2s = Object.keys(x2);\n  if(k1s.length !== k2s.length) {\n    return false;\n  }\n  for(const k1 in x1) {\n    let v1 = x1[k1];\n    let v2 = x2[k1];\n    // special case: `@container` can be in any order\n    if(k1 === '@container') {\n      if(Array.isArray(v1) && Array.isArray(v2)) {\n        v1 = v1.slice().sort();\n        v2 = v2.slice().sort();\n      }\n    }\n    if(!_deepCompare(v1, v2)) {\n      return false;\n    }\n  }\n  return true;\n}\n","/* global $SolidTestEnvironment */\n/**\n *\n * Project: rdflib.js\n *\n * @file: fetcher.js\n *\n * Description: contains functions for requesting/fetching/retracting\n *  This implements quite a lot of the web architecture.\n * A fetcher is bound to a specific quad store, into which\n * it loads stuff and into which it writes its metadata\n * @@ The metadata could be optionally a separate graph\n *\n * - implements semantics of HTTP headers, Internet Content Types\n * - selects parsers for rdf/xml, n3, rdfa, grddl\n *\n * TO do:\n * - Implement a runtime registry for parsers and serializers\n * -\n */\n\n/**\n * Things to test: callbacks on request, refresh, retract\n *   loading from HTTP, HTTPS, FTP, FILE, others?\n * To do:\n * Firing up a mail client for mid:  (message:) URLs\n */\nimport IndexedFormula from './store'\nimport log from './log'\nimport N3Parser from './n3parser'\nimport RDFlibNamedNode from './named-node'\nimport Namespace from './namespace'\nimport rdfParse from './parse'\nimport { parseRDFaDOM } from './rdfaparser'\nimport RDFParser from './rdfxmlparser'\nimport * as Uri from './uri'\nimport { isCollection, isNamedNode} from './utils/terms'\nimport * as Util from './utils-js'\nimport serialize from './serialize'\nimport crossFetch, { Headers } from 'cross-fetch'\n\nimport {\n  ContentType, TurtleContentType, RDFXMLContentType, XHTMLContentType\n} from './types'\nimport { termValue } from './utils/termValue'\nimport {\n  BlankNode,\n  RdfJsDataFactory,\n  Quad_Graph,\n  NamedNode,\n  Quad_Predicate,\n  Quad_Subject\n} from './tf-types'\nimport jsonldParser from './jsonldparser'\n\nconst Parsable = {\n  'text/n3': true,\n  'text/turtle': true,\n  'application/rdf+xml': true,\n  'application/xhtml+xml': true,\n  'text/html': true,\n  'application/ld+json': true\n}\n\n// This is a minimal set to allow the use of damaged servers if necessary\nconst CONTENT_TYPE_BY_EXT = {\n  'rdf': RDFXMLContentType,\n  'owl': RDFXMLContentType,\n  'n3': 'text/n3',\n  'ttl': 'text/turtle',\n  'nt': 'text/n3',\n  'acl': 'text/n3',\n  'html': 'text/html',\n  'xml': 'text/xml'\n}\n\n// Convenience namespaces needed in this module.\n// These are deliberately not exported as the user application should\n// make its own list and not rely on the prefixes used here,\n// and not be tempted to add to them, and them clash with those of another\n// application.\nconst getNS = (factory?: RdfJsDataFactory) => {\n  return {\n    link: Namespace('http://www.w3.org/2007/ont/link#', factory),\n    http: Namespace('http://www.w3.org/2007/ont/http#', factory),\n    httph: Namespace('http://www.w3.org/2007/ont/httph#', factory),  // headers\n    rdf: Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#', factory),\n    rdfs: Namespace('http://www.w3.org/2000/01/rdf-schema#', factory),\n    dc: Namespace('http://purl.org/dc/elements/1.1/', factory),\n    ldp: Namespace('http://www.w3.org/ns/ldp#', factory)\n  }\n}\nconst ns = getNS()\n\nexport interface FetchError extends Error {\n  statusText?: string\n  status?: StatusValues\n  response?: ExtendedResponse\n}\n\n/** An extended interface of Response, since RDFlib.js adds some properties. */\nexport interface ExtendedResponse extends Response {\n  /** String representation of the Body */\n  responseText?: string\n  /** Identifier of the reqest */\n  req?: Quad_Subject\n  size?: number\n  timeout?: number\n  /** Used in UpdateManager.updateDav */\n  error?: string\n}\n\n/** tell typescript that a 'panes' child may exist on Window */\ndeclare global {\n  interface Window {\n    panes?: any\n    solidFetcher?: any\n    solidFetch?: any\n  }\n  var solidFetcher: Function\n  var solidFetch: Function\n}\ndeclare var $SolidTestEnvironment: {\n  localSiteMap?: any\n}\n\ntype UserCallback = (\n  ok: boolean,\n  message: string,\n  response?: any\n) => void\n\ntype HTTPMethods = 'GET' | 'PUT' | 'POST' | 'PATCH' | 'HEAD' | 'DELETE' | 'CONNECT' | 'TRACE' | 'OPTIONS'\n\n/** All valid inputs for initFetchOptions */\ntype Options = Partial<AutoInitOptions>\n\n/** Initiated by initFetchOptions, which runs on load */\nexport interface AutoInitOptions extends RequestInit{\n  /** The used Fetch function */\n  fetch?: Fetch\n  /**\n   * Referring term, the resource which\n   * referred to this (for tracking bad links).\n   * The document in which this link was found.\n   */\n  referringTerm?: NamedNode\n  /** Provided content type (for writes) */\n  contentType?: string\n  /**\n   * Override the incoming header to\n   * force the data to be treated as this content-type (for reads)\n   */\n  forceContentType?: ContentType\n  /**\n   * Load the data even if loaded before.\n   * Also sets the `Cache-Control:` header to `no-cache`\n   */\n  force?: boolean\n  /**\n   * Original uri to preserve\n   * through proxying etc (`xhr.original`).\n   */\n  baseURI: string\n  /**\n   * Whether this request is a retry via\n   * a proxy (generally done from an error handler)\n   */\n  proxyUsed?: boolean\n  actualProxyURI?: string\n  /** flag for XHR/CORS etc */\n  withCredentials?: boolean\n  /** Before we parse new data, clear old, but only on status 200 responses */\n  clearPreviousData?: boolean\n  /** Prevents the addition of various metadata triples (about the fetch request) to the store*/\n  noMeta?: boolean\n  noRDFa?: boolean\n  handlers?: Handler[]\n  timeout?: number\n  method?: HTTPMethods\n  retriedWithNoCredentials?: boolean\n  requestedURI?: string\n  // Seems to be required in some functions, such as XHTML parse and RedirectToProxy\n  resource: Quad_Subject\n  /** The serialized resource in the body*/\n  // Used for storing metadata of requests\n  original: NamedNode\n  // Like requeststatus? Can contain text with error.\n  data?: string\n  // Probably an identifier for request?s\n  req: BlankNode\n  // Might be the same as Options.data\n  body?: string\n  headers: HeadersInit\n  credentials?: 'include' | 'omit'\n}\n\nclass Handler {\n  // TODO: Document, type\n  response: ExtendedResponse\n  // TODO: Document, type\n  dom: Document\n  static pattern: RegExp\n\n  constructor (response: ExtendedResponse, dom?: Document) {\n    this.response = response\n    // The type assertion operator here might need to be removed.\n    this.dom = dom!\n  }\n}\n\nclass RDFXMLHandler extends Handler {\n  static toString () {\n    return 'RDFXMLHandler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes[RDFXMLContentType] = {\n      'q': 0.9\n    }\n  }\n\n  parse (\n    fetcher: Fetcher,\n    /** An XML String */\n    responseText: String,\n    /** Requires .original */\n    options: {\n      original: Quad_Subject\n      req: Quad_Subject\n    } & Options,\n  ) {\n    let kb = fetcher.store\n    if (!this.dom) {\n      this.dom = Util.parseXML(responseText)\n    }\n    let root = this.dom.documentElement\n    if (root.nodeName === 'parsererror') { // Mozilla only See issue/issue110\n      // have to fail the request\n      return fetcher.failFetch(options, 'Badly formed XML in ' +\n        options.resource!.value, 'parse_error')\n    }\n    let parser = new RDFParser(kb)\n    try {\n      parser.parse(this.dom, options.original.value, options.original)\n    } catch (err) {\n      return fetcher.failFetch(options, 'Syntax error parsing RDF/XML! ' + err,\n        'parse_error')\n    }\n    if (!options.noMeta) {\n      kb.add(options.original, ns.rdf('type'), ns.link('RDFDocument'), fetcher.appNode)\n    }\n\n    return fetcher.doneFetch(options, this.response)\n  }\n}\nRDFXMLHandler.pattern = new RegExp('application/rdf\\\\+xml')\n\nclass XHTMLHandler extends Handler {\n  static toString () {\n    return 'XHTMLHandler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes[XHTMLContentType] = {}\n  }\n\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      resource: Quad_Subject\n      original: Quad_Subject\n    } & Options,\n  ): Promise<FetchError> | ExtendedResponse {\n    let relation, reverse: boolean\n    if (!this.dom) {\n      this.dom = Util.parseXML(responseText)\n    }\n    let kb = fetcher.store\n\n    // dc:title\n    let title = this.dom.getElementsByTagName('title')\n    if (title.length > 0) {\n      kb.add(options.resource, ns.dc('title'), kb.rdfFactory.literal(title[0].textContent as string),\n        options.resource)\n      // log.info(\"Inferring title of \" + xhr.resource)\n    }\n\n    // link rel\n    let links = this.dom.getElementsByTagName('link')\n    for (let x = links.length - 1; x >= 0; x--) { // @@ rev\n      relation = links[x].getAttribute('rel')\n      reverse = false\n      if (!relation) {\n        relation = links[x].getAttribute('rev')\n        reverse = true\n      }\n      if (relation) {\n        fetcher.linkData(options.original, relation,\n          links[x].getAttribute('href') as string, options.resource, reverse)\n      }\n    }\n\n    // Data Islands\n    let scripts = this.dom.getElementsByTagName('script')\n    for (let i = 0; i < scripts.length; i++) {\n      let contentType = scripts[i].getAttribute('type')\n      if (Parsable[contentType!]) {\n        // @ts-ignore incompatibility between Store.add and Formula.add\n        rdfParse(scripts[i].textContent as string, kb, options.original.value, contentType)\n        // @ts-ignore incompatibility between Store.add and Formula.add\n        rdfParse(scripts[i].textContent as string, kb, options.original.value, contentType)\n      }\n    }\n\n    if (!options.noMeta) {\n      kb.add(options.resource, ns.rdf('type'), ns.link('WebPage'), fetcher.appNode)\n    }\n\n    if (!options.noRDFa && parseRDFaDOM) { // enable by default\n      try {\n        parseRDFaDOM(this.dom, kb, options.original.value)\n      } catch (err) {\n        // @ts-ignore\n        let msg = 'Error trying to parse ' + options.resource + ' as RDFa:\\n' + err + ':\\n' + err.stack\n        return fetcher.failFetch(options as AutoInitOptions, msg, 'parse_error')\n      }\n    }\n\n    return fetcher.doneFetch(options as AutoInitOptions, this.response)\n  }\n}\nXHTMLHandler.pattern = new RegExp('application/xhtml')\n\nclass XMLHandler extends Handler {\n  static toString () {\n    return 'XMLHandler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes['text/xml'] = { 'q': 0.5 }\n    fetcher.mediatypes['application/xml'] = { 'q': 0.5 }\n  }\n\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      original: Quad_Subject\n      req: BlankNode\n      resource: Quad_Subject\n    } & Options,\n  ): ExtendedResponse | Promise<FetchError> {\n    let dom = Util.parseXML(responseText)\n\n    // XML Semantics defined by root element namespace\n    // figure out the root element\n    for (let c = 0; c < dom.childNodes.length; c++) {\n      // is this node an element?\n      if (dom.childNodes[c].nodeType === 1) {\n        // We've found the first element, it's the root\n        let ns = dom.childNodes[c].namespaceURI\n\n        // Is it RDF/XML?\n        if (ns && ns === ns['rdf']) {\n          fetcher.addStatus(options.req,\n            'Has XML root element in the RDF namespace, so assume RDF/XML.')\n\n          let rdfHandler = new RDFXMLHandler(this.response, dom)\n          return rdfHandler.parse(fetcher, responseText, options)\n        }\n\n        break\n      }\n    }\n\n    // Or it could be XHTML?\n    // Maybe it has an XHTML DOCTYPE?\n    if (dom.doctype) {\n      // log.info(\"We found a DOCTYPE in \" + xhr.resource)\n      if (dom.doctype.name === 'html' &&\n          dom.doctype.publicId.match(/^-\\/\\/W3C\\/\\/DTD XHTML/) &&\n          dom.doctype.systemId.match(/http:\\/\\/www.w3.org\\/TR\\/xhtml/)) {\n        fetcher.addStatus(options.req,\n          'Has XHTML DOCTYPE. Switching to XHTML Handler.\\n')\n\n        let xhtmlHandler = new XHTMLHandler(this.response, dom)\n        return xhtmlHandler.parse(fetcher, responseText, options)\n      }\n    }\n\n    // Or what about an XHTML namespace?\n    let html = dom.getElementsByTagName('html')[0]\n    if (html) {\n      let xmlns = html.getAttribute('xmlns')\n      if (xmlns && xmlns.match(/^http:\\/\\/www.w3.org\\/1999\\/xhtml/)) {\n        fetcher.addStatus(options.req,\n          'Has a default namespace for ' + 'XHTML. Switching to XHTMLHandler.\\n')\n\n        let xhtmlHandler = new XHTMLHandler(this.response, dom)\n        return xhtmlHandler.parse(fetcher, responseText, options)\n      }\n    }\n\n    // At this point we should check the namespace document (cache it!) and\n    // look for a GRDDL transform\n    // @@  Get namespace document <n>, parse it, look for  <n> grddl:namespaceTransform ?y\n    // Apply ?y to   dom\n    // We give up. What dialect is this?\n    return fetcher.failFetch(options,\n      'Unsupported dialect of XML: not RDF or XHTML namespace, etc.\\n' +\n      responseText.slice(0, 80), 901)\n  }\n}\nXMLHandler.pattern = new RegExp('(text|application)/(.*)xml')\n\nclass HTMLHandler extends Handler {\n  static toString () {\n    return 'HTMLHandler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes['text/html'] = {\n      'q': 0.9\n    }\n  }\n\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      req: BlankNode,\n      resource: Quad_Subject,\n      original: Quad_Subject,\n    } & Options\n  ): Promise<FetchError> | ExtendedResponse {\n    let kb = fetcher.store\n\n    // We only handle XHTML so we have to figure out if this is XML\n    // log.info(\"Sniffing HTML \" + xhr.resource + \" for XHTML.\")\n    if (isXML(responseText)) {\n      fetcher.addStatus(options.req, \"Has an XML declaration. We'll assume \" +\n        \"it's XHTML as the content-type was text/html.\\n\")\n\n      let xhtmlHandler = new XHTMLHandler(this.response)\n      return xhtmlHandler.parse(fetcher, responseText, options)\n    }\n\n    // DOCTYPE html\n    if (isXHTML(responseText)) {\n      fetcher.addStatus(options.req,\n        'Has XHTML DOCTYPE. Switching to XHTMLHandler.\\n')\n\n      let xhtmlHandler = new XHTMLHandler(this.response)\n      return xhtmlHandler.parse(fetcher, responseText, options)\n    }\n\n    // xmlns\n    if (isXMLNS(responseText)) {\n      fetcher.addStatus(options.req,\n        'Has default namespace for XHTML, so switching to XHTMLHandler.\\n')\n\n      let xhtmlHandler = new XHTMLHandler(this.response)\n      return xhtmlHandler.parse(fetcher, responseText, options)\n    }\n\n    // dc:title\n    // no need to escape '/' here\n    let titleMatch = (new RegExp('<title>([\\\\s\\\\S]+?)</title>', 'im')).exec(responseText)\n    if (titleMatch) {\n      kb.add(options.resource, ns.dc('title'), kb.rdfFactory.literal(titleMatch[1]),\n        options.resource) // think about xml:lang later\n    }\n    kb.add(options.resource, ns.rdf('type'), ns.link('WebPage'), fetcher.appNode)\n    fetcher.addStatus(options.req, 'non-XML HTML document, not parsed for data.')\n\n    return fetcher.doneFetch(options, this.response)\n  }\n}\nHTMLHandler.pattern = new RegExp('text/html')\n\nclass JsonLdHandler extends Handler {\n  static toString () {\n    return 'JsonLdHandler'\n  }\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes['application/ld+json'] = {\n      'q': 0.9\n    }\n  }\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      req: Quad_Subject\n      original: Quad_Subject\n      resource: Quad_Subject\n    } & Options,\n    response: ExtendedResponse\n  ): Promise<ExtendedResponse | FetchError> {\n    const kb = fetcher.store\n    return new Promise((resolve, reject) => {\n      try {\n        jsonldParser (responseText, kb, options.original.value, () => {\n          resolve(fetcher.doneFetch(options, response))\n        })\n      } catch (err) {\n        const msg = 'Error trying to parse ' + options.resource +\n          ' as JSON-LD:\\n' + err  // not err.stack -- irrelevant\n        resolve(fetcher.failFetch(options, msg, 'parse_error', response))\n      }\n    })\n  }\n}\nJsonLdHandler.pattern = /application\\/ld\\+json/\n\nclass TextHandler extends Handler {\n  static toString () {\n    return 'TextHandler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes['text/plain'] = {\n      'q': 0.5\n    }\n  }\n\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      req: Quad_Subject\n      original: Quad_Subject\n      resource: Quad_Subject\n    } & Options\n  ): ExtendedResponse | Promise<FetchError> {\n    // We only speak dialects of XML right now. Is this XML?\n\n    // Look for an XML declaration\n    if (isXML(responseText)) {\n      fetcher.addStatus(options.req, 'Warning: ' + options.resource +\n        \" has an XML declaration. We'll assume \" +\n        \"it's XML but its content-type wasn't XML.\\n\")\n\n      let xmlHandler = new XMLHandler(this.response)\n      return xmlHandler.parse(fetcher, responseText, options)\n    }\n\n    // Look for an XML declaration\n    if (responseText.slice(0, 500).match(/xmlns:/)) {\n      fetcher.addStatus(options.req, \"May have an XML namespace. We'll assume \" +\n        \"it's XML but its content-type wasn't XML.\\n\")\n\n      let xmlHandler = new XMLHandler(this.response)\n      return xmlHandler.parse(fetcher, responseText, options)\n    }\n\n    // We give up finding semantics - this is not an error, just no data\n    fetcher.addStatus(options.req, 'Plain text document, no known RDF semantics.')\n\n    return fetcher.doneFetch(options, this.response)\n  }\n}\nTextHandler.pattern = new RegExp('text/plain')\n\nclass N3Handler extends Handler {\n  static toString () {\n    return 'N3Handler'\n  }\n\n  static register (fetcher: Fetcher) {\n    fetcher.mediatypes['text/n3'] = {\n      'q': '1.0'\n    } // as per 2008 spec\n    /*\n     fetcher.mediatypes['application/x-turtle'] = {\n     'q': 1.0\n     } // pre 2008\n     */\n    fetcher.mediatypes['text/turtle'] = {\n      'q': 1.0\n    } // post 2008\n  }\n\n  parse (\n    fetcher: Fetcher,\n    responseText: string,\n    options: {\n      original: NamedNode\n      req: Quad_Subject\n    } & Options,\n    response: ExtendedResponse\n  ): ExtendedResponse | Promise<FetchError> {\n    // Parse the text of this N3 file\n    let kb = fetcher.store\n    let p = N3Parser(kb, kb, options.original.value, options.original.value,\n      null, null, '', null)\n    //                p.loadBuf(xhr.responseText)\n    try {\n      p.loadBuf(responseText)\n    } catch (err) {\n      let msg = 'Error trying to parse ' + options.resource +\n        ' as Notation3:\\n' + err  // not err.stack -- irrelevant\n      return fetcher.failFetch(options, msg, 'parse_error', response)\n    }\n\n    fetcher.addStatus(options.req, 'N3 parsed: ' + p.statementCount + ' triples in ' + p.lines + ' lines.')\n    fetcher.store.add(options.original, ns.rdf('type'), ns.link('RDFDocument'), fetcher.appNode)\n\n    return fetcher.doneFetch(options, this.response)\n  }\n}\nN3Handler.pattern = new RegExp('(application|text)/(x-)?(rdf\\\\+)?(n3|turtle)')\n\nconst defaultHandlers = {\n  RDFXMLHandler, XHTMLHandler, XMLHandler, HTMLHandler, TextHandler, N3Handler, JsonLdHandler\n}\n\nfunction isXHTML (responseText) {\n  const docTypeStart = responseText.indexOf('<!DOCTYPE html')\n  const docTypeEnd = responseText.indexOf('>')\n  if (docTypeStart === -1 || docTypeEnd === -1 || docTypeStart > docTypeEnd) {\n    return false\n  }\n  return responseText.substr(docTypeStart, docTypeEnd - docTypeStart).indexOf('XHTML') !== -1\n}\n\nfunction isXML (responseText: string): boolean {\n  const match = responseText.match(/\\s*<\\?xml\\s+version\\s*=[^<>]+\\?>/)\n  return !!match\n}\n\nfunction isXMLNS (responseText: string): boolean {\n  const match = responseText.match(/[^(<html)]*<html\\s+[^<]*xmlns=['\"]http:\\/\\/www.w3.org\\/1999\\/xhtml[\"'][^<]*>/)\n  return !!match\n}\n\ntype StatusValues =\n  /** No record of web access or record reset */\n  undefined |\n  /** Has been requested, fetch in progress */\n  true |\n  /** Received, OK */\n  'done' |\n  /** Not logged in */\n  401 |\n  /** HTTP status unauthorized */\n  403 |\n  /** Not found, resource does not exist */\n  404 |\n  /** In attempt to counter CORS problems retried */\n  'redirected' |\n  /** If it did fail */\n  'failed' |\n  'parse_error' |\n  /**\n   * URI is not a protocol Fetcher can deal with\n   * other strings mean various other errors.\n   */\n  'unsupported_protocol' |\n  'timeout' |\n  /** Any other HTTP status code */\n  number\n\ninterface MediatypesMap {\n  [id: string]: {\n    // Either string '1.0' or number 1.0 is allowed\n    'q'?: number | string\n  };\n}\n\ninterface RequestedMap {\n  [uri: string]: StatusValues\n}\n\ninterface TimeOutsMap {\n  [uri: string]: number[]\n}\n\ninterface FetchQueue {\n  [uri: string]: Promise<ExtendedResponse>\n}\n\ninterface FetchCallbacks {\n  [uri: string]: UserCallback[]\n}\n\ninterface BooleanMap {\n  [uri: string]: boolean\n}\n\n// Not sure about the shapes of this. Response? FetchError?\ntype Result = Response\n\n/** Differs from normal Fetch, has an extended Response type */\ntype Fetch = (input: RequestInfo, init?: RequestInit) => Promise<ExtendedResponse>;\n\ninterface CallbackifyInterface {\n  fireCallbacks: Function\n}\n\n/** Fetcher\n *\n * The Fetcher object is a helper object for a quadstore\n * which turns it from an offline store to an online store.\n * The fetcher deals with loading data files rom the web,\n  * figuring how to parse them.  It will also refresh, remove, the data\n  * and put back the data to the web.\n */\nexport default class Fetcher implements CallbackifyInterface {\n  store: IndexedFormula\n  timeout: number\n  _fetch: Fetch\n  mediatypes: MediatypesMap\n  /** Denoting this session */\n  appNode: BlankNode\n  /**\n   * this.requested[uri] states:\n   * undefined     no record of web access or records reset\n   * true          has been requested, fetch in progress\n   * 'done'        received, Ok\n   * 401           Not logged in\n   * 403           HTTP status unauthorized\n   * 404           Resource does not exist. Can be created etc.\n   * 'redirected'  In attempt to counter CORS problems retried.\n   * 'parse_error' Parse error\n   * 'unsupported_protocol'  URI is not a protocol Fetcher can deal with\n   * other strings mean various other errors.\n   */\n  requested: RequestedMap\n  /** List of timeouts associated with a requested URL */\n  timeouts: TimeOutsMap\n  /** Redirected from *key uri* to *value uri* */\n  redirectedTo: Record<string, string>\n  fetchQueue: FetchQueue\n  /** fetchCallbacks[uri].push(callback) */\n  fetchCallbacks: FetchCallbacks\n  /** Keep track of explicit 404s -> we can overwrite etc */\n  nonexistent: BooleanMap\n  lookedUp: BooleanMap\n  handlers: Array<typeof Handler>\n  ns: { [k: string]: (ln: string) => Quad_Predicate }\n  static HANDLERS: {\n    [handlerName: number]: Handler\n  }\n  static CONTENT_TYPE_BY_EXT: Record<string, string>\n  // TODO: Document this\n  static crossSiteProxyTemplate: any\n\n  /** Methods added by calling Util.callbackify in the constructor*/\n  fireCallbacks!: Function\n\n  constructor (store: IndexedFormula, options: Options = {}) {\n    this.store = store || new IndexedFormula()\n    this.ns = getNS(this.store.rdfFactory)\n    this.timeout = options.timeout || 30000\n\n    // solidFetcher is deprecated\n    this._fetch = options.fetch\n               || (typeof global !== 'undefined' && (global.solidFetcher || global.solidFetch))\n               || (typeof window !== 'undefined' && (window.solidFetcher || window.solidFetch))\n               || crossFetch\n    if (!this._fetch) {\n      throw new Error('No _fetch function available for Fetcher')\n    }\n\n    this.appNode = this.store.rdfFactory.blankNode()\n    this.store.fetcher = this // Bi-linked\n    this.requested = {}\n    this.timeouts = {}\n    this.redirectedTo = {}\n    this.fetchQueue = {}\n    this.fetchCallbacks = {}\n    this.nonexistent = {}\n    this.lookedUp = {}\n    this.handlers = []\n    this.mediatypes = {\n      'image/*': { 'q': 0.9 },\n      '*/*': { 'q': 0.1 }  // Must allow access to random content\n    }\n\n    // Util.callbackify(this, ['request', 'recv', 'headers', 'load', 'fail',\n    //   'refresh', 'retract', 'done'])\n    // In switching to fetch(), 'recv', 'headers' and 'load' do not make sense\n    Util.callbackify(this, ['request', 'fail', 'refresh', 'retract', 'done'])\n\n    Object.keys(options.handlers || defaultHandlers).map(key => this.addHandler(defaultHandlers[key]))\n  }\n\n  static crossSiteProxy (uri: string): undefined | any {\n    if (Fetcher.crossSiteProxyTemplate) {\n      return Fetcher.crossSiteProxyTemplate\n        .replace('{uri}', encodeURIComponent(uri))\n    } else {\n      return undefined\n    }\n  }\n\n  static offlineOverride (uri: string): string {\n    // Map the URI to a localhost proxy if we are running on localhost\n    // This is used for working offline, e.g. on planes.\n    // Is the script itself is running in localhost, then access all\n    //   data in a localhost mirror.\n    // Do not remove without checking with TimBL\n    let requestedURI = uri\n\n    var UI\n    if (typeof window !== 'undefined' && window.panes && (UI = window.panes.UI) &&\n      UI.preferences && UI.preferences.get('offlineModeUsingLocalhost')) {\n      if (requestedURI.slice(0, 7) === 'http://' && requestedURI.slice(7, 17) !== 'localhost/') {\n        requestedURI = 'http://localhost/' + requestedURI.slice(7)\n        log.warn('Localhost kludge for offline use: actually getting <' +\n          requestedURI + '>')\n      } else {\n        // log.warn(\"Localhost kludge NOT USED <\" + requestedURI + \">\")\n      }\n    } else {\n      // log.warn(\"Localhost kludge OFF offline use: actually getting <\" +\n      //   requestedURI + \">\")\n    }\n\n    return requestedURI\n  }\n\n  static proxyIfNecessary (uri: string) {\n    var UI\n    if (\n      typeof window !== 'undefined' &&\n      (window as any).panes &&\n      (UI = (window as any).panes.UI) &&\n      UI.isExtension\n    ) {\n      return uri\n    } // Extension does not need proxy\n\n    if (typeof $SolidTestEnvironment !== 'undefined' &&\n      $SolidTestEnvironment.localSiteMap) {\n      // nested dictionaries of URI parts from origin down\n      let hostpath = uri.split('/').slice(2) // the bit after the //\n\n      const lookup = (parts, index) => {\n        let z = index[parts.shift()]\n\n        if (!z) { return null }\n\n        if (typeof z === 'string') {\n          return z + parts.join('/')\n        }\n\n        if (!parts) { return null }\n\n        return lookup(parts, z)\n      }\n\n      const y = lookup(hostpath, $SolidTestEnvironment.localSiteMap)\n\n      if (y) {\n        return y\n      }\n    }\n\n    // browser does 2014 on as https browser script not trusted\n    // If the web app origin is https: then the mixed content rules\n    // prevent it loading insecure http: stuff so we need proxy.\n    if (Fetcher.crossSiteProxyTemplate &&\n        typeof document !== 'undefined' && document.location &&\n        ('' + document.location).slice(0, 6) === 'https:' && // origin is secure\n        uri.slice(0, 5) === 'http:') { // requested data is not\n      return Fetcher.crossSiteProxyTemplate\n        .replace('{uri}', encodeURIComponent(uri))\n    }\n\n    return uri\n  }\n\n  /**\n   * Tests whether the uri's protocol is supported by the Fetcher.\n   * @param uri\n   */\n  static unsupportedProtocol (uri: string): boolean {\n    let pcol = Uri.protocol(uri)\n\n    return (pcol === 'tel' || pcol === 'mailto' || pcol === 'urn')\n  }\n\n  /** Decide on credentials using old XXHR api or new fetch()  one\n   * @param requestedURI\n   * @param options\n   */\n  static setCredentials (requestedURI: string, options: Options = {}) {\n    // 2014 CORS problem:\n    // XMLHttpRequest cannot load http://www.w3.org/People/Berners-Lee/card.\n    // A wildcard '*' cannot be used in the 'Access-Control-Allow-Origin'\n    //   header when the credentials flag is true.\n    // @ Many ontology files under http: and need CORS wildcard ->\n    //   can't have credentials\n    if (options.credentials === undefined) { // Caller using new fetch convention\n      if (options.withCredentials !== undefined) { // XHR style is what Fetcher specified before\n        options.credentials = options.withCredentials ? 'include' : 'omit'\n      } else {\n        options.credentials = 'include' // default is to be logged on\n      }\n    }\n  }\n\n  /**\n   * Promise-based load function\n   *\n   * Loads a web resource or resources into the store.\n   *\n   * A resource may be given as NamedNode object, or as a plain URI.\n   * an array of resources will be given, in which they will be fetched in parallel.\n   * By default, the HTTP headers are recorded also, in the same store, in a separate graph.\n   * This allows code like editable() for example to test things about the resource.\n   *\n   * @param uri {Array<RDFlibNamedNode>|Array<string>|RDFlibNamedNode|string}\n   *\n   * @param [options={}] {Object}\n   *\n   * @param [options.fetch] {Function}\n   *\n   * @param [options.referringTerm] {RDFlibNamedNode} Referring term, the resource which\n   *   referred to this (for tracking bad links)\n   *\n   * @param [options.contentType] {string} Provided content type (for writes)\n   *\n   * @param [options.forceContentType] {string} Override the incoming header to\n   *   force the data to be treated as this content-type (for reads)\n   *\n   * @param [options.force] {boolean} Load the data even if loaded before.\n   *   Also sets the `Cache-Control:` header to `no-cache`\n   *\n   * @param [options.baseURI=docuri] {Node|string} Original uri to preserve\n   *   through proxying etc (`xhr.original`).\n   *\n   * @param [options.proxyUsed] {boolean} Whether this request is a retry via\n   *   a proxy (generally done from an error handler)\n   *\n   * @param [options.withCredentials] {boolean} flag for XHR/CORS etc\n   *\n   * @param [options.clearPreviousData] {boolean} Before we parse new data,\n   *   clear old, but only on status 200 responses\n   *\n   * @param [options.noMeta] {boolean} Prevents the addition of various metadata\n   *   triples (about the fetch request) to the store\n   *\n   * @param [options.noRDFa] {boolean}\n   *\n   * @returns {Promise<Result>}\n   */\n  load <T extends NamedNode | string | Array<string | NamedNode>>(\n    uri: T,\n    options: Options = {}\n  ): T extends Array<string | NamedNode> ? Promise<Result[]> : Promise<Result> {\n    options = Object.assign({}, options) // Take a copy as we add stuff to the options!!\n    if (uri instanceof Array) {\n      return Promise.all(uri.map((x) => {\n        return this.load(x, Object.assign({}, options)) as unknown as Promise<Result>\n      })) as T extends Array<string | NamedNode> ? Promise<Result[]> : Promise<Result>\n    }\n\n    const uriIn: NamedNode | string = uri as NamedNode\n\n    let docuri = termValue(uriIn)\n    docuri = docuri.split('#')[0]\n\n    options = this.initFetchOptions(docuri, options)\n\n    const initialisedOptions = this.initFetchOptions(docuri, options)\n\n    return this.pendingFetchPromise(docuri, initialisedOptions.baseURI, initialisedOptions) as any\n  }\n\n  pendingFetchPromise (\n    uri: string,\n    originalUri: string,\n    options: AutoInitOptions\n  ): Promise<Result> {\n    let pendingPromise\n\n    // Check to see if some request is already dealing with this uri\n    if (!options.force && this.fetchQueue[originalUri]) {\n      pendingPromise = this.fetchQueue[originalUri]\n    } else {\n      pendingPromise = Promise\n        .race([\n          this.setRequestTimeout(uri, options),\n          this.fetchUri(uri, options)\n        ])\n      this.fetchQueue[originalUri] = pendingPromise\n\n      // Clean up the queued promise after a time, if it's resolved\n      this.cleanupFetchRequest(originalUri, undefined, this.timeout)\n    }\n\n    return pendingPromise.then(x => {\n      if (uri in this.timeouts) {\n        this.timeouts[uri].forEach(clearTimeout)\n        delete this.timeouts[uri]\n      }\n      return x\n    })\n  }\n\n  /**\n   * @param _options - DEPRECATED\n   */\n  cleanupFetchRequest (\n    originalUri: string,\n    _options,\n    timeout: number\n  ) {\n    if (_options !== undefined) {\n      console.warn(\"_options is deprecated\")\n    }\n    this.timeouts[originalUri] = (this.timeouts[originalUri] || []).concat(setTimeout(() => {\n      if (!this.isPending(originalUri)) {\n        delete this.fetchQueue[originalUri]\n      }\n    }, timeout) as unknown as number)\n  }\n\n  initFetchOptions (\n    uri: string,\n    options: Options\n  ): AutoInitOptions {\n    let kb = this.store\n\n    let isGet = !options.method || options.method.toUpperCase() === 'GET'\n    if (!isGet) {\n      options.force = true\n    }\n\n    options.resource = kb.rdfFactory.namedNode(uri) // This might be proxified\n    options.baseURI = options.baseURI || uri // Preserve though proxying etc\n    options.original = kb.rdfFactory.namedNode(options.baseURI)\n    options.req = kb.bnode()\n    options.headers = options.headers || new Headers()\n\n    if (options.contentType) {\n      // @ts-ignore\n      options.headers['content-type'] = options.contentType\n    }\n\n    if (options.force) {\n      options.cache = 'no-cache'\n    }\n\n    let acceptString = this.acceptString()\n    // @ts-ignore\n    options.headers['accept'] = acceptString\n\n    let requestedURI = Fetcher.offlineOverride(uri)\n    options.requestedURI = requestedURI\n\n    Fetcher.setCredentials(requestedURI, options)\n\n    let actualProxyURI = Fetcher.proxyIfNecessary(requestedURI)\n    if (requestedURI !== actualProxyURI) {\n      options.proxyUsed = true\n    }\n    options.actualProxyURI = actualProxyURI\n\n    return options as AutoInitOptions\n  }\n\n  /**\n   * (The promise chain ends in either a `failFetch()` or a `doneFetch()`)\n   *\n   * @param docuri {string}\n   * @param options {Object}\n   *\n   * @returns {Promise<Object>} fetch() result or an { error, status } object\n   */\n  fetchUri (docuri: string, options: AutoInitOptions): Promise<ExtendedResponse | FetchError> {\n    if (!docuri) {\n      return Promise.reject(new Error('Cannot fetch an empty uri'))\n    }\n\n    if (Fetcher.unsupportedProtocol(docuri)) {\n      return this.failFetch(options, 'fetcher: Unsupported protocol', 'unsupported_protocol')\n    }\n\n    let state = this.getState(docuri)\n\n    if (!options.force) {\n      if (state === 'fetched') {  // URI already fetched and added to store\n        return Promise.resolve(\n          // @ts-ignore This is not a valid response object\n          this.doneFetch(options, {\n            status: 200,\n            ok: true,\n            statusText: 'Already loaded into quadstore.'\n          })\n        )\n      }\n      if (state === 'failed' && this.requested[docuri] === 404) { // Remember nonexistence\n        let message = 'Previously failed: ' + this.requested[docuri]\n        // @ts-ignore This is not a valid response object\n        let dummyResponse: ExtendedResponse = {\n          url: docuri,\n          // This does not comply to Fetch spec, it can be a string value in rdflib\n          status: this.requested[docuri] as number,\n          statusText: message,\n          responseText: message,\n          headers: new Headers,  // Headers() ???\n          ok: false,\n          body: null,\n          bodyUsed: false,\n          size: 0,\n          timeout: 0\n        }\n        return this.failFetch(options, message,\n          this.requested[docuri], dummyResponse)\n      }\n    } else {\n      // options.force == true\n      delete this.nonexistent[docuri]\n    }\n\n    this.fireCallbacks('request', [docuri])\n\n    this.requested[docuri] = true  // mark this uri as 'requested'\n\n    if (!options.noMeta) {\n      this.saveRequestMetadata(docuri, options)\n    }\n\n    let { actualProxyURI } = options\n\n    // Map might get mistakenly added into headers\n    // error TS2339: Property 'map' does not exist on type 'Headers'.\n    /* let map\n    if (options.headers && map in options.headers) {\n      delete options.headers.map\n    } */\n\n    return this._fetch((actualProxyURI as string), options)\n      .then(response => this.handleResponse(response, docuri, options),\n      error => { // @@ handleError?\n        // @ts-ignore Invalid response object\n        let dummyResponse: ExtendedResponse = {\n          url: actualProxyURI as string,\n          status: 999, // @@ what number/string should fetch failures report?\n          statusText: (error.name || 'network failure') + ': ' +\n            (error.errno || error.code || error.type),\n          responseText: error.message,\n          headers: new Headers(),  // Headers() ???\n          ok: false,\n          body: null,\n          bodyUsed: false,\n          size: 0,\n          timeout: 0\n        }\n        console.log('Fetcher: <' + actualProxyURI + '> Non-HTTP fetch exception: ' + error)\n        return this.handleError(dummyResponse, docuri, options) // possible credentials retry\n        // return this.failFetch(options, 'fetch failed: ' + error, 999, dummyResponse) // Fake status code: fetch exception\n\n        // handleError expects a response so we fake some important bits.\n        /*\n        this.handleError(, docuri, options)\n        */\n      }\n    )\n  }\n\n  /**\n   * Asks for a doc to be loaded if necessary then calls back\n   *\n   * Calling methods:\n   *   nowOrWhenFetched (uri, userCallback)\n   *   nowOrWhenFetched (uri, options, userCallback)\n   *   nowOrWhenFetched (uri, referringTerm, userCallback, options)  <-- old\n   *   nowOrWhenFetched (uri, referringTerm, userCallback) <-- old\n   *\n   *  Options include:\n   *   referringTerm    The document in which this link was found.\n   *                    this is valuable when finding the source of bad URIs\n   *   force            boolean.  Never mind whether you have tried before,\n   *                    load this from scratch.\n   *   forceContentType Override the incoming header to force the data to be\n   *                    treated as this content-type.\n   *\n   *  Callback function takes:\n   *\n   *    ok               True if the fetch worked, and got a 200 response.\n   *                     False if any error happened\n   *\n   *    errmessage       Text error message if not OK.\n   *\n   *    response         The fetch Response object (was: XHR) if there was was one\n   *                     includes response.status as the HTTP status if any.\n   */\n  nowOrWhenFetched (\n    uriIn: string | NamedNode,\n    p2?: UserCallback | Options,\n    userCallback?: UserCallback,\n    options: Options = {}\n  ): void {\n    const uri = termValue(uriIn)\n\n    if (typeof p2 === 'function') {\n      // nowOrWhenFetched (uri, userCallback)\n      userCallback = p2\n    } else if (typeof p2 === 'undefined') { // original calling signature\n      // referringTerm = undefined\n    } else if (isNamedNode(p2)) {\n      // referringTerm = p2\n      options.referringTerm = p2\n    } else {\n      // nowOrWhenFetched (uri, options, userCallback)\n      options = p2\n    }\n\n    (this.load(uri, options) as Promise<Response>)\n      .then((fetchResponse: ExtendedResponse) => {\n        if (userCallback) {\n          if (fetchResponse) {\n            if ((fetchResponse as Response).ok) {\n              userCallback(true, 'OK', fetchResponse)\n            } else {\n              // console.log('@@@ fetcher.js Should not take this path !!!!!!!!!!!!')\n              let oops = 'HTTP error: Status ' + fetchResponse.status + ' (' + fetchResponse.statusText + ')'\n              if (fetchResponse.responseText) {\n                oops += ' ' + fetchResponse.responseText // not in 404, dns error, nock failure\n              }\n              console.log(oops + ' fetching ' + uri)\n              userCallback(false, oops, fetchResponse)\n            }\n          } else {\n            let oops = ('@@ nowOrWhenFetched:  no response object!')\n            console.log(oops)\n            userCallback(false, oops)\n          }\n        }\n      }, function (err: FetchError) {\n        var message = err.message || err.statusText\n        message = 'Failed to load  <' + uri + '> ' + message\n        console.log(message)\n        if (err.response && err.response.status) {\n          message += ' status: ' + err.response.status\n        }\n        (userCallback as any)(false, message, err.response)\n      })\n  }\n\n  /**\n   * Records a status message (as a literal node) by appending it to the\n   * request's metadata status collection.\n   *\n   */\n  addStatus (req: BlankNode, statusMessage: string) {\n    // <Debug about=\"parsePerformance\">\n    let now = new Date()\n    statusMessage = '[' + now.getHours() + ':' + now.getMinutes() + ':' +\n      now.getSeconds() + '.' + now.getMilliseconds() + '] ' + statusMessage\n    // </Debug>\n    let kb = this.store\n\n    const statusNode = kb.the(req, this.ns.link('status'))\n    if (isCollection(statusNode)) {\n      statusNode.append(kb.rdfFactory.literal(statusMessage))\n    } else {\n      log.warn('web.js: No list to add to: ' + statusNode + ',' + statusMessage)\n    }\n  }\n\n  /**\n   * Records errors in the system on failure:\n   *\n   *  - Adds an entry to the request status collection\n   *  - Adds an error triple with the fail message to the metadata\n   *  - Fires the 'fail' callback\n   *  - Rejects with an error result object, which has a response object if any\n   */\n  failFetch (\n    options: {\n      req: BlankNode\n      original: Quad_Subject\n    } & Options,\n    errorMessage: string,\n    statusCode: StatusValues,\n    response?: ExtendedResponse\n  ): Promise<FetchError> {\n    this.addStatus(options.req, errorMessage)\n\n    if (!options.noMeta) {\n      this.store.add(\n        options.original,\n        this.ns.link('error'),\n        this.store.rdfFactory.literal(errorMessage)\n      )\n    }\n\n    let meth = (options.method || 'GET').toUpperCase()\n    let isGet = meth === 'GET' || meth === 'HEAD'\n\n    if (isGet) {  // only cache the status code on GET or HEAD\n      if (!(options as any).resource.equals(options.original)) {\n        // console.log('@@ Recording failure  ' + meth + '  original ' + options.original +option '( as ' + options.resource + ') : ' + statusCode)\n      } else {\n        // console.log('@@ Recording ' + meth + ' failure for ' + options.original + ': ' + statusCode)\n      }\n      this.requested[Uri.docpart(options.original.value)] = statusCode\n      this.fireCallbacks('fail', [options.original.value, errorMessage])\n    }\n\n    var err: FetchError = new Error('Fetcher: ' + errorMessage)\n\n    // err.ok = false // Is taken as a response, will work too @@ phase out?\n    err.status = statusCode\n    err.statusText = errorMessage\n    err.response = response\n\n    return Promise.reject(err)\n  }\n\n  // in the why part of the quad distinguish between HTML and HTTP header\n  // Reverse is set iif the link was rev= as opposed to rel=\n  linkData (\n    originalUri: NamedNode,\n    rel: string,\n    uri: string,\n    why: Quad_Graph,\n    reverse?: boolean\n  ) {\n    if (!uri) return\n    let kb = this.store\n    let predicate\n    // See http://www.w3.org/TR/powder-dr/#httplink for describedby 2008-12-10\n    let obj = kb.rdfFactory.namedNode(Uri.join(uri, originalUri.value))\n\n    if (rel === 'alternate' || rel === 'seeAlso' || rel === 'meta' ||\n        rel === 'describedby') {\n      if (obj.value === originalUri.value) { return }\n      predicate = this.ns.rdfs('seeAlso')\n    } else if (rel === 'type') {\n      predicate = kb.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type')\n    } else {\n      // See https://www.iana.org/assignments/link-relations/link-relations.xml\n      // Alas not yet in RDF yet for each predicate\n      // encode space in e.g. rel=\"shortcut icon\"\n      predicate = kb.rdfFactory.namedNode(\n        Uri.join(encodeURIComponent(rel),\n          'http://www.iana.org/assignments/link-relations/')\n      )\n    }\n    if (reverse) {\n      kb.add(obj, predicate, originalUri, why)\n    } else {\n      kb.add(originalUri, predicate, obj, why)\n    }\n  }\n\n  parseLinkHeader (\n    linkHeader: string,\n    originalUri: NamedNode,\n    reqNode: Quad_Graph\n  ): void {\n    if (!linkHeader) { return }\n\n    // const linkexp = /<[^>]*>\\s*(\\s*;\\s*[^()<>@,;:\"/[\\]?={} \\t]+=(([^()<>@,;:\"/[]?={} \\t]+)|(\"[^\"]*\")))*(,|$)/g\n    // const paramexp = /[^()<>@,;:\"/[]?={} \\t]+=(([^()<>@,;:\"/[]?={} \\t]+)|(\"[^\"]*\"))/g\n\n    // From https://www.dcode.fr/regular-expression-simplificator:\n    // const linkexp = /<[^>]*>\\s*(\\s*;\\s*[^()<>@,;:\"/[\\]?={} t]+=[\"]))*[,$]/g\n    // const paramexp = /[^\\\\<>@,;:\"\\/\\[\\]?={} \\t]+=[\"])/g\n    // Original:\n    const linkexp = /<[^>]*>\\s*(\\s*;\\s*[^()<>@,;:\"/[\\]?={} \\t]+=(([^\\(\\)<>@,;:\"\\/\\[\\]\\?={} \\t]+)|(\"[^\"]*\")))*(,|$)/g\n    const paramexp = /[^\\(\\)<>@,;:\"\\/\\[\\]\\?={} \\t]+=(([^\\(\\)<>@,;:\"\\/\\[\\]\\?={} \\t]+)|(\"[^\"]*\"))/g\n\n    const matches = linkHeader.match(linkexp)\n\n    if (matches == null) return;\n\n    for (let i = 0; i < matches.length; i++) {\n      let split = matches[i].split('>')\n      let href = split[0].substring(1)\n      let ps = split[1]\n      let s = ps.match(paramexp)\n      if (s == null) return\n      for (let j = 0; j < s.length; j++) {\n        let p = s[j]\n        let paramsplit = p.split('=')\n        // var name = paramsplit[0]\n        let rel = paramsplit[1].replace(/[\"']/g, '') // '\"\n        this.linkData(originalUri, rel, href, reqNode)\n      }\n    }\n  }\n\n  doneFetch (\n    options: {\n      req: Quad_Subject,\n      original: Quad_Subject\n    } & Options,\n    response: ExtendedResponse\n  ): Response {\n    this.addStatus(options.req, 'Done.')\n    this.requested[options.original.value] = 'done'\n\n    this.fireCallbacks('done', [options.original.value])\n\n    response.req = options.req  // Set the request meta blank node\n\n    return response\n  }\n\n  /**\n   * Note two nodes are now smushed\n   * If only one was flagged as looked up, then the new node is looked up again,\n   * which will make sure all the URIs are dereferenced\n   */\n  nowKnownAs (was: Quad_Subject, now: Quad_Subject): void {\n    if (this.lookedUp[was.value]) {\n      // Transfer userCallback\n      if (!this.lookedUp[now.value]) {\n        this.lookUpThing(now, was)\n      }\n    } else if (this.lookedUp[now.value]) {\n      if (!this.lookedUp[was.value]) {\n        this.lookUpThing(was, now)\n      }\n    }\n  }\n\n  /**\n   * Writes back to the web what we have in the store for this uri\n   */\n  putBack (\n    uri: NamedNode | string,\n    options: Options = {}\n  ): Promise<Response> {\n    const uriSting = termValue(uri)\n    let doc = new RDFlibNamedNode(uriSting).doc() // strip off #\n    options.contentType = options[\"content-type\"] || options[\"Content-Type\"] || options.contentType || TurtleContentType\n    if (options.contentType === 'application/ld+json') {\n      return new Promise((resolve, reject) => {\n        serialize(doc, this.store, doc.uri, options.contentType, (err, jsonString) => {\n          if (err) {\n            reject(err)\n          } else {\n            // @ts-ignore\n            options.data = jsonString\n            this.webOperation('PUT', uri, options)\n              .then((res) => resolve(res))\n              .catch((error) => reject(error))\n          }\n        })\n      })\n    }\n    options.data = serialize(doc, this.store, doc.value, options.contentType) as string\n    return this.webOperation('PUT', uriSting, options)\n  }\n\n  webCopy (here: string, there: string, contentType): Promise<ExtendedResponse> {\n    return this.webOperation('GET', here)\n      .then((result) => {\n        return this.webOperation(\n          'PUT', // change to binary from text\n          there, { data: result.responseText, contentType })\n      })\n  }\n\n  delete (uri: string, options?: Options): Promise<ExtendedResponse> {\n    return this.webOperation('DELETE', uri, options)\n      .then(response => {\n        this.requested[uri] = 404\n        this.nonexistent[uri] = true\n        this.unload(this.store.rdfFactory.namedNode(uri))\n\n        return response\n      })\n  }\n\n  /** Create an empty resource if it really does not exist\n   *  Be absolutely sure something does not exist before creating a new empty file\n   * as otherwise existing could  be deleted.\n   * @param doc - The resource\n  */\n  async createIfNotExists (\n    doc: RDFlibNamedNode,\n    contentType = TurtleContentType,\n    data = ''\n  ): Promise<ExtendedResponse> {\n    const fetcher = this\n    try {\n      var response = await fetcher.load(doc as NamedNode)\n    } catch (err) {\n      // @ts-ignore\n      if (err.response.status === 404) {\n        console.log('createIfNotExists: doc does NOT exist, will create... ' + doc)\n        try {\n          response = await fetcher.webOperation('PUT', doc.value, {data, contentType})\n        } catch (err) {\n          console.log('createIfNotExists doc FAILED: ' + doc + ': ' + err)\n          throw err\n        }\n        delete fetcher.requested[doc.value] // delete cached 404 error\n        // console.log('createIfNotExists doc created ok ' + doc)\n        return response\n      } else {\n        console.log('createIfNotExists doc load error NOT 404:  ' + doc + ': ' + err)\n        throw err\n      }\n    }\n    // console.log('createIfNotExists: doc exists, all good: ' + doc)\n    return response as Response\n  }\n\n  /**\n   * @param parentURI URI of parent container\n   * @param folderName - Optional folder name (slug)\n   * @param data - Optional folder metadata\n   */\n  createContainer (\n    parentURI: string,\n    folderName: string,\n    data: string\n  ): Promise<Response> {\n    let headers = {\n      // Force the right mime type for containers\n      'content-type': TurtleContentType,\n      'link': this.ns.ldp('BasicContainer') + '; rel=\"type\"'\n    }\n\n    if (folderName) {\n      headers['slug'] = folderName\n    }\n\n    // @ts-ignore These headers lack some of the required operators.\n    let options: Options = { headers }\n\n    if (data) {\n      options.body = data\n    }\n\n    return this.webOperation('POST', parentURI, options)\n  }\n\n  invalidateCache (iri: string | NamedNode): void {\n    const uri = termValue(iri)\n    const fetcher = this\n    // @ts-ignore\n    if (fetcher.fetchQueue && fetcher.fetchQueue[uri]) {\n      console.log('Internal error - fetchQueue exists ' + uri)\n      var promise = fetcher.fetchQueue[uri]\n      if (promise['PromiseStatus'] === 'resolved') {\n        delete fetcher.fetchQueue[uri]\n      } else { // pending\n        delete fetcher.fetchQueue[uri]\n        console.log('*** Fetcher: pending fetchQueue deleted ' + uri)\n      }\n    } if (fetcher.requested[uri] && fetcher.requested[uri] !== 'done' &&\n     fetcher.requested[uri] !== 'failed' && fetcher.requested[uri] !== 404) {\n       let msg = `Rdflib: fetcher: Destructive operation on <${fetcher.requested[uri]}> file being fetched! ` + uri\n      console.error(msg)\n      // alert(msg)\n    } else {\n      delete fetcher.requested[uri] // invalidate read cache -- @@ messes up logic if request in progress ??\n      delete fetcher.nonexistent[uri]\n    }\n  }\n\n  /**\n   * A generic web opeation, at the fetch() level.\n   * does not invole the quadstore.\n   *\n   *  Returns promise of Response\n   *  If data is returned, copies it to response.responseText before returning\n   */\n  webOperation (\n    method: HTTPMethods,\n    uriIn: string | NamedNode,\n    // Not sure about this type. Maybe this Options is different?\n    options: Options = {}\n  ): Promise<ExtendedResponse> {\n    const uri = termValue(uriIn)\n    options.method = method\n    options.body = options.data || options.body\n    options.force = true\n    const fetcher = this\n\n    if (options.body && !options.contentType) {\n      throw new Error('Web operation sending data must have a defined contentType.')\n    }\n    if (options.contentType) {\n      (options as any).headers = options.headers || {};\n      (options as any).headers['content-type'] = options.contentType\n    }\n    Fetcher.setCredentials(uri, options)\n\n    return new Promise(function (resolve, reject) {\n      fetcher._fetch(uri, options).then(response => {\n        if (response.ok) {\n          if (method === 'PUT' || method === 'PATCH' || method === 'POST' || method === 'DELETE') {\n            fetcher.invalidateCache (uri)\n          } // response.body with Chrome can't be relied on\n          if (response.text) { // Was: response.body https://github.com/linkeddata/rdflib.js/issues/506\n            response.text().then(data => {\n              response.responseText = data\n              resolve(response)\n            })\n          } else {\n            resolve(response)\n          }\n        } else {\n          let msg = 'Web error: ' + response.status\n          if (response.statusText) msg += ' (' + response.statusText + ')'\n          msg += ' on ' + method + ' of <' + uri + '>'\n          if (response.responseText) msg += ': ' + response.responseText\n          let e2: FetchError = new Error(msg)\n          e2.response = response\n          reject(e2)\n        }\n      }, (err: Error) => {\n        let msg = 'Fetch error for ' + method + ' of <' + uri + '>:' + err\n        reject(new Error(msg))\n      })\n    })\n  }\n\n  /**\n   * Looks up something.\n   * Looks up all the URIs a things has.\n   *\n   * @param term - canonical term for the thing whose URI is\n   *   to be dereferenced\n   * @param rterm - the resource which referred to this\n   *   (for tracking bad links)\n   */\n  lookUpThing (\n    term: Quad_Subject,\n    rterm: Quad_Subject\n  ): Promise<Response> | Promise<Response>[] {\n    let uris = this.store.uris(term)  // Get all URIs\n    uris = uris.map(u => Uri.docpart(u))  // Drop hash fragments\n\n    uris.forEach(u => {\n      this.lookedUp[u] = true\n    })\n\n    // @ts-ignore Recursive type\n    return this.load(uris, { referringTerm: rterm })\n  }\n\n  /**\n   * Looks up response header.\n   *\n   * @returns {Array|undefined} a list of header values found in a stored HTTP\n   *   response, or [] if response was found but no header found,\n   *   or undefined if no response is available.\n   * Looks for { [] link:requestedURI ?uri; link:response [ httph:header-name  ?value ] }\n   */\n  getHeader (\n    doc: NamedNode,\n    header: string\n  ): undefined | string[] {\n    const kb = this.store // look for the URI (AS A STRING NOT A NODE) for a stored request\n    const docuri: string = doc.value\n    const requests = kb.each(undefined, this.ns.link('requestedURI'), kb.rdfFactory.literal(docuri)) as Quad_Subject[]\n\n    for (let r = 0; r < requests.length; r++) {\n      let request = requests[r]\n      if (request !== undefined) {\n        let response = kb.any(request, this.ns.link('response')) as Quad_Subject\n        if (response !== undefined && kb.anyValue(response, this.ns.http('status')) && (kb.anyValue(response, this.ns.http('status')) as string).startsWith('2')) {\n          // Only look at success returns - not 401 error messagess etc\n          let results = kb.each(response, this.ns.httph(header.toLowerCase()))\n\n          if (results.length) {\n            return results.map(v => { return v.value })\n          }\n\n          return []\n        }\n      }\n    }\n    return undefined\n  }\n\n  saveRequestMetadata (\n    docuri: string,\n    options: AutoInitOptions\n  ) {\n    let req = options.req\n    let kb = this.store\n    let rterm = options.referringTerm\n\n    this.addStatus(options.req, 'Accept: ' + options.headers['accept'])\n\n    if (isNamedNode(rterm)) {\n      kb.add(kb.rdfFactory.namedNode(docuri), this.ns.link('requestedBy'), rterm, this.appNode)\n    }\n\n    if (options.original && options.original.value !== docuri) {\n      kb.add(req, this.ns.link('orginalURI'), kb.rdfFactory.literal(options.original.value),\n        this.appNode)\n    }\n\n    const now = new Date()\n    const timeNow = '[' + now.getHours() + ':' + now.getMinutes() + ':' +\n      now.getSeconds() + '] '\n\n    kb.add(req, this.ns.rdfs('label'),\n      kb.rdfFactory.literal(timeNow + ' Request for ' + docuri), this.appNode)\n    // We store the docuri as a string, not as a node,\n    // see https://github.com/linkeddata/rdflib.js/pull/427#pullrequestreview-447910061\n    kb.add(req, this.ns.link('requestedURI'), kb.rdfFactory.literal(docuri), this.appNode)\n    kb.add(req, this.ns.link('status'), kb.collection(), this.appNode)\n  }\n\n  saveResponseMetadata (\n    response: Response,\n    options: {\n      req: BlankNode,\n      resource: Quad_Subject\n    } & Options\n  ): BlankNode {\n    const kb = this.store\n\n    let responseNode = kb.bnode()\n\n    kb.add(options.req, this.ns.link('response'), responseNode, responseNode)\n    kb.add(responseNode, this.ns.http('status'),\n    kb.rdfFactory.literal(response.status as any), responseNode)\n    kb.add(responseNode, this.ns.http('statusText'),\n    kb.rdfFactory.literal(response.statusText), responseNode)\n\n    // Save the response headers\n    response.headers.forEach((value, header) => {\n      kb.add(responseNode, this.ns.httph(header), this.store.rdfFactory.literal(value), responseNode)\n\n      if (header === 'content-type') {\n        kb.add(\n          options.resource,\n          this.ns.rdf('type'),\n          kb.rdfFactory.namedNode(Util.mediaTypeClass(value).value),\n          responseNode\n        )\n      }\n    })\n\n    return responseNode\n  }\n\n  objectRefresh (term: NamedNode): void {\n    let uris = this.store.uris(term) // Get all URIs\n    if (typeof uris !== 'undefined') {\n      for (let i = 0; i < uris.length; i++) {\n        this.refresh(this.store.rdfFactory.namedNode(Uri.docpart(uris[i])))\n        // what about rterm?\n      }\n    }\n  }\n\n  /* refresh  Reload data from a given document\n  **\n  ** @param term - An RDF Named Node for the eodcument in question\n  ** @param userCallback - A function userCallback(ok, message, response)\n  */\n  refresh (\n    term: NamedNode,\n    userCallback?: UserCallback\n  ): void { // sources_refresh\n    this.fireCallbacks('refresh', arguments)\n\n    this.nowOrWhenFetched(term, { force: true, clearPreviousData: true },\n      userCallback)\n  }\n\n /* refreshIfExpired   Conditional refresh if Expired\n **\n ** @param term - An RDF Named Node for the eodcument in question\n ** @param userCallback - A function userCallback(ok, message, response)\n */\n  refreshIfExpired (\n    term: NamedNode,\n    userCallback: UserCallback\n  ): void {\n    let exp = this.getHeader(term, 'Expires')\n    if (!exp || (new Date(exp[0]).getTime()) <= (new Date().getTime())) {\n      this.refresh(term, userCallback)\n    } else {\n      userCallback(true, 'Not expired', {})\n    }\n  }\n\n  retract (term: Quad_Graph) { // sources_retract\n    this.store.removeMany(undefined, undefined, undefined, term)\n    if (term.value) {\n      delete this.requested[Uri.docpart(term.value)]\n    }\n    this.fireCallbacks('retract', arguments)\n  }\n\n  getState (docuri: string) {\n    if (typeof this.requested[docuri] === 'undefined') {\n      return 'unrequested'\n    } else if (this.requested[docuri] === true) {\n      return 'requested'\n    } else if (this.requested[docuri] === 'done') {\n      return 'fetched'\n    } else if (this.requested[docuri] === 'redirected') {\n      return this.getState(this.redirectedTo[docuri])\n    } else { // An non-200 HTTP error status\n      return 'failed'\n    }\n  }\n\n  isPending (docuri: string) { // sources_pending\n    // doing anyStatementMatching is wasting time\n    // if it's not pending: false -> flailed\n    //   'done' -> done 'redirected' -> redirected\n    return this.requested[docuri] === true\n  }\n\n  unload (term: NamedNode) {\n    this.store.removeDocument(term)\n    delete this.requested[term.value] // So it can be load2ed again\n  }\n\n  addHandler (handler: typeof Handler) {\n    this.handlers.push(handler);\n    (handler as any).register(this)\n  }\n\n  retryNoCredentials (\n    docuri: string,\n    options\n  ): Promise<Result> {\n    console.log('Fetcher: CORS: RETRYING with NO CREDENTIALS for ' + options.resource)\n\n    options.retriedWithNoCredentials = true // protect against being called twice\n\n    delete this.requested[docuri] // forget the original request happened\n    delete this.fetchQueue[docuri]\n    // Note: XHR property was withCredentials, but fetch property is just credentials\n    let newOptions = Object.assign({}, options, { credentials: 'omit' })\n\n    this.addStatus(options.req,\n      'Abort: Will retry with credentials SUPPRESSED to see if that helps')\n\n    return this.load(docuri, newOptions) as Promise<Result>\n  }\n\n  /**\n   * Tests whether a request is being made to a cross-site URI (for purposes\n   * of retrying with a proxy)\n   */\n  isCrossSite (uri: string): boolean {\n    // Mashup situation, not node etc\n    if (typeof document === 'undefined' || !document.location) {\n      return false\n    }\n\n    const hostpart = Uri.hostpart\n    const here = '' + document.location\n    return (hostpart(here) && hostpart(uri) && hostpart(here)) !== hostpart(uri)\n  }\n\n  /**\n   * Called when there's a network error in fetch(), or a response\n   * with status of 0.\n   */\n  handleError (\n    response: ExtendedResponse | Error,\n    docuri: string,\n    options: AutoInitOptions\n  ): Promise<ExtendedResponse | FetchError> {\n    if (this.isCrossSite(docuri)) {\n      // Make sure we haven't retried already\n      if (options.credentials && options.credentials === 'include' && !options.retriedWithNoCredentials) {\n        return this.retryNoCredentials(docuri, options)\n      }\n\n      // Now attempt retry via proxy\n      let proxyUri = Fetcher.crossSiteProxy(docuri)\n\n      if (proxyUri && !options.proxyUsed) {\n        console.log('web: Direct failed so trying proxy ' + proxyUri)\n\n        return this.redirectToProxy(proxyUri, options)\n      }\n    }\n\n    var message\n    if (response instanceof Error) {\n      message = 'Fetch error: ' + response.message\n    } else {\n      message = response.statusText\n      if (response.responseText) {\n        message += ` ${response.responseText}`\n      }\n    }\n\n    // This is either not a CORS error, or retries have been made\n    return this.failFetch(options, message, (response as Response).status || 998, (response as Response))\n  }\n\n  // deduce some things from the HTTP transaction\n  addType (\n    rdfType: NamedNode,\n    req: Quad_Subject,\n    kb: IndexedFormula,\n    locURI: string\n  ): void { // add type to all redirected resources too\n    let prev = req\n    if (locURI) {\n      var reqURI = kb.any(prev, this.ns.link('requestedURI'))\n      if (reqURI && reqURI.value !== locURI) {\n        kb.add(kb.rdfFactory.namedNode(locURI), this.ns.rdf('type'), rdfType, this.appNode)\n      }\n    }\n    for (;;) {\n      const doc = kb.any(prev, this.ns.link('requestedURI'))\n      if (doc && doc.value) {\n        kb.add(kb.rdfFactory.namedNode(doc.value), this.ns.rdf('type'), rdfType, this.appNode)\n      } // convert Literal\n      prev = kb.any(undefined, kb.rdfFactory.namedNode('http://www.w3.org/2007/ont/link#redirectedRequest'), prev) as Quad_Subject\n      if (!prev) { break }\n      var response = kb.any(prev, kb.rdfFactory.namedNode('http://www.w3.org/2007/ont/link#response'))\n      if (!response) { break }\n      var redirection = kb.any((response as NamedNode), kb.rdfFactory.namedNode('http://www.w3.org/2007/ont/http#status'))\n      if (!redirection) { break }\n      // @ts-ignore always true?\n      if ((redirection !== '301') && (redirection !== '302')) { break }\n    }\n  }\n\n  /**\n   * Handle fetch() response\n   */\n  handleResponse (\n    response: ExtendedResponse,\n    docuri: string,\n    options: AutoInitOptions\n  ): Promise<FetchError | ExtendedResponse> | ExtendedResponse {\n\n    const kb = this.store\n    const headers = (response as Response).headers\n\n    const reqNode = options.req\n\n    const responseNode = this.saveResponseMetadata(response, options)\n\n    const contentType = this.normalizedContentType(options, headers) || ''\n    let contentLocation = headers.get('content-location')\n\n    // this.fireCallbacks('recv', xhr.args)\n    // this.fireCallbacks('headers', [{uri: docuri, headers: xhr.headers}])\n\n    // Check for masked errors (CORS, etc)\n    if (response.status === 0) {\n      console.log('Masked error - status 0 for ' + docuri)\n      return this.handleError(response, docuri, options)\n    }\n\n    if (response.status >= 400) {\n      if (response.status === 404) {\n        this.nonexistent[options.original.value] = true\n        this.nonexistent[docuri] = true\n      }\n\n      return this.saveErrorResponse(response, responseNode)\n        .then(() => {\n          let errorMessage = options.resource + ' ' + response.statusText\n\n          return this.failFetch(options, errorMessage, response.status, response)\n        })\n    }\n\n    var diffLocation: null | string = null\n    var absContentLocation: null | string = null\n    if (contentLocation) {\n      absContentLocation = Uri.join(contentLocation, docuri)\n      if (absContentLocation !== docuri) {\n        diffLocation = absContentLocation\n      }\n    }\n    if (response.status === 200) {\n      this.addType(this.ns.link('Document') as NamedNode, reqNode, kb, docuri)\n      if (diffLocation) {\n        this.addType(this.ns.link('Document') as NamedNode, reqNode, kb,\n          diffLocation)\n      }\n\n      // Before we parse new data clear old but only on 200\n      if (options.clearPreviousData) {\n        kb.removeDocument(options.resource)\n      }\n\n      let isImage = contentType.includes('image/') ||\n        contentType.includes('application/pdf')\n\n      if (contentType && isImage) {\n        this.addType(kb.rdfFactory.namedNode('http://purl.org/dc/terms/Image'), reqNode, kb,\n          docuri)\n        if (diffLocation) {\n          this.addType(kb.rdfFactory.namedNode('http://purl.org/dc/terms/Image'), reqNode, kb,\n            diffLocation)\n        }\n      }\n    }\n\n    // If we have already got the thing at this location, abort\n    if (contentLocation) {\n      if (!options.force && diffLocation && this.requested[absContentLocation as string] === 'done') {\n        // we have already fetched this\n        // should we smush too?\n        // log.info(\"HTTP headers indicate we have already\" + \" retrieved \" +\n        // xhr.resource + \" as \" + absContentLocation + \". Aborting.\")\n        return this.doneFetch(options, response)\n      }\n\n      this.requested[absContentLocation as string] = true\n    }\n\n    this.parseLinkHeader(headers.get('link') as string, options.original, reqNode)\n\n    let handler = this.handlerForContentType(contentType, response) as Handler\n\n    if (!handler) {\n      //  Not a problem, we just don't extract data\n      this.addStatus(reqNode, 'Fetch over. No data handled.')\n      return this.doneFetch(options, response)\n    }\n\n    return response\n      .text()\n      // @ts-ignore Types seem right\n      .then(responseText => {\n        response.responseText = responseText\n        return (handler as N3Handler).parse(this, responseText, options, response)\n      })\n  }\n\n  saveErrorResponse (\n    response: ExtendedResponse,\n    responseNode: Quad_Subject\n  ): Promise<void> {\n    let kb = this.store\n\n    return response.text()\n      .then(content => {\n        if (content.length > 10) {\n          kb.add(responseNode, this.ns.http('content'), kb.rdfFactory.literal(content), responseNode)\n        }\n      })\n  }\n\n  handlerForContentType (contentType: string, response: ExtendedResponse): Handler | null {\n    if (!contentType) {\n      return null\n    }\n\n    let Handler = this.handlers.find(handler => {\n      return contentType.match(handler.pattern)\n    })\n\n    // @ts-ignore in practice all Handlers have constructors.\n    return Handler ? new Handler(response) : null\n  }\n\n  guessContentType (uri: string): ContentType | undefined {\n    return CONTENT_TYPE_BY_EXT[uri.split('.').pop() as string]\n  }\n\n  normalizedContentType (\n    options: AutoInitOptions,\n    headers: Headers\n  ): ContentType | string | null {\n    if (options.forceContentType) {\n      return options.forceContentType\n    }\n\n    let contentType = headers.get('content-type')\n    if (!contentType || contentType.includes('application/octet-stream')) {\n      let guess = this.guessContentType(options.resource.value)\n\n      if (guess) {\n        return guess\n      }\n    }\n\n    let protocol = Uri.protocol(options.resource.value) as string\n\n    if (!contentType && ['file', 'chrome'].includes(protocol)) {\n      return 'text/xml'\n    }\n\n    return contentType\n  }\n\n  /**\n   * Sends a new request to the specified uri. (Extracted from `onerrorFactory()`)\n   */\n  redirectToProxy (\n    newURI: string,\n    options: AutoInitOptions\n  ): Promise<ExtendedResponse | FetchError> {\n    this.addStatus(options.req, 'BLOCKED -> Cross-site Proxy to <' + newURI + '>')\n\n    options.proxyUsed = true\n\n    const kb = this.store\n    const oldReq = options.req  // request metadata blank node\n\n    if (!options.noMeta) {\n      kb.add(oldReq, this.ns.link('redirectedTo'), kb.rdfFactory.namedNode(newURI), oldReq)\n      this.addStatus(oldReq, 'redirected to new request') // why\n    }\n\n    this.requested[options.resource.value] = 'redirected'\n    this.redirectedTo[options.resource.value] = newURI\n\n    let newOptions = Object.assign({}, options)\n    newOptions.baseURI = options.resource.value\n\n    return this.fetchUri(newURI, newOptions)\n      .then(response => {\n        if (!newOptions.noMeta) {\n          kb.add(oldReq, this.ns.link('redirectedRequest'), newOptions.req, this.appNode)\n        }\n\n        return response\n      })\n  }\n\n  setRequestTimeout (\n    uri: string,\n    options: {\n      req: Quad_Subject\n      original: Quad_Subject\n    } & Options\n  ): Promise<number | FetchError> {\n    return new Promise((resolve) => {\n      this.timeouts[uri] = (this.timeouts[uri] || []).concat(setTimeout(() => {\n        if (this.isPending(uri) &&\n            !options.retriedWithNoCredentials &&\n            !options.proxyUsed) {\n          resolve(this.failFetch(options, `Request to ${uri} timed out`, 'timeout'))\n        }\n      }, this.timeout) as unknown as number)\n    })\n  }\n\n  addFetchCallback (\n    uri: string,\n    callback: UserCallback\n  ): void {\n    if (!this.fetchCallbacks[uri]) {\n      this.fetchCallbacks[uri] = [callback]\n    } else {\n      this.fetchCallbacks[uri].push(callback)\n    }\n  }\n\n  acceptString () {\n    let acceptstring = ''\n\n    for (let mediaType in this.mediatypes) {\n      if (acceptstring !== '') {\n        acceptstring += ', '\n      }\n\n      acceptstring += mediaType\n\n      for (let property in this.mediatypes[mediaType]) {\n        acceptstring += ';' + property + '=' + this.mediatypes[mediaType][property]\n      }\n    }\n\n    return acceptstring\n  }\n  // var updatesVia = new $rdf.UpdatesVia(this) // Subscribe to headers\n// @@@@@@@@ This is turned off because it causes a websocket to be set up for ANY fetch\n// whether we want to track it ot not. including ontologies loaed though the XSSproxy\n}\n\nFetcher.HANDLERS = defaultHandlers\nFetcher.CONTENT_TYPE_BY_EXT = CONTENT_TYPE_BY_EXT\n","import * as convert from './convert'\nimport Formula from './formula'\nimport Serializer from './serializer'\nimport {\n  ContentType,\n  JSONLDContentType,\n  N3ContentType,\n  N3LegacyContentType,\n  NQuadsAltContentType,\n  NQuadsContentType,\n  NTriplesContentType,\n  RDFXMLContentType,\n  TurtleContentType,\n  TurtleLegacyContentType,\n} from './types'\nimport IndexedFormula from './store'\nimport { BlankNode, NamedNode } from './tf-types'\n\n/**\n * Serialize to the appropriate format\n */\nexport default function serialize (\n  /** The graph or nodes that should be serialized */\n  target: Formula | NamedNode | BlankNode,\n  /** The store */\n  kb?: IndexedFormula,\n  base?: unknown,\n  /**\n   * The mime type.\n   * Defaults to Turtle.\n   */\n  contentType?: string | ContentType,\n  callback?: (err: Error | undefined | null, result?: string) => any,\n  options?: {\n    /**\n     * A string of letters, each of which set an options\n     * e.g. `deinprstux`\n     */\n    flags: string\n  }\n): string | undefined {\n  base = base || target.value\n  const opts = options || {}\n  contentType = contentType || TurtleContentType // text/n3 if complex?\n  var documentString: string | undefined = undefined\n  try {\n    var sz = Serializer(kb)\n    if ((opts as any).flags) sz.setFlags((opts as any).flags)\n    var newSts = kb!.statementsMatching(undefined, undefined, undefined, target as NamedNode)\n    var n3String: string\n    sz.suggestNamespaces(kb!.namespaces)\n    sz.setBase(base)\n    switch (contentType) {\n      case RDFXMLContentType:\n        documentString = sz.statementsToXML(newSts)\n        return executeCallback(null, documentString)\n      case N3ContentType:\n      case N3LegacyContentType:\n        documentString = sz.statementsToN3(newSts)\n        return executeCallback(null, documentString)\n      case TurtleContentType:\n      case TurtleLegacyContentType:\n        sz.setFlags('si') // Suppress = for sameAs and => for implies\n        documentString = sz.statementsToN3(newSts)\n        return executeCallback(null, documentString)\n      case NTriplesContentType:\n        sz.setFlags('deinprstux') // Suppress nice parts of N3 to make ntriples\n        documentString = sz.statementsToNTriples(newSts)\n        return executeCallback(null, documentString)\n      case JSONLDContentType:\n        sz.setFlags('deinprstux') // Use adapters to connect to incmpatible parser\n        n3String = sz.statementsToNTriples(newSts)\n        // n3String = sz.statementsToN3(newSts)\n        convert.convertToJson(n3String, callback)\n        break\n      case NQuadsContentType:\n      case NQuadsAltContentType: // @@@ just outpout the quads? Does not work for collections\n        sz.setFlags('deinprstux q') // Suppress nice parts of N3 to make ntriples\n        documentString = sz.statementsToNTriples(newSts) // q in flag means actually quads\n        return executeCallback(null, documentString)\n        // n3String = sz.statementsToN3(newSts)\n        // documentString = convert.convertToNQuads(n3String, callback)\n        // break\n      default:\n        throw new Error('Serialize: Content-type ' + contentType + ' not supported for data write.')\n    }\n  } catch (err) {\n    if (callback) {\n      // @ts-ignore\n      return callback(err, undefined)\n    }\n    throw err // Don't hide problems from caller in sync mode\n  }\n\n  function executeCallback (err: Error | null | undefined, result: string | undefined): string | undefined {\n    if (callback) {\n      callback(err, result)\n      return\n    } else {\n      return result as string\n    }\n  }\n}\n","// N3.js implementations of the RDF/JS core data types\n// See https://github.com/rdfjs/representation-task-force/blob/master/interface-spec.md\n\nimport namespaces from './IRIs';\nimport { isDefaultGraph } from './N3Util';\nconst { rdf, xsd } = namespaces;\n\n// eslint-disable-next-line prefer-const\nlet DEFAULTGRAPH;\nlet _blankNodeCounter = 0;\n\nconst escapedLiteral = /^\"(.*\".*)(?=\"[^\"]*$)/;\nconst quadId = /^<<(\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) (\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) (\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) ?(\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+)?>>$/;\n\n// ## DataFactory singleton\nconst DataFactory = {\n  namedNode,\n  blankNode,\n  variable,\n  literal,\n  defaultGraph,\n  quad,\n  triple: quad,\n};\nexport default DataFactory;\n\n// ## Term constructor\nexport class Term {\n  constructor(id) {\n    this.id = id;\n  }\n\n  // ### The value of this term\n  get value() {\n    return this.id;\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both terms were created by this library,\n    // equality can be computed through ids\n    if (other instanceof Term)\n      return this.id === other.id;\n    // Otherwise, compare term type and value\n    return !!other && this.termType === other.termType &&\n                      this.value    === other.value;\n  }\n\n  // ### Returns a plain object representation of this term\n  toJSON() {\n    return {\n      termType: this.termType,\n      value:    this.value,\n    };\n  }\n}\n\n\n// ## NamedNode constructor\nexport class NamedNode extends Term {\n  // ### The term type of this term\n  get termType() {\n    return 'NamedNode';\n  }\n}\n\n// ## Literal constructor\nexport class Literal extends Term {\n  // ### The term type of this term\n  get termType() {\n    return 'Literal';\n  }\n\n  // ### The text value of this literal\n  get value() {\n    return this.id.substring(1, this.id.lastIndexOf('\"'));\n  }\n\n  // ### The language of this literal\n  get language() {\n    // Find the last quotation mark (e.g., '\"abc\"@en-us')\n    const id = this.id;\n    let atPos = id.lastIndexOf('\"') + 1;\n    // If \"@\" it follows, return the remaining substring; empty otherwise\n    return atPos < id.length && id[atPos++] === '@' ? id.substr(atPos).toLowerCase() : '';\n  }\n\n  // ### The datatype IRI of this literal\n  get datatype() {\n    return new NamedNode(this.datatypeString);\n  }\n\n  // ### The datatype string of this literal\n  get datatypeString() {\n    // Find the last quotation mark (e.g., '\"abc\"^^http://ex.org/types#t')\n    const id = this.id, dtPos = id.lastIndexOf('\"') + 1;\n    const char = dtPos < id.length ? id[dtPos] : '';\n    // If \"^\" it follows, return the remaining substring\n    return char === '^' ? id.substr(dtPos + 2) :\n           // If \"@\" follows, return rdf:langString; xsd:string otherwise\n           (char !== '@' ? xsd.string : rdf.langString);\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both literals were created by this library,\n    // equality can be computed through ids\n    if (other instanceof Literal)\n      return this.id === other.id;\n    // Otherwise, compare term type, value, language, and datatype\n    return !!other && !!other.datatype &&\n                      this.termType === other.termType &&\n                      this.value    === other.value    &&\n                      this.language === other.language &&\n                      this.datatype.value === other.datatype.value;\n  }\n\n  toJSON() {\n    return {\n      termType: this.termType,\n      value:    this.value,\n      language: this.language,\n      datatype: { termType: 'NamedNode', value: this.datatypeString },\n    };\n  }\n}\n\n// ## BlankNode constructor\nexport class BlankNode extends Term {\n  constructor(name) {\n    super(`_:${name}`);\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'BlankNode';\n  }\n\n  // ### The name of this blank node\n  get value() {\n    return this.id.substr(2);\n  }\n}\n\nexport class Variable extends Term {\n  constructor(name) {\n    super(`?${name}`);\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'Variable';\n  }\n\n  // ### The name of this variable\n  get value() {\n    return this.id.substr(1);\n  }\n}\n\n// ## DefaultGraph constructor\nexport class DefaultGraph extends Term {\n  constructor() {\n    super('');\n    return DEFAULTGRAPH || this;\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'DefaultGraph';\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both terms were created by this library,\n    // equality can be computed through strict equality;\n    // otherwise, compare term types.\n    return (this === other) || (!!other && (this.termType === other.termType));\n  }\n}\n\n// ## DefaultGraph singleton\nDEFAULTGRAPH = new DefaultGraph();\n\n\n// ### Constructs a term from the given internal string ID\nexport function termFromId(id, factory) {\n  factory = factory || DataFactory;\n\n  // Falsy value or empty string indicate the default graph\n  if (!id)\n    return factory.defaultGraph();\n\n  // Identify the term type based on the first character\n  switch (id[0]) {\n  case '?':\n    return factory.variable(id.substr(1));\n  case '_':\n    return factory.blankNode(id.substr(2));\n  case '\"':\n    // Shortcut for internal literals\n    if (factory === DataFactory)\n      return new Literal(id);\n    // Literal without datatype or language\n    if (id[id.length - 1] === '\"')\n      return factory.literal(id.substr(1, id.length - 2));\n    // Literal with datatype or language\n    const endPos = id.lastIndexOf('\"', id.length - 1);\n    return factory.literal(id.substr(1, endPos - 1),\n            id[endPos + 1] === '@' ? id.substr(endPos + 2)\n                                   : factory.namedNode(id.substr(endPos + 3)));\n  case '<':\n    const components = quadId.exec(id);\n    return factory.quad(\n      termFromId(unescapeQuotes(components[1]), factory),\n      termFromId(unescapeQuotes(components[2]), factory),\n      termFromId(unescapeQuotes(components[3]), factory),\n      components[4] && termFromId(unescapeQuotes(components[4]), factory)\n    );\n  default:\n    return factory.namedNode(id);\n  }\n}\n\n// ### Constructs an internal string ID from the given term or ID string\nexport function termToId(term) {\n  if (typeof term === 'string')\n    return term;\n  if (term instanceof Term && term.termType !== 'Quad')\n    return term.id;\n  if (!term)\n    return DEFAULTGRAPH.id;\n\n  // Term instantiated with another library\n  switch (term.termType) {\n  case 'NamedNode':    return term.value;\n  case 'BlankNode':    return `_:${term.value}`;\n  case 'Variable':     return `?${term.value}`;\n  case 'DefaultGraph': return '';\n  case 'Literal':      return `\"${term.value}\"${\n    term.language ? `@${term.language}` :\n      (term.datatype && term.datatype.value !== xsd.string ? `^^${term.datatype.value}` : '')}`;\n  case 'Quad':\n    // To identify RDF* quad components, we escape quotes by doubling them.\n    // This avoids the overhead of backslash parsing of Turtle-like syntaxes.\n    return `<<${\n        escapeQuotes(termToId(term.subject))\n      } ${\n        escapeQuotes(termToId(term.predicate))\n      } ${\n        escapeQuotes(termToId(term.object))\n      }${\n        (isDefaultGraph(term.graph)) ? '' : ` ${termToId(term.graph)}`\n      }>>`;\n  default: throw new Error(`Unexpected termType: ${term.termType}`);\n  }\n}\n\n\n// ## Quad constructor\nexport class Quad extends Term {\n  constructor(subject, predicate, object, graph) {\n    super('');\n    this._subject   = subject;\n    this._predicate = predicate;\n    this._object    = object;\n    this._graph     = graph || DEFAULTGRAPH;\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'Quad';\n  }\n\n  get subject() {\n    return this._subject;\n  }\n\n  get predicate() {\n    return this._predicate;\n  }\n\n  get object() {\n    return this._object;\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  // ### Returns a plain object representation of this quad\n  toJSON() {\n    return {\n      termType:  this.termType,\n      subject:   this._subject.toJSON(),\n      predicate: this._predicate.toJSON(),\n      object:    this._object.toJSON(),\n      graph:     this._graph.toJSON(),\n    };\n  }\n\n  // ### Returns whether this object represents the same quad as the other\n  equals(other) {\n    return !!other && this._subject.equals(other.subject)     &&\n                      this._predicate.equals(other.predicate) &&\n                      this._object.equals(other.object)       &&\n                      this._graph.equals(other.graph);\n  }\n}\nexport { Quad as Triple };\n\n// ### Escapes the quotes within the given literal\nexport function escapeQuotes(id) {\n  return id.replace(escapedLiteral, (_, quoted) => `\"${quoted.replace(/\"/g, '\"\"')}`);\n}\n\n// ### Unescapes the quotes within the given literal\nexport function unescapeQuotes(id) {\n  return id.replace(escapedLiteral, (_, quoted) => `\"${quoted.replace(/\"\"/g, '\"')}`);\n}\n\n// ### Creates an IRI\nfunction namedNode(iri) {\n  return new NamedNode(iri);\n}\n\n// ### Creates a blank node\nfunction blankNode(name) {\n  return new BlankNode(name || `n3-${_blankNodeCounter++}`);\n}\n\n// ### Creates a literal\nfunction literal(value, languageOrDataType) {\n  // Create a language-tagged string\n  if (typeof languageOrDataType === 'string')\n    return new Literal(`\"${value}\"@${languageOrDataType.toLowerCase()}`);\n\n  // Automatically determine datatype for booleans and numbers\n  let datatype = languageOrDataType ? languageOrDataType.value : '';\n  if (datatype === '') {\n    // Convert a boolean\n    if (typeof value === 'boolean')\n      datatype = xsd.boolean;\n    // Convert an integer or double\n    else if (typeof value === 'number') {\n      if (Number.isFinite(value))\n        datatype = Number.isInteger(value) ? xsd.integer : xsd.double;\n      else {\n        datatype = xsd.double;\n        if (!Number.isNaN(value))\n          value = value > 0 ? 'INF' : '-INF';\n      }\n    }\n  }\n\n  // Create a datatyped literal\n  return (datatype === '' || datatype === xsd.string) ?\n    new Literal(`\"${value}\"`) :\n    new Literal(`\"${value}\"^^${datatype}`);\n}\n\n// ### Creates a variable\nfunction variable(name) {\n  return new Variable(name);\n}\n\n// ### Returns the default graph\nfunction defaultGraph() {\n  return DEFAULTGRAPH;\n}\n\n// ### Creates a quad\nfunction quad(subject, predicate, object, graph) {\n  return new Quad(subject, predicate, object, graph);\n}\n","/**\n *  RDF/XML PARSER\n *\n *  Parser believed to be in full positive RDF/XML parsing compliance\n *  with the possible exception of handling deprecated RDF attributes\n *  appropriately. Parser is believed to comply fully with other W3C\n *  and industry standards where appropriate (DOM, ECMAScript, &c.)\n *\n *  Author: David Sheets <dsheets@mit.edu>\n *\n * W3C® SOFTWARE NOTICE AND LICENSE\n * http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231\n * This work (and included software, documentation such as READMEs, or\n * other related items) is being provided by the copyright holders under\n * the following license. By obtaining, using and/or copying this work,\n * you (the licensee) agree that you have read, understood, and will\n * comply with the following terms and conditions.\n *\n * Permission to copy, modify, and distribute this software and its\n * documentation, with or without modification, for any purpose and\n * without fee or royalty is hereby granted, provided that you include\n * the following on ALL copies of the software and documentation or\n * portions thereof, including modifications:\n *\n * 1. The full text of this NOTICE in a location viewable to users of\n * the redistributed or derivative work.\n * 2. Any pre-existing intellectual property disclaimers, notices, or terms and\n * conditions. If none exist, the W3C Software Short Notice should be\n * included (hypertext is preferred, text is permitted) within the body\n * of any redistributed or derivative code.\n * 3. Notice of any changes or modifications to the files, including the\n * date changes were made. (We recommend you provide URIs to the location\n * from which the code is derived.)\n *\n * THIS SOFTWARE AND DOCUMENTATION IS PROVIDED \"AS IS,\" AND COPYRIGHT\n * HOLDERS MAKE NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED,\n * INCLUDING BUT NOT LIMITED TO, WARRANTIES OF MERCHANTABILITY OR FITNESS\n * FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE OR\n * DOCUMENTATION WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS,\n * TRADEMARKS OR OTHER RIGHTS.\n *\n * COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL\n * OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR\n * DOCUMENTATION.\n *\n * The name and trademarks of copyright holders may NOT be used in\n * advertising or publicity pertaining to the software without specific,\n * written prior permission. Title to copyright in this software and any\n * associated documentation will at all times remain with copyright\n * holders.\n */\n/**\n * @class RDFParser resource object tied to an RDFStore\n *\n * @author David Sheets <dsheets@mit.edu>\n *\n*/\nimport * as uriUtil from './uri'\n\n\nexport default class RDFParser {\n\n  /*\n   * @constructor\n   * @param {RDFStore} store An RDFStore object\n   */\n  constructor(store) {\n    /** Our triple store reference @private */\n\n    this.store = store /** Our identified blank nodes @private */\n    this.bnodes = {} /** A context for context-aware stores @private */\n    this.why = null /** Reification flag */\n    this.reify = false\n  }\n\n  /** Standard namespaces that we know how to handle @final\n   *  @member RDFParser\n   */\n  static ns = {'RDF': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#', 'RDFS': 'http://www.w3.org/2000/01/rdf-schema#'}\n\n  /** DOM Level 2 node type magic numbers @final\n   *  @member RDFParser\n   */\n  static nodeType = {'ELEMENT': 1, 'ATTRIBUTE': 2, 'TEXT': 3,\n    'CDATA_SECTION': 4, 'ENTITY_REFERENCE': 5,\n    'ENTITY': 6, 'PROCESSING_INSTRUCTION': 7,\n    'COMMENT': 8, 'DOCUMENT': 9, 'DOCUMENT_TYPE': 10,\n  'DOCUMENT_FRAGMENT': 11, 'NOTATION': 12}\n\n  /**\n   * Frame class for namespace and base URI lookups\n   * Base lookups will always resolve because the parser knows\n   * the default base.\n   *\n   * @private\n   */\n\n  frameFactory(parser, parent, element) {\n    return {'NODE': 1, 'ARC': 2, 'parent': parent, 'parser': parser, 'store': parser.store, 'element': element,\n      'lastChild': 0, 'base': null, 'lang': null, 'node': null, 'nodeType': null, 'listIndex': 1, 'rdfid': null, 'datatype': null, 'collection': false, /** Terminate the frame and notify the store that we're done */\n      'terminateFrame': function () {\n        if (this.collection) {\n          this.node.close()\n        }\n      },         /** Add a symbol of a certain type to the this frame */'addSymbol': function (type, uri) {\n        uri = uriUtil.join(uri, this.base)\n        this.node = this.store.sym(uri)\n\n        this.nodeType = type\n      },         /** Load any constructed triples into the store */'loadTriple': function () {\n        if (this.parent.parent.collection) {\n          this.parent.parent.node.append(this.node)\n        } else {\n          this.store.add(this.parent.parent.node, this.parent.node, this.node, this.parser.why)\n        }\n        if (this.parent.rdfid != null) {\n          // reify\n          var triple = this.store.sym(uriUtil.join('#' + this.parent.rdfid, this.base))\n          this.store.add(triple, this.store.sym(RDFParser.ns.RDF + 'type'), this.store.sym(RDFParser.ns.RDF + 'Statement'), this.parser.why)\n          this.store.add(triple, this.store.sym(RDFParser.ns.RDF + 'subject'), this.parent.parent.node, this.parser.why)\n          this.store.add(triple, this.store.sym(RDFParser.ns.RDF + 'predicate'), this.parent.node, this.parser.why)\n\n          this.store.add(triple, this.store.sym(RDFParser.ns.RDF + 'object'), this.node, this.parser.why)\n        }\n      },         /** Check if it's OK to load a triple */'isTripleToLoad': function () {\n        return (this.parent != null && this.parent.parent != null && this.nodeType === this.NODE && this.parent.nodeType ===\n        this.ARC && this.parent.parent.nodeType === this.NODE)\n      },         /** Add a symbolic node to this frame */'addNode': function (uri) {\n        this.addSymbol(this.NODE, uri)\n        if (this.isTripleToLoad()) {\n          this.loadTriple()\n        }\n      },         /** Add a collection node to this frame */'addCollection': function () {\n        this.nodeType = this.NODE\n        this.node = this.store.collection()\n        this.collection = true\n        if (this.isTripleToLoad()) {\n          this.loadTriple()\n        }\n      },         /** Add a collection arc to this frame */'addCollectionArc': function () {\n        this.nodeType = this.ARC\n      },         /** Add a bnode to this frame */'addBNode': function (id) {\n        if (id != null) {\n          if (this.parser.bnodes[id] != null) {\n            this.node = this.parser.bnodes[id]\n          } else {\n            this.node = this.parser.bnodes[id] = this.store.bnode()\n          }\n        } else {\n          this.node = this.store.bnode()\n        }\n        this.nodeType = this.NODE\n        if (this.isTripleToLoad()) {\n          this.loadTriple()\n        }\n      },         /** Add an arc or property to this frame */'addArc': function (uri) {\n        if (uri === RDFParser.ns.RDF + 'li') {\n          uri = RDFParser.ns.RDF + '_' + this.parent.listIndex\n          this.parent.listIndex++\n        }\n\n        this.addSymbol(this.ARC, uri)\n      },         /** Add a literal to this frame */'addLiteral': function (value) {\n        if (this.parent.datatype && this.parent.datatype !== RDFParser.ns.RDF +'langString') {\n          this.node = this.store.literal(value, this.store.sym(this.parent.datatype))\n        } else {\n          this.node = this.store.literal(value, this.lang)\n        }\n        this.nodeType = this.NODE\n        if (this.isTripleToLoad()) {\n          this.loadTriple()\n        }\n      }\n    }\n  }\n\n  // from the OpenLayers source .. needed to get around IE problems.\n  getAttributeNodeNS(node, uri, name) {\n    var attributeNode = null\n    if (node.getAttributeNodeNS) {\n      attributeNode = node.getAttributeNodeNS(uri, name)\n    } else {\n      var attributes = node.attributes\n      var potentialNode, fullName\n      for (var i = 0;i < attributes.length; ++i) {\n        potentialNode = attributes[i]\n        if (potentialNode.namespaceURI === uri) {\n          fullName = (potentialNode.prefix) ? (potentialNode.prefix + ':' + name) : name\n          if (fullName === potentialNode.nodeName) {\n            attributeNode = potentialNode\n            break\n          }\n        }\n      }\n    }\n    return attributeNode\n  }\n\n  /**\n   * Build our initial scope frame and parse the DOM into triples\n   * @param {DOMTree} document The DOM to parse\n   * @param {String} base The base URL to use\n   * @param {Object} why The context to which this resource belongs\n   */\n\n  parse(document, base, why) {\n    var children = document.childNodes // clean up for the next run\n    this.cleanParser() // figure out the root element\n    var root\n    if (document.nodeType === RDFParser.nodeType.DOCUMENT) {\n      for (var c = 0;c < children.length;c++) {\n        if (children[c].nodeType === RDFParser.nodeType.ELEMENT) {\n          root = children[c]\n          break\n        }\n      }\n    } else if (document.nodeType === RDFParser.nodeType.ELEMENT) {\n      root = document\n    } else {\n      throw new Error(\"RDFParser: can't find root in \" + base + '. Halting. ')\n    // return false\n    }\n    this.why = why // our topmost frame\n    var f = this.frameFactory(this)\n    this.base = base\n    f.base = base\n    f.lang = null // was '' but can't have langs like that 2015 (!)\n    this.parseDOM(this.buildFrame(f, root))\n    return true\n  }\n\n  parseDOM(frame) {\n    // a DOM utility function used in parsing\n    var rdfid\n    var elementURI = function (el) {\n      var result = ''\n      if (el.namespaceURI == null) {\n        throw new Error('RDF/XML syntax error: No namespace for ' + el.localName + ' in ' + this.base)\n      }\n      if (el.namespaceURI) {\n        result = result + el.namespaceURI\n      }\n      if (el.localName) {\n        result = result + el.localName\n      } else if (el.nodeName) {\n        if (el.nodeName.indexOf(':') >= 0)result = result + el.nodeName.split(':')[1]\n        else result = result + el.nodeName\n      }\n      return result\n    }.bind(this)\n    var dig = true // if we'll dig down in the tree on the next iter\n    while (frame.parent) {\n      var dom = frame.element\n      var attrs = dom.attributes\n      if (dom.nodeType === RDFParser.nodeType.TEXT || dom.nodeType === RDFParser.nodeType.CDATA_SECTION) {\n        // we have a literal\n        if (frame.parent.nodeType === frame.NODE) {\n          // must have had attributes, store as rdf:value\n          frame.addArc(RDFParser.ns.RDF + 'value')\n          frame = this.buildFrame(frame)\n        }\n        frame.addLiteral(dom.nodeValue)\n      } else if (elementURI(dom) !== RDFParser.ns.RDF + 'RDF') {\n        // not root\n        if (frame.parent && frame.parent.collection) {\n          // we're a collection element\n          frame.addCollectionArc()\n          frame = this.buildFrame(frame, frame.element)\n          frame.parent.element = null\n        }\n        if (!frame.parent || !frame.parent.nodeType || frame.parent.nodeType === frame.ARC) {\n          // we need a node\n          var about = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'about')\n          rdfid = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'ID')\n          if (about && rdfid) {\n            throw new Error('RDFParser: ' + dom.nodeName + ' has both rdf:id and rdf:about.' +\n              ' Halting. Only one of these' + ' properties may be specified on a' + ' node.')\n          }\n          if (!about && rdfid) {\n            frame.addNode('#' + rdfid.nodeValue)\n            dom.removeAttributeNode(rdfid)\n          } else if (about == null && rdfid == null) {\n            var bnid = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'nodeID')\n            if (bnid) {\n              frame.addBNode(bnid.nodeValue)\n              dom.removeAttributeNode(bnid)\n            } else {\n              frame.addBNode()\n            }\n          } else {\n            frame.addNode(about.nodeValue)\n            dom.removeAttributeNode(about)\n          }\n          // Typed nodes\n          var rdftype = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'type')\n          if (RDFParser.ns.RDF + 'Description' !== elementURI(dom)) {\n            rdftype = {'nodeValue': elementURI(dom)}\n          }\n          if (rdftype != null) {\n            this.store.add(frame.node, this.store.sym(RDFParser.ns.RDF + 'type'), this.store.sym(uriUtil.join(rdftype.nodeValue,\n              frame.base)), this.why)\n            if (rdftype.nodeName) {\n              dom.removeAttributeNode(rdftype)\n            }\n          }\n          // Property Attributes\n          for (var x = attrs.length - 1; x >= 0; x--) {\n            this.store.add(frame.node, this.store.sym(elementURI(attrs[x])), this.store.literal(attrs[x].nodeValue,\n              frame.lang), this.why)\n          }\n        } else {\n          // we should add an arc (or implicit bnode+arc)\n          frame.addArc(elementURI(dom)) // save the arc's rdf:ID if it has one\n          if (this.reify) {\n            rdfid = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'ID')\n            if (rdfid) {\n              frame.rdfid = rdfid.nodeValue\n              dom.removeAttributeNode(rdfid)\n            }\n          }\n          var parsetype = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'parseType')\n          var datatype = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'datatype')\n          if (datatype) {\n            frame.datatype = datatype.nodeValue\n            dom.removeAttributeNode(datatype)\n          }\n          if (parsetype) {\n            var nv = parsetype.nodeValue\n            if (nv === 'Literal') {\n              frame.datatype = RDFParser.ns.RDF + 'XMLLiteral'\n              frame = this.buildFrame(frame)\n              // Don't include the literal node, only its children\n              frame.addLiteral(dom.childNodes)\n              dig = false\n            } else if (nv === 'Resource') {\n              frame = this.buildFrame(frame, frame.element)\n              frame.parent.element = null\n              frame.addBNode()\n            } else if (nv === 'Collection') {\n              frame = this.buildFrame(frame, frame.element)\n              frame.parent.element = null\n              frame.addCollection()\n            }\n            dom.removeAttributeNode(parsetype)\n          }\n          if (attrs.length !== 0) {\n            var resource = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'resource')\n            var bnid2 = this.getAttributeNodeNS(dom, RDFParser.ns.RDF, 'nodeID')\n            frame = this.buildFrame(frame)\n            if (resource) {\n              frame.addNode(resource.nodeValue)\n              dom.removeAttributeNode(resource)\n            } else {\n              if (bnid2) {\n                frame.addBNode(bnid2.nodeValue)\n                dom.removeAttributeNode(bnid2)\n              } else {\n                frame.addBNode()\n              }\n            }\n            for (var x1 = attrs.length - 1; x1 >= 0; x1--) {\n              var f = this.buildFrame(frame)\n              f.addArc(elementURI(attrs[x1]))\n              if (elementURI(attrs[x1]) === RDFParser.ns.RDF + 'type') {\n                (this.buildFrame(f)).addNode(attrs[x1].nodeValue)\n              } else {\n                (this.buildFrame(f)).addLiteral(attrs[x1].nodeValue)\n              }\n            }\n          } else if (dom.childNodes.length === 0) {\n            (this.buildFrame(frame)).addLiteral('')\n          }\n        }\n      } // rdf:RDF\n      // dig dug\n      dom = frame.element\n      while (frame.parent) {\n        var pframe = frame\n        while (dom == null) {\n          frame = frame.parent\n          dom = frame.element\n        }\n        var candidate = dom.childNodes && dom.childNodes[frame.lastChild]\n        if (!candidate || !dig) {\n          frame.terminateFrame()\n          if (!(frame = frame.parent)) {\n            break\n          } // done\n          dom = frame.element\n          dig = true\n        } else if ((candidate.nodeType !== RDFParser.nodeType.ELEMENT &&\n          candidate.nodeType !== RDFParser.nodeType.TEXT &&\n          candidate.nodeType !== RDFParser.nodeType.CDATA_SECTION) ||\n          ((candidate.nodeType === RDFParser.nodeType.TEXT ||\n          candidate.nodeType === RDFParser.nodeType.CDATA_SECTION) &&\n          dom.childNodes.length !== 1)) {\n          frame.lastChild++\n        } else {\n          // not a leaf\n          frame.lastChild++\n          frame = this.buildFrame(pframe, dom.childNodes[frame.lastChild - 1])\n          break\n        }\n      }\n    } // while\n  }\n\n  /**\n   * Cleans out state from a previous parse run\n   * @private\n   */\n  cleanParser() {\n    this.bnodes = {}\n    this.why = null\n  }\n\n  /**\n   * Builds scope frame\n   * @private\n   */\n  buildFrame(parent, element) {\n    var frame = this.frameFactory(this, parent, element)\n    if (parent) {\n      frame.base = parent.base\n      frame.lang = parent.lang\n    }\n    if (!element || element.nodeType === RDFParser.nodeType.TEXT ||\n      element.nodeType === RDFParser.nodeType.CDATA_SECTION) {\n      return frame\n    }\n    var attrs = element.attributes\n    var base = element.getAttributeNode('xml:base')\n    if (base != null) {\n      frame.base = base.nodeValue\n      element.removeAttribute('xml:base')\n    }\n    var lang = element.getAttributeNode('xml:lang')\n    if (lang != null) {\n      frame.lang = lang.nodeValue\n      element.removeAttribute('xml:lang')\n    }\n    // remove all extraneous xml and xmlns attributes\n    for (var x = attrs.length - 1;x >= 0;x--) {\n      if (attrs[x].nodeName.substr(0, 3) === 'xml') {\n        if (attrs[x].name.slice(0, 6) === 'xmlns:') {\n          var uri = attrs[x].nodeValue // alert('base for namespac attr:'+this.base)\n          if (this.base) uri = uriUtil.join(uri, this.base)\n          this.store.setPrefixForURI(attrs[x].name.slice(6), uri)\n        }\n        //\t\talert('rdfparser: xml atribute: '+attrs[x].name) //@@\n        element.removeAttributeNode(attrs[x])\n      }\n    }\n    return frame\n  }\n}\n","import CanonicalDataFactory from \"./factories/canonical-data-factory\";\n\nexport function createXSD(localFactory = CanonicalDataFactory) {\n  return {\n    boolean: localFactory.namedNode(\"http://www.w3.org/2001/XMLSchema#boolean\"),\n    dateTime: localFactory.namedNode(\n      \"http://www.w3.org/2001/XMLSchema#dateTime\"\n    ),\n    decimal: localFactory.namedNode(\"http://www.w3.org/2001/XMLSchema#decimal\"),\n    double: localFactory.namedNode(\"http://www.w3.org/2001/XMLSchema#double\"),\n    integer: localFactory.namedNode(\"http://www.w3.org/2001/XMLSchema#integer\"),\n    langString: localFactory.namedNode(\n      \"http://www.w3.org/1999/02/22-rdf-syntax-ns#langString\"\n    ),\n    string: localFactory.namedNode(\"http://www.w3.org/2001/XMLSchema#string\"),\n  };\n}\n\nconst defaultXSD = createXSD(CanonicalDataFactory);\n\nexport default defaultXSD;\n","/*      Serialization of RDF Graphs\n**\n** Tim Berners-Lee 2006\n** This is was http://dig.csail.mit.edu/2005/ajar/ajaw/js/rdf/serialize.js\n** This is or was https://github.com/linkeddata/rdflib.js/blob/main/src/serializer.js\n** Licence: MIT\n*/\nimport NamedNode from './named-node'\nimport BlankNode from './blank-node'\nimport * as Uri from './uri'\nimport * as Util from './utils-js'\nimport CanonicalDataFactory from './factories/canonical-data-factory'\nimport { createXSD } from './xsd'\nimport solidNs from 'solid-namespace'\n\n\nexport default function createSerializer(store) {\n  return new Serializer(store);\n};\n\nexport class Serializer {\n  constructor(store) {\n    this.flags = ''\n    this.base = null\n\n    this.prefixes = [] // suggested prefixes\n    this.namespaces = [] // complementary\n    const nsKeys = Object.keys(solidNs())\n    for (const i in nsKeys) {\n      const uri = solidNs()[nsKeys[i]]('')\n      const prefix = nsKeys[i]\n      this.prefixes[uri] = prefix\n      this.namespaces[prefix] = uri\n    }\n\n    this.suggestPrefix('rdf', 'http://www.w3.org/1999/02/22-rdf-syntax-ns#') // XML code assumes this!\n    this.suggestPrefix('xml', 'reserved:reservedForFutureUse') // XML reserves xml: in the spec.\n\n    this.namespacesUsed = [] // Count actually used and so needed in @prefixes\n    this.keywords = ['a'] // The only one we generate at the moment\n    this.prefixchars = 'abcdefghijklmnopqustuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\n    this.incoming = null // Array not calculated yet\n    this.formulas = [] // remebering original formulae from hashes\n    this.store = store\n    this.rdfFactory = store.rdfFactory || CanonicalDataFactory\n    this.xsd = createXSD(this.rdfFactory)\n  }\n\n  setBase(base) {\n    this.base = base;\n    return this\n  }\n\n  setFlags(flags) {\n    this.flags = flags || '';\n    return this\n  }\n\n  toStr(x) {\n    var s = x.toNT()\n    if (x.termType === 'Graph') {\n      this.formulas[s] = x // remember as reverse does not work\n    }\n    return s\n  }\n\n  fromStr(s) {\n    if (s[0] === '{') {\n      var x = this.formulas[s]\n      if (!x) console.log('No formula object for ' + s)\n      return x\n    }\n    return this.store.fromNT(s)\n  }\n\n  /* Accumulate Namespaces\n  **\n  ** These are only hints.  If two overlap, only one gets used\n  ** There is therefore no guarantee in general.\n  */\n  suggestPrefix(prefix, uri) {\n    if (prefix.slice(0, 7) === 'default') return // Try to weed these out\n    if (prefix.slice(0, 2) === 'ns') return //  From others inferior algos\n    if (!prefix || !uri) return // empty strings not suitable\n    if (prefix in this.namespaces || uri in this.prefixes) return // already used\n    this.prefixes[uri] = prefix\n    this.namespaces[prefix] = uri\n  }\n\n  // Takes a namespace -> prefix map\n  suggestNamespaces(namespaces) {\n    for (var px in namespaces) {\n      this.suggestPrefix(px, namespaces[px])\n    }\n    return this\n  }\n\n  checkIntegrity() {\n    var p, ns\n    for (p in this.namespaces) {\n      if (this.prefixes[this.namespaces[p]] !== p) {\n        throw new Error('Serializer integity error 1: ' + p + ', ' +\n          this.namespaces[p] + ', ' + this.prefixes[this.namespaces[p]] + '!')\n      }\n    }\n    for (ns in this.prefixes) {\n      if (this.namespaces[this.prefixes[ns]] !== ns) {\n        throw new Error('Serializer integity error 2: ' + ns + ', ' +\n          this.prefixs[ns] + ', ' + this.namespaces[this.prefixes[ns]] + '!')\n      }\n    }\n  }\n\n  // Make up an unused prefix for a random namespace\n  makeUpPrefix(uri) {\n    var p = uri\n    function canUseMethod (pp) {\n      if (!this.validPrefix.test(pp)) return false // bad format\n      if (pp === 'ns') return false // boring\n      if (pp in this.namespaces) return false // already used\n      this.prefixes[uri] = pp\n      this.namespaces[pp] = uri\n      return pp\n    }\n    var canUse = canUseMethod.bind(this)\n\n    if ('#/'.indexOf(p[p.length - 1]) >= 0) p = p.slice(0, -1)\n    var slash = p.lastIndexOf('/')\n    if (slash >= 0) p = p.slice(slash + 1)\n    var i = 0\n    while (i < p.length) {\n      if (this.prefixchars.indexOf(p[i])) {\n        i++\n      } else {\n        break\n      }\n    }\n    p = p.slice(0, i)\n\n    if (p.length < 6 && (canUse(p))) return p // exact is best\n    if (canUse(p.slice(0, 3))) return p.slice(0, 3)\n    if (canUse(p.slice(0, 2))) return p.slice(0, 2)\n    if (canUse(p.slice(0, 4))) return p.slice(0, 4)\n    if (canUse(p.slice(0, 1))) return p.slice(0, 1)\n    if (canUse(p.slice(0, 5))) return p.slice(0, 5)\n    if (!this.validPrefix.test(p)) {\n      p = 'n' // Otherwise the loop below may never termimnate\n    }\n    for (var j = 0; ; j++) if (canUse(p.slice(0, 3) + j)) return p.slice(0, 3) + j\n  }\n\n  rootSubjects(sts) {\n    var incoming = {}\n    var subjects = {}\n    var allBnodes = {}\n\n    /* This scan is to find out which nodes will have to be the roots of trees\n    ** in the serialized form. This will be any symbols, and any bnodes\n    ** which hve more or less than one incoming arc, and any bnodes which have\n    ** one incoming arc but it is an uninterrupted loop of such nodes back to itself.\n    ** This should be kept linear time with repect to the number of statements.\n    ** Note it does not use any indexing of the store.\n    */\n    for (var i = 0; i < sts.length; i++) {\n      var st = sts[i]\n      var checkMentions = function (x) {\n        if (!incoming.hasOwnProperty(x)) incoming[x] = []\n        incoming[x].push(st.subject) // List of things which will cause this to be printed\n      }\n      var st2 = [st.subject, st.predicate, st.object]\n      st2.map(function (y) {\n        if (y.termType === 'BlankNode') {\n          allBnodes[y.toNT()] = true\n        } else if (y.termType === 'Collection') {\n          y.elements.forEach(function (z) {\n            checkMentions(z) // bnodes in collections important\n          })\n        }\n      })\n      checkMentions(sts[i].object)\n      var ss = subjects[this.toStr(st.subject)] // Statements with this as subject\n      if (!ss) ss = []\n      ss.push(st)\n      subjects[this.toStr(st.subject)] = ss // Make hash. @@ too slow for formula?\n    }\n\n    var roots = []\n    for (var xNT in subjects) {\n      if (!subjects.hasOwnProperty(xNT)) continue\n      var y = this.fromStr(xNT)\n      if ((y.termType !== 'BlankNode') || !incoming[y] || (incoming[y].length !== 1)) {\n        roots.push(y)\n        continue\n      }\n    }\n    this.incoming = incoming // Keep for serializing @@ Bug for nested formulas\n\n    // Now do the scan using existing roots\n    var rootsHash = {}\n    for (var k = 0; k < roots.length; k++) {\n      rootsHash[roots[k].toNT()] = true\n    }\n    return {'roots': roots, 'subjects': subjects,\n    'rootsHash': rootsHash, 'incoming': incoming}\n  }\n\n  // //////////////////////////////////////////////////////\n\n  toN3(f) {\n    return this.statementsToN3(f.statements)\n  }\n\n  _notQNameChars = '\\t\\r\\n !\"#$%&\\'()*.,+/;<=>?@[\\\\]^`{|}~'\n  _notNameChars =\n    (this._notQNameChars + ':')\n\n  explicitURI(uri) {\n    if (this.flags.indexOf('r') < 0 && this.base) {\n      uri = Uri.refTo(this.base, uri)\n    } else if (this.flags.indexOf('u') >= 0) { // Unicode encoding NTriples style\n      uri = backslashUify(uri)\n    } else {\n      uri = hexify(uri)\n    }\n    return '<' + uri + '>'\n  }\n\n  statementsToNTriples(sts) {\n    var sorted = sts.slice()\n    sorted.sort()\n    var str = ''\n    var rdfns = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'\n    var self = this\n    var kb = this.store\n    var factory = this.rdfFactory\n    var termToNT = function (x) {\n      if (x.termType !== 'Collection') {\n        return self.atomicTermToN3(x)\n      }\n      var list = x.elements\n      var rest = kb.sym(rdfns + 'nill')\n      for (var i = list.length - 1; i >= 0; i--) {\n        var bnode = factory.blankNode()\n        str += termToNT(bnode) + ' ' + termToNT(kb.sym(rdfns + 'first')) + ' ' + termToNT(list[i]) + '.\\n'\n        str += termToNT(bnode) + ' ' + termToNT(kb.sym(rdfns + 'rest')) + ' ' + termToNT(rest) + '.\\n'\n        rest = bnode\n      }\n      return self.atomicTermToN3(rest)\n    }\n    for (var i = 0; i < sorted.length; i++) {\n      var st = sorted[i]\n      var s = ''\n      s += termToNT(st.subject) + ' '\n      s += termToNT(st.predicate) + ' '\n      s += termToNT(st.object) + ' '\n      if (this.flags.indexOf('q') >= 0) { // Do quads not nrtiples\n        s += termToNT(st.why) + ' '\n      }\n      s += '.\\n'\n      str += s\n    }\n    return str\n  }\n\n  statementsToN3(sts) {\n    var indent = 4\n    var width = 80\n    var kb = this.store\n    // A URI Map alows us to put the type statemnts at the top.\n    var uriMap = {'http://www.w3.org/1999/02/22-rdf-syntax-ns#type': 'aaa:00'}\n    var SPO = function (x, y) { // Do limited canonicalization of bnodes\n      return Util.heavyCompareSPO(x, y, kb, uriMap)\n    }\n    sts.sort(SPO)\n\n    if (this.base && !this.defaultNamespace){\n      this.defaultNamespace = this.base + '#'\n    }\n\n    var predMap = {}\n    if (this.flags.indexOf('s') < 0) {\n      predMap['http://www.w3.org/2002/07/owl#sameAs'] = '='\n    }\n    if (this.flags.indexOf('t') < 0) {\n      predMap['http://www.w3.org/1999/02/22-rdf-syntax-ns#type'] = 'a'\n    }\n    if (this.flags.indexOf('i') < 0) {\n      predMap['http://www.w3.org/2000/10/swap/log#implies'] = '=>'\n    }\n    // //////////////////////// Arrange the bits of text\n\n    var spaces = function (n) {\n      var s = ''\n      for (var i = 0; i < n; i++) s += ' '\n      return s\n    }\n\n    var treeToLine = function (tree) {\n      var str = ''\n      for (var i = 0; i < tree.length; i++) {\n        var branch = tree[i]\n        var s2 = (typeof branch === 'string') ? branch : treeToLine(branch)\n        // Note the space before the dot in case statement ends 123. which is in fact allowed but be conservative.\n        if (i !== 0) {\n          var ch = str.slice(-1) || ' '\n          if (s2 === ',' || s2 === ';') {\n            // no gap\n          } else if (s2 === '.' && !('0123456789.'.includes(ch))) { // no gap except after number\n            // no gap\n          } else {\n            str += ' ' // separate from previous token\n          }\n        }\n        str += s2\n      }\n      return str\n    }\n\n    // Convert a nested tree of lists and strings to a string\n    var treeToString = function (tree, level) {\n      var str = ''\n      var lastLength = 100000\n      if (level === undefined) level = -1\n      for (var i = 0; i < tree.length; i++) {\n        var branch = tree[i]\n        if (typeof branch !== 'string') {\n          var substr = treeToString(branch, level + 1)\n          if (\n            substr.length < 10 * (width - indent * level) &&\n              substr.indexOf('\"\"\"') < 0) { // Don't mess up multiline strings\n            var line = treeToLine(branch)\n            if (line.length < (width - indent * level)) {\n              branch = line //   Note! treat as string below\n              substr = ''\n            }\n          }\n          if (substr) lastLength = 10000\n          str += substr\n        }\n        if (typeof branch === 'string') {\n          if (branch.length === 1 && str.slice(-1) === '\\n') {\n            if (',.;'.indexOf(branch) >= 0) {\n              str = str.slice(0, -1) + branch + '\\n' //  slip punct'n on end\n              lastLength += 1\n              continue\n            }\n          }\n          if (lastLength < (indent * level + 4) ||  // if new line not necessary\n            lastLength + branch.length + 1 < width && ';.'.indexOf(str[str.length - 2]) < 0) { // or the string fits on last line\n            str = str.slice(0, -1) + ' ' + branch + '\\n' // then continue on this line\n            lastLength += branch.length + 1\n          } else {\n            let line = spaces(indent * level) + branch\n            str += line + '\\n'\n            lastLength = line.length\n            if (level < 0) {\n              str += '\\n' // extra blank line\n              lastLength = 100000 // don't touch\n            }\n          }\n        }\n      }\n      return str\n    }\n\n    // //////////////////////////////////////////// Structure for N3\n    // Convert a set of statements into a nested tree of lists and strings\n    function statementListToTreeMethod (statements) {\n      var stats = this.rootSubjects(statements)\n      var roots = stats.roots\n      var results = []\n      for (var i = 0; i < roots.length; i++) {\n        var root = roots[i]\n        results.push(subjectTree(root, stats))\n      }\n      return results\n    }\n    var statementListToTree = statementListToTreeMethod.bind(this)\n\n    // The tree for a subject\n    function subjectTree (subject, stats) {\n      if (subject.termType === 'BlankNode' && !stats.incoming[subject]) {\n        return objectTree(subject, stats, true).concat(['.']) // Anonymous bnode subject\n      }\n      return [ termToN3(subject, stats) ].concat([propertyTree(subject, stats)]).concat(['.'])\n    }\n    // The property tree for a single subject or anonymous node\n    function propertyTreeMethod (subject, stats) {\n      var results = []\n      var lastPred = null\n      var sts = stats.subjects[this.toStr(subject)] || [] // relevant statements\n      if (typeof sts === 'undefined') {\n        throw new Error('Cant find statements for ' + subject)\n      }\n\n      var objects = []\n      for (var i = 0; i < sts.length; i++) {\n        var st = sts[i]\n        if (st.predicate.uri === lastPred) {\n          objects.push(',')\n        } else {\n          if (lastPred) {\n            results = results.concat([objects]).concat([';'])\n            objects = []\n          }\n          results.push(predMap[st.predicate.uri]\n            ? predMap[st.predicate.uri] : termToN3(st.predicate, stats))\n        }\n        lastPred = st.predicate.uri\n        objects.push(objectTree(st.object, stats))\n      }\n      results = results.concat([objects])\n      return results\n    }\n\n    var propertyTree = propertyTreeMethod.bind(this)\n\n    function objectTreeMethod(obj, stats, force) {\n      if (obj.termType === 'BlankNode' &&\n        (force || stats.rootsHash[obj.toNT()] === undefined)) {// if not a root\n        if (stats.subjects[this.toStr(obj)]) {\n          return ['[', propertyTree(obj, stats), ']']\n        } else {\n          return '[]'\n        }\n      }\n      return termToN3(obj, stats)\n    }\n\n    var objectTree = objectTreeMethod.bind(this)\n\n    function termToN3Method(expr, stats) { //\n      var i, res\n      switch (expr.termType) {\n        case 'Graph':\n          res = ['{']\n          res = res.concat(statementListToTree(expr.statements))\n          return res.concat(['}'])\n\n        case 'Collection':\n          res = ['(']\n          for (i = 0; i < expr.elements.length; i++) {\n            res.push([ objectTree(expr.elements[i], stats) ])\n          }\n          res.push(')')\n          return res\n\n        default:\n          return this.atomicTermToN3(expr)\n      }\n    }\n    Serializer.prototype.termToN3 = termToN3\n    var termToN3 = termToN3Method.bind(this)\n\n    function prefixDirectivesMethod () {\n      var str = ''\n      if (this.defaultNamespace) {\n        str += '@prefix : ' + this.explicitURI(this.defaultNamespace) + '.\\n'\n      }\n      for (var ns in this.prefixes) {\n        if (!this.prefixes.hasOwnProperty(ns)) continue\n        if (!this.namespacesUsed[ns]) continue\n        str += '@prefix ' + this.prefixes[ns] + ': ' + this.explicitURI(ns) +\n          '.\\n'\n      }\n      return str + '\\n'\n    }\n    var prefixDirectives = prefixDirectivesMethod.bind(this)\n    // Body of statementsToN3:\n    var tree = statementListToTree(sts)\n    return prefixDirectives() + treeToString(tree)\n  }\n  // //////////////////////////////////////////// Atomic Terms\n\n  //  Deal with term level things and nesting with no bnode structure\n  atomicTermToN3 (expr, stats) {\n    switch (expr.termType) {\n      case 'BlankNode':\n      case 'Variable':\n        return expr.toNT()\n      case 'Literal':\n        var val = expr.value\n        if (typeof val !== 'string') {\n          throw new TypeError('Value of RDF literal node must be a string')\n        }\n        // var val = expr.value.toString() // should be a string already\n        if (expr.datatype && this.flags.indexOf('x') < 0) { // Supress native numbers\n          switch (expr.datatype.uri) {\n\n            case 'http://www.w3.org/2001/XMLSchema#integer':\n              return val\n\n            case 'http://www.w3.org/2001/XMLSchema#decimal': // In urtle must have dot\n              if (val.indexOf('.') < 0) val += '.0'\n              return val\n\n            case 'http://www.w3.org/2001/XMLSchema#double': {\n              // Must force use of 'e'\n              const eNotation = val.toLowerCase().indexOf('e') > 0;\n              if (val.indexOf('.') < 0 && !eNotation) val += '.0'\n              if (!eNotation) val += 'e0'\n              return val\n            }\n\n            case 'http://www.w3.org/2001/XMLSchema#boolean':\n              return expr.value === '1' ? 'true' : 'false'\n          }\n        }\n        var str = this.stringToN3(expr.value)\n        if (expr.language) {\n          str += '@' + expr.language\n        } else if (!expr.datatype.equals(this.xsd.string)) {\n          str += '^^' + this.atomicTermToN3(expr.datatype, stats)\n        }\n        return str\n      case 'NamedNode':\n        return this.symbolToN3(expr)\n      default:\n        throw new Error('Internal: atomicTermToN3 cannot handle ' + expr + ' of termType: ' + expr.termType)\n    }\n  }\n\n  //  stringToN3:  String escaping for N3\n\n  validPrefix = new RegExp(/^[a-zA-Z][a-zA-Z0-9]*$/)\n\n  forbidden1 = new RegExp(/[\\\\\"\\b\\f\\r\\v\\t\\n\\u0080-\\uffff]/gm)\n  forbidden3 = new RegExp(/[\\\\\"\\b\\f\\r\\v\\u0080-\\uffff]/gm)\n  stringToN3(str, flags) {\n    if (!flags) flags = 'e'\n    var res = ''\n    var i, j, k\n    var delim\n    var forbidden\n    if (str.length > 20 && // Long enough to make sense\n        str.slice(-1) !== '\"' && // corner case'\n        flags.indexOf('n') < 0 && // Force single line\n        (str.indexOf('\\n') > 0 || str.indexOf('\"') > 0)) {\n      delim = '\"\"\"'\n      forbidden = this.forbidden3\n    } else {\n      delim = '\"'\n      forbidden = this.forbidden1\n    }\n    for (i = 0; i < str.length;) {\n      forbidden.lastIndex = 0\n      var m = forbidden.exec(str.slice(i))\n      if (m == null) break\n      j = i + forbidden.lastIndex - 1\n      res += str.slice(i, j)\n      var ch = str[j]\n      if (ch === '\"' && delim === '\"\"\"' && str.slice(j, j + 3) !== '\"\"\"') {\n        res += ch\n      } else {\n        k = '\\b\\f\\r\\t\\v\\n\\\\\"'.indexOf(ch) // No escaping of bell (7)?\n        if (k >= 0) {\n          res += '\\\\' + 'bfrtvn\\\\\"'[k]\n        } else {\n          if (flags.indexOf('e') >= 0) { // Unicode escaping in strings not unix style\n            res += '\\\\u' + ('000' +\n              ch.charCodeAt(0).toString(16).toLowerCase()).slice(-4)\n          } else { // no 'e' flag\n            res += ch\n          }\n        }\n      }\n      i = j + 1\n    }\n    return delim + res + str.slice(i) + delim\n  }\n  //  A single symbol, either in  <> or namespace notation\n\n  symbolToN3 (x) { // c.f. symbolString() in notation3.py\n    var uri = x.uri\n    var j = uri.indexOf('#')\n    if (j < 0 && this.flags.indexOf('/') < 0) {\n      j = uri.lastIndexOf('/')\n    }\n    if (j >= 0 && this.flags.indexOf('p') < 0 &&\n      // Can split at namespace but only if http[s]: URI or file: or ws[s] (why not others?)\n      (uri.indexOf('http') === 0 || uri.indexOf('ws') === 0 || uri.indexOf('file') === 0)) {\n      var canSplit = true\n      for (var k = j + 1; k < uri.length; k++) {\n        if (this._notNameChars.indexOf(uri[k]) >= 0) {\n          canSplit = false\n          break\n        }\n      }\n/*\n      if (uri.slice(0, j + 1) === this.base + '#') { // base-relative\n        if (canSplit) {\n          return ':' + uri.slice(j + 1) // assume deafult ns is local\n        } else {\n          return '<#' + uri.slice(j + 1) + '>'\n        }\n      }\n*/\n      if (canSplit) {\n        var localid = uri.slice(j + 1)\n        var namesp = uri.slice(0, j + 1)\n        if (this.defaultNamespace && this.defaultNamespace === namesp &&\n            this.flags.indexOf('d') < 0) { // d -> suppress default\n          if (this.flags.indexOf('k') >= 0 &&\n            this.keyords.indexOf(localid) < 0) {\n            return localid\n          }\n          return ':' + localid\n        }\n        // this.checkIntegrity() //  @@@ Remove when not testing\n        var prefix = this.prefixes[namesp]\n        if (!prefix) prefix = this.makeUpPrefix(namesp)\n        if (prefix) {\n          this.namespacesUsed[namesp] = true\n          return prefix + ':' + localid\n        }\n      // Fall though if can't do qname\n      }\n    }\n    return this.explicitURI(uri)\n  }\n\n  // /////////////////////////// Quad store serialization\n\n  // @para. write  - a function taking a single string to be output\n  //\n  writeStore(write) {\n    var kb = this.store\n    var fetcher = kb.fetcher\n    var session = fetcher && fetcher.appNode\n\n    // The core data\n\n    var sources = this.store.index[3]\n    for (var s in sources) { // -> assume we can use -> as short for log:semantics\n      var source = kb.fromNT(s)\n      if (session && source.equals(session)) continue\n      write('\\n' + this.atomicTermToN3(source) + ' ' +\n        this.atomicTermToN3(kb.sym('http://www.w3.org/2000/10/swap/log#semantics')) +\n          ' { ' + this.statementsToN3(kb.statementsMatching(\n          undefined, undefined, undefined, source)) + ' }.\\n')\n    }\n\n    // The metadata from HTTP interactions:\n\n    kb.statementsMatching(undefined,\n      kb.sym('http://www.w3.org/2007/ont/link#requestedURI')).map(\n      function (st) {\n        write('\\n<' + st.object.value + '> log:metadata {\\n')\n        var sts = kb.statementsMatching(undefined, undefined, undefined, st.subject)\n        write(this.statementsToN3(this.statementsToN3(sts)))\n        write('}.\\n')\n      })\n\n    // Inferences we have made ourselves not attributable to anyone else\n\n    var metaSources = []\n    if (session) metaSources.push(session)\n    var metadata = []\n    metaSources.map(function (source) {\n      metadata = metadata.concat(kb.statementsMatching(undefined, undefined, undefined, source))\n    })\n    write(this.statementsToN3(metadata))\n  }\n\n  // ////////////////////////////////////////////// XML serialization\n\n  statementsToXML(sts) {\n    var indent = 4\n    var width = 80\n\n    var namespaceCounts = [] // which have been used\n    namespaceCounts['http://www.w3.org/1999/02/22-rdf-syntax-ns#'] = true\n\n    var liPrefix = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#_' // prefix for ordered list items\n\n    // //////////////////////// Arrange the bits of XML text\n\n    var spaces = function (n) {\n      var s = ''\n      for (var i = 0; i < n; i++) s += ' '\n      return s\n    }\n\n    var XMLtreeToLine = function (tree) {\n      var str = ''\n      for (var i = 0; i < tree.length; i++) {\n        var branch = tree[i]\n        var s2 = (typeof branch === 'string') ? branch : XMLtreeToLine(branch)\n        str += s2\n      }\n      return str\n    }\n\n    // Convert a nested tree of lists and strings to a string\n    var XMLtreeToString = function (tree, level) {\n      var str = ''\n      var line\n      var lastLength = 100000\n      if (!level) level = 0\n      for (var i = 0; i < tree.length; i++) {\n        var branch = tree[i]\n        if (typeof branch !== 'string') {\n          var substr = XMLtreeToString(branch, level + 1)\n          if (\n            substr.length < 10 * (width - indent * level) &&\n            substr.indexOf('\"\"\"') < 0) { // Don't mess up multiline strings\n            line = XMLtreeToLine(branch)\n            if (line.length < (width - indent * level)) {\n              branch = '   ' + line //   @@ Hack: treat as string below\n              substr = ''\n            }\n          }\n          if (substr) lastLength = 10000\n          str += substr\n        }\n        if (typeof branch === 'string') {\n          if (lastLength < (indent * level + 4)) { // continue\n            str = str.slice(0, -1) + ' ' + branch + '\\n'\n            lastLength += branch.length + 1\n          } else {\n            line = spaces(indent * level) + branch\n            str += line + '\\n'\n            lastLength = line.length\n          }\n        } else { // not string\n        }\n      }\n      return str\n    }\n\n    function statementListToXMLTreeMethod (statements) {\n      this.suggestPrefix('rdf', 'http://www.w3.org/1999/02/22-rdf-syntax-ns#')\n      var stats = this.rootSubjects(statements)\n      var roots = stats.roots\n      var results = []\n      for (var i = 0; i < roots.length; i++) {\n        var root = roots[i]\n        results.push(subjectXMLTree(root, stats))\n      }\n      return results\n    }\n    var statementListToXMLTree = statementListToXMLTreeMethod.bind(this)\n\n    function escapeForXML (str) {\n      if (typeof str === 'undefined') return '@@@undefined@@@@'\n      return str.replace(/[&<\"]/g, function (m) {\n        switch (m[0]) {\n          case '&':\n            return '&amp;'\n          case '<':\n            return '&lt;'\n          case '\"':\n            return '&quot;' // '\n        }\n      })\n    }\n\n    function relURIMethod (term) {\n      return escapeForXML((this.base) ? Util.uri.refTo(this.base, term.uri) : term.uri)\n    }\n    var relURI = relURIMethod.bind(this)\n\n    // The tree for a subject\n    function subjectXMLTreeMethod (subject, stats) {\n      var results = []\n      var type, t, st, pred\n      var sts = stats.subjects[this.toStr(subject)] // relevant statements\n      if (typeof sts === 'undefined') { // empty bnode\n        return propertyXMLTree(subject, stats)\n      }\n\n      // Sort only on the predicate, leave the order at object\n      // level undisturbed.  This leaves multilingual content in\n      // the order of entry (for partner literals), which helps\n      // readability.\n      //\n      // For the predicate sort, we attempt to split the uri\n      // as a hint to the sequence\n      sts.sort(function (a, b) {\n        var ap = a.predicate.uri\n        var bp = b.predicate.uri\n        if (ap.substring(0, liPrefix.length) === liPrefix || bp.substring(0, liPrefix.length) === liPrefix) { // we're only interested in sorting list items\n          return ap.localeCompare(bp)\n        }\n\n        var as = ap.substring(liPrefix.length)\n        var bs = bp.substring(liPrefix.length)\n        var an = parseInt(as, 10)\n        var bn = parseInt(bs, 10)\n        if (isNaN(an) || isNaN(bn) ||\n          an !== as || bn !== bs) { // we only care about integers\n          return ap.localeCompare(bp)\n        }\n\n        return an - bn\n      })\n\n      for (var i = 0; i < sts.length; i++) {\n        st = sts[i]\n        // look for a type\n        if (st.predicate.uri === 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type' && !type && st.object.termType === 'NamedNode') {\n          type = st.object\n          continue // don't include it as a child element\n        }\n\n        // see whether predicate can be replaced with \"li\"\n        pred = st.predicate\n        if (pred.uri.substr(0, liPrefix.length) === liPrefix) {\n          var number = pred.uri.substr(liPrefix.length)\n          // make sure these are actually numeric list items\n          var intNumber = parseInt(number, 10)\n          if (number === intNumber.toString()) {\n            // was numeric; don't need to worry about ordering since we've already\n            // sorted the statements\n            pred = this.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#li')\n          }\n        }\n\n        t = qname(pred)\n        switch (st.object.termType) {\n          case 'BlankNode':\n            if (stats.incoming[st.object].length === 1) { // there should always be something in the incoming array for a bnode\n              results = results.concat(['<' + t + ' rdf:parseType=\"Resource\">',\n                subjectXMLTree(st.object, stats),\n                '</' + t + '>'])\n            } else {\n              results = results.concat(['<' + t + ' rdf:nodeID=\"' +\n                st.object.toNT().slice(2) + '\"/>'])\n            }\n            break\n          case 'NamedNode':\n            results = results.concat(['<' + t + ' rdf:resource=\"' +\n              relURI(st.object) + '\"/>'])\n            break\n          case 'Literal':\n            results = results.concat(['<' + t +\n            (st.object.datatype.equals(this.xsd.string)\n              ? ''\n              : ' rdf:datatype=\"' + escapeForXML(st.object.datatype.uri) + '\"') +\n            (st.object.language ? ' xml:lang=\"' + st.object.language + '\"' : '') +\n            '>' + escapeForXML(st.object.value) +\n            '</' + t + '>'])\n            break\n          case 'Collection':\n            results = results.concat(['<' + t + ' rdf:parseType=\"Collection\">',\n              collectionXMLTree(st.object, stats),\n              '</' + t + '>'])\n            break\n          default:\n            throw new Error(\"Can't serialize object of type \" + st.object.termType + ' into XML')\n        } // switch\n      }\n\n      var tag = type ? qname(type) : 'rdf:Description'\n\n      var attrs = ''\n      if (subject.termType === 'BlankNode') {\n        if (!stats.incoming[subject] || stats.incoming[subject].length !== 1) { // not an anonymous bnode\n          attrs = ' rdf:nodeID=\"' + subject.toNT().slice(2) + '\"'\n        }\n      } else {\n        attrs = ' rdf:about=\"' + relURI(subject) + '\"'\n      }\n\n      return [ '<' + tag + attrs + '>' ].concat([results]).concat(['</' + tag + '>'])\n    }\n\n    var subjectXMLTree = subjectXMLTreeMethod.bind(this)\n\n    function collectionXMLTree (subject, stats) {\n      var res = []\n      for (var i = 0; i < subject.elements.length; i++) {\n        res.push(subjectXMLTree(subject.elements[i], stats))\n      }\n      return res\n    }\n\n    // The property tree for a single subject or anonymos node\n    function propertyXMLTreeMethod (subject, stats) {\n      var results = []\n      var sts = stats.subjects[this.toStr(subject)] // relevant statements\n      if (!sts) return results // No relevant statements\n      sts.sort()\n      for (var i = 0; i < sts.length; i++) {\n        var st = sts[i]\n        switch (st.object.termType) {\n          case 'BlankNode':\n            if (stats.rootsHash[st.object.toNT()]) { // This bnode has been done as a root -- no content here @@ what bout first time\n              results = results.concat(['<' + qname(st.predicate) + ' rdf:nodeID=\"' + st.object.toNT().slice(2) + '\">',\n                '</' + qname(st.predicate) + '>'])\n            } else {\n              results = results.concat(['<' + qname(st.predicate) + ' rdf:parseType=\"Resource\">',\n                propertyXMLTree(st.object, stats),\n                '</' + qname(st.predicate) + '>'])\n            }\n            break\n          case 'NamedNode':\n            results = results.concat(['<' + qname(st.predicate) + ' rdf:resource=\"' +\n              relURI(st.object) + '\"/>'])\n            break\n          case 'Literal':\n            results = results.concat(['<' + qname(st.predicate) +\n              (st.object.datatype.equals(this.xsd.string) ? '' : ' rdf:datatype=\"' + escapeForXML(st.object.datatype.value) + '\"') +\n              (st.object.language ? ' xml:lang=\"' + st.object.language + '\"' : '') +\n              '>' + escapeForXML(st.object.value) +\n              '</' + qname(st.predicate) + '>'])\n            break\n          case 'Collection':\n            results = results.concat(['<' + qname(st.predicate) + ' rdf:parseType=\"Collection\">',\n              collectionXMLTree(st.object, stats),\n              '</' + qname(st.predicate) + '>'])\n            break\n          default:\n            throw new Error(\"Can't serialize object of type \" + st.object.termType + ' into XML')\n        } // switch\n      }\n      return results\n    }\n    var propertyXMLTree = propertyXMLTreeMethod.bind(this)\n\n    function qnameMethod (term) {\n      var uri = term.uri\n\n      var j = uri.indexOf('#')\n      if (j < 0 && this.flags.indexOf('/') < 0) {\n        j = uri.lastIndexOf('/')\n      }\n      if (j < 0) throw new Error('Cannot make qname out of <' + uri + '>')\n\n      for (var k = j + 1; k < uri.length; k++) {\n        if (this._notNameChars.indexOf(uri[k]) >= 0) {\n          throw new Error('Invalid character \"' + uri[k] + '\" cannot be in XML qname for URI: ' + uri)\n        }\n      }\n      var localid = uri.slice(j + 1)\n      var namesp = uri.slice(0, j + 1)\n      if (this.defaultNamespace && this.defaultNamespace === namesp &&\n        this.flags.indexOf('d') < 0) { // d -> suppress default\n        return localid\n      }\n      var prefix = this.prefixes[namesp]\n      if (!prefix) prefix = this.makeUpPrefix(namesp)\n      namespaceCounts[namesp] = true\n      return prefix + ':' + localid\n    }\n    var qname = qnameMethod.bind(this)\n\n    // Body of toXML:\n\n    var tree = statementListToXMLTree(sts)\n    var str = '<rdf:RDF'\n    if (this.defaultNamespace) {\n      str += ' xmlns=\"' + escapeForXML(this.defaultNamespace) + '\"'\n    }\n    for (var ns in namespaceCounts) {\n      if (!namespaceCounts.hasOwnProperty(ns)) continue\n      // Rel uris in xml ns is not strictly allowed in the XMLNS spec but needed in practice often\n      var ns2 = (this.base && this.flags.includes('z')) ? Util.uri.refTo(this.base, ns) : ns\n      str += '\\n xmlns:' + this.prefixes[ns] + '=\"' + escapeForXML(ns2) + '\"'\n    }\n    str += '>'\n\n    var tree2 = [str, tree, '</rdf:RDF>'] // @@ namespace declrations\n    return XMLtreeToString(tree2, -1)\n  } // End @@ body\n}\n\n// String escaping utilities\n\nfunction hexify (str) { // also used in parser\n  return encodeURI(str)\n}\n\nfunction backslashUify (str) {\n  var res = ''\n  var k\n  for (var i = 0; i < str.length; i++) {\n    k = str.charCodeAt(i)\n    if (k > 65535) {\n      res += '\\\\U' + ('00000000' + k.toString(16)).slice(-8) // convert to upper?\n    } else if (k > 126) {\n      res += '\\\\u' + ('0000' + k.toString(16)).slice(-4)\n    } else {\n      res += str[i]\n    }\n  }\n  return res\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","import Node from './node-internal'\nimport {\n  Bindings,\n  GraphType,\n  ObjectType,\n  PredicateType,\n  SubjectType,\n  DefaultGraphTermType,\n} from './types'\nimport DefaultGraphNode, { isDefaultGraph } from './default-graph'\nimport { Quad, DefaultGraph } from './tf-types'\n\nconst defaultGraph = new DefaultGraphNode()\n\n/** A Statement represents an RDF Triple or Quad. */\nexport default class Statement<\n    S extends SubjectType = SubjectType,\n    P extends PredicateType = PredicateType,\n    O extends ObjectType = ObjectType,\n    G extends GraphType = GraphType\n  >\n  implements Quad<S, P, O, G | DefaultGraph> {\n\n  /** The subject of the triple.  What the Statement is about. */\n  subject: S\n\n  /** The relationship which is asserted between the subject and object */\n  predicate: P\n\n  /** The thing or data value which is asserted to be related to the subject */\n  object: O\n\n  /**\n   * The graph param is a named node of the document in which the triple when\n   *  it is stored on the web.\n   */\n  graph: G | DefaultGraph\n\n  /**\n   * Construct a new statement\n   *\n   * @param subject - The subject of the triple.  What the fact is about\n   * @param predicate - The relationship which is asserted between the subject and object\n   * @param object - The thing or data value which is asserted to be related to the subject\n   * @param {NamedNode} graph - The document where the triple is or was or will be stored on the web.\n   *\n   * The graph param is a named node of the document in which the triple when it is stored\n   *  on the web. It exists because when you have read data from various places in the web,\n   *  the “graph” tells you _why_ you have the triple. (At the moment, it is just the\n   *  document, in future it could be an inference step)\n   *\n   * When you do UpdateManager.update() then the graph’s of all the statements must be the same,\n   *  and give the document you are patching. In future, we may have a more\n   *  powerful update() which can update more than one document.\n   */\n  constructor (\n    subject: S,\n    predicate: P,\n    object: O,\n    graph?: G | DefaultGraph,\n  ) {\n    this.subject = Node.fromValue(subject)\n    this.predicate = Node.fromValue(predicate)\n    this.object = Node.fromValue(object)\n    this.graph = graph == undefined ? defaultGraph : Node.fromValue(graph) // property currently used by rdflib\n  }\n\n  /** Alias for graph, favored by Tim */\n  get why () {\n    return this.graph\n  }\n\n  set why (g) {\n    this.graph = g\n  }\n\n  /**\n   * Checks whether two statements are the same\n   * @param other - The other statement\n   */\n  equals (other: Quad): boolean {\n    return (\n      other.subject.equals(this.subject) &&\n      other.predicate.equals(this.predicate) &&\n      other.object.equals(this.object) &&\n      other.graph.equals(this.graph)\n    )\n  }\n\n  /**\n   * Creates a statement with the bindings substituted\n   * @param bindings The bindings\n   */\n  substitute (bindings: Bindings): Statement {\n    const y = new Statement(\n      this.subject.substitute(bindings),\n      this.predicate.substitute(bindings),\n      this.object.substitute(bindings),\n      isDefaultGraph(this.graph) ? this.graph :\n        (this.graph as G).substitute(bindings)\n    ) // 2016\n    console.log('@@@ statement substitute:' + y)\n    return y\n  }\n\n  /** Creates a canonical string representation of this statement. */\n  toCanonical (): string {\n    let terms = [\n      this.subject.toCanonical(),\n      this.predicate.toCanonical(),\n      this.object.toCanonical()\n    ]\n    if (this.graph && this.graph.termType !== DefaultGraphTermType) {\n        terms.push(this.graph.toCanonical())\n    }\n    return terms.join(' ') + ' .'\n  }\n\n  /** Creates a n-triples string representation of this statement */\n  toNT (): string {\n    return [\n      this.subject.toNT(),\n      this.predicate.toNT(),\n      this.object.toNT(),\n    ].join(' ') + ' .'\n  }\n\n  /** Creates a n-quads string representation of this statement */\n  toNQ (): string {\n    return [\n      this.subject.toNT(),\n      this.predicate.toNT(),\n      this.object.toNT(),\n      isDefaultGraph(this.graph) ? '' : (this.graph as G).toNT()\n    ].join(' ') + ' .'\n  }\n\n  /** Creates a string representation of this statement */\n  toString (): string {\n    return this.toNT()\n  }\n}\n","import DataFactory from './factories/extended-term-factory'\nimport jsonldParser from './jsonldparser'\n// @ts-ignore is this injected?\nimport { Parser as N3jsParser } from 'n3'  // @@ Goal: remove this dependency\nimport N3Parser from './n3parser'\nimport { parseRDFaDOM } from './rdfaparser'\nimport RDFParser from './rdfxmlparser'\nimport sparqlUpdateParser from './patch-parser'\nimport * as Util from './utils-js'\nimport Formula from './formula'\nimport { ContentType, TurtleContentType, N3ContentType, RDFXMLContentType, XHTMLContentType, HTMLContentType, SPARQLUpdateContentType, SPARQLUpdateSingleMatchContentType, JSONLDContentType, NQuadsContentType, NQuadsAltContentType } from './types'\nimport { Quad } from './tf-types'\n\ntype CallbackFunc = (error: any, kb: Formula | null) => void\n\n/**\n * Parse a string and put the result into the graph kb.\n * Normal method is sync.\n * Unfortunately jsdonld is currently written to need to be called async.\n * Hence the mess below with executeCallback.\n * @param str - The input string to parse\n * @param kb - The store to use\n * @param base - The base URI to use\n * @param contentType - The MIME content type string for the input - defaults to text/turtle\n * @param [callback] - The callback to call when the data has been loaded\n */\nexport default function parse (\n  str: string,\n  kb: Formula,\n  base: string,\n  contentType: string | ContentType = 'text/turtle',\n  callback?: CallbackFunc\n) {\n  contentType = contentType || TurtleContentType\n  contentType = contentType.split(';')[0] as ContentType\n  try {\n    if (contentType === N3ContentType || contentType === TurtleContentType) {\n      var p = N3Parser(kb, kb, base, base, null, null, '', null)\n      p.loadBuf(str)\n      executeCallback()\n    } else if (contentType === RDFXMLContentType) {\n      var parser = new RDFParser(kb)\n      parser.parse(Util.parseXML(str), base, kb.sym(base))\n      executeCallback()\n    } else if (contentType === XHTMLContentType) {\n      parseRDFaDOM(Util.parseXML(str, {contentType: XHTMLContentType}), kb, base)\n      executeCallback()\n    } else if (contentType === HTMLContentType) {\n      parseRDFaDOM(Util.parseXML(str, {contentType: HTMLContentType}), kb, base)\n      executeCallback()\n    } else if ((contentType === SPARQLUpdateContentType) || (contentType === SPARQLUpdateSingleMatchContentType)) { // @@ we handle a subset\n      sparqlUpdateParser(str, kb, base)\n      executeCallback()\n    } else if (contentType === JSONLDContentType) {\n      jsonldParser(str, kb, base, executeCallback)\n    } else if (contentType === NQuadsContentType ||\n               contentType === NQuadsAltContentType) {\n      var n3Parser = new N3jsParser({ factory: DataFactory })\n      nquadCallback(null, str)\n    } else if (contentType === undefined) {\n      throw new Error(\"contentType is undefined\")\n    } else {\n      throw new Error(\"Don't know how to parse \" + contentType + ' yet')\n    }\n  } catch (e) {\n    // @ts-ignore\n    executeErrorCallback(e)\n  }\n\n  (parse as any).handled= {\n    'text/n3': true,\n    'text/turtle': true,\n    'application/rdf+xml': true,\n    'application/xhtml+xml': true,\n    'text/html': true,\n    'application/sparql-update': true,\n    'application/sparql-update-single-match': true,\n    'application/ld+json': true,\n    'application/nquads' : true,\n    'application/n-quads' : true\n  }\n\n  function executeCallback () {\n    if (callback) {\n      callback(null, kb)\n    } else {\n      return\n    }\n  }\n\n  function executeErrorCallback (e: Error): void {\n    if (\n      // TODO: Always true, what is the right behavior\n      contentType !== JSONLDContentType ||\n      // @ts-ignore always true?\n      contentType !== NQuadsContentType ||\n      // @ts-ignore always true?\n      contentType !== NQuadsAltContentType\n    ) {\n      if (callback) {\n        callback(e, kb)\n      } else {\n        let e2 = new Error('' + e + ' while trying to parse <' + base + '> as ' + contentType)\n        //@ts-ignore .cause is not a default error property\n        e2.cause = e\n        throw e2\n      }\n    }\n  }\n/*\n  function setJsonLdBase (doc, base) {\n    if (doc instanceof Array) {\n      return\n    }\n    if (!('@context' in doc)) {\n      doc['@context'] = {}\n    }\n    doc['@context']['@base'] = base\n  }\n*/\n  function nquadCallback (err?: Error | null, nquads?: string): void {\n    if (err) {\n      (callback as CallbackFunc)(err, kb)\n    }\n    try {\n      n3Parser.parse(nquads, tripleCallback)\n    } catch (err) {\n      (callback as CallbackFunc)(err, kb)\n    }\n  }\n\n  function tripleCallback (err: Error, triple: Quad) {\n    if (triple) {\n      kb.add(triple.subject, triple.predicate, triple.object, triple.graph)\n    } else {\n      (callback as CallbackFunc)(err, kb)\n    }\n  }\n}\n","import ClassOrder from './class-order'\nimport Collection from './collection'\nimport CanonicalDataFactory from './factories/canonical-data-factory'\nimport log from './log'\nimport RDFlibNamedNode from './named-node'\nimport Namespace from './namespace'\nimport Node from './node-internal'\nimport Serializer from './serialize'\nimport Statement from './statement'\nimport {\n  Bindings,\n  GraphTermType,\n} from './types'\nimport { isStatement } from './utils/terms'\nimport Variable from './variable'\nimport {\n  Indexable,\n  TFIDFactoryTypes,\n} from './factories/factory-types'\nimport { appliedFactoryMethods, arrayToStatements } from './utils'\nimport {\n  RdfJsDataFactory,\n  Quad_Graph,\n  Quad_Object,\n  Quad_Predicate,\n  Quad,\n  Quad_Subject,\n  Term,\n} from './tf-types'\nimport Fetcher from './fetcher'\nimport BlankNode from './blank-node'\nimport NamedNode from './named-node'\n\nexport interface FormulaOpts {\n  dataCallback?: (q: Quad) => void\n  rdfArrayRemove?: (arr: Quad[], q: Quad) => void\n  rdfFactory?: RdfJsDataFactory\n}\n\ninterface BooleanMap {\n  [uri: string]: boolean;\n}\n\ninterface MembersMap {\n  [uri: string]: Quad;\n}\n\ninterface UriMap {\n  [uri: string]: string;\n}\n\n/**\n * A formula, or store of RDF statements\n */\nexport default class Formula extends Node {\n  termType: typeof GraphTermType = GraphTermType\n\n  classOrder = ClassOrder.Graph\n\n  /**\n   * The accompanying fetcher instance.\n   *\n   * Is set by the fetcher when initialized.\n   */\n  fetcher?: Fetcher\n\n  isVar = 0\n\n  /**\n   * A namespace for the specified namespace's URI\n   * @param nsuri The URI for the namespace\n   */\n  ns = Namespace\n\n  /** The factory used to generate statements and terms */\n  rdfFactory: any\n\n  /**\n   * Initializes this formula\n   * @constructor\n   * @param statements - Initial array of statements\n   * @param constraints - initial array of constraints\n   * @param initBindings - initial bindings used in Query\n   * @param optional - optional\n   * @param opts\n   * @param opts.rdfFactory - The rdf factory that should be used by the store\n*/\n  constructor (\n    public statements: Array<Statement> = [],\n    public constraints: ReadonlyArray<any> = [],\n    public initBindings: ReadonlyArray<any> = [],\n    public optional: ReadonlyArray<any> = [],\n    opts: FormulaOpts = {}\n    ) {\n    super('')\n\n    this.rdfFactory = (opts && opts.rdfFactory) || CanonicalDataFactory\n    // Enable default factory methods on this while preserving factory context.\n    for(const factoryMethod of appliedFactoryMethods) {\n      this[factoryMethod] = (...args) => this.rdfFactory[factoryMethod](...args)\n    }\n  }\n\n  /** Add a statement from its parts\n   * @param subject - the first part of the statement\n   * @param predicate - the second part of the statement\n   * @param object - the third part of the statement\n   * @param graph - the last part of the statement\n   */\n  add (\n    subject: Quad_Subject | Quad | Quad[],\n    predicate?: Quad_Predicate,\n    object?: Term | string,\n    graph?: Quad_Graph\n  ): Statement | null | this | number {\n    if (arguments.length === 1) {\n      (subject as Quad[]).forEach(st => this.add(st.subject, st.predicate, st.object, st.graph))\n    }\n    return this.statements.push(this.rdfFactory.quad(subject, predicate, object, graph))\n  }\n\n  /** Add a statment object\n   * @param {Statement} statement - An existing constructed statement to add\n   */\n  addStatement (statement: Quad): Statement | null | this | number {\n    return this.add(statement)\n  }\n\n  /**\n   * Shortcut for adding blankNodes\n   * @param [id]\n   */\n  bnode (id?: string): BlankNode {\n    return this.rdfFactory.blankNode(id)\n  }\n\n  /**\n   * Adds all the statements to this formula\n   * @param statements - A collection of statements\n   */\n  addAll (statements: Quad[]): void {\n    statements.forEach(quad => {\n      this.add(quad.subject, quad.predicate, quad.object, quad.graph)\n    })\n  }\n\n  /** Follow link from one node, using one wildcard, looking for one\n  *\n  * For example, any(me, knows, null, profile)  - a person I know accoring to my profile .\n  * any(me, knows, null, null)  - a person I know accoring to anything in store .\n  * any(null, knows, me, null)  - a person who know me accoring to anything in store .\n  *\n  * @param s - A node to search for as subject, or if null, a wildcard\n  * @param p - A node to search for as predicate, or if null, a wildcard\n  * @param o - A node to search for as object, or if null, a wildcard\n  * @param g - A node to search for as graph, or if null, a wildcard\n  * @returns A node which match the wildcard position, or null\n  */\n  any(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): Node | null {\n    const st = this.anyStatementMatching(s, p, o, g)\n    if (st == null) {\n      return null\n    } else if (s == null) {\n      return st.subject\n    } else if (p == null) {\n      return st.predicate\n    } else if (o == null) {\n      return st.object\n    }\n\n    return null\n  }\n\n  /**\n   * Gets the value of a node that matches the specified pattern\n   * @param s The subject\n   * @param p The predicate\n   * @param o The object\n   * @param g The graph that contains the statement\n   */\n  anyValue(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): string | void {\n    const y = this.any(s, p, o, g)\n    return y ? y.value : void 0\n  }\n\n  /**\n   * Gets the first JavaScript object equivalent to a node based on the specified pattern\n   * @param s The subject\n   * @param p The predicate\n   * @param o The object\n   * @param g The graph that contains the statement\n   */\n  anyJS(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): any {\n    const y = this.any(s, p, o, g)\n    return y ? Node.toJS(y) : void 0\n  }\n\n  /**\n   * Gets the first statement that matches the specified pattern\n   */\n  anyStatementMatching(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): Statement | undefined {\n    let x = this.statementsMatching(s, p, o, g, true)\n    if (!x || x.length === 0) {\n      return undefined\n    }\n\n    return x[0]\n  }\n\n  /**\n   * Returns a unique index-safe identifier for the given term.\n   *\n   * Falls back to the rdflib hashString implementation if the given factory doesn't support id.\n   */\n  id (term: TFIDFactoryTypes): Indexable {\n    return this.rdfFactory.id(term)\n  }\n\n  /**\n   * Search the Store\n   * This is really a teaching method as to do this properly you would use IndexedFormula\n   *\n   * @param s - A node to search for as subject, or if null, a wildcard\n   * @param p - A node to search for as predicate, or if null, a wildcard\n   * @param o - A node to search for as object, or if null, a wildcard\n   * @param g - A node to search for as graph, or if null, a wildcard\n   * @param justOne - flag - stop when found one rather than get all of them?\n   * @returns {Array<Node>} - An array of nodes which match the wildcard position\n   */\n  statementsMatching<JustOne extends boolean = false>(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null,\n    justOne?: boolean\n  ): Statement[] {\n    const sts = this.statements.filter(st =>\n      (!s || s.equals(st.subject)) &&\n      (!p || p.equals(st.predicate)) &&\n      (!o || o.equals(st.object)) &&\n      (!g || g.equals(st.graph))\n    )\n\n    if (justOne) {\n      return sts.length === 0 ? [] : [sts[0]]\n    }\n\n    return sts\n  }\n\n  /**\n   * Finds the types in the list which have no *stored* subtypes\n   * These are a set of classes which provide by themselves complete\n   * information -- the other classes are redundant for those who\n   * know the class DAG.\n   * @param types A map of the types\n   */\n  bottomTypeURIs (types) {\n    let bots\n    let bottom\n    let elt\n    let i\n    let len\n    let ref\n    let subs\n    let v\n    bots = []\n    for (let k in types) {\n      if (!types.hasOwnProperty(k)) continue\n      v = types[k]\n      subs = this.each(\n        void 0,\n        this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'),\n        this.rdfFactory.namedNode(k)\n      )\n      bottom = true\n      i = 0\n      for (len = subs.length; i < len; i++) {\n        elt = subs[i]\n        ref = elt.uri\n        if (ref in types) { // the subclass is one we know\n          bottom = false\n          break\n        }\n      }\n      if (bottom) {\n        bots[k] = v\n      }\n    }\n    return bots\n  }\n\n  /** Creates a new collection */\n  collection (): Collection {\n    return new Collection()\n  }\n\n  /** Follow links from one node, using one wildcard.\n  *\n  * For example, each(me, knows, null, profile)  - people I know accoring to my profile .\n  * each(me, knows, null, null)  - people I know accoring to anything in store .\n  * each(null, knows, me, null)  - people who know me accoring to anything in store .\n  *\n  * @param s - A node to search for as subject, or if null, a wildcard\n  * @param p - A node to search for as predicate, or if null, a wildcard\n  * @param o - A node to search for as object, or if null, a wildcard\n  * @param g - A node to search for as graph, or if null, a wildcard\n  * @returns {Array<Node>} - An array of nodes which match the wildcard position\n  */\n  each(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): Node[] {\n    const results: Node[] = []\n    let sts = this.statementsMatching(s, p, o, g, false)\n    if (s == null) {\n      for (let i = 0, len = sts.length; i < len; i++) {\n        results.push(sts[i].subject)\n      }\n    } else if (p == null) {\n      for (let l = 0, len1 = sts.length; l < len1; l++) {\n        results.push(sts[l].predicate)\n      }\n    } else if (o == null) {\n      for (let m = 0, len2 = sts.length; m < len2; m++) {\n        results.push(sts[m].object)\n      }\n    } else if (g == null) {\n      for (let q = 0, len3 = sts.length; q < len3; q++) {\n        results.push(new NamedNode(sts[q].graph.value))\n      }\n    }\n\n    return results\n  }\n\n  /**\n   * Test whether this formula is equals to {other}\n   * @param other - The other formula\n   */\n  equals(other: Formula): boolean {\n    if (!other) {\n      return false\n    }\n    return this.hashString() === other.hashString()\n  }\n\n  /**\n   * For thisClass or any subclass, anything which has it is its type\n   * or is the object of something which has the type as its range, or subject\n   * of something which has the type as its domain\n   * We don't bother doing subproperty (yet?)as it doesn't seeem to be used\n   * much.\n   * Get all the Classes of which we can RDFS-infer the subject is a member\n   * @return a hash of URIs\n   */\n  findMembersNT (thisClass) {\n    let len2: number\n    let len4: number\n    let m: number\n    let members: MembersMap\n    let pred: Quad_Predicate\n    let ref\n    let ref1: Quad[]\n    let ref2: Term[]\n    let ref3: Quad[]\n    let ref4: Term[]\n    let ref5: Quad[]\n    let seeds\n    let st\n    let u: number\n    seeds = {}\n    seeds[thisClass.toNT()] = true\n    members = {}\n    ref = this.transitiveClosure(seeds, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), true)\n    for (let t in ref) {\n      if (!ref.hasOwnProperty(t)) continue\n      ref1 = this.statementsMatching(void 0,\n        this.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'),\n        this.fromNT(t))\n      for (let i = 0, len = ref1.length; i < len; i++) {\n        st = ref1[i]\n        members[st.subject.toNT()] = st\n      }\n      ref2 = this.each(void 0,\n        this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain'),\n        this.fromNT(t))\n      for (let l = 0, len1 = ref2.length; l < len1; l++) {\n        pred = ref2[l] as Quad_Predicate\n        ref3 = this.statementsMatching(void 0, pred)\n        for (m = 0, len2 = ref3.length; m < len2; m++) {\n          st = ref3[m]\n          members[st.subject.toNT()] = st\n        }\n      }\n      ref4 = this.each(void 0,\n        this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range'),\n        this.fromNT(t))\n      for (let q = 0, len3 = ref4.length; q < len3; q++) {\n        pred = ref4[q] as Quad_Predicate\n        ref5 = this.statementsMatching(void 0, pred)\n        for (u = 0, len4 = ref5.length; u < len4; u++) {\n          st = ref5[u]\n          members[st.object.toNT()] = st\n        }\n      }\n    }\n\n    return members\n  }\n\n  /**\n   * For thisClass or any subclass, anything which has it is its type\n   * or is the object of something which has the type as its range, or subject\n   * of something which has the type as its domain\n   * We don't bother doing subproperty (yet?)as it doesn't seeem to be used\n   * much.\n   * Get all the Classes of which we can RDFS-infer the subject is a member\n   * @param subject - A named node\n   */\n  findMemberURIs(subject: Node): UriMap {\n    return this.NTtoURI(this.findMembersNT(subject))\n  }\n\n  /**\n   * Get all the Classes of which we can RDFS-infer the subject is a superclass\n   * Returns a hash table where key is NT of type and value is statement why we\n   * think so.\n   * Does NOT return terms, returns URI strings.\n   * We use NT representations in this version because they handle blank nodes.\n   */\n  findSubClassesNT(subject: Node): { [uri: string]: boolean } {\n    let types = {}\n    types[subject.toNT()] = true\n    return this.transitiveClosure(\n      types,\n      this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'),\n      true\n    )\n  }\n\n  /**\n   * Get all the Classes of which we can RDFS-infer the subject is a subclass\n   * @param {RDFlibNamedNode} subject - The thing whose classes are to be found\n   * @returns a hash table where key is NT of type and value is statement why we\n   * think so.\n   * Does NOT return terms, returns URI strings.\n   * We use NT representations in this version because they handle blank nodes.\n   */\n  findSuperClassesNT(subject: Node): { [uri: string]: boolean } {\n    let types = {}\n    types[subject.toNT()] = true\n    return this.transitiveClosure(types,\n      this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), false)\n  }\n\n  /**\n   * Get all the Classes of which we can RDFS-infer the subject is a member\n   * todo: This will loop is there is a class subclass loop (Sublass loops are\n   * not illegal)\n   * @param {RDFlibNamedNode} subject - The thing whose classes are to be found\n   * @returns a hash table where key is NT of type and value is statement why we think so.\n   * Does NOT return terms, returns URI strings.\n   * We use NT representations in this version because they handle blank nodes.\n   */\n  findTypesNT (subject) {\n    let domain\n    let range\n    let rdftype\n    let ref\n    let ref1\n    let ref2\n    let ref3\n    let st\n    let types\n    rdftype = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type'\n    types = []\n    ref = this.statementsMatching(subject, void 0, void 0)\n    for (let i = 0, len = ref.length; i < len; i++) {\n      st = ref[i]\n      if (st.predicate.uri === rdftype) {\n        types[st.object.toNT()] = st\n      } else {\n        ref1 = this.each(\n          st.predicate,\n          this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain')\n        )\n        for (let l = 0, len1 = ref1.length; l < len1; l++) {\n          range = ref1[l]\n          types[range.toNT()] = st\n        }\n      }\n    }\n    ref2 = this.statementsMatching(void 0, void 0, subject)\n    for (let m = 0, len2 = ref2.length; m < len2; m++) {\n      st = ref2[m]\n      ref3 = this.each(\n        st.predicate,\n        this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range')\n      )\n      for (let q = 0, len3 = ref3.length; q < len3; q++) {\n        domain = ref3[q]\n        types[domain.toNT()] = st\n      }\n    }\n    return this.transitiveClosure(\n      types,\n      this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'),\n      false\n    )\n  }\n\n  /**\n   * Get all the Classes of which we can RDFS-infer the subject is a member\n   * todo: This will loop is there is a class subclass loop (Sublass loops are\n   * not illegal)\n   * Returns a hash table where key is NT of type and value is statement why we\n   * think so.\n   * Does NOT return terms, returns URI strings.\n   * We use NT representations in this version because they handle blank nodes.\n   * @param subject - A subject node\n   */\n  findTypeURIs(subject: Quad_Subject): UriMap {\n    return this.NTtoURI(this.findTypesNT(subject))\n  }\n\n  /** Trace statements which connect directly, or through bnodes\n   *\n   * @param subject - The node to start looking for statments\n   * @param doc - The document to be searched, or null to search all documents\n   * @returns an array of statements, duplicate statements are suppresssed.\n   */\n  connectedStatements(\n    subject: Quad_Subject,\n    doc: Quad_Graph,\n    excludePredicateURIs?: ReadonlyArray<string>\n  ): Statement[] {\n    excludePredicateURIs = excludePredicateURIs || []\n    let todo = [subject]\n    let done: { [k: string]: boolean } = {}\n    let doneArcs: { [k: string]: boolean }  = {}\n    let result: Statement[] = []\n    let self = this\n    let follow = function (x) {\n      let queue = function (x) {\n        if (x.termType === 'BlankNode' && !done[x.value]) {\n          done[x.value] = true\n          todo.push(x)\n        }\n      }\n      let sts = self.statementsMatching(null, null, x, doc)\n        .concat(self.statementsMatching(x, null, null, doc))\n      sts = sts.filter(function (st): boolean {\n        if (excludePredicateURIs![st.predicate.value]) return false\n        let hash = (st as Statement).toNT()\n        if (doneArcs[hash]) return false\n        doneArcs[hash] = true\n        return true\n      }\n      )\n      sts.forEach(function (st) {\n        queue(st.subject)\n        queue(st.object)\n      })\n      result = result.concat(sts)\n    }\n    while (todo.length) {\n      follow(todo.shift())\n    }\n    // console.log('' + result.length + ' statements about ' + subject)\n    return result\n  }\n\n  /**\n   * Creates a new empty formula\n   *\n   * @param _features - Not applicable, but necessary for typing to pass\n   */\n  formula(_features?: ReadonlyArray<string>): Formula {\n    return new Formula()\n  }\n\n  /**\n   * Transforms an NTriples string format into a Node.\n   * The blank node bit should not be used on program-external values; designed\n   * for internal work such as storing a blank node id in an HTML attribute.\n   * This will only parse the strings generated by the various toNT() methods.\n   */\n  fromNT (str) {\n    let dt, k, lang\n    switch (str[0]) {\n      case '<':\n        return this.sym(str.slice(1, -1))\n      case '\"':\n        lang = void 0\n        dt = void 0\n        k = str.lastIndexOf('\"')\n        if (k < str.length - 1) {\n          if (str[k + 1] === '@') {\n            lang = str.slice(k + 2)\n          } else if (str.slice(k + 1, k + 3) === '^^') {\n            dt = this.fromNT(str.slice(k + 3))\n          } else {\n            throw new Error(\"Can't convert string from NT: \" + str)\n          }\n        }\n        str = str.slice(1, k)\n        str = str.replace(/\\\\\"/g, '\"')\n        str = str.replace(/\\\\n/g, '\\n')\n        str = str.replace(/\\\\\\\\/g, '\\\\')\n        return this.rdfFactory.literal(str, lang || dt)\n      case '_':\n        return this.rdfFactory.blankNode(str.slice(2))\n      case '?':\n        return new Variable(str.slice(1))\n    }\n    throw new Error(\"Can't convert from NT: \" + str)\n  }\n\n  /** Returns true if this formula holds the specified statement(s) */\n  holds (s: any | any[], p?, o?, g?): boolean {\n    let i\n    if (arguments.length === 1) {\n      if (!s) {\n        return true\n      }\n      if (s instanceof Array) {\n        for (i = 0; i < s.length; i++) {\n          if (!this.holds(s[i])) {\n            return false\n          }\n        }\n        return true\n      } else if (isStatement(s)) {\n        return this.holds(s.subject, s.predicate, s.object, s.graph)\n      } else if (s.statements) {\n        return this.holds(s.statements)\n      }\n    }\n\n    let st = this.anyStatementMatching(s, p, o, g)\n    return st != null\n  }\n\n  /**\n   * Returns true if this formula holds the specified {statement}\n   */\n  holdsStatement (statement) {\n    return this.holds(\n      statement.subject,\n      statement.predicate,\n      statement.object,\n      statement.graph,\n    )\n  }\n\n  /**\n   * Used by the n3parser to generate list elements\n   * @param values - The values of the collection\n   * @param context - The store\n   * @return {BlankNode|Collection} - The term for the statement\n   */\n  list (values, context) {\n    if (context.rdfFactory.supports[\"COLLECTIONS\"]) {\n      const collection = context.rdfFactory.collection()\n      values.forEach(function (val) {\n        collection.append(val)\n      })\n      return collection\n    } else {\n      const node = context.rdfFactory.blankNode()\n      const statements = arrayToStatements(context.rdfFactory, node, values)\n      context.addAll(statements)\n      return node\n    }\n  }\n\n  /**\n   * Transform a collection of NTriple URIs into their URI strings\n   * @param t - Some iterable collection of NTriple URI strings\n   * @return A collection of the URIs as strings\n   * todo: explain why it is important to go through NT\n   */\n  NTtoURI (t) {\n    let k, v\n    let uris = {}\n    for (k in t) {\n      if (!t.hasOwnProperty(k)) continue\n      v = t[k]\n      if (k[0] === '<') {\n        uris[k.slice(1, -1)] = v\n      }\n    }\n    return uris\n  }\n\n  /**\n   * Serializes this formula\n   * @param base - The base string\n   * @param contentType - The content type of the syntax to use\n   * @param provenance - The provenance URI\n   */\n  serialize (base, contentType, provenance) {\n    let documentString\n    let sts\n    let sz\n    sz = Serializer(this)\n    sz.suggestNamespaces(this.ns)\n    sz.setBase(base)\n    if (provenance) {\n      sts = this.statementsMatching(void 0, void 0, void 0, provenance)\n    } else {\n      sts = this.statements\n    }\n    switch (\n    contentType != null ? contentType : 'text/n3') {\n      case 'application/rdf+xml':\n        documentString = sz.statementsToXML(sts)\n        break\n      case 'text/n3':\n      case 'text/turtle':\n        documentString = sz.statementsToN3(sts)\n        break\n      default:\n        throw new Error('serialize: Content-type ' + contentType +\n          ' not supported.')\n    }\n    return documentString\n  }\n\n  /**\n   * Creates a new formula with the substituting bindings applied\n   * @param bindings - The bindings to substitute\n   */\n  substitute<T extends Node = Formula>(bindings: Bindings): T {\n    let statementsCopy = this.statements.map(function (ea) {\n      return (ea as Statement).substitute(bindings)\n    })\n    console.log('Formula subs statmnts:' + statementsCopy)\n    const y = new Formula()\n    y.addAll(statementsCopy as Quad[])\n    console.log('indexed-form subs formula:' + y)\n    return y as unknown as T\n  }\n\n  sym (uri: string, name?): NamedNode {\n    if (name) {\n      throw new Error('This feature (kb.sym with 2 args) is removed. Do not assume prefix mappings.')\n    }\n    return this.rdfFactory.namedNode(uri)\n  }\n\n  /**\n   * Gets the node matching the specified pattern. Throws when no match could be made.\n   * @param s - The subject\n   * @param p - The predicate\n   * @param o - The object\n   * @param g - The graph that contains the statement\n   */\n  the (\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): Node | null | undefined {\n    let x = this.any(s, p, o, g)\n    if (x == null) {\n      log.error('No value found for the() {' + s + ' ' + p + ' ' + o + '}.')\n    }\n\n    return x\n  }\n\n  /**\n   * RDFS Inference\n   * These are hand-written implementations of a backward-chaining reasoner\n   * over the RDFS axioms.\n   * @param seeds - A hash of NTs of classes to start with\n   * @param predicate - The property to trace though\n   * @param inverse - Trace inverse direction\n   */\n  transitiveClosure(\n    seeds: BooleanMap,\n    predicate: Quad_Predicate,\n    inverse?: boolean\n  ): {\n    [uri: string]: boolean;\n  } {\n    let elt, i, len, s, sups, t\n    let agenda = {}\n    Object.assign(agenda, seeds)  // make a copy\n    let done = {}  // classes we have looked up\n    while (true) {\n      t = (function () {\n        for (let p in agenda) {\n          if (!agenda.hasOwnProperty(p)) continue\n          return p\n        }\n      })()\n      if (t == null) {\n        return done\n      }\n      sups = inverse ?\n        this.each(void 0, predicate, this.fromNT(t))\n        : this.each(this.fromNT(t) as Quad_Predicate, predicate)\n      for (i = 0, len = sups.length; i < len; i++) {\n        elt = sups[i]\n        s = elt.toNT()\n        if (s in done) {\n          continue\n        }\n        if (s in agenda) {\n          continue\n        }\n        agenda[s] = agenda[t]\n      }\n      done[t] = agenda[t]\n      delete agenda[t]\n    }\n  }\n\n  /**\n   * Finds the types in the list which have no *stored* supertypes\n   * We exclude the universal class, owl:Things and rdf:Resource, as it is\n   * information-free.\n   * @param types - The types\n   */\n  topTypeURIs(types: {\n    [id: string]: string | RDFlibNamedNode;\n  }): {\n    [id: string]: string | RDFlibNamedNode;\n  } {\n    let i\n    let j\n    let k\n    let len\n    let n\n    let ref\n    let tops\n    let v\n    tops = []\n    for (k in types) {\n      if (!types.hasOwnProperty(k)) continue\n      v = types[k]\n      n = 0\n      ref = this.each(\n        this.rdfFactory.namedNode(k),\n        this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf')\n      )\n      for (i = 0, len = ref.length; i < len; i++) {\n        j = ref[i]\n        if (j.uri !== 'http://www.w3.org/2000/01/rdf-schema#Resource') {\n          n++\n          break\n        }\n      }\n      if (!n) {\n        tops[k] = v\n      }\n    }\n    if (tops['http://www.w3.org/2000/01/rdf-schema#Resource']) {\n      delete tops['http://www.w3.org/2000/01/rdf-schema#Resource']\n    }\n    if (tops['http://www.w3.org/2002/07/owl#Thing']) {\n      delete tops['http://www.w3.org/2002/07/owl#Thing']\n    }\n    return tops\n  }\n\n  /**\n   * Serializes this formula to a string\n   */\n  toString(): string {\n    return '{' + this.statements.join('\\n') + '}'\n  }\n\n  /**\n   * Gets a new variable\n   * @param name - The variable's name\n   */\n  public variable(name: string): Variable {\n    return new Variable(name)\n  }\n\n  /**\n   * Gets the number of statements in this formula that matches the specified pattern\n   * @param s - The subject\n   * @param p - The predicate\n   * @param o - The object\n   * @param g - The graph that contains the statement\n   */\n  whether(\n    s?: Quad_Subject | null,\n    p?: Quad_Predicate | null,\n    o?: Quad_Object | null,\n    g?: Quad_Graph | null\n  ): number {\n    return this.statementsMatching(s, p, o, g, false).length\n  }\n}\n","import Collection from '../collection'\nimport CanonicalDataFactory from './canonical-data-factory'\nimport { ValueType, CollectionTermType } from '../types'\nimport { DataFactory, DefaultFactoryTypes, Feature, Indexable } from './factory-types'\nimport { isCollection, isVariable } from '../utils/terms'\nimport Variable from '../variable'\nimport { Term } from '../tf-types'\n\ninterface CollectionFactory extends DataFactory {\n  collection(elements: ReadonlyArray<ValueType>): Collection\n}\n\n/**\n * Data factory which also supports Collections\n *\n * Necessary for preventing circular dependencies.\n */\nconst ExtendedTermFactory: CollectionFactory = {\n  ...CanonicalDataFactory,\n\n  supports: {\n    [Feature.collections]: true,\n    [Feature.defaultGraphType]: false,\n    [Feature.equalsMethod]: true,\n    [Feature.identity]: false,\n    [Feature.id]: true,\n    [Feature.reversibleId]: false,\n    [Feature.variableType]: true,\n  },\n\n  /**\n   * Creates a new collection\n   * @param elements - The initial element\n   */\n  collection (elements: ReadonlyArray<ValueType>): Collection {\n    return new Collection(elements)\n  },\n\n  id (term: Term | DefaultFactoryTypes): Indexable {\n    if (isCollection(term)) {\n      return `( ${term.elements.map((e) => {\n        return this.id(e) }).join(', ')} )`\n    }\n\n    if (isVariable(term)) {\n      return Variable.toString(term)\n    }\n\n    return CanonicalDataFactory.id(term)\n  },\n\n  termToNQ (term: Term): string {\n    if (term.termType === CollectionTermType) {\n      return Collection.toNT(term)\n    }\n\n    return CanonicalDataFactory.termToNQ(term)\n  }\n}\n\nexport default ExtendedTermFactory\n","var global = typeof self !== 'undefined' ? self : this;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\nvar irrelevant = (function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}({}));\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {isKeyword} = require('./context');\nconst graphTypes = require('./graphTypes');\nconst types = require('./types');\nconst util = require('./util');\nconst JsonLdError = require('./JsonLdError');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Creates a merged JSON-LD node map (node ID => node).\n *\n * @param input the expanded JSON-LD to create a node map of.\n * @param [options] the options to use:\n *          [issuer] a jsonld.IdentifierIssuer to use to label blank nodes.\n *\n * @return the node map.\n */\napi.createMergedNodeMap = (input, options) => {\n  options = options || {};\n\n  // produce a map of all subjects and name each bnode\n  const issuer = options.issuer || new util.IdentifierIssuer('_:b');\n  const graphs = {'@default': {}};\n  api.createNodeMap(input, graphs, '@default', issuer);\n\n  // add all non-default graphs to default graph\n  return api.mergeNodeMaps(graphs);\n};\n\n/**\n * Recursively flattens the subjects in the given JSON-LD expanded input\n * into a node map.\n *\n * @param input the JSON-LD expanded input.\n * @param graphs a map of graph name to subject map.\n * @param graph the name of the current graph.\n * @param issuer the blank node identifier issuer.\n * @param name the name assigned to the current input if it is a bnode.\n * @param list the list to append to, null for none.\n */\napi.createNodeMap = (input, graphs, graph, issuer, name, list) => {\n  // recurse through array\n  if(types.isArray(input)) {\n    for(const node of input) {\n      api.createNodeMap(node, graphs, graph, issuer, undefined, list);\n    }\n    return;\n  }\n\n  // add non-object to list\n  if(!types.isObject(input)) {\n    if(list) {\n      list.push(input);\n    }\n    return;\n  }\n\n  // add values to list\n  if(graphTypes.isValue(input)) {\n    if('@type' in input) {\n      let type = input['@type'];\n      // rename @type blank node\n      if(type.indexOf('_:') === 0) {\n        input['@type'] = type = issuer.getId(type);\n      }\n    }\n    if(list) {\n      list.push(input);\n    }\n    return;\n  } else if(list && graphTypes.isList(input)) {\n    const _list = [];\n    api.createNodeMap(input['@list'], graphs, graph, issuer, name, _list);\n    list.push({'@list': _list});\n    return;\n  }\n\n  // Note: At this point, input must be a subject.\n\n  // spec requires @type to be named first, so assign names early\n  if('@type' in input) {\n    const types = input['@type'];\n    for(const type of types) {\n      if(type.indexOf('_:') === 0) {\n        issuer.getId(type);\n      }\n    }\n  }\n\n  // get name for subject\n  if(types.isUndefined(name)) {\n    name = graphTypes.isBlankNode(input) ?\n      issuer.getId(input['@id']) : input['@id'];\n  }\n\n  // add subject reference to list\n  if(list) {\n    list.push({'@id': name});\n  }\n\n  // create new subject or merge into existing one\n  const subjects = graphs[graph];\n  const subject = subjects[name] = subjects[name] || {};\n  subject['@id'] = name;\n  const properties = Object.keys(input).sort();\n  for(let property of properties) {\n    // skip @id\n    if(property === '@id') {\n      continue;\n    }\n\n    // handle reverse properties\n    if(property === '@reverse') {\n      const referencedNode = {'@id': name};\n      const reverseMap = input['@reverse'];\n      for(const reverseProperty in reverseMap) {\n        const items = reverseMap[reverseProperty];\n        for(const item of items) {\n          let itemName = item['@id'];\n          if(graphTypes.isBlankNode(item)) {\n            itemName = issuer.getId(itemName);\n          }\n          api.createNodeMap(item, graphs, graph, issuer, itemName);\n          util.addValue(\n            subjects[itemName], reverseProperty, referencedNode,\n            {propertyIsArray: true, allowDuplicate: false});\n        }\n      }\n      continue;\n    }\n\n    // recurse into graph\n    if(property === '@graph') {\n      // add graph subjects map entry\n      if(!(name in graphs)) {\n        graphs[name] = {};\n      }\n      api.createNodeMap(input[property], graphs, name, issuer);\n      continue;\n    }\n\n    // recurse into included\n    if(property === '@included') {\n      api.createNodeMap(input[property], graphs, graph, issuer);\n      continue;\n    }\n\n    // copy non-@type keywords\n    if(property !== '@type' && isKeyword(property)) {\n      if(property === '@index' && property in subject &&\n        (input[property] !== subject[property] ||\n        input[property]['@id'] !== subject[property]['@id'])) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; conflicting @index property detected.',\n          'jsonld.SyntaxError',\n          {code: 'conflicting indexes', subject});\n      }\n      subject[property] = input[property];\n      continue;\n    }\n\n    // iterate over objects\n    const objects = input[property];\n\n    // if property is a bnode, assign it a new id\n    if(property.indexOf('_:') === 0) {\n      property = issuer.getId(property);\n    }\n\n    // ensure property is added for empty arrays\n    if(objects.length === 0) {\n      util.addValue(subject, property, [], {propertyIsArray: true});\n      continue;\n    }\n    for(let o of objects) {\n      if(property === '@type') {\n        // rename @type blank nodes\n        o = (o.indexOf('_:') === 0) ? issuer.getId(o) : o;\n      }\n\n      // handle embedded subject or subject reference\n      if(graphTypes.isSubject(o) || graphTypes.isSubjectReference(o)) {\n        // skip null @id\n        if('@id' in o && !o['@id']) {\n          continue;\n        }\n\n        // relabel blank node @id\n        const id = graphTypes.isBlankNode(o) ?\n          issuer.getId(o['@id']) : o['@id'];\n\n        // add reference and recurse\n        util.addValue(\n          subject, property, {'@id': id},\n          {propertyIsArray: true, allowDuplicate: false});\n        api.createNodeMap(o, graphs, graph, issuer, id);\n      } else if(graphTypes.isValue(o)) {\n        util.addValue(\n          subject, property, o,\n          {propertyIsArray: true, allowDuplicate: false});\n      } else if(graphTypes.isList(o)) {\n        // handle @list\n        const _list = [];\n        api.createNodeMap(o['@list'], graphs, graph, issuer, name, _list);\n        o = {'@list': _list};\n        util.addValue(\n          subject, property, o,\n          {propertyIsArray: true, allowDuplicate: false});\n      } else {\n        // handle @value\n        api.createNodeMap(o, graphs, graph, issuer, name);\n        util.addValue(\n          subject, property, o, {propertyIsArray: true, allowDuplicate: false});\n      }\n    }\n  }\n};\n\n/**\n * Merge separate named graphs into a single merged graph including\n * all nodes from the default graph and named graphs.\n *\n * @param graphs a map of graph name to subject map.\n *\n * @return the merged graph map.\n */\napi.mergeNodeMapGraphs = graphs => {\n  const merged = {};\n  for(const name of Object.keys(graphs).sort()) {\n    for(const id of Object.keys(graphs[name]).sort()) {\n      const node = graphs[name][id];\n      if(!(id in merged)) {\n        merged[id] = {'@id': id};\n      }\n      const mergedNode = merged[id];\n\n      for(const property of Object.keys(node).sort()) {\n        if(isKeyword(property) && property !== '@type') {\n          // copy keywords\n          mergedNode[property] = util.clone(node[property]);\n        } else {\n          // merge objects\n          for(const value of node[property]) {\n            util.addValue(\n              mergedNode, property, util.clone(value),\n              {propertyIsArray: true, allowDuplicate: false});\n          }\n        }\n      }\n    }\n  }\n\n  return merged;\n};\n\napi.mergeNodeMaps = graphs => {\n  // add all non-default graphs to default graph\n  const defaultGraph = graphs['@default'];\n  const graphNames = Object.keys(graphs).sort();\n  for(const graphName of graphNames) {\n    if(graphName === '@default') {\n      continue;\n    }\n    const nodeMap = graphs[graphName];\n    let subject = defaultGraph[graphName];\n    if(!subject) {\n      defaultGraph[graphName] = subject = {\n        '@id': graphName,\n        '@graph': []\n      };\n    } else if(!('@graph' in subject)) {\n      subject['@graph'] = [];\n    }\n    const graph = subject['@graph'];\n    for(const id of Object.keys(nodeMap).sort()) {\n      const node = nodeMap[id];\n      // only add full subjects\n      if(!graphTypes.isSubjectReference(node)) {\n        graph.push(node);\n      }\n    }\n  }\n  return defaultGraph;\n};\n","// Parse a simple SPARL-Update subset syntax for patches.\n//\n//  This parses\n//   WHERE {xxx} DELETE {yyy} INSERT DATA {zzz}\n// (not necessarily in that order)\n// as though it were the n3\n//   <#query> patch:where {xxx}; patch:delete {yyy}; patch:insert {zzz}.\nimport N3Parser from './n3parser'\nimport Namespace from './namespace'\n\nexport default function sparqlUpdateParser (str, kb, base) {\n  var i, j, k\n  var keywords = [ 'INSERT', 'DELETE', 'WHERE' ]\n  var SQNS = Namespace('http://www.w3.org/ns/pim/patch#')\n  var p = N3Parser(kb, kb, base, base, null, null, '', null)\n  var clauses = {}\n\n  var badSyntax = function (uri, lines, str, i, why) {\n    return ('Line ' + (lines + 1) + ' of <' + uri + '>: Bad syntax:\\n   ' +\n    why + '\\n   at: \"' + str.slice(i, (i + 30)) + '\"')\n  }\n\n  // var check = function (next, last, message) {\n  //   if (next < 0) {\n  //     throw badSyntax(p._thisDoc, p.lines, str, j, last, message)\n  //   }\n  //   return next\n  // }\n  i = 0\n  var query = kb.sym(base + '#query') // Invent a URI for the query\n  clauses['query'] = query // A way of accessing it in its N3 model.\n\n  while (true) {\n    // console.log(\"A Now at i = \" + i)\n    j = p.skipSpace(str, i)\n    if (j < 0) {\n      return clauses\n    }\n    // console.log(\"B After space at j= \" + j)\n    if (str[j] === ';') {\n      i = p.skipSpace(str, j + 1)\n      if (i < 0) {\n        return clauses // Allow end in a\n      }\n      j = i\n    }\n    var found = false\n    for (k = 0; k < keywords.length; k++) {\n      var key = keywords[k]\n      if (str.slice(j, j + key.length) === key) {\n        i = p.skipSpace(str, j + key.length)\n        if (i < 0) {\n          throw badSyntax(p._thisDoc, p.lines, str, j + key.length, 'found EOF, needed {...} after ' + key)\n        }\n        if (((key === 'INSERT') || (key === 'DELETE')) && str.slice(i, i + 4) === 'DATA') { // Some wanted 'DATA'. Whatever\n          j = p.skipSpace(str, i + 4)\n          if (j < 0) {\n            throw badSyntax(p._thisDoc, p.lines, str, i + 4, 'needed {...} after INSERT DATA ' + key)\n          }\n          i = j\n        }\n        var res2 = []\n        j = p.node(str, i, res2) // Parse all the complexity of the clause\n\n        if (j < 0) {\n          throw badSyntax(p._thisDoc, p.lines, str, i,\n            'bad syntax or EOF in {...} after ' + key)\n        }\n        clauses[key.toLowerCase()] = res2[0]\n        kb.add(query, SQNS(key.toLowerCase()), res2[0]) // , kb.sym(base)\n        // key is the keyword and res2 has the contents\n        found = true\n        i = j\n      }\n    }\n    if (!found && str.slice(j, j + 7) === '@prefix') {\n      i = p.directive(str, j)\n      if (i < 0) {\n        throw badSyntax(p._thisDoc, p.lines, str, i,\n          'bad syntax or EOF after @prefix ')\n      }\n      // console.log(\"P before dot i= \" + i)\n      i = p.checkDot(str, i)\n      // console.log(\"Q after dot i= \" + i)\n      found = true\n    }\n    if (!found) {\n      // console.log(\"Bad syntax \" + j)\n      throw badSyntax(p._thisDoc, p.lines, str, j,\n        \"Unknown syntax at start of statememt: '\" + str.slice(j).slice(0, 20) + \"'\")\n    }\n  } // while\n// return clauses\n}\n","/**\n * Creates a continuation function with some arguments already applied.\n *\n * Useful as a shorthand when combined with other control flow functions. Any\n * arguments passed to the returned function are added to the arguments\n * originally passed to apply.\n *\n * @name apply\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {Function} fn - The function you want to eventually apply all\n * arguments to. Invokes with (arguments...).\n * @param {...*} arguments... - Any number of arguments to automatically apply\n * when the continuation is called.\n * @returns {Function} the partially-applied function\n * @example\n *\n * // using apply\n * async.parallel([\n *     async.apply(fs.writeFile, 'testfile1', 'test1'),\n *     async.apply(fs.writeFile, 'testfile2', 'test2')\n * ]);\n *\n *\n * // the same process without using apply\n * async.parallel([\n *     function(callback) {\n *         fs.writeFile('testfile1', 'test1', callback);\n *     },\n *     function(callback) {\n *         fs.writeFile('testfile2', 'test2', callback);\n *     }\n * ]);\n *\n * // It's possible to pass any number of additional arguments when calling the\n * // continuation:\n *\n * node> var fn = async.apply(sys.puts, 'one');\n * node> fn('two', 'three');\n * one\n * two\n * three\n */\nfunction apply(fn, ...args) {\n    return (...callArgs) => fn(...args,...callArgs);\n}\n\nfunction initialParams (fn) {\n    return function (...args/*, callback*/) {\n        var callback = args.pop();\n        return fn.call(this, args, callback);\n    };\n}\n\n/* istanbul ignore file */\n\nvar hasQueueMicrotask = typeof queueMicrotask === 'function' && queueMicrotask;\nvar hasSetImmediate = typeof setImmediate === 'function' && setImmediate;\nvar hasNextTick = typeof process === 'object' && typeof process.nextTick === 'function';\n\nfunction fallback(fn) {\n    setTimeout(fn, 0);\n}\n\nfunction wrap(defer) {\n    return (fn, ...args) => defer(() => fn(...args));\n}\n\nvar _defer;\n\nif (hasQueueMicrotask) {\n    _defer = queueMicrotask;\n} else if (hasSetImmediate) {\n    _defer = setImmediate;\n} else if (hasNextTick) {\n    _defer = process.nextTick;\n} else {\n    _defer = fallback;\n}\n\nvar setImmediate$1 = wrap(_defer);\n\n/**\n * Take a sync function and make it async, passing its return value to a\n * callback. This is useful for plugging sync functions into a waterfall,\n * series, or other async functions. Any arguments passed to the generated\n * function will be passed to the wrapped function (except for the final\n * callback argument). Errors thrown will be passed to the callback.\n *\n * If the function passed to `asyncify` returns a Promise, that promises's\n * resolved/rejected state will be used to call the callback, rather than simply\n * the synchronous return value.\n *\n * This also means you can asyncify ES2017 `async` functions.\n *\n * @name asyncify\n * @static\n * @memberOf module:Utils\n * @method\n * @alias wrapSync\n * @category Util\n * @param {Function} func - The synchronous function, or Promise-returning\n * function to convert to an {@link AsyncFunction}.\n * @returns {AsyncFunction} An asynchronous wrapper of the `func`. To be\n * invoked with `(args..., callback)`.\n * @example\n *\n * // passing a regular synchronous function\n * async.waterfall([\n *     async.apply(fs.readFile, filename, \"utf8\"),\n *     async.asyncify(JSON.parse),\n *     function (data, next) {\n *         // data is the result of parsing the text.\n *         // If there was a parsing error, it would have been caught.\n *     }\n * ], callback);\n *\n * // passing a function returning a promise\n * async.waterfall([\n *     async.apply(fs.readFile, filename, \"utf8\"),\n *     async.asyncify(function (contents) {\n *         return db.model.create(contents);\n *     }),\n *     function (model, next) {\n *         // `model` is the instantiated model object.\n *         // If there was an error, this function would be skipped.\n *     }\n * ], callback);\n *\n * // es2017 example, though `asyncify` is not needed if your JS environment\n * // supports async functions out of the box\n * var q = async.queue(async.asyncify(async function(file) {\n *     var intermediateStep = await processFile(file);\n *     return await somePromise(intermediateStep)\n * }));\n *\n * q.push(files);\n */\nfunction asyncify(func) {\n    if (isAsync(func)) {\n        return function (...args/*, callback*/) {\n            const callback = args.pop();\n            const promise = func.apply(this, args);\n            return handlePromise(promise, callback)\n        }\n    }\n\n    return initialParams(function (args, callback) {\n        var result;\n        try {\n            result = func.apply(this, args);\n        } catch (e) {\n            return callback(e);\n        }\n        // if result is Promise object\n        if (result && typeof result.then === 'function') {\n            return handlePromise(result, callback)\n        } else {\n            callback(null, result);\n        }\n    });\n}\n\nfunction handlePromise(promise, callback) {\n    return promise.then(value => {\n        invokeCallback(callback, null, value);\n    }, err => {\n        invokeCallback(callback, err && err.message ? err : new Error(err));\n    });\n}\n\nfunction invokeCallback(callback, error, value) {\n    try {\n        callback(error, value);\n    } catch (err) {\n        setImmediate$1(e => { throw e }, err);\n    }\n}\n\nfunction isAsync(fn) {\n    return fn[Symbol.toStringTag] === 'AsyncFunction';\n}\n\nfunction isAsyncGenerator(fn) {\n    return fn[Symbol.toStringTag] === 'AsyncGenerator';\n}\n\nfunction isAsyncIterable(obj) {\n    return typeof obj[Symbol.asyncIterator] === 'function';\n}\n\nfunction wrapAsync(asyncFn) {\n    if (typeof asyncFn !== 'function') throw new Error('expected a function')\n    return isAsync(asyncFn) ? asyncify(asyncFn) : asyncFn;\n}\n\n// conditionally promisify a function.\n// only return a promise if a callback is omitted\nfunction awaitify (asyncFn, arity = asyncFn.length) {\n    if (!arity) throw new Error('arity is undefined')\n    function awaitable (...args) {\n        if (typeof args[arity - 1] === 'function') {\n            return asyncFn.apply(this, args)\n        }\n\n        return new Promise((resolve, reject) => {\n            args[arity - 1] = (err, ...cbArgs) => {\n                if (err) return reject(err)\n                resolve(cbArgs.length > 1 ? cbArgs : cbArgs[0]);\n            };\n            asyncFn.apply(this, args);\n        })\n    }\n\n    return awaitable\n}\n\nfunction applyEach (eachfn) {\n    return function applyEach(fns, ...callArgs) {\n        const go = awaitify(function (callback) {\n            var that = this;\n            return eachfn(fns, (fn, cb) => {\n                wrapAsync(fn).apply(that, callArgs.concat(cb));\n            }, callback);\n        });\n        return go;\n    };\n}\n\nfunction _asyncMap(eachfn, arr, iteratee, callback) {\n    arr = arr || [];\n    var results = [];\n    var counter = 0;\n    var _iteratee = wrapAsync(iteratee);\n\n    return eachfn(arr, (value, _, iterCb) => {\n        var index = counter++;\n        _iteratee(value, (err, v) => {\n            results[index] = v;\n            iterCb(err);\n        });\n    }, err => {\n        callback(err, results);\n    });\n}\n\nfunction isArrayLike(value) {\n    return value &&\n        typeof value.length === 'number' &&\n        value.length >= 0 &&\n        value.length % 1 === 0;\n}\n\n// A temporary value used to identify if the loop should be broken.\n// See #1064, #1293\nconst breakLoop = {};\n\nfunction once(fn) {\n    function wrapper (...args) {\n        if (fn === null) return;\n        var callFn = fn;\n        fn = null;\n        callFn.apply(this, args);\n    }\n    Object.assign(wrapper, fn);\n    return wrapper\n}\n\nfunction getIterator (coll) {\n    return coll[Symbol.iterator] && coll[Symbol.iterator]();\n}\n\nfunction createArrayIterator(coll) {\n    var i = -1;\n    var len = coll.length;\n    return function next() {\n        return ++i < len ? {value: coll[i], key: i} : null;\n    }\n}\n\nfunction createES2015Iterator(iterator) {\n    var i = -1;\n    return function next() {\n        var item = iterator.next();\n        if (item.done)\n            return null;\n        i++;\n        return {value: item.value, key: i};\n    }\n}\n\nfunction createObjectIterator(obj) {\n    var okeys = obj ? Object.keys(obj) : [];\n    var i = -1;\n    var len = okeys.length;\n    return function next() {\n        var key = okeys[++i];\n        if (key === '__proto__') {\n            return next();\n        }\n        return i < len ? {value: obj[key], key} : null;\n    };\n}\n\nfunction createIterator(coll) {\n    if (isArrayLike(coll)) {\n        return createArrayIterator(coll);\n    }\n\n    var iterator = getIterator(coll);\n    return iterator ? createES2015Iterator(iterator) : createObjectIterator(coll);\n}\n\nfunction onlyOnce(fn) {\n    return function (...args) {\n        if (fn === null) throw new Error(\"Callback was already called.\");\n        var callFn = fn;\n        fn = null;\n        callFn.apply(this, args);\n    };\n}\n\n// for async generators\nfunction asyncEachOfLimit(generator, limit, iteratee, callback) {\n    let done = false;\n    let canceled = false;\n    let awaiting = false;\n    let running = 0;\n    let idx = 0;\n\n    function replenish() {\n        //console.log('replenish')\n        if (running >= limit || awaiting || done) return\n        //console.log('replenish awaiting')\n        awaiting = true;\n        generator.next().then(({value, done: iterDone}) => {\n            //console.log('got value', value)\n            if (canceled || done) return\n            awaiting = false;\n            if (iterDone) {\n                done = true;\n                if (running <= 0) {\n                    //console.log('done nextCb')\n                    callback(null);\n                }\n                return;\n            }\n            running++;\n            iteratee(value, idx, iterateeCallback);\n            idx++;\n            replenish();\n        }).catch(handleError);\n    }\n\n    function iterateeCallback(err, result) {\n        //console.log('iterateeCallback')\n        running -= 1;\n        if (canceled) return\n        if (err) return handleError(err)\n\n        if (err === false) {\n            done = true;\n            canceled = true;\n            return\n        }\n\n        if (result === breakLoop || (done && running <= 0)) {\n            done = true;\n            //console.log('done iterCb')\n            return callback(null);\n        }\n        replenish();\n    }\n\n    function handleError(err) {\n        if (canceled) return\n        awaiting = false;\n        done = true;\n        callback(err);\n    }\n\n    replenish();\n}\n\nvar eachOfLimit = (limit) => {\n    return (obj, iteratee, callback) => {\n        callback = once(callback);\n        if (limit <= 0) {\n            throw new RangeError('concurrency limit cannot be less than 1')\n        }\n        if (!obj) {\n            return callback(null);\n        }\n        if (isAsyncGenerator(obj)) {\n            return asyncEachOfLimit(obj, limit, iteratee, callback)\n        }\n        if (isAsyncIterable(obj)) {\n            return asyncEachOfLimit(obj[Symbol.asyncIterator](), limit, iteratee, callback)\n        }\n        var nextElem = createIterator(obj);\n        var done = false;\n        var canceled = false;\n        var running = 0;\n        var looping = false;\n\n        function iterateeCallback(err, value) {\n            if (canceled) return\n            running -= 1;\n            if (err) {\n                done = true;\n                callback(err);\n            }\n            else if (err === false) {\n                done = true;\n                canceled = true;\n            }\n            else if (value === breakLoop || (done && running <= 0)) {\n                done = true;\n                return callback(null);\n            }\n            else if (!looping) {\n                replenish();\n            }\n        }\n\n        function replenish () {\n            looping = true;\n            while (running < limit && !done) {\n                var elem = nextElem();\n                if (elem === null) {\n                    done = true;\n                    if (running <= 0) {\n                        callback(null);\n                    }\n                    return;\n                }\n                running += 1;\n                iteratee(elem.value, elem.key, onlyOnce(iterateeCallback));\n            }\n            looping = false;\n        }\n\n        replenish();\n    };\n};\n\n/**\n * The same as [`eachOf`]{@link module:Collections.eachOf} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name eachOfLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfLimit\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`. The `key` is the item's key, or index in the case of an\n * array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n */\nfunction eachOfLimit$1(coll, limit, iteratee, callback) {\n    return eachOfLimit(limit)(coll, wrapAsync(iteratee), callback);\n}\n\nvar eachOfLimit$2 = awaitify(eachOfLimit$1, 4);\n\n// eachOf implementation optimized for array-likes\nfunction eachOfArrayLike(coll, iteratee, callback) {\n    callback = once(callback);\n    var index = 0,\n        completed = 0,\n        {length} = coll,\n        canceled = false;\n    if (length === 0) {\n        callback(null);\n    }\n\n    function iteratorCallback(err, value) {\n        if (err === false) {\n            canceled = true;\n        }\n        if (canceled === true) return\n        if (err) {\n            callback(err);\n        } else if ((++completed === length) || value === breakLoop) {\n            callback(null);\n        }\n    }\n\n    for (; index < length; index++) {\n        iteratee(coll[index], index, onlyOnce(iteratorCallback));\n    }\n}\n\n// a generic version of eachOf which can handle array, object, and iterator cases.\nfunction eachOfGeneric (coll, iteratee, callback) {\n    return eachOfLimit$2(coll, Infinity, iteratee, callback);\n}\n\n/**\n * Like [`each`]{@link module:Collections.each}, except that it passes the key (or index) as the second argument\n * to the iteratee.\n *\n * @name eachOf\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEachOf\n * @category Collection\n * @see [async.each]{@link module:Collections.each}\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each\n * item in `coll`.\n * The `key` is the item's key, or index in the case of an array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n * @example\n *\n * // dev.json is a file containing a valid json object config for dev environment\n * // dev.json is a file containing a valid json object config for test environment\n * // prod.json is a file containing a valid json object config for prod environment\n * // invalid.json is a file with a malformed json object\n *\n * let configs = {}; //global variable\n * let validConfigFileMap = {dev: 'dev.json', test: 'test.json', prod: 'prod.json'};\n * let invalidConfigFileMap = {dev: 'dev.json', test: 'test.json', invalid: 'invalid.json'};\n *\n * // asynchronous function that reads a json file and parses the contents as json object\n * function parseFile(file, key, callback) {\n *     fs.readFile(file, \"utf8\", function(err, data) {\n *         if (err) return calback(err);\n *         try {\n *             configs[key] = JSON.parse(data);\n *         } catch (e) {\n *             return callback(e);\n *         }\n *         callback();\n *     });\n * }\n *\n * // Using callbacks\n * async.forEachOf(validConfigFileMap, parseFile, function (err) {\n *     if (err) {\n *         console.error(err);\n *     } else {\n *         console.log(configs);\n *         // configs is now a map of JSON data, e.g.\n *         // { dev: //parsed dev.json, test: //parsed test.json, prod: //parsed prod.json}\n *     }\n * });\n *\n * //Error handing\n * async.forEachOf(invalidConfigFileMap, parseFile, function (err) {\n *     if (err) {\n *         console.error(err);\n *         // JSON parse error exception\n *     } else {\n *         console.log(configs);\n *     }\n * });\n *\n * // Using Promises\n * async.forEachOf(validConfigFileMap, parseFile)\n * .then( () => {\n *     console.log(configs);\n *     // configs is now a map of JSON data, e.g.\n *     // { dev: //parsed dev.json, test: //parsed test.json, prod: //parsed prod.json}\n * }).catch( err => {\n *     console.error(err);\n * });\n *\n * //Error handing\n * async.forEachOf(invalidConfigFileMap, parseFile)\n * .then( () => {\n *     console.log(configs);\n * }).catch( err => {\n *     console.error(err);\n *     // JSON parse error exception\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.forEachOf(validConfigFileMap, parseFile);\n *         console.log(configs);\n *         // configs is now a map of JSON data, e.g.\n *         // { dev: //parsed dev.json, test: //parsed test.json, prod: //parsed prod.json}\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * //Error handing\n * async () => {\n *     try {\n *         let result = await async.forEachOf(invalidConfigFileMap, parseFile);\n *         console.log(configs);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // JSON parse error exception\n *     }\n * }\n *\n */\nfunction eachOf(coll, iteratee, callback) {\n    var eachOfImplementation = isArrayLike(coll) ? eachOfArrayLike : eachOfGeneric;\n    return eachOfImplementation(coll, wrapAsync(iteratee), callback);\n}\n\nvar eachOf$1 = awaitify(eachOf, 3);\n\n/**\n * Produces a new collection of values by mapping each value in `coll` through\n * the `iteratee` function. The `iteratee` is called with an item from `coll`\n * and a callback for when it has finished processing. Each of these callbacks\n * takes 2 arguments: an `error`, and the transformed item from `coll`. If\n * `iteratee` passes an error to its callback, the main `callback` (for the\n * `map` function) is immediately called with the error.\n *\n * Note, that since this function applies the `iteratee` to each item in\n * parallel, there is no guarantee that the `iteratee` functions will complete\n * in order. However, the results array will be in the same order as the\n * original `coll`.\n *\n * If `map` is passed an Object, the results will be an Array.  The results\n * will roughly be in the order of the original Objects' keys (but this can\n * vary across JavaScript engines).\n *\n * @name map\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an Array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * // file1.txt is a file that is 1000 bytes in size\n * // file2.txt is a file that is 2000 bytes in size\n * // file3.txt is a file that is 3000 bytes in size\n * // file4.txt does not exist\n *\n * const fileList = ['file1.txt','file2.txt','file3.txt'];\n * const withMissingFileList = ['file1.txt','file2.txt','file4.txt'];\n *\n * // asynchronous function that returns the file size in bytes\n * function getFileSizeInBytes(file, callback) {\n *     fs.stat(file, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         callback(null, stat.size);\n *     });\n * }\n *\n * // Using callbacks\n * async.map(fileList, getFileSizeInBytes, function(err, results) {\n *     if (err) {\n *         console.log(err);\n *     } else {\n *         console.log(results);\n *         // results is now an array of the file size in bytes for each file, e.g.\n *         // [ 1000, 2000, 3000]\n *     }\n * });\n *\n * // Error Handling\n * async.map(withMissingFileList, getFileSizeInBytes, function(err, results) {\n *     if (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     } else {\n *         console.log(results);\n *     }\n * });\n *\n * // Using Promises\n * async.map(fileList, getFileSizeInBytes)\n * .then( results => {\n *     console.log(results);\n *     // results is now an array of the file size in bytes for each file, e.g.\n *     // [ 1000, 2000, 3000]\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Error Handling\n * async.map(withMissingFileList, getFileSizeInBytes)\n * .then( results => {\n *     console.log(results);\n * }).catch( err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let results = await async.map(fileList, getFileSizeInBytes);\n *         console.log(results);\n *         // results is now an array of the file size in bytes for each file, e.g.\n *         // [ 1000, 2000, 3000]\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // Error Handling\n * async () => {\n *     try {\n *         let results = await async.map(withMissingFileList, getFileSizeInBytes);\n *         console.log(results);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     }\n * }\n *\n */\nfunction map (coll, iteratee, callback) {\n    return _asyncMap(eachOf$1, coll, iteratee, callback)\n}\nvar map$1 = awaitify(map, 3);\n\n/**\n * Applies the provided arguments to each function in the array, calling\n * `callback` after all functions have completed. If you only provide the first\n * argument, `fns`, then it will return a function which lets you pass in the\n * arguments as if it were a single function call. If more arguments are\n * provided, `callback` is required while `args` is still optional. The results\n * for each of the applied async functions are passed to the final callback\n * as an array.\n *\n * @name applyEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} fns - A collection of {@link AsyncFunction}s\n * to all call with the same arguments\n * @param {...*} [args] - any number of separate arguments to pass to the\n * function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {AsyncFunction} - Returns a function that takes no args other than\n * an optional callback, that is the result of applying the `args` to each\n * of the functions.\n * @example\n *\n * const appliedFn = async.applyEach([enableSearch, updateSchema], 'bucket')\n *\n * appliedFn((err, results) => {\n *     // results[0] is the results for `enableSearch`\n *     // results[1] is the results for `updateSchema`\n * });\n *\n * // partial application example:\n * async.each(\n *     buckets,\n *     async (bucket) => async.applyEach([enableSearch, updateSchema], bucket)(),\n *     callback\n * );\n */\nvar applyEach$1 = applyEach(map$1);\n\n/**\n * The same as [`eachOf`]{@link module:Collections.eachOf} but runs only a single async operation at a time.\n *\n * @name eachOfSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfSeries\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n */\nfunction eachOfSeries(coll, iteratee, callback) {\n    return eachOfLimit$2(coll, 1, iteratee, callback)\n}\nvar eachOfSeries$1 = awaitify(eachOfSeries, 3);\n\n/**\n * The same as [`map`]{@link module:Collections.map} but runs only a single async operation at a time.\n *\n * @name mapSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction mapSeries (coll, iteratee, callback) {\n    return _asyncMap(eachOfSeries$1, coll, iteratee, callback)\n}\nvar mapSeries$1 = awaitify(mapSeries, 3);\n\n/**\n * The same as [`applyEach`]{@link module:ControlFlow.applyEach} but runs only a single async operation at a time.\n *\n * @name applyEachSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.applyEach]{@link module:ControlFlow.applyEach}\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} fns - A collection of {@link AsyncFunction}s to all\n * call with the same arguments\n * @param {...*} [args] - any number of separate arguments to pass to the\n * function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {AsyncFunction} - A function, that when called, is the result of\n * appling the `args` to the list of functions.  It takes no args, other than\n * a callback.\n */\nvar applyEachSeries = applyEach(mapSeries$1);\n\nconst PROMISE_SYMBOL = Symbol('promiseCallback');\n\nfunction promiseCallback () {\n    let resolve, reject;\n    function callback (err, ...args) {\n        if (err) return reject(err)\n        resolve(args.length > 1 ? args : args[0]);\n    }\n\n    callback[PROMISE_SYMBOL] = new Promise((res, rej) => {\n        resolve = res,\n        reject = rej;\n    });\n\n    return callback\n}\n\n/**\n * Determines the best order for running the {@link AsyncFunction}s in `tasks`, based on\n * their requirements. Each function can optionally depend on other functions\n * being completed first, and each function is run as soon as its requirements\n * are satisfied.\n *\n * If any of the {@link AsyncFunction}s pass an error to their callback, the `auto` sequence\n * will stop. Further tasks will not execute (so any other functions depending\n * on it will not run), and the main `callback` is immediately called with the\n * error.\n *\n * {@link AsyncFunction}s also receive an object containing the results of functions which\n * have completed so far as the first argument, if they have dependencies. If a\n * task function has no dependencies, it will only be passed a callback.\n *\n * @name auto\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Object} tasks - An object. Each of its properties is either a\n * function or an array of requirements, with the {@link AsyncFunction} itself the last item\n * in the array. The object's key of a property serves as the name of the task\n * defined by that property, i.e. can be used when specifying requirements for\n * other tasks. The function receives one or two arguments:\n * * a `results` object, containing the results of the previously executed\n *   functions, only passed if the task has any dependencies,\n * * a `callback(err, result)` function, which must be called when finished,\n *   passing an `error` (which can be `null`) and the result of the function's\n *   execution.\n * @param {number} [concurrency=Infinity] - An optional `integer` for\n * determining the maximum number of tasks that can be run in parallel. By\n * default, as many as possible.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback. Results are always returned; however, if an\n * error occurs, no further `tasks` will be performed, and the results object\n * will only contain partial results. Invoked with (err, results).\n * @returns {Promise} a promise, if a callback is not passed\n * @example\n *\n * //Using Callbacks\n * async.auto({\n *     get_data: function(callback) {\n *         // async code to get some data\n *         callback(null, 'data', 'converted to array');\n *     },\n *     make_folder: function(callback) {\n *         // async code to create a directory to store a file in\n *         // this is run at the same time as getting the data\n *         callback(null, 'folder');\n *     },\n *     write_file: ['get_data', 'make_folder', function(results, callback) {\n *         // once there is some data and the directory exists,\n *         // write the data to a file in the directory\n *         callback(null, 'filename');\n *     }],\n *     email_link: ['write_file', function(results, callback) {\n *         // once the file is written let's email a link to it...\n *         callback(null, {'file':results.write_file, 'email':'user@example.com'});\n *     }]\n * }, function(err, results) {\n *     if (err) {\n *         console.log('err = ', err);\n *     }\n *     console.log('results = ', results);\n *     // results = {\n *     //     get_data: ['data', 'converted to array']\n *     //     make_folder; 'folder',\n *     //     write_file: 'filename'\n *     //     email_link: { file: 'filename', email: 'user@example.com' }\n *     // }\n * });\n *\n * //Using Promises\n * async.auto({\n *     get_data: function(callback) {\n *         console.log('in get_data');\n *         // async code to get some data\n *         callback(null, 'data', 'converted to array');\n *     },\n *     make_folder: function(callback) {\n *         console.log('in make_folder');\n *         // async code to create a directory to store a file in\n *         // this is run at the same time as getting the data\n *         callback(null, 'folder');\n *     },\n *     write_file: ['get_data', 'make_folder', function(results, callback) {\n *         // once there is some data and the directory exists,\n *         // write the data to a file in the directory\n *         callback(null, 'filename');\n *     }],\n *     email_link: ['write_file', function(results, callback) {\n *         // once the file is written let's email a link to it...\n *         callback(null, {'file':results.write_file, 'email':'user@example.com'});\n *     }]\n * }).then(results => {\n *     console.log('results = ', results);\n *     // results = {\n *     //     get_data: ['data', 'converted to array']\n *     //     make_folder; 'folder',\n *     //     write_file: 'filename'\n *     //     email_link: { file: 'filename', email: 'user@example.com' }\n *     // }\n * }).catch(err => {\n *     console.log('err = ', err);\n * });\n *\n * //Using async/await\n * async () => {\n *     try {\n *         let results = await async.auto({\n *             get_data: function(callback) {\n *                 // async code to get some data\n *                 callback(null, 'data', 'converted to array');\n *             },\n *             make_folder: function(callback) {\n *                 // async code to create a directory to store a file in\n *                 // this is run at the same time as getting the data\n *                 callback(null, 'folder');\n *             },\n *             write_file: ['get_data', 'make_folder', function(results, callback) {\n *                 // once there is some data and the directory exists,\n *                 // write the data to a file in the directory\n *                 callback(null, 'filename');\n *             }],\n *             email_link: ['write_file', function(results, callback) {\n *                 // once the file is written let's email a link to it...\n *                 callback(null, {'file':results.write_file, 'email':'user@example.com'});\n *             }]\n *         });\n *         console.log('results = ', results);\n *         // results = {\n *         //     get_data: ['data', 'converted to array']\n *         //     make_folder; 'folder',\n *         //     write_file: 'filename'\n *         //     email_link: { file: 'filename', email: 'user@example.com' }\n *         // }\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction auto(tasks, concurrency, callback) {\n    if (typeof concurrency !== 'number') {\n        // concurrency is optional, shift the args.\n        callback = concurrency;\n        concurrency = null;\n    }\n    callback = once(callback || promiseCallback());\n    var numTasks = Object.keys(tasks).length;\n    if (!numTasks) {\n        return callback(null);\n    }\n    if (!concurrency) {\n        concurrency = numTasks;\n    }\n\n    var results = {};\n    var runningTasks = 0;\n    var canceled = false;\n    var hasError = false;\n\n    var listeners = Object.create(null);\n\n    var readyTasks = [];\n\n    // for cycle detection:\n    var readyToCheck = []; // tasks that have been identified as reachable\n    // without the possibility of returning to an ancestor task\n    var uncheckedDependencies = {};\n\n    Object.keys(tasks).forEach(key => {\n        var task = tasks[key];\n        if (!Array.isArray(task)) {\n            // no dependencies\n            enqueueTask(key, [task]);\n            readyToCheck.push(key);\n            return;\n        }\n\n        var dependencies = task.slice(0, task.length - 1);\n        var remainingDependencies = dependencies.length;\n        if (remainingDependencies === 0) {\n            enqueueTask(key, task);\n            readyToCheck.push(key);\n            return;\n        }\n        uncheckedDependencies[key] = remainingDependencies;\n\n        dependencies.forEach(dependencyName => {\n            if (!tasks[dependencyName]) {\n                throw new Error('async.auto task `' + key +\n                    '` has a non-existent dependency `' +\n                    dependencyName + '` in ' +\n                    dependencies.join(', '));\n            }\n            addListener(dependencyName, () => {\n                remainingDependencies--;\n                if (remainingDependencies === 0) {\n                    enqueueTask(key, task);\n                }\n            });\n        });\n    });\n\n    checkForDeadlocks();\n    processQueue();\n\n    function enqueueTask(key, task) {\n        readyTasks.push(() => runTask(key, task));\n    }\n\n    function processQueue() {\n        if (canceled) return\n        if (readyTasks.length === 0 && runningTasks === 0) {\n            return callback(null, results);\n        }\n        while(readyTasks.length && runningTasks < concurrency) {\n            var run = readyTasks.shift();\n            run();\n        }\n\n    }\n\n    function addListener(taskName, fn) {\n        var taskListeners = listeners[taskName];\n        if (!taskListeners) {\n            taskListeners = listeners[taskName] = [];\n        }\n\n        taskListeners.push(fn);\n    }\n\n    function taskComplete(taskName) {\n        var taskListeners = listeners[taskName] || [];\n        taskListeners.forEach(fn => fn());\n        processQueue();\n    }\n\n\n    function runTask(key, task) {\n        if (hasError) return;\n\n        var taskCallback = onlyOnce((err, ...result) => {\n            runningTasks--;\n            if (err === false) {\n                canceled = true;\n                return\n            }\n            if (result.length < 2) {\n                [result] = result;\n            }\n            if (err) {\n                var safeResults = {};\n                Object.keys(results).forEach(rkey => {\n                    safeResults[rkey] = results[rkey];\n                });\n                safeResults[key] = result;\n                hasError = true;\n                listeners = Object.create(null);\n                if (canceled) return\n                callback(err, safeResults);\n            } else {\n                results[key] = result;\n                taskComplete(key);\n            }\n        });\n\n        runningTasks++;\n        var taskFn = wrapAsync(task[task.length - 1]);\n        if (task.length > 1) {\n            taskFn(results, taskCallback);\n        } else {\n            taskFn(taskCallback);\n        }\n    }\n\n    function checkForDeadlocks() {\n        // Kahn's algorithm\n        // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm\n        // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html\n        var currentTask;\n        var counter = 0;\n        while (readyToCheck.length) {\n            currentTask = readyToCheck.pop();\n            counter++;\n            getDependents(currentTask).forEach(dependent => {\n                if (--uncheckedDependencies[dependent] === 0) {\n                    readyToCheck.push(dependent);\n                }\n            });\n        }\n\n        if (counter !== numTasks) {\n            throw new Error(\n                'async.auto cannot execute tasks due to a recursive dependency'\n            );\n        }\n    }\n\n    function getDependents(taskName) {\n        var result = [];\n        Object.keys(tasks).forEach(key => {\n            const task = tasks[key];\n            if (Array.isArray(task) && task.indexOf(taskName) >= 0) {\n                result.push(key);\n            }\n        });\n        return result;\n    }\n\n    return callback[PROMISE_SYMBOL]\n}\n\nvar FN_ARGS = /^(?:async\\s+)?(?:function)?\\s*\\w*\\s*\\(\\s*([^)]+)\\s*\\)(?:\\s*{)/;\nvar ARROW_FN_ARGS = /^(?:async\\s+)?\\(?\\s*([^)=]+)\\s*\\)?(?:\\s*=>)/;\nvar FN_ARG_SPLIT = /,/;\nvar FN_ARG = /(=.+)?(\\s*)$/;\nvar STRIP_COMMENTS = /((\\/\\/.*$)|(\\/\\*[\\s\\S]*?\\*\\/))/mg;\n\nfunction parseParams(func) {\n    const src = func.toString().replace(STRIP_COMMENTS, '');\n    let match = src.match(FN_ARGS);\n    if (!match) {\n        match = src.match(ARROW_FN_ARGS);\n    }\n    if (!match) throw new Error('could not parse args in autoInject\\nSource:\\n' + src)\n    let [, args] = match;\n    return args\n        .replace(/\\s/g, '')\n        .split(FN_ARG_SPLIT)\n        .map((arg) => arg.replace(FN_ARG, '').trim());\n}\n\n/**\n * A dependency-injected version of the [async.auto]{@link module:ControlFlow.auto} function. Dependent\n * tasks are specified as parameters to the function, after the usual callback\n * parameter, with the parameter names matching the names of the tasks it\n * depends on. This can provide even more readable task graphs which can be\n * easier to maintain.\n *\n * If a final callback is specified, the task results are similarly injected,\n * specified as named parameters after the initial error parameter.\n *\n * The autoInject function is purely syntactic sugar and its semantics are\n * otherwise equivalent to [async.auto]{@link module:ControlFlow.auto}.\n *\n * @name autoInject\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.auto]{@link module:ControlFlow.auto}\n * @category Control Flow\n * @param {Object} tasks - An object, each of whose properties is an {@link AsyncFunction} of\n * the form 'func([dependencies...], callback). The object's key of a property\n * serves as the name of the task defined by that property, i.e. can be used\n * when specifying requirements for other tasks.\n * * The `callback` parameter is a `callback(err, result)` which must be called\n *   when finished, passing an `error` (which can be `null`) and the result of\n *   the function's execution. The remaining parameters name other tasks on\n *   which the task is dependent, and the results from those tasks are the\n *   arguments of those parameters.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback, and a `results` object with any completed\n * task results, similar to `auto`.\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * //  The example from `auto` can be rewritten as follows:\n * async.autoInject({\n *     get_data: function(callback) {\n *         // async code to get some data\n *         callback(null, 'data', 'converted to array');\n *     },\n *     make_folder: function(callback) {\n *         // async code to create a directory to store a file in\n *         // this is run at the same time as getting the data\n *         callback(null, 'folder');\n *     },\n *     write_file: function(get_data, make_folder, callback) {\n *         // once there is some data and the directory exists,\n *         // write the data to a file in the directory\n *         callback(null, 'filename');\n *     },\n *     email_link: function(write_file, callback) {\n *         // once the file is written let's email a link to it...\n *         // write_file contains the filename returned by write_file.\n *         callback(null, {'file':write_file, 'email':'user@example.com'});\n *     }\n * }, function(err, results) {\n *     console.log('err = ', err);\n *     console.log('email_link = ', results.email_link);\n * });\n *\n * // If you are using a JS minifier that mangles parameter names, `autoInject`\n * // will not work with plain functions, since the parameter names will be\n * // collapsed to a single letter identifier.  To work around this, you can\n * // explicitly specify the names of the parameters your task function needs\n * // in an array, similar to Angular.js dependency injection.\n *\n * // This still has an advantage over plain `auto`, since the results a task\n * // depends on are still spread into arguments.\n * async.autoInject({\n *     //...\n *     write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {\n *         callback(null, 'filename');\n *     }],\n *     email_link: ['write_file', function(write_file, callback) {\n *         callback(null, {'file':write_file, 'email':'user@example.com'});\n *     }]\n *     //...\n * }, function(err, results) {\n *     console.log('err = ', err);\n *     console.log('email_link = ', results.email_link);\n * });\n */\nfunction autoInject(tasks, callback) {\n    var newTasks = {};\n\n    Object.keys(tasks).forEach(key => {\n        var taskFn = tasks[key];\n        var params;\n        var fnIsAsync = isAsync(taskFn);\n        var hasNoDeps =\n            (!fnIsAsync && taskFn.length === 1) ||\n            (fnIsAsync && taskFn.length === 0);\n\n        if (Array.isArray(taskFn)) {\n            params = [...taskFn];\n            taskFn = params.pop();\n\n            newTasks[key] = params.concat(params.length > 0 ? newTask : taskFn);\n        } else if (hasNoDeps) {\n            // no dependencies, use the function as-is\n            newTasks[key] = taskFn;\n        } else {\n            params = parseParams(taskFn);\n            if ((taskFn.length === 0 && !fnIsAsync) && params.length === 0) {\n                throw new Error(\"autoInject task functions require explicit parameters.\");\n            }\n\n            // remove callback param\n            if (!fnIsAsync) params.pop();\n\n            newTasks[key] = params.concat(newTask);\n        }\n\n        function newTask(results, taskCb) {\n            var newArgs = params.map(name => results[name]);\n            newArgs.push(taskCb);\n            wrapAsync(taskFn)(...newArgs);\n        }\n    });\n\n    return auto(newTasks, callback);\n}\n\n// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation\n// used for queues. This implementation assumes that the node provided by the user can be modified\n// to adjust the next and last properties. We implement only the minimal functionality\n// for queue support.\nclass DLL {\n    constructor() {\n        this.head = this.tail = null;\n        this.length = 0;\n    }\n\n    removeLink(node) {\n        if (node.prev) node.prev.next = node.next;\n        else this.head = node.next;\n        if (node.next) node.next.prev = node.prev;\n        else this.tail = node.prev;\n\n        node.prev = node.next = null;\n        this.length -= 1;\n        return node;\n    }\n\n    empty () {\n        while(this.head) this.shift();\n        return this;\n    }\n\n    insertAfter(node, newNode) {\n        newNode.prev = node;\n        newNode.next = node.next;\n        if (node.next) node.next.prev = newNode;\n        else this.tail = newNode;\n        node.next = newNode;\n        this.length += 1;\n    }\n\n    insertBefore(node, newNode) {\n        newNode.prev = node.prev;\n        newNode.next = node;\n        if (node.prev) node.prev.next = newNode;\n        else this.head = newNode;\n        node.prev = newNode;\n        this.length += 1;\n    }\n\n    unshift(node) {\n        if (this.head) this.insertBefore(this.head, node);\n        else setInitial(this, node);\n    }\n\n    push(node) {\n        if (this.tail) this.insertAfter(this.tail, node);\n        else setInitial(this, node);\n    }\n\n    shift() {\n        return this.head && this.removeLink(this.head);\n    }\n\n    pop() {\n        return this.tail && this.removeLink(this.tail);\n    }\n\n    toArray() {\n        return [...this]\n    }\n\n    *[Symbol.iterator] () {\n        var cur = this.head;\n        while (cur) {\n            yield cur.data;\n            cur = cur.next;\n        }\n    }\n\n    remove (testFn) {\n        var curr = this.head;\n        while(curr) {\n            var {next} = curr;\n            if (testFn(curr)) {\n                this.removeLink(curr);\n            }\n            curr = next;\n        }\n        return this;\n    }\n}\n\nfunction setInitial(dll, node) {\n    dll.length = 1;\n    dll.head = dll.tail = node;\n}\n\nfunction queue(worker, concurrency, payload) {\n    if (concurrency == null) {\n        concurrency = 1;\n    }\n    else if(concurrency === 0) {\n        throw new RangeError('Concurrency must not be zero');\n    }\n\n    var _worker = wrapAsync(worker);\n    var numRunning = 0;\n    var workersList = [];\n    const events = {\n        error: [],\n        drain: [],\n        saturated: [],\n        unsaturated: [],\n        empty: []\n    };\n\n    function on (event, handler) {\n        events[event].push(handler);\n    }\n\n    function once (event, handler) {\n        const handleAndRemove = (...args) => {\n            off(event, handleAndRemove);\n            handler(...args);\n        };\n        events[event].push(handleAndRemove);\n    }\n\n    function off (event, handler) {\n        if (!event) return Object.keys(events).forEach(ev => events[ev] = [])\n        if (!handler) return events[event] = []\n        events[event] = events[event].filter(ev => ev !== handler);\n    }\n\n    function trigger (event, ...args) {\n        events[event].forEach(handler => handler(...args));\n    }\n\n    var processingScheduled = false;\n    function _insert(data, insertAtFront, rejectOnError, callback) {\n        if (callback != null && typeof callback !== 'function') {\n            throw new Error('task callback must be a function');\n        }\n        q.started = true;\n\n        var res, rej;\n        function promiseCallback (err, ...args) {\n            // we don't care about the error, let the global error handler\n            // deal with it\n            if (err) return rejectOnError ? rej(err) : res()\n            if (args.length <= 1) return res(args[0])\n            res(args);\n        }\n\n        var item = {\n            data,\n            callback: rejectOnError ?\n                promiseCallback :\n                (callback || promiseCallback)\n        };\n\n        if (insertAtFront) {\n            q._tasks.unshift(item);\n        } else {\n            q._tasks.push(item);\n        }\n\n        if (!processingScheduled) {\n            processingScheduled = true;\n            setImmediate$1(() => {\n                processingScheduled = false;\n                q.process();\n            });\n        }\n\n        if (rejectOnError || !callback) {\n            return new Promise((resolve, reject) => {\n                res = resolve;\n                rej = reject;\n            })\n        }\n    }\n\n    function _createCB(tasks) {\n        return function (err, ...args) {\n            numRunning -= 1;\n\n            for (var i = 0, l = tasks.length; i < l; i++) {\n                var task = tasks[i];\n\n                var index = workersList.indexOf(task);\n                if (index === 0) {\n                    workersList.shift();\n                } else if (index > 0) {\n                    workersList.splice(index, 1);\n                }\n\n                task.callback(err, ...args);\n\n                if (err != null) {\n                    trigger('error', err, task.data);\n                }\n            }\n\n            if (numRunning <= (q.concurrency - q.buffer) ) {\n                trigger('unsaturated');\n            }\n\n            if (q.idle()) {\n                trigger('drain');\n            }\n            q.process();\n        };\n    }\n\n    function _maybeDrain(data) {\n        if (data.length === 0 && q.idle()) {\n            // call drain immediately if there are no tasks\n            setImmediate$1(() => trigger('drain'));\n            return true\n        }\n        return false\n    }\n\n    const eventMethod = (name) => (handler) => {\n        if (!handler) {\n            return new Promise((resolve, reject) => {\n                once(name, (err, data) => {\n                    if (err) return reject(err)\n                    resolve(data);\n                });\n            })\n        }\n        off(name);\n        on(name, handler);\n\n    };\n\n    var isProcessing = false;\n    var q = {\n        _tasks: new DLL(),\n        *[Symbol.iterator] () {\n            yield* q._tasks[Symbol.iterator]();\n        },\n        concurrency,\n        payload,\n        buffer: concurrency / 4,\n        started: false,\n        paused: false,\n        push (data, callback) {\n            if (Array.isArray(data)) {\n                if (_maybeDrain(data)) return\n                return data.map(datum => _insert(datum, false, false, callback))\n            }\n            return _insert(data, false, false, callback);\n        },\n        pushAsync (data, callback) {\n            if (Array.isArray(data)) {\n                if (_maybeDrain(data)) return\n                return data.map(datum => _insert(datum, false, true, callback))\n            }\n            return _insert(data, false, true, callback);\n        },\n        kill () {\n            off();\n            q._tasks.empty();\n        },\n        unshift (data, callback) {\n            if (Array.isArray(data)) {\n                if (_maybeDrain(data)) return\n                return data.map(datum => _insert(datum, true, false, callback))\n            }\n            return _insert(data, true, false, callback);\n        },\n        unshiftAsync (data, callback) {\n            if (Array.isArray(data)) {\n                if (_maybeDrain(data)) return\n                return data.map(datum => _insert(datum, true, true, callback))\n            }\n            return _insert(data, true, true, callback);\n        },\n        remove (testFn) {\n            q._tasks.remove(testFn);\n        },\n        process () {\n            // Avoid trying to start too many processing operations. This can occur\n            // when callbacks resolve synchronously (#1267).\n            if (isProcessing) {\n                return;\n            }\n            isProcessing = true;\n            while(!q.paused && numRunning < q.concurrency && q._tasks.length){\n                var tasks = [], data = [];\n                var l = q._tasks.length;\n                if (q.payload) l = Math.min(l, q.payload);\n                for (var i = 0; i < l; i++) {\n                    var node = q._tasks.shift();\n                    tasks.push(node);\n                    workersList.push(node);\n                    data.push(node.data);\n                }\n\n                numRunning += 1;\n\n                if (q._tasks.length === 0) {\n                    trigger('empty');\n                }\n\n                if (numRunning === q.concurrency) {\n                    trigger('saturated');\n                }\n\n                var cb = onlyOnce(_createCB(tasks));\n                _worker(data, cb);\n            }\n            isProcessing = false;\n        },\n        length () {\n            return q._tasks.length;\n        },\n        running () {\n            return numRunning;\n        },\n        workersList () {\n            return workersList;\n        },\n        idle() {\n            return q._tasks.length + numRunning === 0;\n        },\n        pause () {\n            q.paused = true;\n        },\n        resume () {\n            if (q.paused === false) { return; }\n            q.paused = false;\n            setImmediate$1(q.process);\n        }\n    };\n    // define these as fixed properties, so people get useful errors when updating\n    Object.defineProperties(q, {\n        saturated: {\n            writable: false,\n            value: eventMethod('saturated')\n        },\n        unsaturated: {\n            writable: false,\n            value: eventMethod('unsaturated')\n        },\n        empty: {\n            writable: false,\n            value: eventMethod('empty')\n        },\n        drain: {\n            writable: false,\n            value: eventMethod('drain')\n        },\n        error: {\n            writable: false,\n            value: eventMethod('error')\n        },\n    });\n    return q;\n}\n\n/**\n * Creates a `cargo` object with the specified payload. Tasks added to the\n * cargo will be processed altogether (up to the `payload` limit). If the\n * `worker` is in progress, the task is queued until it becomes available. Once\n * the `worker` has completed some tasks, each callback of those tasks is\n * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)\n * for how `cargo` and `queue` work.\n *\n * While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers\n * at a time, cargo passes an array of tasks to a single worker, repeating\n * when the worker is finished.\n *\n * @name cargo\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An asynchronous function for processing an array\n * of queued tasks. Invoked with `(tasks, callback)`.\n * @param {number} [payload=Infinity] - An optional `integer` for determining\n * how many tasks should be processed per round; if omitted, the default is\n * unlimited.\n * @returns {module:ControlFlow.QueueObject} A cargo object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the cargo and inner queue.\n * @example\n *\n * // create a cargo object with payload 2\n * var cargo = async.cargo(function(tasks, callback) {\n *     for (var i=0; i<tasks.length; i++) {\n *         console.log('hello ' + tasks[i].name);\n *     }\n *     callback();\n * }, 2);\n *\n * // add some items\n * cargo.push({name: 'foo'}, function(err) {\n *     console.log('finished processing foo');\n * });\n * cargo.push({name: 'bar'}, function(err) {\n *     console.log('finished processing bar');\n * });\n * await cargo.push({name: 'baz'});\n * console.log('finished processing baz');\n */\nfunction cargo(worker, payload) {\n    return queue(worker, 1, payload);\n}\n\n/**\n * Creates a `cargoQueue` object with the specified payload. Tasks added to the\n * cargoQueue will be processed together (up to the `payload` limit) in `concurrency` parallel workers.\n * If the all `workers` are in progress, the task is queued until one becomes available. Once\n * a `worker` has completed some tasks, each callback of those tasks is\n * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)\n * for how `cargo` and `queue` work.\n *\n * While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers\n * at a time, and [`cargo`]{@link module:ControlFlow.cargo} passes an array of tasks to a single worker,\n * the cargoQueue passes an array of tasks to multiple parallel workers.\n *\n * @name cargoQueue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @see [async.cargo]{@link module:ControlFLow.cargo}\n * @category Control Flow\n * @param {AsyncFunction} worker - An asynchronous function for processing an array\n * of queued tasks. Invoked with `(tasks, callback)`.\n * @param {number} [concurrency=1] - An `integer` for determining how many\n * `worker` functions should be run in parallel.  If omitted, the concurrency\n * defaults to `1`.  If the concurrency is `0`, an error is thrown.\n * @param {number} [payload=Infinity] - An optional `integer` for determining\n * how many tasks should be processed per round; if omitted, the default is\n * unlimited.\n * @returns {module:ControlFlow.QueueObject} A cargoQueue object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the cargoQueue and inner queue.\n * @example\n *\n * // create a cargoQueue object with payload 2 and concurrency 2\n * var cargoQueue = async.cargoQueue(function(tasks, callback) {\n *     for (var i=0; i<tasks.length; i++) {\n *         console.log('hello ' + tasks[i].name);\n *     }\n *     callback();\n * }, 2, 2);\n *\n * // add some items\n * cargoQueue.push({name: 'foo'}, function(err) {\n *     console.log('finished processing foo');\n * });\n * cargoQueue.push({name: 'bar'}, function(err) {\n *     console.log('finished processing bar');\n * });\n * cargoQueue.push({name: 'baz'}, function(err) {\n *     console.log('finished processing baz');\n * });\n * cargoQueue.push({name: 'boo'}, function(err) {\n *     console.log('finished processing boo');\n * });\n */\nfunction cargo$1(worker, concurrency, payload) {\n    return queue(worker, concurrency, payload);\n}\n\n/**\n * Reduces `coll` into a single value using an async `iteratee` to return each\n * successive step. `memo` is the initial state of the reduction. This function\n * only operates in series.\n *\n * For performance reasons, it may make sense to split a call to this function\n * into a parallel map, and then use the normal `Array.prototype.reduce` on the\n * results. This function is for situations where each step in the reduction\n * needs to be async; if you can get the data before reducing it, then it's\n * probably a good idea to do so.\n *\n * @name reduce\n * @static\n * @memberOf module:Collections\n * @method\n * @alias inject\n * @alias foldl\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {*} memo - The initial state of the reduction.\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee completes with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * // file1.txt is a file that is 1000 bytes in size\n * // file2.txt is a file that is 2000 bytes in size\n * // file3.txt is a file that is 3000 bytes in size\n * // file4.txt does not exist\n *\n * const fileList = ['file1.txt','file2.txt','file3.txt'];\n * const withMissingFileList = ['file1.txt','file2.txt','file3.txt', 'file4.txt'];\n *\n * // asynchronous function that computes the file size in bytes\n * // file size is added to the memoized value, then returned\n * function getFileSizeInBytes(memo, file, callback) {\n *     fs.stat(file, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         callback(null, memo + stat.size);\n *     });\n * }\n *\n * // Using callbacks\n * async.reduce(fileList, 0, getFileSizeInBytes, function(err, result) {\n *     if (err) {\n *         console.log(err);\n *     } else {\n *         console.log(result);\n *         // 6000\n *         // which is the sum of the file sizes of the three files\n *     }\n * });\n *\n * // Error Handling\n * async.reduce(withMissingFileList, 0, getFileSizeInBytes, function(err, result) {\n *     if (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     } else {\n *         console.log(result);\n *     }\n * });\n *\n * // Using Promises\n * async.reduce(fileList, 0, getFileSizeInBytes)\n * .then( result => {\n *     console.log(result);\n *     // 6000\n *     // which is the sum of the file sizes of the three files\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Error Handling\n * async.reduce(withMissingFileList, 0, getFileSizeInBytes)\n * .then( result => {\n *     console.log(result);\n * }).catch( err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.reduce(fileList, 0, getFileSizeInBytes);\n *         console.log(result);\n *         // 6000\n *         // which is the sum of the file sizes of the three files\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // Error Handling\n * async () => {\n *     try {\n *         let result = await async.reduce(withMissingFileList, 0, getFileSizeInBytes);\n *         console.log(result);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     }\n * }\n *\n */\nfunction reduce(coll, memo, iteratee, callback) {\n    callback = once(callback);\n    var _iteratee = wrapAsync(iteratee);\n    return eachOfSeries$1(coll, (x, i, iterCb) => {\n        _iteratee(memo, x, (err, v) => {\n            memo = v;\n            iterCb(err);\n        });\n    }, err => callback(err, memo));\n}\nvar reduce$1 = awaitify(reduce, 4);\n\n/**\n * Version of the compose function that is more natural to read. Each function\n * consumes the return value of the previous function. It is the equivalent of\n * [compose]{@link module:ControlFlow.compose} with the arguments reversed.\n *\n * Each function is executed with the `this` binding of the composed function.\n *\n * @name seq\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.compose]{@link module:ControlFlow.compose}\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} a function that composes the `functions` in order\n * @example\n *\n * // Requires lodash (or underscore), express3 and dresende's orm2.\n * // Part of an app, that fetches cats of the logged user.\n * // This example uses `seq` function to avoid overnesting and error\n * // handling clutter.\n * app.get('/cats', function(request, response) {\n *     var User = request.models.User;\n *     async.seq(\n *         _.bind(User.get, User),  // 'User.get' has signature (id, callback(err, data))\n *         function(user, fn) {\n *             user.getCats(fn);      // 'getCats' has signature (callback(err, data))\n *         }\n *     )(req.session.user_id, function (err, cats) {\n *         if (err) {\n *             console.error(err);\n *             response.json({ status: 'error', message: err.message });\n *         } else {\n *             response.json({ status: 'ok', message: 'Cats found', data: cats });\n *         }\n *     });\n * });\n */\nfunction seq(...functions) {\n    var _functions = functions.map(wrapAsync);\n    return function (...args) {\n        var that = this;\n\n        var cb = args[args.length - 1];\n        if (typeof cb == 'function') {\n            args.pop();\n        } else {\n            cb = promiseCallback();\n        }\n\n        reduce$1(_functions, args, (newargs, fn, iterCb) => {\n            fn.apply(that, newargs.concat((err, ...nextargs) => {\n                iterCb(err, nextargs);\n            }));\n        },\n        (err, results) => cb(err, ...results));\n\n        return cb[PROMISE_SYMBOL]\n    };\n}\n\n/**\n * Creates a function which is a composition of the passed asynchronous\n * functions. Each function consumes the return value of the function that\n * follows. Composing functions `f()`, `g()`, and `h()` would produce the result\n * of `f(g(h()))`, only this version uses callbacks to obtain the return values.\n *\n * If the last argument to the composed function is not a function, a promise\n * is returned when you call it.\n *\n * Each function is executed with the `this` binding of the composed function.\n *\n * @name compose\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} an asynchronous function that is the composed\n * asynchronous `functions`\n * @example\n *\n * function add1(n, callback) {\n *     setTimeout(function () {\n *         callback(null, n + 1);\n *     }, 10);\n * }\n *\n * function mul3(n, callback) {\n *     setTimeout(function () {\n *         callback(null, n * 3);\n *     }, 10);\n * }\n *\n * var add1mul3 = async.compose(mul3, add1);\n * add1mul3(4, function (err, result) {\n *     // result now equals 15\n * });\n */\nfunction compose(...args) {\n    return seq(...args.reverse());\n}\n\n/**\n * The same as [`map`]{@link module:Collections.map} but runs a maximum of `limit` async operations at a time.\n *\n * @name mapLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction mapLimit (coll, limit, iteratee, callback) {\n    return _asyncMap(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar mapLimit$1 = awaitify(mapLimit, 4);\n\n/**\n * The same as [`concat`]{@link module:Collections.concat} but runs a maximum of `limit` async operations at a time.\n *\n * @name concatLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @alias flatMapLimit\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @returns A Promise, if no callback is passed\n */\nfunction concatLimit(coll, limit, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    return mapLimit$1(coll, limit, (val, iterCb) => {\n        _iteratee(val, (err, ...args) => {\n            if (err) return iterCb(err);\n            return iterCb(err, args);\n        });\n    }, (err, mapResults) => {\n        var result = [];\n        for (var i = 0; i < mapResults.length; i++) {\n            if (mapResults[i]) {\n                result = result.concat(...mapResults[i]);\n            }\n        }\n\n        return callback(err, result);\n    });\n}\nvar concatLimit$1 = awaitify(concatLimit, 4);\n\n/**\n * Applies `iteratee` to each item in `coll`, concatenating the results. Returns\n * the concatenated list. The `iteratee`s are called in parallel, and the\n * results are concatenated as they return. The results array will be returned in\n * the original order of `coll` passed to the `iteratee` function.\n *\n * @name concat\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @alias flatMap\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @returns A Promise, if no callback is passed\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n * // dir4 does not exist\n *\n * let directoryList = ['dir1','dir2','dir3'];\n * let withMissingDirectoryList = ['dir1','dir2','dir3', 'dir4'];\n *\n * // Using callbacks\n * async.concat(directoryList, fs.readdir, function(err, results) {\n *    if (err) {\n *        console.log(err);\n *    } else {\n *        console.log(results);\n *        // [ 'file1.txt', 'file2.txt', 'file3.txt', 'file4.txt', file5.txt ]\n *    }\n * });\n *\n * // Error Handling\n * async.concat(withMissingDirectoryList, fs.readdir, function(err, results) {\n *    if (err) {\n *        console.log(err);\n *        // [ Error: ENOENT: no such file or directory ]\n *        // since dir4 does not exist\n *    } else {\n *        console.log(results);\n *    }\n * });\n *\n * // Using Promises\n * async.concat(directoryList, fs.readdir)\n * .then(results => {\n *     console.log(results);\n *     // [ 'file1.txt', 'file2.txt', 'file3.txt', 'file4.txt', file5.txt ]\n * }).catch(err => {\n *      console.log(err);\n * });\n *\n * // Error Handling\n * async.concat(withMissingDirectoryList, fs.readdir)\n * .then(results => {\n *     console.log(results);\n * }).catch(err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n *     // since dir4 does not exist\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let results = await async.concat(directoryList, fs.readdir);\n *         console.log(results);\n *         // [ 'file1.txt', 'file2.txt', 'file3.txt', 'file4.txt', file5.txt ]\n *     } catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // Error Handling\n * async () => {\n *     try {\n *         let results = await async.concat(withMissingDirectoryList, fs.readdir);\n *         console.log(results);\n *     } catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *         // since dir4 does not exist\n *     }\n * }\n *\n */\nfunction concat(coll, iteratee, callback) {\n    return concatLimit$1(coll, Infinity, iteratee, callback)\n}\nvar concat$1 = awaitify(concat, 3);\n\n/**\n * The same as [`concat`]{@link module:Collections.concat} but runs only a single async operation at a time.\n *\n * @name concatSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @alias flatMapSeries\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`.\n * The iteratee should complete with an array an array of results.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @returns A Promise, if no callback is passed\n */\nfunction concatSeries(coll, iteratee, callback) {\n    return concatLimit$1(coll, 1, iteratee, callback)\n}\nvar concatSeries$1 = awaitify(concatSeries, 3);\n\n/**\n * Returns a function that when called, calls-back with the values provided.\n * Useful as the first function in a [`waterfall`]{@link module:ControlFlow.waterfall}, or for plugging values in to\n * [`auto`]{@link module:ControlFlow.auto}.\n *\n * @name constant\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {...*} arguments... - Any number of arguments to automatically invoke\n * callback with.\n * @returns {AsyncFunction} Returns a function that when invoked, automatically\n * invokes the callback with the previous given arguments.\n * @example\n *\n * async.waterfall([\n *     async.constant(42),\n *     function (value, next) {\n *         // value === 42\n *     },\n *     //...\n * ], callback);\n *\n * async.waterfall([\n *     async.constant(filename, \"utf8\"),\n *     fs.readFile,\n *     function (fileData, next) {\n *         //...\n *     }\n *     //...\n * ], callback);\n *\n * async.auto({\n *     hostname: async.constant(\"https://server.net/\"),\n *     port: findFreePort,\n *     launchServer: [\"hostname\", \"port\", function (options, cb) {\n *         startServer(options, cb);\n *     }],\n *     //...\n * }, callback);\n */\nfunction constant(...args) {\n    return function (...ignoredArgs/*, callback*/) {\n        var callback = ignoredArgs.pop();\n        return callback(null, ...args);\n    };\n}\n\nfunction _createTester(check, getResult) {\n    return (eachfn, arr, _iteratee, cb) => {\n        var testPassed = false;\n        var testResult;\n        const iteratee = wrapAsync(_iteratee);\n        eachfn(arr, (value, _, callback) => {\n            iteratee(value, (err, result) => {\n                if (err || err === false) return callback(err);\n\n                if (check(result) && !testResult) {\n                    testPassed = true;\n                    testResult = getResult(true, value);\n                    return callback(null, breakLoop);\n                }\n                callback();\n            });\n        }, err => {\n            if (err) return cb(err);\n            cb(null, testPassed ? testResult : getResult(false));\n        });\n    };\n}\n\n/**\n * Returns the first value in `coll` that passes an async truth test. The\n * `iteratee` is applied in parallel, meaning the first iteratee to return\n * `true` will fire the detect `callback` with that result. That means the\n * result might not be the first item in the original `coll` (in terms of order)\n * that passes the test.\n\n * If order within the original `coll` is important, then look at\n * [`detectSeries`]{@link module:Collections.detectSeries}.\n *\n * @name detect\n * @static\n * @memberOf module:Collections\n * @method\n * @alias find\n * @category Collections\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @returns A Promise, if no callback is passed\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n *\n * // asynchronous function that checks if a file exists\n * function fileExists(file, callback) {\n *    fs.access(file, fs.constants.F_OK, (err) => {\n *        callback(null, !err);\n *    });\n * }\n *\n * async.detect(['file3.txt','file2.txt','dir1/file1.txt'], fileExists,\n *    function(err, result) {\n *        console.log(result);\n *        // dir1/file1.txt\n *        // result now equals the first file in the list that exists\n *    }\n *);\n *\n * // Using Promises\n * async.detect(['file3.txt','file2.txt','dir1/file1.txt'], fileExists)\n * .then(result => {\n *     console.log(result);\n *     // dir1/file1.txt\n *     // result now equals the first file in the list that exists\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.detect(['file3.txt','file2.txt','dir1/file1.txt'], fileExists);\n *         console.log(result);\n *         // dir1/file1.txt\n *         // result now equals the file in the list that exists\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction detect(coll, iteratee, callback) {\n    return _createTester(bool => bool, (res, item) => item)(eachOf$1, coll, iteratee, callback)\n}\nvar detect$1 = awaitify(detect, 3);\n\n/**\n * The same as [`detect`]{@link module:Collections.detect} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name detectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findLimit\n * @category Collections\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @returns a Promise if no callback is passed\n */\nfunction detectLimit(coll, limit, iteratee, callback) {\n    return _createTester(bool => bool, (res, item) => item)(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar detectLimit$1 = awaitify(detectLimit, 4);\n\n/**\n * The same as [`detect`]{@link module:Collections.detect} but runs only a single async operation at a time.\n *\n * @name detectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findSeries\n * @category Collections\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @returns a Promise if no callback is passed\n */\nfunction detectSeries(coll, iteratee, callback) {\n    return _createTester(bool => bool, (res, item) => item)(eachOfLimit(1), coll, iteratee, callback)\n}\n\nvar detectSeries$1 = awaitify(detectSeries, 3);\n\nfunction consoleFunc(name) {\n    return (fn, ...args) => wrapAsync(fn)(...args, (err, ...resultArgs) => {\n        /* istanbul ignore else */\n        if (typeof console === 'object') {\n            /* istanbul ignore else */\n            if (err) {\n                /* istanbul ignore else */\n                if (console.error) {\n                    console.error(err);\n                }\n            } else if (console[name]) { /* istanbul ignore else */\n                resultArgs.forEach(x => console[name](x));\n            }\n        }\n    })\n}\n\n/**\n * Logs the result of an [`async` function]{@link AsyncFunction} to the\n * `console` using `console.dir` to display the properties of the resulting object.\n * Only works in Node.js or in browsers that support `console.dir` and\n * `console.error` (such as FF and Chrome).\n * If multiple arguments are returned from the async function,\n * `console.dir` is called on each argument in order.\n *\n * @name dir\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...*} arguments... - Any number of arguments to apply to the function.\n * @example\n *\n * // in a module\n * var hello = function(name, callback) {\n *     setTimeout(function() {\n *         callback(null, {hello: name});\n *     }, 1000);\n * };\n *\n * // in the node repl\n * node> async.dir(hello, 'world');\n * {hello: 'world'}\n */\nvar dir = consoleFunc('dir');\n\n/**\n * The post-check version of [`whilst`]{@link module:ControlFlow.whilst}. To reflect the difference in\n * the order of operations, the arguments `test` and `iteratee` are switched.\n *\n * `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.\n *\n * @name doWhilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - A function which is called each time `test`\n * passes. Invoked with (callback).\n * @param {AsyncFunction} test - asynchronous truth test to perform after each\n * execution of `iteratee`. Invoked with (...args, callback), where `...args` are the\n * non-error args from the previous callback of `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped.\n * `callback` will be passed an error and any arguments passed to the final\n * `iteratee`'s callback. Invoked with (err, [results]);\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction doWhilst(iteratee, test, callback) {\n    callback = onlyOnce(callback);\n    var _fn = wrapAsync(iteratee);\n    var _test = wrapAsync(test);\n    var results;\n\n    function next(err, ...args) {\n        if (err) return callback(err);\n        if (err === false) return;\n        results = args;\n        _test(...args, check);\n    }\n\n    function check(err, truth) {\n        if (err) return callback(err);\n        if (err === false) return;\n        if (!truth) return callback(null, ...results);\n        _fn(next);\n    }\n\n    return check(null, true);\n}\n\nvar doWhilst$1 = awaitify(doWhilst, 3);\n\n/**\n * Like ['doWhilst']{@link module:ControlFlow.doWhilst}, except the `test` is inverted. Note the\n * argument ordering differs from `until`.\n *\n * @name doUntil\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.doWhilst]{@link module:ControlFlow.doWhilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {AsyncFunction} test - asynchronous truth test to perform after each\n * execution of `iteratee`. Invoked with (...args, callback), where `...args` are the\n * non-error args from the previous callback of `iteratee`\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction doUntil(iteratee, test, callback) {\n    const _test = wrapAsync(test);\n    return doWhilst$1(iteratee, (...args) => {\n        const cb = args.pop();\n        _test(...args, (err, truth) => cb (err, !truth));\n    }, callback);\n}\n\nfunction _withoutIndex(iteratee) {\n    return (value, index, callback) => iteratee(value, callback);\n}\n\n/**\n * Applies the function `iteratee` to each item in `coll`, in parallel.\n * The `iteratee` is called with an item from the list, and a callback for when\n * it has finished. If the `iteratee` passes an error to its `callback`, the\n * main `callback` (for the `each` function) is immediately called with the\n * error.\n *\n * Note, that since this function applies `iteratee` to each item in parallel,\n * there is no guarantee that the iteratee functions will complete in order.\n *\n * @name each\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEach\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to\n * each item in `coll`. Invoked with (item, callback).\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOf`.\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n * // dir4 does not exist\n *\n * const fileList = [ 'dir1/file2.txt', 'dir2/file3.txt', 'dir/file5.txt'];\n * const withMissingFileList = ['dir1/file1.txt', 'dir4/file2.txt'];\n *\n * // asynchronous function that deletes a file\n * const deleteFile = function(file, callback) {\n *     fs.unlink(file, callback);\n * };\n *\n * // Using callbacks\n * async.each(fileList, deleteFile, function(err) {\n *     if( err ) {\n *         console.log(err);\n *     } else {\n *         console.log('All files have been deleted successfully');\n *     }\n * });\n *\n * // Error Handling\n * async.each(withMissingFileList, deleteFile, function(err){\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n *     // since dir4/file2.txt does not exist\n *     // dir1/file1.txt could have been deleted\n * });\n *\n * // Using Promises\n * async.each(fileList, deleteFile)\n * .then( () => {\n *     console.log('All files have been deleted successfully');\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Error Handling\n * async.each(fileList, deleteFile)\n * .then( () => {\n *     console.log('All files have been deleted successfully');\n * }).catch( err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n *     // since dir4/file2.txt does not exist\n *     // dir1/file1.txt could have been deleted\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         await async.each(files, deleteFile);\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // Error Handling\n * async () => {\n *     try {\n *         await async.each(withMissingFileList, deleteFile);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *         // since dir4/file2.txt does not exist\n *         // dir1/file1.txt could have been deleted\n *     }\n * }\n *\n */\nfunction eachLimit(coll, iteratee, callback) {\n    return eachOf$1(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\nvar each = awaitify(eachLimit, 3);\n\n/**\n * The same as [`each`]{@link module:Collections.each} but runs a maximum of `limit` async operations at a time.\n *\n * @name eachLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachLimit\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfLimit`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n */\nfunction eachLimit$1(coll, limit, iteratee, callback) {\n    return eachOfLimit(limit)(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\nvar eachLimit$2 = awaitify(eachLimit$1, 4);\n\n/**\n * The same as [`each`]{@link module:Collections.each} but runs only a single async operation at a time.\n *\n * Note, that unlike [`each`]{@link module:Collections.each}, this function applies iteratee to each item\n * in series and therefore the iteratee functions will complete in order.\n\n * @name eachSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachSeries\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfSeries`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @returns {Promise} a promise, if a callback is omitted\n */\nfunction eachSeries(coll, iteratee, callback) {\n    return eachLimit$2(coll, 1, iteratee, callback)\n}\nvar eachSeries$1 = awaitify(eachSeries, 3);\n\n/**\n * Wrap an async function and ensure it calls its callback on a later tick of\n * the event loop.  If the function already calls its callback on a next tick,\n * no extra deferral is added. This is useful for preventing stack overflows\n * (`RangeError: Maximum call stack size exceeded`) and generally keeping\n * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)\n * contained. ES2017 `async` functions are returned as-is -- they are immune\n * to Zalgo's corrupting influences, as they always resolve on a later tick.\n *\n * @name ensureAsync\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - an async function, one that expects a node-style\n * callback as its last argument.\n * @returns {AsyncFunction} Returns a wrapped function with the exact same call\n * signature as the function passed in.\n * @example\n *\n * function sometimesAsync(arg, callback) {\n *     if (cache[arg]) {\n *         return callback(null, cache[arg]); // this would be synchronous!!\n *     } else {\n *         doSomeIO(arg, callback); // this IO would be asynchronous\n *     }\n * }\n *\n * // this has a risk of stack overflows if many results are cached in a row\n * async.mapSeries(args, sometimesAsync, done);\n *\n * // this will defer sometimesAsync's callback if necessary,\n * // preventing stack overflows\n * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);\n */\nfunction ensureAsync(fn) {\n    if (isAsync(fn)) return fn;\n    return function (...args/*, callback*/) {\n        var callback = args.pop();\n        var sync = true;\n        args.push((...innerArgs) => {\n            if (sync) {\n                setImmediate$1(() => callback(...innerArgs));\n            } else {\n                callback(...innerArgs);\n            }\n        });\n        fn.apply(this, args);\n        sync = false;\n    };\n}\n\n/**\n * Returns `true` if every element in `coll` satisfies an async test. If any\n * iteratee call returns `false`, the main `callback` is immediately called.\n *\n * @name every\n * @static\n * @memberOf module:Collections\n * @method\n * @alias all\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n * // dir4 does not exist\n *\n * const fileList = ['dir1/file1.txt','dir2/file3.txt','dir3/file5.txt'];\n * const withMissingFileList = ['file1.txt','file2.txt','file4.txt'];\n *\n * // asynchronous function that checks if a file exists\n * function fileExists(file, callback) {\n *    fs.access(file, fs.constants.F_OK, (err) => {\n *        callback(null, !err);\n *    });\n * }\n *\n * // Using callbacks\n * async.every(fileList, fileExists, function(err, result) {\n *     console.log(result);\n *     // true\n *     // result is true since every file exists\n * });\n *\n * async.every(withMissingFileList, fileExists, function(err, result) {\n *     console.log(result);\n *     // false\n *     // result is false since NOT every file exists\n * });\n *\n * // Using Promises\n * async.every(fileList, fileExists)\n * .then( result => {\n *     console.log(result);\n *     // true\n *     // result is true since every file exists\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * async.every(withMissingFileList, fileExists)\n * .then( result => {\n *     console.log(result);\n *     // false\n *     // result is false since NOT every file exists\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.every(fileList, fileExists);\n *         console.log(result);\n *         // true\n *         // result is true since every file exists\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * async () => {\n *     try {\n *         let result = await async.every(withMissingFileList, fileExists);\n *         console.log(result);\n *         // false\n *         // result is false since NOT every file exists\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction every(coll, iteratee, callback) {\n    return _createTester(bool => !bool, res => !res)(eachOf$1, coll, iteratee, callback)\n}\nvar every$1 = awaitify(every, 3);\n\n/**\n * The same as [`every`]{@link module:Collections.every} but runs a maximum of `limit` async operations at a time.\n *\n * @name everyLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allLimit\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n */\nfunction everyLimit(coll, limit, iteratee, callback) {\n    return _createTester(bool => !bool, res => !res)(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar everyLimit$1 = awaitify(everyLimit, 4);\n\n/**\n * The same as [`every`]{@link module:Collections.every} but runs only a single async operation at a time.\n *\n * @name everySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allSeries\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in series.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n */\nfunction everySeries(coll, iteratee, callback) {\n    return _createTester(bool => !bool, res => !res)(eachOfSeries$1, coll, iteratee, callback)\n}\nvar everySeries$1 = awaitify(everySeries, 3);\n\nfunction filterArray(eachfn, arr, iteratee, callback) {\n    var truthValues = new Array(arr.length);\n    eachfn(arr, (x, index, iterCb) => {\n        iteratee(x, (err, v) => {\n            truthValues[index] = !!v;\n            iterCb(err);\n        });\n    }, err => {\n        if (err) return callback(err);\n        var results = [];\n        for (var i = 0; i < arr.length; i++) {\n            if (truthValues[i]) results.push(arr[i]);\n        }\n        callback(null, results);\n    });\n}\n\nfunction filterGeneric(eachfn, coll, iteratee, callback) {\n    var results = [];\n    eachfn(coll, (x, index, iterCb) => {\n        iteratee(x, (err, v) => {\n            if (err) return iterCb(err);\n            if (v) {\n                results.push({index, value: x});\n            }\n            iterCb(err);\n        });\n    }, err => {\n        if (err) return callback(err);\n        callback(null, results\n            .sort((a, b) => a.index - b.index)\n            .map(v => v.value));\n    });\n}\n\nfunction _filter(eachfn, coll, iteratee, callback) {\n    var filter = isArrayLike(coll) ? filterArray : filterGeneric;\n    return filter(eachfn, coll, wrapAsync(iteratee), callback);\n}\n\n/**\n * Returns a new array of all the values in `coll` which pass an async truth\n * test. This operation is performed in parallel, but the results array will be\n * in the same order as the original.\n *\n * @name filter\n * @static\n * @memberOf module:Collections\n * @method\n * @alias select\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback provided\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n *\n * const files = ['dir1/file1.txt','dir2/file3.txt','dir3/file6.txt'];\n *\n * // asynchronous function that checks if a file exists\n * function fileExists(file, callback) {\n *    fs.access(file, fs.constants.F_OK, (err) => {\n *        callback(null, !err);\n *    });\n * }\n *\n * // Using callbacks\n * async.filter(files, fileExists, function(err, results) {\n *    if(err) {\n *        console.log(err);\n *    } else {\n *        console.log(results);\n *        // [ 'dir1/file1.txt', 'dir2/file3.txt' ]\n *        // results is now an array of the existing files\n *    }\n * });\n *\n * // Using Promises\n * async.filter(files, fileExists)\n * .then(results => {\n *     console.log(results);\n *     // [ 'dir1/file1.txt', 'dir2/file3.txt' ]\n *     // results is now an array of the existing files\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let results = await async.filter(files, fileExists);\n *         console.log(results);\n *         // [ 'dir1/file1.txt', 'dir2/file3.txt' ]\n *         // results is now an array of the existing files\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction filter (coll, iteratee, callback) {\n    return _filter(eachOf$1, coll, iteratee, callback)\n}\nvar filter$1 = awaitify(filter, 3);\n\n/**\n * The same as [`filter`]{@link module:Collections.filter} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name filterLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectLimit\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback provided\n */\nfunction filterLimit (coll, limit, iteratee, callback) {\n    return _filter(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar filterLimit$1 = awaitify(filterLimit, 4);\n\n/**\n * The same as [`filter`]{@link module:Collections.filter} but runs only a single async operation at a time.\n *\n * @name filterSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectSeries\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results)\n * @returns {Promise} a promise, if no callback provided\n */\nfunction filterSeries (coll, iteratee, callback) {\n    return _filter(eachOfSeries$1, coll, iteratee, callback)\n}\nvar filterSeries$1 = awaitify(filterSeries, 3);\n\n/**\n * Calls the asynchronous function `fn` with a callback parameter that allows it\n * to call itself again, in series, indefinitely.\n\n * If an error is passed to the callback then `errback` is called with the\n * error, and execution stops, otherwise it will never be called.\n *\n * @name forever\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} fn - an async function to call repeatedly.\n * Invoked with (next).\n * @param {Function} [errback] - when `fn` passes an error to it's callback,\n * this function will be called, and execution stops. Invoked with (err).\n * @returns {Promise} a promise that rejects if an error occurs and an errback\n * is not passed\n * @example\n *\n * async.forever(\n *     function(next) {\n *         // next is suitable for passing to things that need a callback(err [, whatever]);\n *         // it will result in this function being called again.\n *     },\n *     function(err) {\n *         // if next is called with a value in its first parameter, it will appear\n *         // in here as 'err', and execution will stop.\n *     }\n * );\n */\nfunction forever(fn, errback) {\n    var done = onlyOnce(errback);\n    var task = wrapAsync(ensureAsync(fn));\n\n    function next(err) {\n        if (err) return done(err);\n        if (err === false) return;\n        task(next);\n    }\n    return next();\n}\nvar forever$1 = awaitify(forever, 2);\n\n/**\n * The same as [`groupBy`]{@link module:Collections.groupBy} but runs a maximum of `limit` async operations at a time.\n *\n * @name groupByLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction groupByLimit(coll, limit, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    return mapLimit$1(coll, limit, (val, iterCb) => {\n        _iteratee(val, (err, key) => {\n            if (err) return iterCb(err);\n            return iterCb(err, {key, val});\n        });\n    }, (err, mapResults) => {\n        var result = {};\n        // from MDN, handle object having an `hasOwnProperty` prop\n        var {hasOwnProperty} = Object.prototype;\n\n        for (var i = 0; i < mapResults.length; i++) {\n            if (mapResults[i]) {\n                var {key} = mapResults[i];\n                var {val} = mapResults[i];\n\n                if (hasOwnProperty.call(result, key)) {\n                    result[key].push(val);\n                } else {\n                    result[key] = [val];\n                }\n            }\n        }\n\n        return callback(err, result);\n    });\n}\n\nvar groupByLimit$1 = awaitify(groupByLimit, 4);\n\n/**\n * Returns a new object, where each value corresponds to an array of items, from\n * `coll`, that returned the corresponding key. That is, the keys of the object\n * correspond to the values passed to the `iteratee` callback.\n *\n * Note: Since this function applies the `iteratee` to each item in parallel,\n * there is no guarantee that the `iteratee` functions will complete in order.\n * However, the values for each key in the `result` will be in the same order as\n * the original `coll`. For Objects, the values will roughly be in the order of\n * the original Objects' keys (but this can vary across JavaScript engines).\n *\n * @name groupBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n * // dir4 does not exist\n *\n * const files = ['dir1/file1.txt','dir2','dir4']\n *\n * // asynchronous function that detects file type as none, file, or directory\n * function detectFile(file, callback) {\n *     fs.stat(file, function(err, stat) {\n *         if (err) {\n *             return callback(null, 'none');\n *         }\n *         callback(null, stat.isDirectory() ? 'directory' : 'file');\n *     });\n * }\n *\n * //Using callbacks\n * async.groupBy(files, detectFile, function(err, result) {\n *     if(err) {\n *         console.log(err);\n *     } else {\n *\t       console.log(result);\n *         // {\n *         //     file: [ 'dir1/file1.txt' ],\n *         //     none: [ 'dir4' ],\n *         //     directory: [ 'dir2']\n *         // }\n *         // result is object containing the files grouped by type\n *     }\n * });\n *\n * // Using Promises\n * async.groupBy(files, detectFile)\n * .then( result => {\n *     console.log(result);\n *     // {\n *     //     file: [ 'dir1/file1.txt' ],\n *     //     none: [ 'dir4' ],\n *     //     directory: [ 'dir2']\n *     // }\n *     // result is object containing the files grouped by type\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.groupBy(files, detectFile);\n *         console.log(result);\n *         // {\n *         //     file: [ 'dir1/file1.txt' ],\n *         //     none: [ 'dir4' ],\n *         //     directory: [ 'dir2']\n *         // }\n *         // result is object containing the files grouped by type\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction groupBy (coll, iteratee, callback) {\n    return groupByLimit$1(coll, Infinity, iteratee, callback)\n}\n\n/**\n * The same as [`groupBy`]{@link module:Collections.groupBy} but runs only a single async operation at a time.\n *\n * @name groupBySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whose\n * properties are arrays of values which returned the corresponding key.\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction groupBySeries (coll, iteratee, callback) {\n    return groupByLimit$1(coll, 1, iteratee, callback)\n}\n\n/**\n * Logs the result of an `async` function to the `console`. Only works in\n * Node.js or in browsers that support `console.log` and `console.error` (such\n * as FF and Chrome). If multiple arguments are returned from the async\n * function, `console.log` is called on each argument in order.\n *\n * @name log\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...*} arguments... - Any number of arguments to apply to the function.\n * @example\n *\n * // in a module\n * var hello = function(name, callback) {\n *     setTimeout(function() {\n *         callback(null, 'hello ' + name);\n *     }, 1000);\n * };\n *\n * // in the node repl\n * node> async.log(hello, 'world');\n * 'hello world'\n */\nvar log = consoleFunc('log');\n\n/**\n * The same as [`mapValues`]{@link module:Collections.mapValues} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name mapValuesLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction mapValuesLimit(obj, limit, iteratee, callback) {\n    callback = once(callback);\n    var newObj = {};\n    var _iteratee = wrapAsync(iteratee);\n    return eachOfLimit(limit)(obj, (val, key, next) => {\n        _iteratee(val, key, (err, result) => {\n            if (err) return next(err);\n            newObj[key] = result;\n            next(err);\n        });\n    }, err => callback(err, newObj));\n}\n\nvar mapValuesLimit$1 = awaitify(mapValuesLimit, 4);\n\n/**\n * A relative of [`map`]{@link module:Collections.map}, designed for use with objects.\n *\n * Produces a new Object by mapping each value of `obj` through the `iteratee`\n * function. The `iteratee` is called each `value` and `key` from `obj` and a\n * callback for when it has finished processing. Each of these callbacks takes\n * two arguments: an `error`, and the transformed item from `obj`. If `iteratee`\n * passes an error to its callback, the main `callback` (for the `mapValues`\n * function) is immediately called with the error.\n *\n * Note, the order of the keys in the result is not guaranteed.  The keys will\n * be roughly in the order they complete, (but this is very engine-specific)\n *\n * @name mapValues\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * // file1.txt is a file that is 1000 bytes in size\n * // file2.txt is a file that is 2000 bytes in size\n * // file3.txt is a file that is 3000 bytes in size\n * // file4.txt does not exist\n *\n * const fileMap = {\n *     f1: 'file1.txt',\n *     f2: 'file2.txt',\n *     f3: 'file3.txt'\n * };\n *\n * const withMissingFileMap = {\n *     f1: 'file1.txt',\n *     f2: 'file2.txt',\n *     f3: 'file4.txt'\n * };\n *\n * // asynchronous function that returns the file size in bytes\n * function getFileSizeInBytes(file, key, callback) {\n *     fs.stat(file, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         callback(null, stat.size);\n *     });\n * }\n *\n * // Using callbacks\n * async.mapValues(fileMap, getFileSizeInBytes, function(err, result) {\n *     if (err) {\n *         console.log(err);\n *     } else {\n *         console.log(result);\n *         // result is now a map of file size in bytes for each file, e.g.\n *         // {\n *         //     f1: 1000,\n *         //     f2: 2000,\n *         //     f3: 3000\n *         // }\n *     }\n * });\n *\n * // Error handling\n * async.mapValues(withMissingFileMap, getFileSizeInBytes, function(err, result) {\n *     if (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     } else {\n *         console.log(result);\n *     }\n * });\n *\n * // Using Promises\n * async.mapValues(fileMap, getFileSizeInBytes)\n * .then( result => {\n *     console.log(result);\n *     // result is now a map of file size in bytes for each file, e.g.\n *     // {\n *     //     f1: 1000,\n *     //     f2: 2000,\n *     //     f3: 3000\n *     // }\n * }).catch (err => {\n *     console.log(err);\n * });\n *\n * // Error Handling\n * async.mapValues(withMissingFileMap, getFileSizeInBytes)\n * .then( result => {\n *     console.log(result);\n * }).catch (err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.mapValues(fileMap, getFileSizeInBytes);\n *         console.log(result);\n *         // result is now a map of file size in bytes for each file, e.g.\n *         // {\n *         //     f1: 1000,\n *         //     f2: 2000,\n *         //     f3: 3000\n *         // }\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // Error Handling\n * async () => {\n *     try {\n *         let result = await async.mapValues(withMissingFileMap, getFileSizeInBytes);\n *         console.log(result);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     }\n * }\n *\n */\nfunction mapValues(obj, iteratee, callback) {\n    return mapValuesLimit$1(obj, Infinity, iteratee, callback)\n}\n\n/**\n * The same as [`mapValues`]{@link module:Collections.mapValues} but runs only a single async operation at a time.\n *\n * @name mapValuesSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction mapValuesSeries(obj, iteratee, callback) {\n    return mapValuesLimit$1(obj, 1, iteratee, callback)\n}\n\n/**\n * Caches the results of an async function. When creating a hash to store\n * function results against, the callback is omitted from the hash and an\n * optional hash function can be used.\n *\n * **Note: if the async function errs, the result will not be cached and\n * subsequent calls will call the wrapped function.**\n *\n * If no hash function is specified, the first argument is used as a hash key,\n * which may work reasonably if it is a string or a data type that converts to a\n * distinct string. Note that objects and arrays will not behave reasonably.\n * Neither will cases where the other arguments are significant. In such cases,\n * specify your own hash function.\n *\n * The cache of results is exposed as the `memo` property of the function\n * returned by `memoize`.\n *\n * @name memoize\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function to proxy and cache results from.\n * @param {Function} hasher - An optional function for generating a custom hash\n * for storing results. It has all the arguments applied to it apart from the\n * callback, and must be synchronous.\n * @returns {AsyncFunction} a memoized version of `fn`\n * @example\n *\n * var slow_fn = function(name, callback) {\n *     // do something\n *     callback(null, result);\n * };\n * var fn = async.memoize(slow_fn);\n *\n * // fn can now be used as if it were slow_fn\n * fn('some name', function() {\n *     // callback\n * });\n */\nfunction memoize(fn, hasher = v => v) {\n    var memo = Object.create(null);\n    var queues = Object.create(null);\n    var _fn = wrapAsync(fn);\n    var memoized = initialParams((args, callback) => {\n        var key = hasher(...args);\n        if (key in memo) {\n            setImmediate$1(() => callback(null, ...memo[key]));\n        } else if (key in queues) {\n            queues[key].push(callback);\n        } else {\n            queues[key] = [callback];\n            _fn(...args, (err, ...resultArgs) => {\n                // #1465 don't memoize if an error occurred\n                if (!err) {\n                    memo[key] = resultArgs;\n                }\n                var q = queues[key];\n                delete queues[key];\n                for (var i = 0, l = q.length; i < l; i++) {\n                    q[i](err, ...resultArgs);\n                }\n            });\n        }\n    });\n    memoized.memo = memo;\n    memoized.unmemoized = fn;\n    return memoized;\n}\n\n/**\n * Calls `callback` on a later loop around the event loop. In Node.js this just\n * calls `process.nextTick`.  In the browser it will use `setImmediate` if\n * available, otherwise `setTimeout(callback, 0)`, which means other higher\n * priority events may precede the execution of `callback`.\n *\n * This is used internally for browser-compatibility purposes.\n *\n * @name nextTick\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.setImmediate]{@link module:Utils.setImmediate}\n * @category Util\n * @param {Function} callback - The function to call on a later loop around\n * the event loop. Invoked with (args...).\n * @param {...*} args... - any number of additional arguments to pass to the\n * callback on the next tick.\n * @example\n *\n * var call_order = [];\n * async.nextTick(function() {\n *     call_order.push('two');\n *     // call_order now equals ['one','two']\n * });\n * call_order.push('one');\n *\n * async.setImmediate(function (a, b, c) {\n *     // a, b, and c equal 1, 2, and 3\n * }, 1, 2, 3);\n */\nvar _defer$1;\n\nif (hasNextTick) {\n    _defer$1 = process.nextTick;\n} else if (hasSetImmediate) {\n    _defer$1 = setImmediate;\n} else {\n    _defer$1 = fallback;\n}\n\nvar nextTick = wrap(_defer$1);\n\nvar _parallel = awaitify((eachfn, tasks, callback) => {\n    var results = isArrayLike(tasks) ? [] : {};\n\n    eachfn(tasks, (task, key, taskCb) => {\n        wrapAsync(task)((err, ...result) => {\n            if (result.length < 2) {\n                [result] = result;\n            }\n            results[key] = result;\n            taskCb(err);\n        });\n    }, err => callback(err, results));\n}, 3);\n\n/**\n * Run the `tasks` collection of functions in parallel, without waiting until\n * the previous function has completed. If any of the functions pass an error to\n * its callback, the main `callback` is immediately called with the value of the\n * error. Once the `tasks` have completed, the results are passed to the final\n * `callback` as an array.\n *\n * **Note:** `parallel` is about kicking-off I/O tasks in parallel, not about\n * parallel execution of code.  If your tasks do not use any timers or perform\n * any I/O, they will actually be executed in series.  Any synchronous setup\n * sections for each task will happen one after the other.  JavaScript remains\n * single-threaded.\n *\n * **Hint:** Use [`reflect`]{@link module:Utils.reflect} to continue the\n * execution of other tasks when a task fails.\n *\n * It is also possible to use an object instead of an array. Each property will\n * be run as a function and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.parallel}.\n *\n * @name parallel\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n * @returns {Promise} a promise, if a callback is not passed\n *\n * @example\n *\n * //Using Callbacks\n * async.parallel([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ], function(err, results) {\n *     console.log(results);\n *     // results is equal to ['one','two'] even though\n *     // the second function had a shorter timeout.\n * });\n *\n * // an example using an object instead of an array\n * async.parallel({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }, function(err, results) {\n *     console.log(results);\n *     // results is equal to: { one: 1, two: 2 }\n * });\n *\n * //Using Promises\n * async.parallel([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ]).then(results => {\n *     console.log(results);\n *     // results is equal to ['one','two'] even though\n *     // the second function had a shorter timeout.\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // an example using an object instead of an array\n * async.parallel({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }).then(results => {\n *     console.log(results);\n *     // results is equal to: { one: 1, two: 2 }\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * //Using async/await\n * async () => {\n *     try {\n *         let results = await async.parallel([\n *             function(callback) {\n *                 setTimeout(function() {\n *                     callback(null, 'one');\n *                 }, 200);\n *             },\n *             function(callback) {\n *                 setTimeout(function() {\n *                     callback(null, 'two');\n *                 }, 100);\n *             }\n *         ]);\n *         console.log(results);\n *         // results is equal to ['one','two'] even though\n *         // the second function had a shorter timeout.\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // an example using an object instead of an array\n * async () => {\n *     try {\n *         let results = await async.parallel({\n *             one: function(callback) {\n *                 setTimeout(function() {\n *                     callback(null, 1);\n *                 }, 200);\n *             },\n *            two: function(callback) {\n *                 setTimeout(function() {\n *                     callback(null, 2);\n *                 }, 100);\n *            }\n *         });\n *         console.log(results);\n *         // results is equal to: { one: 1, two: 2 }\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction parallel(tasks, callback) {\n    return _parallel(eachOf$1, tasks, callback);\n}\n\n/**\n * The same as [`parallel`]{@link module:ControlFlow.parallel} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name parallelLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.parallel]{@link module:ControlFlow.parallel}\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n * @returns {Promise} a promise, if a callback is not passed\n */\nfunction parallelLimit(tasks, limit, callback) {\n    return _parallel(eachOfLimit(limit), tasks, callback);\n}\n\n/**\n * A queue of tasks for the worker function to complete.\n * @typedef {Iterable} QueueObject\n * @memberOf module:ControlFlow\n * @property {Function} length - a function returning the number of items\n * waiting to be processed. Invoke with `queue.length()`.\n * @property {boolean} started - a boolean indicating whether or not any\n * items have been pushed and processed by the queue.\n * @property {Function} running - a function returning the number of items\n * currently being processed. Invoke with `queue.running()`.\n * @property {Function} workersList - a function returning the array of items\n * currently being processed. Invoke with `queue.workersList()`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke with `queue.idle()`.\n * @property {number} concurrency - an integer for determining how many `worker`\n * functions should be run in parallel. This property can be changed after a\n * `queue` is created to alter the concurrency on-the-fly.\n * @property {number} payload - an integer that specifies how many items are\n * passed to the worker function at a time. only applies if this is a\n * [cargo]{@link module:ControlFlow.cargo} object\n * @property {AsyncFunction} push - add a new task to the `queue`. Calls `callback`\n * once the `worker` has finished processing the task. Instead of a single task,\n * a `tasks` array can be submitted. The respective callback is used for every\n * task in the list. Invoke with `queue.push(task, [callback])`,\n * @property {AsyncFunction} unshift - add a new task to the front of the `queue`.\n * Invoke with `queue.unshift(task, [callback])`.\n * @property {AsyncFunction} pushAsync - the same as `q.push`, except this returns\n * a promise that rejects if an error occurs.\n * @property {AsyncFunction} unshiftAsync - the same as `q.unshift`, except this returns\n * a promise that rejects if an error occurs.\n * @property {Function} remove - remove items from the queue that match a test\n * function.  The test function will be passed an object with a `data` property,\n * and a `priority` property, if this is a\n * [priorityQueue]{@link module:ControlFlow.priorityQueue} object.\n * Invoked with `queue.remove(testFn)`, where `testFn` is of the form\n * `function ({data, priority}) {}` and returns a Boolean.\n * @property {Function} saturated - a function that sets a callback that is\n * called when the number of running workers hits the `concurrency` limit, and\n * further tasks will be queued.  If the callback is omitted, `q.saturated()`\n * returns a promise for the next occurrence.\n * @property {Function} unsaturated - a function that sets a callback that is\n * called when the number of running workers is less than the `concurrency` &\n * `buffer` limits, and further tasks will not be queued. If the callback is\n * omitted, `q.unsaturated()` returns a promise for the next occurrence.\n * @property {number} buffer - A minimum threshold buffer in order to say that\n * the `queue` is `unsaturated`.\n * @property {Function} empty - a function that sets a callback that is called\n * when the last item from the `queue` is given to a `worker`. If the callback\n * is omitted, `q.empty()` returns a promise for the next occurrence.\n * @property {Function} drain - a function that sets a callback that is called\n * when the last item from the `queue` has returned from the `worker`. If the\n * callback is omitted, `q.drain()` returns a promise for the next occurrence.\n * @property {Function} error - a function that sets a callback that is called\n * when a task errors. Has the signature `function(error, task)`. If the\n * callback is omitted, `error()` returns a promise that rejects on the next\n * error.\n * @property {boolean} paused - a boolean for determining whether the queue is\n * in a paused state.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke with `queue.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke with `queue.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. No more tasks\n * should be pushed to the queue after calling this function. Invoke with `queue.kill()`.\n *\n * @example\n * const q = async.queue(worker, 2)\n * q.push(item1)\n * q.push(item2)\n * q.push(item3)\n * // queues are iterable, spread into an array to inspect\n * const items = [...q] // [item1, item2, item3]\n * // or use for of\n * for (let item of q) {\n *     console.log(item)\n * }\n *\n * q.drain(() => {\n *     console.log('all done')\n * })\n * // or\n * await q.drain()\n */\n\n/**\n * Creates a `queue` object with the specified `concurrency`. Tasks added to the\n * `queue` are processed in parallel (up to the `concurrency` limit). If all\n * `worker`s are in progress, the task is queued until one becomes available.\n * Once a `worker` completes a `task`, that `task`'s callback is called.\n *\n * @name queue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`. Invoked with (task, callback).\n * @param {number} [concurrency=1] - An `integer` for determining how many\n * `worker` functions should be run in parallel.  If omitted, the concurrency\n * defaults to `1`.  If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A queue object to manage the tasks. Callbacks can be\n * attached as certain properties to listen for specific events during the\n * lifecycle of the queue.\n * @example\n *\n * // create a queue object with concurrency 2\n * var q = async.queue(function(task, callback) {\n *     console.log('hello ' + task.name);\n *     callback();\n * }, 2);\n *\n * // assign a callback\n * q.drain(function() {\n *     console.log('all items have been processed');\n * });\n * // or await the end\n * await q.drain()\n *\n * // assign an error callback\n * q.error(function(err, task) {\n *     console.error('task experienced an error');\n * });\n *\n * // add some items to the queue\n * q.push({name: 'foo'}, function(err) {\n *     console.log('finished processing foo');\n * });\n * // callback is optional\n * q.push({name: 'bar'});\n *\n * // add some items to the queue (batch-wise)\n * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {\n *     console.log('finished processing item');\n * });\n *\n * // add some items to the front of the queue\n * q.unshift({name: 'bar'}, function (err) {\n *     console.log('finished processing bar');\n * });\n */\nfunction queue$1 (worker, concurrency) {\n    var _worker = wrapAsync(worker);\n    return queue((items, cb) => {\n        _worker(items[0], cb);\n    }, concurrency, 1);\n}\n\n// Binary min-heap implementation used for priority queue.\n// Implementation is stable, i.e. push time is considered for equal priorities\nclass Heap {\n    constructor() {\n        this.heap = [];\n        this.pushCount = Number.MIN_SAFE_INTEGER;\n    }\n\n    get length() {\n        return this.heap.length;\n    }\n\n    empty () {\n        this.heap = [];\n        return this;\n    }\n\n    percUp(index) {\n        let p;\n\n        while (index > 0 && smaller(this.heap[index], this.heap[p=parent(index)])) {\n            let t = this.heap[index];\n            this.heap[index] = this.heap[p];\n            this.heap[p] = t;\n\n            index = p;\n        }\n    }\n\n    percDown(index) {\n        let l;\n\n        while ((l=leftChi(index)) < this.heap.length) {\n            if (l+1 < this.heap.length && smaller(this.heap[l+1], this.heap[l])) {\n                l = l+1;\n            }\n\n            if (smaller(this.heap[index], this.heap[l])) {\n                break;\n            }\n\n            let t = this.heap[index];\n            this.heap[index] = this.heap[l];\n            this.heap[l] = t;\n\n            index = l;\n        }\n    }\n\n    push(node) {\n        node.pushCount = ++this.pushCount;\n        this.heap.push(node);\n        this.percUp(this.heap.length-1);\n    }\n\n    unshift(node) {\n        return this.heap.push(node);\n    }\n\n    shift() {\n        let [top] = this.heap;\n\n        this.heap[0] = this.heap[this.heap.length-1];\n        this.heap.pop();\n        this.percDown(0);\n\n        return top;\n    }\n\n    toArray() {\n        return [...this];\n    }\n\n    *[Symbol.iterator] () {\n        for (let i = 0; i < this.heap.length; i++) {\n            yield this.heap[i].data;\n        }\n    }\n\n    remove (testFn) {\n        let j = 0;\n        for (let i = 0; i < this.heap.length; i++) {\n            if (!testFn(this.heap[i])) {\n                this.heap[j] = this.heap[i];\n                j++;\n            }\n        }\n\n        this.heap.splice(j);\n\n        for (let i = parent(this.heap.length-1); i >= 0; i--) {\n            this.percDown(i);\n        }\n\n        return this;\n    }\n}\n\nfunction leftChi(i) {\n    return (i<<1)+1;\n}\n\nfunction parent(i) {\n    return ((i+1)>>1)-1;\n}\n\nfunction smaller(x, y) {\n    if (x.priority !== y.priority) {\n        return x.priority < y.priority;\n    }\n    else {\n        return x.pushCount < y.pushCount;\n    }\n}\n\n/**\n * The same as [async.queue]{@link module:ControlFlow.queue} only tasks are assigned a priority and\n * completed in ascending priority order.\n *\n * @name priorityQueue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`.\n * Invoked with (task, callback).\n * @param {number} concurrency - An `integer` for determining how many `worker`\n * functions should be run in parallel.  If omitted, the concurrency defaults to\n * `1`.  If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A priorityQueue object to manage the tasks. There are two\n * differences between `queue` and `priorityQueue` objects:\n * * `push(task, priority, [callback])` - `priority` should be a number. If an\n *   array of `tasks` is given, all tasks will be assigned the same priority.\n * * The `unshift` method was removed.\n */\nfunction priorityQueue(worker, concurrency) {\n    // Start with a normal queue\n    var q = queue$1(worker, concurrency);\n    var processingScheduled = false;\n\n    q._tasks = new Heap();\n\n    // Override push to accept second parameter representing priority\n    q.push = function(data, priority = 0, callback = () => {}) {\n        if (typeof callback !== 'function') {\n            throw new Error('task callback must be a function');\n        }\n        q.started = true;\n        if (!Array.isArray(data)) {\n            data = [data];\n        }\n        if (data.length === 0 && q.idle()) {\n            // call drain immediately if there are no tasks\n            return setImmediate$1(() => q.drain());\n        }\n\n        for (var i = 0, l = data.length; i < l; i++) {\n            var item = {\n                data: data[i],\n                priority,\n                callback\n            };\n\n            q._tasks.push(item);\n        }\n\n        if (!processingScheduled) {\n            processingScheduled = true;\n            setImmediate$1(() => {\n                processingScheduled = false;\n                q.process();\n            });\n        }\n    };\n\n    // Remove unshift function\n    delete q.unshift;\n\n    return q;\n}\n\n/**\n * Runs the `tasks` array of functions in parallel, without waiting until the\n * previous function has completed. Once any of the `tasks` complete or pass an\n * error to its callback, the main `callback` is immediately called. It's\n * equivalent to `Promise.race()`.\n *\n * @name race\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array containing [async functions]{@link AsyncFunction}\n * to run. Each function can complete with an optional `result` value.\n * @param {Function} callback - A callback to run once any of the functions have\n * completed. This function gets an error or result from the first function that\n * completed. Invoked with (err, result).\n * @returns undefined\n * @example\n *\n * async.race([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ],\n * // main callback\n * function(err, result) {\n *     // the result will be equal to 'two' as it finishes earlier\n * });\n */\nfunction race(tasks, callback) {\n    callback = once(callback);\n    if (!Array.isArray(tasks)) return callback(new TypeError('First argument to race must be an array of functions'));\n    if (!tasks.length) return callback();\n    for (var i = 0, l = tasks.length; i < l; i++) {\n        wrapAsync(tasks[i])(callback);\n    }\n}\n\nvar race$1 = awaitify(race, 2);\n\n/**\n * Same as [`reduce`]{@link module:Collections.reduce}, only operates on `array` in reverse order.\n *\n * @name reduceRight\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reduce]{@link module:Collections.reduce}\n * @alias foldr\n * @category Collection\n * @param {Array} array - A collection to iterate over.\n * @param {*} memo - The initial state of the reduction.\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee completes with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction reduceRight (array, memo, iteratee, callback) {\n    var reversed = [...array].reverse();\n    return reduce$1(reversed, memo, iteratee, callback);\n}\n\n/**\n * Wraps the async function in another function that always completes with a\n * result object, even when it errors.\n *\n * The result object has either the property `error` or `value`.\n *\n * @name reflect\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function you want to wrap\n * @returns {Function} - A function that always passes null to it's callback as\n * the error. The second argument to the callback will be an `object` with\n * either an `error` or a `value` property.\n * @example\n *\n * async.parallel([\n *     async.reflect(function(callback) {\n *         // do some stuff ...\n *         callback(null, 'one');\n *     }),\n *     async.reflect(function(callback) {\n *         // do some more stuff but error ...\n *         callback('bad stuff happened');\n *     }),\n *     async.reflect(function(callback) {\n *         // do some more stuff ...\n *         callback(null, 'two');\n *     })\n * ],\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results[0].value = 'one'\n *     // results[1].error = 'bad stuff happened'\n *     // results[2].value = 'two'\n * });\n */\nfunction reflect(fn) {\n    var _fn = wrapAsync(fn);\n    return initialParams(function reflectOn(args, reflectCallback) {\n        args.push((error, ...cbArgs) => {\n            let retVal = {};\n            if (error) {\n                retVal.error = error;\n            }\n            if (cbArgs.length > 0){\n                var value = cbArgs;\n                if (cbArgs.length <= 1) {\n                    [value] = cbArgs;\n                }\n                retVal.value = value;\n            }\n            reflectCallback(null, retVal);\n        });\n\n        return _fn.apply(this, args);\n    });\n}\n\n/**\n * A helper function that wraps an array or an object of functions with `reflect`.\n *\n * @name reflectAll\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.reflect]{@link module:Utils.reflect}\n * @category Util\n * @param {Array|Object|Iterable} tasks - The collection of\n * [async functions]{@link AsyncFunction} to wrap in `async.reflect`.\n * @returns {Array} Returns an array of async functions, each wrapped in\n * `async.reflect`\n * @example\n *\n * let tasks = [\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         // do some more stuff but error ...\n *         callback(new Error('bad stuff happened'));\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ];\n *\n * async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results[0].value = 'one'\n *     // results[1].error = Error('bad stuff happened')\n *     // results[2].value = 'two'\n * });\n *\n * // an example using an object instead of an array\n * let tasks = {\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         callback('two');\n *     },\n *     three: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'three');\n *         }, 100);\n *     }\n * };\n *\n * async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results.one.value = 'one'\n *     // results.two.error = 'two'\n *     // results.three.value = 'three'\n * });\n */\nfunction reflectAll(tasks) {\n    var results;\n    if (Array.isArray(tasks)) {\n        results = tasks.map(reflect);\n    } else {\n        results = {};\n        Object.keys(tasks).forEach(key => {\n            results[key] = reflect.call(this, tasks[key]);\n        });\n    }\n    return results;\n}\n\nfunction reject(eachfn, arr, _iteratee, callback) {\n    const iteratee = wrapAsync(_iteratee);\n    return _filter(eachfn, arr, (value, cb) => {\n        iteratee(value, (err, v) => {\n            cb(err, !v);\n        });\n    }, callback);\n}\n\n/**\n * The opposite of [`filter`]{@link module:Collections.filter}. Removes values that pass an `async` truth test.\n *\n * @name reject\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n *\n * const fileList = ['dir1/file1.txt','dir2/file3.txt','dir3/file6.txt'];\n *\n * // asynchronous function that checks if a file exists\n * function fileExists(file, callback) {\n *    fs.access(file, fs.constants.F_OK, (err) => {\n *        callback(null, !err);\n *    });\n * }\n *\n * // Using callbacks\n * async.reject(fileList, fileExists, function(err, results) {\n *    // [ 'dir3/file6.txt' ]\n *    // results now equals an array of the non-existing files\n * });\n *\n * // Using Promises\n * async.reject(fileList, fileExists)\n * .then( results => {\n *     console.log(results);\n *     // [ 'dir3/file6.txt' ]\n *     // results now equals an array of the non-existing files\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let results = await async.reject(fileList, fileExists);\n *         console.log(results);\n *         // [ 'dir3/file6.txt' ]\n *         // results now equals an array of the non-existing files\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction reject$1 (coll, iteratee, callback) {\n    return reject(eachOf$1, coll, iteratee, callback)\n}\nvar reject$2 = awaitify(reject$1, 3);\n\n/**\n * The same as [`reject`]{@link module:Collections.reject} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name rejectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction rejectLimit (coll, limit, iteratee, callback) {\n    return reject(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar rejectLimit$1 = awaitify(rejectLimit, 4);\n\n/**\n * The same as [`reject`]{@link module:Collections.reject} but runs only a single async operation at a time.\n *\n * @name rejectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback is passed\n */\nfunction rejectSeries (coll, iteratee, callback) {\n    return reject(eachOfSeries$1, coll, iteratee, callback)\n}\nvar rejectSeries$1 = awaitify(rejectSeries, 3);\n\nfunction constant$1(value) {\n    return function () {\n        return value;\n    }\n}\n\n/**\n * Attempts to get a successful response from `task` no more than `times` times\n * before returning an error. If the task is successful, the `callback` will be\n * passed the result of the successful task. If all attempts fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n *\n * @name retry\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @see [async.retryable]{@link module:ControlFlow.retryable}\n * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - Can be either an\n * object with `times` and `interval` or a number.\n * * `times` - The number of attempts to make before giving up.  The default\n *   is `5`.\n * * `interval` - The time to wait between retries, in milliseconds.  The\n *   default is `0`. The interval may also be specified as a function of the\n *   retry count (see example).\n * * `errorFilter` - An optional synchronous function that is invoked on\n *   erroneous result. If it returns `true` the retry attempts will continue;\n *   if the function returns `false` the retry flow is aborted with the current\n *   attempt's error and result being returned to the final callback.\n *   Invoked with (err).\n * * If `opts` is a number, the number specifies the number of times to retry,\n *   with the default interval of `0`.\n * @param {AsyncFunction} task - An async function to retry.\n * Invoked with (callback).\n * @param {Function} [callback] - An optional callback which is called when the\n * task has succeeded, or after the final failed attempt. It receives the `err`\n * and `result` arguments of the last attempt at completing the `task`. Invoked\n * with (err, results).\n * @returns {Promise} a promise if no callback provided\n *\n * @example\n *\n * // The `retry` function can be used as a stand-alone control flow by passing\n * // a callback, as shown below:\n *\n * // try calling apiMethod 3 times\n * async.retry(3, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod 3 times, waiting 200 ms between each retry\n * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod 10 times with exponential backoff\n * // (i.e. intervals of 100, 200, 400, 800, 1600, ... milliseconds)\n * async.retry({\n *   times: 10,\n *   interval: function(retryCount) {\n *     return 50 * Math.pow(2, retryCount);\n *   }\n * }, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod the default 5 times no delay between each retry\n * async.retry(apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod only when error condition satisfies, all other\n * // errors will abort the retry control flow and return to final callback\n * async.retry({\n *   errorFilter: function(err) {\n *     return err.message === 'Temporary error'; // only retry on a specific error\n *   }\n * }, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // to retry individual methods that are not as reliable within other\n * // control flow functions, use the `retryable` wrapper:\n * async.auto({\n *     users: api.getUsers.bind(api),\n *     payments: async.retryable(3, api.getPayments.bind(api))\n * }, function(err, results) {\n *     // do something with the results\n * });\n *\n */\nconst DEFAULT_TIMES = 5;\nconst DEFAULT_INTERVAL = 0;\n\nfunction retry(opts, task, callback) {\n    var options = {\n        times: DEFAULT_TIMES,\n        intervalFunc: constant$1(DEFAULT_INTERVAL)\n    };\n\n    if (arguments.length < 3 && typeof opts === 'function') {\n        callback = task || promiseCallback();\n        task = opts;\n    } else {\n        parseTimes(options, opts);\n        callback = callback || promiseCallback();\n    }\n\n    if (typeof task !== 'function') {\n        throw new Error(\"Invalid arguments for async.retry\");\n    }\n\n    var _task = wrapAsync(task);\n\n    var attempt = 1;\n    function retryAttempt() {\n        _task((err, ...args) => {\n            if (err === false) return\n            if (err && attempt++ < options.times &&\n                (typeof options.errorFilter != 'function' ||\n                    options.errorFilter(err))) {\n                setTimeout(retryAttempt, options.intervalFunc(attempt - 1));\n            } else {\n                callback(err, ...args);\n            }\n        });\n    }\n\n    retryAttempt();\n    return callback[PROMISE_SYMBOL]\n}\n\nfunction parseTimes(acc, t) {\n    if (typeof t === 'object') {\n        acc.times = +t.times || DEFAULT_TIMES;\n\n        acc.intervalFunc = typeof t.interval === 'function' ?\n            t.interval :\n            constant$1(+t.interval || DEFAULT_INTERVAL);\n\n        acc.errorFilter = t.errorFilter;\n    } else if (typeof t === 'number' || typeof t === 'string') {\n        acc.times = +t || DEFAULT_TIMES;\n    } else {\n        throw new Error(\"Invalid arguments for async.retry\");\n    }\n}\n\n/**\n * A close relative of [`retry`]{@link module:ControlFlow.retry}.  This method\n * wraps a task and makes it retryable, rather than immediately calling it\n * with retries.\n *\n * @name retryable\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.retry]{@link module:ControlFlow.retry}\n * @category Control Flow\n * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - optional\n * options, exactly the same as from `retry`, except for a `opts.arity` that\n * is the arity of the `task` function, defaulting to `task.length`\n * @param {AsyncFunction} task - the asynchronous function to wrap.\n * This function will be passed any arguments passed to the returned wrapper.\n * Invoked with (...args, callback).\n * @returns {AsyncFunction} The wrapped function, which when invoked, will\n * retry on an error, based on the parameters specified in `opts`.\n * This function will accept the same parameters as `task`.\n * @example\n *\n * async.auto({\n *     dep1: async.retryable(3, getFromFlakyService),\n *     process: [\"dep1\", async.retryable(3, function (results, cb) {\n *         maybeProcessData(results.dep1, cb);\n *     })]\n * }, callback);\n */\nfunction retryable (opts, task) {\n    if (!task) {\n        task = opts;\n        opts = null;\n    }\n    let arity = (opts && opts.arity) || task.length;\n    if (isAsync(task)) {\n        arity += 1;\n    }\n    var _task = wrapAsync(task);\n    return initialParams((args, callback) => {\n        if (args.length < arity - 1 || callback == null) {\n            args.push(callback);\n            callback = promiseCallback();\n        }\n        function taskFn(cb) {\n            _task(...args, cb);\n        }\n\n        if (opts) retry(opts, taskFn, callback);\n        else retry(taskFn, callback);\n\n        return callback[PROMISE_SYMBOL]\n    });\n}\n\n/**\n * Run the functions in the `tasks` collection in series, each one running once\n * the previous function has completed. If any functions in the series pass an\n * error to its callback, no more functions are run, and `callback` is\n * immediately called with the value of the error. Otherwise, `callback`\n * receives an array of results when `tasks` have completed.\n *\n * It is also possible to use an object instead of an array. Each property will\n * be run as a function, and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n *  results from {@link async.series}.\n *\n * **Note** that while many implementations preserve the order of object\n * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)\n * explicitly states that\n *\n * > The mechanics and order of enumerating the properties is not specified.\n *\n * So if you rely on the order in which your series of functions are executed,\n * and want this to work on all platforms, consider using an array.\n *\n * @name series\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} tasks - A collection containing\n * [async functions]{@link AsyncFunction} to run in series.\n * Each function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This function gets a results array (or object)\n * containing all the result arguments passed to the `task` callbacks. Invoked\n * with (err, result).\n * @return {Promise} a promise, if no callback is passed\n * @example\n *\n * //Using Callbacks\n * async.series([\n *     function(callback) {\n *         setTimeout(function() {\n *             // do some async task\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             // then do another async task\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ], function(err, results) {\n *     console.log(results);\n *     // results is equal to ['one','two']\n * });\n *\n * // an example using objects instead of arrays\n * async.series({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             // do some async task\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         setTimeout(function() {\n *             // then do another async task\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }, function(err, results) {\n *     console.log(results);\n *     // results is equal to: { one: 1, two: 2 }\n * });\n *\n * //Using Promises\n * async.series([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ]).then(results => {\n *     console.log(results);\n *     // results is equal to ['one','two']\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // an example using an object instead of an array\n * async.series({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             // do some async task\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         setTimeout(function() {\n *             // then do another async task\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }).then(results => {\n *     console.log(results);\n *     // results is equal to: { one: 1, two: 2 }\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * //Using async/await\n * async () => {\n *     try {\n *         let results = await async.series([\n *             function(callback) {\n *                 setTimeout(function() {\n *                     // do some async task\n *                     callback(null, 'one');\n *                 }, 200);\n *             },\n *             function(callback) {\n *                 setTimeout(function() {\n *                     // then do another async task\n *                     callback(null, 'two');\n *                 }, 100);\n *             }\n *         ]);\n *         console.log(results);\n *         // results is equal to ['one','two']\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * // an example using an object instead of an array\n * async () => {\n *     try {\n *         let results = await async.parallel({\n *             one: function(callback) {\n *                 setTimeout(function() {\n *                     // do some async task\n *                     callback(null, 1);\n *                 }, 200);\n *             },\n *            two: function(callback) {\n *                 setTimeout(function() {\n *                     // then do another async task\n *                     callback(null, 2);\n *                 }, 100);\n *            }\n *         });\n *         console.log(results);\n *         // results is equal to: { one: 1, two: 2 }\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction series(tasks, callback) {\n    return _parallel(eachOfSeries$1, tasks, callback);\n}\n\n/**\n * Returns `true` if at least one element in the `coll` satisfies an async test.\n * If any iteratee call returns `true`, the main `callback` is immediately\n * called.\n *\n * @name some\n * @static\n * @memberOf module:Collections\n * @method\n * @alias any\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n * @example\n *\n * // dir1 is a directory that contains file1.txt, file2.txt\n * // dir2 is a directory that contains file3.txt, file4.txt\n * // dir3 is a directory that contains file5.txt\n * // dir4 does not exist\n *\n * // asynchronous function that checks if a file exists\n * function fileExists(file, callback) {\n *    fs.access(file, fs.constants.F_OK, (err) => {\n *        callback(null, !err);\n *    });\n * }\n *\n * // Using callbacks\n * async.some(['dir1/missing.txt','dir2/missing.txt','dir3/file5.txt'], fileExists,\n *    function(err, result) {\n *        console.log(result);\n *        // true\n *        // result is true since some file in the list exists\n *    }\n *);\n *\n * async.some(['dir1/missing.txt','dir2/missing.txt','dir4/missing.txt'], fileExists,\n *    function(err, result) {\n *        console.log(result);\n *        // false\n *        // result is false since none of the files exists\n *    }\n *);\n *\n * // Using Promises\n * async.some(['dir1/missing.txt','dir2/missing.txt','dir3/file5.txt'], fileExists)\n * .then( result => {\n *     console.log(result);\n *     // true\n *     // result is true since some file in the list exists\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * async.some(['dir1/missing.txt','dir2/missing.txt','dir4/missing.txt'], fileExists)\n * .then( result => {\n *     console.log(result);\n *     // false\n *     // result is false since none of the files exists\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.some(['dir1/missing.txt','dir2/missing.txt','dir3/file5.txt'], fileExists);\n *         console.log(result);\n *         // true\n *         // result is true since some file in the list exists\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n * async () => {\n *     try {\n *         let result = await async.some(['dir1/missing.txt','dir2/missing.txt','dir4/missing.txt'], fileExists);\n *         console.log(result);\n *         // false\n *         // result is false since none of the files exists\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction some(coll, iteratee, callback) {\n    return _createTester(Boolean, res => res)(eachOf$1, coll, iteratee, callback)\n}\nvar some$1 = awaitify(some, 3);\n\n/**\n * The same as [`some`]{@link module:Collections.some} but runs a maximum of `limit` async operations at a time.\n *\n * @name someLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anyLimit\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n */\nfunction someLimit(coll, limit, iteratee, callback) {\n    return _createTester(Boolean, res => res)(eachOfLimit(limit), coll, iteratee, callback)\n}\nvar someLimit$1 = awaitify(someLimit, 4);\n\n/**\n * The same as [`some`]{@link module:Collections.some} but runs only a single async operation at a time.\n *\n * @name someSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anySeries\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in series.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n */\nfunction someSeries(coll, iteratee, callback) {\n    return _createTester(Boolean, res => res)(eachOfSeries$1, coll, iteratee, callback)\n}\nvar someSeries$1 = awaitify(someSeries, 3);\n\n/**\n * Sorts a list by the results of running each `coll` value through an async\n * `iteratee`.\n *\n * @name sortBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a value to use as the sort criteria as\n * its `result`.\n * Invoked with (item, callback).\n * @param {Function} callback - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is the items\n * from the original `coll` sorted by the values returned by the `iteratee`\n * calls. Invoked with (err, results).\n * @returns {Promise} a promise, if no callback passed\n * @example\n *\n * // bigfile.txt is a file that is 251100 bytes in size\n * // mediumfile.txt is a file that is 11000 bytes in size\n * // smallfile.txt is a file that is 121 bytes in size\n *\n * // asynchronous function that returns the file size in bytes\n * function getFileSizeInBytes(file, callback) {\n *     fs.stat(file, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         callback(null, stat.size);\n *     });\n * }\n *\n * // Using callbacks\n * async.sortBy(['mediumfile.txt','smallfile.txt','bigfile.txt'], getFileSizeInBytes,\n *     function(err, results) {\n *         if (err) {\n *             console.log(err);\n *         } else {\n *             console.log(results);\n *             // results is now the original array of files sorted by\n *             // file size (ascending by default), e.g.\n *             // [ 'smallfile.txt', 'mediumfile.txt', 'bigfile.txt']\n *         }\n *     }\n * );\n *\n * // By modifying the callback parameter the\n * // sorting order can be influenced:\n *\n * // ascending order\n * async.sortBy(['mediumfile.txt','smallfile.txt','bigfile.txt'], function(file, callback) {\n *     getFileSizeInBytes(file, function(getFileSizeErr, fileSize) {\n *         if (getFileSizeErr) return callback(getFileSizeErr);\n *         callback(null, fileSize);\n *     });\n * }, function(err, results) {\n *         if (err) {\n *             console.log(err);\n *         } else {\n *             console.log(results);\n *             // results is now the original array of files sorted by\n *             // file size (ascending by default), e.g.\n *             // [ 'smallfile.txt', 'mediumfile.txt', 'bigfile.txt']\n *         }\n *     }\n * );\n *\n * // descending order\n * async.sortBy(['bigfile.txt','mediumfile.txt','smallfile.txt'], function(file, callback) {\n *     getFileSizeInBytes(file, function(getFileSizeErr, fileSize) {\n *         if (getFileSizeErr) {\n *             return callback(getFileSizeErr);\n *         }\n *         callback(null, fileSize * -1);\n *     });\n * }, function(err, results) {\n *         if (err) {\n *             console.log(err);\n *         } else {\n *             console.log(results);\n *             // results is now the original array of files sorted by\n *             // file size (ascending by default), e.g.\n *             // [ 'bigfile.txt', 'mediumfile.txt', 'smallfile.txt']\n *         }\n *     }\n * );\n *\n * // Error handling\n * async.sortBy(['mediumfile.txt','smallfile.txt','missingfile.txt'], getFileSizeInBytes,\n *     function(err, results) {\n *         if (err) {\n *             console.log(err);\n *             // [ Error: ENOENT: no such file or directory ]\n *         } else {\n *             console.log(results);\n *         }\n *     }\n * );\n *\n * // Using Promises\n * async.sortBy(['mediumfile.txt','smallfile.txt','bigfile.txt'], getFileSizeInBytes)\n * .then( results => {\n *     console.log(results);\n *     // results is now the original array of files sorted by\n *     // file size (ascending by default), e.g.\n *     // [ 'smallfile.txt', 'mediumfile.txt', 'bigfile.txt']\n * }).catch( err => {\n *     console.log(err);\n * });\n *\n * // Error handling\n * async.sortBy(['mediumfile.txt','smallfile.txt','missingfile.txt'], getFileSizeInBytes)\n * .then( results => {\n *     console.log(results);\n * }).catch( err => {\n *     console.log(err);\n *     // [ Error: ENOENT: no such file or directory ]\n * });\n *\n * // Using async/await\n * (async () => {\n *     try {\n *         let results = await async.sortBy(['bigfile.txt','mediumfile.txt','smallfile.txt'], getFileSizeInBytes);\n *         console.log(results);\n *         // results is now the original array of files sorted by\n *         // file size (ascending by default), e.g.\n *         // [ 'smallfile.txt', 'mediumfile.txt', 'bigfile.txt']\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * })();\n *\n * // Error handling\n * async () => {\n *     try {\n *         let results = await async.sortBy(['missingfile.txt','mediumfile.txt','smallfile.txt'], getFileSizeInBytes);\n *         console.log(results);\n *     }\n *     catch (err) {\n *         console.log(err);\n *         // [ Error: ENOENT: no such file or directory ]\n *     }\n * }\n *\n */\nfunction sortBy (coll, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    return map$1(coll, (x, iterCb) => {\n        _iteratee(x, (err, criteria) => {\n            if (err) return iterCb(err);\n            iterCb(err, {value: x, criteria});\n        });\n    }, (err, results) => {\n        if (err) return callback(err);\n        callback(null, results.sort(comparator).map(v => v.value));\n    });\n\n    function comparator(left, right) {\n        var a = left.criteria, b = right.criteria;\n        return a < b ? -1 : a > b ? 1 : 0;\n    }\n}\nvar sortBy$1 = awaitify(sortBy, 3);\n\n/**\n * Sets a time limit on an asynchronous function. If the function does not call\n * its callback within the specified milliseconds, it will be called with a\n * timeout error. The code property for the error object will be `'ETIMEDOUT'`.\n *\n * @name timeout\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} asyncFn - The async function to limit in time.\n * @param {number} milliseconds - The specified time limit.\n * @param {*} [info] - Any variable you want attached (`string`, `object`, etc)\n * to timeout Error for more information..\n * @returns {AsyncFunction} Returns a wrapped function that can be used with any\n * of the control flow functions.\n * Invoke this function with the same parameters as you would `asyncFunc`.\n * @example\n *\n * function myFunction(foo, callback) {\n *     doAsyncTask(foo, function(err, data) {\n *         // handle errors\n *         if (err) return callback(err);\n *\n *         // do some stuff ...\n *\n *         // return processed data\n *         return callback(null, data);\n *     });\n * }\n *\n * var wrapped = async.timeout(myFunction, 1000);\n *\n * // call `wrapped` as you would `myFunction`\n * wrapped({ bar: 'bar' }, function(err, data) {\n *     // if `myFunction` takes < 1000 ms to execute, `err`\n *     // and `data` will have their expected values\n *\n *     // else `err` will be an Error with the code 'ETIMEDOUT'\n * });\n */\nfunction timeout(asyncFn, milliseconds, info) {\n    var fn = wrapAsync(asyncFn);\n\n    return initialParams((args, callback) => {\n        var timedOut = false;\n        var timer;\n\n        function timeoutCallback() {\n            var name = asyncFn.name || 'anonymous';\n            var error  = new Error('Callback function \"' + name + '\" timed out.');\n            error.code = 'ETIMEDOUT';\n            if (info) {\n                error.info = info;\n            }\n            timedOut = true;\n            callback(error);\n        }\n\n        args.push((...cbArgs) => {\n            if (!timedOut) {\n                callback(...cbArgs);\n                clearTimeout(timer);\n            }\n        });\n\n        // setup timer and call original function\n        timer = setTimeout(timeoutCallback, milliseconds);\n        fn(...args);\n    });\n}\n\nfunction range(size) {\n    var result = Array(size);\n    while (size--) {\n        result[size] = size;\n    }\n    return result;\n}\n\n/**\n * The same as [times]{@link module:ControlFlow.times} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name timesLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} count - The number of times to run the function.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see [async.map]{@link module:Collections.map}.\n * @returns {Promise} a promise, if no callback is provided\n */\nfunction timesLimit(count, limit, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    return mapLimit$1(range(count), limit, _iteratee, callback);\n}\n\n/**\n * Calls the `iteratee` function `n` times, and accumulates results in the same\n * manner you would use with [map]{@link module:Collections.map}.\n *\n * @name times\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n * @returns {Promise} a promise, if no callback is provided\n * @example\n *\n * // Pretend this is some complicated async factory\n * var createUser = function(id, callback) {\n *     callback(null, {\n *         id: 'user' + id\n *     });\n * };\n *\n * // generate 5 users\n * async.times(5, function(n, next) {\n *     createUser(n, function(err, user) {\n *         next(err, user);\n *     });\n * }, function(err, users) {\n *     // we should now have 5 users\n * });\n */\nfunction times (n, iteratee, callback) {\n    return timesLimit(n, Infinity, iteratee, callback)\n}\n\n/**\n * The same as [times]{@link module:ControlFlow.times} but runs only a single async operation at a time.\n *\n * @name timesSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n * @returns {Promise} a promise, if no callback is provided\n */\nfunction timesSeries (n, iteratee, callback) {\n    return timesLimit(n, 1, iteratee, callback)\n}\n\n/**\n * A relative of `reduce`.  Takes an Object or Array, and iterates over each\n * element in parallel, each step potentially mutating an `accumulator` value.\n * The type of the accumulator defaults to the type of collection passed in.\n *\n * @name transform\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|AsyncIterable|Object} coll - A collection to iterate over.\n * @param {*} [accumulator] - The initial state of the transform.  If omitted,\n * it will default to an empty Object or Array, depending on the type of `coll`\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * collection that potentially modifies the accumulator.\n * Invoked with (accumulator, item, key, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the transformed accumulator.\n * Invoked with (err, result).\n * @returns {Promise} a promise, if no callback provided\n * @example\n *\n * // file1.txt is a file that is 1000 bytes in size\n * // file2.txt is a file that is 2000 bytes in size\n * // file3.txt is a file that is 3000 bytes in size\n *\n * // helper function that returns human-readable size format from bytes\n * function formatBytes(bytes, decimals = 2) {\n *   // implementation not included for brevity\n *   return humanReadbleFilesize;\n * }\n *\n * const fileList = ['file1.txt','file2.txt','file3.txt'];\n *\n * // asynchronous function that returns the file size, transformed to human-readable format\n * // e.g. 1024 bytes = 1KB, 1234 bytes = 1.21 KB, 1048576 bytes = 1MB, etc.\n * function transformFileSize(acc, value, key, callback) {\n *     fs.stat(value, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         acc[key] = formatBytes(stat.size);\n *         callback(null);\n *     });\n * }\n *\n * // Using callbacks\n * async.transform(fileList, transformFileSize, function(err, result) {\n *     if(err) {\n *         console.log(err);\n *     } else {\n *         console.log(result);\n *         // [ '1000 Bytes', '1.95 KB', '2.93 KB' ]\n *     }\n * });\n *\n * // Using Promises\n * async.transform(fileList, transformFileSize)\n * .then(result => {\n *     console.log(result);\n *     // [ '1000 Bytes', '1.95 KB', '2.93 KB' ]\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * (async () => {\n *     try {\n *         let result = await async.transform(fileList, transformFileSize);\n *         console.log(result);\n *         // [ '1000 Bytes', '1.95 KB', '2.93 KB' ]\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * })();\n *\n * @example\n *\n * // file1.txt is a file that is 1000 bytes in size\n * // file2.txt is a file that is 2000 bytes in size\n * // file3.txt is a file that is 3000 bytes in size\n *\n * // helper function that returns human-readable size format from bytes\n * function formatBytes(bytes, decimals = 2) {\n *   // implementation not included for brevity\n *   return humanReadbleFilesize;\n * }\n *\n * const fileMap = { f1: 'file1.txt', f2: 'file2.txt', f3: 'file3.txt' };\n *\n * // asynchronous function that returns the file size, transformed to human-readable format\n * // e.g. 1024 bytes = 1KB, 1234 bytes = 1.21 KB, 1048576 bytes = 1MB, etc.\n * function transformFileSize(acc, value, key, callback) {\n *     fs.stat(value, function(err, stat) {\n *         if (err) {\n *             return callback(err);\n *         }\n *         acc[key] = formatBytes(stat.size);\n *         callback(null);\n *     });\n * }\n *\n * // Using callbacks\n * async.transform(fileMap, transformFileSize, function(err, result) {\n *     if(err) {\n *         console.log(err);\n *     } else {\n *         console.log(result);\n *         // { f1: '1000 Bytes', f2: '1.95 KB', f3: '2.93 KB' }\n *     }\n * });\n *\n * // Using Promises\n * async.transform(fileMap, transformFileSize)\n * .then(result => {\n *     console.log(result);\n *     // { f1: '1000 Bytes', f2: '1.95 KB', f3: '2.93 KB' }\n * }).catch(err => {\n *     console.log(err);\n * });\n *\n * // Using async/await\n * async () => {\n *     try {\n *         let result = await async.transform(fileMap, transformFileSize);\n *         console.log(result);\n *         // { f1: '1000 Bytes', f2: '1.95 KB', f3: '2.93 KB' }\n *     }\n *     catch (err) {\n *         console.log(err);\n *     }\n * }\n *\n */\nfunction transform (coll, accumulator, iteratee, callback) {\n    if (arguments.length <= 3 && typeof accumulator === 'function') {\n        callback = iteratee;\n        iteratee = accumulator;\n        accumulator = Array.isArray(coll) ? [] : {};\n    }\n    callback = once(callback || promiseCallback());\n    var _iteratee = wrapAsync(iteratee);\n\n    eachOf$1(coll, (v, k, cb) => {\n        _iteratee(accumulator, v, k, cb);\n    }, err => callback(err, accumulator));\n    return callback[PROMISE_SYMBOL]\n}\n\n/**\n * It runs each task in series but stops whenever any of the functions were\n * successful. If one of the tasks were successful, the `callback` will be\n * passed the result of the successful task. If all tasks fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n *\n * @name tryEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|AsyncIterable|Object} tasks - A collection containing functions to\n * run, each function is passed a `callback(err, result)` it must call on\n * completion with an error `err` (which can be `null`) and an optional `result`\n * value.\n * @param {Function} [callback] - An optional callback which is called when one\n * of the tasks has succeeded, or all have failed. It receives the `err` and\n * `result` arguments of the last attempt at completing the `task`. Invoked with\n * (err, results).\n * @returns {Promise} a promise, if no callback is passed\n * @example\n * async.tryEach([\n *     function getDataFromFirstWebsite(callback) {\n *         // Try getting the data from the first website\n *         callback(err, data);\n *     },\n *     function getDataFromSecondWebsite(callback) {\n *         // First website failed,\n *         // Try getting the data from the backup website\n *         callback(err, data);\n *     }\n * ],\n * // optional callback\n * function(err, results) {\n *     Now do something with the data.\n * });\n *\n */\nfunction tryEach(tasks, callback) {\n    var error = null;\n    var result;\n    return eachSeries$1(tasks, (task, taskCb) => {\n        wrapAsync(task)((err, ...args) => {\n            if (err === false) return taskCb(err);\n\n            if (args.length < 2) {\n                [result] = args;\n            } else {\n                result = args;\n            }\n            error = err;\n            taskCb(err ? null : {});\n        });\n    }, () => callback(error, result));\n}\n\nvar tryEach$1 = awaitify(tryEach);\n\n/**\n * Undoes a [memoize]{@link module:Utils.memoize}d function, reverting it to the original,\n * unmemoized form. Handy for testing.\n *\n * @name unmemoize\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.memoize]{@link module:Utils.memoize}\n * @category Util\n * @param {AsyncFunction} fn - the memoized function\n * @returns {AsyncFunction} a function that calls the original unmemoized function\n */\nfunction unmemoize(fn) {\n    return (...args) => {\n        return (fn.unmemoized || fn)(...args);\n    };\n}\n\n/**\n * Repeatedly call `iteratee`, while `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs.\n *\n * @name whilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns {Promise} a promise, if no callback is passed\n * @example\n *\n * var count = 0;\n * async.whilst(\n *     function test(cb) { cb(null, count < 5); },\n *     function iter(callback) {\n *         count++;\n *         setTimeout(function() {\n *             callback(null, count);\n *         }, 1000);\n *     },\n *     function (err, n) {\n *         // 5 seconds have passed, n = 5\n *     }\n * );\n */\nfunction whilst(test, iteratee, callback) {\n    callback = onlyOnce(callback);\n    var _fn = wrapAsync(iteratee);\n    var _test = wrapAsync(test);\n    var results = [];\n\n    function next(err, ...rest) {\n        if (err) return callback(err);\n        results = rest;\n        if (err === false) return;\n        _test(check);\n    }\n\n    function check(err, truth) {\n        if (err) return callback(err);\n        if (err === false) return;\n        if (!truth) return callback(null, ...results);\n        _fn(next);\n    }\n\n    return _test(check);\n}\nvar whilst$1 = awaitify(whilst, 3);\n\n/**\n * Repeatedly call `iteratee` until `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs. `callback` will be passed an error and any\n * arguments passed to the final `iteratee`'s callback.\n *\n * The inverse of [whilst]{@link module:ControlFlow.whilst}.\n *\n * @name until\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `iteratee`. Invoked with (callback).\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns {Promise} a promise, if a callback is not passed\n *\n * @example\n * const results = []\n * let finished = false\n * async.until(function test(cb) {\n *     cb(null, finished)\n * }, function iter(next) {\n *     fetchPage(url, (err, body) => {\n *         if (err) return next(err)\n *         results = results.concat(body.objects)\n *         finished = !!body.next\n *         next(err)\n *     })\n * }, function done (err) {\n *     // all pages have been fetched\n * })\n */\nfunction until(test, iteratee, callback) {\n    const _test = wrapAsync(test);\n    return whilst$1((cb) => _test((err, truth) => cb (err, !truth)), iteratee, callback);\n}\n\n/**\n * Runs the `tasks` array of functions in series, each passing their results to\n * the next in the array. However, if any of the `tasks` pass an error to their\n * own callback, the next function is not executed, and the main `callback` is\n * immediately called with the error.\n *\n * @name waterfall\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array of [async functions]{@link AsyncFunction}\n * to run.\n * Each function should complete with any number of `result` values.\n * The `result` values will be passed as arguments, in order, to the next task.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This will be passed the results of the last task's\n * callback. Invoked with (err, [results]).\n * @returns undefined\n * @example\n *\n * async.waterfall([\n *     function(callback) {\n *         callback(null, 'one', 'two');\n *     },\n *     function(arg1, arg2, callback) {\n *         // arg1 now equals 'one' and arg2 now equals 'two'\n *         callback(null, 'three');\n *     },\n *     function(arg1, callback) {\n *         // arg1 now equals 'three'\n *         callback(null, 'done');\n *     }\n * ], function (err, result) {\n *     // result now equals 'done'\n * });\n *\n * // Or, with named functions:\n * async.waterfall([\n *     myFirstFunction,\n *     mySecondFunction,\n *     myLastFunction,\n * ], function (err, result) {\n *     // result now equals 'done'\n * });\n * function myFirstFunction(callback) {\n *     callback(null, 'one', 'two');\n * }\n * function mySecondFunction(arg1, arg2, callback) {\n *     // arg1 now equals 'one' and arg2 now equals 'two'\n *     callback(null, 'three');\n * }\n * function myLastFunction(arg1, callback) {\n *     // arg1 now equals 'three'\n *     callback(null, 'done');\n * }\n */\nfunction waterfall (tasks, callback) {\n    callback = once(callback);\n    if (!Array.isArray(tasks)) return callback(new Error('First argument to waterfall must be an array of functions'));\n    if (!tasks.length) return callback();\n    var taskIndex = 0;\n\n    function nextTask(args) {\n        var task = wrapAsync(tasks[taskIndex++]);\n        task(...args, onlyOnce(next));\n    }\n\n    function next(err, ...args) {\n        if (err === false) return\n        if (err || taskIndex === tasks.length) {\n            return callback(err, ...args);\n        }\n        nextTask(args);\n    }\n\n    nextTask([]);\n}\n\nvar waterfall$1 = awaitify(waterfall);\n\n/**\n * An \"async function\" in the context of Async is an asynchronous function with\n * a variable number of parameters, with the final parameter being a callback.\n * (`function (arg1, arg2, ..., callback) {}`)\n * The final callback is of the form `callback(err, results...)`, which must be\n * called once the function is completed.  The callback should be called with a\n * Error as its first argument to signal that an error occurred.\n * Otherwise, if no error occurred, it should be called with `null` as the first\n * argument, and any additional `result` arguments that may apply, to signal\n * successful completion.\n * The callback must be called exactly once, ideally on a later tick of the\n * JavaScript event loop.\n *\n * This type of function is also referred to as a \"Node-style async function\",\n * or a \"continuation passing-style function\" (CPS). Most of the methods of this\n * library are themselves CPS/Node-style async functions, or functions that\n * return CPS/Node-style async functions.\n *\n * Wherever we accept a Node-style async function, we also directly accept an\n * [ES2017 `async` function]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function}.\n * In this case, the `async` function will not be passed a final callback\n * argument, and any thrown error will be used as the `err` argument of the\n * implicit callback, and the return value will be used as the `result` value.\n * (i.e. a `rejected` of the returned Promise becomes the `err` callback\n * argument, and a `resolved` value becomes the `result`.)\n *\n * Note, due to JavaScript limitations, we can only detect native `async`\n * functions and not transpilied implementations.\n * Your environment must have `async`/`await` support for this to work.\n * (e.g. Node > v7.6, or a recent version of a modern browser).\n * If you are using `async` functions through a transpiler (e.g. Babel), you\n * must still wrap the function with [asyncify]{@link module:Utils.asyncify},\n * because the `async function` will be compiled to an ordinary function that\n * returns a promise.\n *\n * @typedef {Function} AsyncFunction\n * @static\n */\n\nvar index = {\n    apply,\n    applyEach: applyEach$1,\n    applyEachSeries,\n    asyncify,\n    auto,\n    autoInject,\n    cargo,\n    cargoQueue: cargo$1,\n    compose,\n    concat: concat$1,\n    concatLimit: concatLimit$1,\n    concatSeries: concatSeries$1,\n    constant,\n    detect: detect$1,\n    detectLimit: detectLimit$1,\n    detectSeries: detectSeries$1,\n    dir,\n    doUntil,\n    doWhilst: doWhilst$1,\n    each,\n    eachLimit: eachLimit$2,\n    eachOf: eachOf$1,\n    eachOfLimit: eachOfLimit$2,\n    eachOfSeries: eachOfSeries$1,\n    eachSeries: eachSeries$1,\n    ensureAsync,\n    every: every$1,\n    everyLimit: everyLimit$1,\n    everySeries: everySeries$1,\n    filter: filter$1,\n    filterLimit: filterLimit$1,\n    filterSeries: filterSeries$1,\n    forever: forever$1,\n    groupBy,\n    groupByLimit: groupByLimit$1,\n    groupBySeries,\n    log,\n    map: map$1,\n    mapLimit: mapLimit$1,\n    mapSeries: mapSeries$1,\n    mapValues,\n    mapValuesLimit: mapValuesLimit$1,\n    mapValuesSeries,\n    memoize,\n    nextTick,\n    parallel,\n    parallelLimit,\n    priorityQueue,\n    queue: queue$1,\n    race: race$1,\n    reduce: reduce$1,\n    reduceRight,\n    reflect,\n    reflectAll,\n    reject: reject$2,\n    rejectLimit: rejectLimit$1,\n    rejectSeries: rejectSeries$1,\n    retry,\n    retryable,\n    seq,\n    series,\n    setImmediate: setImmediate$1,\n    some: some$1,\n    someLimit: someLimit$1,\n    someSeries: someSeries$1,\n    sortBy: sortBy$1,\n    timeout,\n    times,\n    timesLimit,\n    timesSeries,\n    transform,\n    tryEach: tryEach$1,\n    unmemoize,\n    until,\n    waterfall: waterfall$1,\n    whilst: whilst$1,\n\n    // aliases\n    all: every$1,\n    allLimit: everyLimit$1,\n    allSeries: everySeries$1,\n    any: some$1,\n    anyLimit: someLimit$1,\n    anySeries: someSeries$1,\n    find: detect$1,\n    findLimit: detectLimit$1,\n    findSeries: detectSeries$1,\n    flatMap: concat$1,\n    flatMapLimit: concatLimit$1,\n    flatMapSeries: concatSeries$1,\n    forEach: each,\n    forEachSeries: eachSeries$1,\n    forEachLimit: eachLimit$2,\n    forEachOf: eachOf$1,\n    forEachOfSeries: eachOfSeries$1,\n    forEachOfLimit: eachOfLimit$2,\n    inject: reduce$1,\n    foldl: reduce$1,\n    foldr: reduceRight,\n    select: filter$1,\n    selectLimit: filterLimit$1,\n    selectSeries: filterSeries$1,\n    wrapSync: asyncify,\n    during: whilst$1,\n    doDuring: doWhilst$1\n};\n\nexport default index;\nexport { apply, applyEach$1 as applyEach, applyEachSeries, asyncify, auto, autoInject, cargo, cargo$1 as cargoQueue, compose, concat$1 as concat, concatLimit$1 as concatLimit, concatSeries$1 as concatSeries, constant, detect$1 as detect, detectLimit$1 as detectLimit, detectSeries$1 as detectSeries, dir, doUntil, doWhilst$1 as doWhilst, each, eachLimit$2 as eachLimit, eachOf$1 as eachOf, eachOfLimit$2 as eachOfLimit, eachOfSeries$1 as eachOfSeries, eachSeries$1 as eachSeries, ensureAsync, every$1 as every, everyLimit$1 as everyLimit, everySeries$1 as everySeries, filter$1 as filter, filterLimit$1 as filterLimit, filterSeries$1 as filterSeries, forever$1 as forever, groupBy, groupByLimit$1 as groupByLimit, groupBySeries, log, map$1 as map, mapLimit$1 as mapLimit, mapSeries$1 as mapSeries, mapValues, mapValuesLimit$1 as mapValuesLimit, mapValuesSeries, memoize, nextTick, parallel, parallelLimit, priorityQueue, queue$1 as queue, race$1 as race, reduce$1 as reduce, reduceRight, reflect, reflectAll, reject$2 as reject, rejectLimit$1 as rejectLimit, rejectSeries$1 as rejectSeries, retry, retryable, seq, series, setImmediate$1 as setImmediate, some$1 as some, someLimit$1 as someLimit, someSeries$1 as someSeries, sortBy$1 as sortBy, timeout, times, timesLimit, timesSeries, transform, tryEach$1 as tryEach, unmemoize, until, waterfall$1 as waterfall, whilst$1 as whilst, every$1 as all, everyLimit$1 as allLimit, everySeries$1 as allSeries, some$1 as any, someLimit$1 as anyLimit, someSeries$1 as anySeries, detect$1 as find, detectLimit$1 as findLimit, detectSeries$1 as findSeries, concat$1 as flatMap, concatLimit$1 as flatMapLimit, concatSeries$1 as flatMapSeries, each as forEach, eachSeries$1 as forEachSeries, eachLimit$2 as forEachLimit, eachOf$1 as forEachOf, eachOfSeries$1 as forEachOfSeries, eachOfLimit$2 as forEachOfLimit, reduce$1 as inject, reduce$1 as foldl, reduceRight as foldr, filter$1 as select, filterLimit$1 as selectLimit, filterSeries$1 as selectSeries, asyncify as wrapSync, whilst$1 as during, doWhilst$1 as doDuring };\n","// **N3Writer** writes N3 documents.\nimport namespaces from './IRIs';\nimport { default as N3DataFactory, Term } from './N3DataFactory';\nimport { isDefaultGraph } from './N3Util';\n\nconst DEFAULTGRAPH = N3DataFactory.defaultGraph();\n\nconst { rdf, xsd } = namespaces;\n\n// Characters in literals that require escaping\nconst escape    = /[\"\\\\\\t\\n\\r\\b\\f\\u0000-\\u0019\\ud800-\\udbff]/,\n    escapeAll = /[\"\\\\\\t\\n\\r\\b\\f\\u0000-\\u0019]|[\\ud800-\\udbff][\\udc00-\\udfff]/g,\n    escapedCharacters = {\n      '\\\\': '\\\\\\\\', '\"': '\\\\\"', '\\t': '\\\\t',\n      '\\n': '\\\\n', '\\r': '\\\\r', '\\b': '\\\\b', '\\f': '\\\\f',\n    };\n\n// ## Placeholder class to represent already pretty-printed terms\nclass SerializedTerm extends Term {\n  // Pretty-printed nodes are not equal to any other node\n  // (e.g., [] does not equal [])\n  equals() {\n    return false;\n  }\n}\n\n// ## Constructor\nexport default class N3Writer {\n  constructor(outputStream, options) {\n    // ### `_prefixRegex` matches a prefixed name or IRI that begins with one of the added prefixes\n    this._prefixRegex = /$0^/;\n\n    // Shift arguments if the first argument is not a stream\n    if (outputStream && typeof outputStream.write !== 'function')\n      options = outputStream, outputStream = null;\n    options = options || {};\n    this._lists = options.lists;\n\n    // If no output stream given, send the output as string through the end callback\n    if (!outputStream) {\n      let output = '';\n      this._outputStream = {\n        write(chunk, encoding, done) { output += chunk; done && done(); },\n        end: done => { done && done(null, output); },\n      };\n      this._endStream = true;\n    }\n    else {\n      this._outputStream = outputStream;\n      this._endStream = options.end === undefined ? true : !!options.end;\n    }\n\n    // Initialize writer, depending on the format\n    this._subject = null;\n    if (!(/triple|quad/i).test(options.format)) {\n      this._lineMode = false;\n      this._graph = DEFAULTGRAPH;\n      this._baseIRI = options.baseIRI;\n      this._prefixIRIs = Object.create(null);\n      options.prefixes && this.addPrefixes(options.prefixes);\n    }\n    else {\n      this._lineMode = true;\n      this._writeQuad = this._writeQuadLine;\n    }\n  }\n\n  // ## Private methods\n\n  // ### Whether the current graph is the default graph\n  get _inDefaultGraph() {\n    return DEFAULTGRAPH.equals(this._graph);\n  }\n\n  // ### `_write` writes the argument to the output stream\n  _write(string, callback) {\n    this._outputStream.write(string, 'utf8', callback);\n  }\n\n  // ### `_writeQuad` writes the quad to the output stream\n  _writeQuad(subject, predicate, object, graph, done) {\n    try {\n      // Write the graph's label if it has changed\n      if (!graph.equals(this._graph)) {\n        // Close the previous graph and start the new one\n        this._write((this._subject === null ? '' : (this._inDefaultGraph ? '.\\n' : '\\n}\\n')) +\n                    (DEFAULTGRAPH.equals(graph) ? '' : `${this._encodeIriOrBlank(graph)} {\\n`));\n        this._graph = graph;\n        this._subject = null;\n      }\n      // Don't repeat the subject if it's the same\n      if (subject.equals(this._subject)) {\n        // Don't repeat the predicate if it's the same\n        if (predicate.equals(this._predicate))\n          this._write(`, ${this._encodeObject(object)}`, done);\n        // Same subject, different predicate\n        else\n          this._write(`;\\n    ${\n                      this._encodePredicate(this._predicate = predicate)} ${\n                      this._encodeObject(object)}`, done);\n      }\n      // Different subject; write the whole quad\n      else\n        this._write(`${(this._subject === null ? '' : '.\\n') +\n                    this._encodeSubject(this._subject = subject)} ${\n                    this._encodePredicate(this._predicate = predicate)} ${\n                    this._encodeObject(object)}`, done);\n    }\n    catch (error) { done && done(error); }\n  }\n\n  // ### `_writeQuadLine` writes the quad to the output stream as a single line\n  _writeQuadLine(subject, predicate, object, graph, done) {\n    // Write the quad without prefixes\n    delete this._prefixMatch;\n    this._write(this.quadToString(subject, predicate, object, graph), done);\n  }\n\n  // ### `quadToString` serializes a quad as a string\n  quadToString(subject, predicate, object, graph) {\n    return  `${this._encodeSubject(subject)} ${\n            this._encodeIriOrBlank(predicate)} ${\n            this._encodeObject(object)\n            }${graph && graph.value ? ` ${this._encodeIriOrBlank(graph)} .\\n` : ' .\\n'}`;\n  }\n\n  // ### `quadsToString` serializes an array of quads as a string\n  quadsToString(quads) {\n    return quads.map(t => {\n      return this.quadToString(t.subject, t.predicate, t.object, t.graph);\n    }).join('');\n  }\n\n  // ### `_encodeSubject` represents a subject\n  _encodeSubject(entity) {\n    return entity.termType === 'Quad' ?\n      this._encodeQuad(entity) : this._encodeIriOrBlank(entity);\n  }\n\n  // ### `_encodeIriOrBlank` represents an IRI or blank node\n  _encodeIriOrBlank(entity) {\n    // A blank node or list is represented as-is\n    if (entity.termType !== 'NamedNode') {\n      // If it is a list head, pretty-print it\n      if (this._lists && (entity.value in this._lists))\n        entity = this.list(this._lists[entity.value]);\n      return 'id' in entity ? entity.id : `_:${entity.value}`;\n    }\n    let iri = entity.value;\n    // Use relative IRIs if requested and possible\n    if (this._baseIRI && iri.startsWith(this._baseIRI))\n      iri = iri.substr(this._baseIRI.length);\n    // Escape special characters\n    if (escape.test(iri))\n      iri = iri.replace(escapeAll, characterReplacer);\n    // Try to represent the IRI as prefixed name\n    const prefixMatch = this._prefixRegex.exec(iri);\n    return !prefixMatch ? `<${iri}>` :\n           (!prefixMatch[1] ? iri : this._prefixIRIs[prefixMatch[1]] + prefixMatch[2]);\n  }\n\n  // ### `_encodeLiteral` represents a literal\n  _encodeLiteral(literal) {\n    // Escape special characters\n    let value = literal.value;\n    if (escape.test(value))\n      value = value.replace(escapeAll, characterReplacer);\n\n    // Write a language-tagged literal\n    if (literal.language)\n      return `\"${value}\"@${literal.language}`;\n\n    // Write dedicated literals per data type\n    if (this._lineMode) {\n      // Only abbreviate strings in N-Triples or N-Quads\n      if (literal.datatype.value === xsd.string)\n        return `\"${value}\"`;\n    }\n    else {\n      // Use common datatype abbreviations in Turtle or TriG\n      switch (literal.datatype.value) {\n      case xsd.string:\n        return `\"${value}\"`;\n      case xsd.boolean:\n        if (value === 'true' || value === 'false')\n          return value;\n        break;\n      case xsd.integer:\n        if (/^[+-]?\\d+$/.test(value))\n          return value;\n        break;\n      case xsd.decimal:\n        if (/^[+-]?\\d*\\.\\d+$/.test(value))\n          return value;\n        break;\n      case xsd.double:\n        if (/^[+-]?(?:\\d+\\.\\d*|\\.?\\d+)[eE][+-]?\\d+$/.test(value))\n          return value;\n        break;\n      }\n    }\n\n    // Write a regular datatyped literal\n    return `\"${value}\"^^${this._encodeIriOrBlank(literal.datatype)}`;\n  }\n\n  // ### `_encodePredicate` represents a predicate\n  _encodePredicate(predicate) {\n    return predicate.value === rdf.type ? 'a' : this._encodeIriOrBlank(predicate);\n  }\n\n  // ### `_encodeObject` represents an object\n  _encodeObject(object) {\n    switch (object.termType) {\n    case 'Quad':\n      return this._encodeQuad(object);\n    case 'Literal':\n      return this._encodeLiteral(object);\n    default:\n      return this._encodeIriOrBlank(object);\n    }\n  }\n\n  // ### `_encodeQuad` encodes an RDF* quad\n  _encodeQuad({ subject, predicate, object, graph }) {\n    return `<<${\n      this._encodeSubject(subject)} ${\n      this._encodePredicate(predicate)} ${\n      this._encodeObject(object)}${\n      isDefaultGraph(graph) ? '' : ` ${this._encodeIriOrBlank(graph)}`}>>`;\n  }\n\n  // ### `_blockedWrite` replaces `_write` after the writer has been closed\n  _blockedWrite() {\n    throw new Error('Cannot write because the writer has been closed.');\n  }\n\n  // ### `addQuad` adds the quad to the output stream\n  addQuad(subject, predicate, object, graph, done) {\n    // The quad was given as an object, so shift parameters\n    if (object === undefined)\n      this._writeQuad(subject.subject, subject.predicate, subject.object, subject.graph, predicate);\n    // The optional `graph` parameter was not provided\n    else if (typeof graph === 'function')\n      this._writeQuad(subject, predicate, object, DEFAULTGRAPH, graph);\n    // The `graph` parameter was provided\n    else\n      this._writeQuad(subject, predicate, object, graph || DEFAULTGRAPH, done);\n  }\n\n  // ### `addQuads` adds the quads to the output stream\n  addQuads(quads) {\n    for (let i = 0; i < quads.length; i++)\n      this.addQuad(quads[i]);\n  }\n\n  // ### `addPrefix` adds the prefix to the output stream\n  addPrefix(prefix, iri, done) {\n    const prefixes = {};\n    prefixes[prefix] = iri;\n    this.addPrefixes(prefixes, done);\n  }\n\n  // ### `addPrefixes` adds the prefixes to the output stream\n  addPrefixes(prefixes, done) {\n    // Ignore prefixes if not supported by the serialization\n    if (!this._prefixIRIs)\n      return done && done();\n\n    // Write all new prefixes\n    let hasPrefixes = false;\n    for (let prefix in prefixes) {\n      let iri = prefixes[prefix];\n      if (typeof iri !== 'string')\n        iri = iri.value;\n      hasPrefixes = true;\n      // Finish a possible pending quad\n      if (this._subject !== null) {\n        this._write(this._inDefaultGraph ? '.\\n' : '\\n}\\n');\n        this._subject = null, this._graph = '';\n      }\n      // Store and write the prefix\n      this._prefixIRIs[iri] = (prefix += ':');\n      this._write(`@prefix ${prefix} <${iri}>.\\n`);\n    }\n    // Recreate the prefix matcher\n    if (hasPrefixes) {\n      let IRIlist = '', prefixList = '';\n      for (const prefixIRI in this._prefixIRIs) {\n        IRIlist += IRIlist ? `|${prefixIRI}` : prefixIRI;\n        prefixList += (prefixList ? '|' : '') + this._prefixIRIs[prefixIRI];\n      }\n      IRIlist = IRIlist.replace(/[\\]\\/\\(\\)\\*\\+\\?\\.\\\\\\$]/g, '\\\\$&');\n      this._prefixRegex = new RegExp(`^(?:${prefixList})[^\\/]*$|` +\n                                     `^(${IRIlist})([a-zA-Z][\\\\-_a-zA-Z0-9]*)$`);\n    }\n    // End a prefix block with a newline\n    this._write(hasPrefixes ? '\\n' : '', done);\n  }\n\n  // ### `blank` creates a blank node with the given content\n  blank(predicate, object) {\n    let children = predicate, child, length;\n    // Empty blank node\n    if (predicate === undefined)\n      children = [];\n    // Blank node passed as blank(Term(\"predicate\"), Term(\"object\"))\n    else if (predicate.termType)\n      children = [{ predicate: predicate, object: object }];\n    // Blank node passed as blank({ predicate: predicate, object: object })\n    else if (!('length' in predicate))\n      children = [predicate];\n\n    switch (length = children.length) {\n    // Generate an empty blank node\n    case 0:\n      return new SerializedTerm('[]');\n    // Generate a non-nested one-triple blank node\n    case 1:\n      child = children[0];\n      if (!(child.object instanceof SerializedTerm))\n        return new SerializedTerm(`[ ${this._encodePredicate(child.predicate)} ${\n                                  this._encodeObject(child.object)} ]`);\n    // Generate a multi-triple or nested blank node\n    default:\n      let contents = '[';\n      // Write all triples in order\n      for (let i = 0; i < length; i++) {\n        child = children[i];\n        // Write only the object is the predicate is the same as the previous\n        if (child.predicate.equals(predicate))\n          contents += `, ${this._encodeObject(child.object)}`;\n        // Otherwise, write the predicate and the object\n        else {\n          contents += `${(i ? ';\\n  ' : '\\n  ') +\n                      this._encodePredicate(child.predicate)} ${\n                      this._encodeObject(child.object)}`;\n          predicate = child.predicate;\n        }\n      }\n      return new SerializedTerm(`${contents}\\n]`);\n    }\n  }\n\n  // ### `list` creates a list node with the given content\n  list(elements) {\n    const length = elements && elements.length || 0, contents = new Array(length);\n    for (let i = 0; i < length; i++)\n      contents[i] = this._encodeObject(elements[i]);\n    return new SerializedTerm(`(${contents.join(' ')})`);\n  }\n\n  // ### `end` signals the end of the output stream\n  end(done) {\n    // Finish a possible pending quad\n    if (this._subject !== null) {\n      this._write(this._inDefaultGraph ? '.\\n' : '\\n}\\n');\n      this._subject = null;\n    }\n    // Disallow further writing\n    this._write = this._blockedWrite;\n\n    // Try to end the underlying stream, ensuring done is called exactly one time\n    let singleDone = done && ((error, result) => { singleDone = null, done(error, result); });\n    if (this._endStream) {\n      try { return this._outputStream.end(singleDone); }\n      catch (error) { /* error closing stream */ }\n    }\n    singleDone && singleDone();\n  }\n}\n\n// Replaces a character by its escaped version\nfunction characterReplacer(character) {\n  // Replace a single character by its escaped version\n  let result = escapedCharacters[character];\n  if (result === undefined) {\n    // Replace a single character with its 4-bit unicode escape sequence\n    if (character.length === 1) {\n      result = character.charCodeAt(0).toString(16);\n      result = '\\\\u0000'.substr(0, 6 - result.length) + result;\n    }\n    // Replace a surrogate pair with its 8-bit unicode escape sequence\n    else {\n      result = ((character.charCodeAt(0) - 0xD800) * 0x400 +\n                 character.charCodeAt(1) + 0x2400).toString(16);\n      result = '\\\\U00000000'.substr(0, 10 - result.length) + result;\n    }\n  }\n  return result;\n}\n","import asyncLib from 'async' // @@ Goal: remove this dependency\nimport jsonld from 'jsonld'\nimport { Parser, Writer } from 'n3'  // @@ Goal: remove this dependency\n\nexport function convertToJson (n3String, jsonCallback) {\n  var jsonString\n  var n3Parser = new Parser()\n  var n3Writer = new Writer({\n    format: 'N-Quads'\n  })\n  asyncLib.waterfall([\n    function (callback) {\n      n3Parser.parse(n3String, function (error, quad, prefixes) {\n        if (error) {\n          callback(error);\n        } else if (quad !== null) {\n          n3Writer.addQuad(quad);\n        } else {\n          n3Writer.end(callback);\n        }\n      });\n    },\n    function (result, callback) {\n      try {\n        jsonld.fromRDF(result, {\n          format: 'application/nquads'\n        }).then((result) => {\n          callback(null, result)\n        })\n      } catch (err) {\n        callback(err)\n      }\n    },\n    function (json, callback) {\n      jsonString = JSON.stringify(json)\n      jsonCallback(null, jsonString)\n    }\n  ], function (err, result) {\n    jsonCallback(err, jsonString)\n  }\n  )\n}\n\nexport function convertToNQuads (n3String, nquadCallback) {\n  var nquadString\n  var n3Parser = new Parser()\n  var n3Writer = new Writer({\n    format: 'N-Quads'\n  })\n  asyncLib.waterfall([\n    function (callback) {\n      n3Parser.parse(n3String, function (error, triple, prefixes) {\n        if (error) {\n          callback(error);\n        } else if (quad !== null) {\n          n3Writer.addQuad(quad);\n        } else {\n          n3Writer.end(callback);\n        }\n      });\n    },\n    function (result, callback) {\n      nquadString = result\n      nquadCallback(null, nquadString)\n    }\n  ], function (err, result) {\n    nquadCallback(err, nquadString)\n  }\n  )\n}\n","import jsonld from 'jsonld'\n\nimport { arrayToStatements } from './utils'\n\n/**\n * Parses json-ld formatted JS objects to a rdf Term.\n * @param kb - The DataFactory to use.\n * @param obj - The json-ld object to process.\n * @return {Literal|NamedNode|BlankNode|Collection}\n */\nexport function jsonldObjectToTerm (kb, obj) {\n  if (typeof obj === 'string') {\n    return kb.rdfFactory.literal(obj)\n  }\n\n  if (Object.prototype.hasOwnProperty.call(obj, '@list')) {\n    if (kb.rdfFactory.supports[\"COLLECTIONS\"] === true) {\n      return listToCollection(kb, obj['@list'])\n    }\n\n    return listToStatements(kb, obj)\n  }\n\n  if (Object.prototype.hasOwnProperty.call(obj, '@id')) {\n    return kb.rdfFactory.namedNode(obj['@id'])\n  }\n\n  if (Object.prototype.hasOwnProperty.call(obj, '@language')) {\n    return kb.rdfFactory.literal(obj['@value'], obj['@language'])\n  }\n\n  if (Object.prototype.hasOwnProperty.call(obj, '@type')) {\n    return kb.rdfFactory.literal(obj['@value'], kb.rdfFactory.namedNode(obj['@type']))\n  }\n\n  if (Object.prototype.hasOwnProperty.call(obj, '@value')) {\n    return kb.rdfFactory.literal(obj['@value'])\n  }\n\n  return kb.rdfFactory.literal(obj)\n}\n\n/**\n * Adds the statements in a json-ld list object to {kb}.\n */\nfunction listToStatements (kb, obj) {\n  const listId = obj['@id'] ? kb.rdfFactory.namedNode(obj['@id']) : kb.rdfFactory.blankNode()\n\n  const items = obj['@list'].map((listItem => jsonldObjectToTerm(kb, listItem)))\n  const statements = arrayToStatements(kb.rdfFactory, listId, items)\n  kb.addAll(statements)\n\n  return listId\n}\n\nfunction listToCollection (kb, obj) {\n  if (!Array.isArray(obj)) {\n    throw new TypeError(\"Object must be an array\")\n  }\n  return kb.rdfFactory.collection(obj.map((o) => jsonldObjectToTerm(kb, o)))\n}\n\n/**\n * Takes a json-ld formatted string {str} and adds its statements to {kb}.\n *\n * Ensure that {kb.rdfFactory} is a DataFactory.\n */\nexport default function jsonldParser (str, kb, base, callback) {\n  const baseString = base && Object.prototype.hasOwnProperty.call(base, 'termType')\n    ? base.value\n    : base\n\n  return jsonld\n    .flatten(JSON.parse(str), null, { base: baseString })\n    .then((flattened) => flattened.reduce((store, flatResource) => {\n      const id = flatResource['@id']\n        ? kb.rdfFactory.namedNode(flatResource['@id'])\n        : kb.rdfFactory.blankNode()\n\n      for (const property of Object.keys(flatResource)) {\n        if (property === '@id') {\n          continue\n        }\n        const value = flatResource[property]\n        if (Array.isArray(value)) {\n          for (let i = 0; i < value.length; i++) {\n            kb.addStatement(createStatement(kb, id, property, value[i], base))\n          }\n        } else {\n          kb.addStatement(createStatement(kb, id, property, value, base))\n        }\n      }\n\n      return kb\n    }, kb))\n    .then(callback)\n    .catch(callback)\n}\n\n/**\n * Create statement quad depending on @type being a type node\n * @param kb\n * @param subject id\n * @param property\n * @param value\n * @return quad statement\n */\nfunction createStatement(kb, id, property, value, base) {\n  let predicate, object\n  if (property === \"@type\") {\n    predicate = kb.rdfFactory.namedNode(\"http://www.w3.org/1999/02/22-rdf-syntax-ns#type\")\n    object = kb.rdfFactory.namedNode(value)\n  } else {\n    predicate = kb.rdfFactory.namedNode(property)\n    object = jsonldObjectToTerm(kb, value)\n  }\n  return kb.rdfFactory.quad(id, predicate, object, kb.rdfFactory.namedNode(base))\n}\n","/**\n * A JavaScript implementation of the JSON-LD API.\n *\n * @author Dave Longley\n *\n * @license BSD 3-Clause License\n * Copyright (c) 2011-2019 Digital Bazaar, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * Neither the name of the Digital Bazaar, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\nconst canonize = require('rdf-canonize');\nconst platform = require('./platform');\nconst util = require('./util');\nconst ContextResolver = require('./ContextResolver');\nconst IdentifierIssuer = util.IdentifierIssuer;\nconst JsonLdError = require('./JsonLdError');\nconst LRU = require('lru-cache');\nconst NQuads = require('./NQuads');\n\nconst {expand: _expand} = require('./expand');\nconst {flatten: _flatten} = require('./flatten');\nconst {fromRDF: _fromRDF} = require('./fromRdf');\nconst {toRDF: _toRDF} = require('./toRdf');\n\nconst {\n  frameMergedOrDefault: _frameMergedOrDefault,\n  cleanupNull: _cleanupNull\n} = require('./frame');\n\nconst {\n  isArray: _isArray,\n  isObject: _isObject,\n  isString: _isString\n} = require('./types');\n\nconst {\n  isSubjectReference: _isSubjectReference,\n} = require('./graphTypes');\n\nconst {\n  expandIri: _expandIri,\n  getInitialContext: _getInitialContext,\n  process: _processContext,\n  processingMode: _processingMode\n} = require('./context');\n\nconst {\n  compact: _compact,\n  compactIri: _compactIri\n} = require('./compact');\n\nconst {\n  createNodeMap: _createNodeMap,\n  createMergedNodeMap: _createMergedNodeMap,\n  mergeNodeMaps: _mergeNodeMaps\n} = require('./nodeMap');\n\n/* eslint-disable indent */\n// attaches jsonld API to the given object\nconst wrapper = function(jsonld) {\n\n/** Registered RDF dataset parsers hashed by content-type. */\nconst _rdfParsers = {};\n\n// resolved context cache\n// TODO: consider basing max on context size rather than number\nconst RESOLVED_CONTEXT_CACHE_MAX_SIZE = 100;\nconst _resolvedContextCache = new LRU({max: RESOLVED_CONTEXT_CACHE_MAX_SIZE});\n\n/* Core API */\n\n/**\n * Performs JSON-LD compaction.\n *\n * @param input the JSON-LD input to compact.\n * @param ctx the context to compact with.\n * @param [options] options to use:\n *          [base] the base IRI to use.\n *          [compactArrays] true to compact arrays to single values when\n *            appropriate, false not to (default: true).\n *          [compactToRelative] true to compact IRIs to be relative to document\n *            base, false to keep absolute (default: true)\n *          [graph] true to always output a top-level graph (default: false).\n *          [expandContext] a context to expand with.\n *          [skipExpansion] true to assume the input is expanded and skip\n *            expansion, false not to, defaults to false.\n *          [documentLoader(url, options)] the document loader.\n *          [expansionMap(info)] a function that can be used to custom map\n *            unmappable values (or to throw an error when they are detected);\n *            if this function returns `undefined` then the default behavior\n *            will be used.\n *          [framing] true if compaction is occuring during a framing operation.\n *          [compactionMap(info)] a function that can be used to custom map\n *            unmappable values (or to throw an error when they are detected);\n *            if this function returns `undefined` then the default behavior\n *            will be used.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the compacted output.\n */\njsonld.compact = async function(input, ctx, options) {\n  if(arguments.length < 2) {\n    throw new TypeError('Could not compact, too few arguments.');\n  }\n\n  if(ctx === null) {\n    throw new JsonLdError(\n      'The compaction context must not be null.',\n      'jsonld.CompactError', {code: 'invalid local context'});\n  }\n\n  // nothing to compact\n  if(input === null) {\n    return null;\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    compactArrays: true,\n    compactToRelative: true,\n    graph: false,\n    skipExpansion: false,\n    link: false,\n    issuer: new IdentifierIssuer('_:b'),\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n  if(options.link) {\n    // force skip expansion when linking, \"link\" is not part of the public\n    // API, it should only be called from framing\n    options.skipExpansion = true;\n  }\n  if(!options.compactToRelative) {\n    delete options.base;\n  }\n\n  // expand input\n  let expanded;\n  if(options.skipExpansion) {\n    expanded = input;\n  } else {\n    expanded = await jsonld.expand(input, options);\n  }\n\n  // process context\n  const activeCtx = await jsonld.processContext(\n    _getInitialContext(options), ctx, options);\n\n  // do compaction\n  let compacted = await _compact({\n    activeCtx,\n    element: expanded,\n    options,\n    compactionMap: options.compactionMap\n  });\n\n  // perform clean up\n  if(options.compactArrays && !options.graph && _isArray(compacted)) {\n    if(compacted.length === 1) {\n      // simplify to a single item\n      compacted = compacted[0];\n    } else if(compacted.length === 0) {\n      // simplify to an empty object\n      compacted = {};\n    }\n  } else if(options.graph && _isObject(compacted)) {\n    // always use array if graph option is on\n    compacted = [compacted];\n  }\n\n  // follow @context key\n  if(_isObject(ctx) && '@context' in ctx) {\n    ctx = ctx['@context'];\n  }\n\n  // build output context\n  ctx = util.clone(ctx);\n  if(!_isArray(ctx)) {\n    ctx = [ctx];\n  }\n  // remove empty contexts\n  const tmp = ctx;\n  ctx = [];\n  for(let i = 0; i < tmp.length; ++i) {\n    if(!_isObject(tmp[i]) || Object.keys(tmp[i]).length > 0) {\n      ctx.push(tmp[i]);\n    }\n  }\n\n  // remove array if only one context\n  const hasContext = (ctx.length > 0);\n  if(ctx.length === 1) {\n    ctx = ctx[0];\n  }\n\n  // add context and/or @graph\n  if(_isArray(compacted)) {\n    // use '@graph' keyword\n    const graphAlias = _compactIri({\n      activeCtx, iri: '@graph', relativeTo: {vocab: true}\n    });\n    const graph = compacted;\n    compacted = {};\n    if(hasContext) {\n      compacted['@context'] = ctx;\n    }\n    compacted[graphAlias] = graph;\n  } else if(_isObject(compacted) && hasContext) {\n    // reorder keys so @context is first\n    const graph = compacted;\n    compacted = {'@context': ctx};\n    for(const key in graph) {\n      compacted[key] = graph[key];\n    }\n  }\n\n  return compacted;\n};\n\n/**\n * Performs JSON-LD expansion.\n *\n * @param input the JSON-LD input to expand.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [keepFreeFloatingNodes] true to keep free-floating nodes,\n *            false not to, defaults to false.\n *          [documentLoader(url, options)] the document loader.\n *          [expansionMap(info)] a function that can be used to custom map\n *            unmappable values (or to throw an error when they are detected);\n *            if this function returns `undefined` then the default behavior\n *            will be used.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the expanded output.\n */\njsonld.expand = async function(input, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not expand, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    keepFreeFloatingNodes: false,\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n  if(options.expansionMap === false) {\n    options.expansionMap = undefined;\n  }\n\n  // build set of objects that may have @contexts to resolve\n  const toResolve = {};\n\n  // build set of contexts to process prior to expansion\n  const contextsToProcess = [];\n\n  // if an `expandContext` has been given ensure it gets resolved\n  if('expandContext' in options) {\n    const expandContext = util.clone(options.expandContext);\n    if(_isObject(expandContext) && '@context' in expandContext) {\n      toResolve.expandContext = expandContext;\n    } else {\n      toResolve.expandContext = {'@context': expandContext};\n    }\n    contextsToProcess.push(toResolve.expandContext);\n  }\n\n  // if input is a string, attempt to dereference remote document\n  let defaultBase;\n  if(!_isString(input)) {\n    // input is not a URL, do not need to retrieve it first\n    toResolve.input = util.clone(input);\n  } else {\n    // load remote doc\n    const remoteDoc = await jsonld.get(input, options);\n    defaultBase = remoteDoc.documentUrl;\n    toResolve.input = remoteDoc.document;\n    if(remoteDoc.contextUrl) {\n      // context included in HTTP link header and must be resolved\n      toResolve.remoteContext = {'@context': remoteDoc.contextUrl};\n      contextsToProcess.push(toResolve.remoteContext);\n    }\n  }\n\n  // set default base\n  if(!('base' in options)) {\n    options.base = defaultBase || '';\n  }\n\n  // process any additional contexts\n  let activeCtx = _getInitialContext(options);\n  for(const localCtx of contextsToProcess) {\n    activeCtx = await _processContext({activeCtx, localCtx, options});\n  }\n\n  // expand resolved input\n  let expanded = await _expand({\n    activeCtx,\n    element: toResolve.input,\n    options,\n    expansionMap: options.expansionMap\n  });\n\n  // optimize away @graph with no other properties\n  if(_isObject(expanded) && ('@graph' in expanded) &&\n    Object.keys(expanded).length === 1) {\n    expanded = expanded['@graph'];\n  } else if(expanded === null) {\n    expanded = [];\n  }\n\n  // normalize to an array\n  if(!_isArray(expanded)) {\n    expanded = [expanded];\n  }\n\n  return expanded;\n};\n\n/**\n * Performs JSON-LD flattening.\n *\n * @param input the JSON-LD to flatten.\n * @param ctx the context to use to compact the flattened output, or null.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the flattened output.\n */\njsonld.flatten = async function(input, ctx, options) {\n  if(arguments.length < 1) {\n    return new TypeError('Could not flatten, too few arguments.');\n  }\n\n  if(typeof ctx === 'function') {\n    ctx = null;\n  } else {\n    ctx = ctx || null;\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // expand input\n  const expanded = await jsonld.expand(input, options);\n\n  // do flattening\n  const flattened = _flatten(expanded);\n\n  if(ctx === null) {\n    // no compaction required\n    return flattened;\n  }\n\n  // compact result (force @graph option to true, skip expansion)\n  options.graph = true;\n  options.skipExpansion = true;\n  const compacted = await jsonld.compact(flattened, ctx, options);\n\n  return compacted;\n};\n\n/**\n * Performs JSON-LD framing.\n *\n * @param input the JSON-LD input to frame.\n * @param frame the JSON-LD frame to use.\n * @param [options] the framing options.\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [embed] default @embed flag: '@last', '@always', '@never', '@link'\n *            (default: '@last').\n *          [explicit] default @explicit flag (default: false).\n *          [requireAll] default @requireAll flag (default: true).\n *          [omitDefault] default @omitDefault flag (default: false).\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the framed output.\n */\njsonld.frame = async function(input, frame, options) {\n  if(arguments.length < 2) {\n    throw new TypeError('Could not frame, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    embed: '@once',\n    explicit: false,\n    requireAll: false,\n    omitDefault: false,\n    bnodesToClear: [],\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // if frame is a string, attempt to dereference remote document\n  if(_isString(frame)) {\n    // load remote doc\n    const remoteDoc = await jsonld.get(frame, options);\n    frame = remoteDoc.document;\n\n    if(remoteDoc.contextUrl) {\n      // inject link header @context into frame\n      let ctx = frame['@context'];\n      if(!ctx) {\n        ctx = remoteDoc.contextUrl;\n      } else if(_isArray(ctx)) {\n        ctx.push(remoteDoc.contextUrl);\n      } else {\n        ctx = [ctx, remoteDoc.contextUrl];\n      }\n      frame['@context'] = ctx;\n    }\n  }\n\n  const frameContext = frame ? frame['@context'] || {} : {};\n\n  // process context\n  const activeCtx = await jsonld.processContext(\n    _getInitialContext(options), frameContext, options);\n\n  // mode specific defaults\n  if(!options.hasOwnProperty('omitGraph')) {\n    options.omitGraph = _processingMode(activeCtx, 1.1);\n  }\n  if(!options.hasOwnProperty('pruneBlankNodeIdentifiers')) {\n    options.pruneBlankNodeIdentifiers = _processingMode(activeCtx, 1.1);\n  }\n\n  // expand input\n  const expanded = await jsonld.expand(input, options);\n\n  // expand frame\n  const opts = {...options};\n  opts.isFrame = true;\n  opts.keepFreeFloatingNodes = true;\n  const expandedFrame = await jsonld.expand(frame, opts);\n\n  // if the unexpanded frame includes a key expanding to @graph, frame the\n  // default graph, otherwise, the merged graph\n  const frameKeys = Object.keys(frame)\n    .map(key => _expandIri(activeCtx, key, {vocab: true}));\n  opts.merged = !frameKeys.includes('@graph');\n  opts.is11 = _processingMode(activeCtx, 1.1);\n\n  // do framing\n  const framed = _frameMergedOrDefault(expanded, expandedFrame, opts);\n\n  opts.graph = !options.omitGraph;\n  opts.skipExpansion = true;\n  opts.link = {};\n  opts.framing = true;\n  let compacted = await jsonld.compact(framed, frameContext, opts);\n\n  // replace @null with null, compacting arrays\n  opts.link = {};\n  compacted = _cleanupNull(compacted, opts);\n\n  return compacted;\n};\n\n/**\n * **Experimental**\n *\n * Links a JSON-LD document's nodes in memory.\n *\n * @param input the JSON-LD document to link.\n * @param [ctx] the JSON-LD context to apply.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the linked output.\n */\njsonld.link = async function(input, ctx, options) {\n  // API matches running frame with a wildcard frame and embed: '@link'\n  // get arguments\n  const frame = {};\n  if(ctx) {\n    frame['@context'] = ctx;\n  }\n  frame['@embed'] = '@link';\n  return jsonld.frame(input, frame, options);\n};\n\n/**\n * Performs RDF dataset normalization on the given input. The input is JSON-LD\n * unless the 'inputFormat' option is used. The output is an RDF dataset\n * unless the 'format' option is used.\n *\n * @param input the input to normalize as JSON-LD or as a format specified by\n *          the 'inputFormat' option.\n * @param [options] the options to use:\n *          [algorithm] the normalization algorithm to use, `URDNA2015` or\n *            `URGNA2012` (default: `URDNA2015`).\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [skipExpansion] true to assume the input is expanded and skip\n *            expansion, false not to, defaults to false.\n *          [inputFormat] the format if input is not JSON-LD:\n *            'application/n-quads' for N-Quads.\n *          [format] the format if output is a string:\n *            'application/n-quads' for N-Quads.\n *          [documentLoader(url, options)] the document loader.\n *          [useNative] true to use a native canonize algorithm\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the normalized output.\n */\njsonld.normalize = jsonld.canonize = async function(input, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not canonize, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    algorithm: 'URDNA2015',\n    skipExpansion: false,\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n  if('inputFormat' in options) {\n    if(options.inputFormat !== 'application/n-quads' &&\n      options.inputFormat !== 'application/nquads') {\n      throw new JsonLdError(\n        'Unknown canonicalization input format.',\n        'jsonld.CanonizeError');\n    }\n    // TODO: `await` for async parsers\n    const parsedInput = NQuads.parse(input);\n\n    // do canonicalization\n    return canonize.canonize(parsedInput, options);\n  }\n\n  // convert to RDF dataset then do normalization\n  const opts = {...options};\n  delete opts.format;\n  opts.produceGeneralizedRdf = false;\n  const dataset = await jsonld.toRDF(input, opts);\n\n  // do canonicalization\n  return canonize.canonize(dataset, options);\n};\n\n/**\n * Converts an RDF dataset to JSON-LD.\n *\n * @param dataset a serialized string of RDF in a format specified by the\n *          format option or an RDF dataset to convert.\n * @param [options] the options to use:\n *          [format] the format if dataset param must first be parsed:\n *            'application/n-quads' for N-Quads (default).\n *          [rdfParser] a custom RDF-parser to use to parse the dataset.\n *          [useRdfType] true to use rdf:type, false to use @type\n *            (default: false).\n *          [useNativeTypes] true to convert XSD types into native types\n *            (boolean, integer, double), false not to (default: false).\n *\n * @return a Promise that resolves to the JSON-LD document.\n */\njsonld.fromRDF = async function(dataset, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not convert from RDF, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    format: _isString(dataset) ? 'application/n-quads' : undefined\n  });\n\n  const {format} = options;\n  let {rdfParser} = options;\n\n  // handle special format\n  if(format) {\n    // check supported formats\n    rdfParser = rdfParser || _rdfParsers[format];\n    if(!rdfParser) {\n      throw new JsonLdError(\n        'Unknown input format.',\n        'jsonld.UnknownFormat', {format});\n    }\n  } else {\n    // no-op parser, assume dataset already parsed\n    rdfParser = () => dataset;\n  }\n\n  // rdfParser must be synchronous or return a promise, no callback support\n  const parsedDataset = await rdfParser(dataset);\n  return _fromRDF(parsedDataset, options);\n};\n\n/**\n * Outputs the RDF dataset found in the given JSON-LD object.\n *\n * @param input the JSON-LD input.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [skipExpansion] true to assume the input is expanded and skip\n *            expansion, false not to, defaults to false.\n *          [format] the format to use to output a string:\n *            'application/n-quads' for N-Quads.\n *          [produceGeneralizedRdf] true to output generalized RDF, false\n *            to produce only standard RDF (default: false).\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the RDF dataset.\n */\njsonld.toRDF = async function(input, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not convert to RDF, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    skipExpansion: false,\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // TODO: support toRDF custom map?\n  let expanded;\n  if(options.skipExpansion) {\n    expanded = input;\n  } else {\n    // expand input\n    expanded = await jsonld.expand(input, options);\n  }\n\n  // output RDF dataset\n  const dataset = _toRDF(expanded, options);\n  if(options.format) {\n    if(options.format === 'application/n-quads' ||\n      options.format === 'application/nquads') {\n      return NQuads.serialize(dataset);\n    }\n    throw new JsonLdError(\n      'Unknown output format.',\n      'jsonld.UnknownFormat', {format: options.format});\n  }\n\n  return dataset;\n};\n\n/**\n * **Experimental**\n *\n * Recursively flattens the nodes in the given JSON-LD input into a merged\n * map of node ID => node. All graphs will be merged into the default graph.\n *\n * @param input the JSON-LD input.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [issuer] a jsonld.IdentifierIssuer to use to label blank nodes.\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the merged node map.\n */\njsonld.createNodeMap = async function(input, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not create node map, too few arguments.');\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    base: _isString(input) ? input : '',\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // expand input\n  const expanded = await jsonld.expand(input, options);\n\n  return _createMergedNodeMap(expanded, options);\n};\n\n/**\n * **Experimental**\n *\n * Merges two or more JSON-LD documents into a single flattened document.\n *\n * @param docs the JSON-LD documents to merge together.\n * @param ctx the context to use to compact the merged result, or null.\n * @param [options] the options to use:\n *          [base] the base IRI to use.\n *          [expandContext] a context to expand with.\n *          [issuer] a jsonld.IdentifierIssuer to use to label blank nodes.\n *          [mergeNodes] true to merge properties for nodes with the same ID,\n *            false to ignore new properties for nodes with the same ID once\n *            the ID has been defined; note that this may not prevent merging\n *            new properties where a node is in the `object` position\n *            (default: true).\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the merged output.\n */\njsonld.merge = async function(docs, ctx, options) {\n  if(arguments.length < 1) {\n    throw new TypeError('Could not merge, too few arguments.');\n  }\n  if(!_isArray(docs)) {\n    throw new TypeError('Could not merge, \"docs\" must be an array.');\n  }\n\n  if(typeof ctx === 'function') {\n    ctx = null;\n  } else {\n    ctx = ctx || null;\n  }\n\n  // set default options\n  options = _setDefaults(options, {\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // expand all documents\n  const expanded = await Promise.all(docs.map(doc => {\n    const opts = {...options};\n    return jsonld.expand(doc, opts);\n  }));\n\n  let mergeNodes = true;\n  if('mergeNodes' in options) {\n    mergeNodes = options.mergeNodes;\n  }\n\n  const issuer = options.issuer || new IdentifierIssuer('_:b');\n  const graphs = {'@default': {}};\n\n  for(let i = 0; i < expanded.length; ++i) {\n    // uniquely relabel blank nodes\n    const doc = util.relabelBlankNodes(expanded[i], {\n      issuer: new IdentifierIssuer('_:b' + i + '-')\n    });\n\n    // add nodes to the shared node map graphs if merging nodes, to a\n    // separate graph set if not\n    const _graphs = (mergeNodes || i === 0) ? graphs : {'@default': {}};\n    _createNodeMap(doc, _graphs, '@default', issuer);\n\n    if(_graphs !== graphs) {\n      // merge document graphs but don't merge existing nodes\n      for(const graphName in _graphs) {\n        const _nodeMap = _graphs[graphName];\n        if(!(graphName in graphs)) {\n          graphs[graphName] = _nodeMap;\n          continue;\n        }\n        const nodeMap = graphs[graphName];\n        for(const key in _nodeMap) {\n          if(!(key in nodeMap)) {\n            nodeMap[key] = _nodeMap[key];\n          }\n        }\n      }\n    }\n  }\n\n  // add all non-default graphs to default graph\n  const defaultGraph = _mergeNodeMaps(graphs);\n\n  // produce flattened output\n  const flattened = [];\n  const keys = Object.keys(defaultGraph).sort();\n  for(let ki = 0; ki < keys.length; ++ki) {\n    const node = defaultGraph[keys[ki]];\n    // only add full subjects to top-level\n    if(!_isSubjectReference(node)) {\n      flattened.push(node);\n    }\n  }\n\n  if(ctx === null) {\n    return flattened;\n  }\n\n  // compact result (force @graph option to true, skip expansion)\n  options.graph = true;\n  options.skipExpansion = true;\n  const compacted = await jsonld.compact(flattened, ctx, options);\n\n  return compacted;\n};\n\n/**\n * The default document loader for external documents.\n *\n * @param url the URL to load.\n *\n * @return a promise that resolves to the remote document.\n */\nObject.defineProperty(jsonld, 'documentLoader', {\n  get: () => jsonld._documentLoader,\n  set: v => jsonld._documentLoader = v\n});\n// default document loader not implemented\njsonld.documentLoader = async url => {\n  throw new JsonLdError(\n    'Could not retrieve a JSON-LD document from the URL. URL ' +\n    'dereferencing not implemented.', 'jsonld.LoadDocumentError',\n    {code: 'loading document failed', url});\n};\n\n/**\n * Gets a remote JSON-LD document using the default document loader or\n * one given in the passed options.\n *\n * @param url the URL to fetch.\n * @param [options] the options to use:\n *          [documentLoader] the document loader to use.\n *\n * @return a Promise that resolves to the retrieved remote document.\n */\njsonld.get = async function(url, options) {\n  let load;\n  if(typeof options.documentLoader === 'function') {\n    load = options.documentLoader;\n  } else {\n    load = jsonld.documentLoader;\n  }\n\n  const remoteDoc = await load(url);\n\n  try {\n    if(!remoteDoc.document) {\n      throw new JsonLdError(\n        'No remote document found at the given URL.',\n        'jsonld.NullRemoteDocument');\n    }\n    if(_isString(remoteDoc.document)) {\n      remoteDoc.document = JSON.parse(remoteDoc.document);\n    }\n  } catch(e) {\n    throw new JsonLdError(\n      'Could not retrieve a JSON-LD document from the URL.',\n      'jsonld.LoadDocumentError', {\n        code: 'loading document failed',\n        cause: e,\n        remoteDoc\n      });\n  }\n\n  return remoteDoc;\n};\n\n/**\n * Processes a local context, resolving any URLs as necessary, and returns a\n * new active context.\n *\n * @param activeCtx the current active context.\n * @param localCtx the local context to process.\n * @param [options] the options to use:\n *          [documentLoader(url, options)] the document loader.\n *          [contextResolver] internal use only.\n *\n * @return a Promise that resolves to the new active context.\n */\njsonld.processContext = async function(\n  activeCtx, localCtx, options) {\n  // set default options\n  options = _setDefaults(options, {\n    base: '',\n    contextResolver: new ContextResolver(\n      {sharedCache: _resolvedContextCache})\n  });\n\n  // return initial context early for null context\n  if(localCtx === null) {\n    return _getInitialContext(options);\n  }\n\n  // get URLs in localCtx\n  localCtx = util.clone(localCtx);\n  if(!(_isObject(localCtx) && '@context' in localCtx)) {\n    localCtx = {'@context': localCtx};\n  }\n\n  return _processContext({activeCtx, localCtx, options});\n};\n\n// backwards compatibility\njsonld.getContextValue = require('./context').getContextValue;\n\n/**\n * Document loaders.\n */\njsonld.documentLoaders = {};\n\n/**\n * Assigns the default document loader for external document URLs to a built-in\n * default. Supported types currently include: 'xhr' and 'node'.\n *\n * @param type the type to set.\n * @param [params] the parameters required to use the document loader.\n */\njsonld.useDocumentLoader = function(type) {\n  if(!(type in jsonld.documentLoaders)) {\n    throw new JsonLdError(\n      'Unknown document loader type: \"' + type + '\"',\n      'jsonld.UnknownDocumentLoader',\n      {type});\n  }\n\n  // set document loader\n  jsonld.documentLoader = jsonld.documentLoaders[type].apply(\n    jsonld, Array.prototype.slice.call(arguments, 1));\n};\n\n/**\n * Registers an RDF dataset parser by content-type, for use with\n * jsonld.fromRDF. An RDF dataset parser will always be given one parameter,\n * a string of input. An RDF dataset parser can be synchronous or\n * asynchronous (by returning a promise).\n *\n * @param contentType the content-type for the parser.\n * @param parser(input) the parser function (takes a string as a parameter\n *          and either returns an RDF dataset or a Promise that resolves to one.\n */\njsonld.registerRDFParser = function(contentType, parser) {\n  _rdfParsers[contentType] = parser;\n};\n\n/**\n * Unregisters an RDF dataset parser by content-type.\n *\n * @param contentType the content-type for the parser.\n */\njsonld.unregisterRDFParser = function(contentType) {\n  delete _rdfParsers[contentType];\n};\n\n// register the N-Quads RDF parser\njsonld.registerRDFParser('application/n-quads', NQuads.parse);\njsonld.registerRDFParser('application/nquads', NQuads.parse);\n\n/* URL API */\njsonld.url = require('./url');\n\n/* Utility API */\njsonld.util = util;\n// backwards compatibility\nObject.assign(jsonld, util);\n\n// reexpose API as jsonld.promises for backwards compatability\njsonld.promises = jsonld;\n\n// backwards compatibility\njsonld.RequestQueue = require('./RequestQueue');\n\n/* WebIDL API */\njsonld.JsonLdProcessor = require('./JsonLdProcessor')(jsonld);\n\nplatform.setupGlobals(jsonld);\nplatform.setupDocumentLoaders(jsonld);\n\nfunction _setDefaults(options, {\n  documentLoader = jsonld.documentLoader,\n  ...defaults\n}) {\n  return Object.assign({}, {documentLoader}, defaults, options);\n}\n\n// end of jsonld API `wrapper` factory\nreturn jsonld;\n};\n\n// external APIs:\n\n// used to generate a new jsonld API instance\nconst factory = function() {\n  return wrapper(function() {\n    return factory();\n  });\n};\n\n// wrap the main jsonld API instance\nwrapper(factory);\n// export API\nmodule.exports = factory;\n","// **N3Util** provides N3 utility functions.\n\nimport N3DataFactory from './N3DataFactory';\n\n// Tests whether the given term represents an IRI\nexport function isNamedNode(term) {\n  return !!term && term.termType === 'NamedNode';\n}\n\n// Tests whether the given term represents a blank node\nexport function isBlankNode(term) {\n  return !!term && term.termType === 'BlankNode';\n}\n\n// Tests whether the given term represents a literal\nexport function isLiteral(term) {\n  return !!term && term.termType === 'Literal';\n}\n\n// Tests whether the given term represents a variable\nexport function isVariable(term) {\n  return !!term && term.termType === 'Variable';\n}\n\n// Tests whether the given term represents the default graph\nexport function isDefaultGraph(term) {\n  return !!term && term.termType === 'DefaultGraph';\n}\n\n// Tests whether the given quad is in the default graph\nexport function inDefaultGraph(quad) {\n  return isDefaultGraph(quad.graph);\n}\n\n// Creates a function that prepends the given IRI to a local name\nexport function prefix(iri, factory) {\n  return prefixes({ '': iri }, factory)('');\n}\n\n// Creates a function that allows registering and expanding prefixes\nexport function prefixes(defaultPrefixes, factory) {\n  // Add all of the default prefixes\n  const prefixes = Object.create(null);\n  for (const prefix in defaultPrefixes)\n    processPrefix(prefix, defaultPrefixes[prefix]);\n  // Set the default factory if none was specified\n  factory = factory || N3DataFactory;\n\n  // Registers a new prefix (if an IRI was specified)\n  // or retrieves a function that expands an existing prefix (if no IRI was specified)\n  function processPrefix(prefix, iri) {\n    // Create a new prefix if an IRI is specified or the prefix doesn't exist\n    if (typeof iri === 'string') {\n      // Create a function that expands the prefix\n      const cache = Object.create(null);\n      prefixes[prefix] = local => {\n        return cache[local] || (cache[local] = factory.namedNode(iri + local));\n      };\n    }\n    else if (!(prefix in prefixes)) {\n      throw new Error(`Unknown prefix: ${prefix}`);\n    }\n    return prefixes[prefix];\n  }\n  return processPrefix;\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__56__;","/**\n * An implementation of the RDF Dataset Normalization specification.\n *\n * @author Dave Longley\n *\n * Copyright 2010-2021 Digital Bazaar, Inc.\n */\nmodule.exports = require('./lib');\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nmodule.exports = class IdentifierIssuer {\n  /**\n   * Creates a new IdentifierIssuer. A IdentifierIssuer issues unique\n   * identifiers, keeping track of any previously issued identifiers.\n   *\n   * @param prefix the prefix to use ('<prefix><counter>').\n   * @param existing an existing Map to use.\n   * @param counter the counter to use.\n   */\n  constructor(prefix, existing = new Map(), counter = 0) {\n    this.prefix = prefix;\n    this._existing = existing;\n    this.counter = counter;\n  }\n\n  /**\n   * Copies this IdentifierIssuer.\n   *\n   * @return a copy of this IdentifierIssuer.\n   */\n  clone() {\n    const {prefix, _existing, counter} = this;\n    return new IdentifierIssuer(prefix, new Map(_existing), counter);\n  }\n\n  /**\n   * Gets the new identifier for the given old identifier, where if no old\n   * identifier is given a new identifier will be generated.\n   *\n   * @param [old] the old identifier to get the new identifier for.\n   *\n   * @return the new identifier.\n   */\n  getId(old) {\n    // return existing old identifier\n    const existing = old && this._existing.get(old);\n    if(existing) {\n      return existing;\n    }\n\n    // get next identifier\n    const identifier = this.prefix + this.counter;\n    this.counter++;\n\n    // save mapping\n    if(old) {\n      this._existing.set(old, identifier);\n    }\n\n    return identifier;\n  }\n\n  /**\n   * Returns true if the given old identifer has already been assigned a new\n   * identifier.\n   *\n   * @param old the old identifier to check.\n   *\n   * @return true if the old identifier has been assigned a new identifier,\n   *   false if not.\n   */\n  hasId(old) {\n    return this._existing.has(old);\n  }\n\n  /**\n   * Returns all of the IDs that have been issued new IDs in the order in\n   * which they were issued new IDs.\n   *\n   * @return the list of old IDs that has been issued new IDs in order.\n   */\n  getOldIds() {\n    return [...this._existing.keys()];\n  }\n};\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\n// eslint-disable-next-line no-unused-vars\nconst TERMS = ['subject', 'predicate', 'object', 'graph'];\nconst RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\nconst RDF_LANGSTRING = RDF + 'langString';\nconst XSD_STRING = 'http://www.w3.org/2001/XMLSchema#string';\n\nconst TYPE_NAMED_NODE = 'NamedNode';\nconst TYPE_BLANK_NODE = 'BlankNode';\nconst TYPE_LITERAL = 'Literal';\nconst TYPE_DEFAULT_GRAPH = 'DefaultGraph';\n\n// build regexes\nconst REGEX = {};\n(() => {\n  const iri = '(?:<([^:]+:[^>]*)>)';\n  // https://www.w3.org/TR/turtle/#grammar-production-BLANK_NODE_LABEL\n  const PN_CHARS_BASE =\n    'A-Z' + 'a-z' +\n    '\\u00C0-\\u00D6' +\n    '\\u00D8-\\u00F6' +\n    '\\u00F8-\\u02FF' +\n    '\\u0370-\\u037D' +\n    '\\u037F-\\u1FFF' +\n    '\\u200C-\\u200D' +\n    '\\u2070-\\u218F' +\n    '\\u2C00-\\u2FEF' +\n    '\\u3001-\\uD7FF' +\n    '\\uF900-\\uFDCF' +\n    '\\uFDF0-\\uFFFD';\n    // TODO:\n    //'\\u10000-\\uEFFFF';\n  const PN_CHARS_U =\n    PN_CHARS_BASE +\n    '_';\n  const PN_CHARS =\n    PN_CHARS_U +\n    '0-9' +\n    '-' +\n    '\\u00B7' +\n    '\\u0300-\\u036F' +\n    '\\u203F-\\u2040';\n  const BLANK_NODE_LABEL =\n    '(_:' +\n      '(?:[' + PN_CHARS_U + '0-9])' +\n      '(?:(?:[' + PN_CHARS + '.])*(?:[' + PN_CHARS + ']))?' +\n    ')';\n  const bnode = BLANK_NODE_LABEL;\n  const plain = '\"([^\"\\\\\\\\]*(?:\\\\\\\\.[^\"\\\\\\\\]*)*)\"';\n  const datatype = '(?:\\\\^\\\\^' + iri + ')';\n  const language = '(?:@([a-zA-Z]+(?:-[a-zA-Z0-9]+)*))';\n  const literal = '(?:' + plain + '(?:' + datatype + '|' + language + ')?)';\n  const ws = '[ \\\\t]+';\n  const wso = '[ \\\\t]*';\n\n  // define quad part regexes\n  const subject = '(?:' + iri + '|' + bnode + ')' + ws;\n  const property = iri + ws;\n  const object = '(?:' + iri + '|' + bnode + '|' + literal + ')' + wso;\n  const graphName = '(?:\\\\.|(?:(?:' + iri + '|' + bnode + ')' + wso + '\\\\.))';\n\n  // end of line and empty regexes\n  REGEX.eoln = /(?:\\r\\n)|(?:\\n)|(?:\\r)/g;\n  REGEX.empty = new RegExp('^' + wso + '$');\n\n  // full quad regex\n  REGEX.quad = new RegExp(\n    '^' + wso + subject + property + object + graphName + wso + '$');\n})();\n\nmodule.exports = class NQuads {\n  /**\n   * Parses RDF in the form of N-Quads.\n   *\n   * @param input the N-Quads input to parse.\n   *\n   * @return an RDF dataset (an array of quads per http://rdf.js.org/).\n   */\n  static parse(input) {\n    // build RDF dataset\n    const dataset = [];\n\n    const graphs = {};\n\n    // split N-Quad input into lines\n    const lines = input.split(REGEX.eoln);\n    let lineNumber = 0;\n    for(const line of lines) {\n      lineNumber++;\n\n      // skip empty lines\n      if(REGEX.empty.test(line)) {\n        continue;\n      }\n\n      // parse quad\n      const match = line.match(REGEX.quad);\n      if(match === null) {\n        throw new Error('N-Quads parse error on line ' + lineNumber + '.');\n      }\n\n      // create RDF quad\n      const quad = {subject: null, predicate: null, object: null, graph: null};\n\n      // get subject\n      if(match[1] !== undefined) {\n        quad.subject = {termType: TYPE_NAMED_NODE, value: match[1]};\n      } else {\n        quad.subject = {termType: TYPE_BLANK_NODE, value: match[2]};\n      }\n\n      // get predicate\n      quad.predicate = {termType: TYPE_NAMED_NODE, value: match[3]};\n\n      // get object\n      if(match[4] !== undefined) {\n        quad.object = {termType: TYPE_NAMED_NODE, value: match[4]};\n      } else if(match[5] !== undefined) {\n        quad.object = {termType: TYPE_BLANK_NODE, value: match[5]};\n      } else {\n        quad.object = {\n          termType: TYPE_LITERAL,\n          value: undefined,\n          datatype: {\n            termType: TYPE_NAMED_NODE\n          }\n        };\n        if(match[7] !== undefined) {\n          quad.object.datatype.value = match[7];\n        } else if(match[8] !== undefined) {\n          quad.object.datatype.value = RDF_LANGSTRING;\n          quad.object.language = match[8];\n        } else {\n          quad.object.datatype.value = XSD_STRING;\n        }\n        quad.object.value = _unescape(match[6]);\n      }\n\n      // get graph\n      if(match[9] !== undefined) {\n        quad.graph = {\n          termType: TYPE_NAMED_NODE,\n          value: match[9]\n        };\n      } else if(match[10] !== undefined) {\n        quad.graph = {\n          termType: TYPE_BLANK_NODE,\n          value: match[10]\n        };\n      } else {\n        quad.graph = {\n          termType: TYPE_DEFAULT_GRAPH,\n          value: ''\n        };\n      }\n\n      // only add quad if it is unique in its graph\n      if(!(quad.graph.value in graphs)) {\n        graphs[quad.graph.value] = [quad];\n        dataset.push(quad);\n      } else {\n        let unique = true;\n        const quads = graphs[quad.graph.value];\n        for(const q of quads) {\n          if(_compareTriples(q, quad)) {\n            unique = false;\n            break;\n          }\n        }\n        if(unique) {\n          quads.push(quad);\n          dataset.push(quad);\n        }\n      }\n    }\n\n    return dataset;\n  }\n\n  /**\n   * Converts an RDF dataset to N-Quads.\n   *\n   * @param dataset (array of quads) the RDF dataset to convert.\n   *\n   * @return the N-Quads string.\n   */\n  static serialize(dataset) {\n    if(!Array.isArray(dataset)) {\n      dataset = NQuads.legacyDatasetToQuads(dataset);\n    }\n    const quads = [];\n    for(const quad of dataset) {\n      quads.push(NQuads.serializeQuad(quad));\n    }\n    return quads.sort().join('');\n  }\n\n  /**\n   * Converts an RDF quad to an N-Quad string (a single quad).\n   *\n   * @param quad the RDF quad convert.\n   *\n   * @return the N-Quad string.\n   */\n  static serializeQuad(quad) {\n    const s = quad.subject;\n    const p = quad.predicate;\n    const o = quad.object;\n    const g = quad.graph;\n\n    let nquad = '';\n\n    // subject can only be NamedNode or BlankNode\n    if(s.termType === TYPE_NAMED_NODE) {\n      nquad += `<${s.value}>`;\n    } else {\n      nquad += `${s.value}`;\n    }\n\n    // predicate can only be NamedNode\n    nquad += ` <${p.value}> `;\n\n    // object is NamedNode, BlankNode, or Literal\n    if(o.termType === TYPE_NAMED_NODE) {\n      nquad += `<${o.value}>`;\n    } else if(o.termType === TYPE_BLANK_NODE) {\n      nquad += o.value;\n    } else {\n      nquad += `\"${_escape(o.value)}\"`;\n      if(o.datatype.value === RDF_LANGSTRING) {\n        if(o.language) {\n          nquad += `@${o.language}`;\n        }\n      } else if(o.datatype.value !== XSD_STRING) {\n        nquad += `^^<${o.datatype.value}>`;\n      }\n    }\n\n    // graph can only be NamedNode or BlankNode (or DefaultGraph, but that\n    // does not add to `nquad`)\n    if(g.termType === TYPE_NAMED_NODE) {\n      nquad += ` <${g.value}>`;\n    } else if(g.termType === TYPE_BLANK_NODE) {\n      nquad += ` ${g.value}`;\n    }\n\n    nquad += ' .\\n';\n    return nquad;\n  }\n\n  /**\n   * Converts a legacy-formatted dataset to an array of quads dataset per\n   * http://rdf.js.org/.\n   *\n   * @param dataset the legacy dataset to convert.\n   *\n   * @return the array of quads dataset.\n   */\n  static legacyDatasetToQuads(dataset) {\n    const quads = [];\n\n    const termTypeMap = {\n      'blank node': TYPE_BLANK_NODE,\n      IRI: TYPE_NAMED_NODE,\n      literal: TYPE_LITERAL\n    };\n\n    for(const graphName in dataset) {\n      const triples = dataset[graphName];\n      triples.forEach(triple => {\n        const quad = {};\n        for(const componentName in triple) {\n          const oldComponent = triple[componentName];\n          const newComponent = {\n            termType: termTypeMap[oldComponent.type],\n            value: oldComponent.value\n          };\n          if(newComponent.termType === TYPE_LITERAL) {\n            newComponent.datatype = {\n              termType: TYPE_NAMED_NODE\n            };\n            if('datatype' in oldComponent) {\n              newComponent.datatype.value = oldComponent.datatype;\n            }\n            if('language' in oldComponent) {\n              if(!('datatype' in oldComponent)) {\n                newComponent.datatype.value = RDF_LANGSTRING;\n              }\n              newComponent.language = oldComponent.language;\n            } else if(!('datatype' in oldComponent)) {\n              newComponent.datatype.value = XSD_STRING;\n            }\n          }\n          quad[componentName] = newComponent;\n        }\n        if(graphName === '@default') {\n          quad.graph = {\n            termType: TYPE_DEFAULT_GRAPH,\n            value: ''\n          };\n        } else {\n          quad.graph = {\n            termType: graphName.startsWith('_:') ?\n              TYPE_BLANK_NODE : TYPE_NAMED_NODE,\n            value: graphName\n          };\n        }\n        quads.push(quad);\n      });\n    }\n\n    return quads;\n  }\n};\n\n/**\n * Compares two RDF triples for equality.\n *\n * @param t1 the first triple.\n * @param t2 the second triple.\n *\n * @return true if the triples are the same, false if not.\n */\nfunction _compareTriples(t1, t2) {\n  // compare subject and object types first as it is the quickest check\n  if(!(t1.subject.termType === t2.subject.termType &&\n    t1.object.termType === t2.object.termType)) {\n    return false;\n  }\n  // compare values\n  if(!(t1.subject.value === t2.subject.value &&\n    t1.predicate.value === t2.predicate.value &&\n    t1.object.value === t2.object.value)) {\n    return false;\n  }\n  if(t1.object.termType !== TYPE_LITERAL) {\n    // no `datatype` or `language` to check\n    return true;\n  }\n  return (\n    (t1.object.datatype.termType === t2.object.datatype.termType) &&\n    (t1.object.language === t2.object.language) &&\n    (t1.object.datatype.value === t2.object.datatype.value)\n  );\n}\n\nconst _escapeRegex = /[\"\\\\\\n\\r]/g;\n/**\n * Escape string to N-Quads literal\n */\nfunction _escape(s) {\n  return s.replace(_escapeRegex, function(match) {\n    switch(match) {\n      case '\"': return '\\\\\"';\n      case '\\\\': return '\\\\\\\\';\n      case '\\n': return '\\\\n';\n      case '\\r': return '\\\\r';\n    }\n  });\n}\n\nconst _unescapeRegex =\n  /(?:\\\\([tbnrf\"'\\\\]))|(?:\\\\u([0-9A-Fa-f]{4}))|(?:\\\\U([0-9A-Fa-f]{8}))/g;\n/**\n * Unescape N-Quads literal to string\n */\nfunction _unescape(s) {\n  return s.replace(_unescapeRegex, function(match, code, u, U) {\n    if(code) {\n      switch(code) {\n        case 't': return '\\t';\n        case 'b': return '\\b';\n        case 'n': return '\\n';\n        case 'r': return '\\r';\n        case 'f': return '\\f';\n        case '\"': return '\"';\n        case '\\'': return '\\'';\n        case '\\\\': return '\\\\';\n      }\n    }\n    if(u) {\n      return String.fromCharCode(parseInt(u, 16));\n    }\n    if(U) {\n      // FIXME: support larger values\n      throw new Error('Unsupported U escape');\n    }\n  });\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\nconst XSD = 'http://www.w3.org/2001/XMLSchema#';\n\nmodule.exports = {\n  // TODO: Deprecated and will be removed later. Use LINK_HEADER_CONTEXT.\n  LINK_HEADER_REL: 'http://www.w3.org/ns/json-ld#context',\n\n  LINK_HEADER_CONTEXT: 'http://www.w3.org/ns/json-ld#context',\n\n  RDF,\n  RDF_LIST: RDF + 'List',\n  RDF_FIRST: RDF + 'first',\n  RDF_REST: RDF + 'rest',\n  RDF_NIL: RDF + 'nil',\n  RDF_TYPE: RDF + 'type',\n  RDF_PLAIN_LITERAL: RDF + 'PlainLiteral',\n  RDF_XML_LITERAL: RDF + 'XMLLiteral',\n  RDF_JSON_LITERAL: RDF + 'JSON',\n  RDF_OBJECT: RDF + 'object',\n  RDF_LANGSTRING: RDF + 'langString',\n\n  XSD,\n  XSD_BOOLEAN: XSD + 'boolean',\n  XSD_DOUBLE: XSD + 'double',\n  XSD_INTEGER: XSD + 'integer',\n  XSD_STRING: XSD + 'string',\n};\n","import Node from './node-internal'\nimport { EmptyTermType } from './types'\nimport { Term } from './tf-types'\n\n/**\n* An empty node\n*/\nexport default class Empty extends Node implements Term {\n  termType: typeof EmptyTermType = EmptyTermType\n\n  constructor () {\n    super('')\n  }\n\n  toString () {\n    return '()'\n  }\n}\n","export default (function () {\r\n  return {\r\n    parseJSON: function (data, source, store) {\r\n      var subject, predicate, object\r\n      var bnodes = {}\r\n      var why = store.sym(source)\r\n      for (var x in data) {\r\n        if (x.indexOf('_:') === 0) {\r\n          if (bnodes[x]) {\r\n            subject = bnodes[x]\r\n          } else {\r\n            subject = store.bnode(x)\r\n            bnodes[x] = subject\r\n          }\r\n        } else {\r\n          subject = store.sym(x)\r\n        }\r\n        var preds = data[x]\r\n        for (var y in preds) {\r\n          var objects = preds[y]\r\n          predicate = store.sym(y)\r\n          for (var z in objects) {\r\n            var obj = objects[z]\r\n            if (obj.type === 'uri') {\r\n              object = store.sym(obj.value)\r\n              store.add(subject, predicate, object, why)\r\n            } else if (obj.type === 'BlankNode') {\r\n              if (bnodes[obj.value]) {\r\n                object = bnodes[obj.value]\r\n              } else {\r\n                object = store.bnode(obj.value)\r\n                bnodes[obj.value] = object\r\n              }\r\n              store.add(subject, predicate, object, why)\r\n            } else if (obj.type === 'Literal') {\r\n              // var datatype\r\n              if (obj.datatype) {\r\n                object = store.literal(obj.value, undefined, store.sym(obj.datatype))\r\n              } else if (obj.lang) {\r\n                object = store.literal(obj.value, obj.lang)\r\n              } else {\r\n                object = store.literal(obj.value)\r\n              }\r\n              store.add(subject, predicate, object, why)\r\n            } else {\r\n              throw new Error('error: unexpected termtype: ' + z.type)\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n})()\r\n","import log from './log'\n\nexport default function queryToSPARQL (query) {\n  var indent = 0\n  function getSelect (query) {\n    var str = addIndent() + 'SELECT '\n    for (var i = 0; i < query.vars.length; i++) {\n      str += query.vars[i] + ' '\n    }\n    str += '\\n'\n    return str\n  }\n\n  function getPattern (pat) {\n    var str = ''\n    var st = pat.statements\n    for (var x in st) {\n      log.debug('Found statement: ' + st)\n      str += addIndent() + st[x] + '\\n'\n    }\n    return str\n  }\n\n  function getConstraints (pat) {\n    var str = ''\n    for (var v in pat.constraints) {\n      var foo = pat.constraints[v]\n      str += addIndent() + 'FILTER ( ' + foo.describe(v) + ' ) ' + '\\n'\n    }\n    return str\n  }\n\n  function getOptionals (pat) {\n    var str = ''\n    for (var x = 0; x < pat.optional.length; x++) {\n      // alert(pat.optional.termType)\n      log.debug('Found optional query')\n      str += addIndent() + 'OPTIONAL { ' + '\\n'\n      indent++\n      str += getPattern(pat.optional[x])\n      str += getConstraints(pat.optional[x])\n      str += getOptionals(pat.optional[x])\n      indent--\n      str += addIndent() + '}' + '\\n'\n    }\n    return str\n  }\n\n  function getWhere (pat) {\n    var str = addIndent() + 'WHERE \\n' + '{ \\n'\n    indent++\n    str += getPattern(pat)\n    str += getConstraints(pat)\n    str += getOptionals(pat)\n    indent--\n    str += '}'\n    return str\n  }\n\n  function addIndent () {\n    var str = ''\n    for (var i = 0; i < indent; i++) {\n      str += '    '\n    }\n    return str\n  }\n\n  function getSPARQL (query) {\n    return getSelect(query) + getWhere(query.pat)\n  }\n\n  return getSPARQL(query)\n}\n","// Converting between SPARQL queries and the $rdf query API\n/*\n\nfunction SQuery () {\n  this.terms = []\n  return this\n}\n\nSTerm.prototype.toString = STerm.val\nSQuery.prototype.add = function (str) {this.terms.push()}*/\n\nimport log from './log'\nimport { Query } from './query'\n\n/**\n * @SPARQL: SPARQL text that is converted to a query object which is returned.\n * @testMode: testing flag. Prevents loading of sources.\n */\nexport default function SPARQLToQuery (SPARQL, testMode, kb) {\n  // AJAR_ClearTable()\n  var variableHash = []\n  function makeVar (name) {\n    if (variableHash[name]) {\n      return variableHash[name]\n    }\n    var newVar = kb.variable(name)\n    variableHash[name] = newVar\n    return newVar\n  }\n\n  // term type functions\n  function isRealText (term) {\n    return (typeof term === 'string' && term.match(/[^ \\n\\t]/))\n  }\n  function isVar (term) {\n    return (typeof term === 'string' && term.match(/^[\\?\\$]/))\n  }\n  function fixSymbolBrackets (term) {\n    if (typeof term === 'string') {\n      return term.replace(/^&lt;/, '<').replace(/&gt;$/, '>')\n    } else {\n      return term\n    }\n  }\n  function isSymbol (term) {\n    return (typeof term === 'string' && term.match(/^<[^>]*>$/))\n  }\n  function isBnode (term) {\n    return (typeof term === 'string' && (term.match(/^_:/) || term.match(/^$/)))\n  }\n  function isPrefix (term) {\n    return (typeof term === 'string' && term.match(/:$/))\n  }\n  function isPrefixedSymbol (term) {\n    return (typeof term === 'string' && term.match(/^:|^[^_][^:]*:/))\n  }\n  function getPrefix (term) {\n    var a = term.split(':')\n    return a[0]\n  }\n  function getSuffix (term) {\n    var a = term.split(':')\n    return a[1]\n  }\n  function removeBrackets (term) {\n    if (isSymbol(term)) {\n      return term.slice(1, term.length - 1)\n    } else {\n      return term\n    }\n  }\n  // takes a string and returns an array of strings and Literals in the place of literals\n  function parseLiterals (str) {\n    // var sin = (str.indexOf(/[ \\n]\\'/)==-1)?null:str.indexOf(/[ \\n]\\'/), doub = (str.indexOf(/[ \\n]\\\"/)==-1)?null:str.indexOf(/[ \\n]\\\"/)\n    var sin = (str.indexOf(\"'\") === -1)\n      ? null\n      : str.indexOf(\"'\")\n    var doub = (str.indexOf('\"') === -1)\n      ? null\n      : str.indexOf('\"')\n    // alert(\"S: \"+sin+\" D: \"+doub)\n    if (!sin && !doub) {\n      var a = new Array(1)\n      a[0] = str\n      return a\n    }\n    var res = new Array(2)\n    var br\n    var ind\n    if (!sin || (doub && doub < sin)) {\n      br = '\"'\n      ind = doub\n    } else if (!doub || (sin && sin < doub)) {\n      br = \"'\"\n      ind = sin\n    } else {\n      log.error('SQARQL QUERY OOPS!')\n      return res\n    }\n    res[0] = str.slice(0, ind)\n    var end = str.slice(ind + 1).indexOf(br)\n    if (end === -1) {\n      log.error('SPARQL parsing error: no matching parentheses in literal ' + str)\n      return str\n    }\n    // alert(str.slice(end + ind + 2).match(/^\\^\\^/))\n    var end2\n    if (str.slice(end + ind + 2).match(/^\\^\\^/)) {\n      end2 = str.slice(end + ind + 2).indexOf(' ')\n      // alert(end2)\n      res[1] = kb.literal(\n        str.slice(ind + 1, ind + 1 + end),\n        kb.sym(removeBrackets(\n          str.slice(ind + 4 + end, ind + 2 + end + end2))\n        )\n      )\n      // alert(res[1].datatype.uri)\n      res = res.concat(parseLiterals(str.slice(end + ind + 3 + end2)))\n    } else if (str.slice(end + ind + 2).match(/^@/)) {\n      end2 = str.slice(end + ind + 2).indexOf(' ')\n      // alert(end2)\n      res[1] = kb.literal(\n        str.slice(ind + 1, ind + 1 + end),\n        str.slice(ind + 3 + end, ind + 2 + end + end2), null\n      )\n      // alert(res[1].datatype.uri)\n      res = res.concat(\n        parseLiterals(str.slice(end + ind + 2 + end2))\n      )\n    } else {\n      res[1] = kb.literal(str.slice(ind + 1, ind + 1 + end))\n      log.info('Literal found: ' + res[1])\n      res = res.concat(parseLiterals(str.slice(end + ind + 2))) // finds any other literals\n    }\n    return res\n  }\n\n  function spaceDelimit (str) {\n    str = str.replace(/\\(/g, ' ( ')\n      .replace(/\\)/g, ' ) ')\n      .replace(/</g, ' <')\n      .replace(/>/g, '> ')\n      .replace(/{/g, ' { ')\n      .replace(/}/g, ' } ')\n      .replace(/[\\t\\n\\r]/g, ' ')\n      .replace(/; /g, ' ; ')\n      .replace(/\\. /g, ' . ')\n      .replace(/, /g, ' , ')\n    log.info('New str into spaceDelimit: \\n' + str)\n    var res = []\n    var br = str.split(' ')\n    for (var x in br) {\n      if (isRealText(br[x])) {\n        res = res.concat(br[x])\n      }\n    }\n    return res\n  }\n\n  function replaceKeywords (input) {\n    var strarr = input\n    for (var x = 0; x < strarr.length; x++) {\n      if (strarr[x] === 'a') {\n        strarr[x] = '<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>'\n      }\n      if (strarr[x] === 'is' && strarr[x + 2] === 'of') {\n        strarr.splice(x, 1)\n        strarr.splice(x + 1, 1)\n        var s = strarr[x - 1]\n        strarr[x - 1] = strarr[x + 1]\n        strarr[x + 1] = s\n      }\n    }\n    return strarr\n  }\n\n  function toTerms (input) {\n    var res = []\n    for (var x = 0; x < input.length; x++) {\n      if (typeof input[x] !== 'string') {\n        res[x] = input[x]\n        continue\n      }\n      input[x] = fixSymbolBrackets(input[x])\n      if (isVar(input[x])) {\n        res[x] = makeVar(input[x].slice(1))\n      } else if (isBnode(input[x])) {\n        log.info(input[x] + ' was identified as a bnode.')\n        res[x] = kb.bnode()\n      } else if (isSymbol(input[x])) {\n        log.info(input[x] + ' was identified as a symbol.')\n        res[x] = kb.sym(removeBrackets(input[x]))\n      } else if (isPrefixedSymbol(input[x])) {\n        log.info(input[x] + ' was identified as a prefixed symbol')\n        if (prefixes[getPrefix(input[x])]) {\n          res[x] = kb.sym(input[x] = prefixes[getPrefix(input[x])] +\n            getSuffix(input[x]))\n        } else {\n          log.error('SPARQL error: ' + input[x] + ' with prefix ' +\n            getPrefix(input[x]) + ' does not have a correct prefix entry.')\n          res[x] = input[x]\n        }\n      } else {\n        res[x] = input[x]\n      }\n    }\n    return res\n  }\n\n  function tokenize (str) {\n    var token1 = parseLiterals(str)\n    var token2 = []\n    for (var x in token1) {\n      if (typeof token1[x] === 'string') {\n        token2 = token2.concat(spaceDelimit(token1[x]))\n      } else {\n        token2 = token2.concat(token1[x])\n      }\n    }\n    token2 = replaceKeywords(token2)\n    log.info('SPARQL Tokens: ' + token2)\n    return token2\n  }\n\n  // CASE-INSENSITIVE\n  function arrayIndexOf (str, arr) {\n    for (var i = 0; i < arr.length; i++) {\n      if (typeof arr[i] !== 'string') {\n        continue\n      }\n      if (arr[i].toLowerCase() === str.toLowerCase()) {\n        return i\n      }\n    }\n    // log.warn(\"No instance of \"+str+\" in array \"+arr)\n    return null\n  }\n\n  // CASE-INSENSITIVE\n  function arrayIndicesOf (str, arr) {\n    var ind = []\n    for (var i = 0; i < arr.length; i++) {\n      if (typeof arr[i] !== 'string') {\n        continue\n      }\n      if (arr[i].toLowerCase() === str.toLowerCase()) {\n        ind.push(i)\n      }\n    }\n    return ind\n  }\n\n  function setVars (input, query) {\n    log.info('SPARQL vars: ' + input)\n    for (var x in input) {\n      if (isVar(input[x])) {\n        log.info('Added ' + input[x] + ' to query variables from SPARQL')\n        var v = makeVar(input[x].slice(1))\n        query.vars.push(v)\n        v.label = input[x].slice(1)\n      } else {\n        log.warn('Incorrect SPARQL variable in SELECT: ' + input[x])\n      }\n    }\n  }\n\n  function getPrefixDeclarations (input) {\n    var prefInd = arrayIndicesOf('PREFIX', input)\n    var res = []\n    for (var i in prefInd) {\n      var a = input[prefInd[i] + 1]\n      var b = input[prefInd[i] + 2]\n      if (!isPrefix(a)) {\n        log.error('Invalid SPARQL prefix: ' + a)\n      } else if (!isSymbol(b)) {\n        log.error('Invalid SPARQL symbol: ' + b)\n      } else {\n        log.info('Prefix found: ' + a + ' -> ' + b)\n        var pref = getPrefix(a)\n        var symbol = removeBrackets(b)\n        res[pref] = symbol\n      }\n    }\n    return res\n  }\n\n  function getMatchingBracket (arr, open, close) {\n    log.info('Looking for a close bracket of type ' + close + ' in ' + arr)\n    var index = 0\n    for (var i = 0; i < arr.length; i++) {\n      if (arr[i] === open) {\n        index++\n      }\n      if (arr[i] === close) {\n        index--\n      }\n      if (index < 0) {\n        return i\n      }\n    }\n    log.error('Statement had no close parenthesis in SPARQL query')\n    return 0\n  }\n\n  function constraintGreaterThan (value) {\n    this.describe = function (varstr) {\n      return varstr + ' > ' + value.toNT()\n    }\n    this.test = function (term) {\n      if (term.value.match(/[0-9]+(\\.[0-9]+)?([eE][+-]?[0-9]+)?/)) {\n        return (parseFloat(term.value) > parseFloat(value))\n      } else {\n        return (term.toNT() > value.toNT())\n      }\n    }\n    return this\n  }\n\n  function constraintLessThan (value) { // this is not the recommended usage. Should only work on literal, numeric, dateTime\n    this.describe = function (varstr) {\n      return varstr + ' < ' + value.toNT()\n    }\n    this.test = function (term) {\n      // this.describe = function (varstr) { return varstr + \" < \"+value }\n      if (term.value.match(/[0-9]+(\\.[0-9]+)?([eE][+-]?[0-9]+)?/)) {\n        return (parseFloat(term.value) < parseFloat(value))\n      } else {\n        return (term.toNT() < value.toNT())\n      }\n    }\n    return this\n  }\n  // This should only work on literals but doesn't.\n  function ConstraintEqualTo (value) {\n    this.describe = function (varstr) {\n      return varstr + ' = ' + value.toNT()\n    }\n    this.test = function (term) {\n      return value.equals(term)\n    }\n    return this\n  }\n\n  // value must be a literal\n  function ConstraintRegexp (value) {\n    this.describe = function (varstr) {\n      return \"REGEXP( '\" + value + \"' , \" + varstr + ' )'\n    }\n    this.test = function (term) {\n      var str = value\n      // str = str.replace(/^//,\"\").replace(//$/,\"\")\n      var rg = new RegExp(str)\n      if (term.value) {\n        return rg.test(term.value)\n      } else {\n        return false\n      }\n    }\n  }\n\n  function setConstraint (input, pat) {\n    if (input.length === 3 && input[0].termType === 'Variable' &&\n      (input[2].termType === 'NamedNode' || input[2].termType === 'Literal')) {\n      if (input[1] === '=') {\n        log.debug('Constraint added: ' + input)\n        pat.constraints[input[0]] = new ConstraintEqualTo(input[2])\n      } else if (input[1] === '>') {\n        log.debug('Constraint added: ' + input)\n        pat.constraints[input[0]] = new ConstraintEqualTo(input[2])\n      } else if (input[1] === '<') {\n        log.debug('Constraint added: ' + input)\n        pat.constraints[input[0]] = new ConstraintEqualTo(input[2])\n      } else {\n        log.warn(\"I don't know how to handle the constraint: \" + input)\n      }\n    } else if (input.length === 6 && typeof input[0] === 'string' &&\n      input[0].toLowerCase() === 'regexp' &&\n      input[1] === '(' && input[5] === ')' && input[3] === ',' &&\n      input[4].termType === 'Variable' && input[2].termType === 'Literal') {\n      log.debug('Constraint added: ' + input)\n      pat.constraints[input[4]] = new ConstraintRegexp(input[2].value)\n    }\n  // log.warn(\"I don't know how to handle the constraint: \"+input)\n  // alert(\"length: \"+input.length+\" input 0 type: \"+input[0].termType+\" input 1: \"+input[1]+\" input[2] type: \"+input[2].termType)\n  }\n\n  function setOptional (terms, pat) {\n    log.debug('Optional query: ' + terms + ' not yet implemented.')\n    var opt = kb.formula()\n    setWhere(terms, opt)\n    pat.optional.push(opt)\n  }\n\n  function setWhere (input, pat) {\n    var terms = toTerms(input)\n    var end\n    log.debug('WHERE: ' + terms)\n    var opt\n    // var opt = arrayIndicesOf(\"OPTIONAL\",terms)\n    while (arrayIndexOf('OPTIONAL', terms)) {\n      opt = arrayIndexOf('OPTIONAL', terms)\n      log.debug('OPT: ' + opt + ' ' + terms[opt] + ' in ' + terms)\n      if (terms[opt + 1] !== '{') {\n        log.warn('Bad optional opening bracket in word ' + opt)\n      }\n      end = getMatchingBracket(terms.slice(opt + 2), '{', '}')\n      if (end === -1) {\n        log.error('No matching bracket in word ' + opt)\n      } else {\n        setOptional(terms.slice(opt + 2, opt + 2 + end), pat)\n        // alert(pat.statements[0].toNT())\n        opt = arrayIndexOf('OPTIONAL', terms)\n        end = getMatchingBracket(terms.slice(opt + 2), '{', '}')\n        terms.splice(opt, end + 3)\n      }\n    }\n    log.debug('WHERE after optionals: ' + terms)\n    while (arrayIndexOf('FILTER', terms)) {\n      var filt = arrayIndexOf('FILTER', terms)\n      if (terms[filt + 1] !== '(') {\n        log.warn('Bad filter opening bracket in word ' + filt)\n      }\n      end = getMatchingBracket(terms.slice(filt + 2), '(', ')')\n      if (end === -1) {\n        log.error('No matching bracket in word ' + filt)\n      } else {\n        setConstraint(terms.slice(filt + 2, filt + 2 + end), pat)\n        filt = arrayIndexOf('FILTER', terms)\n        end = getMatchingBracket(terms.slice(filt + 2), '(', ')')\n        terms.splice(filt, end + 3)\n      }\n    }\n    log.debug('WHERE after filters and optionals: ' + terms)\n    extractStatements(terms, pat)\n  }\n\n  function extractStatements (terms, formula) {\n    var arrayZero = new Array(1)\n    arrayZero[0] = -1 // this is just to add the beginning of the where to the periods index.\n    var per = arrayZero.concat(arrayIndicesOf('.', terms))\n    var stat = []\n    for (var x = 0; x < per.length - 1; x++) {\n      stat[x] = terms.slice(per[x] + 1, per[x + 1])\n    }\n    // Now it's in an array of statements\n    for (x in stat) { // THIS MUST BE CHANGED FOR COMMA, SEMICOLON\n      log.info('s+p+o ' + x + ' = ' + stat[x])\n      var subj = stat[x][0]\n      stat[x].splice(0, 1)\n      var sem = arrayZero.concat(arrayIndicesOf(';', stat[x]))\n      sem.push(stat[x].length)\n      var stat2 = []\n      for (var y = 0; y < sem.length - 1; y++) {\n        stat2[y] = stat[x].slice(sem[y] + 1, sem[y + 1])\n      }\n      for (x in stat2) {\n        log.info('p+o ' + x + ' = ' + stat[x])\n        var pred = stat2[x][0]\n        stat2[x].splice(0, 1)\n        var com = arrayZero.concat(arrayIndicesOf(',', stat2[x]))\n        com.push(stat2[x].length)\n        var stat3 = []\n        for (y = 0; y < com.length - 1; y++) {\n          stat3[y] = stat2[x].slice(com[y] + 1, com[y + 1])\n        }\n        for (x in stat3) {\n          var obj = stat3[x][0]\n          log.info('Subj=' + subj + ' Pred=' + pred + ' Obj=' + obj)\n          formula.add(subj, pred, obj)\n        }\n      }\n    }\n  }\n\n  // ******************************* Body of SPARQLToQuery ***************************//\n  log.info('SPARQL input: \\n' + SPARQL)\n  var q = new Query()\n  var sp = tokenize(SPARQL) // first tokenize everything\n  var prefixes = getPrefixDeclarations(sp)\n  if (!prefixes.rdf) {\n    prefixes.rdf = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'\n  }\n  if (!prefixes.rdfs) {\n    prefixes.rdfs = 'http://www.w3.org/2000/01/rdf-schema#'\n  }\n  var selectLoc = arrayIndexOf('SELECT', sp)\n  var whereLoc = arrayIndexOf('WHERE', sp)\n  if (selectLoc < 0 || whereLoc < 0 || selectLoc > whereLoc) {\n    log.error('Invalid or nonexistent SELECT and WHERE tags in SPARQL query')\n    return false\n  }\n  setVars(sp.slice(selectLoc + 1, whereLoc), q)\n\n  setWhere(sp.slice(whereLoc + 2, sp.length - 1), q.pat)\n\n  if (testMode) {\n    return q\n  }\n\n  for (var x in q.pat.statements) {\n    var st = q.pat.statements[x]\n    if (st.subject.termType === 'NamedNode') {\n      if (kb.fetcher) {\n        kb.fetcher.lookUpThing(st.subject, 'sparql:' + st.subject)\n      }\n    }\n    if (st.object.termType === 'NamedNode') {\n      if (kb.fetcher) {\n        kb.fetcher.lookUpThing(st.object, 'sparql:' + st.object)\n      }\n    }\n  }\n  // alert(q.pat)\n  return q\n// checkVars()\n// *******************************************************************//\n}\n","/* @file Update Manager Class\n**\n** 2007-07-15 originall sparl update module by Joe Presbrey <presbrey@mit.edu>\n** 2010-08-08 TimBL folded in Kenny's WEBDAV\n** 2010-12-07 TimBL addred local file write code\n*/\nimport IndexedFormula from './store'\nimport { docpart } from './uri'\nimport Fetcher from './fetcher'\nimport Namespace from './namespace'\nimport Serializer from './serializer'\nimport { join as uriJoin } from './uri'\nimport { isStore, isBlankNode } from './utils/terms'\nimport * as Util from './utils-js'\nimport Statement from './statement'\nimport RDFlibNamedNode from './named-node'\nimport { termValue } from './utils/termValue'\nimport {\n  BlankNode,\n  NamedNode,\n  Quad_Graph,\n  Quad_Object,\n  Quad_Predicate,\n  Quad_Subject,\n  Quad,\n  Term,\n} from './tf-types'\n\ninterface UpdateManagerFormula extends IndexedFormula {\n  fetcher: Fetcher\n}\n\ntype CallBackFunction = (uri: string, ok: boolean, message: string, response: Error | Response) => {} | void\n\n/**\n* The UpdateManager is a helper object for a store.\n* Just as a Fetcher provides the store with the ability to read and write,\n* the Update Manager provides functionality for making small patches in real time,\n* and also looking out for concurrent updates from other agents\n*/\nexport default class UpdateManager {\n\n  store: UpdateManagerFormula\n\n  ifps: {}\n\n  fps: {}\n\n  /** Index of objects for coordinating incoming and outgoing patches */\n  patchControl: []\n\n  /** Object of namespaces */\n  ns: any\n\n  /**\n   * @param  store - The quadstore to store data and metadata. Created if not passed.\n  */\n  constructor (store?: IndexedFormula) {\n    store = store || new IndexedFormula()\n    if (store.updater) {\n      throw new Error(\"You can't have two UpdateManagers for the same store\")\n    }\n    if (!(store as UpdateManagerFormula).fetcher) {\n      (store as UpdateManagerFormula).fetcher = new Fetcher(store)\n    }\n    this.store = store as UpdateManagerFormula\n    store.updater = this\n    this.ifps = {}\n    this.fps = {}\n    this.ns = {}\n    this.ns.link = Namespace('http://www.w3.org/2007/ont/link#')\n    this.ns.http = Namespace('http://www.w3.org/2007/ont/http#')\n    this.ns.httph = Namespace('http://www.w3.org/2007/ont/httph#')\n    this.ns.ldp = Namespace('http://www.w3.org/ns/ldp#')\n    this.ns.rdf = Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#')\n    this.ns.rdfs = Namespace('http://www.w3.org/2000/01/rdf-schema#')\n    this.ns.rdf = Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#')\n    this.ns.owl = Namespace('http://www.w3.org/2002/07/owl#')\n\n    this.patchControl = []\n  }\n\n  patchControlFor (doc: NamedNode) {\n    if (!this.patchControl[doc.value]) {\n      this.patchControl[doc.value] = []\n    }\n    return this.patchControl[doc.value]\n  }\n\n  isHttpUri(uri:string){\n    return( uri.slice(0,4) === 'http' )\n  }\n\n\n  /**\n   * Tests whether a file is editable.\n   * If the file has a specific annotation that it is machine written,\n   * for safety, it is editable (this doesn't actually check for write access)\n   * If the file has wac-allow and accept patch headers, those are respected.\n   * and local write access is determined by those headers.\n   * This version only looks at past HTTP requests, does not make new ones.\n   *\n   * @returns The method string SPARQL or DAV or\n   *   LOCALFILE or false if known, undefined if not known.\n   */\n  editable (uri: string | NamedNode, kb?: IndexedFormula): string | boolean | undefined {\n    if (!uri) {\n      return false // Eg subject is bnode, no known doc to write to\n    }\n    if (!kb) {\n      kb = this.store\n    }\n    uri = termValue(uri)\n\n    if ( !this.isHttpUri(uri as string) ) {\n      if (kb.holds(\n          this.store.rdfFactory.namedNode(uri),\n          this.store.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'),\n          this.store.rdfFactory.namedNode('http://www.w3.org/2007/ont/link#MachineEditableDocument'))) {\n        return 'LOCALFILE'\n      }\n    }\n\n    var request\n    var definitive = false\n     // @ts-ignore passes a string to kb.each, which expects a term. Should this work?\n    var requests = kb.each(undefined, this.ns.link('requestedURI'), docpart(uri))\n    var method: string\n    for (var r = 0; r < requests.length; r++) {\n      request = requests[r]\n      if (request !== undefined) {\n        var response = kb.any(request, this.ns.link('response')) as Quad_Subject\n        if (request !== undefined) {\n          var wacAllow = kb.anyValue(response, this.ns.httph('wac-allow'))\n          if (wacAllow) {\n            for (var bit of wacAllow.split(',')) {\n              var lr = bit.split('=')\n              if (lr[0].includes('user') && !lr[1].includes('write') && !lr[1].includes('append') ) {\n                // console.log('    editable? excluded by WAC-Allow: ', wacAllow)\n                return false\n              }\n            }\n          }\n          var acceptPatch = kb.each(response, this.ns.httph('accept-patch'))\n          if (acceptPatch.length) {\n            for (let i = 0; i < acceptPatch.length; i++) {\n              method = acceptPatch[i].value.trim()\n              if (method.indexOf('application/sparql-update') >= 0) return 'SPARQL'\n              if (method.indexOf('application/sparql-update-single-match') >= 0) return 'SPARQL'\n            }\n          }\n          var authorVia = kb.each(response, this.ns.httph('ms-author-via'))\n          if (authorVia.length) {\n            for (let i = 0; i < authorVia.length; i++) {\n              method = authorVia[i].value.trim()\n              if (method.indexOf('SPARQL') >= 0) {\n                return 'SPARQL'\n              }\n              if (method.indexOf('DAV') >= 0) {\n                return 'DAV'\n              }\n            }\n          }\n\n          if ( !this.isHttpUri(uri as string) ) {\n            if( !wacAllow ) return false;\n            else return 'LOCALFILE';\n          }\n\n          var status = kb.each(response, this.ns.http('status'))\n          if (status.length) {\n            for (let i = 0; i < status.length; i++) {\n              // @ts-ignore since statuses should be TFTerms, this should always be false\n              if (status[i] === 200 || status[i] === 404) {\n                definitive = true\n                // return false // A definitive answer\n              }\n            }\n          }\n        } else {\n          // console.log('UpdateManager.editable: No response for ' + uri + '\\n')\n        }\n      }\n    }\n    if (requests.length === 0) {\n      // console.log('UpdateManager.editable: No request for ' + uri + '\\n')\n    } else {\n      if (definitive) {\n        return false // We have got a request and it did NOT say editable => not editable\n      }\n    }\n    // console.log('UpdateManager.editable: inconclusive for ' + uri + '\\n')\n    return undefined // We don't know (yet) as we haven't had a response (yet)\n  }\n\n  anonymize (obj) {\n    return (obj.toNT().substr(0, 2) === '_:' && this.mentioned(obj))\n      ? '?' + obj.toNT().substr(2)\n      : obj.toNT()\n  }\n\n  anonymizeNT (stmt: Quad) {\n    return this.anonymize(stmt.subject) + ' ' +\n      this.anonymize(stmt.predicate) + ' ' +\n      this.anonymize(stmt.object) + ' .'\n  }\n\n  /**\n   * Returns a list of all bnodes occurring in a statement\n   * @private\n   */\n  statementBnodes (st: Quad): BlankNode[] {\n    return [st.subject, st.predicate, st.object].filter(function (x) {\n      return isBlankNode(x)\n    }) as BlankNode[]\n  }\n\n  /**\n   * Returns a list of all bnodes occurring in a list of statements\n   * @private\n   */\n  statementArrayBnodes (sts: Quad[]) {\n    var bnodes: BlankNode[] = []\n    for (let i = 0; i < sts.length; i++) {\n      bnodes = bnodes.concat(this.statementBnodes(sts[i]))\n    }\n    bnodes.sort() // in place sort - result may have duplicates\n    var bnodes2: BlankNode[] = []\n    for (let j = 0; j < bnodes.length; j++) {\n      if (j === 0 || !bnodes[j].equals(bnodes[j - 1])) {\n        bnodes2.push(bnodes[j])\n      }\n    }\n    return bnodes2\n  }\n\n  /**\n   * Makes a cached list of [Inverse-]Functional properties\n   * @private\n   */\n  cacheIfps () {\n    this.ifps = {}\n    var a = this.store.each(undefined, this.ns.rdf('type'),\n      this.ns.owl('InverseFunctionalProperty'))\n    for (let i = 0; i < a.length; i++) {\n      this.ifps[a[i].value] = true\n    }\n    this.fps = {}\n    a = this.store.each(undefined, this.ns.rdf('type'), this.ns.owl('FunctionalProperty'))\n    for (let i = 0; i < a.length; i++) {\n      this.fps[a[i].value] = true\n    }\n  }\n\n  /**\n   * Returns a context to bind a given node, up to a given depth\n   * @private\n   */\n  bnodeContext2 (x, source, depth) {\n    // Return a list of statements which indirectly identify a node\n    //  Depth > 1 if try further indirection.\n    //  Return array of statements (possibly empty), or null if failure\n    var sts = this.store.statementsMatching(undefined, undefined, x, source) // incoming links\n    var y\n    var res\n    for (let i = 0; i < sts.length; i++) {\n      if (this.fps[sts[i].predicate.value]) {\n        y = sts[i].subject\n        if (!y.isBlank) {\n          return [ sts[i] ]\n        }\n        if (depth) {\n          res = this.bnodeContext2(y, source, depth - 1)\n          if (res) {\n            return res.concat([ sts[i] ])\n          }\n        }\n      }\n    }\n    // outgoing links\n    sts = this.store.statementsMatching(x, undefined, undefined, source)\n    for (let i = 0; i < sts.length; i++) {\n      if (this.ifps[sts[i].predicate.value]) {\n        y = sts[i].object\n        if (!y.isBlank) {\n          return [ sts[i] ]\n        }\n        if (depth) {\n          res = this.bnodeContext2(y, source, depth - 1)\n          if (res) {\n            return res.concat([ sts[i] ])\n          }\n        }\n      }\n    }\n    return null // Failure\n  }\n\n  /**\n   * Returns the smallest context to bind a given single bnode\n   * @private\n   */\n  bnodeContext1 (x, source) {\n    // Return a list of statements which indirectly identify a node\n    //   Breadth-first\n    for (var depth = 0; depth < 3; depth++) { // Try simple first\n      var con = this.bnodeContext2(x, source, depth)\n      if (con !== null) return con\n    }\n    // If we can't guarantee unique with logic just send all info about node\n    return this.store.connectedStatements(x, source) // was:\n    // throw new Error('Unable to uniquely identify bnode: ' + x.toNT())\n  }\n\n  /**\n   * @private\n   */\n  mentioned (x) {\n    return this.store.statementsMatching(x, null, null, null).length !== 0 || // Don't pin fresh bnodes\n      this.store.statementsMatching(null, x).length !== 0 ||\n      this.store.statementsMatching(null, null, x).length !== 0\n  }\n\n  /**\n   * @private\n   */\n  bnodeContext (bnodes, doc) {\n    var context = []\n    if (bnodes.length) {\n      this.cacheIfps()\n      for (let i = 0; i < bnodes.length; i++) { // Does this occur in old graph?\n        var bnode = bnodes[i]\n        if (!this.mentioned(bnode)) continue\n        context = context.concat(this.bnodeContext1(bnode, doc))\n      }\n    }\n    return context\n  }\n\n  /**\n   * Returns the best context for a single statement\n   * @private\n   */\n  statementContext (st: Quad) {\n    var bnodes = this.statementBnodes(st)\n    return this.bnodeContext(bnodes, st.graph)\n  }\n\n  /**\n   * @private\n   */\n  contextWhere (context) {\n    var updater = this\n    return (!context || context.length === 0)\n      ? ''\n      : 'WHERE { ' +\n      context.map(function (x) {\n        return updater.anonymizeNT(x)\n      }).join('\\n') + ' }\\n'\n  }\n\n  /**\n   * @private\n   */\n  fire (\n    uri: string,\n    query: string,\n    callbackFunction: CallBackFunction\n  ): Promise<void> {\n    return Promise.resolve()\n      .then(() => {\n        if (!uri) {\n          throw new Error('No URI given for remote editing operation: ' + query)\n        }\n        // console.log('UpdateManager: sending update to <' + uri + '>')\n\n        let options = {\n          noMeta: true,\n          contentType: 'application/sparql-update',\n          body: query\n        }\n\n        return this.store.fetcher.webOperation('PATCH', uri, options)\n      })\n      .then(response => {\n        if (!response.ok) {\n          let message = 'UpdateManager: update failed for <' + uri + '> status=' +\n            response.status + ', ' + response.statusText +\n            '\\n   for query: ' + query\n          // console.log(message)\n          throw new Error(message)\n        }\n\n        // console.log('UpdateManager: update Ok for <' + uri + '>')\n\n        callbackFunction(uri, response.ok, response.responseText as string, response)\n      })\n      .catch(err => {\n        callbackFunction(uri, false, err.message, err)\n      })\n  }\n\n// ARE THESE THEE FUNCTIONS USED? DEPROCATE?\n\n  /** return a statemnet updating function\n   *\n   * This does NOT update the statement.\n   * It returns an object which includes\n   *  function which can be used to change the object of the statement.\n   */\n  update_statement (statement: Quad) {\n    if (statement && !statement.graph) {\n      return\n    }\n    var updater = this\n    var context = this.statementContext(statement)\n\n    return {\n      statement: statement ? [statement.subject, statement.predicate, statement.object, statement.graph] : undefined,\n      statementNT: statement ? this.anonymizeNT(statement) : undefined,\n      where: updater.contextWhere(context),\n\n      set_object: function (obj, callbackFunction) {\n        var query = this.where\n        query += 'DELETE DATA { ' + this.statementNT + ' } ;\\n'\n        query += 'INSERT DATA { ' +\n          // @ts-ignore `this` might refer to the wrong scope. Does this work?\n          this.anonymize(this.statement[0]) + ' ' +\n          // @ts-ignore\n          this.anonymize(this.statement[1]) + ' ' +\n          // @ts-ignore\n          this.anonymize(obj) + ' ' + ' . }\\n'\n\n        updater.fire((this.statement as [Quad_Subject, Quad_Predicate, Quad_Object, Quad_Graph])[3].value, query, callbackFunction)\n      }\n    }\n  }\n\n  insert_statement (st: Quad, callbackFunction: CallBackFunction): void {\n    var st0 = st instanceof Array ? st[0] : st\n    var query = this.contextWhere(this.statementContext(st0))\n\n    if (st instanceof Array) {\n      var stText = ''\n      for (let i = 0; i < st.length; i++) stText += st[i] + '\\n'\n      query += 'INSERT DATA { ' + stText + ' }\\n'\n    } else {\n      query += 'INSERT DATA { ' +\n        this.anonymize(st.subject) + ' ' +\n        this.anonymize(st.predicate) + ' ' +\n        this.anonymize(st.object) + ' ' + ' . }\\n'\n    }\n\n    this.fire(st0.graph.value, query, callbackFunction)\n  }\n\n  delete_statement (st: Quad | Quad[], callbackFunction: CallBackFunction): void {\n    var st0 = st instanceof Array ? st[0] : st\n    var query = this.contextWhere(this.statementContext(st0))\n\n    if (st instanceof Array) {\n      var stText = ''\n      for (let i = 0; i < st.length; i++) stText += st[i] + '\\n'\n      query += 'DELETE DATA { ' + stText + ' }\\n'\n    } else {\n      query += 'DELETE DATA { ' +\n        this.anonymize(st.subject) + ' ' +\n        this.anonymize(st.predicate) + ' ' +\n        this.anonymize(st.object) + ' ' + ' . }\\n'\n    }\n\n    this.fire(st0.graph.value, query, callbackFunction)\n  }\n\n/// //////////////////////\n\n  /**\n   * Requests a now or future action to refresh changes coming downstream\n   * This is designed to allow the system to re-request the server version,\n   * when a websocket has pinged to say there are changes.\n   * If the websocket, by contrast, has sent a patch, then this may not be necessary.\n   *\n   * @param doc\n   * @param action\n   */\n  requestDownstreamAction (doc: NamedNode, action): void {\n    var control = this.patchControlFor(doc)\n    if (!control.pendingUpstream) {\n      action(doc)\n    } else {\n      if (control.downstreamAction) {\n        if ('' + control.downstreamAction !== '' + action) {  // Kludge compare\n          throw new Error(\"Can't wait for > 1 different downstream actions\")\n        }\n      } else {\n        control.downstreamAction = action\n      }\n    }\n  }\n\n  /**\n   * We want to start counting websocket notifications\n   * to distinguish the ones from others from our own.\n   */\n  clearUpstreamCount (doc: NamedNode): void {\n    var control = this.patchControlFor(doc)\n    control.upstreamCount = 0\n  }\n\n  getUpdatesVia (doc: NamedNode): string | null {\n    var linkHeaders = this.store.fetcher.getHeader(doc, 'updates-via')\n    if (!linkHeaders || !linkHeaders.length) return null\n    return linkHeaders[0].trim()\n  }\n\n  addDownstreamChangeListener (doc: NamedNode, listener): void {\n    var control = this.patchControlFor(doc)\n    if (!control.downstreamChangeListeners) { control.downstreamChangeListeners = [] }\n    control.downstreamChangeListeners.push(listener)\n    this.setRefreshHandler(doc, (doc: NamedNode) => {\n      this.reloadAndSync(doc)\n    })\n  }\n\n  reloadAndSync (doc: NamedNode): void {\n    var control = this.patchControlFor(doc)\n    var updater = this\n\n    if (control.reloading) {\n      // console.log('   Already reloading - note this load may be out of date')\n      control.outOfDate = true\n      return // once only needed @@ Not true, has changed again\n    }\n    control.reloading = true\n    var retryTimeout = 1000 // ms\n    var tryReload = function () {\n      // console.log('try reload - timeout = ' + retryTimeout)\n      updater.reload(updater.store, doc, function (ok, message, response) {\n        if (ok) {\n          if (control.downstreamChangeListeners) {\n            for (let i = 0; i < control.downstreamChangeListeners.length; i++) {\n              // console.log('        Calling downstream listener ' + i)\n              control.downstreamChangeListeners[i]()\n            }\n          }\n          control.reloading = false\n          if (control.outOfDate){\n            // console.log('   Extra reload because of extra update.')\n            control.outOfDate = false\n            tryReload()\n          }\n        } else {\n          control.reloading = false\n          if ((response as Response).status === 0) {\n            // console.log('Network error refreshing the data. Retrying in ' +\n            // retryTimeout / 1000)\n            control.reloading = true\n            retryTimeout = retryTimeout * 2\n            setTimeout(tryReload, retryTimeout)\n          } else {\n            // console.log('Error ' + (response as Response).status + 'refreshing the data:' +\n            //  message + '. Stopped' + doc)\n          }\n        }\n      })\n    }\n    tryReload()\n  }\n\n  /**\n   * Sets up websocket to listen on\n   *\n   * There is coordination between upstream changes and downstream ones\n   * so that a reload is not done in the middle of an upstream patch.\n   * If you use this API then you get called when a change happens, and you\n   * have to reload the file yourself, and then refresh the UI.\n   * Alternative is addDownstreamChangeListener(), where you do not\n   * have to do the reload yourself. Do mot mix them.\n   *\n   * kb contains the HTTP  metadata from previous operations\n   *\n   * @param doc\n   * @param handler\n   *\n   * @returns {boolean}\n   */\n  setRefreshHandler (doc: NamedNode, handler): boolean {\n    let wssURI = this.getUpdatesVia(doc) // relative\n    // var kb = this.store\n    var theHandler = handler\n    var self = this\n    var updater = this\n    var retryTimeout = 1500 // *2 will be 3 Seconds, 6, 12, etc\n    var retries = 0\n\n    if (!wssURI) {\n      // console.log('Server does not support live updates through Updates-Via :-(')\n      return false\n    }\n\n    wssURI = uriJoin(wssURI, doc.value)\n    const validWssURI = wssURI.replace(/^http:/, 'ws:').replace(/^https:/, 'wss:')\n    // console.log('Web socket URI ' + wssURI)\n\n    var openWebsocket = function () {\n      // From https://github.com/solid/solid-spec#live-updates\n      var socket\n      if (typeof WebSocket !== 'undefined') {\n        socket = new WebSocket(validWssURI)\n      } else if (typeof window !== 'undefined' && window.WebSocket) {\n        socket = (window as any).WebSocket(validWssURI)\n      } else {\n        // console.log('Live update disabled, as WebSocket not supported by platform :-(')\n        return\n      }\n      socket.onopen = function () {\n        // console.log('    websocket open')\n        retryTimeout = 1500 // reset timeout to fast on success\n        this.send('sub ' + doc.value)\n        if (retries) {\n          // console.log('Web socket has been down, better check for any news.')\n          updater.requestDownstreamAction(doc, theHandler)\n        }\n      }\n      var control = self.patchControlFor(doc)\n      control.upstreamCount = 0\n\n      socket.onerror = function onerror (err: Error) {\n        // console.log('Error on Websocket:', err)\n      }\n\n      // https://developer.mozilla.org/en-US/docs/Web/API/CloseEvent\n      //\n      // 1000  CLOSE_NORMAL  Normal closure; the connection successfully completed whatever purpose for which it was created.\n      // 1001  CLOSE_GOING_AWAY  The endpoint is going away, either\n      //                                  because of a server failure or because the browser is navigating away from the page that opened the connection.\n      // 1002  CLOSE_PROTOCOL_ERROR  The endpoint is terminating the connection due to a protocol error.\n      // 1003  CLOSE_UNSUPPORTED  The connection is being terminated because the endpoint\n      //                                  received data of a type it cannot accept (for example, a text-only endpoint received binary data).\n      // 1004                             Reserved. A meaning might be defined in the future.\n      // 1005  CLOSE_NO_STATUS  Reserved.  Indicates that no status code was provided even though one was expected.\n      // 1006  CLOSE_ABNORMAL  Reserved. Used to indicate that a connection was closed abnormally (\n      //\n      //\n      socket.onclose = function (event: CloseEvent) {\n        // console.log('*** Websocket closed with code ' + event.code +\n        //   \", reason '\" + event.reason + \"' clean = \" + event.wasClean)\n        retryTimeout *= 2\n        retries += 1\n        // console.log('Retrying in ' + retryTimeout + 'ms') // (ask user?)\n        setTimeout(function () {\n          // console.log('Trying websocket again')\n          openWebsocket()\n        }, retryTimeout)\n      }\n      socket.onmessage = function (msg: MessageEvent) {\n        if (msg.data && msg.data.slice(0, 3) === 'pub') {\n          if ('upstreamCount' in control) {\n            control.upstreamCount -= 1\n            if (control.upstreamCount >= 0) {\n              // console.log('just an echo: ' + control.upstreamCount)\n              return // Just an echo\n            }\n          }\n          // console.log('Assume a real downstream change: ' + control.upstreamCount + ' -> 0')\n          control.upstreamCount = 0\n          self.requestDownstreamAction(doc, theHandler)\n        }\n      }\n    } // openWebsocket\n    openWebsocket()\n\n    return true\n  }\n\n  /**\n   * This high-level function updates the local store iff the web is changed successfully.\n   * Deletions, insertions may be undefined or single statements or lists or formulae (may contain bnodes which can be indirectly identified by a where clause).\n   * The `why` property of each statement must be the give the web document to be updated.\n   * The statements to be deleted and inserted may span more than one web document.\n   * @param deletions - Statement or statements to be deleted.\n   * @param insertions - Statement or statements to be inserted.\n   * @returns a promise\n   */\n  updateMany(\n    deletions: ReadonlyArray<Statement>,\n    insertions: ReadonlyArray<Statement> = []\n  ): Promise<void[]> {\n    const docs = deletions.concat(insertions).map(st => st.why)\n    const thisUpdater = this\n    const uniqueDocs: Array<NamedNode> = []\n    docs.forEach(doc => {\n        if (!uniqueDocs.find(uniqueDoc => uniqueDoc.equals(doc))) uniqueDocs.push(doc as NamedNode)\n     })\n    const updates = uniqueDocs.map(doc =>\n      thisUpdater.update(deletions.filter(st => st.why.equals(doc)),\n        insertions.filter(st => st.why.equals(doc))))\n    if (updates.length > 1) {\n      console.log(`@@ updateMany to ${updates.length}: ${uniqueDocs}`)\n    }\n    return Promise.all(updates)\n  }\n\n  /**\n   * This high-level function updates the local store iff the web is changed successfully.\n   * Deletions, insertions may be undefined or single statements or lists or formulae (may contain bnodes which can be indirectly identified by a where clause).\n   * The `why` property of each statement must be the same and give the web document to be updated.\n   * @param deletions - Statement or statements to be deleted.\n   * @param insertions - Statement or statements to be inserted.\n   * @param callback - called as callbackFunction(uri, success, errorbody)\n   *           OR returns a promise\n   */\n  update(\n      deletions: ReadonlyArray<Statement>,\n      insertions: ReadonlyArray<Statement>,\n      callback?: (\n        uri: string | undefined | null,\n        success: boolean,\n        errorBody?: string,\n        response?: Response | Error\n      ) => void,\n      secondTry?: boolean\n  ): void | Promise<void> {\n    if (!callback) {\n      var thisUpdater = this\n      return new Promise(function (resolve, reject) { // Promise version\n        thisUpdater.update(deletions, insertions, function (uri, ok, errorBody) {\n          if (!ok) {\n            reject(new Error(errorBody))\n          } else {\n            resolve()\n          }\n        }) // callbackFunction\n      }) // promise\n    } // if\n\n    try {\n      var kb = this.store\n      var ds = !deletions ? []\n        : isStore(deletions) ? deletions.statements\n          : deletions instanceof Array ? deletions : [ deletions ]\n      var is = !insertions ? []\n        : isStore(insertions) ? insertions.statements\n          : insertions instanceof Array ? insertions : [ insertions ]\n      if (!(ds instanceof Array)) {\n        throw new Error('Type Error ' + (typeof ds) + ': ' + ds)\n      }\n      if (!(is instanceof Array)) {\n        throw new Error('Type Error ' + (typeof is) + ': ' + is)\n      }\n      if (ds.length === 0 && is.length === 0) {\n        return callback(null, true) // success -- nothing needed to be done.\n      }\n      var doc = ds.length ? ds[0].graph : is[0].graph\n      if (!doc) {\n        let message = 'Error patching: statement does not specify which document to patch:' + ds[0] + ', ' + is[0]\n        // console.log(message)\n        throw new Error(message)\n      }\n      var control = this.patchControlFor(doc)\n      var startTime = Date.now()\n\n      var props = ['subject', 'predicate', 'object', 'why']\n      var verbs = ['insert', 'delete']\n      var clauses = { 'delete': ds, 'insert': is }\n      verbs.map(function (verb) {\n        clauses[verb].map(function (st: Quad) {\n          if (!doc.equals(st.graph)) {\n            throw new Error('update: destination ' + doc +\n              ' inconsistent with delete quad ' + st.graph)\n          }\n          props.map(function (prop) {\n            if (typeof st[prop] === 'undefined') {\n              throw new Error('update: undefined ' + prop + ' of statement.')\n            }\n          })\n        })\n      })\n\n      var protocol = this.editable(doc.value, kb)\n      if (protocol === false) {\n        throw new Error('Update: Can\\'t make changes in uneditable ' + doc)\n      }\n      if (protocol === undefined) { // Not enough metadata\n        if (secondTry) {\n          throw new Error('Update: Loaded ' + doc + \"but stil can't figure out what editing protcol it supports.\")\n        }\n        // console.log(`Update: have not loaded ${doc} before: loading now...`);\n        (this.store.fetcher.load(doc) as Promise<Response>).then(response => {\n          this.update(deletions, insertions, callback, true)\n        }, err => {\n            if (err.response.status === 404) { // nonexistent files are fine\n              this.update(deletions, insertions, callback, true)\n            } else  {\n              throw new Error(`Update: Can't get updatability status ${doc} before patching: ${err}`)\n            }\n        })\n        return\n      } else if ((protocol as string).indexOf('SPARQL') >= 0) {\n        var bnodes: BlankNode[] = []\n        if (ds.length) bnodes = this.statementArrayBnodes(ds)\n        if (is.length) bnodes = bnodes.concat(this.statementArrayBnodes(is))\n        var context = this.bnodeContext(bnodes, doc)\n        var whereClause = this.contextWhere(context)\n        var query = ''\n        if (whereClause.length) { // Is there a WHERE clause?\n          if (ds.length) {\n            query += 'DELETE { '\n            for (let i = 0; i < ds.length; i++) {\n              query += this.anonymizeNT(ds[i]) + '\\n'\n            }\n            query += ' }\\n'\n          }\n          if (is.length) {\n            query += 'INSERT { '\n            for (let i = 0; i < is.length; i++) {\n              query += this.anonymizeNT(is[i]) + '\\n'\n            }\n            query += ' }\\n'\n          }\n          query += whereClause\n        } else { // no where clause\n          if (ds.length) {\n            query += 'DELETE DATA { '\n            for (let i = 0; i < ds.length; i++) {\n              query += this.anonymizeNT(ds[i]) + '\\n'\n            }\n            query += ' } \\n'\n          }\n          if (is.length) {\n            if (ds.length) query += ' ; '\n            query += 'INSERT DATA { '\n            for (let i = 0; i < is.length; i++) {\n              query += this.anonymizeNT(is[i]) + '\\n'\n            }\n            query += ' }\\n'\n          }\n        }\n        // Track pending upstream patches until they have finished their callbackFunction\n        control.pendingUpstream = control.pendingUpstream ? control.pendingUpstream + 1 : 1\n        if ('upstreamCount' in control) {\n          control.upstreamCount += 1 // count changes we originated ourselves\n          // console.log('upstream count up to : ' + control.upstreamCount)\n        }\n\n        this.fire(doc.value, query, (uri, success, body, response) => {\n          (response as any).elapsedTimeMs = Date.now() - startTime\n          console.log('    UpdateManager: Return ' +\n            (success ? 'success ' : 'FAILURE ') + (response as Response).status +\n            ' elapsed ' + (response as any).elapsedTimeMs + 'ms')\n          if (success) {\n            try {\n              kb.remove(ds)\n            } catch (e) {\n              success = false\n              body = 'Remote Ok BUT error deleting ' + ds.length + ' from store!!! ' + e\n            } // Add in any case -- help recover from weirdness??\n            for (let i = 0; i < is.length; i++) {\n              kb.add(is[i].subject, is[i].predicate, is[i].object, doc)\n            }\n          }\n\n          callback(uri, success, body, response)\n          control.pendingUpstream -= 1\n          // When upstream patches have been sent, reload state if downstream waiting\n          if (control.pendingUpstream === 0 && control.downstreamAction) {\n            var downstreamAction = control.downstreamAction\n            delete control.downstreamAction\n            // console.log('delayed downstream action:')\n            downstreamAction(doc)\n          }\n        })\n      } else if ((protocol as string).indexOf('DAV') >= 0) {\n        this.updateDav(doc, ds, is, callback)\n      } else {\n        if ((protocol as string).indexOf('LOCALFILE') >= 0) {\n          try {\n            this.updateLocalFile(doc, ds, is, callback)\n          } catch (e) {\n            callback(doc.value, false,\n              'Exception trying to write back file <' + doc.value + '>\\n'\n              // + tabulator.Util.stackString(e))\n            )\n          }\n        } else {\n          throw new Error(\"Unhandled edit method: '\" + protocol + \"' for \" + doc)\n        }\n      }\n    } catch (e) {\n      callback(undefined, false, 'Exception in update: ' + e + '\\n' +\n        Util.stackString(e))\n    }\n  }\n\n  updateDav (\n    doc: Quad_Subject,\n    ds,\n    is,\n    callbackFunction\n  ): null | Promise<void> {\n    let kb = this.store\n    // The code below is derived from Kenny's UpdateCenter.js\n    var request = kb.any(doc, this.ns.link('request'))\n    if (!request) {\n      throw new Error('No record of our HTTP GET request for document: ' +\n        doc)\n    } // should not happen\n    var response = kb.any(request as NamedNode, this.ns.link('response')) as Quad_Subject\n    if (!response) {\n      return null // throw \"No record HTTP GET response for document: \"+doc\n    }\n    var contentType = (kb.the(response, this.ns.httph('content-type'))as Term).value\n\n    // prepare contents of revised document\n    let newSts = kb.statementsMatching(undefined, undefined, undefined, doc).slice() // copy!\n    for (let i = 0; i < ds.length; i++) {\n      Util.RDFArrayRemove(newSts, ds[i])\n    }\n    for (let i = 0; i < is.length; i++) {\n      newSts.push(is[i])\n    }\n\n    const documentString = this.serialize(doc.value, newSts, contentType)\n\n    // Write the new version back\n    var candidateTarget = kb.the(response, this.ns.httph('content-location'))\n    var targetURI\n    if (candidateTarget) {\n      targetURI = uriJoin(candidateTarget.value, targetURI)\n    }\n\n    let options = {\n      contentType,\n      noMeta: true,\n      body: documentString\n    }\n\n    return kb.fetcher.webOperation('PUT', targetURI, options)\n      .then(response => {\n        if (!response.ok) {\n          throw new Error(response.error)\n        }\n\n        for (let i = 0; i < ds.length; i++) {\n          kb.remove(ds[i])\n        }\n        for (let i = 0; i < is.length; i++) {\n          kb.add(is[i].subject, is[i].predicate, is[i].object, doc)\n        }\n\n        callbackFunction(doc.value, response.ok, response.responseText, response)\n      })\n      .catch(err => {\n        callbackFunction(doc.value, false, err.message, err)\n      })\n  }\n\n  /**\n   * Likely deprecated, since this lib no longer deals with browser extension\n   *\n   * @param doc\n   * @param ds\n   * @param is\n   * @param callbackFunction\n   */\n  updateLocalFile (doc: NamedNode, ds, is, callbackFunction): void {\n    const kb = this.store\n    // console.log('Writing back to local file\\n')\n\n    // prepare contents of revised document\n    let newSts = kb.statementsMatching(undefined, undefined, undefined, doc).slice() // copy!\n\n    for (let i = 0; i < ds.length; i++) {\n      Util.RDFArrayRemove(newSts, ds[ i ])\n    }\n    for (let i = 0; i < is.length; i++) {\n      newSts.push(is[ i ])\n    }\n    // serialize to the appropriate format\n    var dot = doc.value.lastIndexOf('.')\n    if (dot < 1) {\n      throw new Error('Rewriting file: No filename extension: ' + doc.value)\n    }\n    var ext = doc.value.slice(dot + 1)\n\n    let contentType = Fetcher.CONTENT_TYPE_BY_EXT[ ext ]\n    if (!contentType) {\n      throw new Error('File extension .' + ext + ' not supported for data write')\n    }\n\n    const documentString = this.serialize(doc.value, newSts, contentType)\n\n    kb.fetcher.webOperation('PUT',doc.value,{\n      \"body\"      : documentString,\n      contentType : contentType,\n    }).then( (response)=>{\n      if(!response.ok) return callbackFunction(doc.value,false,response.error)\n      for (let i = 0; i < ds.length; i++) {\n        kb.remove(ds[i]);\n      }\n      for (let i = 0; i < is.length; i++) {\n        kb.add(is[i].subject, is[i].predicate, is[i].object, doc);\n      }\n      callbackFunction(doc.value, true, '')  // success!\n    })\n  }\n\n  /**\n   * @throws {Error} On unsupported content type\n   *\n   * @returns {string}\n   */\n  serialize (uri: string, data: string | Quad[], contentType: string): string {\n    const kb = this.store\n    let documentString\n\n    if (typeof data === 'string') {\n      return data\n    }\n\n    // serialize to the appropriate format\n    var sz = Serializer(kb)\n    sz.suggestNamespaces(kb.namespaces)\n    sz.setBase(uri)\n    switch (contentType) {\n      case 'text/xml':\n      case 'application/rdf+xml':\n        documentString = sz.statementsToXML(data)\n        break\n      case 'text/n3':\n      case 'text/turtle':\n      case 'application/x-turtle': // Legacy\n      case 'application/n3': // Legacy\n        documentString = sz.statementsToN3(data)\n        break\n      default:\n        throw new Error('Content-type ' + contentType +\n          ' not supported for data serialization')\n    }\n\n    return documentString\n  }\n\n  /**\n   * This is suitable for an initial creation of a document.\n   */\n  put(\n    doc: RDFlibNamedNode,\n    data: string | Quad[],\n    contentType: string,\n    callback: (uri: string, ok: boolean, errorMessage?: string, response?: unknown) => void,\n  ): Promise<void> {\n    const kb = this.store\n    let documentString: string\n\n    return Promise.resolve()\n      .then(() => {\n        documentString = this.serialize(doc.value, data, contentType)\n\n        return kb.fetcher\n          .webOperation('PUT', doc.value, { contentType, body: documentString })\n      })\n      .then(response => {\n        if (!response.ok) {\n          return callback(doc.value, response.ok, response.error, response)\n        }\n\n        delete kb.fetcher.nonexistent[doc.value]\n        delete kb.fetcher.requested[doc.value] // @@ could this mess with the requested state machine? if a fetch is in progress\n\n        if (typeof data !== 'string') {\n          data.map((st) => {\n            kb.addStatement(st)\n          })\n        }\n\n        callback(doc.value, response.ok, '', response)\n      })\n      .catch(err => {\n        callback(doc.value, false, err.message)\n      })\n  }\n\n  /**\n   * Reloads a document.\n   *\n   * Fast and cheap, no metadata. Measure times for the document.\n   * Load it provisionally.\n   * Don't delete the statements before the load, or it will leave a broken\n   * document in the meantime.\n   *\n   * @param kb\n   * @param doc {RDFlibNamedNode}\n   * @param callbackFunction\n   */\n  reload (\n    kb: IndexedFormula,\n    doc: docReloadType,\n    callbackFunction: (ok: boolean, message?: string, response?: Error | Response) => {} | void\n  ): void {\n    var startTime = Date.now()\n    // force sets no-cache and\n    const options = {\n      force: true,\n      noMeta: true,\n      clearPreviousData: true,\n    };\n\n    (kb as any).fetcher.nowOrWhenFetched(doc.value, options, function (ok: boolean, body: Body, response: Response) {\n      if (!ok) {\n        // console.log('    ERROR reloading data: ' + body)\n        callbackFunction(false, 'Error reloading data: ' + body, response)\n        //@ts-ignore Where does onErrorWasCalled come from?\n      } else if (response.onErrorWasCalled || response.status !== 200) {\n        // console.log('    Non-HTTP error reloading data! onErrorWasCalled=' +\n          //@ts-ignore Where does onErrorWasCalled come from?\n          // response.onErrorWasCalled + ' status: ' + response.status)\n        callbackFunction(false, 'Non-HTTP error reloading data: ' + body, response)\n      } else {\n        var elapsedTimeMs = Date.now() - startTime\n\n        if (!doc.reloadTimeTotal) doc.reloadTimeTotal = 0\n        if (!doc.reloadTimeCount) doc.reloadTimeCount = 0\n\n        doc.reloadTimeTotal += elapsedTimeMs\n        doc.reloadTimeCount += 1\n\n        // console.log('    Fetch took ' + elapsedTimeMs + 'ms, av. of ' +\n          // doc.reloadTimeCount + ' = ' +\n          // (doc.reloadTimeTotal / doc.reloadTimeCount) + 'ms.')\n\n        callbackFunction(true)\n      }\n    })\n  }\n}\n\ninterface docReloadType extends NamedNode {\n  reloadTimeCount?: number\n  reloadTimeTotal?: number\n}\n","import {\n  IRDFlibDataFactory,\n} from '../types'\nimport Literal from '../literal'\nimport Statement from '../statement'\nimport IndexedFormula from '../store'\nimport Fetcher from '../fetcher'\nimport ExtendedTermFactory from './extended-term-factory'\nimport { NamedNode, Quad_Subject, Quad_Predicate, Quad_Object, Quad_Graph } from '../tf-types'\n\n/** Full RDFLib.js Data Factory */\nconst RDFlibDataFactory: IRDFlibDataFactory = {\n  ...ExtendedTermFactory,\n\n  /**\n   * Creates a new fetcher\n   * @param store - The store to use\n   * @param options - The options\n   */\n  fetcher (store: IndexedFormula, options: any): Fetcher {\n    return new Fetcher(store, options)\n  },\n\n  /**\n   * Creates a new graph (store)\n   */\n  graph (features = undefined, opts = undefined): IndexedFormula {\n    return new IndexedFormula(features, opts || {rdfFactory: ExtendedTermFactory})\n  },\n\n  /**\n   * Creates a new literal node\n   * @param val The lexical value\n   * @param lang The language\n   * @param dt The datatype\n   */\n  lit (val: string, lang?: string, dt?: NamedNode): Literal {\n    return this.literal('' + val, lang || dt)\n  },\n\n  /**\n   * Creates a new statement\n   * @param subject The subject\n   * @param predicate The predicate\n   * @param object The object\n   * @param graph The containing graph\n   */\n  st (\n    subject: Quad_Subject,\n    predicate: Quad_Predicate,\n    object: Quad_Object,\n    graph?: Quad_Graph\n  ): Statement {\n    return this.quad(subject, predicate, object, graph)\n  },\n}\n\nexport default RDFlibDataFactory\n","/*\n * Updates-Via\n */\nimport DataFactory from './factories/rdflib-data-factory'\n\nexport class UpdatesSocket {\n  constructor (parent, via) {\n    this.parent = parent\n    this.via = via\n    this.connected = false\n    this.pending = {}\n    this.subscribed = {}\n    this.socket = {}\n    try {\n      this.socket = new WebSocket(via)\n      this.socket.onopen = this.onOpen\n      this.socket.onclose = this.onClose\n      this.socket.onmessage = this.onMessage\n      this.socket.onerror = this.onError\n    } catch (error) {\n      this.onError(error)\n    }\n  }\n  _decode (q) {\n    var elt\n    var i\n    var k\n    var r\n    var ref\n    var ref1\n    var v\n    r = {}\n    ref = (function () {\n      var j, len, ref, results\n      ref = q.split('&')\n      results = []\n      for (j = 0, len = ref.length; j < len; j++) {\n        elt = ref[j]\n        results.push(elt.split('='))\n      }\n      return results\n    })()\n    for (i in ref) {\n      elt = ref[i]\n      ref1 = [decodeURIComponent(elt[0]), decodeURIComponent(elt[1])]\n      k = ref1[0]\n      v = ref1[1]\n      if (r[k] == null) {\n        r[k] = []\n      }\n      r[k].push(v)\n    }\n    return r\n  }\n  _send (method, uri, data) {\n    var base, message\n    message = [method, uri, data].join(' ')\n    return typeof (base = this.socket).send === 'function' ? base.send(message) : void 0\n  }\n  _subscribe (uri) {\n    this._send('sub', uri, '')\n    this.subscribed[uri] = true\n    return this.subscribed[uri]\n  }\n  onClose (e) {\n    var uri\n    this.connected = false\n    for (uri in this.subscribed) {\n      this.pending[uri] = true\n    }\n    this.subscribed = {}\n    return this.subscribed\n  }\n  onError (e) {\n    throw new Error('onError' + e)\n  }\n  onMessage (e) {\n    var base, message\n    message = e.data.split(' ')\n    if (message[0] === 'ping') {\n      return typeof (base = this.socket).send === 'function' ? base.send('pong ' + message.slice(1).join(' ')) : void 0\n    } else if (message[0] === 'pub') {\n      return this.parent.onUpdate(message[1], this._decode(message[2]))\n    }\n  }\n  onOpen (e) {\n    var results, uri\n    this.connected = true\n    results = []\n    for (uri in this.pending) {\n      delete this.pending[uri]\n      results.push(this._subscribe(uri))\n    }\n    return results\n  }\n  subscribe (uri) {\n    if (this.connected) {\n      return this._subscribe(uri)\n    } else {\n      this.pending[uri] = true\n      return this.pending[uri]\n    }\n  }\n}\n\nexport class UpdatesVia {\n  constructor (fetcher) {\n    this.fetcher = fetcher\n    this.graph = {}\n    this.via = {}\n    this.fetcher.addCallback('headers', this.onHeaders)\n  }\n  onHeaders (d) {\n    var etag, uri, via\n    if (d.headers == null) {\n      return true\n    }\n    if (typeof WebSocket === 'undefined' || WebSocket === null) {\n      return true\n    }\n    etag = d.headers['etag']\n    via = d.headers['updates-via']\n    uri = d.uri\n    if (etag && via) {\n      this.graph[uri] = {\n        etag: etag,\n        via: via\n      }\n      this.register(via, uri)\n    }\n    return true\n  }\n  onUpdate (uri, d) {\n    return this.fetcher.refresh(DataFactory.namedNode(uri))\n  }\n  register (via, uri) {\n    if (this.via[via] == null) {\n      this.via[via] = new UpdatesSocket(this, via)\n    }\n    return this.via[via].subscribe(uri)\n  }\n}\n","import { IRDFlibDataFactory } from './types'\n\nimport BlankNode from './blank-node'\nimport Collection from './collection'\nimport * as convert from './convert'\nimport Empty from './empty'\nimport Fetcher from './fetcher'\nimport Formula from './formula'\nimport Store from './store'\nimport jsonParser from './jsonparser'\nimport Literal from './literal'\nimport log from './log'\nimport N3Parser from './n3parser'\nimport NamedNode from './named-node'\nimport Namespace from './namespace'\nimport Node from './node'\nimport parse from './parse'\nimport { Query } from './query'\nimport queryToSPARQL from './query-to-sparql'\nimport RDFaProcessor from './rdfaparser'\nimport RDFParser from './rdfxmlparser'\nimport serialize from './serialize'\nimport Serializer from './serializer'\nimport SPARQLToQuery from './sparql-to-query'\nimport sparqlUpdateParser from './patch-parser'\nimport Statement from './statement'\nimport UpdateManager from './update-manager'\nimport { UpdatesSocket } from './updates-via'\nimport { UpdatesVia } from './updates-via'\nimport * as uri from './uri'\nimport * as Util from './utils-js'\nimport Variable from './variable'\nimport DataFactory from './factories/rdflib-data-factory'\n\n// Prepare bound versions of data factory methods for export\nconst boundDataFactory = {} as IRDFlibDataFactory\nfor (const name in DataFactory) {\n  if (typeof DataFactory[name] === 'function')\n    boundDataFactory[name] = DataFactory[name].bind(DataFactory);\n}\nconst {\n  fetcher,\n  graph,\n  lit,\n  st,\n  namedNode,\n  variable,\n  blankNode,\n  defaultGraph,\n  literal,\n  quad,\n  triple,\n} = boundDataFactory\n\nconst formula = new Formula();\nconst fromNT = str => formula.fromNT(str);\n\nconst term = Node.fromValue\n\n// TODO: this export is broken;\n// it exports the _current_ value of nextId, which is always 0\nconst NextId = BlankNode.nextId\n\nexport * from './utils/terms'\nexport type { AutoInitOptions, ExtendedResponse, FetchError } from './fetcher'\nexport {\n  BlankNode,\n  Collection,\n  convert,\n  DataFactory,\n  Empty,\n  Fetcher,\n  Formula,\n  Store,\n  jsonParser,\n  Literal,\n  log,\n  N3Parser,\n  NamedNode,\n  Namespace,\n  Node,\n  parse,\n  Query,\n  queryToSPARQL,\n  RDFaProcessor,\n  RDFParser,\n  serialize,\n  Serializer,\n  SPARQLToQuery,\n  sparqlUpdateParser,\n  Statement,\n  term,\n  UpdateManager,\n  UpdatesSocket,\n  UpdatesVia,\n  uri,\n  Util,\n  Variable,\n\n  Store as IndexedFormula, // Alias\n\n  NextId,\n\n  fromNT,\n  fetcher,\n  graph,\n  lit,\n  st,\n  namedNode as sym,\n\n  // RDFJS DataFactory interface\n  blankNode,\n  defaultGraph,\n  literal,\n  namedNode,\n  quad,\n  triple,\n  variable,\n}\nexport { termValue } from './utils/termValue'\n","module.exports = require(\"regenerator-runtime\");\n","/**\n * Provides a way to access commonly used namespaces\n *\n * Usage:\n *\n *   ```\n *   const $rdf = require('rdflib'); //or any other RDF/JS-compatible library\n *   const ns = require('solid-namespace')($rdf);\n *   const store = $rdf.graph();\n *\n *   let me = ...;\n *   let name = store.any(me, ns.vcard(‘fn’)) || store.any(me, ns.foaf(‘name’));\n *   ```\n * @module vocab\n */\nconst aliases = {\n  acl: 'http://www.w3.org/ns/auth/acl#',\n  arg: 'http://www.w3.org/ns/pim/arg#',\n  as: 'https://www.w3.org/ns/activitystreams#',\n  cal: 'http://www.w3.org/2002/12/cal/ical#',\n  cert: 'http://www.w3.org/ns/auth/cert#',\n  contact: 'http://www.w3.org/2000/10/swap/pim/contact#',\n  dc: 'http://purl.org/dc/elements/1.1/',\n  dct: 'http://purl.org/dc/terms/',\n  doap: 'http://usefulinc.com/ns/doap#',\n  foaf: 'http://xmlns.com/foaf/0.1/',\n  geo: 'http://www.w3.org/2003/01/geo/wgs84_pos#',\n  gpx: 'http://www.w3.org/ns/pim/gpx#',\n  http: 'http://www.w3.org/2007/ont/http#',\n  httph: 'http://www.w3.org/2007/ont/httph#',\n  icalTZ: 'http://www.w3.org/2002/12/cal/icaltzd#', // Beware: not cal:\n  ldp: 'http://www.w3.org/ns/ldp#',\n  link: 'http://www.w3.org/2007/ont/link#',\n  log: 'http://www.w3.org/2000/10/swap/log#',\n  meeting: 'http://www.w3.org/ns/pim/meeting#',\n  mo: 'http://purl.org/ontology/mo/',\n  org: 'http://www.w3.org/ns/org#',\n  owl: 'http://www.w3.org/2002/07/owl#',\n  pad: 'http://www.w3.org/ns/pim/pad#',\n  patch: 'http://www.w3.org/ns/pim/patch#',\n  prov: 'http://www.w3.org/ns/prov#',\n  qu: 'http://www.w3.org/2000/10/swap/pim/qif#',\n  trip: 'http://www.w3.org/ns/pim/trip#',\n  rdf: 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',\n  rdfs: 'http://www.w3.org/2000/01/rdf-schema#',\n  rss: 'http://purl.org/rss/1.0/',\n  sched: 'http://www.w3.org/ns/pim/schedule#',\n  schema: 'http://schema.org/', // @@ beware confusion with documents no 303\n  sioc: 'http://rdfs.org/sioc/ns#',\n  solid: 'http://www.w3.org/ns/solid/terms#',\n  space: 'http://www.w3.org/ns/pim/space#',\n  stat: 'http://www.w3.org/ns/posix/stat#',\n  tab: 'http://www.w3.org/2007/ont/link#',\n  tabont: 'http://www.w3.org/2007/ont/link#',\n  ui: 'http://www.w3.org/ns/ui#',\n  vcard: 'http://www.w3.org/2006/vcard/ns#',\n  wf: 'http://www.w3.org/2005/01/wf/flow#',\n  xsd: 'http://www.w3.org/2001/XMLSchema#',\n  cco: 'http://www.ontologyrepository.com/CommonCoreOntologies/'\n}\n\n/**\n * @param [rdflib] {RDF} Optional RDF Library (such as rdflib.js or rdf-ext) to inject\n */\nfunction vocab (rdf = { namedNode: u => u }) {\n  const namespaces = {}\n  for (const alias in aliases) {\n    const expansion = aliases[alias]\n    namespaces[alias] = function (localName = '') {\n      return rdf.namedNode(expansion + localName)\n    }\n  };\n\n  return namespaces\n};\n\nmodule.exports = vocab\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst IdentifierIssuer = require('./IdentifierIssuer');\nconst MessageDigest = require('./MessageDigest');\nconst Permuter = require('./Permuter');\nconst NQuads = require('./NQuads');\n\nmodule.exports = class URDNA2015 {\n  constructor() {\n    this.name = 'URDNA2015';\n    this.blankNodeInfo = new Map();\n    this.canonicalIssuer = new IdentifierIssuer('_:c14n');\n    this.hashAlgorithm = 'sha256';\n    this.quads = null;\n  }\n\n  // 4.4) Normalization Algorithm\n  async main(dataset) {\n    this.quads = dataset;\n\n    // 1) Create the normalization state.\n    // 2) For every quad in input dataset:\n    for(const quad of dataset) {\n      // 2.1) For each blank node that occurs in the quad, add a reference\n      // to the quad using the blank node identifier in the blank node to\n      // quads map, creating a new entry if necessary.\n      this._addBlankNodeQuadInfo({quad, component: quad.subject});\n      this._addBlankNodeQuadInfo({quad, component: quad.object});\n      this._addBlankNodeQuadInfo({quad, component: quad.graph});\n    }\n\n    // 3) Create a list of non-normalized blank node identifiers\n    // non-normalized identifiers and populate it using the keys from the\n    // blank node to quads map.\n    // Note: We use a map here and it was generated during step 2.\n\n    // 4) `simple` flag is skipped -- loop is optimized away. This optimization\n    // is permitted because there was a typo in the hash first degree quads\n    // algorithm in the URDNA2015 spec that was implemented widely making it\n    // such that it could not be fixed; the result was that the loop only\n    // needs to be run once and the first degree quad hashes will never change.\n    // 5.1-5.2 are skipped; first degree quad hashes are generated just once\n    // for all non-normalized blank nodes.\n\n    // 5.3) For each blank node identifier identifier in non-normalized\n    // identifiers:\n    const hashToBlankNodes = new Map();\n    const nonNormalized = [...this.blankNodeInfo.keys()];\n    let i = 0;\n    for(const id of nonNormalized) {\n      // Note: batch hashing first degree quads 100 at a time\n      if(++i % 100 === 0) {\n        await this._yield();\n      }\n      // steps 5.3.1 and 5.3.2:\n      await this._hashAndTrackBlankNode({id, hashToBlankNodes});\n    }\n\n    // 5.4) For each hash to identifier list mapping in hash to blank\n    // nodes map, lexicographically-sorted by hash:\n    const hashes = [...hashToBlankNodes.keys()].sort();\n    // optimize away second sort, gather non-unique hashes in order as we go\n    const nonUnique = [];\n    for(const hash of hashes) {\n      // 5.4.1) If the length of identifier list is greater than 1,\n      // continue to the next mapping.\n      const idList = hashToBlankNodes.get(hash);\n      if(idList.length > 1) {\n        nonUnique.push(idList);\n        continue;\n      }\n\n      // 5.4.2) Use the Issue Identifier algorithm, passing canonical\n      // issuer and the single blank node identifier in identifier\n      // list, identifier, to issue a canonical replacement identifier\n      // for identifier.\n      const id = idList[0];\n      this.canonicalIssuer.getId(id);\n\n      // Note: These steps are skipped, optimized away since the loop\n      // only needs to be run once.\n      // 5.4.3) Remove identifier from non-normalized identifiers.\n      // 5.4.4) Remove hash from the hash to blank nodes map.\n      // 5.4.5) Set simple to true.\n    }\n\n    // 6) For each hash to identifier list mapping in hash to blank nodes map,\n    // lexicographically-sorted by hash:\n    // Note: sort optimized away, use `nonUnique`.\n    for(const idList of nonUnique) {\n      // 6.1) Create hash path list where each item will be a result of\n      // running the Hash N-Degree Quads algorithm.\n      const hashPathList = [];\n\n      // 6.2) For each blank node identifier identifier in identifier list:\n      for(const id of idList) {\n        // 6.2.1) If a canonical identifier has already been issued for\n        // identifier, continue to the next identifier.\n        if(this.canonicalIssuer.hasId(id)) {\n          continue;\n        }\n\n        // 6.2.2) Create temporary issuer, an identifier issuer\n        // initialized with the prefix _:b.\n        const issuer = new IdentifierIssuer('_:b');\n\n        // 6.2.3) Use the Issue Identifier algorithm, passing temporary\n        // issuer and identifier, to issue a new temporary blank node\n        // identifier for identifier.\n        issuer.getId(id);\n\n        // 6.2.4) Run the Hash N-Degree Quads algorithm, passing\n        // temporary issuer, and append the result to the hash path list.\n        const result = await this.hashNDegreeQuads(id, issuer);\n        hashPathList.push(result);\n      }\n\n      // 6.3) For each result in the hash path list,\n      // lexicographically-sorted by the hash in result:\n      hashPathList.sort(_stringHashCompare);\n      for(const result of hashPathList) {\n        // 6.3.1) For each blank node identifier, existing identifier,\n        // that was issued a temporary identifier by identifier issuer\n        // in result, issue a canonical identifier, in the same order,\n        // using the Issue Identifier algorithm, passing canonical\n        // issuer and existing identifier.\n        const oldIds = result.issuer.getOldIds();\n        for(const id of oldIds) {\n          this.canonicalIssuer.getId(id);\n        }\n      }\n    }\n\n    /* Note: At this point all blank nodes in the set of RDF quads have been\n    assigned canonical identifiers, which have been stored in the canonical\n    issuer. Here each quad is updated by assigning each of its blank nodes\n    its new identifier. */\n\n    // 7) For each quad, quad, in input dataset:\n    const normalized = [];\n    for(const quad of this.quads) {\n      // 7.1) Create a copy, quad copy, of quad and replace any existing\n      // blank node identifiers using the canonical identifiers\n      // previously issued by canonical issuer.\n      // Note: We optimize with shallow copies here.\n      const q = {...quad};\n      q.subject = this._useCanonicalId({component: q.subject});\n      q.object = this._useCanonicalId({component: q.object});\n      q.graph = this._useCanonicalId({component: q.graph});\n      // 7.2) Add quad copy to the normalized dataset.\n      normalized.push(NQuads.serializeQuad(q));\n    }\n\n    // sort normalized output\n    normalized.sort();\n\n    // 8) Return the normalized dataset.\n    return normalized.join('');\n  }\n\n  // 4.6) Hash First Degree Quads\n  async hashFirstDegreeQuads(id) {\n    // 1) Initialize nquads to an empty list. It will be used to store quads in\n    // N-Quads format.\n    const nquads = [];\n\n    // 2) Get the list of quads `quads` associated with the reference blank node\n    // identifier in the blank node to quads map.\n    const info = this.blankNodeInfo.get(id);\n    const quads = info.quads;\n\n    // 3) For each quad `quad` in `quads`:\n    for(const quad of quads) {\n      // 3.1) Serialize the quad in N-Quads format with the following special\n      // rule:\n\n      // 3.1.1) If any component in quad is an blank node, then serialize it\n      // using a special identifier as follows:\n      const copy = {\n        subject: null, predicate: quad.predicate, object: null, graph: null\n      };\n      // 3.1.2) If the blank node's existing blank node identifier matches\n      // the reference blank node identifier then use the blank node\n      // identifier _:a, otherwise, use the blank node identifier _:z.\n      copy.subject = this.modifyFirstDegreeComponent(\n        id, quad.subject, 'subject');\n      copy.object = this.modifyFirstDegreeComponent(\n        id, quad.object, 'object');\n      copy.graph = this.modifyFirstDegreeComponent(\n        id, quad.graph, 'graph');\n      nquads.push(NQuads.serializeQuad(copy));\n    }\n\n    // 4) Sort nquads in lexicographical order.\n    nquads.sort();\n\n    // 5) Return the hash that results from passing the sorted, joined nquads\n    // through the hash algorithm.\n    const md = new MessageDigest(this.hashAlgorithm);\n    for(const nquad of nquads) {\n      md.update(nquad);\n    }\n    info.hash = await md.digest();\n    return info.hash;\n  }\n\n  // 4.7) Hash Related Blank Node\n  async hashRelatedBlankNode(related, quad, issuer, position) {\n    // 1) Set the identifier to use for related, preferring first the canonical\n    // identifier for related if issued, second the identifier issued by issuer\n    // if issued, and last, if necessary, the result of the Hash First Degree\n    // Quads algorithm, passing related.\n    let id;\n    if(this.canonicalIssuer.hasId(related)) {\n      id = this.canonicalIssuer.getId(related);\n    } else if(issuer.hasId(related)) {\n      id = issuer.getId(related);\n    } else {\n      id = this.blankNodeInfo.get(related).hash;\n    }\n\n    // 2) Initialize a string input to the value of position.\n    // Note: We use a hash object instead.\n    const md = new MessageDigest(this.hashAlgorithm);\n    md.update(position);\n\n    // 3) If position is not g, append <, the value of the predicate in quad,\n    // and > to input.\n    if(position !== 'g') {\n      md.update(this.getRelatedPredicate(quad));\n    }\n\n    // 4) Append identifier to input.\n    md.update(id);\n\n    // 5) Return the hash that results from passing input through the hash\n    // algorithm.\n    return md.digest();\n  }\n\n  // 4.8) Hash N-Degree Quads\n  async hashNDegreeQuads(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    // Note: 2) and 3) handled within `createHashToRelated`\n    const md = new MessageDigest(this.hashAlgorithm);\n    const hashToRelated = await this.createHashToRelated(id, issuer);\n\n    // 4) Create an empty string, data to hash.\n    // Note: We created a hash object `md` above instead.\n\n    // 5) For each related hash to blank node list mapping in hash to related\n    // blank nodes map, sorted lexicographically by related hash:\n    const hashes = [...hashToRelated.keys()].sort();\n    for(const hash of hashes) {\n      // 5.1) Append the related hash to the data to hash.\n      md.update(hash);\n\n      // 5.2) Create a string chosen path.\n      let chosenPath = '';\n\n      // 5.3) Create an unset chosen issuer variable.\n      let chosenIssuer;\n\n      // 5.4) For each permutation of blank node list:\n      const permuter = new Permuter(hashToRelated.get(hash));\n      let i = 0;\n      while(permuter.hasNext()) {\n        const permutation = permuter.next();\n        // Note: batch permutations 3 at a time\n        if(++i % 3 === 0) {\n          await this._yield();\n        }\n\n        // 5.4.1) Create a copy of issuer, issuer copy.\n        let issuerCopy = issuer.clone();\n\n        // 5.4.2) Create a string path.\n        let path = '';\n\n        // 5.4.3) Create a recursion list, to store blank node identifiers\n        // that must be recursively processed by this algorithm.\n        const recursionList = [];\n\n        // 5.4.4) For each related in permutation:\n        let nextPermutation = false;\n        for(const related of permutation) {\n          // 5.4.4.1) If a canonical identifier has been issued for\n          // related, append it to path.\n          if(this.canonicalIssuer.hasId(related)) {\n            path += this.canonicalIssuer.getId(related);\n          } else {\n            // 5.4.4.2) Otherwise:\n            // 5.4.4.2.1) If issuer copy has not issued an identifier for\n            // related, append related to recursion list.\n            if(!issuerCopy.hasId(related)) {\n              recursionList.push(related);\n            }\n            // 5.4.4.2.2) Use the Issue Identifier algorithm, passing\n            // issuer copy and related and append the result to path.\n            path += issuerCopy.getId(related);\n          }\n\n          // 5.4.4.3) If chosen path is not empty and the length of path\n          // is greater than or equal to the length of chosen path and\n          // path is lexicographically greater than chosen path, then\n          // skip to the next permutation.\n          // Note: Comparing path length to chosen path length can be optimized\n          // away; only compare lexicographically.\n          if(chosenPath.length !== 0 && path > chosenPath) {\n            nextPermutation = true;\n            break;\n          }\n        }\n\n        if(nextPermutation) {\n          continue;\n        }\n\n        // 5.4.5) For each related in recursion list:\n        for(const related of recursionList) {\n          // 5.4.5.1) Set result to the result of recursively executing\n          // the Hash N-Degree Quads algorithm, passing related for\n          // identifier and issuer copy for path identifier issuer.\n          const result = await this.hashNDegreeQuads(related, issuerCopy);\n\n          // 5.4.5.2) Use the Issue Identifier algorithm, passing issuer\n          // copy and related and append the result to path.\n          path += issuerCopy.getId(related);\n\n          // 5.4.5.3) Append <, the hash in result, and > to path.\n          path += `<${result.hash}>`;\n\n          // 5.4.5.4) Set issuer copy to the identifier issuer in\n          // result.\n          issuerCopy = result.issuer;\n\n          // 5.4.5.5) If chosen path is not empty and the length of path\n          // is greater than or equal to the length of chosen path and\n          // path is lexicographically greater than chosen path, then\n          // skip to the next permutation.\n          // Note: Comparing path length to chosen path length can be optimized\n          // away; only compare lexicographically.\n          if(chosenPath.length !== 0 && path > chosenPath) {\n            nextPermutation = true;\n            break;\n          }\n        }\n\n        if(nextPermutation) {\n          continue;\n        }\n\n        // 5.4.6) If chosen path is empty or path is lexicographically\n        // less than chosen path, set chosen path to path and chosen\n        // issuer to issuer copy.\n        if(chosenPath.length === 0 || path < chosenPath) {\n          chosenPath = path;\n          chosenIssuer = issuerCopy;\n        }\n      }\n\n      // 5.5) Append chosen path to data to hash.\n      md.update(chosenPath);\n\n      // 5.6) Replace issuer, by reference, with chosen issuer.\n      issuer = chosenIssuer;\n    }\n\n    // 6) Return issuer and the hash that results from passing data to hash\n    // through the hash algorithm.\n    return {hash: await md.digest(), issuer};\n  }\n\n  // helper for modifying component during Hash First Degree Quads\n  modifyFirstDegreeComponent(id, component) {\n    if(component.termType !== 'BlankNode') {\n      return component;\n    }\n    /* Note: A mistake in the URDNA2015 spec that made its way into\n    implementations (and therefore must stay to avoid interop breakage)\n    resulted in an assigned canonical ID, if available for\n    `component.value`, not being used in place of `_:a`/`_:z`, so\n    we don't use it here. */\n    return {\n      termType: 'BlankNode',\n      value: component.value === id ? '_:a' : '_:z'\n    };\n  }\n\n  // helper for getting a related predicate\n  getRelatedPredicate(quad) {\n    return `<${quad.predicate.value}>`;\n  }\n\n  // helper for creating hash to related blank nodes map\n  async createHashToRelated(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    const hashToRelated = new Map();\n\n    // 2) Get a reference, quads, to the list of quads in the blank node to\n    // quads map for the key identifier.\n    const quads = this.blankNodeInfo.get(id).quads;\n\n    // 3) For each quad in quads:\n    let i = 0;\n    for(const quad of quads) {\n      // Note: batch hashing related blank node quads 100 at a time\n      if(++i % 100 === 0) {\n        await this._yield();\n      }\n      // 3.1) For each component in quad, if component is the subject, object,\n      // and graph name and it is a blank node that is not identified by\n      // identifier:\n      // steps 3.1.1 and 3.1.2 occur in helpers:\n      await Promise.all([\n        this._addRelatedBlankNodeHash({\n          quad, component: quad.subject, position: 's',\n          id, issuer, hashToRelated\n        }),\n        this._addRelatedBlankNodeHash({\n          quad, component: quad.object, position: 'o',\n          id, issuer, hashToRelated\n        }),\n        this._addRelatedBlankNodeHash({\n          quad, component: quad.graph, position: 'g',\n          id, issuer, hashToRelated\n        })\n      ]);\n    }\n\n    return hashToRelated;\n  }\n\n  async _hashAndTrackBlankNode({id, hashToBlankNodes}) {\n    // 5.3.1) Create a hash, hash, according to the Hash First Degree\n    // Quads algorithm.\n    const hash = await this.hashFirstDegreeQuads(id);\n\n    // 5.3.2) Add hash and identifier to hash to blank nodes map,\n    // creating a new entry if necessary.\n    const idList = hashToBlankNodes.get(hash);\n    if(!idList) {\n      hashToBlankNodes.set(hash, [id]);\n    } else {\n      idList.push(id);\n    }\n  }\n\n  _addBlankNodeQuadInfo({quad, component}) {\n    if(component.termType !== 'BlankNode') {\n      return;\n    }\n    const id = component.value;\n    const info = this.blankNodeInfo.get(id);\n    if(info) {\n      info.quads.add(quad);\n    } else {\n      this.blankNodeInfo.set(id, {quads: new Set([quad]), hash: null});\n    }\n  }\n\n  async _addRelatedBlankNodeHash(\n    {quad, component, position, id, issuer, hashToRelated}) {\n    if(!(component.termType === 'BlankNode' && component.value !== id)) {\n      return;\n    }\n    // 3.1.1) Set hash to the result of the Hash Related Blank Node\n    // algorithm, passing the blank node identifier for component as\n    // related, quad, path identifier issuer as issuer, and position as\n    // either s, o, or g based on whether component is a subject, object,\n    // graph name, respectively.\n    const related = component.value;\n    const hash = await this.hashRelatedBlankNode(\n      related, quad, issuer, position);\n\n    // 3.1.2) Add a mapping of hash to the blank node identifier for\n    // component to hash to related blank nodes map, adding an entry as\n    // necessary.\n    const entries = hashToRelated.get(hash);\n    if(entries) {\n      entries.push(related);\n    } else {\n      hashToRelated.set(hash, [related]);\n    }\n  }\n\n  _useCanonicalId({component}) {\n    if(component.termType === 'BlankNode' &&\n      !component.value.startsWith(this.canonicalIssuer.prefix)) {\n      return {\n        termType: 'BlankNode',\n        value: this.canonicalIssuer.getId(component.value)\n      };\n    }\n    return component;\n  }\n\n  async _yield() {\n    return new Promise(resolve => setImmediate(resolve));\n  }\n};\n\nfunction _stringHashCompare(a, b) {\n  return a.hash < b.hash ? -1 : a.hash > b.hash ? 1 : 0;\n}\n","(function (global, undefined) {\n    \"use strict\";\n\n    if (global.setImmediate) {\n        return;\n    }\n\n    var nextHandle = 1; // Spec says greater than zero\n    var tasksByHandle = {};\n    var currentlyRunningATask = false;\n    var doc = global.document;\n    var registerImmediate;\n\n    function setImmediate(callback) {\n      // Callback can either be a function or a string\n      if (typeof callback !== \"function\") {\n        callback = new Function(\"\" + callback);\n      }\n      // Copy function arguments\n      var args = new Array(arguments.length - 1);\n      for (var i = 0; i < args.length; i++) {\n          args[i] = arguments[i + 1];\n      }\n      // Store and register the task\n      var task = { callback: callback, args: args };\n      tasksByHandle[nextHandle] = task;\n      registerImmediate(nextHandle);\n      return nextHandle++;\n    }\n\n    function clearImmediate(handle) {\n        delete tasksByHandle[handle];\n    }\n\n    function run(task) {\n        var callback = task.callback;\n        var args = task.args;\n        switch (args.length) {\n        case 0:\n            callback();\n            break;\n        case 1:\n            callback(args[0]);\n            break;\n        case 2:\n            callback(args[0], args[1]);\n            break;\n        case 3:\n            callback(args[0], args[1], args[2]);\n            break;\n        default:\n            callback.apply(undefined, args);\n            break;\n        }\n    }\n\n    function runIfPresent(handle) {\n        // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n        // So if we're currently running a task, we'll need to delay this invocation.\n        if (currentlyRunningATask) {\n            // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n            // \"too much recursion\" error.\n            setTimeout(runIfPresent, 0, handle);\n        } else {\n            var task = tasksByHandle[handle];\n            if (task) {\n                currentlyRunningATask = true;\n                try {\n                    run(task);\n                } finally {\n                    clearImmediate(handle);\n                    currentlyRunningATask = false;\n                }\n            }\n        }\n    }\n\n    function installNextTickImplementation() {\n        registerImmediate = function(handle) {\n            process.nextTick(function () { runIfPresent(handle); });\n        };\n    }\n\n    function canUsePostMessage() {\n        // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n        // where `global.postMessage` means something completely different and can't be used for this purpose.\n        if (global.postMessage && !global.importScripts) {\n            var postMessageIsAsynchronous = true;\n            var oldOnMessage = global.onmessage;\n            global.onmessage = function() {\n                postMessageIsAsynchronous = false;\n            };\n            global.postMessage(\"\", \"*\");\n            global.onmessage = oldOnMessage;\n            return postMessageIsAsynchronous;\n        }\n    }\n\n    function installPostMessageImplementation() {\n        // Installs an event handler on `global` for the `message` event: see\n        // * https://developer.mozilla.org/en/DOM/window.postMessage\n        // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n        var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n        var onGlobalMessage = function(event) {\n            if (event.source === global &&\n                typeof event.data === \"string\" &&\n                event.data.indexOf(messagePrefix) === 0) {\n                runIfPresent(+event.data.slice(messagePrefix.length));\n            }\n        };\n\n        if (global.addEventListener) {\n            global.addEventListener(\"message\", onGlobalMessage, false);\n        } else {\n            global.attachEvent(\"onmessage\", onGlobalMessage);\n        }\n\n        registerImmediate = function(handle) {\n            global.postMessage(messagePrefix + handle, \"*\");\n        };\n    }\n\n    function installMessageChannelImplementation() {\n        var channel = new MessageChannel();\n        channel.port1.onmessage = function(event) {\n            var handle = event.data;\n            runIfPresent(handle);\n        };\n\n        registerImmediate = function(handle) {\n            channel.port2.postMessage(handle);\n        };\n    }\n\n    function installReadyStateChangeImplementation() {\n        var html = doc.documentElement;\n        registerImmediate = function(handle) {\n            // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n            // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n            var script = doc.createElement(\"script\");\n            script.onreadystatechange = function () {\n                runIfPresent(handle);\n                script.onreadystatechange = null;\n                html.removeChild(script);\n                script = null;\n            };\n            html.appendChild(script);\n        };\n    }\n\n    function installSetTimeoutImplementation() {\n        registerImmediate = function(handle) {\n            setTimeout(runIfPresent, 0, handle);\n        };\n    }\n\n    // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.\n    var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n    attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n    // Don't get fooled by e.g. browserify environments.\n    if ({}.toString.call(global.process) === \"[object process]\") {\n        // For Node.js before 0.9\n        installNextTickImplementation();\n\n    } else if (canUsePostMessage()) {\n        // For non-IE10 modern browsers\n        installPostMessageImplementation();\n\n    } else if (global.MessageChannel) {\n        // For web workers, where supported\n        installMessageChannelImplementation();\n\n    } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n        // For IE 6–8\n        installReadyStateChangeImplementation();\n\n    } else {\n        // For older browsers\n        installSetTimeoutImplementation();\n    }\n\n    attachTo.setImmediate = setImmediate;\n    attachTo.clearImmediate = clearImmediate;\n}(typeof self === \"undefined\" ? typeof global === \"undefined\" ? this : global : self));\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nrequire('setimmediate');\n\nconst crypto = self.crypto || self.msCrypto;\n\n// TODO: synchronous version no longer supported in browser\n\nmodule.exports = class MessageDigest {\n  /**\n   * Creates a new MessageDigest.\n   *\n   * @param algorithm the algorithm to use.\n   */\n  constructor(algorithm) {\n    // check if crypto.subtle is available\n    // check is here rather than top-level to only fail if class is used\n    if(!(crypto && crypto.subtle)) {\n      throw new Error('crypto.subtle not found.');\n    }\n    if(algorithm === 'sha256') {\n      this.algorithm = {name: 'SHA-256'};\n    } else if(algorithm === 'sha1') {\n      this.algorithm = {name: 'SHA-1'};\n    } else {\n      throw new Error(`Unsupport algorithm \"${algorithm}\".`);\n    }\n    this._content = '';\n  }\n\n  update(msg) {\n    this._content += msg;\n  }\n\n  async digest() {\n    const data = new TextEncoder().encode(this._content);\n    const buffer = new Uint8Array(\n      await crypto.subtle.digest(this.algorithm, data));\n    // return digest in hex\n    let hex = '';\n    for(let i = 0; i < buffer.length; ++i) {\n      hex += buffer[i].toString(16).padStart(2, '0');\n    }\n    return hex;\n  }\n};\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\n// TODO: convert to ES6 iterable?\n\nmodule.exports = class Permuter {\n  /**\n   * A Permuter iterates over all possible permutations of the given array\n   * of elements.\n   *\n   * @param list the array of elements to iterate over.\n   */\n  constructor(list) {\n    // original array\n    this.current = list.sort();\n    // indicates whether there are more permutations\n    this.done = false;\n    // directional info for permutation algorithm\n    this.dir = new Map();\n    for(let i = 0; i < list.length; ++i) {\n      this.dir.set(list[i], true);\n    }\n  }\n\n  /**\n   * Returns true if there is another permutation.\n   *\n   * @return true if there is another permutation, false if not.\n   */\n  hasNext() {\n    return !this.done;\n  }\n\n  /**\n   * Gets the next permutation. Call hasNext() to ensure there is another one\n   * first.\n   *\n   * @return the next permutation.\n   */\n  next() {\n    // copy current permutation to return it\n    const {current, dir} = this;\n    const rval = current.slice();\n\n    /* Calculate the next permutation using the Steinhaus-Johnson-Trotter\n     permutation algorithm. */\n\n    // get largest mobile element k\n    // (mobile: element is greater than the one it is looking at)\n    let k = null;\n    let pos = 0;\n    const length = current.length;\n    for(let i = 0; i < length; ++i) {\n      const element = current[i];\n      const left = dir.get(element);\n      if((k === null || element > k) &&\n        ((left && i > 0 && element > current[i - 1]) ||\n        (!left && i < (length - 1) && element > current[i + 1]))) {\n        k = element;\n        pos = i;\n      }\n    }\n\n    // no more permutations\n    if(k === null) {\n      this.done = true;\n    } else {\n      // swap k and the element it is looking at\n      const swap = dir.get(k) ? pos - 1 : pos + 1;\n      current[pos] = current[swap];\n      current[swap] = k;\n\n      // reverse the direction of all elements larger than k\n      for(const element of current) {\n        if(element > k) {\n          dir.set(element, !dir.get(element));\n        }\n      }\n    }\n\n    return rval;\n  }\n};\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst IdentifierIssuer = require('./IdentifierIssuer');\nconst MessageDigest = require('./MessageDigest');\nconst Permuter = require('./Permuter');\nconst NQuads = require('./NQuads');\n\nmodule.exports = class URDNA2015Sync {\n  constructor() {\n    this.name = 'URDNA2015';\n    this.blankNodeInfo = new Map();\n    this.canonicalIssuer = new IdentifierIssuer('_:c14n');\n    this.hashAlgorithm = 'sha256';\n    this.quads = null;\n  }\n\n  // 4.4) Normalization Algorithm\n  main(dataset) {\n    this.quads = dataset;\n\n    // 1) Create the normalization state.\n    // 2) For every quad in input dataset:\n    for(const quad of dataset) {\n      // 2.1) For each blank node that occurs in the quad, add a reference\n      // to the quad using the blank node identifier in the blank node to\n      // quads map, creating a new entry if necessary.\n      this._addBlankNodeQuadInfo({quad, component: quad.subject});\n      this._addBlankNodeQuadInfo({quad, component: quad.object});\n      this._addBlankNodeQuadInfo({quad, component: quad.graph});\n    }\n\n    // 3) Create a list of non-normalized blank node identifiers\n    // non-normalized identifiers and populate it using the keys from the\n    // blank node to quads map.\n    // Note: We use a map here and it was generated during step 2.\n\n    // 4) `simple` flag is skipped -- loop is optimized away. This optimization\n    // is permitted because there was a typo in the hash first degree quads\n    // algorithm in the URDNA2015 spec that was implemented widely making it\n    // such that it could not be fixed; the result was that the loop only\n    // needs to be run once and the first degree quad hashes will never change.\n    // 5.1-5.2 are skipped; first degree quad hashes are generated just once\n    // for all non-normalized blank nodes.\n\n    // 5.3) For each blank node identifier identifier in non-normalized\n    // identifiers:\n    const hashToBlankNodes = new Map();\n    const nonNormalized = [...this.blankNodeInfo.keys()];\n    for(const id of nonNormalized) {\n      // steps 5.3.1 and 5.3.2:\n      this._hashAndTrackBlankNode({id, hashToBlankNodes});\n    }\n\n    // 5.4) For each hash to identifier list mapping in hash to blank\n    // nodes map, lexicographically-sorted by hash:\n    const hashes = [...hashToBlankNodes.keys()].sort();\n    // optimize away second sort, gather non-unique hashes in order as we go\n    const nonUnique = [];\n    for(const hash of hashes) {\n      // 5.4.1) If the length of identifier list is greater than 1,\n      // continue to the next mapping.\n      const idList = hashToBlankNodes.get(hash);\n      if(idList.length > 1) {\n        nonUnique.push(idList);\n        continue;\n      }\n\n      // 5.4.2) Use the Issue Identifier algorithm, passing canonical\n      // issuer and the single blank node identifier in identifier\n      // list, identifier, to issue a canonical replacement identifier\n      // for identifier.\n      const id = idList[0];\n      this.canonicalIssuer.getId(id);\n\n      // Note: These steps are skipped, optimized away since the loop\n      // only needs to be run once.\n      // 5.4.3) Remove identifier from non-normalized identifiers.\n      // 5.4.4) Remove hash from the hash to blank nodes map.\n      // 5.4.5) Set simple to true.\n    }\n\n    // 6) For each hash to identifier list mapping in hash to blank nodes map,\n    // lexicographically-sorted by hash:\n    // Note: sort optimized away, use `nonUnique`.\n    for(const idList of nonUnique) {\n      // 6.1) Create hash path list where each item will be a result of\n      // running the Hash N-Degree Quads algorithm.\n      const hashPathList = [];\n\n      // 6.2) For each blank node identifier identifier in identifier list:\n      for(const id of idList) {\n        // 6.2.1) If a canonical identifier has already been issued for\n        // identifier, continue to the next identifier.\n        if(this.canonicalIssuer.hasId(id)) {\n          continue;\n        }\n\n        // 6.2.2) Create temporary issuer, an identifier issuer\n        // initialized with the prefix _:b.\n        const issuer = new IdentifierIssuer('_:b');\n\n        // 6.2.3) Use the Issue Identifier algorithm, passing temporary\n        // issuer and identifier, to issue a new temporary blank node\n        // identifier for identifier.\n        issuer.getId(id);\n\n        // 6.2.4) Run the Hash N-Degree Quads algorithm, passing\n        // temporary issuer, and append the result to the hash path list.\n        const result = this.hashNDegreeQuads(id, issuer);\n        hashPathList.push(result);\n      }\n\n      // 6.3) For each result in the hash path list,\n      // lexicographically-sorted by the hash in result:\n      hashPathList.sort(_stringHashCompare);\n      for(const result of hashPathList) {\n        // 6.3.1) For each blank node identifier, existing identifier,\n        // that was issued a temporary identifier by identifier issuer\n        // in result, issue a canonical identifier, in the same order,\n        // using the Issue Identifier algorithm, passing canonical\n        // issuer and existing identifier.\n        const oldIds = result.issuer.getOldIds();\n        for(const id of oldIds) {\n          this.canonicalIssuer.getId(id);\n        }\n      }\n    }\n\n    /* Note: At this point all blank nodes in the set of RDF quads have been\n    assigned canonical identifiers, which have been stored in the canonical\n    issuer. Here each quad is updated by assigning each of its blank nodes\n    its new identifier. */\n\n    // 7) For each quad, quad, in input dataset:\n    const normalized = [];\n    for(const quad of this.quads) {\n      // 7.1) Create a copy, quad copy, of quad and replace any existing\n      // blank node identifiers using the canonical identifiers\n      // previously issued by canonical issuer.\n      // Note: We optimize with shallow copies here.\n      const q = {...quad};\n      q.subject = this._useCanonicalId({component: q.subject});\n      q.object = this._useCanonicalId({component: q.object});\n      q.graph = this._useCanonicalId({component: q.graph});\n      // 7.2) Add quad copy to the normalized dataset.\n      normalized.push(NQuads.serializeQuad(q));\n    }\n\n    // sort normalized output\n    normalized.sort();\n\n    // 8) Return the normalized dataset.\n    return normalized.join('');\n  }\n\n  // 4.6) Hash First Degree Quads\n  hashFirstDegreeQuads(id) {\n    // 1) Initialize nquads to an empty list. It will be used to store quads in\n    // N-Quads format.\n    const nquads = [];\n\n    // 2) Get the list of quads `quads` associated with the reference blank node\n    // identifier in the blank node to quads map.\n    const info = this.blankNodeInfo.get(id);\n    const quads = info.quads;\n\n    // 3) For each quad `quad` in `quads`:\n    for(const quad of quads) {\n      // 3.1) Serialize the quad in N-Quads format with the following special\n      // rule:\n\n      // 3.1.1) If any component in quad is an blank node, then serialize it\n      // using a special identifier as follows:\n      const copy = {\n        subject: null, predicate: quad.predicate, object: null, graph: null\n      };\n      // 3.1.2) If the blank node's existing blank node identifier matches\n      // the reference blank node identifier then use the blank node\n      // identifier _:a, otherwise, use the blank node identifier _:z.\n      copy.subject = this.modifyFirstDegreeComponent(\n        id, quad.subject, 'subject');\n      copy.object = this.modifyFirstDegreeComponent(\n        id, quad.object, 'object');\n      copy.graph = this.modifyFirstDegreeComponent(\n        id, quad.graph, 'graph');\n      nquads.push(NQuads.serializeQuad(copy));\n    }\n\n    // 4) Sort nquads in lexicographical order.\n    nquads.sort();\n\n    // 5) Return the hash that results from passing the sorted, joined nquads\n    // through the hash algorithm.\n    const md = new MessageDigest(this.hashAlgorithm);\n    for(const nquad of nquads) {\n      md.update(nquad);\n    }\n    info.hash = md.digest();\n    return info.hash;\n  }\n\n  // 4.7) Hash Related Blank Node\n  hashRelatedBlankNode(related, quad, issuer, position) {\n    // 1) Set the identifier to use for related, preferring first the canonical\n    // identifier for related if issued, second the identifier issued by issuer\n    // if issued, and last, if necessary, the result of the Hash First Degree\n    // Quads algorithm, passing related.\n    let id;\n    if(this.canonicalIssuer.hasId(related)) {\n      id = this.canonicalIssuer.getId(related);\n    } else if(issuer.hasId(related)) {\n      id = issuer.getId(related);\n    } else {\n      id = this.blankNodeInfo.get(related).hash;\n    }\n\n    // 2) Initialize a string input to the value of position.\n    // Note: We use a hash object instead.\n    const md = new MessageDigest(this.hashAlgorithm);\n    md.update(position);\n\n    // 3) If position is not g, append <, the value of the predicate in quad,\n    // and > to input.\n    if(position !== 'g') {\n      md.update(this.getRelatedPredicate(quad));\n    }\n\n    // 4) Append identifier to input.\n    md.update(id);\n\n    // 5) Return the hash that results from passing input through the hash\n    // algorithm.\n    return md.digest();\n  }\n\n  // 4.8) Hash N-Degree Quads\n  hashNDegreeQuads(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    // Note: 2) and 3) handled within `createHashToRelated`\n    const md = new MessageDigest(this.hashAlgorithm);\n    const hashToRelated = this.createHashToRelated(id, issuer);\n\n    // 4) Create an empty string, data to hash.\n    // Note: We created a hash object `md` above instead.\n\n    // 5) For each related hash to blank node list mapping in hash to related\n    // blank nodes map, sorted lexicographically by related hash:\n    const hashes = [...hashToRelated.keys()].sort();\n    for(const hash of hashes) {\n      // 5.1) Append the related hash to the data to hash.\n      md.update(hash);\n\n      // 5.2) Create a string chosen path.\n      let chosenPath = '';\n\n      // 5.3) Create an unset chosen issuer variable.\n      let chosenIssuer;\n\n      // 5.4) For each permutation of blank node list:\n      const permuter = new Permuter(hashToRelated.get(hash));\n      while(permuter.hasNext()) {\n        const permutation = permuter.next();\n\n        // 5.4.1) Create a copy of issuer, issuer copy.\n        let issuerCopy = issuer.clone();\n\n        // 5.4.2) Create a string path.\n        let path = '';\n\n        // 5.4.3) Create a recursion list, to store blank node identifiers\n        // that must be recursively processed by this algorithm.\n        const recursionList = [];\n\n        // 5.4.4) For each related in permutation:\n        let nextPermutation = false;\n        for(const related of permutation) {\n          // 5.4.4.1) If a canonical identifier has been issued for\n          // related, append it to path.\n          if(this.canonicalIssuer.hasId(related)) {\n            path += this.canonicalIssuer.getId(related);\n          } else {\n            // 5.4.4.2) Otherwise:\n            // 5.4.4.2.1) If issuer copy has not issued an identifier for\n            // related, append related to recursion list.\n            if(!issuerCopy.hasId(related)) {\n              recursionList.push(related);\n            }\n            // 5.4.4.2.2) Use the Issue Identifier algorithm, passing\n            // issuer copy and related and append the result to path.\n            path += issuerCopy.getId(related);\n          }\n\n          // 5.4.4.3) If chosen path is not empty and the length of path\n          // is greater than or equal to the length of chosen path and\n          // path is lexicographically greater than chosen path, then\n          // skip to the next permutation.\n          // Note: Comparing path length to chosen path length can be optimized\n          // away; only compare lexicographically.\n          if(chosenPath.length !== 0 && path > chosenPath) {\n            nextPermutation = true;\n            break;\n          }\n        }\n\n        if(nextPermutation) {\n          continue;\n        }\n\n        // 5.4.5) For each related in recursion list:\n        for(const related of recursionList) {\n          // 5.4.5.1) Set result to the result of recursively executing\n          // the Hash N-Degree Quads algorithm, passing related for\n          // identifier and issuer copy for path identifier issuer.\n          const result = this.hashNDegreeQuads(related, issuerCopy);\n\n          // 5.4.5.2) Use the Issue Identifier algorithm, passing issuer\n          // copy and related and append the result to path.\n          path += issuerCopy.getId(related);\n\n          // 5.4.5.3) Append <, the hash in result, and > to path.\n          path += `<${result.hash}>`;\n\n          // 5.4.5.4) Set issuer copy to the identifier issuer in\n          // result.\n          issuerCopy = result.issuer;\n\n          // 5.4.5.5) If chosen path is not empty and the length of path\n          // is greater than or equal to the length of chosen path and\n          // path is lexicographically greater than chosen path, then\n          // skip to the next permutation.\n          // Note: Comparing path length to chosen path length can be optimized\n          // away; only compare lexicographically.\n          if(chosenPath.length !== 0 && path > chosenPath) {\n            nextPermutation = true;\n            break;\n          }\n        }\n\n        if(nextPermutation) {\n          continue;\n        }\n\n        // 5.4.6) If chosen path is empty or path is lexicographically\n        // less than chosen path, set chosen path to path and chosen\n        // issuer to issuer copy.\n        if(chosenPath.length === 0 || path < chosenPath) {\n          chosenPath = path;\n          chosenIssuer = issuerCopy;\n        }\n      }\n\n      // 5.5) Append chosen path to data to hash.\n      md.update(chosenPath);\n\n      // 5.6) Replace issuer, by reference, with chosen issuer.\n      issuer = chosenIssuer;\n    }\n\n    // 6) Return issuer and the hash that results from passing data to hash\n    // through the hash algorithm.\n    return {hash: md.digest(), issuer};\n  }\n\n  // helper for modifying component during Hash First Degree Quads\n  modifyFirstDegreeComponent(id, component) {\n    if(component.termType !== 'BlankNode') {\n      return component;\n    }\n    /* Note: A mistake in the URDNA2015 spec that made its way into\n    implementations (and therefore must stay to avoid interop breakage)\n    resulted in an assigned canonical ID, if available for\n    `component.value`, not being used in place of `_:a`/`_:z`, so\n    we don't use it here. */\n    return {\n      termType: 'BlankNode',\n      value: component.value === id ? '_:a' : '_:z'\n    };\n  }\n\n  // helper for getting a related predicate\n  getRelatedPredicate(quad) {\n    return `<${quad.predicate.value}>`;\n  }\n\n  // helper for creating hash to related blank nodes map\n  createHashToRelated(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    const hashToRelated = new Map();\n\n    // 2) Get a reference, quads, to the list of quads in the blank node to\n    // quads map for the key identifier.\n    const quads = this.blankNodeInfo.get(id).quads;\n\n    // 3) For each quad in quads:\n    for(const quad of quads) {\n      // 3.1) For each component in quad, if component is the subject, object,\n      // or graph name and it is a blank node that is not identified by\n      // identifier:\n      // steps 3.1.1 and 3.1.2 occur in helpers:\n      this._addRelatedBlankNodeHash({\n        quad, component: quad.subject, position: 's',\n        id, issuer, hashToRelated\n      });\n      this._addRelatedBlankNodeHash({\n        quad, component: quad.object, position: 'o',\n        id, issuer, hashToRelated\n      });\n      this._addRelatedBlankNodeHash({\n        quad, component: quad.graph, position: 'g',\n        id, issuer, hashToRelated\n      });\n    }\n\n    return hashToRelated;\n  }\n\n  _hashAndTrackBlankNode({id, hashToBlankNodes}) {\n    // 5.3.1) Create a hash, hash, according to the Hash First Degree\n    // Quads algorithm.\n    const hash = this.hashFirstDegreeQuads(id);\n\n    // 5.3.2) Add hash and identifier to hash to blank nodes map,\n    // creating a new entry if necessary.\n    const idList = hashToBlankNodes.get(hash);\n    if(!idList) {\n      hashToBlankNodes.set(hash, [id]);\n    } else {\n      idList.push(id);\n    }\n  }\n\n  _addBlankNodeQuadInfo({quad, component}) {\n    if(component.termType !== 'BlankNode') {\n      return;\n    }\n    const id = component.value;\n    const info = this.blankNodeInfo.get(id);\n    if(info) {\n      info.quads.add(quad);\n    } else {\n      this.blankNodeInfo.set(id, {quads: new Set([quad]), hash: null});\n    }\n  }\n\n  _addRelatedBlankNodeHash(\n    {quad, component, position, id, issuer, hashToRelated}) {\n    if(!(component.termType === 'BlankNode' && component.value !== id)) {\n      return;\n    }\n    // 3.1.1) Set hash to the result of the Hash Related Blank Node\n    // algorithm, passing the blank node identifier for component as\n    // related, quad, path identifier issuer as issuer, and position as\n    // either s, o, or g based on whether component is a subject, object,\n    // graph name, respectively.\n    const related = component.value;\n    const hash = this.hashRelatedBlankNode(related, quad, issuer, position);\n\n    // 3.1.2) Add a mapping of hash to the blank node identifier for\n    // component to hash to related blank nodes map, adding an entry as\n    // necessary.\n    const entries = hashToRelated.get(hash);\n    if(entries) {\n      entries.push(related);\n    } else {\n      hashToRelated.set(hash, [related]);\n    }\n  }\n\n  _useCanonicalId({component}) {\n    if(component.termType === 'BlankNode' &&\n      !component.value.startsWith(this.canonicalIssuer.prefix)) {\n      return {\n        termType: 'BlankNode',\n        value: this.canonicalIssuer.getId(component.value)\n      };\n    }\n    return component;\n  }\n};\n\nfunction _stringHashCompare(a, b) {\n  return a.hash < b.hash ? -1 : a.hash > b.hash ? 1 : 0;\n}\n","/*\n * Copyright (c) 2017-2019 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nmodule.exports = class RequestQueue {\n  /**\n   * Creates a simple queue for requesting documents.\n   */\n  constructor() {\n    this._requests = {};\n  }\n\n  wrapLoader(loader) {\n    const self = this;\n    self._loader = loader;\n    return function(/* url */) {\n      return self.add.apply(self, arguments);\n    };\n  }\n\n  async add(url) {\n    let promise = this._requests[url];\n    if(promise) {\n      // URL already queued, wait for it to load\n      return Promise.resolve(promise);\n    }\n\n    // queue URL and load it\n    promise = this._requests[url] = this._loader(url);\n\n    try {\n      return await promise;\n    } finally {\n      delete this._requests[url];\n    }\n  }\n};\n","'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\n\nfunction _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n        args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n\n      _next(undefined);\n    });\n  };\n}\n\nmodule.exports = _asyncToGenerator;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","// **N3Lexer** tokenizes N3 documents.\nimport namespaces from './IRIs';\nimport queueMicrotask from 'queue-microtask';\n\nconst { xsd } = namespaces;\n\n// Regular expression and replacement string to escape N3 strings\nconst escapeSequence = /\\\\u([a-fA-F0-9]{4})|\\\\U([a-fA-F0-9]{8})|\\\\([^])/g;\nconst escapeReplacements = {\n  '\\\\': '\\\\', \"'\": \"'\", '\"': '\"',\n  'n': '\\n', 'r': '\\r', 't': '\\t', 'f': '\\f', 'b': '\\b',\n  '_': '_', '~': '~', '.': '.', '-': '-', '!': '!', '$': '$', '&': '&',\n  '(': '(', ')': ')', '*': '*', '+': '+', ',': ',', ';': ';', '=': '=',\n  '/': '/', '?': '?', '#': '#', '@': '@', '%': '%',\n};\nconst illegalIriChars = /[\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]/;\n\nconst lineModeRegExps = {\n  _iri: true,\n  _unescapedIri: true,\n  _simpleQuotedString: true,\n  _langcode: true,\n  _blank: true,\n  _newline: true,\n  _comment: true,\n  _whitespace: true,\n  _endOfFile: true,\n};\nconst invalidRegExp = /$0^/;\n\n// ## Constructor\nexport default class N3Lexer {\n  constructor(options) {\n    // ## Regular expressions\n    // It's slightly faster to have these as properties than as in-scope variables\n    this._iri = /^<((?:[^ <>{}\\\\]|\\\\[uU])+)>[ \\t]*/; // IRI with escape sequences; needs sanity check after unescaping\n    this._unescapedIri = /^<([^\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]*)>[ \\t]*/; // IRI without escape sequences; no unescaping\n    this._simpleQuotedString = /^\"([^\"\\\\\\r\\n]*)\"(?=[^\"])/; // string without escape sequences\n    this._simpleApostropheString = /^'([^'\\\\\\r\\n]*)'(?=[^'])/;\n    this._langcode = /^@([a-z]+(?:-[a-z0-9]+)*)(?=[^a-z0-9\\-])/i;\n    this._prefix = /^((?:[A-Za-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)?:(?=[#\\s<])/;\n    this._prefixed = /^((?:[A-Za-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)?:((?:(?:[0-:A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~])(?:(?:[\\.\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~])*(?:[\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~]))?)?)(?:[ \\t]+|(?=\\.?[,;!\\^\\s#()\\[\\]\\{\\}\"'<>]))/;\n    this._variable = /^\\?(?:(?:[A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:[\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)(?=[.,;!\\^\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._blank = /^_:((?:[0-9A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)(?:[ \\t]+|(?=\\.?[,;:\\s#()\\[\\]\\{\\}\"'<>]))/;\n    this._number = /^[\\-+]?(?:(\\d+\\.\\d*|\\.?\\d+)[eE][\\-+]?|\\d*(\\.)?)\\d+(?=\\.?[,;:\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._boolean = /^(?:true|false)(?=[.,;\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._keyword = /^@[a-z]+(?=[\\s#<:])/i;\n    this._sparqlKeyword = /^(?:PREFIX|BASE|GRAPH)(?=[\\s#<])/i;\n    this._shortPredicates = /^a(?=[\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._newline = /^[ \\t]*(?:#[^\\n\\r]*)?(?:\\r\\n|\\n|\\r)[ \\t]*/;\n    this._comment = /#([^\\n\\r]*)/;\n    this._whitespace = /^[ \\t]+/;\n    this._endOfFile = /^(?:#[^\\n\\r]*)?$/;\n    options = options || {};\n\n    // In line mode (N-Triples or N-Quads), only simple features may be parsed\n    if (this._lineMode = !!options.lineMode) {\n      this._n3Mode = false;\n      // Don't tokenize special literals\n      for (const key in this) {\n        if (!(key in lineModeRegExps) && this[key] instanceof RegExp)\n          this[key] = invalidRegExp;\n      }\n    }\n    // When not in line mode, enable N3 functionality by default\n    else {\n      this._n3Mode = options.n3 !== false;\n    }\n    // Don't output comment tokens by default\n    this._comments = !!options.comments;\n    // Cache the last tested closing position of long literals\n    this._literalClosingPos = 0;\n  }\n\n  // ## Private methods\n\n  // ### `_tokenizeToEnd` tokenizes as for as possible, emitting tokens through the callback\n  _tokenizeToEnd(callback, inputFinished) {\n    // Continue parsing as far as possible; the loop will return eventually\n    let input = this._input;\n    const outputComments = this._comments;\n    while (true) {\n      // Count and skip whitespace lines\n      let whiteSpaceMatch, comment;\n      while (whiteSpaceMatch = this._newline.exec(input)) {\n        // Try to find a comment\n        if (outputComments && (comment = this._comment.exec(whiteSpaceMatch[0])))\n          callback(null, { line: this._line, type: 'comment', value: comment[1], prefix: '' });\n        // Advance the input\n        input = input.substr(whiteSpaceMatch[0].length, input.length);\n        this._line++;\n      }\n      // Skip whitespace on current line\n      if (!whiteSpaceMatch && (whiteSpaceMatch = this._whitespace.exec(input)))\n        input = input.substr(whiteSpaceMatch[0].length, input.length);\n\n      // Stop for now if we're at the end\n      if (this._endOfFile.test(input)) {\n        // If the input is finished, emit EOF\n        if (inputFinished) {\n          // Try to find a final comment\n          if (outputComments && (comment = this._comment.exec(input)))\n            callback(null, { line: this._line, type: 'comment', value: comment[1], prefix: '' });\n          callback(input = null, { line: this._line, type: 'eof', value: '', prefix: '' });\n        }\n        return this._input = input;\n      }\n\n      // Look for specific token types based on the first character\n      const line = this._line, firstChar = input[0];\n      let type = '', value = '', prefix = '',\n          match = null, matchLength = 0, inconclusive = false;\n      switch (firstChar) {\n      case '^':\n        // We need at least 3 tokens lookahead to distinguish ^^<IRI> and ^^pre:fixed\n        if (input.length < 3)\n          break;\n        // Try to match a type\n        else if (input[1] === '^') {\n          this._previousMarker = '^^';\n          // Move to type IRI or prefixed name\n          input = input.substr(2);\n          if (input[0] !== '<') {\n            inconclusive = true;\n            break;\n          }\n        }\n        // If no type, it must be a path expression\n        else {\n          if (this._n3Mode) {\n            matchLength = 1;\n            type = '^';\n          }\n          break;\n        }\n        // Fall through in case the type is an IRI\n      case '<':\n        // Try to find a full IRI without escape sequences\n        if (match = this._unescapedIri.exec(input))\n          type = 'IRI', value = match[1];\n        // Try to find a full IRI with escape sequences\n        else if (match = this._iri.exec(input)) {\n          value = this._unescape(match[1]);\n          if (value === null || illegalIriChars.test(value))\n            return reportSyntaxError(this);\n          type = 'IRI';\n        }\n        // Try to find a nested triple\n        else if (input.length > 1 && input[1] === '<')\n          type = '<<', matchLength = 2;\n        // Try to find a backwards implication arrow\n        else if (this._n3Mode && input.length > 1 && input[1] === '=')\n          type = 'inverse', matchLength = 2, value = '>';\n        break;\n\n      case '>':\n        if (input.length > 1 && input[1] === '>')\n          type = '>>', matchLength = 2;\n        break;\n\n      case '_':\n        // Try to find a blank node. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a blank node.\n        // Therefore, try inserting a space if we're at the end of the input.\n        if ((match = this._blank.exec(input)) ||\n            inputFinished && (match = this._blank.exec(`${input} `)))\n          type = 'blank', prefix = '_', value = match[1];\n        break;\n\n      case '\"':\n        // Try to find a literal without escape sequences\n        if (match = this._simpleQuotedString.exec(input))\n          value = match[1];\n        // Try to find a literal wrapped in three pairs of quotes\n        else {\n          ({ value, matchLength } = this._parseLiteral(input));\n          if (value === null)\n            return reportSyntaxError(this);\n        }\n        if (match !== null || matchLength !== 0) {\n          type = 'literal';\n          this._literalClosingPos = 0;\n        }\n        break;\n\n      case \"'\":\n        if (!this._lineMode) {\n          // Try to find a literal without escape sequences\n          if (match = this._simpleApostropheString.exec(input))\n            value = match[1];\n          // Try to find a literal wrapped in three pairs of quotes\n          else {\n            ({ value, matchLength } = this._parseLiteral(input));\n            if (value === null)\n              return reportSyntaxError(this);\n          }\n          if (match !== null || matchLength !== 0) {\n            type = 'literal';\n            this._literalClosingPos = 0;\n          }\n        }\n        break;\n\n      case '?':\n        // Try to find a variable\n        if (this._n3Mode && (match = this._variable.exec(input)))\n          type = 'var', value = match[0];\n        break;\n\n      case '@':\n        // Try to find a language code\n        if (this._previousMarker === 'literal' && (match = this._langcode.exec(input)))\n          type = 'langcode', value = match[1];\n        // Try to find a keyword\n        else if (match = this._keyword.exec(input))\n          type = match[0];\n        break;\n\n      case '.':\n        // Try to find a dot as punctuation\n        if (input.length === 1 ? inputFinished : (input[1] < '0' || input[1] > '9')) {\n          type = '.';\n          matchLength = 1;\n          break;\n        }\n        // Fall through to numerical case (could be a decimal dot)\n\n      case '0':\n      case '1':\n      case '2':\n      case '3':\n      case '4':\n      case '5':\n      case '6':\n      case '7':\n      case '8':\n      case '9':\n      case '+':\n      case '-':\n        // Try to find a number. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a number.\n        // Therefore, try inserting a space if we're at the end of the input.\n        if (match = this._number.exec(input) ||\n            inputFinished && (match = this._number.exec(`${input} `))) {\n          type = 'literal', value = match[0];\n          prefix = (typeof match[1] === 'string' ? xsd.double :\n                    (typeof match[2] === 'string' ? xsd.decimal : xsd.integer));\n        }\n        break;\n\n      case 'B':\n      case 'b':\n      case 'p':\n      case 'P':\n      case 'G':\n      case 'g':\n        // Try to find a SPARQL-style keyword\n        if (match = this._sparqlKeyword.exec(input))\n          type = match[0].toUpperCase();\n        else\n          inconclusive = true;\n        break;\n\n      case 'f':\n      case 't':\n        // Try to match a boolean\n        if (match = this._boolean.exec(input))\n          type = 'literal', value = match[0], prefix = xsd.boolean;\n        else\n          inconclusive = true;\n        break;\n\n      case 'a':\n        // Try to find an abbreviated predicate\n        if (match = this._shortPredicates.exec(input))\n          type = 'abbreviation', value = 'a';\n        else\n          inconclusive = true;\n        break;\n\n      case '=':\n        // Try to find an implication arrow or equals sign\n        if (this._n3Mode && input.length > 1) {\n          type = 'abbreviation';\n          if (input[1] !== '>')\n            matchLength = 1, value = '=';\n          else\n            matchLength = 2, value = '>';\n        }\n        break;\n\n      case '!':\n        if (!this._n3Mode)\n          break;\n      case ',':\n      case ';':\n      case '[':\n      case ']':\n      case '(':\n      case ')':\n      case '{':\n      case '}':\n        if (!this._lineMode) {\n          matchLength = 1;\n          type = firstChar;\n        }\n        break;\n\n      default:\n        inconclusive = true;\n      }\n\n      // Some first characters do not allow an immediate decision, so inspect more\n      if (inconclusive) {\n        // Try to find a prefix\n        if ((this._previousMarker === '@prefix' || this._previousMarker === 'PREFIX') &&\n            (match = this._prefix.exec(input)))\n          type = 'prefix', value = match[1] || '';\n        // Try to find a prefixed name. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a prefixed name.\n        // Therefore, try inserting a space if we're at the end of the input.\n        else if ((match = this._prefixed.exec(input)) ||\n                 inputFinished && (match = this._prefixed.exec(`${input} `)))\n          type = 'prefixed', prefix = match[1] || '', value = this._unescape(match[2]);\n      }\n\n      // A type token is special: it can only be emitted after an IRI or prefixed name is read\n      if (this._previousMarker === '^^') {\n        switch (type) {\n        case 'prefixed': type = 'type';    break;\n        case 'IRI':      type = 'typeIRI'; break;\n        default:         type = '';\n        }\n      }\n\n      // What if nothing of the above was found?\n      if (!type) {\n        // We could be in streaming mode, and then we just wait for more input to arrive.\n        // Otherwise, a syntax error has occurred in the input.\n        // One exception: error on an unaccounted linebreak (= not inside a triple-quoted literal).\n        if (inputFinished || (!/^'''|^\"\"\"/.test(input) && /\\n|\\r/.test(input)))\n          return reportSyntaxError(this);\n        else\n          return this._input = input;\n      }\n\n      // Emit the parsed token\n      const token = { line: line, type: type, value: value, prefix: prefix };\n      callback(null, token);\n      this.previousToken = token;\n      this._previousMarker = type;\n      // Advance to next part to tokenize\n      input = input.substr(matchLength || match[0].length, input.length);\n    }\n\n    // Signals the syntax error through the callback\n    function reportSyntaxError(self) { callback(self._syntaxError(/^\\S*/.exec(input)[0])); }\n  }\n\n  // ### `_unescape` replaces N3 escape codes by their corresponding characters\n  _unescape(item) {\n    let invalid = false;\n    const replaced = item.replace(escapeSequence, (sequence, unicode4, unicode8, escapedChar) => {\n      // 4-digit unicode character\n      if (typeof unicode4 === 'string')\n        return String.fromCharCode(Number.parseInt(unicode4, 16));\n      // 8-digit unicode character\n      if (typeof unicode8 === 'string') {\n        let charCode = Number.parseInt(unicode8, 16);\n        return charCode <= 0xFFFF ? String.fromCharCode(Number.parseInt(unicode8, 16)) :\n          String.fromCharCode(0xD800 + ((charCode -= 0x10000) >> 10), 0xDC00 + (charCode & 0x3FF));\n      }\n      // fixed escape sequence\n      if (escapedChar in escapeReplacements)\n        return escapeReplacements[escapedChar];\n      // invalid escape sequence\n      invalid = true;\n      return '';\n    });\n    return invalid ? null : replaced;\n  }\n\n  // ### `_parseLiteral` parses a literal into an unescaped value\n  _parseLiteral(input) {\n    // Ensure we have enough lookahead to identify triple-quoted strings\n    if (input.length >= 3) {\n      // Identify the opening quote(s)\n      const opening = input.match(/^(?:\"\"\"|\"|'''|'|)/)[0];\n      const openingLength = opening.length;\n\n      // Find the next candidate closing quotes\n      let closingPos = Math.max(this._literalClosingPos, openingLength);\n      while ((closingPos = input.indexOf(opening, closingPos)) > 0) {\n        // Count backslashes right before the closing quotes\n        let backslashCount = 0;\n        while (input[closingPos - backslashCount - 1] === '\\\\')\n          backslashCount++;\n\n        // An even number of backslashes (in particular 0)\n        // means these are actual, non-escaped closing quotes\n        if (backslashCount % 2 === 0) {\n          // Extract and unescape the value\n          const raw = input.substring(openingLength, closingPos);\n          const lines = raw.split(/\\r\\n|\\r|\\n/).length - 1;\n          const matchLength = closingPos + openingLength;\n          // Only triple-quoted strings can be multi-line\n          if (openingLength === 1 && lines !== 0 ||\n              openingLength === 3 && this._lineMode)\n            break;\n          this._line += lines;\n          return { value: this._unescape(raw), matchLength };\n        }\n        closingPos++;\n      }\n      this._literalClosingPos = input.length - openingLength + 1;\n    }\n    return { value: '', matchLength: 0 };\n  }\n\n  // ### `_syntaxError` creates a syntax error for the given issue\n  _syntaxError(issue) {\n    this._input = null;\n    const err = new Error(`Unexpected \"${issue}\" on line ${this._line}.`);\n    err.context = {\n      token: undefined,\n      line: this._line,\n      previousToken: this.previousToken,\n    };\n    return err;\n  }\n\n  // ### Strips off any starting UTF BOM mark.\n  _readStartingBom(input) {\n    return input.startsWith('\\ufeff') ? input.substr(1) : input;\n  }\n\n  // ## Public methods\n\n  // ### `tokenize` starts the transformation of an N3 document into an array of tokens.\n  // The input can be a string or a stream.\n  tokenize(input, callback) {\n    this._line = 1;\n\n    // If the input is a string, continuously emit tokens through the callback until the end\n    if (typeof input === 'string') {\n      this._input = this._readStartingBom(input);\n      // If a callback was passed, asynchronously call it\n      if (typeof callback === 'function')\n        queueMicrotask(() => this._tokenizeToEnd(callback, true));\n      // If no callback was passed, tokenize synchronously and return\n      else {\n        const tokens = [];\n        let error;\n        this._tokenizeToEnd((e, t) => e ? (error = e) : tokens.push(t), true);\n        if (error) throw error;\n        return tokens;\n      }\n    }\n    // Otherwise, the input must be a stream\n    else {\n      this._pendingBuffer = null;\n      if (typeof input.setEncoding === 'function')\n        input.setEncoding('utf8');\n      // Adds the data chunk to the buffer and parses as far as possible\n      input.on('data', data => {\n        if (this._input !== null && data.length !== 0) {\n          // Prepend any previous pending writes\n          if (this._pendingBuffer) {\n            data = Buffer.concat([this._pendingBuffer, data]);\n            this._pendingBuffer = null;\n          }\n          // Hold if the buffer ends in an incomplete unicode sequence\n          if (data[data.length - 1] & 0x80) {\n            this._pendingBuffer = data;\n          }\n          // Otherwise, tokenize as far as possible\n          else {\n            // Only read a BOM at the start\n            if (typeof this._input === 'undefined')\n              this._input = this._readStartingBom(typeof data === 'string' ? data : data.toString());\n            else\n              this._input += data;\n            this._tokenizeToEnd(callback, false);\n          }\n        }\n      });\n      // Parses until the end\n      input.on('end', () => {\n        if (typeof this._input === 'string')\n          this._tokenizeToEnd(callback, true);\n      });\n      input.on('error', callback);\n    }\n  }\n}\n","/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n  ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n  // reuse resolved promise, and allocate it lazily\n  : cb => (promise || (promise = Promise.resolve()))\n    .then(cb)\n    .catch(err => setTimeout(() => { throw err }, 0))\n","function _setPrototypeOf(o, p) {\n  module.exports = _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  module.exports[\"default\"] = module.exports, module.exports.__esModule = true;\n  return _setPrototypeOf(o, p);\n}\n\nmodule.exports = _setPrototypeOf;\nmodule.exports[\"default\"] = module.exports, module.exports.__esModule = true;","/**\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  define(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 = GeneratorFunctionPrototype;\n  define(Gp, \"constructor\", GeneratorFunctionPrototype);\n  define(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  define(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  define(Gp, iteratorSymbol, function() {\n    return this;\n  });\n\n  define(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, in modern engines\n  // we can explicitly access globalThis. In older engines 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  if (typeof globalThis === \"object\") {\n    globalThis.regeneratorRuntime = runtime;\n  } else {\n    Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n  }\n}\n","module.exports = function(originalModule) {\n\tif (!originalModule.webpackPolyfill) {\n\t\tvar module = Object.create(originalModule);\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\tObject.defineProperty(module, \"exports\", {\n\t\t\tenumerable: true\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/**\n * An implementation of the RDF Dataset Normalization specification.\n * This library works in the browser and node.js.\n *\n * BSD 3-Clause License\n * Copyright (c) 2016-2021 Digital Bazaar, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * Neither the name of the Digital Bazaar, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n'use strict';\n\nconst URDNA2015 = require('./URDNA2015');\nconst URGNA2012 = require('./URGNA2012');\nconst URDNA2015Sync = require('./URDNA2015Sync');\nconst URGNA2012Sync = require('./URGNA2012Sync');\n\n// optional native support\nlet rdfCanonizeNative;\ntry {\n  rdfCanonizeNative = require('rdf-canonize-native');\n} catch(e) {}\n\nconst api = {};\nmodule.exports = api;\n\n// expose helpers\napi.NQuads = require('./NQuads');\napi.IdentifierIssuer = require('./IdentifierIssuer');\n\n/**\n * Get or set native API.\n *\n * @param api the native API.\n *\n * @return the currently set native API.\n */\napi._rdfCanonizeNative = function(api) {\n  if(api) {\n    rdfCanonizeNative = api;\n  }\n  return rdfCanonizeNative;\n};\n\n/**\n * Asynchronously canonizes an RDF dataset.\n *\n * @param dataset the dataset to canonize.\n * @param options the options to use:\n *          algorithm the canonicalization algorithm to use, `URDNA2015` or\n *            `URGNA2012`.\n *          [useNative] use native implementation (default: false).\n *\n * @return a Promise that resolves to the canonicalized RDF Dataset.\n */\napi.canonize = async function(dataset, options) {\n  // back-compat with legacy dataset\n  if(!Array.isArray(dataset)) {\n    dataset = api.NQuads.legacyDatasetToQuads(dataset);\n  }\n\n  if(options.useNative) {\n    if(!rdfCanonizeNative) {\n      throw new Error('rdf-canonize-native not available');\n    }\n    // TODO: convert native algorithm to Promise-based async\n    return new Promise((resolve, reject) =>\n      rdfCanonizeNative.canonize(dataset, options, (err, canonical) =>\n        err ? reject(err) : resolve(canonical)));\n  }\n\n  if(options.algorithm === 'URDNA2015') {\n    return new URDNA2015(options).main(dataset);\n  }\n  if(options.algorithm === 'URGNA2012') {\n    return new URGNA2012(options).main(dataset);\n  }\n  if(!('algorithm' in options)) {\n    throw new Error('No RDF Dataset Canonicalization algorithm specified.');\n  }\n  throw new Error(\n    'Invalid RDF Dataset Canonicalization algorithm: ' + options.algorithm);\n};\n\n/**\n * This method is no longer available in the public API, it is for testing\n * only. It synchronously canonizes an RDF dataset and does not work in the\n * browser.\n *\n * @param dataset the dataset to canonize.\n * @param options the options to use:\n *          algorithm the canonicalization algorithm to use, `URDNA2015` or\n *            `URGNA2012`.\n *          [useNative] use native implementation (default: false).\n *\n * @return the RDF dataset in canonical form.\n */\napi._canonizeSync = function(dataset, options) {\n  // back-compat with legacy dataset\n  if(!Array.isArray(dataset)) {\n    dataset = api.NQuads.legacyDatasetToQuads(dataset);\n  }\n\n  if(options.useNative) {\n    if(rdfCanonizeNative) {\n      return rdfCanonizeNative.canonizeSync(dataset, options);\n    }\n    throw new Error('rdf-canonize-native not available');\n  }\n  if(options.algorithm === 'URDNA2015') {\n    return new URDNA2015Sync(options).main(dataset);\n  }\n  if(options.algorithm === 'URGNA2012') {\n    return new URGNA2012Sync(options).main(dataset);\n  }\n  if(!('algorithm' in options)) {\n    throw new Error('No RDF Dataset Canonicalization algorithm specified.');\n  }\n  throw new Error(\n    'Invalid RDF Dataset Canonicalization algorithm: ' + options.algorithm);\n};\n","var scope = (typeof global !== \"undefined\" && global) ||\n            (typeof self !== \"undefined\" && self) ||\n            window;\nvar apply = Function.prototype.apply;\n\n// DOM APIs, for completeness\n\nexports.setTimeout = function() {\n  return new Timeout(apply.call(setTimeout, scope, arguments), clearTimeout);\n};\nexports.setInterval = function() {\n  return new Timeout(apply.call(setInterval, scope, arguments), clearInterval);\n};\nexports.clearTimeout =\nexports.clearInterval = function(timeout) {\n  if (timeout) {\n    timeout.close();\n  }\n};\n\nfunction Timeout(id, clearFn) {\n  this._id = id;\n  this._clearFn = clearFn;\n}\nTimeout.prototype.unref = Timeout.prototype.ref = function() {};\nTimeout.prototype.close = function() {\n  this._clearFn.call(scope, this._id);\n};\n\n// Does not start the time, just sets up the members needed.\nexports.enroll = function(item, msecs) {\n  clearTimeout(item._idleTimeoutId);\n  item._idleTimeout = msecs;\n};\n\nexports.unenroll = function(item) {\n  clearTimeout(item._idleTimeoutId);\n  item._idleTimeout = -1;\n};\n\nexports._unrefActive = exports.active = function(item) {\n  clearTimeout(item._idleTimeoutId);\n\n  var msecs = item._idleTimeout;\n  if (msecs >= 0) {\n    item._idleTimeoutId = setTimeout(function onTimeout() {\n      if (item._onTimeout)\n        item._onTimeout();\n    }, msecs);\n  }\n};\n\n// setimmediate attaches itself to the global object\nrequire(\"setimmediate\");\n// On some exotic environments, it's not clear which object `setimmediate` was\n// able to install onto.  Search each possibility in the same order as the\n// `setimmediate` library.\nexports.setImmediate = (typeof self !== \"undefined\" && self.setImmediate) ||\n                       (typeof global !== \"undefined\" && global.setImmediate) ||\n                       (this && this.setImmediate);\nexports.clearImmediate = (typeof self !== \"undefined\" && self.clearImmediate) ||\n                         (typeof global !== \"undefined\" && global.clearImmediate) ||\n                         (this && this.clearImmediate);\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","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst URDNA2015 = require('./URDNA2015');\n\nmodule.exports = class URDNA2012 extends URDNA2015 {\n  constructor() {\n    super();\n    this.name = 'URGNA2012';\n    this.hashAlgorithm = 'sha1';\n  }\n\n  // helper for modifying component during Hash First Degree Quads\n  modifyFirstDegreeComponent(id, component, key) {\n    if(component.termType !== 'BlankNode') {\n      return component;\n    }\n    if(key === 'graph') {\n      return {\n        termType: 'BlankNode',\n        value: '_:g'\n      };\n    }\n    return {\n      termType: 'BlankNode',\n      value: (component.value === id ? '_:a' : '_:z')\n    };\n  }\n\n  // helper for getting a related predicate\n  getRelatedPredicate(quad) {\n    return quad.predicate.value;\n  }\n\n  // helper for creating hash to related blank nodes map\n  async createHashToRelated(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    const hashToRelated = new Map();\n\n    // 2) Get a reference, quads, to the list of quads in the blank node to\n    // quads map for the key identifier.\n    const quads = this.blankNodeInfo.get(id).quads;\n\n    // 3) For each quad in quads:\n    let i = 0;\n    for(const quad of quads) {\n      // 3.1) If the quad's subject is a blank node that does not match\n      // identifier, set hash to the result of the Hash Related Blank Node\n      // algorithm, passing the blank node identifier for subject as related,\n      // quad, path identifier issuer as issuer, and p as position.\n      let position;\n      let related;\n      if(quad.subject.termType === 'BlankNode' && quad.subject.value !== id) {\n        related = quad.subject.value;\n        position = 'p';\n      } else if(\n        quad.object.termType === 'BlankNode' && quad.object.value !== id) {\n        // 3.2) Otherwise, if quad's object is a blank node that does not match\n        // identifier, to the result of the Hash Related Blank Node algorithm,\n        // passing the blank node identifier for object as related, quad, path\n        // identifier issuer as issuer, and r as position.\n        related = quad.object.value;\n        position = 'r';\n      } else {\n        // 3.3) Otherwise, continue to the next quad.\n        continue;\n      }\n      // Note: batch hashing related blank nodes 100 at a time\n      if(++i % 100 === 0) {\n        await this._yield();\n      }\n      // 3.4) Add a mapping of hash to the blank node identifier for the\n      // component that matched (subject or object) to hash to related blank\n      // nodes map, adding an entry as necessary.\n      const hash = await this.hashRelatedBlankNode(\n        related, quad, issuer, position);\n      const entries = hashToRelated.get(hash);\n      if(entries) {\n        entries.push(related);\n      } else {\n        hashToRelated.set(hash, [related]);\n      }\n    }\n\n    return hashToRelated;\n  }\n};\n","/*\n * Copyright (c) 2016-2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst URDNA2015Sync = require('./URDNA2015Sync');\n\nmodule.exports = class URDNA2012Sync extends URDNA2015Sync {\n  constructor() {\n    super();\n    this.name = 'URGNA2012';\n    this.hashAlgorithm = 'sha1';\n  }\n\n  // helper for modifying component during Hash First Degree Quads\n  modifyFirstDegreeComponent(id, component, key) {\n    if(component.termType !== 'BlankNode') {\n      return component;\n    }\n    if(key === 'graph') {\n      return {\n        termType: 'BlankNode',\n        value: '_:g'\n      };\n    }\n    return {\n      termType: 'BlankNode',\n      value: (component.value === id ? '_:a' : '_:z')\n    };\n  }\n\n  // helper for getting a related predicate\n  getRelatedPredicate(quad) {\n    return quad.predicate.value;\n  }\n\n  // helper for creating hash to related blank nodes map\n  createHashToRelated(id, issuer) {\n    // 1) Create a hash to related blank nodes map for storing hashes that\n    // identify related blank nodes.\n    const hashToRelated = new Map();\n\n    // 2) Get a reference, quads, to the list of quads in the blank node to\n    // quads map for the key identifier.\n    const quads = this.blankNodeInfo.get(id).quads;\n\n    // 3) For each quad in quads:\n    for(const quad of quads) {\n      // 3.1) If the quad's subject is a blank node that does not match\n      // identifier, set hash to the result of the Hash Related Blank Node\n      // algorithm, passing the blank node identifier for subject as related,\n      // quad, path identifier issuer as issuer, and p as position.\n      let position;\n      let related;\n      if(quad.subject.termType === 'BlankNode' && quad.subject.value !== id) {\n        related = quad.subject.value;\n        position = 'p';\n      } else if(\n        quad.object.termType === 'BlankNode' && quad.object.value !== id) {\n        // 3.2) Otherwise, if quad's object is a blank node that does not match\n        // identifier, to the result of the Hash Related Blank Node algorithm,\n        // passing the blank node identifier for object as related, quad, path\n        // identifier issuer as issuer, and r as position.\n        related = quad.object.value;\n        position = 'r';\n      } else {\n        // 3.3) Otherwise, continue to the next quad.\n        continue;\n      }\n      // 3.4) Add a mapping of hash to the blank node identifier for the\n      // component that matched (subject or object) to hash to related blank\n      // nodes map, adding an entry as necessary.\n      const hash = this.hashRelatedBlankNode(related, quad, issuer, position);\n      const entries = hashToRelated.get(hash);\n      if(entries) {\n        entries.push(related);\n      } else {\n        hashToRelated.set(hash, [related]);\n      }\n    }\n\n    return hashToRelated;\n  }\n};\n","/*\n * Copyright (c) 2021 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst xhrLoader = require('./documentLoaders/xhr');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Setup browser document loaders.\n *\n * @param jsonld the jsonld api.\n */\napi.setupDocumentLoaders = function(jsonld) {\n  if(typeof XMLHttpRequest !== 'undefined') {\n    jsonld.documentLoaders.xhr = xhrLoader;\n    // use xhr document loader by default\n    jsonld.useDocumentLoader('xhr');\n  }\n};\n\n/**\n * Setup browser globals.\n *\n * @param jsonld the jsonld api.\n */\napi.setupGlobals = function(jsonld) {\n  // setup browser global JsonLdProcessor\n  if(typeof globalThis.JsonLdProcessor === 'undefined') {\n    Object.defineProperty(globalThis, 'JsonLdProcessor', {\n      writable: true,\n      enumerable: false,\n      configurable: true,\n      value: jsonld.JsonLdProcessor\n    });\n  }\n};\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {parseLinkHeader, buildHeaders} = require('../util');\nconst {LINK_HEADER_CONTEXT} = require('../constants');\nconst JsonLdError = require('../JsonLdError');\nconst RequestQueue = require('../RequestQueue');\nconst {prependBase} = require('../url');\n\nconst REGEX_LINK_HEADER = /(^|(\\r\\n))link:/i;\n\n/**\n * Creates a built-in XMLHttpRequest document loader.\n *\n * @param options the options to use:\n *          secure: require all URLs to use HTTPS.\n *          headers: an object (map) of headers which will be passed as request\n *            headers for the requested document. Accept is not allowed.\n *          [xhr]: the XMLHttpRequest API to use.\n *\n * @return the XMLHttpRequest document loader.\n */\nmodule.exports = ({\n  secure,\n  headers = {},\n  xhr\n} = {headers: {}}) => {\n  headers = buildHeaders(headers);\n  const queue = new RequestQueue();\n  return queue.wrapLoader(loader);\n\n  async function loader(url) {\n    if(url.indexOf('http:') !== 0 && url.indexOf('https:') !== 0) {\n      throw new JsonLdError(\n        'URL could not be dereferenced; only \"http\" and \"https\" URLs are ' +\n        'supported.',\n        'jsonld.InvalidUrl', {code: 'loading document failed', url});\n    }\n    if(secure && url.indexOf('https') !== 0) {\n      throw new JsonLdError(\n        'URL could not be dereferenced; secure mode is enabled and ' +\n        'the URL\\'s scheme is not \"https\".',\n        'jsonld.InvalidUrl', {code: 'loading document failed', url});\n    }\n\n    let req;\n    try {\n      req = await _get(xhr, url, headers);\n    } catch(e) {\n      throw new JsonLdError(\n        'URL could not be dereferenced, an error occurred.',\n        'jsonld.LoadDocumentError',\n        {code: 'loading document failed', url, cause: e});\n    }\n\n    if(req.status >= 400) {\n      throw new JsonLdError(\n        'URL could not be dereferenced: ' + req.statusText,\n        'jsonld.LoadDocumentError', {\n          code: 'loading document failed',\n          url,\n          httpStatusCode: req.status\n        });\n    }\n\n    let doc = {contextUrl: null, documentUrl: url, document: req.response};\n    let alternate = null;\n\n    // handle Link Header (avoid unsafe header warning by existence testing)\n    const contentType = req.getResponseHeader('Content-Type');\n    let linkHeader;\n    if(REGEX_LINK_HEADER.test(req.getAllResponseHeaders())) {\n      linkHeader = req.getResponseHeader('Link');\n    }\n    if(linkHeader && contentType !== 'application/ld+json') {\n      // only 1 related link header permitted\n      const linkHeaders = parseLinkHeader(linkHeader);\n      const linkedContext = linkHeaders[LINK_HEADER_CONTEXT];\n      if(Array.isArray(linkedContext)) {\n        throw new JsonLdError(\n          'URL could not be dereferenced, it has more than one ' +\n          'associated HTTP Link Header.',\n          'jsonld.InvalidUrl',\n          {code: 'multiple context link headers', url});\n      }\n      if(linkedContext) {\n        doc.contextUrl = linkedContext.target;\n      }\n\n      // \"alternate\" link header is a redirect\n      alternate = linkHeaders['alternate'];\n      if(alternate &&\n        alternate.type == 'application/ld+json' &&\n        !(contentType || '').match(/^application\\/(\\w*\\+)?json$/)) {\n        doc = await loader(prependBase(url, alternate.target));\n      }\n    }\n\n    return doc;\n  }\n};\n\nfunction _get(xhr, url, headers) {\n  xhr = xhr || XMLHttpRequest;\n  const req = new xhr();\n  return new Promise((resolve, reject) => {\n    req.onload = () => resolve(req);\n    req.onerror = err => reject(err);\n    req.open('GET', url, true);\n    for(const k in headers) {\n      req.setRequestHeader(k, headers[k]);\n    }\n    req.send();\n  });\n}\n","/*\n * Copyright (c) 2019 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {\n  isArray: _isArray,\n  isObject: _isObject,\n  isString: _isString,\n} = require('./types');\nconst {\n  asArray: _asArray\n} = require('./util');\nconst {prependBase} = require('./url');\nconst JsonLdError = require('./JsonLdError');\nconst ResolvedContext = require('./ResolvedContext');\n\nconst MAX_CONTEXT_URLS = 10;\n\nmodule.exports = class ContextResolver {\n  /**\n   * Creates a ContextResolver.\n   *\n   * @param sharedCache a shared LRU cache with `get` and `set` APIs.\n   */\n  constructor({sharedCache}) {\n    this.perOpCache = new Map();\n    this.sharedCache = sharedCache;\n  }\n\n  async resolve({\n    activeCtx, context, documentLoader, base, cycles = new Set()\n  }) {\n    // process `@context`\n    if(context && _isObject(context) && context['@context']) {\n      context = context['@context'];\n    }\n\n    // context is one or more contexts\n    context = _asArray(context);\n\n    // resolve each context in the array\n    const allResolved = [];\n    for(const ctx of context) {\n      if(_isString(ctx)) {\n        // see if `ctx` has been resolved before...\n        let resolved = this._get(ctx);\n        if(!resolved) {\n          // not resolved yet, resolve\n          resolved = await this._resolveRemoteContext(\n            {activeCtx, url: ctx, documentLoader, base, cycles});\n        }\n\n        // add to output and continue\n        if(_isArray(resolved)) {\n          allResolved.push(...resolved);\n        } else {\n          allResolved.push(resolved);\n        }\n        continue;\n      }\n      if(ctx === null) {\n        // handle `null` context, nothing to cache\n        allResolved.push(new ResolvedContext({document: null}));\n        continue;\n      }\n      if(!_isObject(ctx)) {\n        _throwInvalidLocalContext(context);\n      }\n      // context is an object, get/create `ResolvedContext` for it\n      const key = JSON.stringify(ctx);\n      let resolved = this._get(key);\n      if(!resolved) {\n        // create a new static `ResolvedContext` and cache it\n        resolved = new ResolvedContext({document: ctx});\n        this._cacheResolvedContext({key, resolved, tag: 'static'});\n      }\n      allResolved.push(resolved);\n    }\n\n    return allResolved;\n  }\n\n  _get(key) {\n    // get key from per operation cache; no `tag` is used with this cache so\n    // any retrieved context will always be the same during a single operation\n    let resolved = this.perOpCache.get(key);\n    if(!resolved) {\n      // see if the shared cache has a `static` entry for this URL\n      const tagMap = this.sharedCache.get(key);\n      if(tagMap) {\n        resolved = tagMap.get('static');\n        if(resolved) {\n          this.perOpCache.set(key, resolved);\n        }\n      }\n    }\n    return resolved;\n  }\n\n  _cacheResolvedContext({key, resolved, tag}) {\n    this.perOpCache.set(key, resolved);\n    if(tag !== undefined) {\n      let tagMap = this.sharedCache.get(key);\n      if(!tagMap) {\n        tagMap = new Map();\n        this.sharedCache.set(key, tagMap);\n      }\n      tagMap.set(tag, resolved);\n    }\n    return resolved;\n  }\n\n  async _resolveRemoteContext({activeCtx, url, documentLoader, base, cycles}) {\n    // resolve relative URL and fetch context\n    url = prependBase(base, url);\n    const {context, remoteDoc} = await this._fetchContext(\n      {activeCtx, url, documentLoader, cycles});\n\n    // update base according to remote document and resolve any relative URLs\n    base = remoteDoc.documentUrl || url;\n    _resolveContextUrls({context, base});\n\n    // resolve, cache, and return context\n    const resolved = await this.resolve(\n      {activeCtx, context, documentLoader, base, cycles});\n    this._cacheResolvedContext({key: url, resolved, tag: remoteDoc.tag});\n    return resolved;\n  }\n\n  async _fetchContext({activeCtx, url, documentLoader, cycles}) {\n    // check for max context URLs fetched during a resolve operation\n    if(cycles.size > MAX_CONTEXT_URLS) {\n      throw new JsonLdError(\n        'Maximum number of @context URLs exceeded.',\n        'jsonld.ContextUrlError',\n        {\n          code: activeCtx.processingMode === 'json-ld-1.0' ?\n            'loading remote context failed' :\n            'context overflow',\n          max: MAX_CONTEXT_URLS\n        });\n    }\n\n    // check for context URL cycle\n    // shortcut to avoid extra work that would eventually hit the max above\n    if(cycles.has(url)) {\n      throw new JsonLdError(\n        'Cyclical @context URLs detected.',\n        'jsonld.ContextUrlError',\n        {\n          code: activeCtx.processingMode === 'json-ld-1.0' ?\n            'recursive context inclusion' :\n            'context overflow',\n          url\n        });\n    }\n\n    // track cycles\n    cycles.add(url);\n\n    let context;\n    let remoteDoc;\n\n    try {\n      remoteDoc = await documentLoader(url);\n      context = remoteDoc.document || null;\n      // parse string context as JSON\n      if(_isString(context)) {\n        context = JSON.parse(context);\n      }\n    } catch(e) {\n      throw new JsonLdError(\n        'Dereferencing a URL did not result in a valid JSON-LD object. ' +\n        'Possible causes are an inaccessible URL perhaps due to ' +\n        'a same-origin policy (ensure the server uses CORS if you are ' +\n        'using client-side JavaScript), too many redirects, a ' +\n        'non-JSON response, or more than one HTTP Link Header was ' +\n        'provided for a remote context.',\n        'jsonld.InvalidUrl',\n        {code: 'loading remote context failed', url, cause: e});\n    }\n\n    // ensure ctx is an object\n    if(!_isObject(context)) {\n      throw new JsonLdError(\n        'Dereferencing a URL did not result in a JSON object. The ' +\n        'response was valid JSON, but it was not a JSON object.',\n        'jsonld.InvalidUrl', {code: 'invalid remote context', url});\n    }\n\n    // use empty context if no @context key is present\n    if(!('@context' in context)) {\n      context = {'@context': {}};\n    } else {\n      context = {'@context': context['@context']};\n    }\n\n    // append @context URL to context if given\n    if(remoteDoc.contextUrl) {\n      if(!_isArray(context['@context'])) {\n        context['@context'] = [context['@context']];\n      }\n      context['@context'].push(remoteDoc.contextUrl);\n    }\n\n    return {context, remoteDoc};\n  }\n};\n\nfunction _throwInvalidLocalContext(ctx) {\n  throw new JsonLdError(\n    'Invalid JSON-LD syntax; @context must be an object.',\n    'jsonld.SyntaxError', {\n      code: 'invalid local context', context: ctx\n    });\n}\n\n/**\n * Resolve all relative `@context` URLs in the given context by inline\n * replacing them with absolute URLs.\n *\n * @param context the context.\n * @param base the base IRI to use to resolve relative IRIs.\n */\nfunction _resolveContextUrls({context, base}) {\n  if(!context) {\n    return;\n  }\n\n  const ctx = context['@context'];\n\n  if(_isString(ctx)) {\n    context['@context'] = prependBase(base, ctx);\n    return;\n  }\n\n  if(_isArray(ctx)) {\n    for(let i = 0; i < ctx.length; ++i) {\n      const element = ctx[i];\n      if(_isString(element)) {\n        ctx[i] = prependBase(base, element);\n        continue;\n      }\n      if(_isObject(element)) {\n        _resolveContextUrls({context: {'@context': element}, base});\n      }\n    }\n    return;\n  }\n\n  if(!_isObject(ctx)) {\n    // no @context URLs can be found in non-object\n    return;\n  }\n\n  // ctx is an object, resolve any context URLs in terms\n  for(const term in ctx) {\n    _resolveContextUrls({context: ctx[term], base});\n  }\n}\n","/*\n * Copyright (c) 2019 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst LRU = require('lru-cache');\n\nconst MAX_ACTIVE_CONTEXTS = 10;\n\nmodule.exports = class ResolvedContext {\n  /**\n   * Creates a ResolvedContext.\n   *\n   * @param document the context document.\n   */\n  constructor({document}) {\n    this.document = document;\n    // TODO: enable customization of processed context cache\n    // TODO: limit based on size of processed contexts vs. number of them\n    this.cache = new LRU({max: MAX_ACTIVE_CONTEXTS});\n  }\n\n  getProcessed(activeCtx) {\n    return this.cache.get(activeCtx);\n  }\n\n  setProcessed(activeCtx, processedCtx) {\n    this.cache.set(activeCtx, processedCtx);\n  }\n};\n","'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n  var self = this\n  if (!(self instanceof Yallist)) {\n    self = new Yallist()\n  }\n\n  self.tail = null\n  self.head = null\n  self.length = 0\n\n  if (list && typeof list.forEach === 'function') {\n    list.forEach(function (item) {\n      self.push(item)\n    })\n  } else if (arguments.length > 0) {\n    for (var i = 0, l = arguments.length; i < l; i++) {\n      self.push(arguments[i])\n    }\n  }\n\n  return self\n}\n\nYallist.prototype.removeNode = function (node) {\n  if (node.list !== this) {\n    throw new Error('removing node which does not belong to this list')\n  }\n\n  var next = node.next\n  var prev = node.prev\n\n  if (next) {\n    next.prev = prev\n  }\n\n  if (prev) {\n    prev.next = next\n  }\n\n  if (node === this.head) {\n    this.head = next\n  }\n  if (node === this.tail) {\n    this.tail = prev\n  }\n\n  node.list.length--\n  node.next = null\n  node.prev = null\n  node.list = null\n\n  return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n  if (node === this.head) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var head = this.head\n  node.list = this\n  node.next = head\n  if (head) {\n    head.prev = node\n  }\n\n  this.head = node\n  if (!this.tail) {\n    this.tail = node\n  }\n  this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n  if (node === this.tail) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var tail = this.tail\n  node.list = this\n  node.prev = tail\n  if (tail) {\n    tail.next = node\n  }\n\n  this.tail = node\n  if (!this.head) {\n    this.head = node\n  }\n  this.length++\n}\n\nYallist.prototype.push = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    push(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.unshift = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    unshift(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.pop = function () {\n  if (!this.tail) {\n    return undefined\n  }\n\n  var res = this.tail.value\n  this.tail = this.tail.prev\n  if (this.tail) {\n    this.tail.next = null\n  } else {\n    this.head = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.shift = function () {\n  if (!this.head) {\n    return undefined\n  }\n\n  var res = this.head.value\n  this.head = this.head.next\n  if (this.head) {\n    this.head.prev = null\n  } else {\n    this.tail = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.head, i = 0; walker !== null; i++) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.next\n  }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.prev\n  }\n}\n\nYallist.prototype.get = function (n) {\n  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.next\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.getReverse = function (n) {\n  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.prev\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.head; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.next\n  }\n  return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.tail; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.prev\n  }\n  return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n  var acc\n  var walker = this.head\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.head) {\n    walker = this.head.next\n    acc = this.head.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = 0; walker !== null; i++) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.next\n  }\n\n  return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n  var acc\n  var walker = this.tail\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.tail) {\n    walker = this.tail.prev\n    acc = this.tail.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = this.length - 1; walker !== null; i--) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.prev\n  }\n\n  return acc\n}\n\nYallist.prototype.toArray = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.head; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.next\n  }\n  return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.tail; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.prev\n  }\n  return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n    walker = walker.next\n  }\n  for (; walker !== null && i < to; i++, walker = walker.next) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n    walker = walker.prev\n  }\n  for (; walker !== null && i > from; i--, walker = walker.prev) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n  if (start > this.length) {\n    start = this.length - 1\n  }\n  if (start < 0) {\n    start = this.length + start;\n  }\n\n  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n    walker = walker.next\n  }\n\n  var ret = []\n  for (var i = 0; walker && i < deleteCount; i++) {\n    ret.push(walker.value)\n    walker = this.removeNode(walker)\n  }\n  if (walker === null) {\n    walker = this.tail\n  }\n\n  if (walker !== this.head && walker !== this.tail) {\n    walker = walker.prev\n  }\n\n  for (var i = 0; i < nodes.length; i++) {\n    walker = insert(this, walker, nodes[i])\n  }\n  return ret;\n}\n\nYallist.prototype.reverse = function () {\n  var head = this.head\n  var tail = this.tail\n  for (var walker = head; walker !== null; walker = walker.prev) {\n    var p = walker.prev\n    walker.prev = walker.next\n    walker.next = p\n  }\n  this.head = tail\n  this.tail = head\n  return this\n}\n\nfunction insert (self, node, value) {\n  var inserted = node === self.head ?\n    new Node(value, null, node, self) :\n    new Node(value, node, node.next, self)\n\n  if (inserted.next === null) {\n    self.tail = inserted\n  }\n  if (inserted.prev === null) {\n    self.head = inserted\n  }\n\n  self.length++\n\n  return inserted\n}\n\nfunction push (self, item) {\n  self.tail = new Node(item, self.tail, null, self)\n  if (!self.head) {\n    self.head = self.tail\n  }\n  self.length++\n}\n\nfunction unshift (self, item) {\n  self.head = new Node(item, null, self.head, self)\n  if (!self.tail) {\n    self.tail = self.head\n  }\n  self.length++\n}\n\nfunction Node (value, prev, next, list) {\n  if (!(this instanceof Node)) {\n    return new Node(value, prev, next, list)\n  }\n\n  this.list = list\n  this.value = value\n\n  if (prev) {\n    prev.next = this\n    this.prev = prev\n  } else {\n    this.prev = null\n  }\n\n  if (next) {\n    next.prev = this\n    this.next = next\n  } else {\n    this.next = null\n  }\n}\n\ntry {\n  // add if support for Symbol.iterator is present\n  require('./iterator.js')(Yallist)\n} catch (er) {}\n","'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\n// TODO: move `NQuads` to its own package\nmodule.exports = require('rdf-canonize').NQuads;\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst JsonLdError = require('./JsonLdError');\n\nconst {\n  isArray: _isArray,\n  isObject: _isObject,\n  isEmptyObject: _isEmptyObject,\n  isString: _isString,\n  isUndefined: _isUndefined\n} = require('./types');\n\nconst {\n  isList: _isList,\n  isValue: _isValue,\n  isGraph: _isGraph,\n  isSubject: _isSubject\n} = require('./graphTypes');\n\nconst {\n  expandIri: _expandIri,\n  getContextValue: _getContextValue,\n  isKeyword: _isKeyword,\n  process: _processContext,\n  processingMode: _processingMode\n} = require('./context');\n\nconst {\n  isAbsolute: _isAbsoluteIri\n} = require('./url');\n\nconst {\n  addValue: _addValue,\n  asArray: _asArray,\n  getValues: _getValues,\n  validateTypeValue: _validateTypeValue\n} = require('./util');\n\nconst api = {};\nmodule.exports = api;\nconst REGEX_BCP47 = /^[a-zA-Z]{1,8}(-[a-zA-Z0-9]{1,8})*$/;\n\n/**\n * Recursively expands an element using the given context. Any context in\n * the element will be removed. All context URLs must have been retrieved\n * before calling this method.\n *\n * @param activeCtx the context to use.\n * @param activeProperty the property for the element, null for none.\n * @param element the element to expand.\n * @param options the expansion options.\n * @param insideList true if the element is a list, false if not.\n * @param insideIndex true if the element is inside an index container,\n *          false if not.\n * @param typeScopedContext an optional type-scoped active context for\n *          expanding values of nodes that were expressed according to\n *          a type-scoped context.\n * @param expansionMap(info) a function that can be used to custom map\n *          unmappable values (or to throw an error when they are detected);\n *          if this function returns `undefined` then the default behavior\n *          will be used.\n *\n * @return a Promise that resolves to the expanded value.\n */\napi.expand = async ({\n  activeCtx,\n  activeProperty = null,\n  element,\n  options = {},\n  insideList = false,\n  insideIndex = false,\n  typeScopedContext = null,\n  expansionMap = () => undefined\n}) => {\n  // nothing to expand\n  if(element === null || element === undefined) {\n    return null;\n  }\n\n  // disable framing if activeProperty is @default\n  if(activeProperty === '@default') {\n    options = Object.assign({}, options, {isFrame: false});\n  }\n\n  if(!_isArray(element) && !_isObject(element)) {\n    // drop free-floating scalars that are not in lists unless custom mapped\n    if(!insideList && (activeProperty === null ||\n      _expandIri(activeCtx, activeProperty, {vocab: true},\n        options) === '@graph')) {\n      const mapped = await expansionMap({\n        unmappedValue: element,\n        activeCtx,\n        activeProperty,\n        options,\n        insideList\n      });\n      if(mapped === undefined) {\n        return null;\n      }\n      return mapped;\n    }\n\n    // expand element according to value expansion rules\n    return _expandValue({activeCtx, activeProperty, value: element, options});\n  }\n\n  // recursively expand array\n  if(_isArray(element)) {\n    let rval = [];\n    const container = _getContextValue(\n      activeCtx, activeProperty, '@container') || [];\n    insideList = insideList || container.includes('@list');\n    for(let i = 0; i < element.length; ++i) {\n      // expand element\n      let e = await api.expand({\n        activeCtx,\n        activeProperty,\n        element: element[i],\n        options,\n        expansionMap,\n        insideIndex,\n        typeScopedContext\n      });\n      if(insideList && _isArray(e)) {\n        e = {'@list': e};\n      }\n\n      if(e === null) {\n        e = await expansionMap({\n          unmappedValue: element[i],\n          activeCtx,\n          activeProperty,\n          parent: element,\n          index: i,\n          options,\n          expandedParent: rval,\n          insideList\n        });\n        if(e === undefined) {\n          continue;\n        }\n      }\n\n      if(_isArray(e)) {\n        rval = rval.concat(e);\n      } else {\n        rval.push(e);\n      }\n    }\n    return rval;\n  }\n\n  // recursively expand object:\n\n  // first, expand the active property\n  const expandedActiveProperty = _expandIri(\n    activeCtx, activeProperty, {vocab: true}, options);\n\n  // Get any property-scoped context for activeProperty\n  const propertyScopedCtx =\n    _getContextValue(activeCtx, activeProperty, '@context');\n\n  // second, determine if any type-scoped context should be reverted; it\n  // should only be reverted when the following are all true:\n  // 1. `element` is not a value or subject reference\n  // 2. `insideIndex` is false\n  typeScopedContext = typeScopedContext ||\n    (activeCtx.previousContext ? activeCtx : null);\n  let keys = Object.keys(element).sort();\n  let mustRevert = !insideIndex;\n  if(mustRevert && typeScopedContext && keys.length <= 2 &&\n    !keys.includes('@context')) {\n    for(const key of keys) {\n      const expandedProperty = _expandIri(\n        typeScopedContext, key, {vocab: true}, options);\n      if(expandedProperty === '@value') {\n        // value found, ensure type-scoped context is used to expand it\n        mustRevert = false;\n        activeCtx = typeScopedContext;\n        break;\n      }\n      if(expandedProperty === '@id' && keys.length === 1) {\n        // subject reference found, do not revert\n        mustRevert = false;\n        break;\n      }\n    }\n  }\n\n  if(mustRevert) {\n    // revert type scoped context\n    activeCtx = activeCtx.revertToPreviousContext();\n  }\n\n  // apply property-scoped context after reverting term-scoped context\n  if(!_isUndefined(propertyScopedCtx)) {\n    activeCtx = await _processContext({\n      activeCtx,\n      localCtx: propertyScopedCtx,\n      propagate: true,\n      overrideProtected: true,\n      options\n    });\n  }\n\n  // if element has a context, process it\n  if('@context' in element) {\n    activeCtx = await _processContext(\n      {activeCtx, localCtx: element['@context'], options});\n  }\n\n  // set the type-scoped context to the context on input, for use later\n  typeScopedContext = activeCtx;\n\n  // Remember the first key found expanding to @type\n  let typeKey = null;\n\n  // look for scoped contexts on `@type`\n  for(const key of keys) {\n    const expandedProperty = _expandIri(activeCtx, key, {vocab: true}, options);\n    if(expandedProperty === '@type') {\n      // set scoped contexts from @type\n      // avoid sorting if possible\n      typeKey = typeKey || key;\n      const value = element[key];\n      const types =\n        Array.isArray(value) ?\n          (value.length > 1 ? value.slice().sort() : value) : [value];\n      for(const type of types) {\n        const ctx = _getContextValue(typeScopedContext, type, '@context');\n        if(!_isUndefined(ctx)) {\n          activeCtx = await _processContext({\n            activeCtx,\n            localCtx: ctx,\n            options,\n            propagate: false\n          });\n        }\n      }\n    }\n  }\n\n  // process each key and value in element, ignoring @nest content\n  let rval = {};\n  await _expandObject({\n    activeCtx,\n    activeProperty,\n    expandedActiveProperty,\n    element,\n    expandedParent: rval,\n    options,\n    insideList,\n    typeKey,\n    typeScopedContext,\n    expansionMap});\n\n  // get property count on expanded output\n  keys = Object.keys(rval);\n  let count = keys.length;\n\n  if('@value' in rval) {\n    // @value must only have @language or @type\n    if('@type' in rval && ('@language' in rval || '@direction' in rval)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; an element containing \"@value\" may not ' +\n        'contain both \"@type\" and either \"@language\" or \"@direction\".',\n        'jsonld.SyntaxError', {code: 'invalid value object', element: rval});\n    }\n    let validCount = count - 1;\n    if('@type' in rval) {\n      validCount -= 1;\n    }\n    if('@index' in rval) {\n      validCount -= 1;\n    }\n    if('@language' in rval) {\n      validCount -= 1;\n    }\n    if('@direction' in rval) {\n      validCount -= 1;\n    }\n    if(validCount !== 0) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; an element containing \"@value\" may only ' +\n        'have an \"@index\" property and either \"@type\" ' +\n        'or either or both \"@language\" or \"@direction\".',\n        'jsonld.SyntaxError', {code: 'invalid value object', element: rval});\n    }\n    const values = rval['@value'] === null ? [] : _asArray(rval['@value']);\n    const types = _getValues(rval, '@type');\n\n    // drop null @values unless custom mapped\n    if(_processingMode(activeCtx, 1.1) && types.includes('@json') &&\n      types.length === 1) {\n      // Any value of @value is okay if @type: @json\n    } else if(values.length === 0) {\n      const mapped = await expansionMap({\n        unmappedValue: rval,\n        activeCtx,\n        activeProperty,\n        element,\n        options,\n        insideList\n      });\n      if(mapped !== undefined) {\n        rval = mapped;\n      } else {\n        rval = null;\n      }\n    } else if(!values.every(v => (_isString(v) || _isEmptyObject(v))) &&\n      '@language' in rval) {\n      // if @language is present, @value must be a string\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; only strings may be language-tagged.',\n        'jsonld.SyntaxError',\n        {code: 'invalid language-tagged value', element: rval});\n    } else if(!types.every(t =>\n      (_isAbsoluteIri(t) && !(_isString(t) && t.indexOf('_:') === 0) ||\n      _isEmptyObject(t)))) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; an element containing \"@value\" and \"@type\" ' +\n        'must have an absolute IRI for the value of \"@type\".',\n        'jsonld.SyntaxError', {code: 'invalid typed value', element: rval});\n    }\n  } else if('@type' in rval && !_isArray(rval['@type'])) {\n    // convert @type to an array\n    rval['@type'] = [rval['@type']];\n  } else if('@set' in rval || '@list' in rval) {\n    // handle @set and @list\n    if(count > 1 && !(count === 2 && '@index' in rval)) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; if an element has the property \"@set\" ' +\n        'or \"@list\", then it can have at most one other property that is ' +\n        '\"@index\".', 'jsonld.SyntaxError',\n        {code: 'invalid set or list object', element: rval});\n    }\n    // optimize away @set\n    if('@set' in rval) {\n      rval = rval['@set'];\n      keys = Object.keys(rval);\n      count = keys.length;\n    }\n  } else if(count === 1 && '@language' in rval) {\n    // drop objects with only @language unless custom mapped\n    const mapped = await expansionMap(rval, {\n      unmappedValue: rval,\n      activeCtx,\n      activeProperty,\n      element,\n      options,\n      insideList\n    });\n    if(mapped !== undefined) {\n      rval = mapped;\n    } else {\n      rval = null;\n    }\n  }\n\n  // drop certain top-level objects that do not occur in lists, unless custom\n  // mapped\n  if(_isObject(rval) &&\n    !options.keepFreeFloatingNodes && !insideList &&\n    (activeProperty === null || expandedActiveProperty === '@graph')) {\n    // drop empty object, top-level @value/@list, or object with only @id\n    if(count === 0 || '@value' in rval || '@list' in rval ||\n      (count === 1 && '@id' in rval)) {\n      const mapped = await expansionMap({\n        unmappedValue: rval,\n        activeCtx,\n        activeProperty,\n        element,\n        options,\n        insideList\n      });\n      if(mapped !== undefined) {\n        rval = mapped;\n      } else {\n        rval = null;\n      }\n    }\n  }\n\n  return rval;\n};\n\n/**\n * Expand each key and value of element adding to result\n *\n * @param activeCtx the context to use.\n * @param activeProperty the property for the element.\n * @param expandedActiveProperty the expansion of activeProperty\n * @param element the element to expand.\n * @param expandedParent the expanded result into which to add values.\n * @param options the expansion options.\n * @param insideList true if the element is a list, false if not.\n * @param typeKey first key found expanding to @type.\n * @param typeScopedContext the context before reverting.\n * @param expansionMap(info) a function that can be used to custom map\n *          unmappable values (or to throw an error when they are detected);\n *          if this function returns `undefined` then the default behavior\n *          will be used.\n */\nasync function _expandObject({\n  activeCtx,\n  activeProperty,\n  expandedActiveProperty,\n  element,\n  expandedParent,\n  options = {},\n  insideList,\n  typeKey,\n  typeScopedContext,\n  expansionMap\n}) {\n  const keys = Object.keys(element).sort();\n  const nests = [];\n  let unexpandedValue;\n\n  // Figure out if this is the type for a JSON literal\n  const isJsonType = element[typeKey] &&\n    _expandIri(activeCtx,\n      (_isArray(element[typeKey]) ? element[typeKey][0] : element[typeKey]),\n      {vocab: true}, options) === '@json';\n\n  for(const key of keys) {\n    let value = element[key];\n    let expandedValue;\n\n    // skip @context\n    if(key === '@context') {\n      continue;\n    }\n\n    // expand property\n    let expandedProperty = _expandIri(activeCtx, key, {vocab: true}, options);\n\n    // drop non-absolute IRI keys that aren't keywords unless custom mapped\n    if(expandedProperty === null ||\n      !(_isAbsoluteIri(expandedProperty) || _isKeyword(expandedProperty))) {\n      // TODO: use `await` to support async\n      expandedProperty = expansionMap({\n        unmappedProperty: key,\n        activeCtx,\n        activeProperty,\n        parent: element,\n        options,\n        insideList,\n        value,\n        expandedParent\n      });\n      if(expandedProperty === undefined) {\n        continue;\n      }\n    }\n\n    if(_isKeyword(expandedProperty)) {\n      if(expandedActiveProperty === '@reverse') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; a keyword cannot be used as a @reverse ' +\n          'property.', 'jsonld.SyntaxError',\n          {code: 'invalid reverse property map', value});\n      }\n      if(expandedProperty in expandedParent &&\n         expandedProperty !== '@included' &&\n         expandedProperty !== '@type') {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; colliding keywords detected.',\n          'jsonld.SyntaxError',\n          {code: 'colliding keywords', keyword: expandedProperty});\n      }\n    }\n\n    // syntax error if @id is not a string\n    if(expandedProperty === '@id') {\n      if(!_isString(value)) {\n        if(!options.isFrame) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; \"@id\" value must a string.',\n            'jsonld.SyntaxError', {code: 'invalid @id value', value});\n        }\n        if(_isObject(value)) {\n          // empty object is a wildcard\n          if(!_isEmptyObject(value)) {\n            throw new JsonLdError(\n              'Invalid JSON-LD syntax; \"@id\" value an empty object or array ' +\n              'of strings, if framing',\n              'jsonld.SyntaxError', {code: 'invalid @id value', value});\n          }\n        } else if(_isArray(value)) {\n          if(!value.every(v => _isString(v))) {\n            throw new JsonLdError(\n              'Invalid JSON-LD syntax; \"@id\" value an empty object or array ' +\n              'of strings, if framing',\n              'jsonld.SyntaxError', {code: 'invalid @id value', value});\n          }\n        } else {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; \"@id\" value an empty object or array ' +\n            'of strings, if framing',\n            'jsonld.SyntaxError', {code: 'invalid @id value', value});\n        }\n      }\n\n      _addValue(\n        expandedParent, '@id',\n        _asArray(value).map(v =>\n          _isString(v) ? _expandIri(activeCtx, v, {base: true}, options) : v),\n        {propertyIsArray: options.isFrame});\n      continue;\n    }\n\n    if(expandedProperty === '@type') {\n      // if framing, can be a default object, but need to expand\n      // key to determine that\n      if(_isObject(value)) {\n        value = Object.fromEntries(Object.entries(value).map(([k, v]) => [\n          _expandIri(typeScopedContext, k, {vocab: true}),\n          _asArray(v).map(vv =>\n            _expandIri(typeScopedContext, vv, {base: true, vocab: true})\n          )\n        ]));\n      }\n      _validateTypeValue(value, options.isFrame);\n      _addValue(\n        expandedParent, '@type',\n        _asArray(value).map(v =>\n          _isString(v) ?\n            _expandIri(typeScopedContext, v,\n              {base: true, vocab: true}, options) : v),\n        {propertyIsArray: options.isFrame});\n      continue;\n    }\n\n    // Included blocks are treated as an array of separate object nodes sharing\n    // the same referencing active_property.\n    // For 1.0, it is skipped as are other unknown keywords\n    if(expandedProperty === '@included' && _processingMode(activeCtx, 1.1)) {\n      const includedResult = _asArray(await api.expand({\n        activeCtx,\n        activeProperty,\n        element: value,\n        options,\n        expansionMap\n      }));\n\n      // Expanded values must be node objects\n      if(!includedResult.every(v => _isSubject(v))) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; ' +\n          'values of @included must expand to node objects.',\n          'jsonld.SyntaxError', {code: 'invalid @included value', value});\n      }\n\n      _addValue(\n        expandedParent, '@included', includedResult, {propertyIsArray: true});\n      continue;\n    }\n\n    // @graph must be an array or an object\n    if(expandedProperty === '@graph' &&\n      !(_isObject(value) || _isArray(value))) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; \"@graph\" value must not be an ' +\n        'object or an array.',\n        'jsonld.SyntaxError', {code: 'invalid @graph value', value});\n    }\n\n    if(expandedProperty === '@value') {\n      // capture value for later\n      // \"colliding keywords\" check prevents this from being set twice\n      unexpandedValue = value;\n      if(isJsonType && _processingMode(activeCtx, 1.1)) {\n        // no coercion to array, and retain all values\n        expandedParent['@value'] = value;\n      } else {\n        _addValue(\n          expandedParent, '@value', value, {propertyIsArray: options.isFrame});\n      }\n      continue;\n    }\n\n    // @language must be a string\n    // it should match BCP47\n    if(expandedProperty === '@language') {\n      if(value === null) {\n        // drop null @language values, they expand as if they didn't exist\n        continue;\n      }\n      if(!_isString(value) && !options.isFrame) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; \"@language\" value must be a string.',\n          'jsonld.SyntaxError',\n          {code: 'invalid language-tagged string', value});\n      }\n      // ensure language value is lowercase\n      value = _asArray(value).map(v => _isString(v) ? v.toLowerCase() : v);\n\n      // ensure language tag matches BCP47\n      for(const lang of value) {\n        if(_isString(lang) && !lang.match(REGEX_BCP47)) {\n          console.warn(`@language must be valid BCP47: ${lang}`);\n        }\n      }\n\n      _addValue(\n        expandedParent, '@language', value, {propertyIsArray: options.isFrame});\n      continue;\n    }\n\n    // @direction must be \"ltr\" or \"rtl\"\n    if(expandedProperty === '@direction') {\n      if(!_isString(value) && !options.isFrame) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; \"@direction\" value must be a string.',\n          'jsonld.SyntaxError',\n          {code: 'invalid base direction', value});\n      }\n\n      value = _asArray(value);\n\n      // ensure direction is \"ltr\" or \"rtl\"\n      for(const dir of value) {\n        if(_isString(dir) && dir !== 'ltr' && dir !== 'rtl') {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; \"@direction\" must be \"ltr\" or \"rtl\".',\n            'jsonld.SyntaxError',\n            {code: 'invalid base direction', value});\n        }\n      }\n\n      _addValue(\n        expandedParent, '@direction', value,\n        {propertyIsArray: options.isFrame});\n      continue;\n    }\n\n    // @index must be a string\n    if(expandedProperty === '@index') {\n      if(!_isString(value)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; \"@index\" value must be a string.',\n          'jsonld.SyntaxError',\n          {code: 'invalid @index value', value});\n      }\n      _addValue(expandedParent, '@index', value);\n      continue;\n    }\n\n    // @reverse must be an object\n    if(expandedProperty === '@reverse') {\n      if(!_isObject(value)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; \"@reverse\" value must be an object.',\n          'jsonld.SyntaxError', {code: 'invalid @reverse value', value});\n      }\n\n      expandedValue = await api.expand({\n        activeCtx,\n        activeProperty:\n        '@reverse',\n        element: value,\n        options,\n        expansionMap\n      });\n      // properties double-reversed\n      if('@reverse' in expandedValue) {\n        for(const property in expandedValue['@reverse']) {\n          _addValue(\n            expandedParent, property, expandedValue['@reverse'][property],\n            {propertyIsArray: true});\n        }\n      }\n\n      // FIXME: can this be merged with code below to simplify?\n      // merge in all reversed properties\n      let reverseMap = expandedParent['@reverse'] || null;\n      for(const property in expandedValue) {\n        if(property === '@reverse') {\n          continue;\n        }\n        if(reverseMap === null) {\n          reverseMap = expandedParent['@reverse'] = {};\n        }\n        _addValue(reverseMap, property, [], {propertyIsArray: true});\n        const items = expandedValue[property];\n        for(let ii = 0; ii < items.length; ++ii) {\n          const item = items[ii];\n          if(_isValue(item) || _isList(item)) {\n            throw new JsonLdError(\n              'Invalid JSON-LD syntax; \"@reverse\" value must not be a ' +\n              '@value or an @list.', 'jsonld.SyntaxError',\n              {code: 'invalid reverse property value', value: expandedValue});\n          }\n          _addValue(reverseMap, property, item, {propertyIsArray: true});\n        }\n      }\n\n      continue;\n    }\n\n    // nested keys\n    if(expandedProperty === '@nest') {\n      nests.push(key);\n      continue;\n    }\n\n    // use potential scoped context for key\n    let termCtx = activeCtx;\n    const ctx = _getContextValue(activeCtx, key, '@context');\n    if(!_isUndefined(ctx)) {\n      termCtx = await _processContext({\n        activeCtx,\n        localCtx: ctx,\n        propagate: true,\n        overrideProtected: true,\n        options\n      });\n    }\n\n    const container = _getContextValue(termCtx, key, '@container') || [];\n\n    if(container.includes('@language') && _isObject(value)) {\n      const direction = _getContextValue(termCtx, key, '@direction');\n      // handle language map container (skip if value is not an object)\n      expandedValue = _expandLanguageMap(termCtx, value, direction, options);\n    } else if(container.includes('@index') && _isObject(value)) {\n      // handle index container (skip if value is not an object)\n      const asGraph = container.includes('@graph');\n      const indexKey = _getContextValue(termCtx, key, '@index') || '@index';\n      const propertyIndex = indexKey !== '@index' &&\n        _expandIri(activeCtx, indexKey, {vocab: true}, options);\n\n      expandedValue = await _expandIndexMap({\n        activeCtx: termCtx,\n        options,\n        activeProperty: key,\n        value,\n        expansionMap,\n        asGraph,\n        indexKey,\n        propertyIndex\n      });\n    } else if(container.includes('@id') && _isObject(value)) {\n      // handle id container (skip if value is not an object)\n      const asGraph = container.includes('@graph');\n      expandedValue = await _expandIndexMap({\n        activeCtx: termCtx,\n        options,\n        activeProperty: key,\n        value,\n        expansionMap,\n        asGraph,\n        indexKey: '@id'\n      });\n    } else if(container.includes('@type') && _isObject(value)) {\n      // handle type container (skip if value is not an object)\n      expandedValue = await _expandIndexMap({\n        // since container is `@type`, revert type scoped context when expanding\n        activeCtx: termCtx.revertToPreviousContext(),\n        options,\n        activeProperty: key,\n        value,\n        expansionMap,\n        asGraph: false,\n        indexKey: '@type'\n      });\n    } else {\n      // recurse into @list or @set\n      const isList = (expandedProperty === '@list');\n      if(isList || expandedProperty === '@set') {\n        let nextActiveProperty = activeProperty;\n        if(isList && expandedActiveProperty === '@graph') {\n          nextActiveProperty = null;\n        }\n        expandedValue = await api.expand({\n          activeCtx: termCtx,\n          activeProperty: nextActiveProperty,\n          element: value,\n          options,\n          insideList: isList,\n          expansionMap\n        });\n      } else if(\n        _getContextValue(activeCtx, key, '@type') === '@json') {\n        expandedValue = {\n          '@type': '@json',\n          '@value': value\n        };\n      } else {\n        // recursively expand value with key as new active property\n        expandedValue = await api.expand({\n          activeCtx: termCtx,\n          activeProperty: key,\n          element: value,\n          options,\n          insideList: false,\n          expansionMap\n        });\n      }\n    }\n\n    // drop null values if property is not @value\n    if(expandedValue === null && expandedProperty !== '@value') {\n      // TODO: use `await` to support async\n      expandedValue = expansionMap({\n        unmappedValue: value,\n        expandedProperty,\n        activeCtx: termCtx,\n        activeProperty,\n        parent: element,\n        options,\n        insideList,\n        key,\n        expandedParent\n      });\n      if(expandedValue === undefined) {\n        continue;\n      }\n    }\n\n    // convert expanded value to @list if container specifies it\n    if(expandedProperty !== '@list' && !_isList(expandedValue) &&\n      container.includes('@list')) {\n      // ensure expanded value in @list is an array\n      expandedValue = {'@list': _asArray(expandedValue)};\n    }\n\n    // convert expanded value to @graph if container specifies it\n    // and value is not, itself, a graph\n    // index cases handled above\n    if(container.includes('@graph') &&\n      !container.some(key => key === '@id' || key === '@index')) {\n      // ensure expanded values are arrays\n      expandedValue = _asArray(expandedValue)\n        .map(v => ({'@graph': _asArray(v)}));\n    }\n\n    // FIXME: can this be merged with code above to simplify?\n    // merge in reverse properties\n    if(termCtx.mappings.has(key) && termCtx.mappings.get(key).reverse) {\n      const reverseMap =\n        expandedParent['@reverse'] = expandedParent['@reverse'] || {};\n      expandedValue = _asArray(expandedValue);\n      for(let ii = 0; ii < expandedValue.length; ++ii) {\n        const item = expandedValue[ii];\n        if(_isValue(item) || _isList(item)) {\n          throw new JsonLdError(\n            'Invalid JSON-LD syntax; \"@reverse\" value must not be a ' +\n            '@value or an @list.', 'jsonld.SyntaxError',\n            {code: 'invalid reverse property value', value: expandedValue});\n        }\n        _addValue(reverseMap, expandedProperty, item, {propertyIsArray: true});\n      }\n      continue;\n    }\n\n    // add value for property\n    // special keywords handled above\n    _addValue(expandedParent, expandedProperty, expandedValue, {\n      propertyIsArray: true\n    });\n  }\n\n  // @value must not be an object or an array (unless framing) or if @type is\n  // @json\n  if('@value' in expandedParent) {\n    if(expandedParent['@type'] === '@json' && _processingMode(activeCtx, 1.1)) {\n      // allow any value, to be verified when the object is fully expanded and\n      // the @type is @json.\n    } else if((_isObject(unexpandedValue) || _isArray(unexpandedValue)) &&\n      !options.isFrame) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; \"@value\" value must not be an ' +\n        'object or an array.',\n        'jsonld.SyntaxError',\n        {code: 'invalid value object value', value: unexpandedValue});\n    }\n  }\n\n  // expand each nested key\n  for(const key of nests) {\n    const nestedValues = _isArray(element[key]) ? element[key] : [element[key]];\n    for(const nv of nestedValues) {\n      if(!_isObject(nv) || Object.keys(nv).some(k =>\n        _expandIri(activeCtx, k, {vocab: true}, options) === '@value')) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; nested value must be a node object.',\n          'jsonld.SyntaxError',\n          {code: 'invalid @nest value', value: nv});\n      }\n      await _expandObject({\n        activeCtx,\n        activeProperty,\n        expandedActiveProperty,\n        element: nv,\n        expandedParent,\n        options,\n        insideList,\n        typeScopedContext,\n        typeKey,\n        expansionMap});\n    }\n  }\n}\n\n/**\n * Expands the given value by using the coercion and keyword rules in the\n * given context.\n *\n * @param activeCtx the active context to use.\n * @param activeProperty the active property the value is associated with.\n * @param value the value to expand.\n * @param {Object} [options] - processing options.\n *\n * @return the expanded value.\n */\nfunction _expandValue({activeCtx, activeProperty, value, options}) {\n  // nothing to expand\n  if(value === null || value === undefined) {\n    return null;\n  }\n\n  // special-case expand @id and @type (skips '@id' expansion)\n  const expandedProperty = _expandIri(\n    activeCtx, activeProperty, {vocab: true}, options);\n  if(expandedProperty === '@id') {\n    return _expandIri(activeCtx, value, {base: true}, options);\n  } else if(expandedProperty === '@type') {\n    return _expandIri(activeCtx, value, {vocab: true, base: true}, options);\n  }\n\n  // get type definition from context\n  const type = _getContextValue(activeCtx, activeProperty, '@type');\n\n  // do @id expansion (automatic for @graph)\n  if((type === '@id' || expandedProperty === '@graph') && _isString(value)) {\n    return {'@id': _expandIri(activeCtx, value, {base: true}, options)};\n  }\n  // do @id expansion w/vocab\n  if(type === '@vocab' && _isString(value)) {\n    return {\n      '@id': _expandIri(activeCtx, value, {vocab: true, base: true}, options)\n    };\n  }\n\n  // do not expand keyword values\n  if(_isKeyword(expandedProperty)) {\n    return value;\n  }\n\n  const rval = {};\n\n  if(type && !['@id', '@vocab', '@none'].includes(type)) {\n    // other type\n    rval['@type'] = type;\n  } else if(_isString(value)) {\n    // check for language tagging for strings\n    const language = _getContextValue(activeCtx, activeProperty, '@language');\n    if(language !== null) {\n      rval['@language'] = language;\n    }\n    const direction = _getContextValue(activeCtx, activeProperty, '@direction');\n    if(direction !== null) {\n      rval['@direction'] = direction;\n    }\n  }\n  // do conversion of values that aren't basic JSON types to strings\n  if(!['boolean', 'number', 'string'].includes(typeof value)) {\n    value = value.toString();\n  }\n  rval['@value'] = value;\n\n  return rval;\n}\n\n/**\n * Expands a language map.\n *\n * @param activeCtx the active context to use.\n * @param languageMap the language map to expand.\n * @param direction the direction to apply to values.\n * @param {Object} [options] - processing options.\n *\n * @return the expanded language map.\n */\nfunction _expandLanguageMap(activeCtx, languageMap, direction, options) {\n  const rval = [];\n  const keys = Object.keys(languageMap).sort();\n  for(const key of keys) {\n    const expandedKey = _expandIri(activeCtx, key, {vocab: true}, options);\n    let val = languageMap[key];\n    if(!_isArray(val)) {\n      val = [val];\n    }\n    for(const item of val) {\n      if(item === null) {\n        // null values are allowed (8.5) but ignored (3.1)\n        continue;\n      }\n      if(!_isString(item)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; language map values must be strings.',\n          'jsonld.SyntaxError',\n          {code: 'invalid language map value', languageMap});\n      }\n      const val = {'@value': item};\n      if(expandedKey !== '@none') {\n        val['@language'] = key.toLowerCase();\n      }\n      if(direction) {\n        val['@direction'] = direction;\n      }\n      rval.push(val);\n    }\n  }\n  return rval;\n}\n\nasync function _expandIndexMap(\n  {activeCtx, options, activeProperty, value, expansionMap, asGraph,\n    indexKey, propertyIndex}) {\n  const rval = [];\n  const keys = Object.keys(value).sort();\n  const isTypeIndex = indexKey === '@type';\n  for(let key of keys) {\n    // if indexKey is @type, there may be a context defined for it\n    if(isTypeIndex) {\n      const ctx = _getContextValue(activeCtx, key, '@context');\n      if(!_isUndefined(ctx)) {\n        activeCtx = await _processContext({\n          activeCtx,\n          localCtx: ctx,\n          propagate: false,\n          options\n        });\n      }\n    }\n\n    let val = value[key];\n    if(!_isArray(val)) {\n      val = [val];\n    }\n\n    val = await api.expand({\n      activeCtx,\n      activeProperty,\n      element: val,\n      options,\n      insideList: false,\n      insideIndex: true,\n      expansionMap\n    });\n\n    // expand for @type, but also for @none\n    let expandedKey;\n    if(propertyIndex) {\n      if(key === '@none') {\n        expandedKey = '@none';\n      } else {\n        expandedKey = _expandValue(\n          {activeCtx, activeProperty: indexKey, value: key, options});\n      }\n    } else {\n      expandedKey = _expandIri(activeCtx, key, {vocab: true}, options);\n    }\n\n    if(indexKey === '@id') {\n      // expand document relative\n      key = _expandIri(activeCtx, key, {base: true}, options);\n    } else if(isTypeIndex) {\n      key = expandedKey;\n    }\n\n    for(let item of val) {\n      // If this is also a @graph container, turn items into graphs\n      if(asGraph && !_isGraph(item)) {\n        item = {'@graph': [item]};\n      }\n      if(indexKey === '@type') {\n        if(expandedKey === '@none') {\n          // ignore @none\n        } else if(item['@type']) {\n          item['@type'] = [key].concat(item['@type']);\n        } else {\n          item['@type'] = [key];\n        }\n      } else if(_isValue(item) &&\n        !['@language', '@type', '@index'].includes(indexKey)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; Attempt to add illegal key to value ' +\n          `object: \"${indexKey}\".`,\n          'jsonld.SyntaxError',\n          {code: 'invalid value object', value: item});\n      } else if(propertyIndex) {\n        // index is a property to be expanded, and values interpreted for that\n        // property\n        if(expandedKey !== '@none') {\n          // expand key as a value\n          _addValue(item, propertyIndex, expandedKey, {\n            propertyIsArray: true,\n            prependValue: true\n          });\n        }\n      } else if(expandedKey !== '@none' && !(indexKey in item)) {\n        item[indexKey] = key;\n      }\n      rval.push(item);\n    }\n  }\n  return rval;\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {\n  isSubjectReference: _isSubjectReference\n} = require('./graphTypes');\n\nconst {\n  createMergedNodeMap: _createMergedNodeMap\n} = require('./nodeMap');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Performs JSON-LD flattening.\n *\n * @param input the expanded JSON-LD to flatten.\n *\n * @return the flattened output.\n */\napi.flatten = input => {\n  const defaultGraph = _createMergedNodeMap(input);\n\n  // produce flattened output\n  const flattened = [];\n  const keys = Object.keys(defaultGraph).sort();\n  for(let ki = 0; ki < keys.length; ++ki) {\n    const node = defaultGraph[keys[ki]];\n    // only add full subjects to top-level\n    if(!_isSubjectReference(node)) {\n      flattened.push(node);\n    }\n  }\n  return flattened;\n};\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst JsonLdError = require('./JsonLdError');\nconst graphTypes = require('./graphTypes');\nconst types = require('./types');\nconst util = require('./util');\n\n// constants\nconst {\n  // RDF,\n  RDF_LIST,\n  RDF_FIRST,\n  RDF_REST,\n  RDF_NIL,\n  RDF_TYPE,\n  // RDF_PLAIN_LITERAL,\n  // RDF_XML_LITERAL,\n  RDF_JSON_LITERAL,\n  // RDF_OBJECT,\n  // RDF_LANGSTRING,\n\n  // XSD,\n  XSD_BOOLEAN,\n  XSD_DOUBLE,\n  XSD_INTEGER,\n  XSD_STRING,\n} = require('./constants');\n\nconst REGEX_BCP47 = /^[a-zA-Z]{1,8}(-[a-zA-Z0-9]{1,8})*$/;\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Converts an RDF dataset to JSON-LD.\n *\n * @param dataset the RDF dataset.\n * @param options the RDF serialization options.\n *\n * @return a Promise that resolves to the JSON-LD output.\n */\napi.fromRDF = async (\n  dataset,\n  {\n    useRdfType = false,\n    useNativeTypes = false,\n    rdfDirection = null\n  }\n) => {\n  const defaultGraph = {};\n  const graphMap = {'@default': defaultGraph};\n  const referencedOnce = {};\n\n  for(const quad of dataset) {\n    // TODO: change 'name' to 'graph'\n    const name = (quad.graph.termType === 'DefaultGraph') ?\n      '@default' : quad.graph.value;\n    if(!(name in graphMap)) {\n      graphMap[name] = {};\n    }\n    if(name !== '@default' && !(name in defaultGraph)) {\n      defaultGraph[name] = {'@id': name};\n    }\n\n    const nodeMap = graphMap[name];\n\n    // get subject, predicate, object\n    const s = quad.subject.value;\n    const p = quad.predicate.value;\n    const o = quad.object;\n\n    if(!(s in nodeMap)) {\n      nodeMap[s] = {'@id': s};\n    }\n    const node = nodeMap[s];\n\n    const objectIsNode = o.termType.endsWith('Node');\n    if(objectIsNode && !(o.value in nodeMap)) {\n      nodeMap[o.value] = {'@id': o.value};\n    }\n\n    if(p === RDF_TYPE && !useRdfType && objectIsNode) {\n      util.addValue(node, '@type', o.value, {propertyIsArray: true});\n      continue;\n    }\n\n    const value = _RDFToObject(o, useNativeTypes, rdfDirection);\n    util.addValue(node, p, value, {propertyIsArray: true});\n\n    // object may be an RDF list/partial list node but we can't know easily\n    // until all triples are read\n    if(objectIsNode) {\n      if(o.value === RDF_NIL) {\n        // track rdf:nil uniquely per graph\n        const object = nodeMap[o.value];\n        if(!('usages' in object)) {\n          object.usages = [];\n        }\n        object.usages.push({\n          node,\n          property: p,\n          value\n        });\n      } else if(o.value in referencedOnce) {\n        // object referenced more than once\n        referencedOnce[o.value] = false;\n      } else {\n        // keep track of single reference\n        referencedOnce[o.value] = {\n          node,\n          property: p,\n          value\n        };\n      }\n    }\n  }\n\n  /*\n  for(let name in dataset) {\n    const graph = dataset[name];\n    if(!(name in graphMap)) {\n      graphMap[name] = {};\n    }\n    if(name !== '@default' && !(name in defaultGraph)) {\n      defaultGraph[name] = {'@id': name};\n    }\n    const nodeMap = graphMap[name];\n    for(let ti = 0; ti < graph.length; ++ti) {\n      const triple = graph[ti];\n\n      // get subject, predicate, object\n      const s = triple.subject.value;\n      const p = triple.predicate.value;\n      const o = triple.object;\n\n      if(!(s in nodeMap)) {\n        nodeMap[s] = {'@id': s};\n      }\n      const node = nodeMap[s];\n\n      const objectIsId = (o.type === 'IRI' || o.type === 'blank node');\n      if(objectIsId && !(o.value in nodeMap)) {\n        nodeMap[o.value] = {'@id': o.value};\n      }\n\n      if(p === RDF_TYPE && !useRdfType && objectIsId) {\n        util.addValue(node, '@type', o.value, {propertyIsArray: true});\n        continue;\n      }\n\n      const value = _RDFToObject(o, useNativeTypes);\n      util.addValue(node, p, value, {propertyIsArray: true});\n\n      // object may be an RDF list/partial list node but we can't know easily\n      // until all triples are read\n      if(objectIsId) {\n        if(o.value === RDF_NIL) {\n          // track rdf:nil uniquely per graph\n          const object = nodeMap[o.value];\n          if(!('usages' in object)) {\n            object.usages = [];\n          }\n          object.usages.push({\n            node: node,\n            property: p,\n            value: value\n          });\n        } else if(o.value in referencedOnce) {\n          // object referenced more than once\n          referencedOnce[o.value] = false;\n        } else {\n          // keep track of single reference\n          referencedOnce[o.value] = {\n            node: node,\n            property: p,\n            value: value\n          };\n        }\n      }\n    }\n  }*/\n\n  // convert linked lists to @list arrays\n  for(const name in graphMap) {\n    const graphObject = graphMap[name];\n\n    // no @lists to be converted, continue\n    if(!(RDF_NIL in graphObject)) {\n      continue;\n    }\n\n    // iterate backwards through each RDF list\n    const nil = graphObject[RDF_NIL];\n    if(!nil.usages) {\n      continue;\n    }\n    for(let usage of nil.usages) {\n      let node = usage.node;\n      let property = usage.property;\n      let head = usage.value;\n      const list = [];\n      const listNodes = [];\n\n      // ensure node is a well-formed list node; it must:\n      // 1. Be referenced only once.\n      // 2. Have an array for rdf:first that has 1 item.\n      // 3. Have an array for rdf:rest that has 1 item.\n      // 4. Have no keys other than: @id, rdf:first, rdf:rest, and,\n      //   optionally, @type where the value is rdf:List.\n      let nodeKeyCount = Object.keys(node).length;\n      while(property === RDF_REST &&\n        types.isObject(referencedOnce[node['@id']]) &&\n        types.isArray(node[RDF_FIRST]) && node[RDF_FIRST].length === 1 &&\n        types.isArray(node[RDF_REST]) && node[RDF_REST].length === 1 &&\n        (nodeKeyCount === 3 ||\n          (nodeKeyCount === 4 && types.isArray(node['@type']) &&\n          node['@type'].length === 1 && node['@type'][0] === RDF_LIST))) {\n        list.push(node[RDF_FIRST][0]);\n        listNodes.push(node['@id']);\n\n        // get next node, moving backwards through list\n        usage = referencedOnce[node['@id']];\n        node = usage.node;\n        property = usage.property;\n        head = usage.value;\n        nodeKeyCount = Object.keys(node).length;\n\n        // if node is not a blank node, then list head found\n        if(!graphTypes.isBlankNode(node)) {\n          break;\n        }\n      }\n\n      // transform list into @list object\n      delete head['@id'];\n      head['@list'] = list.reverse();\n      for(const listNode of listNodes) {\n        delete graphObject[listNode];\n      }\n    }\n\n    delete nil.usages;\n  }\n\n  const result = [];\n  const subjects = Object.keys(defaultGraph).sort();\n  for(const subject of subjects) {\n    const node = defaultGraph[subject];\n    if(subject in graphMap) {\n      const graph = node['@graph'] = [];\n      const graphObject = graphMap[subject];\n      const graphSubjects = Object.keys(graphObject).sort();\n      for(const graphSubject of graphSubjects) {\n        const node = graphObject[graphSubject];\n        // only add full subjects to top-level\n        if(!graphTypes.isSubjectReference(node)) {\n          graph.push(node);\n        }\n      }\n    }\n    // only add full subjects to top-level\n    if(!graphTypes.isSubjectReference(node)) {\n      result.push(node);\n    }\n  }\n\n  return result;\n};\n\n/**\n * Converts an RDF triple object to a JSON-LD object.\n *\n * @param o the RDF triple object to convert.\n * @param useNativeTypes true to output native types, false not to.\n *\n * @return the JSON-LD object.\n */\nfunction _RDFToObject(o, useNativeTypes, rdfDirection) {\n  // convert NamedNode/BlankNode object to JSON-LD\n  if(o.termType.endsWith('Node')) {\n    return {'@id': o.value};\n  }\n\n  // convert literal to JSON-LD\n  const rval = {'@value': o.value};\n\n  // add language\n  if(o.language) {\n    rval['@language'] = o.language;\n  } else {\n    let type = o.datatype.value;\n    if(!type) {\n      type = XSD_STRING;\n    }\n    if(type === RDF_JSON_LITERAL) {\n      type = '@json';\n      try {\n        rval['@value'] = JSON.parse(rval['@value']);\n      } catch(e) {\n        throw new JsonLdError(\n          'JSON literal could not be parsed.',\n          'jsonld.InvalidJsonLiteral',\n          {code: 'invalid JSON literal', value: rval['@value'], cause: e});\n      }\n    }\n    // use native types for certain xsd types\n    if(useNativeTypes) {\n      if(type === XSD_BOOLEAN) {\n        if(rval['@value'] === 'true') {\n          rval['@value'] = true;\n        } else if(rval['@value'] === 'false') {\n          rval['@value'] = false;\n        }\n      } else if(types.isNumeric(rval['@value'])) {\n        if(type === XSD_INTEGER) {\n          const i = parseInt(rval['@value'], 10);\n          if(i.toFixed(0) === rval['@value']) {\n            rval['@value'] = i;\n          }\n        } else if(type === XSD_DOUBLE) {\n          rval['@value'] = parseFloat(rval['@value']);\n        }\n      }\n      // do not add native type\n      if(![XSD_BOOLEAN, XSD_INTEGER, XSD_DOUBLE, XSD_STRING].includes(type)) {\n        rval['@type'] = type;\n      }\n    } else if(rdfDirection === 'i18n-datatype' &&\n      type.startsWith('https://www.w3.org/ns/i18n#')) {\n      const [, language, direction] = type.split(/[#_]/);\n      if(language.length > 0) {\n        rval['@language'] = language;\n        if(!language.match(REGEX_BCP47)) {\n          console.warn(`@language must be valid BCP47: ${language}`);\n        }\n      }\n      rval['@direction'] = direction;\n    } else if(type !== XSD_STRING) {\n      rval['@type'] = type;\n    }\n  }\n\n  return rval;\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {createNodeMap} = require('./nodeMap');\nconst {isKeyword} = require('./context');\nconst graphTypes = require('./graphTypes');\nconst jsonCanonicalize = require('canonicalize');\nconst types = require('./types');\nconst util = require('./util');\n\nconst {\n  // RDF,\n  // RDF_LIST,\n  RDF_FIRST,\n  RDF_REST,\n  RDF_NIL,\n  RDF_TYPE,\n  // RDF_PLAIN_LITERAL,\n  // RDF_XML_LITERAL,\n  RDF_JSON_LITERAL,\n  // RDF_OBJECT,\n  RDF_LANGSTRING,\n\n  // XSD,\n  XSD_BOOLEAN,\n  XSD_DOUBLE,\n  XSD_INTEGER,\n  XSD_STRING,\n} = require('./constants');\n\nconst {\n  isAbsolute: _isAbsoluteIri\n} = require('./url');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Outputs an RDF dataset for the expanded JSON-LD input.\n *\n * @param input the expanded JSON-LD input.\n * @param options the RDF serialization options.\n *\n * @return the RDF dataset.\n */\napi.toRDF = (input, options) => {\n  // create node map for default graph (and any named graphs)\n  const issuer = new util.IdentifierIssuer('_:b');\n  const nodeMap = {'@default': {}};\n  createNodeMap(input, nodeMap, '@default', issuer);\n\n  const dataset = [];\n  const graphNames = Object.keys(nodeMap).sort();\n  for(const graphName of graphNames) {\n    let graphTerm;\n    if(graphName === '@default') {\n      graphTerm = {termType: 'DefaultGraph', value: ''};\n    } else if(_isAbsoluteIri(graphName)) {\n      if(graphName.startsWith('_:')) {\n        graphTerm = {termType: 'BlankNode'};\n      } else {\n        graphTerm = {termType: 'NamedNode'};\n      }\n      graphTerm.value = graphName;\n    } else {\n      // skip relative IRIs (not valid RDF)\n      continue;\n    }\n    _graphToRDF(dataset, nodeMap[graphName], graphTerm, issuer, options);\n  }\n\n  return dataset;\n};\n\n/**\n * Adds RDF quads for a particular graph to the given dataset.\n *\n * @param dataset the dataset to append RDF quads to.\n * @param graph the graph to create RDF quads for.\n * @param graphTerm the graph term for each quad.\n * @param issuer a IdentifierIssuer for assigning blank node names.\n * @param options the RDF serialization options.\n *\n * @return the array of RDF triples for the given graph.\n */\nfunction _graphToRDF(dataset, graph, graphTerm, issuer, options) {\n  const ids = Object.keys(graph).sort();\n  for(const id of ids) {\n    const node = graph[id];\n    const properties = Object.keys(node).sort();\n    for(let property of properties) {\n      const items = node[property];\n      if(property === '@type') {\n        property = RDF_TYPE;\n      } else if(isKeyword(property)) {\n        continue;\n      }\n\n      for(const item of items) {\n        // RDF subject\n        const subject = {\n          termType: id.startsWith('_:') ? 'BlankNode' : 'NamedNode',\n          value: id\n        };\n\n        // skip relative IRI subjects (not valid RDF)\n        if(!_isAbsoluteIri(id)) {\n          continue;\n        }\n\n        // RDF predicate\n        const predicate = {\n          termType: property.startsWith('_:') ? 'BlankNode' : 'NamedNode',\n          value: property\n        };\n\n        // skip relative IRI predicates (not valid RDF)\n        if(!_isAbsoluteIri(property)) {\n          continue;\n        }\n\n        // skip blank node predicates unless producing generalized RDF\n        if(predicate.termType === 'BlankNode' &&\n          !options.produceGeneralizedRdf) {\n          continue;\n        }\n\n        // convert list, value or node object to triple\n        const object =\n          _objectToRDF(item, issuer, dataset, graphTerm, options.rdfDirection);\n        // skip null objects (they are relative IRIs)\n        if(object) {\n          dataset.push({\n            subject,\n            predicate,\n            object,\n            graph: graphTerm\n          });\n        }\n      }\n    }\n  }\n}\n\n/**\n * Converts a @list value into linked list of blank node RDF quads\n * (an RDF collection).\n *\n * @param list the @list value.\n * @param issuer a IdentifierIssuer for assigning blank node names.\n * @param dataset the array of quads to append to.\n * @param graphTerm the graph term for each quad.\n *\n * @return the head of the list.\n */\nfunction _listToRDF(list, issuer, dataset, graphTerm, rdfDirection) {\n  const first = {termType: 'NamedNode', value: RDF_FIRST};\n  const rest = {termType: 'NamedNode', value: RDF_REST};\n  const nil = {termType: 'NamedNode', value: RDF_NIL};\n\n  const last = list.pop();\n  // Result is the head of the list\n  const result = last ? {termType: 'BlankNode', value: issuer.getId()} : nil;\n  let subject = result;\n\n  for(const item of list) {\n    const object = _objectToRDF(item, issuer, dataset, graphTerm, rdfDirection);\n    const next = {termType: 'BlankNode', value: issuer.getId()};\n    dataset.push({\n      subject,\n      predicate: first,\n      object,\n      graph: graphTerm\n    });\n    dataset.push({\n      subject,\n      predicate: rest,\n      object: next,\n      graph: graphTerm\n    });\n    subject = next;\n  }\n\n  // Tail of list\n  if(last) {\n    const object = _objectToRDF(last, issuer, dataset, graphTerm, rdfDirection);\n    dataset.push({\n      subject,\n      predicate: first,\n      object,\n      graph: graphTerm\n    });\n    dataset.push({\n      subject,\n      predicate: rest,\n      object: nil,\n      graph: graphTerm\n    });\n  }\n\n  return result;\n}\n\n/**\n * Converts a JSON-LD value object to an RDF literal or a JSON-LD string,\n * node object to an RDF resource, or adds a list.\n *\n * @param item the JSON-LD value or node object.\n * @param issuer a IdentifierIssuer for assigning blank node names.\n * @param dataset the dataset to append RDF quads to.\n * @param graphTerm the graph term for each quad.\n *\n * @return the RDF literal or RDF resource.\n */\nfunction _objectToRDF(item, issuer, dataset, graphTerm, rdfDirection) {\n  const object = {};\n\n  // convert value object to RDF\n  if(graphTypes.isValue(item)) {\n    object.termType = 'Literal';\n    object.value = undefined;\n    object.datatype = {\n      termType: 'NamedNode'\n    };\n    let value = item['@value'];\n    const datatype = item['@type'] || null;\n\n    // convert to XSD/JSON datatypes as appropriate\n    if(datatype === '@json') {\n      object.value = jsonCanonicalize(value);\n      object.datatype.value = RDF_JSON_LITERAL;\n    } else if(types.isBoolean(value)) {\n      object.value = value.toString();\n      object.datatype.value = datatype || XSD_BOOLEAN;\n    } else if(types.isDouble(value) || datatype === XSD_DOUBLE) {\n      if(!types.isDouble(value)) {\n        value = parseFloat(value);\n      }\n      // canonical double representation\n      object.value = value.toExponential(15).replace(/(\\d)0*e\\+?/, '$1E');\n      object.datatype.value = datatype || XSD_DOUBLE;\n    } else if(types.isNumber(value)) {\n      object.value = value.toFixed(0);\n      object.datatype.value = datatype || XSD_INTEGER;\n    } else if(rdfDirection === 'i18n-datatype' &&\n      '@direction' in item) {\n      const datatype = 'https://www.w3.org/ns/i18n#' +\n        (item['@language'] || '') +\n        `_${item['@direction']}`;\n      object.datatype.value = datatype;\n      object.value = value;\n    } else if('@language' in item) {\n      object.value = value;\n      object.datatype.value = datatype || RDF_LANGSTRING;\n      object.language = item['@language'];\n    } else {\n      object.value = value;\n      object.datatype.value = datatype || XSD_STRING;\n    }\n  } else if(graphTypes.isList(item)) {\n    const _list =\n      _listToRDF(item['@list'], issuer, dataset, graphTerm, rdfDirection);\n    object.termType = _list.termType;\n    object.value = _list.value;\n  } else {\n    // convert string/node object to RDF\n    const id = types.isObject(item) ? item['@id'] : item;\n    object.termType = id.startsWith('_:') ? 'BlankNode' : 'NamedNode';\n    object.value = id;\n  }\n\n  // skip relative IRIs, not valid RDF\n  if(object.termType === 'NamedNode' && !_isAbsoluteIri(object.value)) {\n    return null;\n  }\n\n  return object;\n}\n","/* jshint esversion: 6 */\n/* jslint node: true */\n'use strict';\n\nmodule.exports = function serialize (object) {\n  if (object === null || typeof object !== 'object' || object.toJSON != null) {\n    return JSON.stringify(object);\n  }\n\n  if (Array.isArray(object)) {\n    return '[' + object.reduce((t, cv, ci) => {\n      const comma = ci === 0 ? '' : ',';\n      const value = cv === undefined || typeof cv === 'symbol' ? null : cv;\n      return t + comma + serialize(value);\n    }, '') + ']';\n  }\n\n  return '{' + Object.keys(object).sort().reduce((t, cv, ci) => {\n    if (object[cv] === undefined ||\n        typeof object[cv] === 'symbol') {\n      return t;\n    }\n    const comma = t.length === 0 ? '' : ',';\n    return t + comma + serialize(cv) + ':' + serialize(object[cv]);\n  }, '') + '}';\n};\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst {isKeyword} = require('./context');\nconst graphTypes = require('./graphTypes');\nconst types = require('./types');\nconst util = require('./util');\nconst url = require('./url');\nconst JsonLdError = require('./JsonLdError');\nconst {\n  createNodeMap: _createNodeMap,\n  mergeNodeMapGraphs: _mergeNodeMapGraphs\n} = require('./nodeMap');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Performs JSON-LD `merged` framing.\n *\n * @param input the expanded JSON-LD to frame.\n * @param frame the expanded JSON-LD frame to use.\n * @param options the framing options.\n *\n * @return the framed output.\n */\napi.frameMergedOrDefault = (input, frame, options) => {\n  // create framing state\n  const state = {\n    options,\n    embedded: false,\n    graph: '@default',\n    graphMap: {'@default': {}},\n    subjectStack: [],\n    link: {},\n    bnodeMap: {}\n  };\n\n  // produce a map of all graphs and name each bnode\n  // FIXME: currently uses subjects from @merged graph only\n  const issuer = new util.IdentifierIssuer('_:b');\n  _createNodeMap(input, state.graphMap, '@default', issuer);\n  if(options.merged) {\n    state.graphMap['@merged'] = _mergeNodeMapGraphs(state.graphMap);\n    state.graph = '@merged';\n  }\n  state.subjects = state.graphMap[state.graph];\n\n  // frame the subjects\n  const framed = [];\n  api.frame(state, Object.keys(state.subjects).sort(), frame, framed);\n\n  // If pruning blank nodes, find those to prune\n  if(options.pruneBlankNodeIdentifiers) {\n    // remove all blank nodes appearing only once, done in compaction\n    options.bnodesToClear =\n      Object.keys(state.bnodeMap).filter(id => state.bnodeMap[id].length === 1);\n  }\n\n  // remove @preserve from results\n  options.link = {};\n  return _cleanupPreserve(framed, options);\n};\n\n/**\n * Frames subjects according to the given frame.\n *\n * @param state the current framing state.\n * @param subjects the subjects to filter.\n * @param frame the frame.\n * @param parent the parent subject or top-level array.\n * @param property the parent property, initialized to null.\n */\napi.frame = (state, subjects, frame, parent, property = null) => {\n  // validate the frame\n  _validateFrame(frame);\n  frame = frame[0];\n\n  // get flags for current frame\n  const options = state.options;\n  const flags = {\n    embed: _getFrameFlag(frame, options, 'embed'),\n    explicit: _getFrameFlag(frame, options, 'explicit'),\n    requireAll: _getFrameFlag(frame, options, 'requireAll')\n  };\n\n  // get link for current graph\n  if(!state.link.hasOwnProperty(state.graph)) {\n    state.link[state.graph] = {};\n  }\n  const link = state.link[state.graph];\n\n  // filter out subjects that match the frame\n  const matches = _filterSubjects(state, subjects, frame, flags);\n\n  // add matches to output\n  const ids = Object.keys(matches).sort();\n  for(const id of ids) {\n    const subject = matches[id];\n\n    /* Note: In order to treat each top-level match as a compartmentalized\n    result, clear the unique embedded subjects map when the property is null,\n    which only occurs at the top-level. */\n    if(property === null) {\n      state.uniqueEmbeds = {[state.graph]: {}};\n    } else {\n      state.uniqueEmbeds[state.graph] = state.uniqueEmbeds[state.graph] || {};\n    }\n\n    if(flags.embed === '@link' && id in link) {\n      // TODO: may want to also match an existing linked subject against\n      // the current frame ... so different frames could produce different\n      // subjects that are only shared in-memory when the frames are the same\n\n      // add existing linked subject\n      _addFrameOutput(parent, property, link[id]);\n      continue;\n    }\n\n    // start output for subject\n    const output = {'@id': id};\n    if(id.indexOf('_:') === 0) {\n      util.addValue(state.bnodeMap, id, output, {propertyIsArray: true});\n    }\n    link[id] = output;\n\n    // validate @embed\n    if((flags.embed === '@first' || flags.embed === '@last') && state.is11) {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; invalid value of @embed.',\n        'jsonld.SyntaxError', {code: 'invalid @embed value', frame});\n    }\n\n    if(!state.embedded && state.uniqueEmbeds[state.graph].hasOwnProperty(id)) {\n      // skip adding this node object to the top level, as it was\n      // already included in another node object\n      continue;\n    }\n\n    // if embed is @never or if a circular reference would be created by an\n    // embed, the subject cannot be embedded, just add the reference;\n    // note that a circular reference won't occur when the embed flag is\n    // `@link` as the above check will short-circuit before reaching this point\n    if(state.embedded &&\n      (flags.embed === '@never' ||\n      _createsCircularReference(subject, state.graph, state.subjectStack))) {\n      _addFrameOutput(parent, property, output);\n      continue;\n    }\n\n    // if only the first (or once) should be embedded\n    if(state.embedded &&\n       (flags.embed == '@first' || flags.embed == '@once') &&\n       state.uniqueEmbeds[state.graph].hasOwnProperty(id)) {\n      _addFrameOutput(parent, property, output);\n      continue;\n    }\n\n    // if only the last match should be embedded\n    if(flags.embed === '@last') {\n      // remove any existing embed\n      if(id in state.uniqueEmbeds[state.graph]) {\n        _removeEmbed(state, id);\n      }\n    }\n\n    state.uniqueEmbeds[state.graph][id] = {parent, property};\n\n    // push matching subject onto stack to enable circular embed checks\n    state.subjectStack.push({subject, graph: state.graph});\n\n    // subject is also the name of a graph\n    if(id in state.graphMap) {\n      let recurse = false;\n      let subframe = null;\n      if(!('@graph' in frame)) {\n        recurse = state.graph !== '@merged';\n        subframe = {};\n      } else {\n        subframe = frame['@graph'][0];\n        recurse = !(id === '@merged' || id === '@default');\n        if(!types.isObject(subframe)) {\n          subframe = {};\n        }\n      }\n\n      if(recurse) {\n        // recurse into graph\n        api.frame(\n          {...state, graph: id, embedded: false},\n          Object.keys(state.graphMap[id]).sort(), [subframe], output, '@graph');\n      }\n    }\n\n    // if frame has @included, recurse over its sub-frame\n    if('@included' in frame) {\n      api.frame(\n        {...state, embedded: false},\n        subjects, frame['@included'], output, '@included');\n    }\n\n    // iterate over subject properties\n    for(const prop of Object.keys(subject).sort()) {\n      // copy keywords to output\n      if(isKeyword(prop)) {\n        output[prop] = util.clone(subject[prop]);\n\n        if(prop === '@type') {\n          // count bnode values of @type\n          for(const type of subject['@type']) {\n            if(type.indexOf('_:') === 0) {\n              util.addValue(\n                state.bnodeMap, type, output, {propertyIsArray: true});\n            }\n          }\n        }\n        continue;\n      }\n\n      // explicit is on and property isn't in the frame, skip processing\n      if(flags.explicit && !(prop in frame)) {\n        continue;\n      }\n\n      // add objects\n      for(const o of subject[prop]) {\n        const subframe = (prop in frame ?\n          frame[prop] : _createImplicitFrame(flags));\n\n        // recurse into list\n        if(graphTypes.isList(o)) {\n          const subframe =\n            (frame[prop] && frame[prop][0] && frame[prop][0]['@list']) ?\n              frame[prop][0]['@list'] :\n              _createImplicitFrame(flags);\n\n          // add empty list\n          const list = {'@list': []};\n          _addFrameOutput(output, prop, list);\n\n          // add list objects\n          const src = o['@list'];\n          for(const oo of src) {\n            if(graphTypes.isSubjectReference(oo)) {\n              // recurse into subject reference\n              api.frame(\n                {...state, embedded: true},\n                [oo['@id']], subframe, list, '@list');\n            } else {\n              // include other values automatically\n              _addFrameOutput(list, '@list', util.clone(oo));\n            }\n          }\n        } else if(graphTypes.isSubjectReference(o)) {\n          // recurse into subject reference\n          api.frame(\n            {...state, embedded: true},\n            [o['@id']], subframe, output, prop);\n        } else if(_valueMatch(subframe[0], o)) {\n          // include other values, if they match\n          _addFrameOutput(output, prop, util.clone(o));\n        }\n      }\n    }\n\n    // handle defaults\n    for(const prop of Object.keys(frame).sort()) {\n      // skip keywords\n      if(prop === '@type') {\n        if(!types.isObject(frame[prop][0]) ||\n           !('@default' in frame[prop][0])) {\n          continue;\n        }\n        // allow through default types\n      } else if(isKeyword(prop)) {\n        continue;\n      }\n\n      // if omit default is off, then include default values for properties\n      // that appear in the next frame but are not in the matching subject\n      const next = frame[prop][0] || {};\n      const omitDefaultOn = _getFrameFlag(next, options, 'omitDefault');\n      if(!omitDefaultOn && !(prop in output)) {\n        let preserve = '@null';\n        if('@default' in next) {\n          preserve = util.clone(next['@default']);\n        }\n        if(!types.isArray(preserve)) {\n          preserve = [preserve];\n        }\n        output[prop] = [{'@preserve': preserve}];\n      }\n    }\n\n    // if embed reverse values by finding nodes having this subject as a value\n    // of the associated property\n    for(const reverseProp of Object.keys(frame['@reverse'] || {}).sort()) {\n      const subframe = frame['@reverse'][reverseProp];\n      for(const subject of Object.keys(state.subjects)) {\n        const nodeValues =\n          util.getValues(state.subjects[subject], reverseProp);\n        if(nodeValues.some(v => v['@id'] === id)) {\n          // node has property referencing this subject, recurse\n          output['@reverse'] = output['@reverse'] || {};\n          util.addValue(\n            output['@reverse'], reverseProp, [], {propertyIsArray: true});\n          api.frame(\n            {...state, embedded: true},\n            [subject], subframe, output['@reverse'][reverseProp],\n            property);\n        }\n      }\n    }\n\n    // add output to parent\n    _addFrameOutput(parent, property, output);\n\n    // pop matching subject from circular ref-checking stack\n    state.subjectStack.pop();\n  }\n};\n\n/**\n * Replace `@null` with `null`, removing it from arrays.\n *\n * @param input the framed, compacted output.\n * @param options the framing options used.\n *\n * @return the resulting output.\n */\napi.cleanupNull = (input, options) => {\n  // recurse through arrays\n  if(types.isArray(input)) {\n    const noNulls = input.map(v => api.cleanupNull(v, options));\n    return noNulls.filter(v => v); // removes nulls from array\n  }\n\n  if(input === '@null') {\n    return null;\n  }\n\n  if(types.isObject(input)) {\n    // handle in-memory linked nodes\n    if('@id' in input) {\n      const id = input['@id'];\n      if(options.link.hasOwnProperty(id)) {\n        const idx = options.link[id].indexOf(input);\n        if(idx !== -1) {\n          // already visited\n          return options.link[id][idx];\n        }\n        // prevent circular visitation\n        options.link[id].push(input);\n      } else {\n        // prevent circular visitation\n        options.link[id] = [input];\n      }\n    }\n\n    for(const key in input) {\n      input[key] = api.cleanupNull(input[key], options);\n    }\n  }\n  return input;\n};\n\n/**\n * Creates an implicit frame when recursing through subject matches. If\n * a frame doesn't have an explicit frame for a particular property, then\n * a wildcard child frame will be created that uses the same flags that the\n * parent frame used.\n *\n * @param flags the current framing flags.\n *\n * @return the implicit frame.\n */\nfunction _createImplicitFrame(flags) {\n  const frame = {};\n  for(const key in flags) {\n    if(flags[key] !== undefined) {\n      frame['@' + key] = [flags[key]];\n    }\n  }\n  return [frame];\n}\n\n/**\n * Checks the current subject stack to see if embedding the given subject\n * would cause a circular reference.\n *\n * @param subjectToEmbed the subject to embed.\n * @param graph the graph the subject to embed is in.\n * @param subjectStack the current stack of subjects.\n *\n * @return true if a circular reference would be created, false if not.\n */\nfunction _createsCircularReference(subjectToEmbed, graph, subjectStack) {\n  for(let i = subjectStack.length - 1; i >= 0; --i) {\n    const subject = subjectStack[i];\n    if(subject.graph === graph &&\n      subject.subject['@id'] === subjectToEmbed['@id']) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Gets the frame flag value for the given flag name.\n *\n * @param frame the frame.\n * @param options the framing options.\n * @param name the flag name.\n *\n * @return the flag value.\n */\nfunction _getFrameFlag(frame, options, name) {\n  const flag = '@' + name;\n  let rval = (flag in frame ? frame[flag][0] : options[name]);\n  if(name === 'embed') {\n    // default is \"@last\"\n    // backwards-compatibility support for \"embed\" maps:\n    // true => \"@last\"\n    // false => \"@never\"\n    if(rval === true) {\n      rval = '@once';\n    } else if(rval === false) {\n      rval = '@never';\n    } else if(rval !== '@always' && rval !== '@never' && rval !== '@link' &&\n      rval !== '@first' && rval !== '@last' && rval !== '@once') {\n      throw new JsonLdError(\n        'Invalid JSON-LD syntax; invalid value of @embed.',\n        'jsonld.SyntaxError', {code: 'invalid @embed value', frame});\n    }\n  }\n  return rval;\n}\n\n/**\n * Validates a JSON-LD frame, throwing an exception if the frame is invalid.\n *\n * @param frame the frame to validate.\n */\nfunction _validateFrame(frame) {\n  if(!types.isArray(frame) || frame.length !== 1 || !types.isObject(frame[0])) {\n    throw new JsonLdError(\n      'Invalid JSON-LD syntax; a JSON-LD frame must be a single object.',\n      'jsonld.SyntaxError', {frame});\n  }\n\n  if('@id' in frame[0]) {\n    for(const id of util.asArray(frame[0]['@id'])) {\n      // @id must be wildcard or an IRI\n      if(!(types.isObject(id) || url.isAbsolute(id)) ||\n        (types.isString(id) && id.indexOf('_:') === 0)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; invalid @id in frame.',\n          'jsonld.SyntaxError', {code: 'invalid frame', frame});\n      }\n    }\n  }\n\n  if('@type' in frame[0]) {\n    for(const type of util.asArray(frame[0]['@type'])) {\n      // @id must be wildcard or an IRI\n      if(!(types.isObject(type) || url.isAbsolute(type)) ||\n        (types.isString(type) && type.indexOf('_:') === 0)) {\n        throw new JsonLdError(\n          'Invalid JSON-LD syntax; invalid @type in frame.',\n          'jsonld.SyntaxError', {code: 'invalid frame', frame});\n      }\n    }\n  }\n}\n\n/**\n * Returns a map of all of the subjects that match a parsed frame.\n *\n * @param state the current framing state.\n * @param subjects the set of subjects to filter.\n * @param frame the parsed frame.\n * @param flags the frame flags.\n *\n * @return all of the matched subjects.\n */\nfunction _filterSubjects(state, subjects, frame, flags) {\n  // filter subjects in @id order\n  const rval = {};\n  for(const id of subjects) {\n    const subject = state.graphMap[state.graph][id];\n    if(_filterSubject(state, subject, frame, flags)) {\n      rval[id] = subject;\n    }\n  }\n  return rval;\n}\n\n/**\n * Returns true if the given subject matches the given frame.\n *\n * Matches either based on explicit type inclusion where the node has any\n * type listed in the frame. If the frame has empty types defined matches\n * nodes not having a @type. If the frame has a type of {} defined matches\n * nodes having any type defined.\n *\n * Otherwise, does duck typing, where the node must have all of the\n * properties defined in the frame.\n *\n * @param state the current framing state.\n * @param subject the subject to check.\n * @param frame the frame to check.\n * @param flags the frame flags.\n *\n * @return true if the subject matches, false if not.\n */\nfunction _filterSubject(state, subject, frame, flags) {\n  // check ducktype\n  let wildcard = true;\n  let matchesSome = false;\n\n  for(const key in frame) {\n    let matchThis = false;\n    const nodeValues = util.getValues(subject, key);\n    const isEmpty = util.getValues(frame, key).length === 0;\n\n    if(key === '@id') {\n      // match on no @id or any matching @id, including wildcard\n      if(types.isEmptyObject(frame['@id'][0] || {})) {\n        matchThis = true;\n      } else if(frame['@id'].length >= 0) {\n        matchThis = frame['@id'].includes(nodeValues[0]);\n      }\n      if(!flags.requireAll) {\n        return matchThis;\n      }\n    } else if(key === '@type') {\n      // check @type (object value means 'any' type,\n      // fall through to ducktyping)\n      wildcard = false;\n      if(isEmpty) {\n        if(nodeValues.length > 0) {\n          // don't match on no @type\n          return false;\n        }\n        matchThis = true;\n      } else if(frame['@type'].length === 1 &&\n        types.isEmptyObject(frame['@type'][0])) {\n        // match on wildcard @type if there is a type\n        matchThis = nodeValues.length > 0;\n      } else {\n        // match on a specific @type\n        for(const type of frame['@type']) {\n          if(types.isObject(type) && '@default' in type) {\n            // match on default object\n            matchThis = true;\n          } else {\n            matchThis = matchThis || nodeValues.some(tt => tt === type);\n          }\n        }\n      }\n      if(!flags.requireAll) {\n        return matchThis;\n      }\n    } else if(isKeyword(key)) {\n      continue;\n    } else {\n      // Force a copy of this frame entry so it can be manipulated\n      const thisFrame = util.getValues(frame, key)[0];\n      let hasDefault = false;\n      if(thisFrame) {\n        _validateFrame([thisFrame]);\n        hasDefault = '@default' in thisFrame;\n      }\n\n      // no longer a wildcard pattern if frame has any non-keyword properties\n      wildcard = false;\n\n      // skip, but allow match if node has no value for property, and frame has\n      // a default value\n      if(nodeValues.length === 0 && hasDefault) {\n        continue;\n      }\n\n      // if frame value is empty, don't match if subject has any value\n      if(nodeValues.length > 0 && isEmpty) {\n        return false;\n      }\n\n      if(thisFrame === undefined) {\n        // node does not match if values is not empty and the value of property\n        // in frame is match none.\n        if(nodeValues.length > 0) {\n          return false;\n        }\n        matchThis = true;\n      } else {\n        if(graphTypes.isList(thisFrame)) {\n          const listValue = thisFrame['@list'][0];\n          if(graphTypes.isList(nodeValues[0])) {\n            const nodeListValues = nodeValues[0]['@list'];\n\n            if(graphTypes.isValue(listValue)) {\n              // match on any matching value\n              matchThis = nodeListValues.some(lv => _valueMatch(listValue, lv));\n            } else if(graphTypes.isSubject(listValue) ||\n              graphTypes.isSubjectReference(listValue)) {\n              matchThis = nodeListValues.some(lv => _nodeMatch(\n                state, listValue, lv, flags));\n            }\n          }\n        } else if(graphTypes.isValue(thisFrame)) {\n          matchThis = nodeValues.some(nv => _valueMatch(thisFrame, nv));\n        } else if(graphTypes.isSubjectReference(thisFrame)) {\n          matchThis =\n            nodeValues.some(nv => _nodeMatch(state, thisFrame, nv, flags));\n        } else if(types.isObject(thisFrame)) {\n          matchThis = nodeValues.length > 0;\n        } else {\n          matchThis = false;\n        }\n      }\n    }\n\n    // all non-defaulted values must match if requireAll is set\n    if(!matchThis && flags.requireAll) {\n      return false;\n    }\n\n    matchesSome = matchesSome || matchThis;\n  }\n\n  // return true if wildcard or subject matches some properties\n  return wildcard || matchesSome;\n}\n\n/**\n * Removes an existing embed.\n *\n * @param state the current framing state.\n * @param id the @id of the embed to remove.\n */\nfunction _removeEmbed(state, id) {\n  // get existing embed\n  const embeds = state.uniqueEmbeds[state.graph];\n  const embed = embeds[id];\n  const parent = embed.parent;\n  const property = embed.property;\n\n  // create reference to replace embed\n  const subject = {'@id': id};\n\n  // remove existing embed\n  if(types.isArray(parent)) {\n    // replace subject with reference\n    for(let i = 0; i < parent.length; ++i) {\n      if(util.compareValues(parent[i], subject)) {\n        parent[i] = subject;\n        break;\n      }\n    }\n  } else {\n    // replace subject with reference\n    const useArray = types.isArray(parent[property]);\n    util.removeValue(parent, property, subject, {propertyIsArray: useArray});\n    util.addValue(parent, property, subject, {propertyIsArray: useArray});\n  }\n\n  // recursively remove dependent dangling embeds\n  const removeDependents = id => {\n    // get embed keys as a separate array to enable deleting keys in map\n    const ids = Object.keys(embeds);\n    for(const next of ids) {\n      if(next in embeds && types.isObject(embeds[next].parent) &&\n        embeds[next].parent['@id'] === id) {\n        delete embeds[next];\n        removeDependents(next);\n      }\n    }\n  };\n  removeDependents(id);\n}\n\n/**\n * Removes the @preserve keywords from expanded result of framing.\n *\n * @param input the framed, framed output.\n * @param options the framing options used.\n *\n * @return the resulting output.\n */\nfunction _cleanupPreserve(input, options) {\n  // recurse through arrays\n  if(types.isArray(input)) {\n    return input.map(value => _cleanupPreserve(value, options));\n  }\n\n  if(types.isObject(input)) {\n    // remove @preserve\n    if('@preserve' in input) {\n      return input['@preserve'][0];\n    }\n\n    // skip @values\n    if(graphTypes.isValue(input)) {\n      return input;\n    }\n\n    // recurse through @lists\n    if(graphTypes.isList(input)) {\n      input['@list'] = _cleanupPreserve(input['@list'], options);\n      return input;\n    }\n\n    // handle in-memory linked nodes\n    if('@id' in input) {\n      const id = input['@id'];\n      if(options.link.hasOwnProperty(id)) {\n        const idx = options.link[id].indexOf(input);\n        if(idx !== -1) {\n          // already visited\n          return options.link[id][idx];\n        }\n        // prevent circular visitation\n        options.link[id].push(input);\n      } else {\n        // prevent circular visitation\n        options.link[id] = [input];\n      }\n    }\n\n    // recurse through properties\n    for(const prop in input) {\n      // potentially remove the id, if it is an unreference bnode\n      if(prop === '@id' && options.bnodesToClear.includes(input[prop])) {\n        delete input['@id'];\n        continue;\n      }\n\n      input[prop] = _cleanupPreserve(input[prop], options);\n    }\n  }\n  return input;\n}\n\n/**\n * Adds framing output to the given parent.\n *\n * @param parent the parent to add to.\n * @param property the parent property.\n * @param output the output to add.\n */\nfunction _addFrameOutput(parent, property, output) {\n  if(types.isObject(parent)) {\n    util.addValue(parent, property, output, {propertyIsArray: true});\n  } else {\n    parent.push(output);\n  }\n}\n\n/**\n * Node matches if it is a node, and matches the pattern as a frame.\n *\n * @param state the current framing state.\n * @param pattern used to match value\n * @param value to check\n * @param flags the frame flags.\n */\nfunction _nodeMatch(state, pattern, value, flags) {\n  if(!('@id' in value)) {\n    return false;\n  }\n  const nodeObject = state.subjects[value['@id']];\n  return nodeObject && _filterSubject(state, nodeObject, pattern, flags);\n}\n\n/**\n * Value matches if it is a value and matches the value pattern\n *\n * * `pattern` is empty\n * * @values are the same, or `pattern[@value]` is a wildcard, and\n * * @types are the same or `value[@type]` is not null\n *   and `pattern[@type]` is `{}`, or `value[@type]` is null\n *   and `pattern[@type]` is null or `[]`, and\n * * @languages are the same or `value[@language]` is not null\n *   and `pattern[@language]` is `{}`, or `value[@language]` is null\n *   and `pattern[@language]` is null or `[]`.\n *\n * @param pattern used to match value\n * @param value to check\n */\nfunction _valueMatch(pattern, value) {\n  const v1 = value['@value'];\n  const t1 = value['@type'];\n  const l1 = value['@language'];\n  const v2 = pattern['@value'] ?\n    (types.isArray(pattern['@value']) ?\n      pattern['@value'] : [pattern['@value']]) :\n    [];\n  const t2 = pattern['@type'] ?\n    (types.isArray(pattern['@type']) ?\n      pattern['@type'] : [pattern['@type']]) :\n    [];\n  const l2 = pattern['@language'] ?\n    (types.isArray(pattern['@language']) ?\n      pattern['@language'] : [pattern['@language']]) :\n    [];\n\n  if(v2.length === 0 && t2.length === 0 && l2.length === 0) {\n    return true;\n  }\n  if(!(v2.includes(v1) || types.isEmptyObject(v2[0]))) {\n    return false;\n  }\n  if(!(!t1 && t2.length === 0 || t2.includes(t1) || t1 &&\n    types.isEmptyObject(t2[0]))) {\n    return false;\n  }\n  if(!(!l1 && l2.length === 0 || l2.includes(l1) || l1 &&\n    types.isEmptyObject(l2[0]))) {\n    return false;\n  }\n  return true;\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nconst JsonLdError = require('./JsonLdError');\n\nconst {\n  isArray: _isArray,\n  isObject: _isObject,\n  isString: _isString,\n  isUndefined: _isUndefined\n} = require('./types');\n\nconst {\n  isList: _isList,\n  isValue: _isValue,\n  isGraph: _isGraph,\n  isSimpleGraph: _isSimpleGraph,\n  isSubjectReference: _isSubjectReference\n} = require('./graphTypes');\n\nconst {\n  expandIri: _expandIri,\n  getContextValue: _getContextValue,\n  isKeyword: _isKeyword,\n  process: _processContext,\n  processingMode: _processingMode\n} = require('./context');\n\nconst {\n  removeBase: _removeBase,\n  prependBase: _prependBase\n} = require('./url');\n\nconst {\n  addValue: _addValue,\n  asArray: _asArray,\n  compareShortestLeast: _compareShortestLeast\n} = require('./util');\n\nconst api = {};\nmodule.exports = api;\n\n/**\n * Recursively compacts an element using the given active context. All values\n * must be in expanded form before this method is called.\n *\n * @param activeCtx the active context to use.\n * @param activeProperty the compacted property associated with the element\n *          to compact, null for none.\n * @param element the element to compact.\n * @param options the compaction options.\n * @param compactionMap the compaction map to use.\n *\n * @return a promise that resolves to the compacted value.\n */\napi.compact = async ({\n  activeCtx,\n  activeProperty = null,\n  element,\n  options = {},\n  compactionMap = () => undefined\n}) => {\n  // recursively compact array\n  if(_isArray(element)) {\n    let rval = [];\n    for(let i = 0; i < element.length; ++i) {\n      // compact, dropping any null values unless custom mapped\n      let compacted = await api.compact({\n        activeCtx,\n        activeProperty,\n        element: element[i],\n        options,\n        compactionMap\n      });\n      if(compacted === null) {\n        compacted = await compactionMap({\n          unmappedValue: element[i],\n          activeCtx,\n          activeProperty,\n          parent: element,\n          index: i,\n          options\n        });\n        if(compacted === undefined) {\n          continue;\n        }\n      }\n      rval.push(compacted);\n    }\n    if(options.compactArrays && rval.length === 1) {\n      // use single element if no container is specified\n      const container = _getContextValue(\n        activeCtx, activeProperty, '@container') || [];\n      if(container.length === 0) {\n        rval = rval[0];\n      }\n    }\n    return rval;\n  }\n\n  // use any scoped context on activeProperty\n  const ctx = _getContextValue(activeCtx, activeProperty, '@context');\n  if(!_isUndefined(ctx)) {\n    activeCtx = await _processContext({\n      activeCtx,\n      localCtx: ctx,\n      propagate: true,\n      overrideProtected: true,\n      options\n    });\n  }\n\n  // recursively compact object\n  if(_isObject(element)) {\n    if(options.link && '@id' in element &&\n      options.link.hasOwnProperty(element['@id'])) {\n      // check for a linked element to reuse\n      const linked = options.link[element['@id']];\n      for(let i = 0; i < linked.length; ++i) {\n        if(linked[i].expanded === element) {\n          return linked[i].compacted;\n        }\n      }\n    }\n\n    // do value compaction on @values and subject references\n    if(_isValue(element) || _isSubjectReference(element)) {\n      const rval =\n        api.compactValue({activeCtx, activeProperty, value: element, options});\n      if(options.link && _isSubjectReference(element)) {\n        // store linked element\n        if(!(options.link.hasOwnProperty(element['@id']))) {\n          options.link[element['@id']] = [];\n        }\n        options.link[element['@id']].push({expanded: element, compacted: rval});\n      }\n      return rval;\n    }\n\n    // if expanded property is @list and we're contained within a list\n    // container, recursively compact this item to an array\n    if(_isList(element)) {\n      const container = _getContextValue(\n        activeCtx, activeProperty, '@container') || [];\n      if(container.includes('@list')) {\n        return api.compact({\n          activeCtx,\n          activeProperty,\n          element: element['@list'],\n          options,\n          compactionMap\n        });\n      }\n    }\n\n    // FIXME: avoid misuse of active property as an expanded property?\n    const insideReverse = (activeProperty === '@reverse');\n\n    const rval = {};\n\n    // original context before applying property-scoped and local contexts\n    const inputCtx = activeCtx;\n\n    // revert to previous context, if there is one,\n    // and element is not a value object or a node reference\n    if(!_isValue(element) && !_isSubjectReference(element)) {\n      activeCtx = activeCtx.revertToPreviousContext();\n    }\n\n    // apply property-scoped context after reverting term-scoped context\n    const propertyScopedCtx =\n      _getContextValue(inputCtx, activeProperty, '@context');\n    if(!_isUndefined(propertyScopedCtx)) {\n      activeCtx = await _processContext({\n        activeCtx,\n        localCtx: propertyScopedCtx,\n        propagate: true,\n        overrideProtected: true,\n        options\n      });\n    }\n\n    if(options.link && '@id' in element) {\n      // store linked element\n      if(!options.link.hasOwnProperty(element['@id'])) {\n        options.link[element['@id']] = [];\n      }\n      options.link[element['@id']].push({expanded: element, compacted: rval});\n    }\n\n    // apply any context defined on an alias of @type\n    // if key is @type and any compacted value is a term having a local\n    // context, overlay that context\n    let types = element['@type'] || [];\n    if(types.length > 1) {\n      types = Array.from(types).sort();\n    }\n    // find all type-scoped contexts based on current context, prior to\n    // updating it\n    const typeContext = activeCtx;\n    for(const type of types) {\n      const compactedType = api.compactIri(\n        {activeCtx: typeContext, iri: type, relativeTo: {vocab: true}});\n\n      // Use any type-scoped context defined on this value\n      const ctx = _getContextValue(inputCtx, compactedType, '@context');\n      if(!_isUndefined(ctx)) {\n        activeCtx = await _processContext({\n          activeCtx,\n          localCtx: ctx,\n          options,\n          propagate: false\n        });\n      }\n    }\n\n    // process element keys in order\n    const keys = Object.keys(element).sort();\n    for(const expandedProperty of keys) {\n      const expandedValue = element[expandedProperty];\n\n      // compact @id\n      if(expandedProperty === '@id') {\n        let compactedValue = _asArray(expandedValue).map(\n          expandedIri => api.compactIri({\n            activeCtx,\n            iri: expandedIri,\n            relativeTo: {vocab: false},\n            base: options.base\n          }));\n        if(compactedValue.length === 1) {\n          compactedValue = compactedValue[0];\n        }\n\n        // use keyword alias and add value\n        const alias = api.compactIri(\n          {activeCtx, iri: '@id', relativeTo: {vocab: true}});\n\n        rval[alias] = compactedValue;\n        continue;\n      }\n\n      // compact @type(s)\n      if(expandedProperty === '@type') {\n        // resolve type values against previous context\n        let compactedValue = _asArray(expandedValue).map(\n          expandedIri => api.compactIri({\n            activeCtx: inputCtx,\n            iri: expandedIri,\n            relativeTo: {vocab: true}\n          }));\n        if(compactedValue.length === 1) {\n          compactedValue = compactedValue[0];\n        }\n\n        // use keyword alias and add value\n        const alias = api.compactIri(\n          {activeCtx, iri: '@type', relativeTo: {vocab: true}});\n        const container = _getContextValue(\n          activeCtx, alias, '@container') || [];\n\n        // treat as array for @type if @container includes @set\n        const typeAsSet =\n          container.includes('@set') &&\n          _processingMode(activeCtx, 1.1);\n        const isArray =\n          typeAsSet || (_isArray(compactedValue) && expandedValue.length === 0);\n        _addValue(rval, alias, compactedValue, {propertyIsArray: isArray});\n        continue;\n      }\n\n      // handle @reverse\n      if(expandedProperty === '@reverse') {\n        // recursively compact expanded value\n        const compactedValue = await api.compact({\n          activeCtx,\n          activeProperty: '@reverse',\n          element: expandedValue,\n          options,\n          compactionMap\n        });\n\n        // handle double-reversed properties\n        for(const compactedProperty in compactedValue) {\n          if(activeCtx.mappings.has(compactedProperty) &&\n            activeCtx.mappings.get(compactedProperty).reverse) {\n            const value = compactedValue[compactedProperty];\n            const container = _getContextValue(\n              activeCtx, compactedProperty, '@container') || [];\n            const useArray = (\n              container.includes('@set') || !options.compactArrays);\n            _addValue(\n              rval, compactedProperty, value, {propertyIsArray: useArray});\n            delete compactedValue[compactedProperty];\n          }\n        }\n\n        if(Object.keys(compactedValue).length > 0) {\n          // use keyword alias and add value\n          const alias = api.compactIri({\n            activeCtx,\n            iri: expandedProperty,\n            relativeTo: {vocab: true}\n          });\n          _addValue(rval, alias, compactedValue);\n        }\n\n        continue;\n      }\n\n      if(expandedProperty === '@preserve') {\n        // compact using activeProperty\n        const compactedValue = await api.compact({\n          activeCtx,\n          activeProperty,\n          element: expandedValue,\n          options,\n          compactionMap\n        });\n\n        if(!(_isArray(compactedValue) && compactedValue.length === 0)) {\n          _addValue(rval, expandedProperty, compactedValue);\n        }\n        continue;\n      }\n\n      // handle @index property\n      if(expandedProperty === '@index') {\n        // drop @index if inside an @index container\n        const container = _getContextValue(\n          activeCtx, activeProperty, '@container') || [];\n        if(container.includes('@index')) {\n          continue;\n        }\n\n        // use keyword alias and add value\n        const alias = api.compactIri({\n          activeCtx,\n          iri: expandedProperty,\n          relativeTo: {vocab: true}\n        });\n        _addValue(rval, alias, expandedValue);\n        continue;\n      }\n\n      // skip array processing for keywords that aren't\n      // @graph, @list, or @included\n      if(expandedProperty !== '@graph' && expandedProperty !== '@list' &&\n        expandedProperty !== '@included' &&\n        _isKeyword(expandedProperty)) {\n        // use keyword alias and add value as is\n        const alias = api.compactIri({\n          activeCtx,\n          iri: expandedProperty,\n          relativeTo: {vocab: true}\n        });\n        _addValue(rval, alias, expandedValue);\n        continue;\n      }\n\n      // Note: expanded value must be an array due to expansion algorithm.\n      if(!_isArray(expandedValue)) {\n        throw new JsonLdError(\n          'JSON-LD expansion error; expanded value must be an array.',\n          'jsonld.SyntaxError');\n      }\n\n      // preserve empty arrays\n      if(expandedValue.length === 0) {\n        const itemActiveProperty = api.compactIri({\n          activeCtx,\n          iri: expandedProperty,\n          value: expandedValue,\n          relativeTo: {vocab: true},\n          reverse: insideReverse\n        });\n        const nestProperty = activeCtx.mappings.has(itemActiveProperty) ?\n          activeCtx.mappings.get(itemActiveProperty)['@nest'] : null;\n        let nestResult = rval;\n        if(nestProperty) {\n          _checkNestProperty(activeCtx, nestProperty, options);\n          if(!_isObject(rval[nestProperty])) {\n            rval[nestProperty] = {};\n          }\n          nestResult = rval[nestProperty];\n        }\n        _addValue(\n          nestResult, itemActiveProperty, expandedValue, {\n            propertyIsArray: true\n          });\n      }\n\n      // recusively process array values\n      for(const expandedItem of expandedValue) {\n        // compact property and get container type\n        const itemActiveProperty = api.compactIri({\n          activeCtx,\n          iri: expandedProperty,\n          value: expandedItem,\n          relativeTo: {vocab: true},\n          reverse: insideReverse\n        });\n\n        // if itemActiveProperty is a @nest property, add values to nestResult,\n        // otherwise rval\n        const nestProperty = activeCtx.mappings.has(itemActiveProperty) ?\n          activeCtx.mappings.get(itemActiveProperty)['@nest'] : null;\n        let nestResult = rval;\n        if(nestProperty) {\n          _checkNestProperty(activeCtx, nestProperty, options);\n          if(!_isObject(rval[nestProperty])) {\n            rval[nestProperty] = {};\n          }\n          nestResult = rval[nestProperty];\n        }\n\n        const container = _getContextValue(\n          activeCtx, itemActiveProperty, '@container') || [];\n\n        // get simple @graph or @list value if appropriate\n        const isGraph = _isGraph(expandedItem);\n        const isList = _isList(expandedItem);\n        let inner;\n        if(isList) {\n          inner = expandedItem['@list'];\n        } else if(isGraph) {\n          inner = expandedItem['@graph'];\n        }\n\n        // recursively compact expanded item\n        let compactedItem = await api.compact({\n          activeCtx,\n          activeProperty: itemActiveProperty,\n          element: (isList || isGraph) ? inner : expandedItem,\n          options,\n          compactionMap\n        });\n\n        // handle @list\n        if(isList) {\n          // ensure @list value is an array\n          if(!_isArray(compactedItem)) {\n            compactedItem = [compactedItem];\n          }\n\n          if(!container.includes('@list')) {\n            // wrap using @list alias\n            compactedItem = {\n              [api.compactIri({\n                activeCtx,\n                iri: '@list',\n                relativeTo: {vocab: true}\n              })]: compactedItem\n            };\n\n            // include @index from expanded @list, if any\n            if('@index' in expandedItem) {\n              compactedItem[api.compactIri({\n                activeCtx,\n                iri: '@index',\n                relativeTo: {vocab: true}\n              })] = expandedItem['@index'];\n            }\n          } else {\n            _addValue(nestResult, itemActiveProperty, compactedItem, {\n              valueIsArray: true,\n              allowDuplicate: true\n            });\n            continue;\n          }\n        }\n\n        // Graph object compaction cases\n        if(isGraph) {\n          if(container.includes('@graph') && (container.includes('@id') ||\n            container.includes('@index') && _isSimpleGraph(expandedItem))) {\n            // get or create the map object\n            let mapObject;\n            if(nestResult.hasOwnProperty(itemActiveProperty)) {\n              mapObject = nestResult[itemActiveProperty];\n            } else {\n              nestResult[itemActiveProperty] = mapObject = {};\n            }\n\n            // index on @id or @index or alias of @none\n            const key = (container.includes('@id') ?\n              expandedItem['@id'] : expandedItem['@index']) ||\n              api.compactIri({activeCtx, iri: '@none',\n                relativeTo: {vocab: true}});\n            // add compactedItem to map, using value of `@id` or a new blank\n            // node identifier\n\n            _addValue(\n              mapObject, key, compactedItem, {\n                propertyIsArray:\n                  (!options.compactArrays || container.includes('@set'))\n              });\n          } else if(container.includes('@graph') &&\n            _isSimpleGraph(expandedItem)) {\n            // container includes @graph but not @id or @index and value is a\n            // simple graph object add compact value\n            // if compactedItem contains multiple values, it is wrapped in\n            // `@included`\n            if(_isArray(compactedItem) && compactedItem.length > 1) {\n              compactedItem = {'@included': compactedItem};\n            }\n            _addValue(\n              nestResult, itemActiveProperty, compactedItem, {\n                propertyIsArray:\n                  (!options.compactArrays || container.includes('@set'))\n              });\n          } else {\n            // wrap using @graph alias, remove array if only one item and\n            // compactArrays not set\n            if(_isArray(compactedItem) && compactedItem.length === 1 &&\n              options.compactArrays) {\n              compactedItem = compactedItem[0];\n            }\n            compactedItem = {\n              [api.compactIri({\n                activeCtx,\n                iri: '@graph',\n                relativeTo: {vocab: true}\n              })]: compactedItem\n            };\n\n            // include @id from expanded graph, if any\n            if('@id' in expandedItem) {\n              compactedItem[api.compactIri({\n                activeCtx,\n                iri: '@id',\n                relativeTo: {vocab: true}\n              })] = expandedItem['@id'];\n            }\n\n            // include @index from expanded graph, if any\n            if('@index' in expandedItem) {\n              compactedItem[api.compactIri({\n                activeCtx,\n                iri: '@index',\n                relativeTo: {vocab: true}\n              })] = expandedItem['@index'];\n            }\n            _addValue(\n              nestResult, itemActiveProperty, compactedItem, {\n                propertyIsArray:\n                  (!options.compactArrays || container.includes('@set'))\n              });\n          }\n        } else if(container.includes('@language') ||\n          container.includes('@index') || container.includes('@id') ||\n          container.includes('@type')) {\n          // handle language and index maps\n          // get or create the map object\n          let mapObject;\n          if(nestResult.hasOwnProperty(itemActiveProperty)) {\n            mapObject = nestResult[itemActiveProperty];\n          } else {\n            nestResult[itemActiveProperty] = mapObject = {};\n          }\n\n          let key;\n          if(container.includes('@language')) {\n          // if container is a language map, simplify compacted value to\n          // a simple string\n            if(_isValue(compactedItem)) {\n              compactedItem = compactedItem['@value'];\n            }\n            key = expandedItem['@language'];\n          } else if(container.includes('@index')) {\n            const indexKey = _getContextValue(\n              activeCtx, itemActiveProperty, '@index') || '@index';\n            const containerKey = api.compactIri(\n              {activeCtx, iri: indexKey, relativeTo: {vocab: true}});\n            if(indexKey === '@index') {\n              key = expandedItem['@index'];\n              delete compactedItem[containerKey];\n            } else {\n              let others;\n              [key, ...others] = _asArray(compactedItem[indexKey] || []);\n              if(!_isString(key)) {\n                // Will use @none if it isn't a string.\n                key = null;\n              } else {\n                switch(others.length) {\n                  case 0:\n                    delete compactedItem[indexKey];\n                    break;\n                  case 1:\n                    compactedItem[indexKey] = others[0];\n                    break;\n                  default:\n                    compactedItem[indexKey] = others;\n                    break;\n                }\n              }\n            }\n          } else if(container.includes('@id')) {\n            const idKey = api.compactIri({activeCtx, iri: '@id',\n              relativeTo: {vocab: true}});\n            key = compactedItem[idKey];\n            delete compactedItem[idKey];\n          } else if(container.includes('@type')) {\n            const typeKey = api.compactIri({\n              activeCtx,\n              iri: '@type',\n              relativeTo: {vocab: true}\n            });\n            let types;\n            [key, ...types] = _asArray(compactedItem[typeKey] || []);\n            switch(types.length) {\n              case 0:\n                delete compactedItem[typeKey];\n                break;\n              case 1:\n                compactedItem[typeKey] = types[0];\n                break;\n              default:\n                compactedItem[typeKey] = types;\n                break;\n            }\n\n            // If compactedItem contains a single entry\n            // whose key maps to @id, recompact without @type\n            if(Object.keys(compactedItem).length === 1 &&\n              '@id' in expandedItem) {\n              compactedItem = await api.compact({\n                activeCtx,\n                activeProperty: itemActiveProperty,\n                element: {'@id': expandedItem['@id']},\n                options,\n                compactionMap\n              });\n            }\n          }\n\n          // if compacting this value which has no key, index on @none\n          if(!key) {\n            key = api.compactIri({activeCtx, iri: '@none',\n              relativeTo: {vocab: true}});\n          }\n          // add compact value to map object using key from expanded value\n          // based on the container type\n          _addValue(\n            mapObject, key, compactedItem, {\n              propertyIsArray: container.includes('@set')\n            });\n        } else {\n          // use an array if: compactArrays flag is false,\n          // @container is @set or @list , value is an empty\n          // array, or key is @graph\n          const isArray = (!options.compactArrays ||\n            container.includes('@set') || container.includes('@list') ||\n            (_isArray(compactedItem) && compactedItem.length === 0) ||\n            expandedProperty === '@list' || expandedProperty === '@graph');\n\n          // add compact value\n          _addValue(\n            nestResult, itemActiveProperty, compactedItem,\n            {propertyIsArray: isArray});\n        }\n      }\n    }\n\n    return rval;\n  }\n\n  // only primitives remain which are already compact\n  return element;\n};\n\n/**\n * Compacts an IRI or keyword into a term or prefix if it can be. If the\n * IRI has an associated value it may be passed.\n *\n * @param activeCtx the active context to use.\n * @param iri the IRI to compact.\n * @param value the value to check or null.\n * @param relativeTo options for how to compact IRIs:\n *          vocab: true to split after @vocab, false not to.\n * @param reverse true if a reverse property is being compacted, false if not.\n * @param base the absolute URL to use for compacting document-relative IRIs.\n *\n * @return the compacted term, prefix, keyword alias, or the original IRI.\n */\napi.compactIri = ({\n  activeCtx,\n  iri,\n  value = null,\n  relativeTo = {vocab: false},\n  reverse = false,\n  base = null\n}) => {\n  // can't compact null\n  if(iri === null) {\n    return iri;\n  }\n\n  // if context is from a property term scoped context composed with a\n  // type-scoped context, then use the previous context instead\n  if(activeCtx.isPropertyTermScoped && activeCtx.previousContext) {\n    activeCtx = activeCtx.previousContext;\n  }\n\n  const inverseCtx = activeCtx.getInverse();\n\n  // if term is a keyword, it may be compacted to a simple alias\n  if(_isKeyword(iri) &&\n    iri in inverseCtx &&\n    '@none' in inverseCtx[iri] &&\n    '@type' in inverseCtx[iri]['@none'] &&\n    '@none' in inverseCtx[iri]['@none']['@type']) {\n    return inverseCtx[iri]['@none']['@type']['@none'];\n  }\n\n  // use inverse context to pick a term if iri is relative to vocab\n  if(relativeTo.vocab && iri in inverseCtx) {\n    const defaultLanguage = activeCtx['@language'] || '@none';\n\n    // prefer @index if available in value\n    const containers = [];\n    if(_isObject(value) && '@index' in value && !('@graph' in value)) {\n      containers.push('@index', '@index@set');\n    }\n\n    // if value is a preserve object, use its value\n    if(_isObject(value) && '@preserve' in value) {\n      value = value['@preserve'][0];\n    }\n\n    // prefer most specific container including @graph, prefering @set\n    // variations\n    if(_isGraph(value)) {\n      // favor indexmap if the graph is indexed\n      if('@index' in value) {\n        containers.push(\n          '@graph@index', '@graph@index@set', '@index', '@index@set');\n      }\n      // favor idmap if the graph is has an @id\n      if('@id' in value) {\n        containers.push(\n          '@graph@id', '@graph@id@set');\n      }\n      containers.push('@graph', '@graph@set', '@set');\n      // allow indexmap if the graph is not indexed\n      if(!('@index' in value)) {\n        containers.push(\n          '@graph@index', '@graph@index@set', '@index', '@index@set');\n      }\n      // allow idmap if the graph does not have an @id\n      if(!('@id' in value)) {\n        containers.push('@graph@id', '@graph@id@set');\n      }\n    } else if(_isObject(value) && !_isValue(value)) {\n      containers.push('@id', '@id@set', '@type', '@set@type');\n    }\n\n    // defaults for term selection based on type/language\n    let typeOrLanguage = '@language';\n    let typeOrLanguageValue = '@null';\n\n    if(reverse) {\n      typeOrLanguage = '@type';\n      typeOrLanguageValue = '@reverse';\n      containers.push('@set');\n    } else if(_isList(value)) {\n      // choose the most specific term that works for all elements in @list\n      // only select @list containers if @index is NOT in value\n      if(!('@index' in value)) {\n        containers.push('@list');\n      }\n      const list = value['@list'];\n      if(list.length === 0) {\n        // any empty list can be matched against any term that uses the\n        // @list container regardless of @type or @language\n        typeOrLanguage = '@any';\n        typeOrLanguageValue = '@none';\n      } else {\n        let commonLanguage = (list.length === 0) ? defaultLanguage : null;\n        let commonType = null;\n        for(let i = 0; i < list.length; ++i) {\n          const item = list[i];\n          let itemLanguage = '@none';\n          let itemType = '@none';\n          if(_isValue(item)) {\n            if('@direction' in item) {\n              const lang = (item['@language'] || '').toLowerCase();\n              const dir = item['@direction'];\n              itemLanguage = `${lang}_${dir}`;\n            } else if('@language' in item) {\n              itemLanguage = item['@language'].toLowerCase();\n            } else if('@type' in item) {\n              itemType = item['@type'];\n            } else {\n              // plain literal\n              itemLanguage = '@null';\n            }\n          } else {\n            itemType = '@id';\n          }\n          if(commonLanguage === null) {\n            commonLanguage = itemLanguage;\n          } else if(itemLanguage !== commonLanguage && _isValue(item)) {\n            commonLanguage = '@none';\n          }\n          if(commonType === null) {\n            commonType = itemType;\n          } else if(itemType !== commonType) {\n            commonType = '@none';\n          }\n          // there are different languages and types in the list, so choose\n          // the most generic term, no need to keep iterating the list\n          if(commonLanguage === '@none' && commonType === '@none') {\n            break;\n          }\n        }\n        commonLanguage = commonLanguage || '@none';\n        commonType = commonType || '@none';\n        if(commonType !== '@none') {\n          typeOrLanguage = '@type';\n          typeOrLanguageValue = commonType;\n        } else {\n          typeOrLanguageValue = commonLanguage;\n        }\n      }\n    } else {\n      if(_isValue(value)) {\n        if('@language' in value && !('@index' in value)) {\n          containers.push('@language', '@language@set');\n          typeOrLanguageValue = value['@language'];\n          const dir = value['@direction'];\n          if(dir) {\n            typeOrLanguageValue = `${typeOrLanguageValue}_${dir}`;\n          }\n        } else if('@direction' in value && !('@index' in value)) {\n          typeOrLanguageValue = `_${value['@direction']}`;\n        } else if('@type' in value) {\n          typeOrLanguage = '@type';\n          typeOrLanguageValue = value['@type'];\n        }\n      } else {\n        typeOrLanguage = '@type';\n        typeOrLanguageValue = '@id';\n      }\n      containers.push('@set');\n    }\n\n    // do term selection\n    containers.push('@none');\n\n    // an index map can be used to index values using @none, so add as a low\n    // priority\n    if(_isObject(value) && !('@index' in value)) {\n      // allow indexing even if no @index present\n      containers.push('@index', '@index@set');\n    }\n\n    // values without type or language can use @language map\n    if(_isValue(value) && Object.keys(value).length === 1) {\n      // allow indexing even if no @index present\n      containers.push('@language', '@language@set');\n    }\n\n    const term = _selectTerm(\n      activeCtx, iri, value, containers, typeOrLanguage, typeOrLanguageValue);\n    if(term !== null) {\n      return term;\n    }\n  }\n\n  // no term match, use @vocab if available\n  if(relativeTo.vocab) {\n    if('@vocab' in activeCtx) {\n      // determine if vocab is a prefix of the iri\n      const vocab = activeCtx['@vocab'];\n      if(iri.indexOf(vocab) === 0 && iri !== vocab) {\n        // use suffix as relative iri if it is not a term in the active context\n        const suffix = iri.substr(vocab.length);\n        if(!activeCtx.mappings.has(suffix)) {\n          return suffix;\n        }\n      }\n    }\n  }\n\n  // no term or @vocab match, check for possible CURIEs\n  let choice = null;\n  // TODO: make FastCurieMap a class with a method to do this lookup\n  const partialMatches = [];\n  let iriMap = activeCtx.fastCurieMap;\n  // check for partial matches of against `iri`, which means look until\n  // iri.length - 1, not full length\n  const maxPartialLength = iri.length - 1;\n  for(let i = 0; i < maxPartialLength && iri[i] in iriMap; ++i) {\n    iriMap = iriMap[iri[i]];\n    if('' in iriMap) {\n      partialMatches.push(iriMap[''][0]);\n    }\n  }\n  // check partial matches in reverse order to prefer longest ones first\n  for(let i = partialMatches.length - 1; i >= 0; --i) {\n    const entry = partialMatches[i];\n    const terms = entry.terms;\n    for(const term of terms) {\n      // a CURIE is usable if:\n      // 1. it has no mapping, OR\n      // 2. value is null, which means we're not compacting an @value, AND\n      //   the mapping matches the IRI\n      const curie = term + ':' + iri.substr(entry.iri.length);\n      const isUsableCurie = (activeCtx.mappings.get(term)._prefix &&\n        (!activeCtx.mappings.has(curie) ||\n        (value === null && activeCtx.mappings.get(curie)['@id'] === iri)));\n\n      // select curie if it is shorter or the same length but lexicographically\n      // less than the current choice\n      if(isUsableCurie && (choice === null ||\n        _compareShortestLeast(curie, choice) < 0)) {\n        choice = curie;\n      }\n    }\n  }\n\n  // return chosen curie\n  if(choice !== null) {\n    return choice;\n  }\n\n  // If iri could be confused with a compact IRI using a term in this context,\n  // signal an error\n  for(const [term, td] of activeCtx.mappings) {\n    if(td && td._prefix && iri.startsWith(term + ':')) {\n      throw new JsonLdError(\n        `Absolute IRI \"${iri}\" confused with prefix \"${term}\".`,\n        'jsonld.SyntaxError',\n        {code: 'IRI confused with prefix', context: activeCtx});\n    }\n  }\n\n  // compact IRI relative to base\n  if(!relativeTo.vocab) {\n    if('@base' in activeCtx) {\n      if(!activeCtx['@base']) {\n        // The None case preserves rval as potentially relative\n        return iri;\n      } else {\n        return _removeBase(_prependBase(base, activeCtx['@base']), iri);\n      }\n    } else {\n      return _removeBase(base, iri);\n    }\n  }\n\n  // return IRI as is\n  return iri;\n};\n\n/**\n * Performs value compaction on an object with '@value' or '@id' as the only\n * property.\n *\n * @param activeCtx the active context.\n * @param activeProperty the active property that points to the value.\n * @param value the value to compact.\n * @param {Object} [options] - processing options.\n *\n * @return the compaction result.\n */\napi.compactValue = ({activeCtx, activeProperty, value, options}) => {\n  // value is a @value\n  if(_isValue(value)) {\n    // get context rules\n    const type = _getContextValue(activeCtx, activeProperty, '@type');\n    const language = _getContextValue(activeCtx, activeProperty, '@language');\n    const direction = _getContextValue(activeCtx, activeProperty, '@direction');\n    const container =\n      _getContextValue(activeCtx, activeProperty, '@container') || [];\n\n    // whether or not the value has an @index that must be preserved\n    const preserveIndex = '@index' in value && !container.includes('@index');\n\n    // if there's no @index to preserve ...\n    if(!preserveIndex && type !== '@none') {\n      // matching @type or @language specified in context, compact value\n      if(value['@type'] === type) {\n        return value['@value'];\n      }\n      if('@language' in value && value['@language'] === language &&\n         '@direction' in value && value['@direction'] === direction) {\n        return value['@value'];\n      }\n      if('@language' in value && value['@language'] === language) {\n        return value['@value'];\n      }\n      if('@direction' in value && value['@direction'] === direction) {\n        return value['@value'];\n      }\n    }\n\n    // return just the value of @value if all are true:\n    // 1. @value is the only key or @index isn't being preserved\n    // 2. there is no default language or @value is not a string or\n    //   the key has a mapping with a null @language\n    const keyCount = Object.keys(value).length;\n    const isValueOnlyKey = (keyCount === 1 ||\n      (keyCount === 2 && '@index' in value && !preserveIndex));\n    const hasDefaultLanguage = ('@language' in activeCtx);\n    const isValueString = _isString(value['@value']);\n    const hasNullMapping = (activeCtx.mappings.has(activeProperty) &&\n      activeCtx.mappings.get(activeProperty)['@language'] === null);\n    if(isValueOnlyKey &&\n      type !== '@none' &&\n      (!hasDefaultLanguage || !isValueString || hasNullMapping)) {\n      return value['@value'];\n    }\n\n    const rval = {};\n\n    // preserve @index\n    if(preserveIndex) {\n      rval[api.compactIri({\n        activeCtx,\n        iri: '@index',\n        relativeTo: {vocab: true}\n      })] = value['@index'];\n    }\n\n    if('@type' in value) {\n      // compact @type IRI\n      rval[api.compactIri({\n        activeCtx,\n        iri: '@type',\n        relativeTo: {vocab: true}\n      })] = api.compactIri(\n        {activeCtx, iri: value['@type'], relativeTo: {vocab: true}});\n    } else if('@language' in value) {\n      // alias @language\n      rval[api.compactIri({\n        activeCtx,\n        iri: '@language',\n        relativeTo: {vocab: true}\n      })] = value['@language'];\n    }\n\n    if('@direction' in value) {\n      // alias @direction\n      rval[api.compactIri({\n        activeCtx,\n        iri: '@direction',\n        relativeTo: {vocab: true}\n      })] = value['@direction'];\n    }\n\n    // alias @value\n    rval[api.compactIri({\n      activeCtx,\n      iri: '@value',\n      relativeTo: {vocab: true}\n    })] = value['@value'];\n\n    return rval;\n  }\n\n  // value is a subject reference\n  const expandedProperty = _expandIri(activeCtx, activeProperty, {vocab: true},\n    options);\n  const type = _getContextValue(activeCtx, activeProperty, '@type');\n  const compacted = api.compactIri({\n    activeCtx,\n    iri: value['@id'],\n    relativeTo: {vocab: type === '@vocab'},\n    base: options.base});\n\n  // compact to scalar\n  if(type === '@id' || type === '@vocab' || expandedProperty === '@graph') {\n    return compacted;\n  }\n\n  return {\n    [api.compactIri({\n      activeCtx,\n      iri: '@id',\n      relativeTo: {vocab: true}\n    })]: compacted\n  };\n};\n\n/**\n * Picks the preferred compaction term from the given inverse context entry.\n *\n * @param activeCtx the active context.\n * @param iri the IRI to pick the term for.\n * @param value the value to pick the term for.\n * @param containers the preferred containers.\n * @param typeOrLanguage either '@type' or '@language'.\n * @param typeOrLanguageValue the preferred value for '@type' or '@language'.\n *\n * @return the preferred term.\n */\nfunction _selectTerm(\n  activeCtx, iri, value, containers, typeOrLanguage, typeOrLanguageValue) {\n  if(typeOrLanguageValue === null) {\n    typeOrLanguageValue = '@null';\n  }\n\n  // preferences for the value of @type or @language\n  const prefs = [];\n\n  // determine prefs for @id based on whether or not value compacts to a term\n  if((typeOrLanguageValue === '@id' || typeOrLanguageValue === '@reverse') &&\n    _isObject(value) && '@id' in value) {\n    // prefer @reverse first\n    if(typeOrLanguageValue === '@reverse') {\n      prefs.push('@reverse');\n    }\n    // try to compact value to a term\n    const term = api.compactIri(\n      {activeCtx, iri: value['@id'], relativeTo: {vocab: true}});\n    if(activeCtx.mappings.has(term) &&\n      activeCtx.mappings.get(term) &&\n      activeCtx.mappings.get(term)['@id'] === value['@id']) {\n      // prefer @vocab\n      prefs.push.apply(prefs, ['@vocab', '@id']);\n    } else {\n      // prefer @id\n      prefs.push.apply(prefs, ['@id', '@vocab']);\n    }\n  } else {\n    prefs.push(typeOrLanguageValue);\n\n    // consider direction only\n    const langDir = prefs.find(el => el.includes('_'));\n    if(langDir) {\n      // consider _dir portion\n      prefs.push(langDir.replace(/^[^_]+_/, '_'));\n    }\n  }\n  prefs.push('@none');\n\n  const containerMap = activeCtx.inverse[iri];\n  for(const container of containers) {\n    // if container not available in the map, continue\n    if(!(container in containerMap)) {\n      continue;\n    }\n\n    const typeOrLanguageValueMap = containerMap[container][typeOrLanguage];\n    for(const pref of prefs) {\n      // if type/language option not available in the map, continue\n      if(!(pref in typeOrLanguageValueMap)) {\n        continue;\n      }\n\n      // select term\n      return typeOrLanguageValueMap[pref];\n    }\n  }\n\n  return null;\n}\n\n/**\n * The value of `@nest` in the term definition must either be `@nest`, or a term\n * which resolves to `@nest`.\n *\n * @param activeCtx the active context.\n * @param nestProperty a term in the active context or `@nest`.\n * @param {Object} [options] - processing options.\n */\nfunction _checkNestProperty(activeCtx, nestProperty, options) {\n  if(_expandIri(activeCtx, nestProperty, {vocab: true}, options) !== '@nest') {\n    throw new JsonLdError(\n      'JSON-LD compact error; nested property must have an @nest value ' +\n      'resolving to @nest.',\n      'jsonld.SyntaxError', {code: 'invalid @nest value'});\n  }\n}\n","/*\n * Copyright (c) 2017 Digital Bazaar, Inc. All rights reserved.\n */\n'use strict';\n\nmodule.exports = jsonld => {\n  class JsonLdProcessor {\n    toString() {\n      return '[object JsonLdProcessor]';\n    }\n  }\n  Object.defineProperty(JsonLdProcessor, 'prototype', {\n    writable: false,\n    enumerable: false\n  });\n  Object.defineProperty(JsonLdProcessor.prototype, 'constructor', {\n    writable: true,\n    enumerable: false,\n    configurable: true,\n    value: JsonLdProcessor\n  });\n\n  // The Web IDL test harness will check the number of parameters defined in\n  // the functions below. The number of parameters must exactly match the\n  // required (non-optional) parameters of the JsonLdProcessor interface as\n  // defined here:\n  // https://www.w3.org/TR/json-ld-api/#the-jsonldprocessor-interface\n\n  JsonLdProcessor.compact = function(input, ctx) {\n    if(arguments.length < 2) {\n      return Promise.reject(\n        new TypeError('Could not compact, too few arguments.'));\n    }\n    return jsonld.compact(input, ctx);\n  };\n  JsonLdProcessor.expand = function(input) {\n    if(arguments.length < 1) {\n      return Promise.reject(\n        new TypeError('Could not expand, too few arguments.'));\n    }\n    return jsonld.expand(input);\n  };\n  JsonLdProcessor.flatten = function(input) {\n    if(arguments.length < 1) {\n      return Promise.reject(\n        new TypeError('Could not flatten, too few arguments.'));\n    }\n    return jsonld.flatten(input);\n  };\n\n  return JsonLdProcessor;\n};\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <http://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar isArray = require('isarray')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n *     incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n  ? global.TYPED_ARRAY_SUPPORT\n  : typedArraySupport()\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nexports.kMaxLength = kMaxLength()\n\nfunction typedArraySupport () {\n  try {\n    var arr = new Uint8Array(1)\n    arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n    return arr.foo() === 42 && // typed array instances can be augmented\n        typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n        arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n  } catch (e) {\n    return false\n  }\n}\n\nfunction kMaxLength () {\n  return Buffer.TYPED_ARRAY_SUPPORT\n    ? 0x7fffffff\n    : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n  if (kMaxLength() < length) {\n    throw new RangeError('Invalid typed array length')\n  }\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = new Uint8Array(length)\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    if (that === null) {\n      that = new Buffer(length)\n    }\n    that.length = length\n  }\n\n  return that\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n    return new Buffer(arg, encodingOrOffset, length)\n  }\n\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new Error(\n        'If encoding is specified then the first argument must be a string'\n      )\n    }\n    return allocUnsafe(this, arg)\n  }\n  return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n  arr.__proto__ = Buffer.prototype\n  return arr\n}\n\nfunction from (that, value, encodingOrOffset, length) {\n  if (typeof value === 'number') {\n    throw new TypeError('\"value\" argument must not be a number')\n  }\n\n  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n    return fromArrayBuffer(that, value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'string') {\n    return fromString(that, value, encodingOrOffset)\n  }\n\n  return fromObject(that, value)\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(null, value, encodingOrOffset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n  Buffer.prototype.__proto__ = Uint8Array.prototype\n  Buffer.__proto__ = Uint8Array\n  if (typeof Symbol !== 'undefined' && Symbol.species &&\n      Buffer[Symbol.species] === Buffer) {\n    // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n    Object.defineProperty(Buffer, Symbol.species, {\n      value: null,\n      configurable: true\n    })\n  }\n}\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be a number')\n  } else if (size < 0) {\n    throw new RangeError('\"size\" argument must not be negative')\n  }\n}\n\nfunction alloc (that, size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(that, size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpretted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(that, size).fill(fill, encoding)\n      : createBuffer(that, size).fill(fill)\n  }\n  return createBuffer(that, size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(null, size, fill, encoding)\n}\n\nfunction allocUnsafe (that, size) {\n  assertSize(size)\n  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) {\n    for (var i = 0; i < size; ++i) {\n      that[i] = 0\n    }\n  }\n  return that\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(null, size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(null, size)\n}\n\nfunction fromString (that, string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('\"encoding\" must be a valid string encoding')\n  }\n\n  var length = byteLength(string, encoding) | 0\n  that = createBuffer(that, length)\n\n  var actual = that.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    that = that.slice(0, actual)\n  }\n\n  return that\n}\n\nfunction fromArrayLike (that, array) {\n  var length = array.length < 0 ? 0 : checked(array.length) | 0\n  that = createBuffer(that, length)\n  for (var i = 0; i < length; i += 1) {\n    that[i] = array[i] & 255\n  }\n  return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n  array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\\'offset\\' is out of bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\\'length\\' is out of bounds')\n  }\n\n  if (byteOffset === undefined && length === undefined) {\n    array = new Uint8Array(array)\n  } else if (length === undefined) {\n    array = new Uint8Array(array, byteOffset)\n  } else {\n    array = new Uint8Array(array, byteOffset, length)\n  }\n\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    // Return an augmented `Uint8Array` instance, for best performance\n    that = array\n    that.__proto__ = Buffer.prototype\n  } else {\n    // Fallback: Return an object instance of the Buffer class\n    that = fromArrayLike(that, array)\n  }\n  return that\n}\n\nfunction fromObject (that, obj) {\n  if (Buffer.isBuffer(obj)) {\n    var len = checked(obj.length) | 0\n    that = createBuffer(that, len)\n\n    if (that.length === 0) {\n      return that\n    }\n\n    obj.copy(that, 0, 0, len)\n    return that\n  }\n\n  if (obj) {\n    if ((typeof ArrayBuffer !== 'undefined' &&\n        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n      if (typeof obj.length !== 'number' || isnan(obj.length)) {\n        return createBuffer(that, 0)\n      }\n      return fromArrayLike(that, obj)\n    }\n\n    if (obj.type === 'Buffer' && isArray(obj.data)) {\n      return fromArrayLike(that, obj.data)\n    }\n  }\n\n  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < kMaxLength()` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= kMaxLength()) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + kMaxLength().toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError('Arguments must be Buffers')\n  }\n\n  if (a === b) return 0\n\n  var x = a.length\n  var y = b.length\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  var i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  var buffer = Buffer.allocUnsafe(length)\n  var pos = 0\n  for (i = 0; i < list.length; ++i) {\n    var buf = list[i]\n    if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    }\n    buf.copy(buffer, pos)\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    string = '' + string\n  }\n\n  var len = string.length\n  if (len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n      case undefined:\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) return utf8ToBytes(string).length // assume utf8\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  var loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  var i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  var len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (var i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  var len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (var i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  var len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (var i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  var length = this.length | 0\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  var str = ''\n  var max = exports.INSPECT_MAX_BYTES\n  if (this.length > 0) {\n    str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n    if (this.length > max) str += ' ... '\n  }\n  return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError('Argument must be a Buffer')\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  var x = thisEnd - thisStart\n  var y = end - start\n  var len = Math.min(x, y)\n\n  var thisCopy = this.slice(thisStart, thisEnd)\n  var targetCopy = target.slice(start, end)\n\n  for (var i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset  // Coerce to Number.\n  if (isNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (Buffer.TYPED_ARRAY_SUPPORT &&\n        typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  var indexSize = 1\n  var arrLength = arr.length\n  var valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  var i\n  if (dir) {\n    var foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      var found = true\n      for (var j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  var remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  // must be an even number of digits\n  var strLen = string.length\n  if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  for (var i = 0; i < length; ++i) {\n    var parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (isNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n  return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset | 0\n    if (isFinite(length)) {\n      length = length | 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  // legacy write(string, encoding, offset, length) - remove in v0.13\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  var remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n        return asciiWrite(this, string, offset, length)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Write(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  var res = []\n\n  var i = start\n  while (i < end) {\n    var firstByte = buf[i]\n    var codePoint = null\n    var bytesPerSequence = (firstByte > 0xEF) ? 4\n      : (firstByte > 0xDF) ? 3\n      : (firstByte > 0xBF) ? 2\n      : 1\n\n    if (i + bytesPerSequence <= end) {\n      var secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  var len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  var res = ''\n  var i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  var len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  var out = ''\n  for (var i = start; i < end; ++i) {\n    out += toHex(buf[i])\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  var bytes = buf.slice(start, end)\n  var res = ''\n  for (var i = 0; i < bytes.length; i += 2) {\n    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  var len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  var newBuf\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    newBuf = this.subarray(start, end)\n    newBuf.__proto__ = Buffer.prototype\n  } else {\n    var sliceLen = end - start\n    newBuf = new Buffer(sliceLen, undefined)\n    for (var i = 0; i < sliceLen; ++i) {\n      newBuf[i] = this[i + start]\n    }\n  }\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  var val = this[offset + --byteLength]\n  var mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var i = byteLength\n  var mul = 1\n  var val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var mul = 1\n  var i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  byteLength = byteLength | 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n    buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n      (littleEndian ? i : 1 - i) * 8\n  }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n  if (value < 0) value = 0xffffffff + value + 1\n  for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n    buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n  }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset + 3] = (value >>> 24)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 1] = (value >>> 8)\n    this[offset] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = 0\n  var mul = 1\n  var sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) {\n    var limit = Math.pow(2, 8 * byteLength - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  var sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n  } else {\n    objectWriteUInt16(this, value, offset, true)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 8)\n    this[offset + 1] = (value & 0xff)\n  } else {\n    objectWriteUInt16(this, value, offset, false)\n  }\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value & 0xff)\n    this[offset + 1] = (value >>> 8)\n    this[offset + 2] = (value >>> 16)\n    this[offset + 3] = (value >>> 24)\n  } else {\n    objectWriteUInt32(this, value, offset, true)\n  }\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset | 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  if (Buffer.TYPED_ARRAY_SUPPORT) {\n    this[offset] = (value >>> 24)\n    this[offset + 1] = (value >>> 16)\n    this[offset + 2] = (value >>> 8)\n    this[offset + 3] = (value & 0xff)\n  } else {\n    objectWriteUInt32(this, value, offset, false)\n  }\n  return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  var len = end - start\n  var i\n\n  if (this === target && start < targetStart && targetStart < end) {\n    // descending copy from end\n    for (i = len - 1; i >= 0; --i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n    // ascending copy from start\n    for (i = 0; i < len; ++i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, start + len),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (val.length === 1) {\n      var code = val.charCodeAt(0)\n      if (code < 256) {\n        val = code\n      }\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  var i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    var bytes = Buffer.isBuffer(val)\n      ? val\n      : utf8ToBytes(new Buffer(val, encoding).toString())\n    var len = bytes.length\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction stringtrim (str) {\n  if (str.trim) return str.trim()\n  return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n  if (n < 16) return '0' + n.toString(16)\n  return n.toString(16)\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  var codePoint\n  var length = string.length\n  var leadSurrogate = null\n  var bytes = []\n\n  for (var i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  var c, hi, lo\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  for (var i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\nfunction isnan (val) {\n  return val !== val // eslint-disable-line no-self-compare\n}\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n  return toString.call(arr) == '[object Array]';\n};\n","// **N3Parser** parses N3 documents.\nimport N3Lexer from './N3Lexer';\nimport N3DataFactory from './N3DataFactory';\nimport namespaces from './IRIs';\n\nlet blankNodePrefix = 0;\n\n// ## Constructor\nexport default class N3Parser {\n  constructor(options) {\n    this._contextStack = [];\n    this._graph = null;\n\n    // Set the document IRI\n    options = options || {};\n    this._setBase(options.baseIRI);\n    options.factory && initDataFactory(this, options.factory);\n\n    // Set supported features depending on the format\n    const format = (typeof options.format === 'string') ?\n                 options.format.match(/\\w*$/)[0].toLowerCase() : '',\n        isTurtle = /turtle/.test(format), isTriG = /trig/.test(format),\n        isNTriples = /triple/.test(format), isNQuads = /quad/.test(format),\n        isN3 = this._n3Mode = /n3/.test(format),\n        isLineMode = isNTriples || isNQuads;\n    if (!(this._supportsNamedGraphs = !(isTurtle || isN3)))\n      this._readPredicateOrNamedGraph = this._readPredicate;\n    // Support triples in other graphs\n    this._supportsQuads = !(isTurtle || isTriG || isNTriples || isN3);\n    // Support nesting of triples\n    this._supportsRDFStar = format === '' || /star|\\*$/.test(format);\n    // Disable relative IRIs in N-Triples or N-Quads mode\n    if (isLineMode)\n      this._resolveRelativeIRI = iri => { return null; };\n    this._blankNodePrefix = typeof options.blankNodePrefix !== 'string' ? '' :\n                              options.blankNodePrefix.replace(/^(?!_:)/, '_:');\n    this._lexer = options.lexer || new N3Lexer({ lineMode: isLineMode, n3: isN3 });\n    // Disable explicit quantifiers by default\n    this._explicitQuantifiers = !!options.explicitQuantifiers;\n  }\n\n  // ## Static class methods\n\n  // ### `_resetBlankNodePrefix` restarts blank node prefix identification\n  static _resetBlankNodePrefix() {\n    blankNodePrefix = 0;\n  }\n\n  // ## Private methods\n\n  // ### `_setBase` sets the base IRI to resolve relative IRIs\n  _setBase(baseIRI) {\n    if (!baseIRI) {\n      this._base = '';\n      this._basePath = '';\n    }\n    else {\n      // Remove fragment if present\n      const fragmentPos = baseIRI.indexOf('#');\n      if (fragmentPos >= 0)\n        baseIRI = baseIRI.substr(0, fragmentPos);\n      // Set base IRI and its components\n      this._base = baseIRI;\n      this._basePath   = baseIRI.indexOf('/') < 0 ? baseIRI :\n                         baseIRI.replace(/[^\\/?]*(?:\\?.*)?$/, '');\n      baseIRI = baseIRI.match(/^(?:([a-z][a-z0-9+.-]*:))?(?:\\/\\/[^\\/]*)?/i);\n      this._baseRoot   = baseIRI[0];\n      this._baseScheme = baseIRI[1];\n    }\n  }\n\n  // ### `_saveContext` stores the current parsing context\n  // when entering a new scope (list, blank node, formula)\n  _saveContext(type, graph, subject, predicate, object) {\n    const n3Mode = this._n3Mode;\n    this._contextStack.push({\n      subject: subject, predicate: predicate, object: object,\n      graph: graph, type: type,\n      inverse: n3Mode ? this._inversePredicate : false,\n      blankPrefix: n3Mode ? this._prefixes._ : '',\n      quantified: n3Mode ? this._quantified : null,\n    });\n    // The settings below only apply to N3 streams\n    if (n3Mode) {\n      // Every new scope resets the predicate direction\n      this._inversePredicate = false;\n      // In N3, blank nodes are scoped to a formula\n      // (using a dot as separator, as a blank node label cannot start with it)\n      this._prefixes._ = (this._graph ? `${this._graph.id.substr(2)}.` : '.');\n      // Quantifiers are scoped to a formula\n      this._quantified = Object.create(this._quantified);\n    }\n  }\n\n  // ### `_restoreContext` restores the parent context\n  // when leaving a scope (list, blank node, formula)\n  _restoreContext() {\n    const context = this._contextStack.pop(), n3Mode = this._n3Mode;\n    this._subject   = context.subject;\n    this._predicate = context.predicate;\n    this._object    = context.object;\n    this._graph     = context.graph;\n    // The settings below only apply to N3 streams\n    if (n3Mode) {\n      this._inversePredicate = context.inverse;\n      this._prefixes._ = context.blankPrefix;\n      this._quantified = context.quantified;\n    }\n  }\n\n  // ### `_readInTopContext` reads a token when in the top context\n  _readInTopContext(token) {\n    switch (token.type) {\n    // If an EOF token arrives in the top context, signal that we're done\n    case 'eof':\n      if (this._graph !== null)\n        return this._error('Unclosed graph', token);\n      delete this._prefixes._;\n      return this._callback(null, null, this._prefixes);\n    // It could be a prefix declaration\n    case 'PREFIX':\n      this._sparqlStyle = true;\n    case '@prefix':\n      return this._readPrefix;\n    // It could be a base declaration\n    case 'BASE':\n      this._sparqlStyle = true;\n    case '@base':\n      return this._readBaseIRI;\n    // It could be a graph\n    case '{':\n      if (this._supportsNamedGraphs) {\n        this._graph = '';\n        this._subject = null;\n        return this._readSubject;\n      }\n    case 'GRAPH':\n      if (this._supportsNamedGraphs)\n        return this._readNamedGraphLabel;\n    // Otherwise, the next token must be a subject\n    default:\n      return this._readSubject(token);\n    }\n  }\n\n  // ### `_readEntity` reads an IRI, prefixed name, blank node, or variable\n  _readEntity(token, quantifier) {\n    let value;\n    switch (token.type) {\n    // Read a relative or absolute IRI\n    case 'IRI':\n    case 'typeIRI':\n      const iri = this._resolveIRI(token.value);\n      if (iri === null)\n        return this._error('Invalid IRI', token);\n      value = this._namedNode(iri);\n      break;\n    // Read a prefixed name\n    case 'type':\n    case 'prefixed':\n      const prefix = this._prefixes[token.prefix];\n      if (prefix === undefined)\n        return this._error(`Undefined prefix \"${token.prefix}:\"`, token);\n      value = this._namedNode(prefix + token.value);\n      break;\n    // Read a blank node\n    case 'blank':\n      value = this._blankNode(this._prefixes[token.prefix] + token.value);\n      break;\n    // Read a variable\n    case 'var':\n      value = this._variable(token.value.substr(1));\n      break;\n    // Everything else is not an entity\n    default:\n      return this._error(`Expected entity but got ${token.type}`, token);\n    }\n    // In N3 mode, replace the entity if it is quantified\n    if (!quantifier && this._n3Mode && (value.id in this._quantified))\n      value = this._quantified[value.id];\n    return value;\n  }\n\n  // ### `_readSubject` reads a quad's subject\n  _readSubject(token) {\n    this._predicate = null;\n    switch (token.type) {\n    case '[':\n      // Start a new quad with a new blank node as subject\n      this._saveContext('blank', this._graph,\n                        this._subject = this._blankNode(), null, null);\n      return this._readBlankNodeHead;\n    case '(':\n      // Start a new list\n      this._saveContext('list', this._graph, this.RDF_NIL, null, null);\n      this._subject = null;\n      return this._readListItem;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph,\n                        this._graph = this._blankNode(), null, null);\n      return this._readSubject;\n    case '}':\n       // No subject; the graph in which we are reading is closed instead\n      return this._readPunctuation(token);\n    case '@forSome':\n      if (!this._n3Mode)\n        return this._error('Unexpected \"@forSome\"', token);\n      this._subject = null;\n      this._predicate = this.N3_FORSOME;\n      this._quantifier = this._blankNode;\n      return this._readQuantifierList;\n    case '@forAll':\n      if (!this._n3Mode)\n        return this._error('Unexpected \"@forAll\"', token);\n      this._subject = null;\n      this._predicate = this.N3_FORALL;\n      this._quantifier = this._variable;\n      return this._readQuantifierList;\n    case 'literal':\n      if (!this._n3Mode)\n        return this._error('Unexpected literal', token);\n\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        return this._completeSubjectLiteral;\n      }\n      else\n        this._subject = this._literal(token.value, this._namedNode(token.prefix));\n\n      break;\n    case '<<':\n      if (!this._supportsRDFStar)\n        return this._error('Unexpected RDF* syntax', token);\n      this._saveContext('<<', this._graph, null, null, null);\n      this._graph = null;\n      return this._readSubject;\n    default:\n      // Read the subject entity\n      if ((this._subject = this._readEntity(token)) === undefined)\n        return;\n      // In N3 mode, the subject might be a path\n      if (this._n3Mode)\n        return this._getPathReader(this._readPredicateOrNamedGraph);\n    }\n\n    // The next token must be a predicate,\n    // or, if the subject was actually a graph IRI, a named graph\n    return this._readPredicateOrNamedGraph;\n  }\n\n  // ### `_readPredicate` reads a quad's predicate\n  _readPredicate(token) {\n    const type = token.type;\n    switch (type) {\n    case 'inverse':\n      this._inversePredicate = true;\n    case 'abbreviation':\n      this._predicate = this.ABBREVIATIONS[token.value];\n      break;\n    case '.':\n    case ']':\n    case '}':\n      // Expected predicate didn't come, must have been trailing semicolon\n      if (this._predicate === null)\n        return this._error(`Unexpected ${type}`, token);\n      this._subject = null;\n      return type === ']' ? this._readBlankNodeTail(token) : this._readPunctuation(token);\n    case ';':\n      // Additional semicolons can be safely ignored\n      return this._predicate !== null ? this._readPredicate :\n             this._error('Expected predicate but got ;', token);\n    case 'blank':\n      if (!this._n3Mode)\n        return this._error('Disallowed blank node as predicate', token);\n    default:\n      if ((this._predicate = this._readEntity(token)) === undefined)\n        return;\n    }\n    // The next token must be an object\n    return this._readObject;\n  }\n\n  // ### `_readObject` reads a quad's object\n  _readObject(token) {\n    switch (token.type) {\n    case 'literal':\n      // Regular literal, can still get a datatype or language\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        return this._readDataTypeOrLang;\n      }\n      // Pre-datatyped string literal (prefix stores the datatype)\n      else\n        this._object = this._literal(token.value, this._namedNode(token.prefix));\n      break;\n    case '[':\n      // Start a new quad with a new blank node as subject\n      this._saveContext('blank', this._graph, this._subject, this._predicate,\n                        this._subject = this._blankNode());\n      return this._readBlankNodeHead;\n    case '(':\n      // Start a new list\n      this._saveContext('list', this._graph, this._subject, this._predicate, this.RDF_NIL);\n      this._subject = null;\n      return this._readListItem;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph, this._subject, this._predicate,\n                        this._graph = this._blankNode());\n      return this._readSubject;\n    case '<<':\n      if (!this._supportsRDFStar)\n        return this._error('Unexpected RDF* syntax', token);\n      this._saveContext('<<', this._graph, this._subject, this._predicate, null);\n      this._graph = null;\n      return this._readSubject;\n    default:\n      // Read the object entity\n      if ((this._object = this._readEntity(token)) === undefined)\n        return;\n      // In N3 mode, the object might be a path\n      if (this._n3Mode)\n        return this._getPathReader(this._getContextEndReader());\n    }\n    return this._getContextEndReader();\n  }\n\n  // ### `_readPredicateOrNamedGraph` reads a quad's predicate, or a named graph\n  _readPredicateOrNamedGraph(token) {\n    return token.type === '{' ? this._readGraph(token) : this._readPredicate(token);\n  }\n\n  // ### `_readGraph` reads a graph\n  _readGraph(token) {\n    if (token.type !== '{')\n      return this._error(`Expected graph but got ${token.type}`, token);\n    // The \"subject\" we read is actually the GRAPH's label\n    this._graph = this._subject, this._subject = null;\n    return this._readSubject;\n  }\n\n  // ### `_readBlankNodeHead` reads the head of a blank node\n  _readBlankNodeHead(token) {\n    if (token.type === ']') {\n      this._subject = null;\n      return this._readBlankNodeTail(token);\n    }\n    else {\n      this._predicate = null;\n      return this._readPredicate(token);\n    }\n  }\n\n  // ### `_readBlankNodeTail` reads the end of a blank node\n  _readBlankNodeTail(token) {\n    if (token.type !== ']')\n      return this._readBlankNodePunctuation(token);\n\n    // Store blank node quad\n    if (this._subject !== null)\n      this._emit(this._subject, this._predicate, this._object, this._graph);\n\n    // Restore the parent context containing this blank node\n    const empty = this._predicate === null;\n    this._restoreContext();\n    // If the blank node was the subject, continue reading the predicate\n    if (this._object === null)\n      // If the blank node was empty, it could be a named graph label\n      return empty ? this._readPredicateOrNamedGraph : this._readPredicateAfterBlank;\n    // If the blank node was the object, restore previous context and read punctuation\n    else\n      return this._getContextEndReader();\n  }\n\n  // ### `_readPredicateAfterBlank` reads a predicate after an anonymous blank node\n  _readPredicateAfterBlank(token) {\n    switch (token.type) {\n    case '.':\n    case '}':\n      // No predicate is coming if the triple is terminated here\n      this._subject = null;\n      return this._readPunctuation(token);\n    default:\n      return this._readPredicate(token);\n    }\n  }\n\n  // ### `_readListItem` reads items from a list\n  _readListItem(token) {\n    let item = null,                      // The item of the list\n        list = null,                      // The list itself\n        next = this._readListItem;        // The next function to execute\n    const previousList = this._subject,   // The previous list that contains this list\n        stack = this._contextStack,       // The stack of parent contexts\n        parent = stack[stack.length - 1]; // The parent containing the current list\n\n    switch (token.type) {\n    case '[':\n      // Stack the current list quad and start a new quad with a blank node as subject\n      this._saveContext('blank', this._graph,\n                        list = this._blankNode(), this.RDF_FIRST,\n                        this._subject = item = this._blankNode());\n      next = this._readBlankNodeHead;\n      break;\n    case '(':\n      // Stack the current list quad and start a new list\n      this._saveContext('list', this._graph,\n                        list = this._blankNode(), this.RDF_FIRST, this.RDF_NIL);\n      this._subject = null;\n      break;\n    case ')':\n      // Closing the list; restore the parent context\n      this._restoreContext();\n      // If this list is contained within a parent list, return the membership quad here.\n      // This will be `<parent list element> rdf:first <this list>.`.\n      if (stack.length !== 0 && stack[stack.length - 1].type === 'list')\n        this._emit(this._subject, this._predicate, this._object, this._graph);\n      // Was this list the parent's subject?\n      if (this._predicate === null) {\n        // The next token is the predicate\n        next = this._readPredicate;\n        // No list tail if this was an empty list\n        if (this._subject === this.RDF_NIL)\n          return next;\n      }\n      // The list was in the parent context's object\n      else {\n        next = this._getContextEndReader();\n        // No list tail if this was an empty list\n        if (this._object === this.RDF_NIL)\n          return next;\n      }\n      // Close the list by making the head nil\n      list = this.RDF_NIL;\n      break;\n    case 'literal':\n      // Regular literal, can still get a datatype or language\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        next = this._readListItemDataTypeOrLang;\n      }\n      // Pre-datatyped string literal (prefix stores the datatype)\n      else {\n        item = this._literal(token.value, this._namedNode(token.prefix));\n        next = this._getContextEndReader();\n      }\n      break;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph, this._subject, this._predicate,\n                        this._graph = this._blankNode());\n      return this._readSubject;\n    default:\n      if ((item = this._readEntity(token)) === undefined)\n        return;\n    }\n\n     // Create a new blank node if no item head was assigned yet\n    if (list === null)\n      this._subject = list = this._blankNode();\n\n    // Is this the first element of the list?\n    if (previousList === null) {\n      // This list is either the subject or the object of its parent\n      if (parent.predicate === null)\n        parent.subject = list;\n      else\n        parent.object = list;\n    }\n    else {\n      // Continue the previous list with the current list\n      this._emit(previousList, this.RDF_REST, list, this._graph);\n    }\n    // If an item was read, add it to the list\n    if (item !== null) {\n      // In N3 mode, the item might be a path\n      if (this._n3Mode && (token.type === 'IRI' || token.type === 'prefixed')) {\n        // Create a new context to add the item's path\n        this._saveContext('item', this._graph, list, this.RDF_FIRST, item);\n        this._subject = item, this._predicate = null;\n        // _readPath will restore the context and output the item\n        return this._getPathReader(this._readListItem);\n      }\n      // Output the item\n      this._emit(list, this.RDF_FIRST, item, this._graph);\n    }\n    return next;\n  }\n\n  // ### `_readDataTypeOrLang` reads an _optional_ datatype or language\n  _readDataTypeOrLang(token) {\n    return this._completeObjectLiteral(token, false);\n  }\n\n\n  // ### `_readListItemDataTypeOrLang` reads an _optional_ datatype or language in a list\n  _readListItemDataTypeOrLang(token) {\n    return this._completeObjectLiteral(token, true);\n  }\n\n  // ### `_completeLiteral` completes a literal with an optional datatype or language\n  _completeLiteral(token) {\n    // Create a simple string literal by default\n    let literal = this._literal(this._literalValue);\n\n    switch (token.type) {\n    // Create a datatyped literal\n    case 'type':\n    case 'typeIRI':\n      const datatype = this._readEntity(token);\n      if (datatype === undefined) return; // No datatype means an error occurred\n      literal = this._literal(this._literalValue, datatype);\n      token = null;\n      break;\n    // Create a language-tagged string\n    case 'langcode':\n      literal = this._literal(this._literalValue, token.value);\n      token = null;\n      break;\n    }\n\n    return { token, literal };\n  }\n\n  // Completes a literal in subject position\n  _completeSubjectLiteral(token) {\n    this._subject = this._completeLiteral(token).literal;\n    return this._readPredicateOrNamedGraph;\n  }\n\n  // Completes a literal in object position\n  _completeObjectLiteral(token, listItem) {\n    const completed = this._completeLiteral(token);\n    if (!completed)\n      return;\n    this._object = completed.literal;\n\n    // If this literal was part of a list, write the item\n    // (we could also check the context stack, but passing in a flag is faster)\n    if (listItem)\n      this._emit(this._subject, this.RDF_FIRST, this._object, this._graph);\n    // If the token was consumed, continue with the rest of the input\n    if (completed.token === null)\n      return this._getContextEndReader();\n    // Otherwise, consume the token now\n    else {\n      this._readCallback = this._getContextEndReader();\n      return this._readCallback(completed.token);\n    }\n  }\n\n  // ### `_readFormulaTail` reads the end of a formula\n  _readFormulaTail(token) {\n    if (token.type !== '}')\n      return this._readPunctuation(token);\n\n    // Store the last quad of the formula\n    if (this._subject !== null)\n      this._emit(this._subject, this._predicate, this._object, this._graph);\n\n    // Restore the parent context containing this formula\n    this._restoreContext();\n    // If the formula was the subject, continue reading the predicate.\n    // If the formula was the object, read punctuation.\n    return this._object === null ? this._readPredicate : this._getContextEndReader();\n  }\n\n  // ### `_readPunctuation` reads punctuation between quads or quad parts\n  _readPunctuation(token) {\n    let next, graph = this._graph;\n    const subject = this._subject, inversePredicate = this._inversePredicate;\n    switch (token.type) {\n    // A closing brace ends a graph\n    case '}':\n      if (this._graph === null)\n        return this._error('Unexpected graph closing', token);\n      if (this._n3Mode)\n        return this._readFormulaTail(token);\n      this._graph = null;\n    // A dot just ends the statement, without sharing anything with the next\n    case '.':\n      this._subject = null;\n      next = this._contextStack.length ? this._readSubject : this._readInTopContext;\n      if (inversePredicate) this._inversePredicate = false;\n      break;\n    // Semicolon means the subject is shared; predicate and object are different\n    case ';':\n      next = this._readPredicate;\n      break;\n    // Comma means both the subject and predicate are shared; the object is different\n    case ',':\n      next = this._readObject;\n      break;\n    default:\n      // An entity means this is a quad (only allowed if not already inside a graph)\n      if (this._supportsQuads && this._graph === null && (graph = this._readEntity(token)) !== undefined) {\n        next = this._readQuadPunctuation;\n        break;\n      }\n      return this._error(`Expected punctuation to follow \"${this._object.id}\"`, token);\n    }\n    // A quad has been completed now, so return it\n    if (subject !== null) {\n      const predicate = this._predicate, object = this._object;\n      if (!inversePredicate)\n        this._emit(subject, predicate, object,  graph);\n      else\n        this._emit(object,  predicate, subject, graph);\n    }\n    return next;\n  }\n\n    // ### `_readBlankNodePunctuation` reads punctuation in a blank node\n  _readBlankNodePunctuation(token) {\n    let next;\n    switch (token.type) {\n    // Semicolon means the subject is shared; predicate and object are different\n    case ';':\n      next = this._readPredicate;\n      break;\n    // Comma means both the subject and predicate are shared; the object is different\n    case ',':\n      next = this._readObject;\n      break;\n    default:\n      return this._error(`Expected punctuation to follow \"${this._object.id}\"`, token);\n    }\n    // A quad has been completed now, so return it\n    this._emit(this._subject, this._predicate, this._object, this._graph);\n    return next;\n  }\n\n  // ### `_readQuadPunctuation` reads punctuation after a quad\n  _readQuadPunctuation(token) {\n    if (token.type !== '.')\n      return this._error('Expected dot to follow quad', token);\n    return this._readInTopContext;\n  }\n\n  // ### `_readPrefix` reads the prefix of a prefix declaration\n  _readPrefix(token) {\n    if (token.type !== 'prefix')\n      return this._error('Expected prefix to follow @prefix', token);\n    this._prefix = token.value;\n    return this._readPrefixIRI;\n  }\n\n  // ### `_readPrefixIRI` reads the IRI of a prefix declaration\n  _readPrefixIRI(token) {\n    if (token.type !== 'IRI')\n      return this._error(`Expected IRI to follow prefix \"${this._prefix}:\"`, token);\n    const prefixNode = this._readEntity(token);\n    this._prefixes[this._prefix] = prefixNode.value;\n    this._prefixCallback(this._prefix, prefixNode);\n    return this._readDeclarationPunctuation;\n  }\n\n  // ### `_readBaseIRI` reads the IRI of a base declaration\n  _readBaseIRI(token) {\n    const iri = token.type === 'IRI' && this._resolveIRI(token.value);\n    if (!iri)\n      return this._error('Expected valid IRI to follow base declaration', token);\n    this._setBase(iri);\n    return this._readDeclarationPunctuation;\n  }\n\n  // ### `_readNamedGraphLabel` reads the label of a named graph\n  _readNamedGraphLabel(token) {\n    switch (token.type) {\n    case 'IRI':\n    case 'blank':\n    case 'prefixed':\n      return this._readSubject(token), this._readGraph;\n    case '[':\n      return this._readNamedGraphBlankLabel;\n    default:\n      return this._error('Invalid graph label', token);\n    }\n  }\n\n  // ### `_readNamedGraphLabel` reads a blank node label of a named graph\n  _readNamedGraphBlankLabel(token) {\n    if (token.type !== ']')\n      return this._error('Invalid graph label', token);\n    this._subject = this._blankNode();\n    return this._readGraph;\n  }\n\n  // ### `_readDeclarationPunctuation` reads the punctuation of a declaration\n  _readDeclarationPunctuation(token) {\n    // SPARQL-style declarations don't have punctuation\n    if (this._sparqlStyle) {\n      this._sparqlStyle = false;\n      return this._readInTopContext(token);\n    }\n\n    if (token.type !== '.')\n      return this._error('Expected declaration to end with a dot', token);\n    return this._readInTopContext;\n  }\n\n  // Reads a list of quantified symbols from a @forSome or @forAll statement\n  _readQuantifierList(token) {\n    let entity;\n    switch (token.type) {\n    case 'IRI':\n    case 'prefixed':\n      if ((entity = this._readEntity(token, true)) !== undefined)\n        break;\n    default:\n      return this._error(`Unexpected ${token.type}`, token);\n    }\n    // Without explicit quantifiers, map entities to a quantified entity\n    if (!this._explicitQuantifiers)\n      this._quantified[entity.id] = this._quantifier(this._blankNode().value);\n    // With explicit quantifiers, output the reified quantifier\n    else {\n      // If this is the first item, start a new quantifier list\n      if (this._subject === null)\n        this._emit(this._graph || this.DEFAULTGRAPH, this._predicate,\n                   this._subject = this._blankNode(), this.QUANTIFIERS_GRAPH);\n      // Otherwise, continue the previous list\n      else\n        this._emit(this._subject, this.RDF_REST,\n                   this._subject = this._blankNode(), this.QUANTIFIERS_GRAPH);\n      // Output the list item\n      this._emit(this._subject, this.RDF_FIRST, entity, this.QUANTIFIERS_GRAPH);\n    }\n    return this._readQuantifierPunctuation;\n  }\n\n  // Reads punctuation from a @forSome or @forAll statement\n  _readQuantifierPunctuation(token) {\n    // Read more quantifiers\n    if (token.type === ',')\n      return this._readQuantifierList;\n    // End of the quantifier list\n    else {\n      // With explicit quantifiers, close the quantifier list\n      if (this._explicitQuantifiers) {\n        this._emit(this._subject, this.RDF_REST, this.RDF_NIL, this.QUANTIFIERS_GRAPH);\n        this._subject = null;\n      }\n      // Read a dot\n      this._readCallback = this._getContextEndReader();\n      return this._readCallback(token);\n    }\n  }\n\n  // ### `_getPathReader` reads a potential path and then resumes with the given function\n  _getPathReader(afterPath) {\n    this._afterPath = afterPath;\n    return this._readPath;\n  }\n\n  // ### `_readPath` reads a potential path\n  _readPath(token) {\n    switch (token.type) {\n    // Forward path\n    case '!': return this._readForwardPath;\n    // Backward path\n    case '^': return this._readBackwardPath;\n    // Not a path; resume reading where we left off\n    default:\n      const stack = this._contextStack, parent = stack.length && stack[stack.length - 1];\n      // If we were reading a list item, we still need to output it\n      if (parent && parent.type === 'item') {\n        // The list item is the remaining subejct after reading the path\n        const item = this._subject;\n        // Switch back to the context of the list\n        this._restoreContext();\n        // Output the list item\n        this._emit(this._subject, this.RDF_FIRST, item, this._graph);\n      }\n      return this._afterPath(token);\n    }\n  }\n\n  // ### `_readForwardPath` reads a '!' path\n  _readForwardPath(token) {\n    let subject, predicate;\n    const object = this._blankNode();\n    // The next token is the predicate\n    if ((predicate = this._readEntity(token)) === undefined)\n      return;\n    // If we were reading a subject, replace the subject by the path's object\n    if (this._predicate === null)\n      subject = this._subject, this._subject = object;\n    // If we were reading an object, replace the subject by the path's object\n    else\n      subject = this._object,  this._object  = object;\n    // Emit the path's current quad and read its next section\n    this._emit(subject, predicate, object, this._graph);\n    return this._readPath;\n  }\n\n  // ### `_readBackwardPath` reads a '^' path\n  _readBackwardPath(token) {\n    const subject = this._blankNode();\n    let predicate, object;\n    // The next token is the predicate\n    if ((predicate = this._readEntity(token)) === undefined)\n      return;\n    // If we were reading a subject, replace the subject by the path's subject\n    if (this._predicate === null)\n      object = this._subject, this._subject = subject;\n    // If we were reading an object, replace the subject by the path's subject\n    else\n      object = this._object,  this._object  = subject;\n    // Emit the path's current quad and read its next section\n    this._emit(subject, predicate, object, this._graph);\n    return this._readPath;\n  }\n\n  // ### `_readRDFStarTailOrGraph` reads the graph of a nested RDF* quad or the end of a nested RDF* triple\n  _readRDFStarTailOrGraph(token) {\n    if (token.type !== '>>') {\n      // An entity means this is a quad (only allowed if not already inside a graph)\n      if (this._supportsQuads && this._graph === null && (this._graph = this._readEntity(token)) !== undefined)\n        return this._readRDFStarTail;\n      return this._error(`Expected >> to follow \"${this._object.id}\"`, token);\n    }\n    return this._readRDFStarTail(token);\n  }\n\n  // ### `_readRDFStarTail` reads the end of a nested RDF* triple\n  _readRDFStarTail(token) {\n    if (token.type !== '>>')\n      return this._error(`Expected >> but got ${token.type}`, token);\n    // Read the quad and restore the previous context\n    const quad = this._quad(this._subject, this._predicate, this._object,\n      this._graph || this.DEFAULTGRAPH);\n    this._restoreContext();\n    // If the triple was the subject, continue by reading the predicate.\n    if (this._subject === null) {\n      this._subject = quad;\n      return this._readPredicate;\n    }\n    // If the triple was the object, read context end.\n    else {\n      this._object = quad;\n      return this._getContextEndReader();\n    }\n  }\n\n  // ### `_getContextEndReader` gets the next reader function at the end of a context\n  _getContextEndReader() {\n    const contextStack = this._contextStack;\n    if (!contextStack.length)\n      return this._readPunctuation;\n\n    switch (contextStack[contextStack.length - 1].type) {\n    case 'blank':\n      return this._readBlankNodeTail;\n    case 'list':\n      return this._readListItem;\n    case 'formula':\n      return this._readFormulaTail;\n    case '<<':\n      return this._readRDFStarTailOrGraph;\n    }\n  }\n\n  // ### `_emit` sends a quad through the callback\n  _emit(subject, predicate, object, graph) {\n    this._callback(null, this._quad(subject, predicate, object, graph || this.DEFAULTGRAPH));\n  }\n\n  // ### `_error` emits an error message through the callback\n  _error(message, token) {\n    const err = new Error(`${message} on line ${token.line}.`);\n    err.context = {\n      token: token,\n      line: token.line,\n      previousToken: this._lexer.previousToken,\n    };\n    this._callback(err);\n    this._callback = noop;\n  }\n\n  // ### `_resolveIRI` resolves an IRI against the base path\n  _resolveIRI(iri) {\n    return /^[a-z][a-z0-9+.-]*:/i.test(iri) ? iri : this._resolveRelativeIRI(iri);\n  }\n\n  // ### `_resolveRelativeIRI` resolves an IRI against the base path,\n  // assuming that a base path has been set and that the IRI is indeed relative\n  _resolveRelativeIRI(iri) {\n    // An empty relative IRI indicates the base IRI\n    if (!iri.length)\n      return this._base;\n    // Decide resolving strategy based in the first character\n    switch (iri[0]) {\n    // Resolve relative fragment IRIs against the base IRI\n    case '#': return this._base + iri;\n    // Resolve relative query string IRIs by replacing the query string\n    case '?': return this._base.replace(/(?:\\?.*)?$/, iri);\n    // Resolve root-relative IRIs at the root of the base IRI\n    case '/':\n      // Resolve scheme-relative IRIs to the scheme\n      return (iri[1] === '/' ? this._baseScheme : this._baseRoot) + this._removeDotSegments(iri);\n    // Resolve all other IRIs at the base IRI's path\n    default:\n      // Relative IRIs cannot contain a colon in the first path segment\n      return (/^[^/:]*:/.test(iri)) ? null : this._removeDotSegments(this._basePath + iri);\n    }\n  }\n\n  // ### `_removeDotSegments` resolves './' and '../' path segments in an IRI as per RFC3986\n  _removeDotSegments(iri) {\n    // Don't modify the IRI if it does not contain any dot segments\n    if (!/(^|\\/)\\.\\.?($|[/#?])/.test(iri))\n      return iri;\n\n    // Start with an imaginary slash before the IRI in order to resolve trailing './' and '../'\n    const length = iri.length;\n    let result = '', i = -1, pathStart = -1, segmentStart = 0, next = '/';\n\n    while (i < length) {\n      switch (next) {\n      // The path starts with the first slash after the authority\n      case ':':\n        if (pathStart < 0) {\n          // Skip two slashes before the authority\n          if (iri[++i] === '/' && iri[++i] === '/')\n            // Skip to slash after the authority\n            while ((pathStart = i + 1) < length && iri[pathStart] !== '/')\n              i = pathStart;\n        }\n        break;\n      // Don't modify a query string or fragment\n      case '?':\n      case '#':\n        i = length;\n        break;\n      // Handle '/.' or '/..' path segments\n      case '/':\n        if (iri[i + 1] === '.') {\n          next = iri[++i + 1];\n          switch (next) {\n          // Remove a '/.' segment\n          case '/':\n            result += iri.substring(segmentStart, i - 1);\n            segmentStart = i + 1;\n            break;\n          // Remove a trailing '/.' segment\n          case undefined:\n          case '?':\n          case '#':\n            return result + iri.substring(segmentStart, i) + iri.substr(i + 1);\n          // Remove a '/..' segment\n          case '.':\n            next = iri[++i + 1];\n            if (next === undefined || next === '/' || next === '?' || next === '#') {\n              result += iri.substring(segmentStart, i - 2);\n              // Try to remove the parent path from result\n              if ((segmentStart = result.lastIndexOf('/')) >= pathStart)\n                result = result.substr(0, segmentStart);\n              // Remove a trailing '/..' segment\n              if (next !== '/')\n                return `${result}/${iri.substr(i + 1)}`;\n              segmentStart = i + 1;\n            }\n          }\n        }\n      }\n      next = iri[++i];\n    }\n    return result + iri.substring(segmentStart);\n  }\n\n  // ## Public methods\n\n  // ### `parse` parses the N3 input and emits each parsed quad through the callback\n  parse(input, quadCallback, prefixCallback) {\n    // The read callback is the next function to be executed when a token arrives.\n    // We start reading in the top context.\n    this._readCallback = this._readInTopContext;\n    this._sparqlStyle = false;\n    this._prefixes = Object.create(null);\n    this._prefixes._ = this._blankNodePrefix ? this._blankNodePrefix.substr(2)\n                                             : `b${blankNodePrefix++}_`;\n    this._prefixCallback = prefixCallback || noop;\n    this._inversePredicate = false;\n    this._quantified = Object.create(null);\n\n    // Parse synchronously if no quad callback is given\n    if (!quadCallback) {\n      const quads = [];\n      let error;\n      this._callback = (e, t) => { e ? (error = e) : t && quads.push(t); };\n      this._lexer.tokenize(input).every(token => {\n        return this._readCallback = this._readCallback(token);\n      });\n      if (error) throw error;\n      return quads;\n    }\n\n    // Parse asynchronously otherwise, executing the read callback when a token arrives\n    this._callback = quadCallback;\n    this._lexer.tokenize(input, (error, token) => {\n      if (error !== null)\n        this._callback(error), this._callback = noop;\n      else if (this._readCallback)\n        this._readCallback = this._readCallback(token);\n    });\n  }\n}\n\n// The empty function\nfunction noop() {}\n\n// Initializes the parser with the given data factory\nfunction initDataFactory(parser, factory) {\n  // Set factory methods\n  const namedNode = factory.namedNode;\n  parser._namedNode   = namedNode;\n  parser._blankNode   = factory.blankNode;\n  parser._literal     = factory.literal;\n  parser._variable    = factory.variable;\n  parser._quad        = factory.quad;\n  parser.DEFAULTGRAPH = factory.defaultGraph();\n\n  // Set common named nodes\n  parser.RDF_FIRST  = namedNode(namespaces.rdf.first);\n  parser.RDF_REST   = namedNode(namespaces.rdf.rest);\n  parser.RDF_NIL    = namedNode(namespaces.rdf.nil);\n  parser.N3_FORALL  = namedNode(namespaces.r.forAll);\n  parser.N3_FORSOME = namedNode(namespaces.r.forSome);\n  parser.ABBREVIATIONS = {\n    'a': namedNode(namespaces.rdf.type),\n    '=': namedNode(namespaces.owl.sameAs),\n    '>': namedNode(namespaces.log.implies),\n  };\n  parser.QUANTIFIERS_GRAPH = namedNode('urn:n3:quantifiers');\n}\ninitDataFactory(N3Parser.prototype, N3DataFactory);\n"],"sourceRoot":""}