fantomid 1.0.1 → 1.0.2

package/dist/index.d.mts

@@ -0,0 +1,13 @@
+/**
+ * Generates an JavaScript-friendly unique ID.
+ *
+ * ```js
+ * import fantomId from "fantomid";
+ * fantomid(); //=> 5895736349537828
+ * ```
+ *
+ * @returns A random integer.
+ */
+declare function fantomid(): number;
+
+export { fantomid as default };

package/{src → dist}/index.d.ts

@@ -8,4 +8,6 @@
  *
  * @returns A random integer.
  */
-export default function fantomid(): number;
+declare function fantomid(): number;
+
+export { fantomid as default };

package/dist/index.js

@@ -0,0 +1,27 @@
+import { random } from '@lukeed/csprng';
+
+const EPOCH = /* @__PURE__ */ new Date("2024-09-08");
+function fantomid() {
+  const TIMESTAMP_LENGTH = 36;
+  const RANDOM_BITS_LENGTH = 17;
+  const TIMESTAMP_PRECISION_DIVIDER = 100;
+  const bits = new Array(TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH);
+  const timestamp = Math.round(
+    // Use a more recent base date instead of the Unix Epoch to
+    // increase the amount of time we can represent in the timestamp.
+    (/* @__PURE__ */ new Date() - EPOCH) / // Decrease the precision of the timestamp to
+    // increase the amount of bits we can fit in a key.
+    TIMESTAMP_PRECISION_DIVIDER
+  );
+  for (let i = 0; i < TIMESTAMP_LENGTH; i++) {
+    bits[TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH - 1 - i] = timestamp >> i & 1;
+  }
+  const randomBytes = random(Math.ceil(RANDOM_BITS_LENGTH / 8));
+  for (let i = 0; i < RANDOM_BITS_LENGTH; i++) {
+    bits[RANDOM_BITS_LENGTH - 1 - i] = randomBytes[Math.floor(i / 8)] >> i % 8 & 1;
+  }
+  return Number("0b" + bits.reduce((id, bit) => id + bit, String()));
+}
+
+export { fantomid as default };
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../src/fantomid.js"],"sourcesContent":["import { random } from \"@lukeed/csprng\";\n\nconst EPOCH = new Date(\"2024-09-08\");\n\nexport function fantomid() {\n  const TIMESTAMP_LENGTH = 36;\n  const RANDOM_BITS_LENGTH = 17;\n  const TIMESTAMP_PRECISION_DIVIDER = 100;\n\n  const bits = new Array(TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH);\n\n  // Generates a timestamp to be part of the key. This is\n  // inspired by how UUID v7 works: the idea is that this\n  // will guarantee keys are generated evenly across time.\n  const timestamp = Math.round(\n    // Use a more recent base date instead of the Unix Epoch to\n    // increase the amount of time we can represent in the timestamp.\n    (new Date() - EPOCH) /\n      // Decrease the precision of the timestamp to\n      // increase the amount of bits we can fit in a key.\n      TIMESTAMP_PRECISION_DIVIDER,\n  );\n  for (let i = 0; i < TIMESTAMP_LENGTH; i++) {\n    bits[TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH - 1 - i] = (timestamp >> i) & 1;\n  }\n\n  // Generates a randomized part of the key. If multiple machines generate a\n  // key at the exact same time (limited by the precision of the timestamp),\n  // we are ensured to have a chance of collision of `1` in `2 ** RANDOM_BITS_LENGTH`.\n  const randomBytes = random(Math.ceil(RANDOM_BITS_LENGTH / 8));\n  for (let i = 0; i < RANDOM_BITS_LENGTH; i++) {\n    bits[RANDOM_BITS_LENGTH - 1 - i] =\n      (randomBytes[Math.floor(i / 8)] >> i % 8) & 1;\n  }\n\n  return Number(\"0b\" + bits.reduce((id, bit) => id + bit, String()));\n}\n"],"names":[],"mappings":";;AACA,MAAM,KAAK,mBAAmB,IAAI,IAAI,CAAC,YAAY,CAAC;AAC7C,SAAS,QAAQ,GAAG;AAC3B,EAAE,MAAM,gBAAgB,GAAG,EAAE;AAC7B,EAAE,MAAM,kBAAkB,GAAG,EAAE;AAC/B,EAAE,MAAM,2BAA2B,GAAG,GAAG;AACzC,EAAE,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;AAC/D,EAAE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK;AAC9B;AACA;AACA,IAAI,iBAAiB,IAAI,IAAI,EAAE,GAAG,KAAK;AACvC;AACA,IAAI;AACJ,GAAG;AACH,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE;AAC7C,IAAI,IAAI,CAAC,gBAAgB,GAAG,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,IAAI,CAAC,GAAG,CAAC;AAC5E,EAAE;AACF,EAAE,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;AAC/D,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE;AAC/C,IAAI,IAAI,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAClF,EAAE;AACF,EAAE,OAAO,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AACpE;;;;"}

package/dist/index.mjs

@@ -0,0 +1,27 @@
+import { random } from '@lukeed/csprng';
+
+const EPOCH = /* @__PURE__ */ new Date("2024-09-08");
+function fantomid() {
+  const TIMESTAMP_LENGTH = 36;
+  const RANDOM_BITS_LENGTH = 17;
+  const TIMESTAMP_PRECISION_DIVIDER = 100;
+  const bits = new Array(TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH);
+  const timestamp = Math.round(
+    // Use a more recent base date instead of the Unix Epoch to
+    // increase the amount of time we can represent in the timestamp.
+    (/* @__PURE__ */ new Date() - EPOCH) / // Decrease the precision of the timestamp to
+    // increase the amount of bits we can fit in a key.
+    TIMESTAMP_PRECISION_DIVIDER
+  );
+  for (let i = 0; i < TIMESTAMP_LENGTH; i++) {
+    bits[TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH - 1 - i] = timestamp >> i & 1;
+  }
+  const randomBytes = random(Math.ceil(RANDOM_BITS_LENGTH / 8));
+  for (let i = 0; i < RANDOM_BITS_LENGTH; i++) {
+    bits[RANDOM_BITS_LENGTH - 1 - i] = randomBytes[Math.floor(i / 8)] >> i % 8 & 1;
+  }
+  return Number("0b" + bits.reduce((id, bit) => id + bit, String()));
+}
+
+export { fantomid as default };
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","sources":["../src/fantomid.js"],"sourcesContent":["import { random } from \"@lukeed/csprng\";\n\nconst EPOCH = new Date(\"2024-09-08\");\n\nexport function fantomid() {\n  const TIMESTAMP_LENGTH = 36;\n  const RANDOM_BITS_LENGTH = 17;\n  const TIMESTAMP_PRECISION_DIVIDER = 100;\n\n  const bits = new Array(TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH);\n\n  // Generates a timestamp to be part of the key. This is\n  // inspired by how UUID v7 works: the idea is that this\n  // will guarantee keys are generated evenly across time.\n  const timestamp = Math.round(\n    // Use a more recent base date instead of the Unix Epoch to\n    // increase the amount of time we can represent in the timestamp.\n    (new Date() - EPOCH) /\n      // Decrease the precision of the timestamp to\n      // increase the amount of bits we can fit in a key.\n      TIMESTAMP_PRECISION_DIVIDER,\n  );\n  for (let i = 0; i < TIMESTAMP_LENGTH; i++) {\n    bits[TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH - 1 - i] = (timestamp >> i) & 1;\n  }\n\n  // Generates a randomized part of the key. If multiple machines generate a\n  // key at the exact same time (limited by the precision of the timestamp),\n  // we are ensured to have a chance of collision of `1` in `2 ** RANDOM_BITS_LENGTH`.\n  const randomBytes = random(Math.ceil(RANDOM_BITS_LENGTH / 8));\n  for (let i = 0; i < RANDOM_BITS_LENGTH; i++) {\n    bits[RANDOM_BITS_LENGTH - 1 - i] =\n      (randomBytes[Math.floor(i / 8)] >> i % 8) & 1;\n  }\n\n  return Number(\"0b\" + bits.reduce((id, bit) => id + bit, String()));\n}\n"],"names":[],"mappings":";;AACA,MAAM,KAAK,mBAAmB,IAAI,IAAI,CAAC,YAAY,CAAC;AAC7C,SAAS,QAAQ,GAAG;AAC3B,EAAE,MAAM,gBAAgB,GAAG,EAAE;AAC7B,EAAE,MAAM,kBAAkB,GAAG,EAAE;AAC/B,EAAE,MAAM,2BAA2B,GAAG,GAAG;AACzC,EAAE,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;AAC/D,EAAE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK;AAC9B;AACA;AACA,IAAI,iBAAiB,IAAI,IAAI,EAAE,GAAG,KAAK;AACvC;AACA,IAAI;AACJ,GAAG;AACH,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE;AAC7C,IAAI,IAAI,CAAC,gBAAgB,GAAG,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,IAAI,CAAC,GAAG,CAAC;AAC5E,EAAE;AACF,EAAE,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;AAC/D,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE;AAC/C,IAAI,IAAI,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAClF,EAAE;AACF,EAAE,OAAO,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AACpE;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "fantomid",
-  "version": "1.0.1",
+  "version": "1.0.2",
   "type": "module",
   "description": "A tiny, universal ID generator compatible with JavaScript integers",
   "repository": "th3rius/fantomid",

package/.husky/pre-commit

@@ -1,2 +0,0 @@
-prettier $(git diff --cached --name-only --diff-filter=ACMR | sed 's| |\\ |g') -uw
-git update-index --again

package/src/fantomid.js

@@ -1,37 +0,0 @@
-import { random } from "@lukeed/csprng";
-
-const EPOCH = new Date("2024-09-08");
-
-export function fantomid() {
-  const TIMESTAMP_LENGTH = 36;
-  const RANDOM_BITS_LENGTH = 17;
-  const TIMESTAMP_PRECISION_DIVIDER = 100;
-
-  const bits = new Array(TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH);
-
-  // Generates a timestamp to be part of the key. This is
-  // inspired by how UUID v7 works: the idea is that this
-  // will guarantee keys are generated evenly across time.
-  const timestamp = Math.round(
-    // Use a more recent base date instead of the Unix Epoch to
-    // increase the amount of time we can represent in the timestamp.
-    (new Date() - EPOCH) /
-      // Decrease the precision of the timestamp to
-      // increase the amount of bits we can fit in a key.
-      TIMESTAMP_PRECISION_DIVIDER,
-  );
-  for (let i = 0; i < TIMESTAMP_LENGTH; i++) {
-    bits[TIMESTAMP_LENGTH + RANDOM_BITS_LENGTH - 1 - i] = (timestamp >> i) & 1;
-  }
-
-  // Generates a randomized part of the key. If multiple machines generate a
-  // key at the exact same time (limited by the precision of the timestamp),
-  // we are ensured to have a chance of collision of `1` in `2 ** RANDOM_BITS_LENGTH`.
-  const randomBytes = random(Math.ceil(RANDOM_BITS_LENGTH / 8));
-  for (let i = 0; i < RANDOM_BITS_LENGTH; i++) {
-    bits[RANDOM_BITS_LENGTH - 1 - i] =
-      (randomBytes[Math.floor(i / 8)] >> i % 8) & 1;
-  }
-
-  return Number("0b" + bits.reduce((id, bit) => id + bit, String()));
-}

package/src/fantomid.spec.js

@@ -1,22 +0,0 @@
-import { test, mock, before, it } from "node:test";
-import assert from "assert/strict";
-
-test("fantomid", () => {
-  let randomMock = mock.fn();
-  let fantomid;
-
-  before(async () => {
-    mock.module("@lukeed/csprng", { namedExports: { random: randomMock } });
-    ({ fantomid } = await import("./fantomid.js"));
-  });
-
-  it("should generate an id", () => {
-    randomMock.mock.mockImplementationOnce(() =>
-      Buffer.from([0xa2, 0xd2, 0xff, 0x04, 0xc5]),
-    );
-    console.log(Buffer.from([0xa2, 0xd2, 0xff, 0x04, 0xc5]));
-    mock.timers.enable({ now: new Date("2025-11-24T19:13:45.994Z") });
-    const id = fantomid();
-    assert.equal(id, 8209108814378532);
-  });
-});

package/src/index.js

@@ -1,2 +0,0 @@
-import { fantomid } from "./fantomid.js";
-export default fantomid;