1function f(n,o){var t,i;return((i=(t=n[o])==null?void 0:t.span)==null?void 0:i.x)??1}function d(n,o){const t=Object.entries(n).find(([,i])=>i.childUuid===o);return t?Number(t[0]):void 0}function h(n,o){var i;const t=Array.from({length:o},()=>null);for(const[e,c]of Object.entries(n)){if(!c.childUuid)continue;const s=Number(e),l=((i=c.span)==null?void 0:i.x)??1;for(let u=s;u<s+l&&u<o;u++)t[u]=c.childUuid}return t}function g(n,o){const t=d(n,o);return t!==void 0&&t>0}function m(n,o,t){const i=d(n,o);return i!==void 0&&i+f(n,i)<t}function b(n,o,t,i){const e=d(n,o);if(e===void 0)return n;const c=f(n,e),s=h(n,i),l=t==="up"?e-1:e+c;if(l<0||l>=i)return n;const u={...n},p=s[l];if(!p){const C=t==="up"?e-1:e+1;return u[e]={childUuid:null},u[C]={...n[e]},u}const r=d(n,p),v=f(n,r),a=t==="up"?r:e;return u[e]={childUuid:null},u[r]={childUuid:null},t==="up"?(u[a]={...n[e]},u[a+c]={...n[r]}):(u[a]={...n[r]},u[a+v]={...n[e]}),u}function x(n,o,t){const i=d(n,o);if(i===void 0)return!1;const e=f(n,i),c=i+e,s=c+e-1;if(s>=t)return!1;const l=h(n,t);for(let u=c;u<=s;u++)if(l[u])return!1;return!0}function S(n,o,t){return{...n,[t]:{childUuid:o}}}function D(n,o){const t=d(n,o);return t===void 0?n:{...n,[t]:{childUuid:null}}}function U(n,o,t){const i=d(n,o);if(i===void 0)return 0;const e=h(n,t);let c=0;for(let s=i;s<t&&(!e[s]||e[s]===o);s++)c++;return c}function M(n,o,t,i){const e=d(n,o);return e===void 0||t<1||t>U(n,o,i)?n:{...n,[e]:{...n[e],span:{x:t}}}}function O(n,o,t){const i=[],e=d(n,o);if(e===void 0)return i;const c=f(n,e),s=h(n,t);let l=!1;for(let u=e+c;u<t;u++)l?i.push(u):s[u]&&(i.push(u),l=!0);return i}export{x as canChildBeDuplicated,m as canChildMoveDown,g as canChildMoveUp,d as getChildSlot,f as getChildSpan,O as getDisabledSlotsForElement,U as getMaxChildSpan,h as getOccupancy,b as moveChild,S as placeChild,D as removeChild,M as setChildSpan};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.