@nordcraft/runtime 1.0.0

package/dist/styles/style.js

@@ -0,0 +1,196 @@
+import { getClassName, toValidClassName, } from '@nordcraft/core/dist/styling/className';
+import { kebabCase } from '@nordcraft/core/dist/styling/style.css';
+import { variantSelector } from '@nordcraft/core/dist/styling/variantSelector';
+import { omitKeys } from '@nordcraft/core/dist/utils/collections';
+const LEGACY_BREAKPOINTS = {
+    large: 1440,
+    small: 576,
+    medium: 960,
+};
+export const SIZE_PROPERTIES = new Set([
+    'width',
+    'min-width',
+    'max-width',
+    'height',
+    'min-height',
+    'max-height',
+    'margin',
+    'margin-top',
+    'margin-left',
+    'margin-bottom',
+    'margin-right',
+    'padding',
+    'padding-top',
+    'padding-left',
+    'padding-bottom',
+    'padding-right',
+    'gap',
+    'gap-x',
+    'gap-y',
+    'border-radius',
+    'border-bottom-left-radius',
+    'border-bottom-right-radius',
+    'border-top-left-radius',
+    'border-top-right-radius',
+    'border-width',
+    'border-top-width',
+    'border-left-width',
+    'border-bottom-width',
+    'border-right-width',
+    'font-size',
+    'left',
+    'right',
+    'top',
+    'bottom',
+    'outline-width',
+]);
+export const insertStyles = (parent, root, components) => {
+    const getNodeStyles = (node, classHash) => {
+        const style = omitKeys(node.style ?? {}, [
+            'variants',
+            'breakpoints',
+            'mediaQuery',
+            'shadows',
+        ]);
+        const styleElem = document.createElement('style');
+        styleElem.setAttribute('data-hash', classHash);
+        styleElem.appendChild(document.createTextNode(`
+    ${renderVariant('.' + classHash, style)}
+
+${node.variants
+            ? node.variants
+                .map((variant) => {
+                const selector = `.${classHash}${variantSelector(variant)}`;
+                const renderedVariant = renderVariant(selector, variant.style, {
+                    startingStyle: variant.startingStyle,
+                });
+                return variant.mediaQuery
+                    ? `
+                @media (${Object.entries(variant.mediaQuery)
+                        .map(([key, value]) => `${key}: ${value}`)
+                        .filter(Boolean)
+                        .join(') and (')}) {
+                ${renderedVariant}
+                }
+                `
+                    : variant.breakpoint
+                        ? `
+                @media (min-width: ${LEGACY_BREAKPOINTS[variant.breakpoint]}px) {
+                ${renderedVariant}
+                }
+                `
+                        : renderedVariant;
+            })
+                .join('\n')
+            : ''}
+
+${node.animations
+            ? Object.entries(node.animations)
+                .map(([animationName, keyframes]) => {
+                return `
+          @keyframes ${animationName} {
+            ${Object.values(keyframes)
+                    .sort((a, b) => a.position - b.position)
+                    .map(({ key, position, value }) => {
+                    return `
+                ${position * 100}% {
+                  ${key}: ${value};
+                }
+                `;
+                })
+                    .join('\n')}
+          }
+          `;
+            })
+                .join('\n')
+            : ''}
+  `));
+        return styleElem;
+    };
+    // Make sure that CSS for dependant components are rendered first so that instance styles will override.
+    const visitedComponents = new Set();
+    const newStyles = new Map();
+    function insertComponentStyles(component, package_name) {
+        if (visitedComponents.has(component.name)) {
+            return;
+        }
+        visitedComponents.add(component.name);
+        if (!component.nodes) {
+            // eslint-disable-next-line no-console
+            console.warn('Unable to find nodes for component', component.name);
+            return;
+        }
+        Object.entries(component.nodes).forEach(([id, node]) => {
+            if (node.type === 'component') {
+                const childComponent = components.find((c) => c.name ===
+                    [node.package ?? package_name, node.name]
+                        ?.filter((n) => n)
+                        .join('/'));
+                if (childComponent) {
+                    insertComponentStyles(childComponent, node.package ?? package_name);
+                    const instanceClassHash = toValidClassName(`${component.name}:${id}`, true);
+                    newStyles.set(instanceClassHash, getNodeStyles(node, instanceClassHash));
+                }
+            }
+            else if (node.type === 'element') {
+                const classHash = getClassName([node.style, node.variants]);
+                newStyles.set(classHash, getNodeStyles(node, classHash));
+            }
+        });
+    }
+    insertComponentStyles(root, undefined);
+    // Remove old styles.
+    // We do not keep track of changes, so must remove all and re-add as order matters.
+    parent.querySelectorAll('[data-hash]').forEach((node) => node.remove());
+    // Add new styles
+    const fragment = document.createDocumentFragment();
+    newStyles.forEach((style) => {
+        fragment.appendChild(style);
+    });
+    parent.appendChild(fragment);
+};
+const renderVariant = (selector, style, options) => {
+    const scrollbarStyles = Object.entries(style).filter(([key]) => key === 'scrollbar-width');
+    let styles = styleToCss(style);
+    if (options?.startingStyle) {
+        styles = `@starting-style {
+      ${styles}
+    }`;
+    }
+    return `
+  ${selector} {
+    ${styles}
+}
+${scrollbarStyles.length > 0
+        ? `
+  ${selector}::-webkit-scrollbar {
+    ${scrollbarStyles
+            .map(([_, value]) => {
+            switch (value) {
+                case 'none':
+                    return 'width: 0;';
+                case 'thin':
+                    return 'width:4px;';
+                default:
+                    return '';
+            }
+        })
+            .join('\n')}
+  }
+`
+        : ''}
+`;
+};
+export const styleToCss = (style) => {
+    return Object.entries(style)
+        .map(([property, value]) => {
+        const propertyName = kebabCase(property);
+        const propertyValue = String(Number(value)) === String(value) &&
+            SIZE_PROPERTIES.has(propertyName)
+            ? `${Number(value) * 4}px`
+            : value;
+        return `${propertyName}:${propertyValue};`;
+    })
+        .join('\n');
+};
+//# sourceMappingURL=style.js.map

package/dist/styles/style.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"style.js","sourceRoot":"","sources":["../../src/styles/style.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EACZ,gBAAgB,GACjB,MAAM,wCAAwC,CAAA;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAA;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,8CAA8C,CAAA;AAC9E,OAAO,EAAE,QAAQ,EAAE,MAAM,wCAAwC,CAAA;AAEjE,MAAM,kBAAkB,GAAG;IACzB,KAAK,EAAE,IAAI;IACX,KAAK,EAAE,GAAG;IACV,MAAM,EAAE,GAAG;CACZ,CAAA;AAED,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IACrC,OAAO;IACP,WAAW;IACX,WAAW;IACX,QAAQ;IACR,YAAY;IACZ,YAAY;IACZ,QAAQ;IACR,YAAY;IACZ,aAAa;IACb,eAAe;IACf,cAAc;IACd,SAAS;IACT,aAAa;IACb,cAAc;IACd,gBAAgB;IAChB,eAAe;IACf,KAAK;IACL,OAAO;IACP,OAAO;IACP,eAAe;IACf,2BAA2B;IAC3B,4BAA4B;IAC5B,wBAAwB;IACxB,yBAAyB;IACzB,cAAc;IACd,kBAAkB;IAClB,mBAAmB;IACnB,qBAAqB;IACrB,oBAAoB;IACpB,WAAW;IACX,MAAM;IACN,OAAO;IACP,KAAK;IACL,QAAQ;IACR,eAAe;CAChB,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,MAAmB,EACnB,IAAe,EACf,UAAuB,EACvB,EAAE;IACF,MAAM,aAAa,GAAG,CACpB,IAA2C,EAC3C,SAAiB,EACjB,EAAE;QACF,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE;YACvC,UAAU;YACV,aAAa;YACb,YAAY;YACZ,SAAS;SACV,CAAC,CAAA;QAEF,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QACjD,SAAS,CAAC,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC,CAAA;QAC9C,SAAS,CAAC,WAAW,CACnB,QAAQ,CAAC,cAAc,CAAC;MACxB,aAAa,CAAC,GAAG,GAAG,SAAS,EAAE,KAAK,CAAC;;EAGzC,IAAI,CAAC,QAAQ;YACX,CAAC,CAAC,IAAI,CAAC,QAAQ;iBACV,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;gBACf,MAAM,QAAQ,GAAG,IAAI,SAAS,GAAG,eAAe,CAAC,OAAO,CAAC,EAAE,CAAA;gBAC3D,MAAM,eAAe,GAAG,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE;oBAC7D,aAAa,EAAE,OAAO,CAAC,aAAa;iBACrC,CAAC,CAAA;gBACF,OAAO,OAAO,CAAC,UAAU;oBACvB,CAAC,CAAC;0BACY,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC;yBACzC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,KAAK,EAAE,CAAC;yBACzC,MAAM,CAAC,OAAO,CAAC;yBACf,IAAI,CAAC,SAAS,CAAC;kBAChB,eAAe;;iBAEhB;oBACL,CAAC,CAAC,OAAO,CAAC,UAAU;wBAClB,CAAC,CAAC;qCAEE,kBAAkB,CAAC,OAAO,CAAC,UAAU,CACvC;kBACE,eAAe;;iBAEhB;wBACH,CAAC,CAAC,eAAe,CAAA;YACvB,CAAC,CAAC;iBACD,IAAI,CAAC,IAAI,CAAC;YACf,CAAC,CAAC,EACN;;EAGE,IAAI,CAAC,UAAU;YACb,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;iBAC5B,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,SAAS,CAAC,EAAE,EAAE;gBAClC,OAAO;uBACM,aAAa;cACtB,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;qBACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;qBACvC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE;oBAChC,OAAO;kBACL,QAAQ,GAAG,GAAG;oBACZ,GAAG,KAAK,KAAK;;iBAEhB,CAAA;gBACH,CAAC,CAAC;qBACD,IAAI,CAAC,IAAI,CAAC;;WAEd,CAAA;YACH,CAAC,CAAC;iBACD,IAAI,CAAC,IAAI,CAAC;YACf,CAAC,CAAC,EACN;GACG,CAAC,CACC,CAAA;QACD,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,wGAAwG;IACxG,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC5C,SAAS,qBAAqB,CAC5B,SAAoB,EACpB,YAAgC;QAEhC,IAAI,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,OAAM;QACR,CAAC;QACD,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;YACrB,sCAAsC;YACtC,OAAO,CAAC,IAAI,CAAC,oCAAoC,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;YAClE,OAAM;QACR,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE;YACrD,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC9B,MAAM,cAAc,GAAG,UAAU,CAAC,IAAI,CACpC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI;oBACN,CAAC,IAAI,CAAC,OAAO,IAAI,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC;wBACvC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;yBACjB,IAAI,CAAC,GAAG,CAAC,CACf,CAAA;gBACD,IAAI,cAAc,EAAE,CAAC;oBACnB,qBAAqB,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,IAAI,YAAY,CAAC,CAAA;oBAEnE,MAAM,iBAAiB,GAAG,gBAAgB,CACxC,GAAG,SAAS,CAAC,IAAI,IAAI,EAAE,EAAE,EACzB,IAAI,CACL,CAAA;oBACD,SAAS,CAAC,GAAG,CACX,iBAAiB,EACjB,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,CACvC,CAAA;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAA;gBAC3D,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAA;YAC1D,CAAC;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,qBAAqB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAEtC,qBAAqB;IACrB,mFAAmF;IACnF,MAAM,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;IAEvE,iBAAiB;IACjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAA;IAClD,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC,CAAC,CAAA;IACF,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;AAC9B,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CACpB,QAAgB,EAChB,KAAqB,EACrB,OAEC,EACD,EAAE;IACF,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,CAClD,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,iBAAiB,CACrC,CAAA;IAED,IAAI,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;IAC9B,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;QAC3B,MAAM,GAAG;QACL,MAAM;MACR,CAAA;IACJ,CAAC;IAED,OAAO;IACL,QAAQ;MACN,MAAM;;EAGV,eAAe,CAAC,MAAM,GAAG,CAAC;QACxB,CAAC,CAAC;IACF,QAAQ;MACN,eAAe;aACd,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE;YAClB,QAAQ,KAAK,EAAE,CAAC;gBACd,KAAK,MAAM;oBACT,OAAO,WAAW,CAAA;gBACpB,KAAK,MAAM;oBACT,OAAO,YAAY,CAAA;gBACrB;oBACE,OAAO,EAAE,CAAA;YACb,CAAC;QACH,CAAC,CAAC;aACD,IAAI,CAAC,IAAI,CAAC;;CAEhB;QACG,CAAC,CAAC,EACN;CACC,CAAA;AACD,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAE,EAAE;IAClD,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;SACzB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE;QACzB,MAAM,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAA;QACxC,MAAM,aAAa,GACjB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC;YACvC,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC;YAC/B,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI;YAC1B,CAAC,CAAC,KAAK,CAAA;QACX,OAAO,GAAG,YAAY,IAAI,aAAa,GAAG,CAAA;IAC5C,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC,CAAA"}

package/dist/utils/BatchQueue.d.ts

@@ -0,0 +1,10 @@
+/**
+ * A helper class to batch multiple callbacks and process them in a single update step just before the next frame render, but after the current stack.
+ * This is more efficient than processing each callback in a separate requestAnimationFrame due to the overhead.
+ */
+export declare class BatchQueue {
+    private batchQueue;
+    private isProcessing;
+    private processBatch;
+    add(callback: () => void): void;
+}

package/dist/utils/BatchQueue.js

@@ -0,0 +1,25 @@
+/**
+ * A helper class to batch multiple callbacks and process them in a single update step just before the next frame render, but after the current stack.
+ * This is more efficient than processing each callback in a separate requestAnimationFrame due to the overhead.
+ */
+export class BatchQueue {
+    batchQueue = [];
+    isProcessing = false;
+    processBatch() {
+        if (this.isProcessing)
+            return;
+        this.isProcessing = true;
+        requestAnimationFrame(() => {
+            while (this.batchQueue.length > 0) {
+                const callback = this.batchQueue.shift();
+                callback?.();
+            }
+            this.isProcessing = false;
+        });
+    }
+    add(callback) {
+        this.batchQueue.push(callback);
+        this.processBatch();
+    }
+}
+//# sourceMappingURL=BatchQueue.js.map

package/dist/utils/BatchQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BatchQueue.js","sourceRoot":"","sources":["../../src/utils/BatchQueue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,UAAU;IACb,UAAU,GAAsB,EAAE,CAAA;IAClC,YAAY,GAAG,KAAK,CAAA;IACpB,YAAY;QAClB,IAAI,IAAI,CAAC,YAAY;YAAE,OAAM;QAC7B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;QAExB,qBAAqB,CAAC,GAAG,EAAE;YACzB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAA;gBACxC,QAAQ,EAAE,EAAE,CAAA;YACd,CAAC;YACD,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QAC3B,CAAC,CAAC,CAAA;IACJ,CAAC;IACM,GAAG,CAAC,QAAoB;QAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9B,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;CACF"}

package/dist/utils/createFormulaCache.d.ts

@@ -0,0 +1,3 @@
+import type { Component } from '@nordcraft/core/dist/component/component.types';
+import type { FormulaCache } from '../types';
+export declare function createFormulaCache(component: Component): FormulaCache;

package/dist/utils/createFormulaCache.js

@@ -0,0 +1,81 @@
+import { get, mapObject } from '@nordcraft/core/dist/utils/collections';
+import { isDefined } from '@nordcraft/core/dist/utils/util';
+export function createFormulaCache(component) {
+    if (!isDefined(component.formulas)) {
+        return {};
+    }
+    return mapObject(component.formulas, ([name, f]) => {
+        const { canCache, keys } = f.memoize
+            ? getFormulaCacheConfig(f.formula, component)
+            : { canCache: false, keys: [] };
+        let cacheInput;
+        let cacheData;
+        return [
+            name,
+            {
+                get: (data) => {
+                    if (canCache &&
+                        cacheInput &&
+                        keys.every((key) => {
+                            return get(data, key) === get(cacheInput, key);
+                        })) {
+                        return { hit: true, data: cacheData };
+                    }
+                    return { hit: false };
+                },
+                set: (data, result) => {
+                    if (canCache) {
+                        cacheInput = data;
+                        cacheData = result;
+                    }
+                },
+            },
+        ];
+    });
+}
+function getFormulaCacheConfig(formula, component) {
+    const paths = [];
+    function visitOperation(op) {
+        if (!op) {
+            return;
+        }
+        if (op.type == 'path' && op.path[0] !== 'Args') {
+            paths.push(op.path);
+        }
+        if (Array.isArray(op?.arguments)) {
+            ;
+            op?.arguments.forEach((arg) => visitOperation(arg.formula));
+        }
+        if (op.type === 'record' && Array.isArray(op.entries)) {
+            op.entries.forEach((arg) => visitOperation(arg.formula));
+        }
+        if (op.type === 'apply') {
+            if (!component.formulas?.[op.name]?.memoize) {
+                throw new Error('Cannot memoize');
+            }
+            visitOperation(component.formulas?.[op.name]?.formula);
+        }
+    }
+    try {
+        visitOperation(formula);
+    }
+    catch {
+        return {
+            canCache: false,
+            keys: [],
+        };
+    }
+    const keys = [];
+    paths
+        .sort((a, b) => a.length - b.length)
+        .forEach((path) => {
+        if (!keys.some((key) => key.every((k, i) => k === path[i]))) {
+            keys.push(path);
+        }
+    });
+    return {
+        canCache: true,
+        keys,
+    };
+}
+//# sourceMappingURL=createFormulaCache.js.map

package/dist/utils/createFormulaCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"createFormulaCache.js","sourceRoot":"","sources":["../../src/utils/createFormulaCache.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAA;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAA;AAG3D,MAAM,UAAU,kBAAkB,CAAC,SAAoB;IACrD,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnC,OAAO,EAAE,CAAA;IACX,CAAC;IACD,OAAO,SAAS,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QACjD,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO;YAClC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC;YAC7C,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;QACjC,IAAI,UAAe,CAAA;QACnB,IAAI,SAAc,CAAA;QAElB,OAAO;YACL,IAAI;YACJ;gBACE,GAAG,EAAE,CAAC,IAAmB,EAAE,EAAE;oBAC3B,IACE,QAAQ;wBACR,UAAU;wBACV,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;4BACjB,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;wBAChD,CAAC,CAAC,EACF,CAAC;wBACD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAA;oBACvC,CAAC;oBACD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;gBACvB,CAAC;gBACD,GAAG,EAAE,CAAC,IAAmB,EAAE,MAAW,EAAE,EAAE;oBACxC,IAAI,QAAQ,EAAE,CAAC;wBACb,UAAU,GAAG,IAAI,CAAA;wBACjB,SAAS,GAAG,MAAM,CAAA;oBACpB,CAAC;gBACH,CAAC;aACF;SACF,CAAA;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,OAAgB,EAAE,SAAoB;IACnE,MAAM,KAAK,GAAe,EAAE,CAAA;IAC5B,SAAS,cAAc,CAAC,EAAW;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,OAAM;QACR,CAAC;QACD,IAAI,EAAE,CAAC,IAAI,IAAI,MAAM,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;YAC/C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAE,EAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC1C,CAAC;YAAC,EAAwB,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CACpD,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAC5B,CAAA;QACH,CAAC;QACD,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;YACtD,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;QAC1D,CAAC;QAED,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC;gBAC5C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAA;YACnC,CAAC;YACD,cAAc,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;IACD,IAAI,CAAC;QACH,cAAc,CAAC,OAAO,CAAC,CAAA;IACzB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,EAAE;SACT,CAAA;IACH,CAAC;IAED,MAAM,IAAI,GAAe,EAAE,CAAA;IAC3B,KAAK;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;SACnC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAChB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;IACH,CAAC,CAAC,CAAA;IACJ,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,IAAI;KACL,CAAA;AACH,CAAC"}

package/dist/utils/findNearestLine.d.ts

@@ -0,0 +1,13 @@
+import type { Line, Point } from '../editor/types';
+/**
+ * Finds the nearest line to a given point from an array of lines.
+ *
+ * @param lines - An array of line segments defined by their endpoints.
+ * @param point - The point to which the nearest line is to be found.
+ * @returns The line segment nearest to the given point.
+ */
+export declare function findNearestLine(lines: Line[], point: Point): {
+    nearestLine: Line | null;
+    dist: number;
+    projectionPoint: number;
+};

package/dist/utils/findNearestLine.js

@@ -0,0 +1,74 @@
+/**
+ * Finds the nearest line to a given point from an array of lines.
+ *
+ * @param lines - An array of line segments defined by their endpoints.
+ * @param point - The point to which the nearest line is to be found.
+ * @returns The line segment nearest to the given point.
+ */
+export function findNearestLine(lines, point) {
+    let minDistSquared = Infinity;
+    let nearestLine = null;
+    let nearestProjectionPoint = 0;
+    for (const line of lines) {
+        const { distSquared, projectionPoint } = distancePointToSegmentSquared(point, line);
+        if (distSquared < minDistSquared) {
+            minDistSquared = distSquared;
+            nearestLine = line;
+            nearestProjectionPoint = projectionPoint;
+        }
+    }
+    return {
+        nearestLine,
+        dist: Math.sqrt(minDistSquared),
+        projectionPoint: nearestProjectionPoint,
+    };
+}
+/**
+ * Represents where the perpendicular projection of the point onto the infinite line lies relative to the line segment:
+ *  -	If t is 0, the projection is at (x1, y1).
+ *  -	If t is 1, the projection is at (x2, y2).
+ *  -	If t is between 0 and 1, the projection lies somewhere between the two endpoints.
+ *
+ * (x1, y1) *---o-----------* (x2, y2)
+ *              |          /
+ *              |         /
+ *              |        /
+ *              |       /
+ *              |      /
+ *  MIN_DIST -> |     /
+ *              |    /
+ *              |   /
+ *              |  /
+ *              | /
+ *              |/
+ *            (x, y)
+ *
+ * Where "o" The length along the line segment where the projection point lies.
+ *
+ * Notice that the calculation works for diagonal lines as well as horizontal and vertical lines.
+ */
+function distancePointToSegmentSquared(point, line) {
+    const dx = line.x2 - line.x1;
+    const dy = line.y2 - line.y1;
+    const l2 = dx * dx + dy * dy;
+    // If l2 is zero, the line segment is actually a point. We return the squared distance between the point and this single point.
+    if (l2 === 0) {
+        return {
+            distSquared: (point.x - line.x1) * (point.x - line.x1) +
+                (point.y - line.y1) * (point.y - line.y1),
+            projectionPoint: 0.5,
+        };
+    }
+    let projectionPoint = ((point.x - line.x1) * dx + (point.y - line.y1) * dy) / l2;
+    // Clamp t to [0,1] for the projection point to lie within the finite line segment.
+    projectionPoint = Math.max(0, Math.min(1, projectionPoint));
+    const projX = line.x1 + projectionPoint * dx;
+    const projY = line.y1 + projectionPoint * dy;
+    // No need to take the square root, since we are only comparing distances and square root is monotonic.
+    return {
+        distSquared: (point.x - projX) * (point.x - projX) +
+            (point.y - projY) * (point.y - projY),
+        projectionPoint,
+    };
+}
+//# sourceMappingURL=findNearestLine.js.map

package/dist/utils/findNearestLine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findNearestLine.js","sourceRoot":"","sources":["../../src/utils/findNearestLine.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAa,EACb,KAAY;IAEZ,IAAI,cAAc,GAAG,QAAQ,CAAA;IAC7B,IAAI,WAAW,GAAgB,IAAI,CAAA;IACnC,IAAI,sBAAsB,GAAG,CAAC,CAAA;IAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,6BAA6B,CACpE,KAAK,EACL,IAAI,CACL,CAAA;QACD,IAAI,WAAW,GAAG,cAAc,EAAE,CAAC;YACjC,cAAc,GAAG,WAAW,CAAA;YAC5B,WAAW,GAAG,IAAI,CAAA;YAClB,sBAAsB,GAAG,eAAe,CAAA;QAC1C,CAAC;IACH,CAAC;IAED,OAAO;QACL,WAAW;QACX,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC;QAC/B,eAAe,EAAE,sBAAsB;KACxC,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,SAAS,6BAA6B,CAAC,KAAY,EAAE,IAAU;IAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;IAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;IAE5B,+HAA+H;IAC/H,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO;YACL,WAAW,EACT,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;gBACzC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAC3C,eAAe,EAAE,GAAG;SACrB,CAAA;IACH,CAAC;IAED,IAAI,eAAe,GACjB,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAA;IAE5D,mFAAmF;IACnF,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAA;IAE3D,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,eAAe,GAAG,EAAE,CAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,eAAe,GAAG,EAAE,CAAA;IAE5C,uGAAuG;IACvG,OAAO;QACL,WAAW,EACT,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;YACrC,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;QACvC,eAAe;KAChB,CAAA;AACH,CAAC"}

package/dist/utils/findNearestLine.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/utils/findNearestLine.test.js

@@ -0,0 +1,59 @@
+import { findNearestLine } from './findNearestLine';
+describe('findNearestLine', () => {
+    test('should find the nearest line to a point', () => {
+        const lines = [
+            { x1: 0, y1: 0, x2: 0, y2: 1 },
+            { x1: 1, y1: 0, x2: 1, y2: 1 },
+            { x1: 2, y1: 0, x2: 2, y2: 1 },
+        ];
+        const point = { x: 1.5, y: 0.5 };
+        const nearestLine = findNearestLine(lines, point)?.nearestLine;
+        expect(nearestLine).toEqual({ x1: 1, y1: 0, x2: 1, y2: 1 });
+    });
+    test('should handle point exactly on a line', () => {
+        const lines = [
+            { x1: 0, y1: 0, x2: 2, y2: 0 },
+            { x1: 1, y1: -1, x2: 1, y2: 1 },
+        ];
+        const point = { x: 1, y: 0.5 };
+        const nearestLine = findNearestLine(lines, point)?.nearestLine;
+        expect(nearestLine).toEqual({ x1: 1, y1: -1, x2: 1, y2: 1 });
+    });
+    test('should handle empty lines array', () => {
+        const lines = [];
+        const point = { x: 0, y: 0 };
+        expect(findNearestLine(lines, point).nearestLine).toBeNull();
+    });
+    test('should handle lines with zero length (points)', () => {
+        const lines = [
+            { x1: 1, y1: 1, x2: 1, y2: 1 },
+            { x1: 2, y1: 2, x2: 3, y2: 3 },
+        ];
+        const point = { x: 1, y: 1.5 };
+        const nearestLine = findNearestLine(lines, point)?.nearestLine;
+        expect(nearestLine).toEqual({ x1: 1, y1: 1, x2: 1, y2: 1 });
+    });
+    test('should handle negative coordinates', () => {
+        const lines = [
+            { x1: -2, y1: -2, x2: -2, y2: 2 },
+            { x1: -2, y1: 2, x2: 2, y2: 2 },
+            { x1: 2, y1: 2, x2: 2, y2: -2 },
+            { x1: 2, y1: -2, x2: -2, y2: -2 },
+        ];
+        const point = { x: 0, y: 0 };
+        const nearestLine = findNearestLine(lines, point)?.nearestLine;
+        // The point is inside the square; function should return one of the sides
+        expect(nearestLine).toEqual({ x1: -2, y1: -2, x2: -2, y2: 2 });
+    });
+    test('should handle when multiple lines are equally close', () => {
+        const lines = [
+            { x1: 0, y1: 1, x2: 1, y2: 1 },
+            { x1: 0, y1: -1, x2: 1, y2: -1 },
+        ];
+        const point = { x: 0.5, y: 0 };
+        const nearestLine = findNearestLine(lines, point)?.nearestLine;
+        // Both lines are at distance 1; the function should return the first one
+        expect(nearestLine).toEqual({ x1: 0, y1: 1, x2: 1, y2: 1 });
+    });
+});
+//# sourceMappingURL=findNearestLine.test.js.map

package/dist/utils/findNearestLine.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findNearestLine.test.js","sourceRoot":"","sources":["../../src/utils/findNearestLine.test.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AAEnD,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAW;YACpB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC9B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC9B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;SAC/B,CAAA;QACD,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;QACvC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,WAAW,CAAA;QAC9D,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAW;YACpB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC9B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;SAChC,CAAA;QACD,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;QACrC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,WAAW,CAAA;QAC9D,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAC9D,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAW,EAAE,CAAA;QACxB,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;QACnC,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,QAAQ,EAAE,CAAA;IAC9D,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAW;YACpB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC9B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;SAC/B,CAAA;QACD,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;QACrC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,WAAW,CAAA;QAC9D,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAW;YACpB,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YACjC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC/B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE;YAC/B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE;SAClC,CAAA;QACD,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;QACnC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,WAAW,CAAA;QAC9D,0EAA0E;QAC1E,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAChE,CAAC,CAAC,CAAA;IAEF,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAW;YACpB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC9B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE;SACjC,CAAA;QACD,MAAM,KAAK,GAAU,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;QACrC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,WAAW,CAAA;QAC9D,yEAAyE;QACzE,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/utils/getDragData.d.ts

@@ -0,0 +1 @@
+export declare function getDragData(event: Event): Record<string, any> | undefined;

package/dist/utils/getDragData.js

@@ -0,0 +1,10 @@
+export function getDragData(event) {
+    if (event instanceof DragEvent) {
+        return Array.from(event.dataTransfer?.items ?? []).reduce((dragData, item) => {
+            dragData[item.type] = event.dataTransfer?.getData(item.type);
+            return dragData;
+        }, {});
+    }
+    return;
+}
+//# sourceMappingURL=getDragData.js.map

package/dist/utils/getDragData.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getDragData.js","sourceRoot":"","sources":["../../src/utils/getDragData.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,WAAW,CAAC,KAAY;IACtC,IAAI,KAAK,YAAY,SAAS,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAEvD,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE;YACnB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC5D,OAAO,QAAQ,CAAA;QACjB,CAAC,EAAE,EAAE,CAAC,CAAA;IACR,CAAC;IACD,OAAM;AACR,CAAC"}

package/dist/utils/getElementTagName.d.ts

@@ -0,0 +1,3 @@
+import type { ElementNodeModel } from '@nordcraft/core/dist/component/component.types';
+import type { ComponentContext } from '../types';
+export declare function getElementTagName(node: ElementNodeModel, ctx: ComponentContext, id: string): string;

package/dist/utils/getElementTagName.js

@@ -0,0 +1,7 @@
+export function getElementTagName(node, ctx, id) {
+    if (ctx.component.version === 2 && id === 'root') {
+        return `${ctx.package ?? ctx.toddle.project}-${node.tag}`;
+    }
+    return node.tag;
+}
+//# sourceMappingURL=getElementTagName.js.map

package/dist/utils/getElementTagName.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getElementTagName.js","sourceRoot":"","sources":["../../src/utils/getElementTagName.ts"],"names":[],"mappings":"AAGA,MAAM,UAAU,iBAAiB,CAC/B,IAAsB,EACtB,GAAqB,EACrB,EAAU;IAEV,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QACjD,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,EAAE,CAAA;IAC3D,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAA;AACjB,CAAC"}

package/dist/utils/nodes.d.ts

@@ -0,0 +1,21 @@
+import type { Component, NodeModel } from '@nordcraft/core/dist/component/component.types';
+type NodeWithNodeId = NodeModel & {
+    nodeId: string;
+};
+interface NodeAndAncestorLookup {
+    node: NodeWithNodeId;
+    ancestors: NodeWithNodeId[];
+}
+export declare const getNodeAndAncestors: (component: Component, root: NodeModel, id: unknown) => NodeAndAncestorLookup | undefined;
+export declare const isNodeOrAncestorConditional: (nodeLookup?: NodeAndAncestorLookup) => nodeLookup is NodeAndAncestorLookup;
+/**
+ * @returns The next toddle sibling element or null if this is the last element. A toddle sibling is a sibling with a higher index or a the index, but a higher repeat index.
+ */
+export declare const getNextSiblingElement: (path: string, parentElement: Element | ShadowRoot) => Element | null;
+/**
+ * This function efficiently ensures that:
+ * 1. New items are added in the correct position.
+ * 2. Existing items are not moved if they are already in the correct order.
+ */
+export declare function ensureEfficientOrdering(parentElement: Element | ShadowRoot, items: ReadonlyArray<Element | Text>, nextElement?: Element | Text | null): void;
+export {};

package/dist/utils/nodes.js

@@ -0,0 +1,89 @@
+export const getNodeAndAncestors = (component, root, id) => {
+    if (typeof id !== 'string' || id.length === 0) {
+        return undefined;
+    }
+    const path = id.split('.');
+    const pathParsed = path.map((n) => parseInt(n));
+    const ancestors = [];
+    // nodePath skips the root element as it's selected as the initial
+    // value in the reduce below
+    const nodePath = pathParsed.slice(1);
+    const node = nodePath.reduce((node, childIndex, i) => {
+        switch (node?.type) {
+            // 'text' elements don't have any children
+            case 'element':
+            case 'component':
+            case 'slot':
+                // Ancestors are elements before the target node
+                if (i <= nodePath.length - 1) {
+                    ancestors.push({
+                        ...node,
+                        // Use the original path as origin to get correct nodeIds
+                        nodeId: path.slice(0, i + 1).join('.'),
+                    });
+                }
+                return component.nodes[node.children[childIndex]];
+            default:
+                return undefined;
+        }
+    }, root);
+    if (node === undefined) {
+        return undefined;
+    }
+    return { node: { ...node, nodeId: id }, ancestors };
+};
+export const isNodeOrAncestorConditional = (nodeLookup) => nodeLookup?.node?.condition !== undefined ||
+    nodeLookup?.ancestors.some((a) => a.condition !== undefined) === true;
+/**
+ * @returns The next toddle sibling element or null if this is the last element. A toddle sibling is a sibling with a higher index or a the index, but a higher repeat index.
+ */
+export const getNextSiblingElement = (path, parentElement) => {
+    const pathParts = path.split('.');
+    const lastPathPart = pathParts.slice(-1)[0];
+    const index = parseInt(lastPathPart);
+    const repeatIndex = parseInt(String(lastPathPart.split('(')[1]));
+    // Find the first child that either has a higher index or a similar index, but higher repeat index
+    for (const child of parentElement.children) {
+        const childPath = child.getAttribute('data-id');
+        const lastChildPathPart = childPath?.split('.').slice(-1)[0];
+        const childIndex = parseInt(String(lastChildPathPart));
+        if (childIndex === index &&
+            parseInt(String(lastChildPathPart?.split('(')[1])) > repeatIndex) {
+            return child;
+        }
+        if (childIndex > index) {
+            return child;
+        }
+    }
+    return null;
+};
+/**
+ * This function efficiently ensures that:
+ * 1. New items are added in the correct position.
+ * 2. Existing items are not moved if they are already in the correct order.
+ */
+export function ensureEfficientOrdering(parentElement, items, nextElement = null) {
+    // Identify the starting point for comparisons.
+    let insertBeforeElement = nextElement; // If insertBeforeElement is null, items will be appended at the end.
+    // To track the current position in the DOM, we'll use a marker that advances through the sibling elements.
+    let currentMarker = insertBeforeElement
+        ? insertBeforeElement.previousSibling
+        : parentElement.lastChild;
+    // We'll process the items array in reverse order to minimize the number of DOM operations.
+    for (let i = items.length - 1; i >= 0; i--) {
+        const item = items[i];
+        // Check if the item is already in the correct position by comparing it with the currentMarker.
+        if (item === currentMarker) {
+            // The item is in the correct position, move the marker to the previous sibling.
+            currentMarker = item.previousSibling;
+        }
+        else {
+            // The item is either not in the DOM or not in the correct position.
+            // Insert the item before the insertBeforeElement (or append it if insertBeforeElement is null).
+            parentElement.insertBefore(item, insertBeforeElement);
+        }
+        // Update insertBeforeElement to the current item for the next iteration, as we need to insert subsequent items before this one.
+        insertBeforeElement = item;
+    }
+}
+//# sourceMappingURL=nodes.js.map