@new-black/lyra 0.1.10 → 0.1.11

package/dist/lyra243.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra243.js","sources":["../node_modules/framer-motion/dist/es/render/utils/flat-tree.mjs"],"sourcesContent":["import { addUniqueItem, removeItem } from '../../utils/array.mjs';\nimport { compareByDepth } from './compare-by-depth.mjs';\n\nclass FlatTree {\n    constructor() {\n        this.children = [];\n        this.isDirty = false;\n    }\n    add(child) {\n        addUniqueItem(this.children, child);\n        this.isDirty = true;\n    }\n    remove(child) {\n        removeItem(this.children, child);\n        this.isDirty = true;\n    }\n    forEach(callback) {\n        this.isDirty && this.children.sort(compareByDepth);\n        this.isDirty = false;\n        this.children.forEach(callback);\n    }\n}\n\nexport { FlatTree };\n"],"names":["FlatTree","child","addUniqueItem","removeItem","callback","compareByDepth"],"mappings":";;AAGA,MAAMA,EAAS;AAAA,EACX,cAAc;AACV,SAAK,WAAW,IAChB,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,IAAIC,GAAO;AACP,IAAAC,EAAc,KAAK,UAAUD,CAAK,GAClC,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,OAAOA,GAAO;AACV,IAAAE,EAAW,KAAK,UAAUF,CAAK,GAC/B,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,QAAQG,GAAU;AACd,SAAK,WAAW,KAAK,SAAS,KAAKC,CAAc,GACjD,KAAK,UAAU,IACf,KAAK,SAAS,QAAQD,CAAQ;AAAA,EACjC;AACL;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra243.js","sources":["../node_modules/framer-motion/dist/es/animation/generators/spring/find.mjs"],"sourcesContent":["import { warning } from '../../../utils/errors.mjs';\nimport { clamp } from '../../../utils/clamp.mjs';\nimport { secondsToMilliseconds, millisecondsToSeconds } from '../../../utils/time-conversion.mjs';\n\nconst safeMin = 0.001;\nconst minDuration = 0.01;\nconst maxDuration = 10.0;\nconst minDamping = 0.05;\nconst maxDamping = 1;\nfunction findSpring({ duration = 800, bounce = 0.25, velocity = 0, mass = 1, }) {\n    let envelope;\n    let derivative;\n    warning(duration <= secondsToMilliseconds(maxDuration), \"Spring duration must be 10 seconds or less\");\n    let dampingRatio = 1 - bounce;\n    /**\n     * Restrict dampingRatio and duration to within acceptable ranges.\n     */\n    dampingRatio = clamp(minDamping, maxDamping, dampingRatio);\n    duration = clamp(minDuration, maxDuration, millisecondsToSeconds(duration));\n    if (dampingRatio < 1) {\n        /**\n         * Underdamped spring\n         */\n        envelope = (undampedFreq) => {\n            const exponentialDecay = undampedFreq * dampingRatio;\n            const delta = exponentialDecay * duration;\n            const a = exponentialDecay - velocity;\n            const b = calcAngularFreq(undampedFreq, dampingRatio);\n            const c = Math.exp(-delta);\n            return safeMin - (a / b) * c;\n        };\n        derivative = (undampedFreq) => {\n            const exponentialDecay = undampedFreq * dampingRatio;\n            const delta = exponentialDecay * duration;\n            const d = delta * velocity + velocity;\n            const e = Math.pow(dampingRatio, 2) * Math.pow(undampedFreq, 2) * duration;\n            const f = Math.exp(-delta);\n            const g = calcAngularFreq(Math.pow(undampedFreq, 2), dampingRatio);\n            const factor = -envelope(undampedFreq) + safeMin > 0 ? -1 : 1;\n            return (factor * ((d - e) * f)) / g;\n        };\n    }\n    else {\n        /**\n         * Critically-damped spring\n         */\n        envelope = (undampedFreq) => {\n            const a = Math.exp(-undampedFreq * duration);\n            const b = (undampedFreq - velocity) * duration + 1;\n            return -safeMin + a * b;\n        };\n        derivative = (undampedFreq) => {\n            const a = Math.exp(-undampedFreq * duration);\n            const b = (velocity - undampedFreq) * (duration * duration);\n            return a * b;\n        };\n    }\n    const initialGuess = 5 / duration;\n    const undampedFreq = approximateRoot(envelope, derivative, initialGuess);\n    duration = secondsToMilliseconds(duration);\n    if (isNaN(undampedFreq)) {\n        return {\n            stiffness: 100,\n            damping: 10,\n            duration,\n        };\n    }\n    else {\n        const stiffness = Math.pow(undampedFreq, 2) * mass;\n        return {\n            stiffness,\n            damping: dampingRatio * 2 * Math.sqrt(mass * stiffness),\n            duration,\n        };\n    }\n}\nconst rootIterations = 12;\nfunction approximateRoot(envelope, derivative, initialGuess) {\n    let result = initialGuess;\n    for (let i = 1; i < rootIterations; i++) {\n        result = result - envelope(result) / derivative(result);\n    }\n    return result;\n}\nfunction calcAngularFreq(undampedFreq, dampingRatio) {\n    return undampedFreq * Math.sqrt(1 - dampingRatio * dampingRatio);\n}\n\nexport { calcAngularFreq, findSpring, maxDamping, maxDuration, minDamping, minDuration };\n"],"names":["safeMin","minDuration","maxDuration","minDamping","maxDamping","findSpring","duration","bounce","velocity","mass","envelope","derivative","warning","secondsToMilliseconds","dampingRatio","clamp","millisecondsToSeconds","undampedFreq","exponentialDecay","delta","a","b","calcAngularFreq","c","d","e","f","g","initialGuess","approximateRoot","stiffness","rootIterations","result","i"],"mappings":";;;AAIA,MAAMA,IAAU,MACVC,IAAc,MACdC,IAAc,IACdC,IAAa,MACbC,IAAa;AACnB,SAASC,EAAW,EAAE,UAAAC,IAAW,KAAK,QAAAC,IAAS,MAAM,UAAAC,IAAW,GAAG,MAAAC,IAAO,KAAM;AAC5E,MAAIC,GACAC;AACJ,EAAAC,EAAQN,KAAYO,EAAsBX,CAAW,GAAG,4CAA4C;AACpG,MAAIY,IAAe,IAAIP;AAIvB,EAAAO,IAAeC,EAAMZ,GAAYC,GAAYU,CAAY,GACzDR,IAAWS,EAAMd,GAAaC,GAAac,EAAsBV,CAAQ,CAAC,GACtEQ,IAAe,KAIfJ,IAAW,CAACO,MAAiB;AACzB,UAAMC,IAAmBD,IAAeH,GAClCK,IAAQD,IAAmBZ,GAC3Bc,IAAIF,IAAmBV,GACvBa,IAAIC,EAAgBL,GAAcH,CAAY,GAC9CS,IAAI,KAAK,IAAI,CAACJ,CAAK;AACzB,WAAOnB,IAAWoB,IAAIC,IAAKE;AAAA,EACvC,GACQZ,IAAa,CAACM,MAAiB;AAE3B,UAAME,IADmBF,IAAeH,IACPR,GAC3BkB,IAAIL,IAAQX,IAAWA,GACvBiB,IAAI,KAAK,IAAIX,GAAc,CAAC,IAAI,KAAK,IAAIG,GAAc,CAAC,IAAIX,GAC5DoB,IAAI,KAAK,IAAI,CAACP,CAAK,GACnBQ,IAAIL,EAAgB,KAAK,IAAIL,GAAc,CAAC,GAAGH,CAAY;AAEjE,YADe,CAACJ,EAASO,CAAY,IAAIjB,IAAU,IAAI,KAAK,OACzCwB,IAAIC,KAAKC,KAAMC;AAAA,EAC9C,MAMQjB,IAAW,CAACO,MAAiB;AACzB,UAAMG,IAAI,KAAK,IAAI,CAACH,IAAeX,CAAQ,GACrCe,KAAKJ,IAAeT,KAAYF,IAAW;AACjD,WAAO,CAACN,IAAUoB,IAAIC;AAAA,EAClC,GACQV,IAAa,CAACM,MAAiB;AAC3B,UAAMG,IAAI,KAAK,IAAI,CAACH,IAAeX,CAAQ,GACrCe,KAAKb,IAAWS,MAAiBX,IAAWA;AAClD,WAAOc,IAAIC;AAAA,EACvB;AAEI,QAAMO,IAAe,IAAItB,GACnBW,IAAeY,EAAgBnB,GAAUC,GAAYiB,CAAY;AAEvE,MADAtB,IAAWO,EAAsBP,CAAQ,GACrC,MAAMW,CAAY;AAClB,WAAO;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,UAAAX;AAAA,IACZ;AAES;AACD,UAAMwB,IAAY,KAAK,IAAIb,GAAc,CAAC,IAAIR;AAC9C,WAAO;AAAA,MACH,WAAAqB;AAAA,MACA,SAAShB,IAAe,IAAI,KAAK,KAAKL,IAAOqB,CAAS;AAAA,MACtD,UAAAxB;AAAA,IACZ;AAAA,EACK;AACL;AACA,MAAMyB,IAAiB;AACvB,SAASF,EAAgBnB,GAAUC,GAAYiB,GAAc;AACzD,MAAII,IAASJ;AACb,WAASK,IAAI,GAAGA,IAAIF,GAAgBE;AAChC,IAAAD,IAASA,IAAStB,EAASsB,CAAM,IAAIrB,EAAWqB,CAAM;AAE1D,SAAOA;AACX;AACA,SAASV,EAAgBL,GAAcH,GAAc;AACjD,SAAOG,IAAe,KAAK,KAAK,IAAIH,IAAeA,CAAY;AACnE;","x_google_ignoreList":[0]}

package/dist/lyra244.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e,i){e.indexOf(i)===-1&&e.push(i)}function d(e,i){const n=e.indexOf(i);n>-1&&e.splice(n,1)}exports.addUniqueItem=t;exports.removeItem=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./lyra245.cjs"),r=require("./lyra246.cjs");class i{constructor(){this.children=[],this.isDirty=!1}add(e){t.addUniqueItem(this.children,e),this.isDirty=!0}remove(e){t.removeItem(this.children,e),this.isDirty=!0}forEach(e){this.isDirty&&this.children.sort(r.compareByDepth),this.isDirty=!1,this.children.forEach(e)}}exports.FlatTree=i;

package/dist/lyra244.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra244.cjs","sources":["../node_modules/framer-motion/dist/es/utils/array.mjs"],"sourcesContent":["function addUniqueItem(arr, item) {\n    if (arr.indexOf(item) === -1)\n        arr.push(item);\n}\nfunction removeItem(arr, item) {\n    const index = arr.indexOf(item);\n    if (index > -1)\n        arr.splice(index, 1);\n}\n// Adapted from array-move\nfunction moveItem([...arr], fromIndex, toIndex) {\n    const startIndex = fromIndex < 0 ? arr.length + fromIndex : fromIndex;\n    if (startIndex >= 0 && startIndex < arr.length) {\n        const endIndex = toIndex < 0 ? arr.length + toIndex : toIndex;\n        const [item] = arr.splice(fromIndex, 1);\n        arr.splice(endIndex, 0, item);\n    }\n    return arr;\n}\n\nexport { addUniqueItem, moveItem, removeItem };\n"],"names":["addUniqueItem","arr","item","removeItem","index"],"mappings":"gFAAA,SAASA,EAAcC,EAAKC,EAAM,CAC1BD,EAAI,QAAQC,CAAI,IAAM,IACtBD,EAAI,KAAKC,CAAI,CACrB,CACA,SAASC,EAAWF,EAAKC,EAAM,CAC3B,MAAME,EAAQH,EAAI,QAAQC,CAAI,EAC1BE,EAAQ,IACRH,EAAI,OAAOG,EAAO,CAAC,CAC3B","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra244.cjs","sources":["../node_modules/framer-motion/dist/es/render/utils/flat-tree.mjs"],"sourcesContent":["import { addUniqueItem, removeItem } from '../../utils/array.mjs';\nimport { compareByDepth } from './compare-by-depth.mjs';\n\nclass FlatTree {\n    constructor() {\n        this.children = [];\n        this.isDirty = false;\n    }\n    add(child) {\n        addUniqueItem(this.children, child);\n        this.isDirty = true;\n    }\n    remove(child) {\n        removeItem(this.children, child);\n        this.isDirty = true;\n    }\n    forEach(callback) {\n        this.isDirty && this.children.sort(compareByDepth);\n        this.isDirty = false;\n        this.children.forEach(callback);\n    }\n}\n\nexport { FlatTree };\n"],"names":["FlatTree","child","addUniqueItem","removeItem","callback","compareByDepth"],"mappings":"4IAGA,MAAMA,CAAS,CACX,aAAc,CACV,KAAK,SAAW,GAChB,KAAK,QAAU,EAClB,CACD,IAAIC,EAAO,CACPC,EAAAA,cAAc,KAAK,SAAUD,CAAK,EAClC,KAAK,QAAU,EAClB,CACD,OAAOA,EAAO,CACVE,EAAAA,WAAW,KAAK,SAAUF,CAAK,EAC/B,KAAK,QAAU,EAClB,CACD,QAAQG,EAAU,CACd,KAAK,SAAW,KAAK,SAAS,KAAKC,EAAc,cAAA,EACjD,KAAK,QAAU,GACf,KAAK,SAAS,QAAQD,CAAQ,CACjC,CACL","x_google_ignoreList":[0]}

package/dist/lyra244.js

@@ -1,11 +1,19 @@
-function f(e, n) {
-  e.indexOf(n) === -1 && e.push(n);
-}
-function d(e, n) {
-  const i = e.indexOf(n);
-  i > -1 && e.splice(i, 1);
+import { addUniqueItem as t, removeItem as r } from "./lyra245.js";
+import { compareByDepth as e } from "./lyra246.js";
+class c {
+  constructor() {
+    this.children = [], this.isDirty = !1;
+  }
+  add(i) {
+    t(this.children, i), this.isDirty = !0;
+  }
+  remove(i) {
+    r(this.children, i), this.isDirty = !0;
+  }
+  forEach(i) {
+    this.isDirty && this.children.sort(e), this.isDirty = !1, this.children.forEach(i);
+  }
 }
 export {
-  f as addUniqueItem,
-  d as removeItem
+  c as FlatTree
 };

package/dist/lyra244.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra244.js","sources":["../node_modules/framer-motion/dist/es/utils/array.mjs"],"sourcesContent":["function addUniqueItem(arr, item) {\n    if (arr.indexOf(item) === -1)\n        arr.push(item);\n}\nfunction removeItem(arr, item) {\n    const index = arr.indexOf(item);\n    if (index > -1)\n        arr.splice(index, 1);\n}\n// Adapted from array-move\nfunction moveItem([...arr], fromIndex, toIndex) {\n    const startIndex = fromIndex < 0 ? arr.length + fromIndex : fromIndex;\n    if (startIndex >= 0 && startIndex < arr.length) {\n        const endIndex = toIndex < 0 ? arr.length + toIndex : toIndex;\n        const [item] = arr.splice(fromIndex, 1);\n        arr.splice(endIndex, 0, item);\n    }\n    return arr;\n}\n\nexport { addUniqueItem, moveItem, removeItem };\n"],"names":["addUniqueItem","arr","item","removeItem","index"],"mappings":"AAAA,SAASA,EAAcC,GAAKC,GAAM;AAC9B,EAAID,EAAI,QAAQC,CAAI,MAAM,MACtBD,EAAI,KAAKC,CAAI;AACrB;AACA,SAASC,EAAWF,GAAKC,GAAM;AAC3B,QAAME,IAAQH,EAAI,QAAQC,CAAI;AAC9B,EAAIE,IAAQ,MACRH,EAAI,OAAOG,GAAO,CAAC;AAC3B;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra244.js","sources":["../node_modules/framer-motion/dist/es/render/utils/flat-tree.mjs"],"sourcesContent":["import { addUniqueItem, removeItem } from '../../utils/array.mjs';\nimport { compareByDepth } from './compare-by-depth.mjs';\n\nclass FlatTree {\n    constructor() {\n        this.children = [];\n        this.isDirty = false;\n    }\n    add(child) {\n        addUniqueItem(this.children, child);\n        this.isDirty = true;\n    }\n    remove(child) {\n        removeItem(this.children, child);\n        this.isDirty = true;\n    }\n    forEach(callback) {\n        this.isDirty && this.children.sort(compareByDepth);\n        this.isDirty = false;\n        this.children.forEach(callback);\n    }\n}\n\nexport { FlatTree };\n"],"names":["FlatTree","child","addUniqueItem","removeItem","callback","compareByDepth"],"mappings":";;AAGA,MAAMA,EAAS;AAAA,EACX,cAAc;AACV,SAAK,WAAW,IAChB,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,IAAIC,GAAO;AACP,IAAAC,EAAc,KAAK,UAAUD,CAAK,GAClC,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,OAAOA,GAAO;AACV,IAAAE,EAAW,KAAK,UAAUF,CAAK,GAC/B,KAAK,UAAU;AAAA,EAClB;AAAA,EACD,QAAQG,GAAU;AACd,SAAK,WAAW,KAAK,SAAS,KAAKC,CAAc,GACjD,KAAK,UAAU,IACf,KAAK,SAAS,QAAQD,CAAQ;AAAA,EACjC;AACL;","x_google_ignoreList":[0]}

package/dist/lyra245.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=(e,t)=>e.depth-t.depth;exports.compareByDepth=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e,i){e.indexOf(i)===-1&&e.push(i)}function d(e,i){const n=e.indexOf(i);n>-1&&e.splice(n,1)}exports.addUniqueItem=t;exports.removeItem=d;

package/dist/lyra245.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra245.cjs","sources":["../node_modules/framer-motion/dist/es/render/utils/compare-by-depth.mjs"],"sourcesContent":["const compareByDepth = (a, b) => a.depth - b.depth;\n\nexport { compareByDepth };\n"],"names":["compareByDepth","a","b"],"mappings":"gFAAK,MAACA,EAAiB,CAACC,EAAGC,IAAMD,EAAE,MAAQC,EAAE","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra245.cjs","sources":["../node_modules/framer-motion/dist/es/utils/array.mjs"],"sourcesContent":["function addUniqueItem(arr, item) {\n    if (arr.indexOf(item) === -1)\n        arr.push(item);\n}\nfunction removeItem(arr, item) {\n    const index = arr.indexOf(item);\n    if (index > -1)\n        arr.splice(index, 1);\n}\n// Adapted from array-move\nfunction moveItem([...arr], fromIndex, toIndex) {\n    const startIndex = fromIndex < 0 ? arr.length + fromIndex : fromIndex;\n    if (startIndex >= 0 && startIndex < arr.length) {\n        const endIndex = toIndex < 0 ? arr.length + toIndex : toIndex;\n        const [item] = arr.splice(fromIndex, 1);\n        arr.splice(endIndex, 0, item);\n    }\n    return arr;\n}\n\nexport { addUniqueItem, moveItem, removeItem };\n"],"names":["addUniqueItem","arr","item","removeItem","index"],"mappings":"gFAAA,SAASA,EAAcC,EAAKC,EAAM,CAC1BD,EAAI,QAAQC,CAAI,IAAM,IACtBD,EAAI,KAAKC,CAAI,CACrB,CACA,SAASC,EAAWF,EAAKC,EAAM,CAC3B,MAAME,EAAQH,EAAI,QAAQC,CAAI,EAC1BE,EAAQ,IACRH,EAAI,OAAOG,EAAO,CAAC,CAC3B","x_google_ignoreList":[0]}

package/dist/lyra245.js

@@ -1,4 +1,11 @@
-const t = (e, p) => e.depth - p.depth;
+function f(e, n) {
+  e.indexOf(n) === -1 && e.push(n);
+}
+function d(e, n) {
+  const i = e.indexOf(n);
+  i > -1 && e.splice(i, 1);
+}
 export {
-  t as compareByDepth
+  f as addUniqueItem,
+  d as removeItem
 };

package/dist/lyra245.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra245.js","sources":["../node_modules/framer-motion/dist/es/render/utils/compare-by-depth.mjs"],"sourcesContent":["const compareByDepth = (a, b) => a.depth - b.depth;\n\nexport { compareByDepth };\n"],"names":["compareByDepth","a","b"],"mappings":"AAAK,MAACA,IAAiB,CAACC,GAAGC,MAAMD,EAAE,QAAQC,EAAE;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra245.js","sources":["../node_modules/framer-motion/dist/es/utils/array.mjs"],"sourcesContent":["function addUniqueItem(arr, item) {\n    if (arr.indexOf(item) === -1)\n        arr.push(item);\n}\nfunction removeItem(arr, item) {\n    const index = arr.indexOf(item);\n    if (index > -1)\n        arr.splice(index, 1);\n}\n// Adapted from array-move\nfunction moveItem([...arr], fromIndex, toIndex) {\n    const startIndex = fromIndex < 0 ? arr.length + fromIndex : fromIndex;\n    if (startIndex >= 0 && startIndex < arr.length) {\n        const endIndex = toIndex < 0 ? arr.length + toIndex : toIndex;\n        const [item] = arr.splice(fromIndex, 1);\n        arr.splice(endIndex, 0, item);\n    }\n    return arr;\n}\n\nexport { addUniqueItem, moveItem, removeItem };\n"],"names":["addUniqueItem","arr","item","removeItem","index"],"mappings":"AAAA,SAASA,EAAcC,GAAKC,GAAM;AAC9B,EAAID,EAAI,QAAQC,CAAI,MAAM,MACtBD,EAAI,KAAKC,CAAI;AACrB;AACA,SAASC,EAAWF,GAAKC,GAAM;AAC3B,QAAME,IAAQH,EAAI,QAAQC,CAAI;AAC9B,EAAIE,IAAQ,MACRH,EAAI,OAAOG,GAAO,CAAC;AAC3B;","x_google_ignoreList":[0]}

package/dist/lyra246.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(t,e){return e?t*(1e3/e):0}exports.velocityPerSecond=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=(e,t)=>e.depth-t.depth;exports.compareByDepth=o;

package/dist/lyra246.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra246.cjs","sources":["../node_modules/framer-motion/dist/es/utils/velocity-per-second.mjs"],"sourcesContent":["/*\n  Convert velocity into velocity per second\n\n  @param [number]: Unit per frame\n  @param [number]: Frame duration in ms\n*/\nfunction velocityPerSecond(velocity, frameDuration) {\n    return frameDuration ? velocity * (1000 / frameDuration) : 0;\n}\n\nexport { velocityPerSecond };\n"],"names":["velocityPerSecond","velocity","frameDuration"],"mappings":"gFAMA,SAASA,EAAkBC,EAAUC,EAAe,CAChD,OAAOA,EAAgBD,GAAY,IAAOC,GAAiB,CAC/D","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra246.cjs","sources":["../node_modules/framer-motion/dist/es/render/utils/compare-by-depth.mjs"],"sourcesContent":["const compareByDepth = (a, b) => a.depth - b.depth;\n\nexport { compareByDepth };\n"],"names":["compareByDepth","a","b"],"mappings":"gFAAK,MAACA,EAAiB,CAACC,EAAGC,IAAMD,EAAE,MAAQC,EAAE","x_google_ignoreList":[0]}

package/dist/lyra246.js

@@ -1,6 +1,4 @@
-function n(c, e) {
-  return e ? c * (1e3 / e) : 0;
-}
+const t = (e, p) => e.depth - p.depth;
 export {
-  n as velocityPerSecond
+  t as compareByDepth
 };

package/dist/lyra246.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra246.js","sources":["../node_modules/framer-motion/dist/es/utils/velocity-per-second.mjs"],"sourcesContent":["/*\n  Convert velocity into velocity per second\n\n  @param [number]: Unit per frame\n  @param [number]: Frame duration in ms\n*/\nfunction velocityPerSecond(velocity, frameDuration) {\n    return frameDuration ? velocity * (1000 / frameDuration) : 0;\n}\n\nexport { velocityPerSecond };\n"],"names":["velocityPerSecond","velocity","frameDuration"],"mappings":"AAMA,SAASA,EAAkBC,GAAUC,GAAe;AAChD,SAAOA,IAAgBD,KAAY,MAAOC,KAAiB;AAC/D;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra246.js","sources":["../node_modules/framer-motion/dist/es/render/utils/compare-by-depth.mjs"],"sourcesContent":["const compareByDepth = (a, b) => a.depth - b.depth;\n\nexport { compareByDepth };\n"],"names":["compareByDepth","a","b"],"mappings":"AAAK,MAACA,IAAiB,CAACC,GAAGC,MAAMD,EAAE,QAAQC,EAAE;","x_google_ignoreList":[0]}

package/dist/lyra247.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=(t,i,e)=>-e*t+e*i+t;exports.mix=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(t,e){return e?t*(1e3/e):0}exports.velocityPerSecond=o;

package/dist/lyra247.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra247.cjs","sources":["../node_modules/framer-motion/dist/es/utils/mix.mjs"],"sourcesContent":["/*\n  Value in range from progress\n\n  Given a lower limit and an upper limit, we return the value within\n  that range as expressed by progress (usually a number from 0 to 1)\n\n  So progress = 0.5 would change\n\n  from -------- to\n\n  to\n\n  from ---- to\n\n  E.g. from = 10, to = 20, progress = 0.5 => 15\n\n  @param [number]: Lower limit of range\n  @param [number]: Upper limit of range\n  @param [number]: The progress between lower and upper limits expressed 0-1\n  @return [number]: Value as calculated from progress within range (not limited within range)\n*/\nconst mix = (from, to, progress) => -progress * from + progress * to + from;\n\nexport { mix };\n"],"names":["mix","from","to","progress"],"mappings":"gFAqBK,MAACA,EAAM,CAACC,EAAMC,EAAIC,IAAa,CAACA,EAAWF,EAAOE,EAAWD,EAAKD","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra247.cjs","sources":["../node_modules/framer-motion/dist/es/utils/velocity-per-second.mjs"],"sourcesContent":["/*\n  Convert velocity into velocity per second\n\n  @param [number]: Unit per frame\n  @param [number]: Frame duration in ms\n*/\nfunction velocityPerSecond(velocity, frameDuration) {\n    return frameDuration ? velocity * (1000 / frameDuration) : 0;\n}\n\nexport { velocityPerSecond };\n"],"names":["velocityPerSecond","velocity","frameDuration"],"mappings":"gFAMA,SAASA,EAAkBC,EAAUC,EAAe,CAChD,OAAOA,EAAgBD,GAAY,IAAOC,GAAiB,CAC/D","x_google_ignoreList":[0]}

package/dist/lyra247.js

@@ -1,4 +1,6 @@
-const i = (t, c, x) => -x * t + x * c + t;
+function n(c, e) {
+  return e ? c * (1e3 / e) : 0;
+}
 export {
-  i as mix
+  n as velocityPerSecond
 };

package/dist/lyra247.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra247.js","sources":["../node_modules/framer-motion/dist/es/utils/mix.mjs"],"sourcesContent":["/*\n  Value in range from progress\n\n  Given a lower limit and an upper limit, we return the value within\n  that range as expressed by progress (usually a number from 0 to 1)\n\n  So progress = 0.5 would change\n\n  from -------- to\n\n  to\n\n  from ---- to\n\n  E.g. from = 10, to = 20, progress = 0.5 => 15\n\n  @param [number]: Lower limit of range\n  @param [number]: Upper limit of range\n  @param [number]: The progress between lower and upper limits expressed 0-1\n  @return [number]: Value as calculated from progress within range (not limited within range)\n*/\nconst mix = (from, to, progress) => -progress * from + progress * to + from;\n\nexport { mix };\n"],"names":["mix","from","to","progress"],"mappings":"AAqBK,MAACA,IAAM,CAACC,GAAMC,GAAIC,MAAa,CAACA,IAAWF,IAAOE,IAAWD,IAAKD;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra247.js","sources":["../node_modules/framer-motion/dist/es/utils/velocity-per-second.mjs"],"sourcesContent":["/*\n  Convert velocity into velocity per second\n\n  @param [number]: Unit per frame\n  @param [number]: Frame duration in ms\n*/\nfunction velocityPerSecond(velocity, frameDuration) {\n    return frameDuration ? velocity * (1000 / frameDuration) : 0;\n}\n\nexport { velocityPerSecond };\n"],"names":["velocityPerSecond","velocity","frameDuration"],"mappings":"AAMA,SAASA,EAAkBC,GAAUC,GAAe;AAChD,SAAOA,IAAgBD,KAAY,MAAOC,KAAiB;AAC/D;","x_google_ignoreList":[0]}

package/dist/lyra248.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=(e,t)=>o=>t(e(o)),i=(...e)=>e.reduce(c);exports.pipe=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=(t,i,e)=>-e*t+e*i+t;exports.mix=c;

package/dist/lyra248.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra248.cjs","sources":["../node_modules/framer-motion/dist/es/utils/pipe.mjs"],"sourcesContent":["/**\n * Pipe\n * Compose other transformers to run linearily\n * pipe(min(20), max(40))\n * @param  {...functions} transformers\n * @return {function}\n */\nconst combineFunctions = (a, b) => (v) => b(a(v));\nconst pipe = (...transformers) => transformers.reduce(combineFunctions);\n\nexport { pipe };\n"],"names":["combineFunctions","a","b","v","pipe","transformers"],"mappings":"gFAOA,MAAMA,EAAmB,CAACC,EAAGC,IAAOC,GAAMD,EAAED,EAAEE,CAAC,CAAC,EAC1CC,EAAO,IAAIC,IAAiBA,EAAa,OAAOL,CAAgB","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra248.cjs","sources":["../node_modules/framer-motion/dist/es/utils/mix.mjs"],"sourcesContent":["/*\n  Value in range from progress\n\n  Given a lower limit and an upper limit, we return the value within\n  that range as expressed by progress (usually a number from 0 to 1)\n\n  So progress = 0.5 would change\n\n  from -------- to\n\n  to\n\n  from ---- to\n\n  E.g. from = 10, to = 20, progress = 0.5 => 15\n\n  @param [number]: Lower limit of range\n  @param [number]: Upper limit of range\n  @param [number]: The progress between lower and upper limits expressed 0-1\n  @return [number]: Value as calculated from progress within range (not limited within range)\n*/\nconst mix = (from, to, progress) => -progress * from + progress * to + from;\n\nexport { mix };\n"],"names":["mix","from","to","progress"],"mappings":"gFAqBK,MAACA,EAAM,CAACC,EAAMC,EAAIC,IAAa,CAACA,EAAWF,EAAOE,EAAWD,EAAKD","x_google_ignoreList":[0]}

package/dist/lyra248.js

@@ -1,4 +1,4 @@
-const o = (c, e) => (n) => e(c(n)), t = (...c) => c.reduce(o);
+const i = (t, c, x) => -x * t + x * c + t;
 export {
-  t as pipe
+  i as mix
 };

package/dist/lyra248.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra248.js","sources":["../node_modules/framer-motion/dist/es/utils/pipe.mjs"],"sourcesContent":["/**\n * Pipe\n * Compose other transformers to run linearily\n * pipe(min(20), max(40))\n * @param  {...functions} transformers\n * @return {function}\n */\nconst combineFunctions = (a, b) => (v) => b(a(v));\nconst pipe = (...transformers) => transformers.reduce(combineFunctions);\n\nexport { pipe };\n"],"names":["combineFunctions","a","b","v","pipe","transformers"],"mappings":"AAOA,MAAMA,IAAmB,CAACC,GAAGC,MAAM,CAACC,MAAMD,EAAED,EAAEE,CAAC,CAAC,GAC1CC,IAAO,IAAIC,MAAiBA,EAAa,OAAOL,CAAgB;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra248.js","sources":["../node_modules/framer-motion/dist/es/utils/mix.mjs"],"sourcesContent":["/*\n  Value in range from progress\n\n  Given a lower limit and an upper limit, we return the value within\n  that range as expressed by progress (usually a number from 0 to 1)\n\n  So progress = 0.5 would change\n\n  from -------- to\n\n  to\n\n  from ---- to\n\n  E.g. from = 10, to = 20, progress = 0.5 => 15\n\n  @param [number]: Lower limit of range\n  @param [number]: Upper limit of range\n  @param [number]: The progress between lower and upper limits expressed 0-1\n  @return [number]: Value as calculated from progress within range (not limited within range)\n*/\nconst mix = (from, to, progress) => -progress * from + progress * to + from;\n\nexport { mix };\n"],"names":["mix","from","to","progress"],"mappings":"AAqBK,MAACA,IAAM,CAACC,GAAMC,GAAIC,MAAa,CAACA,IAAWF,IAAOE,IAAWD,IAAKD;","x_google_ignoreList":[0]}

package/dist/lyra249.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=(e,t,o)=>{const r=t-e;return r===0?1:(o-e)/r};exports.progress=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=(e,t)=>o=>t(e(o)),i=(...e)=>e.reduce(c);exports.pipe=i;

package/dist/lyra249.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra249.cjs","sources":["../node_modules/framer-motion/dist/es/utils/progress.mjs"],"sourcesContent":["/*\n  Progress within given range\n\n  Given a lower limit and an upper limit, we return the progress\n  (expressed as a number 0-1) represented by the given value, and\n  limit that progress to within 0-1.\n\n  @param [number]: Lower limit\n  @param [number]: Upper limit\n  @param [number]: Value to find progress within given range\n  @return [number]: Progress of value within range as expressed 0-1\n*/\nconst progress = (from, to, value) => {\n    const toFromDifference = to - from;\n    return toFromDifference === 0 ? 1 : (value - from) / toFromDifference;\n};\n\nexport { progress };\n"],"names":["progress","from","to","value","toFromDifference"],"mappings":"gFAYK,MAACA,EAAW,CAACC,EAAMC,EAAIC,IAAU,CAClC,MAAMC,EAAmBF,EAAKD,EAC9B,OAAOG,IAAqB,EAAI,GAAKD,EAAQF,GAAQG,CACzD","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra249.cjs","sources":["../node_modules/framer-motion/dist/es/utils/pipe.mjs"],"sourcesContent":["/**\n * Pipe\n * Compose other transformers to run linearily\n * pipe(min(20), max(40))\n * @param  {...functions} transformers\n * @return {function}\n */\nconst combineFunctions = (a, b) => (v) => b(a(v));\nconst pipe = (...transformers) => transformers.reduce(combineFunctions);\n\nexport { pipe };\n"],"names":["combineFunctions","a","b","v","pipe","transformers"],"mappings":"gFAOA,MAAMA,EAAmB,CAACC,EAAGC,IAAOC,GAAMD,EAAED,EAAEE,CAAC,CAAC,EAC1CC,EAAO,IAAIC,IAAiBA,EAAa,OAAOL,CAAgB","x_google_ignoreList":[0]}

package/dist/lyra249.js

@@ -1,7 +1,4 @@
-const n = (e, o, t) => {
-  const r = o - e;
-  return r === 0 ? 1 : (t - e) / r;
-};
+const o = (c, e) => (n) => e(c(n)), t = (...c) => c.reduce(o);
 export {
-  n as progress
+  t as pipe
 };

package/dist/lyra249.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra249.js","sources":["../node_modules/framer-motion/dist/es/utils/progress.mjs"],"sourcesContent":["/*\n  Progress within given range\n\n  Given a lower limit and an upper limit, we return the progress\n  (expressed as a number 0-1) represented by the given value, and\n  limit that progress to within 0-1.\n\n  @param [number]: Lower limit\n  @param [number]: Upper limit\n  @param [number]: Value to find progress within given range\n  @return [number]: Progress of value within range as expressed 0-1\n*/\nconst progress = (from, to, value) => {\n    const toFromDifference = to - from;\n    return toFromDifference === 0 ? 1 : (value - from) / toFromDifference;\n};\n\nexport { progress };\n"],"names":["progress","from","to","value","toFromDifference"],"mappings":"AAYK,MAACA,IAAW,CAACC,GAAMC,GAAIC,MAAU;AAClC,QAAMC,IAAmBF,IAAKD;AAC9B,SAAOG,MAAqB,IAAI,KAAKD,IAAQF,KAAQG;AACzD;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra249.js","sources":["../node_modules/framer-motion/dist/es/utils/pipe.mjs"],"sourcesContent":["/**\n * Pipe\n * Compose other transformers to run linearily\n * pipe(min(20), max(40))\n * @param  {...functions} transformers\n * @return {function}\n */\nconst combineFunctions = (a, b) => (v) => b(a(v));\nconst pipe = (...transformers) => transformers.reduce(combineFunctions);\n\nexport { pipe };\n"],"names":["combineFunctions","a","b","v","pipe","transformers"],"mappings":"AAOA,MAAMA,IAAmB,CAACC,GAAGC,MAAM,CAACC,MAAMD,EAAED,EAAEE,CAAC,CAAC,GAC1CC,IAAO,IAAIC,MAAiBA,EAAa,OAAOL,CAAgB;","x_google_ignoreList":[0]}

package/dist/lyra25.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./lyra54.cjs"),h=require("react"),c=require("./lyra53.cjs"),F=require("./lyra63.cjs"),g=require("./lyra64.cjs"),v=require("./lyra43.cjs");require("./lyra69.cjs");const r=require("./lyra22.cjs");require("./lyra72.cjs");const S=require("./lyra55.cjs"),b=({label:a,description:u,errorMessage:x,className:E,fullWidth:N=!1,isDisabled:l=!1,isRequired:i=!1,isInvalid:d,startSlot:m,endSlot:j,size:p,hint:f,rows:R=3,...s},q)=>{const[I,y]=h.useState(!1),[T,n]=h.useState(!1);return e.jsxRuntimeExports.jsxs(c.TextField,{className:r.sharedInputFieldWrapperStyles({className:E}),isDisabled:l,isRequired:i,isInvalid:d,...s,onFocus:o=>{var t;y(!0),(t=s.onFocus)==null||t.call(s,o)},onBlur:o=>{var t;y(!1),(t=s.onBlur)==null||t.call(s,o)},ref:q,children:[e.jsxRuntimeExports.jsxs("div",{className:F.cx("flex items-center gap-3",a?"justify-between":"justify-end"),children:[a?e.jsxRuntimeExports.jsxs(c.Label,{className:r.sharedInputlabelStyles(),style:{fontFamily:"var(--input-label-font-family)"},children:[a,i&&e.jsxRuntimeExports.jsx("span",{className:"text-danger",children:" *"})]}):null,f?e.jsxRuntimeExports.jsx("span",{className:r.sharedInputHintStyles(),style:{fontFamily:"var(--input-hint-font-family)"},children:f}):null]}),e.jsxRuntimeExports.jsxs("div",{className:S.twMerge(r.sharedInputFieldStyles({fullWidth:N,isFocused:I,isHovered:T,isDisabled:l,isInvalid:d,className:"items-start"})),onPointerEnter:()=>n(!0),onPointerLeave:()=>n(!1),onMouseEnter:()=>n(!0),onMouseLeave:()=>n(!1),children:[e.jsxRuntimeExports.jsx("div",{className:"pt-4",children:m}),e.jsxRuntimeExports.jsx(c.TextArea,{className:r.sharedInputStyles({size:p,className:F.cx(!!m&&"ps-2",!!j&&"pe-2")}),rows:R,required:i,disabled:l,style:{fontFamily:"var(--input-font-family)"}}),e.jsxRuntimeExports.jsx("div",{className:"pt-4",children:j})]}),u&&e.jsxRuntimeExports.jsx(v.Text,{className:"ml-1 mt-1.5",variant:"body-small",color:"secondary",slot:"description",children:u}),x&&e.jsxRuntimeExports.jsx(v.Text,{className:"ml-1 mt-1.5",variant:"body-small",color:"accent-danger",slot:"errorMessage",children:x})]})},M=g.fixedForwardRef(b);exports.TextAreaField=M;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./lyra54.cjs"),h=require("react"),c=require("./lyra53.cjs"),F=require("./lyra63.cjs"),g=require("./lyra64.cjs"),v=require("./lyra43.cjs");require("./lyra69.cjs");const r=require("./lyra22.cjs");require("./lyra75.cjs");const S=require("./lyra55.cjs"),b=({label:a,description:u,errorMessage:x,className:E,fullWidth:N=!1,isDisabled:l=!1,isRequired:i=!1,isInvalid:d,startSlot:m,endSlot:j,size:p,hint:f,rows:R=3,...s},q)=>{const[I,y]=h.useState(!1),[T,n]=h.useState(!1);return e.jsxRuntimeExports.jsxs(c.TextField,{className:r.sharedInputFieldWrapperStyles({className:E}),isDisabled:l,isRequired:i,isInvalid:d,...s,onFocus:o=>{var t;y(!0),(t=s.onFocus)==null||t.call(s,o)},onBlur:o=>{var t;y(!1),(t=s.onBlur)==null||t.call(s,o)},ref:q,children:[e.jsxRuntimeExports.jsxs("div",{className:F.cx("flex items-center gap-3",a?"justify-between":"justify-end"),children:[a?e.jsxRuntimeExports.jsxs(c.Label,{className:r.sharedInputlabelStyles(),style:{fontFamily:"var(--input-label-font-family)"},children:[a,i&&e.jsxRuntimeExports.jsx("span",{className:"text-danger",children:" *"})]}):null,f?e.jsxRuntimeExports.jsx("span",{className:r.sharedInputHintStyles(),style:{fontFamily:"var(--input-hint-font-family)"},children:f}):null]}),e.jsxRuntimeExports.jsxs("div",{className:S.twMerge(r.sharedInputFieldStyles({fullWidth:N,isFocused:I,isHovered:T,isDisabled:l,isInvalid:d,className:"items-start"})),onPointerEnter:()=>n(!0),onPointerLeave:()=>n(!1),onMouseEnter:()=>n(!0),onMouseLeave:()=>n(!1),children:[e.jsxRuntimeExports.jsx("div",{className:"pt-4",children:m}),e.jsxRuntimeExports.jsx(c.TextArea,{className:r.sharedInputStyles({size:p,className:F.cx(!!m&&"ps-2",!!j&&"pe-2")}),rows:R,required:i,disabled:l,style:{fontFamily:"var(--input-font-family)"}}),e.jsxRuntimeExports.jsx("div",{className:"pt-4",children:j})]}),u&&e.jsxRuntimeExports.jsx(v.Text,{className:"ml-1 mt-1.5",variant:"body-small",color:"secondary",slot:"description",children:u}),x&&e.jsxRuntimeExports.jsx(v.Text,{className:"ml-1 mt-1.5",variant:"body-small",color:"accent-danger",slot:"errorMessage",children:x})]})},M=g.fixedForwardRef(b);exports.TextAreaField=M;

package/dist/lyra25.js

@@ -6,7 +6,7 @@ import { fixedForwardRef as S } from "./lyra64.js";
 import { Text as h } from "./lyra43.js";
 import "./lyra69.js";
 import { sharedInputFieldWrapperStyles as w, sharedInputlabelStyles as A, sharedInputHintStyles as E, sharedInputFieldStyles as L, sharedInputStyles as M } from "./lyra22.js";
-import "./lyra72.js";
+import "./lyra75.js";
 import { twMerge as B } from "./lyra55.js";
 const P = ({
   label: l,

package/dist/lyra250.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./lyra251.cjs"),a=t=>(t*=2)<1?.5*e.backIn(t):.5*(2-Math.pow(2,-10*(t-1)));exports.anticipate=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=(e,t,o)=>{const r=t-e;return r===0?1:(o-e)/r};exports.progress=s;

package/dist/lyra250.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra250.cjs","sources":["../node_modules/framer-motion/dist/es/easing/anticipate.mjs"],"sourcesContent":["import { backIn } from './back.mjs';\n\nconst anticipate = (p) => (p *= 2) < 1 ? 0.5 * backIn(p) : 0.5 * (2 - Math.pow(2, -10 * (p - 1)));\n\nexport { anticipate };\n"],"names":["anticipate","p","backIn"],"mappings":"iHAEMA,EAAcC,IAAOA,GAAK,GAAK,EAAI,GAAMC,EAAAA,OAAOD,CAAC,EAAI,IAAO,EAAI,KAAK,IAAI,EAAG,KAAOA,EAAI,EAAE","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra250.cjs","sources":["../node_modules/framer-motion/dist/es/utils/progress.mjs"],"sourcesContent":["/*\n  Progress within given range\n\n  Given a lower limit and an upper limit, we return the progress\n  (expressed as a number 0-1) represented by the given value, and\n  limit that progress to within 0-1.\n\n  @param [number]: Lower limit\n  @param [number]: Upper limit\n  @param [number]: Value to find progress within given range\n  @return [number]: Progress of value within range as expressed 0-1\n*/\nconst progress = (from, to, value) => {\n    const toFromDifference = to - from;\n    return toFromDifference === 0 ? 1 : (value - from) / toFromDifference;\n};\n\nexport { progress };\n"],"names":["progress","from","to","value","toFromDifference"],"mappings":"gFAYK,MAACA,EAAW,CAACC,EAAMC,EAAIC,IAAU,CAClC,MAAMC,EAAmBF,EAAKD,EAC9B,OAAOG,IAAqB,EAAI,GAAKD,EAAQF,GAAQG,CACzD","x_google_ignoreList":[0]}

package/dist/lyra250.js

@@ -1,5 +1,7 @@
-import { backIn as o } from "./lyra251.js";
-const c = (t) => (t *= 2) < 1 ? 0.5 * o(t) : 0.5 * (2 - Math.pow(2, -10 * (t - 1)));
+const n = (e, o, t) => {
+  const r = o - e;
+  return r === 0 ? 1 : (t - e) / r;
+};
 export {
-  c as anticipate
+  n as progress
 };

package/dist/lyra250.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra250.js","sources":["../node_modules/framer-motion/dist/es/easing/anticipate.mjs"],"sourcesContent":["import { backIn } from './back.mjs';\n\nconst anticipate = (p) => (p *= 2) < 1 ? 0.5 * backIn(p) : 0.5 * (2 - Math.pow(2, -10 * (p - 1)));\n\nexport { anticipate };\n"],"names":["anticipate","p","backIn"],"mappings":";AAEK,MAACA,IAAa,CAACC,OAAOA,KAAK,KAAK,IAAI,MAAMC,EAAOD,CAAC,IAAI,OAAO,IAAI,KAAK,IAAI,GAAG,OAAOA,IAAI,EAAE;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra250.js","sources":["../node_modules/framer-motion/dist/es/utils/progress.mjs"],"sourcesContent":["/*\n  Progress within given range\n\n  Given a lower limit and an upper limit, we return the progress\n  (expressed as a number 0-1) represented by the given value, and\n  limit that progress to within 0-1.\n\n  @param [number]: Lower limit\n  @param [number]: Upper limit\n  @param [number]: Value to find progress within given range\n  @return [number]: Progress of value within range as expressed 0-1\n*/\nconst progress = (from, to, value) => {\n    const toFromDifference = to - from;\n    return toFromDifference === 0 ? 1 : (value - from) / toFromDifference;\n};\n\nexport { progress };\n"],"names":["progress","from","to","value","toFromDifference"],"mappings":"AAYK,MAACA,IAAW,CAACC,GAAMC,GAAIC,MAAU;AAClC,QAAMC,IAAmBF,IAAKD;AAC9B,SAAOG,MAAqB,IAAI,KAAKD,IAAQF,KAAQG;AACzD;","x_google_ignoreList":[0]}

package/dist/lyra251.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./lyra252.cjs"),t=require("./lyra253.cjs"),i=require("./lyra254.cjs"),e=c.cubicBezier(.33,1.53,.69,.99),r=i.reverseEasing(e),n=t.mirrorEasing(r);exports.backIn=r;exports.backInOut=n;exports.backOut=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./lyra252.cjs"),a=t=>(t*=2)<1?.5*e.backIn(t):.5*(2-Math.pow(2,-10*(t-1)));exports.anticipate=a;

package/dist/lyra251.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra251.cjs","sources":["../node_modules/framer-motion/dist/es/easing/back.mjs"],"sourcesContent":["import { cubicBezier } from './cubic-bezier.mjs';\nimport { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst backOut = cubicBezier(0.33, 1.53, 0.69, 0.99);\nconst backIn = reverseEasing(backOut);\nconst backInOut = mirrorEasing(backIn);\n\nexport { backIn, backInOut, backOut };\n"],"names":["backOut","cubicBezier","backIn","reverseEasing","backInOut","mirrorEasing"],"mappings":"uKAIMA,EAAUC,EAAAA,YAAY,IAAM,KAAM,IAAM,GAAI,EAC5CC,EAASC,EAAa,cAACH,CAAO,EAC9BI,EAAYC,EAAY,aAACH,CAAM","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra251.cjs","sources":["../node_modules/framer-motion/dist/es/easing/anticipate.mjs"],"sourcesContent":["import { backIn } from './back.mjs';\n\nconst anticipate = (p) => (p *= 2) < 1 ? 0.5 * backIn(p) : 0.5 * (2 - Math.pow(2, -10 * (p - 1)));\n\nexport { anticipate };\n"],"names":["anticipate","p","backIn"],"mappings":"iHAEMA,EAAcC,IAAOA,GAAK,GAAK,EAAI,GAAMC,EAAAA,OAAOD,CAAC,EAAI,IAAO,EAAI,KAAK,IAAI,EAAG,KAAOA,EAAI,EAAE","x_google_ignoreList":[0]}

package/dist/lyra251.js

@@ -1,9 +1,5 @@
-import { cubicBezier as r } from "./lyra252.js";
-import { mirrorEasing as o } from "./lyra253.js";
-import { reverseEasing as t } from "./lyra254.js";
-const c = r(0.33, 1.53, 0.69, 0.99), i = t(c), s = o(i);
+import { backIn as o } from "./lyra252.js";
+const c = (t) => (t *= 2) < 1 ? 0.5 * o(t) : 0.5 * (2 - Math.pow(2, -10 * (t - 1)));
 export {
-  i as backIn,
-  s as backInOut,
-  c as backOut
+  c as anticipate
 };

package/dist/lyra251.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra251.js","sources":["../node_modules/framer-motion/dist/es/easing/back.mjs"],"sourcesContent":["import { cubicBezier } from './cubic-bezier.mjs';\nimport { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst backOut = cubicBezier(0.33, 1.53, 0.69, 0.99);\nconst backIn = reverseEasing(backOut);\nconst backInOut = mirrorEasing(backIn);\n\nexport { backIn, backInOut, backOut };\n"],"names":["backOut","cubicBezier","backIn","reverseEasing","backInOut","mirrorEasing"],"mappings":";;;AAIK,MAACA,IAAUC,EAAY,MAAM,MAAM,MAAM,IAAI,GAC5CC,IAASC,EAAcH,CAAO,GAC9BI,IAAYC,EAAaH,CAAM;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra251.js","sources":["../node_modules/framer-motion/dist/es/easing/anticipate.mjs"],"sourcesContent":["import { backIn } from './back.mjs';\n\nconst anticipate = (p) => (p *= 2) < 1 ? 0.5 * backIn(p) : 0.5 * (2 - Math.pow(2, -10 * (p - 1)));\n\nexport { anticipate };\n"],"names":["anticipate","p","backIn"],"mappings":";AAEK,MAACA,IAAa,CAACC,OAAOA,KAAK,KAAK,IAAI,MAAMC,EAAOD,CAAC,IAAI,OAAO,IAAI,KAAK,IAAI,GAAG,OAAOA,IAAI,EAAE;","x_google_ignoreList":[0]}

package/dist/lyra252.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./lyra236.cjs"),s=(n,e,r)=>(((1-3*r+3*e)*n+(3*r-6*e))*n+3*e)*n,l=1e-7,a=12;function f(n,e,r,c,o){let i,t,u=0;do t=e+(r-e)/2,i=s(t,c,o)-n,i>0?r=t:e=t;while(Math.abs(i)>l&&++u<a);return t}function d(n,e,r,c){if(n===e&&r===c)return b.noop;const o=i=>f(i,0,1,n,r);return i=>i===0||i===1?i:s(o(i),e,c)}exports.cubicBezier=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./lyra253.cjs"),t=require("./lyra254.cjs"),i=require("./lyra255.cjs"),e=c.cubicBezier(.33,1.53,.69,.99),r=i.reverseEasing(e),n=t.mirrorEasing(r);exports.backIn=r;exports.backInOut=n;exports.backOut=e;

package/dist/lyra252.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra252.cjs","sources":["../node_modules/framer-motion/dist/es/easing/cubic-bezier.mjs"],"sourcesContent":["import { noop } from '../utils/noop.mjs';\n\n/*\n  Bezier function generator\n  This has been modified from Gaëtan Renaudeau's BezierEasing\n  https://github.com/gre/bezier-easing/blob/master/src/index.js\n  https://github.com/gre/bezier-easing/blob/master/LICENSE\n  \n  I've removed the newtonRaphsonIterate algo because in benchmarking it\n  wasn't noticiably faster than binarySubdivision, indeed removing it\n  usually improved times, depending on the curve.\n  I also removed the lookup table, as for the added bundle size and loop we're\n  only cutting ~4 or so subdivision iterations. I bumped the max iterations up\n  to 12 to compensate and this still tended to be faster for no perceivable\n  loss in accuracy.\n  Usage\n    const easeOut = cubicBezier(.17,.67,.83,.67);\n    const x = easeOut(0.5); // returns 0.627...\n*/\n// Returns x(t) given t, x1, and x2, or y(t) given t, y1, and y2.\nconst calcBezier = (t, a1, a2) => (((1.0 - 3.0 * a2 + 3.0 * a1) * t + (3.0 * a2 - 6.0 * a1)) * t + 3.0 * a1) *\n    t;\nconst subdivisionPrecision = 0.0000001;\nconst subdivisionMaxIterations = 12;\nfunction binarySubdivide(x, lowerBound, upperBound, mX1, mX2) {\n    let currentX;\n    let currentT;\n    let i = 0;\n    do {\n        currentT = lowerBound + (upperBound - lowerBound) / 2.0;\n        currentX = calcBezier(currentT, mX1, mX2) - x;\n        if (currentX > 0.0) {\n            upperBound = currentT;\n        }\n        else {\n            lowerBound = currentT;\n        }\n    } while (Math.abs(currentX) > subdivisionPrecision &&\n        ++i < subdivisionMaxIterations);\n    return currentT;\n}\nfunction cubicBezier(mX1, mY1, mX2, mY2) {\n    // If this is a linear gradient, return linear easing\n    if (mX1 === mY1 && mX2 === mY2)\n        return noop;\n    const getTForX = (aX) => binarySubdivide(aX, 0, 1, mX1, mX2);\n    // If animation is at start/end, return t without easing\n    return (t) => t === 0 || t === 1 ? t : calcBezier(getTForX(t), mY1, mY2);\n}\n\nexport { cubicBezier };\n"],"names":["calcBezier","t","a1","a2","subdivisionPrecision","subdivisionMaxIterations","binarySubdivide","x","lowerBound","upperBound","mX1","mX2","currentX","currentT","i","cubicBezier","mY1","mY2","noop","getTForX","aX"],"mappings":"iHAoBMA,EAAa,CAACC,EAAGC,EAAIC,OAAU,EAAM,EAAMA,EAAK,EAAMD,GAAMD,GAAK,EAAME,EAAK,EAAMD,IAAOD,EAAI,EAAMC,GACrGD,EACEG,EAAuB,KACvBC,EAA2B,GACjC,SAASC,EAAgBC,EAAGC,EAAYC,EAAYC,EAAKC,EAAK,CAC1D,IAAIC,EACAC,EACAC,EAAI,EACR,GACID,EAAWL,GAAcC,EAAaD,GAAc,EACpDI,EAAWZ,EAAWa,EAAUH,EAAKC,CAAG,EAAIJ,EACxCK,EAAW,EACXH,EAAaI,EAGbL,EAAaK,QAEZ,KAAK,IAAID,CAAQ,EAAIR,GAC1B,EAAEU,EAAIT,GACV,OAAOQ,CACX,CACA,SAASE,EAAYL,EAAKM,EAAKL,EAAKM,EAAK,CAErC,GAAIP,IAAQM,GAAOL,IAAQM,EACvB,OAAOC,OACX,MAAMC,EAAYC,GAAOd,EAAgBc,EAAI,EAAG,EAAGV,EAAKC,CAAG,EAE3D,OAAQV,GAAMA,IAAM,GAAKA,IAAM,EAAIA,EAAID,EAAWmB,EAASlB,CAAC,EAAGe,EAAKC,CAAG,CAC3E","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra252.cjs","sources":["../node_modules/framer-motion/dist/es/easing/back.mjs"],"sourcesContent":["import { cubicBezier } from './cubic-bezier.mjs';\nimport { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst backOut = cubicBezier(0.33, 1.53, 0.69, 0.99);\nconst backIn = reverseEasing(backOut);\nconst backInOut = mirrorEasing(backIn);\n\nexport { backIn, backInOut, backOut };\n"],"names":["backOut","cubicBezier","backIn","reverseEasing","backInOut","mirrorEasing"],"mappings":"uKAIMA,EAAUC,EAAAA,YAAY,IAAM,KAAM,IAAM,GAAI,EAC5CC,EAASC,EAAa,cAACH,CAAO,EAC9BI,EAAYC,EAAY,aAACH,CAAM","x_google_ignoreList":[0]}

package/dist/lyra252.js

@@ -1,18 +1,9 @@
-import { noop as b } from "./lyra236.js";
-const s = (n, i, r) => (((1 - 3 * r + 3 * i) * n + (3 * r - 6 * i)) * n + 3 * i) * n, f = 1e-7, l = 12;
-function a(n, i, r, c, o) {
-  let e, t, u = 0;
-  do
-    t = i + (r - i) / 2, e = s(t, c, o) - n, e > 0 ? r = t : i = t;
-  while (Math.abs(e) > f && ++u < l);
-  return t;
-}
-function d(n, i, r, c) {
-  if (n === i && r === c)
-    return b;
-  const o = (e) => a(e, 0, 1, n, r);
-  return (e) => e === 0 || e === 1 ? e : s(o(e), i, c);
-}
+import { cubicBezier as r } from "./lyra253.js";
+import { mirrorEasing as o } from "./lyra254.js";
+import { reverseEasing as t } from "./lyra255.js";
+const c = r(0.33, 1.53, 0.69, 0.99), i = t(c), s = o(i);
 export {
-  d as cubicBezier
+  i as backIn,
+  s as backInOut,
+  c as backOut
 };

package/dist/lyra252.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra252.js","sources":["../node_modules/framer-motion/dist/es/easing/cubic-bezier.mjs"],"sourcesContent":["import { noop } from '../utils/noop.mjs';\n\n/*\n  Bezier function generator\n  This has been modified from Gaëtan Renaudeau's BezierEasing\n  https://github.com/gre/bezier-easing/blob/master/src/index.js\n  https://github.com/gre/bezier-easing/blob/master/LICENSE\n  \n  I've removed the newtonRaphsonIterate algo because in benchmarking it\n  wasn't noticiably faster than binarySubdivision, indeed removing it\n  usually improved times, depending on the curve.\n  I also removed the lookup table, as for the added bundle size and loop we're\n  only cutting ~4 or so subdivision iterations. I bumped the max iterations up\n  to 12 to compensate and this still tended to be faster for no perceivable\n  loss in accuracy.\n  Usage\n    const easeOut = cubicBezier(.17,.67,.83,.67);\n    const x = easeOut(0.5); // returns 0.627...\n*/\n// Returns x(t) given t, x1, and x2, or y(t) given t, y1, and y2.\nconst calcBezier = (t, a1, a2) => (((1.0 - 3.0 * a2 + 3.0 * a1) * t + (3.0 * a2 - 6.0 * a1)) * t + 3.0 * a1) *\n    t;\nconst subdivisionPrecision = 0.0000001;\nconst subdivisionMaxIterations = 12;\nfunction binarySubdivide(x, lowerBound, upperBound, mX1, mX2) {\n    let currentX;\n    let currentT;\n    let i = 0;\n    do {\n        currentT = lowerBound + (upperBound - lowerBound) / 2.0;\n        currentX = calcBezier(currentT, mX1, mX2) - x;\n        if (currentX > 0.0) {\n            upperBound = currentT;\n        }\n        else {\n            lowerBound = currentT;\n        }\n    } while (Math.abs(currentX) > subdivisionPrecision &&\n        ++i < subdivisionMaxIterations);\n    return currentT;\n}\nfunction cubicBezier(mX1, mY1, mX2, mY2) {\n    // If this is a linear gradient, return linear easing\n    if (mX1 === mY1 && mX2 === mY2)\n        return noop;\n    const getTForX = (aX) => binarySubdivide(aX, 0, 1, mX1, mX2);\n    // If animation is at start/end, return t without easing\n    return (t) => t === 0 || t === 1 ? t : calcBezier(getTForX(t), mY1, mY2);\n}\n\nexport { cubicBezier };\n"],"names":["calcBezier","t","a1","a2","subdivisionPrecision","subdivisionMaxIterations","binarySubdivide","x","lowerBound","upperBound","mX1","mX2","currentX","currentT","i","cubicBezier","mY1","mY2","noop","getTForX","aX"],"mappings":";AAoBA,MAAMA,IAAa,CAACC,GAAGC,GAAIC,SAAU,IAAM,IAAMA,IAAK,IAAMD,KAAMD,KAAK,IAAME,IAAK,IAAMD,MAAOD,IAAI,IAAMC,KACrGD,GACEG,IAAuB,MACvBC,IAA2B;AACjC,SAASC,EAAgBC,GAAGC,GAAYC,GAAYC,GAAKC,GAAK;AAC1D,MAAIC,GACAC,GACAC,IAAI;AACR;AACI,IAAAD,IAAWL,KAAcC,IAAaD,KAAc,GACpDI,IAAWZ,EAAWa,GAAUH,GAAKC,CAAG,IAAIJ,GACxCK,IAAW,IACXH,IAAaI,IAGbL,IAAaK;AAAA,SAEZ,KAAK,IAAID,CAAQ,IAAIR,KAC1B,EAAEU,IAAIT;AACV,SAAOQ;AACX;AACA,SAASE,EAAYL,GAAKM,GAAKL,GAAKM,GAAK;AAErC,MAAIP,MAAQM,KAAOL,MAAQM;AACvB,WAAOC;AACX,QAAMC,IAAW,CAACC,MAAOd,EAAgBc,GAAI,GAAG,GAAGV,GAAKC,CAAG;AAE3D,SAAO,CAACV,MAAMA,MAAM,KAAKA,MAAM,IAAIA,IAAID,EAAWmB,EAASlB,CAAC,GAAGe,GAAKC,CAAG;AAC3E;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra252.js","sources":["../node_modules/framer-motion/dist/es/easing/back.mjs"],"sourcesContent":["import { cubicBezier } from './cubic-bezier.mjs';\nimport { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst backOut = cubicBezier(0.33, 1.53, 0.69, 0.99);\nconst backIn = reverseEasing(backOut);\nconst backInOut = mirrorEasing(backIn);\n\nexport { backIn, backInOut, backOut };\n"],"names":["backOut","cubicBezier","backIn","reverseEasing","backInOut","mirrorEasing"],"mappings":";;;AAIK,MAACA,IAAUC,EAAY,MAAM,MAAM,MAAM,IAAI,GAC5CC,IAASC,EAAcH,CAAO,GAC9BI,IAAYC,EAAaH,CAAM;","x_google_ignoreList":[0]}

package/dist/lyra253.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=o=>r=>r<=.5?o(2*r)/2:(2-o(2*(1-r)))/2;exports.mirrorEasing=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./lyra237.cjs"),s=(n,e,r)=>(((1-3*r+3*e)*n+(3*r-6*e))*n+3*e)*n,l=1e-7,a=12;function f(n,e,r,c,o){let i,t,u=0;do t=e+(r-e)/2,i=s(t,c,o)-n,i>0?r=t:e=t;while(Math.abs(i)>l&&++u<a);return t}function d(n,e,r,c){if(n===e&&r===c)return b.noop;const o=i=>f(i,0,1,n,r);return i=>i===0||i===1?i:s(o(i),e,c)}exports.cubicBezier=d;

package/dist/lyra253.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra253.cjs","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/mirror.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs mirrored values for\n// the second half of the animation. Turns easeIn into easeInOut.\nconst mirrorEasing = (easing) => (p) => p <= 0.5 ? easing(2 * p) / 2 : (2 - easing(2 * (1 - p))) / 2;\n\nexport { mirrorEasing };\n"],"names":["mirrorEasing","easing","p"],"mappings":"gFAEK,MAACA,EAAgBC,GAAYC,GAAMA,GAAK,GAAMD,EAAO,EAAIC,CAAC,EAAI,GAAK,EAAID,EAAO,GAAK,EAAIC,EAAE,GAAK","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra253.cjs","sources":["../node_modules/framer-motion/dist/es/easing/cubic-bezier.mjs"],"sourcesContent":["import { noop } from '../utils/noop.mjs';\n\n/*\n  Bezier function generator\n  This has been modified from Gaëtan Renaudeau's BezierEasing\n  https://github.com/gre/bezier-easing/blob/master/src/index.js\n  https://github.com/gre/bezier-easing/blob/master/LICENSE\n  \n  I've removed the newtonRaphsonIterate algo because in benchmarking it\n  wasn't noticiably faster than binarySubdivision, indeed removing it\n  usually improved times, depending on the curve.\n  I also removed the lookup table, as for the added bundle size and loop we're\n  only cutting ~4 or so subdivision iterations. I bumped the max iterations up\n  to 12 to compensate and this still tended to be faster for no perceivable\n  loss in accuracy.\n  Usage\n    const easeOut = cubicBezier(.17,.67,.83,.67);\n    const x = easeOut(0.5); // returns 0.627...\n*/\n// Returns x(t) given t, x1, and x2, or y(t) given t, y1, and y2.\nconst calcBezier = (t, a1, a2) => (((1.0 - 3.0 * a2 + 3.0 * a1) * t + (3.0 * a2 - 6.0 * a1)) * t + 3.0 * a1) *\n    t;\nconst subdivisionPrecision = 0.0000001;\nconst subdivisionMaxIterations = 12;\nfunction binarySubdivide(x, lowerBound, upperBound, mX1, mX2) {\n    let currentX;\n    let currentT;\n    let i = 0;\n    do {\n        currentT = lowerBound + (upperBound - lowerBound) / 2.0;\n        currentX = calcBezier(currentT, mX1, mX2) - x;\n        if (currentX > 0.0) {\n            upperBound = currentT;\n        }\n        else {\n            lowerBound = currentT;\n        }\n    } while (Math.abs(currentX) > subdivisionPrecision &&\n        ++i < subdivisionMaxIterations);\n    return currentT;\n}\nfunction cubicBezier(mX1, mY1, mX2, mY2) {\n    // If this is a linear gradient, return linear easing\n    if (mX1 === mY1 && mX2 === mY2)\n        return noop;\n    const getTForX = (aX) => binarySubdivide(aX, 0, 1, mX1, mX2);\n    // If animation is at start/end, return t without easing\n    return (t) => t === 0 || t === 1 ? t : calcBezier(getTForX(t), mY1, mY2);\n}\n\nexport { cubicBezier };\n"],"names":["calcBezier","t","a1","a2","subdivisionPrecision","subdivisionMaxIterations","binarySubdivide","x","lowerBound","upperBound","mX1","mX2","currentX","currentT","i","cubicBezier","mY1","mY2","noop","getTForX","aX"],"mappings":"iHAoBMA,EAAa,CAACC,EAAGC,EAAIC,OAAU,EAAM,EAAMA,EAAK,EAAMD,GAAMD,GAAK,EAAME,EAAK,EAAMD,IAAOD,EAAI,EAAMC,GACrGD,EACEG,EAAuB,KACvBC,EAA2B,GACjC,SAASC,EAAgBC,EAAGC,EAAYC,EAAYC,EAAKC,EAAK,CAC1D,IAAIC,EACAC,EACAC,EAAI,EACR,GACID,EAAWL,GAAcC,EAAaD,GAAc,EACpDI,EAAWZ,EAAWa,EAAUH,EAAKC,CAAG,EAAIJ,EACxCK,EAAW,EACXH,EAAaI,EAGbL,EAAaK,QAEZ,KAAK,IAAID,CAAQ,EAAIR,GAC1B,EAAEU,EAAIT,GACV,OAAOQ,CACX,CACA,SAASE,EAAYL,EAAKM,EAAKL,EAAKM,EAAK,CAErC,GAAIP,IAAQM,GAAOL,IAAQM,EACvB,OAAOC,OACX,MAAMC,EAAYC,GAAOd,EAAgBc,EAAI,EAAG,EAAGV,EAAKC,CAAG,EAE3D,OAAQV,GAAMA,IAAM,GAAKA,IAAM,EAAIA,EAAID,EAAWmB,EAASlB,CAAC,EAAGe,EAAKC,CAAG,CAC3E","x_google_ignoreList":[0]}

package/dist/lyra253.js

@@ -1,4 +1,18 @@
-const t = (o) => (r) => r <= 0.5 ? o(2 * r) / 2 : (2 - o(2 * (1 - r))) / 2;
+import { noop as b } from "./lyra237.js";
+const s = (n, i, r) => (((1 - 3 * r + 3 * i) * n + (3 * r - 6 * i)) * n + 3 * i) * n, f = 1e-7, l = 12;
+function a(n, i, r, c, o) {
+  let e, t, u = 0;
+  do
+    t = i + (r - i) / 2, e = s(t, c, o) - n, e > 0 ? r = t : i = t;
+  while (Math.abs(e) > f && ++u < l);
+  return t;
+}
+function d(n, i, r, c) {
+  if (n === i && r === c)
+    return b;
+  const o = (e) => a(e, 0, 1, n, r);
+  return (e) => e === 0 || e === 1 ? e : s(o(e), i, c);
+}
 export {
-  t as mirrorEasing
+  d as cubicBezier
 };

package/dist/lyra253.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra253.js","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/mirror.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs mirrored values for\n// the second half of the animation. Turns easeIn into easeInOut.\nconst mirrorEasing = (easing) => (p) => p <= 0.5 ? easing(2 * p) / 2 : (2 - easing(2 * (1 - p))) / 2;\n\nexport { mirrorEasing };\n"],"names":["mirrorEasing","easing","p"],"mappings":"AAEK,MAACA,IAAe,CAACC,MAAW,CAACC,MAAMA,KAAK,MAAMD,EAAO,IAAIC,CAAC,IAAI,KAAK,IAAID,EAAO,KAAK,IAAIC,EAAE,KAAK;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra253.js","sources":["../node_modules/framer-motion/dist/es/easing/cubic-bezier.mjs"],"sourcesContent":["import { noop } from '../utils/noop.mjs';\n\n/*\n  Bezier function generator\n  This has been modified from Gaëtan Renaudeau's BezierEasing\n  https://github.com/gre/bezier-easing/blob/master/src/index.js\n  https://github.com/gre/bezier-easing/blob/master/LICENSE\n  \n  I've removed the newtonRaphsonIterate algo because in benchmarking it\n  wasn't noticiably faster than binarySubdivision, indeed removing it\n  usually improved times, depending on the curve.\n  I also removed the lookup table, as for the added bundle size and loop we're\n  only cutting ~4 or so subdivision iterations. I bumped the max iterations up\n  to 12 to compensate and this still tended to be faster for no perceivable\n  loss in accuracy.\n  Usage\n    const easeOut = cubicBezier(.17,.67,.83,.67);\n    const x = easeOut(0.5); // returns 0.627...\n*/\n// Returns x(t) given t, x1, and x2, or y(t) given t, y1, and y2.\nconst calcBezier = (t, a1, a2) => (((1.0 - 3.0 * a2 + 3.0 * a1) * t + (3.0 * a2 - 6.0 * a1)) * t + 3.0 * a1) *\n    t;\nconst subdivisionPrecision = 0.0000001;\nconst subdivisionMaxIterations = 12;\nfunction binarySubdivide(x, lowerBound, upperBound, mX1, mX2) {\n    let currentX;\n    let currentT;\n    let i = 0;\n    do {\n        currentT = lowerBound + (upperBound - lowerBound) / 2.0;\n        currentX = calcBezier(currentT, mX1, mX2) - x;\n        if (currentX > 0.0) {\n            upperBound = currentT;\n        }\n        else {\n            lowerBound = currentT;\n        }\n    } while (Math.abs(currentX) > subdivisionPrecision &&\n        ++i < subdivisionMaxIterations);\n    return currentT;\n}\nfunction cubicBezier(mX1, mY1, mX2, mY2) {\n    // If this is a linear gradient, return linear easing\n    if (mX1 === mY1 && mX2 === mY2)\n        return noop;\n    const getTForX = (aX) => binarySubdivide(aX, 0, 1, mX1, mX2);\n    // If animation is at start/end, return t without easing\n    return (t) => t === 0 || t === 1 ? t : calcBezier(getTForX(t), mY1, mY2);\n}\n\nexport { cubicBezier };\n"],"names":["calcBezier","t","a1","a2","subdivisionPrecision","subdivisionMaxIterations","binarySubdivide","x","lowerBound","upperBound","mX1","mX2","currentX","currentT","i","cubicBezier","mY1","mY2","noop","getTForX","aX"],"mappings":";AAoBA,MAAMA,IAAa,CAACC,GAAGC,GAAIC,SAAU,IAAM,IAAMA,IAAK,IAAMD,KAAMD,KAAK,IAAME,IAAK,IAAMD,MAAOD,IAAI,IAAMC,KACrGD,GACEG,IAAuB,MACvBC,IAA2B;AACjC,SAASC,EAAgBC,GAAGC,GAAYC,GAAYC,GAAKC,GAAK;AAC1D,MAAIC,GACAC,GACAC,IAAI;AACR;AACI,IAAAD,IAAWL,KAAcC,IAAaD,KAAc,GACpDI,IAAWZ,EAAWa,GAAUH,GAAKC,CAAG,IAAIJ,GACxCK,IAAW,IACXH,IAAaI,IAGbL,IAAaK;AAAA,SAEZ,KAAK,IAAID,CAAQ,IAAIR,KAC1B,EAAEU,IAAIT;AACV,SAAOQ;AACX;AACA,SAASE,EAAYL,GAAKM,GAAKL,GAAKM,GAAK;AAErC,MAAIP,MAAQM,KAAOL,MAAQM;AACvB,WAAOC;AACX,QAAMC,IAAW,CAACC,MAAOd,EAAgBc,GAAI,GAAG,GAAGV,GAAKC,CAAG;AAE3D,SAAO,CAACV,MAAMA,MAAM,KAAKA,MAAM,IAAIA,IAAID,EAAWmB,EAASlB,CAAC,GAAGe,GAAKC,CAAG;AAC3E;","x_google_ignoreList":[0]}

package/dist/lyra254.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=e=>r=>1-e(1-r);exports.reverseEasing=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=o=>r=>r<=.5?o(2*r)/2:(2-o(2*(1-r)))/2;exports.mirrorEasing=t;

package/dist/lyra254.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra254.cjs","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/reverse.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs reversed values.\n// Turns easeIn into easeOut.\nconst reverseEasing = (easing) => (p) => 1 - easing(1 - p);\n\nexport { reverseEasing };\n"],"names":["reverseEasing","easing","p"],"mappings":"gFAEK,MAACA,EAAiBC,GAAYC,GAAM,EAAID,EAAO,EAAIC,CAAC","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra254.cjs","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/mirror.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs mirrored values for\n// the second half of the animation. Turns easeIn into easeInOut.\nconst mirrorEasing = (easing) => (p) => p <= 0.5 ? easing(2 * p) / 2 : (2 - easing(2 * (1 - p))) / 2;\n\nexport { mirrorEasing };\n"],"names":["mirrorEasing","easing","p"],"mappings":"gFAEK,MAACA,EAAgBC,GAAYC,GAAMA,GAAK,GAAMD,EAAO,EAAIC,CAAC,EAAI,GAAK,EAAID,EAAO,GAAK,EAAIC,EAAE,GAAK","x_google_ignoreList":[0]}

package/dist/lyra254.js

@@ -1,4 +1,4 @@
-const s = (e) => (r) => 1 - e(1 - r);
+const t = (o) => (r) => r <= 0.5 ? o(2 * r) / 2 : (2 - o(2 * (1 - r))) / 2;
 export {
-  s as reverseEasing
+  t as mirrorEasing
 };

package/dist/lyra254.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra254.js","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/reverse.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs reversed values.\n// Turns easeIn into easeOut.\nconst reverseEasing = (easing) => (p) => 1 - easing(1 - p);\n\nexport { reverseEasing };\n"],"names":["reverseEasing","easing","p"],"mappings":"AAEK,MAACA,IAAgB,CAACC,MAAW,CAACC,MAAM,IAAID,EAAO,IAAIC,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra254.js","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/mirror.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs mirrored values for\n// the second half of the animation. Turns easeIn into easeInOut.\nconst mirrorEasing = (easing) => (p) => p <= 0.5 ? easing(2 * p) / 2 : (2 - easing(2 * (1 - p))) / 2;\n\nexport { mirrorEasing };\n"],"names":["mirrorEasing","easing","p"],"mappings":"AAEK,MAACA,IAAe,CAACC,MAAW,CAACC,MAAMA,KAAK,MAAMD,EAAO,IAAIC,CAAC,IAAI,KAAK,IAAID,EAAO,KAAK,IAAIC,EAAE,KAAK;","x_google_ignoreList":[0]}

package/dist/lyra255.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./lyra253.cjs"),i=require("./lyra254.cjs"),r=e=>1-Math.sin(Math.acos(e)),c=i.reverseEasing(r),n=t.mirrorEasing(c);exports.circIn=r;exports.circInOut=n;exports.circOut=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=e=>r=>1-e(1-r);exports.reverseEasing=s;

package/dist/lyra255.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra255.cjs","sources":["../node_modules/framer-motion/dist/es/easing/circ.mjs"],"sourcesContent":["import { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst circIn = (p) => 1 - Math.sin(Math.acos(p));\nconst circOut = reverseEasing(circIn);\nconst circInOut = mirrorEasing(circOut);\n\nexport { circIn, circInOut, circOut };\n"],"names":["circIn","p","circOut","reverseEasing","circInOut","mirrorEasing"],"mappings":"4IAGMA,EAAUC,GAAM,EAAI,KAAK,IAAI,KAAK,KAAKA,CAAC,CAAC,EACzCC,EAAUC,EAAa,cAACH,CAAM,EAC9BI,EAAYC,EAAY,aAACH,CAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra255.cjs","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/reverse.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs reversed values.\n// Turns easeIn into easeOut.\nconst reverseEasing = (easing) => (p) => 1 - easing(1 - p);\n\nexport { reverseEasing };\n"],"names":["reverseEasing","easing","p"],"mappings":"gFAEK,MAACA,EAAiBC,GAAYC,GAAM,EAAID,EAAO,EAAIC,CAAC","x_google_ignoreList":[0]}

package/dist/lyra255.js

@@ -1,8 +1,4 @@
-import { mirrorEasing as c } from "./lyra253.js";
-import { reverseEasing as o } from "./lyra254.js";
-const t = (r) => 1 - Math.sin(Math.acos(r)), i = o(t), a = c(i);
+const s = (e) => (r) => 1 - e(1 - r);
 export {
-  t as circIn,
-  a as circInOut,
-  i as circOut
+  s as reverseEasing
 };

package/dist/lyra255.js.map

@@ -1 +1 @@
-{"version":3,"file":"lyra255.js","sources":["../node_modules/framer-motion/dist/es/easing/circ.mjs"],"sourcesContent":["import { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst circIn = (p) => 1 - Math.sin(Math.acos(p));\nconst circOut = reverseEasing(circIn);\nconst circInOut = mirrorEasing(circOut);\n\nexport { circIn, circInOut, circOut };\n"],"names":["circIn","p","circOut","reverseEasing","circInOut","mirrorEasing"],"mappings":";;AAGK,MAACA,IAAS,CAACC,MAAM,IAAI,KAAK,IAAI,KAAK,KAAKA,CAAC,CAAC,GACzCC,IAAUC,EAAcH,CAAM,GAC9BI,IAAYC,EAAaH,CAAO;","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra255.js","sources":["../node_modules/framer-motion/dist/es/easing/modifiers/reverse.mjs"],"sourcesContent":["// Accepts an easing function and returns a new one that outputs reversed values.\n// Turns easeIn into easeOut.\nconst reverseEasing = (easing) => (p) => 1 - easing(1 - p);\n\nexport { reverseEasing };\n"],"names":["reverseEasing","easing","p"],"mappings":"AAEK,MAACA,IAAgB,CAACC,MAAW,CAACC,MAAM,IAAID,EAAO,IAAIC,CAAC;","x_google_ignoreList":[0]}

package/dist/lyra256.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./lyra252.cjs"),c=e.cubicBezier(.42,0,1,1),t=e.cubicBezier(0,0,.58,1),i=e.cubicBezier(.42,0,.58,1);exports.easeIn=c;exports.easeInOut=i;exports.easeOut=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./lyra254.cjs"),i=require("./lyra255.cjs"),r=e=>1-Math.sin(Math.acos(e)),c=i.reverseEasing(r),n=t.mirrorEasing(c);exports.circIn=r;exports.circInOut=n;exports.circOut=c;

package/dist/lyra256.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"lyra256.cjs","sources":["../node_modules/framer-motion/dist/es/easing/ease.mjs"],"sourcesContent":["import { cubicBezier } from './cubic-bezier.mjs';\n\nconst easeIn = cubicBezier(0.42, 0, 1, 1);\nconst easeOut = cubicBezier(0, 0, 0.58, 1);\nconst easeInOut = cubicBezier(0.42, 0, 0.58, 1);\n\nexport { easeIn, easeInOut, easeOut };\n"],"names":["easeIn","cubicBezier","easeOut","easeInOut"],"mappings":"iHAEMA,EAASC,EAAAA,YAAY,IAAM,EAAG,EAAG,CAAC,EAClCC,EAAUD,EAAAA,YAAY,EAAG,EAAG,IAAM,CAAC,EACnCE,EAAYF,EAAAA,YAAY,IAAM,EAAG,IAAM,CAAC","x_google_ignoreList":[0]}
+{"version":3,"file":"lyra256.cjs","sources":["../node_modules/framer-motion/dist/es/easing/circ.mjs"],"sourcesContent":["import { mirrorEasing } from './modifiers/mirror.mjs';\nimport { reverseEasing } from './modifiers/reverse.mjs';\n\nconst circIn = (p) => 1 - Math.sin(Math.acos(p));\nconst circOut = reverseEasing(circIn);\nconst circInOut = mirrorEasing(circOut);\n\nexport { circIn, circInOut, circOut };\n"],"names":["circIn","p","circOut","reverseEasing","circInOut","mirrorEasing"],"mappings":"4IAGMA,EAAUC,GAAM,EAAI,KAAK,IAAI,KAAK,KAAKA,CAAC,CAAC,EACzCC,EAAUC,EAAa,cAACH,CAAM,EAC9BI,EAAYC,EAAY,aAACH,CAAO","x_google_ignoreList":[0]}