@payloadcms/ui 3.0.0-beta.53 → 3.0.0-beta.54

package/dist/utilities/setsAreEqual.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"setsAreEqual.d.ts","sourceRoot":"","sources":["../../src/utilities/setsAreEqual.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,YAAY,WAAY,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,YAEvD,CAAA"}
+{"version":3,"file":"setsAreEqual.d.ts","sourceRoot":"","sources":["../../src/utilities/setsAreEqual.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,YAEvD,CAAA"}

package/dist/utilities/setsAreEqual.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utilities/setsAreEqual.ts"],"sourcesContent":["/**\n * Function to determine whether two sets are equal or not.\n */\nexport const setsAreEqual = <T>(lhs: Set<T>, rhs: Set<T>) => {\n  return lhs.size === rhs.size && Array.from(lhs).every((value) => rhs.has(value))\n}\n"],"names":["setsAreEqual","lhs","rhs","size","Array","from","every","value","has"],"rangeMappings":";;;;","mappings":"AAAA;;CAEC,GACD,OAAO,MAAMA,eAAe,CAAIC,KAAaC;IAC3C,OAAOD,IAAIE,IAAI,KAAKD,IAAIC,IAAI,IAAIC,MAAMC,IAAI,CAACJ,KAAKK,KAAK,CAAC,CAACC,QAAUL,IAAIM,GAAG,CAACD;AAC3E,EAAC"}
+{"version":3,"sources":["../../src/utilities/setsAreEqual.ts"],"sourcesContent":["/**\n * Function to determine whether two sets are equal or not.\n */\nexport const setsAreEqual = <T>(lhs: Set<T>, rhs: Set<T>) => {\n  return lhs.size === rhs.size && Array.from(lhs).every((value) => rhs.has(value))\n}\n"],"names":["setsAreEqual","lhs","rhs","size","Array","from","every","value","has"],"mappings":"AAAA;;CAEC,GACD,OAAO,MAAMA,eAAe,CAAIC,KAAaC;IAC3C,OAAOD,IAAIE,IAAI,KAAKD,IAAIC,IAAI,IAAIC,MAAMC,IAAI,CAACJ,KAAKK,KAAK,CAAC,CAACC,QAAUL,IAAIM,GAAG,CAACD;AAC3E,EAAC"}

package/dist/utilities/unflatten.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utilities/unflatten.ts"],"sourcesContent":["/*\n * Copyright (c) 2014, Hugh Kennedy\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nimport isBuffer from 'is-buffer'\n\ninterface Opts {\n  delimiter?: string\n  object?: any\n  overwrite?: boolean\n  recursive?: boolean\n}\n\nexport const unflatten = (target, opts?: Opts) => {\n  opts = opts || {}\n\n  const delimiter = opts.delimiter || '.'\n  const overwrite = opts.overwrite || false\n  const recursive = opts.recursive || false\n  const result = {}\n\n  const isbuffer = isBuffer(target)\n\n  if (isbuffer || Object.prototype.toString.call(target) !== '[object Object]') {\n    return target\n  }\n\n  // safely ensure that the key is an integer.\n  const getkey = (key) => {\n    const parsedKey = Number(key)\n    return isNaN(parsedKey) || key.indexOf('.') !== -1 || opts.object ? key : parsedKey\n  }\n\n  const sortedKeys = Object.keys(target).sort((keyA, keyB) => keyA.length - keyB.length)\n\n  sortedKeys.forEach((key) => {\n    const split = key.split(delimiter)\n    let key1 = getkey(split.shift())\n    let key2 = getkey(split[0])\n    let recipient = result\n\n    while (key2 !== undefined) {\n      if (key1 === '__proto__') {\n        return\n      }\n\n      const type = Object.prototype.toString.call(recipient[key1])\n      const isobject = type === '[object Object]' || type === '[object Array]'\n\n      // do not write over falsey, non-undefined values if overwrite is false\n      if (!overwrite && !isobject && typeof recipient[key1] !== 'undefined') {\n        return\n      }\n\n      if ((overwrite && !isobject) || (!overwrite && recipient[key1] == null)) {\n        recipient[key1] = typeof key2 === 'number' && !opts.object ? [] : {}\n      }\n\n      recipient = recipient[key1]\n\n      if (split.length > 0) {\n        key1 = getkey(split.shift())\n        key2 = getkey(split[0])\n      }\n    }\n\n    // unflatten again for 'messy objects'\n    recipient[key1] = recursive ? unflatten(target[key], opts) : target[key]\n  })\n\n  return result\n}\n"],"names":["isBuffer","unflatten","target","opts","delimiter","overwrite","recursive","result","isbuffer","Object","prototype","toString","call","getkey","key","parsedKey","Number","isNaN","indexOf","object","sortedKeys","keys","sort","keyA","keyB","length","forEach","split","key1","shift","key2","recipient","undefined","type","isobject"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":"AAAA;;;;;;;;;;CAUC,GAED,OAAOA,cAAc,YAAW;AAShC,OAAO,MAAMC,YAAY,CAACC,QAAQC;IAChCA,OAAOA,QAAQ,CAAC;IAEhB,MAAMC,YAAYD,KAAKC,SAAS,IAAI;IACpC,MAAMC,YAAYF,KAAKE,SAAS,IAAI;IACpC,MAAMC,YAAYH,KAAKG,SAAS,IAAI;IACpC,MAAMC,SAAS,CAAC;IAEhB,MAAMC,WAAWR,SAASE;IAE1B,IAAIM,YAAYC,OAAOC,SAAS,CAACC,QAAQ,CAACC,IAAI,CAACV,YAAY,mBAAmB;QAC5E,OAAOA;IACT;IAEA,4CAA4C;IAC5C,MAAMW,SAAS,CAACC;QACd,MAAMC,YAAYC,OAAOF;QACzB,OAAOG,MAAMF,cAAcD,IAAII,OAAO,CAAC,SAAS,CAAC,KAAKf,KAAKgB,MAAM,GAAGL,MAAMC;IAC5E;IAEA,MAAMK,aAAaX,OAAOY,IAAI,CAACnB,QAAQoB,IAAI,CAAC,CAACC,MAAMC,OAASD,KAAKE,MAAM,GAAGD,KAAKC,MAAM;IAErFL,WAAWM,OAAO,CAAC,CAACZ;QAClB,MAAMa,QAAQb,IAAIa,KAAK,CAACvB;QACxB,IAAIwB,OAAOf,OAAOc,MAAME,KAAK;QAC7B,IAAIC,OAAOjB,OAAOc,KAAK,CAAC,EAAE;QAC1B,IAAII,YAAYxB;QAEhB,MAAOuB,SAASE,UAAW;YACzB,IAAIJ,SAAS,aAAa;gBACxB;YACF;YAEA,MAAMK,OAAOxB,OAAOC,SAAS,CAACC,QAAQ,CAACC,IAAI,CAACmB,SAAS,CAACH,KAAK;YAC3D,MAAMM,WAAWD,SAAS,qBAAqBA,SAAS;YAExD,uEAAuE;YACvE,IAAI,CAAC5B,aAAa,CAAC6B,YAAY,OAAOH,SAAS,CAACH,KAAK,KAAK,aAAa;gBACrE;YACF;YAEA,IAAI,AAACvB,aAAa,CAAC6B,YAAc,CAAC7B,aAAa0B,SAAS,CAACH,KAAK,IAAI,MAAO;gBACvEG,SAAS,CAACH,KAAK,GAAG,OAAOE,SAAS,YAAY,CAAC3B,KAAKgB,MAAM,GAAG,EAAE,GAAG,CAAC;YACrE;YAEAY,YAAYA,SAAS,CAACH,KAAK;YAE3B,IAAID,MAAMF,MAAM,GAAG,GAAG;gBACpBG,OAAOf,OAAOc,MAAME,KAAK;gBACzBC,OAAOjB,OAAOc,KAAK,CAAC,EAAE;YACxB;QACF;QAEA,sCAAsC;QACtCI,SAAS,CAACH,KAAK,GAAGtB,YAAYL,UAAUC,MAAM,CAACY,IAAI,EAAEX,QAAQD,MAAM,CAACY,IAAI;IAC1E;IAEA,OAAOP;AACT,EAAC"}
+{"version":3,"sources":["../../src/utilities/unflatten.ts"],"sourcesContent":["/*\n * Copyright (c) 2014, Hugh Kennedy\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nimport isBuffer from 'is-buffer'\n\ninterface Opts {\n  delimiter?: string\n  object?: any\n  overwrite?: boolean\n  recursive?: boolean\n}\n\nexport const unflatten = (target, opts?: Opts) => {\n  opts = opts || {}\n\n  const delimiter = opts.delimiter || '.'\n  const overwrite = opts.overwrite || false\n  const recursive = opts.recursive || false\n  const result = {}\n\n  const isbuffer = isBuffer(target)\n\n  if (isbuffer || Object.prototype.toString.call(target) !== '[object Object]') {\n    return target\n  }\n\n  // safely ensure that the key is an integer.\n  const getkey = (key) => {\n    const parsedKey = Number(key)\n    return isNaN(parsedKey) || key.indexOf('.') !== -1 || opts.object ? key : parsedKey\n  }\n\n  const sortedKeys = Object.keys(target).sort((keyA, keyB) => keyA.length - keyB.length)\n\n  sortedKeys.forEach((key) => {\n    const split = key.split(delimiter)\n    let key1 = getkey(split.shift())\n    let key2 = getkey(split[0])\n    let recipient = result\n\n    while (key2 !== undefined) {\n      if (key1 === '__proto__') {\n        return\n      }\n\n      const type = Object.prototype.toString.call(recipient[key1])\n      const isobject = type === '[object Object]' || type === '[object Array]'\n\n      // do not write over falsey, non-undefined values if overwrite is false\n      if (!overwrite && !isobject && typeof recipient[key1] !== 'undefined') {\n        return\n      }\n\n      if ((overwrite && !isobject) || (!overwrite && recipient[key1] == null)) {\n        recipient[key1] = typeof key2 === 'number' && !opts.object ? [] : {}\n      }\n\n      recipient = recipient[key1]\n\n      if (split.length > 0) {\n        key1 = getkey(split.shift())\n        key2 = getkey(split[0])\n      }\n    }\n\n    // unflatten again for 'messy objects'\n    recipient[key1] = recursive ? unflatten(target[key], opts) : target[key]\n  })\n\n  return result\n}\n"],"names":["isBuffer","unflatten","target","opts","delimiter","overwrite","recursive","result","isbuffer","Object","prototype","toString","call","getkey","key","parsedKey","Number","isNaN","indexOf","object","sortedKeys","keys","sort","keyA","keyB","length","forEach","split","key1","shift","key2","recipient","undefined","type","isobject"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,OAAOA,cAAc,YAAW;AAShC,OAAO,MAAMC,YAAY,CAACC,QAAQC;IAChCA,OAAOA,QAAQ,CAAC;IAEhB,MAAMC,YAAYD,KAAKC,SAAS,IAAI;IACpC,MAAMC,YAAYF,KAAKE,SAAS,IAAI;IACpC,MAAMC,YAAYH,KAAKG,SAAS,IAAI;IACpC,MAAMC,SAAS,CAAC;IAEhB,MAAMC,WAAWR,SAASE;IAE1B,IAAIM,YAAYC,OAAOC,SAAS,CAACC,QAAQ,CAACC,IAAI,CAACV,YAAY,mBAAmB;QAC5E,OAAOA;IACT;IAEA,4CAA4C;IAC5C,MAAMW,SAAS,CAACC;QACd,MAAMC,YAAYC,OAAOF;QACzB,OAAOG,MAAMF,cAAcD,IAAII,OAAO,CAAC,SAAS,CAAC,KAAKf,KAAKgB,MAAM,GAAGL,MAAMC;IAC5E;IAEA,MAAMK,aAAaX,OAAOY,IAAI,CAACnB,QAAQoB,IAAI,CAAC,CAACC,MAAMC,OAASD,KAAKE,MAAM,GAAGD,KAAKC,MAAM;IAErFL,WAAWM,OAAO,CAAC,CAACZ;QAClB,MAAMa,QAAQb,IAAIa,KAAK,CAACvB;QACxB,IAAIwB,OAAOf,OAAOc,MAAME,KAAK;QAC7B,IAAIC,OAAOjB,OAAOc,KAAK,CAAC,EAAE;QAC1B,IAAII,YAAYxB;QAEhB,MAAOuB,SAASE,UAAW;YACzB,IAAIJ,SAAS,aAAa;gBACxB;YACF;YAEA,MAAMK,OAAOxB,OAAOC,SAAS,CAACC,QAAQ,CAACC,IAAI,CAACmB,SAAS,CAACH,KAAK;YAC3D,MAAMM,WAAWD,SAAS,qBAAqBA,SAAS;YAExD,uEAAuE;YACvE,IAAI,CAAC5B,aAAa,CAAC6B,YAAY,OAAOH,SAAS,CAACH,KAAK,KAAK,aAAa;gBACrE;YACF;YAEA,IAAI,AAACvB,aAAa,CAAC6B,YAAc,CAAC7B,aAAa0B,SAAS,CAACH,KAAK,IAAI,MAAO;gBACvEG,SAAS,CAACH,KAAK,GAAG,OAAOE,SAAS,YAAY,CAAC3B,KAAKgB,MAAM,GAAG,EAAE,GAAG,CAAC;YACrE;YAEAY,YAAYA,SAAS,CAACH,KAAK;YAE3B,IAAID,MAAMF,MAAM,GAAG,GAAG;gBACpBG,OAAOf,OAAOc,MAAME,KAAK;gBACzBC,OAAOjB,OAAOc,KAAK,CAAC,EAAE;YACxB;QACF;QAEA,sCAAsC;QACtCI,SAAS,CAACH,KAAK,GAAGtB,YAAYL,UAAUC,MAAM,CAACY,IAAI,EAAEX,QAAQD,MAAM,CAACY,IAAI;IAC1E;IAEA,OAAOP;AACT,EAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@payloadcms/ui",
-  "version": "3.0.0-beta.53",
+  "version": "3.0.0-beta.54",
   "homepage": "https://payloadcms.com",
   "repository": {
     "type": "git",
@@ -91,11 +91,11 @@
     "body-scroll-lock": "4.0.0-beta.0",
     "bson-objectid": "2.0.4",
     "date-fns": "3.3.1",
-    "deep-equal": "2.2.2",
+    "dequal": "2.0.3",
     "is-buffer": "^2.0.5",
     "md5": "2.3.0",
     "object-to-formdata": "4.5.1",
-    "qs": "6.11.2",
+    "qs": "6.12.1",
     "react-animate-height": "2.1.2",
     "react-datepicker": "6.9.0",
     "react-image-crop": "10.1.8",
@@ -104,7 +104,7 @@
     "sonner": "^1.5.0",
     "use-context-selector": "2.0.0",
     "uuid": "10.0.0",
-    "@payloadcms/translations": "3.0.0-beta.53"
+    "@payloadcms/translations": "3.0.0-beta.54"
   },
   "devDependencies": {
     "@babel/cli": "^7.24.5",
@@ -129,14 +129,14 @@
     "sass-loader": "14.2.1",
     "swc-loader": "^0.2.6",
     "turbopack": "^0.0.1",
-    "payload": "3.0.0-beta.53",
-    "@payloadcms/eslint-config": "1.1.1"
+    "@payloadcms/eslint-config": "1.1.1",
+    "payload": "3.0.0-beta.54"
   },
   "peerDependencies": {
     "next": "^15.0.0-rc.0",
     "react": "^19.0.0 || ^19.0.0-rc-f994737d14-20240522",
     "react-dom": "^19.0.0 || ^19.0.0-rc-f994737d14-20240522",
-    "payload": "3.0.0-beta.53"
+    "payload": "3.0.0-beta.54"
   },
   "engines": {
     "node": "^18.20.2 || >=20.9.0"

package/dist/fields/HiddenInput/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/fields/HiddenInput/index.tsx"],"names":[],"mappings":"AACA,OAAO,KAAoB,MAAM,OAAO,CAAA;AAExC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA;AAMhD,MAAM,MAAM,qBAAqB,GAAG,aAAa,GAAG;IAClD,oBAAoB,CAAC,EAAE,KAAK,CAAA;IAC5B,qBAAqB,CAAC,EAAE,OAAO,CAAA;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB,CAAA;AAsCD,eAAO,MAAM,WAAW,iCAAkC,CAAA"}

package/dist/fields/HiddenInput/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../src/fields/HiddenInput/index.tsx"],"sourcesContent":["'use client'\nimport React, { useEffect } from 'react'\n\nimport type { FormFieldBase } from '../index.js'\n\nimport { useFieldProps } from '../../forms/FieldPropsProvider/index.js'\nimport { useField } from '../../forms/useField/index.js'\nimport { withCondition } from '../../forms/withCondition/index.js'\n\nexport type HiddenInputFieldProps = FormFieldBase & {\n  disableModifyingForm?: false\n  forceUsePathFromProps?: boolean\n  name?: string\n  path?: string\n  value?: unknown\n}\n\n/**\n * This is mainly used to save a value on the form that is not visible to the user.\n * For example, this sets the `ìd` property of a block in the Blocks field.\n */\nconst HiddenInputField: React.FC<HiddenInputFieldProps> = (props) => {\n  const {\n    name,\n    disableModifyingForm = true,\n    forceUsePathFromProps,\n    path: pathFromProps,\n    value: valueFromProps,\n  } = props\n\n  const { path: pathFromContext } = useFieldProps()\n\n  const { path, setValue, value } = useField({\n    path: (!forceUsePathFromProps ? pathFromContext : null) || pathFromProps || name,\n  })\n\n  useEffect(() => {\n    if (valueFromProps !== undefined) {\n      setValue(valueFromProps, disableModifyingForm)\n    }\n  }, [valueFromProps, setValue, disableModifyingForm])\n\n  return (\n    <input\n      id={`field-${path?.replace(/\\./g, '__')}`}\n      name={path}\n      onChange={setValue}\n      type=\"hidden\"\n      value={(value as string) || ''}\n    />\n  )\n}\n\nexport const HiddenInput = withCondition(HiddenInputField)\n"],"names":["React","useEffect","useFieldProps","useField","withCondition","HiddenInputField","props","name","disableModifyingForm","forceUsePathFromProps","path","pathFromProps","value","valueFromProps","pathFromContext","setValue","undefined","input","id","replace","onChange","type","HiddenInput"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":"AAAA;;AACA,OAAOA,SAASC,SAAS,QAAQ,QAAO;AAIxC,SAASC,aAAa,QAAQ,0CAAyC;AACvE,SAASC,QAAQ,QAAQ,gCAA+B;AACxD,SAASC,aAAa,QAAQ,qCAAoC;AAUlE;;;CAGC,GACD,MAAMC,mBAAoD,CAACC;IACzD,MAAM,EACJC,IAAI,EACJC,uBAAuB,IAAI,EAC3BC,qBAAqB,EACrBC,MAAMC,aAAa,EACnBC,OAAOC,cAAc,EACtB,GAAGP;IAEJ,MAAM,EAAEI,MAAMI,eAAe,EAAE,GAAGZ;IAElC,MAAM,EAAEQ,IAAI,EAAEK,QAAQ,EAAEH,KAAK,EAAE,GAAGT,SAAS;QACzCO,MAAM,AAAC,CAAA,CAACD,wBAAwBK,kBAAkB,IAAG,KAAMH,iBAAiBJ;IAC9E;IAEAN,UAAU;QACR,IAAIY,mBAAmBG,WAAW;YAChCD,SAASF,gBAAgBL;QAC3B;IACF,GAAG;QAACK;QAAgBE;QAAUP;KAAqB;IAEnD,qBACE,KAACS;QACCC,IAAI,CAAC,MAAM,EAAER,MAAMS,QAAQ,OAAO,MAAM,CAAC;QACzCZ,MAAMG;QACNU,UAAUL;QACVM,MAAK;QACLT,OAAO,AAACA,SAAoB;;AAGlC;AAEA,OAAO,MAAMU,cAAclB,cAAcC,kBAAiB"}