AutorÃa | Ultima modificación | Ver Log |
{"version":3,"file":"lunr.min.js","sources":["../src/lunr.js"],"sourcesContent":["/**\n * moodle readme\n *\n * Lunrjs can be downloaded from https://github.com/olivernn/lunr.js. To update this library get the lunr.js file\n * from this project and replace the content below with the new content.\n */\n\n/**\n * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.9\n * Copyright (C) 2020 Oliver Nightingale\n * @license MIT\n */\n\n;(function(){\n\n/**\n * A convenience function for configuring and constructing\n * a new lunr Index.\n *\n * A lunr.Builder instance is created and the pipeline setup\n * with a trimmer, stop word filter and stemmer.\n *\n * This builder object is yielded to the configuration function\n * that is passed as a parameter, allowing the list of fields\n * and other builder parameters to be customised.\n *\n * All documents _must_ be added within the passed config function.\n *\n * @example\n * var idx = lunr(function () {\n * this.field('title')\n *this.field('body')\n * this.ref('id')\n *\n * documents.forEach(function (doc) {\n * this.add(doc)\n * }, this)\n * })\n *\n * @see {@link lunr.Builder}\n * @see {@link lunr.Pipeline}\n * @see {@link lunr.trimmer}\n * @see {@link lunr.stopWordFilter}\n * @see {@link lunr.stemmer}\n * @namespace {function} lunr\n */\nvar lunr = function (config) {\n var builder = new lunr.Builder\n\n builder.pipeline.add(\n lunr.trimmer,\n lunr.stopWordFilter,\n lunr.stemmer\n )\n\n builder.searchPipeline.add(\n lunr.stemmer\n )\n\n config.call(builder, builder)\n return builder.build()\n}\n\nlunr.version = \"2.3.9\"\n/*!\n * lunr.utils\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A namespace containing utils for the rest of the lunr library\n * @namespace lunr.utils\n */\nlunr.utils = {}\n\n/**\n * Print a warning message to the console.\n *\n * @param {String} message The message to be printed.\n * @memberOf lunr.utils\n * @function\n */\nlunr.utils.warn = (function (global) {\n /* eslint-disable no-console */\n return function (message) {\n if (global.console && console.warn) {\n console.warn(message)\n }\n }\n /* eslint-enable no-console */\n})(this)\n\n/**\n * Convert an object to a string.\n *\n * In the case of `null` and `undefined` the function returns\n * the empty string, in all other cases the result of calling\n * `toString` on the passed object is returned.\n *\n * @param {Any} obj The object to convert to a string.\n * @return {String} string representation of the passed object.\n * @memberOf lunr.utils\n */\nlunr.utils.asString = function (obj) {\n if (obj === void 0 || obj === null) {\n return \"\"\n } else {\n return obj.toString()\n }\n}\n\n/**\n * Clones an object.\n *\n * Will create a copy of an existing object such that any mutations\n * on the copy cannot affect the original.\n *\n * Only shallow objects are supported, passing a nested object to this\n * function will cause a TypeError.\n *\n * Objects with primitives, and arrays of primitives are supported.\n *\n * @param {Object} obj The object to clone.\n * @return {Object} a clone of the passed object.\n * @throws {TypeError} when a nested object is passed.\n * @memberOf Utils\n */\nlunr.utils.clone = function (obj) {\n if (obj === null || obj === undefined) {\n return obj\n }\n\n var clone = Object.create(null),\n keys = Object.keys(obj)\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i],\n val = obj[key]\n\n if (Array.isArray(val)) {\n clone[key] = val.slice()\n continue\n }\n\n if (typeof val === 'string' ||\n typeof val === 'number' ||\n typeof val === 'boolean') {\n clone[key] = val\n continue\n }\n\n throw new TypeError(\"clone is not deep and does not support nested objects\")\n }\n\n return clone\n}\nlunr.FieldRef = function (docRef, fieldName, stringValue) {\n this.docRef = docRef\n this.fieldName = fieldName\n this._stringValue = stringValue\n}\n\nlunr.FieldRef.joiner = \"/\"\n\nlunr.FieldRef.fromString = function (s) {\n var n = s.indexOf(lunr.FieldRef.joiner)\n\n if (n === -1) {\n throw \"malformed field ref string\"\n }\n\n var fieldRef = s.slice(0, n),\n docRef = s.slice(n + 1)\n\n return new lunr.FieldRef (docRef, fieldRef, s)\n}\n\nlunr.FieldRef.prototype.toString = function () {\n if (this._stringValue == undefined) {\n this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef\n }\n\n return this._stringValue\n}\n/*!\n * lunr.Set\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A lunr set.\n *\n * @constructor\n */\nlunr.Set = function (elements) {\n this.elements = Object.create(null)\n\n if (elements) {\n this.length = elements.length\n\n for (var i = 0; i < this.length; i++) {\n this.elements[elements[i]] = true\n }\n } else {\n this.length = 0\n }\n}\n\n/**\n * A complete set that contains all elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.complete = {\n intersect: function (other) {\n return other\n },\n\n union: function () {\n return this\n },\n\n contains: function () {\n return true\n }\n}\n\n/**\n * An empty set that contains no elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.empty = {\n intersect: function () {\n return this\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return false\n }\n}\n\n/**\n * Returns true if this set contains the specified object.\n *\n * @param {object} object - Object whose presence in this set is to be tested.\n * @returns {boolean} - True if this set contains the specified object.\n */\nlunr.Set.prototype.contains = function (object) {\n return !!this.elements[object]\n}\n\n/**\n * Returns a new set containing only the elements that are present in both\n * this set and the specified set.\n *\n * @param {lunr.Set} other - set to intersect with this set.\n * @returns {lunr.Set} a new set that is the intersection of this and the specified set.\n */\n\nlunr.Set.prototype.intersect = function (other) {\n var a, b, elements, intersection = []\n\n if (other === lunr.Set.complete) {\n return this\n }\n\n if (other === lunr.Set.empty) {\n return other\n }\n\n if (this.length < other.length) {\n a = this\n b = other\n } else {\n a = other\n b = this\n }\n\n elements = Object.keys(a.elements)\n\n for (var i = 0; i < elements.length; i++) {\n var element = elements[i]\n if (element in b.elements) {\n intersection.push(element)\n }\n }\n\n return new lunr.Set (intersection)\n}\n\n/**\n * Returns a new set combining the elements of this and the specified set.\n *\n * @param {lunr.Set} other - set to union with this set.\n * @return {lunr.Set} a new set that is the union of this and the specified set.\n */\n\nlunr.Set.prototype.union = function (other) {\n if (other === lunr.Set.complete) {\n return lunr.Set.complete\n }\n\n if (other === lunr.Set.empty) {\n return this\n }\n\n return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))\n}\n/**\n * A function to calculate the inverse document frequency for\n * a posting. This is shared between the builder and the index\n *\n * @private\n * @param {object} posting - The posting for a given term\n * @param {number} documentCount - The total number of documents.\n */\nlunr.idf = function (posting, documentCount) {\n var documentsWithTerm = 0\n\n for (var fieldName in posting) {\n if (fieldName == '_index') continue // Ignore the term index, its not a field\n documentsWithTerm += Object.keys(posting[fieldName]).length\n }\n\n var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)\n\n return Math.log(1 + Math.abs(x))\n}\n\n/**\n * A token wraps a string representation of a token\n * as it is passed through the text processing pipeline.\n *\n * @constructor\n * @param {string} [str=''] - The string token being wrapped.\n * @param {object} [metadata={}] - Metadata associated with this token.\n */\nlunr.Token = function (str, metadata) {\n this.str = str || \"\"\n this.metadata = metadata || {}\n}\n\n/**\n * Returns the token string that is being wrapped by this object.\n *\n * @returns {string}\n */\nlunr.Token.prototype.toString = function () {\n return this.str\n}\n\n/**\n * A token update function is used when updating or optionally\n * when cloning a token.\n *\n * @callback lunr.Token~updateFunction\n * @param {string} str - The string representation of the token.\n * @param {Object} metadata - All metadata associated with this token.\n */\n\n/**\n * Applies the given function to the wrapped string token.\n *\n * @example\n * token.update(function (str, metadata) {\n * return str.toUpperCase()\n * })\n *\n * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.update = function (fn) {\n this.str = fn(this.str, this.metadata)\n return this\n}\n\n/**\n * Creates a clone of this token. Optionally a function can be\n * applied to the cloned token.\n *\n * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.clone = function (fn) {\n fn = fn || function (s) { return s }\n return new lunr.Token (fn(this.str, this.metadata), this.metadata)\n}\n/*!\n * lunr.tokenizer\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A function for splitting a string into tokens ready to be inserted into\n * the search index. Uses `lunr.tokenizer.separator` to split strings, change\n * the value of this property to change how strings are split into tokens.\n *\n * This tokenizer will convert its parameter to a string by calling `toString` and\n * then will split this string on the character in `lunr.tokenizer.separator`.\n * Arrays will have their elements converted to strings and wrapped in a lunr.Token.\n *\n * Optional metadata can be passed to the tokenizer, this metadata will be cloned and\n * added as metadata to every token that is created from the object to be tokenized.\n *\n * @static\n * @param {?(string|object|object[])} obj - The object to convert into tokens\n * @param {?object} metadata - Optional metadata to associate with every token\n * @returns {lunr.Token[]}\n * @see {@link lunr.Pipeline}\n */\nlunr.tokenizer = function (obj, metadata) {\n if (obj == null || obj == undefined) {\n return []\n }\n\n if (Array.isArray(obj)) {\n return obj.map(function (t) {\n return new lunr.Token(\n lunr.utils.asString(t).toLowerCase(),\n lunr.utils.clone(metadata)\n )\n })\n }\n\n var str = obj.toString().toLowerCase(),\n len = str.length,\n tokens = []\n\n for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {\n var char = str.charAt(sliceEnd),\n sliceLength = sliceEnd - sliceStart\n\n if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {\n\n if (sliceLength > 0) {\n var tokenMetadata = lunr.utils.clone(metadata) || {}\n tokenMetadata[\"position\"] = [sliceStart, sliceLength]\n tokenMetadata[\"index\"] = tokens.length\n\n tokens.push(\n new lunr.Token (\n str.slice(sliceStart, sliceEnd),\n tokenMetadata\n )\n )\n }\n\n sliceStart = sliceEnd + 1\n }\n\n }\n\n return tokens\n}\n\n/**\n * The separator used to split a string into tokens. Override this property to change the behaviour of\n * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.\n *\n * @static\n * @see lunr.tokenizer\n */\nlunr.tokenizer.separator = /[\\s\\-]+/\n/*!\n * lunr.Pipeline\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.Pipelines maintain an ordered list of functions to be applied to all\n * tokens in documents entering the search index and queries being ran against\n * the index.\n *\n * An instance of lunr.Index created with the lunr shortcut will contain a\n * pipeline with a stop word filter and an English language stemmer. Extra\n * functions can be added before or after either of these functions or these\n * default functions can be removed.\n *\n * When run the pipeline will call each function in turn, passing a token, the\n * index of that token in the original list of all tokens and finally a list of\n * all the original tokens.\n *\n * The output of functions in the pipeline will be passed to the next function\n * in the pipeline. To exclude a token from entering the index the function\n * should return undefined, the rest of the pipeline will not be called with\n * this token.\n *\n * For serialisation of pipelines to work, all functions used in an instance of\n * a pipeline should be registered with lunr.Pipeline. Registered functions can\n * then be loaded. If trying to load a serialised pipeline that uses functions\n * that are not registered an error will be thrown.\n *\n * If not planning on serialising the pipeline then registering pipeline functions\n * is not necessary.\n *\n * @constructor\n */\nlunr.Pipeline = function () {\n this._stack =[]\n}\n\nlunr.Pipeline.registeredFunctions = Object.create(null)\n\n/**\n * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token\n * string as well as all known metadata. A pipeline function can mutate the token string\n * or mutate (or add) metadata for a given token.\n *\n * A pipeline function can indicate that the passed token should be discarded by returning\n * null, undefined or an empty string. This token will not be passed to any downstream pipeline\n * functions and will not be added to the index.\n *\n * Multiple tokens can be returned by returning an array of tokens. Each token will be passed\n * to any downstream pipeline functions and all will returned tokens will be added to the index.\n *\n * Any number of pipeline functions may be chained together using a lunr.Pipeline.\n *\n * @interface lunr.PipelineFunction\n * @param {lunr.Token} token - A token from the document being processed.\n * @param {number} i - The index of this token in the complete list of tokensfor this document/field.\n * @param {lunr.Token[]} tokens - All tokens for this document/field.\n * @returns {(?lunr.Token|lunr.Token[])}\n */\n\n/**\n * Register a function with the pipeline.\n *\n * Functions that are used in the pipeline should be registered if the pipeline\n * needs to be serialised, or a serialised pipeline needs to be loaded.\n *\n * Registering a function does not add it to a pipeline, functions must still be\n * added to instances of the pipeline for them to be used when running a pipeline.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @param {String} label - The label to register this function with\n */\nlunr.Pipeline.registerFunction = function (fn, label) {\n if (label in this.registeredFunctions) {\n lunr.utils.warn('Overwriting existing registered function: ' + label)\n }\n\n fn.label = label\n lunr.Pipeline.registeredFunctions[fn.label] = fn\n}\n\n/**\n * Warns if the function is not registered as a Pipeline function.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @private\n */\nlunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {\n var isRegistered = fn.label && (fn.label in this.registeredFunctions)\n\n if (!isRegistered) {\n lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\\n', fn)\n }\n}\n\n/**\n * Loads a previously serialised pipeline.\n *\n * All functions to be loaded must already be registered with lunr.Pipeline.\n * If any function from the serialised data has not been registered then an\n * error will be thrown.\n *\n * @param {Object} serialised - The serialised pipeline to load.\n * @returns {lunr.Pipeline}\n */\nlunr.Pipeline.load = function (serialised) {\n var pipeline = new lunr.Pipeline\n\n serialised.forEach(function (fnName) {\n var fn = lunr.Pipeline.registeredFunctions[fnName]\n\n if (fn) {\n pipeline.add(fn)\n } else {\n throw new Error('Cannot load unregistered function: ' + fnName)\n }\n })\n\nreturn pipeline\n}\n\n/**\n * Adds new functions to the end of the pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.\n */\nlunr.Pipeline.prototype.add = function () {\n var fns = Array.prototype.slice.call(arguments)\n\n fns.forEach(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n this._stack.push(fn)\n }, this)\n}\n\n/**\n * Adds a single function after a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.after = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n pos = pos + 1\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Adds a single function before a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.before = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Removes a function from the pipeline.\n *\n * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.\n */\nlunr.Pipeline.prototype.remove = function (fn) {\n var pos = this._stack.indexOf(fn)\n if (pos == -1) {\n return\n }\n\n this._stack.splice(pos, 1)\n}\n\n/**\n * Runs the current list of functions that make up the pipeline against the\n * passed tokens.\n *\n * @param {Array} tokens The tokens to run through the pipeline.\n * @returns {Array}\n */\nlunr.Pipeline.prototype.run = function (tokens) {\n var stackLength = this._stack.length\n\n for (var i = 0; i < stackLength; i++) {\n var fn = this._stack[i]\n var memo = []\n\n for (var j = 0; j < tokens.length; j++) {\n var result = fn(tokens[j], j, tokens)\n\n if (result === null || result === void 0 || result === '') continue\n\n if (Array.isArray(result)) {\n for (var k = 0; k < result.length; k++) {\n memo.push(result[k])\n }\n } else {\n memo.push(result)\n }\n }\n\n tokens = memo\n }\n\n return tokens\n}\n\n/**\n * Convenience method for passing a string through a pipeline and getting\n * strings out. This method takes care of wrapping the passed string in a\n * token and mapping the resulting tokens back to strings.\n *\n * @param {string} str -The string to pass through the pipeline.\n * @param {?object} metadata - Optional metadata to associate with the token\n * passed to the pipeline.\n * @returns {string[]}\n */\nlunr.Pipeline.prototype.runString = function (str, metadata) {\n var token = new lunr.Token (str, metadata)\n\n return this.run([token]).map(function (t) {\n return t.toString()\n })\n}\n\n/**\n * Resets the pipeline by removing any existing processors.\n *\n */\nlunr.Pipeline.prototype.reset = function () {\n this._stack = []\n}\n\n/**\n * Returns a representation of the pipeline ready for serialisation.\n *\n * Logs a warning if the function has not been registered.\n *\n * @returns {Array}\n */\nlunr.Pipeline.prototype.toJSON = function () {\n return this._stack.map(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n\n return fn.label\n })\n}\n/*!\n * lunr.Vector\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A vector is used to construct the vector space of documents and queries. These\n * vectors support operations to determine the similarity between two documents or\n * a document and a query.\n *\n * Normally no parameters are required for initializing a vector, but in the case of\n * loading a previously dumped vector the raw elements can be provided to the constructor.\n *\n * For performance reasons vectors are implemented with a flat array, where an elements\n * index is immediately followed by its value. E.g. [index, value, index, value]. This\n * allows the underlying array to be as sparse as possible and still offer decent\n * performance when being used for vector calculations.\n *\n * @constructor\n * @param {Number[]} [elements] - The flat list of element index and element value pairs.\n */\nlunr.Vector = function (elements) {\n this._magnitude = 0\n this.elements = elements || []\n}\n\n\n/**\n * Calculates the position within the vector to insert a given index.\n *\n * This is used internally by insert and upsert. If there are duplicate indexes then\n * the position is returnedas if the value for that index were to be updated, but it\n * is the callers responsibility to check whether there is a duplicate at that index\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @returns {Number}\n */\nlunr.Vector.prototype.positionForIndex = function (index) {\n // For an empty vector the tuple can be inserted at the beginning\n if (this.elements.length == 0) {\n return 0\n }\n\n var start = 0,\n end = this.elements.length / 2,\n sliceLength = end - start,\n pivotPoint = Math.floor(sliceLength / 2),\n pivotIndex = this.elements[pivotPoint * 2]\n\n while (sliceLength > 1) {\n if (pivotIndex < index) {\n start = pivotPoint\n }\n\n if (pivotIndex > index) {\n end = pivotPoint\n }\n\n if (pivotIndex == index) {\n break\n }\n\n sliceLength = end - start\n pivotPoint = start + Math.floor(sliceLength / 2)\n pivotIndex = this.elements[pivotPoint * 2]\n }\n\n if (pivotIndex == index) {\nreturn pivotPoint * 2\n }\n\n if (pivotIndex > index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex < index) {\n return (pivotPoint + 1) * 2\n }\n}\n\n/**\n * Inserts an element at an index within the vector.\n *\n * Does not allow duplicates, will throw an error if there is already an entry\n * for this index.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n */\nlunr.Vector.prototype.insert = function (insertIdx, val) {\n this.upsert(insertIdx, val, function () {\n throw \"duplicate index\"\n })\n}\n\n/**\n * Inserts or updates an existing index within the vector.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n * @param {function} fn - A function that is called for updates, the existing value and the\n * requested value are passed as arguments\n */\nlunr.Vector.prototype.upsert = function (insertIdx, val, fn) {\n this._magnitude = 0\n var position = this.positionForIndex(insertIdx)\n\n if (this.elements[position] == insertIdx) {\n this.elements[position + 1] = fn(this.elements[position + 1], val)\n } else {\n this.elements.splice(position, 0, insertIdx, val)\n }\n}\n\n/**\n * Calculates the magnitude of this vector.\n *\n * @returns {Number}\n */\nlunr.Vector.prototype.magnitude = function () {\n if (this._magnitude) return this._magnitude\n\n var sumOfSquares = 0,\n elementsLength = this.elements.length\n\n for (var i = 1; i < elementsLength; i += 2) {\n var val = this.elements[i]\n sumOfSquares += val * val\n }\n\n return this._magnitude = Math.sqrt(sumOfSquares)\n}\n\n/**\n * Calculates the dot product of this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The vector to compute the dot product with.\n * @returns {Number}\n */\nlunr.Vector.prototype.dot = function (otherVector) {\n var dotProduct = 0,\n a = this.elements, b = otherVector.elements,\n aLen = a.length, bLen = b.length,\n aVal = 0, bVal = 0,\n i = 0, j = 0\n\n while (i < aLen && j < bLen) {\n aVal = a[i], bVal = b[j]\n if (aVal < bVal) {\n i += 2\n } else if (aVal > bVal) {\n j += 2\n } else if (aVal == bVal) {\n dotProduct += a[i + 1] * b[j + 1]\n i += 2\n j += 2\n }\n }\n\n return dotProduct\n}\n\n/**\n * Calculates the similarity between this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The other vector to calculate the\n * similarity with.\n * @returns {Number}\n */\nlunr.Vector.prototype.similarity = function (otherVector) {\n return this.dot(otherVector) / this.magnitude() || 0\n}\n\n/**\n * Converts the vector to an array of the elements within the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toArray = function () {\n var output = new Array (this.elements.length / 2)\n\n for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {\n output[j] =this.elements[i]\n }\n\n return output\n}\n\n/**\n * A JSON serializable representation of the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toJSON = function () {\n return this.elements\n}\n/* eslint-disable */\n/*!\n * lunr.stemmer\n * Copyright (C) 2020 Oliver Nightingale\n * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt\n */\n\n/**\n * lunr.stemmer is an english language stemmer, this is a JavaScript\n * implementation of the PorterStemmer taken from http://tartarus.org/~martin\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token - The string to stem\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n * @function\n */\nlunr.stemmer = (function(){\n var step2list = {\n \"ational\" : \"ate\",\n \"tional\" : \"tion\",\n \"enci\" : \"ence\",\n \"anci\" : \"ance\",\n \"izer\" : \"ize\",\n \"bli\" : \"ble\",\n \"alli\" : \"al\",\n \"entli\" : \"ent\",\n \"eli\" : \"e\",\n \"ousli\" : \"ous\",\n \"ization\" : \"ize\",\n \"ation\" : \"ate\",\n \"ator\" : \"ate\",\n \"alism\" : \"al\",\n \"iveness\" : \"ive\",\n \"fulness\" : \"ful\",\n \"ousness\" : \"ous\",\n \"aliti\" : \"al\",\n \"iviti\" : \"ive\",\n \"biliti\" : \"ble\",\n \"logi\" : \"log\"\n },\n\n step3list = {\n \"icate\" : \"ic\",\n \"ative\" : \"\",\n \"alize\" : \"al\",\n \"iciti\" : \"ic\",\n \"ical\" : \"ic\",\n \"ful\" : \"\",\n \"ness\" : \"\"\n },\n\n c = \"[^aeiou]\", // consonant\n v = \"[aeiouy]\", // vowel\n C = c + \"[^aeiouy]*\", // consonant sequence\n V = v + \"[aeiou]*\", // vowel sequence\n\n mgr0 = \"^(\" + C + \")?\" + V + C, // [C]VC... is m>0\n meq1 = \"^(\" + C + \")?\" + V + C + \"(\" + V + \")?$\", // [C]VC[V] is m=1\n mgr1 = \"^(\" + C + \")?\" + V + C + V + C, // [C]VCVC... is m>1\n s_v = \"^(\" + C + \")?\" + v;// vowel in stem\n\n var re_mgr0 = new RegExp(mgr0);\n var re_mgr1 = new RegExp(mgr1);\n var re_meq1 = new RegExp(meq1);\n var re_s_v = new RegExp(s_v);\n\n var re_1a = /^(.+?)(ss|i)es$/;\n var re2_1a = /^(.+?)([^s])s$/;\n var re_1b = /^(.+?)eed$/;\n var re2_1b = /^(.+?)(ed|ing)$/;\n var re_1b_2 = /.$/;\n var re2_1b_2 = /(at|bl|iz)$/;\n var re3_1b_2 = new RegExp(\"([^aeiouylsz])\\\\1$\");\n var re4_1b_2 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var re_1c = /^(.+?[^aeiou])y$/;\n var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;\n\n var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;\n\n var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;\n var re2_4 = /^(.+?)(s|t)(ion)$/;\n\n var re_5 = /^(.+?)e$/;\n var re_5_1 = /ll$/;\n var re3_5 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var porterStemmer = function porterStemmer(w) {\n var stem,\n suffix,\n firstch,\n re,\n re2,\n re3,\n re4;\n\n if (w.length < 3) { return w; }\n\n firstch = w.substr(0,1);\n if (firstch == \"y\") {\n w = firstch.toUpperCase() + w.substr(1);\n }\n\n // Step 1a\n re = re_1a\n re2 = re2_1a;\n\n if (re.test(w)) { w = w.replace(re,\"$1$2\"); }\n else if (re2.test(w)) { w = w.replace(re2,\"$1$2\"); }\n\n // Step 1b\n re = re_1b;\n re2 = re2_1b;\n if (re.test(w)) {\n var fp = re.exec(w);\n re = re_mgr0;\n if (re.test(fp[1])) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1];\n re2 = re_s_v;\n if (re2.test(stem)) {\n w = stem;\n re2 = re2_1b_2;\n re3 = re3_1b_2;\n re4 = re4_1b_2;\n if (re2.test(w)) { w = w + \"e\"; }\n else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,\"\"); }\n else if (re4.test(w)) { w =w + \"e\"; }\n }\n }\n\n // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)\n re = re_1c;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n w = stem + \"i\";\n }\n\n // Step 2\n re = re_2;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step2list[suffix];\n }\n }\n\n // Step 3\n re = re_3;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step3list[suffix];\n }\n }\n\n // Step 4\n re = re_4;\n re2 = re2_4;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n if (re.test(stem)) {\n w = stem;\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1] + fp[2];\n re2 = re_mgr1;\n if (re2.test(stem)) {\n w = stem;\n }\n }\n\n // Step 5\n re = re_5;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n re2 = re_meq1;\n re3 = re3_5;\n if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {\n w = stem;\n }\n }\n\n re = re_5_1;\n re2 = re_mgr1;\n if (re.test(w) && re2.test(w)) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n\n // and turn initial Y back to y\n\n if (firstch == \"y\") {\n w = firstch.toLowerCase() + w.substr(1);\n }\n\n return w;\n };\n\n return function (token) {\n return token.update(porterStemmer);\n }\n})();\n\nlunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')\n/*!\n * lunr.stopWordFilter\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.generateStopWordFilter builds a stopWordFilter function from the provided\n * list of stop words.\n *\n * Thebuilt in lunr.stopWordFilter is built using this generator and can be used\n * to generate custom stopWordFilters for applications or non English languages.\n *\n * @function\n * @param {Array} token The token to pass through the filter\n * @returns {lunr.PipelineFunction}\n * @see lunr.Pipeline\n * @see lunr.stopWordFilter\n */\nlunr.generateStopWordFilter = function (stopWords) {\n var words = stopWords.reduce(function (memo, stopWord) {\n memo[stopWord] = stopWord\n return memo\n }, {})\n\n return function (token) {\n if (token && words[token.toString()] !== token.toString()) return token\n }\n}\n\n/**\n * lunr.stopWordFilter is an English language stop word list filter, any words\n * contained in the list will not be passed through the filter.\n *\n * This is intended to be used in the Pipeline. If the token does not pass the\n * filter then undefined will be returned.\n *\n * @function\n * @implements {lunr.PipelineFunction}\n * @params {lunr.Token} token - A token to check for being a stopword.\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n */\nlunr.stopWordFilter = lunr.generateStopWordFilter([\n 'a',\n 'able',\n 'about',\n 'across',\n 'after',\n 'all',\n 'almost',\n 'also',\n 'am',\n 'among',\n 'an',\n 'and',\n 'any',\n 'are',\n 'as',\n 'at',\n 'be',\n 'because',\n 'been',\n 'but',\n 'by',\n 'can',\n 'cannot',\n 'could',\n 'dear',\n 'did',\n 'do',\n 'does',\n 'either',\n 'else',\n 'ever',\n 'every',\n 'for',\n 'from',\n 'get',\n 'got',\n 'had',\n 'has',\n 'have',\n 'he',\n 'her',\n 'hers',\n 'him',\n 'his',\n 'how',\n 'however',\n 'i',\n 'if',\n 'in',\n 'into',\n 'is',\n 'it',\n 'its',\n 'just',\n 'least',\n 'let',\n 'like',\n 'likely',\n 'may',\n 'me',\n 'might',\n 'most',\n 'must',\n 'my',\n 'neither',\n 'no',\n 'nor',\n 'not',\n 'of',\n 'off',\n 'often',\n 'on',\n 'only',\n 'or',\n 'other',\n 'our',\n 'own',\n 'rather',\n 'said',\n 'say',\n 'says',\n 'she',\n 'should',\n 'since',\n 'so',\n'some',\n 'than',\n 'that',\n 'the',\n 'their',\n 'them',\n 'then',\n 'there',\n 'these',\n 'they',\n 'this',\n 'tis',\n 'to',\n 'too',\n 'twas',\n 'us',\n 'wants',\n 'was',\n 'we',\n 'were',\n 'what',\n 'when',\n 'where',\n 'which',\n 'while',\n 'who',\n 'whom',\n 'why',\n 'will',\n 'with',\n 'would',\n 'yet',\n 'you',\n 'your'\n])\n\nlunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')\n/*!\n * lunr.trimmer\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.trimmer is a pipeline function for trimming non word\n * characters from the beginning and end of tokens before they\n * enter the index.\n *\n * This implementation may not work correctly for non latin\n * characters and should either be removed or adapted for use\n * with languages with non-latin characters.\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token The token to pass through the filter\n * @returns {lunr.Token}\n * @see lunr.Pipeline\n */\nlunr.trimmer = function (token) {\n return token.update(function (s) {\n return s.replace(/^\\W+/, '').replace(/\\W+$/, '')\n })\n}\n\nlunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')\n/*!\n * lunr.TokenSet\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A token set is used to store the unique list of all tokens\n * within an index. Token sets are also used to represent an\n * incoming query to the index, this query token set and index\n * token set are then intersected to find which tokens to look\n * up in the inverted index.\n *\n * A token set can hold multiple tokens, as in the case of the\n * index token set, or it can hold a single token as in the\n * case of a simple query token set.\n *\n * Additionally token sets are used to perform wildcard matching.\n * Leading, contained and trailing wildcards are supported, and\n * from this edit distance matching can also be provided.\n *\n * Token sets are implemented as a minimal finite state automata,\n * where both common prefixes and suffixes are shared between tokens.\n * This helps to reduce the space used for storing the token set.\n *\n * @constructor\n */\nlunr.TokenSet = function () {\n this.final = false\n this.edges = {}\n this.id = lunr.TokenSet._nextId\n lunr.TokenSet._nextId += 1\n}\n\n/**\n * Keeps track of the next, auto increment, identifier to assign\n * to a new tokenSet.\n *\n * TokenSets require a unique identifier to be correctly minimised.\n *\n * @private\n */\nlunr.TokenSet._nextId = 1\n\n/**\n * Creates a TokenSet instance from the given sorted array of words.\n *\n * @param {String[]} arr - A sorted array of strings to create the set from.\n * @returns {lunr.TokenSet}\n * @throws Will throw an error if the input array is not sorted.\n */\nlunr.TokenSet.fromArray = function (arr) {\n var builder = new lunr.TokenSet.Builder\n\n for (var i = 0, len = arr.length; i < len; i++) {\n builder.insert(arr[i])\n }\n\n builder.finish()\n return builder.root\n}\n\n/**\n * Creates a token set from a query clause.\n *\n *@private\n * @param {Object} clause - A single clause from lunr.Query.\n * @param {string} clause.term - The query clause term.\n * @param {number} [clause.editDistance] - The optional edit distance for the term.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromClause = function (clause) {\n if ('editDistance' in clause) {\n return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)\n } else {\n return lunr.TokenSet.fromString(clause.term)\n }\n}\n\n/**\n * Creates a token set representing a single string with a specified\n * edit distance.\n *\n * Insertions, deletions, substitutions and transpositions are each\n * treated as an edit distance of 1.\n *\n * Increasing the allowed edit distance will have a dramatic impact\n * on the performance of both creating and intersecting these TokenSets.\n * It is advised to keep the edit distance less than 3.\n *\n * @param {string} str - The string to create the token set from.\n * @param {number} editDistance - The allowed edit distance to match.\n * @returns {lunr.Vector}\n */\nlunr.TokenSet.fromFuzzyString = function (str, editDistance) {\n var root = new lunr.TokenSet\n\n var stack = [{\n node: root,\n editsRemaining: editDistance,\n str: str\n }]\n\n while (stack.length) {\n var frame = stack.pop()\n\n // no edit\n if (frame.str.length > 0) {\n var char = frame.str.charAt(0),\n noEditNode\n\n if (char in frame.node.edges) {\n noEditNode = frame.node.edges[char]\n } else {\n noEditNode = new lunr.TokenSet\n frame.node.edges[char] = noEditNode\n }\n\n if (frame.str.length == 1) {\n noEditNode.final = true\n }\n\n stack.push({\n node: noEditNode,\n editsRemaining: frame.editsRemaining,\n str: frame.str.slice(1)\n })\n }\n\n if (frame.editsRemaining == 0) {\n continue\n }\n\n // insertion\n if (\"*\" in frame.node.edges) {\n var insertionNode = frame.node.edges[\"*\"]\n } else {\n var insertionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = insertionNode\n }\n\n if (frame.str.length == 0) {\n insertionNode.final = true\n }\n\n stack.push({\n node: insertionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str\n })\n\n // deletion\n // can only do a deletion if we have enough edits remaining\n // and if there are characters left to delete in the string\n if (frame.str.length > 1) {\n stack.push({\n node: frame.node,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // deletion\n // just removing the last character from the str\n if (frame.str.length == 1) {\n frame.node.final = true\n }\n\n // substitution\n // can only do a substitution if we have enough edits remaining\n // and if there are characters left to substitute\n if (frame.str.length >= 1) {\n if (\"*\" in frame.node.edges) {\n var substitutionNode = frame.node.edges[\"*\"]\n } else {\n var substitutionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = substitutionNode\n }\n\n if (frame.str.length == 1) {\n substitutionNode.final = true\n }\n\n stack.push({\n node: substitutionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // transposition\n // can only do a transposition if there are edits remaining\n // and there are enough characters to transpose\n if (frame.str.length > 1) {\n var charA = frame.str.charAt(0),\n charB = frame.str.charAt(1),\n transposeNode\n\n if (charB in frame.node.edges) {\n transposeNode = frame.node.edges[charB]\n } else {\n transposeNode = new lunr.TokenSet\n frame.node.edges[charB] = transposeNode\n }\n\n if (frame.str.length == 1) {\n transposeNode.final = true\n }\n\n stack.push({\n node: transposeNode,\n editsRemaining: frame.editsRemaining - 1,\n str: charA + frame.str.slice(2)\n })\n }\n }\n\n return root\n}\n\n/**\n * Creates a TokenSet from a string.\n *\n * The string may contain one or more wildcard characters (*)\n * that will allow wildcard matching when intersecting with\n * another TokenSet.\n *\n * @param {string} str - The string to create a TokenSet from.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromString = function (str) {\n var node = new lunr.TokenSet,\n root = node\n\n /*\n * Iterates through all characters within the passed string\n * appending a node for each character.\n *\n * When a wildcard character is found then a self\n * referencing edge is introduced to continually match\n * any number of any characters.\n */\n for (var i = 0, len = str.length; i < len; i++) {\n var char = str[i],\n final = (i == len - 1)\n\n if (char == \"*\") {\n node.edges[char] = node\n node.final = final\n\n } else {\n var next = new lunr.TokenSet\n next.final = final\n\n node.edges[char] = next\n node = next\n }\n }\n\n return root\n}\n\n/**\n * Converts this TokenSet into an array of strings\n * contained within the TokenSet.\n *\n * This is not intended to be used on a TokenSet that\n * contains wildcards, in these cases the results are\n * undefined and are likely to cause an infinite loop.\n *\n * @returns {string[]}\n */\nlunr.TokenSet.prototype.toArray = function () {\n var words = []\n\n var stack = [{\n prefix: \"\",\n node: this\n }]\n\n while (stack.length) {\n var frame = stack.pop(),\n edges = Object.keys(frame.node.edges),\n len = edges.length\n\n if (frame.node.final) {\n /* In Safari, at this point the prefix is sometimes corrupted, see:\n * https://github.com/olivernn/lunr.js/issues/279 Calling any\n * String.prototype method forces Safari to \"cast\" this string to what\n * it's supposed to be, fixing the bug. */\n frame.prefix.charAt(0)\n words.push(frame.prefix)\n }\n\n for (var i = 0; i < len; i++) {\n var edge = edges[i]\n\n stack.push({\n prefix: frame.prefix.concat(edge),\n node: frame.node.edges[edge]\n })\n }\n }\n\n return words\n}\n\n/**\n * Generates a string representation of a TokenSet.\n *\n * This is intended to allow TokenSets to be used as keys\n * in objects, largely to aid the construction and minimisation\n * of a TokenSet. As such it is not designed to be a human\n * friendly representation of the TokenSet.\n *\n * @returns {string}\n */\nlunr.TokenSet.prototype.toString = function () {\n // NOTE: Using Object.keys here as this.edges is very likely\n // to enter 'hash-mode' with many keys being added\n //\n // avoiding a for-in loop here as it leads to the function\n // being de-optimised (at least in V8). From some simple\n // benchmarks the performance is comparable, but allowing\n // V8 to optimize may mean easy performance wins in the future.\n\n if (this._str) {\n return this._str\n }\n\n var str = this.final ? '1' : '0',\n labels = Object.keys(this.edges).sort(),\n len = labels.length\n\n for (var i = 0; i < len; i++) {\n var label = labels[i],\n node = this.edges[label]\n\n str = str + label + node.id\n }\n\n return str\n}\n\n/**\n * Returns a new TokenSet that is the intersection of\n * this TokenSet and the passed TokenSet.\n *\n * This intersection will take into account any wildcards\n * contained within the TokenSet.\n *\n * @param {lunr.TokenSet} b - An other TokenSet to intersect with.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.prototype.intersect = function (b) {\n var output = new lunr.TokenSet,\n frame = undefined\n\n var stack = [{\n qNode: b,\n output: output,\n node: this\n }]\n\n while (stack.length) {\n frame = stack.pop()\n\n // NOTE: As with the #toString method, we are using\n // Object.keys and a for loop instead of a for-in loop\n // as both of these objects enter 'hash' mode, causing\n //the function to be de-optimised in V8\n var qEdges = Object.keys(frame.qNode.edges),\n qLen = qEdges.length,\n nEdges = Object.keys(frame.node.edges),\n nLen = nEdges.length\n\n for (var q = 0; q < qLen; q++) {\n var qEdge = qEdges[q]\n\n for (var n = 0; n < nLen; n++) {\n var nEdge = nEdges[n]\n\n if (nEdge == qEdge || qEdge == '*') {\n var node = frame.node.edges[nEdge],\n qNode = frame.qNode.edges[qEdge],\n final = node.final && qNode.final,\n next = undefined\n\n if (nEdge in frame.output.edges) {\n // an edge already exists for this character\n // no need to create a new node, just set the finality\n // bit unless this node is already final\n next = frame.output.edges[nEdge]\n next.final = next.final || final\n\n } else {\n // no edge exists yet, must create one\n // set the finality bit and insert it\n// into the output\n next = new lunr.TokenSet\n next.final = final\n frame.output.edges[nEdge] = next\n }\n\n stack.push({\n qNode: qNode,\n output: next,\n node: node\n })\n }\n }\n }\n }\n\n return output\n}\nlunr.TokenSet.Builder = function () {\n this.previousWord = \"\"\n this.root = new lunr.TokenSet\n this.uncheckedNodes = []\n this.minimizedNodes = {}\n}\n\nlunr.TokenSet.Builder.prototype.insert = function (word) {\n var node,\n commonPrefix = 0\n\n if (word < this.previousWord) {\n throw new Error (\"Out of order word insertion\")\n }\n\n for (var i = 0; i < word.length && i < this.previousWord.length; i++) {\n if (word[i] != this.previousWord[i]) break\n commonPrefix++\n }\n\n this.minimize(commonPrefix)\n\n if (this.uncheckedNodes.length == 0) {\n node = this.root\n } else {\n node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child\n }\n\n for(var i = commonPrefix; i < word.length; i++) {\n var nextNode = new lunr.TokenSet,\n char = word[i]\n\n node.edges[char] = nextNode\n\n this.uncheckedNodes.push({\n parent: node,\n char: char,\n child: nextNode\n })\n\n node = nextNode\n }\n\n node.final = true\n this.previousWord = word\n}\n\nlunr.TokenSet.Builder.prototype.finish = function () {\n this.minimize(0)\n}\n\nlunr.TokenSet.Builder.prototype.minimize = function (downTo) {\n for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {\n var node = this.uncheckedNodes[i],\n childKey = node.child.toString()\n\n if (childKey in this.minimizedNodes) {\n node.parent.edges[node.char] = this.minimizedNodes[childKey]\n } else {\n // Cache the key for this node since\n // we know it can't change anymore\n node.child._str = childKey\n\n this.minimizedNodes[childKey] = node.child\n }\n\n this.uncheckedNodes.pop()\n }\n}\n/*!\n * lunr.Index\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * An index contains the built index of all documents and provides a query interface\n * to the index.\n *\n * Usually instances of lunr.Index will not be created using this constructor, instead\n * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be\n * used to load previously built and serialized indexes.\n *\n * @constructor\n * @param {Object} attrs - The attributes of the built search index.\n * @param {Object} attrs.invertedIndex - An index of term/field to document reference.\n * @param {Object<string, lunr.Vector>} attrs.fieldVectors - Field vectors\n * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.\n * @param {string[]} attrs.fields - The names of indexed document fields.\n * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.\n */\nlunr.Index = function (attrs) {\n this.invertedIndex = attrs.invertedIndex\n this.fieldVectors = attrs.fieldVectors\n this.tokenSet = attrs.tokenSet\n this.fields = attrs.fields\n this.pipeline = attrs.pipeline\n}\n\n/**\n * A result contains details of a document matching a search query.\n * @typedef {Object} lunr.Index~Result\n * @property {string} ref - The reference of the document this result represents.\n * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.\n * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.\n */\n\n/**\n * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple\n * query language which itself is parsed into an instance of lunr.Query.\n *\n * For programmatically building queries it is advised to directly use lunr.Query, the query language\n * is best used for human entered text rather than program generated text.\n *\n * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported\n * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'\n * or 'world', though those that contain both will rank higher in the results.\n *\n * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can\n * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding\n * wildcards will increase the number of documents that will be found but can also have a negative\n * impact on query performance, especially with wildcards at the beginning of a term.\n *\n * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term\n * hello in the title field will match this query. Using a field not present in the index will lead\n * to an error being thrown.\n *\n * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term\n * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported\n * to provide fuzzy matching, e.g. 'hello~2' willmatch documents with hello with an edit distance of 2.\n * Avoid large values for edit distance to improve query performance.\n *\n * Each term also supports a presence modifier. By default a term's presence in document is optional, however\n * this can be changed to either required or prohibited. For a term's presence to be required in a document the\n * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and\n * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not\n * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.\n *\n * To escape special characters the backslash character '\\' can be used, this allows searches to include\n * characters that would normally be considered modifiers, e.g. `foo\\~2` will search for a term \"foo~2\" instead\n * of attempting to apply a boost of 2 to the search term \"foo\".\n *\n * @typedef {string} lunr.Index~QueryString\n * @example <caption>Simple single term query</caption>\n * hello\n * @example <caption>Multiple term query</caption>\n * hello world\n * @example <caption>term scoped to a field</caption>\n * title:hello\n * @example <caption>term with a boost of 10</caption>\n * hello^10\n * @example <caption>term with an edit distance of 2</caption>\n * hello~2\n * @example <caption>terms with presence modifiers</caption>\n * -foo +bar baz\n */\n\n/**\n * Performs a search against the index using lunr query syntax.\n *\n * Results will be returned sorted by their score, the most relevant results\n * will be returned first. For details on how the score is calculated, please see\n * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.\n *\n * For more programmatic querying use lunr.Index#query.\n *\n * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.\n * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.search = function (queryString) {\n return this.query(function (query) {\n var parser = new lunr.QueryParser(queryString, query)\n parser.parse()\n })\n}\n\n/**\n * A query builder callback provides a query object to be used to express\n * the query to perform on the index.\n *\n * @callback lunr.Index~queryBuilder\n * @param {lunr.Query} query - The query object to build up.\n * @this lunr.Query\n */\n\n/**\n * Performs a query against the index using the yielded lunr.Query object.\n *\n * If performing programmatic queries against the index, this method is preferred\n * over lunr.Index#search so as to avoid the additional query parsing overhead.\n *\n * A query object is yielded to the supplied function which should be used to\n * express the query to be run against the index.\n *\n * Note that although this function takes a callback parameter it is _not_ an\n * asynchronous operation, the callback is just yielded a query object to be\n * customized.\n *\n * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.query = function (fn) {\n // for each query clause\n // * process terms\n // * expand terms from token set\n // * find matching documents and metadata\n // * get document vectors\n // * score documents\n\n var query = new lunr.Query(this.fields),\n matchingFields = Object.create(null),\n queryVectors = Object.create(null),\n termFieldCache = Object.create(null),\n requiredMatches = Object.create(null),\n prohibitedMatches = Object.create(null)\n\n /*\n * To support field level boosts a query vector is created per\n * field. An empty vector is eagerly created to support negated\n * queries.\n */\n for (var i = 0; i < this.fields.length; i++) {\n queryVectors[this.fields[i]] = new lunr.Vector\n }\n\n fn.call(query, query)\n\n for (var i = 0; i < query.clauses.length; i++) {\n /*\n * Unless the pipeline has been disabled for this term, which is\n * the case for terms with wildcards, we need to pass the clause\n * term through the search pipeline. A pipeline returns an array\n * of processed terms. Pipeline functions may expand the passed\n * term, which means we may end up performing multiple index lookups\n * for a single query term.\n */\n var clause = query.clauses[i],\n terms = null,\n clauseMatches = lunr.Set.empty\n\n if (clause.usePipeline) {\n terms = this.pipeline.runString(clause.term, {\n fields: clause.fields\n })\n } else {\n terms = [clause.term]\n }\n\n for (var m = 0; m < terms.length; m++) {\n var term = terms[m]\n\n /*\n * Each term returned from the pipeline needs to use the same query\n * clause object, e.g. the same boost and or edit distance. The\n * simplest way to do this is to re-use the clause object but mutate\n * its term property.\n */\n clause.term = term\n\n /*\n * From the term in the clause we create a token set which will then\n * be used to intersect the indexes token set to get a list of terms\n * to lookup in the inverted index\n */\n var termTokenSet = lunr.TokenSet.fromClause(clause),\n expandedTerms = this.tokenSet.intersect(termTokenSet).toArray()\n\n /*\n * If a term marked as required does not exist in the tokenSet it is\n * impossible for the search to return any matches. We set all the field\n * scoped required matches set to empty and stop examining any further\n * clauses.\n */\n if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = lunr.Set.empty\n }\n\n break\n }\n\n for (var j = 0; j < expandedTerms.length; j++) {\n /*\n * For each term get the posting and termIndex, this is requiredfor\n * building the query vector.\n */\n var expandedTerm = expandedTerms[j],\n posting = this.invertedIndex[expandedTerm],\n termIndex = posting._index\n\n for (var k = 0; k < clause.fields.length; k++) {\n /*\n * For each field that this query term is scoped by (by default\n * all fields are in scope) we need to get all the document refs\n * that have this term in that field.\n *\n * The posting is the entry in the invertedIndex for the matching\n * term from above.\n */\n var field = clause.fields[k],\n fieldPosting = posting[field],\n matchingDocumentRefs = Object.keys(fieldPosting),\n termField = expandedTerm + \"/\" + field,\n matchingDocumentsSet = new lunr.Set(matchingDocumentRefs)\n\n /*\n * if the presence of this term is required ensure that the matching\n * documents are added to the set of required matches for this clause.\n *\n */\n if (clause.presence == lunr.Query.presence.REQUIRED) {\n clauseMatches = clauseMatches.union(matchingDocumentsSet)\n\n if (requiredMatches[field] === undefined) {\n requiredMatches[field] = lunr.Set.complete\n }\n }\n\n /*\n * if the presence of this term is prohibited ensure that the matching\n * documents are added to the set of prohibited matches for this field,\n * creating that set if it does not yet exist.\n */\n if (clause.presence == lunr.Query.presence.PROHIBITED) {\n if (prohibitedMatches[field] === undefined) {\n prohibitedMatches[field] = lunr.Set.empty\n }\n\n prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet)\n\n /*\n * Prohibited matches should not be part of the query vector used for\n *similarity scoring and no metadata should be extracted so we continue\n * to the next field\n */\n continue\n }\n\n /*\n * The query field vector is populated using the termIndex found for\n * the term and a unit value with the appropriate boost applied.\n * Using upsert because there could already be an entry in the vector\n * for the term we are working with. In that case we just add the scores\n * together.\n */\n queryVectors[field].upsert(termIndex, clause.boost, function (a, b) { return a + b })\n\n /**\n * If we've already seen this term, field combo then we've already collected\n * the matching documents and metadata, no need to go through all that again\n */\n if (termFieldCache[termField]) {\n continue\n }\n\n for (var l = 0; l < matchingDocumentRefs.length; l++) {\n /*\n * All metadata for this term/field/document triple\n * are then extracted and collected into an instance\n * of lunr.MatchData ready to be returned in the query\n * results\n */\n var matchingDocumentRef = matchingDocumentRefs[l],\n matchingFieldRef = new lunr.FieldRef (matchingDocumentRef, field),\n metadata = fieldPosting[matchingDocumentRef],\n fieldMatch\n\n if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {\n matchingFields[matchingFieldRef] = new lunr.MatchData (expandedTerm, field, metadata)\n } else {\n fieldMatch.add(expandedTerm, field, metadata)\n }\n\n }\n\n termFieldCache[termField] = true\n }\n }\n }\n\n /**\n * If the presence was required we need to update the requiredMatches field sets.\n * We do this after all fields for the term have collected their matches because\n * theclause terms presence is required in _any_ of the fields not _all_ of the\n * fields.\n */\n if (clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = requiredMatches[field].intersect(clauseMatches)\n }\n }\n }\n\n /**\n * Need to combine the field scoped required and prohibited\n * matching documents into a global set of required and prohibited\n * matches\n */\n var allRequiredMatches = lunr.Set.complete,\n allProhibitedMatches = lunr.Set.empty\n\n for (var i = 0; i < this.fields.length; i++) {\n var field = this.fields[i]\n\n if (requiredMatches[field]) {\n allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field])\n }\n\n if (prohibitedMatches[field]) {\n allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field])\n }\n }\n\n var matchingFieldRefs = Object.keys(matchingFields),\n results = [],\n matches = Object.create(null)\n\n /*\n * If the query is negated (contains only prohibited terms)\n * we need to get _all_ fieldRefs currently existing in the\n * index. This is only done when we know that the query is\n * entirely prohibited terms to avoid any cost of getting all\n * fieldRefs unnecessarily.\n *\n * Additionally, blank MatchData must be created to correctly\n * populate the results.\n */\n if (query.isNegated()) {\n matchingFieldRefs = Object.keys(this.fieldVectors)\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n var matchingFieldRef = matchingFieldRefs[i]\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRef)\n matchingFields[matchingFieldRef] = new lunr.MatchData\n }\n }\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n /*\n * Currently we have document fields that match the query, but we\n * need to return documents. The matchData and scores are combined\n * from multiple fields belonging to the same document.\n *\n * Scores are calculated by field, using the query vectors created\n * above, and combined into a final document score using addition.\n */\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),\n docRef = fieldRef.docRef\n\n if (!allRequiredMatches.contains(docRef)) {\n continue\n }\n\n if (allProhibitedMatches.contains(docRef)) {\n continue\n }\n\n var fieldVector = this.fieldVectors[fieldRef],\n score = queryVectors[fieldRef.fieldName].similarity(fieldVector),\n docMatch\n\n if ((docMatch = matches[docRef]) !== undefined) {\n docMatch.score += score\n docMatch.matchData.combine(matchingFields[fieldRef])\n } else {\n var match = {\n ref: docRef,\n score: score,\n matchData: matchingFields[fieldRef]\n }\n matches[docRef] = match\n results.push(match)\n }\n }\n\n /*\n * Sort the results objects by score, highest first.\n */\n return results.sort(function (a, b) {\n return b.score - a.score\n })\n}\n\n/**\n * Prepares the index for JSON serialization.\n *\n * The schema for this JSON blob will be described in a\n * separate JSON schema file.\n *\n * @returns {Object}\n */\nlunr.Index.prototype.toJSON = function () {\n var invertedIndex = Object.keys(this.invertedIndex)\n .sort()\n .map(function (term) {\n return [term, this.invertedIndex[term]]\n }, this)\n\n var fieldVectors = Object.keys(this.fieldVectors)\n .map(function (ref) {\n return [ref, this.fieldVectors[ref].toJSON()]\n }, this)\n\n return {\n version: lunr.version,\n fields: this.fields,\n fieldVectors: fieldVectors,\n invertedIndex: invertedIndex,\n pipeline: this.pipeline.toJSON()\n }\n}\n\n/**\n * Loads a previously serialized lunr.Index\n *\n * @param {Object} serializedIndex - A previously serialized lunr.Index\n * @returns {lunr.Index}\n */\nlunr.Index.load = function (serializedIndex) {\n var attrs = {},\n fieldVectors= {},\n serializedVectors = serializedIndex.fieldVectors,\n invertedIndex = Object.create(null),\n serializedInvertedIndex = serializedIndex.invertedIndex,\n tokenSetBuilder = new lunr.TokenSet.Builder,\n pipeline = lunr.Pipeline.load(serializedIndex.pipeline)\n\n if (serializedIndex.version != lunr.version) {\n lunr.utils.warn(\"Version mismatch when loading serialised index. Current version of lunr '\" + lunr.version + \"' does not match serialized index '\" + serializedIndex.version + \"'\")\n }\n\n for (var i = 0; i < serializedVectors.length; i++) {\n var tuple = serializedVectors[i],\n ref = tuple[0],\n elements = tuple[1]\n\n fieldVectors[ref] = new lunr.Vector(elements)\n }\n\n for (var i = 0; i < serializedInvertedIndex.length; i++) {\n var tuple = serializedInvertedIndex[i],\n term = tuple[0],\n posting = tuple[1]\n\n tokenSetBuilder.insert(term)\n invertedIndex[term] = posting\n }\n\n tokenSetBuilder.finish()\n\n attrs.fields = serializedIndex.fields\n\n attrs.fieldVectors = fieldVectors\n attrs.invertedIndex = invertedIndex\n attrs.tokenSet = tokenSetBuilder.root\n attrs.pipeline = pipeline\n\n return new lunr.Index(attrs)\n}\n/*!\n * lunr.Builder\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.Builder performs indexing on a set of documents and\n * returns instances of lunr.Index ready for querying.\n *\n * All configuration of the index is done via the builder, the\n * fields to index, the document reference, the text processing\n * pipeline and document scoring parameters are all set on the\n * builder before indexing.\n *\n * @constructor\n * @property {string} _ref - Internal reference to the document reference field.\n * @property {string[]} _fields - Internal reference to the document fields to index.\n * @property {object} invertedIndex - The inverted index maps terms to document fields.\n * @property {object} documentTermFrequencies - Keeps track of document term frequencies.\n * @property {object} documentLengths - Keeps track of the length of documents added to the index.\n * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.\n * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.\n * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.\n * @property {number} documentCount - Keeps track of the total number of documents indexed.\n * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.\n * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.\n * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.\n * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.\n */\nlunr.Builder = function () {\n this._ref = \"id\"\n this._fields = Object.create(null)\n this._documents = Object.create(null)\n this.invertedIndex = Object.create(null)\n this.fieldTermFrequencies = {}\n this.fieldLengths = {}\n this.tokenizer = lunr.tokenizer\n this.pipeline = new lunr.Pipeline\n this.searchPipeline = new lunr.Pipeline\n this.documentCount = 0\n this._b = 0.75\n this._k1 = 1.2\n this.termIndex = 0\n this.metadataWhitelist = []\n}\n\n/**\n * Sets the document field used as the document reference. Every document must have this field.\n * The type of this field in the document should be a string, if it is not a string it will be\n * coerced into a string by calling toString.\n *\n * The default ref is 'id'.\n *\n * The ref should _not_ be changed during indexing, it should be set before any documents are\n * added to the index. Changing it during indexing can lead to inconsistent results.\n *\n * @param {string} ref - The name of the reference field in the document.\n */\nlunr.Builder.prototype.ref = function (ref) {\n this._ref = ref\n}\n\n/**\n * A function that is used to extract a field from a document.\n *\n * Lunr expects a field to be at the top level of a document, if however the field\n * is deeply nested within a document an extractor function can be used to extract\n * the right field for indexing.\n *\n * @callback fieldExtractor\n * @param {object} doc - The document being added to the index.\n * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.\n * @example <caption>Extracting a nested field</caption>\n * function (doc) { return doc.nested.field }\n */\n\n/**\n * Adds a field to the list of document fields that will be indexed. Every document being\n * indexed should have this field. Null values for this field in indexed documents will\n * not cause errors but will limit the chance of that document being retrieved by searches.\n *\n * All fields should be added before adding documents to the index. Adding fields after\n * a document has been indexed will have no effect on already indexed documents.\n *\n * Fields can be boosted at build time. This allows terms within that field to have more\n * importance when ranking search results. Use a field boost to specify that matches within\n * one field are more important than other fields.\n *\n * @param {string} fieldName - The name of a field to index in all documents.\n * @param {object} attributes - Optional attributes associated with this field.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.\n * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.\n * @throws {RangeError} fieldName cannot contain unsupported characters '/'\n */\nlunr.Builder.prototype.field = function (fieldName, attributes) {\n if (/\\//.test(fieldName)) {\n throw new RangeError (\"Field '\" + fieldName + \"' contains illegal character '/'\")\n }\n\n this._fields[fieldName] = attributes || {}\n}\n\n/**\n * A parameter to tune the amount of field length normalisation that is applied when\n * calculating relevance scores. A value of 0 will completely disable any normalisation\n * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b\n * will be clamped to the range 0 - 1.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.b = function (number) {\n if (number < 0) {\n this._b = 0\n } else if (number > 1) {\n this._b = 1\n } else {\n this._b = number\n }\n}\n\n/**\n * A parameter that controls the speed at which a rise in term frequency results in term\n * frequency saturation. The default value is 1.2. Setting this to a higher value will give\n * slower saturation levels, a lower value will result in quicker saturation.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.k1 = function (number) {\n this._k1 = number\n}\n\n/**\n * Adds a document to the index.\n *\n * Before adding fields to the index the index should have been fully setup, with the document\n * ref and all fields to index already having been specified.\n *\n * The document must have a field name as specified by the ref (by default this is 'id') and\n * it should have all fields defined for indexing, though null or undefined values will not\n * cause errors.\n *\n * Entire documents can be boosted at build time. Applying a boost to a document indicates that\n * this document should rank higher in search results than other documents.\n *\n * @param {object} doc - The document to add to the index.\n * @param {object} attributes - Optional attributes associated with this document.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.\n */\nlunr.Builder.prototype.add = function (doc, attributes) {\n var docRef = doc[this._ref],\n fields = Object.keys(this._fields)\n\n this._documents[docRef] = attributes || {}\n this.documentCount += 1\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i],\n extractor = this._fields[fieldName].extractor,\n field = extractor ? extractor(doc) : doc[fieldName],\n tokens = this.tokenizer(field, {\n fields: [fieldName]\n }),\n terms = this.pipeline.run(tokens),\n fieldRef = new lunr.FieldRef (docRef, fieldName),\n fieldTerms = Object.create(null)\n\n this.fieldTermFrequencies[fieldRef] = fieldTerms\n this.fieldLengths[fieldRef] = 0\n\n // store the length of this field for this document\n this.fieldLengths[fieldRef] += terms.length\n\n // calculate term frequencies for this field\n for (var j = 0; j < terms.length; j++) {\n var term = terms[j]\n\n if (fieldTerms[term] == undefined) {\n fieldTerms[term] = 0\n }\n\n fieldTerms[term] += 1\n\n // add to inverted index\n // create an initial posting if one doesn't exist\n if (this.invertedIndex[term]== undefined) {\n var posting = Object.create(null)\n posting[\"_index\"] = this.termIndex\n this.termIndex += 1\n\n for (var k = 0; k < fields.length; k++) {\n posting[fields[k]] = Object.create(null)\n }\n\n this.invertedIndex[term] = posting\n }\n\n // add an entry for this term/fieldName/docRef to the invertedIndex\n if (this.invertedIndex[term][fieldName][docRef] == undefined) {\n this.invertedIndex[term][fieldName][docRef] = Object.create(null)\n }\n\n // store all whitelisted metadata about this token in the\n // inverted index\n for (var l = 0; l < this.metadataWhitelist.length; l++) {\n var metadataKey = this.metadataWhitelist[l],\n metadata = term.metadata[metadataKey]\n\n if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {\n this.invertedIndex[term][fieldName][docRef][metadataKey] = []\n }\n\n this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata)\n }\n }\n\n }\n}\n\n/**\n * Calculates the average document length for this index\n *\n * @private\n */\nlunr.Builder.prototype.calculateAverageFieldLengths = function () {\n\n var fieldRefs = Object.keys(this.fieldLengths),\n numberOfFields = fieldRefs.length,\n accumulator = {},\n documentsWithField = {}\n\n for (var i = 0; i < numberOfFields; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n field = fieldRef.fieldName\n\n documentsWithField[field] || (documentsWithField[field] = 0)\n documentsWithField[field] += 1\n\n accumulator[field] || (accumulator[field] = 0)\n accumulator[field] += this.fieldLengths[fieldRef]\n }\n\n var fields = Object.keys(this._fields)\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i]\n accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName]\n }\n\n this.averageFieldLength = accumulator\n}\n\n/**\n * Builds a vector space modelof every document using lunr.Vector\n *\n * @private\n */\nlunr.Builder.prototype.createFieldVectors = function () {\n var fieldVectors = {},\n fieldRefs = Object.keys(this.fieldTermFrequencies),\n fieldRefsLength = fieldRefs.length,\n termIdfCache = Object.create(null)\n\n for (var i = 0; i < fieldRefsLength; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n fieldName = fieldRef.fieldName,\n fieldLength = this.fieldLengths[fieldRef],\n fieldVector = new lunr.Vector,\n termFrequencies = this.fieldTermFrequencies[fieldRef],\n terms = Object.keys(termFrequencies),\n termsLength = terms.length\n\n\n var fieldBoost = this._fields[fieldName].boost || 1,\n docBoost = this._documents[fieldRef.docRef].boost || 1\n\n for (var j = 0; j < termsLength; j++) {\n var term = terms[j],\n tf = termFrequencies[term],\n termIndex = this.invertedIndex[term]._index,\n idf, score, scoreWithPrecision\n\nif (termIdfCache[term] === undefined) {\n idf = lunr.idf(this.invertedIndex[term], this.documentCount)\n termIdfCache[term] = idf\n } else {\n idf = termIdfCache[term]\n }\n\n score = idf * ((this._k1 + 1) * tf) / (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf)\n score *= fieldBoost\n score *= docBoost\n scoreWithPrecision = Math.round(score * 1000) / 1000\n // Converts 1.23456789 to 1.234.\n // Reducing the precision so that the vectors take up less\n // space when serialised. Doing it now so that they behave\n // the same before and after serialisation. Also, this is\n // the fastest approach to reducing a number's precision in\n // JavaScript.\n\n fieldVector.insert(termIndex, scoreWithPrecision)\n }\n\n fieldVectors[fieldRef] = fieldVector\n }\n\n this.fieldVectors = fieldVectors\n}\n\n/**\n * Creates a token set of all tokens in the index using lunr.TokenSet\n *\n* @private\n */\nlunr.Builder.prototype.createTokenSet = function () {\n this.tokenSet = lunr.TokenSet.fromArray(\n Object.keys(this.invertedIndex).sort()\n )\n}\n\n/**\n * Builds the index, creating an instance of lunr.Index.\n *\n * This completes the indexing process and should only be called\n * once all documents have been added to the index.\n *\n * @returns {lunr.Index}\n */\nlunr.Builder.prototype.build = function () {\n this.calculateAverageFieldLengths()\n this.createFieldVectors()\n this.createTokenSet()\n\n return new lunr.Index({\n invertedIndex: this.invertedIndex,\n fieldVectors: this.fieldVectors,\n tokenSet: this.tokenSet,\n fields: Object.keys(this._fields),\n pipeline: this.searchPipeline\n })\n}\n\n/**\n * Applies a plugin to the index builder.\n *\n * A plugin is a function that is called with the index builder as its context.\n * Plugins can be used to customise or extend the behaviour of the index\n * in some way. A plugin is just a function, that encapsulatedthe custom\n * behaviour that should be applied when building the index.\n *\n * The plugin function will be called with the index builder as its argument, additional\n * arguments can also be passed when calling use. The function will be called\n * with the index builder as its context.\n *\n * @param {Function} plugin The plugin to apply.\n */\nlunr.Builder.prototype.use = function (fn) {\n var args = Array.prototype.slice.call(arguments, 1)\n args.unshift(this)\n fn.apply(this, args)\n}\n/**\n * Contains and collects metadata about a matching document.\n * A single instance of lunr.MatchData is returned as part of every\n * lunr.Index~Result.\n *\n * @constructor\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n * @property {object} metadata - A cloned collection of metadata associated with this document.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData = function (term, field, metadata) {\n var clonedMetadata = Object.create(null),\n metadataKeys = Object.keys(metadata || {})\n\n // Cloning the metadata to prevent the original\n // being mutated during match data combination.\n // Metadata is kept in an array within the inverted\n // index so cloning the data can be done with\n // Array#slice\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n clonedMetadata[key] = metadata[key].slice()\n }\n\n this.metadata = Object.create(null)\n\n if (term !== undefined) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = clonedMetadata\n }\n}\n\n/**\n * An instance of lunr.MatchData will be created for every term that matches a\n * document. However only one instance is required in a lunr.Index~Result. This\n * method combines metadata from another instance of lunr.MatchData with this\n * objects metadata.\n *\n * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData.prototype.combine = function (otherMatchData) {\n var terms = Object.keys(otherMatchData.metadata)\n\n for (var i = 0; i < terms.length; i++) {\n var term = terms[i],\n fields = Object.keys(otherMatchData.metadata[term])\n\n if (this.metadata[term] == undefined) {\n this.metadata[term] = Object.create(null)\n }\n\n for (var j = 0; j < fields.length; j++) {\n var field = fields[j],\n keys = Object.keys(otherMatchData.metadata[term][field])\n\n if (this.metadata[term][field] == undefined) {\n this.metadata[term][field] = Object.create(null)\n }\n\n for (var k = 0; k < keys.length; k++) {\n var key = keys[k]\n\n if (this.metadata[term][field][key] == undefined) {\n this.metadata[term][field][key] = otherMatchData.metadata[term][field][key]\n } else {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(otherMatchData.metadata[term][field][key])\n }\n\n }\n }\n }\n}\n\n/**\n * Add metadata for a term/field pair to this instance of match data.\n *\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n */\nlunr.MatchData.prototype.add = function (term, field, metadata) {\n if (!(term in this.metadata)) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = metadata\n return\n }\n\n if (!(field in this.metadata[term])) {\n this.metadata[term][field] = metadata\n return\n }\n\n var metadataKeys = Object.keys(metadata)\n\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n\n if (key in this.metadata[term][field]) {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key])\n } else {\n this.metadata[term][field][key] = metadata[key]\n }\n }\n}\n/**\n * A lunr.Query provides a programmatic way of defining queries to be performed\n * against a {@link lunr.Index}.\n *\n * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method\n * so the query object is pre-initialized with the right index fields.\n *\n * @constructor\n * @property {lunr.Query~Clause[]} clauses - An array of query clauses.\n * @property {string[]} allFields - An array of all available fields in a lunr.Index.\n */\nlunr.Query = function (allFields) {\n this.clauses = []\n this.allFields = allFields\n}\n\n/**\n * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.\n *\n * This allows wildcards to be added to the beginning and end of a term without having to manually do any string\n * concatenation.\n *\n * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.\n *\n * @constant\n * @default\n * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour\n * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists\n * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example <caption>query term with trailing wildcard</caption>\n * query.term('foo', { wildcard: lunr.Query.wildcard.TRAILING })\n * @example <caption>query term with leading and trailing wildcard</caption>\n * query.term('foo', {\n * wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING\n * })\n */\n\nlunr.Query.wildcard = new String (\"*\")\nlunr.Query.wildcard.NONE = 0\nlunr.Query.wildcard.LEADING = 1\nlunr.Query.wildcard.TRAILING = 2\n\n/**\n * Constants for indicating what kind of presence a term must have in matching documents.\n *\n * @constant\n * @enum {number}\n * @see lunr.Query~Clause\n* @see lunr.Query#clause\n * @see lunr.Query#term\n * @example <caption>query term with required presence</caption>\n * query.term('foo', { presence: lunr.Query.presence.REQUIRED })\n */\nlunr.Query.presence = {\n /**\n * Term's presence in a document is optional, this is the default value.\n */\n OPTIONAL: 1,\n\n /**\n * Term's presence in a document is required, documents that do not contain\n * this term will not be returned.\n */\n REQUIRED: 2,\n\n /**\n * Term's presence in a document is prohibited, documents that do contain\n * this term will not be returned.\n */\n PROHIBITED: 3\n}\n\n/**\n * A single clause in a {@link lunr.Query} contains a term and details on how to\n * match that term against a {@link lunr.Index}.\n *\n * @typedef {Object} lunr.Query~Clause\n * @property {string[]} fields - The fields in an index this clause should be matched against.\n * @property {number} [boost=1] - Any boost that should be applied when matching this clause.\n * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.\n * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.\n * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.\n * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.\n */\n\n/**\n * Adds a {@link lunr.Query~Clause} to this query.\n *\n * Unless the clause contains the fields to be matched all fields will be matched. In addition\n * a default boost of 1 is applied to the clause.\n *\n * @param {lunr.Query~Clause} clause - The clause to add to this query.\n * @see lunr.Query~Clause\n * @returns {lunr.Query}\n */\nlunr.Query.prototype.clause = function (clause) {\n if (!('fields' in clause)) {\n clause.fields = this.allFields\n }\n\n if (!('boost' in clause)) {\n clause.boost = 1\n }\n\n if (!('usePipeline' in clause)) {\n clause.usePipeline = true\n }\n\n if (!('wildcard' in clause)) {\n clause.wildcard = lunr.Query.wildcard.NONE\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.LEADING) && (clause.term.charAt(0) != lunr.Query.wildcard)) {\n clause.term = \"*\" + clause.term\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.TRAILING) && (clause.term.slice(-1) != lunr.Query.wildcard)) {\n clause.term = \"\" + clause.term + \"*\"\n }\n\n if (!('presence' in clause)) {\n clause.presence = lunr.Query.presence.OPTIONAL\n }\n\n this.clauses.push(clause)\n\n return this\n}\n\n/**\n * A negated query is one in which every clause has a presence of\n * prohibited. These queries require some special processing to return\n * the expected results.\n *\n * @returns boolean\n */\nlunr.Query.prototype.isNegated = function () {\n for (var i = 0; i < this.clauses.length; i++) {\n if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {\n return false\n }\n }\n\n return true\n}\n\n/**\n * Adds a term to thecurrent query, under the covers this will create a {@link lunr.Query~Clause}\n * to the list of clauses that make up this query.\n *\n * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion\n * to a token or token-like string should be done before calling this method.\n *\n * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an\n * array, each term in the array will share the same options.\n *\n * @param {object|object[]} term - The term(s) to add to the query.\n * @param {object} [options] - Any additional properties to add to the query clause.\n * @returns {lunr.Query}\n * @see lunr.Query#clause\n * @see lunr.Query~Clause\n * @example <caption>adding a single term to a query</caption>\n * query.term(\"foo\")\n * @example <caption>adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard</caption>\n * query.term(\"foo\", {\n * fields: [\"title\"],\n * boost: 10,\n * wildcard: lunr.Query.wildcard.TRAILING\n * })\n * @example <caption>using lunr.tokenizer to convert a string to tokens before using them as terms</caption>\n * query.term(lunr.tokenizer(\"foo bar\"))\n */\nlunr.Query.prototype.term = function (term, options) {\n if (Array.isArray(term)) {\n term.forEach(function (t) { this.term(t, lunr.utils.clone(options)) }, this)\n return this\n }\n\n var clause = options || {}\n clause.term = term.toString()\n\n this.clause(clause)\n\n return this\n}\nlunr.QueryParseError = function (message, start, end) {\n this.name = \"QueryParseError\"\n this.message = message\n this.start = start\n this.end = end\n}\n\nlunr.QueryParseError.prototype = new Error\nlunr.QueryLexer = function (str) {\n this.lexemes = []\n this.str = str\n this.length = str.length\n this.pos = 0\n this.start = 0\n this.escapeCharPositions = []\n}\n\nlunr.QueryLexer.prototype.run = function () {\n var state = lunr.QueryLexer.lexText\n\n while (state) {\n state = state(this)\n }\n}\n\nlunr.QueryLexer.prototype.sliceString = function () {\n var subSlices = [],\n sliceStart = this.start,\n sliceEnd = this.pos\n\n for (var i = 0; i < this.escapeCharPositions.length; i++) {\n sliceEnd = this.escapeCharPositions[i]\n subSlices.push(this.str.slice(sliceStart, sliceEnd))\n sliceStart = sliceEnd + 1\n }\n\n subSlices.push(this.str.slice(sliceStart, this.pos))\n this.escapeCharPositions.length = 0\n\n return subSlices.join('')\n}\n\nlunr.QueryLexer.prototype.emit = function (type) {\n this.lexemes.push({\n type: type,\n str: this.sliceString(),\n start: this.start,\n end: this.pos\n })\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.escapeCharacter = function () {\n this.escapeCharPositions.push(this.pos - 1)\n this.pos += 1\n}\n\nlunr.QueryLexer.prototype.next = function () {\n if (this.pos >= this.length) {\n return lunr.QueryLexer.EOS\n }\n\n var char = this.str.charAt(this.pos)\n this.pos += 1\n return char\n}\n\nlunr.QueryLexer.prototype.width = function () {\n return this.pos - this.start\n}\n\nlunr.QueryLexer.prototype.ignore = function () {\n if (this.start == this.pos) {\n this.pos += 1\n }\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.backup = function () {\n this.pos -= 1\n}\n\nlunr.QueryLexer.prototype.acceptDigitRun = function () {\n var char, charCode\n\n do {\n char = this.next()\n charCode = char.charCodeAt(0)\n } while (charCode > 47 && charCode < 58)\n\n if (char != lunr.QueryLexer.EOS) {\n this.backup()\n }\n}\n\nlunr.QueryLexer.prototype.more = function () {\n return this.pos < this.length\n}\n\nlunr.QueryLexer.EOS = 'EOS'\nlunr.QueryLexer.FIELD = 'FIELD'\nlunr.QueryLexer.TERM = 'TERM'\nlunr.QueryLexer.EDIT_DISTANCE = 'EDIT_DISTANCE'\nlunr.QueryLexer.BOOST = 'BOOST'\nlunr.QueryLexer.PRESENCE = 'PRESENCE'\n\nlunr.QueryLexer.lexField = function (lexer) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.FIELD)\n lexer.ignore()\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexTerm = function (lexer) {\n if (lexer.width() > 1) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.TERM)\n }\n\n lexer.ignore()\n\n if (lexer.more()) {\n return lunr.QueryLexer.lexText\n }\n}\n\nlunr.QueryLexer.lexEditDistance = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.EDIT_DISTANCE)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexBoost = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.BOOST)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexEOS = function (lexer) {\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n}\n\n// This matches the separator used when tokenising fields\n// within a document. These should match otherwise it is\n// not possible to search for some tokens within a document.\n//\n// It is possible for the user to change the separator on the\n// tokenizer so it _might_ clash with any other of the special\n// characters already used withinthe search string, e.g. :.\n//\n// This means that it is possible to change the separator in\n// such a way that makes some words unsearchable using a search\n// string.\nlunr.QueryLexer.termSeparator = lunr.tokenizer.separator\n\nlunr.QueryLexer.lexText = function (lexer) {\n while (true) {\n var char = lexer.next()\n\n if (char == lunr.QueryLexer.EOS) {\n return lunr.QueryLexer.lexEOS\n }\n\n // Escape character is '\\'\n if (char.charCodeAt(0) == 92) {\n lexer.escapeCharacter()\n continue\n }\n\n if (char == \":\") {\n return lunr.QueryLexer.lexField\n }\n\n if (char == \"~\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexEditDistance\n }\n\n if (char == \"^\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexBoost\n }\n\n // \"+\" indicates term presence is required\n // checking for length to ensure that only\n // leading \"+\" are considered\n if (char == \"+\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n // \"-\" indicates term presence is prohibited\n // checking for length to ensure that only\n // leading \"-\" are considered\n if (char == \"-\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n if (char.match(lunr.QueryLexer.termSeparator)) {\n return lunr.QueryLexer.lexTerm\n }\n }\n}\n\nlunr.QueryParser = function (str, query) {\n this.lexer = new lunr.QueryLexer (str)\n this.query = query\n this.currentClause = {}\n this.lexemeIdx = 0\n}\n\nlunr.QueryParser.prototype.parse = function () {\n this.lexer.run()\n this.lexemes = this.lexer.lexemes\n\n var state = lunr.QueryParser.parseClause\n\n while (state) {\n state = state(this)\n }\n\n return this.query\n}\n\nlunr.QueryParser.prototype.peekLexeme = function () {\n return this.lexemes[this.lexemeIdx]\n}\n\nlunr.QueryParser.prototype.consumeLexeme = function () {\n var lexeme = this.peekLexeme()\n this.lexemeIdx += 1\n return lexeme\n}\n\nlunr.QueryParser.prototype.nextClause = function () {\n var completedClause = this.currentClause\n this.query.clause(completedClause)\n this.currentClause = {}\n}\n\nlunr.QueryParser.parseClause = function (parser) {\n var lexeme = parser.peekLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.type) {\n case lunr.QueryLexer.PRESENCE:\n return lunr.QueryParser.parsePresence\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expected either a field or a term, found \" + lexeme.type\n\n if (lexeme.str.length >= 1) {\n errorMessage += \" with value '\" + lexeme.str + \"'\"\n }\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n}\n\nlunr.QueryParser.parsePresence = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.str) {\n case \"-\":\n parser.currentClause.presence = lunr.Query.presence.PROHIBITED\n break\n case \"+\":\n parser.currentClause.presence = lunr.Query.presence.REQUIRED\n break\n default:\n var errorMessage = \"unrecognised presence operator'\" + lexeme.str + \"'\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term or field, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\ndefault:\n var errorMessage = \"expecting term or field, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseField = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n if (parser.query.allFields.indexOf(lexeme.str) == -1) {\n var possibleFields = parser.query.allFields.map(function (f) { return \"'\" + f + \"'\" }).join(', '),\n errorMessage = \"unrecognised field '\" + lexeme.str + \"', possible fields: \" + possibleFields\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.fields = [lexeme.str]\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseTerm = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n parser.currentClause.term = lexeme.str.toLowerCase()\n\n if (lexeme.str.indexOf(\"*\") != -1) {\n parser.currentClause.usePipeline = false\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseEditDistance = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var editDistance = parseInt(lexeme.str, 10)\n\n if (isNaN(editDistance)) {\n var errorMessage = \"edit distance must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.editDistance = editDistance\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseBoost = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var boost = parseInt(lexeme.str, 10)\n\n if (isNaN(boost)) {\n var errorMessage = \"boost must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.boost = boost\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\nreturn\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\n /**\n * export the module via AMD, CommonJS or as a browser global\n * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n */\n ;(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define(factory)\n } else if (typeof exports === 'object') {\n /**\n * Node. Does not work with strict CommonJS, but\n * only CommonJS-like enviroments that support module.exports,\n * like Node.\n */\n module.exports = factory()\n } else {\n // Browser globals (root is window)\n root.lunr = factory()\n }\n }(this, function () {\n /**\n * Just return a value to define the module export.\n * This example returns an object, but the module\n * can return a function as the exported value.\n */\n return lunr\n }))\n})();\n"],"names":["global","step2list","step3list","v","C","re_mgr0","re_mgr1","re_meq1","re_s_v","re_1a","re2_1a","re_1b","re2_1b","re_1b_2","re2_1b_2","re3_1b_2","re4_1b_2","re_1c","re_2","re_3","re_4","re2_4","re_5","re_5_1","re3_5","porterStemmer","root","factory","lunr","config","builder","Builder","pipeline","add","trimmer","stopWordFilter","stemmer","searchPipeline","call","build","version","utils","warn","this","message","console","asString","obj","toString","clone","Object","create","keys","i","length","key","val","Array","isArray","slice","TypeError","FieldRef","docRef","fieldName","stringValue","_stringValue","joiner","fromString","s","n","indexOf","fieldRef","prototype","undefined","Set","elements","complete","intersect","other","union","contains","empty","object","a","b","intersection","element","push","concat","idf","posting","documentCount","documentsWithTerm","x","Math","log","abs","Token","str","metadata","update","fn","tokenizer","map","t","toLowerCase","len","tokens","sliceEnd","sliceStart","sliceLength","charAt","match","separator","tokenMetadata","Pipeline","_stack","registeredFunctions","registerFunction","label","warnIfFunctionNotRegistered","load","serialised","forEach","fnName","Error","fns","arguments","after","existingFn","newFn","pos","splice","before","remove","run","stackLength","memo","j","result","k","runString","token","reset","toJSON","Vector","_magnitude","positionForIndex","index","start","end","pivotPoint","floor","pivotIndex","insert","insertIdx","upsert","position","magnitude","sumOfSquares","elementsLength","sqrt","dot","otherVector","dotProduct","aLen","bLen","aVal","bVal","similarity","toArray","output","c","RegExp","w","stem","suffix","firstch","re","re2","re3","re4","substr","toUpperCase","test","replace","fp","exec","generateStopWordFilter","stopWords","words","reduce","stopWord","TokenSet","final","edges","id","_nextId","fromArray","arr","finish","fromClause","clause","fromFuzzyString","term","editDistance","stack","node","editsRemaining","frame","pop","noEditNode","char","insertionNode","substitutionNode","transposeNode","charA","charB","next","prefix","edge","_str","labels","sort","qNode","qEdges","qLen","nEdges","nLen","q","qEdge","nEdge","previousWord","uncheckedNodes","minimizedNodes","word","commonPrefix","minimize","child","nextNode","parent","downTo","childKey","Index","attrs","invertedIndex","fieldVectors","tokenSet","fields","search","queryString","query","QueryParser","parse","Query","matchingFields","queryVectors","termFieldCache","requiredMatches","prohibitedMatches","clauses","terms","clauseMatches","usePipeline","m","termTokenSet","expandedTerms","presence","REQUIRED","field","expandedTerm","termIndex","_index","fieldPosting","matchingDocumentRefs","termField","matchingDocumentsSet","PROHIBITED","boost","l","fieldMatch","matchingDocumentRef","matchingFieldRef","MatchData","allRequiredMatches","allProhibitedMatches","matchingFieldRefs","results","matches","isNegated","docMatch","fieldVector","score","matchData","combine","ref","serializedIndex","serializedVectors","serializedInvertedIndex","tokenSetBuilder","tuple","_ref","_fields","_documents","fieldTermFrequencies","fieldLengths","_b","_k1","metadataWhitelist","attributes","RangeError","number","k1","doc","extractor","fieldTerms","metadataKey","calculateAverageFieldLengths","fieldRefs","numberOfFields","accumulator","documentsWithField","averageFieldLength","createFieldVectors","fieldRefsLength","termIdfCache","fieldLength","termFrequencies","termsLength","fieldBoost","docBoost","scoreWithPrecision","tf","round","createTokenSet","use","args","unshift","apply","clonedMetadata","metadataKeys","otherMatchData","allFields","wildcard","String","NONE","LEADING","TRAILING","OPTIONAL","options","QueryParseError","name","QueryLexer","lexemes","escapeCharPositions","state","lexText","sliceString","subSlices","join","emit","type","escapeCharacter","EOS","width","ignore","backup","acceptDigitRun","charCode","charCodeAt","more","FIELD","TERM","EDIT_DISTANCE","BOOST","PRESENCE","lexField","lexer","lexTerm","lexEditDistance","lexBoost","lexEOS","termSeparator","currentClause","lexemeIdx","parseClause","peekLexeme","consumeLexeme","lexeme","nextClause","completedClause","parser","parsePresence","parseField","parseTerm","errorMessage","nextLexeme","possibleFields","f","parseEditDistance","parseBoost","parseInt","isNaN","define","amd","exports","module"],"mappings":";;;;;CAaC,eAqE4BA,OAw2BvBC,UAwBFC,UAWAC,EACAC,EAQEC,QACAC,QACAC,QACAC,OAEAC,MACAC,OACAC,MACAC,OACAC,QACAC,SACAC,SACAC,SAEAC,MACAC,KAEAC,KAEAC,KACAC,MAEAC,KACAC,OACAC,MAEAC,cAk4EQC,KAAMC,QAp1GhBC,KAAO,SAAUC,YACfC,QAAU,IAAIF,KAAKG,eAEvBD,QAAQE,SAASC,IACfL,KAAKM,QACLN,KAAKO,eACLP,KAAKQ,SAGPN,QAAQO,eAAeJ,IACrBL,KAAKQ,SAGPP,OAAOS,KAAKR,QAASA,SACdA,QAAQS,SAGjBX,KAAKY,QAAU,QAUfZ,KAAKa,MAAQ,GASbb,KAAKa,MAAMC,MAAkB1C,OAQ1B2C,KANM,SAAUC,SACX5C,OAAO6C,SAAWA,QAAQH,MAC5BG,QAAQH,KAAKE,WAiBnBhB,KAAKa,MAAMK,SAAW,SAAUC,YAC1BA,MAAAA,IACK,GAEAA,IAAIC,YAoBfpB,KAAKa,MAAMQ,MAAQ,SAAUF,QACvBA,MAAAA,WACKA,YAGLE,MAAQC,OAAOC,OAAO,MACtBC,KAAOF,OAAOE,KAAKL,KAEdM,EAAI,EAAGA,EAAID,KAAKE,OAAQD,IAAK,KAChCE,IAAMH,KAAKC,GACXG,IAAMT,IAAIQ,QAEVE,MAAMC,QAAQF,KAChBP,MAAMM,KAAOC,IAAIG,gBAIA,iBAARH,KACQ,iBAARA,KACQ,kBAARA,UAKL,IAAII,UAAU,yDAJlBX,MAAMM,KAAOC,YAOVP,OAETrB,KAAKiC,SAAW,SAAUC,OAAQC,UAAWC,kBACtCF,OAASA,YACTC,UAAYA,eACZE,aAAeD,aAGtBpC,KAAKiC,SAASK,OAAS,IAEvBtC,KAAKiC,SAASM,WAAa,SAAUC,OAC/BC,EAAID,EAAEE,QAAQ1C,KAAKiC,SAASK,YAErB,IAAPG,OACI,iCAGJE,SAAWH,EAAET,MAAM,EAAGU,GACtBP,OAASM,EAAET,MAAMU,EAAI,UAElB,IAAIzC,KAAKiC,SAAUC,OAAQS,SAAUH,IAG9CxC,KAAKiC,SAASW,UAAUxB,SAAW,kBACRyB,MAArB9B,KAAKsB,oBACFA,aAAetB,KAAKoB,UAAYnC,KAAKiC,SAASK,OAASvB,KAAKmB,QAG5DnB,KAAKsB,cAYdrC,KAAK8C,IAAM,SAAUC,kBACdA,SAAWzB,OAAOC,OAAO,MAE1BwB,SAAU,MACPrB,OAASqB,SAASrB,WAElB,IAAID,EAAI,EAAGA,EAAIV,KAAKW,OAAQD,SAC1BsB,SAASA,SAAStB,KAAM,YAG1BC,OAAS,GAWlB1B,KAAK8C,IAAIE,SAAW,CAClBC,UAAW,SAAUC,cACZA,OAGTC,MAAO,kBACEpC,MAGTqC,SAAU,kBACD,IAWXpD,KAAK8C,IAAIO,MAAQ,CACfJ,UAAW,kBACFlC,MAGToC,MAAO,SAAUD,cACRA,OAGTE,SAAU,kBACD,IAUXpD,KAAK8C,IAAIF,UAAUQ,SAAW,SAAUE,gBAC7BvC,KAAKgC,SAASO,SAWzBtD,KAAK8C,IAAIF,UAAUK,UAAY,SAAUC,WACnCK,EAAGC,EAAGT,SAAUU,aAAe,MAE/BP,QAAUlD,KAAK8C,IAAIE,gBACdjC,QAGLmC,QAAUlD,KAAK8C,IAAIO,aACdH,MAGLnC,KAAKW,OAASwB,MAAMxB,QACtB6B,EAAIxC,KACJyC,EAAIN,QAEJK,EAAIL,MACJM,EAAIzC,MAGNgC,SAAWzB,OAAOE,KAAK+B,EAAER,cAEpB,IAAItB,EAAI,EAAGA,EAAIsB,SAASrB,OAAQD,IAAK,KACpCiC,QAAUX,SAAStB,GACnBiC,WAAWF,EAAET,UACfU,aAAaE,KAAKD,gBAIf,IAAI1D,KAAK8C,IAAKW,eAUvBzD,KAAK8C,IAAIF,UAAUO,MAAQ,SAAUD,cAC/BA,QAAUlD,KAAK8C,IAAIE,SACdhD,KAAK8C,IAAIE,SAGdE,QAAUlD,KAAK8C,IAAIO,MACdtC,KAGF,IAAIf,KAAK8C,IAAIxB,OAAOE,KAAKT,KAAKgC,UAAUa,OAAOtC,OAAOE,KAAK0B,MAAMH,aAU1E/C,KAAK6D,IAAM,SAAUC,QAASC,mBACxBC,kBAAoB,MAEnB,IAAI7B,aAAa2B,QACH,UAAb3B,YACJ6B,mBAAqB1C,OAAOE,KAAKsC,QAAQ3B,YAAYT,YAGnDuC,GAAKF,cAAgBC,kBAAoB,KAAQA,kBAAoB,WAElEE,KAAKC,IAAI,EAAID,KAAKE,IAAIH,KAW/BjE,KAAKqE,MAAQ,SAAUC,IAAKC,eACrBD,IAAMA,KAAO,QACbC,SAAWA,UAAY,IAQ9BvE,KAAKqE,MAAMzB,UAAUxB,SAAW,kBACvBL,KAAKuD,KAuBdtE,KAAKqE,MAAMzB,UAAU4B,OAAS,SAAUC,gBACjCH,IAAMG,GAAG1D,KAAKuD,IAAKvD,KAAKwD,UACtBxD,MAUTf,KAAKqE,MAAMzB,UAAUvB,MAAQ,SAAUoD,WACrCA,GAAKA,IAAM,SAAUjC,UAAYA,GAC1B,IAAIxC,KAAKqE,MAAOI,GAAG1D,KAAKuD,IAAKvD,KAAKwD,UAAWxD,KAAKwD,WAyB3DvE,KAAK0E,UAAY,SAAUvD,IAAKoD,aACnB,MAAPpD,KAAsB0B,MAAP1B,UACV,MAGLU,MAAMC,QAAQX,YACTA,IAAIwD,KAAI,SAAUC,UAChB,IAAI5E,KAAKqE,MACdrE,KAAKa,MAAMK,SAAS0D,GAAGC,cACvB7E,KAAKa,MAAMQ,MAAMkD,sBAKnBD,IAAMnD,IAAIC,WAAWyD,cACrBC,IAAMR,IAAI5C,OACVqD,OAAS,GAEJC,SAAW,EAAGC,WAAa,EAAGD,UAAYF,IAAKE,WAAY,KAE9DE,YAAcF,SAAWC,cADlBX,IAAIa,OAAOH,UAGZI,MAAMpF,KAAK0E,UAAUW,YAAcL,UAAYF,IAAM,IAEzDI,YAAc,EAAG,KACfI,cAAgBtF,KAAKa,MAAMQ,MAAMkD,WAAa,GAClDe,cAAa,SAAe,CAACL,WAAYC,aACzCI,cAAa,MAAYP,OAAOrD,OAEhCqD,OAAOpB,KACL,IAAI3D,KAAKqE,MACPC,IAAIvC,MAAMkD,WAAYD,UACtBM,gBAKNL,WAAaD,SAAW,UAKrBD,QAUT/E,KAAK0E,UAAUW,UAAY,UAmC3BrF,KAAKuF,SAAW,gBACTC,OAAS,IAGhBxF,KAAKuF,SAASE,oBAAsBnE,OAAOC,OAAO,MAmClDvB,KAAKuF,SAASG,iBAAmB,SAAUjB,GAAIkB,OACzCA,SAAS5E,KAAK0E,qBAChBzF,KAAKa,MAAMC,KAAK,6CAA+C6E,OAGjElB,GAAGkB,MAAQA,MACX3F,KAAKuF,SAASE,oBAAoBhB,GAAGkB,OAASlB,IAShDzE,KAAKuF,SAASK,4BAA8B,SAAUnB,IACjCA,GAAGkB,OAAUlB,GAAGkB,SAAS5E,KAAK0E,qBAG/CzF,KAAKa,MAAMC,KAAK,kGAAmG2D,KAcvHzE,KAAKuF,SAASM,KAAO,SAAUC,gBACzB1F,SAAW,IAAIJ,KAAKuF,gBAExBO,WAAWC,SAAQ,SAAUC,YACvBvB,GAAKzE,KAAKuF,SAASE,oBAAoBO,YAEvCvB,SAGI,IAAIwB,MAAM,sCAAwCD,QAFxD5F,SAASC,IAAIoE,OAMVrE,UAUTJ,KAAKuF,SAAS3C,UAAUvC,IAAM,eACxB6F,IAAMrE,MAAMe,UAAUb,MAAMrB,KAAKyF,WAErCD,IAAIH,SAAQ,SAAUtB,IACpBzE,KAAKuF,SAASK,4BAA4BnB,SACrCe,OAAO7B,KAAKc,MAChB1D,OAYLf,KAAKuF,SAAS3C,UAAUwD,MAAQ,SAAUC,WAAYC,OACpDtG,KAAKuF,SAASK,4BAA4BU,WAEtCC,IAAMxF,KAAKyE,OAAO9C,QAAQ2D,gBAClB,GAARE,UACI,IAAIN,MAAM,0BAGlBM,KAAY,OACPf,OAAOgB,OAAOD,IAAK,EAAGD,QAY7BtG,KAAKuF,SAAS3C,UAAU6D,OAAS,SAAUJ,WAAYC,OACrDtG,KAAKuF,SAASK,4BAA4BU,WAEtCC,IAAMxF,KAAKyE,OAAO9C,QAAQ2D,gBAClB,GAARE,UACI,IAAIN,MAAM,+BAGbT,OAAOgB,OAAOD,IAAK,EAAGD,QAQ7BtG,KAAKuF,SAAS3C,UAAU8D,OAAS,SAAUjC,QACrC8B,IAAMxF,KAAKyE,OAAO9C,QAAQ+B,KAClB,GAAR8B,UAICf,OAAOgB,OAAOD,IAAK,IAU1BvG,KAAKuF,SAAS3C,UAAU+D,IAAM,SAAU5B,gBAClC6B,YAAc7F,KAAKyE,OAAO9D,OAErBD,EAAI,EAAGA,EAAImF,YAAanF,IAAK,SAChCgD,GAAK1D,KAAKyE,OAAO/D,GACjBoF,KAAO,GAEFC,EAAI,EAAGA,EAAI/B,OAAOrD,OAAQoF,IAAK,KAClCC,OAAStC,GAAGM,OAAO+B,GAAIA,EAAG/B,WAE1BgC,MAAAA,QAAmD,KAAXA,UAExClF,MAAMC,QAAQiF,YACX,IAAIC,EAAI,EAAGA,EAAID,OAAOrF,OAAQsF,IACjCH,KAAKlD,KAAKoD,OAAOC,SAGnBH,KAAKlD,KAAKoD,QAIdhC,OAAS8B,YAGJ9B,QAaT/E,KAAKuF,SAAS3C,UAAUqE,UAAY,SAAU3C,IAAKC,cAC7C2C,MAAQ,IAAIlH,KAAKqE,MAAOC,IAAKC,iBAE1BxD,KAAK4F,IAAI,CAACO,QAAQvC,KAAI,SAAUC,UAC9BA,EAAExD,eAQbpB,KAAKuF,SAAS3C,UAAUuE,MAAQ,gBACzB3B,OAAS,IAUhBxF,KAAKuF,SAAS3C,UAAUwE,OAAS,kBACxBrG,KAAKyE,OAAOb,KAAI,SAAUF,WAC/BzE,KAAKuF,SAASK,4BAA4BnB,IAEnCA,GAAGkB,UAwBd3F,KAAKqH,OAAS,SAAUtE,eACjBuE,WAAa,OACbvE,SAAWA,UAAY,IAc9B/C,KAAKqH,OAAOzE,UAAU2E,iBAAmB,SAAUC,UAErB,GAAxBzG,KAAKgC,SAASrB,cACT,UAGL+F,MAAQ,EACRC,IAAM3G,KAAKgC,SAASrB,OAAS,EAC7BwD,YAAcwC,IAAMD,MACpBE,WAAazD,KAAK0D,MAAM1C,YAAc,GACtC2C,WAAa9G,KAAKgC,SAAsB,EAAb4E,YAExBzC,YAAc,IACf2C,WAAaL,QACfC,MAAQE,YAGNE,WAAaL,QACfE,IAAMC,YAGJE,YAAcL,QAIlBtC,YAAcwC,IAAMD,MACpBE,WAAaF,MAAQvD,KAAK0D,MAAM1C,YAAc,GAC9C2C,WAAa9G,KAAKgC,SAAsB,EAAb4E,mBAGzBE,YAAcL,OAIdK,WAAaL,MAHK,EAAbG,WAOLE,WAAaL,MACW,GAAlBG,WAAa,WAazB3H,KAAKqH,OAAOzE,UAAUkF,OAAS,SAAUC,UAAWnG,UAC7CoG,OAAOD,UAAWnG,KAAK,gBACpB,sBAYV5B,KAAKqH,OAAOzE,UAAUoF,OAAS,SAAUD,UAAWnG,IAAK6C,SAClD6C,WAAa,MACdW,SAAWlH,KAAKwG,iBAAiBQ,WAEjChH,KAAKgC,SAASkF,WAAaF,eACxBhF,SAASkF,SAAW,GAAKxD,GAAG1D,KAAKgC,SAASkF,SAAW,GAAIrG,UAEzDmB,SAASyD,OAAOyB,SAAU,EAAGF,UAAWnG,MASjD5B,KAAKqH,OAAOzE,UAAUsF,UAAY,cAC5BnH,KAAKuG,WAAY,OAAOvG,KAAKuG,mBAE7Ba,aAAe,EACfC,eAAiBrH,KAAKgC,SAASrB,OAE1BD,EAAI,EAAGA,EAAI2G,eAAgB3G,GAAK,EAAG,KACtCG,IAAMb,KAAKgC,SAAStB,GACxB0G,cAAgBvG,IAAMA,WAGjBb,KAAKuG,WAAapD,KAAKmE,KAAKF,eASrCnI,KAAKqH,OAAOzE,UAAU0F,IAAM,SAAUC,qBAChCC,WAAa,EACbjF,EAAIxC,KAAKgC,SAAUS,EAAI+E,YAAYxF,SACnC0F,KAAOlF,EAAE7B,OAAQgH,KAAOlF,EAAE9B,OAC1BiH,KAAO,EAAGC,KAAO,EACjBnH,EAAI,EAAGqF,EAAI,EAERrF,EAAIgH,MAAQ3B,EAAI4B,OACrBC,KAAOpF,EAAE9B,KAAImH,KAAOpF,EAAEsD,IAEpBrF,GAAK,EACIkH,KAAOC,KAChB9B,GAAK,EACI6B,MAAQC,OACjBJ,YAAcjF,EAAE9B,EAAI,GAAK+B,EAAEsD,EAAI,GAC/BrF,GAAK,EACLqF,GAAK,UAIF0B,YAUTxI,KAAKqH,OAAOzE,UAAUiG,WAAa,SAAUN,oBACpCxH,KAAKuH,IAAIC,aAAexH,KAAKmH,aAAe,GAQrDlI,KAAKqH,OAAOzE,UAAUkG,QAAU,mBAC1BC,OAAS,IAAIlH,MAAOd,KAAKgC,SAASrB,OAAS,GAEtCD,EAAI,EAAGqF,EAAI,EAAGrF,EAAIV,KAAKgC,SAASrB,OAAQD,GAAK,EAAGqF,IACvDiC,OAAOjC,GAAK/F,KAAKgC,SAAStB,UAGrBsH,QAQT/I,KAAKqH,OAAOzE,UAAUwE,OAAS,kBACtBrG,KAAKgC,UAoBd/C,KAAKQ,SACCnC,UAAY,SACA,aACD,YACF,YACA,YACA,UACD,WACC,WACC,UACF,UACE,cACE,YACF,WACD,YACC,aACE,cACA,cACA,YACF,WACA,aACC,WACF,OAGXC,UAAY,OACA,WACA,SACA,WACA,UACD,SACD,QACC,IAIXC,EAAI,WACJC,EAAIwK,qBAQFvK,QAAU,IAAIwK,OALT,4DAMLvK,QAAU,IAAIuK,OAJT,8FAKLtK,QAAU,IAAIsK,OANT,gFAOLrK,OAAS,IAAIqK,OALT,kCAOJpK,MAAQ,kBACRC,OAAS,iBACTC,MAAQ,aACRC,OAAS,kBACTC,QAAU,KACVC,SAAW,cACXC,SAAW,IAAI8J,OAAO,sBACtB7J,SAAW,IAAI6J,OAAO,IAAMzK,EAAID,EAAI,gBAEpCc,MAAQ,mBACRC,KAAO,2IAEPC,KAAO,iDAEPC,KAAO,sFACPC,MAAQ,oBAERC,KAAO,WACPC,OAAS,MACTC,MAAQ,IAAIqJ,OAAO,IAAMzK,EAAID,EAAI,gBAEjCsB,cAAgB,SAAuBqJ,OACrCC,KACFC,OACAC,QACAC,GACAC,IACAC,IACAC,OAEEP,EAAExH,OAAS,SAAYwH,KAGZ,MADfG,QAAUH,EAAEQ,OAAO,EAAE,MAEnBR,EAAIG,QAAQM,cAAgBT,EAAEQ,OAAO,IAKvCH,IAAMzK,QADNwK,GAAKzK,OAGE+K,KAAKV,GAAMA,EAAIA,EAAEW,QAAQP,GAAG,QAC1BC,IAAIK,KAAKV,KAAMA,EAAIA,EAAEW,QAAQN,IAAI,SAI1CA,IAAMvK,QADNsK,GAAKvK,OAEE6K,KAAKV,GAAI,KACVY,GAAKR,GAAGS,KAAKb,IACjBI,GAAK7K,SACEmL,KAAKE,GAAG,MACbR,GAAKrK,QACLiK,EAAIA,EAAEW,QAAQP,GAAG,UAEVC,IAAIK,KAAKV,KAElBC,MADIW,GAAKP,IAAIQ,KAAKb,IACR,IACVK,IAAM3K,QACEgL,KAAKT,QAGXK,IAAMrK,SACNsK,IAAMrK,UAFNmK,IAAMrK,UAGE0K,KAJRV,EAAIC,MAIeD,GAAQ,IAClBM,IAAII,KAAKV,IAAMI,GAAKrK,QAASiK,EAAIA,EAAEW,QAAQP,GAAG,KAC9CG,IAAIG,KAAKV,KAAMA,GAAQ,cAKpCI,GAAKjK,OACEuK,KAAKV,KAGVA,GADAC,MADIW,GAAKR,GAAGS,KAAKb,IACP,IACC,MAIbI,GAAKhK,MACEsK,KAAKV,KAEVC,MADIW,GAAKR,GAAGS,KAAKb,IACP,GACVE,OAASU,GAAG,IACZR,GAAK7K,SACEmL,KAAKT,QACVD,EAAIC,KAAO9K,UAAU+K,WAKzBE,GAAK/J,MACEqK,KAAKV,KAEVC,MADIW,GAAKR,GAAGS,KAAKb,IACP,GACVE,OAASU,GAAG,IACZR,GAAK7K,SACEmL,KAAKT,QACVD,EAAIC,KAAO7K,UAAU8K,UAMzBG,IAAM9J,OADN6J,GAAK9J,MAEEoK,KAAKV,IAEVC,MADIW,GAAKR,GAAGS,KAAKb,IACP,IACVI,GAAK5K,SACEkL,KAAKT,QACVD,EAAIC,OAEGI,IAAIK,KAAKV,KAElBC,MADIW,GAAKP,IAAIQ,KAAKb,IACR,GAAKY,GAAG,IAClBP,IAAM7K,SACEkL,KAAKT,QACXD,EAAIC,QAKRG,GAAK5J,MACEkK,KAAKV,KAEVC,MADIW,GAAKR,GAAGS,KAAKb,IACP,GAEVK,IAAM5K,QACN6K,IAAM5J,QAFN0J,GAAK5K,SAGEkL,KAAKT,OAAUI,IAAIK,KAAKT,QAAWK,IAAII,KAAKT,SACjDD,EAAIC,OAKRI,IAAM7K,SADN4K,GAAK3J,QAEEiK,KAAKV,IAAMK,IAAIK,KAAKV,KACzBI,GAAKrK,QACLiK,EAAIA,EAAEW,QAAQP,GAAG,KAKJ,KAAXD,UACFH,EAAIG,QAAQxE,cAAgBqE,EAAEQ,OAAO,IAGhCR,GAGF,SAAUhC,cACRA,MAAM1C,OAAO3E,iBAIxBG,KAAKuF,SAASG,iBAAiB1F,KAAKQ,QAAS,WAmB7CR,KAAKgK,uBAAyB,SAAUC,eAClCC,MAAQD,UAAUE,QAAO,SAAUtD,KAAMuD,iBAC3CvD,KAAKuD,UAAYA,SACVvD,OACN,WAEI,SAAUK,UACXA,OAASgD,MAAMhD,MAAM9F,cAAgB8F,MAAM9F,WAAY,OAAO8F,QAiBtElH,KAAKO,eAAiBP,KAAKgK,uBAAuB,CAChD,IACA,OACA,QACA,SACA,QACA,MACA,SACA,OACA,KACA,QACA,KACA,MACA,MACA,MACA,KACA,KACA,KACA,UACA,OACA,MACA,KACA,MACA,SACA,QACA,OACA,MACA,KACA,OACA,SACA,OACA,OACA,QACA,MACA,OACA,MACA,MACA,MACA,MACA,OACA,KACA,MACA,OACA,MACA,MACA,MACA,UACA,IACA,KACA,KACA,OACA,KACA,KACA,MACA,OACA,QACA,MACA,OACA,SACA,MACA,KACA,QACA,OACA,OACA,KACA,UACA,KACA,MACA,MACA,KACA,MACA,QACA,KACA,OACA,KACA,QACA,MACA,MACA,SACA,OACA,MACA,OACA,MACA,SACA,QACA,KACA,OACA,OACA,OACA,MACA,QACA,OACA,OACA,QACA,QACA,OACA,OACA,MACA,KACA,MACA,OACA,KACA,QACA,MACA,KACA,OACA,OACA,OACA,QACA,QACA,QACA,MACA,OACA,MACA,OACA,OACA,QACA,MACA,MACA,SAGFhK,KAAKuF,SAASG,iBAAiB1F,KAAKO,eAAgB,kBAqBpDP,KAAKM,QAAU,SAAU4G,cAChBA,MAAM1C,QAAO,SAAUhC,UACrBA,EAAEqH,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,QAIjD7J,KAAKuF,SAASG,iBAAiB1F,KAAKM,QAAS,WA2B7CN,KAAKqK,SAAW,gBACTC,OAAQ,OACRC,MAAQ,QACRC,GAAKxK,KAAKqK,SAASI,QACxBzK,KAAKqK,SAASI,SAAW,GAW3BzK,KAAKqK,SAASI,QAAU,EASxBzK,KAAKqK,SAASK,UAAY,SAAUC,aAC9BzK,QAAU,IAAIF,KAAKqK,SAASlK,QAEvBsB,EAAI,EAAGqD,IAAM6F,IAAIjJ,OAAQD,EAAIqD,IAAKrD,IACzCvB,QAAQ4H,OAAO6C,IAAIlJ,WAGrBvB,QAAQ0K,SACD1K,QAAQJ,MAYjBE,KAAKqK,SAASQ,WAAa,SAAUC,cAC/B,iBAAkBA,OACb9K,KAAKqK,SAASU,gBAAgBD,OAAOE,KAAMF,OAAOG,cAElDjL,KAAKqK,SAAS9H,WAAWuI,OAAOE,OAmB3ChL,KAAKqK,SAASU,gBAAkB,SAAUzG,IAAK2G,sBACzCnL,KAAO,IAAIE,KAAKqK,SAEhBa,MAAQ,CAAC,CACXC,KAAMrL,KACNsL,eAAgBH,aAChB3G,IAAKA,MAGA4G,MAAMxJ,QAAQ,KACf2J,MAAQH,MAAMI,SAGdD,MAAM/G,IAAI5C,OAAS,EAAG,KAEpB6J,WADAC,KAAOH,MAAM/G,IAAIa,OAAO,GAGxBqG,QAAQH,MAAMF,KAAKZ,MACrBgB,WAAaF,MAAMF,KAAKZ,MAAMiB,OAE9BD,WAAa,IAAIvL,KAAKqK,SACtBgB,MAAMF,KAAKZ,MAAMiB,MAAQD,YAGH,GAApBF,MAAM/G,IAAI5C,SACZ6J,WAAWjB,OAAQ,GAGrBY,MAAMvH,KAAK,CACTwH,KAAMI,WACNH,eAAgBC,MAAMD,eACtB9G,IAAK+G,MAAM/G,IAAIvC,MAAM,QAIG,GAAxBsJ,MAAMD,mBAKN,MAAOC,MAAMF,KAAKZ,UAChBkB,cAAgBJ,MAAMF,KAAKZ,MAAM,SAChC,CACDkB,cAAgB,IAAIzL,KAAKqK,SAC7BgB,MAAMF,KAAKZ,MAAM,KAAOkB,iBAGF,GAApBJ,MAAM/G,IAAI5C,SACZ+J,cAAcnB,OAAQ,GAGxBY,MAAMvH,KAAK,CACTwH,KAAMM,cACNL,eAAgBC,MAAMD,eAAiB,EACvC9G,IAAK+G,MAAM/G,MAMT+G,MAAM/G,IAAI5C,OAAS,GACrBwJ,MAAMvH,KAAK,CACTwH,KAAME,MAAMF,KACZC,eAAgBC,MAAMD,eAAiB,EACvC9G,IAAK+G,MAAM/G,IAAIvC,MAAM,KAMD,GAApBsJ,MAAM/G,IAAI5C,SACZ2J,MAAMF,KAAKb,OAAQ,GAMjBe,MAAM/G,IAAI5C,QAAU,EAAG,IACrB,MAAO2J,MAAMF,KAAKZ,UAChBmB,iBAAmBL,MAAMF,KAAKZ,MAAM,SACnC,CACDmB,iBAAmB,IAAI1L,KAAKqK,SAChCgB,MAAMF,KAAKZ,MAAM,KAAOmB,iBAGF,GAApBL,MAAM/G,IAAI5C,SACZgK,iBAAiBpB,OAAQ,GAG3BY,MAAMvH,KAAK,CACTwH,KAAMO,iBACNN,eAAgBC,MAAMD,eAAiB,EACvC9G,IAAK+G,MAAM/G,IAAIvC,MAAM,QAOrBsJ,MAAM/G,IAAI5C,OAAS,EAAG,KAGpBiK,cAFAC,MAAQP,MAAM/G,IAAIa,OAAO,GACzB0G,MAAQR,MAAM/G,IAAIa,OAAO,GAGzB0G,SAASR,MAAMF,KAAKZ,MACtBoB,cAAgBN,MAAMF,KAAKZ,MAAMsB,QAEjCF,cAAgB,IAAI3L,KAAKqK,SACzBgB,MAAMF,KAAKZ,MAAMsB,OAASF,eAGJ,GAApBN,MAAM/G,IAAI5C,SACZiK,cAAcrB,OAAQ,GAGxBY,MAAMvH,KAAK,CACTwH,KAAMQ,cACNP,eAAgBC,MAAMD,eAAiB,EACvC9G,IAAKsH,MAAQP,MAAM/G,IAAIvC,MAAM,cAK5BjC,MAaTE,KAAKqK,SAAS9H,WAAa,SAAU+B,aAC/B6G,KAAO,IAAInL,KAAKqK,SAChBvK,KAAOqL,KAUF1J,EAAI,EAAGqD,IAAMR,IAAI5C,OAAQD,EAAIqD,IAAKrD,IAAK,KAC1C+J,KAAOlH,IAAI7C,GACX6I,MAAS7I,GAAKqD,IAAM,KAEZ,KAAR0G,KACFL,KAAKZ,MAAMiB,MAAQL,KACnBA,KAAKb,MAAQA,UAER,KACDwB,KAAO,IAAI9L,KAAKqK,SACpByB,KAAKxB,MAAQA,MAEba,KAAKZ,MAAMiB,MAAQM,KACnBX,KAAOW,aAIJhM,MAaTE,KAAKqK,SAASzH,UAAUkG,QAAU,mBAC5BoB,MAAQ,GAERgB,MAAQ,CAAC,CACXa,OAAQ,GACRZ,KAAMpK,OAGDmK,MAAMxJ,QAAQ,KACf2J,MAAQH,MAAMI,MACdf,MAAQjJ,OAAOE,KAAK6J,MAAMF,KAAKZ,OAC/BzF,IAAMyF,MAAM7I,OAEZ2J,MAAMF,KAAKb,QAKbe,MAAMU,OAAO5G,OAAO,GACpB+E,MAAMvG,KAAK0H,MAAMU,aAGd,IAAItK,EAAI,EAAGA,EAAIqD,IAAKrD,IAAK,KACxBuK,KAAOzB,MAAM9I,GAEjByJ,MAAMvH,KAAK,CACToI,OAAQV,MAAMU,OAAOnI,OAAOoI,MAC5Bb,KAAME,MAAMF,KAAKZ,MAAMyB,gBAKtB9B,OAaTlK,KAAKqK,SAASzH,UAAUxB,SAAW,cAS7BL,KAAKkL,YACAlL,KAAKkL,aAGV3H,IAAMvD,KAAKuJ,MAAQ,IAAM,IACzB4B,OAAS5K,OAAOE,KAAKT,KAAKwJ,OAAO4B,OACjCrH,IAAMoH,OAAOxK,OAERD,EAAI,EAAGA,EAAIqD,IAAKrD,IAAK,KACxBkE,MAAQuG,OAAOzK,GAGnB6C,IAAMA,IAAMqB,MAFD5E,KAAKwJ,MAAM5E,OAEG6E,UAGpBlG,KAaTtE,KAAKqK,SAASzH,UAAUK,UAAY,SAAUO,WACxCuF,OAAS,IAAI/I,KAAKqK,SAClBgB,WAAQxI,EAERqI,MAAQ,CAAC,CACXkB,MAAO5I,EACPuF,OAAQA,OACRoC,KAAMpK,OAGDmK,MAAMxJ,QAAQ,CACnB2J,MAAQH,MAAMI,cAMVe,OAAS/K,OAAOE,KAAK6J,MAAMe,MAAM7B,OACjC+B,KAAOD,OAAO3K,OACd6K,OAASjL,OAAOE,KAAK6J,MAAMF,KAAKZ,OAChCiC,KAAOD,OAAO7K,OAET+K,EAAI,EAAGA,EAAIH,KAAMG,YACpBC,MAAQL,OAAOI,GAEVhK,EAAI,EAAGA,EAAI+J,KAAM/J,IAAK,KACzBkK,MAAQJ,OAAO9J,MAEfkK,OAASD,OAAkB,KAATA,MAAc,KAC9BvB,KAAOE,MAAMF,KAAKZ,MAAMoC,OACxBP,MAAQf,MAAMe,MAAM7B,MAAMmC,OAC1BpC,MAAQa,KAAKb,OAAS8B,MAAM9B,MAC5BwB,UAAOjJ,EAEP8J,SAAStB,MAAMtC,OAAOwB,OAIxBuB,KAAOT,MAAMtC,OAAOwB,MAAMoC,QACrBrC,MAAQwB,KAAKxB,OAASA,QAM3BwB,KAAO,IAAI9L,KAAKqK,UACXC,MAAQA,MACbe,MAAMtC,OAAOwB,MAAMoC,OAASb,MAG9BZ,MAAMvH,KAAK,CACTyI,MAAOA,MACPrD,OAAQ+C,KACRX,KAAMA,gBAOTpC,QAET/I,KAAKqK,SAASlK,QAAU,gBACjByM,aAAe,QACf9M,KAAO,IAAIE,KAAKqK,cAChBwC,eAAiB,QACjBC,eAAiB,IAGxB9M,KAAKqK,SAASlK,QAAQyC,UAAUkF,OAAS,SAAUiF,UAC7C5B,KACA6B,aAAe,KAEfD,KAAOhM,KAAK6L,mBACR,IAAI3G,MAAO,mCAGd,IAAIxE,EAAI,EAAGA,EAAIsL,KAAKrL,QAAUD,EAAIV,KAAK6L,aAAalL,QACnDqL,KAAKtL,IAAMV,KAAK6L,aAAanL,GAD8BA,IAE/DuL,oBAGGC,SAASD,cAGZ7B,KADgC,GAA9BpK,KAAK8L,eAAenL,OACfX,KAAKjB,KAELiB,KAAK8L,eAAe9L,KAAK8L,eAAenL,OAAS,GAAGwL,UAGpDzL,EAAIuL,aAAcvL,EAAIsL,KAAKrL,OAAQD,IAAK,KAC3C0L,SAAW,IAAInN,KAAKqK,SACpBmB,KAAOuB,KAAKtL,GAEhB0J,KAAKZ,MAAMiB,MAAQ2B,cAEdN,eAAelJ,KAAK,CACvByJ,OAAQjC,KACRK,KAAMA,KACN0B,MAAOC,WAGThC,KAAOgC,SAGThC,KAAKb,OAAQ,OACRsC,aAAeG,MAGtB/M,KAAKqK,SAASlK,QAAQyC,UAAUgI,OAAS,gBAClCqC,SAAS,IAGhBjN,KAAKqK,SAASlK,QAAQyC,UAAUqK,SAAW,SAAUI,YAC9C,IAAI5L,EAAIV,KAAK8L,eAAenL,OAAS,EAAGD,GAAK4L,OAAQ5L,IAAK,KACzD0J,KAAOpK,KAAK8L,eAAepL,GAC3B6L,SAAWnC,KAAK+B,MAAM9L,WAEtBkM,YAAYvM,KAAK+L,eACnB3B,KAAKiC,OAAO7C,MAAMY,KAAKK,MAAQzK,KAAK+L,eAAeQ,WAInDnC,KAAK+B,MAAMjB,KAAOqB,cAEbR,eAAeQ,UAAYnC,KAAK+B,YAGlCL,eAAevB,QAwBxBtL,KAAKuN,MAAQ,SAAUC,YAChBC,cAAgBD,MAAMC,mBACtBC,aAAeF,MAAME,kBACrBC,SAAWH,MAAMG,cACjBC,OAASJ,MAAMI,YACfxN,SAAWoN,MAAMpN,UA0ExBJ,KAAKuN,MAAM3K,UAAUiL,OAAS,SAAUC,oBAC/B/M,KAAKgN,OAAM,SAAUA,OACb,IAAI/N,KAAKgO,YAAYF,YAAaC,OACxCE,YA6BXjO,KAAKuN,MAAM3K,UAAUmL,MAAQ,SAAUtJ,YAQjCsJ,MAAQ,IAAI/N,KAAKkO,MAAMnN,KAAK6M,QAC5BO,eAAiB7M,OAAOC,OAAO,MAC/B6M,aAAe9M,OAAOC,OAAO,MAC7B8M,eAAiB/M,OAAOC,OAAO,MAC/B+M,gBAAkBhN,OAAOC,OAAO,MAChCgN,kBAAoBjN,OAAOC,OAAO,MAO7BE,EAAI,EAAGA,EAAIV,KAAK6M,OAAOlM,OAAQD,IACtC2M,aAAarN,KAAK6M,OAAOnM,IAAM,IAAIzB,KAAKqH,OAG1C5C,GAAG/D,KAAKqN,MAAOA,WAENtM,EAAI,EAAGA,EAAIsM,MAAMS,QAAQ9M,OAAQD,IAAK,KASzCqJ,OAASiD,MAAMS,QAAQ/M,GACvBgN,MAAQ,KACRC,cAAgB1O,KAAK8C,IAAIO,MAG3BoL,MADE3D,OAAO6D,YACD5N,KAAKX,SAAS6G,UAAU6D,OAAOE,KAAM,CAC3C4C,OAAQ9C,OAAO8C,SAGT,CAAC9C,OAAOE,UAGb,IAAI4D,EAAI,EAAGA,EAAIH,MAAM/M,OAAQkN,IAAK,KACjC5D,KAAOyD,MAAMG,GAQjB9D,OAAOE,KAAOA,SAOV6D,aAAe7O,KAAKqK,SAASQ,WAAWC,QACxCgE,cAAgB/N,KAAK4M,SAAS1K,UAAU4L,cAAc/F,aAQ7B,IAAzBgG,cAAcpN,QAAgBoJ,OAAOiE,WAAa/O,KAAKkO,MAAMa,SAASC,SAAU,KAC7E,IAAIhI,EAAI,EAAGA,EAAI8D,OAAO8C,OAAOlM,OAAQsF,IAAK,CAE7CsH,gBADIW,MAAQnE,OAAO8C,OAAO5G,IACDhH,KAAK8C,IAAIO,gBAMjC,IAAIyD,EAAI,EAAGA,EAAIgI,cAAcpN,OAAQoF,SAKpCoI,aAAeJ,cAAchI,GAC7BhD,QAAU/C,KAAK0M,cAAcyB,cAC7BC,UAAYrL,QAAQsL,WAEfpI,EAAI,EAAGA,EAAI8D,OAAO8C,OAAOlM,OAAQsF,IAAK,KAUzCqI,aAAevL,QADfmL,MAAQnE,OAAO8C,OAAO5G,IAEtBsI,qBAAuBhO,OAAOE,KAAK6N,cACnCE,UAAYL,aAAe,IAAMD,MACjCO,qBAAuB,IAAIxP,KAAK8C,IAAIwM,yBAOpCxE,OAAOiE,UAAY/O,KAAKkO,MAAMa,SAASC,WACzCN,cAAgBA,cAAcvL,MAAMqM,2BAEL3M,IAA3ByL,gBAAgBW,SAClBX,gBAAgBW,OAASjP,KAAK8C,IAAIE,WASlC8H,OAAOiE,UAAY/O,KAAKkO,MAAMa,SAASU,eAsB3CrB,aAAaa,OAAOjH,OAAOmH,UAAWrE,OAAO4E,OAAO,SAAUnM,EAAGC,UAAYD,EAAIC,MAM7E6K,eAAekB,gBAId,IAAII,EAAI,EAAGA,EAAIL,qBAAqB5N,OAAQiO,IAAK,KAUhDC,WAHAC,oBAAsBP,qBAAqBK,GAC3CG,iBAAmB,IAAI9P,KAAKiC,SAAU4N,oBAAqBZ,OAC3D1K,SAAW8K,aAAaQ,0BAG4BhN,KAAnD+M,WAAazB,eAAe2B,mBAC/B3B,eAAe2B,kBAAoB,IAAI9P,KAAK+P,UAAWb,aAAcD,MAAO1K,UAE5EqL,WAAWvP,IAAI6O,aAAcD,MAAO1K,UAKxC8J,eAAekB,YAAa,aAnDO1M,IAA7B0L,kBAAkBU,SACpBV,kBAAkBU,OAASjP,KAAK8C,IAAIO,OAGtCkL,kBAAkBU,OAASV,kBAAkBU,OAAO9L,MAAMqM,2BA0D9D1E,OAAOiE,WAAa/O,KAAKkO,MAAMa,SAASC,aACjChI,EAAI,EAAGA,EAAI8D,OAAO8C,OAAOlM,OAAQsF,IAAK,CAE7CsH,gBADIW,MAAQnE,OAAO8C,OAAO5G,IACDsH,gBAAgBW,OAAOhM,UAAUyL,oBAU5DsB,mBAAqBhQ,KAAK8C,IAAIE,SAC9BiN,qBAAuBjQ,KAAK8C,IAAIO,UAE3B5B,EAAI,EAAGA,EAAIV,KAAK6M,OAAOlM,OAAQD,IAAK,KACvCwN,MAEAX,gBAFAW,MAAQlO,KAAK6M,OAAOnM,MAGtBuO,mBAAqBA,mBAAmB/M,UAAUqL,gBAAgBW,SAGhEV,kBAAkBU,SACpBgB,qBAAuBA,qBAAqB9M,MAAMoL,kBAAkBU,aAIpEiB,kBAAoB5O,OAAOE,KAAK2M,gBAChCgC,QAAU,GACVC,QAAU9O,OAAOC,OAAO,SAYxBwM,MAAMsC,YAAa,CACrBH,kBAAoB5O,OAAOE,KAAKT,KAAK2M,kBAE5BjM,EAAI,EAAGA,EAAIyO,kBAAkBxO,OAAQD,IAAK,CAC7CqO,iBAAmBI,kBAAkBzO,OACrCkB,SAAW3C,KAAKiC,SAASM,WAAWuN,kBACxC3B,eAAe2B,kBAAoB,IAAI9P,KAAK+P,eAIvCtO,EAAI,EAAGA,EAAIyO,kBAAkBxO,OAAQD,IAAK,KAU7CS,QADAS,SAAW3C,KAAKiC,SAASM,WAAW2N,kBAAkBzO,KACpCS,UAEjB8N,mBAAmB5M,SAASlB,UAI7B+N,qBAAqB7M,SAASlB,aAM9BoO,SAFAC,YAAcxP,KAAK2M,aAAa/K,UAChC6N,MAAQpC,aAAazL,SAASR,WAAW0G,WAAW0H,qBAGnB1N,KAAhCyN,SAAWF,QAAQlO,SACtBoO,SAASE,OAASA,MAClBF,SAASG,UAAUC,QAAQvC,eAAexL,eACrC,KACDyC,MAAQ,CACVuL,IAAKzO,OACLsO,MAAOA,MACPC,UAAWtC,eAAexL,WAE5ByN,QAAQlO,QAAUkD,MAClB+K,QAAQxM,KAAKyB,gBAOV+K,QAAQhE,MAAK,SAAU5I,EAAGC,UACxBA,EAAEgN,MAAQjN,EAAEiN,UAYvBxQ,KAAKuN,MAAM3K,UAAUwE,OAAS,eACxBqG,cAAgBnM,OAAOE,KAAKT,KAAK0M,eAClCtB,OACAxH,KAAI,SAAUqG,YACN,CAACA,KAAMjK,KAAK0M,cAAczC,SAChCjK,MAED2M,aAAepM,OAAOE,KAAKT,KAAK2M,cACjC/I,KAAI,SAAUgM,WACN,CAACA,IAAK5P,KAAK2M,aAAaiD,KAAKvJ,YACnCrG,YAEE,CACLH,QAASZ,KAAKY,QACdgN,OAAQ7M,KAAK6M,OACbF,aAAcA,aACdD,cAAeA,cACfrN,SAAUW,KAAKX,SAASgH,WAU5BpH,KAAKuN,MAAM1H,KAAO,SAAU+K,qBACtBpD,MAAQ,GACRE,aAAe,GACfmD,kBAAoBD,gBAAgBlD,aACpCD,cAAgBnM,OAAOC,OAAO,MAC9BuP,wBAA0BF,gBAAgBnD,cAC1CsD,gBAAkB,IAAI/Q,KAAKqK,SAASlK,QACpCC,SAAWJ,KAAKuF,SAASM,KAAK+K,gBAAgBxQ,UAE9CwQ,gBAAgBhQ,SAAWZ,KAAKY,SAClCZ,KAAKa,MAAMC,KAAK,4EAA8Ed,KAAKY,QAAU,sCAAwCgQ,gBAAgBhQ,QAAU,SAG5K,IAAIa,EAAI,EAAGA,EAAIoP,kBAAkBnP,OAAQD,IAAK,KAE7CkP,KADAK,MAAQH,kBAAkBpP,IACd,GACZsB,SAAWiO,MAAM,GAErBtD,aAAaiD,KAAO,IAAI3Q,KAAKqH,OAAOtE,cAG7BtB,EAAI,EAAGA,EAAIqP,wBAAwBpP,OAAQD,IAAK,KACnDuP,MACAhG,MADAgG,MAAQF,wBAAwBrP,IACnB,GACbqC,QAAUkN,MAAM,GAEpBD,gBAAgBjJ,OAAOkD,MACvByC,cAAczC,MAAQlH,eAGxBiN,gBAAgBnG,SAEhB4C,MAAMI,OAASgD,gBAAgBhD,OAE/BJ,MAAME,aAAeA,aACrBF,MAAMC,cAAgBA,cACtBD,MAAMG,SAAWoD,gBAAgBjR,KACjC0N,MAAMpN,SAAWA,SAEV,IAAIJ,KAAKuN,MAAMC,QA+BxBxN,KAAKG,QAAU,gBACR8Q,KAAO,UACPC,QAAU5P,OAAOC,OAAO,WACxB4P,WAAa7P,OAAOC,OAAO,WAC3BkM,cAAgBnM,OAAOC,OAAO,WAC9B6P,qBAAuB,QACvBC,aAAe,QACf3M,UAAY1E,KAAK0E,eACjBtE,SAAW,IAAIJ,KAAKuF,cACpB9E,eAAiB,IAAIT,KAAKuF,cAC1BxB,cAAgB,OAChBuN,GAAK,SACLC,IAAM,SACNpC,UAAY,OACZqC,kBAAoB,IAe3BxR,KAAKG,QAAQyC,UAAU+N,IAAM,SAAUA,UAChCM,KAAON,KAmCd3Q,KAAKG,QAAQyC,UAAUqM,MAAQ,SAAU9M,UAAWsP,eAC9C,KAAK7H,KAAKzH,iBACN,IAAIuP,WAAY,UAAYvP,UAAY,yCAG3C+O,QAAQ/O,WAAasP,YAAc,IAW1CzR,KAAKG,QAAQyC,UAAUY,EAAI,SAAUmO,aAE5BL,GADHK,OAAS,EACD,EACDA,OAAS,EACR,EAEAA,QAWd3R,KAAKG,QAAQyC,UAAUgP,GAAK,SAAUD,aAC/BJ,IAAMI,QAoBb3R,KAAKG,QAAQyC,UAAUvC,IAAM,SAAUwR,IAAKJ,gBACtCvP,OAAS2P,IAAI9Q,KAAKkQ,MAClBrD,OAAStM,OAAOE,KAAKT,KAAKmQ,cAEzBC,WAAWjP,QAAUuP,YAAc,QACnC1N,eAAiB,MAEjB,IAAItC,EAAI,EAAGA,EAAImM,OAAOlM,OAAQD,IAAK,KAClCU,UAAYyL,OAAOnM,GACnBqQ,UAAY/Q,KAAKmQ,QAAQ/O,WAAW2P,UACpC7C,MAAQ6C,UAAYA,UAAUD,KAAOA,IAAI1P,WACzC4C,OAAShE,KAAK2D,UAAUuK,MAAO,CAC7BrB,OAAQ,CAACzL,aAEXsM,MAAQ1N,KAAKX,SAASuG,IAAI5B,QAC1BpC,SAAW,IAAI3C,KAAKiC,SAAUC,OAAQC,WACtC4P,WAAazQ,OAAOC,OAAO,WAE1B6P,qBAAqBzO,UAAYoP,gBACjCV,aAAa1O,UAAY,OAGzB0O,aAAa1O,WAAa8L,MAAM/M,WAGhC,IAAIoF,EAAI,EAAGA,EAAI2H,MAAM/M,OAAQoF,IAAK,KACjCkE,KAAOyD,MAAM3H,MAEOjE,MAApBkP,WAAW/G,QACb+G,WAAW/G,MAAQ,GAGrB+G,WAAW/G,OAAS,EAIYnI,MAA5B9B,KAAK0M,cAAczC,MAAoB,KACrClH,QAAUxC,OAAOC,OAAO,MAC5BuC,QAAO,OAAa/C,KAAKoO,eACpBA,WAAa,MAEb,IAAInI,EAAI,EAAGA,EAAI4G,OAAOlM,OAAQsF,IACjClD,QAAQ8J,OAAO5G,IAAM1F,OAAOC,OAAO,WAGhCkM,cAAczC,MAAQlH,QAIsBjB,MAA/C9B,KAAK0M,cAAczC,MAAM7I,WAAWD,eACjCuL,cAAczC,MAAM7I,WAAWD,QAAUZ,OAAOC,OAAO,WAKzD,IAAIoO,EAAI,EAAGA,EAAI5O,KAAKyQ,kBAAkB9P,OAAQiO,IAAK,KAClDqC,YAAcjR,KAAKyQ,kBAAkB7B,GACrCpL,SAAWyG,KAAKzG,SAASyN,aAEmCnP,MAA5D9B,KAAK0M,cAAczC,MAAM7I,WAAWD,QAAQ8P,oBACzCvE,cAAczC,MAAM7I,WAAWD,QAAQ8P,aAAe,SAGxDvE,cAAczC,MAAM7I,WAAWD,QAAQ8P,aAAarO,KAAKY,cAYtEvE,KAAKG,QAAQyC,UAAUqP,6BAA+B,mBAEhDC,UAAY5Q,OAAOE,KAAKT,KAAKsQ,cAC7Bc,eAAiBD,UAAUxQ,OAC3B0Q,YAAc,GACdC,mBAAqB,GAEhB5Q,EAAI,EAAGA,EAAI0Q,eAAgB1Q,IAAK,KACnCkB,SAAW3C,KAAKiC,SAASM,WAAW2P,UAAUzQ,IAC9CwN,MAAQtM,SAASR,UAErBkQ,mBAAmBpD,SAAWoD,mBAAmBpD,OAAS,GAC1DoD,mBAAmBpD,QAAU,EAE7BmD,YAAYnD,SAAWmD,YAAYnD,OAAS,GAC5CmD,YAAYnD,QAAUlO,KAAKsQ,aAAa1O,cAGtCiL,OAAStM,OAAOE,KAAKT,KAAKmQ,aAErBzP,EAAI,EAAGA,EAAImM,OAAOlM,OAAQD,IAAK,KAClCU,UAAYyL,OAAOnM,GACvB2Q,YAAYjQ,WAAaiQ,YAAYjQ,WAAakQ,mBAAmBlQ,gBAGlEmQ,mBAAqBF,aAQ5BpS,KAAKG,QAAQyC,UAAU2P,mBAAqB,mBACtC7E,aAAe,GACfwE,UAAY5Q,OAAOE,KAAKT,KAAKqQ,sBAC7BoB,gBAAkBN,UAAUxQ,OAC5B+Q,aAAenR,OAAOC,OAAO,MAExBE,EAAI,EAAGA,EAAI+Q,gBAAiB/Q,IAAK,SACpCkB,SAAW3C,KAAKiC,SAASM,WAAW2P,UAAUzQ,IAC9CU,UAAYQ,SAASR,UACrBuQ,YAAc3R,KAAKsQ,aAAa1O,UAChC4N,YAAc,IAAIvQ,KAAKqH,OACvBsL,gBAAkB5R,KAAKqQ,qBAAqBzO,UAC5C8L,MAAQnN,OAAOE,KAAKmR,iBACpBC,YAAcnE,MAAM/M,OAGpBmR,WAAa9R,KAAKmQ,QAAQ/O,WAAWuN,OAAS,EAC9CoD,SAAW/R,KAAKoQ,WAAWxO,SAAST,QAAQwN,OAAS,EAEhD5I,EAAI,EAAGA,EAAI8L,YAAa9L,IAAK,KAIhCjD,IAAK2M,MAAOuC,mBAHZ/H,KAAOyD,MAAM3H,GACbkM,GAAKL,gBAAgB3H,MACrBmE,UAAYpO,KAAK0M,cAAczC,MAAMoE,YAGdvM,IAAvB4P,aAAazH,OACfnH,IAAM7D,KAAK6D,IAAI9C,KAAK0M,cAAczC,MAAOjK,KAAKgD,eAC9C0O,aAAazH,MAAQnH,KAErBA,IAAM4O,aAAazH,MAGrBwF,MAAQ3M,MAAQ9C,KAAKwQ,IAAM,GAAKyB,KAAOjS,KAAKwQ,KAAO,EAAIxQ,KAAKuQ,GAAKvQ,KAAKuQ,IAAMoB,YAAc3R,KAAKuR,mBAAmBnQ,aAAe6Q,IACjIxC,OAASqC,WACTrC,OAASsC,SACTC,mBAAqB7O,KAAK+O,MAAc,IAARzC,OAAgB,IAQhDD,YAAYzI,OAAOqH,UAAW4D,oBAGhCrF,aAAa/K,UAAY4N,iBAGtB7C,aAAeA,cAQtB1N,KAAKG,QAAQyC,UAAUsQ,eAAiB,gBACjCvF,SAAW3N,KAAKqK,SAASK,UAC5BpJ,OAAOE,KAAKT,KAAK0M,eAAetB,SAYpCnM,KAAKG,QAAQyC,UAAUjC,MAAQ,uBACxBsR,oCACAM,0BACAW,iBAEE,IAAIlT,KAAKuN,MAAM,CACpBE,cAAe1M,KAAK0M,cACpBC,aAAc3M,KAAK2M,aACnBC,SAAU5M,KAAK4M,SACfC,OAAQtM,OAAOE,KAAKT,KAAKmQ,SACzB9Q,SAAUW,KAAKN,kBAkBnBT,KAAKG,QAAQyC,UAAUuQ,IAAM,SAAU1O,QACjC2O,KAAOvR,MAAMe,UAAUb,MAAMrB,KAAKyF,UAAW,GACjDiN,KAAKC,QAAQtS,MACb0D,GAAG6O,MAAMvS,KAAMqS,OAcjBpT,KAAK+P,UAAY,SAAU/E,KAAMiE,MAAO1K,kBAClCgP,eAAiBjS,OAAOC,OAAO,MAC/BiS,aAAelS,OAAOE,KAAK+C,UAAY,IAOlC9C,EAAI,EAAGA,EAAI+R,aAAa9R,OAAQD,IAAK,KACxCE,IAAM6R,aAAa/R,GACvB8R,eAAe5R,KAAO4C,SAAS5C,KAAKI,aAGjCwC,SAAWjD,OAAOC,OAAO,WAEjBsB,IAATmI,YACGzG,SAASyG,MAAQ1J,OAAOC,OAAO,WAC/BgD,SAASyG,MAAMiE,OAASsE,iBAajCvT,KAAK+P,UAAUnN,UAAU8N,QAAU,SAAU+C,wBACvChF,MAAQnN,OAAOE,KAAKiS,eAAelP,UAE9B9C,EAAI,EAAGA,EAAIgN,MAAM/M,OAAQD,IAAK,KACjCuJ,KAAOyD,MAAMhN,GACbmM,OAAStM,OAAOE,KAAKiS,eAAelP,SAASyG,OAEtBnI,MAAvB9B,KAAKwD,SAASyG,aACXzG,SAASyG,MAAQ1J,OAAOC,OAAO,WAGjC,IAAIuF,EAAI,EAAGA,EAAI8G,OAAOlM,OAAQoF,IAAK,KAClCmI,MAAQrB,OAAO9G,GACftF,KAAOF,OAAOE,KAAKiS,eAAelP,SAASyG,MAAMiE,QAEnBpM,MAA9B9B,KAAKwD,SAASyG,MAAMiE,cACjB1K,SAASyG,MAAMiE,OAAS3N,OAAOC,OAAO,WAGxC,IAAIyF,EAAI,EAAGA,EAAIxF,KAAKE,OAAQsF,IAAK,KAChCrF,IAAMH,KAAKwF,GAEwBnE,MAAnC9B,KAAKwD,SAASyG,MAAMiE,OAAOtN,UACxB4C,SAASyG,MAAMiE,OAAOtN,KAAO8R,eAAelP,SAASyG,MAAMiE,OAAOtN,UAElE4C,SAASyG,MAAMiE,OAAOtN,KAAOZ,KAAKwD,SAASyG,MAAMiE,OAAOtN,KAAKiC,OAAO6P,eAAelP,SAASyG,MAAMiE,OAAOtN,UAexH3B,KAAK+P,UAAUnN,UAAUvC,IAAM,SAAU2K,KAAMiE,MAAO1K,eAC9CyG,QAAQjK,KAAKwD,sBACZA,SAASyG,MAAQ1J,OAAOC,OAAO,gBAC/BgD,SAASyG,MAAMiE,OAAS1K,aAIzB0K,SAASlO,KAAKwD,SAASyG,cAKzBwI,aAAelS,OAAOE,KAAK+C,UAEtB9C,EAAI,EAAGA,EAAI+R,aAAa9R,OAAQD,IAAK,KACxCE,IAAM6R,aAAa/R,GAEnBE,OAAOZ,KAAKwD,SAASyG,MAAMiE,YACxB1K,SAASyG,MAAMiE,OAAOtN,KAAOZ,KAAKwD,SAASyG,MAAMiE,OAAOtN,KAAKiC,OAAOW,SAAS5C,WAE7E4C,SAASyG,MAAMiE,OAAOtN,KAAO4C,SAAS5C,eAZxC4C,SAASyG,MAAMiE,OAAS1K,UA2BjCvE,KAAKkO,MAAQ,SAAUwF,gBAChBlF,QAAU,QACVkF,UAAYA,WA2BnB1T,KAAKkO,MAAMyF,SAAW,IAAIC,OAAQ,KAClC5T,KAAKkO,MAAMyF,SAASE,KAAO,EAC3B7T,KAAKkO,MAAMyF,SAASG,QAAU,EAC9B9T,KAAKkO,MAAMyF,SAASI,SAAW,EAa/B/T,KAAKkO,MAAMa,SAAW,CAIpBiF,SAAU,EAMVhF,SAAU,EAMVS,WAAY,GA0BdzP,KAAKkO,MAAMtL,UAAUkI,OAAS,SAAUA,cAChC,WAAYA,SAChBA,OAAO8C,OAAS7M,KAAK2S,WAGjB,UAAW5I,SACfA,OAAO4E,MAAQ,GAGX,gBAAiB5E,SACrBA,OAAO6D,aAAc,GAGjB,aAAc7D,SAClBA,OAAO6I,SAAW3T,KAAKkO,MAAMyF,SAASE,MAGnC/I,OAAO6I,SAAW3T,KAAKkO,MAAMyF,SAASG,SAAahJ,OAAOE,KAAK7F,OAAO,IAAMnF,KAAKkO,MAAMyF,WAC1F7I,OAAOE,KAAO,IAAMF,OAAOE,MAGxBF,OAAO6I,SAAW3T,KAAKkO,MAAMyF,SAASI,UAAcjJ,OAAOE,KAAKjJ,OAAO,IAAM/B,KAAKkO,MAAMyF,WAC3F7I,OAAOE,KAAYF,OAAOE,KAAO,KAG7B,aAAcF,SAClBA,OAAOiE,SAAW/O,KAAKkO,MAAMa,SAASiF,eAGnCxF,QAAQ7K,KAAKmH,QAEX/J,MAUTf,KAAKkO,MAAMtL,UAAUyN,UAAY,eAC1B,IAAI5O,EAAI,EAAGA,EAAIV,KAAKyN,QAAQ9M,OAAQD,OACnCV,KAAKyN,QAAQ/M,GAAGsN,UAAY/O,KAAKkO,MAAMa,SAASU,kBAC3C,SAIJ,GA6BTzP,KAAKkO,MAAMtL,UAAUoI,KAAO,SAAUA,KAAMiJ,YACtCpS,MAAMC,QAAQkJ,aAChBA,KAAKjF,SAAQ,SAAUnB,QAAUoG,KAAKpG,EAAG5E,KAAKa,MAAMQ,MAAM4S,YAAalT,MAChEA,SAGL+J,OAASmJ,SAAW,UACxBnJ,OAAOE,KAAOA,KAAK5J,gBAEd0J,OAAOA,QAEL/J,MAETf,KAAKkU,gBAAkB,SAAUlT,QAASyG,MAAOC,UAC1CyM,KAAO,uBACPnT,QAAUA,aACVyG,MAAQA,WACRC,IAAMA,KAGb1H,KAAKkU,gBAAgBtR,UAAY,IAAIqD,MACrCjG,KAAKoU,WAAa,SAAU9P,UACrB+P,QAAU,QACV/P,IAAMA,SACN5C,OAAS4C,IAAI5C,YACb6E,IAAM,OACNkB,MAAQ,OACR6M,oBAAsB,IAG7BtU,KAAKoU,WAAWxR,UAAU+D,IAAM,mBAC1B4N,MAAQvU,KAAKoU,WAAWI,QAErBD,OACLA,MAAQA,MAAMxT,OAIlBf,KAAKoU,WAAWxR,UAAU6R,YAAc,mBAClCC,UAAY,GACZzP,WAAalE,KAAK0G,MAClBzC,SAAWjE,KAAKwF,IAEX9E,EAAI,EAAGA,EAAIV,KAAKuT,oBAAoB5S,OAAQD,IACnDuD,SAAWjE,KAAKuT,oBAAoB7S,GACpCiT,UAAU/Q,KAAK5C,KAAKuD,IAAIvC,MAAMkD,WAAYD,WAC1CC,WAAaD,SAAW,SAG1B0P,UAAU/Q,KAAK5C,KAAKuD,IAAIvC,MAAMkD,WAAYlE,KAAKwF,WAC1C+N,oBAAoB5S,OAAS,EAE3BgT,UAAUC,KAAK,KAGxB3U,KAAKoU,WAAWxR,UAAUgS,KAAO,SAAUC,WACpCR,QAAQ1Q,KAAK,CAChBkR,KAAMA,KACNvQ,IAAKvD,KAAK0T,cACVhN,MAAO1G,KAAK0G,MACZC,IAAK3G,KAAKwF,WAGPkB,MAAQ1G,KAAKwF,KAGpBvG,KAAKoU,WAAWxR,UAAUkS,gBAAkB,gBACrCR,oBAAoB3Q,KAAK5C,KAAKwF,IAAM,QACpCA,KAAO,GAGdvG,KAAKoU,WAAWxR,UAAUkJ,KAAO,cAC3B/K,KAAKwF,KAAOxF,KAAKW,cACZ1B,KAAKoU,WAAWW,QAGrBvJ,KAAOzK,KAAKuD,IAAIa,OAAOpE,KAAKwF,iBAC3BA,KAAO,EACLiF,MAGTxL,KAAKoU,WAAWxR,UAAUoS,MAAQ,kBACzBjU,KAAKwF,IAAMxF,KAAK0G,OAGzBzH,KAAKoU,WAAWxR,UAAUqS,OAAS,WAC7BlU,KAAK0G,OAAS1G,KAAKwF,WAChBA,KAAO,QAGTkB,MAAQ1G,KAAKwF,KAGpBvG,KAAKoU,WAAWxR,UAAUsS,OAAS,gBAC5B3O,KAAO,GAGdvG,KAAKoU,WAAWxR,UAAUuS,eAAiB,eACrC3J,KAAM4J,YAIRA,UADA5J,KAAOzK,KAAK+K,QACIuJ,WAAW,SACpBD,SAAW,IAAMA,SAAW,IAEjC5J,MAAQxL,KAAKoU,WAAWW,UACrBG,UAITlV,KAAKoU,WAAWxR,UAAU0S,KAAO,kBACxBvU,KAAKwF,IAAMxF,KAAKW,QAGzB1B,KAAKoU,WAAWW,IAAM,MACtB/U,KAAKoU,WAAWmB,MAAQ,QACxBvV,KAAKoU,WAAWoB,KAAO,OACvBxV,KAAKoU,WAAWqB,cAAgB,gBAChCzV,KAAKoU,WAAWsB,MAAQ,QACxB1V,KAAKoU,WAAWuB,SAAW,WAE3B3V,KAAKoU,WAAWwB,SAAW,SAAUC,cACnCA,MAAMX,SACNW,MAAMjB,KAAK5U,KAAKoU,WAAWmB,OAC3BM,MAAMZ,SACCjV,KAAKoU,WAAWI,SAGzBxU,KAAKoU,WAAW0B,QAAU,SAAUD,UAC9BA,MAAMb,QAAU,IAClBa,MAAMX,SACNW,MAAMjB,KAAK5U,KAAKoU,WAAWoB,OAG7BK,MAAMZ,SAEFY,MAAMP,cACDtV,KAAKoU,WAAWI,SAI3BxU,KAAKoU,WAAW2B,gBAAkB,SAAUF,cAC1CA,MAAMZ,SACNY,MAAMV,iBACNU,MAAMjB,KAAK5U,KAAKoU,WAAWqB,eACpBzV,KAAKoU,WAAWI,SAGzBxU,KAAKoU,WAAW4B,SAAW,SAAUH,cACnCA,MAAMZ,SACNY,MAAMV,iBACNU,MAAMjB,KAAK5U,KAAKoU,WAAWsB,OACpB1V,KAAKoU,WAAWI,SAGzBxU,KAAKoU,WAAW6B,OAAS,SAAUJ,OAC7BA,MAAMb,QAAU,GAClBa,MAAMjB,KAAK5U,KAAKoU,WAAWoB,OAe/BxV,KAAKoU,WAAW8B,cAAgBlW,KAAK0E,UAAUW,UAE/CrF,KAAKoU,WAAWI,QAAU,SAAUqB,cACrB,KACPrK,KAAOqK,MAAM/J,UAEbN,MAAQxL,KAAKoU,WAAWW,WACnB/U,KAAKoU,WAAW6B,UAIC,IAAtBzK,KAAK6J,WAAW,OAKR,KAAR7J,YACKxL,KAAKoU,WAAWwB,YAGb,KAARpK,YACFqK,MAAMX,SACFW,MAAMb,QAAU,GAClBa,MAAMjB,KAAK5U,KAAKoU,WAAWoB,MAEtBxV,KAAKoU,WAAW2B,mBAGb,KAARvK,YACFqK,MAAMX,SACFW,MAAMb,QAAU,GAClBa,MAAMjB,KAAK5U,KAAKoU,WAAWoB,MAEtBxV,KAAKoU,WAAW4B,YAMb,KAARxK,MAAiC,IAAlBqK,MAAMb,eACvBa,MAAMjB,KAAK5U,KAAKoU,WAAWuB,UACpB3V,KAAKoU,WAAWI,WAMb,KAARhJ,MAAiC,IAAlBqK,MAAMb,eACvBa,MAAMjB,KAAK5U,KAAKoU,WAAWuB,UACpB3V,KAAKoU,WAAWI,WAGrBhJ,KAAKpG,MAAMpF,KAAKoU,WAAW8B,sBACtBlW,KAAKoU,WAAW0B,aAzCvBD,MAAMf,oBA8CZ9U,KAAKgO,YAAc,SAAU1J,IAAKyJ,YAC3B8H,MAAQ,IAAI7V,KAAKoU,WAAY9P,UAC7ByJ,MAAQA,WACRoI,cAAgB,QAChBC,UAAY,GAGnBpW,KAAKgO,YAAYpL,UAAUqL,MAAQ,gBAC5B4H,MAAMlP,WACN0N,QAAUtT,KAAK8U,MAAMxB,gBAEtBE,MAAQvU,KAAKgO,YAAYqI,YAEtB9B,OACLA,MAAQA,MAAMxT,aAGTA,KAAKgN,OAGd/N,KAAKgO,YAAYpL,UAAU0T,WAAa,kBAC/BvV,KAAKsT,QAAQtT,KAAKqV,YAG3BpW,KAAKgO,YAAYpL,UAAU2T,cAAgB,eACrCC,OAASzV,KAAKuV,yBACbF,WAAa,EACXI,QAGTxW,KAAKgO,YAAYpL,UAAU6T,WAAa,eAClCC,gBAAkB3V,KAAKoV,mBACtBpI,MAAMjD,OAAO4L,sBACbP,cAAgB,IAGvBnW,KAAKgO,YAAYqI,YAAc,SAAUM,YACnCH,OAASG,OAAOL,gBAENzT,MAAV2T,cAIIA,OAAO3B,WACR7U,KAAKoU,WAAWuB,gBACZ3V,KAAKgO,YAAY4I,mBACrB5W,KAAKoU,WAAWmB,aACZvV,KAAKgO,YAAY6I,gBACrB7W,KAAKoU,WAAWoB,YACZxV,KAAKgO,YAAY8I,sBAEpBC,aAAe,4CAA8CP,OAAO3B,WAEpE2B,OAAOlS,IAAI5C,QAAU,IACvBqV,cAAgB,gBAAkBP,OAAOlS,IAAM,KAG3C,IAAItE,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,OAIzE1H,KAAKgO,YAAY4I,cAAgB,SAAUD,YACrCH,OAASG,OAAOJ,mBAEN1T,MAAV2T,eAIIA,OAAOlS,SACR,IACHqS,OAAOR,cAAcpH,SAAW/O,KAAKkO,MAAMa,SAASU,qBAEjD,IACHkH,OAAOR,cAAcpH,SAAW/O,KAAKkO,MAAMa,SAASC,2BAGhD+H,aAAe,kCAAoCP,OAAOlS,IAAM,UAC9D,IAAItE,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,SAGnEsP,WAAaL,OAAOL,gBAENzT,MAAdmU,WAAyB,CACvBD,aAAe,+CACb,IAAI/W,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,YAG7DsP,WAAWnC,WACZ7U,KAAKoU,WAAWmB,aACZvV,KAAKgO,YAAY6I,gBACrB7W,KAAKoU,WAAWoB,YACZxV,KAAKgO,YAAY8I,kBAEpBC,aAAe,mCAAqCC,WAAWnC,KAAO,UACpE,IAAI7U,KAAKkU,gBAAiB6C,aAAcC,WAAWvP,MAAOuP,WAAWtP,QAIjF1H,KAAKgO,YAAY6I,WAAa,SAAUF,YAClCH,OAASG,OAAOJ,mBAEN1T,MAAV2T,YAI+C,GAA/CG,OAAO5I,MAAM2F,UAAUhR,QAAQ8T,OAAOlS,KAAY,KAChD2S,eAAiBN,OAAO5I,MAAM2F,UAAU/O,KAAI,SAAUuS,SAAY,IAAMA,EAAI,OAAOvC,KAAK,MACxFoC,aAAe,uBAAyBP,OAAOlS,IAAM,uBAAyB2S,qBAE5E,IAAIjX,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,KAGrEiP,OAAOR,cAAcvI,OAAS,CAAC4I,OAAOlS,SAElC0S,WAAaL,OAAOL,gBAENzT,MAAdmU,WAAyB,CACvBD,aAAe,sCACb,IAAI/W,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,QAG7DsP,WAAWnC,OACZ7U,KAAKoU,WAAWoB,YACZxV,KAAKgO,YAAY8I,UAEpBC,aAAe,0BAA4BC,WAAWnC,KAAO,UAC3D,IAAI7U,KAAKkU,gBAAiB6C,aAAcC,WAAWvP,MAAOuP,WAAWtP,OAIjF1H,KAAKgO,YAAY8I,UAAY,SAAUH,YACjCH,OAASG,OAAOJ,mBAEN1T,MAAV2T,QAIJG,OAAOR,cAAcnL,KAAOwL,OAAOlS,IAAIO,eAEP,GAA5B2R,OAAOlS,IAAI5B,QAAQ,OACrBiU,OAAOR,cAAcxH,aAAc,OAGjCqI,WAAaL,OAAOL,gBAENzT,MAAdmU,kBAKIA,WAAWnC,WACZ7U,KAAKoU,WAAWoB,YACnBmB,OAAOF,aACAzW,KAAKgO,YAAY8I,eACrB9W,KAAKoU,WAAWmB,aACnBoB,OAAOF,aACAzW,KAAKgO,YAAY6I,gBACrB7W,KAAKoU,WAAWqB,qBACZzV,KAAKgO,YAAYmJ,uBACrBnX,KAAKoU,WAAWsB,aACZ1V,KAAKgO,YAAYoJ,gBACrBpX,KAAKoU,WAAWuB,gBACnBgB,OAAOF,aACAzW,KAAKgO,YAAY4I,0BAEpBG,aAAe,2BAA6BC,WAAWnC,KAAO,UAC5D,IAAI7U,KAAKkU,gBAAiB6C,aAAcC,WAAWvP,MAAOuP,WAAWtP,UApB7EiP,OAAOF,eAwBXzW,KAAKgO,YAAYmJ,kBAAoB,SAAUR,YACzCH,OAASG,OAAOJ,mBAEN1T,MAAV2T,YAIAvL,aAAeoM,SAASb,OAAOlS,IAAK,OAEpCgT,MAAMrM,cAAe,KACnB8L,aAAe,sCACb,IAAI/W,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,KAGrEiP,OAAOR,cAAclL,aAAeA,iBAEhC+L,WAAaL,OAAOL,gBAENzT,MAAdmU,kBAKIA,WAAWnC,WACZ7U,KAAKoU,WAAWoB,YACnBmB,OAAOF,aACAzW,KAAKgO,YAAY8I,eACrB9W,KAAKoU,WAAWmB,aACnBoB,OAAOF,aACAzW,KAAKgO,YAAY6I,gBACrB7W,KAAKoU,WAAWqB,qBACZzV,KAAKgO,YAAYmJ,uBACrBnX,KAAKoU,WAAWsB,aACZ1V,KAAKgO,YAAYoJ,gBACrBpX,KAAKoU,WAAWuB,gBACnBgB,OAAOF,aACAzW,KAAKgO,YAAY4I,sBAEpBG,aAAe,2BAA6BC,WAAWnC,KAAO,UAC5D,IAAI7U,KAAKkU,gBAAiB6C,aAAcC,WAAWvP,MAAOuP,WAAWtP,UApB7EiP,OAAOF,eAwBXzW,KAAKgO,YAAYoJ,WAAa,SAAUT,YAClCH,OAASG,OAAOJ,mBAEN1T,MAAV2T,YAIA9G,MAAQ2H,SAASb,OAAOlS,IAAK,OAE7BgT,MAAM5H,OAAQ,KACZqH,aAAe,8BACb,IAAI/W,KAAKkU,gBAAiB6C,aAAcP,OAAO/O,MAAO+O,OAAO9O,KAGrEiP,OAAOR,cAAczG,MAAQA,UAEzBsH,WAAaL,OAAOL,gBAENzT,MAAdmU,kBAKIA,WAAWnC,WACZ7U,KAAKoU,WAAWoB,YACnBmB,OAAOF,aACAzW,KAAKgO,YAAY8I,eACrB9W,KAAKoU,WAAWmB,aACnBoB,OAAOF,aACAzW,KAAKgO,YAAY6I,gBACrB7W,KAAKoU,WAAWqB,qBACZzV,KAAKgO,YAAYmJ,uBACrBnX,KAAKoU,WAAWsB,aACZ1V,KAAKgO,YAAYoJ,gBACrBpX,KAAKoU,WAAWuB,gBACnBgB,OAAOF,aACAzW,KAAKgO,YAAY4I,sBAEpBG,aAAe,2BAA6BC,WAAWnC,KAAO,UAC5D,IAAI7U,KAAKkU,gBAAiB6C,aAAcC,WAAWvP,MAAOuP,WAAWtP,UApB7EiP,OAAOF,eA4BG3W,KAeViB,KAfgBhB,QAeV,kBAMCC,MApBe,mBAAXuX,QAAyBA,OAAOC,IAEzCD,oCAAOxX,SACqB,iBAAZ0X,QAMhBC,OAAOD,QAAU1X,UAGjBD,KAAKE,KAAOD,UAl4GjB"}