@vitorfba/vue-treeselect 1.0.0 → 1.0.1

package/dist/vue3-treeselect.js

@@ -74,11 +74,11 @@ var _t = yt, Nt = Object.prototype, Et = Nt.toString;
 function wt(e) {
   return Et.call(e);
 }
-var Ct = wt, ue = Me, Lt = _t, Mt = Ct, Tt = "[object Null]", Dt = "[object Undefined]", he = ue ? ue.toStringTag : void 0;
-function It(e) {
-  return e == null ? e === void 0 ? Dt : Tt : he && he in Object(e) ? Lt(e) : Mt(e);
+var Ct = wt, ue = Me, Lt = _t, Mt = Ct, Tt = "[object Null]", It = "[object Undefined]", he = ue ? ue.toStringTag : void 0;
+function Dt(e) {
+  return e == null ? e === void 0 ? It : Tt : he && he in Object(e) ? Lt(e) : Mt(e);
 }
-var xt = It;
+var xt = Dt;
 function Rt(e) {
   return e != null && typeof e == "object";
 }
@@ -102,26 +102,26 @@ function Qt(e) {
   var n = Pt.test(e);
   return n || jt.test(e) ? Ut(e.slice(2), n ? 2 : 8) : Ht.test(e) ? fe : +e;
 }
-var De = Qt, Kt = Ce, K = ct, pe = De, qt = "Expected a function", Yt = Math.max, Xt = Math.min;
+var Ie = Qt, Kt = Ce, K = ct, pe = Ie, qt = "Expected a function", Yt = Math.max, Xt = Math.min;
 function Gt(e, t, n) {
   var s, i, o, a, c, d, f = 0, m = !1, p = !1, v = !0;
   if (typeof e != "function")
     throw new TypeError(qt);
   t = pe(t) || 0, Kt(n) && (m = !!n.leading, p = "maxWait" in n, o = p ? Yt(pe(n.maxWait) || 0, t) : o, v = "trailing" in n ? !!n.trailing : v);
   function N(u) {
-    var O = s, I = i;
-    return s = i = void 0, f = u, a = e.apply(I, O), a;
+    var O = s, D = i;
+    return s = i = void 0, f = u, a = e.apply(D, O), a;
   }
-  function D(u) {
+  function I(u) {
     return f = u, c = setTimeout(L, t), m ? N(u) : a;
   }
   function k(u) {
-    var O = u - d, I = u - f, le = t - O;
-    return p ? Xt(le, o - I) : le;
+    var O = u - d, D = u - f, le = t - O;
+    return p ? Xt(le, o - D) : le;
   }
   function z(u) {
-    var O = u - d, I = u - f;
-    return d === void 0 || O >= t || O < 0 || p && I >= o;
+    var O = u - d, D = u - f;
+    return d === void 0 || O >= t || O < 0 || p && D >= o;
   }
   function L() {
     var u = K();
@@ -142,7 +142,7 @@ function Gt(e, t, n) {
     var u = K(), O = z(u);
     if (s = arguments, i = this, d = u, O) {
       if (c === void 0)
-        return D(d);
+        return I(d);
       if (p)
         return clearTimeout(c), c = setTimeout(L, t), N(d);
     }
@@ -167,7 +167,7 @@ var en = function(e, t) {
     f(), e.removeChild(n);
   }
 };
-function Ie(e, t) {
+function De(e, t) {
   const n = e.indexOf(t);
   n !== -1 && e.splice(n, 1);
 }
@@ -192,7 +192,7 @@ function rn(e, t) {
     lastWidth: null,
     lastHeight: null
   }, s = () => {
-    Ie(P, n), P.length || sn();
+    De(P, n), P.length || sn();
   };
   return P.push(n), xe(n), nn(), s;
 }
@@ -229,7 +229,7 @@ function Re(e) {
 function Ae(e) {
   return !!e && (typeof e == "object" || typeof e == "function") && typeof e.then == "function";
 }
-var ln = De, ve = 1 / 0, cn = 17976931348623157e292;
+var ln = Ie, ve = 1 / 0, cn = 17976931348623157e292;
 function un(e) {
   if (!e)
     return e === 0 ? e : 0;
@@ -289,12 +289,12 @@ function Tn(e) {
   var t = e == null ? 0 : e.length;
   return t ? e[t - 1] : void 0;
 }
-var Dn = Tn;
-const be = /* @__PURE__ */ C(Dn);
+var In = Tn;
+const be = /* @__PURE__ */ C(In);
 function _(e, t) {
   return e.indexOf(t) !== -1;
 }
-function In(e, t, n) {
+function Dn(e, t, n) {
   for (let s = 0, i = e.length; s < i; s++)
     if (t.call(n, e[s], s, e)) return e[s];
 }
@@ -360,7 +360,7 @@ const zn = {
       instance: this
     };
   },
-  emits: ["update:modelValue", "updated", "search-change", "close", "open", "select", "deselect"],
+  emits: ["update:modelValue", "updated", "search-change", "close", "open", "select", "deselect", "input"],
   props: {
     /**
      * Whether to allow resetting value even if there are disabled selected nodes.
@@ -1015,7 +1015,7 @@ const zn = {
       this.initialize();
     },
     internalValue(e, t) {
-      q(e, t) && (this.$emit("update:modelValue", this.getValue(), this.getInstanceId()), this.$emit("updated", this.getValue(), this.getInstanceId()));
+      q(e, t) && (this.$emit("update:modelValue", this.getValue(), this.getInstanceId()), this.$emit("input", this.getValue(), this.getInstanceId()), this.$emit("updated", this.getValue(), this.getInstanceId()));
     },
     matchKeys() {
       this.initialize();
@@ -1114,7 +1114,7 @@ const zn = {
       if (this.valueFormat === "id")
         return t;
       const n = this.multiple ? Array.isArray(this.value) ? this.value : [] : this.value ? [this.value] : [];
-      return In(
+      return Dn(
         n,
         (i) => i && this.enhancedNormalizer(i).id === e
       ) || t;
@@ -1369,13 +1369,13 @@ const zn = {
     normalize(e, t, n) {
       let s = t.map((i) => [this.enhancedNormalizer(i), i]).map(([i, o], a) => {
         this.checkDuplication(i), this.verifyNodeShape(i);
-        const { id: c, label: d, children: f, isDefaultExpanded: m } = i, p = e === E, v = p ? 0 : e.level + 1, N = Array.isArray(f) || f === null, D = !N, k = !!i.isDisabled || !this.flat && !p && e.isDisabled, z = !!i.isUnselectable, L = !!i.isNew, M = this.matchKeys.reduce((h, u) => ({
+        const { id: c, label: d, children: f, isDefaultExpanded: m } = i, p = e === E, v = p ? 0 : e.level + 1, N = Array.isArray(f) || f === null, I = !N, k = !!i.isDisabled || !this.flat && !p && e.isDisabled, z = !!i.isUnselectable, L = !!i.isNew, M = this.matchKeys.reduce((h, u) => ({
           ...h,
           [u]: Vn(i[u]).toLocaleLowerCase()
         }), {}), U = p ? M.label : e.nestedSearchLabel + " " + M.label;
         this.forest.nodeMap[c] = S();
         const l = this.forest.nodeMap[c];
-        if (l.id = c, l.label = d, l.level = v, l.ancestors = p ? [] : [e].concat(e.ancestors), l.index = (p ? [] : e.index).concat(a), l.parentNode = e, l.lowerCased = M, l.nestedSearchLabel = U, l.isDisabled = k, l.isUnselectable = z, l.isNew = L, l.isMatched = !1, l.isHighlighted = !1, l.isBranch = N, l.isLeaf = D, l.isRootNode = p, l.raw = o, N) {
+        if (l.id = c, l.label = d, l.level = v, l.ancestors = p ? [] : [e].concat(e.ancestors), l.index = (p ? [] : e.index).concat(a), l.parentNode = e, l.lowerCased = M, l.nestedSearchLabel = U, l.isDisabled = k, l.isUnselectable = z, l.isNew = L, l.isMatched = !1, l.isHighlighted = !1, l.isBranch = N, l.isLeaf = I, l.isRootNode = p, l.raw = o, N) {
           const h = Array.isArray(f);
           l.childrenStates = { ...J(), isLoaded: h }, l.isExpanded = typeof m == "boolean" ? m : v < this.defaultExpandLevel, l.hasMatchedDescendants = !1, l.hasDisabledDescendants = !1, l.isExpandedOnSearch = !1, l.showAllChildrenOnSearch = !1, l.count = {
             [T]: 0,
@@ -1389,7 +1389,7 @@ const zn = {
             () => 'Unloaded branch node detected. "loadOptions" prop is required to load its children.'
           ) : !h && l.isExpanded && this.loadChildrenOptions(l);
         }
-        if (l.ancestors.forEach((h) => h.count[R]++), D && l.ancestors.forEach((h) => h.count[B]++), p || (e.count[T] += 1, D && (e.count[A] += 1), k && (e.hasDisabledDescendants = !0)), n && n[c]) {
+        if (l.ancestors.forEach((h) => h.count[R]++), I && l.ancestors.forEach((h) => h.count[B]++), p || (e.count[T] += 1, I && (e.count[A] += 1), k && (e.hasDisabledDescendants = !0)), n && n[c]) {
           const h = n[c];
           l.isMatched = h.isMatched, l.showAllChildrenOnSearch = h.showAllChildrenOnSearch, l.isHighlighted = h.isHighlighted, h.isBranch && l.isBranch && (l.isExpanded = h.isExpanded, l.isExpandedOnSearch = h.isExpandedOnSearch, h.childrenStates.isLoaded && !l.childrenStates.isLoaded ? l.isExpanded = !1 : l.childrenStates = { ...h.childrenStates });
         }
@@ -1543,7 +1543,7 @@ const zn = {
       this.forest.selectedNodeIds.push(e.id), this.forest.selectedNodeMap[e.id] = !0;
     },
     removeValue(e) {
-      Ie(this.forest.selectedNodeIds, e.id), delete this.forest.selectedNodeMap[e.id];
+      De(this.forest.selectedNodeIds, e.id), delete this.forest.selectedNodeMap[e.id];
     },
     removeLastValue() {
       if (!this.hasValue) return;

package/package.json

@@ -2,7 +2,7 @@
   "name": "@vitorfba/vue-treeselect",
   "author": "vitorfba",
   "license": "MIT",
-  "version": "1.0.0",
+  "version": "1.0.1",
   "description": "Tree select hierarchical component for vue 3 (compat).",
   "type": "module",
   "exports": {