mirror of
https://github.com/nextapps-de/flexsearch.git
synced 2025-09-25 12:58:59 +02:00
1306 lines
39 KiB
JavaScript
1306 lines
39 KiB
JavaScript
/**!
|
|
* FlexSearch.js v0.8.0 (Bundle/Debug)
|
|
* Author and Copyright: Thomas Wilkerling
|
|
* Licence: Apache-2.0
|
|
* Hosted by Nextapps GmbH
|
|
* https://github.com/nextapps-de/flexsearch
|
|
*/
|
|
var x;
|
|
function B(a, c, b) {
|
|
const e = typeof b, d = typeof a;
|
|
if ("undefined" !== e) {
|
|
if ("undefined" !== d) {
|
|
if (b) {
|
|
if ("function" === d && e === d) {
|
|
return function(h) {
|
|
return a(b(h));
|
|
};
|
|
}
|
|
c = a.constructor;
|
|
if (c === b.constructor) {
|
|
if (c === Array) {
|
|
return b.concat(a);
|
|
}
|
|
if (c === Map) {
|
|
var f = new Map(b);
|
|
for (var g of a) {
|
|
f.set(g[0], g[1]);
|
|
}
|
|
return f;
|
|
}
|
|
if (c === Set) {
|
|
g = new Set(b);
|
|
for (f of a.values()) {
|
|
g.add(f);
|
|
}
|
|
return g;
|
|
}
|
|
}
|
|
}
|
|
return a;
|
|
}
|
|
return b;
|
|
}
|
|
return "undefined" === d ? c : a;
|
|
}
|
|
function C() {
|
|
return Object.create(null);
|
|
}
|
|
function aa(a, c) {
|
|
return c.length - a.length;
|
|
}
|
|
function E(a) {
|
|
return "string" === typeof a;
|
|
}
|
|
function H(a) {
|
|
return "object" === typeof a;
|
|
}
|
|
function I(a, c) {
|
|
if (E(c)) {
|
|
a = a[c];
|
|
} else {
|
|
for (let b = 0; a && b < c.length; b++) {
|
|
a = a[c[b]];
|
|
}
|
|
}
|
|
return a;
|
|
}
|
|
;var ba = [["\u00aa", "a"], ["\u00b2", "2"], ["\u00b3", "3"], ["\u00b9", "1"], ["\u00ba", "o"], ["\u00bc", "1\u20444"], ["\u00bd", "1\u20442"], ["\u00be", "3\u20444"], ["\u00e0", "a"], ["\u00e1", "a"], ["\u00e2", "a"], ["\u00e3", "a"], ["\u00e4", "a"], ["\u00e5", "a"], ["\u00e7", "c"], ["\u00e8", "e"], ["\u00e9", "e"], ["\u00ea", "e"], ["\u00eb", "e"], ["\u00ec", "i"], ["\u00ed", "i"], ["\u00ee", "i"], ["\u00ef", "i"], ["\u00f1", "n"], ["\u00f2", "o"], ["\u00f3", "o"], ["\u00f4", "o"], ["\u00f5",
|
|
"o"], ["\u00f6", "o"], ["\u00f9", "u"], ["\u00fa", "u"], ["\u00fb", "u"], ["\u00fc", "u"], ["\u00fd", "y"], ["\u00ff", "y"], ["\u0101", "a"], ["\u0103", "a"], ["\u0105", "a"], ["\u0107", "c"], ["\u0109", "c"], ["\u010b", "c"], ["\u010d", "c"], ["\u010f", "d"], ["\u0113", "e"], ["\u0115", "e"], ["\u0117", "e"], ["\u0119", "e"], ["\u011b", "e"], ["\u011d", "g"], ["\u011f", "g"], ["\u0121", "g"], ["\u0123", "g"], ["\u0125", "h"], ["\u0129", "i"], ["\u012b", "i"], ["\u012d", "i"], ["\u012f", "i"], ["\u0133",
|
|
"ij"], ["\u0135", "j"], ["\u0137", "k"], ["\u013a", "l"], ["\u013c", "l"], ["\u013e", "l"], ["\u0140", "l"], ["\u0144", "n"], ["\u0146", "n"], ["\u0148", "n"], ["\u0149", "n"], ["\u014d", "o"], ["\u014f", "o"], ["\u0151", "o"], ["\u0155", "r"], ["\u0157", "r"], ["\u0159", "r"], ["\u015b", "s"], ["\u015d", "s"], ["\u015f", "s"], ["\u0161", "s"], ["\u0163", "t"], ["\u0165", "t"], ["\u0169", "u"], ["\u016b", "u"], ["\u016d", "u"], ["\u016f", "u"], ["\u0171", "u"], ["\u0173", "u"], ["\u0175", "w"], ["\u0177",
|
|
"y"], ["\u017a", "z"], ["\u017c", "z"], ["\u017e", "z"], ["\u017f", "s"], ["\u01a1", "o"], ["\u01b0", "u"], ["\u01c6", "dz"], ["\u01c9", "lj"], ["\u01cc", "nj"], ["\u01ce", "a"], ["\u01d0", "i"], ["\u01d2", "o"], ["\u01d4", "u"], ["\u01d6", "u"], ["\u01d8", "u"], ["\u01da", "u"], ["\u01dc", "u"], ["\u01df", "a"], ["\u01e1", "a"], ["\u01e3", "ae"], ["\u00e6", "ae"], ["\u01fd", "ae"], ["\u01e7", "g"], ["\u01e9", "k"], ["\u01eb", "o"], ["\u01ed", "o"], ["\u01ef", "\u0292"], ["\u01f0", "j"], ["\u01f3",
|
|
"dz"], ["\u01f5", "g"], ["\u01f9", "n"], ["\u01fb", "a"], ["\u01ff", "\u00f8"], ["\u0201", "a"], ["\u0203", "a"], ["\u0205", "e"], ["\u0207", "e"], ["\u0209", "i"], ["\u020b", "i"], ["\u020d", "o"], ["\u020f", "o"], ["\u0211", "r"], ["\u0213", "r"], ["\u0215", "u"], ["\u0217", "u"], ["\u0219", "s"], ["\u021b", "t"], ["\u021f", "h"], ["\u0227", "a"], ["\u0229", "e"], ["\u022b", "o"], ["\u022d", "o"], ["\u022f", "o"], ["\u0231", "o"], ["\u0233", "y"], ["\u02b0", "h"], ["\u02b1", "h"], ["\u0266", "h"],
|
|
["\u02b2", "j"], ["\u02b3", "r"], ["\u02b4", "\u0279"], ["\u02b5", "\u027b"], ["\u02b6", "\u0281"], ["\u02b7", "w"], ["\u02b8", "y"], ["\u02e0", "\u0263"], ["\u02e1", "l"], ["\u02e2", "s"], ["\u02e3", "x"], ["\u02e4", "\u0295"], ["\u0390", "\u03b9"], ["\u03ac", "\u03b1"], ["\u03ad", "\u03b5"], ["\u03ae", "\u03b7"], ["\u03af", "\u03b9"], ["\u03b0", "\u03c5"], ["\u03ca", "\u03b9"], ["\u03cb", "\u03c5"], ["\u03cc", "\u03bf"], ["\u03cd", "\u03c5"], ["\u03ce", "\u03c9"], ["\u03d0", "\u03b2"], ["\u03d1",
|
|
"\u03b8"], ["\u03d2", "\u03a5"], ["\u03d3", "\u03a5"], ["\u03d4", "\u03a5"], ["\u03d5", "\u03c6"], ["\u03d6", "\u03c0"], ["\u03f0", "\u03ba"], ["\u03f1", "\u03c1"], ["\u03f2", "\u03c2"], ["\u03f5", "\u03b5"], ["\u0439", "\u0438"], ["\u0450", "\u0435"], ["\u0451", "\u0435"], ["\u0453", "\u0433"], ["\u0457", "\u0456"], ["\u045c", "\u043a"], ["\u045d", "\u0438"], ["\u045e", "\u0443"], ["\u0477", "\u0475"], ["\u04c2", "\u0436"], ["\u04d1", "\u0430"], ["\u04d3", "\u0430"], ["\u04d7", "\u0435"], ["\u04db",
|
|
"\u04d9"], ["\u04dd", "\u0436"], ["\u04df", "\u0437"], ["\u04e3", "\u0438"], ["\u04e5", "\u0438"], ["\u04e7", "\u043e"], ["\u04eb", "\u04e9"], ["\u04ed", "\u044d"], ["\u04ef", "\u0443"], ["\u04f1", "\u0443"], ["\u04f3", "\u0443"], ["\u04f5", "\u0447"]];
|
|
const ca = /[^\p{L}\p{N}]+/u, da = /(\d{3})/g, ea = /(\D)(\d{3})/g, fa = /(\d{3})(\D)/g, J = "".normalize && /[\u0300-\u036f]/g;
|
|
function K(a) {
|
|
if (this.constructor !== K) {
|
|
return new K(...arguments);
|
|
}
|
|
for (let c = 0; c < arguments.length; c++) {
|
|
this.assign(arguments[c]);
|
|
}
|
|
}
|
|
K.prototype.assign = function(a) {
|
|
this.normalize = B(a.normalize, !0, this.normalize);
|
|
let c = a.include, b = c || a.exclude || a.split;
|
|
if ("object" === typeof b) {
|
|
let e = !c, d = "";
|
|
a.include || (d += "\\p{Z}");
|
|
b.letter && (d += "\\p{L}");
|
|
b.number && (d += "\\p{N}", e = !!c);
|
|
b.symbol && (d += "\\p{S}");
|
|
b.punctuation && (d += "\\p{P}");
|
|
b.control && (d += "\\p{C}");
|
|
if (b = b.char) {
|
|
d += "object" === typeof b ? b.join("") : b;
|
|
}
|
|
try {
|
|
this.split = new RegExp("[" + (c ? "^" : "") + d + "]+", "u");
|
|
} catch (f) {
|
|
this.split = /\s+/;
|
|
}
|
|
this.numeric = e;
|
|
} else {
|
|
try {
|
|
this.split = B(b, ca, this.split);
|
|
} catch (e) {
|
|
this.split = /\s+/;
|
|
}
|
|
this.numeric = B(this.numeric, !0);
|
|
}
|
|
this.prepare = B(a.prepare, null, this.prepare);
|
|
this.finalize = B(a.finalize, null, this.finalize);
|
|
J || (this.mapper = new Map(ba));
|
|
this.rtl = a.rtl || !1;
|
|
this.dedupe = B(a.dedupe, !0, this.dedupe);
|
|
this.filter = B((b = a.filter) && new Set(b), null, this.filter);
|
|
this.matcher = B((b = a.matcher) && new Map(b), null, this.matcher);
|
|
this.mapper = B((b = a.mapper) && new Map(b), null, this.mapper);
|
|
this.stemmer = B((b = a.stemmer) && new Map(b), null, this.stemmer);
|
|
this.replacer = B(a.replacer, null, this.replacer);
|
|
this.minlength = B(a.minlength, 1, this.minlength);
|
|
this.maxlength = B(a.maxlength, 0, this.maxlength);
|
|
if (this.cache = b = B(a.cache, !0, this.cache)) {
|
|
this.I = null, this.O = "number" === typeof b ? b : 2e5, this.D = new Map(), this.G = new Map(), this.J = this.A = 128;
|
|
}
|
|
this.K = "";
|
|
this.M = null;
|
|
this.L = "";
|
|
this.N = null;
|
|
if (this.matcher) {
|
|
for (const e of this.matcher.keys()) {
|
|
this.K += (this.K ? "|" : "") + e;
|
|
}
|
|
}
|
|
if (this.stemmer) {
|
|
for (const e of this.stemmer.keys()) {
|
|
this.L += (this.L ? "|" : "") + e;
|
|
}
|
|
}
|
|
return this;
|
|
};
|
|
K.prototype.encode = function(a) {
|
|
if (this.cache && a.length <= this.A) {
|
|
if (this.I) {
|
|
if (this.D.has(a)) {
|
|
return this.D.get(a);
|
|
}
|
|
} else {
|
|
this.I = setTimeout(ha, 50, this);
|
|
}
|
|
}
|
|
this.normalize && (a = "function" === typeof this.normalize ? this.normalize(a) : J ? a.normalize("NFKD").replace(J, "").toLowerCase() : a.toLowerCase());
|
|
this.prepare && (a = this.prepare(a));
|
|
this.numeric && 3 < a.length && (a = a.replace(ea, "$1 $2").replace(fa, "$1 $2").replace(da, "$1 "));
|
|
const c = !(this.dedupe || this.mapper || this.filter || this.matcher || this.stemmer || this.replacer);
|
|
let b = [], e = this.split || "" === this.split ? a.split(this.split) : a;
|
|
for (let f = 0, g, h; f < e.length; f++) {
|
|
if (!(g = h = e[f])) {
|
|
continue;
|
|
}
|
|
if (g.length < this.minlength) {
|
|
continue;
|
|
}
|
|
if (c) {
|
|
b.push(g);
|
|
continue;
|
|
}
|
|
if (this.filter && this.filter.has(g)) {
|
|
continue;
|
|
}
|
|
if (this.cache && g.length <= this.J) {
|
|
if (this.I) {
|
|
var d = this.G.get(g);
|
|
if (d || "" === d) {
|
|
d && b.push(d);
|
|
continue;
|
|
}
|
|
} else {
|
|
this.I = setTimeout(ha, 50, this);
|
|
}
|
|
}
|
|
let k;
|
|
this.stemmer && 2 < g.length && (this.N || (this.N = new RegExp("(?!^)(" + this.L + ")$")), g = g.replace(this.N, l => this.stemmer.get(l)), k = 1);
|
|
g && k && (g.length < this.minlength || this.filter && this.filter.has(g)) && (g = "");
|
|
if (g && (this.mapper || this.dedupe && 1 < g.length)) {
|
|
d = "";
|
|
for (let l = 0, m = "", n, t; l < g.length; l++) {
|
|
n = g.charAt(l), n === m && this.dedupe || ((t = this.mapper && this.mapper.get(n)) || "" === t ? t === m && this.dedupe || !(m = t) || (d += t) : d += m = n);
|
|
}
|
|
g = d;
|
|
}
|
|
this.matcher && 1 < g.length && (this.M || (this.M = new RegExp("(" + this.K + ")", "g")), g = g.replace(this.M, l => this.matcher.get(l)));
|
|
if (g && this.replacer) {
|
|
for (d = 0; g && d < this.replacer.length; d += 2) {
|
|
g = g.replace(this.replacer[d], this.replacer[d + 1]);
|
|
}
|
|
}
|
|
this.cache && h.length <= this.J && (this.G.set(h, g), this.G.size > this.O && (this.G.clear(), this.J = this.J / 1.1 | 0));
|
|
g && b.push(g);
|
|
}
|
|
this.finalize && (b = this.finalize(b) || b);
|
|
this.cache && a.length <= this.A && (this.D.set(a, b), this.D.size > this.O && (this.D.clear(), this.A = this.A / 1.1 | 0));
|
|
return b;
|
|
};
|
|
function ha(a) {
|
|
a.I = null;
|
|
a.D.clear();
|
|
a.G.clear();
|
|
}
|
|
;function ia(a) {
|
|
M.call(a, "add");
|
|
M.call(a, "append");
|
|
M.call(a, "search");
|
|
M.call(a, "update");
|
|
M.call(a, "remove");
|
|
}
|
|
function M(a) {
|
|
this[a + "Async"] = function() {
|
|
var c = arguments;
|
|
const b = c[c.length - 1];
|
|
let e;
|
|
"function" === typeof b && (e = b, delete c[c.length - 1]);
|
|
c = this[a].apply(this, c);
|
|
e && (c.then ? c.then(e) : e(c));
|
|
return c;
|
|
};
|
|
}
|
|
;function N(a) {
|
|
const c = [];
|
|
for (const b of a.entries()) {
|
|
c.push(b);
|
|
}
|
|
return c;
|
|
}
|
|
function ja(a) {
|
|
const c = [];
|
|
for (const b of a.entries()) {
|
|
c.push(N(b));
|
|
}
|
|
return c;
|
|
}
|
|
function ka(a) {
|
|
const c = [];
|
|
for (const b of a.keys()) {
|
|
c.push(b);
|
|
}
|
|
return c;
|
|
}
|
|
function la(a, c, b, e, d, f) {
|
|
if ((b = a(c ? c + "." + b : b, JSON.stringify(f))) && b.then) {
|
|
const g = this;
|
|
return b.then(function() {
|
|
return g.export(a, c, e, d + 1);
|
|
});
|
|
}
|
|
return this.export(a, c, e, d + 1);
|
|
}
|
|
;O.prototype.add = function(a, c, b) {
|
|
H(a) && (c = a, a = I(c, this.key));
|
|
if (c && (a || 0 === a)) {
|
|
if (!b && this.reg.has(a)) {
|
|
return this.update(a, c);
|
|
}
|
|
for (let h = 0, k; h < this.field.length; h++) {
|
|
k = this.C[h];
|
|
var e = this.index.get(this.field[h]);
|
|
if ("function" === typeof k) {
|
|
var d = k(c);
|
|
d && e.add(a, d, !1, !0);
|
|
} else {
|
|
if (d = k.F, !d || d(c)) {
|
|
k.constructor === String ? k = ["" + k] : E(k) && (k = [k]), P(c, k, this.H, 0, e, a, k[0], b);
|
|
}
|
|
}
|
|
}
|
|
if (this.tag) {
|
|
for (e = 0; e < this.B.length; e++) {
|
|
var f = this.B[e], g = this.R[e];
|
|
d = this.tag.get(g);
|
|
let h = C();
|
|
if ("function" === typeof f) {
|
|
if (f = f(c), !f) {
|
|
continue;
|
|
}
|
|
} else {
|
|
const k = f.F;
|
|
if (k && !k(c)) {
|
|
continue;
|
|
}
|
|
f.constructor === String && (f = "" + f);
|
|
f = I(c, f);
|
|
}
|
|
if (d && f) {
|
|
E(f) && (f = [f]);
|
|
for (let k = 0, l, m; k < f.length; k++) {
|
|
l = f[k], h[l] || (h[l] = 1, (g = d.get(l)) ? m = g : d.set(l, m = []), b && m.includes(a) || (m.push(a), this.fastupdate && ((g = this.reg.get(a)) ? g.push(m) : this.reg.set(a, [m]))));
|
|
}
|
|
} else {
|
|
d || console.warn("Tag '" + g + "' was not found");
|
|
}
|
|
}
|
|
}
|
|
if (this.store && (!b || !this.store.has(a))) {
|
|
let h;
|
|
if (this.h) {
|
|
h = C();
|
|
for (let k = 0, l; k < this.h.length; k++) {
|
|
l = this.h[k];
|
|
if ((b = l.F) && !b(c)) {
|
|
continue;
|
|
}
|
|
let m;
|
|
if ("function" === typeof l) {
|
|
m = l(c);
|
|
if (!m) {
|
|
continue;
|
|
}
|
|
l = [l.S];
|
|
} else if (E(l) || l.constructor === String) {
|
|
h[l] = c[l];
|
|
continue;
|
|
}
|
|
Q(c, h, l, 0, l[0], m);
|
|
}
|
|
}
|
|
this.store.set(a, h || c);
|
|
}
|
|
}
|
|
return this;
|
|
};
|
|
function Q(a, c, b, e, d, f) {
|
|
a = a[d];
|
|
if (e === b.length - 1) {
|
|
c[d] = f || a;
|
|
} else if (a) {
|
|
if (a.constructor === Array) {
|
|
for (c = c[d] = Array(a.length), d = 0; d < a.length; d++) {
|
|
Q(a, c, b, e, d);
|
|
}
|
|
} else {
|
|
c = c[d] || (c[d] = C()), d = b[++e], Q(a, c, b, e, d);
|
|
}
|
|
}
|
|
}
|
|
function P(a, c, b, e, d, f, g, h) {
|
|
if (a = a[g]) {
|
|
if (e === c.length - 1) {
|
|
if (a.constructor === Array) {
|
|
if (b[e]) {
|
|
for (c = 0; c < a.length; c++) {
|
|
d.add(f, a[c], !0, !0);
|
|
}
|
|
return;
|
|
}
|
|
a = a.join(" ");
|
|
}
|
|
d.add(f, a, h, !0);
|
|
} else {
|
|
if (a.constructor === Array) {
|
|
for (g = 0; g < a.length; g++) {
|
|
P(a, c, b, e, d, f, g, h);
|
|
}
|
|
} else {
|
|
g = c[++e], P(a, c, b, e, d, f, g, h);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
;function ma(a, c) {
|
|
const b = C(), e = [];
|
|
for (let d = 0, f; d < c.length; d++) {
|
|
f = c[d];
|
|
for (let g = 0; g < f.length; g++) {
|
|
b[f[g]] = 1;
|
|
}
|
|
}
|
|
for (let d = 0, f; d < a.length; d++) {
|
|
f = a[d], 1 === b[f] && (e.push(f), b[f] = 2);
|
|
}
|
|
return e;
|
|
}
|
|
;O.prototype.search = function(a, c, b, e) {
|
|
b || (!c && H(a) ? (b = a, a = "") : H(c) && (b = c, c = 0));
|
|
let d = [];
|
|
var f = [];
|
|
let g, h, k, l, m, n, t = 0, p;
|
|
if (b) {
|
|
b.constructor === Array && (b = {index:b});
|
|
a = b.query || a;
|
|
var r = b.pluck;
|
|
h = b.merge;
|
|
l = r || b.field || b.index;
|
|
m = this.tag && b.tag;
|
|
g = this.store && b.enrich;
|
|
k = b.suggest;
|
|
p = b.T;
|
|
c = b.limit || c;
|
|
n = b.offset || 0;
|
|
c || (c = 100);
|
|
if (m) {
|
|
m.constructor !== Array && (m = [m]);
|
|
var u = [];
|
|
for (let w = 0, q; w < m.length; w++) {
|
|
q = m[w];
|
|
if (E(q)) {
|
|
throw Error("A tag option can't be a string, instead it needs a { field: tag } format.");
|
|
}
|
|
if (q.field && q.tag) {
|
|
var v = q.tag;
|
|
if (v.constructor === Array) {
|
|
for (var y = 0; y < v.length; y++) {
|
|
u.push(q.field, v[y]);
|
|
}
|
|
} else {
|
|
u.push(q.field, v);
|
|
}
|
|
} else {
|
|
v = Object.keys(q);
|
|
for (let D = 0, A, z; D < v.length; D++) {
|
|
if (A = v[D], z = q[A], z.constructor === Array) {
|
|
for (y = 0; y < z.length; y++) {
|
|
u.push(A, z[y]);
|
|
}
|
|
} else {
|
|
u.push(A, z);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (!u.length) {
|
|
throw Error("Your tag definition within the search options is probably wrong. No valid tags found.");
|
|
}
|
|
m = u;
|
|
if (!a) {
|
|
e = [];
|
|
if (u.length) {
|
|
for (f = 0; f < u.length; f += 2) {
|
|
r = na.call(this, u[f], u[f + 1], c, n, g), d.push({field:u[f], tag:u[f + 1], result:r});
|
|
}
|
|
}
|
|
return e.length ? Promise.all(e).then(function(w) {
|
|
for (let q = 0; q < w.length; q++) {
|
|
d[q].result = w[q];
|
|
}
|
|
return d;
|
|
}) : d;
|
|
}
|
|
}
|
|
E(l) && (l = [l]);
|
|
}
|
|
l || (l = this.field);
|
|
u = !e && (this.worker || this.db) && [];
|
|
for (let w = 0, q, D, A; w < l.length; w++) {
|
|
D = l[w];
|
|
let z;
|
|
E(D) || (z = D, D = z.field, a = z.query || a, c = z.limit || c, n = z.offset || n, k = z.suggest || k, g = this.store && (z.enrich || g));
|
|
if (e) {
|
|
q = e[w];
|
|
} else {
|
|
if (v = z || b, y = this.index.get(D), m && (v.enrich = !1), u) {
|
|
u[w] = y.search(a, c, v);
|
|
v && g && (v.enrich = g);
|
|
continue;
|
|
} else {
|
|
q = y.search(a, c, v), v && g && (v.enrich = g);
|
|
}
|
|
}
|
|
A = q && q.length;
|
|
if (m && A) {
|
|
v = [];
|
|
y = 0;
|
|
for (let G = 0, F, L; G < m.length; G += 2) {
|
|
F = this.tag.get(m[G]);
|
|
if (!F) {
|
|
if (console.warn("Tag '" + m[G] + ":" + m[G + 1] + "' will be skipped because there is no field '" + m[G] + "'."), k) {
|
|
continue;
|
|
} else {
|
|
return d;
|
|
}
|
|
}
|
|
if (L = (F = F && F.get(m[G + 1])) && F.length) {
|
|
y++, v.push(F);
|
|
} else if (!k) {
|
|
return d;
|
|
}
|
|
}
|
|
if (y) {
|
|
q = ma(q, v);
|
|
A = q.length;
|
|
if (!A && !k) {
|
|
return d;
|
|
}
|
|
y--;
|
|
}
|
|
}
|
|
if (A) {
|
|
f[t] = D, d.push(q), t++;
|
|
} else if (1 === l.length) {
|
|
return d;
|
|
}
|
|
}
|
|
if (u) {
|
|
const w = this;
|
|
return Promise.all(u).then(function(q) {
|
|
return q.length ? w.search(a, c, b, q) : q;
|
|
});
|
|
}
|
|
if (!t) {
|
|
return d;
|
|
}
|
|
if (r && (!g || !this.store)) {
|
|
return d[0];
|
|
}
|
|
u = [];
|
|
for (let w = 0, q; w < f.length; w++) {
|
|
q = d[w];
|
|
g && q.length && !q[0].doc && q.length && (q = oa.call(this, q));
|
|
if (r) {
|
|
return q;
|
|
}
|
|
d[w] = {field:f[w], result:q};
|
|
}
|
|
return h ? pa(d, c) : p ? qa(d, a, this.index, this.field, this.C, p) : d;
|
|
};
|
|
function qa(a, c, b, e, d, f) {
|
|
let g, h, k;
|
|
for (let m = 0, n, t, p, r, u; m < a.length; m++) {
|
|
n = a[m].result;
|
|
t = a[m].field;
|
|
r = b.get(t);
|
|
p = r.encoder;
|
|
k = r.tokenize;
|
|
u = d[e.indexOf(t)];
|
|
p !== g && (g = p, h = g.encode(c));
|
|
for (let v = 0; v < n.length; v++) {
|
|
let y = "";
|
|
var l = I(n[v].doc, u);
|
|
let w = g.encode(l);
|
|
l = l.split(g.split);
|
|
for (let q = 0, D, A; q < w.length; q++) {
|
|
D = w[q];
|
|
A = l[q];
|
|
let z;
|
|
for (let G = 0, F; G < h.length; G++) {
|
|
if (F = h[G], "strict" === k) {
|
|
if (D === F) {
|
|
y += (y ? " " : "") + f.replace("$1", A);
|
|
z = !0;
|
|
break;
|
|
}
|
|
} else {
|
|
const L = D.indexOf(F);
|
|
if (-1 < L) {
|
|
y += (y ? " " : "") + A.substring(0, L) + f.replace("$1", A.substring(L, F.length)) + A.substring(L + F.length);
|
|
z = !0;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
z || (y += (y ? " " : "") + l[q]);
|
|
}
|
|
n[v].T = y;
|
|
}
|
|
}
|
|
return a;
|
|
}
|
|
function pa(a, c) {
|
|
const b = [], e = C();
|
|
for (let d = 0, f, g; d < a.length; d++) {
|
|
f = a[d];
|
|
g = f.result;
|
|
for (let h = 0, k, l, m; h < g.length; h++) {
|
|
if (l = g[h], k = l.id, m = e[k]) {
|
|
m.push(f.field);
|
|
} else {
|
|
if (b.length === c) {
|
|
return b;
|
|
}
|
|
l.field = e[k] = [f.field];
|
|
b.push(l);
|
|
}
|
|
}
|
|
}
|
|
return b;
|
|
}
|
|
function na(a, c, b, e, d) {
|
|
let f = this.tag.get(a);
|
|
if (!f) {
|
|
return console.warn("Tag '" + a + "' was not found"), [];
|
|
}
|
|
if ((a = (f = f && f.get(c)) && f.length - e) && 0 < a) {
|
|
if (a > b || e) {
|
|
f = f.slice(e, e + b);
|
|
}
|
|
d && (f = oa.call(this, f));
|
|
return f;
|
|
}
|
|
}
|
|
function oa(a) {
|
|
const c = Array(a.length);
|
|
for (let b = 0, e; b < a.length; b++) {
|
|
e = a[b], c[b] = {id:e, doc:this.store.get(e)};
|
|
}
|
|
return c;
|
|
}
|
|
;function O(a) {
|
|
if (this.constructor !== O) {
|
|
return new O(a);
|
|
}
|
|
const c = a.document || a.doc || a;
|
|
var b;
|
|
this.C = [];
|
|
this.field = [];
|
|
this.H = [];
|
|
this.key = (b = c.key || c.id) && R(b, this.H) || "id";
|
|
this.reg = (this.fastupdate = !!a.fastupdate) ? new Map() : new Set();
|
|
this.h = (b = c.store || null) && !0 !== b && [];
|
|
this.store = b && new Map();
|
|
this.cache = (b = a.cache || null) && new S(b);
|
|
a.cache = !1;
|
|
b = new Map();
|
|
let e = c.index || c.field || c;
|
|
E(e) && (e = [e]);
|
|
for (let d = 0, f, g; d < e.length; d++) {
|
|
f = e[d], E(f) || (g = f, f = f.field), g = H(g) ? Object.assign({}, a, g) : a, b.set(f, new T(g, this.reg)), g.custom ? this.C[d] = g.custom : (this.C[d] = R(f, this.H), g.filter && ("string" === typeof this.C[d] && (this.C[d] = new String(this.C[d])), this.C[d].F = g.filter)), this.field[d] = f;
|
|
}
|
|
if (this.h) {
|
|
a = c.store;
|
|
E(a) && (a = [a]);
|
|
for (let d = 0, f, g; d < a.length; d++) {
|
|
f = a[d], g = f.field || f, f.custom ? (this.h[d] = f.custom, f.custom.S = g) : (this.h[d] = R(g, this.H), f.filter && ("string" === typeof this.h[d] && (this.h[d] = new String(this.h[d])), this.h[d].F = f.filter));
|
|
}
|
|
}
|
|
this.index = b;
|
|
this.tag = null;
|
|
if (b = c.tag) {
|
|
if ("string" === typeof b && (b = [b]), b.length) {
|
|
this.tag = new Map();
|
|
this.B = [];
|
|
this.R = [];
|
|
for (let d = 0, f, g; d < b.length; d++) {
|
|
f = b[d];
|
|
g = f.field || f;
|
|
if (!g) {
|
|
throw Error("The tag field from the document descriptor is undefined.");
|
|
}
|
|
f.custom ? this.B[d] = f.custom : (this.B[d] = R(g, this.H), f.filter && ("string" === typeof this.B[d] && (this.B[d] = new String(this.B[d])), this.B[d].F = f.filter));
|
|
this.R[d] = g;
|
|
this.tag.set(g, new Map());
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function R(a, c) {
|
|
const b = a.split(":");
|
|
let e = 0;
|
|
for (let d = 0; d < b.length; d++) {
|
|
a = b[d], "]" === a[a.length - 1] && (a = a.substring(0, a.length - 2)) && (c[e] = !0), a && (b[e++] = a);
|
|
}
|
|
e < b.length && (b.length = e);
|
|
return 1 < e ? b : b[0];
|
|
}
|
|
x = O.prototype;
|
|
x.append = function(a, c) {
|
|
return this.add(a, c, !0);
|
|
};
|
|
x.update = function(a, c) {
|
|
return this.remove(a).add(a, c);
|
|
};
|
|
x.remove = function(a) {
|
|
H(a) && (a = I(a, this.key));
|
|
for (var c of this.index.values()) {
|
|
c.remove(a, !0);
|
|
}
|
|
if (this.reg.has(a)) {
|
|
if (this.tag && !this.fastupdate) {
|
|
for (let b of this.tag.values()) {
|
|
for (let e of b) {
|
|
c = e[0];
|
|
const d = e[1], f = d.indexOf(a);
|
|
-1 < f && (1 < d.length ? d.splice(f, 1) : b.delete(c));
|
|
}
|
|
}
|
|
}
|
|
this.store && this.store.delete(a);
|
|
this.reg.delete(a);
|
|
}
|
|
this.cache && this.cache.remove(a);
|
|
return this;
|
|
};
|
|
x.clear = function() {
|
|
for (const a of this.index.values()) {
|
|
a.clear();
|
|
}
|
|
if (this.tag) {
|
|
for (const a of this.tag.values()) {
|
|
a.clear();
|
|
}
|
|
}
|
|
this.store && this.store.clear();
|
|
return this;
|
|
};
|
|
x.contain = function(a) {
|
|
return this.reg.has(a);
|
|
};
|
|
x.cleanup = function() {
|
|
for (const a of this.index.values()) {
|
|
a.cleanup();
|
|
}
|
|
return this;
|
|
};
|
|
x.get = function(a) {
|
|
return this.store.get(a);
|
|
};
|
|
x.set = function(a, c) {
|
|
this.store.set(a, c);
|
|
return this;
|
|
};
|
|
x.searchCache = ra;
|
|
x.export = function(a, c, b = 0, e = 0) {
|
|
if (b < this.field.length) {
|
|
const g = this.field[b];
|
|
if ((c = this.index.get(g).export(a, g, b, e = 1)) && c.then) {
|
|
const h = this;
|
|
return c.then(function() {
|
|
return h.export(a, g, b + 1, e = 0);
|
|
});
|
|
}
|
|
return this.export(a, g, b + 1, e = 0);
|
|
}
|
|
let d, f;
|
|
switch(e) {
|
|
case 0:
|
|
d = "reg";
|
|
f = ka(this.reg);
|
|
c = null;
|
|
break;
|
|
case 1:
|
|
d = "tag";
|
|
f = ja(this.tag);
|
|
c = null;
|
|
break;
|
|
case 2:
|
|
d = "doc";
|
|
f = N(this.store);
|
|
c = null;
|
|
break;
|
|
case 3:
|
|
d = "cfg";
|
|
f = {};
|
|
c = null;
|
|
break;
|
|
default:
|
|
return;
|
|
}
|
|
return la.call(this, a, c, d, b, e, f);
|
|
};
|
|
x.import = function(a, c) {
|
|
if (c) {
|
|
switch(E(c) && (c = JSON.parse(c)), a) {
|
|
case "tag":
|
|
break;
|
|
case "reg":
|
|
this.fastupdate = !1;
|
|
this.reg = new Set(c);
|
|
for (let e = 0, d; e < this.field.length; e++) {
|
|
d = this.index.get(this.field[e]), d.fastupdate = !1, d.reg = this.reg;
|
|
}
|
|
break;
|
|
case "doc":
|
|
this.store = new Map(c);
|
|
break;
|
|
default:
|
|
a = a.split(".");
|
|
const b = a[0];
|
|
a = a[1];
|
|
b && a && this.index.get(b).import(a, c);
|
|
}
|
|
}
|
|
};
|
|
ia(O.prototype);
|
|
function ra(a, c, b) {
|
|
a = ("object" === typeof a ? "" + a.query : a).toLowerCase();
|
|
let e = this.cache.get(a);
|
|
if (!e) {
|
|
e = this.search(a, c, b);
|
|
if (e.then) {
|
|
const d = this;
|
|
e.then(function(f) {
|
|
d.cache.set(a, f);
|
|
return f;
|
|
});
|
|
}
|
|
this.cache.set(a, e);
|
|
}
|
|
return e;
|
|
}
|
|
function S(a) {
|
|
this.limit = a && !0 !== a ? a : 1000;
|
|
this.cache = new Map();
|
|
this.A = "";
|
|
}
|
|
S.prototype.set = function(a, c) {
|
|
this.cache.set(this.A = a, c);
|
|
this.cache.size > this.limit && this.cache.delete(this.cache.keys().next().value);
|
|
};
|
|
S.prototype.get = function(a) {
|
|
const c = this.cache.get(a);
|
|
c && this.A !== a && (this.cache.delete(a), this.cache.set(this.A = a, c));
|
|
return c;
|
|
};
|
|
S.prototype.remove = function(a) {
|
|
for (const c of this.cache) {
|
|
const b = c[0];
|
|
c[1].includes(a) && this.cache.delete(b);
|
|
}
|
|
};
|
|
S.prototype.clear = function() {
|
|
this.cache.clear();
|
|
this.A = "";
|
|
};
|
|
const sa = {normalize:function(a) {
|
|
return a.toLowerCase();
|
|
}, dedupe:!1};
|
|
const U = new Map([["b", "p"], ["v", "f"], ["w", "f"], ["z", "s"], ["x", "s"], ["d", "t"], ["n", "m"], ["c", "k"], ["g", "k"], ["j", "k"], ["q", "k"], ["i", "e"], ["y", "e"], ["u", "o"]]);
|
|
const ta = new Map([["ae", "a"], ["oe", "o"], ["sh", "s"], ["kh", "k"], ["th", "t"], ["pf", "f"]]), ua = [/([^aeo])h(.)/g, "$1$2", /([aeo])h([^aeo]|$)/g, "$1$2", /([^0-9])\1+/g, "$1"];
|
|
const va = {a:"", e:"", i:"", o:"", u:"", y:"", b:1, f:1, p:1, v:1, c:2, g:2, j:2, k:2, q:2, s:2, x:2, z:2, "\u00df":2, d:3, t:3, l:4, m:5, n:5, r:6};
|
|
const wa = /[\x00-\x7F]+/g;
|
|
const xa = /[\x00-\x7F]+/g;
|
|
const ya = /[\x00-\x7F]+/g;
|
|
var za = {LatinExact:{normalize:!1, dedupe:!1}, LatinDefault:sa, LatinSimple:{normalize:!0, dedupe:!0}, LatinBalance:{normalize:!0, dedupe:!0, mapper:U}, LatinAdvanced:{normalize:!0, dedupe:!0, mapper:U, matcher:ta, replacer:ua}, LatinExtra:{normalize:!0, dedupe:!0, mapper:U, replacer:ua.concat([/(?!^)[aeo]/g, ""]), matcher:ta}, LatinSoundex:{normalize:!0, dedupe:!1, include:{letter:!0}, finalize:function(a) {
|
|
for (let b = 0; b < a.length; b++) {
|
|
var c = a[b];
|
|
let e = c.charAt(0), d = va[e];
|
|
for (let f = 1, g; f < c.length && (g = c.charAt(f), "h" === g || "w" === g || !(g = va[g]) || g === d || (e += g, d = g, 4 !== e.length)); f++) {
|
|
}
|
|
a[b] = e;
|
|
}
|
|
}}, ArabicDefault:{rtl:!0, normalize:!1, dedupe:!0, prepare:function(a) {
|
|
return ("" + a).replace(wa, " ");
|
|
}}, CjkDefault:{normalize:!1, dedupe:!0, split:"", prepare:function(a) {
|
|
return ("" + a).replace(xa, "");
|
|
}}, CyrillicDefault:{normalize:!1, dedupe:!0, prepare:function(a) {
|
|
return ("" + a).replace(ya, " ");
|
|
}}};
|
|
const Aa = {memory:{resolution:1}, performance:{resolution:6, fastupdate:!0, context:{depth:1, resolution:3}}, match:{tokenize:"forward"}, score:{resolution:9, context:{depth:2, resolution:9}}};
|
|
C();
|
|
T.prototype.add = function(a, c, b, e) {
|
|
if (c && (a || 0 === a)) {
|
|
if (!e && !b && this.reg.has(a)) {
|
|
return this.update(a, c);
|
|
}
|
|
c = this.encoder.encode(c);
|
|
if (e = c.length) {
|
|
const l = C(), m = C(), n = this.depth, t = this.resolution;
|
|
for (let p = 0; p < e; p++) {
|
|
let r = c[this.rtl ? e - 1 - p : p];
|
|
var d = r.length;
|
|
if (d && (n || !m[r])) {
|
|
var f = this.score ? this.score(c, r, p, null, 0) : V(t, e, p), g = "";
|
|
switch(this.tokenize) {
|
|
case "full":
|
|
if (2 < d) {
|
|
for (f = 0; f < d; f++) {
|
|
for (var h = d; h > f; h--) {
|
|
g = r.substring(f, h);
|
|
var k = this.score ? this.score(c, r, p, g, f) : V(t, e, p, d, f);
|
|
W(this, m, g, k, a, b);
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
case "reverse":
|
|
if (1 < d) {
|
|
for (h = d - 1; 0 < h; h--) {
|
|
g = r[h] + g, k = this.score ? this.score(c, r, p, g, h) : V(t, e, p, d, h), W(this, m, g, k, a, b);
|
|
}
|
|
g = "";
|
|
}
|
|
case "forward":
|
|
if (1 < d) {
|
|
for (h = 0; h < d; h++) {
|
|
g += r[h], W(this, m, g, f, a, b);
|
|
}
|
|
break;
|
|
}
|
|
default:
|
|
if (W(this, m, r, f, a, b), n && 1 < e && p < e - 1) {
|
|
for (d = C(), g = this.P, f = r, h = Math.min(n + 1, e - p), d[f] = 1, k = 1; k < h; k++) {
|
|
if ((r = c[this.rtl ? e - 1 - p - k : p + k]) && !d[r]) {
|
|
d[r] = 1;
|
|
const u = this.score ? this.score(c, f, p, r, k) : V(g + (e / 2 > g ? 0 : 1), e, p, h - 1, k - 1), v = this.bidirectional && r > f;
|
|
W(this, l, v ? f : r, u, a, b, v ? r : f);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
this.fastupdate || this.reg.add(a);
|
|
}
|
|
}
|
|
return this;
|
|
};
|
|
function W(a, c, b, e, d, f, g) {
|
|
let h = g ? a.ctx : a.map, k;
|
|
if (!c[b] || g && !(k = c[b])[g]) {
|
|
g ? (c = k || (c[b] = C()), c[g] = 1, (k = h.get(g)) ? h = k : h.set(g, h = new Map())) : c[b] = 1, (k = h.get(b)) ? h = k : h.set(b, h = []), h = h[e] || (h[e] = []), f && h.includes(d) || (h.push(d), a.fastupdate && ((c = a.reg.get(d)) ? c.push(h) : a.reg.set(d, [h])));
|
|
}
|
|
}
|
|
function V(a, c, b, e, d) {
|
|
return b && 1 < a ? c + (e || 0) <= a ? b + (d || 0) : (a - 1) / (c + (e || 0)) * (b + (d || 0)) + 1 | 0 : 0;
|
|
}
|
|
;function Ba(a, c, b) {
|
|
if (1 === a.length) {
|
|
return a = a[0], a = b || a.length > c ? c ? a.slice(b, b + c) : a.slice(b) : a;
|
|
}
|
|
let e = [];
|
|
for (let d = 0, f, g; d < a.length; d++) {
|
|
if ((f = a[d]) && (g = f.length)) {
|
|
if (b) {
|
|
if (b >= g) {
|
|
b -= g;
|
|
continue;
|
|
}
|
|
b < g && (f = c ? f.slice(b, b + c) : f.slice(b), g = f.length, b = 0);
|
|
}
|
|
if (e.length) {
|
|
g > c && (f = f.slice(0, c), g = f.length), e.push(f);
|
|
} else {
|
|
if (g >= c) {
|
|
return g > c && (f = f.slice(0, c)), f;
|
|
}
|
|
e = [f];
|
|
}
|
|
c -= g;
|
|
if (!c) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return e.length ? e = 1 < e.length ? [].concat.apply([], e) : e[0] : e;
|
|
}
|
|
;T.prototype.search = function(a, c, b) {
|
|
b || (!c && H(a) ? (b = a, a = "") : H(c) && (b = c, c = 0));
|
|
var e = [], d = 0;
|
|
if (b) {
|
|
a = b.query || a;
|
|
c = b.limit || c;
|
|
d = b.offset || 0;
|
|
var f = b.context;
|
|
var g = b.suggest;
|
|
}
|
|
a = this.encoder.encode(a);
|
|
b = a.length;
|
|
c || (c = 100);
|
|
if (1 === b) {
|
|
return X.call(this, a[0], "", c, d);
|
|
}
|
|
f = this.depth && !1 !== f;
|
|
if (2 === b && f && !g) {
|
|
return X.call(this, a[0], a[1], c, d);
|
|
}
|
|
var h = 0, k = 0;
|
|
if (1 < b) {
|
|
var l = C();
|
|
const n = [];
|
|
for (let t = 0, p; t < b; t++) {
|
|
if ((p = a[t]) && !l[p]) {
|
|
if (g || Y(this, p)) {
|
|
n.push(p), l[p] = 1;
|
|
} else {
|
|
return e;
|
|
}
|
|
const r = p.length;
|
|
h = Math.max(h, r);
|
|
k = k ? Math.min(k, r) : r;
|
|
}
|
|
}
|
|
a = n;
|
|
b = a.length;
|
|
}
|
|
if (!b) {
|
|
return e;
|
|
}
|
|
l = 0;
|
|
if (1 === b) {
|
|
return X.call(this, a[0], "", c, d);
|
|
}
|
|
if (2 === b && f && !g) {
|
|
return X.call(this, a[0], a[1], c, d);
|
|
}
|
|
if (1 < b) {
|
|
if (f) {
|
|
var m = a[0];
|
|
l = 1;
|
|
} else {
|
|
9 < h && 3 < h / k && a.sort(aa);
|
|
}
|
|
}
|
|
for (let n, t; l < b; l++) {
|
|
t = a[l];
|
|
m ? (n = Y(this, t, m), n = Ca(n, e, g, this.P), g && !1 === n && e.length || (m = t)) : (n = Y(this, t, ""), n = Ca(n, e, g, this.resolution));
|
|
if (n) {
|
|
return n;
|
|
}
|
|
if (g && l === b - 1) {
|
|
f = e.length;
|
|
if (!f) {
|
|
if (m) {
|
|
m = "";
|
|
l = -1;
|
|
continue;
|
|
}
|
|
return e;
|
|
}
|
|
if (1 === f) {
|
|
return Ba(e[0], c, d);
|
|
}
|
|
}
|
|
}
|
|
a: {
|
|
a = e;
|
|
e = this.resolution;
|
|
m = g;
|
|
b = a.length;
|
|
g = [];
|
|
f = C();
|
|
for (let n = 0, t, p, r, u; n < e; n++) {
|
|
for (k = 0; k < b; k++) {
|
|
if (r = a[k], n < r.length && (t = r[n])) {
|
|
for (l = 0; l < t.length; l++) {
|
|
p = t[l], (h = f[p]) ? f[p]++ : (h = 0, f[p] = 1), u = g[h] || (g[h] = []), u.push(p);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (a = g.length) {
|
|
if (m) {
|
|
if (1 < g.length) {
|
|
b: {
|
|
for (a = [], e = C(), m = g.length, h = m - 1; 0 <= h; h--) {
|
|
for (m = g[h], f = m.length, k = 0; k < f; k++) {
|
|
if (b = m[k], !e[b]) {
|
|
if (e[b] = 1, d) {
|
|
d--;
|
|
} else {
|
|
if (a.push(b), a.length === c) {
|
|
break b;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
a = (g = g[0]).length > c || d ? g.slice(d, c + d) : g;
|
|
}
|
|
g = a;
|
|
} else {
|
|
if (a < b) {
|
|
e = [];
|
|
break a;
|
|
}
|
|
g = g[a - 1];
|
|
if (c || d) {
|
|
if (g.length > c || d) {
|
|
g = g.slice(d, c + d);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
e = g;
|
|
}
|
|
return e;
|
|
};
|
|
function X(a, c, b, e) {
|
|
return (a = Y(this, a, c)) && a.length ? Ba(a, b, e) : [];
|
|
}
|
|
function Ca(a, c, b, e) {
|
|
let d = [];
|
|
if (a) {
|
|
e = Math.min(a.length, e);
|
|
for (let f = 0, g; f < e; f++) {
|
|
(g = a[f]) && g && (d[f] = g);
|
|
}
|
|
if (d.length) {
|
|
c.push(d);
|
|
return;
|
|
}
|
|
}
|
|
return !b && d;
|
|
}
|
|
function Y(a, c, b) {
|
|
let e;
|
|
b && (e = a.bidirectional && c > b);
|
|
a = b ? (a = a.ctx.get(e ? c : b)) && a.get(e ? b : c) : a.map.get(c);
|
|
return a;
|
|
}
|
|
;T.prototype.remove = function(a, c) {
|
|
const b = this.reg.size && (this.fastupdate ? this.reg.get(a) : this.reg.has(a));
|
|
if (b) {
|
|
if (this.fastupdate) {
|
|
for (let e = 0, d; e < b.length; e++) {
|
|
if (d = b[e]) {
|
|
if (2 > d.length) {
|
|
d.pop();
|
|
} else {
|
|
const f = d.indexOf(a);
|
|
f === b.length - 1 ? d.pop() : d.splice(f, 1);
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
Z(this.map, a), this.depth && Z(this.ctx, a);
|
|
}
|
|
c || this.reg.delete(a);
|
|
}
|
|
this.cache && this.cache.remove(a);
|
|
return this;
|
|
};
|
|
function Z(a, c) {
|
|
let b = 0;
|
|
if (a.constructor === Array) {
|
|
for (let e = 0, d, f; e < a.length; e++) {
|
|
if ((d = a[e]) && d.length) {
|
|
if (f = d.indexOf(c), 0 <= f) {
|
|
1 < d.length ? (d.splice(f, 1), b++) : delete a[e];
|
|
break;
|
|
} else {
|
|
b++;
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
for (let e of a) {
|
|
const d = e[0], f = Z(e[1], c);
|
|
f ? b += f : a.delete(d);
|
|
}
|
|
}
|
|
return b;
|
|
}
|
|
;function T(a, c) {
|
|
if (this.constructor !== T) {
|
|
return new T(a);
|
|
}
|
|
if (a) {
|
|
var b = E(a) ? a : a.preset;
|
|
b && (Aa[b] || console.warn("Preset not found: " + b), a = Object.assign({}, Aa[b], a));
|
|
} else {
|
|
a = {};
|
|
}
|
|
b = a.context || {};
|
|
const e = E(a.encoder) ? za[a.encoder] : a.encode || a.encoder || sa;
|
|
this.encoder = e.encode ? e : "object" === typeof e ? new K(e) : {encode:e};
|
|
let d;
|
|
this.resolution = a.resolution || 9;
|
|
this.tokenize = d = a.tokenize || "strict";
|
|
this.depth = "strict" === d && b.depth || 0;
|
|
this.bidirectional = !1 !== b.bidirectional;
|
|
this.fastupdate = !!a.fastupdate;
|
|
this.score = a.score || null;
|
|
d = !1;
|
|
this.map = new Map();
|
|
this.ctx = new Map();
|
|
this.reg = c || (this.fastupdate ? new Map() : new Set());
|
|
this.P = b.resolution || 1;
|
|
this.rtl = e.rtl || a.rtl || !1;
|
|
this.cache = (d = a.cache || null) && new S(d);
|
|
}
|
|
x = T.prototype;
|
|
x.clear = function() {
|
|
this.map.clear();
|
|
this.ctx.clear();
|
|
this.reg.clear();
|
|
this.cache && this.cache.clear();
|
|
return this;
|
|
};
|
|
x.append = function(a, c) {
|
|
return this.add(a, c, !0);
|
|
};
|
|
x.contain = function(a) {
|
|
return this.reg.has(a);
|
|
};
|
|
x.update = function(a, c) {
|
|
const b = this, e = this.remove(a);
|
|
return e && e.then ? e.then(() => b.add(a, c)) : this.add(a, c);
|
|
};
|
|
function Da(a) {
|
|
let c = 0;
|
|
if (a.constructor === Array) {
|
|
for (let b = 0, e; b < a.length; b++) {
|
|
(e = a[b]) && (c += e.length);
|
|
}
|
|
} else {
|
|
for (const b of a) {
|
|
const e = b[0], d = Da(b[1]);
|
|
d ? c += d : a.delete(e);
|
|
}
|
|
}
|
|
return c;
|
|
}
|
|
x.cleanup = function() {
|
|
if (!this.fastupdate) {
|
|
return console.info('Cleanup the index isn\'t required when not using "fastupdate".'), this;
|
|
}
|
|
Da(this.map);
|
|
this.depth && Da(this.ctx);
|
|
return this;
|
|
};
|
|
x.searchCache = ra;
|
|
x.export = function(a, c, b, e = 0) {
|
|
let d, f;
|
|
switch(e) {
|
|
case 0:
|
|
d = "reg";
|
|
f = ka(this.reg);
|
|
break;
|
|
case 1:
|
|
d = "cfg";
|
|
f = {};
|
|
break;
|
|
case 2:
|
|
d = "map";
|
|
f = N(this.map);
|
|
break;
|
|
case 3:
|
|
d = "ctx";
|
|
f = ja(this.ctx);
|
|
break;
|
|
default:
|
|
return;
|
|
}
|
|
return la.call(this, a, c, d, b, e, f);
|
|
};
|
|
x.import = function(a, c) {
|
|
if (c) {
|
|
switch(E(c) && (c = JSON.parse(c)), a) {
|
|
case "reg":
|
|
this.fastupdate = !1;
|
|
this.reg = new Set(c);
|
|
break;
|
|
case "map":
|
|
this.map = new Map(c);
|
|
break;
|
|
case "ctx":
|
|
this.ctx = new Map(c);
|
|
}
|
|
}
|
|
};
|
|
x.serialize = function(a = !0) {
|
|
if (!this.reg.size) {
|
|
return "";
|
|
}
|
|
let c = "", b = "";
|
|
for (var e of this.reg.keys()) {
|
|
b || (b = typeof e), c += (c ? "," : "") + ("string" === b ? '"' + e + '"' : e);
|
|
}
|
|
c = "index.reg=new Set([" + c + "]);";
|
|
e = "";
|
|
for (var d of this.map.entries()) {
|
|
var f = d[0], g = d[1], h = "";
|
|
for (let m = 0, n; m < g.length; m++) {
|
|
n = g[m] || [""];
|
|
var k = "";
|
|
for (var l = 0; l < n.length; l++) {
|
|
k += (k ? "," : "") + ("string" === b ? '"' + n[l] + '"' : n[l]);
|
|
}
|
|
k = "[" + k + "]";
|
|
h += (h ? "," : "") + k;
|
|
}
|
|
h = '["' + f + '",[' + h + "]]";
|
|
e += (e ? "," : "") + h;
|
|
}
|
|
e = "index.map=new Map([" + e + "]);";
|
|
d = "";
|
|
for (const m of this.ctx.entries()) {
|
|
f = m[0];
|
|
g = m[1];
|
|
for (const n of g.entries()) {
|
|
g = n[0];
|
|
h = n[1];
|
|
k = "";
|
|
for (let t = 0, p; t < h.length; t++) {
|
|
p = h[t] || [""];
|
|
l = "";
|
|
for (let r = 0; r < p.length; r++) {
|
|
l += (l ? "," : "") + ("string" === b ? '"' + p[r] + '"' : p[r]);
|
|
}
|
|
l = "[" + l + "]";
|
|
k += (k ? "," : "") + l;
|
|
}
|
|
k = 'new Map([["' + g + '",[' + k + "]]])";
|
|
k = '["' + f + '",' + k + "]";
|
|
d += (d ? "," : "") + k;
|
|
}
|
|
}
|
|
d = "index.ctx=new Map([" + d + "]);";
|
|
return a ? "function inject(index){" + c + e + d + "}" : c + e + d;
|
|
};
|
|
ia(T.prototype);
|
|
export default {Index:T, Charset:za, Encoder:K, Document:O, Worker:null, Resolver:null, IndexedDB:null, Language:{}};
|
|
|
|
export const Index=T;export const Charset=za;export const Encoder=K;export const Document=O;export const Worker=null;export const Resolver=null;export const IndexedDB=null;export const Language={}; |