deno.land / x / fuse@v6.4.1 / dist / fuse.basic.js
نووسراو ببینە
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460/** * Fuse.js v6.4.1 - Lightweight fuzzy-search (http://fusejs.io) * * Copyright (c) 2020 Kiro Risk (http://kiro.me) * All Rights Reserved. Apache Software License 2.0 * * http://www.apache.org/licenses/LICENSE-2.0 */
(function (global, factory) { typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() : typeof define === 'function' && define.amd ? define(factory) : (global = global || self, global.Fuse = factory());}(this, (function () { 'use strict';
function _typeof(obj) { "@babel/helpers - typeof";
if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function (obj) { return typeof obj; }; } else { _typeof = function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; }
return _typeof(obj); }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }
function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; }
return obj; }
function ownKeys(object, enumerableOnly) { var keys = Object.keys(object);
if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); }
return keys; }
function _objectSpread2(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {};
if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } }
return target; }
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && Symbol.iterator in Object(iter)) return Array.from(iter); }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length;
for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
return arr2; }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function isArray(value) { return !Array.isArray ? getTag(value) === '[object Array]' : Array.isArray(value); } // Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js
var INFINITY = 1 / 0; function baseToString(value) { // Exit early for strings to avoid a performance hit in some environments. if (typeof value == 'string') { return value; }
var result = value + ''; return result == '0' && 1 / value == -INFINITY ? '-0' : result; } function toString(value) { return value == null ? '' : baseToString(value); } function isString(value) { return typeof value === 'string'; } function isNumber(value) { return typeof value === 'number'; } // Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js
function isBoolean(value) { return value === true || value === false || isObjectLike(value) && getTag(value) == '[object Boolean]'; } function isObject(value) { return _typeof(value) === 'object'; } // Checks if `value` is object-like.
function isObjectLike(value) { return isObject(value) && value !== null; } function isDefined(value) { return value !== undefined && value !== null; } function isBlank(value) { return !value.trim().length; } // Gets the `toStringTag` of `value`. // Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js
function getTag(value) { return value == null ? value === undefined ? '[object Undefined]' : '[object Null]' : Object.prototype.toString.call(value); }
var EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available'; var LOGICAL_SEARCH_UNAVAILABLE = 'Logical search is not available'; var INCORRECT_INDEX_TYPE = "Incorrect 'index' type"; var LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = function LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key) { return "Invalid value for key ".concat(key); }; var PATTERN_LENGTH_TOO_LARGE = function PATTERN_LENGTH_TOO_LARGE(max) { return "Pattern length exceeds max of ".concat(max, "."); }; var MISSING_KEY_PROPERTY = function MISSING_KEY_PROPERTY(name) { return "Missing ".concat(name, " property in key"); }; var INVALID_KEY_WEIGHT_VALUE = function INVALID_KEY_WEIGHT_VALUE(key) { return "Property 'weight' in key '".concat(key, "' must be a positive integer"); };
var hasOwn = Object.prototype.hasOwnProperty;
var KeyStore = /*#__PURE__*/function () { function KeyStore(keys) { var _this = this;
_classCallCheck(this, KeyStore);
this._keys = []; this._keyMap = {}; var totalWeight = 0; keys.forEach(function (key) { var obj = createKey(key); totalWeight += obj.weight;
_this._keys.push(obj);
_this._keyMap[obj.id] = obj; totalWeight += obj.weight; }); // Normalize weights so that their sum is equal to 1
this._keys.forEach(function (key) { key.weight /= totalWeight; }); }
_createClass(KeyStore, [{ key: "get", value: function get(keyId) { return this._keyMap[keyId]; } }, { key: "keys", value: function keys() { return this._keys; } }, { key: "toJSON", value: function toJSON() { return JSON.stringify(this._keys); } }]);
return KeyStore; }(); function createKey(key) { var path = null; var id = null; var src = null; var weight = 1;
if (isString(key) || isArray(key)) { src = key; path = createKeyPath(key); id = createKeyId(key); } else { if (!hasOwn.call(key, 'name')) { throw new Error(MISSING_KEY_PROPERTY('name')); }
var name = key.name; src = name;
if (hasOwn.call(key, 'weight')) { weight = key.weight;
if (weight <= 0) { throw new Error(INVALID_KEY_WEIGHT_VALUE(name)); } }
path = createKeyPath(name); id = createKeyId(name); }
return { path: path, id: id, weight: weight, src: src }; } function createKeyPath(key) { return isArray(key) ? key : key.split('.'); } function createKeyId(key) { return isArray(key) ? key.join('.') : key; }
function get(obj, path) { var list = []; var arr = false;
var deepGet = function deepGet(obj, path, index) { if (!path[index]) { // If there's no path left, we've arrived at the object we care about. list.push(obj); } else { var key = path[index]; var value = obj[key];
if (!isDefined(value)) { return; } // If we're at the last value in the path, and if it's a string/number/bool, // add it to the list
if (index === path.length - 1 && (isString(value) || isNumber(value) || isBoolean(value))) { list.push(toString(value)); } else if (isArray(value)) { arr = true; // Search each item in the array.
for (var i = 0, len = value.length; i < len; i += 1) { deepGet(value[i], path, index + 1); } } else if (path.length) { // An object. Recurse further. deepGet(value, path, index + 1); } } }; // Backwards compatibility (since path used to be a string)
deepGet(obj, isString(path) ? path.split('.') : path, 0); return arr ? list : list[0]; }
var MatchOptions = { // Whether the matches should be included in the result set. When `true`, each record in the result // set will include the indices of the matched characters. // These can consequently be used for highlighting purposes. includeMatches: false, // When `true`, the matching function will continue to the end of a search pattern even if // a perfect match has already been located in the string. findAllMatches: false, // Minimum number of characters that must be matched before a result is considered a match minMatchCharLength: 1 }; var BasicOptions = { // When `true`, the algorithm continues searching to the end of the input even if a perfect // match is found before the end of the same input. isCaseSensitive: false, // When true, the matching function will continue to the end of a search pattern even if includeScore: false, // List of properties that will be searched. This also supports nested properties. keys: [], // Whether to sort the result list, by score shouldSort: true, // Default sort function: sort by ascending score, ascending index sortFn: function sortFn(a, b) { return a.score === b.score ? a.idx < b.idx ? -1 : 1 : a.score < b.score ? -1 : 1; } }; var FuzzyOptions = { // Approximately where in the text is the pattern expected to be found? location: 0, // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match // (of both letters and location), a threshold of '1.0' would match anything. threshold: 0.6, // Determines how close the match must be to the fuzzy location (specified above). // An exact letter match which is 'distance' characters away from the fuzzy location // would score as a complete mismatch. A distance of '0' requires the match be at // the exact location specified, a threshold of '1000' would require a perfect match // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold. distance: 100 }; var AdvancedOptions = { // When `true`, it enables the use of unix-like search commands useExtendedSearch: false, // The get function to use when fetching an object's properties. // The default will search nested paths *ie foo.bar.baz* getFn: get, // When `true`, search will ignore `location` and `distance`, so it won't matter // where in the string the pattern appears. // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score ignoreLocation: false, // When `true`, the calculation for the relevance score (used for sorting) will // ignore the field-length norm. // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm ignoreFieldNorm: false }; var Config = _objectSpread2({}, BasicOptions, {}, MatchOptions, {}, FuzzyOptions, {}, AdvancedOptions);
var SPACE = /[^ ]+/g; // Field-length norm: the shorter the field, the higher the weight. // Set to 3 decimals to reduce index size.
function norm() { var mantissa = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 3; var cache = new Map(); return { get: function get(value) { var numTokens = value.match(SPACE).length;
if (cache.has(numTokens)) { return cache.get(numTokens); }
var n = parseFloat((1 / Math.sqrt(numTokens)).toFixed(mantissa)); cache.set(numTokens, n); return n; }, clear: function clear() { cache.clear(); } }; }
var FuseIndex = /*#__PURE__*/function () { function FuseIndex() { var _ref = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}, _ref$getFn = _ref.getFn, getFn = _ref$getFn === void 0 ? Config.getFn : _ref$getFn;
_classCallCheck(this, FuseIndex);
this.norm = norm(3); this.getFn = getFn; this.isCreated = false; this.setIndexRecords(); }
_createClass(FuseIndex, [{ key: "setSources", value: function setSources() { var docs = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; this.docs = docs; } }, { key: "setIndexRecords", value: function setIndexRecords() { var records = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; this.records = records; } }, { key: "setKeys", value: function setKeys() { var _this = this;
var keys = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; this.keys = keys; this._keysMap = {}; keys.forEach(function (key, idx) { _this._keysMap[key.id] = idx; }); } }, { key: "create", value: function create() { var _this2 = this;
if (this.isCreated || !this.docs.length) { return; }
this.isCreated = true; // List is Array<String>
if (isString(this.docs[0])) { this.docs.forEach(function (doc, docIndex) { _this2._addString(doc, docIndex); }); } else { // List is Array<Object> this.docs.forEach(function (doc, docIndex) { _this2._addObject(doc, docIndex); }); }
this.norm.clear(); } // Adds a doc to the end of the index
}, { key: "add", value: function add(doc) { var idx = this.size();
if (isString(doc)) { this._addString(doc, idx); } else { this._addObject(doc, idx); } } // Removes the doc at the specified index of the index
}, { key: "removeAt", value: function removeAt(idx) { this.records.splice(idx, 1); // Change ref index of every subsquent doc
for (var i = idx, len = this.size(); i < len; i += 1) { this.records[i].i -= 1; } } }, { key: "getValueForItemAtKeyId", value: function getValueForItemAtKeyId(item, keyId) { return item[this._keysMap[keyId]]; } }, { key: "size", value: function size() { return this.records.length; } }, { key: "_addString", value: function _addString(doc, docIndex) { if (!isDefined(doc) || isBlank(doc)) { return; }
var record = { v: doc, i: docIndex, n: this.norm.get(doc) }; this.records.push(record); } }, { key: "_addObject", value: function _addObject(doc, docIndex) { var _this3 = this;
var record = { i: docIndex, $: {} }; // Iterate over every key (i.e, path), and fetch the value at that key
this.keys.forEach(function (key, keyIndex) { // console.log(key) var value = _this3.getFn(doc, key.path);
if (!isDefined(value)) { return; }
if (isArray(value)) { (function () { var subRecords = []; var stack = [{ nestedArrIndex: -1, value: value }];
while (stack.length) { var _stack$pop = stack.pop(), nestedArrIndex = _stack$pop.nestedArrIndex, _value = _stack$pop.value;
if (!isDefined(_value)) { continue; }
if (isString(_value) && !isBlank(_value)) { var subRecord = { v: _value, i: nestedArrIndex, n: _this3.norm.get(_value) }; subRecords.push(subRecord); } else if (isArray(_value)) { _value.forEach(function (item, k) { stack.push({ nestedArrIndex: k, value: item }); }); } }
record.$[keyIndex] = subRecords; })(); } else if (!isBlank(value)) { var subRecord = { v: value, n: _this3.norm.get(value) }; record.$[keyIndex] = subRecord; } }); this.records.push(record); } }, { key: "toJSON", value: function toJSON() { return { keys: this.keys, records: this.records }; } }]);
return FuseIndex; }(); function createIndex(keys, docs) { var _ref2 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {}, _ref2$getFn = _ref2.getFn, getFn = _ref2$getFn === void 0 ? Config.getFn : _ref2$getFn;
var myIndex = new FuseIndex({ getFn: getFn }); myIndex.setKeys(keys.map(createKey)); myIndex.setSources(docs); myIndex.create(); return myIndex; } function parseIndex(data) { var _ref3 = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}, _ref3$getFn = _ref3.getFn, getFn = _ref3$getFn === void 0 ? Config.getFn : _ref3$getFn;
var keys = data.keys, records = data.records; var myIndex = new FuseIndex({ getFn: getFn }); myIndex.setKeys(keys); myIndex.setIndexRecords(records); return myIndex; }
function transformMatches(result, data) { var matches = result.matches; data.matches = [];
if (!isDefined(matches)) { return; }
matches.forEach(function (match) { if (!isDefined(match.indices) || !match.indices.length) { return; }
var indices = match.indices, value = match.value; var obj = { indices: indices, value: value };
if (match.key) { obj.key = match.key.src; }
if (match.idx > -1) { obj.refIndex = match.idx; }
data.matches.push(obj); }); }
function transformScore(result, data) { data.score = result.score; }
function computeScore(pattern) { var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}, _ref$errors = _ref.errors, errors = _ref$errors === void 0 ? 0 : _ref$errors, _ref$currentLocation = _ref.currentLocation, currentLocation = _ref$currentLocation === void 0 ? 0 : _ref$currentLocation, _ref$expectedLocation = _ref.expectedLocation, expectedLocation = _ref$expectedLocation === void 0 ? 0 : _ref$expectedLocation, _ref$distance = _ref.distance, distance = _ref$distance === void 0 ? Config.distance : _ref$distance, _ref$ignoreLocation = _ref.ignoreLocation, ignoreLocation = _ref$ignoreLocation === void 0 ? Config.ignoreLocation : _ref$ignoreLocation;
var accuracy = errors / pattern.length;
if (ignoreLocation) { return accuracy; }
var proximity = Math.abs(expectedLocation - currentLocation);
if (!distance) { // Dodge divide by zero error. return proximity ? 1.0 : accuracy; }
return accuracy + proximity / distance; }
function convertMaskToIndices() { var matchmask = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; var minMatchCharLength = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Config.minMatchCharLength; var indices = []; var start = -1; var end = -1; var i = 0;
for (var len = matchmask.length; i < len; i += 1) { var match = matchmask[i];
if (match && start === -1) { start = i; } else if (!match && start !== -1) { end = i - 1;
if (end - start + 1 >= minMatchCharLength) { indices.push([start, end]); }
start = -1; } } // (i-1 - start) + 1 => i - start
if (matchmask[i - 1] && i - start >= minMatchCharLength) { indices.push([start, i - 1]); }
return indices; }
// Machine word size var MAX_BITS = 32;
function search(text, pattern, patternAlphabet) { var _ref = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {}, _ref$location = _ref.location, location = _ref$location === void 0 ? Config.location : _ref$location, _ref$distance = _ref.distance, distance = _ref$distance === void 0 ? Config.distance : _ref$distance, _ref$threshold = _ref.threshold, threshold = _ref$threshold === void 0 ? Config.threshold : _ref$threshold, _ref$findAllMatches = _ref.findAllMatches, findAllMatches = _ref$findAllMatches === void 0 ? Config.findAllMatches : _ref$findAllMatches, _ref$minMatchCharLeng = _ref.minMatchCharLength, minMatchCharLength = _ref$minMatchCharLeng === void 0 ? Config.minMatchCharLength : _ref$minMatchCharLeng, _ref$includeMatches = _ref.includeMatches, includeMatches = _ref$includeMatches === void 0 ? Config.includeMatches : _ref$includeMatches, _ref$ignoreLocation = _ref.ignoreLocation, ignoreLocation = _ref$ignoreLocation === void 0 ? Config.ignoreLocation : _ref$ignoreLocation;
if (pattern.length > MAX_BITS) { throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS)); }
var patternLen = pattern.length; // Set starting location at beginning text and initialize the alphabet.
var textLen = text.length; // Handle the case when location > text.length
var expectedLocation = Math.max(0, Math.min(location, textLen)); // Highest score beyond which we give up.
var currentThreshold = threshold; // Is there a nearby exact match? (speedup)
var bestLocation = expectedLocation; // Performance: only computer matches when the minMatchCharLength > 1 // OR if `includeMatches` is true.
var computeMatches = minMatchCharLength > 1 || includeMatches; // A mask of the matches, used for building the indices
var matchMask = computeMatches ? Array(textLen) : []; var index; // Get all exact matches, here for speed up
while ((index = text.indexOf(pattern, bestLocation)) > -1) { var score = computeScore(pattern, { currentLocation: index, expectedLocation: expectedLocation, distance: distance, ignoreLocation: ignoreLocation }); currentThreshold = Math.min(score, currentThreshold); bestLocation = index + patternLen;
if (computeMatches) { var i = 0;
while (i < patternLen) { matchMask[index + i] = 1; i += 1; } } } // Reset the best location
bestLocation = -1; var lastBitArr = []; var finalScore = 1; var binMax = patternLen + textLen; var mask = 1 << patternLen - 1;
for (var _i = 0; _i < patternLen; _i += 1) { // Scan for the best match; each iteration allows for one more error. // Run a binary search to determine how far from the match location we can stray // at this error level. var binMin = 0; var binMid = binMax;
while (binMin < binMid) { var _score2 = computeScore(pattern, { errors: _i, currentLocation: expectedLocation + binMid, expectedLocation: expectedLocation, distance: distance, ignoreLocation: ignoreLocation });
if (_score2 <= currentThreshold) { binMin = binMid; } else { binMax = binMid; }
binMid = Math.floor((binMax - binMin) / 2 + binMin); } // Use the result from this iteration as the maximum for the next.
binMax = binMid; var start = Math.max(1, expectedLocation - binMid + 1); var finish = findAllMatches ? textLen : Math.min(expectedLocation + binMid, textLen) + patternLen; // Initialize the bit array
var bitArr = Array(finish + 2); bitArr[finish + 1] = (1 << _i) - 1;
for (var j = finish; j >= start; j -= 1) { var currentLocation = j - 1; var charMatch = patternAlphabet[text.charAt(currentLocation)];
if (computeMatches) { // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`) matchMask[currentLocation] = +!!charMatch; } // First pass: exact match
bitArr[j] = (bitArr[j + 1] << 1 | 1) & charMatch; // Subsequent passes: fuzzy match
if (_i) { bitArr[j] |= (lastBitArr[j + 1] | lastBitArr[j]) << 1 | 1 | lastBitArr[j + 1]; }
if (bitArr[j] & mask) { finalScore = computeScore(pattern, { errors: _i, currentLocation: currentLocation, expectedLocation: expectedLocation, distance: distance, ignoreLocation: ignoreLocation }); // This match will almost certainly be better than any existing match. // But check anyway.
if (finalScore <= currentThreshold) { // Indeed it is currentThreshold = finalScore; bestLocation = currentLocation; // Already passed `loc`, downhill from here on in.
if (bestLocation <= expectedLocation) { break; } // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.
start = Math.max(1, 2 * expectedLocation - bestLocation); } } } // No hope for a (better) match at greater error levels.
var _score = computeScore(pattern, { errors: _i + 1, currentLocation: expectedLocation, expectedLocation: expectedLocation, distance: distance, ignoreLocation: ignoreLocation });
if (_score > currentThreshold) { break; }
lastBitArr = bitArr; }
var result = { isMatch: bestLocation >= 0, // Count exact matches (those with a score of 0) to be "almost" exact score: Math.max(0.001, finalScore) };
if (computeMatches) { var indices = convertMaskToIndices(matchMask, minMatchCharLength);
if (!indices.length) { result.isMatch = false; } else if (includeMatches) { result.indices = indices; } }
return result; }
function createPatternAlphabet(pattern) { var mask = {};
for (var i = 0, len = pattern.length; i < len; i += 1) { var char = pattern.charAt(i); mask[char] = (mask[char] || 0) | 1 << len - i - 1; }
return mask; }
var BitapSearch = /*#__PURE__*/function () { function BitapSearch(pattern) { var _this = this;
var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}, _ref$location = _ref.location, location = _ref$location === void 0 ? Config.location : _ref$location, _ref$threshold = _ref.threshold, threshold = _ref$threshold === void 0 ? Config.threshold : _ref$threshold, _ref$distance = _ref.distance, distance = _ref$distance === void 0 ? Config.distance : _ref$distance, _ref$includeMatches = _ref.includeMatches, includeMatches = _ref$includeMatches === void 0 ? Config.includeMatches : _ref$includeMatches, _ref$findAllMatches = _ref.findAllMatches, findAllMatches = _ref$findAllMatches === void 0 ? Config.findAllMatches : _ref$findAllMatches, _ref$minMatchCharLeng = _ref.minMatchCharLength, minMatchCharLength = _ref$minMatchCharLeng === void 0 ? Config.minMatchCharLength : _ref$minMatchCharLeng, _ref$isCaseSensitive = _ref.isCaseSensitive, isCaseSensitive = _ref$isCaseSensitive === void 0 ? Config.isCaseSensitive : _ref$isCaseSensitive, _ref$ignoreLocation = _ref.ignoreLocation, ignoreLocation = _ref$ignoreLocation === void 0 ? Config.ignoreLocation : _ref$ignoreLocation;
_classCallCheck(this, BitapSearch);
this.options = { location: location, threshold: threshold, distance: distance, includeMatches: includeMatches, findAllMatches: findAllMatches, minMatchCharLength: minMatchCharLength, isCaseSensitive: isCaseSensitive, ignoreLocation: ignoreLocation }; this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase(); this.chunks = [];
if (!this.pattern.length) { return; }
var addChunk = function addChunk(pattern, startIndex) { _this.chunks.push({ pattern: pattern, alphabet: createPatternAlphabet(pattern), startIndex: startIndex }); };
var len = this.pattern.length;
if (len > MAX_BITS) { var i = 0; var remainder = len % MAX_BITS; var end = len - remainder;
while (i < end) { addChunk(this.pattern.substr(i, MAX_BITS), i); i += MAX_BITS; }
if (remainder) { var startIndex = len - MAX_BITS; addChunk(this.pattern.substr(startIndex), startIndex); } } else { addChunk(this.pattern, 0); } }
_createClass(BitapSearch, [{ key: "searchIn", value: function searchIn(text) { var _this$options = this.options, isCaseSensitive = _this$options.isCaseSensitive, includeMatches = _this$options.includeMatches;
if (!isCaseSensitive) { text = text.toLowerCase(); } // Exact match
if (this.pattern === text) { var _result = { isMatch: true, score: 0 };
if (includeMatches) { _result.indices = [[0, text.length - 1]]; }
return _result; } // Otherwise, use Bitap algorithm
var _this$options2 = this.options, location = _this$options2.location, distance = _this$options2.distance, threshold = _this$options2.threshold, findAllMatches = _this$options2.findAllMatches, minMatchCharLength = _this$options2.minMatchCharLength, ignoreLocation = _this$options2.ignoreLocation; var allIndices = []; var totalScore = 0; var hasMatches = false; this.chunks.forEach(function (_ref2) { var pattern = _ref2.pattern, alphabet = _ref2.alphabet, startIndex = _ref2.startIndex;
var _search = search(text, pattern, alphabet, { location: location + startIndex, distance: distance, threshold: threshold, findAllMatches: findAllMatches, minMatchCharLength: minMatchCharLength, includeMatches: includeMatches, ignoreLocation: ignoreLocation }), isMatch = _search.isMatch, score = _search.score, indices = _search.indices;
if (isMatch) { hasMatches = true; }
totalScore += score;
if (isMatch && indices) { allIndices = [].concat(_toConsumableArray(allIndices), _toConsumableArray(indices)); } }); var result = { isMatch: hasMatches, score: hasMatches ? totalScore / this.chunks.length : 1 };
if (hasMatches && includeMatches) { result.indices = allIndices; }
return result; } }]);
return BitapSearch; }();
var registeredSearchers = []; function createSearcher(pattern, options) { for (var i = 0, len = registeredSearchers.length; i < len; i += 1) { var searcherClass = registeredSearchers[i];
if (searcherClass.condition(pattern, options)) { return new searcherClass(pattern, options); } }
return new BitapSearch(pattern, options); }
var LogicalOperator = { AND: '$and', OR: '$or' }; var KeyType = { PATH: '$path', PATTERN: '$val' };
var isExpression = function isExpression(query) { return !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]); };
var isPath = function isPath(query) { return !!query[KeyType.PATH]; };
var isLeaf = function isLeaf(query) { return !isArray(query) && isObject(query) && !isExpression(query); };
var convertToExplicit = function convertToExplicit(query) { return _defineProperty({}, LogicalOperator.AND, Object.keys(query).map(function (key) { return _defineProperty({}, key, query[key]); })); }; // When `auto` is `true`, the parse function will infer and initialize and add // the appropriate `Searcher` instance
function parse(query, options) { var _ref3 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {}, _ref3$auto = _ref3.auto, auto = _ref3$auto === void 0 ? true : _ref3$auto;
var next = function next(query) { var keys = Object.keys(query); var isQueryPath = isPath(query);
if (!isQueryPath && keys.length > 1 && !isExpression(query)) { return next(convertToExplicit(query)); }
if (isLeaf(query)) { var key = isQueryPath ? query[KeyType.PATH] : keys[0]; var pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];
if (!isString(pattern)) { throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key)); }
var obj = { keyId: createKeyId(key), pattern: pattern };
if (auto) { obj.searcher = createSearcher(pattern, options); }
return obj; }
var node = { children: [], operator: keys[0] }; keys.forEach(function (key) { var value = query[key];
if (isArray(value)) { value.forEach(function (item) { node.children.push(next(item)); }); } }); return node; };
if (!isExpression(query)) { query = convertToExplicit(query); }
return next(query); }
var Fuse = /*#__PURE__*/function () { function Fuse(docs) { var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}; var index = arguments.length > 2 ? arguments[2] : undefined;
_classCallCheck(this, Fuse);
this.options = _objectSpread2({}, Config, {}, options);
if (this.options.useExtendedSearch && !false) { throw new Error(EXTENDED_SEARCH_UNAVAILABLE); }
this._keyStore = new KeyStore(this.options.keys); this.setCollection(docs, index); }
_createClass(Fuse, [{ key: "setCollection", value: function setCollection(docs, index) { this._docs = docs;
if (index && !(index instanceof FuseIndex)) { throw new Error(INCORRECT_INDEX_TYPE); }
this._myIndex = index || createIndex(this.options.keys, this._docs, { getFn: this.options.getFn }); } }, { key: "add", value: function add(doc) { if (!isDefined(doc)) { return; }
this._docs.push(doc);
this._myIndex.add(doc); } }, { key: "remove", value: function remove() { var predicate = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : function () { return ( /* doc, idx */ false ); }; var results = [];
for (var i = 0, len = this._docs.length; i < len; i += 1) { var doc = this._docs[i];
if (predicate(doc, i)) { this.removeAt(i); i -= 1; results.push(doc); } }
return results; } }, { key: "removeAt", value: function removeAt(idx) { this._docs.splice(idx, 1);
this._myIndex.removeAt(idx); } }, { key: "getIndex", value: function getIndex() { return this._myIndex; } }, { key: "search", value: function search(query) { var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {}, _ref$limit = _ref.limit, limit = _ref$limit === void 0 ? -1 : _ref$limit;
var _this$options = this.options, includeMatches = _this$options.includeMatches, includeScore = _this$options.includeScore, shouldSort = _this$options.shouldSort, sortFn = _this$options.sortFn, ignoreFieldNorm = _this$options.ignoreFieldNorm; var results = isString(query) ? isString(this._docs[0]) ? this._searchStringList(query) : this._searchObjectList(query) : this._searchLogical(query); computeScore$1(results, { ignoreFieldNorm: ignoreFieldNorm });
if (shouldSort) { results.sort(sortFn); }
if (isNumber(limit) && limit > -1) { results = results.slice(0, limit); }
return format(results, this._docs, { includeMatches: includeMatches, includeScore: includeScore }); } }, { key: "_searchStringList", value: function _searchStringList(query) { var searcher = createSearcher(query, this.options); var records = this._myIndex.records; var results = []; // Iterate over every string in the index
records.forEach(function (_ref2) { var text = _ref2.v, idx = _ref2.i, norm = _ref2.n;
if (!isDefined(text)) { return; }
var _searcher$searchIn = searcher.searchIn(text), isMatch = _searcher$searchIn.isMatch, score = _searcher$searchIn.score, indices = _searcher$searchIn.indices;
if (isMatch) { results.push({ item: text, idx: idx, matches: [{ score: score, value: text, norm: norm, indices: indices }] }); } }); return results; } }, { key: "_searchLogical", value: function _searchLogical(query) {
{ throw new Error(LOGICAL_SEARCH_UNAVAILABLE); } } }, { key: "_searchObjectList", value: function _searchObjectList(query) { var _this2 = this;
var searcher = createSearcher(query, this.options); var _this$_myIndex = this._myIndex, keys = _this$_myIndex.keys, records = _this$_myIndex.records; var results = []; // List is Array<Object>
records.forEach(function (_ref5) { var item = _ref5.$, idx = _ref5.i;
if (!isDefined(item)) { return; }
var matches = []; // Iterate over every key (i.e, path), and fetch the value at that key
keys.forEach(function (key, keyIndex) { matches.push.apply(matches, _toConsumableArray(_this2._findMatches({ key: key, value: item[keyIndex], searcher: searcher }))); });
if (matches.length) { results.push({ idx: idx, item: item, matches: matches }); } }); return results; } }, { key: "_findMatches", value: function _findMatches(_ref6) { var key = _ref6.key, value = _ref6.value, searcher = _ref6.searcher;
if (!isDefined(value)) { return []; }
var matches = [];
if (isArray(value)) { value.forEach(function (_ref7) { var text = _ref7.v, idx = _ref7.i, norm = _ref7.n;
if (!isDefined(text)) { return; }
var _searcher$searchIn2 = searcher.searchIn(text), isMatch = _searcher$searchIn2.isMatch, score = _searcher$searchIn2.score, indices = _searcher$searchIn2.indices;
if (isMatch) { matches.push({ score: score, key: key, value: text, idx: idx, norm: norm, indices: indices }); } }); } else { var text = value.v, norm = value.n;
var _searcher$searchIn3 = searcher.searchIn(text), isMatch = _searcher$searchIn3.isMatch, score = _searcher$searchIn3.score, indices = _searcher$searchIn3.indices;
if (isMatch) { matches.push({ score: score, key: key, value: text, norm: norm, indices: indices }); } }
return matches; } }]);
return Fuse; }(); // Practical scoring function
function computeScore$1(results, _ref8) { var _ref8$ignoreFieldNorm = _ref8.ignoreFieldNorm, ignoreFieldNorm = _ref8$ignoreFieldNorm === void 0 ? Config.ignoreFieldNorm : _ref8$ignoreFieldNorm; results.forEach(function (result) { var totalScore = 1; result.matches.forEach(function (_ref9) { var key = _ref9.key, norm = _ref9.norm, score = _ref9.score; var weight = key ? key.weight : null; totalScore *= Math.pow(score === 0 && weight ? Number.EPSILON : score, (weight || 1) * (ignoreFieldNorm ? 1 : norm)); }); result.score = totalScore; }); }
function format(results, docs) { var _ref10 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {}, _ref10$includeMatches = _ref10.includeMatches, includeMatches = _ref10$includeMatches === void 0 ? Config.includeMatches : _ref10$includeMatches, _ref10$includeScore = _ref10.includeScore, includeScore = _ref10$includeScore === void 0 ? Config.includeScore : _ref10$includeScore;
var transformers = []; if (includeMatches) transformers.push(transformMatches); if (includeScore) transformers.push(transformScore); return results.map(function (result) { var idx = result.idx; var data = { item: docs[idx], refIndex: idx };
if (transformers.length) { transformers.forEach(function (transformer) { transformer(result, data); }); }
return data; }); }
Fuse.version = '6.4.1'; Fuse.createIndex = createIndex; Fuse.parseIndex = parseIndex; Fuse.config = Config;
{ Fuse.parseQuery = parse; }
return Fuse;
})));
fuse
Version Info
3 years ago
