@seedcord/utils 0.1.0

package/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1.  Definitions.
+
+    "License" shall mean the terms and conditions for use, reproduction,
+    and distribution as defined by Sections 1 through 9 of this document.
+
+    "Licensor" shall mean the copyright owner or entity authorized by
+    the copyright owner that is granting the License.
+
+    "Legal Entity" shall mean the union of the acting entity and all
+    other entities that control, are controlled by, or are under common
+    control with that entity. For the purposes of this definition,
+    "control" means (i) the power, direct or indirect, to cause the
+    direction or management of such entity, whether by contract or
+    otherwise, or (ii) ownership of fifty percent (50%) or more of the
+    outstanding shares, or (iii) beneficial ownership of such entity.
+
+    "You" (or "Your") shall mean an individual or Legal Entity
+    exercising permissions granted by this License.
+
+    "Source" form shall mean the preferred form for making modifications,
+    including but not limited to software source code, documentation
+    source, and configuration files.
+
+    "Object" form shall mean any form resulting from mechanical
+    transformation or translation of a Source form, including but
+    not limited to compiled object code, generated documentation,
+    and conversions to other media types.
+
+    "Work" shall mean the work of authorship, whether in Source or
+    Object form, made available under the License, as indicated by a
+    copyright notice that is included in or attached to the work
+    (an example is provided in the Appendix below).
+
+    "Derivative Works" shall mean any work, whether in Source or Object
+    form, that is based on (or derived from) the Work and for which the
+    editorial revisions, annotations, elaborations, or other modifications
+    represent, as a whole, an original work of authorship. For the purposes
+    of this License, Derivative Works shall not include works that remain
+    separable from, or merely link (or bind by name) to the interfaces of,
+    the Work and Derivative Works thereof.
+
+    "Contribution" shall mean any work of authorship, including
+    the original version of the Work and any modifications or additions
+    to that Work or Derivative Works thereof, that is intentionally
+    submitted to Licensor for inclusion in the Work by the copyright owner
+    or by an individual or Legal Entity authorized to submit on behalf of
+    the copyright owner. For the purposes of this definition, "submitted"
+    means any form of electronic, verbal, or written communication sent
+    to the Licensor or its representatives, including but not limited to
+    communication on electronic mailing lists, source code control systems,
+    and issue tracking systems that are managed by, or on behalf of, the
+    Licensor for the purpose of discussing and improving the Work, but
+    excluding communication that is conspicuously marked or otherwise
+    designated in writing by the copyright owner as "Not a Contribution."
+
+    "Contributor" shall mean Licensor and any individual or Legal Entity
+    on behalf of whom a Contribution has been received by Licensor and
+    subsequently incorporated within the Work.
+
+2.  Grant of Copyright License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    copyright license to reproduce, prepare Derivative Works of,
+    publicly display, publicly perform, sublicense, and distribute the
+    Work and such Derivative Works in Source or Object form.
+
+3.  Grant of Patent License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    (except as stated in this section) patent license to make, have made,
+    use, offer to sell, sell, import, and otherwise transfer the Work,
+    where such license applies only to those patent claims licensable
+    by such Contributor that are necessarily infringed by their
+    Contribution(s) alone or by combination of their Contribution(s)
+    with the Work to which such Contribution(s) was submitted. If You
+    institute patent litigation against any entity (including a
+    cross-claim or counterclaim in a lawsuit) alleging that the Work
+    or a Contribution incorporated within the Work constitutes direct
+    or contributory patent infringement, then any patent licenses
+    granted to You under this License for that Work shall terminate
+    as of the date such litigation is filed.
+
+4.  Redistribution. You may reproduce and distribute copies of the
+    Work or Derivative Works thereof in any medium, with or without
+    modifications, and in Source or Object form, provided that You
+    meet the following conditions:
+
+    (a) You must give any other recipients of the Work or
+    Derivative Works a copy of this License; and
+
+    (b) You must cause any modified files to carry prominent notices
+    stating that You changed the files; and
+
+    (c) You must retain, in the Source form of any Derivative Works
+    that You distribute, all copyright, patent, trademark, and
+    attribution notices from the Source form of the Work,
+    excluding those notices that do not pertain to any part of
+    the Derivative Works; and
+
+    (d) If the Work includes a "NOTICE" text file as part of its
+    distribution, then any Derivative Works that You distribute must
+    include a readable copy of the attribution notices contained
+    within such NOTICE file, excluding those notices that do not
+    pertain to any part of the Derivative Works, in at least one
+    of the following places: within a NOTICE text file distributed
+    as part of the Derivative Works; within the Source form or
+    documentation, if provided along with the Derivative Works; or,
+    within a display generated by the Derivative Works, if and
+    wherever such third-party notices normally appear. The contents
+    of the NOTICE file are for informational purposes only and
+    do not modify the License. You may add Your own attribution
+    notices within Derivative Works that You distribute, alongside
+    or as an addendum to the NOTICE text from the Work, provided
+    that such additional attribution notices cannot be construed
+    as modifying the License.
+
+    You may add Your own copyright statement to Your modifications and
+    may provide additional or different license terms and conditions
+    for use, reproduction, or distribution of Your modifications, or
+    for any such Derivative Works as a whole, provided Your use,
+    reproduction, and distribution of the Work otherwise complies with
+    the conditions stated in this License.
+
+5.  Submission of Contributions. Unless You explicitly state otherwise,
+    any Contribution intentionally submitted for inclusion in the Work
+    by You to the Licensor shall be under the terms and conditions of
+    this License, without any additional terms or conditions.
+    Notwithstanding the above, nothing herein shall supersede or modify
+    the terms of any separate license agreement you may have executed
+    with Licensor regarding such Contributions.
+
+6.  Trademarks. This License does not grant permission to use the trade
+    names, trademarks, service marks, or product names of the Licensor,
+    except as required for reasonable and customary use in describing the
+    origin of the Work and reproducing the content of the NOTICE file.
+
+7.  Disclaimer of Warranty. Unless required by applicable law or
+    agreed to in writing, Licensor provides the Work (and each
+    Contributor provides its Contributions) on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+    implied, including, without limitation, any warranties or conditions
+    of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+    PARTICULAR PURPOSE. You are solely responsible for determining the
+    appropriateness of using or redistributing the Work and assume any
+    risks associated with Your exercise of permissions under this License.
+
+8.  Limitation of Liability. In no event and under no legal theory,
+    whether in tort (including negligence), contract, or otherwise,
+    unless required by applicable law (such as deliberate and grossly
+    negligent acts) or agreed to in writing, shall any Contributor be
+    liable to You for damages, including any direct, indirect, special,
+    incidental, or consequential damages of any character arising as a
+    result of this License or out of the use or inability to use the
+    Work (including but not limited to damages for loss of goodwill,
+    work stoppage, computer failure or malfunction, or any and all
+    other commercial damages or losses), even if such Contributor
+    has been advised of the possibility of such damages.
+
+9.  Accepting Warranty or Additional Liability. While redistributing
+    the Work or Derivative Works thereof, You may choose to offer,
+    and charge a fee for, acceptance of support, warranty, indemnity,
+    or other liability obligations and/or rights consistent with this
+    License. However, in accepting such obligations, You may act only
+    on Your own behalf and on Your sole responsibility, not on behalf
+    of any other Contributor, and only if You agree to indemnify,
+    defend, and hold each Contributor harmless for any liability
+    incurred by, or claims asserted against, such Contributor by reason
+    of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+Copyright 2025 Dhruv Jain (materwelonDhruv)
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/README.md

@@ -0,0 +1,5 @@
+<p align="center">
+  <img src="../../assets/banner.png" alt="seedcord" width="100%" />
+</p>
+
+---

package/dist/index.cjs

@@ -0,0 +1,250 @@
+'use strict';
+
+var promises = require('fs/promises');
+var path = require('path');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var path__namespace = /*#__PURE__*/_interopNamespace(path);
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// src/numbers/currentTime.ts
+function currentTime() {
+  return Math.floor(Date.now() / 1e3);
+}
+__name(currentTime, "currentTime");
+
+// src/numbers/generateCode.ts
+function generateCode(digits) {
+  const min = Math.pow(10, digits - 1);
+  const max = Math.pow(10, digits) - 1;
+  return Math.floor(Math.random() * (max - min + 1) + min);
+}
+__name(generateCode, "generateCode");
+
+// src/numbers/hexToNumber.ts
+function hexToNumber(hex) {
+  if (typeof hex !== "string") {
+    throw new TypeError("hexToNumber expects a string input");
+  }
+  const normalized = hex.replace(/^#/, "");
+  if (!/^[0-9a-fA-F]+$/.test(normalized)) {
+    throw new Error("Invalid hex string");
+  }
+  const converted = parseInt(normalized, 16);
+  if (Number.isNaN(converted)) {
+    throw new Error("Invalid hex string");
+  }
+  return converted;
+}
+__name(hexToNumber, "hexToNumber");
+
+// src/numbers/ordinal.ts
+function ordinal(n) {
+  const s = [
+    "th",
+    "st",
+    "nd",
+    "rd"
+  ];
+  const v = n % 100;
+  const index = (v - 20) % 10;
+  const suffix = s[index] ?? s[v] ?? s[0];
+  if (!suffix) return `${n}th`;
+  return `${n}${suffix}`;
+}
+__name(ordinal, "ordinal");
+
+// src/numbers/percentage.ts
+function percentage(num1, num2) {
+  return Number((num1 / num2 * 100).toFixed(2));
+}
+__name(percentage, "percentage");
+
+// src/numbers/round.ts
+function round(num, precision) {
+  const factor = Math.pow(10, precision);
+  return Math.round((num + Number.EPSILON) * factor) / factor;
+}
+__name(round, "round");
+
+// src/numbers/roundToDenomination.ts
+function roundToDenomination(num, opts) {
+  const { suffixes = [
+    "K",
+    "M",
+    "B",
+    "T",
+    "Q"
+  ], precision = 1 } = opts ?? {};
+  if (num < 1e4) {
+    return num.toString();
+  }
+  let index = -1;
+  let temp = num;
+  while (temp >= 1e3 && index < suffixes.length - 1) {
+    temp /= 1e3;
+    index++;
+  }
+  let result;
+  if (temp % 1 === 0) {
+    result = temp.toString();
+  } else {
+    const adjustedTemp = Math.round(temp * Math.pow(10, precision + 1)) / Math.pow(10, precision + 1);
+    result = adjustedTemp.toFixed(precision);
+  }
+  if (result.endsWith(".9")) {
+    result = Math.ceil(Number(result)).toString();
+  }
+  if (result.endsWith(".0")) {
+    result = result.substring(0, result.length - 2);
+  }
+  if (result === "1000") {
+    index += 1;
+    result = "1";
+  }
+  return result + (index >= 0 ? suffixes[index] : "");
+}
+__name(roundToDenomination, "roundToDenomination");
+
+// src/strings/capitalize.ts
+function capitalize(word) {
+  return word.charAt(0).toUpperCase() + word.slice(1).toLowerCase();
+}
+__name(capitalize, "capitalize");
+
+// src/strings/longestStringLength.ts
+function longestStringLength(arr) {
+  return Math.max(...arr.map((el) => el.toString().length));
+}
+__name(longestStringLength, "longestStringLength");
+
+// src/strings/generateAsciiTable.ts
+function generateAsciiTable(data) {
+  if (data.length === 0) return "";
+  const firstRow = data[0];
+  if (!firstRow || firstRow.length === 0) return "";
+  let table = "";
+  const columnWidths = [];
+  for (let i = 0; i < firstRow.length; i++) {
+    let maxWidth = 0;
+    for (const row of data) {
+      const cell = row[i];
+      if (cell !== void 0) maxWidth = Math.max(maxWidth, cell.length);
+    }
+    columnWidths.push(maxWidth);
+  }
+  const createLine = /* @__PURE__ */ __name((char, left, intersect, right) => {
+    let line = left;
+    columnWidths.forEach((width, index) => {
+      line += char.repeat(width + 2);
+      if (index < columnWidths.length - 1) line += intersect;
+      else line += right;
+    });
+    line += "\n";
+    return line;
+  }, "createLine");
+  table += createLine("\u2550", "\u2554", "\u2566", "\u2557");
+  data.forEach((row, rowIndex) => {
+    table += "\u2551";
+    row.forEach((cell, columnIndex) => {
+      const columnWidth = columnWidths[columnIndex];
+      if (columnWidth !== void 0) table += ` ${cell.padEnd(columnWidth)} \u2551`;
+    });
+    table += "\n";
+    if (rowIndex < data.length - 1) table += createLine("\u2500", "\u2560", "\u256C", "\u2563");
+    else table += createLine("\u2550", "\u255A", "\u2569", "\u255D");
+  });
+  return table;
+}
+__name(generateAsciiTable, "generateAsciiTable");
+
+// src/strings/prettify.ts
+function prettify(key, opts) {
+  const result = key.replace(/([a-z])([A-Z])/g, "$1 $2").replace(/[_-]/g, " ").trim();
+  if (opts?.capitalize) return capitalize(result);
+  return result;
+}
+__name(prettify, "prettify");
+
+// src/strings/prettyDifference.ts
+function prettyDifference(numBefore, numAfter) {
+  return (numAfter - numBefore > 0 ? `+${numAfter - numBefore}` : numAfter - numBefore).toString();
+}
+__name(prettyDifference, "prettyDifference");
+
+// src/fyShuffle.ts
+function fyShuffle(items) {
+  const array = items.slice();
+  for (let i = array.length - 1; i > 0; i--) {
+    const j = Math.floor(Math.random() * (i + 1));
+    [array[i], array[j]] = [
+      array[j],
+      array[i]
+    ];
+  }
+  return array;
+}
+__name(fyShuffle, "fyShuffle");
+function isTsOrJsFile(entry) {
+  return entry.isFile() && (entry.name.endsWith(".ts") || entry.name.endsWith(".js")) && !entry.name.endsWith(".d.ts") && !entry.name.endsWith(".map");
+}
+__name(isTsOrJsFile, "isTsOrJsFile");
+async function traverseDirectory(dir, callback, logger) {
+  let entries;
+  try {
+    entries = await promises.readdir(dir, {
+      withFileTypes: true
+    });
+  } catch {
+    logger.error("Failed to read this directory");
+    entries = [];
+  }
+  for (const entry of entries) {
+    const fullPath = path__namespace.join(dir, entry.name);
+    const relativePath = path__namespace.relative(process.cwd(), fullPath);
+    if (entry.isDirectory()) {
+      await traverseDirectory(fullPath, callback, logger);
+    } else if (isTsOrJsFile(entry)) {
+      const imported = await import(fullPath);
+      await callback(fullPath, relativePath, imported);
+    }
+  }
+}
+__name(traverseDirectory, "traverseDirectory");
+
+exports.capitalize = capitalize;
+exports.currentTime = currentTime;
+exports.fyShuffle = fyShuffle;
+exports.generateAsciiTable = generateAsciiTable;
+exports.generateCode = generateCode;
+exports.hexToNumber = hexToNumber;
+exports.isTsOrJsFile = isTsOrJsFile;
+exports.longestStringLength = longestStringLength;
+exports.ordinal = ordinal;
+exports.percentage = percentage;
+exports.prettify = prettify;
+exports.prettyDifference = prettyDifference;
+exports.round = round;
+exports.roundToDenomination = roundToDenomination;
+exports.traverseDirectory = traverseDirectory;
+//# sourceMappingURL=index.cjs.map
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/numbers/currentTime.ts","../src/numbers/generateCode.ts","../src/numbers/hexToNumber.ts","../src/numbers/ordinal.ts","../src/numbers/percentage.ts","../src/numbers/round.ts","../src/numbers/roundToDenomination.ts","../src/strings/capitalize.ts","../src/strings/longestStringLength.ts","../src/strings/generateAsciiTable.ts","../src/strings/prettify.ts","../src/strings/prettyDifference.ts","../src/fyShuffle.ts","../src/directory.ts"],"names":["currentTime","Math","floor","Date","now","generateCode","digits","min","pow","max","random","hexToNumber","hex","TypeError","normalized","replace","test","Error","converted","parseInt","Number","isNaN","ordinal","n","s","v","index","suffix","percentage","num1","num2","toFixed","round","num","precision","factor","EPSILON","roundToDenomination","opts","suffixes","toString","temp","length","result","adjustedTemp","endsWith","ceil","substring","capitalize","word","charAt","toUpperCase","slice","toLowerCase","longestStringLength","arr","map","el","generateAsciiTable","data","firstRow","table","columnWidths","i","maxWidth","row","cell","undefined","push","createLine","char","left","intersect","right","line","forEach","width","repeat","rowIndex","columnIndex","columnWidth","padEnd","prettify","key","trim","prettyDifference","numBefore","numAfter","fyShuffle","items","array","j","isTsOrJsFile","entry","isFile","name","traverseDirectory","dir","callback","logger","entries","readdir","withFileTypes","error","fullPath","join","relativePath","relative","process","cwd","isDirectory","imported"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGO,SAASA,WAAAA,GAAAA;AACd,EAAA,OAAOC,IAAAA,CAAKC,KAAAA,CAAMC,IAAAA,CAAKC,GAAAA,KAAQ,GAAA,CAAA;AACjC;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;;;ACGT,SAASK,aAAaC,MAAAA,EAAc;AACzC,EAAA,MAAMC,GAAAA,GAAMN,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAIF,SAAS,CAAA,CAAA;AAClC,EAAA,MAAMG,GAAAA,GAAMR,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAIF,MAAAA,CAAAA,GAAU,CAAA;AACnC,EAAA,OAAOL,IAAAA,CAAKC,MAAMD,IAAAA,CAAKS,MAAAA,MAAYD,GAAAA,GAAMF,GAAAA,GAAM,KAAKA,GAAAA,CAAAA;AACtD;AAJgBF,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;;;ACAT,SAASM,YAAYC,GAAAA,EAAW;AACrC,EAAA,IAAI,OAAOA,QAAQ,QAAA,EAAU;AAC3B,IAAA,MAAM,IAAIC,UAAU,oCAAA,CAAA;AACtB,EAAA;AAEA,EAAA,MAAMC,UAAAA,GAAaF,GAAAA,CAAIG,OAAAA,CAAQ,IAAA,EAAM,EAAA,CAAA;AACrC,EAAA,IAAI,CAAC,gBAAA,CAAiBC,IAAAA,CAAKF,UAAAA,CAAAA,EAAa;AACtC,IAAA,MAAM,IAAIG,MAAM,oBAAA,CAAA;AAClB,EAAA;AAEA,EAAA,MAAMC,SAAAA,GAAYC,QAAAA,CAASL,UAAAA,EAAY,EAAA,CAAA;AACvC,EAAA,IAAIM,MAAAA,CAAOC,KAAAA,CAAMH,SAAAA,CAAAA,EAAY;AAC3B,IAAA,MAAM,IAAID,MAAM,oBAAA,CAAA;AAClB,EAAA;AAEA,EAAA,OAAOC,SAAAA;AACT;AAhBgBP,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;;;ACKT,SAASW,QAAQC,CAAAA,EAAS;AAC/B,EAAA,MAAMC,CAAAA,GAAI;AAAC,IAAA,IAAA;AAAM,IAAA,IAAA;AAAM,IAAA,IAAA;AAAM,IAAA;;AAC7B,EAAA,MAAMC,IAAIF,CAAAA,GAAI,GAAA;AACd,EAAA,MAAMG,KAAAA,GAAAA,CAASD,IAAI,EAAA,IAAM,EAAA;AACzB,EAAA,MAAME,MAAAA,GAASH,EAAEE,KAAAA,CAAAA,IAAUF,EAAEC,CAAAA,CAAAA,IAAMD,EAAE,CAAA,CAAA;AACrC,EAAA,IAAI,CAACG,MAAAA,EAAQ,OAAO,CAAA,EAAGJ,CAAAA,CAAAA,EAAAA,CAAAA;AAEvB,EAAA,OAAO,CAAA,EAAGA,CAAAA,CAAAA,EAAII,MAAAA,CAAAA,CAAAA;AAChB;AARgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;;;ACFT,SAASM,UAAAA,CAAWC,MAAcC,IAAAA,EAAY;AACnD,EAAA,OAAOV,QAASS,IAAAA,GAAOC,IAAAA,GAAQ,GAAA,EAAKC,OAAAA,CAAQ,CAAA,CAAA,CAAA;AAC9C;AAFgBH,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;;;ACDT,SAASI,KAAAA,CAAMC,KAAaC,SAAAA,EAAiB;AAClD,EAAA,MAAMC,MAAAA,GAASlC,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAI0B,SAAAA,CAAAA;AAC5B,EAAA,OAAOjC,KAAK+B,KAAAA,CAAAA,CAAOC,GAAAA,GAAMb,MAAAA,CAAOgB,OAAAA,IAAWD,MAAAA,CAAAA,GAAUA,MAAAA;AACvD;AAHgBH,MAAAA,CAAAA,KAAAA,EAAAA,OAAAA,CAAAA;;;ACKT,SAASK,mBAAAA,CACdJ,KACAK,IAAAA,EAGC;AAED,EAAA,MAAM,EAAEC,QAAAA,GAAW;AAAC,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA;KAAML,SAAAA,GAAY,CAAA,EAAC,GAAKI,IAAAA,IAAQ,EAAC;AAEzE,EAAA,IAAIL,MAAM,GAAA,EAAO;AACf,IAAA,OAAOA,IAAIO,QAAAA,EAAQ;AACrB,EAAA;AAEA,EAAA,IAAId,KAAAA,GAAQ,EAAA;AACZ,EAAA,IAAIe,IAAAA,GAAOR,GAAAA;AAEX,EAAA,OAAOQ,IAAAA,IAAQ,GAAA,IAAQf,KAAAA,GAAQa,QAAAA,CAASG,SAAS,CAAA,EAAG;AAClDD,IAAAA,IAAAA,IAAQ,GAAA;AACRf,IAAAA,KAAAA,EAAAA;AACF,EAAA;AAEA,EAAA,IAAIiB,MAAAA;AAEJ,EAAA,IAAIF,IAAAA,GAAO,MAAM,CAAA,EAAG;AAClBE,IAAAA,MAAAA,GAASF,KAAKD,QAAAA,EAAQ;EACxB,CAAA,MAAO;AACL,IAAA,MAAMI,YAAAA,GAAe3C,IAAAA,CAAK+B,KAAAA,CAAMS,IAAAA,GAAOxC,KAAKO,GAAAA,CAAI,EAAA,EAAI0B,SAAAA,GAAY,CAAA,CAAA,CAAA,GAAMjC,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAI0B,YAAY,CAAA,CAAA;AAC/FS,IAAAA,MAAAA,GAASC,YAAAA,CAAab,QAAQG,SAAAA,CAAAA;AAChC,EAAA;AAEA,EAAA,IAAIS,MAAAA,CAAOE,QAAAA,CAAS,IAAA,CAAA,EAAO;AACzBF,IAAAA,MAAAA,GAAS1C,KAAK6C,IAAAA,CAAK1B,MAAAA,CAAOuB,MAAAA,CAAAA,EAASH,QAAAA,EAAQ;AAC7C,EAAA;AAEA,EAAA,IAAIG,MAAAA,CAAOE,QAAAA,CAAS,IAAA,CAAA,EAAO;AACzBF,IAAAA,MAAAA,GAASA,MAAAA,CAAOI,SAAAA,CAAU,CAAA,EAAGJ,MAAAA,CAAOD,SAAS,CAAA,CAAA;AAC/C,EAAA;AAEA,EAAA,IAAIC,WAAW,MAAA,EAAQ;AACrBjB,IAAAA,KAAAA,IAAS,CAAA;AACTiB,IAAAA,MAAAA,GAAS,GAAA;AACX,EAAA;AAEA,EAAA,OAAOA,MAAAA,IAAUjB,KAAAA,IAAS,CAAA,GAAIa,QAAAA,CAASb,KAAAA,CAAAA,GAAS,EAAA,CAAA;AAClD;AA5CgBW,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;;;ACRT,SAASW,WAAWC,IAAAA,EAAY;AACrC,EAAA,OAAOA,IAAAA,CAAKC,MAAAA,CAAO,CAAA,CAAA,CAAGC,WAAAA,KAAgBF,IAAAA,CAAKG,KAAAA,CAAM,CAAA,CAAA,CAAGC,WAAAA,EAAW;AACjE;AAFgBL,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;;;ACET,SAASM,oBAAoBC,GAAAA,EAAwB;AAC1D,EAAA,OAAOtD,IAAAA,CAAKQ,GAAAA,CAAG,GAAI8C,GAAAA,CAAIC,GAAAA,CAAI,CAACC,EAAAA,KAAOA,EAAAA,CAAGjB,QAAAA,EAAQ,CAAGE,MAAM,CAAA,CAAA;AACzD;AAFgBY,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;;;ACAT,SAASI,mBAAmBC,IAAAA,EAAgB;AACjD,EAAA,IAAIA,IAAAA,CAAKjB,MAAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAE9B,EAAA,MAAMkB,QAAAA,GAAWD,KAAK,CAAA,CAAA;AACtB,EAAA,IAAI,CAACC,QAAAA,IAAYA,QAAAA,CAASlB,MAAAA,KAAW,GAAG,OAAO,EAAA;AAE/C,EAAA,IAAImB,KAAAA,GAAQ,EAAA;AACZ,EAAA,MAAMC,eAAyB,EAAA;AAG/B,EAAA,KAAA,IAASC,CAAAA,GAAI,CAAA,EAAGA,CAAAA,GAAIH,QAAAA,CAASlB,QAAQqB,CAAAA,EAAAA,EAAK;AACxC,IAAA,IAAIC,QAAAA,GAAW,CAAA;AACf,IAAA,KAAA,MAAWC,OAAON,IAAAA,EAAM;AACtB,MAAA,MAAMO,IAAAA,GAAOD,IAAIF,CAAAA,CAAAA;AACjB,MAAA,IAAIG,SAASC,MAAAA,EAAWH,QAAAA,GAAW/D,KAAKQ,GAAAA,CAAIuD,QAAAA,EAAUE,KAAKxB,MAAM,CAAA;AACnE,IAAA;AACAoB,IAAAA,YAAAA,CAAaM,KAAKJ,QAAAA,CAAAA;AACpB,EAAA;AAGA,EAAA,MAAMK,UAAAA,mBAAa,MAAA,CAAA,CAACC,IAAAA,EAAcC,IAAAA,EAAcC,WAAmBC,KAAAA,KAAAA;AACjE,IAAA,IAAIC,IAAAA,GAAOH,IAAAA;AACXT,IAAAA,YAAAA,CAAaa,OAAAA,CAAQ,CAACC,KAAAA,EAAOlD,KAAAA,KAAAA;AAC3BgD,MAAAA,IAAAA,IAAQJ,IAAAA,CAAKO,MAAAA,CAAOD,KAAAA,GAAQ,CAAA,CAAA;AAC5B,MAAA,IAAIlD,KAAAA,GAAQoC,YAAAA,CAAapB,MAAAA,GAAS,CAAA,EAAGgC,IAAAA,IAAQF,SAAAA;WACxCE,IAAAA,IAAQD,KAAAA;IACf,CAAA,CAAA;AACAC,IAAAA,IAAAA,IAAQ,IAAA;AACR,IAAA,OAAOA,IAAAA;EACT,CAAA,EATmB,YAAA,CAAA;AAYnBb,EAAAA,KAAAA,IAASQ,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;AAEnCV,EAAAA,IAAAA,CAAKgB,OAAAA,CAAQ,CAACV,GAAAA,EAAKa,QAAAA,KAAAA;AAEjBjB,IAAAA,KAAAA,IAAS,QAAA;AACTI,IAAAA,GAAAA,CAAIU,OAAAA,CAAQ,CAACT,IAAAA,EAAMa,WAAAA,KAAAA;AACjB,MAAA,MAAMC,WAAAA,GAAclB,aAAaiB,WAAAA,CAAAA;AACjC,MAAA,IAAIC,gBAAgBb,MAAAA,EAAWN,KAAAA,IAAS,IAAIK,IAAAA,CAAKe,MAAAA,CAAOD,WAAAA,CAAAA,CAAAA,OAAAA,CAAAA;IAC1D,CAAA,CAAA;AACAnB,IAAAA,KAAAA,IAAS,IAAA;AAGT,IAAA,IAAIiB,QAAAA,GAAWnB,KAAKjB,MAAAA,GAAS,CAAA,WAAY2B,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;AAC9DR,SAAAA,KAAAA,IAASQ,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;EAC1C,CAAA,CAAA;AAEA,EAAA,OAAOR,KAAAA;AACT;AAjDgBH,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;;;ACcT,SAASwB,QAAAA,CAASC,KAAa7C,IAAAA,EAAsB;AAC1D,EAAA,MAAMK,MAAAA,GAASwC,GAAAA,CACZpE,OAAAA,CAAQ,iBAAA,EAAmB,OAAA,EAC3BA,OAAAA,CAAQ,OAAA,EAAS,GAAA,CAAA,CACjBqE,IAAAA,EAAI;AAEP,EAAA,IAAI9C,IAAAA,EAAMU,UAAAA,EAAY,OAAOA,UAAAA,CAAWL,MAAAA,CAAAA;AAExC,EAAA,OAAOA,MAAAA;AACT;AATgBuC,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;;;ACLT,SAASG,gBAAAA,CAAiBC,WAAmBC,QAAAA,EAAgB;AAClE,EAAA,OAAA,CAAQA,QAAAA,GAAWD,YAAY,CAAA,GAAI,CAAA,CAAA,EAAIC,WAAWD,SAAAA,CAAAA,CAAAA,GAAcC,QAAAA,GAAWD,SAAAA,EAAW9C,QAAAA,EAAQ;AAChG;AAFgB6C,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;;;ACCT,SAASG,UAAkBC,KAAAA,EAAe;AAC/C,EAAA,MAAMC,KAAAA,GAAQD,MAAMrC,KAAAA,EAAK;AACzB,EAAA,KAAA,IAASW,IAAI2B,KAAAA,CAAMhD,MAAAA,GAAS,CAAA,EAAGqB,CAAAA,GAAI,GAAGA,CAAAA,EAAAA,EAAK;AACzC,IAAA,MAAM4B,IAAI1F,IAAAA,CAAKC,KAAAA,CAAMD,KAAKS,MAAAA,EAAM,IAAMqD,IAAI,CAAA,CAAA,CAAA;AAE1C,IAAA,CAAC2B,MAAM3B,CAAAA,CAAAA,EAAI2B,KAAAA,CAAMC,CAAAA,CAAE,CAAA,GAAI;AAACD,MAAAA,KAAAA,CAAMC,CAAAA,CAAAA;AAAID,MAAAA,KAAAA,CAAM3B,CAAAA;;AAC1C,EAAA;AACA,EAAA,OAAO2B,KAAAA;AACT;AARgBF,MAAAA,CAAAA,SAAAA,EAAAA,WAAAA,CAAAA;ACNT,SAASI,aAAaC,KAAAA,EAAgB;AAC3C,EAAA,OACEA,KAAAA,CAAMC,QAAM,KACXD,KAAAA,CAAME,KAAKlD,QAAAA,CAAS,KAAA,CAAA,IAAUgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,KAAA,CAAA,CAAA,IACnD,CAACgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,OAAA,KACrB,CAACgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,MAAA,CAAA;AAEzB;AAPgB+C,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAgBhB,eAAsBI,iBAAAA,CACpBC,GAAAA,EACAC,QAAAA,EACAC,MAAAA,EAAc;AAEd,EAAA,IAAIC,OAAAA;AAEJ,EAAA,IAAI;AACFA,IAAAA,OAAAA,GAAU,MAAMC,iBAAQJ,GAAAA,EAAK;MAAEK,aAAAA,EAAe;KAAK,CAAA;EACrD,CAAA,CAAA,MAAQ;AACNH,IAAAA,MAAAA,CAAOI,MAAM,+BAAA,CAAA;AACbH,IAAAA,OAAAA,GAAU,EAAA;AACZ,EAAA;AAEA,EAAA,KAAA,MAAWP,SAASO,OAAAA,EAAS;AAC3B,IAAA,MAAMI,QAAAA,GAAgBC,eAAAA,CAAAA,IAAAA,CAAKR,GAAAA,EAAKJ,KAAAA,CAAME,IAAI,CAAA;AAC1C,IAAA,MAAMW,YAAAA,GAAoBC,eAAAA,CAAAA,QAAAA,CAASC,OAAAA,CAAQC,GAAAA,IAAOL,QAAAA,CAAAA;AAElD,IAAA,IAAIX,KAAAA,CAAMiB,aAAW,EAAI;AACvB,MAAA,MAAMd,iBAAAA,CAAkBQ,QAAAA,EAAUN,QAAAA,EAAUC,MAAAA,CAAAA;IAC9C,CAAA,MAAA,IAAWP,YAAAA,CAAaC,KAAAA,CAAAA,EAAQ;AAC9B,MAAA,MAAMkB,QAAAA,GAAY,MAAM,OAAOP,QAAAA,CAAAA;AAC/B,MAAA,MAAMN,QAAAA,CAASM,QAAAA,EAAUE,YAAAA,EAAcK,QAAAA,CAAAA;AACzC,IAAA;AACF,EAAA;AACF;AAzBsBf,MAAAA,CAAAA,iBAAAA,EAAAA,mBAAAA,CAAAA","file":"index.cjs","sourcesContent":["/**\n * Return current time in seconds\n */\nexport function currentTime(): number {\n  return Math.floor(Date.now() / 1000);\n}\n","/**\n * Generates a random numeric code with the specified number of digits.\n *\n * @param digits - The number of digits for the generated code.\n * @returns A random numeric code with the specified number of digits.\n */\nexport function generateCode(digits: number): number {\n  const min = Math.pow(10, digits - 1);\n  const max = Math.pow(10, digits) - 1;\n  return Math.floor(Math.random() * (max - min + 1) + min);\n}\n","/**\n * Converts hexcode to number\n *\n * @param hex - The hex code to convert.\n * @returns The converted number.\n */\nexport function hexToNumber(hex: string): number {\n  if (typeof hex !== 'string') {\n    throw new TypeError('hexToNumber expects a string input');\n  }\n\n  const normalized = hex.replace(/^#/, '');\n  if (!/^[0-9a-fA-F]+$/.test(normalized)) {\n    throw new Error('Invalid hex string');\n  }\n\n  const converted = parseInt(normalized, 16);\n  if (Number.isNaN(converted)) {\n    throw new Error('Invalid hex string');\n  }\n\n  return converted;\n}\n","/**\n * Returns the ordinal suffix for a given number.\n *\n * @param n - The number to get the ordinal for\n * @returns The number with its ordinal suffix\n *\n * @example\n * ordinal(1); // \"1st\"\n * ordinal(22); // \"22nd\"\n * ordinal(13); // \"13th\"\n */\nexport function ordinal(n: number): string {\n  const s = ['th', 'st', 'nd', 'rd'];\n  const v = n % 100;\n  const index = (v - 20) % 10;\n  const suffix = s[index] ?? s[v] ?? s[0];\n  if (!suffix) return `${n}th`;\n\n  return `${n}${suffix}`;\n}\n","/**\n * Takes two numbers and returns the percentage of the first number in the second number with two decimal places.\n *\n * @param num1 - The first number.\n * @param num2 - The second number.\n *\n * @returns The percentage of the first number in the second number with two decimal places.\n */\n\nexport function percentage(num1: number, num2: number): number {\n  return Number(((num1 / num2) * 100).toFixed(2));\n}\n","/**\n * Rounds a number to a specified number of decimal places.\n *\n * @param num - The number to be rounded.\n * @param precision - The number of decimal places to round to.\n * @returns The rounded number.\n */\n\nexport function round(num: number, precision: number): number {\n  const factor = Math.pow(10, precision);\n  return Math.round((num + Number.EPSILON) * factor) / factor;\n}\n","import type { TupleOf } from '@seedcord/types';\n\n/**\n * Rounds a number to a string representation with a denomination suffix.\n * @param num - The number to round.\n * @example\n * ```ts\n * roundToDenomination(1234); // \"1.2K\"\n * roundToDenomination(10000, ['k', 'm', 'b', 't', 'q']); // \"10k\"\n * roundToDenomination(12345678); // \"12.3M\"\n * ```\n * @returns The rounded number as a string with a denomination suffix.\n */\nexport function roundToDenomination(\n  num: number,\n  opts?: {\n    suffixes?: TupleOf<string, 5>;\n    precision?: number;\n  }\n): string {\n  const { suffixes = ['K', 'M', 'B', 'T', 'Q'], precision = 1 } = opts ?? {};\n\n  if (num < 10000) {\n    return num.toString();\n  }\n\n  let index = -1;\n  let temp = num;\n\n  while (temp >= 1000 && index < suffixes.length - 1) {\n    temp /= 1000;\n    index++;\n  }\n\n  let result;\n\n  if (temp % 1 === 0) {\n    result = temp.toString();\n  } else {\n    const adjustedTemp = Math.round(temp * Math.pow(10, precision + 1)) / Math.pow(10, precision + 1);\n    result = adjustedTemp.toFixed(precision);\n  }\n\n  if (result.endsWith('.9')) {\n    result = Math.ceil(Number(result)).toString();\n  }\n\n  if (result.endsWith('.0')) {\n    result = result.substring(0, result.length - 2);\n  }\n\n  if (result === '1000') {\n    index += 1;\n    result = '1';\n  }\n\n  return result + (index >= 0 ? suffixes[index] : '');\n}\n","/**\n * Returns the word with it's first letter capitalized and the rest in lowercase.\n * @param word - The word to be formatted.\n * @returns The formatted word.\n */\nexport function capitalize(word: string): string {\n  return word.charAt(0).toUpperCase() + word.slice(1).toLowerCase();\n}\n","/**\n * Function takes an array of strings or numbers and returns the number of characters in the longest string/number\n *\n * @param arr - The array of strings or numbers\n * @returns The length of the longest element when converted to string\n */\n\nexport function longestStringLength(arr: (string | number)[]): number {\n  return Math.max(...arr.map((el) => el.toString().length));\n}\n","/**\n * Generates an ASCII table from the provided data.\n *\n * @param data - The data to be displayed in the table.\n * @returns The generated ASCII table as a string.\n */\n\nexport function generateAsciiTable(data: string[][]): string {\n  if (data.length === 0) return '';\n\n  const firstRow = data[0];\n  if (!firstRow || firstRow.length === 0) return '';\n\n  let table = '';\n  const columnWidths: number[] = [];\n\n  // Determine the maximum width for each column\n  for (let i = 0; i < firstRow.length; i++) {\n    let maxWidth = 0;\n    for (const row of data) {\n      const cell = row[i];\n      if (cell !== undefined) maxWidth = Math.max(maxWidth, cell.length);\n    }\n    columnWidths.push(maxWidth);\n  }\n\n  // Function to create a horizontal line\n  const createLine = (char: string, left: string, intersect: string, right: string): string => {\n    let line = left;\n    columnWidths.forEach((width, index) => {\n      line += char.repeat(width + 2);\n      if (index < columnWidths.length - 1) line += intersect;\n      else line += right;\n    });\n    line += '\\n';\n    return line;\n  };\n\n  // Top border\n  table += createLine('═', '╔', '╦', '╗');\n\n  data.forEach((row, rowIndex) => {\n    // Row content\n    table += '║';\n    row.forEach((cell, columnIndex) => {\n      const columnWidth = columnWidths[columnIndex];\n      if (columnWidth !== undefined) table += ` ${cell.padEnd(columnWidth)} ║`;\n    });\n    table += '\\n';\n\n    // Separator or bottom border\n    if (rowIndex < data.length - 1) table += createLine('─', '╠', '╬', '╣');\n    else table += createLine('═', '╚', '╩', '╝');\n  });\n\n  return table;\n}\n","import { capitalize } from './capitalize';\n\ninterface PrettifyOptions {\n  capitalize?: boolean;\n}\n/**\n * Converts a string from any common naming convention to human-readable format.\n * Handles camelCase, PascalCase, snake_case, and kebab-case.\n *\n * @param key - The string to convert\n * @param opts - Optional configuration\n * @returns A space-separated, human-readable string\n *\n * @example\n * prettify(\"camelCaseString\") // \"camel Case String\"\n * prettify(\"PascalCaseString\") // \"Pascal Case String\"\n * prettify(\"snake_case_string\") // \"snake case string\"\n * prettify(\"kebab-case-string\") // \"kebab case string\"\n * prettify(\"mixedCase_string-name\") // \"mixed Case string name\"\n */\n\nexport function prettify(key: string, opts?: PrettifyOptions): string {\n  const result = key\n    .replace(/([a-z])([A-Z])/g, '$1 $2') // camelCase/PascalCase\n    .replace(/[_-]/g, ' ') // snake_case and kebab-case\n    .trim();\n\n  if (opts?.capitalize) return capitalize(result);\n\n  return result;\n}\n","/**\n * Calculates the difference between two numbers and formats it as a string with a '+' prefix for positive differences.\n *\n * @param numBefore - The initial number value\n * @param numAfter - The final number value\n * @returns A string representing the difference, with a '+' sign for positive differences\n *\n * @example\n * // Returns \"+5\"\n * prettyDifference(10, 15);\n *\n * @example\n * // Returns \"-3\"\n * prettyDifference(10, 7);\n */\n\nexport function prettyDifference(numBefore: number, numAfter: number): string {\n  return (numAfter - numBefore > 0 ? `+${numAfter - numBefore}` : numAfter - numBefore).toString();\n}\n","/**\n * Shuffles an array using the Fisher-Yates algorithm.\n * This function creates a new array with the same elements in a random order,\n * without modifying the original array.\n *\n * @typeParam TArray - The type of elements in the array\n * @param items - The array to shuffle\n * @returns A new array with the same elements in a random order\n *\n * @example\n * ```typescript\n * const numbers = [1, 2, 3, 4, 5];\n * const shuffled = fyShuffle(numbers);\n * // shuffled might be [3, 1, 5, 2, 4]\n * // numbers is still [1, 2, 3, 4, 5]\n * ```\n */\nexport function fyShuffle<TArray>(items: TArray[]): TArray[] {\n  const array = items.slice();\n  for (let i = array.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    // @ts-expect-error - TypeScript doesn't recognize that TArray can be swapped\n    [array[i], array[j]] = [array[j], array[i]];\n  }\n  return array;\n}\n","import { readdir } from 'node:fs/promises';\nimport * as path from 'node:path';\n\nimport type { Logger } from '@seedcord/services';\nimport type * as fs from 'node:fs';\n/**\n * Determines if a directory entry is a TypeScript or JavaScript file.\n *\n * @param entry - The directory entry to check.\n * @returns True if the entry is a file ending with .ts or .js.\n */\nexport function isTsOrJsFile(entry: fs.Dirent): boolean {\n  return (\n    entry.isFile() &&\n    (entry.name.endsWith('.ts') || entry.name.endsWith('.js')) &&\n    !entry.name.endsWith('.d.ts') &&\n    !entry.name.endsWith('.map')\n  );\n}\n\n/**\n * Recursively traverses through a directory, importing all .ts and .js files and applying a callback to each import.\n *\n * @param dir - The directory path to traverse.\n * @param callback - A function that will be called for each imported module. It receives the full file path, the file's relative path, and the imported module as arguments.\n * @returns A Promise that resolves when the traversal is complete.\n */\nexport async function traverseDirectory(\n  dir: string,\n  callback: (fullPath: string, relativePath: string, imported: Record<string, unknown>) => Promise<void> | void,\n  logger: Logger\n): Promise<void> {\n  let entries: fs.Dirent[];\n\n  try {\n    entries = await readdir(dir, { withFileTypes: true });\n  } catch {\n    logger.error('Failed to read this directory');\n    entries = [];\n  }\n\n  for (const entry of entries) {\n    const fullPath = path.join(dir, entry.name);\n    const relativePath = path.relative(process.cwd(), fullPath);\n\n    if (entry.isDirectory()) {\n      await traverseDirectory(fullPath, callback, logger);\n    } else if (isTsOrJsFile(entry)) {\n      const imported = (await import(fullPath)) as Record<string, unknown>;\n      await callback(fullPath, relativePath, imported);\n    }\n  }\n}\n"]}

package/dist/index.d.cts

@@ -0,0 +1,169 @@
+import { TupleOf } from '@seedcord/types';
+import { Logger } from '@seedcord/services';
+import * as fs from 'node:fs';
+
+/**
+ * Return current time in seconds
+ */
+declare function currentTime(): number;
+
+/**
+ * Generates a random numeric code with the specified number of digits.
+ *
+ * @param digits - The number of digits for the generated code.
+ * @returns A random numeric code with the specified number of digits.
+ */
+declare function generateCode(digits: number): number;
+
+/**
+ * Converts hexcode to number
+ *
+ * @param hex - The hex code to convert.
+ * @returns The converted number.
+ */
+declare function hexToNumber(hex: string): number;
+
+/**
+ * Returns the ordinal suffix for a given number.
+ *
+ * @param n - The number to get the ordinal for
+ * @returns The number with its ordinal suffix
+ *
+ * @example
+ * ordinal(1); // "1st"
+ * ordinal(22); // "22nd"
+ * ordinal(13); // "13th"
+ */
+declare function ordinal(n: number): string;
+
+/**
+ * Takes two numbers and returns the percentage of the first number in the second number with two decimal places.
+ *
+ * @param num1 - The first number.
+ * @param num2 - The second number.
+ *
+ * @returns The percentage of the first number in the second number with two decimal places.
+ */
+declare function percentage(num1: number, num2: number): number;
+
+/**
+ * Rounds a number to a specified number of decimal places.
+ *
+ * @param num - The number to be rounded.
+ * @param precision - The number of decimal places to round to.
+ * @returns The rounded number.
+ */
+declare function round(num: number, precision: number): number;
+
+/**
+ * Rounds a number to a string representation with a denomination suffix.
+ * @param num - The number to round.
+ * @example
+ * ```ts
+ * roundToDenomination(1234); // "1.2K"
+ * roundToDenomination(10000, ['k', 'm', 'b', 't', 'q']); // "10k"
+ * roundToDenomination(12345678); // "12.3M"
+ * ```
+ * @returns The rounded number as a string with a denomination suffix.
+ */
+declare function roundToDenomination(num: number, opts?: {
+    suffixes?: TupleOf<string, 5>;
+    precision?: number;
+}): string;
+
+/**
+ * Returns the word with it's first letter capitalized and the rest in lowercase.
+ * @param word - The word to be formatted.
+ * @returns The formatted word.
+ */
+declare function capitalize(word: string): string;
+
+/**
+ * Function takes an array of strings or numbers and returns the number of characters in the longest string/number
+ *
+ * @param arr - The array of strings or numbers
+ * @returns The length of the longest element when converted to string
+ */
+declare function longestStringLength(arr: (string | number)[]): number;
+
+/**
+ * Generates an ASCII table from the provided data.
+ *
+ * @param data - The data to be displayed in the table.
+ * @returns The generated ASCII table as a string.
+ */
+declare function generateAsciiTable(data: string[][]): string;
+
+interface PrettifyOptions {
+    capitalize?: boolean;
+}
+/**
+ * Converts a string from any common naming convention to human-readable format.
+ * Handles camelCase, PascalCase, snake_case, and kebab-case.
+ *
+ * @param key - The string to convert
+ * @param opts - Optional configuration
+ * @returns A space-separated, human-readable string
+ *
+ * @example
+ * prettify("camelCaseString") // "camel Case String"
+ * prettify("PascalCaseString") // "Pascal Case String"
+ * prettify("snake_case_string") // "snake case string"
+ * prettify("kebab-case-string") // "kebab case string"
+ * prettify("mixedCase_string-name") // "mixed Case string name"
+ */
+declare function prettify(key: string, opts?: PrettifyOptions): string;
+
+/**
+ * Calculates the difference between two numbers and formats it as a string with a '+' prefix for positive differences.
+ *
+ * @param numBefore - The initial number value
+ * @param numAfter - The final number value
+ * @returns A string representing the difference, with a '+' sign for positive differences
+ *
+ * @example
+ * // Returns "+5"
+ * prettyDifference(10, 15);
+ *
+ * @example
+ * // Returns "-3"
+ * prettyDifference(10, 7);
+ */
+declare function prettyDifference(numBefore: number, numAfter: number): string;
+
+/**
+ * Shuffles an array using the Fisher-Yates algorithm.
+ * This function creates a new array with the same elements in a random order,
+ * without modifying the original array.
+ *
+ * @typeParam TArray - The type of elements in the array
+ * @param items - The array to shuffle
+ * @returns A new array with the same elements in a random order
+ *
+ * @example
+ * ```typescript
+ * const numbers = [1, 2, 3, 4, 5];
+ * const shuffled = fyShuffle(numbers);
+ * // shuffled might be [3, 1, 5, 2, 4]
+ * // numbers is still [1, 2, 3, 4, 5]
+ * ```
+ */
+declare function fyShuffle<TArray>(items: TArray[]): TArray[];
+
+/**
+ * Determines if a directory entry is a TypeScript or JavaScript file.
+ *
+ * @param entry - The directory entry to check.
+ * @returns True if the entry is a file ending with .ts or .js.
+ */
+declare function isTsOrJsFile(entry: fs.Dirent): boolean;
+/**
+ * Recursively traverses through a directory, importing all .ts and .js files and applying a callback to each import.
+ *
+ * @param dir - The directory path to traverse.
+ * @param callback - A function that will be called for each imported module. It receives the full file path, the file's relative path, and the imported module as arguments.
+ * @returns A Promise that resolves when the traversal is complete.
+ */
+declare function traverseDirectory(dir: string, callback: (fullPath: string, relativePath: string, imported: Record<string, unknown>) => Promise<void> | void, logger: Logger): Promise<void>;
+
+export { capitalize, currentTime, fyShuffle, generateAsciiTable, generateCode, hexToNumber, isTsOrJsFile, longestStringLength, ordinal, percentage, prettify, prettyDifference, round, roundToDenomination, traverseDirectory };

package/dist/index.d.mts

@@ -0,0 +1,169 @@
+import { TupleOf } from '@seedcord/types';
+import { Logger } from '@seedcord/services';
+import * as fs from 'node:fs';
+
+/**
+ * Return current time in seconds
+ */
+declare function currentTime(): number;
+
+/**
+ * Generates a random numeric code with the specified number of digits.
+ *
+ * @param digits - The number of digits for the generated code.
+ * @returns A random numeric code with the specified number of digits.
+ */
+declare function generateCode(digits: number): number;
+
+/**
+ * Converts hexcode to number
+ *
+ * @param hex - The hex code to convert.
+ * @returns The converted number.
+ */
+declare function hexToNumber(hex: string): number;
+
+/**
+ * Returns the ordinal suffix for a given number.
+ *
+ * @param n - The number to get the ordinal for
+ * @returns The number with its ordinal suffix
+ *
+ * @example
+ * ordinal(1); // "1st"
+ * ordinal(22); // "22nd"
+ * ordinal(13); // "13th"
+ */
+declare function ordinal(n: number): string;
+
+/**
+ * Takes two numbers and returns the percentage of the first number in the second number with two decimal places.
+ *
+ * @param num1 - The first number.
+ * @param num2 - The second number.
+ *
+ * @returns The percentage of the first number in the second number with two decimal places.
+ */
+declare function percentage(num1: number, num2: number): number;
+
+/**
+ * Rounds a number to a specified number of decimal places.
+ *
+ * @param num - The number to be rounded.
+ * @param precision - The number of decimal places to round to.
+ * @returns The rounded number.
+ */
+declare function round(num: number, precision: number): number;
+
+/**
+ * Rounds a number to a string representation with a denomination suffix.
+ * @param num - The number to round.
+ * @example
+ * ```ts
+ * roundToDenomination(1234); // "1.2K"
+ * roundToDenomination(10000, ['k', 'm', 'b', 't', 'q']); // "10k"
+ * roundToDenomination(12345678); // "12.3M"
+ * ```
+ * @returns The rounded number as a string with a denomination suffix.
+ */
+declare function roundToDenomination(num: number, opts?: {
+    suffixes?: TupleOf<string, 5>;
+    precision?: number;
+}): string;
+
+/**
+ * Returns the word with it's first letter capitalized and the rest in lowercase.
+ * @param word - The word to be formatted.
+ * @returns The formatted word.
+ */
+declare function capitalize(word: string): string;
+
+/**
+ * Function takes an array of strings or numbers and returns the number of characters in the longest string/number
+ *
+ * @param arr - The array of strings or numbers
+ * @returns The length of the longest element when converted to string
+ */
+declare function longestStringLength(arr: (string | number)[]): number;
+
+/**
+ * Generates an ASCII table from the provided data.
+ *
+ * @param data - The data to be displayed in the table.
+ * @returns The generated ASCII table as a string.
+ */
+declare function generateAsciiTable(data: string[][]): string;
+
+interface PrettifyOptions {
+    capitalize?: boolean;
+}
+/**
+ * Converts a string from any common naming convention to human-readable format.
+ * Handles camelCase, PascalCase, snake_case, and kebab-case.
+ *
+ * @param key - The string to convert
+ * @param opts - Optional configuration
+ * @returns A space-separated, human-readable string
+ *
+ * @example
+ * prettify("camelCaseString") // "camel Case String"
+ * prettify("PascalCaseString") // "Pascal Case String"
+ * prettify("snake_case_string") // "snake case string"
+ * prettify("kebab-case-string") // "kebab case string"
+ * prettify("mixedCase_string-name") // "mixed Case string name"
+ */
+declare function prettify(key: string, opts?: PrettifyOptions): string;
+
+/**
+ * Calculates the difference between two numbers and formats it as a string with a '+' prefix for positive differences.
+ *
+ * @param numBefore - The initial number value
+ * @param numAfter - The final number value
+ * @returns A string representing the difference, with a '+' sign for positive differences
+ *
+ * @example
+ * // Returns "+5"
+ * prettyDifference(10, 15);
+ *
+ * @example
+ * // Returns "-3"
+ * prettyDifference(10, 7);
+ */
+declare function prettyDifference(numBefore: number, numAfter: number): string;
+
+/**
+ * Shuffles an array using the Fisher-Yates algorithm.
+ * This function creates a new array with the same elements in a random order,
+ * without modifying the original array.
+ *
+ * @typeParam TArray - The type of elements in the array
+ * @param items - The array to shuffle
+ * @returns A new array with the same elements in a random order
+ *
+ * @example
+ * ```typescript
+ * const numbers = [1, 2, 3, 4, 5];
+ * const shuffled = fyShuffle(numbers);
+ * // shuffled might be [3, 1, 5, 2, 4]
+ * // numbers is still [1, 2, 3, 4, 5]
+ * ```
+ */
+declare function fyShuffle<TArray>(items: TArray[]): TArray[];
+
+/**
+ * Determines if a directory entry is a TypeScript or JavaScript file.
+ *
+ * @param entry - The directory entry to check.
+ * @returns True if the entry is a file ending with .ts or .js.
+ */
+declare function isTsOrJsFile(entry: fs.Dirent): boolean;
+/**
+ * Recursively traverses through a directory, importing all .ts and .js files and applying a callback to each import.
+ *
+ * @param dir - The directory path to traverse.
+ * @param callback - A function that will be called for each imported module. It receives the full file path, the file's relative path, and the imported module as arguments.
+ * @returns A Promise that resolves when the traversal is complete.
+ */
+declare function traverseDirectory(dir: string, callback: (fullPath: string, relativePath: string, imported: Record<string, unknown>) => Promise<void> | void, logger: Logger): Promise<void>;
+
+export { capitalize, currentTime, fyShuffle, generateAsciiTable, generateCode, hexToNumber, isTsOrJsFile, longestStringLength, ordinal, percentage, prettify, prettyDifference, round, roundToDenomination, traverseDirectory };

package/dist/index.d.ts

@@ -0,0 +1,169 @@
+import { TupleOf } from '@seedcord/types';
+import { Logger } from '@seedcord/services';
+import * as fs from 'node:fs';
+
+/**
+ * Return current time in seconds
+ */
+declare function currentTime(): number;
+
+/**
+ * Generates a random numeric code with the specified number of digits.
+ *
+ * @param digits - The number of digits for the generated code.
+ * @returns A random numeric code with the specified number of digits.
+ */
+declare function generateCode(digits: number): number;
+
+/**
+ * Converts hexcode to number
+ *
+ * @param hex - The hex code to convert.
+ * @returns The converted number.
+ */
+declare function hexToNumber(hex: string): number;
+
+/**
+ * Returns the ordinal suffix for a given number.
+ *
+ * @param n - The number to get the ordinal for
+ * @returns The number with its ordinal suffix
+ *
+ * @example
+ * ordinal(1); // "1st"
+ * ordinal(22); // "22nd"
+ * ordinal(13); // "13th"
+ */
+declare function ordinal(n: number): string;
+
+/**
+ * Takes two numbers and returns the percentage of the first number in the second number with two decimal places.
+ *
+ * @param num1 - The first number.
+ * @param num2 - The second number.
+ *
+ * @returns The percentage of the first number in the second number with two decimal places.
+ */
+declare function percentage(num1: number, num2: number): number;
+
+/**
+ * Rounds a number to a specified number of decimal places.
+ *
+ * @param num - The number to be rounded.
+ * @param precision - The number of decimal places to round to.
+ * @returns The rounded number.
+ */
+declare function round(num: number, precision: number): number;
+
+/**
+ * Rounds a number to a string representation with a denomination suffix.
+ * @param num - The number to round.
+ * @example
+ * ```ts
+ * roundToDenomination(1234); // "1.2K"
+ * roundToDenomination(10000, ['k', 'm', 'b', 't', 'q']); // "10k"
+ * roundToDenomination(12345678); // "12.3M"
+ * ```
+ * @returns The rounded number as a string with a denomination suffix.
+ */
+declare function roundToDenomination(num: number, opts?: {
+    suffixes?: TupleOf<string, 5>;
+    precision?: number;
+}): string;
+
+/**
+ * Returns the word with it's first letter capitalized and the rest in lowercase.
+ * @param word - The word to be formatted.
+ * @returns The formatted word.
+ */
+declare function capitalize(word: string): string;
+
+/**
+ * Function takes an array of strings or numbers and returns the number of characters in the longest string/number
+ *
+ * @param arr - The array of strings or numbers
+ * @returns The length of the longest element when converted to string
+ */
+declare function longestStringLength(arr: (string | number)[]): number;
+
+/**
+ * Generates an ASCII table from the provided data.
+ *
+ * @param data - The data to be displayed in the table.
+ * @returns The generated ASCII table as a string.
+ */
+declare function generateAsciiTable(data: string[][]): string;
+
+interface PrettifyOptions {
+    capitalize?: boolean;
+}
+/**
+ * Converts a string from any common naming convention to human-readable format.
+ * Handles camelCase, PascalCase, snake_case, and kebab-case.
+ *
+ * @param key - The string to convert
+ * @param opts - Optional configuration
+ * @returns A space-separated, human-readable string
+ *
+ * @example
+ * prettify("camelCaseString") // "camel Case String"
+ * prettify("PascalCaseString") // "Pascal Case String"
+ * prettify("snake_case_string") // "snake case string"
+ * prettify("kebab-case-string") // "kebab case string"
+ * prettify("mixedCase_string-name") // "mixed Case string name"
+ */
+declare function prettify(key: string, opts?: PrettifyOptions): string;
+
+/**
+ * Calculates the difference between two numbers and formats it as a string with a '+' prefix for positive differences.
+ *
+ * @param numBefore - The initial number value
+ * @param numAfter - The final number value
+ * @returns A string representing the difference, with a '+' sign for positive differences
+ *
+ * @example
+ * // Returns "+5"
+ * prettyDifference(10, 15);
+ *
+ * @example
+ * // Returns "-3"
+ * prettyDifference(10, 7);
+ */
+declare function prettyDifference(numBefore: number, numAfter: number): string;
+
+/**
+ * Shuffles an array using the Fisher-Yates algorithm.
+ * This function creates a new array with the same elements in a random order,
+ * without modifying the original array.
+ *
+ * @typeParam TArray - The type of elements in the array
+ * @param items - The array to shuffle
+ * @returns A new array with the same elements in a random order
+ *
+ * @example
+ * ```typescript
+ * const numbers = [1, 2, 3, 4, 5];
+ * const shuffled = fyShuffle(numbers);
+ * // shuffled might be [3, 1, 5, 2, 4]
+ * // numbers is still [1, 2, 3, 4, 5]
+ * ```
+ */
+declare function fyShuffle<TArray>(items: TArray[]): TArray[];
+
+/**
+ * Determines if a directory entry is a TypeScript or JavaScript file.
+ *
+ * @param entry - The directory entry to check.
+ * @returns True if the entry is a file ending with .ts or .js.
+ */
+declare function isTsOrJsFile(entry: fs.Dirent): boolean;
+/**
+ * Recursively traverses through a directory, importing all .ts and .js files and applying a callback to each import.
+ *
+ * @param dir - The directory path to traverse.
+ * @param callback - A function that will be called for each imported module. It receives the full file path, the file's relative path, and the imported module as arguments.
+ * @returns A Promise that resolves when the traversal is complete.
+ */
+declare function traverseDirectory(dir: string, callback: (fullPath: string, relativePath: string, imported: Record<string, unknown>) => Promise<void> | void, logger: Logger): Promise<void>;
+
+export { capitalize, currentTime, fyShuffle, generateAsciiTable, generateCode, hexToNumber, isTsOrJsFile, longestStringLength, ordinal, percentage, prettify, prettyDifference, round, roundToDenomination, traverseDirectory };

package/dist/index.mjs

@@ -0,0 +1,214 @@
+import { readdir } from 'fs/promises';
+import * as path from 'path';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// src/numbers/currentTime.ts
+function currentTime() {
+  return Math.floor(Date.now() / 1e3);
+}
+__name(currentTime, "currentTime");
+
+// src/numbers/generateCode.ts
+function generateCode(digits) {
+  const min = Math.pow(10, digits - 1);
+  const max = Math.pow(10, digits) - 1;
+  return Math.floor(Math.random() * (max - min + 1) + min);
+}
+__name(generateCode, "generateCode");
+
+// src/numbers/hexToNumber.ts
+function hexToNumber(hex) {
+  if (typeof hex !== "string") {
+    throw new TypeError("hexToNumber expects a string input");
+  }
+  const normalized = hex.replace(/^#/, "");
+  if (!/^[0-9a-fA-F]+$/.test(normalized)) {
+    throw new Error("Invalid hex string");
+  }
+  const converted = parseInt(normalized, 16);
+  if (Number.isNaN(converted)) {
+    throw new Error("Invalid hex string");
+  }
+  return converted;
+}
+__name(hexToNumber, "hexToNumber");
+
+// src/numbers/ordinal.ts
+function ordinal(n) {
+  const s = [
+    "th",
+    "st",
+    "nd",
+    "rd"
+  ];
+  const v = n % 100;
+  const index = (v - 20) % 10;
+  const suffix = s[index] ?? s[v] ?? s[0];
+  if (!suffix) return `${n}th`;
+  return `${n}${suffix}`;
+}
+__name(ordinal, "ordinal");
+
+// src/numbers/percentage.ts
+function percentage(num1, num2) {
+  return Number((num1 / num2 * 100).toFixed(2));
+}
+__name(percentage, "percentage");
+
+// src/numbers/round.ts
+function round(num, precision) {
+  const factor = Math.pow(10, precision);
+  return Math.round((num + Number.EPSILON) * factor) / factor;
+}
+__name(round, "round");
+
+// src/numbers/roundToDenomination.ts
+function roundToDenomination(num, opts) {
+  const { suffixes = [
+    "K",
+    "M",
+    "B",
+    "T",
+    "Q"
+  ], precision = 1 } = opts ?? {};
+  if (num < 1e4) {
+    return num.toString();
+  }
+  let index = -1;
+  let temp = num;
+  while (temp >= 1e3 && index < suffixes.length - 1) {
+    temp /= 1e3;
+    index++;
+  }
+  let result;
+  if (temp % 1 === 0) {
+    result = temp.toString();
+  } else {
+    const adjustedTemp = Math.round(temp * Math.pow(10, precision + 1)) / Math.pow(10, precision + 1);
+    result = adjustedTemp.toFixed(precision);
+  }
+  if (result.endsWith(".9")) {
+    result = Math.ceil(Number(result)).toString();
+  }
+  if (result.endsWith(".0")) {
+    result = result.substring(0, result.length - 2);
+  }
+  if (result === "1000") {
+    index += 1;
+    result = "1";
+  }
+  return result + (index >= 0 ? suffixes[index] : "");
+}
+__name(roundToDenomination, "roundToDenomination");
+
+// src/strings/capitalize.ts
+function capitalize(word) {
+  return word.charAt(0).toUpperCase() + word.slice(1).toLowerCase();
+}
+__name(capitalize, "capitalize");
+
+// src/strings/longestStringLength.ts
+function longestStringLength(arr) {
+  return Math.max(...arr.map((el) => el.toString().length));
+}
+__name(longestStringLength, "longestStringLength");
+
+// src/strings/generateAsciiTable.ts
+function generateAsciiTable(data) {
+  if (data.length === 0) return "";
+  const firstRow = data[0];
+  if (!firstRow || firstRow.length === 0) return "";
+  let table = "";
+  const columnWidths = [];
+  for (let i = 0; i < firstRow.length; i++) {
+    let maxWidth = 0;
+    for (const row of data) {
+      const cell = row[i];
+      if (cell !== void 0) maxWidth = Math.max(maxWidth, cell.length);
+    }
+    columnWidths.push(maxWidth);
+  }
+  const createLine = /* @__PURE__ */ __name((char, left, intersect, right) => {
+    let line = left;
+    columnWidths.forEach((width, index) => {
+      line += char.repeat(width + 2);
+      if (index < columnWidths.length - 1) line += intersect;
+      else line += right;
+    });
+    line += "\n";
+    return line;
+  }, "createLine");
+  table += createLine("\u2550", "\u2554", "\u2566", "\u2557");
+  data.forEach((row, rowIndex) => {
+    table += "\u2551";
+    row.forEach((cell, columnIndex) => {
+      const columnWidth = columnWidths[columnIndex];
+      if (columnWidth !== void 0) table += ` ${cell.padEnd(columnWidth)} \u2551`;
+    });
+    table += "\n";
+    if (rowIndex < data.length - 1) table += createLine("\u2500", "\u2560", "\u256C", "\u2563");
+    else table += createLine("\u2550", "\u255A", "\u2569", "\u255D");
+  });
+  return table;
+}
+__name(generateAsciiTable, "generateAsciiTable");
+
+// src/strings/prettify.ts
+function prettify(key, opts) {
+  const result = key.replace(/([a-z])([A-Z])/g, "$1 $2").replace(/[_-]/g, " ").trim();
+  if (opts?.capitalize) return capitalize(result);
+  return result;
+}
+__name(prettify, "prettify");
+
+// src/strings/prettyDifference.ts
+function prettyDifference(numBefore, numAfter) {
+  return (numAfter - numBefore > 0 ? `+${numAfter - numBefore}` : numAfter - numBefore).toString();
+}
+__name(prettyDifference, "prettyDifference");
+
+// src/fyShuffle.ts
+function fyShuffle(items) {
+  const array = items.slice();
+  for (let i = array.length - 1; i > 0; i--) {
+    const j = Math.floor(Math.random() * (i + 1));
+    [array[i], array[j]] = [
+      array[j],
+      array[i]
+    ];
+  }
+  return array;
+}
+__name(fyShuffle, "fyShuffle");
+function isTsOrJsFile(entry) {
+  return entry.isFile() && (entry.name.endsWith(".ts") || entry.name.endsWith(".js")) && !entry.name.endsWith(".d.ts") && !entry.name.endsWith(".map");
+}
+__name(isTsOrJsFile, "isTsOrJsFile");
+async function traverseDirectory(dir, callback, logger) {
+  let entries;
+  try {
+    entries = await readdir(dir, {
+      withFileTypes: true
+    });
+  } catch {
+    logger.error("Failed to read this directory");
+    entries = [];
+  }
+  for (const entry of entries) {
+    const fullPath = path.join(dir, entry.name);
+    const relativePath = path.relative(process.cwd(), fullPath);
+    if (entry.isDirectory()) {
+      await traverseDirectory(fullPath, callback, logger);
+    } else if (isTsOrJsFile(entry)) {
+      const imported = await import(fullPath);
+      await callback(fullPath, relativePath, imported);
+    }
+  }
+}
+__name(traverseDirectory, "traverseDirectory");
+
+export { capitalize, currentTime, fyShuffle, generateAsciiTable, generateCode, hexToNumber, isTsOrJsFile, longestStringLength, ordinal, percentage, prettify, prettyDifference, round, roundToDenomination, traverseDirectory };
+//# sourceMappingURL=index.mjs.map
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/numbers/currentTime.ts","../src/numbers/generateCode.ts","../src/numbers/hexToNumber.ts","../src/numbers/ordinal.ts","../src/numbers/percentage.ts","../src/numbers/round.ts","../src/numbers/roundToDenomination.ts","../src/strings/capitalize.ts","../src/strings/longestStringLength.ts","../src/strings/generateAsciiTable.ts","../src/strings/prettify.ts","../src/strings/prettyDifference.ts","../src/fyShuffle.ts","../src/directory.ts"],"names":["currentTime","Math","floor","Date","now","generateCode","digits","min","pow","max","random","hexToNumber","hex","TypeError","normalized","replace","test","Error","converted","parseInt","Number","isNaN","ordinal","n","s","v","index","suffix","percentage","num1","num2","toFixed","round","num","precision","factor","EPSILON","roundToDenomination","opts","suffixes","toString","temp","length","result","adjustedTemp","endsWith","ceil","substring","capitalize","word","charAt","toUpperCase","slice","toLowerCase","longestStringLength","arr","map","el","generateAsciiTable","data","firstRow","table","columnWidths","i","maxWidth","row","cell","undefined","push","createLine","char","left","intersect","right","line","forEach","width","repeat","rowIndex","columnIndex","columnWidth","padEnd","prettify","key","trim","prettyDifference","numBefore","numAfter","fyShuffle","items","array","j","isTsOrJsFile","entry","isFile","name","traverseDirectory","dir","callback","logger","entries","readdir","withFileTypes","error","fullPath","join","relativePath","relative","process","cwd","isDirectory","imported"],"mappings":";;;;;;;AAGO,SAASA,WAAAA,GAAAA;AACd,EAAA,OAAOC,IAAAA,CAAKC,KAAAA,CAAMC,IAAAA,CAAKC,GAAAA,KAAQ,GAAA,CAAA;AACjC;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;;;ACGT,SAASK,aAAaC,MAAAA,EAAc;AACzC,EAAA,MAAMC,GAAAA,GAAMN,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAIF,SAAS,CAAA,CAAA;AAClC,EAAA,MAAMG,GAAAA,GAAMR,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAIF,MAAAA,CAAAA,GAAU,CAAA;AACnC,EAAA,OAAOL,IAAAA,CAAKC,MAAMD,IAAAA,CAAKS,MAAAA,MAAYD,GAAAA,GAAMF,GAAAA,GAAM,KAAKA,GAAAA,CAAAA;AACtD;AAJgBF,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;;;ACAT,SAASM,YAAYC,GAAAA,EAAW;AACrC,EAAA,IAAI,OAAOA,QAAQ,QAAA,EAAU;AAC3B,IAAA,MAAM,IAAIC,UAAU,oCAAA,CAAA;AACtB,EAAA;AAEA,EAAA,MAAMC,UAAAA,GAAaF,GAAAA,CAAIG,OAAAA,CAAQ,IAAA,EAAM,EAAA,CAAA;AACrC,EAAA,IAAI,CAAC,gBAAA,CAAiBC,IAAAA,CAAKF,UAAAA,CAAAA,EAAa;AACtC,IAAA,MAAM,IAAIG,MAAM,oBAAA,CAAA;AAClB,EAAA;AAEA,EAAA,MAAMC,SAAAA,GAAYC,QAAAA,CAASL,UAAAA,EAAY,EAAA,CAAA;AACvC,EAAA,IAAIM,MAAAA,CAAOC,KAAAA,CAAMH,SAAAA,CAAAA,EAAY;AAC3B,IAAA,MAAM,IAAID,MAAM,oBAAA,CAAA;AAClB,EAAA;AAEA,EAAA,OAAOC,SAAAA;AACT;AAhBgBP,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;;;ACKT,SAASW,QAAQC,CAAAA,EAAS;AAC/B,EAAA,MAAMC,CAAAA,GAAI;AAAC,IAAA,IAAA;AAAM,IAAA,IAAA;AAAM,IAAA,IAAA;AAAM,IAAA;;AAC7B,EAAA,MAAMC,IAAIF,CAAAA,GAAI,GAAA;AACd,EAAA,MAAMG,KAAAA,GAAAA,CAASD,IAAI,EAAA,IAAM,EAAA;AACzB,EAAA,MAAME,MAAAA,GAASH,EAAEE,KAAAA,CAAAA,IAAUF,EAAEC,CAAAA,CAAAA,IAAMD,EAAE,CAAA,CAAA;AACrC,EAAA,IAAI,CAACG,MAAAA,EAAQ,OAAO,CAAA,EAAGJ,CAAAA,CAAAA,EAAAA,CAAAA;AAEvB,EAAA,OAAO,CAAA,EAAGA,CAAAA,CAAAA,EAAII,MAAAA,CAAAA,CAAAA;AAChB;AARgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;;;ACFT,SAASM,UAAAA,CAAWC,MAAcC,IAAAA,EAAY;AACnD,EAAA,OAAOV,QAASS,IAAAA,GAAOC,IAAAA,GAAQ,GAAA,EAAKC,OAAAA,CAAQ,CAAA,CAAA,CAAA;AAC9C;AAFgBH,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;;;ACDT,SAASI,KAAAA,CAAMC,KAAaC,SAAAA,EAAiB;AAClD,EAAA,MAAMC,MAAAA,GAASlC,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAI0B,SAAAA,CAAAA;AAC5B,EAAA,OAAOjC,KAAK+B,KAAAA,CAAAA,CAAOC,GAAAA,GAAMb,MAAAA,CAAOgB,OAAAA,IAAWD,MAAAA,CAAAA,GAAUA,MAAAA;AACvD;AAHgBH,MAAAA,CAAAA,KAAAA,EAAAA,OAAAA,CAAAA;;;ACKT,SAASK,mBAAAA,CACdJ,KACAK,IAAAA,EAGC;AAED,EAAA,MAAM,EAAEC,QAAAA,GAAW;AAAC,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA,GAAA;AAAK,IAAA;KAAML,SAAAA,GAAY,CAAA,EAAC,GAAKI,IAAAA,IAAQ,EAAC;AAEzE,EAAA,IAAIL,MAAM,GAAA,EAAO;AACf,IAAA,OAAOA,IAAIO,QAAAA,EAAQ;AACrB,EAAA;AAEA,EAAA,IAAId,KAAAA,GAAQ,EAAA;AACZ,EAAA,IAAIe,IAAAA,GAAOR,GAAAA;AAEX,EAAA,OAAOQ,IAAAA,IAAQ,GAAA,IAAQf,KAAAA,GAAQa,QAAAA,CAASG,SAAS,CAAA,EAAG;AAClDD,IAAAA,IAAAA,IAAQ,GAAA;AACRf,IAAAA,KAAAA,EAAAA;AACF,EAAA;AAEA,EAAA,IAAIiB,MAAAA;AAEJ,EAAA,IAAIF,IAAAA,GAAO,MAAM,CAAA,EAAG;AAClBE,IAAAA,MAAAA,GAASF,KAAKD,QAAAA,EAAQ;EACxB,CAAA,MAAO;AACL,IAAA,MAAMI,YAAAA,GAAe3C,IAAAA,CAAK+B,KAAAA,CAAMS,IAAAA,GAAOxC,KAAKO,GAAAA,CAAI,EAAA,EAAI0B,SAAAA,GAAY,CAAA,CAAA,CAAA,GAAMjC,IAAAA,CAAKO,GAAAA,CAAI,EAAA,EAAI0B,YAAY,CAAA,CAAA;AAC/FS,IAAAA,MAAAA,GAASC,YAAAA,CAAab,QAAQG,SAAAA,CAAAA;AAChC,EAAA;AAEA,EAAA,IAAIS,MAAAA,CAAOE,QAAAA,CAAS,IAAA,CAAA,EAAO;AACzBF,IAAAA,MAAAA,GAAS1C,KAAK6C,IAAAA,CAAK1B,MAAAA,CAAOuB,MAAAA,CAAAA,EAASH,QAAAA,EAAQ;AAC7C,EAAA;AAEA,EAAA,IAAIG,MAAAA,CAAOE,QAAAA,CAAS,IAAA,CAAA,EAAO;AACzBF,IAAAA,MAAAA,GAASA,MAAAA,CAAOI,SAAAA,CAAU,CAAA,EAAGJ,MAAAA,CAAOD,SAAS,CAAA,CAAA;AAC/C,EAAA;AAEA,EAAA,IAAIC,WAAW,MAAA,EAAQ;AACrBjB,IAAAA,KAAAA,IAAS,CAAA;AACTiB,IAAAA,MAAAA,GAAS,GAAA;AACX,EAAA;AAEA,EAAA,OAAOA,MAAAA,IAAUjB,KAAAA,IAAS,CAAA,GAAIa,QAAAA,CAASb,KAAAA,CAAAA,GAAS,EAAA,CAAA;AAClD;AA5CgBW,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;;;ACRT,SAASW,WAAWC,IAAAA,EAAY;AACrC,EAAA,OAAOA,IAAAA,CAAKC,MAAAA,CAAO,CAAA,CAAA,CAAGC,WAAAA,KAAgBF,IAAAA,CAAKG,KAAAA,CAAM,CAAA,CAAA,CAAGC,WAAAA,EAAW;AACjE;AAFgBL,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;;;ACET,SAASM,oBAAoBC,GAAAA,EAAwB;AAC1D,EAAA,OAAOtD,IAAAA,CAAKQ,GAAAA,CAAG,GAAI8C,GAAAA,CAAIC,GAAAA,CAAI,CAACC,EAAAA,KAAOA,EAAAA,CAAGjB,QAAAA,EAAQ,CAAGE,MAAM,CAAA,CAAA;AACzD;AAFgBY,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;;;ACAT,SAASI,mBAAmBC,IAAAA,EAAgB;AACjD,EAAA,IAAIA,IAAAA,CAAKjB,MAAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAE9B,EAAA,MAAMkB,QAAAA,GAAWD,KAAK,CAAA,CAAA;AACtB,EAAA,IAAI,CAACC,QAAAA,IAAYA,QAAAA,CAASlB,MAAAA,KAAW,GAAG,OAAO,EAAA;AAE/C,EAAA,IAAImB,KAAAA,GAAQ,EAAA;AACZ,EAAA,MAAMC,eAAyB,EAAA;AAG/B,EAAA,KAAA,IAASC,CAAAA,GAAI,CAAA,EAAGA,CAAAA,GAAIH,QAAAA,CAASlB,QAAQqB,CAAAA,EAAAA,EAAK;AACxC,IAAA,IAAIC,QAAAA,GAAW,CAAA;AACf,IAAA,KAAA,MAAWC,OAAON,IAAAA,EAAM;AACtB,MAAA,MAAMO,IAAAA,GAAOD,IAAIF,CAAAA,CAAAA;AACjB,MAAA,IAAIG,SAASC,MAAAA,EAAWH,QAAAA,GAAW/D,KAAKQ,GAAAA,CAAIuD,QAAAA,EAAUE,KAAKxB,MAAM,CAAA;AACnE,IAAA;AACAoB,IAAAA,YAAAA,CAAaM,KAAKJ,QAAAA,CAAAA;AACpB,EAAA;AAGA,EAAA,MAAMK,UAAAA,mBAAa,MAAA,CAAA,CAACC,IAAAA,EAAcC,IAAAA,EAAcC,WAAmBC,KAAAA,KAAAA;AACjE,IAAA,IAAIC,IAAAA,GAAOH,IAAAA;AACXT,IAAAA,YAAAA,CAAaa,OAAAA,CAAQ,CAACC,KAAAA,EAAOlD,KAAAA,KAAAA;AAC3BgD,MAAAA,IAAAA,IAAQJ,IAAAA,CAAKO,MAAAA,CAAOD,KAAAA,GAAQ,CAAA,CAAA;AAC5B,MAAA,IAAIlD,KAAAA,GAAQoC,YAAAA,CAAapB,MAAAA,GAAS,CAAA,EAAGgC,IAAAA,IAAQF,SAAAA;WACxCE,IAAAA,IAAQD,KAAAA;IACf,CAAA,CAAA;AACAC,IAAAA,IAAAA,IAAQ,IAAA;AACR,IAAA,OAAOA,IAAAA;EACT,CAAA,EATmB,YAAA,CAAA;AAYnBb,EAAAA,KAAAA,IAASQ,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;AAEnCV,EAAAA,IAAAA,CAAKgB,OAAAA,CAAQ,CAACV,GAAAA,EAAKa,QAAAA,KAAAA;AAEjBjB,IAAAA,KAAAA,IAAS,QAAA;AACTI,IAAAA,GAAAA,CAAIU,OAAAA,CAAQ,CAACT,IAAAA,EAAMa,WAAAA,KAAAA;AACjB,MAAA,MAAMC,WAAAA,GAAclB,aAAaiB,WAAAA,CAAAA;AACjC,MAAA,IAAIC,gBAAgBb,MAAAA,EAAWN,KAAAA,IAAS,IAAIK,IAAAA,CAAKe,MAAAA,CAAOD,WAAAA,CAAAA,CAAAA,OAAAA,CAAAA;IAC1D,CAAA,CAAA;AACAnB,IAAAA,KAAAA,IAAS,IAAA;AAGT,IAAA,IAAIiB,QAAAA,GAAWnB,KAAKjB,MAAAA,GAAS,CAAA,WAAY2B,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;AAC9DR,SAAAA,KAAAA,IAASQ,UAAAA,CAAW,QAAA,EAAK,QAAA,EAAK,QAAA,EAAK,QAAA,CAAA;EAC1C,CAAA,CAAA;AAEA,EAAA,OAAOR,KAAAA;AACT;AAjDgBH,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;;;ACcT,SAASwB,QAAAA,CAASC,KAAa7C,IAAAA,EAAsB;AAC1D,EAAA,MAAMK,MAAAA,GAASwC,GAAAA,CACZpE,OAAAA,CAAQ,iBAAA,EAAmB,OAAA,EAC3BA,OAAAA,CAAQ,OAAA,EAAS,GAAA,CAAA,CACjBqE,IAAAA,EAAI;AAEP,EAAA,IAAI9C,IAAAA,EAAMU,UAAAA,EAAY,OAAOA,UAAAA,CAAWL,MAAAA,CAAAA;AAExC,EAAA,OAAOA,MAAAA;AACT;AATgBuC,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;;;ACLT,SAASG,gBAAAA,CAAiBC,WAAmBC,QAAAA,EAAgB;AAClE,EAAA,OAAA,CAAQA,QAAAA,GAAWD,YAAY,CAAA,GAAI,CAAA,CAAA,EAAIC,WAAWD,SAAAA,CAAAA,CAAAA,GAAcC,QAAAA,GAAWD,SAAAA,EAAW9C,QAAAA,EAAQ;AAChG;AAFgB6C,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;;;ACCT,SAASG,UAAkBC,KAAAA,EAAe;AAC/C,EAAA,MAAMC,KAAAA,GAAQD,MAAMrC,KAAAA,EAAK;AACzB,EAAA,KAAA,IAASW,IAAI2B,KAAAA,CAAMhD,MAAAA,GAAS,CAAA,EAAGqB,CAAAA,GAAI,GAAGA,CAAAA,EAAAA,EAAK;AACzC,IAAA,MAAM4B,IAAI1F,IAAAA,CAAKC,KAAAA,CAAMD,KAAKS,MAAAA,EAAM,IAAMqD,IAAI,CAAA,CAAA,CAAA;AAE1C,IAAA,CAAC2B,MAAM3B,CAAAA,CAAAA,EAAI2B,KAAAA,CAAMC,CAAAA,CAAE,CAAA,GAAI;AAACD,MAAAA,KAAAA,CAAMC,CAAAA,CAAAA;AAAID,MAAAA,KAAAA,CAAM3B,CAAAA;;AAC1C,EAAA;AACA,EAAA,OAAO2B,KAAAA;AACT;AARgBF,MAAAA,CAAAA,SAAAA,EAAAA,WAAAA,CAAAA;ACNT,SAASI,aAAaC,KAAAA,EAAgB;AAC3C,EAAA,OACEA,KAAAA,CAAMC,QAAM,KACXD,KAAAA,CAAME,KAAKlD,QAAAA,CAAS,KAAA,CAAA,IAAUgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,KAAA,CAAA,CAAA,IACnD,CAACgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,OAAA,KACrB,CAACgD,KAAAA,CAAME,IAAAA,CAAKlD,QAAAA,CAAS,MAAA,CAAA;AAEzB;AAPgB+C,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAgBhB,eAAsBI,iBAAAA,CACpBC,GAAAA,EACAC,QAAAA,EACAC,MAAAA,EAAc;AAEd,EAAA,IAAIC,OAAAA;AAEJ,EAAA,IAAI;AACFA,IAAAA,OAAAA,GAAU,MAAMC,QAAQJ,GAAAA,EAAK;MAAEK,aAAAA,EAAe;KAAK,CAAA;EACrD,CAAA,CAAA,MAAQ;AACNH,IAAAA,MAAAA,CAAOI,MAAM,+BAAA,CAAA;AACbH,IAAAA,OAAAA,GAAU,EAAA;AACZ,EAAA;AAEA,EAAA,KAAA,MAAWP,SAASO,OAAAA,EAAS;AAC3B,IAAA,MAAMI,QAAAA,GAAgBC,IAAAA,CAAAA,IAAAA,CAAKR,GAAAA,EAAKJ,KAAAA,CAAME,IAAI,CAAA;AAC1C,IAAA,MAAMW,YAAAA,GAAoBC,IAAAA,CAAAA,QAAAA,CAASC,OAAAA,CAAQC,GAAAA,IAAOL,QAAAA,CAAAA;AAElD,IAAA,IAAIX,KAAAA,CAAMiB,aAAW,EAAI;AACvB,MAAA,MAAMd,iBAAAA,CAAkBQ,QAAAA,EAAUN,QAAAA,EAAUC,MAAAA,CAAAA;IAC9C,CAAA,MAAA,IAAWP,YAAAA,CAAaC,KAAAA,CAAAA,EAAQ;AAC9B,MAAA,MAAMkB,QAAAA,GAAY,MAAM,OAAOP,QAAAA,CAAAA;AAC/B,MAAA,MAAMN,QAAAA,CAASM,QAAAA,EAAUE,YAAAA,EAAcK,QAAAA,CAAAA;AACzC,IAAA;AACF,EAAA;AACF;AAzBsBf,MAAAA,CAAAA,iBAAAA,EAAAA,mBAAAA,CAAAA","file":"index.mjs","sourcesContent":["/**\n * Return current time in seconds\n */\nexport function currentTime(): number {\n  return Math.floor(Date.now() / 1000);\n}\n","/**\n * Generates a random numeric code with the specified number of digits.\n *\n * @param digits - The number of digits for the generated code.\n * @returns A random numeric code with the specified number of digits.\n */\nexport function generateCode(digits: number): number {\n  const min = Math.pow(10, digits - 1);\n  const max = Math.pow(10, digits) - 1;\n  return Math.floor(Math.random() * (max - min + 1) + min);\n}\n","/**\n * Converts hexcode to number\n *\n * @param hex - The hex code to convert.\n * @returns The converted number.\n */\nexport function hexToNumber(hex: string): number {\n  if (typeof hex !== 'string') {\n    throw new TypeError('hexToNumber expects a string input');\n  }\n\n  const normalized = hex.replace(/^#/, '');\n  if (!/^[0-9a-fA-F]+$/.test(normalized)) {\n    throw new Error('Invalid hex string');\n  }\n\n  const converted = parseInt(normalized, 16);\n  if (Number.isNaN(converted)) {\n    throw new Error('Invalid hex string');\n  }\n\n  return converted;\n}\n","/**\n * Returns the ordinal suffix for a given number.\n *\n * @param n - The number to get the ordinal for\n * @returns The number with its ordinal suffix\n *\n * @example\n * ordinal(1); // \"1st\"\n * ordinal(22); // \"22nd\"\n * ordinal(13); // \"13th\"\n */\nexport function ordinal(n: number): string {\n  const s = ['th', 'st', 'nd', 'rd'];\n  const v = n % 100;\n  const index = (v - 20) % 10;\n  const suffix = s[index] ?? s[v] ?? s[0];\n  if (!suffix) return `${n}th`;\n\n  return `${n}${suffix}`;\n}\n","/**\n * Takes two numbers and returns the percentage of the first number in the second number with two decimal places.\n *\n * @param num1 - The first number.\n * @param num2 - The second number.\n *\n * @returns The percentage of the first number in the second number with two decimal places.\n */\n\nexport function percentage(num1: number, num2: number): number {\n  return Number(((num1 / num2) * 100).toFixed(2));\n}\n","/**\n * Rounds a number to a specified number of decimal places.\n *\n * @param num - The number to be rounded.\n * @param precision - The number of decimal places to round to.\n * @returns The rounded number.\n */\n\nexport function round(num: number, precision: number): number {\n  const factor = Math.pow(10, precision);\n  return Math.round((num + Number.EPSILON) * factor) / factor;\n}\n","import type { TupleOf } from '@seedcord/types';\n\n/**\n * Rounds a number to a string representation with a denomination suffix.\n * @param num - The number to round.\n * @example\n * ```ts\n * roundToDenomination(1234); // \"1.2K\"\n * roundToDenomination(10000, ['k', 'm', 'b', 't', 'q']); // \"10k\"\n * roundToDenomination(12345678); // \"12.3M\"\n * ```\n * @returns The rounded number as a string with a denomination suffix.\n */\nexport function roundToDenomination(\n  num: number,\n  opts?: {\n    suffixes?: TupleOf<string, 5>;\n    precision?: number;\n  }\n): string {\n  const { suffixes = ['K', 'M', 'B', 'T', 'Q'], precision = 1 } = opts ?? {};\n\n  if (num < 10000) {\n    return num.toString();\n  }\n\n  let index = -1;\n  let temp = num;\n\n  while (temp >= 1000 && index < suffixes.length - 1) {\n    temp /= 1000;\n    index++;\n  }\n\n  let result;\n\n  if (temp % 1 === 0) {\n    result = temp.toString();\n  } else {\n    const adjustedTemp = Math.round(temp * Math.pow(10, precision + 1)) / Math.pow(10, precision + 1);\n    result = adjustedTemp.toFixed(precision);\n  }\n\n  if (result.endsWith('.9')) {\n    result = Math.ceil(Number(result)).toString();\n  }\n\n  if (result.endsWith('.0')) {\n    result = result.substring(0, result.length - 2);\n  }\n\n  if (result === '1000') {\n    index += 1;\n    result = '1';\n  }\n\n  return result + (index >= 0 ? suffixes[index] : '');\n}\n","/**\n * Returns the word with it's first letter capitalized and the rest in lowercase.\n * @param word - The word to be formatted.\n * @returns The formatted word.\n */\nexport function capitalize(word: string): string {\n  return word.charAt(0).toUpperCase() + word.slice(1).toLowerCase();\n}\n","/**\n * Function takes an array of strings or numbers and returns the number of characters in the longest string/number\n *\n * @param arr - The array of strings or numbers\n * @returns The length of the longest element when converted to string\n */\n\nexport function longestStringLength(arr: (string | number)[]): number {\n  return Math.max(...arr.map((el) => el.toString().length));\n}\n","/**\n * Generates an ASCII table from the provided data.\n *\n * @param data - The data to be displayed in the table.\n * @returns The generated ASCII table as a string.\n */\n\nexport function generateAsciiTable(data: string[][]): string {\n  if (data.length === 0) return '';\n\n  const firstRow = data[0];\n  if (!firstRow || firstRow.length === 0) return '';\n\n  let table = '';\n  const columnWidths: number[] = [];\n\n  // Determine the maximum width for each column\n  for (let i = 0; i < firstRow.length; i++) {\n    let maxWidth = 0;\n    for (const row of data) {\n      const cell = row[i];\n      if (cell !== undefined) maxWidth = Math.max(maxWidth, cell.length);\n    }\n    columnWidths.push(maxWidth);\n  }\n\n  // Function to create a horizontal line\n  const createLine = (char: string, left: string, intersect: string, right: string): string => {\n    let line = left;\n    columnWidths.forEach((width, index) => {\n      line += char.repeat(width + 2);\n      if (index < columnWidths.length - 1) line += intersect;\n      else line += right;\n    });\n    line += '\\n';\n    return line;\n  };\n\n  // Top border\n  table += createLine('═', '╔', '╦', '╗');\n\n  data.forEach((row, rowIndex) => {\n    // Row content\n    table += '║';\n    row.forEach((cell, columnIndex) => {\n      const columnWidth = columnWidths[columnIndex];\n      if (columnWidth !== undefined) table += ` ${cell.padEnd(columnWidth)} ║`;\n    });\n    table += '\\n';\n\n    // Separator or bottom border\n    if (rowIndex < data.length - 1) table += createLine('─', '╠', '╬', '╣');\n    else table += createLine('═', '╚', '╩', '╝');\n  });\n\n  return table;\n}\n","import { capitalize } from './capitalize';\n\ninterface PrettifyOptions {\n  capitalize?: boolean;\n}\n/**\n * Converts a string from any common naming convention to human-readable format.\n * Handles camelCase, PascalCase, snake_case, and kebab-case.\n *\n * @param key - The string to convert\n * @param opts - Optional configuration\n * @returns A space-separated, human-readable string\n *\n * @example\n * prettify(\"camelCaseString\") // \"camel Case String\"\n * prettify(\"PascalCaseString\") // \"Pascal Case String\"\n * prettify(\"snake_case_string\") // \"snake case string\"\n * prettify(\"kebab-case-string\") // \"kebab case string\"\n * prettify(\"mixedCase_string-name\") // \"mixed Case string name\"\n */\n\nexport function prettify(key: string, opts?: PrettifyOptions): string {\n  const result = key\n    .replace(/([a-z])([A-Z])/g, '$1 $2') // camelCase/PascalCase\n    .replace(/[_-]/g, ' ') // snake_case and kebab-case\n    .trim();\n\n  if (opts?.capitalize) return capitalize(result);\n\n  return result;\n}\n","/**\n * Calculates the difference between two numbers and formats it as a string with a '+' prefix for positive differences.\n *\n * @param numBefore - The initial number value\n * @param numAfter - The final number value\n * @returns A string representing the difference, with a '+' sign for positive differences\n *\n * @example\n * // Returns \"+5\"\n * prettyDifference(10, 15);\n *\n * @example\n * // Returns \"-3\"\n * prettyDifference(10, 7);\n */\n\nexport function prettyDifference(numBefore: number, numAfter: number): string {\n  return (numAfter - numBefore > 0 ? `+${numAfter - numBefore}` : numAfter - numBefore).toString();\n}\n","/**\n * Shuffles an array using the Fisher-Yates algorithm.\n * This function creates a new array with the same elements in a random order,\n * without modifying the original array.\n *\n * @typeParam TArray - The type of elements in the array\n * @param items - The array to shuffle\n * @returns A new array with the same elements in a random order\n *\n * @example\n * ```typescript\n * const numbers = [1, 2, 3, 4, 5];\n * const shuffled = fyShuffle(numbers);\n * // shuffled might be [3, 1, 5, 2, 4]\n * // numbers is still [1, 2, 3, 4, 5]\n * ```\n */\nexport function fyShuffle<TArray>(items: TArray[]): TArray[] {\n  const array = items.slice();\n  for (let i = array.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    // @ts-expect-error - TypeScript doesn't recognize that TArray can be swapped\n    [array[i], array[j]] = [array[j], array[i]];\n  }\n  return array;\n}\n","import { readdir } from 'node:fs/promises';\nimport * as path from 'node:path';\n\nimport type { Logger } from '@seedcord/services';\nimport type * as fs from 'node:fs';\n/**\n * Determines if a directory entry is a TypeScript or JavaScript file.\n *\n * @param entry - The directory entry to check.\n * @returns True if the entry is a file ending with .ts or .js.\n */\nexport function isTsOrJsFile(entry: fs.Dirent): boolean {\n  return (\n    entry.isFile() &&\n    (entry.name.endsWith('.ts') || entry.name.endsWith('.js')) &&\n    !entry.name.endsWith('.d.ts') &&\n    !entry.name.endsWith('.map')\n  );\n}\n\n/**\n * Recursively traverses through a directory, importing all .ts and .js files and applying a callback to each import.\n *\n * @param dir - The directory path to traverse.\n * @param callback - A function that will be called for each imported module. It receives the full file path, the file's relative path, and the imported module as arguments.\n * @returns A Promise that resolves when the traversal is complete.\n */\nexport async function traverseDirectory(\n  dir: string,\n  callback: (fullPath: string, relativePath: string, imported: Record<string, unknown>) => Promise<void> | void,\n  logger: Logger\n): Promise<void> {\n  let entries: fs.Dirent[];\n\n  try {\n    entries = await readdir(dir, { withFileTypes: true });\n  } catch {\n    logger.error('Failed to read this directory');\n    entries = [];\n  }\n\n  for (const entry of entries) {\n    const fullPath = path.join(dir, entry.name);\n    const relativePath = path.relative(process.cwd(), fullPath);\n\n    if (entry.isDirectory()) {\n      await traverseDirectory(fullPath, callback, logger);\n    } else if (isTsOrJsFile(entry)) {\n      const imported = (await import(fullPath)) as Record<string, unknown>;\n      await callback(fullPath, relativePath, imported);\n    }\n  }\n}\n"]}

package/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@seedcord/utils",
+  "type": "module",
+  "version": "0.1.0",
+  "description": "Utility functions for Seedcord packages",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/materwelondhruv/seedcord.git",
+    "directory": "packages/utils"
+  },
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./dist/index.d.mts",
+        "default": "./dist/index.mjs"
+      },
+      "require": {
+        "types": "./dist/index.d.cts",
+        "default": "./dist/index.cjs"
+      }
+    }
+  },
+  "files": [
+    "dist",
+    "package.json",
+    "README.md",
+    "LICENSE"
+  ],
+  "peerDependencies": {
+    "typescript": "5.9.2"
+  },
+  "dependencies": {
+    "discord.js": "14.22.1",
+    "@seedcord/services": "^0.1.0",
+    "@seedcord/types": "^0.1.2"
+  },
+  "devDependencies": {
+    "@seedcord/eslint-config": "^1.1.1",
+    "@seedcord/tsup-config": "^1.0.2",
+    "@seedcord/tsconfig": "^1.0.2"
+  },
+  "scripts": {
+    "build": "tsup && cp dist/index.d.cts dist/index.d.mts",
+    "clean": "rm -rf dist",
+    "lint": "eslint 'src/**/*.{ts,tsx}' --cache",
+    "lint:fix": "eslint 'src/**/*.{ts,tsx}' --fix --cache",
+    "fmt": "prettier --write 'src/**/*.{ts,tsx,json,md}' --cache",
+    "fmt:check": "prettier --check 'src/**/*.{ts,tsx,json,md}' --cache",
+    "tc": "tsc --noEmit",
+    "test": "vitest run",
+    "test:watch": "vitest dev",
+    "coverage": "vitest run --coverage"
+  }
+}