|
|
@@ -3,7 +3,7 @@
|
|
|
* https://github.com/RobinHerbots/Inputmask
|
|
|
* Copyright (c) 2010 - 2024 Robin Herbots
|
|
|
* Licensed under the MIT license
|
|
|
- * Version: 5.0.9-beta.69
|
|
|
+ * Version: 5.0.9-beta.70
|
|
|
*/
|
|
|
!function(e, t) {
|
|
|
if ("object" == typeof exports && "object" == typeof module) module.exports = t(require("jquery")); else if ("function" == typeof define && define.amd) define([ "jquery" ], t); else {
|
|
|
@@ -1443,7 +1443,7 @@
|
|
|
}
|
|
|
function d(e, t, n, i, a) {
|
|
|
var r = t.buffer ? t.buffer.indexOf(a.radixPoint) : -1, o = (-1 !== r || i && a.jitMasking) && new RegExp(a.definitions[9].validator).test(e);
|
|
|
- return a._radixDance && -1 !== r && o && null == t.validPositions[r] ? {
|
|
|
+ return !i && a._radixDance && -1 !== r && o && null == t.validPositions[r] ? {
|
|
|
insert: {
|
|
|
pos: r === n ? r + 1 : r,
|
|
|
c: a.radixPoint
|
|
|
@@ -3381,41 +3381,43 @@
|
|
|
t.revalidateMask = m;
|
|
|
var i = n(6030), a = n(2839), r = n(8711), o = n(4713);
|
|
|
function s(e, t, n, i, a, l) {
|
|
|
- var c, u, p, d, h, m, v, g, y, k, b, x = this, w = this.dependencyLib, P = this.opts, S = x.maskset, O = w.extend(!0, [], S.validPositions), M = w.extend(!0, {}, S.tests), _ = !1, E = !1, j = void 0 !== a ? a : r.getLastValidPosition.call(x);
|
|
|
- if (l && (k = l.begin, b = l.end, l.begin > l.end && (k = l.end, b = l.begin)),
|
|
|
- -1 === j && void 0 === a) c = 0, u = (d = o.getTest.call(x, c)).alternation; else for (;j >= 0; j--) if ((p = S.validPositions[j]) && void 0 !== p.alternation) {
|
|
|
- if (j <= (e || 0) && d && d.locator[p.alternation] !== p.locator[p.alternation]) break;
|
|
|
- c = j, u = S.validPositions[c].alternation, d = p;
|
|
|
- }
|
|
|
- if (void 0 !== u) {
|
|
|
- v = parseInt(c), S.excludes[v] = S.excludes[v] || [], !0 !== e && S.excludes[v].push((0,
|
|
|
- o.getDecisionTaker)(d) + ":" + d.alternation);
|
|
|
+ var c = this, u = this.dependencyLib, p = this.opts, d = c.maskset;
|
|
|
+ if (!c.hasAlternator) return !1;
|
|
|
+ var h, m, v, g, y, k, b, x, w, P, S, O = u.extend(!0, [], d.validPositions), M = u.extend(!0, {}, d.tests), _ = !1, E = !1, j = void 0 !== a ? a : r.getLastValidPosition.call(c);
|
|
|
+ if (l && (P = l.begin, S = l.end, l.begin > l.end && (P = l.end, S = l.begin)),
|
|
|
+ -1 === j && void 0 === a) h = 0, m = (g = o.getTest.call(c, h)).alternation; else for (;j >= 0; j--) if ((v = d.validPositions[j]) && void 0 !== v.alternation) {
|
|
|
+ if (j <= (e || 0) && g && g.locator[v.alternation] !== v.locator[v.alternation]) break;
|
|
|
+ h = j, m = d.validPositions[h].alternation, g = v;
|
|
|
+ }
|
|
|
+ if (void 0 !== m) {
|
|
|
+ b = parseInt(h), d.excludes[b] = d.excludes[b] || [], !0 !== e && d.excludes[b].push((0,
|
|
|
+ o.getDecisionTaker)(g) + ":" + g.alternation);
|
|
|
var T = [], A = -1;
|
|
|
- for (h = v; v < r.getLastValidPosition.call(x, void 0, !0) + 1; h++) -1 === A && e <= h && void 0 !== t && (T.push(t),
|
|
|
- A = T.length - 1), (m = S.validPositions[v]) && !0 !== m.generatedInput && (void 0 === l || h < k || h >= b) && T.push(m.input),
|
|
|
- S.validPositions.splice(v, 1);
|
|
|
- for (-1 === A && void 0 !== t && (T.push(t), A = T.length - 1); void 0 !== S.excludes[v] && S.excludes[v].length < 10; ) {
|
|
|
- for (S.tests = {}, r.resetMaskSet.call(x, !0), _ = !0, h = 0; h < T.length && (g = _.caret || 0 == P.insertMode && null != g ? r.seekNext.call(x, g) : r.getLastValidPosition.call(x, void 0, !0) + 1,
|
|
|
- y = T[h], _ = f.call(x, g, y, !1, i, !0)); h++) h === A && (E = _), 1 == e && _ && (E = {
|
|
|
- caretPos: h
|
|
|
+ for (y = b; b < r.getLastValidPosition.call(c, void 0, !0) + 1; y++) -1 === A && e <= y && void 0 !== t && (T.push(t),
|
|
|
+ A = T.length - 1), (k = d.validPositions[b]) && !0 !== k.generatedInput && (void 0 === l || y < P || y >= S) && T.push(k.input),
|
|
|
+ d.validPositions.splice(b, 1);
|
|
|
+ for (-1 === A && void 0 !== t && (T.push(t), A = T.length - 1); void 0 !== d.excludes[b] && d.excludes[b].length < 10; ) {
|
|
|
+ for (d.tests = {}, r.resetMaskSet.call(c, !0), _ = !0, y = 0; y < T.length && (x = _.caret || 0 == p.insertMode && null != x ? r.seekNext.call(c, x) : r.getLastValidPosition.call(c, void 0, !0) + 1,
|
|
|
+ w = T[y], _ = f.call(c, x, w, !1, i, !0)); y++) y === A && (E = _), 1 == e && _ && (E = {
|
|
|
+ caretPos: y
|
|
|
});
|
|
|
if (_) break;
|
|
|
- if (r.resetMaskSet.call(x), d = o.getTest.call(x, v), S.validPositions = w.extend(!0, [], O),
|
|
|
- S.tests = w.extend(!0, {}, M), !S.excludes[v]) {
|
|
|
- E = s.call(x, e, t, n, i, v - 1, l);
|
|
|
+ if (r.resetMaskSet.call(c), g = o.getTest.call(c, b), d.validPositions = u.extend(!0, [], O),
|
|
|
+ d.tests = u.extend(!0, {}, M), !d.excludes[b]) {
|
|
|
+ E = s.call(c, e, t, n, i, b - 1, l);
|
|
|
break;
|
|
|
}
|
|
|
- if (null != d.alternation) {
|
|
|
- var D = (0, o.getDecisionTaker)(d);
|
|
|
- if (-1 !== S.excludes[v].indexOf(D + ":" + d.alternation)) {
|
|
|
- E = s.call(x, e, t, n, i, v - 1, l);
|
|
|
+ if (null != g.alternation) {
|
|
|
+ var D = (0, o.getDecisionTaker)(g);
|
|
|
+ if (-1 !== d.excludes[b].indexOf(D + ":" + g.alternation)) {
|
|
|
+ E = s.call(c, e, t, n, i, b - 1, l);
|
|
|
break;
|
|
|
}
|
|
|
- for (S.excludes[v].push(D + ":" + d.alternation), h = v; h < r.getLastValidPosition.call(x, void 0, !0) + 1; h++) S.validPositions.splice(v);
|
|
|
- } else delete S.excludes[v];
|
|
|
+ for (d.excludes[b].push(D + ":" + g.alternation), y = b; y < r.getLastValidPosition.call(c, void 0, !0) + 1; y++) d.validPositions.splice(b);
|
|
|
+ } else delete d.excludes[b];
|
|
|
}
|
|
|
}
|
|
|
- return E && !1 === P.keepStatic || delete S.excludes[v], E;
|
|
|
+ return E && !1 === p.keepStatic || delete d.excludes[b], E;
|
|
|
}
|
|
|
function l(e, t, n) {
|
|
|
var i = this.opts, r = this.maskset;
|