Dan V
deb6c38d7b
- Add .gitignore: exclude compiled binaries, build artifacts, and Helm values files containing real secrets (authentik, prometheus) - Add all Kubernetes deployment manifests (deployment/) - Add services source code: ha-sync, device-inventory, games-console, paperclip, parts-inventory - Add Ansible orchestration: playbooks, roles, inventory, cloud-init - Add hardware specs, execution plans, scripts, HOMELAB.md - Add skills/homelab/SKILL.md + skills/install.sh to preserve Copilot skill - Remove previously-tracked inventory-cli binary from git index Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
1494 lines
49 KiB
JavaScript
1494 lines
49 KiB
JavaScript
/**
|
|
* Fuse.js v7.2.0 - Lightweight fuzzy-search (http://fusejs.io)
|
|
*
|
|
* Copyright (c) 2026 Kiro Risk (http://kiro.me)
|
|
* All Rights Reserved. Apache Software License 2.0
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*/
|
|
|
|
'use strict';
|
|
|
|
function ownKeys(object, enumerableOnly) {
|
|
var keys = Object.keys(object);
|
|
if (Object.getOwnPropertySymbols) {
|
|
var symbols = Object.getOwnPropertySymbols(object);
|
|
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 = null != arguments[i] ? arguments[i] : {};
|
|
i % 2 ? ownKeys(Object(source), !0).forEach(function (key) {
|
|
_defineProperty(target, key, source[key]);
|
|
}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) {
|
|
Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));
|
|
});
|
|
}
|
|
return target;
|
|
}
|
|
function _typeof(obj) {
|
|
"@babel/helpers - typeof";
|
|
|
|
return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
|
|
return typeof obj;
|
|
} : function (obj) {
|
|
return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
|
|
}, _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, _toPropertyKey(descriptor.key), descriptor);
|
|
}
|
|
}
|
|
function _createClass(Constructor, protoProps, staticProps) {
|
|
if (protoProps) _defineProperties(Constructor.prototype, protoProps);
|
|
if (staticProps) _defineProperties(Constructor, staticProps);
|
|
Object.defineProperty(Constructor, "prototype", {
|
|
writable: false
|
|
});
|
|
return Constructor;
|
|
}
|
|
function _defineProperty(obj, key, value) {
|
|
key = _toPropertyKey(key);
|
|
if (key in obj) {
|
|
Object.defineProperty(obj, key, {
|
|
value: value,
|
|
enumerable: true,
|
|
configurable: true,
|
|
writable: true
|
|
});
|
|
} else {
|
|
obj[key] = value;
|
|
}
|
|
return obj;
|
|
}
|
|
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" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) 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 _toPrimitive(input, hint) {
|
|
if (typeof input !== "object" || input === null) return input;
|
|
var prim = input[Symbol.toPrimitive];
|
|
if (prim !== undefined) {
|
|
var res = prim.call(input, hint || "default");
|
|
if (typeof res !== "object") return res;
|
|
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
}
|
|
return (hint === "string" ? String : Number)(input);
|
|
}
|
|
function _toPropertyKey(arg) {
|
|
var key = _toPrimitive(arg, "string");
|
|
return typeof key === "symbol" ? key : String(key);
|
|
}
|
|
|
|
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);
|
|
_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;
|
|
var getFn = null;
|
|
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);
|
|
getFn = key.getFn;
|
|
}
|
|
return {
|
|
path: path,
|
|
id: id,
|
|
weight: weight,
|
|
src: src,
|
|
getFn: getFn
|
|
};
|
|
}
|
|
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, arrayIndex) {
|
|
if (!isDefined(obj)) {
|
|
return;
|
|
}
|
|
if (!path[index]) {
|
|
// If there's no path left, we've arrived at the object we care about.
|
|
list.push(arrayIndex !== undefined ? {
|
|
v: obj,
|
|
i: arrayIndex
|
|
} : 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(arrayIndex !== undefined ? {
|
|
v: toString(value),
|
|
i: arrayIndex
|
|
} : 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, i);
|
|
}
|
|
} else if (path.length) {
|
|
// An object. Recurse further.
|
|
deepGet(value, path, index + 1, arrayIndex);
|
|
}
|
|
}
|
|
};
|
|
|
|
// 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 algorithm will ignore diacritics (accents) in comparisons
|
|
ignoreDiacritics: 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,
|
|
// The weight to determine how much field length norm effects scoring.
|
|
fieldNormWeight: 1
|
|
};
|
|
var Config = _objectSpread2(_objectSpread2(_objectSpread2(_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 weight = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 1;
|
|
var mantissa = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;
|
|
var cache = new Map();
|
|
var m = Math.pow(10, mantissa);
|
|
return {
|
|
get: function get(value) {
|
|
var numTokens = value.match(SPACE).length;
|
|
if (cache.has(numTokens)) {
|
|
return cache.get(numTokens);
|
|
}
|
|
|
|
// Default function is 1/sqrt(x), weight makes that variable
|
|
var norm = 1 / Math.pow(numTokens, 0.5 * weight);
|
|
|
|
// In place of `toFixed(mantissa)`, for faster computation
|
|
var n = parseFloat(Math.round(norm * m) / m);
|
|
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,
|
|
_ref$fieldNormWeight = _ref.fieldNormWeight,
|
|
fieldNormWeight = _ref$fieldNormWeight === void 0 ? Config.fieldNormWeight : _ref$fieldNormWeight;
|
|
_classCallCheck(this, FuseIndex);
|
|
this.norm = norm(fieldNormWeight, 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;
|
|
}
|
|
}
|
|
// Removes docs at the specified indices (must be sorted ascending)
|
|
}, {
|
|
key: "removeAll",
|
|
value: function removeAll(indices) {
|
|
// Remove in reverse order to avoid index shifting during splice
|
|
for (var i = indices.length - 1; i >= 0; i -= 1) {
|
|
this.records.splice(indices[i], 1);
|
|
}
|
|
// Single re-index pass
|
|
for (var _i = 0, len = this.records.length; _i < len; _i += 1) {
|
|
this.records[_i].i = _i;
|
|
}
|
|
}
|
|
}, {
|
|
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) {
|
|
var value = key.getFn ? key.getFn(doc) : _this3.getFn(doc, key.path);
|
|
if (!isDefined(value)) {
|
|
return;
|
|
}
|
|
if (isArray(value)) {
|
|
var subRecords = [];
|
|
for (var i = 0, len = value.length; i < len; i += 1) {
|
|
var item = value[i];
|
|
if (!isDefined(item)) {
|
|
continue;
|
|
}
|
|
if (isString(item)) {
|
|
// Custom getFn returning plain string array (backward compat)
|
|
if (!isBlank(item)) {
|
|
var subRecord = {
|
|
v: item,
|
|
i: i,
|
|
n: _this3.norm.get(item)
|
|
};
|
|
subRecords.push(subRecord);
|
|
}
|
|
} else if (isString(item.v) && !isBlank(item.v)) {
|
|
// Default get() returns {v, i} objects with original array indices
|
|
var _subRecord = {
|
|
v: item.v,
|
|
i: item.i,
|
|
n: _this3.norm.get(item.v)
|
|
};
|
|
subRecords.push(_subRecord);
|
|
}
|
|
}
|
|
record.$[keyIndex] = subRecords;
|
|
} else if (isString(value) && !isBlank(value)) {
|
|
var _subRecord2 = {
|
|
v: value,
|
|
n: _this3.norm.get(value)
|
|
};
|
|
record.$[keyIndex] = _subRecord2;
|
|
}
|
|
});
|
|
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,
|
|
_ref2$fieldNormWeight = _ref2.fieldNormWeight,
|
|
fieldNormWeight = _ref2$fieldNormWeight === void 0 ? Config.fieldNormWeight : _ref2$fieldNormWeight;
|
|
var myIndex = new FuseIndex({
|
|
getFn: getFn,
|
|
fieldNormWeight: fieldNormWeight
|
|
});
|
|
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,
|
|
_ref3$fieldNormWeight = _ref3.fieldNormWeight,
|
|
fieldNormWeight = _ref3$fieldNormWeight === void 0 ? Config.fieldNormWeight : _ref3$fieldNormWeight;
|
|
var keys = data.keys,
|
|
records = data.records;
|
|
var myIndex = new FuseIndex({
|
|
getFn: getFn,
|
|
fieldNormWeight: fieldNormWeight
|
|
});
|
|
myIndex.setKeys(keys);
|
|
myIndex.setIndexRecords(records);
|
|
return myIndex;
|
|
}
|
|
|
|
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;
|
|
|
|
// Inlined score computation — avoids object allocation per call in hot loops.
|
|
// See ./computeScore.js for the documented version of this formula.
|
|
var calcScore = function calcScore(errors, currentLocation) {
|
|
var accuracy = errors / patternLen;
|
|
if (ignoreLocation) return accuracy;
|
|
var proximity = Math.abs(expectedLocation - currentLocation);
|
|
if (!distance) return proximity ? 1.0 : accuracy;
|
|
return accuracy + proximity / distance;
|
|
};
|
|
|
|
// 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 = calcScore(0, index);
|
|
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 _score = calcScore(_i, expectedLocation + binMid);
|
|
if (_score <= 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[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 = calcScore(_i, currentLocation);
|
|
|
|
// 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 _score2 = calcScore(_i + 1, expectedLocation);
|
|
if (_score2 > 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 stripDiacritics = String.prototype.normalize ? function (str) {
|
|
return str.normalize('NFD').replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, '');
|
|
} : function (str) {
|
|
return str;
|
|
};
|
|
|
|
function mergeIndices(indices) {
|
|
if (indices.length <= 1) return indices;
|
|
indices.sort(function (a, b) {
|
|
return a[0] - b[0] || a[1] - b[1];
|
|
});
|
|
var merged = [indices[0]];
|
|
for (var i = 1, len = indices.length; i < len; i += 1) {
|
|
var last = merged[merged.length - 1];
|
|
var curr = indices[i];
|
|
if (curr[0] <= last[1] + 1) {
|
|
last[1] = Math.max(last[1], curr[1]);
|
|
} else {
|
|
merged.push(curr);
|
|
}
|
|
}
|
|
return merged;
|
|
}
|
|
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$ignoreDiacritics = _ref.ignoreDiacritics,
|
|
ignoreDiacritics = _ref$ignoreDiacritics === void 0 ? Config.ignoreDiacritics : _ref$ignoreDiacritics,
|
|
_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,
|
|
ignoreDiacritics: ignoreDiacritics,
|
|
ignoreLocation: ignoreLocation
|
|
};
|
|
pattern = isCaseSensitive ? pattern : pattern.toLowerCase();
|
|
pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;
|
|
this.pattern = pattern;
|
|
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,
|
|
ignoreDiacritics = _this$options.ignoreDiacritics,
|
|
includeMatches = _this$options.includeMatches;
|
|
text = isCaseSensitive ? text : text.toLowerCase();
|
|
text = ignoreDiacritics ? stripDiacritics(text) : text;
|
|
|
|
// 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.push.apply(allIndices, _toConsumableArray(indices));
|
|
}
|
|
});
|
|
var result = {
|
|
isMatch: hasMatches,
|
|
score: hasMatches ? totalScore / this.chunks.length : 1
|
|
};
|
|
if (hasMatches && includeMatches) {
|
|
result.indices = mergeIndices(allIndices);
|
|
}
|
|
return result;
|
|
}
|
|
}]);
|
|
return BitapSearch;
|
|
}();
|
|
|
|
var registeredSearchers = [];
|
|
function register() {
|
|
registeredSearchers.push.apply(registeredSearchers, arguments);
|
|
}
|
|
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);
|
|
}
|
|
|
|
function computeScoreSingle(result, _ref) {
|
|
var _ref$ignoreFieldNorm = _ref.ignoreFieldNorm,
|
|
ignoreFieldNorm = _ref$ignoreFieldNorm === void 0 ? Config.ignoreFieldNorm : _ref$ignoreFieldNorm;
|
|
var totalScore = 1;
|
|
result.matches.forEach(function (_ref2) {
|
|
var key = _ref2.key,
|
|
norm = _ref2.norm,
|
|
score = _ref2.score;
|
|
var weight = key ? key.weight : null;
|
|
totalScore *= Math.pow(score === 0 && weight ? Number.EPSILON : score, (weight || 1) * (ignoreFieldNorm ? 1 : norm));
|
|
});
|
|
result.score = totalScore;
|
|
}
|
|
|
|
// Practical scoring function
|
|
function computeScore(results, _ref3) {
|
|
var _ref3$ignoreFieldNorm = _ref3.ignoreFieldNorm,
|
|
ignoreFieldNorm = _ref3$ignoreFieldNorm === void 0 ? Config.ignoreFieldNorm : _ref3$ignoreFieldNorm;
|
|
results.forEach(function (result) {
|
|
computeScoreSingle(result, {
|
|
ignoreFieldNorm: ignoreFieldNorm
|
|
});
|
|
});
|
|
}
|
|
|
|
// Max-heap by score: keeps the worst (highest) score at the top
|
|
// so we can efficiently evict it when a better result arrives.
|
|
var MaxHeap = /*#__PURE__*/function () {
|
|
function MaxHeap(limit) {
|
|
_classCallCheck(this, MaxHeap);
|
|
this.limit = limit;
|
|
this.heap = [];
|
|
}
|
|
_createClass(MaxHeap, [{
|
|
key: "size",
|
|
get: function get() {
|
|
return this.heap.length;
|
|
}
|
|
}, {
|
|
key: "shouldInsert",
|
|
value: function shouldInsert(score) {
|
|
return this.size < this.limit || score < this.heap[0].score;
|
|
}
|
|
}, {
|
|
key: "insert",
|
|
value: function insert(item) {
|
|
if (this.size < this.limit) {
|
|
this.heap.push(item);
|
|
this._bubbleUp(this.size - 1);
|
|
} else if (item.score < this.heap[0].score) {
|
|
this.heap[0] = item;
|
|
this._sinkDown(0);
|
|
}
|
|
}
|
|
}, {
|
|
key: "extractSorted",
|
|
value: function extractSorted(sortFn) {
|
|
return this.heap.sort(sortFn);
|
|
}
|
|
}, {
|
|
key: "_bubbleUp",
|
|
value: function _bubbleUp(i) {
|
|
var heap = this.heap;
|
|
while (i > 0) {
|
|
var parent = i - 1 >> 1;
|
|
if (heap[i].score <= heap[parent].score) break;
|
|
var tmp = heap[i];
|
|
heap[i] = heap[parent];
|
|
heap[parent] = tmp;
|
|
i = parent;
|
|
}
|
|
}
|
|
}, {
|
|
key: "_sinkDown",
|
|
value: function _sinkDown(i) {
|
|
var heap = this.heap;
|
|
var len = heap.length;
|
|
var largest = i;
|
|
do {
|
|
i = largest;
|
|
var left = 2 * i + 1;
|
|
var right = 2 * i + 2;
|
|
if (left < len && heap[left].score > heap[largest].score) {
|
|
largest = left;
|
|
}
|
|
if (right < len && heap[right].score > heap[largest].score) {
|
|
largest = right;
|
|
}
|
|
if (largest !== i) {
|
|
var tmp = heap[i];
|
|
heap[i] = heap[largest];
|
|
heap[largest] = tmp;
|
|
}
|
|
} while (largest !== i);
|
|
}
|
|
}]);
|
|
return MaxHeap;
|
|
}();
|
|
|
|
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 format(results, docs) {
|
|
var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},
|
|
_ref$includeMatches = _ref.includeMatches,
|
|
includeMatches = _ref$includeMatches === void 0 ? Config.includeMatches : _ref$includeMatches,
|
|
_ref$includeScore = _ref.includeScore,
|
|
includeScore = _ref$includeScore === void 0 ? Config.includeScore : _ref$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;
|
|
});
|
|
}
|
|
|
|
var Fuse$1 = /*#__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(_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);
|
|
this._lastQuery = null;
|
|
this._lastSearcher = null;
|
|
}
|
|
_createClass(Fuse, [{
|
|
key: "_getSearcher",
|
|
value: function _getSearcher(query) {
|
|
if (this._lastQuery === query) {
|
|
return this._lastSearcher;
|
|
}
|
|
var searcher = createSearcher(query, this.options);
|
|
this._lastQuery = query;
|
|
this._lastSearcher = searcher;
|
|
return searcher;
|
|
}
|
|
}, {
|
|
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,
|
|
fieldNormWeight: this.options.fieldNormWeight
|
|
});
|
|
}
|
|
}, {
|
|
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 /* doc, idx */ () {
|
|
return false;
|
|
};
|
|
var results = [];
|
|
var indicesToRemove = [];
|
|
for (var i = 0, len = this._docs.length; i < len; i += 1) {
|
|
if (predicate(this._docs[i], i)) {
|
|
results.push(this._docs[i]);
|
|
indicesToRemove.push(i);
|
|
}
|
|
}
|
|
if (indicesToRemove.length) {
|
|
// Remove from docs in reverse to preserve indices
|
|
for (var _i = indicesToRemove.length - 1; _i >= 0; _i -= 1) {
|
|
this._docs.splice(indicesToRemove[_i], 1);
|
|
}
|
|
this._myIndex.removeAll(indicesToRemove);
|
|
}
|
|
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 useHeap = isNumber(limit) && limit > 0 && isString(query);
|
|
var results;
|
|
if (useHeap) {
|
|
var heap = new MaxHeap(limit);
|
|
if (isString(this._docs[0])) {
|
|
this._searchStringList(query, {
|
|
heap: heap,
|
|
ignoreFieldNorm: ignoreFieldNorm
|
|
});
|
|
} else {
|
|
this._searchObjectList(query, {
|
|
heap: heap,
|
|
ignoreFieldNorm: ignoreFieldNorm
|
|
});
|
|
}
|
|
results = heap.extractSorted(sortFn);
|
|
} else {
|
|
results = isString(query) ? isString(this._docs[0]) ? this._searchStringList(query) : this._searchObjectList(query) : this._searchLogical(query);
|
|
computeScore(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 _ref2 = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
|
|
heap = _ref2.heap,
|
|
ignoreFieldNorm = _ref2.ignoreFieldNorm;
|
|
var searcher = this._getSearcher(query);
|
|
var records = this._myIndex.records;
|
|
var results = heap ? null : [];
|
|
|
|
// Iterate over every string in the index
|
|
records.forEach(function (_ref3) {
|
|
var text = _ref3.v,
|
|
idx = _ref3.i,
|
|
norm = _ref3.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) {
|
|
var result = {
|
|
item: text,
|
|
idx: idx,
|
|
matches: [{
|
|
score: score,
|
|
value: text,
|
|
norm: norm,
|
|
indices: indices
|
|
}]
|
|
};
|
|
if (heap) {
|
|
computeScoreSingle(result, {
|
|
ignoreFieldNorm: ignoreFieldNorm
|
|
});
|
|
if (heap.shouldInsert(result.score)) {
|
|
heap.insert(result);
|
|
}
|
|
} else {
|
|
results.push(result);
|
|
}
|
|
}
|
|
});
|
|
return results;
|
|
}
|
|
}, {
|
|
key: "_searchLogical",
|
|
value: function _searchLogical(query) {
|
|
{
|
|
throw new Error(LOGICAL_SEARCH_UNAVAILABLE);
|
|
}
|
|
}
|
|
}, {
|
|
key: "_searchObjectList",
|
|
value: function _searchObjectList(query) {
|
|
var _this2 = this;
|
|
var _ref6 = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
|
|
heap = _ref6.heap,
|
|
ignoreFieldNorm = _ref6.ignoreFieldNorm;
|
|
var searcher = this._getSearcher(query);
|
|
var _this$_myIndex = this._myIndex,
|
|
keys = _this$_myIndex.keys,
|
|
records = _this$_myIndex.records;
|
|
var results = heap ? null : [];
|
|
|
|
// List is Array<Object>
|
|
records.forEach(function (_ref7) {
|
|
var item = _ref7.$,
|
|
idx = _ref7.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) {
|
|
var result = {
|
|
idx: idx,
|
|
item: item,
|
|
matches: matches
|
|
};
|
|
if (heap) {
|
|
computeScoreSingle(result, {
|
|
ignoreFieldNorm: ignoreFieldNorm
|
|
});
|
|
if (heap.shouldInsert(result.score)) {
|
|
heap.insert(result);
|
|
}
|
|
} else {
|
|
results.push(result);
|
|
}
|
|
}
|
|
});
|
|
return results;
|
|
}
|
|
}, {
|
|
key: "_findMatches",
|
|
value: function _findMatches(_ref8) {
|
|
var key = _ref8.key,
|
|
value = _ref8.value,
|
|
searcher = _ref8.searcher;
|
|
if (!isDefined(value)) {
|
|
return [];
|
|
}
|
|
var matches = [];
|
|
if (isArray(value)) {
|
|
value.forEach(function (_ref9) {
|
|
var text = _ref9.v,
|
|
idx = _ref9.i,
|
|
norm = _ref9.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;
|
|
}();
|
|
|
|
Fuse$1.version = '7.2.0';
|
|
Fuse$1.createIndex = createIndex;
|
|
Fuse$1.parseIndex = parseIndex;
|
|
Fuse$1.config = Config;
|
|
{
|
|
Fuse$1.parseQuery = parse;
|
|
}
|
|
Fuse$1.use = function () {
|
|
for (var _len = arguments.length, plugins = new Array(_len), _key = 0; _key < _len; _key++) {
|
|
plugins[_key] = arguments[_key];
|
|
}
|
|
plugins.forEach(function (plugin) {
|
|
return register(plugin);
|
|
});
|
|
};
|
|
var Fuse = Fuse$1;
|
|
|
|
module.exports = Fuse;
|