@bwg-ui/core 1.1.21 → 1.1.23

package/dist/chunks/enc-base64-BQYwLKgk.js

@@ -0,0 +1,102 @@
+import { aQ as A } from "./apiUtils-DxzLqPhU.js";
+import { r as b } from "./core-bHd8azE6.js";
+function O(p, g) {
+  for (var f = 0; f < g.length; f++) {
+    const a = g[f];
+    if (typeof a != "string" && !Array.isArray(a)) {
+      for (const c in a)
+        if (c !== "default" && !(c in p)) {
+          const i = Object.getOwnPropertyDescriptor(a, c);
+          i && Object.defineProperty(p, c, i.get ? i : {
+            enumerable: !0,
+            get: () => a[c]
+          });
+        }
+    }
+  }
+  return Object.freeze(Object.defineProperty(p, Symbol.toStringTag, { value: "Module" }));
+}
+var h = { exports: {} }, E = h.exports, x;
+function q() {
+  return x || (x = 1, (function(p, g) {
+    (function(f, a) {
+      p.exports = a(b());
+    })(E, function(f) {
+      return (function() {
+        var a = f, c = a.lib, i = c.WordArray, _ = a.enc;
+        _.Base64 = {
+          /**
+           * Converts a word array to a Base64 string.
+           *
+           * @param {WordArray} wordArray The word array.
+           *
+           * @return {string} The Base64 string.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);
+           */
+          stringify: function(t) {
+            var s = t.words, o = t.sigBytes, n = this._map;
+            t.clamp();
+            for (var e = [], r = 0; r < o; r += 3)
+              for (var v = s[r >>> 2] >>> 24 - r % 4 * 8 & 255, l = s[r + 1 >>> 2] >>> 24 - (r + 1) % 4 * 8 & 255, d = s[r + 2 >>> 2] >>> 24 - (r + 2) % 4 * 8 & 255, C = v << 16 | l << 8 | d, u = 0; u < 4 && r + u * 0.75 < o; u++)
+                e.push(n.charAt(C >>> 6 * (3 - u) & 63));
+            var m = n.charAt(64);
+            if (m)
+              for (; e.length % 4; )
+                e.push(m);
+            return e.join("");
+          },
+          /**
+           * Converts a Base64 string to a word array.
+           *
+           * @param {string} base64Str The Base64 string.
+           *
+           * @return {WordArray} The word array.
+           *
+           * @static
+           *
+           * @example
+           *
+           *     var wordArray = CryptoJS.enc.Base64.parse(base64String);
+           */
+          parse: function(t) {
+            var s = t.length, o = this._map, n = this._reverseMap;
+            if (!n) {
+              n = this._reverseMap = [];
+              for (var e = 0; e < o.length; e++)
+                n[o.charCodeAt(e)] = e;
+            }
+            var r = o.charAt(64);
+            if (r) {
+              var v = t.indexOf(r);
+              v !== -1 && (s = v);
+            }
+            return y(t, s, n);
+          },
+          _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
+        };
+        function y(t, s, o) {
+          for (var n = [], e = 0, r = 0; r < s; r++)
+            if (r % 4) {
+              var v = o[t.charCodeAt(r - 1)] << r % 4 * 2, l = o[t.charCodeAt(r)] >>> 6 - r % 4 * 2, d = v | l;
+              n[e >>> 2] |= d << 24 - e % 4 * 8, e++;
+            }
+          return i.create(n, e);
+        }
+      })(), f.enc.Base64;
+    });
+  })(h)), h.exports;
+}
+var B = q();
+const w = /* @__PURE__ */ A(B), D = /* @__PURE__ */ O({
+  __proto__: null,
+  default: w
+}, [B]);
+export {
+  D as e
+};
+//# sourceMappingURL=enc-base64-BQYwLKgk.js.map

package/dist/chunks/enc-base64-BQYwLKgk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"enc-base64-BQYwLKgk.js","sources":["../../node_modules/crypto-js/enc-base64.js"],"sourcesContent":[";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t    // Shortcuts\n\t    var C = CryptoJS;\n\t    var C_lib = C.lib;\n\t    var WordArray = C_lib.WordArray;\n\t    var C_enc = C.enc;\n\n\t    /**\n\t     * Base64 encoding strategy.\n\t     */\n\t    var Base64 = C_enc.Base64 = {\n\t        /**\n\t         * Converts a word array to a Base64 string.\n\t         *\n\t         * @param {WordArray} wordArray The word array.\n\t         *\n\t         * @return {string} The Base64 string.\n\t         *\n\t         * @static\n\t         *\n\t         * @example\n\t         *\n\t         *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);\n\t         */\n\t        stringify: function (wordArray) {\n\t            // Shortcuts\n\t            var words = wordArray.words;\n\t            var sigBytes = wordArray.sigBytes;\n\t            var map = this._map;\n\n\t            // Clamp excess bits\n\t            wordArray.clamp();\n\n\t            // Convert\n\t            var base64Chars = [];\n\t            for (var i = 0; i < sigBytes; i += 3) {\n\t                var byte1 = (words[i >>> 2]       >>> (24 - (i % 4) * 8))       & 0xff;\n\t                var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;\n\t                var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;\n\n\t                var triplet = (byte1 << 16) | (byte2 << 8) | byte3;\n\n\t                for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {\n\t                    base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));\n\t                }\n\t            }\n\n\t            // Add padding\n\t            var paddingChar = map.charAt(64);\n\t            if (paddingChar) {\n\t                while (base64Chars.length % 4) {\n\t                    base64Chars.push(paddingChar);\n\t                }\n\t            }\n\n\t            return base64Chars.join('');\n\t        },\n\n\t        /**\n\t         * Converts a Base64 string to a word array.\n\t         *\n\t         * @param {string} base64Str The Base64 string.\n\t         *\n\t         * @return {WordArray} The word array.\n\t         *\n\t         * @static\n\t         *\n\t         * @example\n\t         *\n\t         *     var wordArray = CryptoJS.enc.Base64.parse(base64String);\n\t         */\n\t        parse: function (base64Str) {\n\t            // Shortcuts\n\t            var base64StrLength = base64Str.length;\n\t            var map = this._map;\n\t            var reverseMap = this._reverseMap;\n\n\t            if (!reverseMap) {\n\t                    reverseMap = this._reverseMap = [];\n\t                    for (var j = 0; j < map.length; j++) {\n\t                        reverseMap[map.charCodeAt(j)] = j;\n\t                    }\n\t            }\n\n\t            // Ignore padding\n\t            var paddingChar = map.charAt(64);\n\t            if (paddingChar) {\n\t                var paddingIndex = base64Str.indexOf(paddingChar);\n\t                if (paddingIndex !== -1) {\n\t                    base64StrLength = paddingIndex;\n\t                }\n\t            }\n\n\t            // Convert\n\t            return parseLoop(base64Str, base64StrLength, reverseMap);\n\n\t        },\n\n\t        _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='\n\t    };\n\n\t    function parseLoop(base64Str, base64StrLength, reverseMap) {\n\t      var words = [];\n\t      var nBytes = 0;\n\t      for (var i = 0; i < base64StrLength; i++) {\n\t          if (i % 4) {\n\t              var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2);\n\t              var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2);\n\t              var bitsCombined = bits1 | bits2;\n\t              words[nBytes >>> 2] |= bitsCombined << (24 - (nBytes % 4) * 8);\n\t              nBytes++;\n\t          }\n\t      }\n\t      return WordArray.create(words, nBytes);\n\t    }\n\t}());\n\n\n\treturn CryptoJS.enc.Base64;\n\n}));"],"names":["root","factory","module","require$$0","this","CryptoJS","C","C_lib","WordArray","C_enc","wordArray","words","sigBytes","map","base64Chars","i","byte1","byte2","byte3","triplet","j","paddingChar","base64Str","base64StrLength","reverseMap","paddingIndex","parseLoop","nBytes","bits1","bits2","bitsCombined"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAC,KAAC,SAAUA,GAAMC,GAAS;AAGzB,MAAAC,YAA2BD,EAAQE,GAAiB;AAAA,IAUtD,GAAEC,GAAM,SAAUC,GAAU;AAE3B,cAAC,WAAY;AAET,YAAIC,IAAID,GACJE,IAAQD,EAAE,KACVE,IAAYD,EAAM,WAClBE,IAAQH,EAAE;AAKD,QAAAG,EAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAcxB,WAAW,SAAUC,GAAW;AAE5B,gBAAIC,IAAQD,EAAU,OAClBE,IAAWF,EAAU,UACrBG,IAAM,KAAK;AAGf,YAAAH,EAAU,MAAK;AAIf,qBADII,IAAc,CAAA,GACTC,IAAI,GAAGA,IAAIH,GAAUG,KAAK;AAO/B,uBANIC,IAASL,EAAMI,MAAM,CAAC,MAAa,KAAMA,IAAI,IAAK,IAAY,KAC9DE,IAASN,EAAOI,IAAI,MAAO,CAAC,MAAO,MAAOA,IAAI,KAAK,IAAK,IAAM,KAC9DG,IAASP,EAAOI,IAAI,MAAO,CAAC,MAAO,MAAOA,IAAI,KAAK,IAAK,IAAM,KAE9DI,IAAWH,KAAS,KAAOC,KAAS,IAAKC,GAEpCE,IAAI,GAAIA,IAAI,KAAOL,IAAIK,IAAI,OAAOR,GAAWQ;AAClD,gBAAAN,EAAY,KAAKD,EAAI,OAAQM,MAAa,KAAK,IAAIC,KAAO,EAAI,CAAC;AAKvE,gBAAIC,IAAcR,EAAI,OAAO,EAAE;AAC/B,gBAAIQ;AACA,qBAAOP,EAAY,SAAS;AACxB,gBAAAA,EAAY,KAAKO,CAAW;AAIpC,mBAAOP,EAAY,KAAK,EAAE;AAAA,UACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAeS,OAAO,SAAUQ,GAAW;AAExB,gBAAIC,IAAkBD,EAAU,QAC5BT,IAAM,KAAK,MACXW,IAAa,KAAK;AAEtB,gBAAI,CAACA,GAAY;AACT,cAAAA,IAAa,KAAK,cAAc,CAAA;AAChC,uBAASJ,IAAI,GAAGA,IAAIP,EAAI,QAAQO;AAC5B,gBAAAI,EAAWX,EAAI,WAAWO,CAAC,CAAC,IAAIA;AAAA,YAEzD;AAGa,gBAAIC,IAAcR,EAAI,OAAO,EAAE;AAC/B,gBAAIQ,GAAa;AACb,kBAAII,IAAeH,EAAU,QAAQD,CAAW;AAChD,cAAII,MAAiB,OACjBF,IAAkBE;AAAA,YAEvC;AAGa,mBAAOC,EAAUJ,GAAWC,GAAiBC,CAAU;AAAA,UAEpE;AAAA,UAES,MAAM;AAAA;AAGV,iBAASE,EAAUJ,GAAWC,GAAiBC,GAAY;AAGzD,mBAFIb,IAAQ,CAAA,GACRgB,IAAS,GACJZ,IAAI,GAAGA,IAAIQ,GAAiBR;AACjC,gBAAIA,IAAI,GAAG;AACP,kBAAIa,IAAQJ,EAAWF,EAAU,WAAWP,IAAI,CAAC,CAAC,KAAOA,IAAI,IAAK,GAC9Dc,IAAQL,EAAWF,EAAU,WAAWP,CAAC,CAAC,MAAO,IAAKA,IAAI,IAAK,GAC/De,IAAeF,IAAQC;AAC3B,cAAAlB,EAAMgB,MAAW,CAAC,KAAKG,KAAiB,KAAMH,IAAS,IAAK,GAC5DA;AAAA,YACf;AAEO,iBAAOnB,EAAU,OAAOG,GAAOgB,CAAM;AAAA,QAC5C;AAAA,MACA,GAAE,GAGMtB,EAAS,IAAI;AAAA,IAErB,CAAC;AAAA;;;;;;;","x_google_ignoreList":[0]}

package/dist/chunks/enc-base64-BkBtNBQV.cjs

@@ -0,0 +1,2 @@
+"use strict";const A=require("./apiUtils-BZ6s0_NI.cjs"),b=require("./core-BHejg5iS.cjs");function O(i,l){for(var c=0;c<l.length;c++){const a=l[c];if(typeof a!="string"&&!Array.isArray(a)){for(const f in a)if(f!=="default"&&!(f in i)){const u=Object.getOwnPropertyDescriptor(a,f);u&&Object.defineProperty(i,f,u.get?u:{enumerable:!0,get:()=>a[f]})}}}return Object.freeze(Object.defineProperty(i,Symbol.toStringTag,{value:"Module"}))}var h={exports:{}},q=h.exports,x;function E(){return x||(x=1,(function(i,l){(function(c,a){i.exports=a(b.requireCore())})(q,function(c){return(function(){var a=c,f=a.lib,u=f.WordArray,m=a.enc;m.Base64={stringify:function(t){var s=t.words,o=t.sigBytes,n=this._map;t.clamp();for(var e=[],r=0;r<o;r+=3)for(var v=s[r>>>2]>>>24-r%4*8&255,g=s[r+1>>>2]>>>24-(r+1)%4*8&255,d=s[r+2>>>2]>>>24-(r+2)%4*8&255,C=v<<16|g<<8|d,p=0;p<4&&r+p*.75<o;p++)e.push(n.charAt(C>>>6*(3-p)&63));var B=n.charAt(64);if(B)for(;e.length%4;)e.push(B);return e.join("")},parse:function(t){var s=t.length,o=this._map,n=this._reverseMap;if(!n){n=this._reverseMap=[];for(var e=0;e<o.length;e++)n[o.charCodeAt(e)]=e}var r=o.charAt(64);if(r){var v=t.indexOf(r);v!==-1&&(s=v)}return y(t,s,n)},_map:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="};function y(t,s,o){for(var n=[],e=0,r=0;r<s;r++)if(r%4){var v=o[t.charCodeAt(r-1)]<<r%4*2,g=o[t.charCodeAt(r)]>>>6-r%4*2,d=v|g;n[e>>>2]|=d<<24-e%4*8,e++}return u.create(n,e)}})(),c.enc.Base64})})(h)),h.exports}var _=E();const w=A.getDefaultExportFromCjs(_),M=O({__proto__:null,default:w},[_]);exports.encBase64=M;
+//# sourceMappingURL=enc-base64-BkBtNBQV.cjs.map

package/dist/chunks/enc-base64-BkBtNBQV.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"enc-base64-BkBtNBQV.cjs","sources":["../../node_modules/crypto-js/enc-base64.js"],"sourcesContent":[";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t    // Shortcuts\n\t    var C = CryptoJS;\n\t    var C_lib = C.lib;\n\t    var WordArray = C_lib.WordArray;\n\t    var C_enc = C.enc;\n\n\t    /**\n\t     * Base64 encoding strategy.\n\t     */\n\t    var Base64 = C_enc.Base64 = {\n\t        /**\n\t         * Converts a word array to a Base64 string.\n\t         *\n\t         * @param {WordArray} wordArray The word array.\n\t         *\n\t         * @return {string} The Base64 string.\n\t         *\n\t         * @static\n\t         *\n\t         * @example\n\t         *\n\t         *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);\n\t         */\n\t        stringify: function (wordArray) {\n\t            // Shortcuts\n\t            var words = wordArray.words;\n\t            var sigBytes = wordArray.sigBytes;\n\t            var map = this._map;\n\n\t            // Clamp excess bits\n\t            wordArray.clamp();\n\n\t            // Convert\n\t            var base64Chars = [];\n\t            for (var i = 0; i < sigBytes; i += 3) {\n\t                var byte1 = (words[i >>> 2]       >>> (24 - (i % 4) * 8))       & 0xff;\n\t                var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;\n\t                var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;\n\n\t                var triplet = (byte1 << 16) | (byte2 << 8) | byte3;\n\n\t                for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {\n\t                    base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));\n\t                }\n\t            }\n\n\t            // Add padding\n\t            var paddingChar = map.charAt(64);\n\t            if (paddingChar) {\n\t                while (base64Chars.length % 4) {\n\t                    base64Chars.push(paddingChar);\n\t                }\n\t            }\n\n\t            return base64Chars.join('');\n\t        },\n\n\t        /**\n\t         * Converts a Base64 string to a word array.\n\t         *\n\t         * @param {string} base64Str The Base64 string.\n\t         *\n\t         * @return {WordArray} The word array.\n\t         *\n\t         * @static\n\t         *\n\t         * @example\n\t         *\n\t         *     var wordArray = CryptoJS.enc.Base64.parse(base64String);\n\t         */\n\t        parse: function (base64Str) {\n\t            // Shortcuts\n\t            var base64StrLength = base64Str.length;\n\t            var map = this._map;\n\t            var reverseMap = this._reverseMap;\n\n\t            if (!reverseMap) {\n\t                    reverseMap = this._reverseMap = [];\n\t                    for (var j = 0; j < map.length; j++) {\n\t                        reverseMap[map.charCodeAt(j)] = j;\n\t                    }\n\t            }\n\n\t            // Ignore padding\n\t            var paddingChar = map.charAt(64);\n\t            if (paddingChar) {\n\t                var paddingIndex = base64Str.indexOf(paddingChar);\n\t                if (paddingIndex !== -1) {\n\t                    base64StrLength = paddingIndex;\n\t                }\n\t            }\n\n\t            // Convert\n\t            return parseLoop(base64Str, base64StrLength, reverseMap);\n\n\t        },\n\n\t        _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='\n\t    };\n\n\t    function parseLoop(base64Str, base64StrLength, reverseMap) {\n\t      var words = [];\n\t      var nBytes = 0;\n\t      for (var i = 0; i < base64StrLength; i++) {\n\t          if (i % 4) {\n\t              var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << ((i % 4) * 2);\n\t              var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> (6 - (i % 4) * 2);\n\t              var bitsCombined = bits1 | bits2;\n\t              words[nBytes >>> 2] |= bitsCombined << (24 - (nBytes % 4) * 8);\n\t              nBytes++;\n\t          }\n\t      }\n\t      return WordArray.create(words, nBytes);\n\t    }\n\t}());\n\n\n\treturn CryptoJS.enc.Base64;\n\n}));"],"names":["root","factory","module","require$$0","this","CryptoJS","C","C_lib","WordArray","C_enc","wordArray","words","sigBytes","map","base64Chars","i","byte1","byte2","byte3","triplet","j","paddingChar","base64Str","base64StrLength","reverseMap","paddingIndex","parseLoop","nBytes","bits1","bits2","bitsCombined"],"mappings":"4fAAE,SAAUA,EAAMC,EAAS,CAGzBC,UAA2BD,EAAQE,EAAAA,aAAiB,CAUtD,GAAEC,EAAM,SAAUC,EAAU,CAE3B,OAAC,UAAY,CAET,IAAIC,EAAID,EACJE,EAAQD,EAAE,IACVE,EAAYD,EAAM,UAClBE,EAAQH,EAAE,IAKDG,EAAM,OAAS,CAcxB,UAAW,SAAUC,EAAW,CAE5B,IAAIC,EAAQD,EAAU,MAClBE,EAAWF,EAAU,SACrBG,EAAM,KAAK,KAGfH,EAAU,MAAK,EAIf,QADII,EAAc,CAAA,EACTC,EAAI,EAAGA,EAAIH,EAAUG,GAAK,EAO/B,QANIC,EAASL,EAAMI,IAAM,CAAC,IAAa,GAAMA,EAAI,EAAK,EAAY,IAC9DE,EAASN,EAAOI,EAAI,IAAO,CAAC,IAAO,IAAOA,EAAI,GAAK,EAAK,EAAM,IAC9DG,EAASP,EAAOI,EAAI,IAAO,CAAC,IAAO,IAAOA,EAAI,GAAK,EAAK,EAAM,IAE9DI,EAAWH,GAAS,GAAOC,GAAS,EAAKC,EAEpCE,EAAI,EAAIA,EAAI,GAAOL,EAAIK,EAAI,IAAOR,EAAWQ,IAClDN,EAAY,KAAKD,EAAI,OAAQM,IAAa,GAAK,EAAIC,GAAO,EAAI,CAAC,EAKvE,IAAIC,EAAcR,EAAI,OAAO,EAAE,EAC/B,GAAIQ,EACA,KAAOP,EAAY,OAAS,GACxBA,EAAY,KAAKO,CAAW,EAIpC,OAAOP,EAAY,KAAK,EAAE,CACvC,EAeS,MAAO,SAAUQ,EAAW,CAExB,IAAIC,EAAkBD,EAAU,OAC5BT,EAAM,KAAK,KACXW,EAAa,KAAK,YAEtB,GAAI,CAACA,EAAY,CACTA,EAAa,KAAK,YAAc,CAAA,EAChC,QAASJ,EAAI,EAAGA,EAAIP,EAAI,OAAQO,IAC5BI,EAAWX,EAAI,WAAWO,CAAC,CAAC,EAAIA,CAEzD,CAGa,IAAIC,EAAcR,EAAI,OAAO,EAAE,EAC/B,GAAIQ,EAAa,CACb,IAAII,EAAeH,EAAU,QAAQD,CAAW,EAC5CI,IAAiB,KACjBF,EAAkBE,EAEvC,CAGa,OAAOC,EAAUJ,EAAWC,EAAiBC,CAAU,CAEpE,EAES,KAAM,qEAGV,SAASE,EAAUJ,EAAWC,EAAiBC,EAAY,CAGzD,QAFIb,EAAQ,CAAA,EACRgB,EAAS,EACJZ,EAAI,EAAGA,EAAIQ,EAAiBR,IACjC,GAAIA,EAAI,EAAG,CACP,IAAIa,EAAQJ,EAAWF,EAAU,WAAWP,EAAI,CAAC,CAAC,GAAOA,EAAI,EAAK,EAC9Dc,EAAQL,EAAWF,EAAU,WAAWP,CAAC,CAAC,IAAO,EAAKA,EAAI,EAAK,EAC/De,EAAeF,EAAQC,EAC3BlB,EAAMgB,IAAW,CAAC,GAAKG,GAAiB,GAAMH,EAAS,EAAK,EAC5DA,GACf,CAEO,OAAOnB,EAAU,OAAOG,EAAOgB,CAAM,CAC5C,CACA,GAAE,EAGMtB,EAAS,IAAI,MAErB,CAAC","x_google_ignoreList":[0]}

package/dist/chunks/{favoriteStore-BXBziAgB.cjs → favoriteStore-CcKg_nEH.cjs}

@@ -1,2 +1,2 @@
-"use strict";const I=require("./apiUtils-CudW_FKE.cjs"),v=require("zustand"),F=(d,o)=>({nodes:{},rootIds:[],loadedFor:void 0,loading:!1,error:void 0,treeNodes:[],isMenuBookmarked:e=>Object.values(o().nodes).some(r=>r.type==="M"&&r.menuId===e),getPrntBkmkIdByMenuId:e=>{const r=p(o().nodes,e);return r?o().nodes[r]?.prntBkmkId??"-":"-"},getNodeByMenuId:e=>{const r=p(o().nodes,e);if(!r)return null;const t=o().nodes[r];return t?.type==="M"?t:null},getFolderTree:e=>{const{nodes:r,rootIds:t}=o(),n=s=>e?s.toLowerCase().includes(e.toLowerCase()):!0,c=s=>{const i=r[s];if(!i||i.type!=="F")return null;const a=i,l=(a.children||[]).map(m=>r[m]).filter(m=>!!m&&m.type==="F").map(m=>c(m.bkmkId)).filter(Boolean);return n(a.bkmkNm)||l.length>0?{key:a.bkmkId,title:`📁 ${a.bkmkNm}`,children:l.length?l:void 0}:null};return t.map(s=>c(s)).filter(Boolean)},loadFavorites:async(e,r=!1)=>{console.log("loadFavorites ::::: ",e,r);const t=o();if(!(!r&&t.loadedFor===e&&Object.keys(t.nodes).length)){d({loading:!0,error:void 0});try{const n=await I.callService("SCMBKMK00101",{userId:e}),c=Array.isArray(n?.sub)?n.sub:[],s=O(c),i=f(s.nodes,s.rootIds);d({...s,treeNodes:i,loadedFor:e,loading:!1})}catch(n){throw d({loading:!1,error:n?.message||"즐겨찾기 로드 실패"}),n}}},loadFavoritesIfNeeded:async e=>{const r=o();(r.loadedFor!==e||Object.keys(r.nodes).length===0)&&await o().loadFavorites(e)},addNode:async e=>{const r=y(o()),t=w();d(n=>{const c=e.sortOrdr??h(n,e.prntBkmkId),s={...n,nodes:{...n.nodes,[t]:e.type==="F"?{bkmkId:t,type:"F",prntBkmkId:e.prntBkmkId||"-",sortOrdr:c,bkmkNm:e.bkmkNm??"새 폴더",children:[],sysCd:e.sysCd,userId:e.userId}:{bkmkId:t,type:"M",prntBkmkId:e.prntBkmkId,sortOrdr:c,menuId:e.menuId??"",menuNm:e.menuNm,sysCd:e.sysCd,userId:e.userId}},rootIds:n.rootIds.slice(),treeNodes:n.treeNodes};return S(s,t,e.prntBkmkId),s.treeNodes=f(s.nodes,s.rootIds),s});try{let n=t;const c=h(o(),e.prntBkmkId),s=await I.callService("SCMBKMK00102",{iudFlag:"I",type:e.type,sysCd:e.sysCd,userId:e.userId,bkmkId:t,bkmkNm:e.bkmkNm,prntBkmkId:e.prntBkmkId,menuId:e.menuId,sortOrdr:c,chngId:I.getUserId()});return n=String(s?.bkmkId??s?.itemId??t),d(i=>{const a=K(i,t,n);return{...a,treeNodes:f(a.nodes,a.rootIds)}}),n}catch(n){throw d(r),n}},moveNode:async({bkmkId:e,newPrntBkmkId:r,sortOrdr:t,userId:n})=>{const c=o(),s=structuredClone(c.nodes),i=[...c.rootIds],a=s[e];if(!a)return;if(r!=="-"){const k=s[r];if(!k||k.type!=="F")throw new Error("부모는 폴더만 가능합니다.")}const l=a.prntBkmkId??"-",u=l==="-"?i:s[l].children||=[];{const k=u.indexOf(e);k>=0&&u.splice(k,1)}const m=r==="-"?i:s[r].children||=[];m.splice(Math.max(0,Math.min(t,m.length)),0,e),a.prntBkmkId=r,d({nodes:s,rootIds:i}),B(s,i,r),B(s,i,l);try{await I.callService("SCMBKMK00104",{bkmkId:e,prntBkmkId:r,sortOrdr:t,chngId:n})}catch(k){throw d(c),k}},removeNode:async e=>{const r=y(o());d(t=>{if(!t.nodes[e])return t;const n={...t,nodes:{...t.nodes},rootIds:t.rootIds.slice(),treeNodes:t.treeNodes};return b(n,e),n.treeNodes=f(n.nodes,n.rootIds),n});try{await I.callService("SCMBKMK00103",{bkmkId:e})}catch(t){throw d(r),t}},editNode:async({bkmkId:e,userId:r,bkmkNm:t,prntBkmkId:n,sortOrdr:c})=>{const s=y(o());d(i=>{const a={...i,nodes:{...i.nodes}},l=a.nodes[e];return l?.type==="F"&&typeof t=="string"&&(a.nodes[e]={...l,bkmkNm:t}),a});try{await I.callService("SCMBKMK00102",{iudFlag:"U",userId:r,bkmkId:e,bkmkNm:t,prntBkmkId:n,sortOrdr:c,chngId:I.getUserId()})}catch(i){throw d(s),i}},addFolder:async(e,r,t,n)=>await o().addNode({type:"F",bkmkNm:e,prntBkmkId:r,sysCd:t,userId:n}),addMenuToFolder:async(e,r)=>p(o().nodes,r.menuId)?"이미 북마크에 저장된 메뉴입니다.":await o().addNode({type:"M",prntBkmkId:e,sysCd:"KH",userId:I.getUserId(),menuId:r.menuId,menuNm:r.menuNm}),toggleMenuFavorite:async(e,r)=>{const t=o(),n=Object.values(t.nodes).find(s=>s.type==="M"&&s.menuId===r.menuId);if(n){await o().removeNode(n.bkmkId);return}let c=N(t);c||(await o().loadFavorites(e,!0),c=N(o())),c&&await o().addNode({type:"M",prntBkmkId:c,sysCd:"KH",userId:I.getUserId(),menuId:r.menuId,menuNm:r.menuNm})},removeMenuByMenuId:async e=>{const r=o(),t=p(r.nodes,e);t&&await o().removeNode(t)},removeMenu:async e=>{await o().removeNode(e)},removeFolder:async e=>{await o().removeNode(e)},editFolder:async(e,r,t,n,c)=>{await o().editNode({bkmkId:e,userId:r,bkmkNm:t,prntBkmkId:n,sortOrdr:c})},convertToAntTreeData:(e,r,t,n=!1)=>{const c=i=>t?i.toLowerCase().includes(t.toLowerCase()):!0,s=i=>{const a=e[i];if(!a||n&&a.type!=="F")return null;if(a.type==="F"){const l=a,u=(l.children||[]).map(k=>s(k)).filter(Boolean);return c(l.bkmkNm)||u.length>0?{key:l.bkmkId,type:"F",title:`📁 ${l.bkmkNm}`,bkmkNm:l.bkmkNm,prntBkmkId:l.prntBkmkId,sortOrdr:l.sortOrdr,fullPath:l.fullPath,children:u.length?u:void 0}:null}else{const l=a,u=l.menuNm?`${l.menuNm} (${l.menuId})`:l.menuId;return c(u)?{key:l.bkmkId,type:"M",title:`📄 ${u}`,prntBkmkId:l.prntBkmkId,sortOrdr:l.sortOrdr,fullPath:l.fullPath,isLeaf:!0}:null}};return r.map(s).filter(Boolean)}}),M=v.create(F);function O(d){const o={},e=[],r=t=>{t.forEach(n=>{const c={type:n.type,bkmkId:n.bkmkId??n.BKMK_ID??n.id,prntBkmkId:n.prntBkmkId??n.PRNT_BKMK_ID??"-",sortOrdr:Number(n.sortOrdr??n.SORT_ORDR??0),sysCd:n.sysCd??n.SYS_CD,userId:n.userId??n.USER_ID,fullPath:n.fullPath??n.FULL_PATH};if(n.type==="F"){o[c.bkmkId]={...c,bkmkNm:n.bkmkNm??n.BKMK_NM??n.name??c.bkmkId,children:[]};const s=Array.isArray(n.children)?n.children:[];r(s)}else o[c.bkmkId]={...c,menuId:n.menuId??n.MENU_ID??"",menuNm:n.menuNm??n.MENU_NM}})};return r(d),Object.values(o).forEach(t=>{if(t.prntBkmkId&&t.prntBkmkId!=="-"){const n=o[t.prntBkmkId];n?.type==="F"&&n.children.push(t.bkmkId)}else t.type==="F"&&e.push(t.bkmkId)}),e.sort((t,n)=>(o[t].sortOrdr??0)-(o[n].sortOrdr??0)),Object.values(o).forEach(t=>{t.type==="F"&&t.children.sort((c,s)=>(o[c].sortOrdr??0)-(o[s].sortOrdr??0))}),{nodes:o,rootIds:e}}function y(d){return{...d,nodes:JSON.parse(JSON.stringify(d.nodes)),rootIds:d.rootIds.slice()}}function w(){return`tmp_${Math.random().toString(36).slice(2,10)}`}function h(d,o){if(!o||o==="-")return d.rootIds.length;const e=d.nodes[o];return e?e.children.length:0}function S(d,o,e){const r=d.nodes[o];if(r)if(e&&e!=="-"){const t=d.nodes[e];if(!t||t.type!=="F")return;r.prntBkmkId=e,t.children=[...t.children,o]}else r.prntBkmkId="-",d.rootIds=[...d.rootIds,o]}function C(d,o){const e=d.nodes[o];if(!e)return;const r=e.prntBkmkId;if(r&&r!=="-"){const t=d.nodes[r];t?.type==="F"&&(t.children=t.children.filter(n=>n!==o))}else d.rootIds=d.rootIds.filter(t=>t!==o)}function b(d,o){const e=d.nodes[o];if(!e)return;e.type==="F"&&e.children.slice().forEach(c=>b(d,c)),C(d,o);const{[o]:r,...t}=d.nodes;d.nodes=t}function K(d,o,e){if(o===e)return d;const r=d.nodes[o];if(!r)return d;const t=JSON.parse(JSON.stringify(r));t.bkmkId=e;const n={...d.nodes,[e]:t};delete n[o];let c=d.rootIds;if(t.prntBkmkId&&t.prntBkmkId!=="-"){const s=n[t.prntBkmkId];s?.type==="F"&&(n[t.prntBkmkId]={...s,children:s.children.map(i=>i===o?e:i)})}else c=d.rootIds.map(s=>s===o?e:s);return{...d,nodes:n,rootIds:c}}function N(d){return d.rootIds.find(o=>d.nodes[o]?.type==="F")??null}function f(d,o){const e={};Object.values(d).forEach(i=>{const a=i.bkmkId,l=i.prntBkmkId;!a||!l||l==="-"||l===a||(e[l]??=[]).push(a)});const r=new Set,t=i=>{if(r.has(i))return null;const a=d[i];if(!a)return null;r.add(i);try{if(a.type==="F"){const u=a,m=e[i]??[];return{type:"F",bkmkId:i,bkmkNm:u.bkmkNm,prntBkmkId:u.prntBkmkId,children:m.map(t).filter(Boolean)}}const l=a;return{type:"M",bkmkId:i,bkmkNm:l.menuNm,menuId:l.menuId,menuNm:l.menuNm,prntBkmkId:l.prntBkmkId}}finally{r.delete(i)}},n=Object.values(d).filter(i=>i.prntBkmkId==="-"&&i.type==="M").map(i=>i.bkmkId),c=Object.values(d).filter(i=>i.prntBkmkId==="-"&&i.type==="F").map(i=>i.bkmkId);return Array.from(new Set([...o,...n,...c])).map(t).filter(Boolean)}function p(d,o){for(const e of Object.values(d))if(e.type==="M"&&e.menuId===o)return e.bkmkId;return null}function B(d,o,e){(!e||e==="-"?o:d[e].children||[]).forEach((t,n)=>{const c=d[t];c&&(c.sortOrdr=n)})}exports.useFavoriteStore=M;
-//# sourceMappingURL=favoriteStore-BXBziAgB.cjs.map
+"use strict";const I=require("./apiUtils-BZ6s0_NI.cjs"),v=require("zustand"),F=(d,o)=>({nodes:{},rootIds:[],loadedFor:void 0,loading:!1,error:void 0,treeNodes:[],isMenuBookmarked:e=>Object.values(o().nodes).some(r=>r.type==="M"&&r.menuId===e),getPrntBkmkIdByMenuId:e=>{const r=p(o().nodes,e);return r?o().nodes[r]?.prntBkmkId??"-":"-"},getNodeByMenuId:e=>{const r=p(o().nodes,e);if(!r)return null;const t=o().nodes[r];return t?.type==="M"?t:null},getFolderTree:e=>{const{nodes:r,rootIds:t}=o(),n=s=>e?s.toLowerCase().includes(e.toLowerCase()):!0,c=s=>{const i=r[s];if(!i||i.type!=="F")return null;const a=i,l=(a.children||[]).map(m=>r[m]).filter(m=>!!m&&m.type==="F").map(m=>c(m.bkmkId)).filter(Boolean);return n(a.bkmkNm)||l.length>0?{key:a.bkmkId,title:`📁 ${a.bkmkNm}`,children:l.length?l:void 0}:null};return t.map(s=>c(s)).filter(Boolean)},loadFavorites:async(e,r=!1)=>{console.log("loadFavorites ::::: ",e,r);const t=o();if(!(!r&&t.loadedFor===e&&Object.keys(t.nodes).length)){d({loading:!0,error:void 0});try{const n=await I.callService("SCMBKMK00101",{userId:e}),c=Array.isArray(n?.sub)?n.sub:[],s=O(c),i=f(s.nodes,s.rootIds);d({...s,treeNodes:i,loadedFor:e,loading:!1})}catch(n){throw d({loading:!1,error:n?.message||"즐겨찾기 로드 실패"}),n}}},loadFavoritesIfNeeded:async e=>{const r=o();(r.loadedFor!==e||Object.keys(r.nodes).length===0)&&await o().loadFavorites(e)},addNode:async e=>{const r=y(o()),t=w();d(n=>{const c=e.sortOrdr??h(n,e.prntBkmkId),s={...n,nodes:{...n.nodes,[t]:e.type==="F"?{bkmkId:t,type:"F",prntBkmkId:e.prntBkmkId||"-",sortOrdr:c,bkmkNm:e.bkmkNm??"새 폴더",children:[],sysCd:e.sysCd,userId:e.userId}:{bkmkId:t,type:"M",prntBkmkId:e.prntBkmkId,sortOrdr:c,menuId:e.menuId??"",menuNm:e.menuNm,sysCd:e.sysCd,userId:e.userId}},rootIds:n.rootIds.slice(),treeNodes:n.treeNodes};return S(s,t,e.prntBkmkId),s.treeNodes=f(s.nodes,s.rootIds),s});try{let n=t;const c=h(o(),e.prntBkmkId),s=await I.callService("SCMBKMK00102",{iudFlag:"I",type:e.type,sysCd:e.sysCd,userId:e.userId,bkmkId:t,bkmkNm:e.bkmkNm,prntBkmkId:e.prntBkmkId,menuId:e.menuId,sortOrdr:c,chngId:I.getUserId()});return n=String(s?.bkmkId??s?.itemId??t),d(i=>{const a=K(i,t,n);return{...a,treeNodes:f(a.nodes,a.rootIds)}}),n}catch(n){throw d(r),n}},moveNode:async({bkmkId:e,newPrntBkmkId:r,sortOrdr:t,userId:n})=>{const c=o(),s=structuredClone(c.nodes),i=[...c.rootIds],a=s[e];if(!a)return;if(r!=="-"){const k=s[r];if(!k||k.type!=="F")throw new Error("부모는 폴더만 가능합니다.")}const l=a.prntBkmkId??"-",u=l==="-"?i:s[l].children||=[];{const k=u.indexOf(e);k>=0&&u.splice(k,1)}const m=r==="-"?i:s[r].children||=[];m.splice(Math.max(0,Math.min(t,m.length)),0,e),a.prntBkmkId=r,d({nodes:s,rootIds:i}),B(s,i,r),B(s,i,l);try{await I.callService("SCMBKMK00104",{bkmkId:e,prntBkmkId:r,sortOrdr:t,chngId:n})}catch(k){throw d(c),k}},removeNode:async e=>{const r=y(o());d(t=>{if(!t.nodes[e])return t;const n={...t,nodes:{...t.nodes},rootIds:t.rootIds.slice(),treeNodes:t.treeNodes};return b(n,e),n.treeNodes=f(n.nodes,n.rootIds),n});try{await I.callService("SCMBKMK00103",{bkmkId:e})}catch(t){throw d(r),t}},editNode:async({bkmkId:e,userId:r,bkmkNm:t,prntBkmkId:n,sortOrdr:c})=>{const s=y(o());d(i=>{const a={...i,nodes:{...i.nodes}},l=a.nodes[e];return l?.type==="F"&&typeof t=="string"&&(a.nodes[e]={...l,bkmkNm:t}),a});try{await I.callService("SCMBKMK00102",{iudFlag:"U",userId:r,bkmkId:e,bkmkNm:t,prntBkmkId:n,sortOrdr:c,chngId:I.getUserId()})}catch(i){throw d(s),i}},addFolder:async(e,r,t,n)=>await o().addNode({type:"F",bkmkNm:e,prntBkmkId:r,sysCd:t,userId:n}),addMenuToFolder:async(e,r)=>p(o().nodes,r.menuId)?"이미 북마크에 저장된 메뉴입니다.":await o().addNode({type:"M",prntBkmkId:e,sysCd:"KH",userId:I.getUserId(),menuId:r.menuId,menuNm:r.menuNm}),toggleMenuFavorite:async(e,r)=>{const t=o(),n=Object.values(t.nodes).find(s=>s.type==="M"&&s.menuId===r.menuId);if(n){await o().removeNode(n.bkmkId);return}let c=N(t);c||(await o().loadFavorites(e,!0),c=N(o())),c&&await o().addNode({type:"M",prntBkmkId:c,sysCd:"KH",userId:I.getUserId(),menuId:r.menuId,menuNm:r.menuNm})},removeMenuByMenuId:async e=>{const r=o(),t=p(r.nodes,e);t&&await o().removeNode(t)},removeMenu:async e=>{await o().removeNode(e)},removeFolder:async e=>{await o().removeNode(e)},editFolder:async(e,r,t,n,c)=>{await o().editNode({bkmkId:e,userId:r,bkmkNm:t,prntBkmkId:n,sortOrdr:c})},convertToAntTreeData:(e,r,t,n=!1)=>{const c=i=>t?i.toLowerCase().includes(t.toLowerCase()):!0,s=i=>{const a=e[i];if(!a||n&&a.type!=="F")return null;if(a.type==="F"){const l=a,u=(l.children||[]).map(k=>s(k)).filter(Boolean);return c(l.bkmkNm)||u.length>0?{key:l.bkmkId,type:"F",title:`📁 ${l.bkmkNm}`,bkmkNm:l.bkmkNm,prntBkmkId:l.prntBkmkId,sortOrdr:l.sortOrdr,fullPath:l.fullPath,children:u.length?u:void 0}:null}else{const l=a,u=l.menuNm?`${l.menuNm} (${l.menuId})`:l.menuId;return c(u)?{key:l.bkmkId,type:"M",title:`📄 ${u}`,prntBkmkId:l.prntBkmkId,sortOrdr:l.sortOrdr,fullPath:l.fullPath,isLeaf:!0}:null}};return r.map(s).filter(Boolean)}}),M=v.create(F);function O(d){const o={},e=[],r=t=>{t.forEach(n=>{const c={type:n.type,bkmkId:n.bkmkId??n.BKMK_ID??n.id,prntBkmkId:n.prntBkmkId??n.PRNT_BKMK_ID??"-",sortOrdr:Number(n.sortOrdr??n.SORT_ORDR??0),sysCd:n.sysCd??n.SYS_CD,userId:n.userId??n.USER_ID,fullPath:n.fullPath??n.FULL_PATH};if(n.type==="F"){o[c.bkmkId]={...c,bkmkNm:n.bkmkNm??n.BKMK_NM??n.name??c.bkmkId,children:[]};const s=Array.isArray(n.children)?n.children:[];r(s)}else o[c.bkmkId]={...c,menuId:n.menuId??n.MENU_ID??"",menuNm:n.menuNm??n.MENU_NM}})};return r(d),Object.values(o).forEach(t=>{if(t.prntBkmkId&&t.prntBkmkId!=="-"){const n=o[t.prntBkmkId];n?.type==="F"&&n.children.push(t.bkmkId)}else t.type==="F"&&e.push(t.bkmkId)}),e.sort((t,n)=>(o[t].sortOrdr??0)-(o[n].sortOrdr??0)),Object.values(o).forEach(t=>{t.type==="F"&&t.children.sort((c,s)=>(o[c].sortOrdr??0)-(o[s].sortOrdr??0))}),{nodes:o,rootIds:e}}function y(d){return{...d,nodes:JSON.parse(JSON.stringify(d.nodes)),rootIds:d.rootIds.slice()}}function w(){return`tmp_${Math.random().toString(36).slice(2,10)}`}function h(d,o){if(!o||o==="-")return d.rootIds.length;const e=d.nodes[o];return e?e.children.length:0}function S(d,o,e){const r=d.nodes[o];if(r)if(e&&e!=="-"){const t=d.nodes[e];if(!t||t.type!=="F")return;r.prntBkmkId=e,t.children=[...t.children,o]}else r.prntBkmkId="-",d.rootIds=[...d.rootIds,o]}function C(d,o){const e=d.nodes[o];if(!e)return;const r=e.prntBkmkId;if(r&&r!=="-"){const t=d.nodes[r];t?.type==="F"&&(t.children=t.children.filter(n=>n!==o))}else d.rootIds=d.rootIds.filter(t=>t!==o)}function b(d,o){const e=d.nodes[o];if(!e)return;e.type==="F"&&e.children.slice().forEach(c=>b(d,c)),C(d,o);const{[o]:r,...t}=d.nodes;d.nodes=t}function K(d,o,e){if(o===e)return d;const r=d.nodes[o];if(!r)return d;const t=JSON.parse(JSON.stringify(r));t.bkmkId=e;const n={...d.nodes,[e]:t};delete n[o];let c=d.rootIds;if(t.prntBkmkId&&t.prntBkmkId!=="-"){const s=n[t.prntBkmkId];s?.type==="F"&&(n[t.prntBkmkId]={...s,children:s.children.map(i=>i===o?e:i)})}else c=d.rootIds.map(s=>s===o?e:s);return{...d,nodes:n,rootIds:c}}function N(d){return d.rootIds.find(o=>d.nodes[o]?.type==="F")??null}function f(d,o){const e={};Object.values(d).forEach(i=>{const a=i.bkmkId,l=i.prntBkmkId;!a||!l||l==="-"||l===a||(e[l]??=[]).push(a)});const r=new Set,t=i=>{if(r.has(i))return null;const a=d[i];if(!a)return null;r.add(i);try{if(a.type==="F"){const u=a,m=e[i]??[];return{type:"F",bkmkId:i,bkmkNm:u.bkmkNm,prntBkmkId:u.prntBkmkId,children:m.map(t).filter(Boolean)}}const l=a;return{type:"M",bkmkId:i,bkmkNm:l.menuNm,menuId:l.menuId,menuNm:l.menuNm,prntBkmkId:l.prntBkmkId}}finally{r.delete(i)}},n=Object.values(d).filter(i=>i.prntBkmkId==="-"&&i.type==="M").map(i=>i.bkmkId),c=Object.values(d).filter(i=>i.prntBkmkId==="-"&&i.type==="F").map(i=>i.bkmkId);return Array.from(new Set([...o,...n,...c])).map(t).filter(Boolean)}function p(d,o){for(const e of Object.values(d))if(e.type==="M"&&e.menuId===o)return e.bkmkId;return null}function B(d,o,e){(!e||e==="-"?o:d[e].children||[]).forEach((t,n)=>{const c=d[t];c&&(c.sortOrdr=n)})}exports.useFavoriteStore=M;
+//# sourceMappingURL=favoriteStore-CcKg_nEH.cjs.map

package/dist/chunks/{favoriteStore-BXBziAgB.cjs.map → favoriteStore-CcKg_nEH.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"favoriteStore-BXBziAgB.cjs","sources":["../../src/stores/favoriteStore.ts"],"sourcesContent":["// -------------------------------------------------------\r\n// 즐겨찾기(폴더형) Zustand Store (단일 테이블 CM_BKMK_MSTR 기반)\r\n// 공통 CRUD로 통합: addNode / moveNode / removeNode / editNode\r\n// 기존 API(폴더/메뉴 전용)는 호환용으로 래핑만 유지\r\n// - 정규화(nodes + rootIds)\r\n// - 낙관적 업데이트 + 임시ID(tmp_* → 서버ID) 스왑\r\n// - 필수 기능: 로드, 생성, 이동, 삭제, 수정 + 셀렉터/뷰 변환\r\n// -------------------------------------------------------\r\n\r\nimport { callService } from \"../utils/apiUtils\";\r\nimport { getUserId } from \"../utils/userUtils\";\r\nimport { DataNode } from \"antd/es/tree\";\r\nimport { create, StateCreator } from \"zustand\";\r\n\r\n// 🔧 공통 ID 타입\r\nexport type Id = string;\r\n\r\n/** 공통 베이스 (CM_BKMK_MSTR 매핑) */\r\nexport type BkmkBase = {\r\n  type: \"F\" | \"M\"; // TYPE\r\n  bkmkId: Id; // BKMK_ID\r\n  prntBkmkId: Id | \"-\"; // PRNT_BKMK_ID ('-'=루트)\r\n  sortOrdr: number; // SORT_ORDR\r\n  sysCd?: string; // SYS_CD (옵션)\r\n  userId?: string | null; // USER_ID (옵션)\r\n  fullPath?: string; // 프론트 보조(옵션)\r\n};\r\n\r\n/** 폴더 노드 (BKMK_NM 사용) */\r\nexport type FolderNode = BkmkBase & {\r\n  bkmkNm: string; // BKMK_NM (폴더 전용)\r\n  children: Id[]; // 폴더/아이템 혼재(정규화용)\r\n};\r\n\r\n/** 아이템 노드 (메뉴 전용 메타) */\r\nexport type ItemNode = BkmkBase & {\r\n  menuId: string; // MENU_ID\r\n  menuNm?: string; // 프론트 보조(메뉴명)\r\n};\r\n\r\nexport type FavNode = FolderNode | ItemNode;\r\n\r\nexport type MovePayload = {\r\n  bkmkId: Id;\r\n  newPrntBkmkId: Id | \"-\";\r\n  sortOrdr: number; // 새 부모 내 0-based\r\n  userId: string | null;\r\n};\r\n\r\nexport type AddNodePayload = {\r\n  type: \"F\" | \"M\";\r\n  prntBkmkId: Id | \"-\";\r\n  sysCd: string;\r\n  userId: string | null;\r\n  bkmkNm?: string; // F 전용\r\n  menuId?: string; // M 전용\r\n  menuNm?: string; // 프론트 보조\r\n  sortOrdr?: number; // 선택: 지정 없으면 tailIndex 사용\r\n};\r\n\r\nexport type EditNodePayload = {\r\n  bkmkId: Id;\r\n  userId: string;\r\n  bkmkNm?: string; // F일 때만 의미\r\n  prntBkmkId?: Id | \"-\"; // 선택(이동은 moveNode 권장)\r\n  sortOrdr?: number; // 선택\r\n};\r\n\r\nexport type Normalized = { nodes: Record<Id, FavNode>; rootIds: Id[] };\r\n\r\nexport type State = {\r\n  // ========== 데이터(정규화) ==========\r\n  nodes: Record<Id, FavNode>;\r\n  rootIds: Id[];\r\n  treeNodes: FavNode[]; // 단순 트리(뷰용)\r\n\r\n  // ========== 메타 ==========\r\n  loadedFor?: string;\r\n  loading: boolean;\r\n  error?: string;\r\n\r\n  // ========== 셀렉터 ==========\r\n  isMenuBookmarked: (menuId: string) => boolean;\r\n  getPrntBkmkIdByMenuId: (menuId: string) => Id | \"-\";\r\n  getNodeByMenuId: (menuId: string) => ItemNode | null;\r\n  getFolderTree: (q?: string) => DataNode[]; // 폴더만 Tree (검색 필터)\r\n\r\n  // ========== 로더 ==========\r\n  loadFavorites: (userId: string, force?: boolean) => Promise<void>;\r\n  loadFavoritesIfNeeded: (userId: string) => Promise<void>;\r\n\r\n  // ========== 공통 CRUD ==========\r\n  addNode: (p: AddNodePayload) => Promise<Id>;\r\n  moveNode: (p: MovePayload) => Promise<void>;\r\n  removeNode: (bkmkId: Id) => Promise<void>;\r\n  editNode: (p: EditNodePayload) => Promise<void>;\r\n\r\n  // ========== 호환용(기존 API 유지, 내부에서 공통 호출) ==========\r\n  addFolder: (\r\n    bkmkNm: string,\r\n    prntBkmkId: Id | \"-\",\r\n    sysCd: string,\r\n    userId: string | null\r\n  ) => Promise<Id>;\r\n  addMenuToFolder: (\r\n    folderBkmkId: Id,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<Id | string>;\r\n  toggleMenuFavorite: (\r\n    userId: string | null,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<void>;\r\n  removeMenu: (bkmkId: Id) => Promise<void>;\r\n  removeMenuByMenuId: (menuId: string) => Promise<void>;\r\n  removeFolder: (folderBkmkId: Id) => Promise<void>;\r\n  editFolder: (\r\n    folderBkmkId: Id,\r\n    userId: string | null,\r\n    newBkmkNm?: string,\r\n    prntBkmkId?: Id | \"-\",\r\n    sortOrdr?: number\r\n  ) => Promise<void>;\r\n  convertToAntTreeData: (\r\n    nodesMap: Record<string, FavNode>,\r\n    rootIds: string[],\r\n    q: string,\r\n    onlyFolder?: boolean\r\n  ) => any[];\r\n};\r\n\r\nconst creator: StateCreator<State> = (set, get) => ({\r\n  nodes: {},\r\n  rootIds: [],\r\n  loadedFor: undefined,\r\n  loading: false,\r\n  error: undefined,\r\n  treeNodes: [],\r\n\r\n  // ====== 셀렉터 ======\r\n  isMenuBookmarked: (menuId) =>\r\n    Object.values(get().nodes).some(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menuId\r\n    ),\r\n  getPrntBkmkIdByMenuId: (menuId) => {\r\n    const id = findItemByMenuId(get().nodes, menuId);\r\n    return id ? get().nodes[id]?.prntBkmkId ?? \"-\" : \"-\";\r\n  },\r\n\r\n  getNodeByMenuId: (menuId) => {\r\n    const nodeId = findItemByMenuId(get().nodes, menuId);\r\n    if (!nodeId) return null;\r\n    const node = get().nodes[nodeId];\r\n    return node?.type === \"M\" ? (node as ItemNode) : null;\r\n  },\r\n\r\n  getFolderTree: (q) => {\r\n    const { nodes, rootIds } = get();\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const make = (id: Id): DataNode | null => {\r\n      const n = nodes[id];\r\n      if (!n || n.type !== \"F\") return null;\r\n      const folder = n as FolderNode;\r\n\r\n      const kids = (folder.children || [])\r\n        .map((cid) => nodes[cid])\r\n        .filter((c): c is FolderNode => !!c && c.type === \"F\")\r\n        .map((f) => make(f.bkmkId))\r\n        .filter(Boolean) as DataNode[];\r\n\r\n      const visible = match(folder.bkmkNm) || kids.length > 0;\r\n      if (!visible) return null;\r\n\r\n      return {\r\n        key: folder.bkmkId,\r\n        title: `📁 ${folder.bkmkNm}`,\r\n        children: kids.length ? kids : undefined,\r\n      };\r\n    };\r\n\r\n    return rootIds.map((rid) => make(rid)).filter(Boolean) as DataNode[];\r\n  },\r\n\r\n  // ====== 로더 ======\r\n  loadFavorites: async (userId, force = false) => {\r\n    console.log(\"loadFavorites ::::: \", userId, force);\r\n    const s = get();\r\n    if (!force && s.loadedFor === userId && Object.keys(s.nodes).length) return;\r\n\r\n    set({ loading: true, error: undefined });\r\n    try {\r\n      // 기대 응답 예시: { sub: rawTree[] }\r\n      const res = await callService(\"SCMBKMK00101\", { userId });\r\n      const raw: any[] = Array.isArray(res?.sub) ? res.sub : [];\r\n      const normalized = normalize(raw);\r\n\r\n      const treeNodes = toSimpleTreeFromMap(\r\n        normalized.nodes,\r\n        normalized.rootIds\r\n      );\r\n\r\n      set({\r\n        ...normalized,\r\n        treeNodes,\r\n        loadedFor: userId,\r\n        loading: false,\r\n      });\r\n    } catch (e: any) {\r\n      set({ loading: false, error: e?.message || \"즐겨찾기 로드 실패\" });\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  loadFavoritesIfNeeded: async (userId) => {\r\n    const s = get();\r\n    const notLoaded =\r\n      s.loadedFor !== userId || Object.keys(s.nodes).length === 0;\r\n    if (notLoaded) {\r\n      await get().loadFavorites(userId);\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 생성 ======\r\n  addNode: async (p) => {\r\n    const prev = snapshot(get());\r\n    const tmp = tempId();\r\n\r\n    // 1) 낙관적 반영\r\n    set((s) => {\r\n      const sort = p.sortOrdr ?? tailIndex(s, p.prntBkmkId);\r\n      const next: State = {\r\n        ...s,\r\n        nodes: {\r\n          ...s.nodes,\r\n          [tmp]:\r\n            p.type === \"F\"\r\n              ? ({\r\n                  bkmkId: tmp,\r\n                  type: \"F\",\r\n                  prntBkmkId: p.prntBkmkId || \"-\",\r\n                  sortOrdr: sort,\r\n                  bkmkNm: p.bkmkNm ?? \"새 폴더\",\r\n                  children: [],\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as FolderNode)\r\n              : ({\r\n                  bkmkId: tmp,\r\n                  type: \"M\",\r\n                  prntBkmkId: p.prntBkmkId,\r\n                  sortOrdr: sort,\r\n                  menuId: p.menuId ?? \"\",\r\n                  menuNm: p.menuNm,\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as ItemNode),\r\n        },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      attach(next, tmp, p.prntBkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      // 2) 서버 호출\r\n      // 백엔드는 통합 IUD가 아닐 수 있으므로, 호환 분기 적용\r\n      let real: string = tmp;\r\n      const sortForServer = tailIndex(get(), p.prntBkmkId);\r\n      const res = await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"I\",\r\n        type: p.type,\r\n        sysCd: p.sysCd,\r\n        userId: p.userId,\r\n        bkmkId: tmp, // 서버 새 ID 반환 시 매칭용\r\n        bkmkNm: p.bkmkNm,\r\n        prntBkmkId: p.prntBkmkId,\r\n        menuId: p.menuId,\r\n        sortOrdr: sortForServer,\r\n        chngId: getUserId(),\r\n      });\r\n      real = String(res?.bkmkId ?? res?.itemId ?? tmp);\r\n\r\n      // 3) tmp → real 스왑\r\n      set((s) => {\r\n        const swapped = idSwapImmutable(s, tmp, real);\r\n        return {\r\n          ...swapped,\r\n          treeNodes: toSimpleTreeFromMap(swapped.nodes, swapped.rootIds),\r\n        };\r\n      });\r\n      return real;\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 이동 ======\r\n  moveNode: async ({ bkmkId, newPrntBkmkId, sortOrdr, userId }) => {\r\n    const prev = get(); // 함수 포함 스냅샷(rollback 용으로 set(prev) 사용)\r\n\r\n    const nodes = structuredClone(prev.nodes);\r\n    const rootIds = [...prev.rootIds];\r\n\r\n    const node = nodes[bkmkId];\r\n    if (!node) return;\r\n\r\n    // 부모는 반드시 폴더만 허용\r\n    if (newPrntBkmkId !== \"-\") {\r\n      const parent = nodes[newPrntBkmkId];\r\n      if (!parent || parent.type !== \"F\")\r\n        throw new Error(\"부모는 폴더만 가능합니다.\");\r\n    }\r\n\r\n    const oldParentId = node.prntBkmkId ?? \"-\";\r\n\r\n    const removeFrom =\r\n      oldParentId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[oldParentId] as FolderNode).children ||= []);\r\n    {\r\n      const idx = removeFrom.indexOf(bkmkId);\r\n      if (idx >= 0) removeFrom.splice(idx, 1);\r\n    }\r\n\r\n    const insertTo =\r\n      newPrntBkmkId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[newPrntBkmkId] as FolderNode).children ||= []);\r\n    insertTo.splice(\r\n      Math.max(0, Math.min(sortOrdr, insertTo.length)),\r\n      0,\r\n      bkmkId\r\n    );\r\n\r\n    node.prntBkmkId = newPrntBkmkId as Id;\r\n    set({ nodes, rootIds });\r\n    _resequence(nodes, rootIds, newPrntBkmkId);\r\n    _resequence(nodes, rootIds, oldParentId);\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00104\", {\r\n        // 백엔드 명칭 호환\r\n        bkmkId,\r\n        prntBkmkId: newPrntBkmkId,\r\n        sortOrdr,\r\n        chngId: userId,\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 삭제 ======\r\n  removeNode: async (bkmkId) => {\r\n    const prev = snapshot(get());\r\n\r\n    set((s) => {\r\n      if (!s.nodes[bkmkId]) return s as State;\r\n      const next: State = {\r\n        ...s,\r\n        nodes: { ...s.nodes },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      removeRecursively(next, bkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00103\", { bkmkId });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 수정 ======\r\n  editNode: async ({ bkmkId, userId, bkmkNm, prntBkmkId, sortOrdr }) => {\r\n    const prev = snapshot(get());\r\n\r\n    // 폴더명 변경만 프런트 즉시 반영(옵션)\r\n    set((s) => {\r\n      const next = { ...s, nodes: { ...s.nodes } } as State;\r\n      const target = next.nodes[bkmkId] as FavNode | undefined;\r\n      if (target?.type === \"F\" && typeof bkmkNm === \"string\") {\r\n        next.nodes[bkmkId] = {\r\n          ...(target as FolderNode),\r\n          bkmkNm,\r\n        } as FolderNode;\r\n      }\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"U\",\r\n        userId,\r\n        bkmkId,\r\n        bkmkNm,\r\n        prntBkmkId,\r\n        sortOrdr,\r\n        chngId: getUserId(),\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 호환용 래퍼 ======\r\n  addFolder: async (bkmkNm, prntBkmkId, sysCd, userId) => {\r\n    return await get().addNode({\r\n      type: \"F\",\r\n      bkmkNm,\r\n      prntBkmkId,\r\n      sysCd,\r\n      userId,\r\n    });\r\n  },\r\n\r\n  addMenuToFolder: async (folderBkmkId, menu) => {\r\n    // 전역 중복 방지\r\n    const dup = findItemByMenuId(get().nodes, menu.menuId);\r\n    if (dup) return \"이미 북마크에 저장된 메뉴입니다.\";\r\n    return await get().addNode({\r\n      type: \"M\",\r\n      prntBkmkId: folderBkmkId,\r\n      sysCd: \"KH\",\r\n      userId: getUserId(),\r\n      menuId: menu.menuId,\r\n      menuNm: menu.menuNm,\r\n    });\r\n  },\r\n\r\n  toggleMenuFavorite: async (userId, menu) => {\r\n    const s = get();\r\n    const exists = Object.values(s.nodes).find(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menu.menuId\r\n    );\r\n    if (exists) {\r\n      await get().removeNode(exists.bkmkId);\r\n      return;\r\n    }\r\n\r\n    let folderId = pickDefaultFolderId(s);\r\n    if (!folderId) {\r\n      await get().loadFavorites(userId, true);\r\n      folderId = pickDefaultFolderId(get());\r\n    }\r\n    if (folderId) {\r\n      await get().addNode({\r\n        type: \"M\",\r\n        prntBkmkId: folderId,\r\n        sysCd: \"KH\",\r\n        userId: getUserId(),\r\n        menuId: menu.menuId,\r\n        menuNm: menu.menuNm,\r\n      });\r\n    }\r\n  },\r\n\r\n  removeMenuByMenuId: async (menuId) => {\r\n    const s = get();\r\n    const bkmkId = findItemByMenuId(s.nodes, menuId);\r\n    if (bkmkId) await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeMenu: async (bkmkId) => {\r\n    await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeFolder: async (folderBkmkId) => {\r\n    await get().removeNode(folderBkmkId);\r\n  },\r\n\r\n  editFolder: async (folderBkmkId, userId, newBkmkNm, prntBkmkId, sortOrdr) => {\r\n    await get().editNode({\r\n      bkmkId: folderBkmkId,\r\n      userId,\r\n      bkmkNm: newBkmkNm,\r\n      prntBkmkId,\r\n      sortOrdr,\r\n    });\r\n  },\r\n\r\n  /** Ant Tree 데이터 변환 (검색 포함) */\r\n  convertToAntTreeData: (nodesMap, rootIds, q, onlyFolder = false) => {\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const build = (id: string): any | null => {\r\n      const n = nodesMap[id];\r\n      if (!n) return null;\r\n\r\n      if (onlyFolder && n.type !== \"F\") return null;\r\n\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const children = (f.children || [])\r\n          .map((cid) => build(cid))\r\n          .filter(Boolean);\r\n        const visible = match(f.bkmkNm) || children.length > 0;\r\n        if (!visible) return null;\r\n        return {\r\n          key: f.bkmkId,\r\n          type: \"F\",\r\n          title: `📁 ${f.bkmkNm}`,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          sortOrdr: f.sortOrdr,\r\n          fullPath: f.fullPath,\r\n          children: children.length ? children : undefined,\r\n        };\r\n      } else {\r\n        const i = n as ItemNode;\r\n        const label = i.menuNm ? `${i.menuNm} (${i.menuId})` : i.menuId;\r\n        const visible = match(label);\r\n        if (!visible) return null;\r\n        return {\r\n          key: i.bkmkId,\r\n          type: \"M\",\r\n          title: `📄 ${label}`,\r\n          prntBkmkId: i.prntBkmkId,\r\n          sortOrdr: i.sortOrdr,\r\n          fullPath: i.fullPath,\r\n          isLeaf: true,\r\n        };\r\n      }\r\n    };\r\n\r\n    return rootIds.map(build).filter(Boolean);\r\n  },\r\n});\r\n\r\nexport const useFavoriteStore = create<State>(creator);\r\n\r\n// ===================================================================\r\n// Helpers\r\n// ===================================================================\r\n\r\nfunction normalize(raw: any[]): Normalized {\r\n  const nodes: Record<Id, FavNode> = {};\r\n  const roots: Id[] = [];\r\n\r\n  const walk = (arr: any[]) => {\r\n    arr.forEach((r: any) => {\r\n      // 서버 raw 필드: TYPE, BKMK_ID, PRNT_BKMK_ID, SORT_ORDR, BKMK_NM, MENU_ID, FULL_PATH?\r\n      const base: BkmkBase = {\r\n        type: r.type,\r\n        bkmkId: r.bkmkId ?? r.BKMK_ID ?? r.id,\r\n        prntBkmkId: r.prntBkmkId ?? r.PRNT_BKMK_ID ?? \"-\",\r\n        sortOrdr: Number(r.sortOrdr ?? r.SORT_ORDR ?? 0),\r\n        sysCd: r.sysCd ?? r.SYS_CD,\r\n        userId: r.userId ?? r.USER_ID,\r\n        fullPath: r.fullPath ?? r.FULL_PATH,\r\n      };\r\n\r\n      if (r.type === \"F\") {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          bkmkNm: r.bkmkNm ?? r.BKMK_NM ?? r.name ?? base.bkmkId,\r\n          children: [],\r\n        } as FolderNode;\r\n\r\n        const children = Array.isArray(r.children) ? r.children : [];\r\n        walk(children);\r\n      } else {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          menuId: r.menuId ?? r.MENU_ID ?? \"\",\r\n          menuNm: r.menuNm ?? r.MENU_NM,\r\n        } as ItemNode;\r\n      }\r\n    });\r\n  };\r\n\r\n  walk(raw);\r\n\r\n  // children / rootIds 구성\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.prntBkmkId && n.prntBkmkId !== \"-\") {\r\n      const p = nodes[n.prntBkmkId] as FolderNode;\r\n      if (p?.type === \"F\") p.children.push(n.bkmkId);\r\n    } else if (n.type === \"F\") {\r\n      roots.push(n.bkmkId);\r\n    }\r\n  });\r\n\r\n  // 정렬 인덱스 보정(안전)\r\n  roots.sort((a, b) => (nodes[a].sortOrdr ?? 0) - (nodes[b].sortOrdr ?? 0));\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.type === \"F\") {\r\n      const f = n as FolderNode;\r\n      f.children.sort(\r\n        (A, B) => (nodes[A].sortOrdr ?? 0) - (nodes[B].sortOrdr ?? 0)\r\n      );\r\n    }\r\n  });\r\n\r\n  return { nodes, rootIds: roots };\r\n}\r\n\r\nfunction snapshot(s: State): State {\r\n  return {\r\n    ...s,\r\n    nodes: JSON.parse(JSON.stringify(s.nodes)),\r\n    rootIds: s.rootIds.slice(),\r\n  };\r\n}\r\n\r\nfunction tempId(): Id {\r\n  return `tmp_${Math.random().toString(36).slice(2, 10)}`;\r\n}\r\n\r\nfunction tailIndex(s: Pick<State, \"nodes\" | \"rootIds\">, parentId: Id | \"-\") {\r\n  if (!parentId || parentId === \"-\") return s.rootIds.length;\r\n  const p = s.nodes[parentId] as FolderNode | undefined;\r\n  return p ? p.children.length : 0;\r\n}\r\n\r\nfunction attach(s: State, bkmkId: Id, parentId: Id | \"-\") {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n\r\n  if (parentId && parentId !== \"-\") {\r\n    const p = s.nodes[parentId] as FolderNode | undefined;\r\n    if (!p || p.type !== \"F\") return;\r\n    n.prntBkmkId = parentId;\r\n    p.children = [...p.children, bkmkId];\r\n  } else {\r\n    n.prntBkmkId = \"-\";\r\n    s.rootIds = [...s.rootIds, bkmkId];\r\n  }\r\n}\r\n\r\nfunction detach(s: State, bkmkId: Id) {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n  const pid = n.prntBkmkId;\r\n\r\n  if (pid && pid !== \"-\") {\r\n    const p = s.nodes[pid] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      p.children = p.children.filter((c) => c !== bkmkId);\r\n    }\r\n  } else {\r\n    s.rootIds = s.rootIds.filter((r) => r !== bkmkId);\r\n  }\r\n}\r\n\r\nfunction removeRecursively(s: State, bkmkId: Id) {\r\n  const node = s.nodes[bkmkId];\r\n  if (!node) return;\r\n  if (node.type === \"F\") {\r\n    const children = (node as FolderNode).children.slice();\r\n    children.forEach((cid) => removeRecursively(s, cid));\r\n  }\r\n  detach(s, bkmkId);\r\n  const { [bkmkId]: _omit, ...rest } = s.nodes as Record<string, FavNode>;\r\n  s.nodes = rest;\r\n}\r\n\r\n/** 임시ID → 실제ID 스왑 (불변성 유지) */\r\nfunction idSwapImmutable(s: State, tmp: Id, real: Id): State {\r\n  if (tmp === real) return s;\r\n  const node = s.nodes[tmp];\r\n  if (!node) return s;\r\n\r\n  const newNode: FavNode = JSON.parse(JSON.stringify(node));\r\n  newNode.bkmkId = real;\r\n\r\n  const newNodes: Record<Id, FavNode> = { ...s.nodes, [real]: newNode };\r\n  delete newNodes[tmp];\r\n\r\n  let newRootIds = s.rootIds;\r\n  if (newNode.prntBkmkId && newNode.prntBkmkId !== \"-\") {\r\n    const p = newNodes[newNode.prntBkmkId] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      newNodes[newNode.prntBkmkId] = {\r\n        ...p,\r\n        children: p.children.map((c) => (c === tmp ? real : c)),\r\n      } as FolderNode;\r\n    }\r\n  } else {\r\n    newRootIds = s.rootIds.map((r) => (r === tmp ? real : r));\r\n  }\r\n\r\n  return { ...s, nodes: newNodes, rootIds: newRootIds };\r\n}\r\n\r\nfunction pickDefaultFolderId(s: Pick<State, \"nodes\" | \"rootIds\">): Id | null {\r\n  return s.rootIds.find((id) => s.nodes[id]?.type === \"F\") ?? null;\r\n}\r\n\r\nfunction toSimpleTreeFromMap(nodes: Record<Id, FavNode>, rootIds: Id[]) {\r\n  const childrenByParent: Record<string, string[]> = {};\r\n  Object.values(nodes).forEach((n) => {\r\n    const id = n.bkmkId;\r\n    const pid = n.prntBkmkId;\r\n    if (!id || !pid || pid === \"-\" || pid === id) return;\r\n    (childrenByParent[pid] ??= []).push(id);\r\n  });\r\n\r\n  const visiting = new Set<string>();\r\n\r\n  const build = (id: Id): any => {\r\n    if (visiting.has(id)) return null;\r\n    const n = nodes[id];\r\n    if (!n) return null;\r\n\r\n    visiting.add(id);\r\n    try {\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const childIds = childrenByParent[id] ?? [];\r\n        return {\r\n          type: \"F\",\r\n          bkmkId: id,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          children: childIds.map(build).filter(Boolean),\r\n        };\r\n      }\r\n      const i = n as ItemNode;\r\n\r\n      return {\r\n        type: \"M\",\r\n        bkmkId: id,\r\n        bkmkNm: i.menuNm,\r\n        menuId: i.menuId,\r\n        menuNm: i.menuNm,\r\n        prntBkmkId: i.prntBkmkId,\r\n      };\r\n    } finally {\r\n      visiting.delete(id);\r\n    }\r\n  };\r\n\r\n  const rootMenuIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"M\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootFolderIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"F\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootKeys = Array.from(\r\n    new Set([...rootIds, ...rootMenuIds, ...rootFolderIds])\r\n  );\r\n  return rootKeys.map(build).filter(Boolean);\r\n}\r\n\r\nfunction findItemByMenuId(\r\n  nodes: Record<Id, FavNode>,\r\n  menuId: string\r\n): Id | null {\r\n  for (const n of Object.values(nodes)) {\r\n    if (n.type === \"M\" && (n as ItemNode).menuId === menuId) return n.bkmkId;\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction _resequence(\r\n  nodes: Record<Id, FavNode>,\r\n  rootIds: Id[],\r\n  parentId: Id | \"-\"\r\n) {\r\n  const siblings: Id[] =\r\n    !parentId || parentId === \"-\"\r\n      ? rootIds\r\n      : (nodes[parentId] as FolderNode).children || [];\r\n  siblings.forEach((sid, idx) => {\r\n    const n = nodes[sid];\r\n    if (!n) return;\r\n    n.sortOrdr = idx;\r\n  });\r\n}\r\n"],"names":["creator","set","get","menuId","n","id","findItemByMenuId","nodeId","node","q","nodes","rootIds","match","make","folder","kids","cid","c","f","rid","userId","force","s","res","callService","raw","normalized","normalize","treeNodes","toSimpleTreeFromMap","e","p","prev","snapshot","tmp","tempId","sort","tailIndex","next","attach","real","sortForServer","getUserId","swapped","idSwapImmutable","bkmkId","newPrntBkmkId","sortOrdr","parent","oldParentId","removeFrom","idx","insertTo","_resequence","removeRecursively","bkmkNm","prntBkmkId","target","sysCd","folderBkmkId","menu","exists","folderId","pickDefaultFolderId","newBkmkNm","nodesMap","onlyFolder","build","children","i","label","useFavoriteStore","create","roots","walk","arr","r","base","a","b","A","B","parentId","detach","pid","_omit","rest","newNode","newNodes","newRootIds","childrenByParent","visiting","childIds","rootMenuIds","rootFolderIds","sid"],"mappings":"6EAkIMA,EAA+B,CAACC,EAAKC,KAAS,CAClD,MAAO,CAAA,EACP,QAAS,CAAA,EACT,UAAW,OACX,QAAS,GACT,MAAO,OACP,UAAW,CAAA,EAGX,iBAAmBC,GACjB,OAAO,OAAOD,EAAA,EAAM,KAAK,EAAE,KACxBE,GAAMA,EAAE,OAAS,KAAQA,EAAe,SAAWD,CAAA,EAExD,sBAAwBA,GAAW,CACjC,MAAME,EAAKC,EAAiBJ,EAAA,EAAM,MAAOC,CAAM,EAC/C,OAAOE,EAAKH,IAAM,MAAMG,CAAE,GAAG,YAAc,IAAM,GACnD,EAEA,gBAAkBF,GAAW,CAC3B,MAAMI,EAASD,EAAiBJ,EAAA,EAAM,MAAOC,CAAM,EACnD,GAAI,CAACI,EAAQ,OAAO,KACpB,MAAMC,EAAON,IAAM,MAAMK,CAAM,EAC/B,OAAOC,GAAM,OAAS,IAAOA,EAAoB,IACnD,EAEA,cAAgBC,GAAM,CACpB,KAAM,CAAE,MAAAC,EAAO,QAAAC,CAAA,EAAYT,EAAA,EACrBU,EAAS,GACbH,EAAI,EAAE,YAAA,EAAc,SAASA,EAAE,YAAA,CAAa,EAAI,GAE5CI,EAAQR,GAA4B,CACxC,MAAMD,EAAIM,EAAML,CAAE,EAClB,GAAI,CAACD,GAAKA,EAAE,OAAS,IAAK,OAAO,KACjC,MAAMU,EAASV,EAETW,GAAQD,EAAO,UAAY,CAAA,GAC9B,IAAKE,GAAQN,EAAMM,CAAG,CAAC,EACvB,OAAQC,GAAuB,CAAC,CAACA,GAAKA,EAAE,OAAS,GAAG,EACpD,IAAKC,GAAML,EAAKK,EAAE,MAAM,CAAC,EACzB,OAAO,OAAO,EAGjB,OADgBN,EAAME,EAAO,MAAM,GAAKC,EAAK,OAAS,EAG/C,CACL,IAAKD,EAAO,OACZ,MAAO,MAAMA,EAAO,MAAM,GAC1B,SAAUC,EAAK,OAASA,EAAO,MAAA,EALZ,IAOvB,EAEA,OAAOJ,EAAQ,IAAKQ,GAAQN,EAAKM,CAAG,CAAC,EAAE,OAAO,OAAO,CACvD,EAGA,cAAe,MAAOC,EAAQC,EAAQ,KAAU,CAC9C,QAAQ,IAAI,uBAAwBD,EAAQC,CAAK,EACjD,MAAMC,EAAIpB,EAAA,EACV,GAAI,GAACmB,GAASC,EAAE,YAAcF,GAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,QAE7D,CAAArB,EAAI,CAAE,QAAS,GAAM,MAAO,OAAW,EACvC,GAAI,CAEF,MAAMsB,EAAM,MAAMC,EAAAA,YAAY,eAAgB,CAAE,OAAAJ,EAAQ,EAClDK,EAAa,MAAM,QAAQF,GAAK,GAAG,EAAIA,EAAI,IAAM,CAAA,EACjDG,EAAaC,EAAUF,CAAG,EAE1BG,EAAYC,EAChBH,EAAW,MACXA,EAAW,OAAA,EAGbzB,EAAI,CACF,GAAGyB,EACH,UAAAE,EACA,UAAWR,EACX,QAAS,EAAA,CACV,CACH,OAASU,EAAQ,CACf,MAAA7B,EAAI,CAAE,QAAS,GAAO,MAAO6B,GAAG,SAAW,aAAc,EACnDA,CACR,EACF,EAEA,sBAAuB,MAAOV,GAAW,CACvC,MAAME,EAAIpB,EAAA,GAERoB,EAAE,YAAcF,GAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,SAAW,IAE1D,MAAMpB,EAAA,EAAM,cAAckB,CAAM,CAEpC,EAGA,QAAS,MAAOW,GAAM,CACpB,MAAMC,EAAOC,EAAS/B,GAAK,EACrBgC,EAAMC,EAAA,EAGZlC,EAAKqB,GAAM,CACT,MAAMc,EAAOL,EAAE,UAAYM,EAAUf,EAAGS,EAAE,UAAU,EAC9CO,EAAc,CAClB,GAAGhB,EACH,MAAO,CACL,GAAGA,EAAE,MACL,CAACY,CAAG,EACFH,EAAE,OAAS,IACN,CACC,OAAQG,EACR,KAAM,IACN,WAAYH,EAAE,YAAc,IAC5B,SAAUK,EACV,OAAQL,EAAE,QAAU,OACpB,SAAU,CAAA,EACV,MAAOA,EAAE,MACT,OAAQA,EAAE,MAAA,EAEX,CACC,OAAQG,EACR,KAAM,IACN,WAAYH,EAAE,WACd,SAAUK,EACV,OAAQL,EAAE,QAAU,GACpB,OAAQA,EAAE,OACV,MAAOA,EAAE,MACT,OAAQA,EAAE,MAAA,CACZ,EAER,QAAST,EAAE,QAAQ,MAAA,EACnB,UAAWA,EAAE,SAAA,EAEf,OAAAiB,EAAOD,EAAMJ,EAAKH,EAAE,UAAU,EAC9BO,EAAK,UAAYT,EAAoBS,EAAK,MAAOA,EAAK,OAAO,EACtDA,CACT,CAAC,EAED,GAAI,CAGF,IAAIE,EAAeN,EACnB,MAAMO,EAAgBJ,EAAUnC,EAAA,EAAO6B,EAAE,UAAU,EAC7CR,EAAM,MAAMC,EAAAA,YAAY,eAAgB,CAC5C,QAAS,IACT,KAAMO,EAAE,KACR,MAAOA,EAAE,MACT,OAAQA,EAAE,OACV,OAAQG,EACR,OAAQH,EAAE,OACV,WAAYA,EAAE,WACd,OAAQA,EAAE,OACV,SAAUU,EACV,OAAQC,EAAAA,UAAA,CAAU,CACnB,EACD,OAAAF,EAAO,OAAOjB,GAAK,QAAUA,GAAK,QAAUW,CAAG,EAG/CjC,EAAKqB,GAAM,CACT,MAAMqB,EAAUC,EAAgBtB,EAAGY,EAAKM,CAAI,EAC5C,MAAO,CACL,GAAGG,EACH,UAAWd,EAAoBc,EAAQ,MAAOA,EAAQ,OAAO,CAAA,CAEjE,CAAC,EACMH,CACT,OAASV,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,SAAU,MAAO,CAAE,OAAAe,EAAQ,cAAAC,EAAe,SAAAC,EAAU,OAAA3B,KAAa,CAC/D,MAAMY,EAAO9B,EAAA,EAEPQ,EAAQ,gBAAgBsB,EAAK,KAAK,EAClCrB,EAAU,CAAC,GAAGqB,EAAK,OAAO,EAE1BxB,EAAOE,EAAMmC,CAAM,EACzB,GAAI,CAACrC,EAAM,OAGX,GAAIsC,IAAkB,IAAK,CACzB,MAAME,EAAStC,EAAMoC,CAAa,EAClC,GAAI,CAACE,GAAUA,EAAO,OAAS,IAC7B,MAAM,IAAI,MAAM,gBAAgB,CACpC,CAEA,MAAMC,EAAczC,EAAK,YAAc,IAEjC0C,EACJD,IAAgB,IACZtC,EACED,EAAMuC,CAAW,EAAiB,WAAa,CAAA,EACvD,CACE,MAAME,EAAMD,EAAW,QAAQL,CAAM,EACjCM,GAAO,GAAGD,EAAW,OAAOC,EAAK,CAAC,CACxC,CAEA,MAAMC,EACJN,IAAkB,IACdnC,EACED,EAAMoC,CAAa,EAAiB,WAAa,CAAA,EACzDM,EAAS,OACP,KAAK,IAAI,EAAG,KAAK,IAAIL,EAAUK,EAAS,MAAM,CAAC,EAC/C,EACAP,CAAA,EAGFrC,EAAK,WAAasC,EAClB7C,EAAI,CAAE,MAAAS,EAAO,QAAAC,EAAS,EACtB0C,EAAY3C,EAAOC,EAASmC,CAAa,EACzCO,EAAY3C,EAAOC,EAASsC,CAAW,EAEvC,GAAI,CACF,MAAMzB,EAAAA,YAAY,eAAgB,CAEhC,OAAAqB,EACA,WAAYC,EACZ,SAAAC,EACA,OAAQ3B,CAAA,CACT,CACH,OAASU,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,WAAY,MAAOe,GAAW,CAC5B,MAAMb,EAAOC,EAAS/B,GAAK,EAE3BD,EAAKqB,GAAM,CACT,GAAI,CAACA,EAAE,MAAMuB,CAAM,EAAG,OAAOvB,EAC7B,MAAMgB,EAAc,CAClB,GAAGhB,EACH,MAAO,CAAE,GAAGA,EAAE,KAAA,EACd,QAASA,EAAE,QAAQ,MAAA,EACnB,UAAWA,EAAE,SAAA,EAEf,OAAAgC,EAAkBhB,EAAMO,CAAM,EAC9BP,EAAK,UAAYT,EAAoBS,EAAK,MAAOA,EAAK,OAAO,EACtDA,CACT,CAAC,EAED,GAAI,CACF,MAAMd,cAAY,eAAgB,CAAE,OAAAqB,EAAQ,CAC9C,OAASf,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,SAAU,MAAO,CAAE,OAAAe,EAAQ,OAAAzB,EAAQ,OAAAmC,EAAQ,WAAAC,EAAY,SAAAT,KAAe,CACpE,MAAMf,EAAOC,EAAS/B,GAAK,EAG3BD,EAAKqB,GAAM,CACT,MAAMgB,EAAO,CAAE,GAAGhB,EAAG,MAAO,CAAE,GAAGA,EAAE,MAAM,EACnCmC,EAASnB,EAAK,MAAMO,CAAM,EAChC,OAAIY,GAAQ,OAAS,KAAO,OAAOF,GAAW,WAC5CjB,EAAK,MAAMO,CAAM,EAAI,CACnB,GAAIY,EACJ,OAAAF,CAAA,GAGGjB,CACT,CAAC,EAED,GAAI,CACF,MAAMd,EAAAA,YAAY,eAAgB,CAChC,QAAS,IACT,OAAAJ,EACA,OAAAyB,EACA,OAAAU,EACA,WAAAC,EACA,SAAAT,EACA,OAAQL,EAAAA,UAAA,CAAU,CACnB,CACH,OAASZ,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,UAAW,MAAOyB,EAAQC,EAAYE,EAAOtC,IACpC,MAAMlB,EAAA,EAAM,QAAQ,CACzB,KAAM,IACN,OAAAqD,EACA,WAAAC,EACA,MAAAE,EACA,OAAAtC,CAAA,CACD,EAGH,gBAAiB,MAAOuC,EAAcC,IAExBtD,EAAiBJ,EAAA,EAAM,MAAO0D,EAAK,MAAM,EACrC,qBACT,MAAM1D,EAAA,EAAM,QAAQ,CACzB,KAAM,IACN,WAAYyD,EACZ,MAAO,KACP,OAAQjB,EAAAA,UAAA,EACR,OAAQkB,EAAK,OACb,OAAQA,EAAK,MAAA,CACd,EAGH,mBAAoB,MAAOxC,EAAQwC,IAAS,CAC1C,MAAMtC,EAAIpB,EAAA,EACJ2D,EAAS,OAAO,OAAOvC,EAAE,KAAK,EAAE,KACnClB,GAAMA,EAAE,OAAS,KAAQA,EAAe,SAAWwD,EAAK,MAAA,EAE3D,GAAIC,EAAQ,CACV,MAAM3D,EAAA,EAAM,WAAW2D,EAAO,MAAM,EACpC,MACF,CAEA,IAAIC,EAAWC,EAAoBzC,CAAC,EAC/BwC,IACH,MAAM5D,EAAA,EAAM,cAAckB,EAAQ,EAAI,EACtC0C,EAAWC,EAAoB7D,GAAK,GAElC4D,GACF,MAAM5D,EAAA,EAAM,QAAQ,CAClB,KAAM,IACN,WAAY4D,EACZ,MAAO,KACP,OAAQpB,EAAAA,UAAA,EACR,OAAQkB,EAAK,OACb,OAAQA,EAAK,MAAA,CACd,CAEL,EAEA,mBAAoB,MAAOzD,GAAW,CACpC,MAAMmB,EAAIpB,EAAA,EACJ2C,EAASvC,EAAiBgB,EAAE,MAAOnB,CAAM,EAC3C0C,GAAQ,MAAM3C,IAAM,WAAW2C,CAAM,CAC3C,EAEA,WAAY,MAAOA,GAAW,CAC5B,MAAM3C,EAAA,EAAM,WAAW2C,CAAM,CAC/B,EAEA,aAAc,MAAOc,GAAiB,CACpC,MAAMzD,EAAA,EAAM,WAAWyD,CAAY,CACrC,EAEA,WAAY,MAAOA,EAAcvC,EAAQ4C,EAAWR,EAAYT,IAAa,CAC3E,MAAM7C,EAAA,EAAM,SAAS,CACnB,OAAQyD,EACR,OAAAvC,EACA,OAAQ4C,EACR,WAAAR,EACA,SAAAT,CAAA,CACD,CACH,EAGA,qBAAsB,CAACkB,EAAUtD,EAASF,EAAGyD,EAAa,KAAU,CAClE,MAAMtD,EAASU,GACbb,EAAIa,EAAE,YAAA,EAAc,SAASb,EAAE,YAAA,CAAa,EAAI,GAE5C0D,EAAS9D,GAA2B,CACxC,MAAMD,EAAI6D,EAAS5D,CAAE,EAGrB,GAFI,CAACD,GAED8D,GAAc9D,EAAE,OAAS,IAAK,OAAO,KAEzC,GAAIA,EAAE,OAAS,IAAK,CAClB,MAAMc,EAAId,EACJgE,GAAYlD,EAAE,UAAY,CAAA,GAC7B,IAAKF,GAAQmD,EAAMnD,CAAG,CAAC,EACvB,OAAO,OAAO,EAEjB,OADgBJ,EAAMM,EAAE,MAAM,GAAKkD,EAAS,OAAS,EAE9C,CACL,IAAKlD,EAAE,OACP,KAAM,IACN,MAAO,MAAMA,EAAE,MAAM,GACrB,OAAQA,EAAE,OACV,WAAYA,EAAE,WACd,SAAUA,EAAE,SACZ,SAAUA,EAAE,SACZ,SAAUkD,EAAS,OAASA,EAAW,MAAA,EATpB,IAWvB,KAAO,CACL,MAAMC,EAAIjE,EACJkE,EAAQD,EAAE,OAAS,GAAGA,EAAE,MAAM,KAAKA,EAAE,MAAM,IAAMA,EAAE,OAEzD,OADgBzD,EAAM0D,CAAK,EAEpB,CACL,IAAKD,EAAE,OACP,KAAM,IACN,MAAO,MAAMC,CAAK,GAClB,WAAYD,EAAE,WACd,SAAUA,EAAE,SACZ,SAAUA,EAAE,SACZ,OAAQ,EAAA,EARW,IAUvB,CACF,EAEA,OAAO1D,EAAQ,IAAIwD,CAAK,EAAE,OAAO,OAAO,CAC1C,CACF,GAEaI,EAAmBC,EAAAA,OAAcxE,CAAO,EAMrD,SAAS2B,EAAUF,EAAwB,CACzC,MAAMf,EAA6B,CAAA,EAC7B+D,EAAc,CAAA,EAEdC,EAAQC,GAAe,CAC3BA,EAAI,QAASC,GAAW,CAEtB,MAAMC,EAAiB,CACrB,KAAMD,EAAE,KACR,OAAQA,EAAE,QAAUA,EAAE,SAAWA,EAAE,GACnC,WAAYA,EAAE,YAAcA,EAAE,cAAgB,IAC9C,SAAU,OAAOA,EAAE,UAAYA,EAAE,WAAa,CAAC,EAC/C,MAAOA,EAAE,OAASA,EAAE,OACpB,OAAQA,EAAE,QAAUA,EAAE,QACtB,SAAUA,EAAE,UAAYA,EAAE,SAAA,EAG5B,GAAIA,EAAE,OAAS,IAAK,CAClBlE,EAAMmE,EAAK,MAAM,EAAI,CACnB,GAAGA,EACH,OAAQD,EAAE,QAAUA,EAAE,SAAWA,EAAE,MAAQC,EAAK,OAChD,SAAU,CAAA,CAAC,EAGb,MAAMT,EAAW,MAAM,QAAQQ,EAAE,QAAQ,EAAIA,EAAE,SAAW,CAAA,EAC1DF,EAAKN,CAAQ,CACf,MACE1D,EAAMmE,EAAK,MAAM,EAAI,CACnB,GAAGA,EACH,OAAQD,EAAE,QAAUA,EAAE,SAAW,GACjC,OAAQA,EAAE,QAAUA,EAAE,OAAA,CAG5B,CAAC,CACH,EAEA,OAAAF,EAAKjD,CAAG,EAGR,OAAO,OAAOf,CAAK,EAAE,QAASN,GAAM,CAClC,GAAIA,EAAE,YAAcA,EAAE,aAAe,IAAK,CACxC,MAAM2B,EAAIrB,EAAMN,EAAE,UAAU,EACxB2B,GAAG,OAAS,OAAO,SAAS,KAAK3B,EAAE,MAAM,CAC/C,MAAWA,EAAE,OAAS,KACpBqE,EAAM,KAAKrE,EAAE,MAAM,CAEvB,CAAC,EAGDqE,EAAM,KAAK,CAACK,EAAGC,KAAOrE,EAAMoE,CAAC,EAAE,UAAY,IAAMpE,EAAMqE,CAAC,EAAE,UAAY,EAAE,EACxE,OAAO,OAAOrE,CAAK,EAAE,QAASN,GAAM,CAC9BA,EAAE,OAAS,KACHA,EACR,SAAS,KACT,CAAC4E,EAAGC,KAAOvE,EAAMsE,CAAC,EAAE,UAAY,IAAMtE,EAAMuE,CAAC,EAAE,UAAY,EAAA,CAGjE,CAAC,EAEM,CAAE,MAAAvE,EAAO,QAAS+D,CAAA,CAC3B,CAEA,SAASxC,EAASX,EAAiB,CACjC,MAAO,CACL,GAAGA,EACH,MAAO,KAAK,MAAM,KAAK,UAAUA,EAAE,KAAK,CAAC,EACzC,QAASA,EAAE,QAAQ,MAAA,CAAM,CAE7B,CAEA,SAASa,GAAa,CACpB,MAAO,OAAO,KAAK,SAAS,SAAS,EAAE,EAAE,MAAM,EAAG,EAAE,CAAC,EACvD,CAEA,SAASE,EAAUf,EAAqC4D,EAAoB,CAC1E,GAAI,CAACA,GAAYA,IAAa,IAAK,OAAO5D,EAAE,QAAQ,OACpD,MAAMS,EAAIT,EAAE,MAAM4D,CAAQ,EAC1B,OAAOnD,EAAIA,EAAE,SAAS,OAAS,CACjC,CAEA,SAASQ,EAAOjB,EAAUuB,EAAYqC,EAAoB,CACxD,MAAM9E,EAAIkB,EAAE,MAAMuB,CAAM,EACxB,GAAKzC,EAEL,GAAI8E,GAAYA,IAAa,IAAK,CAChC,MAAMnD,EAAIT,EAAE,MAAM4D,CAAQ,EAC1B,GAAI,CAACnD,GAAKA,EAAE,OAAS,IAAK,OAC1B3B,EAAE,WAAa8E,EACfnD,EAAE,SAAW,CAAC,GAAGA,EAAE,SAAUc,CAAM,CACrC,MACEzC,EAAE,WAAa,IACfkB,EAAE,QAAU,CAAC,GAAGA,EAAE,QAASuB,CAAM,CAErC,CAEA,SAASsC,EAAO7D,EAAUuB,EAAY,CACpC,MAAMzC,EAAIkB,EAAE,MAAMuB,CAAM,EACxB,GAAI,CAACzC,EAAG,OACR,MAAMgF,EAAMhF,EAAE,WAEd,GAAIgF,GAAOA,IAAQ,IAAK,CACtB,MAAMrD,EAAIT,EAAE,MAAM8D,CAAG,EACjBrD,GAAG,OAAS,MACdA,EAAE,SAAWA,EAAE,SAAS,OAAQd,GAAMA,IAAM4B,CAAM,EAEtD,MACEvB,EAAE,QAAUA,EAAE,QAAQ,OAAQsD,GAAMA,IAAM/B,CAAM,CAEpD,CAEA,SAASS,EAAkBhC,EAAUuB,EAAY,CAC/C,MAAMrC,EAAOc,EAAE,MAAMuB,CAAM,EAC3B,GAAI,CAACrC,EAAM,OACPA,EAAK,OAAS,KACEA,EAAoB,SAAS,MAAA,EACtC,QAASQ,GAAQsC,EAAkBhC,EAAGN,CAAG,CAAC,EAErDmE,EAAO7D,EAAGuB,CAAM,EAChB,KAAM,CAAE,CAACA,CAAM,EAAGwC,EAAO,GAAGC,CAAA,EAAShE,EAAE,MACvCA,EAAE,MAAQgE,CACZ,CAGA,SAAS1C,EAAgBtB,EAAUY,EAASM,EAAiB,CAC3D,GAAIN,IAAQM,EAAM,OAAOlB,EACzB,MAAMd,EAAOc,EAAE,MAAMY,CAAG,EACxB,GAAI,CAAC1B,EAAM,OAAOc,EAElB,MAAMiE,EAAmB,KAAK,MAAM,KAAK,UAAU/E,CAAI,CAAC,EACxD+E,EAAQ,OAAS/C,EAEjB,MAAMgD,EAAgC,CAAE,GAAGlE,EAAE,MAAO,CAACkB,CAAI,EAAG+C,CAAA,EAC5D,OAAOC,EAAStD,CAAG,EAEnB,IAAIuD,EAAanE,EAAE,QACnB,GAAIiE,EAAQ,YAAcA,EAAQ,aAAe,IAAK,CACpD,MAAMxD,EAAIyD,EAASD,EAAQ,UAAU,EACjCxD,GAAG,OAAS,MACdyD,EAASD,EAAQ,UAAU,EAAI,CAC7B,GAAGxD,EACH,SAAUA,EAAE,SAAS,IAAKd,GAAOA,IAAMiB,EAAMM,EAAOvB,CAAE,CAAA,EAG5D,MACEwE,EAAanE,EAAE,QAAQ,IAAKsD,GAAOA,IAAM1C,EAAMM,EAAOoC,CAAE,EAG1D,MAAO,CAAE,GAAGtD,EAAG,MAAOkE,EAAU,QAASC,CAAA,CAC3C,CAEA,SAAS1B,EAAoBzC,EAAgD,CAC3E,OAAOA,EAAE,QAAQ,KAAMjB,GAAOiB,EAAE,MAAMjB,CAAE,GAAG,OAAS,GAAG,GAAK,IAC9D,CAEA,SAASwB,EAAoBnB,EAA4BC,EAAe,CACtE,MAAM+E,EAA6C,CAAA,EACnD,OAAO,OAAOhF,CAAK,EAAE,QAASN,GAAM,CAClC,MAAMC,EAAKD,EAAE,OACPgF,EAAMhF,EAAE,WACV,CAACC,GAAM,CAAC+E,GAAOA,IAAQ,KAAOA,IAAQ/E,IACzCqF,EAAiBN,CAAG,IAAM,CAAA,GAAI,KAAK/E,CAAE,CACxC,CAAC,EAED,MAAMsF,MAAe,IAEfxB,EAAS9D,GAAgB,CAC7B,GAAIsF,EAAS,IAAItF,CAAE,EAAG,OAAO,KAC7B,MAAMD,EAAIM,EAAML,CAAE,EAClB,GAAI,CAACD,EAAG,OAAO,KAEfuF,EAAS,IAAItF,CAAE,EACf,GAAI,CACF,GAAID,EAAE,OAAS,IAAK,CAClB,MAAMc,EAAId,EACJwF,EAAWF,EAAiBrF,CAAE,GAAK,CAAA,EACzC,MAAO,CACL,KAAM,IACN,OAAQA,EACR,OAAQa,EAAE,OACV,WAAYA,EAAE,WACd,SAAU0E,EAAS,IAAIzB,CAAK,EAAE,OAAO,OAAO,CAAA,CAEhD,CACA,MAAME,EAAIjE,EAEV,MAAO,CACL,KAAM,IACN,OAAQC,EACR,OAAQgE,EAAE,OACV,OAAQA,EAAE,OACV,OAAQA,EAAE,OACV,WAAYA,EAAE,UAAA,CAElB,QAAA,CACEsB,EAAS,OAAOtF,CAAE,CACpB,CACF,EAEMwF,EAAc,OAAO,OAAOnF,CAAK,EACpC,OAAQN,GAAMA,EAAE,aAAe,KAAOA,EAAE,OAAS,GAAG,EACpD,IAAKA,GAAMA,EAAE,MAAM,EAEhB0F,EAAgB,OAAO,OAAOpF,CAAK,EACtC,OAAQN,GAAMA,EAAE,aAAe,KAAOA,EAAE,OAAS,GAAG,EACpD,IAAKA,GAAMA,EAAE,MAAM,EAKtB,OAHiB,MAAM,KACrB,IAAI,IAAI,CAAC,GAAGO,EAAS,GAAGkF,EAAa,GAAGC,CAAa,CAAC,CAAA,EAExC,IAAI3B,CAAK,EAAE,OAAO,OAAO,CAC3C,CAEA,SAAS7D,EACPI,EACAP,EACW,CACX,UAAWC,KAAK,OAAO,OAAOM,CAAK,EACjC,GAAIN,EAAE,OAAS,KAAQA,EAAe,SAAWD,SAAeC,EAAE,OAEpE,OAAO,IACT,CAEA,SAASiD,EACP3C,EACAC,EACAuE,EACA,EAEE,CAACA,GAAYA,IAAa,IACtBvE,EACCD,EAAMwE,CAAQ,EAAiB,UAAY,CAAA,GACzC,QAAQ,CAACa,EAAK5C,IAAQ,CAC7B,MAAM/C,EAAIM,EAAMqF,CAAG,EACd3F,IACLA,EAAE,SAAW+C,EACf,CAAC,CACH"}
+{"version":3,"file":"favoriteStore-CcKg_nEH.cjs","sources":["../../src/stores/favoriteStore.ts"],"sourcesContent":["// -------------------------------------------------------\r\n// 즐겨찾기(폴더형) Zustand Store (단일 테이블 CM_BKMK_MSTR 기반)\r\n// 공통 CRUD로 통합: addNode / moveNode / removeNode / editNode\r\n// 기존 API(폴더/메뉴 전용)는 호환용으로 래핑만 유지\r\n// - 정규화(nodes + rootIds)\r\n// - 낙관적 업데이트 + 임시ID(tmp_* → 서버ID) 스왑\r\n// - 필수 기능: 로드, 생성, 이동, 삭제, 수정 + 셀렉터/뷰 변환\r\n// -------------------------------------------------------\r\n\r\nimport { callService } from \"../utils/apiUtils\";\r\nimport { getUserId } from \"../utils/userUtils\";\r\nimport { DataNode } from \"antd/es/tree\";\r\nimport { create, StateCreator } from \"zustand\";\r\n\r\n// 🔧 공통 ID 타입\r\nexport type Id = string;\r\n\r\n/** 공통 베이스 (CM_BKMK_MSTR 매핑) */\r\nexport type BkmkBase = {\r\n  type: \"F\" | \"M\"; // TYPE\r\n  bkmkId: Id; // BKMK_ID\r\n  prntBkmkId: Id | \"-\"; // PRNT_BKMK_ID ('-'=루트)\r\n  sortOrdr: number; // SORT_ORDR\r\n  sysCd?: string; // SYS_CD (옵션)\r\n  userId?: string | null; // USER_ID (옵션)\r\n  fullPath?: string; // 프론트 보조(옵션)\r\n};\r\n\r\n/** 폴더 노드 (BKMK_NM 사용) */\r\nexport type FolderNode = BkmkBase & {\r\n  bkmkNm: string; // BKMK_NM (폴더 전용)\r\n  children: Id[]; // 폴더/아이템 혼재(정규화용)\r\n};\r\n\r\n/** 아이템 노드 (메뉴 전용 메타) */\r\nexport type ItemNode = BkmkBase & {\r\n  menuId: string; // MENU_ID\r\n  menuNm?: string; // 프론트 보조(메뉴명)\r\n};\r\n\r\nexport type FavNode = FolderNode | ItemNode;\r\n\r\nexport type MovePayload = {\r\n  bkmkId: Id;\r\n  newPrntBkmkId: Id | \"-\";\r\n  sortOrdr: number; // 새 부모 내 0-based\r\n  userId: string | null;\r\n};\r\n\r\nexport type AddNodePayload = {\r\n  type: \"F\" | \"M\";\r\n  prntBkmkId: Id | \"-\";\r\n  sysCd: string;\r\n  userId: string | null;\r\n  bkmkNm?: string; // F 전용\r\n  menuId?: string; // M 전용\r\n  menuNm?: string; // 프론트 보조\r\n  sortOrdr?: number; // 선택: 지정 없으면 tailIndex 사용\r\n};\r\n\r\nexport type EditNodePayload = {\r\n  bkmkId: Id;\r\n  userId: string;\r\n  bkmkNm?: string; // F일 때만 의미\r\n  prntBkmkId?: Id | \"-\"; // 선택(이동은 moveNode 권장)\r\n  sortOrdr?: number; // 선택\r\n};\r\n\r\nexport type Normalized = { nodes: Record<Id, FavNode>; rootIds: Id[] };\r\n\r\nexport type State = {\r\n  // ========== 데이터(정규화) ==========\r\n  nodes: Record<Id, FavNode>;\r\n  rootIds: Id[];\r\n  treeNodes: FavNode[]; // 단순 트리(뷰용)\r\n\r\n  // ========== 메타 ==========\r\n  loadedFor?: string;\r\n  loading: boolean;\r\n  error?: string;\r\n\r\n  // ========== 셀렉터 ==========\r\n  isMenuBookmarked: (menuId: string) => boolean;\r\n  getPrntBkmkIdByMenuId: (menuId: string) => Id | \"-\";\r\n  getNodeByMenuId: (menuId: string) => ItemNode | null;\r\n  getFolderTree: (q?: string) => DataNode[]; // 폴더만 Tree (검색 필터)\r\n\r\n  // ========== 로더 ==========\r\n  loadFavorites: (userId: string, force?: boolean) => Promise<void>;\r\n  loadFavoritesIfNeeded: (userId: string) => Promise<void>;\r\n\r\n  // ========== 공통 CRUD ==========\r\n  addNode: (p: AddNodePayload) => Promise<Id>;\r\n  moveNode: (p: MovePayload) => Promise<void>;\r\n  removeNode: (bkmkId: Id) => Promise<void>;\r\n  editNode: (p: EditNodePayload) => Promise<void>;\r\n\r\n  // ========== 호환용(기존 API 유지, 내부에서 공통 호출) ==========\r\n  addFolder: (\r\n    bkmkNm: string,\r\n    prntBkmkId: Id | \"-\",\r\n    sysCd: string,\r\n    userId: string | null\r\n  ) => Promise<Id>;\r\n  addMenuToFolder: (\r\n    folderBkmkId: Id,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<Id | string>;\r\n  toggleMenuFavorite: (\r\n    userId: string | null,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<void>;\r\n  removeMenu: (bkmkId: Id) => Promise<void>;\r\n  removeMenuByMenuId: (menuId: string) => Promise<void>;\r\n  removeFolder: (folderBkmkId: Id) => Promise<void>;\r\n  editFolder: (\r\n    folderBkmkId: Id,\r\n    userId: string | null,\r\n    newBkmkNm?: string,\r\n    prntBkmkId?: Id | \"-\",\r\n    sortOrdr?: number\r\n  ) => Promise<void>;\r\n  convertToAntTreeData: (\r\n    nodesMap: Record<string, FavNode>,\r\n    rootIds: string[],\r\n    q: string,\r\n    onlyFolder?: boolean\r\n  ) => any[];\r\n};\r\n\r\nconst creator: StateCreator<State> = (set, get) => ({\r\n  nodes: {},\r\n  rootIds: [],\r\n  loadedFor: undefined,\r\n  loading: false,\r\n  error: undefined,\r\n  treeNodes: [],\r\n\r\n  // ====== 셀렉터 ======\r\n  isMenuBookmarked: (menuId) =>\r\n    Object.values(get().nodes).some(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menuId\r\n    ),\r\n  getPrntBkmkIdByMenuId: (menuId) => {\r\n    const id = findItemByMenuId(get().nodes, menuId);\r\n    return id ? get().nodes[id]?.prntBkmkId ?? \"-\" : \"-\";\r\n  },\r\n\r\n  getNodeByMenuId: (menuId) => {\r\n    const nodeId = findItemByMenuId(get().nodes, menuId);\r\n    if (!nodeId) return null;\r\n    const node = get().nodes[nodeId];\r\n    return node?.type === \"M\" ? (node as ItemNode) : null;\r\n  },\r\n\r\n  getFolderTree: (q) => {\r\n    const { nodes, rootIds } = get();\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const make = (id: Id): DataNode | null => {\r\n      const n = nodes[id];\r\n      if (!n || n.type !== \"F\") return null;\r\n      const folder = n as FolderNode;\r\n\r\n      const kids = (folder.children || [])\r\n        .map((cid) => nodes[cid])\r\n        .filter((c): c is FolderNode => !!c && c.type === \"F\")\r\n        .map((f) => make(f.bkmkId))\r\n        .filter(Boolean) as DataNode[];\r\n\r\n      const visible = match(folder.bkmkNm) || kids.length > 0;\r\n      if (!visible) return null;\r\n\r\n      return {\r\n        key: folder.bkmkId,\r\n        title: `📁 ${folder.bkmkNm}`,\r\n        children: kids.length ? kids : undefined,\r\n      };\r\n    };\r\n\r\n    return rootIds.map((rid) => make(rid)).filter(Boolean) as DataNode[];\r\n  },\r\n\r\n  // ====== 로더 ======\r\n  loadFavorites: async (userId, force = false) => {\r\n    console.log(\"loadFavorites ::::: \", userId, force);\r\n    const s = get();\r\n    if (!force && s.loadedFor === userId && Object.keys(s.nodes).length) return;\r\n\r\n    set({ loading: true, error: undefined });\r\n    try {\r\n      // 기대 응답 예시: { sub: rawTree[] }\r\n      const res = await callService(\"SCMBKMK00101\", { userId });\r\n      const raw: any[] = Array.isArray(res?.sub) ? res.sub : [];\r\n      const normalized = normalize(raw);\r\n\r\n      const treeNodes = toSimpleTreeFromMap(\r\n        normalized.nodes,\r\n        normalized.rootIds\r\n      );\r\n\r\n      set({\r\n        ...normalized,\r\n        treeNodes,\r\n        loadedFor: userId,\r\n        loading: false,\r\n      });\r\n    } catch (e: any) {\r\n      set({ loading: false, error: e?.message || \"즐겨찾기 로드 실패\" });\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  loadFavoritesIfNeeded: async (userId) => {\r\n    const s = get();\r\n    const notLoaded =\r\n      s.loadedFor !== userId || Object.keys(s.nodes).length === 0;\r\n    if (notLoaded) {\r\n      await get().loadFavorites(userId);\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 생성 ======\r\n  addNode: async (p) => {\r\n    const prev = snapshot(get());\r\n    const tmp = tempId();\r\n\r\n    // 1) 낙관적 반영\r\n    set((s) => {\r\n      const sort = p.sortOrdr ?? tailIndex(s, p.prntBkmkId);\r\n      const next: State = {\r\n        ...s,\r\n        nodes: {\r\n          ...s.nodes,\r\n          [tmp]:\r\n            p.type === \"F\"\r\n              ? ({\r\n                  bkmkId: tmp,\r\n                  type: \"F\",\r\n                  prntBkmkId: p.prntBkmkId || \"-\",\r\n                  sortOrdr: sort,\r\n                  bkmkNm: p.bkmkNm ?? \"새 폴더\",\r\n                  children: [],\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as FolderNode)\r\n              : ({\r\n                  bkmkId: tmp,\r\n                  type: \"M\",\r\n                  prntBkmkId: p.prntBkmkId,\r\n                  sortOrdr: sort,\r\n                  menuId: p.menuId ?? \"\",\r\n                  menuNm: p.menuNm,\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as ItemNode),\r\n        },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      attach(next, tmp, p.prntBkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      // 2) 서버 호출\r\n      // 백엔드는 통합 IUD가 아닐 수 있으므로, 호환 분기 적용\r\n      let real: string = tmp;\r\n      const sortForServer = tailIndex(get(), p.prntBkmkId);\r\n      const res = await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"I\",\r\n        type: p.type,\r\n        sysCd: p.sysCd,\r\n        userId: p.userId,\r\n        bkmkId: tmp, // 서버 새 ID 반환 시 매칭용\r\n        bkmkNm: p.bkmkNm,\r\n        prntBkmkId: p.prntBkmkId,\r\n        menuId: p.menuId,\r\n        sortOrdr: sortForServer,\r\n        chngId: getUserId(),\r\n      });\r\n      real = String(res?.bkmkId ?? res?.itemId ?? tmp);\r\n\r\n      // 3) tmp → real 스왑\r\n      set((s) => {\r\n        const swapped = idSwapImmutable(s, tmp, real);\r\n        return {\r\n          ...swapped,\r\n          treeNodes: toSimpleTreeFromMap(swapped.nodes, swapped.rootIds),\r\n        };\r\n      });\r\n      return real;\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 이동 ======\r\n  moveNode: async ({ bkmkId, newPrntBkmkId, sortOrdr, userId }) => {\r\n    const prev = get(); // 함수 포함 스냅샷(rollback 용으로 set(prev) 사용)\r\n\r\n    const nodes = structuredClone(prev.nodes);\r\n    const rootIds = [...prev.rootIds];\r\n\r\n    const node = nodes[bkmkId];\r\n    if (!node) return;\r\n\r\n    // 부모는 반드시 폴더만 허용\r\n    if (newPrntBkmkId !== \"-\") {\r\n      const parent = nodes[newPrntBkmkId];\r\n      if (!parent || parent.type !== \"F\")\r\n        throw new Error(\"부모는 폴더만 가능합니다.\");\r\n    }\r\n\r\n    const oldParentId = node.prntBkmkId ?? \"-\";\r\n\r\n    const removeFrom =\r\n      oldParentId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[oldParentId] as FolderNode).children ||= []);\r\n    {\r\n      const idx = removeFrom.indexOf(bkmkId);\r\n      if (idx >= 0) removeFrom.splice(idx, 1);\r\n    }\r\n\r\n    const insertTo =\r\n      newPrntBkmkId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[newPrntBkmkId] as FolderNode).children ||= []);\r\n    insertTo.splice(\r\n      Math.max(0, Math.min(sortOrdr, insertTo.length)),\r\n      0,\r\n      bkmkId\r\n    );\r\n\r\n    node.prntBkmkId = newPrntBkmkId as Id;\r\n    set({ nodes, rootIds });\r\n    _resequence(nodes, rootIds, newPrntBkmkId);\r\n    _resequence(nodes, rootIds, oldParentId);\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00104\", {\r\n        // 백엔드 명칭 호환\r\n        bkmkId,\r\n        prntBkmkId: newPrntBkmkId,\r\n        sortOrdr,\r\n        chngId: userId,\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 삭제 ======\r\n  removeNode: async (bkmkId) => {\r\n    const prev = snapshot(get());\r\n\r\n    set((s) => {\r\n      if (!s.nodes[bkmkId]) return s as State;\r\n      const next: State = {\r\n        ...s,\r\n        nodes: { ...s.nodes },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      removeRecursively(next, bkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00103\", { bkmkId });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 수정 ======\r\n  editNode: async ({ bkmkId, userId, bkmkNm, prntBkmkId, sortOrdr }) => {\r\n    const prev = snapshot(get());\r\n\r\n    // 폴더명 변경만 프런트 즉시 반영(옵션)\r\n    set((s) => {\r\n      const next = { ...s, nodes: { ...s.nodes } } as State;\r\n      const target = next.nodes[bkmkId] as FavNode | undefined;\r\n      if (target?.type === \"F\" && typeof bkmkNm === \"string\") {\r\n        next.nodes[bkmkId] = {\r\n          ...(target as FolderNode),\r\n          bkmkNm,\r\n        } as FolderNode;\r\n      }\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"U\",\r\n        userId,\r\n        bkmkId,\r\n        bkmkNm,\r\n        prntBkmkId,\r\n        sortOrdr,\r\n        chngId: getUserId(),\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 호환용 래퍼 ======\r\n  addFolder: async (bkmkNm, prntBkmkId, sysCd, userId) => {\r\n    return await get().addNode({\r\n      type: \"F\",\r\n      bkmkNm,\r\n      prntBkmkId,\r\n      sysCd,\r\n      userId,\r\n    });\r\n  },\r\n\r\n  addMenuToFolder: async (folderBkmkId, menu) => {\r\n    // 전역 중복 방지\r\n    const dup = findItemByMenuId(get().nodes, menu.menuId);\r\n    if (dup) return \"이미 북마크에 저장된 메뉴입니다.\";\r\n    return await get().addNode({\r\n      type: \"M\",\r\n      prntBkmkId: folderBkmkId,\r\n      sysCd: \"KH\",\r\n      userId: getUserId(),\r\n      menuId: menu.menuId,\r\n      menuNm: menu.menuNm,\r\n    });\r\n  },\r\n\r\n  toggleMenuFavorite: async (userId, menu) => {\r\n    const s = get();\r\n    const exists = Object.values(s.nodes).find(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menu.menuId\r\n    );\r\n    if (exists) {\r\n      await get().removeNode(exists.bkmkId);\r\n      return;\r\n    }\r\n\r\n    let folderId = pickDefaultFolderId(s);\r\n    if (!folderId) {\r\n      await get().loadFavorites(userId, true);\r\n      folderId = pickDefaultFolderId(get());\r\n    }\r\n    if (folderId) {\r\n      await get().addNode({\r\n        type: \"M\",\r\n        prntBkmkId: folderId,\r\n        sysCd: \"KH\",\r\n        userId: getUserId(),\r\n        menuId: menu.menuId,\r\n        menuNm: menu.menuNm,\r\n      });\r\n    }\r\n  },\r\n\r\n  removeMenuByMenuId: async (menuId) => {\r\n    const s = get();\r\n    const bkmkId = findItemByMenuId(s.nodes, menuId);\r\n    if (bkmkId) await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeMenu: async (bkmkId) => {\r\n    await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeFolder: async (folderBkmkId) => {\r\n    await get().removeNode(folderBkmkId);\r\n  },\r\n\r\n  editFolder: async (folderBkmkId, userId, newBkmkNm, prntBkmkId, sortOrdr) => {\r\n    await get().editNode({\r\n      bkmkId: folderBkmkId,\r\n      userId,\r\n      bkmkNm: newBkmkNm,\r\n      prntBkmkId,\r\n      sortOrdr,\r\n    });\r\n  },\r\n\r\n  /** Ant Tree 데이터 변환 (검색 포함) */\r\n  convertToAntTreeData: (nodesMap, rootIds, q, onlyFolder = false) => {\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const build = (id: string): any | null => {\r\n      const n = nodesMap[id];\r\n      if (!n) return null;\r\n\r\n      if (onlyFolder && n.type !== \"F\") return null;\r\n\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const children = (f.children || [])\r\n          .map((cid) => build(cid))\r\n          .filter(Boolean);\r\n        const visible = match(f.bkmkNm) || children.length > 0;\r\n        if (!visible) return null;\r\n        return {\r\n          key: f.bkmkId,\r\n          type: \"F\",\r\n          title: `📁 ${f.bkmkNm}`,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          sortOrdr: f.sortOrdr,\r\n          fullPath: f.fullPath,\r\n          children: children.length ? children : undefined,\r\n        };\r\n      } else {\r\n        const i = n as ItemNode;\r\n        const label = i.menuNm ? `${i.menuNm} (${i.menuId})` : i.menuId;\r\n        const visible = match(label);\r\n        if (!visible) return null;\r\n        return {\r\n          key: i.bkmkId,\r\n          type: \"M\",\r\n          title: `📄 ${label}`,\r\n          prntBkmkId: i.prntBkmkId,\r\n          sortOrdr: i.sortOrdr,\r\n          fullPath: i.fullPath,\r\n          isLeaf: true,\r\n        };\r\n      }\r\n    };\r\n\r\n    return rootIds.map(build).filter(Boolean);\r\n  },\r\n});\r\n\r\nexport const useFavoriteStore = create<State>(creator);\r\n\r\n// ===================================================================\r\n// Helpers\r\n// ===================================================================\r\n\r\nfunction normalize(raw: any[]): Normalized {\r\n  const nodes: Record<Id, FavNode> = {};\r\n  const roots: Id[] = [];\r\n\r\n  const walk = (arr: any[]) => {\r\n    arr.forEach((r: any) => {\r\n      // 서버 raw 필드: TYPE, BKMK_ID, PRNT_BKMK_ID, SORT_ORDR, BKMK_NM, MENU_ID, FULL_PATH?\r\n      const base: BkmkBase = {\r\n        type: r.type,\r\n        bkmkId: r.bkmkId ?? r.BKMK_ID ?? r.id,\r\n        prntBkmkId: r.prntBkmkId ?? r.PRNT_BKMK_ID ?? \"-\",\r\n        sortOrdr: Number(r.sortOrdr ?? r.SORT_ORDR ?? 0),\r\n        sysCd: r.sysCd ?? r.SYS_CD,\r\n        userId: r.userId ?? r.USER_ID,\r\n        fullPath: r.fullPath ?? r.FULL_PATH,\r\n      };\r\n\r\n      if (r.type === \"F\") {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          bkmkNm: r.bkmkNm ?? r.BKMK_NM ?? r.name ?? base.bkmkId,\r\n          children: [],\r\n        } as FolderNode;\r\n\r\n        const children = Array.isArray(r.children) ? r.children : [];\r\n        walk(children);\r\n      } else {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          menuId: r.menuId ?? r.MENU_ID ?? \"\",\r\n          menuNm: r.menuNm ?? r.MENU_NM,\r\n        } as ItemNode;\r\n      }\r\n    });\r\n  };\r\n\r\n  walk(raw);\r\n\r\n  // children / rootIds 구성\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.prntBkmkId && n.prntBkmkId !== \"-\") {\r\n      const p = nodes[n.prntBkmkId] as FolderNode;\r\n      if (p?.type === \"F\") p.children.push(n.bkmkId);\r\n    } else if (n.type === \"F\") {\r\n      roots.push(n.bkmkId);\r\n    }\r\n  });\r\n\r\n  // 정렬 인덱스 보정(안전)\r\n  roots.sort((a, b) => (nodes[a].sortOrdr ?? 0) - (nodes[b].sortOrdr ?? 0));\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.type === \"F\") {\r\n      const f = n as FolderNode;\r\n      f.children.sort(\r\n        (A, B) => (nodes[A].sortOrdr ?? 0) - (nodes[B].sortOrdr ?? 0)\r\n      );\r\n    }\r\n  });\r\n\r\n  return { nodes, rootIds: roots };\r\n}\r\n\r\nfunction snapshot(s: State): State {\r\n  return {\r\n    ...s,\r\n    nodes: JSON.parse(JSON.stringify(s.nodes)),\r\n    rootIds: s.rootIds.slice(),\r\n  };\r\n}\r\n\r\nfunction tempId(): Id {\r\n  return `tmp_${Math.random().toString(36).slice(2, 10)}`;\r\n}\r\n\r\nfunction tailIndex(s: Pick<State, \"nodes\" | \"rootIds\">, parentId: Id | \"-\") {\r\n  if (!parentId || parentId === \"-\") return s.rootIds.length;\r\n  const p = s.nodes[parentId] as FolderNode | undefined;\r\n  return p ? p.children.length : 0;\r\n}\r\n\r\nfunction attach(s: State, bkmkId: Id, parentId: Id | \"-\") {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n\r\n  if (parentId && parentId !== \"-\") {\r\n    const p = s.nodes[parentId] as FolderNode | undefined;\r\n    if (!p || p.type !== \"F\") return;\r\n    n.prntBkmkId = parentId;\r\n    p.children = [...p.children, bkmkId];\r\n  } else {\r\n    n.prntBkmkId = \"-\";\r\n    s.rootIds = [...s.rootIds, bkmkId];\r\n  }\r\n}\r\n\r\nfunction detach(s: State, bkmkId: Id) {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n  const pid = n.prntBkmkId;\r\n\r\n  if (pid && pid !== \"-\") {\r\n    const p = s.nodes[pid] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      p.children = p.children.filter((c) => c !== bkmkId);\r\n    }\r\n  } else {\r\n    s.rootIds = s.rootIds.filter((r) => r !== bkmkId);\r\n  }\r\n}\r\n\r\nfunction removeRecursively(s: State, bkmkId: Id) {\r\n  const node = s.nodes[bkmkId];\r\n  if (!node) return;\r\n  if (node.type === \"F\") {\r\n    const children = (node as FolderNode).children.slice();\r\n    children.forEach((cid) => removeRecursively(s, cid));\r\n  }\r\n  detach(s, bkmkId);\r\n  const { [bkmkId]: _omit, ...rest } = s.nodes as Record<string, FavNode>;\r\n  s.nodes = rest;\r\n}\r\n\r\n/** 임시ID → 실제ID 스왑 (불변성 유지) */\r\nfunction idSwapImmutable(s: State, tmp: Id, real: Id): State {\r\n  if (tmp === real) return s;\r\n  const node = s.nodes[tmp];\r\n  if (!node) return s;\r\n\r\n  const newNode: FavNode = JSON.parse(JSON.stringify(node));\r\n  newNode.bkmkId = real;\r\n\r\n  const newNodes: Record<Id, FavNode> = { ...s.nodes, [real]: newNode };\r\n  delete newNodes[tmp];\r\n\r\n  let newRootIds = s.rootIds;\r\n  if (newNode.prntBkmkId && newNode.prntBkmkId !== \"-\") {\r\n    const p = newNodes[newNode.prntBkmkId] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      newNodes[newNode.prntBkmkId] = {\r\n        ...p,\r\n        children: p.children.map((c) => (c === tmp ? real : c)),\r\n      } as FolderNode;\r\n    }\r\n  } else {\r\n    newRootIds = s.rootIds.map((r) => (r === tmp ? real : r));\r\n  }\r\n\r\n  return { ...s, nodes: newNodes, rootIds: newRootIds };\r\n}\r\n\r\nfunction pickDefaultFolderId(s: Pick<State, \"nodes\" | \"rootIds\">): Id | null {\r\n  return s.rootIds.find((id) => s.nodes[id]?.type === \"F\") ?? null;\r\n}\r\n\r\nfunction toSimpleTreeFromMap(nodes: Record<Id, FavNode>, rootIds: Id[]) {\r\n  const childrenByParent: Record<string, string[]> = {};\r\n  Object.values(nodes).forEach((n) => {\r\n    const id = n.bkmkId;\r\n    const pid = n.prntBkmkId;\r\n    if (!id || !pid || pid === \"-\" || pid === id) return;\r\n    (childrenByParent[pid] ??= []).push(id);\r\n  });\r\n\r\n  const visiting = new Set<string>();\r\n\r\n  const build = (id: Id): any => {\r\n    if (visiting.has(id)) return null;\r\n    const n = nodes[id];\r\n    if (!n) return null;\r\n\r\n    visiting.add(id);\r\n    try {\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const childIds = childrenByParent[id] ?? [];\r\n        return {\r\n          type: \"F\",\r\n          bkmkId: id,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          children: childIds.map(build).filter(Boolean),\r\n        };\r\n      }\r\n      const i = n as ItemNode;\r\n\r\n      return {\r\n        type: \"M\",\r\n        bkmkId: id,\r\n        bkmkNm: i.menuNm,\r\n        menuId: i.menuId,\r\n        menuNm: i.menuNm,\r\n        prntBkmkId: i.prntBkmkId,\r\n      };\r\n    } finally {\r\n      visiting.delete(id);\r\n    }\r\n  };\r\n\r\n  const rootMenuIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"M\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootFolderIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"F\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootKeys = Array.from(\r\n    new Set([...rootIds, ...rootMenuIds, ...rootFolderIds])\r\n  );\r\n  return rootKeys.map(build).filter(Boolean);\r\n}\r\n\r\nfunction findItemByMenuId(\r\n  nodes: Record<Id, FavNode>,\r\n  menuId: string\r\n): Id | null {\r\n  for (const n of Object.values(nodes)) {\r\n    if (n.type === \"M\" && (n as ItemNode).menuId === menuId) return n.bkmkId;\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction _resequence(\r\n  nodes: Record<Id, FavNode>,\r\n  rootIds: Id[],\r\n  parentId: Id | \"-\"\r\n) {\r\n  const siblings: Id[] =\r\n    !parentId || parentId === \"-\"\r\n      ? rootIds\r\n      : (nodes[parentId] as FolderNode).children || [];\r\n  siblings.forEach((sid, idx) => {\r\n    const n = nodes[sid];\r\n    if (!n) return;\r\n    n.sortOrdr = idx;\r\n  });\r\n}\r\n"],"names":["creator","set","get","menuId","n","id","findItemByMenuId","nodeId","node","q","nodes","rootIds","match","make","folder","kids","cid","c","f","rid","userId","force","s","res","callService","raw","normalized","normalize","treeNodes","toSimpleTreeFromMap","e","p","prev","snapshot","tmp","tempId","sort","tailIndex","next","attach","real","sortForServer","getUserId","swapped","idSwapImmutable","bkmkId","newPrntBkmkId","sortOrdr","parent","oldParentId","removeFrom","idx","insertTo","_resequence","removeRecursively","bkmkNm","prntBkmkId","target","sysCd","folderBkmkId","menu","exists","folderId","pickDefaultFolderId","newBkmkNm","nodesMap","onlyFolder","build","children","i","label","useFavoriteStore","create","roots","walk","arr","r","base","a","b","A","B","parentId","detach","pid","_omit","rest","newNode","newNodes","newRootIds","childrenByParent","visiting","childIds","rootMenuIds","rootFolderIds","sid"],"mappings":"6EAkIMA,EAA+B,CAACC,EAAKC,KAAS,CAClD,MAAO,CAAA,EACP,QAAS,CAAA,EACT,UAAW,OACX,QAAS,GACT,MAAO,OACP,UAAW,CAAA,EAGX,iBAAmBC,GACjB,OAAO,OAAOD,EAAA,EAAM,KAAK,EAAE,KACxBE,GAAMA,EAAE,OAAS,KAAQA,EAAe,SAAWD,CAAA,EAExD,sBAAwBA,GAAW,CACjC,MAAME,EAAKC,EAAiBJ,EAAA,EAAM,MAAOC,CAAM,EAC/C,OAAOE,EAAKH,IAAM,MAAMG,CAAE,GAAG,YAAc,IAAM,GACnD,EAEA,gBAAkBF,GAAW,CAC3B,MAAMI,EAASD,EAAiBJ,EAAA,EAAM,MAAOC,CAAM,EACnD,GAAI,CAACI,EAAQ,OAAO,KACpB,MAAMC,EAAON,IAAM,MAAMK,CAAM,EAC/B,OAAOC,GAAM,OAAS,IAAOA,EAAoB,IACnD,EAEA,cAAgBC,GAAM,CACpB,KAAM,CAAE,MAAAC,EAAO,QAAAC,CAAA,EAAYT,EAAA,EACrBU,EAAS,GACbH,EAAI,EAAE,YAAA,EAAc,SAASA,EAAE,YAAA,CAAa,EAAI,GAE5CI,EAAQR,GAA4B,CACxC,MAAMD,EAAIM,EAAML,CAAE,EAClB,GAAI,CAACD,GAAKA,EAAE,OAAS,IAAK,OAAO,KACjC,MAAMU,EAASV,EAETW,GAAQD,EAAO,UAAY,CAAA,GAC9B,IAAKE,GAAQN,EAAMM,CAAG,CAAC,EACvB,OAAQC,GAAuB,CAAC,CAACA,GAAKA,EAAE,OAAS,GAAG,EACpD,IAAKC,GAAML,EAAKK,EAAE,MAAM,CAAC,EACzB,OAAO,OAAO,EAGjB,OADgBN,EAAME,EAAO,MAAM,GAAKC,EAAK,OAAS,EAG/C,CACL,IAAKD,EAAO,OACZ,MAAO,MAAMA,EAAO,MAAM,GAC1B,SAAUC,EAAK,OAASA,EAAO,MAAA,EALZ,IAOvB,EAEA,OAAOJ,EAAQ,IAAKQ,GAAQN,EAAKM,CAAG,CAAC,EAAE,OAAO,OAAO,CACvD,EAGA,cAAe,MAAOC,EAAQC,EAAQ,KAAU,CAC9C,QAAQ,IAAI,uBAAwBD,EAAQC,CAAK,EACjD,MAAMC,EAAIpB,EAAA,EACV,GAAI,GAACmB,GAASC,EAAE,YAAcF,GAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,QAE7D,CAAArB,EAAI,CAAE,QAAS,GAAM,MAAO,OAAW,EACvC,GAAI,CAEF,MAAMsB,EAAM,MAAMC,EAAAA,YAAY,eAAgB,CAAE,OAAAJ,EAAQ,EAClDK,EAAa,MAAM,QAAQF,GAAK,GAAG,EAAIA,EAAI,IAAM,CAAA,EACjDG,EAAaC,EAAUF,CAAG,EAE1BG,EAAYC,EAChBH,EAAW,MACXA,EAAW,OAAA,EAGbzB,EAAI,CACF,GAAGyB,EACH,UAAAE,EACA,UAAWR,EACX,QAAS,EAAA,CACV,CACH,OAASU,EAAQ,CACf,MAAA7B,EAAI,CAAE,QAAS,GAAO,MAAO6B,GAAG,SAAW,aAAc,EACnDA,CACR,EACF,EAEA,sBAAuB,MAAOV,GAAW,CACvC,MAAME,EAAIpB,EAAA,GAERoB,EAAE,YAAcF,GAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,SAAW,IAE1D,MAAMpB,EAAA,EAAM,cAAckB,CAAM,CAEpC,EAGA,QAAS,MAAOW,GAAM,CACpB,MAAMC,EAAOC,EAAS/B,GAAK,EACrBgC,EAAMC,EAAA,EAGZlC,EAAKqB,GAAM,CACT,MAAMc,EAAOL,EAAE,UAAYM,EAAUf,EAAGS,EAAE,UAAU,EAC9CO,EAAc,CAClB,GAAGhB,EACH,MAAO,CACL,GAAGA,EAAE,MACL,CAACY,CAAG,EACFH,EAAE,OAAS,IACN,CACC,OAAQG,EACR,KAAM,IACN,WAAYH,EAAE,YAAc,IAC5B,SAAUK,EACV,OAAQL,EAAE,QAAU,OACpB,SAAU,CAAA,EACV,MAAOA,EAAE,MACT,OAAQA,EAAE,MAAA,EAEX,CACC,OAAQG,EACR,KAAM,IACN,WAAYH,EAAE,WACd,SAAUK,EACV,OAAQL,EAAE,QAAU,GACpB,OAAQA,EAAE,OACV,MAAOA,EAAE,MACT,OAAQA,EAAE,MAAA,CACZ,EAER,QAAST,EAAE,QAAQ,MAAA,EACnB,UAAWA,EAAE,SAAA,EAEf,OAAAiB,EAAOD,EAAMJ,EAAKH,EAAE,UAAU,EAC9BO,EAAK,UAAYT,EAAoBS,EAAK,MAAOA,EAAK,OAAO,EACtDA,CACT,CAAC,EAED,GAAI,CAGF,IAAIE,EAAeN,EACnB,MAAMO,EAAgBJ,EAAUnC,EAAA,EAAO6B,EAAE,UAAU,EAC7CR,EAAM,MAAMC,EAAAA,YAAY,eAAgB,CAC5C,QAAS,IACT,KAAMO,EAAE,KACR,MAAOA,EAAE,MACT,OAAQA,EAAE,OACV,OAAQG,EACR,OAAQH,EAAE,OACV,WAAYA,EAAE,WACd,OAAQA,EAAE,OACV,SAAUU,EACV,OAAQC,EAAAA,UAAA,CAAU,CACnB,EACD,OAAAF,EAAO,OAAOjB,GAAK,QAAUA,GAAK,QAAUW,CAAG,EAG/CjC,EAAKqB,GAAM,CACT,MAAMqB,EAAUC,EAAgBtB,EAAGY,EAAKM,CAAI,EAC5C,MAAO,CACL,GAAGG,EACH,UAAWd,EAAoBc,EAAQ,MAAOA,EAAQ,OAAO,CAAA,CAEjE,CAAC,EACMH,CACT,OAASV,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,SAAU,MAAO,CAAE,OAAAe,EAAQ,cAAAC,EAAe,SAAAC,EAAU,OAAA3B,KAAa,CAC/D,MAAMY,EAAO9B,EAAA,EAEPQ,EAAQ,gBAAgBsB,EAAK,KAAK,EAClCrB,EAAU,CAAC,GAAGqB,EAAK,OAAO,EAE1BxB,EAAOE,EAAMmC,CAAM,EACzB,GAAI,CAACrC,EAAM,OAGX,GAAIsC,IAAkB,IAAK,CACzB,MAAME,EAAStC,EAAMoC,CAAa,EAClC,GAAI,CAACE,GAAUA,EAAO,OAAS,IAC7B,MAAM,IAAI,MAAM,gBAAgB,CACpC,CAEA,MAAMC,EAAczC,EAAK,YAAc,IAEjC0C,EACJD,IAAgB,IACZtC,EACED,EAAMuC,CAAW,EAAiB,WAAa,CAAA,EACvD,CACE,MAAME,EAAMD,EAAW,QAAQL,CAAM,EACjCM,GAAO,GAAGD,EAAW,OAAOC,EAAK,CAAC,CACxC,CAEA,MAAMC,EACJN,IAAkB,IACdnC,EACED,EAAMoC,CAAa,EAAiB,WAAa,CAAA,EACzDM,EAAS,OACP,KAAK,IAAI,EAAG,KAAK,IAAIL,EAAUK,EAAS,MAAM,CAAC,EAC/C,EACAP,CAAA,EAGFrC,EAAK,WAAasC,EAClB7C,EAAI,CAAE,MAAAS,EAAO,QAAAC,EAAS,EACtB0C,EAAY3C,EAAOC,EAASmC,CAAa,EACzCO,EAAY3C,EAAOC,EAASsC,CAAW,EAEvC,GAAI,CACF,MAAMzB,EAAAA,YAAY,eAAgB,CAEhC,OAAAqB,EACA,WAAYC,EACZ,SAAAC,EACA,OAAQ3B,CAAA,CACT,CACH,OAASU,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,WAAY,MAAOe,GAAW,CAC5B,MAAMb,EAAOC,EAAS/B,GAAK,EAE3BD,EAAKqB,GAAM,CACT,GAAI,CAACA,EAAE,MAAMuB,CAAM,EAAG,OAAOvB,EAC7B,MAAMgB,EAAc,CAClB,GAAGhB,EACH,MAAO,CAAE,GAAGA,EAAE,KAAA,EACd,QAASA,EAAE,QAAQ,MAAA,EACnB,UAAWA,EAAE,SAAA,EAEf,OAAAgC,EAAkBhB,EAAMO,CAAM,EAC9BP,EAAK,UAAYT,EAAoBS,EAAK,MAAOA,EAAK,OAAO,EACtDA,CACT,CAAC,EAED,GAAI,CACF,MAAMd,cAAY,eAAgB,CAAE,OAAAqB,EAAQ,CAC9C,OAASf,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,SAAU,MAAO,CAAE,OAAAe,EAAQ,OAAAzB,EAAQ,OAAAmC,EAAQ,WAAAC,EAAY,SAAAT,KAAe,CACpE,MAAMf,EAAOC,EAAS/B,GAAK,EAG3BD,EAAKqB,GAAM,CACT,MAAMgB,EAAO,CAAE,GAAGhB,EAAG,MAAO,CAAE,GAAGA,EAAE,MAAM,EACnCmC,EAASnB,EAAK,MAAMO,CAAM,EAChC,OAAIY,GAAQ,OAAS,KAAO,OAAOF,GAAW,WAC5CjB,EAAK,MAAMO,CAAM,EAAI,CACnB,GAAIY,EACJ,OAAAF,CAAA,GAGGjB,CACT,CAAC,EAED,GAAI,CACF,MAAMd,EAAAA,YAAY,eAAgB,CAChC,QAAS,IACT,OAAAJ,EACA,OAAAyB,EACA,OAAAU,EACA,WAAAC,EACA,SAAAT,EACA,OAAQL,EAAAA,UAAA,CAAU,CACnB,CACH,OAASZ,EAAG,CACV,MAAA7B,EAAI+B,CAAI,EACFF,CACR,CACF,EAGA,UAAW,MAAOyB,EAAQC,EAAYE,EAAOtC,IACpC,MAAMlB,EAAA,EAAM,QAAQ,CACzB,KAAM,IACN,OAAAqD,EACA,WAAAC,EACA,MAAAE,EACA,OAAAtC,CAAA,CACD,EAGH,gBAAiB,MAAOuC,EAAcC,IAExBtD,EAAiBJ,EAAA,EAAM,MAAO0D,EAAK,MAAM,EACrC,qBACT,MAAM1D,EAAA,EAAM,QAAQ,CACzB,KAAM,IACN,WAAYyD,EACZ,MAAO,KACP,OAAQjB,EAAAA,UAAA,EACR,OAAQkB,EAAK,OACb,OAAQA,EAAK,MAAA,CACd,EAGH,mBAAoB,MAAOxC,EAAQwC,IAAS,CAC1C,MAAMtC,EAAIpB,EAAA,EACJ2D,EAAS,OAAO,OAAOvC,EAAE,KAAK,EAAE,KACnClB,GAAMA,EAAE,OAAS,KAAQA,EAAe,SAAWwD,EAAK,MAAA,EAE3D,GAAIC,EAAQ,CACV,MAAM3D,EAAA,EAAM,WAAW2D,EAAO,MAAM,EACpC,MACF,CAEA,IAAIC,EAAWC,EAAoBzC,CAAC,EAC/BwC,IACH,MAAM5D,EAAA,EAAM,cAAckB,EAAQ,EAAI,EACtC0C,EAAWC,EAAoB7D,GAAK,GAElC4D,GACF,MAAM5D,EAAA,EAAM,QAAQ,CAClB,KAAM,IACN,WAAY4D,EACZ,MAAO,KACP,OAAQpB,EAAAA,UAAA,EACR,OAAQkB,EAAK,OACb,OAAQA,EAAK,MAAA,CACd,CAEL,EAEA,mBAAoB,MAAOzD,GAAW,CACpC,MAAMmB,EAAIpB,EAAA,EACJ2C,EAASvC,EAAiBgB,EAAE,MAAOnB,CAAM,EAC3C0C,GAAQ,MAAM3C,IAAM,WAAW2C,CAAM,CAC3C,EAEA,WAAY,MAAOA,GAAW,CAC5B,MAAM3C,EAAA,EAAM,WAAW2C,CAAM,CAC/B,EAEA,aAAc,MAAOc,GAAiB,CACpC,MAAMzD,EAAA,EAAM,WAAWyD,CAAY,CACrC,EAEA,WAAY,MAAOA,EAAcvC,EAAQ4C,EAAWR,EAAYT,IAAa,CAC3E,MAAM7C,EAAA,EAAM,SAAS,CACnB,OAAQyD,EACR,OAAAvC,EACA,OAAQ4C,EACR,WAAAR,EACA,SAAAT,CAAA,CACD,CACH,EAGA,qBAAsB,CAACkB,EAAUtD,EAASF,EAAGyD,EAAa,KAAU,CAClE,MAAMtD,EAASU,GACbb,EAAIa,EAAE,YAAA,EAAc,SAASb,EAAE,YAAA,CAAa,EAAI,GAE5C0D,EAAS9D,GAA2B,CACxC,MAAMD,EAAI6D,EAAS5D,CAAE,EAGrB,GAFI,CAACD,GAED8D,GAAc9D,EAAE,OAAS,IAAK,OAAO,KAEzC,GAAIA,EAAE,OAAS,IAAK,CAClB,MAAMc,EAAId,EACJgE,GAAYlD,EAAE,UAAY,CAAA,GAC7B,IAAKF,GAAQmD,EAAMnD,CAAG,CAAC,EACvB,OAAO,OAAO,EAEjB,OADgBJ,EAAMM,EAAE,MAAM,GAAKkD,EAAS,OAAS,EAE9C,CACL,IAAKlD,EAAE,OACP,KAAM,IACN,MAAO,MAAMA,EAAE,MAAM,GACrB,OAAQA,EAAE,OACV,WAAYA,EAAE,WACd,SAAUA,EAAE,SACZ,SAAUA,EAAE,SACZ,SAAUkD,EAAS,OAASA,EAAW,MAAA,EATpB,IAWvB,KAAO,CACL,MAAMC,EAAIjE,EACJkE,EAAQD,EAAE,OAAS,GAAGA,EAAE,MAAM,KAAKA,EAAE,MAAM,IAAMA,EAAE,OAEzD,OADgBzD,EAAM0D,CAAK,EAEpB,CACL,IAAKD,EAAE,OACP,KAAM,IACN,MAAO,MAAMC,CAAK,GAClB,WAAYD,EAAE,WACd,SAAUA,EAAE,SACZ,SAAUA,EAAE,SACZ,OAAQ,EAAA,EARW,IAUvB,CACF,EAEA,OAAO1D,EAAQ,IAAIwD,CAAK,EAAE,OAAO,OAAO,CAC1C,CACF,GAEaI,EAAmBC,EAAAA,OAAcxE,CAAO,EAMrD,SAAS2B,EAAUF,EAAwB,CACzC,MAAMf,EAA6B,CAAA,EAC7B+D,EAAc,CAAA,EAEdC,EAAQC,GAAe,CAC3BA,EAAI,QAASC,GAAW,CAEtB,MAAMC,EAAiB,CACrB,KAAMD,EAAE,KACR,OAAQA,EAAE,QAAUA,EAAE,SAAWA,EAAE,GACnC,WAAYA,EAAE,YAAcA,EAAE,cAAgB,IAC9C,SAAU,OAAOA,EAAE,UAAYA,EAAE,WAAa,CAAC,EAC/C,MAAOA,EAAE,OAASA,EAAE,OACpB,OAAQA,EAAE,QAAUA,EAAE,QACtB,SAAUA,EAAE,UAAYA,EAAE,SAAA,EAG5B,GAAIA,EAAE,OAAS,IAAK,CAClBlE,EAAMmE,EAAK,MAAM,EAAI,CACnB,GAAGA,EACH,OAAQD,EAAE,QAAUA,EAAE,SAAWA,EAAE,MAAQC,EAAK,OAChD,SAAU,CAAA,CAAC,EAGb,MAAMT,EAAW,MAAM,QAAQQ,EAAE,QAAQ,EAAIA,EAAE,SAAW,CAAA,EAC1DF,EAAKN,CAAQ,CACf,MACE1D,EAAMmE,EAAK,MAAM,EAAI,CACnB,GAAGA,EACH,OAAQD,EAAE,QAAUA,EAAE,SAAW,GACjC,OAAQA,EAAE,QAAUA,EAAE,OAAA,CAG5B,CAAC,CACH,EAEA,OAAAF,EAAKjD,CAAG,EAGR,OAAO,OAAOf,CAAK,EAAE,QAASN,GAAM,CAClC,GAAIA,EAAE,YAAcA,EAAE,aAAe,IAAK,CACxC,MAAM2B,EAAIrB,EAAMN,EAAE,UAAU,EACxB2B,GAAG,OAAS,OAAO,SAAS,KAAK3B,EAAE,MAAM,CAC/C,MAAWA,EAAE,OAAS,KACpBqE,EAAM,KAAKrE,EAAE,MAAM,CAEvB,CAAC,EAGDqE,EAAM,KAAK,CAACK,EAAGC,KAAOrE,EAAMoE,CAAC,EAAE,UAAY,IAAMpE,EAAMqE,CAAC,EAAE,UAAY,EAAE,EACxE,OAAO,OAAOrE,CAAK,EAAE,QAASN,GAAM,CAC9BA,EAAE,OAAS,KACHA,EACR,SAAS,KACT,CAAC4E,EAAGC,KAAOvE,EAAMsE,CAAC,EAAE,UAAY,IAAMtE,EAAMuE,CAAC,EAAE,UAAY,EAAA,CAGjE,CAAC,EAEM,CAAE,MAAAvE,EAAO,QAAS+D,CAAA,CAC3B,CAEA,SAASxC,EAASX,EAAiB,CACjC,MAAO,CACL,GAAGA,EACH,MAAO,KAAK,MAAM,KAAK,UAAUA,EAAE,KAAK,CAAC,EACzC,QAASA,EAAE,QAAQ,MAAA,CAAM,CAE7B,CAEA,SAASa,GAAa,CACpB,MAAO,OAAO,KAAK,SAAS,SAAS,EAAE,EAAE,MAAM,EAAG,EAAE,CAAC,EACvD,CAEA,SAASE,EAAUf,EAAqC4D,EAAoB,CAC1E,GAAI,CAACA,GAAYA,IAAa,IAAK,OAAO5D,EAAE,QAAQ,OACpD,MAAMS,EAAIT,EAAE,MAAM4D,CAAQ,EAC1B,OAAOnD,EAAIA,EAAE,SAAS,OAAS,CACjC,CAEA,SAASQ,EAAOjB,EAAUuB,EAAYqC,EAAoB,CACxD,MAAM9E,EAAIkB,EAAE,MAAMuB,CAAM,EACxB,GAAKzC,EAEL,GAAI8E,GAAYA,IAAa,IAAK,CAChC,MAAMnD,EAAIT,EAAE,MAAM4D,CAAQ,EAC1B,GAAI,CAACnD,GAAKA,EAAE,OAAS,IAAK,OAC1B3B,EAAE,WAAa8E,EACfnD,EAAE,SAAW,CAAC,GAAGA,EAAE,SAAUc,CAAM,CACrC,MACEzC,EAAE,WAAa,IACfkB,EAAE,QAAU,CAAC,GAAGA,EAAE,QAASuB,CAAM,CAErC,CAEA,SAASsC,EAAO7D,EAAUuB,EAAY,CACpC,MAAMzC,EAAIkB,EAAE,MAAMuB,CAAM,EACxB,GAAI,CAACzC,EAAG,OACR,MAAMgF,EAAMhF,EAAE,WAEd,GAAIgF,GAAOA,IAAQ,IAAK,CACtB,MAAMrD,EAAIT,EAAE,MAAM8D,CAAG,EACjBrD,GAAG,OAAS,MACdA,EAAE,SAAWA,EAAE,SAAS,OAAQd,GAAMA,IAAM4B,CAAM,EAEtD,MACEvB,EAAE,QAAUA,EAAE,QAAQ,OAAQsD,GAAMA,IAAM/B,CAAM,CAEpD,CAEA,SAASS,EAAkBhC,EAAUuB,EAAY,CAC/C,MAAMrC,EAAOc,EAAE,MAAMuB,CAAM,EAC3B,GAAI,CAACrC,EAAM,OACPA,EAAK,OAAS,KACEA,EAAoB,SAAS,MAAA,EACtC,QAASQ,GAAQsC,EAAkBhC,EAAGN,CAAG,CAAC,EAErDmE,EAAO7D,EAAGuB,CAAM,EAChB,KAAM,CAAE,CAACA,CAAM,EAAGwC,EAAO,GAAGC,CAAA,EAAShE,EAAE,MACvCA,EAAE,MAAQgE,CACZ,CAGA,SAAS1C,EAAgBtB,EAAUY,EAASM,EAAiB,CAC3D,GAAIN,IAAQM,EAAM,OAAOlB,EACzB,MAAMd,EAAOc,EAAE,MAAMY,CAAG,EACxB,GAAI,CAAC1B,EAAM,OAAOc,EAElB,MAAMiE,EAAmB,KAAK,MAAM,KAAK,UAAU/E,CAAI,CAAC,EACxD+E,EAAQ,OAAS/C,EAEjB,MAAMgD,EAAgC,CAAE,GAAGlE,EAAE,MAAO,CAACkB,CAAI,EAAG+C,CAAA,EAC5D,OAAOC,EAAStD,CAAG,EAEnB,IAAIuD,EAAanE,EAAE,QACnB,GAAIiE,EAAQ,YAAcA,EAAQ,aAAe,IAAK,CACpD,MAAMxD,EAAIyD,EAASD,EAAQ,UAAU,EACjCxD,GAAG,OAAS,MACdyD,EAASD,EAAQ,UAAU,EAAI,CAC7B,GAAGxD,EACH,SAAUA,EAAE,SAAS,IAAKd,GAAOA,IAAMiB,EAAMM,EAAOvB,CAAE,CAAA,EAG5D,MACEwE,EAAanE,EAAE,QAAQ,IAAKsD,GAAOA,IAAM1C,EAAMM,EAAOoC,CAAE,EAG1D,MAAO,CAAE,GAAGtD,EAAG,MAAOkE,EAAU,QAASC,CAAA,CAC3C,CAEA,SAAS1B,EAAoBzC,EAAgD,CAC3E,OAAOA,EAAE,QAAQ,KAAMjB,GAAOiB,EAAE,MAAMjB,CAAE,GAAG,OAAS,GAAG,GAAK,IAC9D,CAEA,SAASwB,EAAoBnB,EAA4BC,EAAe,CACtE,MAAM+E,EAA6C,CAAA,EACnD,OAAO,OAAOhF,CAAK,EAAE,QAASN,GAAM,CAClC,MAAMC,EAAKD,EAAE,OACPgF,EAAMhF,EAAE,WACV,CAACC,GAAM,CAAC+E,GAAOA,IAAQ,KAAOA,IAAQ/E,IACzCqF,EAAiBN,CAAG,IAAM,CAAA,GAAI,KAAK/E,CAAE,CACxC,CAAC,EAED,MAAMsF,MAAe,IAEfxB,EAAS9D,GAAgB,CAC7B,GAAIsF,EAAS,IAAItF,CAAE,EAAG,OAAO,KAC7B,MAAMD,EAAIM,EAAML,CAAE,EAClB,GAAI,CAACD,EAAG,OAAO,KAEfuF,EAAS,IAAItF,CAAE,EACf,GAAI,CACF,GAAID,EAAE,OAAS,IAAK,CAClB,MAAMc,EAAId,EACJwF,EAAWF,EAAiBrF,CAAE,GAAK,CAAA,EACzC,MAAO,CACL,KAAM,IACN,OAAQA,EACR,OAAQa,EAAE,OACV,WAAYA,EAAE,WACd,SAAU0E,EAAS,IAAIzB,CAAK,EAAE,OAAO,OAAO,CAAA,CAEhD,CACA,MAAME,EAAIjE,EAEV,MAAO,CACL,KAAM,IACN,OAAQC,EACR,OAAQgE,EAAE,OACV,OAAQA,EAAE,OACV,OAAQA,EAAE,OACV,WAAYA,EAAE,UAAA,CAElB,QAAA,CACEsB,EAAS,OAAOtF,CAAE,CACpB,CACF,EAEMwF,EAAc,OAAO,OAAOnF,CAAK,EACpC,OAAQN,GAAMA,EAAE,aAAe,KAAOA,EAAE,OAAS,GAAG,EACpD,IAAKA,GAAMA,EAAE,MAAM,EAEhB0F,EAAgB,OAAO,OAAOpF,CAAK,EACtC,OAAQN,GAAMA,EAAE,aAAe,KAAOA,EAAE,OAAS,GAAG,EACpD,IAAKA,GAAMA,EAAE,MAAM,EAKtB,OAHiB,MAAM,KACrB,IAAI,IAAI,CAAC,GAAGO,EAAS,GAAGkF,EAAa,GAAGC,CAAa,CAAC,CAAA,EAExC,IAAI3B,CAAK,EAAE,OAAO,OAAO,CAC3C,CAEA,SAAS7D,EACPI,EACAP,EACW,CACX,UAAWC,KAAK,OAAO,OAAOM,CAAK,EACjC,GAAIN,EAAE,OAAS,KAAQA,EAAe,SAAWD,SAAeC,EAAE,OAEpE,OAAO,IACT,CAEA,SAASiD,EACP3C,EACAC,EACAuE,EACA,EAEE,CAACA,GAAYA,IAAa,IACtBvE,EACCD,EAAMwE,CAAQ,EAAiB,UAAY,CAAA,GACzC,QAAQ,CAACa,EAAK5C,IAAQ,CAC7B,MAAM/C,EAAIM,EAAMqF,CAAG,EACd3F,IACLA,EAAE,SAAW+C,EACf,CAAC,CACH"}

package/dist/chunks/{favoriteStore-DAPC01iF.js → favoriteStore-Cemc-26t.js}

@@ -1,4 +1,4 @@
-import { aq as f, c as I } from "./apiUtils-DfPv_gmI.js";
+import { ap as f, c as I } from "./apiUtils-DxzLqPhU.js";
 import { create as F } from "zustand";
 const M = (d, o) => ({
   nodes: {},
@@ -436,4 +436,4 @@ function b(d, o, e) {
 export {
   E as u
 };
-//# sourceMappingURL=favoriteStore-DAPC01iF.js.map
+//# sourceMappingURL=favoriteStore-Cemc-26t.js.map

package/dist/chunks/{favoriteStore-DAPC01iF.js.map → favoriteStore-Cemc-26t.js.map}

@@ -1 +1 @@
-{"version":3,"file":"favoriteStore-DAPC01iF.js","sources":["../../src/stores/favoriteStore.ts"],"sourcesContent":["// -------------------------------------------------------\r\n// 즐겨찾기(폴더형) Zustand Store (단일 테이블 CM_BKMK_MSTR 기반)\r\n// 공통 CRUD로 통합: addNode / moveNode / removeNode / editNode\r\n// 기존 API(폴더/메뉴 전용)는 호환용으로 래핑만 유지\r\n// - 정규화(nodes + rootIds)\r\n// - 낙관적 업데이트 + 임시ID(tmp_* → 서버ID) 스왑\r\n// - 필수 기능: 로드, 생성, 이동, 삭제, 수정 + 셀렉터/뷰 변환\r\n// -------------------------------------------------------\r\n\r\nimport { callService } from \"../utils/apiUtils\";\r\nimport { getUserId } from \"../utils/userUtils\";\r\nimport { DataNode } from \"antd/es/tree\";\r\nimport { create, StateCreator } from \"zustand\";\r\n\r\n// 🔧 공통 ID 타입\r\nexport type Id = string;\r\n\r\n/** 공통 베이스 (CM_BKMK_MSTR 매핑) */\r\nexport type BkmkBase = {\r\n  type: \"F\" | \"M\"; // TYPE\r\n  bkmkId: Id; // BKMK_ID\r\n  prntBkmkId: Id | \"-\"; // PRNT_BKMK_ID ('-'=루트)\r\n  sortOrdr: number; // SORT_ORDR\r\n  sysCd?: string; // SYS_CD (옵션)\r\n  userId?: string | null; // USER_ID (옵션)\r\n  fullPath?: string; // 프론트 보조(옵션)\r\n};\r\n\r\n/** 폴더 노드 (BKMK_NM 사용) */\r\nexport type FolderNode = BkmkBase & {\r\n  bkmkNm: string; // BKMK_NM (폴더 전용)\r\n  children: Id[]; // 폴더/아이템 혼재(정규화용)\r\n};\r\n\r\n/** 아이템 노드 (메뉴 전용 메타) */\r\nexport type ItemNode = BkmkBase & {\r\n  menuId: string; // MENU_ID\r\n  menuNm?: string; // 프론트 보조(메뉴명)\r\n};\r\n\r\nexport type FavNode = FolderNode | ItemNode;\r\n\r\nexport type MovePayload = {\r\n  bkmkId: Id;\r\n  newPrntBkmkId: Id | \"-\";\r\n  sortOrdr: number; // 새 부모 내 0-based\r\n  userId: string | null;\r\n};\r\n\r\nexport type AddNodePayload = {\r\n  type: \"F\" | \"M\";\r\n  prntBkmkId: Id | \"-\";\r\n  sysCd: string;\r\n  userId: string | null;\r\n  bkmkNm?: string; // F 전용\r\n  menuId?: string; // M 전용\r\n  menuNm?: string; // 프론트 보조\r\n  sortOrdr?: number; // 선택: 지정 없으면 tailIndex 사용\r\n};\r\n\r\nexport type EditNodePayload = {\r\n  bkmkId: Id;\r\n  userId: string;\r\n  bkmkNm?: string; // F일 때만 의미\r\n  prntBkmkId?: Id | \"-\"; // 선택(이동은 moveNode 권장)\r\n  sortOrdr?: number; // 선택\r\n};\r\n\r\nexport type Normalized = { nodes: Record<Id, FavNode>; rootIds: Id[] };\r\n\r\nexport type State = {\r\n  // ========== 데이터(정규화) ==========\r\n  nodes: Record<Id, FavNode>;\r\n  rootIds: Id[];\r\n  treeNodes: FavNode[]; // 단순 트리(뷰용)\r\n\r\n  // ========== 메타 ==========\r\n  loadedFor?: string;\r\n  loading: boolean;\r\n  error?: string;\r\n\r\n  // ========== 셀렉터 ==========\r\n  isMenuBookmarked: (menuId: string) => boolean;\r\n  getPrntBkmkIdByMenuId: (menuId: string) => Id | \"-\";\r\n  getNodeByMenuId: (menuId: string) => ItemNode | null;\r\n  getFolderTree: (q?: string) => DataNode[]; // 폴더만 Tree (검색 필터)\r\n\r\n  // ========== 로더 ==========\r\n  loadFavorites: (userId: string, force?: boolean) => Promise<void>;\r\n  loadFavoritesIfNeeded: (userId: string) => Promise<void>;\r\n\r\n  // ========== 공통 CRUD ==========\r\n  addNode: (p: AddNodePayload) => Promise<Id>;\r\n  moveNode: (p: MovePayload) => Promise<void>;\r\n  removeNode: (bkmkId: Id) => Promise<void>;\r\n  editNode: (p: EditNodePayload) => Promise<void>;\r\n\r\n  // ========== 호환용(기존 API 유지, 내부에서 공통 호출) ==========\r\n  addFolder: (\r\n    bkmkNm: string,\r\n    prntBkmkId: Id | \"-\",\r\n    sysCd: string,\r\n    userId: string | null\r\n  ) => Promise<Id>;\r\n  addMenuToFolder: (\r\n    folderBkmkId: Id,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<Id | string>;\r\n  toggleMenuFavorite: (\r\n    userId: string | null,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<void>;\r\n  removeMenu: (bkmkId: Id) => Promise<void>;\r\n  removeMenuByMenuId: (menuId: string) => Promise<void>;\r\n  removeFolder: (folderBkmkId: Id) => Promise<void>;\r\n  editFolder: (\r\n    folderBkmkId: Id,\r\n    userId: string | null,\r\n    newBkmkNm?: string,\r\n    prntBkmkId?: Id | \"-\",\r\n    sortOrdr?: number\r\n  ) => Promise<void>;\r\n  convertToAntTreeData: (\r\n    nodesMap: Record<string, FavNode>,\r\n    rootIds: string[],\r\n    q: string,\r\n    onlyFolder?: boolean\r\n  ) => any[];\r\n};\r\n\r\nconst creator: StateCreator<State> = (set, get) => ({\r\n  nodes: {},\r\n  rootIds: [],\r\n  loadedFor: undefined,\r\n  loading: false,\r\n  error: undefined,\r\n  treeNodes: [],\r\n\r\n  // ====== 셀렉터 ======\r\n  isMenuBookmarked: (menuId) =>\r\n    Object.values(get().nodes).some(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menuId\r\n    ),\r\n  getPrntBkmkIdByMenuId: (menuId) => {\r\n    const id = findItemByMenuId(get().nodes, menuId);\r\n    return id ? get().nodes[id]?.prntBkmkId ?? \"-\" : \"-\";\r\n  },\r\n\r\n  getNodeByMenuId: (menuId) => {\r\n    const nodeId = findItemByMenuId(get().nodes, menuId);\r\n    if (!nodeId) return null;\r\n    const node = get().nodes[nodeId];\r\n    return node?.type === \"M\" ? (node as ItemNode) : null;\r\n  },\r\n\r\n  getFolderTree: (q) => {\r\n    const { nodes, rootIds } = get();\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const make = (id: Id): DataNode | null => {\r\n      const n = nodes[id];\r\n      if (!n || n.type !== \"F\") return null;\r\n      const folder = n as FolderNode;\r\n\r\n      const kids = (folder.children || [])\r\n        .map((cid) => nodes[cid])\r\n        .filter((c): c is FolderNode => !!c && c.type === \"F\")\r\n        .map((f) => make(f.bkmkId))\r\n        .filter(Boolean) as DataNode[];\r\n\r\n      const visible = match(folder.bkmkNm) || kids.length > 0;\r\n      if (!visible) return null;\r\n\r\n      return {\r\n        key: folder.bkmkId,\r\n        title: `📁 ${folder.bkmkNm}`,\r\n        children: kids.length ? kids : undefined,\r\n      };\r\n    };\r\n\r\n    return rootIds.map((rid) => make(rid)).filter(Boolean) as DataNode[];\r\n  },\r\n\r\n  // ====== 로더 ======\r\n  loadFavorites: async (userId, force = false) => {\r\n    console.log(\"loadFavorites ::::: \", userId, force);\r\n    const s = get();\r\n    if (!force && s.loadedFor === userId && Object.keys(s.nodes).length) return;\r\n\r\n    set({ loading: true, error: undefined });\r\n    try {\r\n      // 기대 응답 예시: { sub: rawTree[] }\r\n      const res = await callService(\"SCMBKMK00101\", { userId });\r\n      const raw: any[] = Array.isArray(res?.sub) ? res.sub : [];\r\n      const normalized = normalize(raw);\r\n\r\n      const treeNodes = toSimpleTreeFromMap(\r\n        normalized.nodes,\r\n        normalized.rootIds\r\n      );\r\n\r\n      set({\r\n        ...normalized,\r\n        treeNodes,\r\n        loadedFor: userId,\r\n        loading: false,\r\n      });\r\n    } catch (e: any) {\r\n      set({ loading: false, error: e?.message || \"즐겨찾기 로드 실패\" });\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  loadFavoritesIfNeeded: async (userId) => {\r\n    const s = get();\r\n    const notLoaded =\r\n      s.loadedFor !== userId || Object.keys(s.nodes).length === 0;\r\n    if (notLoaded) {\r\n      await get().loadFavorites(userId);\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 생성 ======\r\n  addNode: async (p) => {\r\n    const prev = snapshot(get());\r\n    const tmp = tempId();\r\n\r\n    // 1) 낙관적 반영\r\n    set((s) => {\r\n      const sort = p.sortOrdr ?? tailIndex(s, p.prntBkmkId);\r\n      const next: State = {\r\n        ...s,\r\n        nodes: {\r\n          ...s.nodes,\r\n          [tmp]:\r\n            p.type === \"F\"\r\n              ? ({\r\n                  bkmkId: tmp,\r\n                  type: \"F\",\r\n                  prntBkmkId: p.prntBkmkId || \"-\",\r\n                  sortOrdr: sort,\r\n                  bkmkNm: p.bkmkNm ?? \"새 폴더\",\r\n                  children: [],\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as FolderNode)\r\n              : ({\r\n                  bkmkId: tmp,\r\n                  type: \"M\",\r\n                  prntBkmkId: p.prntBkmkId,\r\n                  sortOrdr: sort,\r\n                  menuId: p.menuId ?? \"\",\r\n                  menuNm: p.menuNm,\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as ItemNode),\r\n        },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      attach(next, tmp, p.prntBkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      // 2) 서버 호출\r\n      // 백엔드는 통합 IUD가 아닐 수 있으므로, 호환 분기 적용\r\n      let real: string = tmp;\r\n      const sortForServer = tailIndex(get(), p.prntBkmkId);\r\n      const res = await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"I\",\r\n        type: p.type,\r\n        sysCd: p.sysCd,\r\n        userId: p.userId,\r\n        bkmkId: tmp, // 서버 새 ID 반환 시 매칭용\r\n        bkmkNm: p.bkmkNm,\r\n        prntBkmkId: p.prntBkmkId,\r\n        menuId: p.menuId,\r\n        sortOrdr: sortForServer,\r\n        chngId: getUserId(),\r\n      });\r\n      real = String(res?.bkmkId ?? res?.itemId ?? tmp);\r\n\r\n      // 3) tmp → real 스왑\r\n      set((s) => {\r\n        const swapped = idSwapImmutable(s, tmp, real);\r\n        return {\r\n          ...swapped,\r\n          treeNodes: toSimpleTreeFromMap(swapped.nodes, swapped.rootIds),\r\n        };\r\n      });\r\n      return real;\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 이동 ======\r\n  moveNode: async ({ bkmkId, newPrntBkmkId, sortOrdr, userId }) => {\r\n    const prev = get(); // 함수 포함 스냅샷(rollback 용으로 set(prev) 사용)\r\n\r\n    const nodes = structuredClone(prev.nodes);\r\n    const rootIds = [...prev.rootIds];\r\n\r\n    const node = nodes[bkmkId];\r\n    if (!node) return;\r\n\r\n    // 부모는 반드시 폴더만 허용\r\n    if (newPrntBkmkId !== \"-\") {\r\n      const parent = nodes[newPrntBkmkId];\r\n      if (!parent || parent.type !== \"F\")\r\n        throw new Error(\"부모는 폴더만 가능합니다.\");\r\n    }\r\n\r\n    const oldParentId = node.prntBkmkId ?? \"-\";\r\n\r\n    const removeFrom =\r\n      oldParentId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[oldParentId] as FolderNode).children ||= []);\r\n    {\r\n      const idx = removeFrom.indexOf(bkmkId);\r\n      if (idx >= 0) removeFrom.splice(idx, 1);\r\n    }\r\n\r\n    const insertTo =\r\n      newPrntBkmkId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[newPrntBkmkId] as FolderNode).children ||= []);\r\n    insertTo.splice(\r\n      Math.max(0, Math.min(sortOrdr, insertTo.length)),\r\n      0,\r\n      bkmkId\r\n    );\r\n\r\n    node.prntBkmkId = newPrntBkmkId as Id;\r\n    set({ nodes, rootIds });\r\n    _resequence(nodes, rootIds, newPrntBkmkId);\r\n    _resequence(nodes, rootIds, oldParentId);\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00104\", {\r\n        // 백엔드 명칭 호환\r\n        bkmkId,\r\n        prntBkmkId: newPrntBkmkId,\r\n        sortOrdr,\r\n        chngId: userId,\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 삭제 ======\r\n  removeNode: async (bkmkId) => {\r\n    const prev = snapshot(get());\r\n\r\n    set((s) => {\r\n      if (!s.nodes[bkmkId]) return s as State;\r\n      const next: State = {\r\n        ...s,\r\n        nodes: { ...s.nodes },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      removeRecursively(next, bkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00103\", { bkmkId });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 수정 ======\r\n  editNode: async ({ bkmkId, userId, bkmkNm, prntBkmkId, sortOrdr }) => {\r\n    const prev = snapshot(get());\r\n\r\n    // 폴더명 변경만 프런트 즉시 반영(옵션)\r\n    set((s) => {\r\n      const next = { ...s, nodes: { ...s.nodes } } as State;\r\n      const target = next.nodes[bkmkId] as FavNode | undefined;\r\n      if (target?.type === \"F\" && typeof bkmkNm === \"string\") {\r\n        next.nodes[bkmkId] = {\r\n          ...(target as FolderNode),\r\n          bkmkNm,\r\n        } as FolderNode;\r\n      }\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"U\",\r\n        userId,\r\n        bkmkId,\r\n        bkmkNm,\r\n        prntBkmkId,\r\n        sortOrdr,\r\n        chngId: getUserId(),\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 호환용 래퍼 ======\r\n  addFolder: async (bkmkNm, prntBkmkId, sysCd, userId) => {\r\n    return await get().addNode({\r\n      type: \"F\",\r\n      bkmkNm,\r\n      prntBkmkId,\r\n      sysCd,\r\n      userId,\r\n    });\r\n  },\r\n\r\n  addMenuToFolder: async (folderBkmkId, menu) => {\r\n    // 전역 중복 방지\r\n    const dup = findItemByMenuId(get().nodes, menu.menuId);\r\n    if (dup) return \"이미 북마크에 저장된 메뉴입니다.\";\r\n    return await get().addNode({\r\n      type: \"M\",\r\n      prntBkmkId: folderBkmkId,\r\n      sysCd: \"KH\",\r\n      userId: getUserId(),\r\n      menuId: menu.menuId,\r\n      menuNm: menu.menuNm,\r\n    });\r\n  },\r\n\r\n  toggleMenuFavorite: async (userId, menu) => {\r\n    const s = get();\r\n    const exists = Object.values(s.nodes).find(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menu.menuId\r\n    );\r\n    if (exists) {\r\n      await get().removeNode(exists.bkmkId);\r\n      return;\r\n    }\r\n\r\n    let folderId = pickDefaultFolderId(s);\r\n    if (!folderId) {\r\n      await get().loadFavorites(userId, true);\r\n      folderId = pickDefaultFolderId(get());\r\n    }\r\n    if (folderId) {\r\n      await get().addNode({\r\n        type: \"M\",\r\n        prntBkmkId: folderId,\r\n        sysCd: \"KH\",\r\n        userId: getUserId(),\r\n        menuId: menu.menuId,\r\n        menuNm: menu.menuNm,\r\n      });\r\n    }\r\n  },\r\n\r\n  removeMenuByMenuId: async (menuId) => {\r\n    const s = get();\r\n    const bkmkId = findItemByMenuId(s.nodes, menuId);\r\n    if (bkmkId) await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeMenu: async (bkmkId) => {\r\n    await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeFolder: async (folderBkmkId) => {\r\n    await get().removeNode(folderBkmkId);\r\n  },\r\n\r\n  editFolder: async (folderBkmkId, userId, newBkmkNm, prntBkmkId, sortOrdr) => {\r\n    await get().editNode({\r\n      bkmkId: folderBkmkId,\r\n      userId,\r\n      bkmkNm: newBkmkNm,\r\n      prntBkmkId,\r\n      sortOrdr,\r\n    });\r\n  },\r\n\r\n  /** Ant Tree 데이터 변환 (검색 포함) */\r\n  convertToAntTreeData: (nodesMap, rootIds, q, onlyFolder = false) => {\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const build = (id: string): any | null => {\r\n      const n = nodesMap[id];\r\n      if (!n) return null;\r\n\r\n      if (onlyFolder && n.type !== \"F\") return null;\r\n\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const children = (f.children || [])\r\n          .map((cid) => build(cid))\r\n          .filter(Boolean);\r\n        const visible = match(f.bkmkNm) || children.length > 0;\r\n        if (!visible) return null;\r\n        return {\r\n          key: f.bkmkId,\r\n          type: \"F\",\r\n          title: `📁 ${f.bkmkNm}`,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          sortOrdr: f.sortOrdr,\r\n          fullPath: f.fullPath,\r\n          children: children.length ? children : undefined,\r\n        };\r\n      } else {\r\n        const i = n as ItemNode;\r\n        const label = i.menuNm ? `${i.menuNm} (${i.menuId})` : i.menuId;\r\n        const visible = match(label);\r\n        if (!visible) return null;\r\n        return {\r\n          key: i.bkmkId,\r\n          type: \"M\",\r\n          title: `📄 ${label}`,\r\n          prntBkmkId: i.prntBkmkId,\r\n          sortOrdr: i.sortOrdr,\r\n          fullPath: i.fullPath,\r\n          isLeaf: true,\r\n        };\r\n      }\r\n    };\r\n\r\n    return rootIds.map(build).filter(Boolean);\r\n  },\r\n});\r\n\r\nexport const useFavoriteStore = create<State>(creator);\r\n\r\n// ===================================================================\r\n// Helpers\r\n// ===================================================================\r\n\r\nfunction normalize(raw: any[]): Normalized {\r\n  const nodes: Record<Id, FavNode> = {};\r\n  const roots: Id[] = [];\r\n\r\n  const walk = (arr: any[]) => {\r\n    arr.forEach((r: any) => {\r\n      // 서버 raw 필드: TYPE, BKMK_ID, PRNT_BKMK_ID, SORT_ORDR, BKMK_NM, MENU_ID, FULL_PATH?\r\n      const base: BkmkBase = {\r\n        type: r.type,\r\n        bkmkId: r.bkmkId ?? r.BKMK_ID ?? r.id,\r\n        prntBkmkId: r.prntBkmkId ?? r.PRNT_BKMK_ID ?? \"-\",\r\n        sortOrdr: Number(r.sortOrdr ?? r.SORT_ORDR ?? 0),\r\n        sysCd: r.sysCd ?? r.SYS_CD,\r\n        userId: r.userId ?? r.USER_ID,\r\n        fullPath: r.fullPath ?? r.FULL_PATH,\r\n      };\r\n\r\n      if (r.type === \"F\") {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          bkmkNm: r.bkmkNm ?? r.BKMK_NM ?? r.name ?? base.bkmkId,\r\n          children: [],\r\n        } as FolderNode;\r\n\r\n        const children = Array.isArray(r.children) ? r.children : [];\r\n        walk(children);\r\n      } else {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          menuId: r.menuId ?? r.MENU_ID ?? \"\",\r\n          menuNm: r.menuNm ?? r.MENU_NM,\r\n        } as ItemNode;\r\n      }\r\n    });\r\n  };\r\n\r\n  walk(raw);\r\n\r\n  // children / rootIds 구성\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.prntBkmkId && n.prntBkmkId !== \"-\") {\r\n      const p = nodes[n.prntBkmkId] as FolderNode;\r\n      if (p?.type === \"F\") p.children.push(n.bkmkId);\r\n    } else if (n.type === \"F\") {\r\n      roots.push(n.bkmkId);\r\n    }\r\n  });\r\n\r\n  // 정렬 인덱스 보정(안전)\r\n  roots.sort((a, b) => (nodes[a].sortOrdr ?? 0) - (nodes[b].sortOrdr ?? 0));\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.type === \"F\") {\r\n      const f = n as FolderNode;\r\n      f.children.sort(\r\n        (A, B) => (nodes[A].sortOrdr ?? 0) - (nodes[B].sortOrdr ?? 0)\r\n      );\r\n    }\r\n  });\r\n\r\n  return { nodes, rootIds: roots };\r\n}\r\n\r\nfunction snapshot(s: State): State {\r\n  return {\r\n    ...s,\r\n    nodes: JSON.parse(JSON.stringify(s.nodes)),\r\n    rootIds: s.rootIds.slice(),\r\n  };\r\n}\r\n\r\nfunction tempId(): Id {\r\n  return `tmp_${Math.random().toString(36).slice(2, 10)}`;\r\n}\r\n\r\nfunction tailIndex(s: Pick<State, \"nodes\" | \"rootIds\">, parentId: Id | \"-\") {\r\n  if (!parentId || parentId === \"-\") return s.rootIds.length;\r\n  const p = s.nodes[parentId] as FolderNode | undefined;\r\n  return p ? p.children.length : 0;\r\n}\r\n\r\nfunction attach(s: State, bkmkId: Id, parentId: Id | \"-\") {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n\r\n  if (parentId && parentId !== \"-\") {\r\n    const p = s.nodes[parentId] as FolderNode | undefined;\r\n    if (!p || p.type !== \"F\") return;\r\n    n.prntBkmkId = parentId;\r\n    p.children = [...p.children, bkmkId];\r\n  } else {\r\n    n.prntBkmkId = \"-\";\r\n    s.rootIds = [...s.rootIds, bkmkId];\r\n  }\r\n}\r\n\r\nfunction detach(s: State, bkmkId: Id) {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n  const pid = n.prntBkmkId;\r\n\r\n  if (pid && pid !== \"-\") {\r\n    const p = s.nodes[pid] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      p.children = p.children.filter((c) => c !== bkmkId);\r\n    }\r\n  } else {\r\n    s.rootIds = s.rootIds.filter((r) => r !== bkmkId);\r\n  }\r\n}\r\n\r\nfunction removeRecursively(s: State, bkmkId: Id) {\r\n  const node = s.nodes[bkmkId];\r\n  if (!node) return;\r\n  if (node.type === \"F\") {\r\n    const children = (node as FolderNode).children.slice();\r\n    children.forEach((cid) => removeRecursively(s, cid));\r\n  }\r\n  detach(s, bkmkId);\r\n  const { [bkmkId]: _omit, ...rest } = s.nodes as Record<string, FavNode>;\r\n  s.nodes = rest;\r\n}\r\n\r\n/** 임시ID → 실제ID 스왑 (불변성 유지) */\r\nfunction idSwapImmutable(s: State, tmp: Id, real: Id): State {\r\n  if (tmp === real) return s;\r\n  const node = s.nodes[tmp];\r\n  if (!node) return s;\r\n\r\n  const newNode: FavNode = JSON.parse(JSON.stringify(node));\r\n  newNode.bkmkId = real;\r\n\r\n  const newNodes: Record<Id, FavNode> = { ...s.nodes, [real]: newNode };\r\n  delete newNodes[tmp];\r\n\r\n  let newRootIds = s.rootIds;\r\n  if (newNode.prntBkmkId && newNode.prntBkmkId !== \"-\") {\r\n    const p = newNodes[newNode.prntBkmkId] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      newNodes[newNode.prntBkmkId] = {\r\n        ...p,\r\n        children: p.children.map((c) => (c === tmp ? real : c)),\r\n      } as FolderNode;\r\n    }\r\n  } else {\r\n    newRootIds = s.rootIds.map((r) => (r === tmp ? real : r));\r\n  }\r\n\r\n  return { ...s, nodes: newNodes, rootIds: newRootIds };\r\n}\r\n\r\nfunction pickDefaultFolderId(s: Pick<State, \"nodes\" | \"rootIds\">): Id | null {\r\n  return s.rootIds.find((id) => s.nodes[id]?.type === \"F\") ?? null;\r\n}\r\n\r\nfunction toSimpleTreeFromMap(nodes: Record<Id, FavNode>, rootIds: Id[]) {\r\n  const childrenByParent: Record<string, string[]> = {};\r\n  Object.values(nodes).forEach((n) => {\r\n    const id = n.bkmkId;\r\n    const pid = n.prntBkmkId;\r\n    if (!id || !pid || pid === \"-\" || pid === id) return;\r\n    (childrenByParent[pid] ??= []).push(id);\r\n  });\r\n\r\n  const visiting = new Set<string>();\r\n\r\n  const build = (id: Id): any => {\r\n    if (visiting.has(id)) return null;\r\n    const n = nodes[id];\r\n    if (!n) return null;\r\n\r\n    visiting.add(id);\r\n    try {\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const childIds = childrenByParent[id] ?? [];\r\n        return {\r\n          type: \"F\",\r\n          bkmkId: id,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          children: childIds.map(build).filter(Boolean),\r\n        };\r\n      }\r\n      const i = n as ItemNode;\r\n\r\n      return {\r\n        type: \"M\",\r\n        bkmkId: id,\r\n        bkmkNm: i.menuNm,\r\n        menuId: i.menuId,\r\n        menuNm: i.menuNm,\r\n        prntBkmkId: i.prntBkmkId,\r\n      };\r\n    } finally {\r\n      visiting.delete(id);\r\n    }\r\n  };\r\n\r\n  const rootMenuIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"M\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootFolderIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"F\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootKeys = Array.from(\r\n    new Set([...rootIds, ...rootMenuIds, ...rootFolderIds])\r\n  );\r\n  return rootKeys.map(build).filter(Boolean);\r\n}\r\n\r\nfunction findItemByMenuId(\r\n  nodes: Record<Id, FavNode>,\r\n  menuId: string\r\n): Id | null {\r\n  for (const n of Object.values(nodes)) {\r\n    if (n.type === \"M\" && (n as ItemNode).menuId === menuId) return n.bkmkId;\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction _resequence(\r\n  nodes: Record<Id, FavNode>,\r\n  rootIds: Id[],\r\n  parentId: Id | \"-\"\r\n) {\r\n  const siblings: Id[] =\r\n    !parentId || parentId === \"-\"\r\n      ? rootIds\r\n      : (nodes[parentId] as FolderNode).children || [];\r\n  siblings.forEach((sid, idx) => {\r\n    const n = nodes[sid];\r\n    if (!n) return;\r\n    n.sortOrdr = idx;\r\n  });\r\n}\r\n"],"names":["creator","set","get","menuId","n","id","findItemByMenuId","nodeId","node","q","nodes","rootIds","match","make","folder","kids","cid","c","f","rid","userId","force","s","res","callService","raw","normalized","normalize","treeNodes","toSimpleTreeFromMap","e","p","prev","snapshot","tmp","tempId","sort","tailIndex","next","attach","real","sortForServer","getUserId","swapped","idSwapImmutable","bkmkId","newPrntBkmkId","sortOrdr","parent","oldParentId","removeFrom","idx","insertTo","_resequence","removeRecursively","bkmkNm","prntBkmkId","target","sysCd","folderBkmkId","menu","exists","folderId","pickDefaultFolderId","newBkmkNm","nodesMap","onlyFolder","build","children","i","label","useFavoriteStore","create","roots","walk","arr","r","base","a","b","A","B","parentId","detach","pid","_omit","rest","newNode","newNodes","newRootIds","childrenByParent","visiting","childIds","rootMenuIds","rootFolderIds","sid"],"mappings":";;AAkIA,MAAMA,IAA+B,CAACC,GAAKC,OAAS;AAAA,EAClD,OAAO,CAAA;AAAA,EACP,SAAS,CAAA;AAAA,EACT,WAAW;AAAA,EACX,SAAS;AAAA,EACT,OAAO;AAAA,EACP,WAAW,CAAA;AAAA;AAAA,EAGX,kBAAkB,CAACC,MACjB,OAAO,OAAOD,EAAA,EAAM,KAAK,EAAE;AAAA,IACzB,CAACE,MAAMA,EAAE,SAAS,OAAQA,EAAe,WAAWD;AAAA,EAAA;AAAA,EAExD,uBAAuB,CAACA,MAAW;AACjC,UAAME,IAAKC,EAAiBJ,EAAA,EAAM,OAAOC,CAAM;AAC/C,WAAOE,IAAKH,IAAM,MAAMG,CAAE,GAAG,cAAc,MAAM;AAAA,EACnD;AAAA,EAEA,iBAAiB,CAACF,MAAW;AAC3B,UAAMI,IAASD,EAAiBJ,EAAA,EAAM,OAAOC,CAAM;AACnD,QAAI,CAACI,EAAQ,QAAO;AACpB,UAAMC,IAAON,IAAM,MAAMK,CAAM;AAC/B,WAAOC,GAAM,SAAS,MAAOA,IAAoB;AAAA,EACnD;AAAA,EAEA,eAAe,CAACC,MAAM;AACpB,UAAM,EAAE,OAAAC,GAAO,SAAAC,EAAA,IAAYT,EAAA,GACrBU,IAAQ,CAAC,MACbH,IAAI,EAAE,YAAA,EAAc,SAASA,EAAE,YAAA,CAAa,IAAI,IAE5CI,IAAO,CAACR,MAA4B;AACxC,YAAMD,IAAIM,EAAML,CAAE;AAClB,UAAI,CAACD,KAAKA,EAAE,SAAS,IAAK,QAAO;AACjC,YAAMU,IAASV,GAETW,KAAQD,EAAO,YAAY,CAAA,GAC9B,IAAI,CAACE,MAAQN,EAAMM,CAAG,CAAC,EACvB,OAAO,CAACC,MAAuB,CAAC,CAACA,KAAKA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACC,MAAML,EAAKK,EAAE,MAAM,CAAC,EACzB,OAAO,OAAO;AAGjB,aADgBN,EAAME,EAAO,MAAM,KAAKC,EAAK,SAAS,IAG/C;AAAA,QACL,KAAKD,EAAO;AAAA,QACZ,OAAO,MAAMA,EAAO,MAAM;AAAA,QAC1B,UAAUC,EAAK,SAASA,IAAO;AAAA,MAAA,IALZ;AAAA,IAOvB;AAEA,WAAOJ,EAAQ,IAAI,CAACQ,MAAQN,EAAKM,CAAG,CAAC,EAAE,OAAO,OAAO;AAAA,EACvD;AAAA;AAAA,EAGA,eAAe,OAAOC,GAAQC,IAAQ,OAAU;AAC9C,YAAQ,IAAI,wBAAwBD,GAAQC,CAAK;AACjD,UAAMC,IAAIpB,EAAA;AACV,QAAI,GAACmB,KAASC,EAAE,cAAcF,KAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,SAE7D;AAAA,MAAArB,EAAI,EAAE,SAAS,IAAM,OAAO,QAAW;AACvC,UAAI;AAEF,cAAMsB,IAAM,MAAMC,EAAY,gBAAgB,EAAE,QAAAJ,GAAQ,GAClDK,IAAa,MAAM,QAAQF,GAAK,GAAG,IAAIA,EAAI,MAAM,CAAA,GACjDG,IAAaC,EAAUF,CAAG,GAE1BG,IAAYC;AAAA,UAChBH,EAAW;AAAA,UACXA,EAAW;AAAA,QAAA;AAGb,QAAAzB,EAAI;AAAA,UACF,GAAGyB;AAAA,UACH,WAAAE;AAAA,UACA,WAAWR;AAAA,UACX,SAAS;AAAA,QAAA,CACV;AAAA,MACH,SAASU,GAAQ;AACf,cAAA7B,EAAI,EAAE,SAAS,IAAO,OAAO6B,GAAG,WAAW,cAAc,GACnDA;AAAA,MACR;AAAA;AAAA,EACF;AAAA,EAEA,uBAAuB,OAAOV,MAAW;AACvC,UAAME,IAAIpB,EAAA;AAGV,KADEoB,EAAE,cAAcF,KAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,WAAW,MAE1D,MAAMpB,EAAA,EAAM,cAAckB,CAAM;AAAA,EAEpC;AAAA;AAAA,EAGA,SAAS,OAAOW,MAAM;AACpB,UAAMC,IAAOC,EAAS/B,GAAK,GACrBgC,IAAMC,EAAA;AAGZ,IAAAlC,EAAI,CAACqB,MAAM;AACT,YAAMc,IAAOL,EAAE,YAAYM,EAAUf,GAAGS,EAAE,UAAU,GAC9CO,IAAc;AAAA,QAClB,GAAGhB;AAAA,QACH,OAAO;AAAA,UACL,GAAGA,EAAE;AAAA,UACL,CAACY,CAAG,GACFH,EAAE,SAAS,MACN;AAAA,YACC,QAAQG;AAAA,YACR,MAAM;AAAA,YACN,YAAYH,EAAE,cAAc;AAAA,YAC5B,UAAUK;AAAA,YACV,QAAQL,EAAE,UAAU;AAAA,YACpB,UAAU,CAAA;AAAA,YACV,OAAOA,EAAE;AAAA,YACT,QAAQA,EAAE;AAAA,UAAA,IAEX;AAAA,YACC,QAAQG;AAAA,YACR,MAAM;AAAA,YACN,YAAYH,EAAE;AAAA,YACd,UAAUK;AAAA,YACV,QAAQL,EAAE,UAAU;AAAA,YACpB,QAAQA,EAAE;AAAA,YACV,OAAOA,EAAE;AAAA,YACT,QAAQA,EAAE;AAAA,UAAA;AAAA,QACZ;AAAA,QAER,SAAST,EAAE,QAAQ,MAAA;AAAA,QACnB,WAAWA,EAAE;AAAA,MAAA;AAEf,aAAAiB,EAAOD,GAAMJ,GAAKH,EAAE,UAAU,GAC9BO,EAAK,YAAYT,EAAoBS,EAAK,OAAOA,EAAK,OAAO,GACtDA;AAAA,IACT,CAAC;AAED,QAAI;AAGF,UAAIE,IAAeN;AACnB,YAAMO,IAAgBJ,EAAUnC,EAAA,GAAO6B,EAAE,UAAU,GAC7CR,IAAM,MAAMC,EAAY,gBAAgB;AAAA,QAC5C,SAAS;AAAA,QACT,MAAMO,EAAE;AAAA,QACR,OAAOA,EAAE;AAAA,QACT,QAAQA,EAAE;AAAA,QACV,QAAQG;AAAA;AAAA,QACR,QAAQH,EAAE;AAAA,QACV,YAAYA,EAAE;AAAA,QACd,QAAQA,EAAE;AAAA,QACV,UAAUU;AAAA,QACV,QAAQC,EAAA;AAAA,MAAU,CACnB;AACD,aAAAF,IAAO,OAAOjB,GAAK,UAAUA,GAAK,UAAUW,CAAG,GAG/CjC,EAAI,CAACqB,MAAM;AACT,cAAMqB,IAAUC,EAAgBtB,GAAGY,GAAKM,CAAI;AAC5C,eAAO;AAAA,UACL,GAAGG;AAAA,UACH,WAAWd,EAAoBc,EAAQ,OAAOA,EAAQ,OAAO;AAAA,QAAA;AAAA,MAEjE,CAAC,GACMH;AAAA,IACT,SAASV,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAAO,EAAE,QAAAe,GAAQ,eAAAC,GAAe,UAAAC,GAAU,QAAA3B,QAAa;AAC/D,UAAMY,IAAO9B,EAAA,GAEPQ,IAAQ,gBAAgBsB,EAAK,KAAK,GAClCrB,IAAU,CAAC,GAAGqB,EAAK,OAAO,GAE1BxB,IAAOE,EAAMmC,CAAM;AACzB,QAAI,CAACrC,EAAM;AAGX,QAAIsC,MAAkB,KAAK;AACzB,YAAME,IAAStC,EAAMoC,CAAa;AAClC,UAAI,CAACE,KAAUA,EAAO,SAAS;AAC7B,cAAM,IAAI,MAAM,gBAAgB;AAAA,IACpC;AAEA,UAAMC,IAAczC,EAAK,cAAc,KAEjC0C,IACJD,MAAgB,MACZtC,IACED,EAAMuC,CAAW,EAAiB,aAAa,CAAA;AACvD;AACE,YAAME,IAAMD,EAAW,QAAQL,CAAM;AACrC,MAAIM,KAAO,KAAGD,EAAW,OAAOC,GAAK,CAAC;AAAA,IACxC;AAEA,UAAMC,IACJN,MAAkB,MACdnC,IACED,EAAMoC,CAAa,EAAiB,aAAa,CAAA;AACzD,IAAAM,EAAS;AAAA,MACP,KAAK,IAAI,GAAG,KAAK,IAAIL,GAAUK,EAAS,MAAM,CAAC;AAAA,MAC/C;AAAA,MACAP;AAAA,IAAA,GAGFrC,EAAK,aAAasC,GAClB7C,EAAI,EAAE,OAAAS,GAAO,SAAAC,GAAS,GACtB0C,EAAY3C,GAAOC,GAASmC,CAAa,GACzCO,EAAY3C,GAAOC,GAASsC,CAAW;AAEvC,QAAI;AACF,YAAMzB,EAAY,gBAAgB;AAAA;AAAA,QAEhC,QAAAqB;AAAA,QACA,YAAYC;AAAA,QACZ,UAAAC;AAAA,QACA,QAAQ3B;AAAA,MAAA,CACT;AAAA,IACH,SAASU,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,YAAY,OAAOe,MAAW;AAC5B,UAAMb,IAAOC,EAAS/B,GAAK;AAE3B,IAAAD,EAAI,CAACqB,MAAM;AACT,UAAI,CAACA,EAAE,MAAMuB,CAAM,EAAG,QAAOvB;AAC7B,YAAMgB,IAAc;AAAA,QAClB,GAAGhB;AAAA,QACH,OAAO,EAAE,GAAGA,EAAE,MAAA;AAAA,QACd,SAASA,EAAE,QAAQ,MAAA;AAAA,QACnB,WAAWA,EAAE;AAAA,MAAA;AAEf,aAAAgC,EAAkBhB,GAAMO,CAAM,GAC9BP,EAAK,YAAYT,EAAoBS,EAAK,OAAOA,EAAK,OAAO,GACtDA;AAAA,IACT,CAAC;AAED,QAAI;AACF,YAAMd,EAAY,gBAAgB,EAAE,QAAAqB,GAAQ;AAAA,IAC9C,SAASf,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAAO,EAAE,QAAAe,GAAQ,QAAAzB,GAAQ,QAAAmC,GAAQ,YAAAC,GAAY,UAAAT,QAAe;AACpE,UAAMf,IAAOC,EAAS/B,GAAK;AAG3B,IAAAD,EAAI,CAACqB,MAAM;AACT,YAAMgB,IAAO,EAAE,GAAGhB,GAAG,OAAO,EAAE,GAAGA,EAAE,QAAM,GACnCmC,IAASnB,EAAK,MAAMO,CAAM;AAChC,aAAIY,GAAQ,SAAS,OAAO,OAAOF,KAAW,aAC5CjB,EAAK,MAAMO,CAAM,IAAI;AAAA,QACnB,GAAIY;AAAA,QACJ,QAAAF;AAAA,MAAA,IAGGjB;AAAA,IACT,CAAC;AAED,QAAI;AACF,YAAMd,EAAY,gBAAgB;AAAA,QAChC,SAAS;AAAA,QACT,QAAAJ;AAAA,QACA,QAAAyB;AAAA,QACA,QAAAU;AAAA,QACA,YAAAC;AAAA,QACA,UAAAT;AAAA,QACA,QAAQL,EAAA;AAAA,MAAU,CACnB;AAAA,IACH,SAASZ,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,WAAW,OAAOyB,GAAQC,GAAYE,GAAOtC,MACpC,MAAMlB,EAAA,EAAM,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,QAAAqD;AAAA,IACA,YAAAC;AAAA,IACA,OAAAE;AAAA,IACA,QAAAtC;AAAA,EAAA,CACD;AAAA,EAGH,iBAAiB,OAAOuC,GAAcC,MAExBtD,EAAiBJ,EAAA,EAAM,OAAO0D,EAAK,MAAM,IACrC,uBACT,MAAM1D,EAAA,EAAM,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,YAAYyD;AAAA,IACZ,OAAO;AAAA,IACP,QAAQjB,EAAA;AAAA,IACR,QAAQkB,EAAK;AAAA,IACb,QAAQA,EAAK;AAAA,EAAA,CACd;AAAA,EAGH,oBAAoB,OAAOxC,GAAQwC,MAAS;AAC1C,UAAMtC,IAAIpB,EAAA,GACJ2D,IAAS,OAAO,OAAOvC,EAAE,KAAK,EAAE;AAAA,MACpC,CAAClB,MAAMA,EAAE,SAAS,OAAQA,EAAe,WAAWwD,EAAK;AAAA,IAAA;AAE3D,QAAIC,GAAQ;AACV,YAAM3D,EAAA,EAAM,WAAW2D,EAAO,MAAM;AACpC;AAAA,IACF;AAEA,QAAIC,IAAWC,EAAoBzC,CAAC;AACpC,IAAKwC,MACH,MAAM5D,EAAA,EAAM,cAAckB,GAAQ,EAAI,GACtC0C,IAAWC,EAAoB7D,GAAK,IAElC4D,KACF,MAAM5D,EAAA,EAAM,QAAQ;AAAA,MAClB,MAAM;AAAA,MACN,YAAY4D;AAAA,MACZ,OAAO;AAAA,MACP,QAAQpB,EAAA;AAAA,MACR,QAAQkB,EAAK;AAAA,MACb,QAAQA,EAAK;AAAA,IAAA,CACd;AAAA,EAEL;AAAA,EAEA,oBAAoB,OAAOzD,MAAW;AACpC,UAAMmB,IAAIpB,EAAA,GACJ2C,IAASvC,EAAiBgB,EAAE,OAAOnB,CAAM;AAC/C,IAAI0C,KAAQ,MAAM3C,IAAM,WAAW2C,CAAM;AAAA,EAC3C;AAAA,EAEA,YAAY,OAAOA,MAAW;AAC5B,UAAM3C,EAAA,EAAM,WAAW2C,CAAM;AAAA,EAC/B;AAAA,EAEA,cAAc,OAAOc,MAAiB;AACpC,UAAMzD,EAAA,EAAM,WAAWyD,CAAY;AAAA,EACrC;AAAA,EAEA,YAAY,OAAOA,GAAcvC,GAAQ4C,GAAWR,GAAYT,MAAa;AAC3E,UAAM7C,EAAA,EAAM,SAAS;AAAA,MACnB,QAAQyD;AAAA,MACR,QAAAvC;AAAA,MACA,QAAQ4C;AAAA,MACR,YAAAR;AAAA,MACA,UAAAT;AAAA,IAAA,CACD;AAAA,EACH;AAAA;AAAA,EAGA,sBAAsB,CAACkB,GAAUtD,GAASF,GAAGyD,IAAa,OAAU;AAClE,UAAMtD,IAAQ,CAACU,MACbb,IAAIa,EAAE,YAAA,EAAc,SAASb,EAAE,YAAA,CAAa,IAAI,IAE5C0D,IAAQ,CAAC9D,MAA2B;AACxC,YAAMD,IAAI6D,EAAS5D,CAAE;AAGrB,UAFI,CAACD,KAED8D,KAAc9D,EAAE,SAAS,IAAK,QAAO;AAEzC,UAAIA,EAAE,SAAS,KAAK;AAClB,cAAMc,IAAId,GACJgE,KAAYlD,EAAE,YAAY,CAAA,GAC7B,IAAI,CAACF,MAAQmD,EAAMnD,CAAG,CAAC,EACvB,OAAO,OAAO;AAEjB,eADgBJ,EAAMM,EAAE,MAAM,KAAKkD,EAAS,SAAS,IAE9C;AAAA,UACL,KAAKlD,EAAE;AAAA,UACP,MAAM;AAAA,UACN,OAAO,MAAMA,EAAE,MAAM;AAAA,UACrB,QAAQA,EAAE;AAAA,UACV,YAAYA,EAAE;AAAA,UACd,UAAUA,EAAE;AAAA,UACZ,UAAUA,EAAE;AAAA,UACZ,UAAUkD,EAAS,SAASA,IAAW;AAAA,QAAA,IATpB;AAAA,MAWvB,OAAO;AACL,cAAMC,IAAIjE,GACJkE,IAAQD,EAAE,SAAS,GAAGA,EAAE,MAAM,KAAKA,EAAE,MAAM,MAAMA,EAAE;AAEzD,eADgBzD,EAAM0D,CAAK,IAEpB;AAAA,UACL,KAAKD,EAAE;AAAA,UACP,MAAM;AAAA,UACN,OAAO,MAAMC,CAAK;AAAA,UAClB,YAAYD,EAAE;AAAA,UACd,UAAUA,EAAE;AAAA,UACZ,UAAUA,EAAE;AAAA,UACZ,QAAQ;AAAA,QAAA,IARW;AAAA,MAUvB;AAAA,IACF;AAEA,WAAO1D,EAAQ,IAAIwD,CAAK,EAAE,OAAO,OAAO;AAAA,EAC1C;AACF,IAEaI,IAAmBC,EAAcxE,CAAO;AAMrD,SAAS2B,EAAUF,GAAwB;AACzC,QAAMf,IAA6B,CAAA,GAC7B+D,IAAc,CAAA,GAEdC,IAAO,CAACC,MAAe;AAC3B,IAAAA,EAAI,QAAQ,CAACC,MAAW;AAEtB,YAAMC,IAAiB;AAAA,QACrB,MAAMD,EAAE;AAAA,QACR,QAAQA,EAAE,UAAUA,EAAE,WAAWA,EAAE;AAAA,QACnC,YAAYA,EAAE,cAAcA,EAAE,gBAAgB;AAAA,QAC9C,UAAU,OAAOA,EAAE,YAAYA,EAAE,aAAa,CAAC;AAAA,QAC/C,OAAOA,EAAE,SAASA,EAAE;AAAA,QACpB,QAAQA,EAAE,UAAUA,EAAE;AAAA,QACtB,UAAUA,EAAE,YAAYA,EAAE;AAAA,MAAA;AAG5B,UAAIA,EAAE,SAAS,KAAK;AAClB,QAAAlE,EAAMmE,EAAK,MAAM,IAAI;AAAA,UACnB,GAAGA;AAAA,UACH,QAAQD,EAAE,UAAUA,EAAE,WAAWA,EAAE,QAAQC,EAAK;AAAA,UAChD,UAAU,CAAA;AAAA,QAAC;AAGb,cAAMT,IAAW,MAAM,QAAQQ,EAAE,QAAQ,IAAIA,EAAE,WAAW,CAAA;AAC1D,QAAAF,EAAKN,CAAQ;AAAA,MACf;AACE,QAAA1D,EAAMmE,EAAK,MAAM,IAAI;AAAA,UACnB,GAAGA;AAAA,UACH,QAAQD,EAAE,UAAUA,EAAE,WAAW;AAAA,UACjC,QAAQA,EAAE,UAAUA,EAAE;AAAA,QAAA;AAAA,IAG5B,CAAC;AAAA,EACH;AAEA,SAAAF,EAAKjD,CAAG,GAGR,OAAO,OAAOf,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,QAAIA,EAAE,cAAcA,EAAE,eAAe,KAAK;AACxC,YAAM2B,IAAIrB,EAAMN,EAAE,UAAU;AAC5B,MAAI2B,GAAG,SAAS,SAAO,SAAS,KAAK3B,EAAE,MAAM;AAAA,IAC/C,MAAA,CAAWA,EAAE,SAAS,OACpBqE,EAAM,KAAKrE,EAAE,MAAM;AAAA,EAEvB,CAAC,GAGDqE,EAAM,KAAK,CAACK,GAAGC,OAAOrE,EAAMoE,CAAC,EAAE,YAAY,MAAMpE,EAAMqE,CAAC,EAAE,YAAY,EAAE,GACxE,OAAO,OAAOrE,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,IAAIA,EAAE,SAAS,OACHA,EACR,SAAS;AAAA,MACT,CAAC4E,GAAGC,OAAOvE,EAAMsE,CAAC,EAAE,YAAY,MAAMtE,EAAMuE,CAAC,EAAE,YAAY;AAAA,IAAA;AAAA,EAGjE,CAAC,GAEM,EAAE,OAAAvE,GAAO,SAAS+D,EAAA;AAC3B;AAEA,SAASxC,EAASX,GAAiB;AACjC,SAAO;AAAA,IACL,GAAGA;AAAA,IACH,OAAO,KAAK,MAAM,KAAK,UAAUA,EAAE,KAAK,CAAC;AAAA,IACzC,SAASA,EAAE,QAAQ,MAAA;AAAA,EAAM;AAE7B;AAEA,SAASa,IAAa;AACpB,SAAO,OAAO,KAAK,SAAS,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AACvD;AAEA,SAASE,EAAUf,GAAqC4D,GAAoB;AAC1E,MAAI,CAACA,KAAYA,MAAa,IAAK,QAAO5D,EAAE,QAAQ;AACpD,QAAMS,IAAIT,EAAE,MAAM4D,CAAQ;AAC1B,SAAOnD,IAAIA,EAAE,SAAS,SAAS;AACjC;AAEA,SAASQ,EAAOjB,GAAUuB,GAAYqC,GAAoB;AACxD,QAAM9E,IAAIkB,EAAE,MAAMuB,CAAM;AACxB,MAAKzC;AAEL,QAAI8E,KAAYA,MAAa,KAAK;AAChC,YAAMnD,IAAIT,EAAE,MAAM4D,CAAQ;AAC1B,UAAI,CAACnD,KAAKA,EAAE,SAAS,IAAK;AAC1B,MAAA3B,EAAE,aAAa8E,GACfnD,EAAE,WAAW,CAAC,GAAGA,EAAE,UAAUc,CAAM;AAAA,IACrC;AACE,MAAAzC,EAAE,aAAa,KACfkB,EAAE,UAAU,CAAC,GAAGA,EAAE,SAASuB,CAAM;AAErC;AAEA,SAASsC,EAAO7D,GAAUuB,GAAY;AACpC,QAAMzC,IAAIkB,EAAE,MAAMuB,CAAM;AACxB,MAAI,CAACzC,EAAG;AACR,QAAMgF,IAAMhF,EAAE;AAEd,MAAIgF,KAAOA,MAAQ,KAAK;AACtB,UAAMrD,IAAIT,EAAE,MAAM8D,CAAG;AACrB,IAAIrD,GAAG,SAAS,QACdA,EAAE,WAAWA,EAAE,SAAS,OAAO,CAACd,MAAMA,MAAM4B,CAAM;AAAA,EAEtD;AACE,IAAAvB,EAAE,UAAUA,EAAE,QAAQ,OAAO,CAACsD,MAAMA,MAAM/B,CAAM;AAEpD;AAEA,SAASS,EAAkBhC,GAAUuB,GAAY;AAC/C,QAAMrC,IAAOc,EAAE,MAAMuB,CAAM;AAC3B,MAAI,CAACrC,EAAM;AACX,EAAIA,EAAK,SAAS,OACEA,EAAoB,SAAS,MAAA,EACtC,QAAQ,CAACQ,MAAQsC,EAAkBhC,GAAGN,CAAG,CAAC,GAErDmE,EAAO7D,GAAGuB,CAAM;AAChB,QAAM,EAAE,CAACA,CAAM,GAAGwC,GAAO,GAAGC,EAAA,IAAShE,EAAE;AACvC,EAAAA,EAAE,QAAQgE;AACZ;AAGA,SAAS1C,EAAgBtB,GAAUY,GAASM,GAAiB;AAC3D,MAAIN,MAAQM,EAAM,QAAOlB;AACzB,QAAMd,IAAOc,EAAE,MAAMY,CAAG;AACxB,MAAI,CAAC1B,EAAM,QAAOc;AAElB,QAAMiE,IAAmB,KAAK,MAAM,KAAK,UAAU/E,CAAI,CAAC;AACxD,EAAA+E,EAAQ,SAAS/C;AAEjB,QAAMgD,IAAgC,EAAE,GAAGlE,EAAE,OAAO,CAACkB,CAAI,GAAG+C,EAAA;AAC5D,SAAOC,EAAStD,CAAG;AAEnB,MAAIuD,IAAanE,EAAE;AACnB,MAAIiE,EAAQ,cAAcA,EAAQ,eAAe,KAAK;AACpD,UAAMxD,IAAIyD,EAASD,EAAQ,UAAU;AACrC,IAAIxD,GAAG,SAAS,QACdyD,EAASD,EAAQ,UAAU,IAAI;AAAA,MAC7B,GAAGxD;AAAA,MACH,UAAUA,EAAE,SAAS,IAAI,CAACd,MAAOA,MAAMiB,IAAMM,IAAOvB,CAAE;AAAA,IAAA;AAAA,EAG5D;AACE,IAAAwE,IAAanE,EAAE,QAAQ,IAAI,CAACsD,MAAOA,MAAM1C,IAAMM,IAAOoC,CAAE;AAG1D,SAAO,EAAE,GAAGtD,GAAG,OAAOkE,GAAU,SAASC,EAAA;AAC3C;AAEA,SAAS1B,EAAoBzC,GAAgD;AAC3E,SAAOA,EAAE,QAAQ,KAAK,CAACjB,MAAOiB,EAAE,MAAMjB,CAAE,GAAG,SAAS,GAAG,KAAK;AAC9D;AAEA,SAASwB,EAAoBnB,GAA4BC,GAAe;AACtE,QAAM+E,IAA6C,CAAA;AACnD,SAAO,OAAOhF,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,UAAMC,IAAKD,EAAE,QACPgF,IAAMhF,EAAE;AACd,IAAI,CAACC,KAAM,CAAC+E,KAAOA,MAAQ,OAAOA,MAAQ/E,MACzCqF,EAAiBN,CAAG,MAAM,CAAA,GAAI,KAAK/E,CAAE;AAAA,EACxC,CAAC;AAED,QAAMsF,wBAAe,IAAA,GAEfxB,IAAQ,CAAC9D,MAAgB;AAC7B,QAAIsF,EAAS,IAAItF,CAAE,EAAG,QAAO;AAC7B,UAAMD,IAAIM,EAAML,CAAE;AAClB,QAAI,CAACD,EAAG,QAAO;AAEf,IAAAuF,EAAS,IAAItF,CAAE;AACf,QAAI;AACF,UAAID,EAAE,SAAS,KAAK;AAClB,cAAMc,IAAId,GACJwF,IAAWF,EAAiBrF,CAAE,KAAK,CAAA;AACzC,eAAO;AAAA,UACL,MAAM;AAAA,UACN,QAAQA;AAAA,UACR,QAAQa,EAAE;AAAA,UACV,YAAYA,EAAE;AAAA,UACd,UAAU0E,EAAS,IAAIzB,CAAK,EAAE,OAAO,OAAO;AAAA,QAAA;AAAA,MAEhD;AACA,YAAME,IAAIjE;AAEV,aAAO;AAAA,QACL,MAAM;AAAA,QACN,QAAQC;AAAA,QACR,QAAQgE,EAAE;AAAA,QACV,QAAQA,EAAE;AAAA,QACV,QAAQA,EAAE;AAAA,QACV,YAAYA,EAAE;AAAA,MAAA;AAAA,IAElB,UAAA;AACE,MAAAsB,EAAS,OAAOtF,CAAE;AAAA,IACpB;AAAA,EACF,GAEMwF,IAAc,OAAO,OAAOnF,CAAK,EACpC,OAAO,CAACN,MAAMA,EAAE,eAAe,OAAOA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACA,MAAMA,EAAE,MAAM,GAEhB0F,IAAgB,OAAO,OAAOpF,CAAK,EACtC,OAAO,CAACN,MAAMA,EAAE,eAAe,OAAOA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACA,MAAMA,EAAE,MAAM;AAKtB,SAHiB,MAAM;AAAA,IACrB,oBAAI,IAAI,CAAC,GAAGO,GAAS,GAAGkF,GAAa,GAAGC,CAAa,CAAC;AAAA,EAAA,EAExC,IAAI3B,CAAK,EAAE,OAAO,OAAO;AAC3C;AAEA,SAAS7D,EACPI,GACAP,GACW;AACX,aAAWC,KAAK,OAAO,OAAOM,CAAK;AACjC,QAAIN,EAAE,SAAS,OAAQA,EAAe,WAAWD,UAAeC,EAAE;AAEpE,SAAO;AACT;AAEA,SAASiD,EACP3C,GACAC,GACAuE,GACA;AAKA,GAHE,CAACA,KAAYA,MAAa,MACtBvE,IACCD,EAAMwE,CAAQ,EAAiB,YAAY,CAAA,GACzC,QAAQ,CAACa,GAAK5C,MAAQ;AAC7B,UAAM/C,IAAIM,EAAMqF,CAAG;AACnB,IAAK3F,MACLA,EAAE,WAAW+C;AAAA,EACf,CAAC;AACH;"}
+{"version":3,"file":"favoriteStore-Cemc-26t.js","sources":["../../src/stores/favoriteStore.ts"],"sourcesContent":["// -------------------------------------------------------\r\n// 즐겨찾기(폴더형) Zustand Store (단일 테이블 CM_BKMK_MSTR 기반)\r\n// 공통 CRUD로 통합: addNode / moveNode / removeNode / editNode\r\n// 기존 API(폴더/메뉴 전용)는 호환용으로 래핑만 유지\r\n// - 정규화(nodes + rootIds)\r\n// - 낙관적 업데이트 + 임시ID(tmp_* → 서버ID) 스왑\r\n// - 필수 기능: 로드, 생성, 이동, 삭제, 수정 + 셀렉터/뷰 변환\r\n// -------------------------------------------------------\r\n\r\nimport { callService } from \"../utils/apiUtils\";\r\nimport { getUserId } from \"../utils/userUtils\";\r\nimport { DataNode } from \"antd/es/tree\";\r\nimport { create, StateCreator } from \"zustand\";\r\n\r\n// 🔧 공통 ID 타입\r\nexport type Id = string;\r\n\r\n/** 공통 베이스 (CM_BKMK_MSTR 매핑) */\r\nexport type BkmkBase = {\r\n  type: \"F\" | \"M\"; // TYPE\r\n  bkmkId: Id; // BKMK_ID\r\n  prntBkmkId: Id | \"-\"; // PRNT_BKMK_ID ('-'=루트)\r\n  sortOrdr: number; // SORT_ORDR\r\n  sysCd?: string; // SYS_CD (옵션)\r\n  userId?: string | null; // USER_ID (옵션)\r\n  fullPath?: string; // 프론트 보조(옵션)\r\n};\r\n\r\n/** 폴더 노드 (BKMK_NM 사용) */\r\nexport type FolderNode = BkmkBase & {\r\n  bkmkNm: string; // BKMK_NM (폴더 전용)\r\n  children: Id[]; // 폴더/아이템 혼재(정규화용)\r\n};\r\n\r\n/** 아이템 노드 (메뉴 전용 메타) */\r\nexport type ItemNode = BkmkBase & {\r\n  menuId: string; // MENU_ID\r\n  menuNm?: string; // 프론트 보조(메뉴명)\r\n};\r\n\r\nexport type FavNode = FolderNode | ItemNode;\r\n\r\nexport type MovePayload = {\r\n  bkmkId: Id;\r\n  newPrntBkmkId: Id | \"-\";\r\n  sortOrdr: number; // 새 부모 내 0-based\r\n  userId: string | null;\r\n};\r\n\r\nexport type AddNodePayload = {\r\n  type: \"F\" | \"M\";\r\n  prntBkmkId: Id | \"-\";\r\n  sysCd: string;\r\n  userId: string | null;\r\n  bkmkNm?: string; // F 전용\r\n  menuId?: string; // M 전용\r\n  menuNm?: string; // 프론트 보조\r\n  sortOrdr?: number; // 선택: 지정 없으면 tailIndex 사용\r\n};\r\n\r\nexport type EditNodePayload = {\r\n  bkmkId: Id;\r\n  userId: string;\r\n  bkmkNm?: string; // F일 때만 의미\r\n  prntBkmkId?: Id | \"-\"; // 선택(이동은 moveNode 권장)\r\n  sortOrdr?: number; // 선택\r\n};\r\n\r\nexport type Normalized = { nodes: Record<Id, FavNode>; rootIds: Id[] };\r\n\r\nexport type State = {\r\n  // ========== 데이터(정규화) ==========\r\n  nodes: Record<Id, FavNode>;\r\n  rootIds: Id[];\r\n  treeNodes: FavNode[]; // 단순 트리(뷰용)\r\n\r\n  // ========== 메타 ==========\r\n  loadedFor?: string;\r\n  loading: boolean;\r\n  error?: string;\r\n\r\n  // ========== 셀렉터 ==========\r\n  isMenuBookmarked: (menuId: string) => boolean;\r\n  getPrntBkmkIdByMenuId: (menuId: string) => Id | \"-\";\r\n  getNodeByMenuId: (menuId: string) => ItemNode | null;\r\n  getFolderTree: (q?: string) => DataNode[]; // 폴더만 Tree (검색 필터)\r\n\r\n  // ========== 로더 ==========\r\n  loadFavorites: (userId: string, force?: boolean) => Promise<void>;\r\n  loadFavoritesIfNeeded: (userId: string) => Promise<void>;\r\n\r\n  // ========== 공통 CRUD ==========\r\n  addNode: (p: AddNodePayload) => Promise<Id>;\r\n  moveNode: (p: MovePayload) => Promise<void>;\r\n  removeNode: (bkmkId: Id) => Promise<void>;\r\n  editNode: (p: EditNodePayload) => Promise<void>;\r\n\r\n  // ========== 호환용(기존 API 유지, 내부에서 공통 호출) ==========\r\n  addFolder: (\r\n    bkmkNm: string,\r\n    prntBkmkId: Id | \"-\",\r\n    sysCd: string,\r\n    userId: string | null\r\n  ) => Promise<Id>;\r\n  addMenuToFolder: (\r\n    folderBkmkId: Id,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<Id | string>;\r\n  toggleMenuFavorite: (\r\n    userId: string | null,\r\n    menu: { menuId: string; menuNm: string }\r\n  ) => Promise<void>;\r\n  removeMenu: (bkmkId: Id) => Promise<void>;\r\n  removeMenuByMenuId: (menuId: string) => Promise<void>;\r\n  removeFolder: (folderBkmkId: Id) => Promise<void>;\r\n  editFolder: (\r\n    folderBkmkId: Id,\r\n    userId: string | null,\r\n    newBkmkNm?: string,\r\n    prntBkmkId?: Id | \"-\",\r\n    sortOrdr?: number\r\n  ) => Promise<void>;\r\n  convertToAntTreeData: (\r\n    nodesMap: Record<string, FavNode>,\r\n    rootIds: string[],\r\n    q: string,\r\n    onlyFolder?: boolean\r\n  ) => any[];\r\n};\r\n\r\nconst creator: StateCreator<State> = (set, get) => ({\r\n  nodes: {},\r\n  rootIds: [],\r\n  loadedFor: undefined,\r\n  loading: false,\r\n  error: undefined,\r\n  treeNodes: [],\r\n\r\n  // ====== 셀렉터 ======\r\n  isMenuBookmarked: (menuId) =>\r\n    Object.values(get().nodes).some(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menuId\r\n    ),\r\n  getPrntBkmkIdByMenuId: (menuId) => {\r\n    const id = findItemByMenuId(get().nodes, menuId);\r\n    return id ? get().nodes[id]?.prntBkmkId ?? \"-\" : \"-\";\r\n  },\r\n\r\n  getNodeByMenuId: (menuId) => {\r\n    const nodeId = findItemByMenuId(get().nodes, menuId);\r\n    if (!nodeId) return null;\r\n    const node = get().nodes[nodeId];\r\n    return node?.type === \"M\" ? (node as ItemNode) : null;\r\n  },\r\n\r\n  getFolderTree: (q) => {\r\n    const { nodes, rootIds } = get();\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const make = (id: Id): DataNode | null => {\r\n      const n = nodes[id];\r\n      if (!n || n.type !== \"F\") return null;\r\n      const folder = n as FolderNode;\r\n\r\n      const kids = (folder.children || [])\r\n        .map((cid) => nodes[cid])\r\n        .filter((c): c is FolderNode => !!c && c.type === \"F\")\r\n        .map((f) => make(f.bkmkId))\r\n        .filter(Boolean) as DataNode[];\r\n\r\n      const visible = match(folder.bkmkNm) || kids.length > 0;\r\n      if (!visible) return null;\r\n\r\n      return {\r\n        key: folder.bkmkId,\r\n        title: `📁 ${folder.bkmkNm}`,\r\n        children: kids.length ? kids : undefined,\r\n      };\r\n    };\r\n\r\n    return rootIds.map((rid) => make(rid)).filter(Boolean) as DataNode[];\r\n  },\r\n\r\n  // ====== 로더 ======\r\n  loadFavorites: async (userId, force = false) => {\r\n    console.log(\"loadFavorites ::::: \", userId, force);\r\n    const s = get();\r\n    if (!force && s.loadedFor === userId && Object.keys(s.nodes).length) return;\r\n\r\n    set({ loading: true, error: undefined });\r\n    try {\r\n      // 기대 응답 예시: { sub: rawTree[] }\r\n      const res = await callService(\"SCMBKMK00101\", { userId });\r\n      const raw: any[] = Array.isArray(res?.sub) ? res.sub : [];\r\n      const normalized = normalize(raw);\r\n\r\n      const treeNodes = toSimpleTreeFromMap(\r\n        normalized.nodes,\r\n        normalized.rootIds\r\n      );\r\n\r\n      set({\r\n        ...normalized,\r\n        treeNodes,\r\n        loadedFor: userId,\r\n        loading: false,\r\n      });\r\n    } catch (e: any) {\r\n      set({ loading: false, error: e?.message || \"즐겨찾기 로드 실패\" });\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  loadFavoritesIfNeeded: async (userId) => {\r\n    const s = get();\r\n    const notLoaded =\r\n      s.loadedFor !== userId || Object.keys(s.nodes).length === 0;\r\n    if (notLoaded) {\r\n      await get().loadFavorites(userId);\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 생성 ======\r\n  addNode: async (p) => {\r\n    const prev = snapshot(get());\r\n    const tmp = tempId();\r\n\r\n    // 1) 낙관적 반영\r\n    set((s) => {\r\n      const sort = p.sortOrdr ?? tailIndex(s, p.prntBkmkId);\r\n      const next: State = {\r\n        ...s,\r\n        nodes: {\r\n          ...s.nodes,\r\n          [tmp]:\r\n            p.type === \"F\"\r\n              ? ({\r\n                  bkmkId: tmp,\r\n                  type: \"F\",\r\n                  prntBkmkId: p.prntBkmkId || \"-\",\r\n                  sortOrdr: sort,\r\n                  bkmkNm: p.bkmkNm ?? \"새 폴더\",\r\n                  children: [],\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as FolderNode)\r\n              : ({\r\n                  bkmkId: tmp,\r\n                  type: \"M\",\r\n                  prntBkmkId: p.prntBkmkId,\r\n                  sortOrdr: sort,\r\n                  menuId: p.menuId ?? \"\",\r\n                  menuNm: p.menuNm,\r\n                  sysCd: p.sysCd,\r\n                  userId: p.userId,\r\n                } as ItemNode),\r\n        },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      attach(next, tmp, p.prntBkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      // 2) 서버 호출\r\n      // 백엔드는 통합 IUD가 아닐 수 있으므로, 호환 분기 적용\r\n      let real: string = tmp;\r\n      const sortForServer = tailIndex(get(), p.prntBkmkId);\r\n      const res = await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"I\",\r\n        type: p.type,\r\n        sysCd: p.sysCd,\r\n        userId: p.userId,\r\n        bkmkId: tmp, // 서버 새 ID 반환 시 매칭용\r\n        bkmkNm: p.bkmkNm,\r\n        prntBkmkId: p.prntBkmkId,\r\n        menuId: p.menuId,\r\n        sortOrdr: sortForServer,\r\n        chngId: getUserId(),\r\n      });\r\n      real = String(res?.bkmkId ?? res?.itemId ?? tmp);\r\n\r\n      // 3) tmp → real 스왑\r\n      set((s) => {\r\n        const swapped = idSwapImmutable(s, tmp, real);\r\n        return {\r\n          ...swapped,\r\n          treeNodes: toSimpleTreeFromMap(swapped.nodes, swapped.rootIds),\r\n        };\r\n      });\r\n      return real;\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 이동 ======\r\n  moveNode: async ({ bkmkId, newPrntBkmkId, sortOrdr, userId }) => {\r\n    const prev = get(); // 함수 포함 스냅샷(rollback 용으로 set(prev) 사용)\r\n\r\n    const nodes = structuredClone(prev.nodes);\r\n    const rootIds = [...prev.rootIds];\r\n\r\n    const node = nodes[bkmkId];\r\n    if (!node) return;\r\n\r\n    // 부모는 반드시 폴더만 허용\r\n    if (newPrntBkmkId !== \"-\") {\r\n      const parent = nodes[newPrntBkmkId];\r\n      if (!parent || parent.type !== \"F\")\r\n        throw new Error(\"부모는 폴더만 가능합니다.\");\r\n    }\r\n\r\n    const oldParentId = node.prntBkmkId ?? \"-\";\r\n\r\n    const removeFrom =\r\n      oldParentId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[oldParentId] as FolderNode).children ||= []);\r\n    {\r\n      const idx = removeFrom.indexOf(bkmkId);\r\n      if (idx >= 0) removeFrom.splice(idx, 1);\r\n    }\r\n\r\n    const insertTo =\r\n      newPrntBkmkId === \"-\"\r\n        ? rootIds\r\n        : ((nodes[newPrntBkmkId] as FolderNode).children ||= []);\r\n    insertTo.splice(\r\n      Math.max(0, Math.min(sortOrdr, insertTo.length)),\r\n      0,\r\n      bkmkId\r\n    );\r\n\r\n    node.prntBkmkId = newPrntBkmkId as Id;\r\n    set({ nodes, rootIds });\r\n    _resequence(nodes, rootIds, newPrntBkmkId);\r\n    _resequence(nodes, rootIds, oldParentId);\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00104\", {\r\n        // 백엔드 명칭 호환\r\n        bkmkId,\r\n        prntBkmkId: newPrntBkmkId,\r\n        sortOrdr,\r\n        chngId: userId,\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 삭제 ======\r\n  removeNode: async (bkmkId) => {\r\n    const prev = snapshot(get());\r\n\r\n    set((s) => {\r\n      if (!s.nodes[bkmkId]) return s as State;\r\n      const next: State = {\r\n        ...s,\r\n        nodes: { ...s.nodes },\r\n        rootIds: s.rootIds.slice(),\r\n        treeNodes: s.treeNodes,\r\n      };\r\n      removeRecursively(next, bkmkId);\r\n      next.treeNodes = toSimpleTreeFromMap(next.nodes, next.rootIds);\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00103\", { bkmkId });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 공통: 수정 ======\r\n  editNode: async ({ bkmkId, userId, bkmkNm, prntBkmkId, sortOrdr }) => {\r\n    const prev = snapshot(get());\r\n\r\n    // 폴더명 변경만 프런트 즉시 반영(옵션)\r\n    set((s) => {\r\n      const next = { ...s, nodes: { ...s.nodes } } as State;\r\n      const target = next.nodes[bkmkId] as FavNode | undefined;\r\n      if (target?.type === \"F\" && typeof bkmkNm === \"string\") {\r\n        next.nodes[bkmkId] = {\r\n          ...(target as FolderNode),\r\n          bkmkNm,\r\n        } as FolderNode;\r\n      }\r\n      return next;\r\n    });\r\n\r\n    try {\r\n      await callService(\"SCMBKMK00102\", {\r\n        iudFlag: \"U\",\r\n        userId,\r\n        bkmkId,\r\n        bkmkNm,\r\n        prntBkmkId,\r\n        sortOrdr,\r\n        chngId: getUserId(),\r\n      });\r\n    } catch (e) {\r\n      set(prev);\r\n      throw e;\r\n    }\r\n  },\r\n\r\n  // ====== 호환용 래퍼 ======\r\n  addFolder: async (bkmkNm, prntBkmkId, sysCd, userId) => {\r\n    return await get().addNode({\r\n      type: \"F\",\r\n      bkmkNm,\r\n      prntBkmkId,\r\n      sysCd,\r\n      userId,\r\n    });\r\n  },\r\n\r\n  addMenuToFolder: async (folderBkmkId, menu) => {\r\n    // 전역 중복 방지\r\n    const dup = findItemByMenuId(get().nodes, menu.menuId);\r\n    if (dup) return \"이미 북마크에 저장된 메뉴입니다.\";\r\n    return await get().addNode({\r\n      type: \"M\",\r\n      prntBkmkId: folderBkmkId,\r\n      sysCd: \"KH\",\r\n      userId: getUserId(),\r\n      menuId: menu.menuId,\r\n      menuNm: menu.menuNm,\r\n    });\r\n  },\r\n\r\n  toggleMenuFavorite: async (userId, menu) => {\r\n    const s = get();\r\n    const exists = Object.values(s.nodes).find(\r\n      (n) => n.type === \"M\" && (n as ItemNode).menuId === menu.menuId\r\n    );\r\n    if (exists) {\r\n      await get().removeNode(exists.bkmkId);\r\n      return;\r\n    }\r\n\r\n    let folderId = pickDefaultFolderId(s);\r\n    if (!folderId) {\r\n      await get().loadFavorites(userId, true);\r\n      folderId = pickDefaultFolderId(get());\r\n    }\r\n    if (folderId) {\r\n      await get().addNode({\r\n        type: \"M\",\r\n        prntBkmkId: folderId,\r\n        sysCd: \"KH\",\r\n        userId: getUserId(),\r\n        menuId: menu.menuId,\r\n        menuNm: menu.menuNm,\r\n      });\r\n    }\r\n  },\r\n\r\n  removeMenuByMenuId: async (menuId) => {\r\n    const s = get();\r\n    const bkmkId = findItemByMenuId(s.nodes, menuId);\r\n    if (bkmkId) await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeMenu: async (bkmkId) => {\r\n    await get().removeNode(bkmkId);\r\n  },\r\n\r\n  removeFolder: async (folderBkmkId) => {\r\n    await get().removeNode(folderBkmkId);\r\n  },\r\n\r\n  editFolder: async (folderBkmkId, userId, newBkmkNm, prntBkmkId, sortOrdr) => {\r\n    await get().editNode({\r\n      bkmkId: folderBkmkId,\r\n      userId,\r\n      bkmkNm: newBkmkNm,\r\n      prntBkmkId,\r\n      sortOrdr,\r\n    });\r\n  },\r\n\r\n  /** Ant Tree 데이터 변환 (검색 포함) */\r\n  convertToAntTreeData: (nodesMap, rootIds, q, onlyFolder = false) => {\r\n    const match = (s: string) =>\r\n      q ? s.toLowerCase().includes(q.toLowerCase()) : true;\r\n\r\n    const build = (id: string): any | null => {\r\n      const n = nodesMap[id];\r\n      if (!n) return null;\r\n\r\n      if (onlyFolder && n.type !== \"F\") return null;\r\n\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const children = (f.children || [])\r\n          .map((cid) => build(cid))\r\n          .filter(Boolean);\r\n        const visible = match(f.bkmkNm) || children.length > 0;\r\n        if (!visible) return null;\r\n        return {\r\n          key: f.bkmkId,\r\n          type: \"F\",\r\n          title: `📁 ${f.bkmkNm}`,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          sortOrdr: f.sortOrdr,\r\n          fullPath: f.fullPath,\r\n          children: children.length ? children : undefined,\r\n        };\r\n      } else {\r\n        const i = n as ItemNode;\r\n        const label = i.menuNm ? `${i.menuNm} (${i.menuId})` : i.menuId;\r\n        const visible = match(label);\r\n        if (!visible) return null;\r\n        return {\r\n          key: i.bkmkId,\r\n          type: \"M\",\r\n          title: `📄 ${label}`,\r\n          prntBkmkId: i.prntBkmkId,\r\n          sortOrdr: i.sortOrdr,\r\n          fullPath: i.fullPath,\r\n          isLeaf: true,\r\n        };\r\n      }\r\n    };\r\n\r\n    return rootIds.map(build).filter(Boolean);\r\n  },\r\n});\r\n\r\nexport const useFavoriteStore = create<State>(creator);\r\n\r\n// ===================================================================\r\n// Helpers\r\n// ===================================================================\r\n\r\nfunction normalize(raw: any[]): Normalized {\r\n  const nodes: Record<Id, FavNode> = {};\r\n  const roots: Id[] = [];\r\n\r\n  const walk = (arr: any[]) => {\r\n    arr.forEach((r: any) => {\r\n      // 서버 raw 필드: TYPE, BKMK_ID, PRNT_BKMK_ID, SORT_ORDR, BKMK_NM, MENU_ID, FULL_PATH?\r\n      const base: BkmkBase = {\r\n        type: r.type,\r\n        bkmkId: r.bkmkId ?? r.BKMK_ID ?? r.id,\r\n        prntBkmkId: r.prntBkmkId ?? r.PRNT_BKMK_ID ?? \"-\",\r\n        sortOrdr: Number(r.sortOrdr ?? r.SORT_ORDR ?? 0),\r\n        sysCd: r.sysCd ?? r.SYS_CD,\r\n        userId: r.userId ?? r.USER_ID,\r\n        fullPath: r.fullPath ?? r.FULL_PATH,\r\n      };\r\n\r\n      if (r.type === \"F\") {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          bkmkNm: r.bkmkNm ?? r.BKMK_NM ?? r.name ?? base.bkmkId,\r\n          children: [],\r\n        } as FolderNode;\r\n\r\n        const children = Array.isArray(r.children) ? r.children : [];\r\n        walk(children);\r\n      } else {\r\n        nodes[base.bkmkId] = {\r\n          ...base,\r\n          menuId: r.menuId ?? r.MENU_ID ?? \"\",\r\n          menuNm: r.menuNm ?? r.MENU_NM,\r\n        } as ItemNode;\r\n      }\r\n    });\r\n  };\r\n\r\n  walk(raw);\r\n\r\n  // children / rootIds 구성\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.prntBkmkId && n.prntBkmkId !== \"-\") {\r\n      const p = nodes[n.prntBkmkId] as FolderNode;\r\n      if (p?.type === \"F\") p.children.push(n.bkmkId);\r\n    } else if (n.type === \"F\") {\r\n      roots.push(n.bkmkId);\r\n    }\r\n  });\r\n\r\n  // 정렬 인덱스 보정(안전)\r\n  roots.sort((a, b) => (nodes[a].sortOrdr ?? 0) - (nodes[b].sortOrdr ?? 0));\r\n  Object.values(nodes).forEach((n) => {\r\n    if (n.type === \"F\") {\r\n      const f = n as FolderNode;\r\n      f.children.sort(\r\n        (A, B) => (nodes[A].sortOrdr ?? 0) - (nodes[B].sortOrdr ?? 0)\r\n      );\r\n    }\r\n  });\r\n\r\n  return { nodes, rootIds: roots };\r\n}\r\n\r\nfunction snapshot(s: State): State {\r\n  return {\r\n    ...s,\r\n    nodes: JSON.parse(JSON.stringify(s.nodes)),\r\n    rootIds: s.rootIds.slice(),\r\n  };\r\n}\r\n\r\nfunction tempId(): Id {\r\n  return `tmp_${Math.random().toString(36).slice(2, 10)}`;\r\n}\r\n\r\nfunction tailIndex(s: Pick<State, \"nodes\" | \"rootIds\">, parentId: Id | \"-\") {\r\n  if (!parentId || parentId === \"-\") return s.rootIds.length;\r\n  const p = s.nodes[parentId] as FolderNode | undefined;\r\n  return p ? p.children.length : 0;\r\n}\r\n\r\nfunction attach(s: State, bkmkId: Id, parentId: Id | \"-\") {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n\r\n  if (parentId && parentId !== \"-\") {\r\n    const p = s.nodes[parentId] as FolderNode | undefined;\r\n    if (!p || p.type !== \"F\") return;\r\n    n.prntBkmkId = parentId;\r\n    p.children = [...p.children, bkmkId];\r\n  } else {\r\n    n.prntBkmkId = \"-\";\r\n    s.rootIds = [...s.rootIds, bkmkId];\r\n  }\r\n}\r\n\r\nfunction detach(s: State, bkmkId: Id) {\r\n  const n = s.nodes[bkmkId];\r\n  if (!n) return;\r\n  const pid = n.prntBkmkId;\r\n\r\n  if (pid && pid !== \"-\") {\r\n    const p = s.nodes[pid] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      p.children = p.children.filter((c) => c !== bkmkId);\r\n    }\r\n  } else {\r\n    s.rootIds = s.rootIds.filter((r) => r !== bkmkId);\r\n  }\r\n}\r\n\r\nfunction removeRecursively(s: State, bkmkId: Id) {\r\n  const node = s.nodes[bkmkId];\r\n  if (!node) return;\r\n  if (node.type === \"F\") {\r\n    const children = (node as FolderNode).children.slice();\r\n    children.forEach((cid) => removeRecursively(s, cid));\r\n  }\r\n  detach(s, bkmkId);\r\n  const { [bkmkId]: _omit, ...rest } = s.nodes as Record<string, FavNode>;\r\n  s.nodes = rest;\r\n}\r\n\r\n/** 임시ID → 실제ID 스왑 (불변성 유지) */\r\nfunction idSwapImmutable(s: State, tmp: Id, real: Id): State {\r\n  if (tmp === real) return s;\r\n  const node = s.nodes[tmp];\r\n  if (!node) return s;\r\n\r\n  const newNode: FavNode = JSON.parse(JSON.stringify(node));\r\n  newNode.bkmkId = real;\r\n\r\n  const newNodes: Record<Id, FavNode> = { ...s.nodes, [real]: newNode };\r\n  delete newNodes[tmp];\r\n\r\n  let newRootIds = s.rootIds;\r\n  if (newNode.prntBkmkId && newNode.prntBkmkId !== \"-\") {\r\n    const p = newNodes[newNode.prntBkmkId] as FolderNode | undefined;\r\n    if (p?.type === \"F\") {\r\n      newNodes[newNode.prntBkmkId] = {\r\n        ...p,\r\n        children: p.children.map((c) => (c === tmp ? real : c)),\r\n      } as FolderNode;\r\n    }\r\n  } else {\r\n    newRootIds = s.rootIds.map((r) => (r === tmp ? real : r));\r\n  }\r\n\r\n  return { ...s, nodes: newNodes, rootIds: newRootIds };\r\n}\r\n\r\nfunction pickDefaultFolderId(s: Pick<State, \"nodes\" | \"rootIds\">): Id | null {\r\n  return s.rootIds.find((id) => s.nodes[id]?.type === \"F\") ?? null;\r\n}\r\n\r\nfunction toSimpleTreeFromMap(nodes: Record<Id, FavNode>, rootIds: Id[]) {\r\n  const childrenByParent: Record<string, string[]> = {};\r\n  Object.values(nodes).forEach((n) => {\r\n    const id = n.bkmkId;\r\n    const pid = n.prntBkmkId;\r\n    if (!id || !pid || pid === \"-\" || pid === id) return;\r\n    (childrenByParent[pid] ??= []).push(id);\r\n  });\r\n\r\n  const visiting = new Set<string>();\r\n\r\n  const build = (id: Id): any => {\r\n    if (visiting.has(id)) return null;\r\n    const n = nodes[id];\r\n    if (!n) return null;\r\n\r\n    visiting.add(id);\r\n    try {\r\n      if (n.type === \"F\") {\r\n        const f = n as FolderNode;\r\n        const childIds = childrenByParent[id] ?? [];\r\n        return {\r\n          type: \"F\",\r\n          bkmkId: id,\r\n          bkmkNm: f.bkmkNm,\r\n          prntBkmkId: f.prntBkmkId,\r\n          children: childIds.map(build).filter(Boolean),\r\n        };\r\n      }\r\n      const i = n as ItemNode;\r\n\r\n      return {\r\n        type: \"M\",\r\n        bkmkId: id,\r\n        bkmkNm: i.menuNm,\r\n        menuId: i.menuId,\r\n        menuNm: i.menuNm,\r\n        prntBkmkId: i.prntBkmkId,\r\n      };\r\n    } finally {\r\n      visiting.delete(id);\r\n    }\r\n  };\r\n\r\n  const rootMenuIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"M\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootFolderIds = Object.values(nodes)\r\n    .filter((n) => n.prntBkmkId === \"-\" && n.type === \"F\")\r\n    .map((n) => n.bkmkId);\r\n\r\n  const rootKeys = Array.from(\r\n    new Set([...rootIds, ...rootMenuIds, ...rootFolderIds])\r\n  );\r\n  return rootKeys.map(build).filter(Boolean);\r\n}\r\n\r\nfunction findItemByMenuId(\r\n  nodes: Record<Id, FavNode>,\r\n  menuId: string\r\n): Id | null {\r\n  for (const n of Object.values(nodes)) {\r\n    if (n.type === \"M\" && (n as ItemNode).menuId === menuId) return n.bkmkId;\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction _resequence(\r\n  nodes: Record<Id, FavNode>,\r\n  rootIds: Id[],\r\n  parentId: Id | \"-\"\r\n) {\r\n  const siblings: Id[] =\r\n    !parentId || parentId === \"-\"\r\n      ? rootIds\r\n      : (nodes[parentId] as FolderNode).children || [];\r\n  siblings.forEach((sid, idx) => {\r\n    const n = nodes[sid];\r\n    if (!n) return;\r\n    n.sortOrdr = idx;\r\n  });\r\n}\r\n"],"names":["creator","set","get","menuId","n","id","findItemByMenuId","nodeId","node","q","nodes","rootIds","match","make","folder","kids","cid","c","f","rid","userId","force","s","res","callService","raw","normalized","normalize","treeNodes","toSimpleTreeFromMap","e","p","prev","snapshot","tmp","tempId","sort","tailIndex","next","attach","real","sortForServer","getUserId","swapped","idSwapImmutable","bkmkId","newPrntBkmkId","sortOrdr","parent","oldParentId","removeFrom","idx","insertTo","_resequence","removeRecursively","bkmkNm","prntBkmkId","target","sysCd","folderBkmkId","menu","exists","folderId","pickDefaultFolderId","newBkmkNm","nodesMap","onlyFolder","build","children","i","label","useFavoriteStore","create","roots","walk","arr","r","base","a","b","A","B","parentId","detach","pid","_omit","rest","newNode","newNodes","newRootIds","childrenByParent","visiting","childIds","rootMenuIds","rootFolderIds","sid"],"mappings":";;AAkIA,MAAMA,IAA+B,CAACC,GAAKC,OAAS;AAAA,EAClD,OAAO,CAAA;AAAA,EACP,SAAS,CAAA;AAAA,EACT,WAAW;AAAA,EACX,SAAS;AAAA,EACT,OAAO;AAAA,EACP,WAAW,CAAA;AAAA;AAAA,EAGX,kBAAkB,CAACC,MACjB,OAAO,OAAOD,EAAA,EAAM,KAAK,EAAE;AAAA,IACzB,CAACE,MAAMA,EAAE,SAAS,OAAQA,EAAe,WAAWD;AAAA,EAAA;AAAA,EAExD,uBAAuB,CAACA,MAAW;AACjC,UAAME,IAAKC,EAAiBJ,EAAA,EAAM,OAAOC,CAAM;AAC/C,WAAOE,IAAKH,IAAM,MAAMG,CAAE,GAAG,cAAc,MAAM;AAAA,EACnD;AAAA,EAEA,iBAAiB,CAACF,MAAW;AAC3B,UAAMI,IAASD,EAAiBJ,EAAA,EAAM,OAAOC,CAAM;AACnD,QAAI,CAACI,EAAQ,QAAO;AACpB,UAAMC,IAAON,IAAM,MAAMK,CAAM;AAC/B,WAAOC,GAAM,SAAS,MAAOA,IAAoB;AAAA,EACnD;AAAA,EAEA,eAAe,CAACC,MAAM;AACpB,UAAM,EAAE,OAAAC,GAAO,SAAAC,EAAA,IAAYT,EAAA,GACrBU,IAAQ,CAAC,MACbH,IAAI,EAAE,YAAA,EAAc,SAASA,EAAE,YAAA,CAAa,IAAI,IAE5CI,IAAO,CAACR,MAA4B;AACxC,YAAMD,IAAIM,EAAML,CAAE;AAClB,UAAI,CAACD,KAAKA,EAAE,SAAS,IAAK,QAAO;AACjC,YAAMU,IAASV,GAETW,KAAQD,EAAO,YAAY,CAAA,GAC9B,IAAI,CAACE,MAAQN,EAAMM,CAAG,CAAC,EACvB,OAAO,CAACC,MAAuB,CAAC,CAACA,KAAKA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACC,MAAML,EAAKK,EAAE,MAAM,CAAC,EACzB,OAAO,OAAO;AAGjB,aADgBN,EAAME,EAAO,MAAM,KAAKC,EAAK,SAAS,IAG/C;AAAA,QACL,KAAKD,EAAO;AAAA,QACZ,OAAO,MAAMA,EAAO,MAAM;AAAA,QAC1B,UAAUC,EAAK,SAASA,IAAO;AAAA,MAAA,IALZ;AAAA,IAOvB;AAEA,WAAOJ,EAAQ,IAAI,CAACQ,MAAQN,EAAKM,CAAG,CAAC,EAAE,OAAO,OAAO;AAAA,EACvD;AAAA;AAAA,EAGA,eAAe,OAAOC,GAAQC,IAAQ,OAAU;AAC9C,YAAQ,IAAI,wBAAwBD,GAAQC,CAAK;AACjD,UAAMC,IAAIpB,EAAA;AACV,QAAI,GAACmB,KAASC,EAAE,cAAcF,KAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,SAE7D;AAAA,MAAArB,EAAI,EAAE,SAAS,IAAM,OAAO,QAAW;AACvC,UAAI;AAEF,cAAMsB,IAAM,MAAMC,EAAY,gBAAgB,EAAE,QAAAJ,GAAQ,GAClDK,IAAa,MAAM,QAAQF,GAAK,GAAG,IAAIA,EAAI,MAAM,CAAA,GACjDG,IAAaC,EAAUF,CAAG,GAE1BG,IAAYC;AAAA,UAChBH,EAAW;AAAA,UACXA,EAAW;AAAA,QAAA;AAGb,QAAAzB,EAAI;AAAA,UACF,GAAGyB;AAAA,UACH,WAAAE;AAAA,UACA,WAAWR;AAAA,UACX,SAAS;AAAA,QAAA,CACV;AAAA,MACH,SAASU,GAAQ;AACf,cAAA7B,EAAI,EAAE,SAAS,IAAO,OAAO6B,GAAG,WAAW,cAAc,GACnDA;AAAA,MACR;AAAA;AAAA,EACF;AAAA,EAEA,uBAAuB,OAAOV,MAAW;AACvC,UAAME,IAAIpB,EAAA;AAGV,KADEoB,EAAE,cAAcF,KAAU,OAAO,KAAKE,EAAE,KAAK,EAAE,WAAW,MAE1D,MAAMpB,EAAA,EAAM,cAAckB,CAAM;AAAA,EAEpC;AAAA;AAAA,EAGA,SAAS,OAAOW,MAAM;AACpB,UAAMC,IAAOC,EAAS/B,GAAK,GACrBgC,IAAMC,EAAA;AAGZ,IAAAlC,EAAI,CAACqB,MAAM;AACT,YAAMc,IAAOL,EAAE,YAAYM,EAAUf,GAAGS,EAAE,UAAU,GAC9CO,IAAc;AAAA,QAClB,GAAGhB;AAAA,QACH,OAAO;AAAA,UACL,GAAGA,EAAE;AAAA,UACL,CAACY,CAAG,GACFH,EAAE,SAAS,MACN;AAAA,YACC,QAAQG;AAAA,YACR,MAAM;AAAA,YACN,YAAYH,EAAE,cAAc;AAAA,YAC5B,UAAUK;AAAA,YACV,QAAQL,EAAE,UAAU;AAAA,YACpB,UAAU,CAAA;AAAA,YACV,OAAOA,EAAE;AAAA,YACT,QAAQA,EAAE;AAAA,UAAA,IAEX;AAAA,YACC,QAAQG;AAAA,YACR,MAAM;AAAA,YACN,YAAYH,EAAE;AAAA,YACd,UAAUK;AAAA,YACV,QAAQL,EAAE,UAAU;AAAA,YACpB,QAAQA,EAAE;AAAA,YACV,OAAOA,EAAE;AAAA,YACT,QAAQA,EAAE;AAAA,UAAA;AAAA,QACZ;AAAA,QAER,SAAST,EAAE,QAAQ,MAAA;AAAA,QACnB,WAAWA,EAAE;AAAA,MAAA;AAEf,aAAAiB,EAAOD,GAAMJ,GAAKH,EAAE,UAAU,GAC9BO,EAAK,YAAYT,EAAoBS,EAAK,OAAOA,EAAK,OAAO,GACtDA;AAAA,IACT,CAAC;AAED,QAAI;AAGF,UAAIE,IAAeN;AACnB,YAAMO,IAAgBJ,EAAUnC,EAAA,GAAO6B,EAAE,UAAU,GAC7CR,IAAM,MAAMC,EAAY,gBAAgB;AAAA,QAC5C,SAAS;AAAA,QACT,MAAMO,EAAE;AAAA,QACR,OAAOA,EAAE;AAAA,QACT,QAAQA,EAAE;AAAA,QACV,QAAQG;AAAA;AAAA,QACR,QAAQH,EAAE;AAAA,QACV,YAAYA,EAAE;AAAA,QACd,QAAQA,EAAE;AAAA,QACV,UAAUU;AAAA,QACV,QAAQC,EAAA;AAAA,MAAU,CACnB;AACD,aAAAF,IAAO,OAAOjB,GAAK,UAAUA,GAAK,UAAUW,CAAG,GAG/CjC,EAAI,CAACqB,MAAM;AACT,cAAMqB,IAAUC,EAAgBtB,GAAGY,GAAKM,CAAI;AAC5C,eAAO;AAAA,UACL,GAAGG;AAAA,UACH,WAAWd,EAAoBc,EAAQ,OAAOA,EAAQ,OAAO;AAAA,QAAA;AAAA,MAEjE,CAAC,GACMH;AAAA,IACT,SAASV,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAAO,EAAE,QAAAe,GAAQ,eAAAC,GAAe,UAAAC,GAAU,QAAA3B,QAAa;AAC/D,UAAMY,IAAO9B,EAAA,GAEPQ,IAAQ,gBAAgBsB,EAAK,KAAK,GAClCrB,IAAU,CAAC,GAAGqB,EAAK,OAAO,GAE1BxB,IAAOE,EAAMmC,CAAM;AACzB,QAAI,CAACrC,EAAM;AAGX,QAAIsC,MAAkB,KAAK;AACzB,YAAME,IAAStC,EAAMoC,CAAa;AAClC,UAAI,CAACE,KAAUA,EAAO,SAAS;AAC7B,cAAM,IAAI,MAAM,gBAAgB;AAAA,IACpC;AAEA,UAAMC,IAAczC,EAAK,cAAc,KAEjC0C,IACJD,MAAgB,MACZtC,IACED,EAAMuC,CAAW,EAAiB,aAAa,CAAA;AACvD;AACE,YAAME,IAAMD,EAAW,QAAQL,CAAM;AACrC,MAAIM,KAAO,KAAGD,EAAW,OAAOC,GAAK,CAAC;AAAA,IACxC;AAEA,UAAMC,IACJN,MAAkB,MACdnC,IACED,EAAMoC,CAAa,EAAiB,aAAa,CAAA;AACzD,IAAAM,EAAS;AAAA,MACP,KAAK,IAAI,GAAG,KAAK,IAAIL,GAAUK,EAAS,MAAM,CAAC;AAAA,MAC/C;AAAA,MACAP;AAAA,IAAA,GAGFrC,EAAK,aAAasC,GAClB7C,EAAI,EAAE,OAAAS,GAAO,SAAAC,GAAS,GACtB0C,EAAY3C,GAAOC,GAASmC,CAAa,GACzCO,EAAY3C,GAAOC,GAASsC,CAAW;AAEvC,QAAI;AACF,YAAMzB,EAAY,gBAAgB;AAAA;AAAA,QAEhC,QAAAqB;AAAA,QACA,YAAYC;AAAA,QACZ,UAAAC;AAAA,QACA,QAAQ3B;AAAA,MAAA,CACT;AAAA,IACH,SAASU,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,YAAY,OAAOe,MAAW;AAC5B,UAAMb,IAAOC,EAAS/B,GAAK;AAE3B,IAAAD,EAAI,CAACqB,MAAM;AACT,UAAI,CAACA,EAAE,MAAMuB,CAAM,EAAG,QAAOvB;AAC7B,YAAMgB,IAAc;AAAA,QAClB,GAAGhB;AAAA,QACH,OAAO,EAAE,GAAGA,EAAE,MAAA;AAAA,QACd,SAASA,EAAE,QAAQ,MAAA;AAAA,QACnB,WAAWA,EAAE;AAAA,MAAA;AAEf,aAAAgC,EAAkBhB,GAAMO,CAAM,GAC9BP,EAAK,YAAYT,EAAoBS,EAAK,OAAOA,EAAK,OAAO,GACtDA;AAAA,IACT,CAAC;AAED,QAAI;AACF,YAAMd,EAAY,gBAAgB,EAAE,QAAAqB,GAAQ;AAAA,IAC9C,SAASf,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAAO,EAAE,QAAAe,GAAQ,QAAAzB,GAAQ,QAAAmC,GAAQ,YAAAC,GAAY,UAAAT,QAAe;AACpE,UAAMf,IAAOC,EAAS/B,GAAK;AAG3B,IAAAD,EAAI,CAACqB,MAAM;AACT,YAAMgB,IAAO,EAAE,GAAGhB,GAAG,OAAO,EAAE,GAAGA,EAAE,QAAM,GACnCmC,IAASnB,EAAK,MAAMO,CAAM;AAChC,aAAIY,GAAQ,SAAS,OAAO,OAAOF,KAAW,aAC5CjB,EAAK,MAAMO,CAAM,IAAI;AAAA,QACnB,GAAIY;AAAA,QACJ,QAAAF;AAAA,MAAA,IAGGjB;AAAA,IACT,CAAC;AAED,QAAI;AACF,YAAMd,EAAY,gBAAgB;AAAA,QAChC,SAAS;AAAA,QACT,QAAAJ;AAAA,QACA,QAAAyB;AAAA,QACA,QAAAU;AAAA,QACA,YAAAC;AAAA,QACA,UAAAT;AAAA,QACA,QAAQL,EAAA;AAAA,MAAU,CACnB;AAAA,IACH,SAASZ,GAAG;AACV,YAAA7B,EAAI+B,CAAI,GACFF;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,WAAW,OAAOyB,GAAQC,GAAYE,GAAOtC,MACpC,MAAMlB,EAAA,EAAM,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,QAAAqD;AAAA,IACA,YAAAC;AAAA,IACA,OAAAE;AAAA,IACA,QAAAtC;AAAA,EAAA,CACD;AAAA,EAGH,iBAAiB,OAAOuC,GAAcC,MAExBtD,EAAiBJ,EAAA,EAAM,OAAO0D,EAAK,MAAM,IACrC,uBACT,MAAM1D,EAAA,EAAM,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,YAAYyD;AAAA,IACZ,OAAO;AAAA,IACP,QAAQjB,EAAA;AAAA,IACR,QAAQkB,EAAK;AAAA,IACb,QAAQA,EAAK;AAAA,EAAA,CACd;AAAA,EAGH,oBAAoB,OAAOxC,GAAQwC,MAAS;AAC1C,UAAMtC,IAAIpB,EAAA,GACJ2D,IAAS,OAAO,OAAOvC,EAAE,KAAK,EAAE;AAAA,MACpC,CAAClB,MAAMA,EAAE,SAAS,OAAQA,EAAe,WAAWwD,EAAK;AAAA,IAAA;AAE3D,QAAIC,GAAQ;AACV,YAAM3D,EAAA,EAAM,WAAW2D,EAAO,MAAM;AACpC;AAAA,IACF;AAEA,QAAIC,IAAWC,EAAoBzC,CAAC;AACpC,IAAKwC,MACH,MAAM5D,EAAA,EAAM,cAAckB,GAAQ,EAAI,GACtC0C,IAAWC,EAAoB7D,GAAK,IAElC4D,KACF,MAAM5D,EAAA,EAAM,QAAQ;AAAA,MAClB,MAAM;AAAA,MACN,YAAY4D;AAAA,MACZ,OAAO;AAAA,MACP,QAAQpB,EAAA;AAAA,MACR,QAAQkB,EAAK;AAAA,MACb,QAAQA,EAAK;AAAA,IAAA,CACd;AAAA,EAEL;AAAA,EAEA,oBAAoB,OAAOzD,MAAW;AACpC,UAAMmB,IAAIpB,EAAA,GACJ2C,IAASvC,EAAiBgB,EAAE,OAAOnB,CAAM;AAC/C,IAAI0C,KAAQ,MAAM3C,IAAM,WAAW2C,CAAM;AAAA,EAC3C;AAAA,EAEA,YAAY,OAAOA,MAAW;AAC5B,UAAM3C,EAAA,EAAM,WAAW2C,CAAM;AAAA,EAC/B;AAAA,EAEA,cAAc,OAAOc,MAAiB;AACpC,UAAMzD,EAAA,EAAM,WAAWyD,CAAY;AAAA,EACrC;AAAA,EAEA,YAAY,OAAOA,GAAcvC,GAAQ4C,GAAWR,GAAYT,MAAa;AAC3E,UAAM7C,EAAA,EAAM,SAAS;AAAA,MACnB,QAAQyD;AAAA,MACR,QAAAvC;AAAA,MACA,QAAQ4C;AAAA,MACR,YAAAR;AAAA,MACA,UAAAT;AAAA,IAAA,CACD;AAAA,EACH;AAAA;AAAA,EAGA,sBAAsB,CAACkB,GAAUtD,GAASF,GAAGyD,IAAa,OAAU;AAClE,UAAMtD,IAAQ,CAACU,MACbb,IAAIa,EAAE,YAAA,EAAc,SAASb,EAAE,YAAA,CAAa,IAAI,IAE5C0D,IAAQ,CAAC9D,MAA2B;AACxC,YAAMD,IAAI6D,EAAS5D,CAAE;AAGrB,UAFI,CAACD,KAED8D,KAAc9D,EAAE,SAAS,IAAK,QAAO;AAEzC,UAAIA,EAAE,SAAS,KAAK;AAClB,cAAMc,IAAId,GACJgE,KAAYlD,EAAE,YAAY,CAAA,GAC7B,IAAI,CAACF,MAAQmD,EAAMnD,CAAG,CAAC,EACvB,OAAO,OAAO;AAEjB,eADgBJ,EAAMM,EAAE,MAAM,KAAKkD,EAAS,SAAS,IAE9C;AAAA,UACL,KAAKlD,EAAE;AAAA,UACP,MAAM;AAAA,UACN,OAAO,MAAMA,EAAE,MAAM;AAAA,UACrB,QAAQA,EAAE;AAAA,UACV,YAAYA,EAAE;AAAA,UACd,UAAUA,EAAE;AAAA,UACZ,UAAUA,EAAE;AAAA,UACZ,UAAUkD,EAAS,SAASA,IAAW;AAAA,QAAA,IATpB;AAAA,MAWvB,OAAO;AACL,cAAMC,IAAIjE,GACJkE,IAAQD,EAAE,SAAS,GAAGA,EAAE,MAAM,KAAKA,EAAE,MAAM,MAAMA,EAAE;AAEzD,eADgBzD,EAAM0D,CAAK,IAEpB;AAAA,UACL,KAAKD,EAAE;AAAA,UACP,MAAM;AAAA,UACN,OAAO,MAAMC,CAAK;AAAA,UAClB,YAAYD,EAAE;AAAA,UACd,UAAUA,EAAE;AAAA,UACZ,UAAUA,EAAE;AAAA,UACZ,QAAQ;AAAA,QAAA,IARW;AAAA,MAUvB;AAAA,IACF;AAEA,WAAO1D,EAAQ,IAAIwD,CAAK,EAAE,OAAO,OAAO;AAAA,EAC1C;AACF,IAEaI,IAAmBC,EAAcxE,CAAO;AAMrD,SAAS2B,EAAUF,GAAwB;AACzC,QAAMf,IAA6B,CAAA,GAC7B+D,IAAc,CAAA,GAEdC,IAAO,CAACC,MAAe;AAC3B,IAAAA,EAAI,QAAQ,CAACC,MAAW;AAEtB,YAAMC,IAAiB;AAAA,QACrB,MAAMD,EAAE;AAAA,QACR,QAAQA,EAAE,UAAUA,EAAE,WAAWA,EAAE;AAAA,QACnC,YAAYA,EAAE,cAAcA,EAAE,gBAAgB;AAAA,QAC9C,UAAU,OAAOA,EAAE,YAAYA,EAAE,aAAa,CAAC;AAAA,QAC/C,OAAOA,EAAE,SAASA,EAAE;AAAA,QACpB,QAAQA,EAAE,UAAUA,EAAE;AAAA,QACtB,UAAUA,EAAE,YAAYA,EAAE;AAAA,MAAA;AAG5B,UAAIA,EAAE,SAAS,KAAK;AAClB,QAAAlE,EAAMmE,EAAK,MAAM,IAAI;AAAA,UACnB,GAAGA;AAAA,UACH,QAAQD,EAAE,UAAUA,EAAE,WAAWA,EAAE,QAAQC,EAAK;AAAA,UAChD,UAAU,CAAA;AAAA,QAAC;AAGb,cAAMT,IAAW,MAAM,QAAQQ,EAAE,QAAQ,IAAIA,EAAE,WAAW,CAAA;AAC1D,QAAAF,EAAKN,CAAQ;AAAA,MACf;AACE,QAAA1D,EAAMmE,EAAK,MAAM,IAAI;AAAA,UACnB,GAAGA;AAAA,UACH,QAAQD,EAAE,UAAUA,EAAE,WAAW;AAAA,UACjC,QAAQA,EAAE,UAAUA,EAAE;AAAA,QAAA;AAAA,IAG5B,CAAC;AAAA,EACH;AAEA,SAAAF,EAAKjD,CAAG,GAGR,OAAO,OAAOf,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,QAAIA,EAAE,cAAcA,EAAE,eAAe,KAAK;AACxC,YAAM2B,IAAIrB,EAAMN,EAAE,UAAU;AAC5B,MAAI2B,GAAG,SAAS,SAAO,SAAS,KAAK3B,EAAE,MAAM;AAAA,IAC/C,MAAA,CAAWA,EAAE,SAAS,OACpBqE,EAAM,KAAKrE,EAAE,MAAM;AAAA,EAEvB,CAAC,GAGDqE,EAAM,KAAK,CAACK,GAAGC,OAAOrE,EAAMoE,CAAC,EAAE,YAAY,MAAMpE,EAAMqE,CAAC,EAAE,YAAY,EAAE,GACxE,OAAO,OAAOrE,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,IAAIA,EAAE,SAAS,OACHA,EACR,SAAS;AAAA,MACT,CAAC4E,GAAGC,OAAOvE,EAAMsE,CAAC,EAAE,YAAY,MAAMtE,EAAMuE,CAAC,EAAE,YAAY;AAAA,IAAA;AAAA,EAGjE,CAAC,GAEM,EAAE,OAAAvE,GAAO,SAAS+D,EAAA;AAC3B;AAEA,SAASxC,EAASX,GAAiB;AACjC,SAAO;AAAA,IACL,GAAGA;AAAA,IACH,OAAO,KAAK,MAAM,KAAK,UAAUA,EAAE,KAAK,CAAC;AAAA,IACzC,SAASA,EAAE,QAAQ,MAAA;AAAA,EAAM;AAE7B;AAEA,SAASa,IAAa;AACpB,SAAO,OAAO,KAAK,SAAS,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AACvD;AAEA,SAASE,EAAUf,GAAqC4D,GAAoB;AAC1E,MAAI,CAACA,KAAYA,MAAa,IAAK,QAAO5D,EAAE,QAAQ;AACpD,QAAMS,IAAIT,EAAE,MAAM4D,CAAQ;AAC1B,SAAOnD,IAAIA,EAAE,SAAS,SAAS;AACjC;AAEA,SAASQ,EAAOjB,GAAUuB,GAAYqC,GAAoB;AACxD,QAAM9E,IAAIkB,EAAE,MAAMuB,CAAM;AACxB,MAAKzC;AAEL,QAAI8E,KAAYA,MAAa,KAAK;AAChC,YAAMnD,IAAIT,EAAE,MAAM4D,CAAQ;AAC1B,UAAI,CAACnD,KAAKA,EAAE,SAAS,IAAK;AAC1B,MAAA3B,EAAE,aAAa8E,GACfnD,EAAE,WAAW,CAAC,GAAGA,EAAE,UAAUc,CAAM;AAAA,IACrC;AACE,MAAAzC,EAAE,aAAa,KACfkB,EAAE,UAAU,CAAC,GAAGA,EAAE,SAASuB,CAAM;AAErC;AAEA,SAASsC,EAAO7D,GAAUuB,GAAY;AACpC,QAAMzC,IAAIkB,EAAE,MAAMuB,CAAM;AACxB,MAAI,CAACzC,EAAG;AACR,QAAMgF,IAAMhF,EAAE;AAEd,MAAIgF,KAAOA,MAAQ,KAAK;AACtB,UAAMrD,IAAIT,EAAE,MAAM8D,CAAG;AACrB,IAAIrD,GAAG,SAAS,QACdA,EAAE,WAAWA,EAAE,SAAS,OAAO,CAACd,MAAMA,MAAM4B,CAAM;AAAA,EAEtD;AACE,IAAAvB,EAAE,UAAUA,EAAE,QAAQ,OAAO,CAACsD,MAAMA,MAAM/B,CAAM;AAEpD;AAEA,SAASS,EAAkBhC,GAAUuB,GAAY;AAC/C,QAAMrC,IAAOc,EAAE,MAAMuB,CAAM;AAC3B,MAAI,CAACrC,EAAM;AACX,EAAIA,EAAK,SAAS,OACEA,EAAoB,SAAS,MAAA,EACtC,QAAQ,CAACQ,MAAQsC,EAAkBhC,GAAGN,CAAG,CAAC,GAErDmE,EAAO7D,GAAGuB,CAAM;AAChB,QAAM,EAAE,CAACA,CAAM,GAAGwC,GAAO,GAAGC,EAAA,IAAShE,EAAE;AACvC,EAAAA,EAAE,QAAQgE;AACZ;AAGA,SAAS1C,EAAgBtB,GAAUY,GAASM,GAAiB;AAC3D,MAAIN,MAAQM,EAAM,QAAOlB;AACzB,QAAMd,IAAOc,EAAE,MAAMY,CAAG;AACxB,MAAI,CAAC1B,EAAM,QAAOc;AAElB,QAAMiE,IAAmB,KAAK,MAAM,KAAK,UAAU/E,CAAI,CAAC;AACxD,EAAA+E,EAAQ,SAAS/C;AAEjB,QAAMgD,IAAgC,EAAE,GAAGlE,EAAE,OAAO,CAACkB,CAAI,GAAG+C,EAAA;AAC5D,SAAOC,EAAStD,CAAG;AAEnB,MAAIuD,IAAanE,EAAE;AACnB,MAAIiE,EAAQ,cAAcA,EAAQ,eAAe,KAAK;AACpD,UAAMxD,IAAIyD,EAASD,EAAQ,UAAU;AACrC,IAAIxD,GAAG,SAAS,QACdyD,EAASD,EAAQ,UAAU,IAAI;AAAA,MAC7B,GAAGxD;AAAA,MACH,UAAUA,EAAE,SAAS,IAAI,CAACd,MAAOA,MAAMiB,IAAMM,IAAOvB,CAAE;AAAA,IAAA;AAAA,EAG5D;AACE,IAAAwE,IAAanE,EAAE,QAAQ,IAAI,CAACsD,MAAOA,MAAM1C,IAAMM,IAAOoC,CAAE;AAG1D,SAAO,EAAE,GAAGtD,GAAG,OAAOkE,GAAU,SAASC,EAAA;AAC3C;AAEA,SAAS1B,EAAoBzC,GAAgD;AAC3E,SAAOA,EAAE,QAAQ,KAAK,CAACjB,MAAOiB,EAAE,MAAMjB,CAAE,GAAG,SAAS,GAAG,KAAK;AAC9D;AAEA,SAASwB,EAAoBnB,GAA4BC,GAAe;AACtE,QAAM+E,IAA6C,CAAA;AACnD,SAAO,OAAOhF,CAAK,EAAE,QAAQ,CAACN,MAAM;AAClC,UAAMC,IAAKD,EAAE,QACPgF,IAAMhF,EAAE;AACd,IAAI,CAACC,KAAM,CAAC+E,KAAOA,MAAQ,OAAOA,MAAQ/E,MACzCqF,EAAiBN,CAAG,MAAM,CAAA,GAAI,KAAK/E,CAAE;AAAA,EACxC,CAAC;AAED,QAAMsF,wBAAe,IAAA,GAEfxB,IAAQ,CAAC9D,MAAgB;AAC7B,QAAIsF,EAAS,IAAItF,CAAE,EAAG,QAAO;AAC7B,UAAMD,IAAIM,EAAML,CAAE;AAClB,QAAI,CAACD,EAAG,QAAO;AAEf,IAAAuF,EAAS,IAAItF,CAAE;AACf,QAAI;AACF,UAAID,EAAE,SAAS,KAAK;AAClB,cAAMc,IAAId,GACJwF,IAAWF,EAAiBrF,CAAE,KAAK,CAAA;AACzC,eAAO;AAAA,UACL,MAAM;AAAA,UACN,QAAQA;AAAA,UACR,QAAQa,EAAE;AAAA,UACV,YAAYA,EAAE;AAAA,UACd,UAAU0E,EAAS,IAAIzB,CAAK,EAAE,OAAO,OAAO;AAAA,QAAA;AAAA,MAEhD;AACA,YAAME,IAAIjE;AAEV,aAAO;AAAA,QACL,MAAM;AAAA,QACN,QAAQC;AAAA,QACR,QAAQgE,EAAE;AAAA,QACV,QAAQA,EAAE;AAAA,QACV,QAAQA,EAAE;AAAA,QACV,YAAYA,EAAE;AAAA,MAAA;AAAA,IAElB,UAAA;AACE,MAAAsB,EAAS,OAAOtF,CAAE;AAAA,IACpB;AAAA,EACF,GAEMwF,IAAc,OAAO,OAAOnF,CAAK,EACpC,OAAO,CAACN,MAAMA,EAAE,eAAe,OAAOA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACA,MAAMA,EAAE,MAAM,GAEhB0F,IAAgB,OAAO,OAAOpF,CAAK,EACtC,OAAO,CAACN,MAAMA,EAAE,eAAe,OAAOA,EAAE,SAAS,GAAG,EACpD,IAAI,CAACA,MAAMA,EAAE,MAAM;AAKtB,SAHiB,MAAM;AAAA,IACrB,oBAAI,IAAI,CAAC,GAAGO,GAAS,GAAGkF,GAAa,GAAGC,CAAa,CAAC;AAAA,EAAA,EAExC,IAAI3B,CAAK,EAAE,OAAO,OAAO;AAC3C;AAEA,SAAS7D,EACPI,GACAP,GACW;AACX,aAAWC,KAAK,OAAO,OAAOM,CAAK;AACjC,QAAIN,EAAE,SAAS,OAAQA,EAAe,WAAWD,UAAeC,EAAE;AAEpE,SAAO;AACT;AAEA,SAASiD,EACP3C,GACAC,GACAuE,GACA;AAKA,GAHE,CAACA,KAAYA,MAAa,MACtBvE,IACCD,EAAMwE,CAAQ,EAAiB,YAAY,CAAA,GACzC,QAAQ,CAACa,GAAK5C,MAAQ;AAC7B,UAAM/C,IAAIM,EAAMqF,CAAG;AACnB,IAAK3F,MACLA,EAAE,WAAW+C;AAAA,EACf,CAAC;AACH;"}

package/dist/chunks/{popupStore-CcQg9AvK.js → popupStore-Bi6o78lP.js}

@@ -1,4 +1,4 @@
-import { c as d, am as P, aB as I } from "./apiUtils-DfPv_gmI.js";
+import { c as d, al as P, aA as I } from "./apiUtils-DxzLqPhU.js";
 import { create as g } from "zustand";
 const h = g((u, n) => ({
   popups: [],
@@ -89,4 +89,4 @@ const h = g((u, n) => ({
 export {
   h as u
 };
-//# sourceMappingURL=popupStore-CcQg9AvK.js.map
+//# sourceMappingURL=popupStore-Bi6o78lP.js.map