@tempots/std 0.19.0 → 0.21.0

package/array.js

@@ -1,160 +1,140 @@
-import { objectKeys as v } from "./object.js";
-const q = (t, n) => Array.from({ length: t.length }, (e, r) => n(t[r], r)), B = (t, n) => {
-  const e = [];
-  for (const r of t)
-    e.push(...n(r));
-  return e;
-}, _ = (t) => t.length > 0 ? t[0] : void 0, k = (t) => t.slice(1), F = (t, n, e) => {
-  if (t.length !== n.length) return !1;
-  for (let r = 0; r < t.length; r++)
-    if (!e(t[r], n[r])) return !1;
+import { objectKeys as d } from "./object.js";
+const E = (t) => t.length > 0 ? t[0] : void 0, B = (t) => t.slice(1), O = (t, r, e) => {
+  if (t.length !== r.length) return !1;
+  for (let n = 0; n < t.length; n++)
+    if (!e(t[n], r[n])) return !1;
   return !0;
-}, I = (t) => t.length === 0, M = (t) => t.length > 0, x = (t, n) => {
-  const e = [];
-  for (const r of t) n(r) && e.push(r);
-  return e;
-}, b = (t, n) => {
+}, _ = (t) => t.length === 0, q = (t) => t.length > 0, b = (t, r) => {
   const e = [];
-  for (let r = 0; r < t.length; r++) {
-    const l = n(t[r], r);
-    l != null && e.push(l);
+  for (let n = 0; n < t.length; n++) {
+    const o = r(t[n], n);
+    o != null && e.push(o);
   }
   return e;
-}, j = (t) => x(t, (n) => n != null), D = (t) => [].concat(...t), P = (t, n, e) => {
-  for (const r of t)
-    e = n(e, r);
-  return e;
-}, S = (t, n) => {
-  for (const e of t)
-    if (!n(e))
-      return !1;
-  return !0;
-}, N = (t, n) => {
-  for (const e of t)
-    if (n(e))
-      return !0;
-  return !1;
-}, T = (t, n) => {
-  for (const e of t) n(e);
-}, $ = (...t) => [].concat(...t), H = (t, n, e, r = !0) => {
-  if (t.length < n.length)
-    return -1 * (r ? 1 : -1);
-  if (t.length > n.length)
-    return 1 * (r ? 1 : -1);
-  for (let l = 0; l < t.length; l++) {
-    const a = e(t[l], n[l]);
-    if (a !== 0) return a;
+}, j = (t) => t.filter((r) => r != null), D = (t, r, e, n = !0) => {
+  if (t.length < r.length)
+    return -1 * (n ? 1 : -1);
+  if (t.length > r.length)
+    return 1 * (n ? 1 : -1);
+  for (let o = 0; o < t.length; o++) {
+    const i = e(t[o], r[o]);
+    if (i !== 0) return i;
   }
   return 0;
-}, C = (t, n) => t.slice().sort(n), g = (t, n) => Array.from({ length: t }, (e, r) => n(r)), L = (t, n = 0) => g(t, (e) => n + e), R = (t, n) => g(t, () => n), V = (t) => Array.from(new Set(t)), W = (t, n) => {
+}, v = (t, r) => Array.from({ length: t }, (e, n) => r(n)), F = (t, r = 0) => Array.from({ length: t }, (e, n) => r + n), M = (t, r) => v(t, () => r), I = (t, r) => {
   const e = {};
-  return t.forEach((r) => {
-    e[n(r)] = r;
-  }), v(e).map((r) => e[r]);
-}, E = (t, n) => {
-  const e = t.indexOf(n);
+  return t.forEach((n) => {
+    e[r(n)] = n;
+  }), d(e).map((n) => e[n]);
+}, w = (t, r) => {
+  const e = t.indexOf(r);
   return e < 0 ? !1 : (t.splice(e, 1), !0);
-}, z = (t, n) => {
+}, N = (t, r) => {
   let e = !1;
-  for (; E(t, n); )
+  for (; w(t, r); )
     e = !0;
   return e;
-}, w = (t, n) => {
-  const e = t.findIndex(n);
+}, x = (t, r) => {
+  const e = t.findIndex(r);
   return e < 0 ? !1 : (t.splice(e, 1), !0);
-}, G = (t, n) => {
+}, P = (t, r) => {
   let e = !1;
-  for (; w(t, n); )
+  for (; x(t, r); )
     e = !0;
   return e;
-}, J = (t) => {
-  const n = [];
-  for (let e = t.next(); !(e.done ?? !1); e = t.next())
-    n.push(e.value);
-  return n;
-}, Q = (t, n, e) => {
-  const r = {
+}, T = (t, r, e) => {
+  const n = {
     removals: [],
     swaps: [],
     inserts: []
-  }, { removals: l, inserts: a, swaps: u } = r, c = /* @__PURE__ */ new Map();
-  n.forEach((s, o) => c.set(e(s), o));
-  const f = t.map((s, o) => [s, o]).filter(([s]) => !c.has(e(s))).map(([s, o]) => o);
-  for (let s = f.length - 1; s >= 0; s--) {
-    const o = f[s], i = l.length > 0 ? l[l.length - 1] : void 0;
-    i != null && i.at === o + 1 ? (i.at--, i.qt++) : l.push({ at: o, qt: 1 });
+  }, { removals: o, inserts: i, swaps: u } = n, c = /* @__PURE__ */ new Map();
+  r.forEach((s, l) => c.set(e(s), l));
+  const a = t.map((s, l) => [s, l]).filter(([s]) => !c.has(e(s))).map(([s, l]) => l);
+  for (let s = a.length - 1; s >= 0; s--) {
+    const l = a[s], f = o.length > 0 ? o[o.length - 1] : void 0;
+    f != null && f.at === l + 1 ? (f.at--, f.qt++) : o.push({ at: l, qt: 1 });
   }
   const h = /* @__PURE__ */ new Map();
-  t.forEach((s, o) => h.set(e(s), o));
-  const y = n.map((s, o) => [s, o]).filter(([s]) => !h.has(e(s))).map(([s, o]) => o);
-  for (const s of y) {
-    const o = a.length > 0 ? a[a.length - 1] : void 0;
-    o != null && o.at + o.values.length === s ? o.values.push(n[s]) : a.push({ at: s, values: [n[s]] });
+  t.forEach((s, l) => h.set(e(s), l));
+  const g = r.map((s, l) => [s, l]).filter(([s]) => !h.has(e(s))).map(([s, l]) => l);
+  for (const s of g) {
+    const l = i.length > 0 ? i[i.length - 1] : void 0;
+    l != null && l.at + l.values.length === s ? l.values.push(r[s]) : i.push({ at: s, values: [r[s]] });
   }
-  const p = t.filter((s, o) => !f.includes(o)), m = /* @__PURE__ */ new Map();
+  const p = t.filter((s, l) => !a.includes(l)), m = /* @__PURE__ */ new Map();
   for (let s = 0; s < p.length; s++)
     m.set(e(p[s]), s);
-  const A = n.filter((s, o) => !y.includes(o));
-  for (let s = 0; s < A.length; s++) {
-    const o = e(A[s]), i = m.get(o);
-    if (i == null || s === i) continue;
-    const d = e(p[s]);
-    m.delete(d), u.push({ from: s, to: i });
+  const y = r.filter((s, l) => !g.includes(l));
+  for (let s = 0; s < y.length; s++) {
+    const l = e(y[s]), f = m.get(l);
+    if (f == null || s === f) continue;
+    const A = e(p[s]);
+    m.delete(A), u.push({ from: s, to: f });
   }
-  return r;
-}, U = (t, n) => {
-  const e = [...n];
-  for (const { at: r, qt: l } of t.removals)
-    e.splice(r, l);
-  for (const { from: r, to: l } of t.swaps) {
-    const a = e[l];
-    e[l] = e[r], e[r] = a;
+  return n;
+}, $ = (t, r) => {
+  const e = [...r];
+  for (const { at: n, qt: o } of t.removals)
+    e.splice(n, o);
+  for (const { from: n, to: o } of t.swaps) {
+    const i = e[o];
+    e[o] = e[n], e[n] = i;
+  }
+  for (const n of t.inserts)
+    e.splice(n.at, 0, ...n.values);
+  return e;
+}, C = (t, r = " and ", e = ", ") => t.length === 0 ? "" : t.length === 1 ? String(t[0]) : `${t.slice(0, -1).join(e)}${r}${String(t[t.length - 1])}`, H = (t, r, e = !0) => {
+  const n = t.map((c, a) => [c, a]);
+  n.sort((c, a) => r(c[0], a[0]));
+  const o = new Array(n.length);
+  let i = 0, u = n[0][0];
+  for (let c = 0; c < n.length; c++) {
+    const [a, h] = n[c];
+    r(a, u) !== 0 && (i = c, u = a), o[h] = i, e && i++;
   }
-  for (const r of t.inserts)
-    e.splice(r.at, 0, ...r.values);
+  return o;
+}, S = (t, r) => {
+  if (r <= 0)
+    throw new Error("Chunk size must be positive");
+  const e = [];
+  for (let n = 0; n < t.length; n += r)
+    e.push(t.slice(n, n + r));
   return e;
-}, X = (t, n = " and ", e = ", ") => t.length === 0 ? "" : t.length === 1 ? String(t[0]) : `${t.slice(0, -1).join(e)}${n}${String(t[t.length - 1])}`, Y = (t, n, e = !0) => {
-  const r = t.map((c, f) => [c, f]);
-  r.sort((c, f) => n(c[0], f[0]));
-  const l = new Array(r.length);
-  let a = 0, u = r[0][0];
-  for (let c = 0; c < r.length; c++) {
-    const [f, h] = r[c];
-    n(f, u) !== 0 && (a = c, u = f), l[h] = a, e && a++;
+}, R = (t, r) => {
+  const e = [], n = [];
+  for (const o of t)
+    r(o) ? e.push(o) : n.push(o);
+  return [e, n];
+}, V = (t, r) => {
+  const e = {};
+  for (const n of t) {
+    const o = r(n);
+    e[o] ? e[o].push(n) : e[o] = [n];
   }
-  return l;
+  return e;
 };
 export {
-  S as allElements,
-  N as anyElement,
-  U as applyArrayDiffOperations,
-  F as areArraysEqual,
-  Q as arrayDiffOperations,
-  M as arrayHasValues,
-  _ as arrayHead,
-  J as arrayOfIterableIterator,
-  k as arrayTail,
-  H as compareArrays,
-  $ as concatArrays,
-  R as createFilledArray,
-  x as filterArray,
+  $ as applyArrayDiffOperations,
+  O as areArraysEqual,
+  T as arrayDiffOperations,
+  q as arrayHasValues,
+  E as arrayHead,
+  B as arrayTail,
+  v as buildArray,
+  S as chunk,
+  D as compareArrays,
+  M as fillArray,
   b as filterMapArray,
   j as filterNullsFromArray,
-  B as flatMapArray,
-  D as flattenArray,
-  P as foldLeftArray,
-  T as forEachElement,
-  g as generateArray,
-  L as generateSequenceArray,
-  I as isArrayEmpty,
-  X as joinArrayWithConjunction,
-  q as mapArray,
-  Y as rankArray,
-  z as removeAllFromArray,
-  G as removeAllFromArrayByPredicate,
-  E as removeOneFromArray,
-  w as removeOneFromArrayByPredicate,
-  C as sortArray,
-  W as uniqueByPrimitive,
-  V as uniquePrimitives
+  V as groupBy,
+  _ as isArrayEmpty,
+  C as joinArrayWithConjunction,
+  R as partition,
+  F as range,
+  H as rankArray,
+  N as removeAllFromArray,
+  P as removeAllFromArrayByPredicate,
+  w as removeOneFromArray,
+  x as removeOneFromArrayByPredicate,
+  I as uniqueByPrimitive
 };

package/date.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=(t,e)=>{const s=new Date(t);return s.setDate(s.getDate()+e),s},g=(t,e)=>{const s=new Date(t);return s.setHours(s.getHours()+e),s},a=(t,e)=>{const s=new Date(t);return s.setMinutes(s.getMinutes()+e),s},i=(t,e)=>{const n=Date.UTC(t.getFullYear(),t.getMonth(),t.getDate()),r=Date.UTC(e.getFullYear(),e.getMonth(),e.getDate());return Math.floor((r-n)/864e5)},c=(t,e)=>(e.getTime()-t.getTime())/36e5,D=t=>{const e=new Date(t);return e.setHours(0,0,0,0),e},l=t=>{const e=new Date(t);return e.setHours(23,59,59,999),e},o=t=>{const e=new Date(t),s=e.getDay(),n=e.getDate()-s+(s===0?-6:1);return e.setDate(n),e.setHours(0,0,0,0),e},m=t=>{const e=new Date(t),s=e.getDay(),n=e.getDate()-s+(s===0?0:7);return e.setDate(n),e.setHours(23,59,59,999),e},M=t=>t instanceof Date&&!isNaN(t.getTime()),f=(t,e)=>t.getFullYear()===e.getFullYear(),y=(t,e)=>t.getFullYear()===e.getFullYear()&&t.getMonth()===e.getMonth(),H=(t,e)=>o(t).getTime()===o(e).getTime(),S=(t,e)=>t.getFullYear()===e.getFullYear()&&t.getMonth()===e.getMonth()&&t.getDate()===e.getDate(),Y=(t,e)=>t.getFullYear()===e.getFullYear()&&t.getMonth()===e.getMonth()&&t.getDate()===e.getDate()&&t.getHours()===e.getHours(),h=(t,e)=>t.getFullYear()===e.getFullYear()&&t.getMonth()===e.getMonth()&&t.getDate()===e.getDate()&&t.getHours()===e.getHours()&&t.getMinutes()===e.getMinutes(),F=(t,e)=>t.getFullYear()===e.getFullYear()&&t.getMonth()===e.getMonth()&&t.getDate()===e.getDate()&&t.getHours()===e.getHours()&&t.getMinutes()===e.getMinutes()&&t.getSeconds()===e.getSeconds(),T=t=>{const e=t.getDay();return e===0||e===6},O=(t,e)=>t.getTime()-e.getTime();exports.addDays=u;exports.addHours=g;exports.addMinutes=a;exports.compareDates=O;exports.diffInDays=i;exports.diffInHours=c;exports.endOfDay=l;exports.endOfWeek=m;exports.isSameDay=S;exports.isSameHour=Y;exports.isSameMinute=h;exports.isSameMonth=y;exports.isSameSecond=F;exports.isSameWeek=H;exports.isSameYear=f;exports.isValidDate=M;exports.isWeekend=T;exports.startOfDay=D;exports.startOfWeek=o;

package/date.d.ts

@@ -0,0 +1,393 @@
+/**
+ * Utilities for working with Date objects.
+ *
+ * This module provides comprehensive date manipulation, comparison, and
+ * formatting utilities. All functions return new Date objects and do not
+ * mutate the input dates, following functional programming principles.
+ *
+ * @public
+ */
+/**
+ * Adds the specified number of days to a date.
+ *
+ * This function creates a new Date object with the specified number of days
+ * added. Negative values subtract days.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-15')
+ * const future = addDays(date, 7)
+ * // Result: 2023-01-22
+ *
+ * const past = addDays(date, -3)
+ * // Result: 2023-01-12
+ * ```
+ *
+ * @param date - The base date
+ * @param days - Number of days to add (can be negative)
+ * @returns A new Date object with days added
+ * @public
+ */
+export declare const addDays: (date: Date, days: number) => Date;
+/**
+ * Adds the specified number of hours to a date.
+ *
+ * This function creates a new Date object with the specified number of hours
+ * added. Negative values subtract hours.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-15T10:00:00')
+ * const future = addHours(date, 5)
+ * // Result: 2023-01-15T15:00:00
+ *
+ * const past = addHours(date, -2)
+ * // Result: 2023-01-15T08:00:00
+ * ```
+ *
+ * @param date - The base date
+ * @param hours - Number of hours to add (can be negative)
+ * @returns A new Date object with hours added
+ * @public
+ */
+export declare const addHours: (date: Date, hours: number) => Date;
+/**
+ * Adds the specified number of minutes to a date.
+ *
+ * This function creates a new Date object with the specified number of minutes
+ * added. Negative values subtract minutes.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-15T10:30:00')
+ * const future = addMinutes(date, 45)
+ * // Result: 2023-01-15T11:15:00
+ *
+ * const past = addMinutes(date, -15)
+ * // Result: 2023-01-15T10:15:00
+ * ```
+ *
+ * @param date - The base date
+ * @param minutes - Number of minutes to add (can be negative)
+ * @returns A new Date object with minutes added
+ * @public
+ */
+export declare const addMinutes: (date: Date, minutes: number) => Date;
+/**
+ * Calculates the difference in days between two dates.
+ *
+ * Returns a positive number if dateB is after dateA, negative if before.
+ * The calculation ignores time components and focuses on calendar days.
+ *
+ * @example
+ * ```typescript
+ * const dateA = new Date('2023-01-15')
+ * const dateB = new Date('2023-01-20')
+ * const diff = diffInDays(dateA, dateB)
+ * // Result: 5
+ *
+ * const diffReverse = diffInDays(dateB, dateA)
+ * // Result: -5
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns The difference in days (dateB - dateA)
+ * @public
+ */
+export declare const diffInDays: (dateA: Date, dateB: Date) => number;
+/**
+ * Calculates the difference in hours between two dates.
+ *
+ * Returns a positive number if dateB is after dateA, negative if before.
+ * The result includes fractional hours for precise calculations.
+ *
+ * @example
+ * ```typescript
+ * const dateA = new Date('2023-01-15T10:00:00')
+ * const dateB = new Date('2023-01-15T15:30:00')
+ * const diff = diffInHours(dateA, dateB)
+ * // Result: 5.5
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns The difference in hours (dateB - dateA)
+ * @public
+ */
+export declare const diffInHours: (dateA: Date, dateB: Date) => number;
+/**
+ * Returns a new Date representing the start of the day (00:00:00.000).
+ *
+ * This is useful for date comparisons and range queries where you need
+ * to normalize dates to the beginning of the day.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-15T14:30:45.123')
+ * const start = startOfDay(date)
+ * // Result: 2023-01-15T00:00:00.000
+ * ```
+ *
+ * @param date - The input date
+ * @returns A new Date set to the start of the day
+ * @public
+ */
+export declare const startOfDay: (date: Date) => Date;
+/**
+ * Returns a new Date representing the end of the day (23:59:59.999).
+ *
+ * This is useful for date range queries where you need the last
+ * millisecond of a given day.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-15T14:30:45.123')
+ * const end = endOfDay(date)
+ * // Result: 2023-01-15T23:59:59.999
+ * ```
+ *
+ * @param date - The input date
+ * @returns A new Date set to the end of the day
+ * @public
+ */
+export declare const endOfDay: (date: Date) => Date;
+/**
+ * Returns a new Date representing the start of the week (Monday 00:00:00.000).
+ *
+ * This follows the ISO 8601 standard where Monday is the first day of the week.
+ * Useful for weekly reports and date grouping.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-18') // Wednesday
+ * const start = startOfWeek(date)
+ * // Result: 2023-01-16T00:00:00.000 (Monday)
+ * ```
+ *
+ * @param date - The input date
+ * @returns A new Date set to the start of the week
+ * @public
+ */
+export declare const startOfWeek: (date: Date) => Date;
+/**
+ * Returns a new Date representing the end of the week (Sunday 23:59:59.999).
+ *
+ * This follows the ISO 8601 standard where Sunday is the last day of the week.
+ * Useful for weekly reports and date grouping.
+ *
+ * @example
+ * ```typescript
+ * const date = new Date('2023-01-18') // Wednesday
+ * const end = endOfWeek(date)
+ * // Result: 2023-01-22T23:59:59.999 (Sunday)
+ * ```
+ *
+ * @param date - The input date
+ * @returns A new Date set to the end of the week
+ * @public
+ */
+export declare const endOfWeek: (date: Date) => Date;
+/**
+ * Checks if a value is a valid Date object.
+ *
+ * This function checks both that the value is a Date instance and that
+ * it represents a valid date (not NaN).
+ *
+ * @example
+ * ```typescript
+ * isValidDate(new Date()) // true
+ * isValidDate(new Date('2023-01-15')) // true
+ * isValidDate(new Date('invalid')) // false
+ * isValidDate('2023-01-15') // false
+ * isValidDate(null) // false
+ * ```
+ *
+ * @param date - The value to check
+ * @returns true if the value is a valid Date, false otherwise
+ * @public
+ */
+export declare const isValidDate: (date: unknown) => date is Date;
+/**
+ * Checks if two dates represent the same calendar year.
+ *
+ * This comparison ignores the month and day components and only compares the year part.
+ * Useful for yearly reports and date grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15') // January
+ * const date2 = new Date('2023-02-15') // February
+ * const date3 = new Date('2024-01-15') // January of next year
+ *
+ * isSameYear(date1, date2) // true
+ * isSameYear(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same calendar year
+ * @public
+ */
+export declare const isSameYear: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same calendar month.
+ *
+ * This comparison ignores the day and time components and only compares the month and year parts.
+ * Useful for monthly reports and date grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15') // January
+ * const date2 = new Date('2023-02-15') // February
+ * const date3 = new Date('2024-01-15') // January of next year
+ *
+ * isSameMonth(date1, date2) // false
+ * isSameMonth(date1, date3) // true
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same calendar month
+ * @public
+ */
+export declare const isSameMonth: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same calendar week.
+ *
+ * This comparison uses the ISO 8601 week definition, where weeks start on Monday.
+ * Useful for weekly reports and date grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15') // Monday
+ * const date2 = new Date('2023-01-16') // Tuesday
+ * const date3 = new Date('2023-01-22') // Monday of next week
+ *
+ * isSameWeek(date1, date2) // true
+ * isSameWeek(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same calendar week
+ * @public
+ */
+export declare const isSameWeek: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same calendar day.
+ *
+ * This comparison ignores time components and only compares the date parts.
+ * Useful for date-based filtering and grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15T10:30:00')
+ * const date2 = new Date('2023-01-15T18:45:00')
+ * const date3 = new Date('2023-01-16T10:30:00')
+ *
+ * isSameDay(date1, date2) // true
+ * isSameDay(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same calendar day
+ * @public
+ */
+export declare const isSameDay: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same hour.
+ *
+ * This comparison ignores date and minute components and only compares the hour parts.
+ * Useful for time-based filtering and grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15T10:30:00')
+ * const date2 = new Date('2023-01-15T10:45:00')
+ * const date3 = new Date('2023-01-16T10:30:00')
+ *
+ * isSameHour(date1, date2) // true
+ * isSameHour(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same hour
+ * @public
+ */
+export declare const isSameHour: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same minute.
+ *
+ * This comparison ignores date, hour, and second components and only compares the minute parts.
+ * Useful for time-based filtering and grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15T10:30:00')
+ * const date2 = new Date('2023-01-15T10:30:45')
+ * const date3 = new Date('2023-01-16T10:30:00')
+ *
+ * isSameMinute(date1, date2) // true
+ * isSameMinute(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same minute
+ * @public
+ */
+export declare const isSameMinute: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if two dates represent the same second.
+ *
+ * This comparison ignores date, hour, and minute components and only compares the second parts.
+ * Useful for time-based filtering and grouping.
+ *
+ * @example
+ * ```typescript
+ * const date1 = new Date('2023-01-15T10:30:00')
+ * const date2 = new Date('2023-01-15T10:30:00')
+ * const date3 = new Date('2023-01-16T10:30:00')
+ *
+ * isSameSecond(date1, date2) // true
+ * isSameSecond(date1, date3) // false
+ * ```
+ *
+ * @param dateA - The first date
+ * @param dateB - The second date
+ * @returns true if both dates represent the same second
+ * @public
+ */
+export declare const isSameSecond: (dateA: Date, dateB: Date) => boolean;
+/**
+ * Checks if a date falls on a weekend (Saturday or Sunday).
+ *
+ * This is useful for business logic that needs to handle weekends differently,
+ * such as scheduling or date calculations.
+ *
+ * @example
+ * ```typescript
+ * const saturday = new Date('2023-01-14') // Saturday
+ * const monday = new Date('2023-01-16') // Monday
+ *
+ * isWeekend(saturday) // true
+ * isWeekend(monday) // false
+ * ```
+ *
+ * @param date - The date to check
+ * @returns true if the date is a Saturday or Sunday
+ * @public
+ */
+export declare const isWeekend: (date: Date) => boolean;
+/**
+ * Compares two dates.
+ *
+ * @param a - The first date
+ * @param b - The second date
+ * @returns A negative number if `a` is less than `b`, zero if they are equal, or a positive number if `a` is greater than `b`.
+ * @public
+ */
+export declare const compareDates: (a: Date, b: Date) => number;