This stemming tokenizer converts tokens (words) to their stem forms before returning them. It requires an\n * external stemming function to be provided; for this purpose I recommend the NPM 'porter-stemmer' library.\n *\n *
For more information see http : //tartarus.org/~martin/PorterStemmer/\n */\nvar StemmingTokenizer = /*#__PURE__*/function () {\n /**\n * Constructor.\n *\n * @param stemmingFunction Function capable of accepting a word and returning its stem.\n * @param decoratedIndexStrategy Index strategy to be run after all stop words have been removed.\n */\n function StemmingTokenizer(stemmingFunction, decoratedTokenizer) {\n this._stemmingFunction = stemmingFunction;\n this._tokenizer = decoratedTokenizer;\n }\n /**\n * @inheritDocs\n */\n\n\n var _proto = StemmingTokenizer.prototype;\n\n _proto.tokenize = function tokenize(text) {\n return this._tokenizer.tokenize(text).map(this._stemmingFunction);\n };\n\n return StemmingTokenizer;\n}();\n\n/**\n * Stop words list copied from Lunr JS.\n */\nvar StopWordsMap = {\n a: true,\n able: true,\n about: true,\n across: true,\n after: true,\n all: true,\n almost: true,\n also: true,\n am: true,\n among: true,\n an: true,\n and: true,\n any: true,\n are: true,\n as: true,\n at: true,\n be: true,\n because: true,\n been: true,\n but: true,\n by: true,\n can: true,\n cannot: true,\n could: true,\n dear: true,\n did: true,\n 'do': true,\n does: true,\n either: true,\n 'else': true,\n ever: true,\n every: true,\n 'for': true,\n from: true,\n 'get': true,\n got: true,\n had: true,\n has: true,\n have: true,\n he: true,\n her: true,\n hers: true,\n him: true,\n his: true,\n how: true,\n however: true,\n i: true,\n 'if': true,\n 'in': true,\n into: true,\n is: true,\n it: true,\n its: true,\n just: true,\n least: true,\n \"let\": true,\n like: true,\n likely: true,\n may: true,\n me: true,\n might: true,\n most: true,\n must: true,\n my: true,\n neither: true,\n no: true,\n nor: true,\n not: true,\n of: true,\n off: true,\n often: true,\n on: true,\n only: true,\n or: true,\n other: true,\n our: true,\n own: true,\n rather: true,\n said: true,\n say: true,\n says: true,\n she: true,\n should: true,\n since: true,\n so: true,\n some: true,\n than: true,\n that: true,\n the: true,\n their: true,\n them: true,\n then: true,\n there: true,\n these: true,\n they: true,\n 'this': true,\n tis: true,\n to: true,\n too: true,\n twas: true,\n us: true,\n wants: true,\n was: true,\n we: true,\n were: true,\n what: true,\n when: true,\n where: true,\n which: true,\n 'while': true,\n who: true,\n whom: true,\n why: true,\n will: true,\n 'with': true,\n would: true,\n yet: true,\n you: true,\n your: true\n}; // Prevent false positives for inherited properties\n\nStopWordsMap.constructor = false;\nStopWordsMap.hasOwnProperty = false;\nStopWordsMap.isPrototypeOf = false;\nStopWordsMap.propertyIsEnumerable = false;\nStopWordsMap.toLocaleString = false;\nStopWordsMap.toString = false;\nStopWordsMap.valueOf = false;\n\n/**\n * Stop words are very common (e.g. \"a\", \"and\", \"the\") and are often not semantically meaningful in the context of a\n * search. This tokenizer removes stop words from a set of tokens before passing the remaining tokens along for\n * indexing or searching purposes.\n */\n\nvar StopWordsTokenizer = /*#__PURE__*/function () {\n /**\n * Constructor.\n *\n * @param decoratedIndexStrategy Index strategy to be run after all stop words have been removed.\n */\n function StopWordsTokenizer(decoratedTokenizer) {\n this._tokenizer = decoratedTokenizer;\n }\n /**\n * @inheritDocs\n */\n\n\n var _proto = StopWordsTokenizer.prototype;\n\n _proto.tokenize = function tokenize(text) {\n return this._tokenizer.tokenize(text).filter(function (token) {\n return !StopWordsMap[token];\n });\n };\n\n return StopWordsTokenizer;\n}();\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n return Constructor;\n}\n\n/**\n * Simple client-side searching within a set of documents.\n *\n *
Documents can be searched by any number of fields. Indexing and search strategies are highly customizable.\n */\nvar Search = /*#__PURE__*/function () {\n /**\n * Array containing either a property name or a path (list of property names) to a nested value\n */\n\n /**\n * Constructor.\n * @param uidFieldName Field containing values that uniquely identify search documents; this field's values are used\n * to ensure that a search result set does not contain duplicate objects.\n */\n function Search(uidFieldName) {\n if (!uidFieldName) {\n throw Error('js-search requires a uid field name constructor parameter');\n }\n\n this._uidFieldName = uidFieldName; // Set default/recommended strategies\n\n this._indexStrategy = new PrefixIndexStrategy();\n this._searchIndex = new TfIdfSearchIndex(uidFieldName);\n this._sanitizer = new LowerCaseSanitizer();\n this._tokenizer = new SimpleTokenizer();\n this._documents = [];\n this._searchableFields = [];\n }\n /**\n * Override the default index strategy.\n * @param value Custom index strategy\n * @throws Error if documents have already been indexed by this search instance\n */\n\n\n var _proto = Search.prototype;\n\n /**\n * Add a searchable document to the index. Document will automatically be indexed for search.\n * @param document\n */\n _proto.addDocument = function addDocument(document) {\n this.addDocuments([document]);\n }\n /**\n * Adds searchable documents to the index. Documents will automatically be indexed for search.\n * @param document\n */\n ;\n\n _proto.addDocuments = function addDocuments(documents) {\n this._documents = this._documents.concat(documents);\n this.indexDocuments_(documents, this._searchableFields);\n }\n /**\n * Add a new searchable field to the index. Existing documents will automatically be indexed using this new field.\n *\n * @param field Searchable field or field path. Pass a string to index a top-level field and an array of strings for nested fields.\n */\n ;\n\n _proto.addIndex = function addIndex(field) {\n this._searchableFields.push(field);\n\n this.indexDocuments_(this._documents, [field]);\n }\n /**\n * Search all documents for ones matching the specified query text.\n * @param query\n * @returns {Array