Skip to content

Commit

Permalink
fix esm export (build)
Browse files Browse the repository at this point in the history
  • Loading branch information
ts-thomas committed Jan 7, 2024
1 parent b8279eb commit 5c54b46
Show file tree
Hide file tree
Showing 19 changed files with 772 additions and 779 deletions.
383 changes: 191 additions & 192 deletions dist/flexsearch.bundle.debug.js

Large diffs are not rendered by default.

56 changes: 28 additions & 28 deletions dist/flexsearch.bundle.min.js

Large diffs are not rendered by default.

379 changes: 187 additions & 192 deletions dist/flexsearch.bundle.module.debug.js

Large diffs are not rendered by default.

56 changes: 28 additions & 28 deletions dist/flexsearch.bundle.module.min.js

Large diffs are not rendered by default.

203 changes: 101 additions & 102 deletions dist/flexsearch.compact.debug.js

Large diffs are not rendered by default.

40 changes: 20 additions & 20 deletions dist/flexsearch.compact.min.js

Large diffs are not rendered by default.

199 changes: 97 additions & 102 deletions dist/flexsearch.compact.module.debug.js

Large diffs are not rendered by default.

40 changes: 20 additions & 20 deletions dist/flexsearch.compact.module.min.js

Large diffs are not rendered by default.

30 changes: 15 additions & 15 deletions dist/flexsearch.es5.debug.js
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/**!
* FlexSearch.js v0.7.39 (Es5)
* FlexSearch.js v0.7.40 (Es5)
* Author and Copyright: Thomas Wilkerling
* Licence: Apache-2.0
* Hosted by Nextapps GmbH
Expand Down Expand Up @@ -1162,9 +1162,9 @@ t.search = function(a, b, c, d) {
if (l && w) {
var z = [], B = 0;
p && (z[0] = [u]);
var Z = 0, H = void 0;
for (H = void 0; Z < l.length; Z++) {
if (H = l[Z], w = (H = this.l[H]) && H.length) {
var Y = 0, H = void 0;
for (H = void 0; Y < l.length; Y++) {
if (H = l[Y], w = (H = this.l[H]) && H.length) {
B++, z[z.length] = p ? [H] : H;
}
}
Expand All @@ -1178,10 +1178,10 @@ t.search = function(a, b, c, d) {
}
}
if (q) {
var La = this;
return new Promise(function(Ma) {
Promise.all(q).then(function(Na) {
Ma(La.search(a, b, c, Na));
var Ka = this;
return new Promise(function(La) {
Promise.all(q).then(function(Ma) {
La(Ka.search(a, b, c, Ma));
});
});
}
Expand Down Expand Up @@ -1291,12 +1291,12 @@ function Fa(a) {
b.normalize && (b = b.normalize("NFD").replace(la, ""));
return ja.call(this, b.toLowerCase(), !a.normalize && Ha);
}
;var Ja = {encode:Ia, G:!1, H:"strict"}, Ka = /[^a-z0-9]+/, Oa = {b:"p", v:"f", w:"f", z:"s", x:"s", "\u00df":"s", d:"t", n:"m", c:"k", g:"k", j:"k", q:"k", i:"e", y:"e", u:"o"};
;var Ja = {encode:Ia, G:!1, H:"strict"}, Na = /[^a-z0-9]+/, Oa = {b:"p", v:"f", w:"f", z:"s", x:"s", "\u00df":"s", d:"t", n:"m", c:"k", g:"k", j:"k", q:"k", i:"e", y:"e", u:"o"};
function Ia(a) {
a = Fa.call(this, a).join(" ");
var b = [];
if (a) {
for (var c = a.split(Ka), d = c.length, e = 0, g, f = 0; e < d; e++) {
for (var c = a.split(Na), d = c.length, e = 0, g, f = 0; e < d; e++) {
if ((a = c[e]) && (!this.filter || !this.filter[a])) {
g = a[0];
for (var h = Oa[g] || g, k = h, l = 1; l < a.length; l++) {
Expand All @@ -1323,12 +1323,12 @@ K["latin:simple"] = Ga;
K["latin:balance"] = Ja;
K["latin:advanced"] = Qa;
K["latin:extra"] = Ta;
var Y = self, Va, Wa = {Index:N, Document:T, Worker:R, registerCharset:function(a, b) {
var Z = {Index:N, Document:T, Worker:R, registerCharset:function(a, b) {
K[a] = b;
}, registerLanguage:function(a, b) {
qa[a] = b;
}};
(Va = Y.define) && Va.amd ? Va([], function() {
return Wa;
}) : Y.exports ? Y.exports = Wa : Y.FlexSearch = Wa;
}}, Va;
(Va = self.define) && Va.amd ? Va([], function() {
return Z;
}) : self.exports ? self.exports = Z : self.FlexSearch = Z;
}(this));
8 changes: 4 additions & 4 deletions dist/flexsearch.es5.min.js

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

33 changes: 16 additions & 17 deletions dist/flexsearch.light.debug.js
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/**!
* FlexSearch.js v0.7.39 (Light)
* FlexSearch.js v0.7.40 (Light)
* Author and Copyright: Thomas Wilkerling
* Licence: Apache-2.0
* Hosted by Nextapps GmbH
Expand Down Expand Up @@ -37,7 +37,7 @@ function C(a, b) {
}
return a;
}
;function D(a) {
;function E(a) {
if (a = ("" + a).toLowerCase()) {
if (this.o && (a = C(a, this.o)), this.A && 1 < a.length && (a = C(a, this.A)), A || "" === A) {
const b = a.split(A);
Expand Down Expand Up @@ -65,10 +65,10 @@ function H(a, b, c, d) {
const m = a[n], r = m.length, p = y();
let q = !f;
for (let k = 0; k < r; k++) {
const u = m[k], M = u.length;
if (M) {
for (let E = 0, x, w; E < M; E++) {
if (w = u[E], f) {
const u = m[k], L = u.length;
if (L) {
for (let D = 0, x, w; D < L; D++) {
if (w = u[D], f) {
if (f[w]) {
if (!n) {
if (c) {
Expand All @@ -85,8 +85,8 @@ function H(a, b, c, d) {
q = !0;
}
if (d && (x = (g[w] || 0) + 1, g[w] = x, x < e)) {
const N = d[x - 2] || (d[x - 2] = []);
N[N.length] = w;
const M = d[x - 2] || (d[x - 2] = []);
M[M.length] = w;
}
} else {
p[w] = 1;
Expand Down Expand Up @@ -135,7 +135,7 @@ function H(a, b, c, d) {
a = {};
}
let e, h, f = a.context || {};
this.encode = a.encode || d && d.encode || D;
this.encode = a.encode || d && d.encode || E;
this.register = b || y();
this.s = e = a.resolution || 9;
this.B = b = d && d.B || a.tokenize || "strict";
Expand Down Expand Up @@ -268,7 +268,7 @@ I.prototype.search = function(a, b, c) {
g ? (n = a[0], c = 1) : 1 < e && a.sort(z);
for (let m, r; c < e; c++) {
r = a[c];
g ? (m = L(this, d, h, b, f, 2 === e, r, n), h && !1 === m && d.length || (n = r)) : m = L(this, d, h, b, f, 1 === e, r);
g ? (m = N(this, d, h, b, f, 2 === e, r, n), h && !1 === m && d.length || (n = r)) : m = N(this, d, h, b, f, 1 === e, r);
if (m) {
return m;
}
Expand All @@ -289,7 +289,7 @@ I.prototype.search = function(a, b, c) {
}
return H(d, b, f, h);
};
function L(a, b, c, d, e, h, f, g) {
function N(a, b, c, d, e, h, f, g) {
let l = [], n = g ? a.l : a.map;
a.g || (n = P(n, f, g, a.j));
if (n) {
Expand Down Expand Up @@ -360,14 +360,13 @@ function Q(a, b, c, d, e) {
}
return h;
}
;const R = self;
let S;
const T = {Index:I, Document:null, Worker:null, registerCharset:function(a, b) {
;const R = {Index:I, Document:null, Worker:null, registerCharset:function(a, b) {
G[a] = b;
}, registerLanguage:function(a, b) {
F[a] = b;
}};
(S = R.define) && S.amd ? S([], function() {
return T;
}) : R.exports ? R.exports = T : R.FlexSearch = T;
let S;
(S = self.define) && S.amd ? S([], function() {
return R;
}) : self.exports ? self.exports = R : self.FlexSearch = R;
}(this));
Loading

0 comments on commit 5c54b46

Please sign in to comment.