@vitorfba/vue-treeselect 1.0.1 → 1.0.3

package/dist/vue3-treeselect.js

@@ -1,4 +1,4 @@
-import { createVNode as r, mergeProps as Pe, openBlock as V, createElementBlock as j, createElementVNode as $, normalizeClass as se, renderSlot as je, createTextVNode as Q, resolveComponent as H, defineComponent as Ue, createBlock as Qe, Teleport as Ke } from "vue";
+import { createVNode as r, mergeProps as Pe, createElementBlock as U, openBlock as V, createElementVNode as $, normalizeClass as se, renderSlot as je, resolveComponent as P, createTextVNode as K, defineComponent as Ue, createBlock as Qe, Teleport as Ke } from "vue";
 var F = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
 function C(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
@@ -102,7 +102,7 @@ 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 Ie = Qt, Kt = Ce, K = ct, pe = Ie, qt = "Expected a function", Yt = Math.max, Xt = Math.min;
+var Ie = Qt, Kt = Ce, q = 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")
@@ -124,7 +124,7 @@ function Gt(e, t, n) {
     return d === void 0 || O >= t || O < 0 || p && D >= o;
   }
   function L() {
-    var u = K();
+    var u = q();
     if (z(u))
       return M(u);
     c = setTimeout(L, k(u));
@@ -132,14 +132,14 @@ function Gt(e, t, n) {
   function M(u) {
     return c = void 0, v && s ? N(u) : (s = i = void 0, a);
   }
-  function U() {
+  function Q() {
     c !== void 0 && clearTimeout(c), f = 0, s = d = i = c = void 0;
   }
   function l() {
-    return c === void 0 ? a : M(K());
+    return c === void 0 ? a : M(q());
   }
   function h() {
-    var u = K(), O = z(u);
+    var u = q(), O = z(u);
     if (s = arguments, i = this, d = u, O) {
       if (c === void 0)
         return I(d);
@@ -148,7 +148,7 @@ function Gt(e, t, n) {
     }
     return c === void 0 && (c = setTimeout(L, t)), a;
   }
-  return h.cancel = U, h.flush = l, h;
+  return h.cancel = Q, h.flush = l, h;
 }
 var Jt = Gt;
 const Zt = /* @__PURE__ */ C(Jt);
@@ -172,10 +172,10 @@ function De(e, t) {
   n !== -1 && e.splice(n, 1);
 }
 let ie;
-const P = [], tn = 100;
+const j = [], tn = 100;
 function nn() {
   ie = setInterval(() => {
-    P.forEach(xe);
+    j.forEach(xe);
   }, tn);
 }
 function sn() {
@@ -192,9 +192,9 @@ function rn(e, t) {
     lastWidth: null,
     lastHeight: null
   }, s = () => {
-    De(P, n), P.length || sn();
+    De(j, n), j.length || sn();
   };
-  return P.push(n), xe(n), nn(), s;
+  return j.push(n), xe(n), nn(), s;
 }
 function ge(e, t) {
   const n = document.documentMode === 9;
@@ -298,13 +298,13 @@ 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];
 }
-function q(e, t) {
+function Y(e, t) {
   if (e.length !== t.length) return !0;
   for (let n = 0; n < e.length; n++)
     if (e[n] !== t[n]) return !0;
   return !1;
 }
-const E = null, oe = 0, $e = 1, Ve = 2, T = "ALL_CHILDREN", R = "ALL_DESCENDANTS", A = "LEAF_CHILDREN", B = "LEAF_DESCENDANTS", xn = "LOAD_ROOT_OPTIONS", Rn = "LOAD_CHILDREN_OPTIONS", An = "ASYNC_SEARCH", Y = "ALL", W = "BRANCH_PRIORITY", X = "LEAF_PRIORITY", G = "ALL_WITH_INDETERMINATE", Oe = "ORDER_SELECTED", ye = "LEVEL", _e = "INDEX", g = {
+const E = null, oe = 0, $e = 1, Ve = 2, T = "ALL_CHILDREN", R = "ALL_DESCENDANTS", A = "LEAF_CHILDREN", B = "LEAF_DESCENDANTS", xn = "LOAD_ROOT_OPTIONS", Rn = "LOAD_CHILDREN_OPTIONS", An = "ASYNC_SEARCH", X = "ALL", W = "BRANCH_PRIORITY", G = "LEAF_PRIORITY", J = "ALL_WITH_INDETERMINATE", Oe = "ORDER_SELECTED", ye = "LEVEL", _e = "INDEX", g = {
   BACKSPACE: 8,
   ENTER: 13,
   ESCAPE: 27,
@@ -334,7 +334,7 @@ function ke(e, t) {
 function $n(e, t) {
   return e.level === t.level ? ke(e, t) : e.level - t.level;
 }
-function J() {
+function Z() {
   return {
     isLoaded: !1,
     isLoading: !1,
@@ -347,7 +347,7 @@ function Vn(e) {
 function we(e, t, n) {
   return e ? Xe(t, n) : _(n, t);
 }
-function Z(e) {
+function H(e) {
   return e.message || /* istanbul ignore next */
   String(e);
 }
@@ -842,7 +842,7 @@ const zn = {
       type: String,
       default: W,
       validator(e) {
-        return _([Y, W, X, G], e);
+        return _([X, W, G, J], e);
       }
     },
     /**
@@ -896,7 +896,7 @@ const zn = {
         selectedNodeMap: S()
       },
       // States of root options.
-      rootOptionsStates: J(),
+      rootOptionsStates: Z(),
       localSearch: {
         // Has user entered any query to search local options?
         active: !1,
@@ -924,19 +924,19 @@ const zn = {
      */
     internalValue() {
       let e;
-      if (this.single || this.flat || this.disableBranchNodes || this.valueConsistsOf === Y)
+      if (this.single || this.flat || this.disableBranchNodes || this.valueConsistsOf === X)
         e = this.forest.selectedNodeIds.slice();
       else if (this.valueConsistsOf === W)
         e = this.forest.selectedNodeIds.filter((t) => {
           const n = this.getNode(t);
           return n.isRootNode ? !0 : !this.isSelected(n.parentNode);
         });
-      else if (this.valueConsistsOf === X)
+      else if (this.valueConsistsOf === G)
         e = this.forest.selectedNodeIds.filter((t) => {
           const n = this.getNode(t);
           return n.isLeaf ? !0 : n.children.length === 0;
         });
-      else if (this.valueConsistsOf === G) {
+      else if (this.valueConsistsOf === J) {
         const t = [];
         e = this.forest.selectedNodeIds.slice(), this.selectedNodes.forEach((n) => {
           n.ancestors.forEach((s) => {
@@ -1015,7 +1015,7 @@ const zn = {
       this.initialize();
     },
     internalValue(e, t) {
-      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()));
+      Y(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();
@@ -1035,7 +1035,7 @@ const zn = {
     },
     value() {
       const e = this.extractCheckedNodeIdsFromValue();
-      q(e, this.internalValue) && this.fixSelectedNodeIds(e);
+      Y(e, this.internalValue) && this.fixSelectedNodeIds(e);
     }
   },
   methods: {
@@ -1121,7 +1121,7 @@ const zn = {
     },
     fixSelectedNodeIds(e) {
       let t = [];
-      if (this.single || this.flat || this.disableBranchNodes || this.valueConsistsOf === Y)
+      if (this.single || this.flat || this.disableBranchNodes || this.valueConsistsOf === X)
         t = e;
       else if (this.valueConsistsOf === W)
         e.forEach((s) => {
@@ -1131,13 +1131,13 @@ const zn = {
             t.push(o.id);
           });
         });
-      else if (this.valueConsistsOf === X) {
+      else if (this.valueConsistsOf === G) {
         const s = S(), i = e.slice();
         for (; i.length; ) {
           const o = i.shift(), a = this.getNode(o);
           t.push(o), !a.isRootNode && (a.parentNode.id in s || (s[a.parentNode.id] = a.parentNode.children.length), --s[a.parentNode.id] === 0 && i.push(a.parentNode.id));
         }
-      } else if (this.valueConsistsOf === G) {
+      } else if (this.valueConsistsOf === J) {
         const s = S(), i = e.filter((o) => {
           const a = this.getNode(o);
           return a.isLeaf || a.children.length === 0;
@@ -1147,7 +1147,7 @@ const zn = {
           t.push(o), !a.isRootNode && (a.parentNode.id in s || (s[a.parentNode.id] = a.parentNode.children.length), --s[a.parentNode.id] === 0 && i.push(a.parentNode.id));
         }
       }
-      q(this.forest.selectedNodeIds, t) && (this.forest.selectedNodeIds = t), this.buildForestState();
+      Y(this.forest.selectedNodeIds, t) && (this.forest.selectedNodeIds = t), this.buildForestState();
     },
     keepDataOfSelectedNodes(e) {
       this.forest.selectedNodeIds.forEach((t) => {
@@ -1244,22 +1244,22 @@ const zn = {
           return t.isLoading;
         },
         start: () => {
-          t.isLoading = !0, t.isLoaded = !1, t.loadingError = "";
+          t.isLoading = !0, t.isLoaded = !1, t.loadingError = "", this.rootOptionsStates.isLoading = !0, this.rootOptionsStates.isLoaded = !1, this.rootOptionsStates.loadingError = "";
         },
         succeed: (s) => {
-          t.isLoaded = !0, t.options = s, this.trigger.searchQuery === e && n();
+          t.isLoaded = !0, t.options = Array.isArray(s) ? s : s || [], this.rootOptionsStates.isLoaded = !0, this.trigger.searchQuery === e && n();
         },
         fail: (s) => {
-          t.loadingError = Z(s);
+          t.loadingError = H(s), this.rootOptionsStates.loadingError = H(s);
         },
         end: () => {
-          t.isLoading = !1;
+          t.isLoading = !1, this.rootOptionsStates.isLoading = !1;
         }
       });
     },
     getRemoteSearchEntry() {
       const { searchQuery: e } = this.trigger, t = this.remoteSearch[e] || {
-        ...J(),
+        ...Z(),
         options: []
       };
       if (this.$watch(
@@ -1372,12 +1372,12 @@ const zn = {
         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;
+        }), {}), Q = 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 = I, 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 = Q, 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 = {
+          l.childrenStates = { ...Z(), 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,
             [R]: 0,
             [A]: 0,
@@ -1414,7 +1414,7 @@ const zn = {
           });
         },
         fail: (e) => {
-          this.rootOptionsStates.loadingError = Z(e);
+          this.rootOptionsStates.loadingError = H(e);
         },
         end: () => {
           this.rootOptionsStates.isLoading = !1;
@@ -1440,7 +1440,7 @@ const zn = {
           this.getNode(t).childrenStates.isLoaded = !0;
         },
         fail: (s) => {
-          this.getNode(t).childrenStates.loadingError = Z(s);
+          this.getNode(t).childrenStates.loadingError = H(s);
         },
         end: () => {
           this.getNode(t).childrenStates.isLoading = !1;
@@ -1836,7 +1836,7 @@ const Wn = {
   viewBox: "0 0 348.333 348.333"
 };
 function Qn(e, t, n, s, i, o) {
-  return V(), j("svg", Un, t[0] || (t[0] = [
+  return V(), U("svg", Un, t[0] || (t[0] = [
     $("path", { d: "M336.559 68.611L231.016 174.165l105.543 105.549c15.699 15.705 15.699 41.145 0 56.85-7.844 7.844-18.128 11.769-28.407 11.769-10.296 0-20.581-3.919-28.419-11.769L174.167 231.003 68.609 336.563c-7.843 7.844-18.128 11.769-28.416 11.769-10.285 0-20.563-3.919-28.413-11.769-15.699-15.698-15.699-41.139 0-56.85l105.54-105.549L11.774 68.611c-15.699-15.699-15.699-41.145 0-56.844 15.696-15.687 41.127-15.687 56.829 0l105.563 105.554L279.721 11.767c15.705-15.687 41.139-15.687 56.832 0 15.705 15.699 15.705 41.145.006 56.844z" }, null, -1)
   ]));
 }
@@ -1926,7 +1926,7 @@ const We = /* @__PURE__ */ ae(jn, [["render", Qn]]), Kn = {
   viewBox: "0 0 292.362 292.362"
 };
 function Gn(e, t, n, s, i, o) {
-  return V(), j("svg", Xn, t[0] || (t[0] = [
+  return V(), U("svg", Xn, t[0] || (t[0] = [
     $("path", { d: "M286.935 69.377c-3.614-3.617-7.898-5.424-12.848-5.424H18.274c-4.952 0-9.233 1.807-12.85 5.424C1.807 72.998 0 77.279 0 82.228c0 4.948 1.807 9.229 5.424 12.847l127.907 127.907c3.621 3.617 7.902 5.428 12.85 5.428s9.233-1.811 12.847-5.428L286.935 95.074c3.613-3.617 5.427-7.898 5.427-12.847 0-4.948-1.814-9.229-5.427-12.85z" }, null, -1)
   ]));
 }
@@ -2043,7 +2043,7 @@ const He = /* @__PURE__ */ ae(Yn, [["render", Gn]]), Jn = {
     }
   },
   setup(e) {
-    return (t, n) => (V(), j("div", {
+    return (t, n) => (V(), U("div", {
       class: se(`vue-treeselect__tip vue-treeselect__${e.type}-tip`)
     }, [
       $("div", Zn, [
@@ -2132,7 +2132,7 @@ const ts = {
         /*node.isLeaf && */
         e.hasBranchNodes ? (ee || (ee = r("div", {
           class: "vue-treeselect__option-arrow-placeholder"
-        }, [Q(" ")])), ee) : null
+        }, [K(" ")])), ee) : null
       );
     },
     renderLabelContainer(e) {
@@ -2185,13 +2185,13 @@ const ts = {
         class: i
       }, [t.label, n && r("span", {
         class: o
-      }, [Q("("), s, Q(")")])]);
+      }, [K("("), s, K(")")])]);
     },
     renderSubOptions() {
       const {
         node: e
       } = this;
-      return e.childrenStates.isLoaded ? e.children.map((t) => r(H("vue-treeselect--option"), {
+      return e.childrenStates.isLoaded ? e.children.map((t) => r(P("vue-treeselect--option"), {
         node: t,
         key: t.id
       }, null)) : null;
@@ -2375,7 +2375,7 @@ const ts = {
       const {
         instance: e
       } = this, t = e.getRemoteSearchEntry(), n = e.trigger.searchQuery === "" && !e.defaultOptions, s = n ? !1 : t.isLoaded && t.options.length === 0;
-      return n ? this.renderSearchPromptTip() : t.isLoading ? this.renderLoadingOptionsTip() : t.loadingError ? this.renderAsyncSearchLoadingErrorTip() : s ? this.renderNoResultsTip() : this.renderOptionList();
+      return n ? this.renderSearchPromptTip() : e.rootOptionsStates.isLoading ? this.renderLoadingOptionsTip() : e.rootOptionsStates.loadingError ? this.renderAsyncSearchLoadingErrorTip() : s ? this.renderNoResultsTip() : this.renderOptionList();
     },
     renderOptionList() {
       const {
@@ -2582,8 +2582,8 @@ const ts = {
   }
 });
 function rs(e, t, n, s, i, o) {
-  const a = H("HiddenFields"), c = H("Control"), d = H("Menu");
-  return V(), j("div", {
+  const a = P("HiddenFields"), c = P("Control"), d = P("Menu");
+  return V(), U("div", {
     ref: "wrapper",
     class: se(e.wrapperClass)
   }, [

package/package.json

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