tempest-react-sdk 0.23.0 → 0.25.0

package/dist/utilities.css

@@ -0,0 +1,432 @@
+/* ============================================================
+ * tempest-react-sdk/utilities.css — opt-in app-level layout layer
+ *
+ * NOT imported by `styles.css`. Import it explicitly when you want it:
+ *
+ *   import "tempest-react-sdk/styles.css";
+ *   import "tempest-react-sdk/utilities.css";
+ *
+ * Why it exists: the components are styled by CSS Modules, which means an app
+ * still had to hand-write CSS for the layer *around* them — a page shell, a
+ * two-column form, a row of actions, a card. This is that layer, expressed only
+ * in `--tempest-*` tokens, so it stays in step with the theme (including
+ * `createTheme` output and dark mode).
+ *
+ * Why it is opt-in: it ships ~50 global class names. An app that already has its
+ * own layout system should not pay for them, and global classes are not something
+ * to inject into someone's page uninvited.
+ *
+ * Scope rules:
+ *   - Every class is prefixed `tempest-` (no collisions with app CSS).
+ *   - Every value comes from a token — no literal colors, no magic numbers.
+ *   - Tunable per instance through the local `--tempest-*` vars documented below.
+ *   - Single class, no forced overrides, so your own CSS wins on a specificity
+ *     tie instead of fighting the layer.
+ * ============================================================ */
+
+/* ============================================================
+ * Layout — the primitives every screen repeats
+ * ============================================================ */
+
+/**
+ * Page container: centered, max-width, gutters that respect the safe area.
+ * Tune with `--tempest-container-width` and `--tempest-container-gutter`.
+ */
+.tempest-container {
+    width: 100%;
+    max-width: var(--tempest-container-width, 1200px);
+    margin-inline: auto;
+    padding-inline: max(
+        var(--tempest-container-gutter, var(--tempest-space-4)),
+        var(--tempest-safe-area-left)
+    );
+}
+
+/** Vertical flow with a single gap. Tune with `--tempest-stack-gap`. */
+.tempest-stack {
+    display: flex;
+    flex-direction: column;
+    gap: var(--tempest-stack-gap, var(--tempest-space-4));
+}
+
+/** Horizontal group that wraps instead of overflowing. Tune with `--tempest-cluster-gap`. */
+.tempest-cluster {
+    display: flex;
+    flex-wrap: wrap;
+    align-items: center;
+    gap: var(--tempest-cluster-gap, var(--tempest-space-3));
+}
+
+/** Horizontal group that does not wrap — toolbars, inline fields. */
+.tempest-row {
+    display: flex;
+    flex-direction: row;
+    align-items: center;
+    gap: var(--tempest-row-gap, var(--tempest-space-3));
+}
+
+/** Center a child both ways. */
+.tempest-center {
+    display: flex;
+    align-items: center;
+    justify-content: center;
+}
+
+/** Push the first and last child apart (title on the left, actions on the right). */
+.tempest-spread {
+    display: flex;
+    align-items: center;
+    justify-content: space-between;
+    gap: var(--tempest-row-gap, var(--tempest-space-3));
+}
+
+/**
+ * Responsive card grid with no media query: columns fit as many as
+ * `--tempest-grid-min` allows.
+ */
+.tempest-grid-auto {
+    display: grid;
+    gap: var(--tempest-grid-gap, var(--tempest-space-4));
+    grid-template-columns: repeat(
+        auto-fill,
+        minmax(min(var(--tempest-grid-min, 260px), 100%), 1fr)
+    );
+}
+
+/**
+ * Sidebar + content. Collapses to one column below `--tempest-bp-md` because a
+ * fixed sidebar is unusable on a phone.
+ */
+.tempest-sidebar-layout {
+    display: grid;
+    gap: var(--tempest-sidebar-gap, var(--tempest-space-6));
+    grid-template-columns: 1fr;
+}
+
+@media (min-width: 768px) {
+    .tempest-sidebar-layout {
+        grid-template-columns: var(--tempest-sidebar-width, 260px) 1fr;
+        align-items: start;
+    }
+}
+
+/**
+ * Two-column form grid that collapses on small screens. A field spanning the
+ * full row takes `.tempest-form-span`.
+ */
+.tempest-form-grid {
+    display: grid;
+    gap: var(--tempest-form-gap, var(--tempest-space-4));
+    grid-template-columns: 1fr;
+}
+
+@media (min-width: 640px) {
+    .tempest-form-grid {
+        grid-template-columns: repeat(var(--tempest-form-columns, 2), minmax(0, 1fr));
+    }
+}
+
+.tempest-form-span {
+    grid-column: 1 / -1;
+}
+
+/** Take the remaining space in a flex container. */
+.tempest-fill {
+    flex: 1 1 auto;
+    min-width: 0;
+}
+
+/** Never shrink below content size (icon buttons next to a growing field). */
+.tempest-fixed {
+    flex: 0 0 auto;
+}
+
+/* ============================================================
+ * Spacing — gap and padding on the token scale
+ * ============================================================ */
+
+.tempest-gap-0 {
+    gap: var(--tempest-space-0);
+}
+.tempest-gap-1 {
+    gap: var(--tempest-space-1);
+}
+.tempest-gap-2 {
+    gap: var(--tempest-space-2);
+}
+.tempest-gap-3 {
+    gap: var(--tempest-space-3);
+}
+.tempest-gap-4 {
+    gap: var(--tempest-space-4);
+}
+.tempest-gap-5 {
+    gap: var(--tempest-space-5);
+}
+.tempest-gap-6 {
+    gap: var(--tempest-space-6);
+}
+.tempest-gap-8 {
+    gap: var(--tempest-space-8);
+}
+.tempest-gap-10 {
+    gap: var(--tempest-space-10);
+}
+.tempest-gap-12 {
+    gap: var(--tempest-space-12);
+}
+
+.tempest-pad-0 {
+    padding: var(--tempest-space-0);
+}
+.tempest-pad-2 {
+    padding: var(--tempest-space-2);
+}
+.tempest-pad-3 {
+    padding: var(--tempest-space-3);
+}
+.tempest-pad-4 {
+    padding: var(--tempest-space-4);
+}
+.tempest-pad-6 {
+    padding: var(--tempest-space-6);
+}
+.tempest-pad-8 {
+    padding: var(--tempest-space-8);
+}
+
+.tempest-pad-block {
+    padding-block: var(--tempest-pad-block, var(--tempest-space-6));
+}
+
+.tempest-pad-inline {
+    padding-inline: var(--tempest-pad-inline, var(--tempest-space-4));
+}
+
+/* ============================================================
+ * Text — the handful of treatments every screen needs
+ * ============================================================ */
+
+/** One line, ellipsis. Needs a bounded width (pair with `.tempest-fill`). */
+.tempest-truncate {
+    overflow: hidden;
+    text-overflow: ellipsis;
+    white-space: nowrap;
+}
+
+/** Clamp to N lines with an ellipsis. */
+.tempest-clamp-2,
+.tempest-clamp-3,
+.tempest-clamp-4 {
+    display: -webkit-box;
+    -webkit-box-orient: vertical;
+    overflow: hidden;
+}
+
+.tempest-clamp-2 {
+    -webkit-line-clamp: 2;
+    line-clamp: 2;
+}
+
+.tempest-clamp-3 {
+    -webkit-line-clamp: 3;
+    line-clamp: 3;
+}
+
+.tempest-clamp-4 {
+    -webkit-line-clamp: 4;
+    line-clamp: 4;
+}
+
+.tempest-text-muted {
+    color: var(--tempest-text-muted);
+}
+
+.tempest-text-subtle {
+    color: var(--tempest-text-subtle);
+}
+
+.tempest-text-xs {
+    font-size: var(--tempest-text-xs);
+}
+.tempest-text-sm {
+    font-size: var(--tempest-text-sm);
+}
+.tempest-text-base {
+    font-size: var(--tempest-text-base);
+}
+.tempest-text-lg {
+    font-size: var(--tempest-text-lg);
+}
+.tempest-text-xl {
+    font-size: var(--tempest-text-xl);
+}
+.tempest-text-2xl {
+    font-size: var(--tempest-text-2xl);
+}
+
+.tempest-weight-medium {
+    font-weight: var(--tempest-weight-medium);
+}
+.tempest-weight-semibold {
+    font-weight: var(--tempest-weight-semibold);
+}
+.tempest-weight-bold {
+    font-weight: var(--tempest-weight-bold);
+}
+
+/** Tabular figures — keeps columns of numbers from dancing as values change. */
+.tempest-numeric {
+    font-variant-numeric: tabular-nums;
+    font-feature-settings: "tnum";
+}
+
+/* ============================================================
+ * Surfaces — card, panel, divider
+ * ============================================================ */
+
+/** Raised surface: background, border, radius, shadow. */
+.tempest-card {
+    background: var(--tempest-bg);
+    border: 1px solid var(--tempest-border);
+    border-radius: var(--tempest-radius-lg);
+    box-shadow: var(--tempest-shadow-sm);
+    padding: var(--tempest-card-padding, var(--tempest-space-5));
+}
+
+/** Flat surface: same shape, no shadow — for a section inside a card. */
+.tempest-panel {
+    background: var(--tempest-surface);
+    border: 1px solid var(--tempest-border);
+    border-radius: var(--tempest-radius-md);
+    padding: var(--tempest-panel-padding, var(--tempest-space-4));
+}
+
+/** Inset surface for code samples, empty states, previews. */
+.tempest-inset {
+    background: var(--tempest-surface-2);
+    border-radius: var(--tempest-radius-md);
+    padding: var(--tempest-space-4);
+}
+
+.tempest-divider {
+    border: 0;
+    border-top: 1px solid var(--tempest-border);
+    margin-block: var(--tempest-space-4);
+}
+
+/* ============================================================
+ * Scrolling — bounded regions that do not blow up the page
+ * ============================================================ */
+
+/**
+ * Horizontal scroll region. Wide content (a table, a chart) scrolls *here*
+ * instead of making the whole page scroll sideways.
+ */
+.tempest-scroll-x {
+    overflow-x: auto;
+    overscroll-behavior-x: contain;
+    -webkit-overflow-scrolling: touch;
+}
+
+.tempest-scroll-y {
+    overflow-y: auto;
+    overscroll-behavior-y: contain;
+    -webkit-overflow-scrolling: touch;
+}
+
+/* ============================================================
+ * Page pattern — the shell every screen shares
+ * ============================================================ */
+
+.tempest-page {
+    display: flex;
+    flex-direction: column;
+    gap: var(--tempest-page-gap, var(--tempest-space-6));
+    padding-block: var(--tempest-space-6);
+}
+
+/** Title on the left, actions on the right; stacks on narrow screens. */
+.tempest-page-header {
+    display: flex;
+    flex-wrap: wrap;
+    align-items: flex-start;
+    justify-content: space-between;
+    gap: var(--tempest-space-3);
+}
+
+.tempest-page-title {
+    margin: 0;
+    font-size: var(--tempest-text-fluid-2xl);
+    font-weight: var(--tempest-weight-semibold);
+    line-height: var(--tempest-leading-tight);
+    color: var(--tempest-text);
+}
+
+.tempest-page-subtitle {
+    margin: 0;
+    font-size: var(--tempest-text-sm);
+    color: var(--tempest-text-muted);
+}
+
+/** Sticky filter/action bar above a list. */
+.tempest-toolbar {
+    display: flex;
+    flex-wrap: wrap;
+    align-items: center;
+    gap: var(--tempest-space-3);
+    padding: var(--tempest-space-3);
+    background: var(--tempest-bg);
+    border: 1px solid var(--tempest-border);
+    border-radius: var(--tempest-radius-md);
+}
+
+.tempest-toolbar-sticky {
+    position: sticky;
+    top: var(--tempest-toolbar-top, 0);
+    z-index: var(--tempest-z-sticky);
+}
+
+/* ============================================================
+ * Media — fixed ratios without layout shift
+ * ============================================================ */
+
+.tempest-aspect-video {
+    aspect-ratio: 16 / 9;
+    width: 100%;
+    object-fit: cover;
+}
+
+.tempest-aspect-square {
+    aspect-ratio: 1 / 1;
+    width: 100%;
+    object-fit: cover;
+}
+
+/* ============================================================
+ * Misc
+ * ============================================================ */
+
+/** Visually hidden, still announced by screen readers. */
+.tempest-visually-hidden {
+    position: absolute;
+    width: 1px;
+    height: 1px;
+    margin: -1px;
+    padding: 0;
+    overflow: hidden;
+    clip-path: inset(50%);
+    white-space: nowrap;
+    border: 0;
+}
+
+.tempest-no-select {
+    user-select: none;
+}
+
+/** Kill the pointer and dim — a region waiting on a request. */
+.tempest-busy {
+    pointer-events: none;
+    opacity: 0.6;
+    transition: opacity var(--tempest-duration-fast) var(--tempest-ease-out);
+}

package/dist/utils/arrays.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function c(u,t){const e={};for(const n of u){const r=t(n);(e[r]??=[]).push(n)}return e}function s(u,t){const e=new Set,n=[];for(const r of u){const o=t(r);e.has(o)||(e.add(o),n.push(r))}return n}function i(u,t){if(t<1)throw new RangeError(`chunk size must be >= 1, received ${t}`);const e=[];for(let n=0;n<u.length;n+=t)e.push(u.slice(n,n+t));return e}function f(u,t,e=1){const n=[];if(e===0)return n;if(e>0)for(let r=u;r<t;r+=e)n.push(r);else for(let r=u;r>t;r+=e)n.push(r);return n}exports.chunk=i;exports.groupBy=c;exports.range=f;exports.uniqueBy=s;
-//# sourceMappingURL=arrays.cjs.map
+function e(e,t){let n={};for(let r of e){let e=t(r);(n[e]??=[]).push(r)}return n}function t(e,t){let n=new Set,r=[];for(let i of e){let e=t(i);n.has(e)||(n.add(e),r.push(i))}return r}function n(e,t){if(t<1)throw RangeError(`chunk size must be >= 1, received ${t}`);let n=[];for(let r=0;r<e.length;r+=t)n.push(e.slice(r,r+t));return n}function r(e,t,n=1){let r=[];if(n===0)return r;if(n>0)for(let i=e;i<t;i+=n)r.push(i);else for(let i=e;i>t;i+=n)r.push(i);return r}exports.chunk=n,exports.groupBy=e,exports.range=r,exports.uniqueBy=t;
+//# sourceMappingURL=arrays.cjs.map

package/dist/utils/arrays.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"arrays.cjs","sources":["../../src/utils/arrays.ts"],"sourcesContent":["/**\n * Group items of a list into buckets keyed by the result of `key`.\n *\n * Items preserve their original order within each bucket.\n *\n * @example\n * groupBy([1, 2, 3, 4], (n) => (n % 2 === 0 ? \"even\" : \"odd\"));\n * // { odd: [1, 3], even: [2, 4] }\n *\n * @example\n * groupBy([{ city: \"SP\" }, { city: \"RJ\" }, { city: \"SP\" }], (u) => u.city);\n * // { SP: [{ city: \"SP\" }, { city: \"SP\" }], RJ: [{ city: \"RJ\" }] }\n */\nexport function groupBy<T, K extends PropertyKey>(items: T[], key: (item: T) => K): Record<K, T[]> {\n    const result = {} as Record<K, T[]>;\n    for (const item of items) {\n        const k = key(item);\n        (result[k] ??= []).push(item);\n    }\n    return result;\n}\n\n/**\n * Remove duplicate items, keeping the first occurrence of each distinct key.\n *\n * Equality is determined by the value returned from `key` (compared with `===`).\n *\n * @example\n * uniqueBy([1, 2, 2, 3, 1], (n) => n); // [1, 2, 3]\n *\n * @example\n * uniqueBy(\n *   [{ id: 1, v: \"a\" }, { id: 1, v: \"b\" }, { id: 2, v: \"c\" }],\n *   (u) => u.id,\n * );\n * // [{ id: 1, v: \"a\" }, { id: 2, v: \"c\" }]\n */\nexport function uniqueBy<T>(items: T[], key: (item: T) => unknown): T[] {\n    const seen = new Set<unknown>();\n    const result: T[] = [];\n    for (const item of items) {\n        const k = key(item);\n        if (!seen.has(k)) {\n            seen.add(k);\n            result.push(item);\n        }\n    }\n    return result;\n}\n\n/**\n * Split a list into consecutive chunks of at most `size` items.\n *\n * The final chunk may be smaller than `size`. An empty input yields `[]`.\n *\n * @param items - The list to split.\n * @param size - Maximum chunk length; must be `>= 1`.\n * @throws {RangeError} When `size` is less than `1`.\n *\n * @example\n * chunk([1, 2, 3, 4, 5], 2); // [[1, 2], [3, 4], [5]]\n *\n * @example\n * chunk([], 3); // []\n */\nexport function chunk<T>(items: T[], size: number): T[][] {\n    if (size < 1) {\n        throw new RangeError(`chunk size must be >= 1, received ${size}`);\n    }\n    const result: T[][] = [];\n    for (let i = 0; i < items.length; i += size) {\n        result.push(items.slice(i, i + size));\n    }\n    return result;\n}\n\n/**\n * Build a numeric range from `start` (inclusive) to `end` (exclusive).\n *\n * - `step` defaults to `1` and may be negative for descending ranges.\n * - Returns an empty array when no progress can be made toward `end`\n *   (wrong-direction step, zero step, or `start === end`).\n *\n * @param start - First value of the range.\n * @param end - Exclusive upper (or lower, for negative step) bound.\n * @param step - Increment between values; defaults to `1`.\n *\n * @example\n * range(0, 5);        // [0, 1, 2, 3, 4]\n * range(0, 10, 2);    // [0, 2, 4, 6, 8]\n * range(5, 0, -1);    // [5, 4, 3, 2, 1]\n * range(0, 5, -1);    // [] (wrong direction)\n * range(3, 3);        // []\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n    const result: number[] = [];\n    if (step === 0) return result;\n    if (step > 0) {\n        for (let i = start; i < end; i += step) result.push(i);\n    } else {\n        for (let i = start; i > end; i += step) result.push(i);\n    }\n    return result;\n}\n"],"names":["groupBy","items","key","result","item","k","uniqueBy","seen","chunk","size","i","range","start","end","step"],"mappings":"gFAaO,SAASA,EAAkCC,EAAYC,EAAqC,CAC/F,MAAMC,EAAS,CAAA,EACf,UAAWC,KAAQH,EAAO,CACtB,MAAMI,EAAIH,EAAIE,CAAI,GACjBD,EAAOE,CAAC,IAAM,CAAA,GAAI,KAAKD,CAAI,CAChC,CACA,OAAOD,CACX,CAiBO,SAASG,EAAYL,EAAYC,EAAgC,CACpE,MAAMK,MAAW,IACXJ,EAAc,CAAA,EACpB,UAAWC,KAAQH,EAAO,CACtB,MAAMI,EAAIH,EAAIE,CAAI,EACbG,EAAK,IAAIF,CAAC,IACXE,EAAK,IAAIF,CAAC,EACVF,EAAO,KAAKC,CAAI,EAExB,CACA,OAAOD,CACX,CAiBO,SAASK,EAASP,EAAYQ,EAAqB,CACtD,GAAIA,EAAO,EACP,MAAM,IAAI,WAAW,qCAAqCA,CAAI,EAAE,EAEpE,MAAMN,EAAgB,CAAA,EACtB,QAASO,EAAI,EAAGA,EAAIT,EAAM,OAAQS,GAAKD,EACnCN,EAAO,KAAKF,EAAM,MAAMS,EAAGA,EAAID,CAAI,CAAC,EAExC,OAAON,CACX,CAoBO,SAASQ,EAAMC,EAAeC,EAAaC,EAAe,EAAa,CAC1E,MAAMX,EAAmB,CAAA,EACzB,GAAIW,IAAS,EAAG,OAAOX,EACvB,GAAIW,EAAO,EACP,QAASJ,EAAIE,EAAOF,EAAIG,EAAKH,GAAKI,EAAMX,EAAO,KAAKO,CAAC,MAErD,SAASA,EAAIE,EAAOF,EAAIG,EAAKH,GAAKI,EAAMX,EAAO,KAAKO,CAAC,EAEzD,OAAOP,CACX"}
+{"version":3,"file":"arrays.cjs","names":[],"sources":["../../src/utils/arrays.ts"],"sourcesContent":["/**\n * Group items of a list into buckets keyed by the result of `key`.\n *\n * Items preserve their original order within each bucket.\n *\n * @example\n * groupBy([1, 2, 3, 4], (n) => (n % 2 === 0 ? \"even\" : \"odd\"));\n * // { odd: [1, 3], even: [2, 4] }\n *\n * @example\n * groupBy([{ city: \"SP\" }, { city: \"RJ\" }, { city: \"SP\" }], (u) => u.city);\n * // { SP: [{ city: \"SP\" }, { city: \"SP\" }], RJ: [{ city: \"RJ\" }] }\n */\nexport function groupBy<T, K extends PropertyKey>(items: T[], key: (item: T) => K): Record<K, T[]> {\n    const result = {} as Record<K, T[]>;\n    for (const item of items) {\n        const k = key(item);\n        (result[k] ??= []).push(item);\n    }\n    return result;\n}\n\n/**\n * Remove duplicate items, keeping the first occurrence of each distinct key.\n *\n * Equality is determined by the value returned from `key` (compared with `===`).\n *\n * @example\n * uniqueBy([1, 2, 2, 3, 1], (n) => n); // [1, 2, 3]\n *\n * @example\n * uniqueBy(\n *   [{ id: 1, v: \"a\" }, { id: 1, v: \"b\" }, { id: 2, v: \"c\" }],\n *   (u) => u.id,\n * );\n * // [{ id: 1, v: \"a\" }, { id: 2, v: \"c\" }]\n */\nexport function uniqueBy<T>(items: T[], key: (item: T) => unknown): T[] {\n    const seen = new Set<unknown>();\n    const result: T[] = [];\n    for (const item of items) {\n        const k = key(item);\n        if (!seen.has(k)) {\n            seen.add(k);\n            result.push(item);\n        }\n    }\n    return result;\n}\n\n/**\n * Split a list into consecutive chunks of at most `size` items.\n *\n * The final chunk may be smaller than `size`. An empty input yields `[]`.\n *\n * @param items - The list to split.\n * @param size - Maximum chunk length; must be `>= 1`.\n * @throws {RangeError} When `size` is less than `1`.\n *\n * @example\n * chunk([1, 2, 3, 4, 5], 2); // [[1, 2], [3, 4], [5]]\n *\n * @example\n * chunk([], 3); // []\n */\nexport function chunk<T>(items: T[], size: number): T[][] {\n    if (size < 1) {\n        throw new RangeError(`chunk size must be >= 1, received ${size}`);\n    }\n    const result: T[][] = [];\n    for (let i = 0; i < items.length; i += size) {\n        result.push(items.slice(i, i + size));\n    }\n    return result;\n}\n\n/**\n * Build a numeric range from `start` (inclusive) to `end` (exclusive).\n *\n * - `step` defaults to `1` and may be negative for descending ranges.\n * - Returns an empty array when no progress can be made toward `end`\n *   (wrong-direction step, zero step, or `start === end`).\n *\n * @param start - First value of the range.\n * @param end - Exclusive upper (or lower, for negative step) bound.\n * @param step - Increment between values; defaults to `1`.\n *\n * @example\n * range(0, 5);        // [0, 1, 2, 3, 4]\n * range(0, 10, 2);    // [0, 2, 4, 6, 8]\n * range(5, 0, -1);    // [5, 4, 3, 2, 1]\n * range(0, 5, -1);    // [] (wrong direction)\n * range(3, 3);        // []\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n    const result: number[] = [];\n    if (step === 0) return result;\n    if (step > 0) {\n        for (let i = start; i < end; i += step) result.push(i);\n    } else {\n        for (let i = start; i > end; i += step) result.push(i);\n    }\n    return result;\n}\n"],"mappings":"AAaA,SAAgB,EAAkC,EAAY,EAAqC,CAC/F,IAAM,EAAS,CAAC,EAChB,IAAK,IAAM,KAAQ,EAAO,CACtB,IAAM,EAAI,EAAI,CAAI,GACjB,EAAO,KAAO,CAAC,EAAA,CAAG,KAAK,CAAI,CAChC,CACA,OAAO,CACX,CAiBA,SAAgB,EAAY,EAAY,EAAgC,CACpE,IAAM,EAAO,IAAI,IACX,EAAc,CAAC,EACrB,IAAK,IAAM,KAAQ,EAAO,CACtB,IAAM,EAAI,EAAI,CAAI,EACb,EAAK,IAAI,CAAC,IACX,EAAK,IAAI,CAAC,EACV,EAAO,KAAK,CAAI,EAExB,CACA,OAAO,CACX,CAiBA,SAAgB,EAAS,EAAY,EAAqB,CACtD,GAAI,EAAO,EACP,MAAU,WAAW,qCAAqC,GAAM,EAEpE,IAAM,EAAgB,CAAC,EACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EACnC,EAAO,KAAK,EAAM,MAAM,EAAG,EAAI,CAAI,CAAC,EAExC,OAAO,CACX,CAoBA,SAAgB,EAAM,EAAe,EAAa,EAAe,EAAa,CAC1E,IAAM,EAAmB,CAAC,EAC1B,GAAI,IAAS,EAAG,OAAO,EACvB,GAAI,EAAO,EACP,IAAK,IAAI,EAAI,EAAO,EAAI,EAAK,GAAK,EAAM,EAAO,KAAK,CAAC,OAErD,IAAK,IAAI,EAAI,EAAO,EAAI,EAAK,GAAK,EAAM,EAAO,KAAK,CAAC,EAEzD,OAAO,CACX"}

package/dist/utils/arrays.js

@@ -1,40 +1,34 @@
-function c(o, e) {
-  const r = {};
-  for (const n of o) {
-    const t = e(n);
-    (r[t] ??= []).push(n);
-  }
-  return r;
+//#region src/utils/arrays.ts
+function e(e, t) {
+	let n = {};
+	for (let r of e) {
+		let e = t(r);
+		(n[e] ??= []).push(r);
+	}
+	return n;
 }
-function s(o, e) {
-  const r = /* @__PURE__ */ new Set(), n = [];
-  for (const t of o) {
-    const u = e(t);
-    r.has(u) || (r.add(u), n.push(t));
-  }
-  return n;
+function t(e, t) {
+	let n = /* @__PURE__ */ new Set(), r = [];
+	for (let i of e) {
+		let e = t(i);
+		n.has(e) || (n.add(e), r.push(i));
+	}
+	return r;
 }
-function f(o, e) {
-  if (e < 1)
-    throw new RangeError(`chunk size must be >= 1, received ${e}`);
-  const r = [];
-  for (let n = 0; n < o.length; n += e)
-    r.push(o.slice(n, n + e));
-  return r;
+function n(e, t) {
+	if (t < 1) throw RangeError(`chunk size must be >= 1, received ${t}`);
+	let n = [];
+	for (let r = 0; r < e.length; r += t) n.push(e.slice(r, r + t));
+	return n;
 }
-function i(o, e, r = 1) {
-  const n = [];
-  if (r === 0) return n;
-  if (r > 0)
-    for (let t = o; t < e; t += r) n.push(t);
-  else
-    for (let t = o; t > e; t += r) n.push(t);
-  return n;
+function r(e, t, n = 1) {
+	let r = [];
+	if (n === 0) return r;
+	if (n > 0) for (let i = e; i < t; i += n) r.push(i);
+	else for (let i = e; i > t; i += n) r.push(i);
+	return r;
 }
-export {
-  f as chunk,
-  c as groupBy,
-  i as range,
-  s as uniqueBy
-};
-//# sourceMappingURL=arrays.js.map
+//#endregion
+export { n as chunk, e as groupBy, r as range, t as uniqueBy };
+
+//# sourceMappingURL=arrays.js.map

package/dist/utils/arrays.js.map

@@ -1 +1 @@
-{"version":3,"file":"arrays.js","sources":["../../src/utils/arrays.ts"],"sourcesContent":["/**\n * Group items of a list into buckets keyed by the result of `key`.\n *\n * Items preserve their original order within each bucket.\n *\n * @example\n * groupBy([1, 2, 3, 4], (n) => (n % 2 === 0 ? \"even\" : \"odd\"));\n * // { odd: [1, 3], even: [2, 4] }\n *\n * @example\n * groupBy([{ city: \"SP\" }, { city: \"RJ\" }, { city: \"SP\" }], (u) => u.city);\n * // { SP: [{ city: \"SP\" }, { city: \"SP\" }], RJ: [{ city: \"RJ\" }] }\n */\nexport function groupBy<T, K extends PropertyKey>(items: T[], key: (item: T) => K): Record<K, T[]> {\n    const result = {} as Record<K, T[]>;\n    for (const item of items) {\n        const k = key(item);\n        (result[k] ??= []).push(item);\n    }\n    return result;\n}\n\n/**\n * Remove duplicate items, keeping the first occurrence of each distinct key.\n *\n * Equality is determined by the value returned from `key` (compared with `===`).\n *\n * @example\n * uniqueBy([1, 2, 2, 3, 1], (n) => n); // [1, 2, 3]\n *\n * @example\n * uniqueBy(\n *   [{ id: 1, v: \"a\" }, { id: 1, v: \"b\" }, { id: 2, v: \"c\" }],\n *   (u) => u.id,\n * );\n * // [{ id: 1, v: \"a\" }, { id: 2, v: \"c\" }]\n */\nexport function uniqueBy<T>(items: T[], key: (item: T) => unknown): T[] {\n    const seen = new Set<unknown>();\n    const result: T[] = [];\n    for (const item of items) {\n        const k = key(item);\n        if (!seen.has(k)) {\n            seen.add(k);\n            result.push(item);\n        }\n    }\n    return result;\n}\n\n/**\n * Split a list into consecutive chunks of at most `size` items.\n *\n * The final chunk may be smaller than `size`. An empty input yields `[]`.\n *\n * @param items - The list to split.\n * @param size - Maximum chunk length; must be `>= 1`.\n * @throws {RangeError} When `size` is less than `1`.\n *\n * @example\n * chunk([1, 2, 3, 4, 5], 2); // [[1, 2], [3, 4], [5]]\n *\n * @example\n * chunk([], 3); // []\n */\nexport function chunk<T>(items: T[], size: number): T[][] {\n    if (size < 1) {\n        throw new RangeError(`chunk size must be >= 1, received ${size}`);\n    }\n    const result: T[][] = [];\n    for (let i = 0; i < items.length; i += size) {\n        result.push(items.slice(i, i + size));\n    }\n    return result;\n}\n\n/**\n * Build a numeric range from `start` (inclusive) to `end` (exclusive).\n *\n * - `step` defaults to `1` and may be negative for descending ranges.\n * - Returns an empty array when no progress can be made toward `end`\n *   (wrong-direction step, zero step, or `start === end`).\n *\n * @param start - First value of the range.\n * @param end - Exclusive upper (or lower, for negative step) bound.\n * @param step - Increment between values; defaults to `1`.\n *\n * @example\n * range(0, 5);        // [0, 1, 2, 3, 4]\n * range(0, 10, 2);    // [0, 2, 4, 6, 8]\n * range(5, 0, -1);    // [5, 4, 3, 2, 1]\n * range(0, 5, -1);    // [] (wrong direction)\n * range(3, 3);        // []\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n    const result: number[] = [];\n    if (step === 0) return result;\n    if (step > 0) {\n        for (let i = start; i < end; i += step) result.push(i);\n    } else {\n        for (let i = start; i > end; i += step) result.push(i);\n    }\n    return result;\n}\n"],"names":["groupBy","items","key","result","item","k","uniqueBy","seen","chunk","size","i","range","start","end","step"],"mappings":"AAaO,SAASA,EAAkCC,GAAYC,GAAqC;AAC/F,QAAMC,IAAS,CAAA;AACf,aAAWC,KAAQH,GAAO;AACtB,UAAMI,IAAIH,EAAIE,CAAI;AAClB,KAACD,EAAOE,CAAC,MAAM,CAAA,GAAI,KAAKD,CAAI;AAAA,EAChC;AACA,SAAOD;AACX;AAiBO,SAASG,EAAYL,GAAYC,GAAgC;AACpE,QAAMK,wBAAW,IAAA,GACXJ,IAAc,CAAA;AACpB,aAAWC,KAAQH,GAAO;AACtB,UAAMI,IAAIH,EAAIE,CAAI;AAClB,IAAKG,EAAK,IAAIF,CAAC,MACXE,EAAK,IAAIF,CAAC,GACVF,EAAO,KAAKC,CAAI;AAAA,EAExB;AACA,SAAOD;AACX;AAiBO,SAASK,EAASP,GAAYQ,GAAqB;AACtD,MAAIA,IAAO;AACP,UAAM,IAAI,WAAW,qCAAqCA,CAAI,EAAE;AAEpE,QAAMN,IAAgB,CAAA;AACtB,WAASO,IAAI,GAAGA,IAAIT,EAAM,QAAQS,KAAKD;AACnC,IAAAN,EAAO,KAAKF,EAAM,MAAMS,GAAGA,IAAID,CAAI,CAAC;AAExC,SAAON;AACX;AAoBO,SAASQ,EAAMC,GAAeC,GAAaC,IAAe,GAAa;AAC1E,QAAMX,IAAmB,CAAA;AACzB,MAAIW,MAAS,EAAG,QAAOX;AACvB,MAAIW,IAAO;AACP,aAASJ,IAAIE,GAAOF,IAAIG,GAAKH,KAAKI,EAAM,CAAAX,EAAO,KAAKO,CAAC;AAAA;AAErD,aAASA,IAAIE,GAAOF,IAAIG,GAAKH,KAAKI,EAAM,CAAAX,EAAO,KAAKO,CAAC;AAEzD,SAAOP;AACX;"}
+{"version":3,"file":"arrays.js","names":[],"sources":["../../src/utils/arrays.ts"],"sourcesContent":["/**\n * Group items of a list into buckets keyed by the result of `key`.\n *\n * Items preserve their original order within each bucket.\n *\n * @example\n * groupBy([1, 2, 3, 4], (n) => (n % 2 === 0 ? \"even\" : \"odd\"));\n * // { odd: [1, 3], even: [2, 4] }\n *\n * @example\n * groupBy([{ city: \"SP\" }, { city: \"RJ\" }, { city: \"SP\" }], (u) => u.city);\n * // { SP: [{ city: \"SP\" }, { city: \"SP\" }], RJ: [{ city: \"RJ\" }] }\n */\nexport function groupBy<T, K extends PropertyKey>(items: T[], key: (item: T) => K): Record<K, T[]> {\n    const result = {} as Record<K, T[]>;\n    for (const item of items) {\n        const k = key(item);\n        (result[k] ??= []).push(item);\n    }\n    return result;\n}\n\n/**\n * Remove duplicate items, keeping the first occurrence of each distinct key.\n *\n * Equality is determined by the value returned from `key` (compared with `===`).\n *\n * @example\n * uniqueBy([1, 2, 2, 3, 1], (n) => n); // [1, 2, 3]\n *\n * @example\n * uniqueBy(\n *   [{ id: 1, v: \"a\" }, { id: 1, v: \"b\" }, { id: 2, v: \"c\" }],\n *   (u) => u.id,\n * );\n * // [{ id: 1, v: \"a\" }, { id: 2, v: \"c\" }]\n */\nexport function uniqueBy<T>(items: T[], key: (item: T) => unknown): T[] {\n    const seen = new Set<unknown>();\n    const result: T[] = [];\n    for (const item of items) {\n        const k = key(item);\n        if (!seen.has(k)) {\n            seen.add(k);\n            result.push(item);\n        }\n    }\n    return result;\n}\n\n/**\n * Split a list into consecutive chunks of at most `size` items.\n *\n * The final chunk may be smaller than `size`. An empty input yields `[]`.\n *\n * @param items - The list to split.\n * @param size - Maximum chunk length; must be `>= 1`.\n * @throws {RangeError} When `size` is less than `1`.\n *\n * @example\n * chunk([1, 2, 3, 4, 5], 2); // [[1, 2], [3, 4], [5]]\n *\n * @example\n * chunk([], 3); // []\n */\nexport function chunk<T>(items: T[], size: number): T[][] {\n    if (size < 1) {\n        throw new RangeError(`chunk size must be >= 1, received ${size}`);\n    }\n    const result: T[][] = [];\n    for (let i = 0; i < items.length; i += size) {\n        result.push(items.slice(i, i + size));\n    }\n    return result;\n}\n\n/**\n * Build a numeric range from `start` (inclusive) to `end` (exclusive).\n *\n * - `step` defaults to `1` and may be negative for descending ranges.\n * - Returns an empty array when no progress can be made toward `end`\n *   (wrong-direction step, zero step, or `start === end`).\n *\n * @param start - First value of the range.\n * @param end - Exclusive upper (or lower, for negative step) bound.\n * @param step - Increment between values; defaults to `1`.\n *\n * @example\n * range(0, 5);        // [0, 1, 2, 3, 4]\n * range(0, 10, 2);    // [0, 2, 4, 6, 8]\n * range(5, 0, -1);    // [5, 4, 3, 2, 1]\n * range(0, 5, -1);    // [] (wrong direction)\n * range(3, 3);        // []\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n    const result: number[] = [];\n    if (step === 0) return result;\n    if (step > 0) {\n        for (let i = start; i < end; i += step) result.push(i);\n    } else {\n        for (let i = start; i > end; i += step) result.push(i);\n    }\n    return result;\n}\n"],"mappings":";AAaA,SAAgB,EAAkC,GAAY,GAAqC;CAC/F,IAAM,IAAS,CAAC;CAChB,KAAK,IAAM,KAAQ,GAAO;EACtB,IAAM,IAAI,EAAI,CAAI;EAClB,CAAC,EAAO,OAAO,CAAC,EAAA,CAAG,KAAK,CAAI;CAChC;CACA,OAAO;AACX;AAiBA,SAAgB,EAAY,GAAY,GAAgC;CACpE,IAAM,oBAAO,IAAI,IAAa,GACxB,IAAc,CAAC;CACrB,KAAK,IAAM,KAAQ,GAAO;EACtB,IAAM,IAAI,EAAI,CAAI;EAClB,AAAK,EAAK,IAAI,CAAC,MACX,EAAK,IAAI,CAAC,GACV,EAAO,KAAK,CAAI;CAExB;CACA,OAAO;AACX;AAiBA,SAAgB,EAAS,GAAY,GAAqB;CACtD,IAAI,IAAO,GACP,MAAU,WAAW,qCAAqC,GAAM;CAEpE,IAAM,IAAgB,CAAC;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,KAAK,GACnC,EAAO,KAAK,EAAM,MAAM,GAAG,IAAI,CAAI,CAAC;CAExC,OAAO;AACX;AAoBA,SAAgB,EAAM,GAAe,GAAa,IAAe,GAAa;CAC1E,IAAM,IAAmB,CAAC;CAC1B,IAAI,MAAS,GAAG,OAAO;CACvB,IAAI,IAAO,GACP,KAAK,IAAI,IAAI,GAAO,IAAI,GAAK,KAAK,GAAM,EAAO,KAAK,CAAC;MAErD,KAAK,IAAI,IAAI,GAAO,IAAI,GAAK,KAAK,GAAM,EAAO,KAAK,CAAC;CAEzD,OAAO;AACX"}

package/dist/utils/cn.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(...o){const t=[];for(const e of o)if(!(e==null||e===!1||e===!0)){if(typeof e=="string")e&&t.push(e);else if(typeof e=="number"||typeof e=="bigint")t.push(String(e));else if(Array.isArray(e)){const n=i(...e);n&&t.push(n)}}return t.join(" ")}exports.cn=i;
-//# sourceMappingURL=cn.cjs.map
+function e(...t){let n=[];for(let r of t)if(!(r==null||r===!1||r===!0)){if(typeof r==`string`)r&&n.push(r);else if(typeof r==`number`||typeof r==`bigint`)n.push(String(r));else if(Array.isArray(r)){let t=e(...r);t&&n.push(t)}}return n.join(` `)}exports.cn=e;
+//# sourceMappingURL=cn.cjs.map

package/dist/utils/cn.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cn.cjs","sources":["../../src/utils/cn.ts"],"sourcesContent":["type ClassValue = string | number | bigint | boolean | null | undefined | ClassValue[];\n\n/**\n * Tiny classnames helper. Accepts strings, falsy values and nested arrays.\n *\n * @param values - Class entries, conditionally truthy.\n * @returns A single space-joined class string.\n */\nexport function cn(...values: ClassValue[]): string {\n    const out: string[] = [];\n    for (const value of values) {\n        if (value === null || value === undefined || value === false || value === true) {\n            continue;\n        }\n        if (typeof value === \"string\") {\n            if (value) out.push(value);\n        } else if (typeof value === \"number\" || typeof value === \"bigint\") {\n            out.push(String(value));\n        } else if (Array.isArray(value)) {\n            const nested = cn(...value);\n            if (nested) out.push(nested);\n        }\n    }\n    return out.join(\" \");\n}\n"],"names":["cn","values","out","value","nested"],"mappings":"gFAQO,SAASA,KAAMC,EAA8B,CAChD,MAAMC,EAAgB,CAAA,EACtB,UAAWC,KAASF,EAChB,GAAI,EAAAE,GAAU,MAA+BA,IAAU,IAASA,IAAU,KAG1E,GAAI,OAAOA,GAAU,SACbA,GAAOD,EAAI,KAAKC,CAAK,UAClB,OAAOA,GAAU,UAAY,OAAOA,GAAU,SACrDD,EAAI,KAAK,OAAOC,CAAK,CAAC,UACf,MAAM,QAAQA,CAAK,EAAG,CAC7B,MAAMC,EAASJ,EAAG,GAAGG,CAAK,EACtBC,GAAQF,EAAI,KAAKE,CAAM,CAC/B,EAEJ,OAAOF,EAAI,KAAK,GAAG,CACvB"}
+{"version":3,"file":"cn.cjs","names":[],"sources":["../../src/utils/cn.ts"],"sourcesContent":["type ClassValue = string | number | bigint | boolean | null | undefined | ClassValue[];\n\n/**\n * Tiny classnames helper. Accepts strings, falsy values and nested arrays.\n *\n * @param values - Class entries, conditionally truthy.\n * @returns A single space-joined class string.\n */\nexport function cn(...values: ClassValue[]): string {\n    const out: string[] = [];\n    for (const value of values) {\n        if (value === null || value === undefined || value === false || value === true) {\n            continue;\n        }\n        if (typeof value === \"string\") {\n            if (value) out.push(value);\n        } else if (typeof value === \"number\" || typeof value === \"bigint\") {\n            out.push(String(value));\n        } else if (Array.isArray(value)) {\n            const nested = cn(...value);\n            if (nested) out.push(nested);\n        }\n    }\n    return out.join(\" \");\n}\n"],"mappings":"AAQA,SAAgB,EAAG,GAAG,EAA8B,CAChD,IAAM,EAAgB,CAAC,EACvB,IAAK,IAAM,KAAS,EACZ,QAAU,MAA+B,IAAU,IAAS,IAAU,IAG1E,IAAI,OAAO,GAAU,SACb,GAAO,EAAI,KAAK,CAAK,OACtB,GAAI,OAAO,GAAU,UAAY,OAAO,GAAU,SACrD,EAAI,KAAK,OAAO,CAAK,CAAC,OACnB,GAAI,MAAM,QAAQ,CAAK,EAAG,CAC7B,IAAM,EAAS,EAAG,GAAG,CAAK,EACtB,GAAQ,EAAI,KAAK,CAAM,CAC/B,EAEJ,OAAO,EAAI,KAAK,GAAG,CACvB"}

package/dist/utils/cn.js

@@ -1,19 +1,17 @@
-function o(...i) {
-  const n = [];
-  for (const e of i)
-    if (!(e == null || e === !1 || e === !0)) {
-      if (typeof e == "string")
-        e && n.push(e);
-      else if (typeof e == "number" || typeof e == "bigint")
-        n.push(String(e));
-      else if (Array.isArray(e)) {
-        const t = o(...e);
-        t && n.push(t);
-      }
-    }
-  return n.join(" ");
+//#region src/utils/cn.ts
+function e(...t) {
+	let n = [];
+	for (let r of t) if (!(r == null || r === !1 || r === !0)) {
+		if (typeof r == "string") r && n.push(r);
+		else if (typeof r == "number" || typeof r == "bigint") n.push(String(r));
+		else if (Array.isArray(r)) {
+			let t = e(...r);
+			t && n.push(t);
+		}
+	}
+	return n.join(" ");
 }
-export {
-  o as cn
-};
-//# sourceMappingURL=cn.js.map
+//#endregion
+export { e as cn };
+
+//# sourceMappingURL=cn.js.map

package/dist/utils/cn.js.map

@@ -1 +1 @@
-{"version":3,"file":"cn.js","sources":["../../src/utils/cn.ts"],"sourcesContent":["type ClassValue = string | number | bigint | boolean | null | undefined | ClassValue[];\n\n/**\n * Tiny classnames helper. Accepts strings, falsy values and nested arrays.\n *\n * @param values - Class entries, conditionally truthy.\n * @returns A single space-joined class string.\n */\nexport function cn(...values: ClassValue[]): string {\n    const out: string[] = [];\n    for (const value of values) {\n        if (value === null || value === undefined || value === false || value === true) {\n            continue;\n        }\n        if (typeof value === \"string\") {\n            if (value) out.push(value);\n        } else if (typeof value === \"number\" || typeof value === \"bigint\") {\n            out.push(String(value));\n        } else if (Array.isArray(value)) {\n            const nested = cn(...value);\n            if (nested) out.push(nested);\n        }\n    }\n    return out.join(\" \");\n}\n"],"names":["cn","values","out","value","nested"],"mappings":"AAQO,SAASA,KAAMC,GAA8B;AAChD,QAAMC,IAAgB,CAAA;AACtB,aAAWC,KAASF;AAChB,QAAI,EAAAE,KAAU,QAA+BA,MAAU,MAASA,MAAU;AAG1E,UAAI,OAAOA,KAAU;AACjB,QAAIA,KAAOD,EAAI,KAAKC,CAAK;AAAA,eAClB,OAAOA,KAAU,YAAY,OAAOA,KAAU;AACrD,QAAAD,EAAI,KAAK,OAAOC,CAAK,CAAC;AAAA,eACf,MAAM,QAAQA,CAAK,GAAG;AAC7B,cAAMC,IAASJ,EAAG,GAAGG,CAAK;AAC1B,QAAIC,KAAQF,EAAI,KAAKE,CAAM;AAAA,MAC/B;AAAA;AAEJ,SAAOF,EAAI,KAAK,GAAG;AACvB;"}
+{"version":3,"file":"cn.js","names":[],"sources":["../../src/utils/cn.ts"],"sourcesContent":["type ClassValue = string | number | bigint | boolean | null | undefined | ClassValue[];\n\n/**\n * Tiny classnames helper. Accepts strings, falsy values and nested arrays.\n *\n * @param values - Class entries, conditionally truthy.\n * @returns A single space-joined class string.\n */\nexport function cn(...values: ClassValue[]): string {\n    const out: string[] = [];\n    for (const value of values) {\n        if (value === null || value === undefined || value === false || value === true) {\n            continue;\n        }\n        if (typeof value === \"string\") {\n            if (value) out.push(value);\n        } else if (typeof value === \"number\" || typeof value === \"bigint\") {\n            out.push(String(value));\n        } else if (Array.isArray(value)) {\n            const nested = cn(...value);\n            if (nested) out.push(nested);\n        }\n    }\n    return out.join(\" \");\n}\n"],"mappings":";AAQA,SAAgB,EAAG,GAAG,GAA8B;CAChD,IAAM,IAAgB,CAAC;CACvB,KAAK,IAAM,KAAS,GACZ,WAAU,QAA+B,MAAU,MAAS,MAAU,KAG1E;MAAI,OAAO,KAAU,UACb,KAAO,EAAI,KAAK,CAAK;OACtB,IAAI,OAAO,KAAU,YAAY,OAAO,KAAU,UACrD,EAAI,KAAK,OAAO,CAAK,CAAC;OACnB,IAAI,MAAM,QAAQ,CAAK,GAAG;GAC7B,IAAM,IAAS,EAAG,GAAG,CAAK;GAC1B,AAAI,KAAQ,EAAI,KAAK,CAAM;EAC/B;;CAEJ,OAAO,EAAI,KAAK,GAAG;AACvB"}

package/dist/utils/format.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(t){return new Intl.NumberFormat("pt-BR",{style:"currency",currency:"BRL"}).format(t)}function n(t){const e=typeof t=="string"?new Date(t):t;return Number.isNaN(e.getTime())?"":new Intl.DateTimeFormat("pt-BR").format(e)}function a(t){const e=typeof t=="string"?new Date(t):t;return Number.isNaN(e.getTime())?"":new Intl.DateTimeFormat("pt-BR",{dateStyle:"short",timeStyle:"short"}).format(e)}function o(t){const e=t.replace(/\D/g,"").slice(0,11);return e.length<=10?e.replace(/(\d{2})(\d)/,"($1) $2").replace(/(\d{4})(\d)/,"$1-$2"):e.replace(/(\d{2})(\d)/,"($1) $2").replace(/(\d{5})(\d)/,"$1-$2")}function m(t){return t.replace(/\D/g,"").slice(0,11).replace(/(\d{3})(\d)/,"$1.$2").replace(/(\d{3})(\d)/,"$1.$2").replace(/(\d{3})(\d{1,2})$/,"$1-$2")}function i(t){return new Intl.NumberFormat("pt-BR",{style:"percent",minimumFractionDigits:1,maximumFractionDigits:1}).format(t)}exports.formatCPF=m;exports.formatCurrency=r;exports.formatDate=n;exports.formatDateTime=a;exports.formatPercent=i;exports.formatPhone=o;
-//# sourceMappingURL=format.cjs.map
+function e(e){return new Intl.NumberFormat(`pt-BR`,{style:`currency`,currency:`BRL`}).format(e)}function t(e){let t=typeof e==`string`?new Date(e):e;return Number.isNaN(t.getTime())?``:new Intl.DateTimeFormat(`pt-BR`).format(t)}function n(e){let t=typeof e==`string`?new Date(e):e;return Number.isNaN(t.getTime())?``:new Intl.DateTimeFormat(`pt-BR`,{dateStyle:`short`,timeStyle:`short`}).format(t)}function r(e){let t=e.replace(/\D/g,``).slice(0,11);return t.length<=10?t.replace(/(\d{2})(\d)/,`($1) $2`).replace(/(\d{4})(\d)/,`$1-$2`):t.replace(/(\d{2})(\d)/,`($1) $2`).replace(/(\d{5})(\d)/,`$1-$2`)}function i(e){return e.replace(/\D/g,``).slice(0,11).replace(/(\d{3})(\d)/,`$1.$2`).replace(/(\d{3})(\d)/,`$1.$2`).replace(/(\d{3})(\d{1,2})$/,`$1-$2`)}function a(e){return new Intl.NumberFormat(`pt-BR`,{style:`percent`,minimumFractionDigits:1,maximumFractionDigits:1}).format(e)}exports.formatCPF=i,exports.formatCurrency=e,exports.formatDate=t,exports.formatDateTime=n,exports.formatPercent=a,exports.formatPhone=r;
+//# sourceMappingURL=format.cjs.map