@yselimcan/ui 0.0.1 → 0.0.3

package/dist/index247.js

@@ -0,0 +1,209 @@
+import U from "./index100.js";
+import { floor as B } from "./index208.js";
+import { stopEvent as y } from "./index222.js";
+import { ARROW_UP as j, ARROW_DOWN as z, ARROW_LEFT as A, ARROW_RIGHT as G } from "./index246.js";
+function M(r, n, g) {
+  return Math.floor(r / n) !== g;
+}
+function L(r, n) {
+  return n < 0 || n >= r.current.length;
+}
+function J(r, n) {
+  return c(r, {
+    disabledIndices: n
+  });
+}
+function K(r, n) {
+  return c(r, {
+    decrement: !0,
+    startingIndex: r.current.length,
+    disabledIndices: n
+  });
+}
+function c(r, {
+  startingIndex: n = -1,
+  decrement: g = !1,
+  disabledIndices: u,
+  amount: w = 1
+} = {}) {
+  let t = n;
+  do
+    t += g ? -w : w;
+  while (t >= 0 && t <= r.current.length - 1 && V(r, t, u));
+  return t;
+}
+function Q(r, {
+  event: n,
+  orientation: g,
+  loopFocus: u,
+  rtl: w,
+  cols: t,
+  disabledIndices: o,
+  minIndex: O,
+  maxIndex: s,
+  prevIndex: e,
+  stopEvent: l = !1
+}) {
+  let f = e;
+  const m = [], _ = {};
+  let k = !1;
+  {
+    let a = null, h = -1;
+    r.current.forEach((E, i) => {
+      if (E == null)
+        return;
+      const C = E.closest('[role="row"]');
+      C && (k = !0), (C !== a || h === -1) && (a = C, h += 1, m[h] = []), m[h].push(i), _[i] = h;
+    });
+  }
+  const P = k && m.length > 0 && m.some((a) => a.length !== t);
+  function R(a) {
+    if (!P || e === -1)
+      return;
+    const h = _[e];
+    if (h == null)
+      return;
+    const E = m[h].indexOf(e);
+    let i = a === "up" ? h - 1 : h + 1;
+    u && (i < 0 ? i = m.length - 1 : i >= m.length && (i = 0));
+    const C = /* @__PURE__ */ new Set();
+    for (; i >= 0 && i < m.length && !C.has(i); ) {
+      C.add(i);
+      const D = m[i];
+      if (D.length === 0) {
+        i = a === "up" ? i - 1 : i + 1;
+        continue;
+      }
+      const T = Math.min(E, D.length - 1);
+      for (let N = T; N >= 0; N -= 1) {
+        const W = D[N];
+        if (!V(r, W, o))
+          return W;
+      }
+      i = a === "up" ? i - 1 : i + 1, u && (i < 0 ? i = m.length - 1 : i >= m.length && (i = 0));
+    }
+  }
+  if (n.key === j) {
+    const a = R("up");
+    if (a !== void 0)
+      l && y(n), f = a;
+    else {
+      if (l && y(n), e === -1)
+        f = s;
+      else if (f = c(r, {
+        startingIndex: f,
+        amount: t,
+        decrement: !0,
+        disabledIndices: o
+      }), u && (e - t < O || f < 0)) {
+        const h = e % t, E = s % t, i = s - (E - h);
+        E === h ? f = s : f = E > h ? i : i - t;
+      }
+      L(r, f) && (f = e);
+    }
+  }
+  if (n.key === z) {
+    const a = R("down");
+    a !== void 0 ? (l && y(n), f = a) : (l && y(n), e === -1 ? f = O : (f = c(r, {
+      startingIndex: e,
+      amount: t,
+      disabledIndices: o
+    }), u && e + t > s && (f = c(r, {
+      startingIndex: e % t - t,
+      amount: t,
+      disabledIndices: o
+    }))), L(r, f) && (f = e));
+  }
+  if (g === "both") {
+    const a = B(e / t);
+    n.key === (w ? A : G) && (l && y(n), e % t !== t - 1 ? (f = c(r, {
+      startingIndex: e,
+      disabledIndices: o
+    }), u && M(f, t, a) && (f = c(r, {
+      startingIndex: e - e % t - 1,
+      disabledIndices: o
+    }))) : u && (f = c(r, {
+      startingIndex: e - e % t - 1,
+      disabledIndices: o
+    })), M(f, t, a) && (f = e)), n.key === (w ? G : A) && (l && y(n), e % t !== 0 ? (f = c(r, {
+      startingIndex: e,
+      decrement: !0,
+      disabledIndices: o
+    }), u && M(f, t, a) && (f = c(r, {
+      startingIndex: e + (t - e % t),
+      decrement: !0,
+      disabledIndices: o
+    }))) : u && (f = c(r, {
+      startingIndex: e + (t - e % t),
+      decrement: !0,
+      disabledIndices: o
+    })), M(f, t, a) && (f = e));
+    const h = B(s / t) === a;
+    L(r, f) && (u && h ? f = n.key === (w ? G : A) ? s : c(r, {
+      startingIndex: e - e % t - 1,
+      disabledIndices: o
+    }) : f = e);
+  }
+  return f;
+}
+function X(r, n, g) {
+  const u = [];
+  let w = 0;
+  return r.forEach(({
+    width: t,
+    height: o
+  }, O) => {
+    if (t > n && process.env.NODE_ENV !== "production")
+      throw new Error(process.env.NODE_ENV !== "production" ? `[Floating UI]: Invalid grid - item width at index ${O} is greater than grid columns` : U(29, O));
+    let s = !1;
+    for (g && (w = 0); !s; ) {
+      const e = [];
+      for (let l = 0; l < t; l += 1)
+        for (let f = 0; f < o; f += 1)
+          e.push(w + l + f * n);
+      w % n + t <= n && e.every((l) => u[l] == null) ? (e.forEach((l) => {
+        u[l] = O;
+      }), s = !0) : w += 1;
+    }
+  }), [...u];
+}
+function Y(r, n, g, u, w) {
+  if (r === -1)
+    return -1;
+  const t = g.indexOf(r), o = n[r];
+  switch (w) {
+    case "tl":
+      return t;
+    case "tr":
+      return o ? t + o.width - 1 : t;
+    case "bl":
+      return o ? t + (o.height - 1) * u : t;
+    case "br":
+      return g.lastIndexOf(r);
+    default:
+      return -1;
+  }
+}
+function Z(r, n) {
+  return n.flatMap((g, u) => r.includes(g) ? [u] : []);
+}
+function V(r, n, g) {
+  if (typeof g == "function")
+    return g(n);
+  if (g)
+    return g.includes(n);
+  const u = r.current[n];
+  return u ? u.hasAttribute("disabled") || u.getAttribute("aria-disabled") === "true" : !1;
+}
+export {
+  X as createGridCellMap,
+  c as findNonDisabledListIndex,
+  Y as getGridCellIndexOfCorner,
+  Z as getGridCellIndices,
+  Q as getGridNavigatedIndex,
+  K as getMaxListIndex,
+  J as getMinListIndex,
+  M as isDifferentGridRow,
+  L as isIndexOutOfListBounds,
+  V as isListIndexDisabled
+};

package/dist/index248.js

@@ -0,0 +1,23 @@
+import { stringifyAsLabel as o } from "./index184.js";
+function f(r, e) {
+  return (t, i) => {
+    if (t == null)
+      return !1;
+    const n = o(t, e);
+    return r.contains(n, i);
+  };
+}
+function s(r, e, t) {
+  return (i, n) => {
+    if (i == null)
+      return !1;
+    if (!n)
+      return !0;
+    const u = o(i, e), l = t != null ? o(t, e) : "";
+    return l && r.contains(l, n) && l.length === n.length ? !0 : r.contains(u, n);
+  };
+}
+export {
+  f as createCollatorItemFilter,
+  s as createSingleSelectionCollatorFilter
+};

package/dist/index249.js

@@ -0,0 +1,8 @@
+const I = /* @__PURE__ */ Symbol("none"), n = {
+  value: I,
+  index: -1
+};
+export {
+  n as INITIAL_LAST_HIGHLIGHT,
+  I as NO_ACTIVE_VALUE
+};

package/dist/index25.js

@@ -0,0 +1,35 @@
+import { clsx as O } from "./index84.js";
+const m = (e) => typeof e == "boolean" ? `${e}` : e === 0 ? "0" : e, y = O, j = (e, l) => (n) => {
+  var s;
+  if (l?.variants == null) return y(e, n?.class, n?.className);
+  const { variants: r, defaultVariants: d } = l, V = Object.keys(r).map((t) => {
+    const a = n?.[t], u = d?.[t];
+    if (a === null) return null;
+    const i = m(a) || m(u);
+    return r[t][i];
+  }), v = n && Object.entries(n).reduce((t, a) => {
+    let [u, i] = a;
+    return i === void 0 || (t[u] = i), t;
+  }, {}), N = l == null || (s = l.compoundVariants) === null || s === void 0 ? void 0 : s.reduce((t, a) => {
+    let { class: u, className: i, ...f } = a;
+    return Object.entries(f).every((C) => {
+      let [c, o] = C;
+      return Array.isArray(o) ? o.includes({
+        ...d,
+        ...v
+      }[c]) : {
+        ...d,
+        ...v
+      }[c] === o;
+    }) ? [
+      ...t,
+      u,
+      i
+    ] : t;
+  }, []);
+  return y(e, V, N, n?.class, n?.className);
+};
+export {
+  j as cva,
+  y as cx
+};

package/dist/index250.js

@@ -0,0 +1,324 @@
+var F = (e, n, t) => {
+  if (n.length === 1 && n[0] === t) {
+    let r = !1;
+    try {
+      const u = {};
+      e(u) === u && (r = !0);
+    } catch {
+    }
+    if (r) {
+      let u;
+      try {
+        throw new Error();
+      } catch (s) {
+        ({ stack: u } = s);
+      }
+      console.warn(
+        `The result function returned its own inputs without modification. e.g
+\`createSelector([state => state.todos], todos => todos)\`
+This could lead to inefficient memoization and unnecessary re-renders.
+Ensure transformation logic is in the result function, and extraction logic is in the input selectors.`,
+        { stack: u }
+      );
+    }
+  }
+}, x = (e, n, t) => {
+  const { memoize: r, memoizeOptions: u } = n, { inputSelectorResults: s, inputSelectorResultsCopy: l } = e, o = r(() => ({}), ...u);
+  if (!(o.apply(null, s) === o.apply(null, l))) {
+    let c;
+    try {
+      throw new Error();
+    } catch (i) {
+      ({ stack: c } = i);
+    }
+    console.warn(
+      `An input selector returned a different result when passed same arguments.
+This means your output selector will likely run more frequently than intended.
+Avoid returning a new reference inside your input selector, e.g.
+\`createSelector([state => state.todos.map(todo => todo.id)], todoIds => todoIds.length)\``,
+      {
+        arguments: t,
+        firstInputs: s,
+        secondInputs: l,
+        stack: c
+      }
+    );
+  }
+}, A = {
+  inputStabilityCheck: "once",
+  identityFunctionCheck: "once"
+}, g = /* @__PURE__ */ Symbol("NOT_FOUND");
+function D(e, n = `expected a function, instead received ${typeof e}`) {
+  if (typeof e != "function")
+    throw new TypeError(n);
+}
+function q(e, n = `expected an object, instead received ${typeof e}`) {
+  if (typeof e != "object")
+    throw new TypeError(n);
+}
+function $(e, n = "expected all items to be functions, instead received the following types: ") {
+  if (!e.every((t) => typeof t == "function")) {
+    const t = e.map(
+      (r) => typeof r == "function" ? `function ${r.name || "unnamed"}()` : typeof r
+    ).join(", ");
+    throw new TypeError(`${n}[${t}]`);
+  }
+}
+var E = (e) => Array.isArray(e) ? e : [e];
+function W(e) {
+  const n = Array.isArray(e[0]) ? e[0] : e;
+  return $(
+    n,
+    "createSelector expects all input-selectors to be functions, but received the following types: "
+  ), n;
+}
+function I(e, n) {
+  const t = [], { length: r } = e;
+  for (let u = 0; u < r; u++)
+    t.push(e[u].apply(null, n));
+  return t;
+}
+var U = (e, n) => {
+  const { identityFunctionCheck: t, inputStabilityCheck: r } = {
+    ...A,
+    ...n
+  };
+  return {
+    identityFunctionCheck: {
+      shouldRun: t === "always" || t === "once" && e,
+      run: F
+    },
+    inputStabilityCheck: {
+      shouldRun: r === "always" || r === "once" && e,
+      run: x
+    }
+  };
+};
+function _(e) {
+  let n;
+  return {
+    get(t) {
+      return n && e(n.key, t) ? n.value : g;
+    },
+    put(t, r) {
+      n = { key: t, value: r };
+    },
+    getEntries() {
+      return n ? [n] : [];
+    },
+    clear() {
+      n = void 0;
+    }
+  };
+}
+function K(e, n) {
+  let t = [];
+  function r(o) {
+    const a = t.findIndex((c) => n(o, c.key));
+    if (a > -1) {
+      const c = t[a];
+      return a > 0 && (t.splice(a, 1), t.unshift(c)), c.value;
+    }
+    return g;
+  }
+  function u(o, a) {
+    r(o) === g && (t.unshift({ key: o, value: a }), t.length > e && t.pop());
+  }
+  function s() {
+    return t;
+  }
+  function l() {
+    t = [];
+  }
+  return { get: r, put: u, getEntries: s, clear: l };
+}
+var V = (e, n) => e === n;
+function L(e) {
+  return function(t, r) {
+    if (t === null || r === null || t.length !== r.length)
+      return !1;
+    const { length: u } = t;
+    for (let s = 0; s < u; s++)
+      if (!e(t[s], r[s]))
+        return !1;
+    return !0;
+  };
+}
+function X(e, n) {
+  const t = typeof n == "object" ? n : { equalityCheck: n }, {
+    equalityCheck: r = V,
+    maxSize: u = 1,
+    resultEqualityCheck: s
+  } = t, l = L(r);
+  let o = 0;
+  const a = u <= 1 ? _(l) : K(u, l);
+  function c() {
+    let i = a.get(arguments);
+    if (i === g) {
+      if (i = e.apply(null, arguments), o++, s) {
+        const y = a.getEntries().find(
+          (f) => s(f.value, i)
+        );
+        y && (i = y.value, o !== 0 && o--);
+      }
+      a.put(arguments, i);
+    }
+    return i;
+  }
+  return c.clearCache = () => {
+    a.clear(), c.resetResultsCount();
+  }, c.resultsCount = () => o, c.resetResultsCount = () => {
+    o = 0;
+  }, c;
+}
+var P = class {
+  constructor(e) {
+    this.value = e;
+  }
+  deref() {
+    return this.value;
+  }
+}, B = typeof WeakRef < "u" ? WeakRef : P, G = 0, z = 1;
+function m() {
+  return {
+    s: G,
+    v: void 0,
+    o: null,
+    p: null
+  };
+}
+function N(e, n = {}) {
+  let t = m();
+  const { resultEqualityCheck: r } = n;
+  let u, s = 0;
+  function l() {
+    let o = t;
+    const { length: a } = arguments;
+    for (let p = 0, y = a; p < y; p++) {
+      const f = arguments[p];
+      if (typeof f == "function" || typeof f == "object" && f !== null) {
+        let d = o.o;
+        d === null && (o.o = d = /* @__PURE__ */ new WeakMap());
+        const h = d.get(f);
+        h === void 0 ? (o = m(), d.set(f, o)) : o = h;
+      } else {
+        let d = o.p;
+        d === null && (o.p = d = /* @__PURE__ */ new Map());
+        const h = d.get(f);
+        h === void 0 ? (o = m(), d.set(f, o)) : o = h;
+      }
+    }
+    const c = o;
+    let i;
+    if (o.s === z)
+      i = o.v;
+    else if (i = e.apply(null, arguments), s++, r) {
+      const p = u?.deref?.() ?? u;
+      p != null && r(p, i) && (i = p, s !== 0 && s--), u = typeof i == "object" && i !== null || typeof i == "function" ? new B(i) : i;
+    }
+    return c.s = z, c.v = i, i;
+  }
+  return l.clearCache = () => {
+    t = m(), l.resetResultsCount();
+  }, l.resultsCount = () => s, l.resetResultsCount = () => {
+    s = 0;
+  }, l;
+}
+function H(e, ...n) {
+  const t = typeof e == "function" ? {
+    memoize: e,
+    memoizeOptions: n
+  } : e, r = (...u) => {
+    let s = 0, l = 0, o, a = {}, c = u.pop();
+    typeof c == "object" && (a = c, c = u.pop()), D(
+      c,
+      `createSelector expects an output function after the inputs, but received: [${typeof c}]`
+    );
+    const i = {
+      ...t,
+      ...a
+    }, {
+      memoize: p,
+      memoizeOptions: y = [],
+      argsMemoize: f = N,
+      argsMemoizeOptions: d = [],
+      devModeChecks: h = {}
+    } = i, w = E(y), T = E(d), v = W(u), k = p(function() {
+      return s++, c.apply(
+        null,
+        arguments
+      );
+    }, ...w);
+    let C = !0;
+    const M = f(function() {
+      l++;
+      const R = I(
+        v,
+        arguments
+      );
+      if (o = k.apply(null, R), process.env.NODE_ENV !== "production") {
+        const { identityFunctionCheck: S, inputStabilityCheck: b } = U(C, h);
+        if (S.shouldRun && S.run(
+          c,
+          R,
+          o
+        ), b.shouldRun) {
+          const j = I(
+            v,
+            arguments
+          );
+          b.run(
+            { inputSelectorResults: R, inputSelectorResultsCopy: j },
+            { memoize: p, memoizeOptions: w },
+            arguments
+          );
+        }
+        C && (C = !1);
+      }
+      return o;
+    }, ...T);
+    return Object.assign(M, {
+      resultFunc: c,
+      memoizedResultFunc: k,
+      dependencies: v,
+      dependencyRecomputations: () => l,
+      resetDependencyRecomputations: () => {
+        l = 0;
+      },
+      lastResult: () => o,
+      recomputations: () => s,
+      resetRecomputations: () => {
+        s = 0;
+      },
+      memoize: p,
+      argsMemoize: f
+    });
+  };
+  return Object.assign(r, {
+    withTypes: () => r
+  }), r;
+}
+var J = /* @__PURE__ */ H(N), Q = Object.assign(
+  (e, n = J) => {
+    q(
+      e,
+      `createStructuredSelector expects first argument to be an object where each property is a selector, instead received a ${typeof e}`
+    );
+    const t = Object.keys(e), r = t.map(
+      (s) => e[s]
+    );
+    return n(
+      r,
+      (...s) => s.reduce((l, o, a) => (l[t[a]] = o, l), {})
+    );
+  },
+  { withTypes: () => Q }
+);
+export {
+  J as createSelector,
+  H as createSelectorCreator,
+  Q as createStructuredSelector,
+  X as lruMemoize,
+  V as referenceEqualityCheck,
+  N as weakMapMemoize
+};

package/dist/index251.js

@@ -0,0 +1,5 @@
+import { __require as r } from "./index254.js";
+var i = r();
+export {
+  i as s
+};

package/dist/index252.js

@@ -0,0 +1,5 @@
+import { __require as r } from "./index258.js";
+var t = r();
+export {
+  t as w
+};