@helpwave/hightide 0.0.13 → 0.0.16

package/dist/util/array.d.mts

@@ -0,0 +1,25 @@
+declare const equalSizeGroups: <T>(array: T[], groupSize: number) => T[][];
+/**
+ * @param start
+ * @param end inclusive
+ * @param allowEmptyRange Whether the range can be defined empty via end < start
+ */
+declare const range: (start: number, end: number, allowEmptyRange?: boolean) => number[];
+/** Finds the closest match
+ * @param list The list of all possible matches
+ * @param firstCloser Return whether item1 is closer than item2
+ */
+declare const closestMatch: <T>(list: T[], firstCloser: (item1: T, item2: T) => boolean) => T;
+/**
+ * returns the item in middle of a list and its neighbours before and after
+ * e.g. [1,2,3,4,5,6] for item = 1 would return [5,6,1,2,3]
+ */
+declare const getNeighbours: <T>(list: T[], item: T, neighbourDistance?: number) => T[];
+declare const createLoopingListWithIndex: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => [number, T][];
+declare const createLoopingList: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => T[];
+declare const ArrayUtil: {
+    unique: <T>(list: T[]) => T[];
+    difference: <T>(list: T[], removeList: T[]) => T[];
+};
+
+export { ArrayUtil, closestMatch, createLoopingList, createLoopingListWithIndex, equalSizeGroups, getNeighbours, range };

package/dist/util/array.d.ts

@@ -1,23 +1,25 @@
-export declare const equalSizeGroups: <T>(array: T[], groupSize: number) => T[][];
+declare const equalSizeGroups: <T>(array: T[], groupSize: number) => T[][];
 /**
  * @param start
  * @param end inclusive
  * @param allowEmptyRange Whether the range can be defined empty via end < start
  */
-export declare const range: (start: number, end: number, allowEmptyRange?: boolean) => number[];
+declare const range: (start: number, end: number, allowEmptyRange?: boolean) => number[];
 /** Finds the closest match
  * @param list The list of all possible matches
  * @param firstCloser Return whether item1 is closer than item2
  */
-export declare const closestMatch: <T>(list: T[], firstCloser: (item1: T, item2: T) => boolean) => T;
+declare const closestMatch: <T>(list: T[], firstCloser: (item1: T, item2: T) => boolean) => T;
 /**
  * returns the item in middle of a list and its neighbours before and after
  * e.g. [1,2,3,4,5,6] for item = 1 would return [5,6,1,2,3]
  */
-export declare const getNeighbours: <T>(list: T[], item: T, neighbourDistance?: number) => T[];
-export declare const createLoopingListWithIndex: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => [number, T][];
-export declare const createLoopingList: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => T[];
-export declare const ArrayUtil: {
+declare const getNeighbours: <T>(list: T[], item: T, neighbourDistance?: number) => T[];
+declare const createLoopingListWithIndex: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => [number, T][];
+declare const createLoopingList: <T>(list: T[], startIndex?: number, length?: number, forwards?: boolean) => T[];
+declare const ArrayUtil: {
     unique: <T>(list: T[]) => T[];
     difference: <T>(list: T[], removeList: T[]) => T[];
 };
+
+export { ArrayUtil, closestMatch, createLoopingList, createLoopingListWithIndex, equalSizeGroups, getNeighbours, range };

package/dist/util/array.js

@@ -1,103 +1,130 @@
-export const equalSizeGroups = (array, groupSize) => {
-    if (groupSize <= 0) {
-        console.warn(`group size should be greater than 0: groupSize = ${groupSize}`);
-        return [[...array]];
-    }
-    const groups = [];
-    for (let i = 0; i < array.length; i += groupSize) {
-        groups.push(array.slice(i, Math.min(i + groupSize, array.length)));
-    }
-    return groups;
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
 };
-/**
- * @param start
- * @param end inclusive
- * @param allowEmptyRange Whether the range can be defined empty via end < start
- */
-export const range = (start, end, allowEmptyRange = false) => {
-    if (end < start) {
-        if (!allowEmptyRange) {
-            console.warn(`range: end (${end}) < start (${start}) should be allowed explicitly, set allowEmptyRange to true`);
-        }
-        return [];
-    }
-    return Array.from({ length: end - start + 1 }, (_, index) => index + start);
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
 };
-/** Finds the closest match
- * @param list The list of all possible matches
- * @param firstCloser Return whether item1 is closer than item2
- */
-export const closestMatch = (list, firstCloser) => {
-    return list.reduce((item1, item2) => {
-        return firstCloser(item1, item2) ? item1 : item2;
-    });
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/util/array.ts
+var array_exports = {};
+__export(array_exports, {
+  ArrayUtil: () => ArrayUtil,
+  closestMatch: () => closestMatch,
+  createLoopingList: () => createLoopingList,
+  createLoopingListWithIndex: () => createLoopingListWithIndex,
+  equalSizeGroups: () => equalSizeGroups,
+  getNeighbours: () => getNeighbours,
+  range: () => range
+});
+module.exports = __toCommonJS(array_exports);
+var equalSizeGroups = (array, groupSize) => {
+  if (groupSize <= 0) {
+    console.warn(`group size should be greater than 0: groupSize = ${groupSize}`);
+    return [[...array]];
+  }
+  const groups = [];
+  for (let i = 0; i < array.length; i += groupSize) {
+    groups.push(array.slice(i, Math.min(i + groupSize, array.length)));
+  }
+  return groups;
 };
-/**
- * returns the item in middle of a list and its neighbours before and after
- * e.g. [1,2,3,4,5,6] for item = 1 would return [5,6,1,2,3]
- */
-export const getNeighbours = (list, item, neighbourDistance = 2) => {
-    const index = list.indexOf(item);
-    const totalItems = neighbourDistance * 2 + 1;
-    if (list.length < totalItems) {
-        console.warn('List is to short');
-        return list;
-    }
-    if (index === -1) {
-        console.error('item not found in list');
-        return list.splice(0, totalItems);
-    }
-    let start = index - neighbourDistance;
-    if (start < 0) {
-        start += list.length;
+var range = (start, end, allowEmptyRange = false) => {
+  if (end < start) {
+    if (!allowEmptyRange) {
+      console.warn(`range: end (${end}) < start (${start}) should be allowed explicitly, set allowEmptyRange to true`);
     }
-    const end = (index + neighbourDistance + 1) % list.length;
-    const result = [];
-    let ignoreOnce = list.length === totalItems;
-    for (let i = start; i !== end || ignoreOnce; i = (i + 1) % list.length) {
-        result.push(list[i]);
-        if (end === i && ignoreOnce) {
-            ignoreOnce = false;
-        }
-    }
-    return result;
+    return [];
+  }
+  return Array.from({ length: end - start + 1 }, (_, index) => index + start);
 };
-export const createLoopingListWithIndex = (list, startIndex = 0, length = 0, forwards = true) => {
-    if (length < 0) {
-        console.warn(`createLoopingList: length must be >= 0, given ${length}`);
-    }
-    else if (length === 0) {
-        length = list.length;
+var closestMatch = (list, firstCloser) => {
+  return list.reduce((item1, item2) => {
+    return firstCloser(item1, item2) ? item1 : item2;
+  });
+};
+var getNeighbours = (list, item, neighbourDistance = 2) => {
+  const index = list.indexOf(item);
+  const totalItems = neighbourDistance * 2 + 1;
+  if (list.length < totalItems) {
+    console.warn("List is to short");
+    return list;
+  }
+  if (index === -1) {
+    console.error("item not found in list");
+    return list.splice(0, totalItems);
+  }
+  let start = index - neighbourDistance;
+  if (start < 0) {
+    start += list.length;
+  }
+  const end = (index + neighbourDistance + 1) % list.length;
+  const result = [];
+  let ignoreOnce = list.length === totalItems;
+  for (let i = start; i !== end || ignoreOnce; i = (i + 1) % list.length) {
+    result.push(list[i]);
+    if (end === i && ignoreOnce) {
+      ignoreOnce = false;
     }
-    const returnList = [];
-    if (forwards) {
-        for (let i = startIndex; returnList.length < length; i = (i + 1) % list.length) {
-            returnList.push([i, list[i]]);
-        }
+  }
+  return result;
+};
+var createLoopingListWithIndex = (list, startIndex = 0, length = 0, forwards = true) => {
+  if (length < 0) {
+    console.warn(`createLoopingList: length must be >= 0, given ${length}`);
+  } else if (length === 0) {
+    length = list.length;
+  }
+  const returnList = [];
+  if (forwards) {
+    for (let i = startIndex; returnList.length < length; i = (i + 1) % list.length) {
+      returnList.push([i, list[i]]);
     }
-    else {
-        for (let i = startIndex; returnList.length < length; i = i === 0 ? i = list.length - 1 : i - 1) {
-            returnList.push([i, list[i]]);
-        }
+  } else {
+    for (let i = startIndex; returnList.length < length; i = i === 0 ? i = list.length - 1 : i - 1) {
+      returnList.push([i, list[i]]);
     }
-    return returnList;
+  }
+  return returnList;
 };
-export const createLoopingList = (list, startIndex = 0, length = 0, forwards = true) => {
-    return createLoopingListWithIndex(list, startIndex, length, forwards).map(([_, item]) => item);
+var createLoopingList = (list, startIndex = 0, length = 0, forwards = true) => {
+  return createLoopingListWithIndex(list, startIndex, length, forwards).map(([_, item]) => item);
 };
-export const ArrayUtil = {
-    unique: (list) => {
-        const seen = new Set();
-        return list.filter((item) => {
-            if (seen.has(item)) {
-                return false;
-            }
-            seen.add(item);
-            return true;
-        });
-    },
-    difference: (list, removeList) => {
-        const remove = new Set(removeList);
-        return list.filter((item) => !remove.has(item));
-    }
+var ArrayUtil = {
+  unique: (list) => {
+    const seen = /* @__PURE__ */ new Set();
+    return list.filter((item) => {
+      if (seen.has(item)) {
+        return false;
+      }
+      seen.add(item);
+      return true;
+    });
+  },
+  difference: (list, removeList) => {
+    const remove = new Set(removeList);
+    return list.filter((item) => !remove.has(item));
+  }
 };
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ArrayUtil,
+  closestMatch,
+  createLoopingList,
+  createLoopingListWithIndex,
+  equalSizeGroups,
+  getNeighbours,
+  range
+});
+//# sourceMappingURL=array.js.map

package/dist/util/array.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/util/array.ts"],"sourcesContent":["export const equalSizeGroups = <T >(array: T[], groupSize: number): T[][] => {\n  if (groupSize <= 0) {\n    console.warn(`group size should be greater than 0: groupSize = ${groupSize}`)\n    return [[...array]]\n  }\n\n  const groups = []\n  for (let i = 0; i < array.length; i += groupSize) {\n    groups.push(array.slice(i, Math.min(i + groupSize, array.length)))\n  }\n  return groups\n}\n\n/**\n * @param start\n * @param end inclusive\n * @param allowEmptyRange Whether the range can be defined empty via end < start\n */\nexport const range = (start: number, end: number, allowEmptyRange: boolean = false): number[] => {\n  if (end < start) {\n    if (!allowEmptyRange) {\n      console.warn(`range: end (${end}) < start (${start}) should be allowed explicitly, set allowEmptyRange to true`)\n    }\n    return []\n  }\n  return Array.from({ length: end - start + 1 }, (_, index) => index + start)\n}\n\n/** Finds the closest match\n * @param list The list of all possible matches\n * @param firstCloser Return whether item1 is closer than item2\n */\nexport const closestMatch = <T >(list: T[], firstCloser: (item1: T, item2: T) => boolean) => {\n  return list.reduce((item1, item2) => {\n    return firstCloser(item1, item2) ? item1 : item2\n  })\n}\n\n/**\n * returns the item in middle of a list and its neighbours before and after\n * e.g. [1,2,3,4,5,6] for item = 1 would return [5,6,1,2,3]\n */\nexport const getNeighbours = <T >(list: T[], item: T, neighbourDistance: number = 2) => {\n  const index = list.indexOf(item)\n  const totalItems = neighbourDistance * 2 + 1\n  if (list.length < totalItems) {\n    console.warn('List is to short')\n    return list\n  }\n\n  if (index === -1) {\n    console.error('item not found in list')\n    return list.splice(0, totalItems)\n  }\n\n  let start = index - neighbourDistance\n  if (start < 0) {\n    start += list.length\n  }\n  const end = (index + neighbourDistance + 1) % list.length\n\n  const result: T[] = []\n  let ignoreOnce = list.length === totalItems\n  for (let i = start; i !== end || ignoreOnce; i = (i + 1) % list.length) {\n    result.push(list[i]!)\n    if (end === i && ignoreOnce) {\n      ignoreOnce = false\n    }\n  }\n  return result\n}\n\nexport const createLoopingListWithIndex = <T >(list: T[], startIndex: number = 0, length: number = 0, forwards: boolean = true) => {\n  if (length < 0) {\n    console.warn(`createLoopingList: length must be >= 0, given ${length}`)\n  } else if (length === 0) {\n    length = list.length\n  }\n\n  const returnList: [number, T][] = []\n\n  if (forwards) {\n    for (let i = startIndex; returnList.length < length; i = (i + 1) % list.length) {\n      returnList.push([i, list[i]!])\n    }\n  } else {\n    for (let i = startIndex; returnList.length < length; i = i === 0 ? i = list.length - 1 : i - 1) {\n      returnList.push([i, list[i]!])\n    }\n  }\n\n  return returnList\n}\n\nexport const createLoopingList = <T >(list: T[], startIndex: number = 0, length: number = 0, forwards: boolean = true) => {\n  return createLoopingListWithIndex(list, startIndex, length, forwards).map(([_, item]) => item)\n}\n\nexport const ArrayUtil = {\n  unique: <T>(list: T[]): T[] => {\n    const seen = new Set<T>()\n    return list.filter((item) => {\n      if (seen.has(item)) {\n        return false\n      }\n      seen.add(item)\n      return true\n    })\n  },\n\n  difference: <T>(list: T[], removeList: T[]): T[] => {\n    const remove = new Set<T>(removeList)\n    return list.filter((item) => !remove.has(item))\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAO,IAAM,kBAAkB,CAAK,OAAY,cAA6B;AAC3E,MAAI,aAAa,GAAG;AAClB,YAAQ,KAAK,oDAAoD,SAAS,EAAE;AAC5E,WAAO,CAAC,CAAC,GAAG,KAAK,CAAC;AAAA,EACpB;AAEA,QAAM,SAAS,CAAC;AAChB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,WAAO,KAAK,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,WAAW,MAAM,MAAM,CAAC,CAAC;AAAA,EACnE;AACA,SAAO;AACT;AAOO,IAAM,QAAQ,CAAC,OAAe,KAAa,kBAA2B,UAAoB;AAC/F,MAAI,MAAM,OAAO;AACf,QAAI,CAAC,iBAAiB;AACpB,cAAQ,KAAK,eAAe,GAAG,cAAc,KAAK,6DAA6D;AAAA,IACjH;AACA,WAAO,CAAC;AAAA,EACV;AACA,SAAO,MAAM,KAAK,EAAE,QAAQ,MAAM,QAAQ,EAAE,GAAG,CAAC,GAAG,UAAU,QAAQ,KAAK;AAC5E;AAMO,IAAM,eAAe,CAAK,MAAW,gBAAiD;AAC3F,SAAO,KAAK,OAAO,CAAC,OAAO,UAAU;AACnC,WAAO,YAAY,OAAO,KAAK,IAAI,QAAQ;AAAA,EAC7C,CAAC;AACH;AAMO,IAAM,gBAAgB,CAAK,MAAW,MAAS,oBAA4B,MAAM;AACtF,QAAM,QAAQ,KAAK,QAAQ,IAAI;AAC/B,QAAM,aAAa,oBAAoB,IAAI;AAC3C,MAAI,KAAK,SAAS,YAAY;AAC5B,YAAQ,KAAK,kBAAkB;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,IAAI;AAChB,YAAQ,MAAM,wBAAwB;AACtC,WAAO,KAAK,OAAO,GAAG,UAAU;AAAA,EAClC;AAEA,MAAI,QAAQ,QAAQ;AACpB,MAAI,QAAQ,GAAG;AACb,aAAS,KAAK;AAAA,EAChB;AACA,QAAM,OAAO,QAAQ,oBAAoB,KAAK,KAAK;AAEnD,QAAM,SAAc,CAAC;AACrB,MAAI,aAAa,KAAK,WAAW;AACjC,WAAS,IAAI,OAAO,MAAM,OAAO,YAAY,KAAK,IAAI,KAAK,KAAK,QAAQ;AACtE,WAAO,KAAK,KAAK,CAAC,CAAE;AACpB,QAAI,QAAQ,KAAK,YAAY;AAC3B,mBAAa;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,6BAA6B,CAAK,MAAW,aAAqB,GAAG,SAAiB,GAAG,WAAoB,SAAS;AACjI,MAAI,SAAS,GAAG;AACd,YAAQ,KAAK,iDAAiD,MAAM,EAAE;AAAA,EACxE,WAAW,WAAW,GAAG;AACvB,aAAS,KAAK;AAAA,EAChB;AAEA,QAAM,aAA4B,CAAC;AAEnC,MAAI,UAAU;AACZ,aAAS,IAAI,YAAY,WAAW,SAAS,QAAQ,KAAK,IAAI,KAAK,KAAK,QAAQ;AAC9E,iBAAW,KAAK,CAAC,GAAG,KAAK,CAAC,CAAE,CAAC;AAAA,IAC/B;AAAA,EACF,OAAO;AACL,aAAS,IAAI,YAAY,WAAW,SAAS,QAAQ,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,GAAG;AAC9F,iBAAW,KAAK,CAAC,GAAG,KAAK,CAAC,CAAE,CAAC;AAAA,IAC/B;AAAA,EACF;AAEA,SAAO;AACT;AAEO,IAAM,oBAAoB,CAAK,MAAW,aAAqB,GAAG,SAAiB,GAAG,WAAoB,SAAS;AACxH,SAAO,2BAA2B,MAAM,YAAY,QAAQ,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,IAAI;AAC/F;AAEO,IAAM,YAAY;AAAA,EACvB,QAAQ,CAAI,SAAmB;AAC7B,UAAM,OAAO,oBAAI,IAAO;AACxB,WAAO,KAAK,OAAO,CAAC,SAAS;AAC3B,UAAI,KAAK,IAAI,IAAI,GAAG;AAClB,eAAO;AAAA,MACT;AACA,WAAK,IAAI,IAAI;AACb,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,YAAY,CAAI,MAAW,eAAyB;AAClD,UAAM,SAAS,IAAI,IAAO,UAAU;AACpC,WAAO,KAAK,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,IAAI,CAAC;AAAA,EAChD;AACF;","names":[]}

package/dist/util/array.mjs

@@ -0,0 +1,99 @@
+// src/util/array.ts
+var equalSizeGroups = (array, groupSize) => {
+  if (groupSize <= 0) {
+    console.warn(`group size should be greater than 0: groupSize = ${groupSize}`);
+    return [[...array]];
+  }
+  const groups = [];
+  for (let i = 0; i < array.length; i += groupSize) {
+    groups.push(array.slice(i, Math.min(i + groupSize, array.length)));
+  }
+  return groups;
+};
+var range = (start, end, allowEmptyRange = false) => {
+  if (end < start) {
+    if (!allowEmptyRange) {
+      console.warn(`range: end (${end}) < start (${start}) should be allowed explicitly, set allowEmptyRange to true`);
+    }
+    return [];
+  }
+  return Array.from({ length: end - start + 1 }, (_, index) => index + start);
+};
+var closestMatch = (list, firstCloser) => {
+  return list.reduce((item1, item2) => {
+    return firstCloser(item1, item2) ? item1 : item2;
+  });
+};
+var getNeighbours = (list, item, neighbourDistance = 2) => {
+  const index = list.indexOf(item);
+  const totalItems = neighbourDistance * 2 + 1;
+  if (list.length < totalItems) {
+    console.warn("List is to short");
+    return list;
+  }
+  if (index === -1) {
+    console.error("item not found in list");
+    return list.splice(0, totalItems);
+  }
+  let start = index - neighbourDistance;
+  if (start < 0) {
+    start += list.length;
+  }
+  const end = (index + neighbourDistance + 1) % list.length;
+  const result = [];
+  let ignoreOnce = list.length === totalItems;
+  for (let i = start; i !== end || ignoreOnce; i = (i + 1) % list.length) {
+    result.push(list[i]);
+    if (end === i && ignoreOnce) {
+      ignoreOnce = false;
+    }
+  }
+  return result;
+};
+var createLoopingListWithIndex = (list, startIndex = 0, length = 0, forwards = true) => {
+  if (length < 0) {
+    console.warn(`createLoopingList: length must be >= 0, given ${length}`);
+  } else if (length === 0) {
+    length = list.length;
+  }
+  const returnList = [];
+  if (forwards) {
+    for (let i = startIndex; returnList.length < length; i = (i + 1) % list.length) {
+      returnList.push([i, list[i]]);
+    }
+  } else {
+    for (let i = startIndex; returnList.length < length; i = i === 0 ? i = list.length - 1 : i - 1) {
+      returnList.push([i, list[i]]);
+    }
+  }
+  return returnList;
+};
+var createLoopingList = (list, startIndex = 0, length = 0, forwards = true) => {
+  return createLoopingListWithIndex(list, startIndex, length, forwards).map(([_, item]) => item);
+};
+var ArrayUtil = {
+  unique: (list) => {
+    const seen = /* @__PURE__ */ new Set();
+    return list.filter((item) => {
+      if (seen.has(item)) {
+        return false;
+      }
+      seen.add(item);
+      return true;
+    });
+  },
+  difference: (list, removeList) => {
+    const remove = new Set(removeList);
+    return list.filter((item) => !remove.has(item));
+  }
+};
+export {
+  ArrayUtil,
+  closestMatch,
+  createLoopingList,
+  createLoopingListWithIndex,
+  equalSizeGroups,
+  getNeighbours,
+  range
+};
+//# sourceMappingURL=array.mjs.map

package/dist/util/array.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/util/array.ts"],"sourcesContent":["export const equalSizeGroups = <T >(array: T[], groupSize: number): T[][] => {\n  if (groupSize <= 0) {\n    console.warn(`group size should be greater than 0: groupSize = ${groupSize}`)\n    return [[...array]]\n  }\n\n  const groups = []\n  for (let i = 0; i < array.length; i += groupSize) {\n    groups.push(array.slice(i, Math.min(i + groupSize, array.length)))\n  }\n  return groups\n}\n\n/**\n * @param start\n * @param end inclusive\n * @param allowEmptyRange Whether the range can be defined empty via end < start\n */\nexport const range = (start: number, end: number, allowEmptyRange: boolean = false): number[] => {\n  if (end < start) {\n    if (!allowEmptyRange) {\n      console.warn(`range: end (${end}) < start (${start}) should be allowed explicitly, set allowEmptyRange to true`)\n    }\n    return []\n  }\n  return Array.from({ length: end - start + 1 }, (_, index) => index + start)\n}\n\n/** Finds the closest match\n * @param list The list of all possible matches\n * @param firstCloser Return whether item1 is closer than item2\n */\nexport const closestMatch = <T >(list: T[], firstCloser: (item1: T, item2: T) => boolean) => {\n  return list.reduce((item1, item2) => {\n    return firstCloser(item1, item2) ? item1 : item2\n  })\n}\n\n/**\n * returns the item in middle of a list and its neighbours before and after\n * e.g. [1,2,3,4,5,6] for item = 1 would return [5,6,1,2,3]\n */\nexport const getNeighbours = <T >(list: T[], item: T, neighbourDistance: number = 2) => {\n  const index = list.indexOf(item)\n  const totalItems = neighbourDistance * 2 + 1\n  if (list.length < totalItems) {\n    console.warn('List is to short')\n    return list\n  }\n\n  if (index === -1) {\n    console.error('item not found in list')\n    return list.splice(0, totalItems)\n  }\n\n  let start = index - neighbourDistance\n  if (start < 0) {\n    start += list.length\n  }\n  const end = (index + neighbourDistance + 1) % list.length\n\n  const result: T[] = []\n  let ignoreOnce = list.length === totalItems\n  for (let i = start; i !== end || ignoreOnce; i = (i + 1) % list.length) {\n    result.push(list[i]!)\n    if (end === i && ignoreOnce) {\n      ignoreOnce = false\n    }\n  }\n  return result\n}\n\nexport const createLoopingListWithIndex = <T >(list: T[], startIndex: number = 0, length: number = 0, forwards: boolean = true) => {\n  if (length < 0) {\n    console.warn(`createLoopingList: length must be >= 0, given ${length}`)\n  } else if (length === 0) {\n    length = list.length\n  }\n\n  const returnList: [number, T][] = []\n\n  if (forwards) {\n    for (let i = startIndex; returnList.length < length; i = (i + 1) % list.length) {\n      returnList.push([i, list[i]!])\n    }\n  } else {\n    for (let i = startIndex; returnList.length < length; i = i === 0 ? i = list.length - 1 : i - 1) {\n      returnList.push([i, list[i]!])\n    }\n  }\n\n  return returnList\n}\n\nexport const createLoopingList = <T >(list: T[], startIndex: number = 0, length: number = 0, forwards: boolean = true) => {\n  return createLoopingListWithIndex(list, startIndex, length, forwards).map(([_, item]) => item)\n}\n\nexport const ArrayUtil = {\n  unique: <T>(list: T[]): T[] => {\n    const seen = new Set<T>()\n    return list.filter((item) => {\n      if (seen.has(item)) {\n        return false\n      }\n      seen.add(item)\n      return true\n    })\n  },\n\n  difference: <T>(list: T[], removeList: T[]): T[] => {\n    const remove = new Set<T>(removeList)\n    return list.filter((item) => !remove.has(item))\n  }\n}\n"],"mappings":";AAAO,IAAM,kBAAkB,CAAK,OAAY,cAA6B;AAC3E,MAAI,aAAa,GAAG;AAClB,YAAQ,KAAK,oDAAoD,SAAS,EAAE;AAC5E,WAAO,CAAC,CAAC,GAAG,KAAK,CAAC;AAAA,EACpB;AAEA,QAAM,SAAS,CAAC;AAChB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,WAAO,KAAK,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,WAAW,MAAM,MAAM,CAAC,CAAC;AAAA,EACnE;AACA,SAAO;AACT;AAOO,IAAM,QAAQ,CAAC,OAAe,KAAa,kBAA2B,UAAoB;AAC/F,MAAI,MAAM,OAAO;AACf,QAAI,CAAC,iBAAiB;AACpB,cAAQ,KAAK,eAAe,GAAG,cAAc,KAAK,6DAA6D;AAAA,IACjH;AACA,WAAO,CAAC;AAAA,EACV;AACA,SAAO,MAAM,KAAK,EAAE,QAAQ,MAAM,QAAQ,EAAE,GAAG,CAAC,GAAG,UAAU,QAAQ,KAAK;AAC5E;AAMO,IAAM,eAAe,CAAK,MAAW,gBAAiD;AAC3F,SAAO,KAAK,OAAO,CAAC,OAAO,UAAU;AACnC,WAAO,YAAY,OAAO,KAAK,IAAI,QAAQ;AAAA,EAC7C,CAAC;AACH;AAMO,IAAM,gBAAgB,CAAK,MAAW,MAAS,oBAA4B,MAAM;AACtF,QAAM,QAAQ,KAAK,QAAQ,IAAI;AAC/B,QAAM,aAAa,oBAAoB,IAAI;AAC3C,MAAI,KAAK,SAAS,YAAY;AAC5B,YAAQ,KAAK,kBAAkB;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,IAAI;AAChB,YAAQ,MAAM,wBAAwB;AACtC,WAAO,KAAK,OAAO,GAAG,UAAU;AAAA,EAClC;AAEA,MAAI,QAAQ,QAAQ;AACpB,MAAI,QAAQ,GAAG;AACb,aAAS,KAAK;AAAA,EAChB;AACA,QAAM,OAAO,QAAQ,oBAAoB,KAAK,KAAK;AAEnD,QAAM,SAAc,CAAC;AACrB,MAAI,aAAa,KAAK,WAAW;AACjC,WAAS,IAAI,OAAO,MAAM,OAAO,YAAY,KAAK,IAAI,KAAK,KAAK,QAAQ;AACtE,WAAO,KAAK,KAAK,CAAC,CAAE;AACpB,QAAI,QAAQ,KAAK,YAAY;AAC3B,mBAAa;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,6BAA6B,CAAK,MAAW,aAAqB,GAAG,SAAiB,GAAG,WAAoB,SAAS;AACjI,MAAI,SAAS,GAAG;AACd,YAAQ,KAAK,iDAAiD,MAAM,EAAE;AAAA,EACxE,WAAW,WAAW,GAAG;AACvB,aAAS,KAAK;AAAA,EAChB;AAEA,QAAM,aAA4B,CAAC;AAEnC,MAAI,UAAU;AACZ,aAAS,IAAI,YAAY,WAAW,SAAS,QAAQ,KAAK,IAAI,KAAK,KAAK,QAAQ;AAC9E,iBAAW,KAAK,CAAC,GAAG,KAAK,CAAC,CAAE,CAAC;AAAA,IAC/B;AAAA,EACF,OAAO;AACL,aAAS,IAAI,YAAY,WAAW,SAAS,QAAQ,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,GAAG;AAC9F,iBAAW,KAAK,CAAC,GAAG,KAAK,CAAC,CAAE,CAAC;AAAA,IAC/B;AAAA,EACF;AAEA,SAAO;AACT;AAEO,IAAM,oBAAoB,CAAK,MAAW,aAAqB,GAAG,SAAiB,GAAG,WAAoB,SAAS;AACxH,SAAO,2BAA2B,MAAM,YAAY,QAAQ,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,IAAI;AAC/F;AAEO,IAAM,YAAY;AAAA,EACvB,QAAQ,CAAI,SAAmB;AAC7B,UAAM,OAAO,oBAAI,IAAO;AACxB,WAAO,KAAK,OAAO,CAAC,SAAS;AAC3B,UAAI,KAAK,IAAI,IAAI,GAAG;AAClB,eAAO;AAAA,MACT;AACA,WAAK,IAAI,IAAI;AACb,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,YAAY,CAAI,MAAW,eAAyB;AAClD,UAAM,SAAS,IAAI,IAAO,UAAU;AACpC,WAAO,KAAK,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,IAAI,CAAC;AAAA,EAChD;AACF;","names":[]}

package/dist/util/builder.d.mts

@@ -0,0 +1,8 @@
+/**
+ * A simple function that implements the builder pattern
+ * @param value The value to update which gets return with the same reference
+ * @param update The updates to apply on the object
+ */
+declare const builder: <T>(value: T, update: (value: T) => void) => T;
+
+export { builder };

package/dist/util/builder.d.ts

@@ -3,4 +3,6 @@
  * @param value The value to update which gets return with the same reference
  * @param update The updates to apply on the object
  */
-export declare const builder: <T>(value: T, update: (value: T) => void) => T;
+declare const builder: <T>(value: T, update: (value: T) => void) => T;
+
+export { builder };

package/dist/util/builder.js

@@ -1,9 +1,34 @@
-/**
- * A simple function that implements the builder pattern
- * @param value The value to update which gets return with the same reference
- * @param update The updates to apply on the object
- */
-export const builder = (value, update) => {
-    update(value);
-    return value;
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
 };
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/util/builder.ts
+var builder_exports = {};
+__export(builder_exports, {
+  builder: () => builder
+});
+module.exports = __toCommonJS(builder_exports);
+var builder = (value, update) => {
+  update(value);
+  return value;
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  builder
+});
+//# sourceMappingURL=builder.js.map

package/dist/util/builder.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/util/builder.ts"],"sourcesContent":["/**\n * A simple function that implements the builder pattern\n * @param value The value to update which gets return with the same reference\n * @param update The updates to apply on the object\n */\nexport const builder = <T>(value: T, update: (value: T) => void): T => {\n  update(value)\n  return value\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKO,IAAM,UAAU,CAAI,OAAU,WAAkC;AACrE,SAAO,KAAK;AACZ,SAAO;AACT;","names":[]}

package/dist/util/builder.mjs

@@ -0,0 +1,9 @@
+// src/util/builder.ts
+var builder = (value, update) => {
+  update(value);
+  return value;
+};
+export {
+  builder
+};
+//# sourceMappingURL=builder.mjs.map

package/dist/util/builder.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/util/builder.ts"],"sourcesContent":["/**\n * A simple function that implements the builder pattern\n * @param value The value to update which gets return with the same reference\n * @param update The updates to apply on the object\n */\nexport const builder = <T>(value: T, update: (value: T) => void): T => {\n  update(value)\n  return value\n}\n"],"mappings":";AAKO,IAAM,UAAU,CAAI,OAAU,WAAkC;AACrE,SAAO,KAAK;AACZ,SAAO;AACT;","names":[]}

package/dist/util/date.d.mts

@@ -0,0 +1,30 @@
+declare const monthsList: readonly ["january", "february", "march", "april", "may", "june", "july", "august", "september", "october", "november", "december"];
+type Month = typeof monthsList[number];
+declare const weekDayList: readonly ["sunday", "monday", "tuesday", "wednesday", "thursday", "friday", "saturday"];
+type WeekDay = typeof weekDayList[number];
+declare const formatDate: (date: Date) => string;
+declare const formatDateTime: (date: Date) => string;
+declare const getDaysInMonth: (year: number, month: number) => number;
+type Duration = {
+    years?: number;
+    months?: number;
+    days?: number;
+    hours?: number;
+    minutes?: number;
+    seconds?: number;
+    milliseconds?: number;
+};
+declare const changeDuration: (date: Date, duration: Duration, isAdding?: boolean) => Date;
+declare const addDuration: (date: Date, duration: Duration) => Date;
+declare const subtractDuration: (date: Date, duration: Duration) => Date;
+declare const getBetweenDuration: (startDate: Date, endDate: Date) => Duration;
+/** Checks if a given date is in the range of two dates
+ *
+ * An undefined value for startDate or endDate means no bound for the start or end respectively
+ */
+declare const isInTimeSpan: (value: Date, startDate?: Date, endDate?: Date) => boolean;
+/** Compare two dates on the year, month, day */
+declare const equalDate: (date1: Date, date2: Date) => boolean;
+declare const getWeeksForCalenderMonth: (date: Date, weekStart: WeekDay, weeks?: number) => Date[][];
+
+export { type Duration, type Month, type WeekDay, addDuration, changeDuration, equalDate, formatDate, formatDateTime, getBetweenDuration, getDaysInMonth, getWeeksForCalenderMonth, isInTimeSpan, monthsList, subtractDuration, weekDayList };

package/dist/util/date.d.ts

@@ -1,11 +1,11 @@
-export declare const monthsList: readonly ["january", "february", "march", "april", "may", "june", "july", "august", "september", "october", "november", "december"];
-export type Month = typeof monthsList[number];
-export declare const weekDayList: readonly ["sunday", "monday", "tuesday", "wednesday", "thursday", "friday", "saturday"];
-export type WeekDay = typeof weekDayList[number];
-export declare const formatDate: (date: Date) => string;
-export declare const formatDateTime: (date: Date) => string;
-export declare const getDaysInMonth: (year: number, month: number) => number;
-export type Duration = {
+declare const monthsList: readonly ["january", "february", "march", "april", "may", "june", "july", "august", "september", "october", "november", "december"];
+type Month = typeof monthsList[number];
+declare const weekDayList: readonly ["sunday", "monday", "tuesday", "wednesday", "thursday", "friday", "saturday"];
+type WeekDay = typeof weekDayList[number];
+declare const formatDate: (date: Date) => string;
+declare const formatDateTime: (date: Date) => string;
+declare const getDaysInMonth: (year: number, month: number) => number;
+type Duration = {
     years?: number;
     months?: number;
     days?: number;
@@ -14,15 +14,17 @@ export type Duration = {
     seconds?: number;
     milliseconds?: number;
 };
-export declare const changeDuration: (date: Date, duration: Duration, isAdding?: boolean) => Date;
-export declare const addDuration: (date: Date, duration: Duration) => Date;
-export declare const subtractDuration: (date: Date, duration: Duration) => Date;
-export declare const getBetweenDuration: (startDate: Date, endDate: Date) => Duration;
+declare const changeDuration: (date: Date, duration: Duration, isAdding?: boolean) => Date;
+declare const addDuration: (date: Date, duration: Duration) => Date;
+declare const subtractDuration: (date: Date, duration: Duration) => Date;
+declare const getBetweenDuration: (startDate: Date, endDate: Date) => Duration;
 /** Checks if a given date is in the range of two dates
  *
  * An undefined value for startDate or endDate means no bound for the start or end respectively
  */
-export declare const isInTimeSpan: (value: Date, startDate?: Date, endDate?: Date) => boolean;
+declare const isInTimeSpan: (value: Date, startDate?: Date, endDate?: Date) => boolean;
 /** Compare two dates on the year, month, day */
-export declare const equalDate: (date1: Date, date2: Date) => boolean;
-export declare const getWeeksForCalenderMonth: (date: Date, weekStart: WeekDay, weeks?: number) => Date[][];
+declare const equalDate: (date1: Date, date2: Date) => boolean;
+declare const getWeeksForCalenderMonth: (date: Date, weekStart: WeekDay, weeks?: number) => Date[][];
+
+export { type Duration, type Month, type WeekDay, addDuration, changeDuration, equalDate, formatDate, formatDateTime, getBetweenDuration, getDaysInMonth, getWeeksForCalenderMonth, isInTimeSpan, monthsList, subtractDuration, weekDayList };