@cassida/compiler 0.1.0 → 0.1.1

package/dist/hasher.d.ts

@@ -4,5 +4,30 @@ export interface HashOptions {
     readonly prefix?: string;
     readonly length?: number;
 }
+/**
+ * Build-time class-name hasher.
+ *
+ * Uses MurmurHash3 (x86, 32-bit) — a non-cryptographic hash with good
+ * distribution and low collision rate over ASCII inputs.
+ *
+ * Why not `node:crypto`? It pulls Node-only APIs into modules that
+ * eventually transit through bundlers. When the bundler thinks a
+ * downstream module *might* still reach `cas()` at runtime (e.g. when
+ * tree-shake is conservative), it traces the import graph into
+ * `hasher.ts` and chokes on `node:crypto`'s missing `createHash`
+ * export in browser-stub mode. A self-contained JS implementation
+ * avoids that whole class of build-time failures and ships zero
+ * dependencies.
+ *
+ * Hash strength is non-cryptographic by design — collisions are
+ * detected at build time by the emitter (`CssEmitter.add` throws on
+ * a class name with two distinct canonical bags), so a chance
+ * collision surfaces as a clear error, not a silent miscompile.
+ *
+ * For lengths > 8 hex chars, additional 32-bit rounds with
+ * incrementing seed are concatenated until the requested length is
+ * met. This preserves the existing API (length 4..40) without
+ * forcing a bigger algorithm or dual-package complexity.
+ */
 export declare function hash(canonical: string, options?: HashOptions): string;
 //# sourceMappingURL=hasher.d.ts.map

package/dist/hasher.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hasher.d.ts","sourceRoot":"","sources":["../src/hasher.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,cAAc,SAAS,CAAC;AACrC,eAAO,MAAM,cAAc,IAAI,CAAC;AAEhC,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,wBAAgB,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,MAAM,CAKzE"}
+{"version":3,"file":"hasher.d.ts","sourceRoot":"","sources":["../src/hasher.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,cAAc,SAAS,CAAC;AACrC,eAAO,MAAM,cAAc,IAAI,CAAC;AAEhC,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,MAAM,CAgBzE"}

package/dist/hasher.js

@@ -1,10 +1,103 @@
-import { createHash } from 'node:crypto';
 export const DEFAULT_PREFIX = 'cas-';
 export const DEFAULT_LENGTH = 8;
+/**
+ * Build-time class-name hasher.
+ *
+ * Uses MurmurHash3 (x86, 32-bit) — a non-cryptographic hash with good
+ * distribution and low collision rate over ASCII inputs.
+ *
+ * Why not `node:crypto`? It pulls Node-only APIs into modules that
+ * eventually transit through bundlers. When the bundler thinks a
+ * downstream module *might* still reach `cas()` at runtime (e.g. when
+ * tree-shake is conservative), it traces the import graph into
+ * `hasher.ts` and chokes on `node:crypto`'s missing `createHash`
+ * export in browser-stub mode. A self-contained JS implementation
+ * avoids that whole class of build-time failures and ships zero
+ * dependencies.
+ *
+ * Hash strength is non-cryptographic by design — collisions are
+ * detected at build time by the emitter (`CssEmitter.add` throws on
+ * a class name with two distinct canonical bags), so a chance
+ * collision surfaces as a clear error, not a silent miscompile.
+ *
+ * For lengths > 8 hex chars, additional 32-bit rounds with
+ * incrementing seed are concatenated until the requested length is
+ * met. This preserves the existing API (length 4..40) without
+ * forcing a bigger algorithm or dual-package complexity.
+ */
 export function hash(canonical, options = {}) {
     const prefix = options.prefix ?? DEFAULT_PREFIX;
     const length = options.length ?? DEFAULT_LENGTH;
-    const digest = createHash('sha1').update(canonical).digest('hex');
-    return prefix + digest.slice(0, length);
+    // Encode once outside the round loop. For length > 8 we run multiple
+    // 32-bit rounds with incrementing seeds, but the input bytes don't
+    // change — re-encoding per round is pure waste and grows linear in
+    // the canonical-bag size for every extra hex char requested.
+    const bytes = utf8Bytes(canonical);
+    let hex = '';
+    let seed = 0;
+    while (hex.length < length) {
+        hex += murmur3_32(bytes, seed).toString(16).padStart(8, '0');
+        seed++;
+    }
+    return prefix + hex.slice(0, length);
+}
+/**
+ * MurmurHash3 x86 32-bit. Public-domain algorithm by Austin Appleby.
+ *
+ * Takes a pre-encoded UTF-8 byte sequence so the caller can amortize
+ * encoding across multiple seeded rounds. All arithmetic is kept in
+ * unsigned 32-bit territory via `>>> 0` and `Math.imul`, both of
+ * which V8 / SpiderMonkey JIT fast-path. Returns a non-negative
+ * 32-bit integer.
+ */
+function murmur3_32(bytes, seed = 0) {
+    const len = bytes.length;
+    const nblocks = Math.floor(len / 4);
+    const c1 = 0xcc9e2d51;
+    const c2 = 0x1b873593;
+    let h1 = seed >>> 0;
+    for (let i = 0; i < nblocks; i++) {
+        const o = i * 4;
+        let k1 = (bytes[o] |
+            (bytes[o + 1] << 8) |
+            (bytes[o + 2] << 16) |
+            (bytes[o + 3] << 24)) >>>
+            0;
+        k1 = Math.imul(k1, c1) >>> 0;
+        k1 = ((k1 << 15) | (k1 >>> 17)) >>> 0;
+        k1 = Math.imul(k1, c2) >>> 0;
+        h1 = (h1 ^ k1) >>> 0;
+        h1 = ((h1 << 13) | (h1 >>> 19)) >>> 0;
+        h1 = (Math.imul(h1, 5) + 0xe6546b64) >>> 0;
+    }
+    // tail
+    let k1 = 0;
+    const tailStart = nblocks * 4;
+    const rem = len & 3;
+    if (rem >= 3)
+        k1 ^= bytes[tailStart + 2] << 16;
+    if (rem >= 2)
+        k1 ^= bytes[tailStart + 1] << 8;
+    if (rem >= 1) {
+        k1 ^= bytes[tailStart];
+        k1 = Math.imul(k1, c1) >>> 0;
+        k1 = ((k1 << 15) | (k1 >>> 17)) >>> 0;
+        k1 = Math.imul(k1, c2) >>> 0;
+        h1 = (h1 ^ k1) >>> 0;
+    }
+    // finalization
+    h1 = (h1 ^ len) >>> 0;
+    h1 = (h1 ^ (h1 >>> 16)) >>> 0;
+    h1 = Math.imul(h1, 0x85ebca6b) >>> 0;
+    h1 = (h1 ^ (h1 >>> 13)) >>> 0;
+    h1 = Math.imul(h1, 0xc2b2ae35) >>> 0;
+    h1 = (h1 ^ (h1 >>> 16)) >>> 0;
+    return h1 >>> 0;
+}
+// Module-level encoder. `TextEncoder` is stateless once constructed,
+// so reusing one instance avoids per-hash allocation.
+const utf8Encoder = new TextEncoder();
+function utf8Bytes(s) {
+    return utf8Encoder.encode(s);
 }
 //# sourceMappingURL=hasher.js.map

package/dist/hasher.js.map

@@ -1 +1 @@
-{"version":3,"file":"hasher.js","sourceRoot":"","sources":["../src/hasher.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC;AACrC,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAOhC,MAAM,UAAU,IAAI,CAAC,SAAiB,EAAE,UAAuB,EAAE;IAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IAChD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IAChD,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClE,OAAO,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC1C,CAAC"}
+{"version":3,"file":"hasher.js","sourceRoot":"","sources":["../src/hasher.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC;AACrC,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAOhC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,IAAI,CAAC,SAAiB,EAAE,UAAuB,EAAE;IAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IAChD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IAEhD,qEAAqE;IACrE,mEAAmE;IACnE,mEAAmE;IACnE,6DAA6D;IAC7D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IACnC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;QAC3B,GAAG,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7D,IAAI,EAAE,CAAC;IACT,CAAC;IACD,OAAO,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,KAAiB,EAAE,OAAe,CAAC;IACrD,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAEpC,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,IAAI,EAAE,GAAG,IAAI,KAAK,CAAC,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,IAAI,EAAE,GACJ,CAAC,KAAK,CAAC,CAAC,CAAE;YACR,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,CAAC,CAAC;YACpB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,EAAE,CAAC;YACrB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,EAAE,CAAC,CAAC;YACxB,CAAC,CAAC;QAEJ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC7B,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAE7B,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO;IACP,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,SAAS,GAAG,OAAO,GAAG,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IACpB,IAAI,GAAG,IAAI,CAAC;QAAE,EAAE,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,CAAE,IAAI,EAAE,CAAC;IAChD,IAAI,GAAG,IAAI,CAAC;QAAE,EAAE,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,CAAE,IAAI,CAAC,CAAC;IAC/C,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;QACb,EAAE,IAAI,KAAK,CAAC,SAAS,CAAE,CAAC;QACxB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC7B,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC7B,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,eAAe;IACf,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACrC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACrC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAE9B,OAAO,EAAE,KAAK,CAAC,CAAC;AAClB,CAAC;AAED,qEAAqE;AACrE,sDAAsD;AACtD,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;AAEtC,SAAS,SAAS,CAAC,CAAS;IAC1B,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC"}

package/package.json

@@ -1,16 +1,21 @@
 {
   "name": "@cassida/compiler",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "Cassida build-time CSS resolver: registry, canonicalizer, hasher, emitter.",
   "license": "MIT",
+  "sideEffects": false,
   "type": "module",
   "main": "./dist/index.js",
+  "module": "./dist/index.js",
   "types": "./dist/index.d.ts",
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
-    }
+      "import": "./dist/index.js",
+      "default": "./dist/index.js"
+    },
+    "./config.schema.json": "./config.schema.json",
+    "./package.json": "./package.json"
   },
   "files": [
     "dist",