mirror_js/flexsearch
1
0
Fork 0
mirror of https://github.com/nextapps-de/flexsearch.git synced 2025-09-26 05:19:00 +02:00
Code Issues Releases Wiki Activity

keep scoring on intersect-union (tags)

Browse Source
This commit is contained in:
Thomas Wilkerling
2025-03-11 09:40:47 +01:00
parent c7cb343f0a
commit bf86d833be
25 changed files with 513 additions and 341 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
dist/flexsearch.bundle.module.debug.js vendored
View File

@@ -110,10 +110,19 @@ G.prototype.assign = function(a) {
if (c = c.char) {
e += "object" === typeof c ? c.join("") : c;
}
this.split = new RegExp("[" + (b ? "^" : "") + e + "]+", "u");
try {
this.split = new RegExp("[" + (b ? "^" : "") + e + "]+", "u");
} catch (f) {
this.split = /\s+/;
}
this.numeric = d;
} else {
this.split = y(c, fa, this.split), this.numeric = y(this.numeric, !0);
try {
this.split = y(c, fa, this.split);
} catch (d) {
this.split = /\s+/;
}
this.numeric = y(this.numeric, !0);
}
this.prepare = y(a.prepare, null, this.prepare);
this.finalize = y(a.finalize, null, this.finalize);
@@ -1048,17 +1057,17 @@ function Ia(a, b, c, d, e) {
return g;
}
function Ja(a, b) {
const c = z(), d = z(), e = [];
for (let f = 0; f < a.length; f++) {
c[a[f]] = 1;
}
for (let f = 0, g; f < b.length; f++) {
g = b[f];
for (let h = 0, k; h < g.length; h++) {
k = g[h], c[k] && !d[k] && (d[k] = 1, e.push(k));
const c = z(), d = [];
for (let e = 0, f; e < b.length; e++) {
f = b[e];
for (let g = 0; g < f.length; g++) {
c[f[g]] = 1;
}
}
return e;
for (let e = 0, f; e < a.length; e++) {
f = a[e], 1 === c[f] && (d.push(f), c[f] = 2);
}
return d;
}
;let T = 1;
O.prototype.search = function(a, b, c) {