hamsterid 1.0.1

package/LICENCE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2024 Ahmet Çiftci
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,115 @@
+# HamsterID
+
+A lexicographically sortable, fixed-length unique identifier generator.
+
+```
+429t78n91cck41njk21rjula6u
+```
+
+## Why
+
+- **Sortable as strings** — `ORDER BY id` gives chronological order. No separate `created_at` column needed for ordering.
+- **Fixed length** — always 26 chars. No leading-zero padding logic, no variable-width surprises in storage or logs.
+- **Monotonic** — IDs generated in the same process never go backwards. If the random + timer bits would produce a value `<=` the previous ID, it is bumped by 1. Safe for hot-loop generation.
+- **128 bits** — same size as UUID/ULID. Fits in a single `bigint` or a 16-byte column.
+- **No padding, no Crockford alphabet** — straight base32 (`0-9a-v`), so it round-trips through `BigInt` / `parseInt` without lookup tables.
+- **Sub-millisecond ordering** — uses a high-resolution timer (nanoseconds on Node, microseconds in browsers) as part of the value, so two IDs from the same millisecond still sort correctly.
+- **Crypto-strong random** — uses `crypto.getRandomValues` when available, falls back to `Math.random` with a warning.
+
+## Install
+
+```bash
+npm install hamsterid
+```
+
+## Quick start
+
+```ts
+import next from "hamsterid";
+
+next(); // "429t78p7lcefqp8ujjr9k2gntf"
+next(); // "429t78p7pcefuvggusflg3k1tp"
+```
+
+IDs from the same process are strictly increasing:
+
+```ts
+const a = next();
+const b = next();
+a < b; // true (string comparison)
+```
+
+## CLI
+
+Generate IDs from the command line without installing:
+
+```bash
+npx hamsterid        # one ID
+npx hamsterid 5      # five IDs
+```
+
+```
+429t797gbcs3cpc2v00ssl51bu
+429t797gdcs3eosr5fgphse0qj
+429t797gdcs3eqikgmhojfdpks
+429t797gdcs3erav5d2vksml7q
+429t797gdcs3errfqn2octkv2g
+```
+
+## HamsterID Bit layout
+
+128 bits, laid out most-significant first:
+
+| Field     | Bits         | Meaning                                                       |
+| --------- | ------------ | ------------------------------------------------------------- |
+| Fixed `1` | 1            | Guarantees a fixed 26-char base32 length (no leading zeros)   |
+| Timestamp | 42           | Milliseconds since 2024-01-01 UTC (~139 years, until ~2163)   |
+| HR time   | 0 / 30 / 40  | Sub-millisecond ordering. Width depends on the runtime        |
+| Random    | 85 / 55 / 45 | Collision resistance. Fills whatever the HR-time field didn't |
+
+The HR-time and random widths depend on the environment:
+
+| Runtime                   | HR-time bits | Random bits | HR-time resolution      |
+| ------------------------- | ------------ | ----------- | ----------------------- |
+| Node.js                   | 40           | 45          | 1 nanosecond            |
+| Browsers (Chromium-based) | 30           | 55          | 100 microseconds        |
+| Firefox / Safari          | 0            | 85          | n/a (spectre-mitigated) |
+
+When no usable high-resolution timer is available (Firefox/Safari, where `performance.now` is mitigated), the HR-time field is dropped and the full 85 bits go to random — more collision resistance, same fixed length.
+
+## Properties
+
+### Lexicographic sortability
+
+Because the most significant bits are the timestamp and the fixed leading `1`, string comparison of two base32 IDs matches chronological order:
+
+```ts
+const ids = Array.from({ length: 1000 }, () => next());
+const sorted = [...ids].sort(); // already chronological
+sorted[0] === ids[0]; // true
+```
+
+### Monotonicity within a process
+
+Each generated ID is compared against the last. If the new value would be `<=` the previous one (e.g. the clock went backwards or random bits collided), it is replaced with `last + 1`. This guarantees a strictly increasing sequence within a single process.
+
+> Monotonicity is **per-process**. Across processes/machines, IDs remain sortable by timestamp but are not strictly monotonic.
+
+### Uniqueness
+
+The random field plus the monotonic bump makes in-process collisions effectively impossible. Across independent processes generating within the same millisecond, collision probability is governed by the random width (45 / 55 / 85 bits) — the same birthday-bound math as ULID.
+
+## Comparison with ULID
+
+|                    | HamsterID           | ULID                                       |
+| ------------------ | ------------------- | ------------------------------------------ |
+| Length             | 26 chars            | 26 chars                                   |
+| Alphabet           | base32 `0-9a-v`     | Crockford base32                           |
+| Sortable as string | yes                 | yes                                        |
+| Sub-ms ordering    | yes (HR timer)      | no (ms only; relies on random for same-ms) |
+| Monotonic          | yes, in-process     | only with monotonic factory                |
+| Random source      | `crypto` by default | implementation-defined                     |
+
+## License
+
+MIT

package/lib/cli.d.ts

@@ -0,0 +1,2 @@
+#!/usr/bin/env node
+export {};

package/lib/cli.js

@@ -0,0 +1,17 @@
+#!/usr/bin/env node
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const index_1 = __importDefault(require("./index"));
+const arg = process.argv[2];
+const count = arg === undefined ? 1 : Number(arg);
+if (!Number.isInteger(count) || count < 1) {
+    console.error("Usage: hamsterid [count]");
+    process.exit(1);
+}
+for (let i = 0; i < count; i++) {
+    console.log((0, index_1.default)());
+}
+//# sourceMappingURL=cli.js.map

package/lib/cli.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli.js","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";;;;;;AACA,oDAA2B;AAE3B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5B,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAElD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;IAC1C,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,IAAA,eAAI,GAAE,CAAC,CAAC;AACtB,CAAC"}

package/lib/hrtime.d.ts

@@ -0,0 +1,5 @@
+declare const _default: {
+    value: () => bigint;
+    bits: number;
+};
+export default _default;

package/lib/hrtime.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+// nanosecond resolution 40 bits overflows in around 18 minutes
+const hrtimeNode = {
+    value: () => process.hrtime.bigint(),
+    bits: 40,
+};
+// 100 microsecond resolution 30 bits overflows in around 18 hours
+const hrtimeBrowser = {
+    value: () => BigInt(Math.floor(performance.now() * 10)),
+    bits: 30,
+};
+// no usable high-resolution timer: random field expands to 85 bits
+const hrtimeZero = {
+    value: () => 0n,
+    bits: 0,
+};
+function chooseHrtimeSource() {
+    if (typeof process === "object" && typeof process.hrtime === "function") {
+        return hrtimeNode;
+    }
+    // Due to the spectre mitigations, performance.now is useless in firefox and safari
+    if (typeof navigator === "object" &&
+        /firefox|safari/i.test(navigator.userAgent)) {
+        return hrtimeZero;
+    }
+    if (typeof performance === "object" &&
+        typeof performance.now === "function") {
+        return hrtimeBrowser;
+    }
+    return hrtimeZero;
+}
+exports.default = chooseHrtimeSource();
+//# sourceMappingURL=hrtime.js.map

package/lib/hrtime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hrtime.js","sourceRoot":"","sources":["../src/hrtime.ts"],"names":[],"mappings":";;AAAA,+DAA+D;AAC/D,MAAM,UAAU,GAAG;IACjB,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE;IACpC,IAAI,EAAE,EAAE;CACT,CAAC;AAEF,kEAAkE;AAClE,MAAM,aAAa,GAAG;IACpB,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACvD,IAAI,EAAE,EAAE;CACT,CAAC;AAEF,mEAAmE;AACnE,MAAM,UAAU,GAAG;IACjB,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;IACf,IAAI,EAAE,CAAC;CACR,CAAC;AAEF,SAAS,kBAAkB;IACzB,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,OAAO,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QACxE,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,mFAAmF;IACnF,IACE,OAAO,SAAS,KAAK,QAAQ;QAC7B,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAC3C,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,IACE,OAAO,WAAW,KAAK,QAAQ;QAC/B,OAAO,WAAW,CAAC,GAAG,KAAK,UAAU,EACrC,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,kBAAe,kBAAkB,EAAE,CAAC"}

package/lib/index.d.ts

@@ -0,0 +1,8 @@
+export declare function composeBits(timestamp: number, hrtime: bigint, hrtimeBits: number, random: bigint): bigint;
+export declare function UTCTicks(value: Date | number): number;
+declare function nextBigInt(): bigint;
+declare function next(): string;
+declare namespace next {
+    var bigint: typeof nextBigInt;
+}
+export default next;

package/lib/index.js

@@ -0,0 +1,66 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.composeBits = composeBits;
+exports.UTCTicks = UTCTicks;
+exports.default = next;
+const rng_1 = __importDefault(require("./rng"));
+const hrtime_1 = __importDefault(require("./hrtime"));
+/*
+    Bit Layout (128 bits total):
+    [1 bit]   : Fixed value (1) for consistent sized string conversion, leading zeros never looks good
+    [42 bits] : Timestamp
+                - Epoch: January 1, 2024 (UTC)
+                - Unit: Milliseconds
+                - Range: ~139 years (until ~2163)
+    [0, 40 or 30 bits] : High-resolution time
+                - Node.js: 40 bits, nanosecond precision
+                  * Resolution: 1 nanosecond
+                  * Overflow period: ~18 minutes
+                - Browsers: 30 bits, microsecond precision
+                  * Resolution: 100 microseconds
+                  * Overflow period: ~18 hours
+                - Firefox/Safari (spectre-mitigated): 0 bits, hrtime omitted
+    [85, 45 or 55 bits] : Random value
+                - Remaining bits used for collision prevention
+                - 45 bits in Node.js, 55 bits in browsers, 85 bits without hrtime
+
+    Total: 1 + 42 + (40 or 30 or 0) + (45 or 55 or 85) = 128 bits
+*/
+const EPOCH = Date.UTC(2024);
+const MASK_85BIT = 0x1fffffffffffffffffffffn; //2n ** 85n - 1n;
+const MASK_42BIT = 0x3ffffffffffn; //2n ** 42n - 1n;
+function composeBits(timestamp, hrtime, hrtimeBits, random) {
+    const ts = BigInt(timestamp) % (MASK_42BIT + 1n);
+    if (hrtimeBits > 0) {
+        const hrtimeMask = 2n ** BigInt(hrtimeBits);
+        const randomBits = 85 - hrtimeBits;
+        const randomMask = 2n ** BigInt(randomBits);
+        return ((1n << 127n) |
+            (ts << 85n) |
+            ((hrtime % hrtimeMask) << BigInt(randomBits)) |
+            (random % randomMask));
+    }
+    return (1n << 127n) | (ts << 85n) | (random % (MASK_85BIT + 1n));
+}
+function UTCTicks(value) {
+    const time = new Date(value);
+    return Date.UTC(time.getUTCFullYear(), time.getUTCMonth(), time.getUTCDate(), time.getUTCHours(), time.getUTCMinutes(), time.getUTCSeconds(), time.getUTCMilliseconds());
+}
+let lastid = 0n;
+function nextBigInt() {
+    const timestamp = UTCTicks(Date.now()) - EPOCH, hrtimeValue = hrtime_1.default.value(), rand = (0, rng_1.default)();
+    let id = composeBits(timestamp, hrtimeValue, hrtime_1.default.bits, rand);
+    if (id <= lastid) {
+        id = lastid + 1n;
+    }
+    lastid = id;
+    return id;
+}
+function next() {
+    return nextBigInt().toString(32);
+}
+next.bigint = nextBigInt;
+//# sourceMappingURL=index.js.map

package/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;AA8BA,kCAqBC;AAED,4BAWC;AAmBD,uBAEC;AArFD,gDAAwB;AACxB,sDAA8B;AAE9B;;;;;;;;;;;;;;;;;;;;EAoBE;AAEF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAE7B,MAAM,UAAU,GAAG,yBAAyB,CAAC,CAAC,iBAAiB;AAC/D,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,iBAAiB;AAEpD,SAAgB,WAAW,CACzB,SAAiB,EACjB,MAAc,EACd,UAAkB,EAClB,MAAc;IAEd,MAAM,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC;IAEjD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,UAAU,GAAG,EAAE,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,EAAE,GAAG,UAAU,CAAC;QACnC,MAAM,UAAU,GAAG,EAAE,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC;QAC5C,OAAO,CACL,CAAC,EAAE,IAAI,IAAI,CAAC;YACZ,CAAC,EAAE,IAAI,GAAG,CAAC;YACX,CAAC,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC;YAC7C,CAAC,MAAM,GAAG,UAAU,CAAC,CACtB,CAAC;IACJ,CAAC;IAED,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,SAAgB,QAAQ,CAAC,KAAoB;IAC3C,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,cAAc,EAAE,EACrB,IAAI,CAAC,WAAW,EAAE,EAClB,IAAI,CAAC,UAAU,EAAE,EACjB,IAAI,CAAC,WAAW,EAAE,EAClB,IAAI,CAAC,aAAa,EAAE,EACpB,IAAI,CAAC,aAAa,EAAE,EACpB,IAAI,CAAC,kBAAkB,EAAE,CAC1B,CAAC;AACJ,CAAC;AAED,IAAI,MAAM,GAAW,EAAE,CAAC;AAExB,SAAS,UAAU;IACjB,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,EAC5C,WAAW,GAAG,gBAAM,CAAC,KAAK,EAAE,EAC5B,IAAI,GAAG,IAAA,aAAG,GAAE,CAAC;IAEf,IAAI,EAAE,GAAG,WAAW,CAAC,SAAS,EAAE,WAAW,EAAE,gBAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEhE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;QACjB,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,MAAM,GAAG,EAAE,CAAC;IACZ,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAwB,IAAI;IAC1B,OAAO,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC"}

package/lib/rng.d.ts

@@ -0,0 +1,3 @@
+declare function rngCrypto(): bigint;
+declare const _default: typeof rngCrypto;
+export default _default;

package/lib/rng.js

@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function rngCrypto() {
+    const arr = crypto.getRandomValues(new Uint32Array(4));
+    return ((BigInt(arr[0]) << 96n) +
+        (BigInt(arr[1]) << 64n) +
+        (BigInt(arr[2]) << 32n) +
+        BigInt(arr[3]));
+}
+function rngMathRandom() {
+    const rand = () => BigInt(Math.floor(Math.random() * 2 ** 16));
+    return ((rand() << 96n) +
+        (rand() << 80n) +
+        (rand() << 64n) +
+        (rand() << 48n) +
+        (rand() << 32n) +
+        (rand() << 16n) +
+        rand());
+}
+function chooseRngSource() {
+    if (typeof crypto === 'object' && typeof crypto.getRandomValues === 'function') {
+        return rngCrypto;
+    }
+    else {
+        console.error('crypto.getRandomValues is not available. Falling back to Math.random \
+                       if you are using react native consider adding react-native-get-random-values \
+                       module to your project');
+        return rngMathRandom;
+    }
+}
+exports.default = chooseRngSource();
+//# sourceMappingURL=rng.js.map

package/lib/rng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.js","sourceRoot":"","sources":["../src/rng.ts"],"names":[],"mappings":";;AAAA,SAAS,SAAS;IACd,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,CACH,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACjB,CAAA;AACL,CAAC;AAED,SAAS,aAAa;IAClB,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/D,OAAO,CACH,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;QACf,IAAI,EAAE,CACT,CAAA;AACL,CAAC;AAED,SAAS,eAAe;IACpB,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,eAAe,KAAK,UAAU,EAAE,CAAC;QAC7E,OAAO,SAAS,CAAC;IACrB,CAAC;SAAM,CAAC;QACJ,OAAO,CAAC,KAAK,CAAC;;8CAEwB,CAAC,CAAC;QACxC,OAAO,aAAa,CAAC;IACzB,CAAC;AACL,CAAC;AAED,kBAAe,eAAe,EAAE,CAAC"}

package/lib/test-utils.d.ts

@@ -0,0 +1,2 @@
+declare function pizzaSlice<T extends string>(pizza: string, slices: number[], splitTo?: T[]): Record<T, string> | string[];
+export { pizzaSlice as PizzaSliceFunction };

package/lib/test-utils.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PizzaSliceFunction = pizzaSlice;
+function pizzaSlice(pizza, slices, splitTo) {
+    let offsets = slices.reduce((p, c, i) => [...p, i == 0 ? c : p[i - 1] + c], []);
+    offsets = [0, ...offsets];
+    const parts = slices.map((_, i) => pizza.slice(offsets[i], offsets[i + 1]));
+    if (splitTo === undefined) {
+        return parts;
+    }
+    else {
+        return parts.reduce((p, c, i) => ({ ...p, [splitTo[i]]: c }), {});
+    }
+}
+//# sourceMappingURL=test-utils.js.map

package/lib/test-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-utils.js","sourceRoot":"","sources":["../src/test-utils.ts"],"names":[],"mappings":";;AAyBuB,wCAAkB;AAlBzC,SAAS,UAAU,CACf,KAAa,EACb,MAAgB,EAChB,OAAa;IAEb,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,CAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1F,OAAO,GAAG,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACjB,CAAC;SAAM,CAAC;QACJ,OAAO,KAAK,CAAC,MAAM,CACf,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACxC,EAAS,CACZ,CAAC;IACN,CAAC;AACL,CAAC"}

package/package.json

@@ -0,0 +1,52 @@
+{
+  "name": "hamsterid",
+  "version": "1.0.1",
+  "description": "lexicographically sortable unique identifier generator",
+  "author": "afarmerdev",
+  "license": "MIT",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "bin": {
+    "hamsterid": "lib/cli.js"
+  },
+  "files": [
+    "lib",
+    "README.md",
+    "LICENCE"
+  ],
+  "keywords": [
+    "uuid",
+    "ulid",
+    "unique",
+    "lexicographically",
+    "sortable",
+    "random",
+    "uniqueid",
+    "identifier",
+    "id-generator"
+  ],
+  "engines": {
+    "node": ">=10.13"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/afarmerdev/hamsterid.git"
+  },
+  "homepage": "https://github.com/afarmerdev/hamsterid#readme",
+  "bugs": {
+    "url": "https://github.com/afarmerdev/hamsterid/issues"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.lib.json",
+    "typecheck": "tsc --noEmit",
+    "test": "jest",
+    "prepublishOnly": "npm run build && npm test"
+  },
+  "devDependencies": {
+    "@types/jest": "^29.5.14",
+    "@types/node": "^22.7.7",
+    "jest": "^29.7.0",
+    "ts-jest": "^29.2.5",
+    "typescript": "^5.6.3"
+  }
+}