chesai-ui 0.16.13 → 0.16.14

package/dist/components/full-calendar/utils.mjs

@@ -1,202 +1,250 @@
-import { startOfWeek as b, startOfMonth as W, endOfWeek as T, endOfMonth as H, addDays as w, startOfDay as d, isBefore as I, isAfter as x, differenceInDays as S, isSameDay as m, startOfYear as R, setMonth as Y, format as q } from "date-fns";
-import { RRule as p } from "rrule";
+import { startOfWeek as S, startOfMonth as O, endOfWeek as W, endOfMonth as T, addDays as x, startOfDay as h, isBefore as H, isAfter as I, differenceInDays as k, isSameDay as b, startOfYear as C, setMonth as R, format as Y } from "date-fns";
+import { RRule as w } from "rrule";
 const L = (t) => {
   switch (t) {
     case "primary":
-      return "bg-surface-container-low";
+      return "bg-surface-container-low text-on-surface";
     case "secondary":
-      return "bg-surface-container-high";
+      return "bg-surface-container-highest text-on-surface";
+    case "tertiary":
+      return "bg-tertiary-container text-on-tertiary-container";
+    case "high-contrast":
+      return "bg-inverse-surface text-inverse-on-surface";
     case "ghost":
-      return "bg-transparent";
+      return "bg-transparent text-on-surface";
+    case "surface-container-lowest":
+      return "bg-surface-container-lowest text-on-surface";
+    case "surface-container-low":
+      return "bg-surface-container-low text-on-surface";
+    case "surface-container":
+      return "bg-surface-container text-on-surface";
+    case "surface-container-high":
+      return "bg-surface-container-high text-on-surface";
+    case "surface-container-highest":
+      return "bg-surface-container-highest text-on-surface";
     default:
-      return "bg-surface";
+      return "bg-surface text-on-surface";
   }
 }, U = (t) => {
   switch (t) {
     case "primary":
-      return "bg-surface-container-low";
+      return "bg-surface-container-low text-on-surface";
     case "secondary":
-      return "bg-surface-container-high";
+      return "bg-surface-container-highest text-on-surface";
+    case "tertiary":
+      return "bg-tertiary-container text-on-tertiary-container";
+    case "high-contrast":
+      return "bg-inverse-surface text-inverse-on-surface";
     case "ghost":
-      return "bg-surface/80 backdrop-blur-md";
+      return "bg-surface/80 backdrop-blur-md text-on-surface";
+    case "surface-container-lowest":
+      return "bg-surface-container-lowest text-on-surface";
+    case "surface-container-low":
+      return "bg-surface-container-low text-on-surface";
+    case "surface-container":
+      return "bg-surface-container text-on-surface";
+    case "surface-container-high":
+      return "bg-surface-container-high text-on-surface";
+    case "surface-container-highest":
+      return "bg-surface-container-highest text-on-surface";
     default:
-      return "bg-surface";
+      return "bg-surface text-on-surface";
   }
-}, F = {
-  daily: p.DAILY,
-  weekly: p.WEEKLY,
-  monthly: p.MONTHLY,
-  yearly: p.YEARLY
-}, k = [
-  p.SU,
+}, _ = (t) => {
+  switch (t) {
+    case "ghost":
+      return "bg-transparent";
+    case "surface-container-lowest":
+      return "bg-surface-container-lowest";
+    case "surface-container-low":
+      return "bg-surface-container-low";
+    case "surface-container":
+      return "bg-surface-container-low/30";
+    case "surface-container-high":
+      return "bg-surface-container-low/50";
+    case "surface-container-highest":
+      return "bg-surface-container-low/70";
+    case "high-contrast":
+      return "bg-inverse-surface/5";
+    default:
+      return "bg-surface-container-low/30";
+  }
+}, q = {
+  daily: w.DAILY,
+  weekly: w.WEEKLY,
+  monthly: w.MONTHLY,
+  yearly: w.YEARLY
+}, M = [
+  w.SU,
   // 0
-  p.MO,
+  w.MO,
   // 1
-  p.TU,
+  w.TU,
   // 2
-  p.WE,
+  w.WE,
   // 3
-  p.TH,
+  w.TH,
   // 4
-  p.FR,
+  w.FR,
   // 5
-  p.SA
+  w.SA
   // 6
-], _ = (t, l, i) => {
-  const r = [];
-  return t.forEach((o) => {
-    if (!o.recurrence) {
-      o.start <= i && o.end >= l && r.push(o);
+], K = (t, l, u) => {
+  const s = [];
+  return t.forEach((c) => {
+    if (!c.recurrence) {
+      c.start <= u && c.end >= l && s.push(c);
       return;
     }
     try {
-      const s = o.recurrence, e = {
-        freq: F[s.frequency],
-        dtstart: o.start,
-        interval: s.interval || 1
+      const e = c.recurrence, r = {
+        freq: q[e.frequency],
+        dtstart: c.start,
+        interval: e.interval || 1
       };
-      if (s.endType === "on_date" && s.until ? e.until = s.until : s.endType === "after_occurrences" && s.count && (e.count = s.count), s.frequency === "weekly" && s.daysOfWeek && s.daysOfWeek.length > 0 && (e.byweekday = s.daysOfWeek.map((a) => k[a])), s.frequency === "monthly") {
-        if (s.monthDay)
-          e.bymonthday = s.monthDay;
-        else if (s.nthDayOfWeek) {
-          const { dayOfWeek: a, nth: h } = s.nthDayOfWeek;
-          e.byweekday = k[a].nth(h);
+      if (e.endType === "on_date" && e.until ? r.until = e.until : e.endType === "after_occurrences" && e.count && (r.count = e.count), e.frequency === "weekly" && e.daysOfWeek && e.daysOfWeek.length > 0 && (r.byweekday = e.daysOfWeek.map((a) => M[a])), e.frequency === "monthly") {
+        if (e.monthDay)
+          r.bymonthday = e.monthDay;
+        else if (e.nthDayOfWeek) {
+          const { dayOfWeek: a, nth: g } = e.nthDayOfWeek;
+          r.byweekday = M[a].nth(g);
         }
       }
-      if (s.frequency === "yearly") {
-        if (s.month && (e.bymonth = s.month), s.monthDay)
-          e.bymonthday = s.monthDay;
-        else if (s.nthDayOfWeek) {
-          const { dayOfWeek: a, nth: h } = s.nthDayOfWeek;
-          e.byweekday = k[a].nth(h);
+      if (e.frequency === "yearly") {
+        if (e.month && (r.bymonth = e.month), e.monthDay)
+          r.bymonthday = e.monthDay;
+        else if (e.nthDayOfWeek) {
+          const { dayOfWeek: a, nth: g } = e.nthDayOfWeek;
+          r.byweekday = M[a].nth(g);
         }
       }
-      const c = new p(e).between(l, i, !0), u = o.end.getTime() - o.start.getTime();
-      c.forEach((a, h) => {
-        r.push({
-          ...o,
-          id: `${o.id}-occ-${h}`,
+      const o = new w(r).between(l, u, !0), i = c.end.getTime() - c.start.getTime();
+      o.forEach((a, g) => {
+        s.push({
+          ...c,
+          id: `${c.id}-occ-${g}`,
           start: a,
-          end: new Date(a.getTime() + u)
+          end: new Date(a.getTime() + i)
         });
       });
-    } catch (s) {
-      console.error("Failed to parse recurrence rule with rrule.js:", s), o.start <= i && o.end >= l && r.push(o);
+    } catch (e) {
+      console.error("Failed to parse recurrence rule with rrule.js:", e), c.start <= u && c.end >= l && s.push(c);
     }
-  }), r;
-}, K = (t) => {
-  const l = b(W(t));
-  T(H(t));
-  const i = [];
-  let r = l;
-  for (; i.length < 42; )
-    i.push(r), r = w(r, 1);
-  return i;
+  }), s;
+}, P = (t) => {
+  const l = S(O(t));
+  W(T(t));
+  const u = [];
+  let s = l;
+  for (; u.length < 42; )
+    u.push(s), s = x(s, 1);
+  return u;
 }, V = (t) => {
-  const l = b(t), i = [];
-  let r = l;
-  for (let o = 0; o < 7; o++)
-    i.push(r), r = w(r, 1);
-  return i;
+  const l = S(t), u = [];
+  let s = l;
+  for (let c = 0; c < 7; c++)
+    u.push(s), s = x(s, 1);
+  return u;
 }, $ = (t) => {
-  const l = R(t), i = [];
-  for (let r = 0; r < 12; r++)
-    i.push(Y(l, r));
-  return i;
+  const l = C(t), u = [];
+  for (let s = 0; s < 12; s++)
+    u.push(R(l, s));
+  return u;
 }, j = (t) => {
   const l = /* @__PURE__ */ new Set();
-  return t.forEach((i) => {
-    let r = d(i.start);
-    const o = d(i.end);
-    for (; r <= o; )
-      l.add(q(r, "yyyy-MM-dd")), r = w(r, 1);
+  return t.forEach((u) => {
+    let s = h(u.start);
+    const c = h(u.end);
+    for (; s <= c; )
+      l.add(Y(s, "yyyy-MM-dd")), s = x(s, 1);
   }), l;
 }, A = (t, l) => {
   if (t.length === 0) return [];
-  const i = d(t[0]), r = d(t[t.length - 1]), o = l.filter((e) => {
-    const n = d(e.start), c = d(e.end);
-    return I(n, w(r, 1)) && x(w(c, 1), i);
+  const u = h(t[0]), s = h(t[t.length - 1]), c = l.filter((r) => {
+    const n = h(r.start), o = h(r.end);
+    return H(n, x(s, 1)) && I(x(o, 1), u);
   });
-  o.sort((e, n) => {
-    const c = S(d(e.end), d(e.start)), u = S(d(n.end), d(n.start));
-    return c !== u ? u - c : e.start.getTime() - n.start.getTime();
+  c.sort((r, n) => {
+    const o = k(h(r.end), h(r.start)), i = k(h(n.end), h(n.start));
+    return o !== i ? i - o : r.start.getTime() - n.start.getTime();
   });
-  const s = [], g = {};
-  for (let e = 0; e < t.length; e++) g[e] = /* @__PURE__ */ new Set();
-  return o.forEach((e) => {
-    const n = d(e.start), c = d(e.end);
-    let u = t.findIndex((f) => m(f, n));
-    u === -1 && (u = 0);
-    let a = t.findIndex((f) => m(f, c));
+  const e = [], y = {};
+  for (let r = 0; r < t.length; r++) y[r] = /* @__PURE__ */ new Set();
+  return c.forEach((r) => {
+    const n = h(r.start), o = h(r.end);
+    let i = t.findIndex((f) => b(f, n));
+    i === -1 && (i = 0);
+    let a = t.findIndex((f) => b(f, o));
     a === -1 && (a = t.length - 1);
-    const h = a - u + 1;
-    let y = 1, E = !1;
-    for (; !E; ) {
-      E = !0;
-      for (let f = u; f <= a; f++)
-        if (g[f].has(y)) {
-          E = !1, y++;
+    const g = a - i + 1;
+    let d = 1, p = !1;
+    for (; !p; ) {
+      p = !0;
+      for (let f = i; f <= a; f++)
+        if (y[f].has(d)) {
+          p = !1, d++;
           break;
         }
     }
-    for (let f = u; f <= a; f++)
-      g[f].add(y);
-    s.push({
-      event: e,
-      colStart: u + 1,
-      colSpan: h,
-      row: y
+    for (let f = i; f <= a; f++)
+      y[f].add(d);
+    e.push({
+      event: r,
+      colStart: i + 1,
+      colSpan: g,
+      row: d
     });
-  }), s;
+  }), e;
 }, N = (t, l) => {
-  const i = d(t), r = l.filter((n) => {
+  const u = h(t), s = l.filter((n) => {
     if (n.isAllDay) return !1;
-    const c = d(n.start), u = d(n.end);
-    return i >= c && i <= u;
+    const o = h(n.start), i = h(n.end);
+    return u >= o && u <= i;
   });
-  r.sort((n, c) => {
-    const u = m(n.start, t) ? n.start.getHours() * 60 + n.start.getMinutes() : 0, a = m(c.start, t) ? c.start.getHours() * 60 + c.start.getMinutes() : 0;
-    return u - a;
+  s.sort((n, o) => {
+    const i = b(n.start, t) ? n.start.getHours() * 60 + n.start.getMinutes() : 0, a = b(o.start, t) ? o.start.getHours() * 60 + o.start.getMinutes() : 0;
+    return i - a;
   });
-  const o = [], s = [];
-  let g = [], e = 0;
-  return r.forEach((n) => {
-    const c = m(n.start, t), u = m(n.end, t), a = c ? n.start.getHours() * 60 + n.start.getMinutes() : 0, h = u ? n.end.getHours() * 60 + n.end.getMinutes() : 1440;
-    g.length === 0 ? (g.push(n), e = h) : a < e ? (g.push(n), e = Math.max(e, h)) : (s.push([...g]), g = [n], e = h);
-  }), g.length > 0 && s.push(g), s.forEach((n) => {
-    const c = [];
+  const c = [], e = [];
+  let y = [], r = 0;
+  return s.forEach((n) => {
+    const o = b(n.start, t), i = b(n.end, t), a = o ? n.start.getHours() * 60 + n.start.getMinutes() : 0, g = i ? n.end.getHours() * 60 + n.end.getMinutes() : 1440;
+    y.length === 0 ? (y.push(n), r = g) : a < r ? (y.push(n), r = Math.max(r, g)) : (e.push([...y]), y = [n], r = g);
+  }), y.length > 0 && e.push(y), e.forEach((n) => {
+    const o = [];
     n.forEach((a) => {
-      const y = m(a.start, t) ? a.start.getHours() * 60 + a.start.getMinutes() : 0;
-      let E = !1;
-      for (let f = 0; f < c.length; f++) {
-        const M = c[f][c[f].length - 1], D = m(M.end, t) ? M.end.getHours() * 60 + M.end.getMinutes() : 1440;
-        if (y >= D) {
-          c[f].push(a), E = !0;
+      const d = b(a.start, t) ? a.start.getHours() * 60 + a.start.getMinutes() : 0;
+      let p = !1;
+      for (let f = 0; f < o.length; f++) {
+        const m = o[f][o[f].length - 1], E = b(m.end, t) ? m.end.getHours() * 60 + m.end.getMinutes() : 1440;
+        if (d >= E) {
+          o[f].push(a), p = !0;
           break;
         }
       }
-      E || c.push([a]);
+      p || o.push([a]);
     });
-    const u = c.length;
-    c.forEach((a, h) => {
-      a.forEach((y) => {
-        const E = m(y.start, t), f = m(y.end, t), M = E ? y.start.getHours() * 60 + y.start.getMinutes() : 0, O = f ? y.end.getHours() * 60 + y.end.getMinutes() : 1440, D = Math.max(O - M, 15);
-        o.push({
-          event: y,
-          top: M / 1440 * 100,
-          height: D / 1440 * 100,
-          left: h / u * 100,
-          width: 100 / u
+    const i = o.length;
+    o.forEach((a, g) => {
+      a.forEach((d) => {
+        const p = b(d.start, t), f = b(d.end, t), m = p ? d.start.getHours() * 60 + d.start.getMinutes() : 0, D = f ? d.end.getHours() * 60 + d.end.getMinutes() : 1440, E = Math.max(D - m, 15);
+        c.push({
+          event: d,
+          top: m / 1440 * 100,
+          height: E / 1440 * 100,
+          left: g / i * 100,
+          width: 100 / i
         });
       });
     });
-  }), o;
+  }), c;
 };
 export {
-  _ as expandEvents,
+  K as expandEvents,
   L as getCalendarBgClasses,
+  _ as getCalendarSidePanelBgClasses,
   U as getCalendarStickyBgClasses,
-  K as getDaysForMonthView,
+  P as getDaysForMonthView,
   V as getDaysForWeekView,
   j as getEventDaysMap,
   A as getEventSegments,

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "chesai-ui",
   "private": false,
-  "version": "0.16.13",
+  "version": "0.16.14",
   "repository": {
     "type": "git",
     "url": "https://github.com/ayhamdev/chesai-ui"