@fabricorg/experiments-assignment 0.0.1 → 0.0.2

package/dist/index.cjs

@@ -127,9 +127,65 @@ function assign(args) {
   return { variantKey: args.variants[safeIdx].key, bucket, reason: "eligible" };
 }
 
+// src/safe-regex.ts
+var MAX_PATTERN_LENGTH = 256;
+var MAX_INPUT_LENGTH = 2048;
+function safeRegexTest(pattern, input) {
+  if (pattern.length === 0 || pattern.length > MAX_PATTERN_LENGTH) return false;
+  if (input.length > MAX_INPUT_LENGTH) return false;
+  if (/\\[1-9]/.test(pattern)) return false;
+  if (/\(\?(?:[=!]|<[=!])/.test(pattern)) return false;
+  if (hasQuantifiedGroup(pattern)) return false;
+  if (/(?:\*|\+|\?|\{\d+(?:,\d*)?\})(?:\*|\+|\?|\{)/.test(pattern)) return false;
+  try {
+    return new RegExp(pattern, "u").test(input);
+  } catch {
+    return false;
+  }
+}
+function hasQuantifiedGroup(pattern) {
+  let escaped = false;
+  let inClass = false;
+  const stack = [];
+  for (let index = 0; index < pattern.length; index += 1) {
+    const char = pattern[index];
+    if (escaped) {
+      escaped = false;
+      continue;
+    }
+    if (char === "\\") {
+      escaped = true;
+      continue;
+    }
+    if (char === "[") inClass = true;
+    if (char === "]") inClass = false;
+    if (inClass) continue;
+    if (char === "(") stack.push(index);
+    if (char === ")") {
+      stack.pop();
+      const next = pattern[index + 1];
+      if (next === "*" || next === "+" || next === "?" || next === "{") return true;
+    }
+  }
+  return stack.length > 0;
+}
+
+// src/allocation.ts
+function isValidVariantAllocation(variants) {
+  if (variants.length < 2) return false;
+  const declared = variants.filter((variant) => variant.weight !== void 0);
+  if (declared.length === 0) return true;
+  if (declared.length !== variants.length) return false;
+  return declared.every(
+    (variant) => Number.isInteger(variant.weight) && Number(variant.weight) >= 0 && Number(variant.weight) <= 1e4
+  ) && declared.reduce((total, variant) => total + Number(variant.weight), 0) === 1e4;
+}
+
 exports.BUCKET_PRECISION = BUCKET_PRECISION;
 exports.assign = assign;
 exports.bucketFor = bucketFor;
+exports.isValidVariantAllocation = isValidVariantAllocation;
 exports.murmur3_x86_32 = murmur3_x86_32;
+exports.safeRegexTest = safeRegexTest;
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/hash.ts","../src/bucket.ts","../src/assign.ts"],"names":["k1"],"mappings":";;;AAOO,SAAS,cAAA,CAAe,GAAA,EAAa,IAAA,GAAO,CAAA,EAAW;AAC5D,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,MAAM,MAAM,IAAA,CAAK,MAAA;AACjB,EAAA,MAAM,UAAU,GAAA,KAAQ,CAAA;AACxB,EAAA,IAAI,KAAK,IAAA,KAAS,CAAA;AAClB,EAAA,MAAM,EAAA,GAAK,UAAA;AACX,EAAA,MAAM,EAAA,GAAK,SAAA;AAEX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,EAAS,CAAA,EAAA,EAAK;AAChC,IAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,IAAA,IAAIA,GAAAA,GACD,KAAK,CAAC,CAAA,GAAK,OACV,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,KACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,MACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,EAAA;AAE5B,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AACjB,IAAAA,GAAAA,GAAK,MAAA,CAAOA,GAAAA,EAAI,EAAE,CAAA;AAClB,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AAEjB,IAAA,EAAA,IAAMA,GAAAA;AACN,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAM,KAAA,CAAM,EAAA,EAAI,CAAC,CAAA,GAAI,UAAA,KAAgB,CAAA;AAAA,EACvC;AAEA,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,MAAM,OAAO,GAAA,GAAM,CAAA;AACnB,EAAA,MAAM,YAAY,OAAA,GAAU,CAAA;AAC5B,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,EAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,CAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,EAAA,IAAM,IAAA,CAAK,SAAS,CAAA,GAAK,GAAA;AACzB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,IAAM,EAAA;AAAA,EACR;AAEA,EAAA,EAAA,IAAM,GAAA;AACN,EAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AACd,EAAA,OAAO,EAAA,KAAO,CAAA;AAChB;AAEA,SAAS,MAAA,CAAO,GAAW,CAAA,EAAmB;AAC5C,EAAA,OAAA,CAAS,CAAA,IAAK,CAAA,GAAM,CAAA,KAAO,EAAA,GAAK,CAAA,MAAS,CAAA;AAC3C;AAEA,SAAS,KAAA,CAAM,GAAW,CAAA,EAAmB;AAC3C,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,OAAS,GAAA,GAAM,OAAU,GAAA,GAAM,GAAA,GAAM,MAAM,GAAA,IAAQ,EAAA,KAAQ,CAAA,GAAK,CAAA,CAAA,KAAQ,CAAA,KAAO,CAAA;AACjF;AAEA,SAAS,OAAO,CAAA,EAAmB;AACjC,EAAA,IAAI,IAAI,CAAA,KAAM,CAAA;AACd,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,OAAO,CAAA,KAAM,CAAA;AACf;AAEA,SAAS,UAAU,CAAA,EAAuB;AACxC,EAAA,IAAI,OAAO,gBAAgB,WAAA,EAAa,OAAO,IAAI,WAAA,EAAY,CAAE,OAAO,CAAC,CAAA;AAEzE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AACtB,IAAA,IAAI,IAAI,GAAA,EAAM;AACZ,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,IACZ,CAAA,MAAA,IAAW,IAAI,IAAA,EAAO;AACpB,MAAA,GAAA,CAAI,KAAK,GAAA,GAAQ,CAAA,IAAK,CAAA,EAAI,GAAA,GAAQ,IAAI,EAAK,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,KAAK,KAAA,IAAU,CAAA,IAAK,SAAU,CAAA,GAAI,CAAA,GAAI,EAAE,MAAA,EAAQ;AACzD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,UAAA,CAAW,CAAA,GAAI,CAAC,CAAA;AAC7B,MAAA,IAAI,EAAA,IAAM,KAAA,IAAU,EAAA,IAAM,KAAA,EAAQ;AAChC,QAAA,CAAA,GAAI,KAAA,IAAA,CAAa,CAAA,GAAI,IAAA,KAAU,EAAA,GAAO,EAAA,GAAK,IAAA,CAAA;AAC3C,QAAA,CAAA,EAAA;AACA,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,MAAQ,CAAA,IAAK,EAAA;AAAA,UACb,GAAA,GAAS,KAAK,EAAA,GAAM,EAAA;AAAA,UACpB,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA;AAAA,UACnB,MAAQ,CAAA,GAAI;AAAA,SACd;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,GAAQ,CAAA,IAAK,EAAA,EAAK,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA,EAAO,GAAA,GAAQ,CAAA,GAAI,EAAK,CAAA;AAAA,IACxE;AAAA,EACF;AACA,EAAA,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B;;;ACjGO,IAAM,gBAAA,GAAmB;AAMzB,SAAS,SAAA,CAAU,YAAA,EAAsB,IAAA,EAAc,SAAA,EAA2B;AACvF,EAAA,MAAM,MAAM,CAAA,EAAG,YAAY,CAAA,CAAA,EAAI,IAAI,IAAI,SAAS,CAAA,CAAA;AAChD,EAAA,OAAO,cAAA,CAAe,GAAG,CAAA,GAAI,gBAAA;AAC/B;;;ACsBO,SAAS,OAAO,IAAA,EAAoC;AACzD,EAAA,MAAM,SAAS,SAAA,CAAU,IAAA,CAAK,cAAc,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AAErE,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,MAAM,UAAA,GAAa,KAAK,UAAA,IAAc,CAAA;AACtC,EAAA,IAAI,aAAa,CAAA,EAAG;AAElB,IAAA,MAAM,YAAA,GACJ,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,YAAY,WAAW,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA,GAAI,gBAAA;AACxE,IAAA,IAAI,gBAAgB,UAAA,EAAY;AAC9B,MAAA,OAAO,EAAE,UAAA,EAAY,IAAA,EAAM,MAAA,EAAQ,QAAQ,YAAA,EAAa;AAAA,IAC1D;AAAA,EACF;AAEA,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,IAAU,CAAA,CAAA,EAAI,CAAC,CAAA;AAC3E,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,IAAI,kBAAkB,gBAAA,EAAkB;AACtC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR,cAAc,IAAA,CAAK,YAAY,CAAA,8BAAA,EAAiC,gBAAgB,SAAS,aAAa,CAAA;AAAA,OACxG;AAAA,IACF;AACA,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,UAAA,IAAc,EAAE,MAAA,IAAU,CAAA;AAC1B,MAAA,IAAI,MAAA,GAAS,YAAY,OAAO,EAAE,YAAY,CAAA,CAAE,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAAA,IAClF;AAEA,IAAA,OAAO;AAAA,MACL,YAAY,IAAA,CAAK,QAAA,CAAS,KAAK,QAAA,CAAS,MAAA,GAAS,CAAC,CAAA,CAAG,GAAA;AAAA,MACrD,MAAA;AAAA,MACA,MAAA,EAAQ;AAAA,KACV;AAAA,EACF;AAGA,EAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAO,SAAS,gBAAA,GAAoB,IAAA,CAAK,SAAS,MAAM,CAAA;AACzE,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AACtD,EAAA,OAAO,EAAE,YAAY,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,CAAG,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAC/E","file":"index.cjs","sourcesContent":["/**\n * MurmurHash3 x86 32-bit. The deterministic bucketing primitive for every\n * Fabric Experiments SDK. See docs/adr/0001-assignment-hash.md.\n *\n * Inputs are hashed as their UTF-8 byte representation.\n * Output is treated as uint32 (sign-fixed via `>>> 0`).\n */\nexport function murmur3_x86_32(key: string, seed = 0): number {\n  const data = utf8Bytes(key);\n  const len = data.length;\n  const nblocks = len >>> 2;\n  let h1 = seed >>> 0;\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n\n  for (let i = 0; i < nblocks; i++) {\n    const o = i * 4;\n    let k1 =\n      (data[o]! & 0xff) |\n      ((data[o + 1]! & 0xff) << 8) |\n      ((data[o + 2]! & 0xff) << 16) |\n      ((data[o + 3]! & 0xff) << 24);\n\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n\n    h1 ^= k1;\n    h1 = rotl32(h1, 13);\n    h1 = (mul32(h1, 5) + 0xe6546b64) >>> 0;\n  }\n\n  let k1 = 0;\n  const tail = len & 3;\n  const tailStart = nblocks * 4;\n  if (tail >= 3) k1 ^= (data[tailStart + 2]! & 0xff) << 16;\n  if (tail >= 2) k1 ^= (data[tailStart + 1]! & 0xff) << 8;\n  if (tail >= 1) {\n    k1 ^= data[tailStart]! & 0xff;\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n    h1 ^= k1;\n  }\n\n  h1 ^= len;\n  h1 = fmix32(h1);\n  return h1 >>> 0;\n}\n\nfunction rotl32(x: number, r: number): number {\n  return ((x << r) | (x >>> (32 - r))) >>> 0;\n}\n\nfunction mul32(a: number, b: number): number {\n  const aHi = (a >>> 16) & 0xffff;\n  const aLo = a & 0xffff;\n  const bHi = (b >>> 16) & 0xffff;\n  const bLo = b & 0xffff;\n  return ((aLo * bLo + ((((aHi * bLo + aLo * bHi) << 16) >>> 0) | 0)) >>> 0) >>> 0;\n}\n\nfunction fmix32(h: number): number {\n  let x = h >>> 0;\n  x ^= x >>> 16;\n  x = mul32(x, 0x85ebca6b);\n  x ^= x >>> 13;\n  x = mul32(x, 0xc2b2ae35);\n  x ^= x >>> 16;\n  return x >>> 0;\n}\n\nfunction utf8Bytes(s: string): Uint8Array {\n  if (typeof TextEncoder !== 'undefined') return new TextEncoder().encode(s);\n  // Fallback for environments without TextEncoder.\n  const out: number[] = [];\n  for (let i = 0; i < s.length; i++) {\n    let c = s.charCodeAt(i);\n    if (c < 0x80) {\n      out.push(c);\n    } else if (c < 0x800) {\n      out.push(0xc0 | (c >> 6), 0x80 | (c & 0x3f));\n    } else if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n      const c2 = s.charCodeAt(i + 1);\n      if (c2 >= 0xdc00 && c2 <= 0xdfff) {\n        c = 0x10000 + (((c & 0x3ff) << 10) | (c2 & 0x3ff));\n        i++;\n        out.push(\n          0xf0 | (c >> 18),\n          0x80 | ((c >> 12) & 0x3f),\n          0x80 | ((c >> 6) & 0x3f),\n          0x80 | (c & 0x3f),\n        );\n      }\n    } else {\n      out.push(0xe0 | (c >> 12), 0x80 | ((c >> 6) & 0x3f), 0x80 | (c & 0x3f));\n    }\n  }\n  return new Uint8Array(out);\n}\n","import { murmur3_x86_32 } from './hash.js';\n\nexport const BUCKET_PRECISION = 10000 as const;\n\n/**\n * Returns an integer in [0, BUCKET_PRECISION) deterministic in (experimentId, salt, subjectId).\n * Contract: see docs/adr/0001-assignment-hash.md.\n */\nexport function bucketFor(experimentId: string, salt: string, subjectId: string): number {\n  const key = `${experimentId}:${salt}:${subjectId}`;\n  return murmur3_x86_32(key) % BUCKET_PRECISION;\n}\n","import { BUCKET_PRECISION, bucketFor } from './bucket.js';\n\nexport interface ManifestVariant {\n  key: string;\n  /** Optional explicit weight; if any variant declares one, weights of all others are required. */\n  weight?: number;\n}\n\nexport interface AssignArgs {\n  experimentId: string;\n  salt: string;\n  subjectId: string;\n  variants: readonly ManifestVariant[];\n  /** Sample rate in [0, 1] of eligible traffic the experiment applies to. */\n  sampleRate?: number;\n  /** Pre-existing sticky assignment — if set and matches a current variant, returned as-is. */\n  stickyVariantKey?: string;\n  /** Forced override (preview / QA). Highest priority. */\n  forcedVariantKey?: string;\n}\n\nexport type AssignmentReason = 'eligible' | 'sticky' | 'forced' | 'ineligible';\n\nexport interface AssignmentResult {\n  variantKey: string | null;\n  bucket: number;\n  reason: AssignmentReason;\n}\n\n/**\n * Returns deterministic assignment for a subject. `null` variant + reason `ineligible`\n * means the subject was sampled out and the SDK must NOT log an exposure.\n */\nexport function assign(args: AssignArgs): AssignmentResult {\n  const bucket = bucketFor(args.experimentId, args.salt, args.subjectId);\n\n  if (args.forcedVariantKey && args.variants.some((v) => v.key === args.forcedVariantKey)) {\n    return { variantKey: args.forcedVariantKey, bucket, reason: 'forced' };\n  }\n\n  if (args.stickyVariantKey && args.variants.some((v) => v.key === args.stickyVariantKey)) {\n    return { variantKey: args.stickyVariantKey, bucket, reason: 'sticky' };\n  }\n\n  const sampleRate = args.sampleRate ?? 1;\n  if (sampleRate < 1) {\n    // Use a separate hash-derived value for sampling so it's independent of variant assignment.\n    const sampleBucket =\n      bucketFor(`${args.experimentId}:sample`, args.salt, args.subjectId) / BUCKET_PRECISION;\n    if (sampleBucket >= sampleRate) {\n      return { variantKey: null, bucket, reason: 'ineligible' };\n    }\n  }\n\n  const totalDeclared = args.variants.reduce((s, v) => s + (v.weight ?? 0), 0);\n  if (totalDeclared > 0) {\n    if (totalDeclared !== BUCKET_PRECISION) {\n      throw new Error(\n        `experiment ${args.experimentId}: variant weights must sum to ${BUCKET_PRECISION}, got ${totalDeclared}`,\n      );\n    }\n    let cumulative = 0;\n    for (const v of args.variants) {\n      cumulative += v.weight ?? 0;\n      if (bucket < cumulative) return { variantKey: v.key, bucket, reason: 'eligible' };\n    }\n    // Numerical safety net.\n    return {\n      variantKey: args.variants[args.variants.length - 1]!.key,\n      bucket,\n      reason: 'eligible',\n    };\n  }\n\n  // Even split.\n  const idx = Math.floor((bucket / BUCKET_PRECISION) * args.variants.length);\n  const safeIdx = Math.min(idx, args.variants.length - 1);\n  return { variantKey: args.variants[safeIdx]!.key, bucket, reason: 'eligible' };\n}\n"]}
+{"version":3,"sources":["../src/hash.ts","../src/bucket.ts","../src/assign.ts","../src/safe-regex.ts","../src/allocation.ts"],"names":["k1"],"mappings":";;;AAOO,SAAS,cAAA,CAAe,GAAA,EAAa,IAAA,GAAO,CAAA,EAAW;AAC5D,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,MAAM,MAAM,IAAA,CAAK,MAAA;AACjB,EAAA,MAAM,UAAU,GAAA,KAAQ,CAAA;AACxB,EAAA,IAAI,KAAK,IAAA,KAAS,CAAA;AAClB,EAAA,MAAM,EAAA,GAAK,UAAA;AACX,EAAA,MAAM,EAAA,GAAK,SAAA;AAEX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,EAAS,CAAA,EAAA,EAAK;AAChC,IAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,IAAA,IAAIA,GAAAA,GACD,KAAK,CAAC,CAAA,GAAK,OACV,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,KACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,MACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,EAAA;AAE5B,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AACjB,IAAAA,GAAAA,GAAK,MAAA,CAAOA,GAAAA,EAAI,EAAE,CAAA;AAClB,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AAEjB,IAAA,EAAA,IAAMA,GAAAA;AACN,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAM,KAAA,CAAM,EAAA,EAAI,CAAC,CAAA,GAAI,UAAA,KAAgB,CAAA;AAAA,EACvC;AAEA,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,MAAM,OAAO,GAAA,GAAM,CAAA;AACnB,EAAA,MAAM,YAAY,OAAA,GAAU,CAAA;AAC5B,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,EAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,CAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,EAAA,IAAM,IAAA,CAAK,SAAS,CAAA,GAAK,GAAA;AACzB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,IAAM,EAAA;AAAA,EACR;AAEA,EAAA,EAAA,IAAM,GAAA;AACN,EAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AACd,EAAA,OAAO,EAAA,KAAO,CAAA;AAChB;AAEA,SAAS,MAAA,CAAO,GAAW,CAAA,EAAmB;AAC5C,EAAA,OAAA,CAAS,CAAA,IAAK,CAAA,GAAM,CAAA,KAAO,EAAA,GAAK,CAAA,MAAS,CAAA;AAC3C;AAEA,SAAS,KAAA,CAAM,GAAW,CAAA,EAAmB;AAC3C,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,OAAS,GAAA,GAAM,OAAU,GAAA,GAAM,GAAA,GAAM,MAAM,GAAA,IAAQ,EAAA,KAAQ,CAAA,GAAK,CAAA,CAAA,KAAQ,CAAA,KAAO,CAAA;AACjF;AAEA,SAAS,OAAO,CAAA,EAAmB;AACjC,EAAA,IAAI,IAAI,CAAA,KAAM,CAAA;AACd,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,OAAO,CAAA,KAAM,CAAA;AACf;AAEA,SAAS,UAAU,CAAA,EAAuB;AACxC,EAAA,IAAI,OAAO,gBAAgB,WAAA,EAAa,OAAO,IAAI,WAAA,EAAY,CAAE,OAAO,CAAC,CAAA;AAEzE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AACtB,IAAA,IAAI,IAAI,GAAA,EAAM;AACZ,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,IACZ,CAAA,MAAA,IAAW,IAAI,IAAA,EAAO;AACpB,MAAA,GAAA,CAAI,KAAK,GAAA,GAAQ,CAAA,IAAK,CAAA,EAAI,GAAA,GAAQ,IAAI,EAAK,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,KAAK,KAAA,IAAU,CAAA,IAAK,SAAU,CAAA,GAAI,CAAA,GAAI,EAAE,MAAA,EAAQ;AACzD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,UAAA,CAAW,CAAA,GAAI,CAAC,CAAA;AAC7B,MAAA,IAAI,EAAA,IAAM,KAAA,IAAU,EAAA,IAAM,KAAA,EAAQ;AAChC,QAAA,CAAA,GAAI,KAAA,IAAA,CAAa,CAAA,GAAI,IAAA,KAAU,EAAA,GAAO,EAAA,GAAK,IAAA,CAAA;AAC3C,QAAA,CAAA,EAAA;AACA,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,MAAQ,CAAA,IAAK,EAAA;AAAA,UACb,GAAA,GAAS,KAAK,EAAA,GAAM,EAAA;AAAA,UACpB,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA;AAAA,UACnB,MAAQ,CAAA,GAAI;AAAA,SACd;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,GAAQ,CAAA,IAAK,EAAA,EAAK,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA,EAAO,GAAA,GAAQ,CAAA,GAAI,EAAK,CAAA;AAAA,IACxE;AAAA,EACF;AACA,EAAA,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B;;;ACjGO,IAAM,gBAAA,GAAmB;AAMzB,SAAS,SAAA,CAAU,YAAA,EAAsB,IAAA,EAAc,SAAA,EAA2B;AACvF,EAAA,MAAM,MAAM,CAAA,EAAG,YAAY,CAAA,CAAA,EAAI,IAAI,IAAI,SAAS,CAAA,CAAA;AAChD,EAAA,OAAO,cAAA,CAAe,GAAG,CAAA,GAAI,gBAAA;AAC/B;;;ACsBO,SAAS,OAAO,IAAA,EAAoC;AACzD,EAAA,MAAM,SAAS,SAAA,CAAU,IAAA,CAAK,cAAc,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AAErE,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,MAAM,UAAA,GAAa,KAAK,UAAA,IAAc,CAAA;AACtC,EAAA,IAAI,aAAa,CAAA,EAAG;AAElB,IAAA,MAAM,YAAA,GACJ,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,YAAY,WAAW,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA,GAAI,gBAAA;AACxE,IAAA,IAAI,gBAAgB,UAAA,EAAY;AAC9B,MAAA,OAAO,EAAE,UAAA,EAAY,IAAA,EAAM,MAAA,EAAQ,QAAQ,YAAA,EAAa;AAAA,IAC1D;AAAA,EACF;AAEA,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,IAAU,CAAA,CAAA,EAAI,CAAC,CAAA;AAC3E,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,IAAI,kBAAkB,gBAAA,EAAkB;AACtC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR,cAAc,IAAA,CAAK,YAAY,CAAA,8BAAA,EAAiC,gBAAgB,SAAS,aAAa,CAAA;AAAA,OACxG;AAAA,IACF;AACA,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,UAAA,IAAc,EAAE,MAAA,IAAU,CAAA;AAC1B,MAAA,IAAI,MAAA,GAAS,YAAY,OAAO,EAAE,YAAY,CAAA,CAAE,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAAA,IAClF;AAEA,IAAA,OAAO;AAAA,MACL,YAAY,IAAA,CAAK,QAAA,CAAS,KAAK,QAAA,CAAS,MAAA,GAAS,CAAC,CAAA,CAAG,GAAA;AAAA,MACrD,MAAA;AAAA,MACA,MAAA,EAAQ;AAAA,KACV;AAAA,EACF;AAGA,EAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAO,SAAS,gBAAA,GAAoB,IAAA,CAAK,SAAS,MAAM,CAAA;AACzE,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AACtD,EAAA,OAAO,EAAE,YAAY,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,CAAG,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAC/E;;;AC9EA,IAAM,kBAAA,GAAqB,GAAA;AAC3B,IAAM,gBAAA,GAAmB,IAAA;AAOlB,SAAS,aAAA,CAAc,SAAiB,KAAA,EAAwB;AACrE,EAAA,IAAI,QAAQ,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,MAAA,GAAS,oBAAoB,OAAO,KAAA;AACxE,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,gBAAA,EAAkB,OAAO,KAAA;AAC5C,EAAA,IAAI,SAAA,CAAU,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AACpC,EAAA,IAAI,oBAAA,CAAqB,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AAC/C,EAAA,IAAI,kBAAA,CAAmB,OAAO,CAAA,EAAG,OAAO,KAAA;AACxC,EAAA,IAAI,8CAAA,CAA+C,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AACzE,EAAA,IAAI;AACF,IAAA,OAAO,IAAI,MAAA,CAAO,OAAA,EAAS,GAAG,CAAA,CAAE,KAAK,KAAK,CAAA;AAAA,EAC5C,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAEA,SAAS,mBAAmB,OAAA,EAA0B;AACpD,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,OAAA,CAAQ,MAAA,EAAQ,SAAS,CAAA,EAAG;AACtD,IAAA,MAAM,IAAA,GAAO,QAAQ,KAAK,CAAA;AAC1B,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,OAAA,GAAU,KAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAA,GAAU,IAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,KAAK,OAAA,GAAU,IAAA;AAC5B,IAAA,IAAI,IAAA,KAAS,KAAK,OAAA,GAAU,KAAA;AAC5B,IAAA,IAAI,OAAA,EAAS;AACb,IAAA,IAAI,IAAA,KAAS,GAAA,EAAK,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAClC,IAAA,IAAI,SAAS,GAAA,EAAK;AAChB,MAAA,KAAA,CAAM,GAAA,EAAI;AACV,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,GAAQ,CAAC,CAAA;AAC9B,MAAA,IAAI,IAAA,KAAS,OAAO,IAAA,KAAS,GAAA,IAAO,SAAS,GAAA,IAAO,IAAA,KAAS,KAAK,OAAO,IAAA;AAAA,IAC3E;AAAA,EACF;AACA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA;AACxB;;;AC1CO,SAAS,yBAAyB,QAAA,EAA+C;AACtF,EAAA,IAAI,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,OAAO,KAAA;AAChC,EAAA,MAAM,WAAW,QAAA,CAAS,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,WAAW,MAAS,CAAA;AAC1E,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAClC,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,QAAA,CAAS,MAAA,EAAQ,OAAO,KAAA;AAChD,EAAA,OACE,QAAA,CAAS,KAAA;AAAA,IACP,CAAC,OAAA,KACC,MAAA,CAAO,SAAA,CAAU,QAAQ,MAAM,CAAA,IAC/B,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,IAAK,CAAA,IAC1B,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,IAAK;AAAA,GAC9B,IAAK,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,EAAO,OAAA,KAAY,KAAA,GAAQ,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,GAAA;AAEpF","file":"index.cjs","sourcesContent":["/**\n * MurmurHash3 x86 32-bit. The deterministic bucketing primitive for every\n * Fabric Experiments SDK. See docs/adr/0001-assignment-hash.md.\n *\n * Inputs are hashed as their UTF-8 byte representation.\n * Output is treated as uint32 (sign-fixed via `>>> 0`).\n */\nexport function murmur3_x86_32(key: string, seed = 0): number {\n  const data = utf8Bytes(key);\n  const len = data.length;\n  const nblocks = len >>> 2;\n  let h1 = seed >>> 0;\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n\n  for (let i = 0; i < nblocks; i++) {\n    const o = i * 4;\n    let k1 =\n      (data[o]! & 0xff) |\n      ((data[o + 1]! & 0xff) << 8) |\n      ((data[o + 2]! & 0xff) << 16) |\n      ((data[o + 3]! & 0xff) << 24);\n\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n\n    h1 ^= k1;\n    h1 = rotl32(h1, 13);\n    h1 = (mul32(h1, 5) + 0xe6546b64) >>> 0;\n  }\n\n  let k1 = 0;\n  const tail = len & 3;\n  const tailStart = nblocks * 4;\n  if (tail >= 3) k1 ^= (data[tailStart + 2]! & 0xff) << 16;\n  if (tail >= 2) k1 ^= (data[tailStart + 1]! & 0xff) << 8;\n  if (tail >= 1) {\n    k1 ^= data[tailStart]! & 0xff;\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n    h1 ^= k1;\n  }\n\n  h1 ^= len;\n  h1 = fmix32(h1);\n  return h1 >>> 0;\n}\n\nfunction rotl32(x: number, r: number): number {\n  return ((x << r) | (x >>> (32 - r))) >>> 0;\n}\n\nfunction mul32(a: number, b: number): number {\n  const aHi = (a >>> 16) & 0xffff;\n  const aLo = a & 0xffff;\n  const bHi = (b >>> 16) & 0xffff;\n  const bLo = b & 0xffff;\n  return ((aLo * bLo + ((((aHi * bLo + aLo * bHi) << 16) >>> 0) | 0)) >>> 0) >>> 0;\n}\n\nfunction fmix32(h: number): number {\n  let x = h >>> 0;\n  x ^= x >>> 16;\n  x = mul32(x, 0x85ebca6b);\n  x ^= x >>> 13;\n  x = mul32(x, 0xc2b2ae35);\n  x ^= x >>> 16;\n  return x >>> 0;\n}\n\nfunction utf8Bytes(s: string): Uint8Array {\n  if (typeof TextEncoder !== 'undefined') return new TextEncoder().encode(s);\n  // Fallback for environments without TextEncoder.\n  const out: number[] = [];\n  for (let i = 0; i < s.length; i++) {\n    let c = s.charCodeAt(i);\n    if (c < 0x80) {\n      out.push(c);\n    } else if (c < 0x800) {\n      out.push(0xc0 | (c >> 6), 0x80 | (c & 0x3f));\n    } else if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n      const c2 = s.charCodeAt(i + 1);\n      if (c2 >= 0xdc00 && c2 <= 0xdfff) {\n        c = 0x10000 + (((c & 0x3ff) << 10) | (c2 & 0x3ff));\n        i++;\n        out.push(\n          0xf0 | (c >> 18),\n          0x80 | ((c >> 12) & 0x3f),\n          0x80 | ((c >> 6) & 0x3f),\n          0x80 | (c & 0x3f),\n        );\n      }\n    } else {\n      out.push(0xe0 | (c >> 12), 0x80 | ((c >> 6) & 0x3f), 0x80 | (c & 0x3f));\n    }\n  }\n  return new Uint8Array(out);\n}\n","import { murmur3_x86_32 } from './hash.js';\n\nexport const BUCKET_PRECISION = 10000 as const;\n\n/**\n * Returns an integer in [0, BUCKET_PRECISION) deterministic in (experimentId, salt, subjectId).\n * Contract: see docs/adr/0001-assignment-hash.md.\n */\nexport function bucketFor(experimentId: string, salt: string, subjectId: string): number {\n  const key = `${experimentId}:${salt}:${subjectId}`;\n  return murmur3_x86_32(key) % BUCKET_PRECISION;\n}\n","import { BUCKET_PRECISION, bucketFor } from './bucket.js';\n\nexport interface ManifestVariant {\n  key: string;\n  /** Optional explicit weight; if any variant declares one, weights of all others are required. */\n  weight?: number;\n}\n\nexport interface AssignArgs {\n  experimentId: string;\n  salt: string;\n  subjectId: string;\n  variants: readonly ManifestVariant[];\n  /** Sample rate in [0, 1] of eligible traffic the experiment applies to. */\n  sampleRate?: number;\n  /** Pre-existing sticky assignment — if set and matches a current variant, returned as-is. */\n  stickyVariantKey?: string;\n  /** Forced override (preview / QA). Highest priority. */\n  forcedVariantKey?: string;\n}\n\nexport type AssignmentReason = 'eligible' | 'sticky' | 'forced' | 'ineligible';\n\nexport interface AssignmentResult {\n  variantKey: string | null;\n  bucket: number;\n  reason: AssignmentReason;\n}\n\n/**\n * Returns deterministic assignment for a subject. `null` variant + reason `ineligible`\n * means the subject was sampled out and the SDK must NOT log an exposure.\n */\nexport function assign(args: AssignArgs): AssignmentResult {\n  const bucket = bucketFor(args.experimentId, args.salt, args.subjectId);\n\n  if (args.forcedVariantKey && args.variants.some((v) => v.key === args.forcedVariantKey)) {\n    return { variantKey: args.forcedVariantKey, bucket, reason: 'forced' };\n  }\n\n  if (args.stickyVariantKey && args.variants.some((v) => v.key === args.stickyVariantKey)) {\n    return { variantKey: args.stickyVariantKey, bucket, reason: 'sticky' };\n  }\n\n  const sampleRate = args.sampleRate ?? 1;\n  if (sampleRate < 1) {\n    // Use a separate hash-derived value for sampling so it's independent of variant assignment.\n    const sampleBucket =\n      bucketFor(`${args.experimentId}:sample`, args.salt, args.subjectId) / BUCKET_PRECISION;\n    if (sampleBucket >= sampleRate) {\n      return { variantKey: null, bucket, reason: 'ineligible' };\n    }\n  }\n\n  const totalDeclared = args.variants.reduce((s, v) => s + (v.weight ?? 0), 0);\n  if (totalDeclared > 0) {\n    if (totalDeclared !== BUCKET_PRECISION) {\n      throw new Error(\n        `experiment ${args.experimentId}: variant weights must sum to ${BUCKET_PRECISION}, got ${totalDeclared}`,\n      );\n    }\n    let cumulative = 0;\n    for (const v of args.variants) {\n      cumulative += v.weight ?? 0;\n      if (bucket < cumulative) return { variantKey: v.key, bucket, reason: 'eligible' };\n    }\n    // Numerical safety net.\n    return {\n      variantKey: args.variants[args.variants.length - 1]!.key,\n      bucket,\n      reason: 'eligible',\n    };\n  }\n\n  // Even split.\n  const idx = Math.floor((bucket / BUCKET_PRECISION) * args.variants.length);\n  const safeIdx = Math.min(idx, args.variants.length - 1);\n  return { variantKey: args.variants[safeIdx]!.key, bucket, reason: 'eligible' };\n}\n","const MAX_PATTERN_LENGTH = 256;\nconst MAX_INPUT_LENGTH = 2048;\n\n/**\n * Evaluate the deliberately small, RE2-compatible subset accepted by audience\n * targeting. Patterns that rely on backreferences, lookarounds, or quantified\n * groups fail closed instead of reaching the JavaScript backtracking engine.\n */\nexport function safeRegexTest(pattern: string, input: string): boolean {\n  if (pattern.length === 0 || pattern.length > MAX_PATTERN_LENGTH) return false;\n  if (input.length > MAX_INPUT_LENGTH) return false;\n  if (/\\\\[1-9]/.test(pattern)) return false;\n  if (/\\(\\?(?:[=!]|<[=!])/.test(pattern)) return false;\n  if (hasQuantifiedGroup(pattern)) return false;\n  if (/(?:\\*|\\+|\\?|\\{\\d+(?:,\\d*)?\\})(?:\\*|\\+|\\?|\\{)/.test(pattern)) return false;\n  try {\n    return new RegExp(pattern, 'u').test(input);\n  } catch {\n    return false;\n  }\n}\n\nfunction hasQuantifiedGroup(pattern: string): boolean {\n  let escaped = false;\n  let inClass = false;\n  const stack: number[] = [];\n  for (let index = 0; index < pattern.length; index += 1) {\n    const char = pattern[index]!;\n    if (escaped) {\n      escaped = false;\n      continue;\n    }\n    if (char === '\\\\') {\n      escaped = true;\n      continue;\n    }\n    if (char === '[') inClass = true;\n    if (char === ']') inClass = false;\n    if (inClass) continue;\n    if (char === '(') stack.push(index);\n    if (char === ')') {\n      stack.pop();\n      const next = pattern[index + 1];\n      if (next === '*' || next === '+' || next === '?' || next === '{') return true;\n    }\n  }\n  return stack.length > 0;\n}\n","export interface WeightedVariant {\n  weight?: number;\n}\n\n/** Validate direct-injection manifests before either SDK buckets a subject. */\nexport function isValidVariantAllocation(variants: readonly WeightedVariant[]): boolean {\n  if (variants.length < 2) return false;\n  const declared = variants.filter((variant) => variant.weight !== undefined);\n  if (declared.length === 0) return true;\n  if (declared.length !== variants.length) return false;\n  return (\n    declared.every(\n      (variant) =>\n        Number.isInteger(variant.weight) &&\n        Number(variant.weight) >= 0 &&\n        Number(variant.weight) <= 10000,\n    ) && declared.reduce((total, variant) => total + Number(variant.weight), 0) === 10000\n  );\n}\n"]}

package/dist/index.d.cts

@@ -43,4 +43,17 @@ interface AssignmentResult {
  */
 declare function assign(args: AssignArgs): AssignmentResult;
 
-export { type AssignArgs, type AssignmentResult, BUCKET_PRECISION, type ManifestVariant, assign, bucketFor, murmur3_x86_32 };
+/**
+ * Evaluate the deliberately small, RE2-compatible subset accepted by audience
+ * targeting. Patterns that rely on backreferences, lookarounds, or quantified
+ * groups fail closed instead of reaching the JavaScript backtracking engine.
+ */
+declare function safeRegexTest(pattern: string, input: string): boolean;
+
+interface WeightedVariant {
+    weight?: number;
+}
+/** Validate direct-injection manifests before either SDK buckets a subject. */
+declare function isValidVariantAllocation(variants: readonly WeightedVariant[]): boolean;
+
+export { type AssignArgs, type AssignmentResult, BUCKET_PRECISION, type ManifestVariant, type WeightedVariant, assign, bucketFor, isValidVariantAllocation, murmur3_x86_32, safeRegexTest };

package/dist/index.d.ts

@@ -43,4 +43,17 @@ interface AssignmentResult {
  */
 declare function assign(args: AssignArgs): AssignmentResult;
 
-export { type AssignArgs, type AssignmentResult, BUCKET_PRECISION, type ManifestVariant, assign, bucketFor, murmur3_x86_32 };
+/**
+ * Evaluate the deliberately small, RE2-compatible subset accepted by audience
+ * targeting. Patterns that rely on backreferences, lookarounds, or quantified
+ * groups fail closed instead of reaching the JavaScript backtracking engine.
+ */
+declare function safeRegexTest(pattern: string, input: string): boolean;
+
+interface WeightedVariant {
+    weight?: number;
+}
+/** Validate direct-injection manifests before either SDK buckets a subject. */
+declare function isValidVariantAllocation(variants: readonly WeightedVariant[]): boolean;
+
+export { type AssignArgs, type AssignmentResult, BUCKET_PRECISION, type ManifestVariant, type WeightedVariant, assign, bucketFor, isValidVariantAllocation, murmur3_x86_32, safeRegexTest };

package/dist/index.js

@@ -125,6 +125,60 @@ function assign(args) {
   return { variantKey: args.variants[safeIdx].key, bucket, reason: "eligible" };
 }
 
-export { BUCKET_PRECISION, assign, bucketFor, murmur3_x86_32 };
+// src/safe-regex.ts
+var MAX_PATTERN_LENGTH = 256;
+var MAX_INPUT_LENGTH = 2048;
+function safeRegexTest(pattern, input) {
+  if (pattern.length === 0 || pattern.length > MAX_PATTERN_LENGTH) return false;
+  if (input.length > MAX_INPUT_LENGTH) return false;
+  if (/\\[1-9]/.test(pattern)) return false;
+  if (/\(\?(?:[=!]|<[=!])/.test(pattern)) return false;
+  if (hasQuantifiedGroup(pattern)) return false;
+  if (/(?:\*|\+|\?|\{\d+(?:,\d*)?\})(?:\*|\+|\?|\{)/.test(pattern)) return false;
+  try {
+    return new RegExp(pattern, "u").test(input);
+  } catch {
+    return false;
+  }
+}
+function hasQuantifiedGroup(pattern) {
+  let escaped = false;
+  let inClass = false;
+  const stack = [];
+  for (let index = 0; index < pattern.length; index += 1) {
+    const char = pattern[index];
+    if (escaped) {
+      escaped = false;
+      continue;
+    }
+    if (char === "\\") {
+      escaped = true;
+      continue;
+    }
+    if (char === "[") inClass = true;
+    if (char === "]") inClass = false;
+    if (inClass) continue;
+    if (char === "(") stack.push(index);
+    if (char === ")") {
+      stack.pop();
+      const next = pattern[index + 1];
+      if (next === "*" || next === "+" || next === "?" || next === "{") return true;
+    }
+  }
+  return stack.length > 0;
+}
+
+// src/allocation.ts
+function isValidVariantAllocation(variants) {
+  if (variants.length < 2) return false;
+  const declared = variants.filter((variant) => variant.weight !== void 0);
+  if (declared.length === 0) return true;
+  if (declared.length !== variants.length) return false;
+  return declared.every(
+    (variant) => Number.isInteger(variant.weight) && Number(variant.weight) >= 0 && Number(variant.weight) <= 1e4
+  ) && declared.reduce((total, variant) => total + Number(variant.weight), 0) === 1e4;
+}
+
+export { BUCKET_PRECISION, assign, bucketFor, isValidVariantAllocation, murmur3_x86_32, safeRegexTest };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/hash.ts","../src/bucket.ts","../src/assign.ts"],"names":["k1"],"mappings":";AAOO,SAAS,cAAA,CAAe,GAAA,EAAa,IAAA,GAAO,CAAA,EAAW;AAC5D,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,MAAM,MAAM,IAAA,CAAK,MAAA;AACjB,EAAA,MAAM,UAAU,GAAA,KAAQ,CAAA;AACxB,EAAA,IAAI,KAAK,IAAA,KAAS,CAAA;AAClB,EAAA,MAAM,EAAA,GAAK,UAAA;AACX,EAAA,MAAM,EAAA,GAAK,SAAA;AAEX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,EAAS,CAAA,EAAA,EAAK;AAChC,IAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,IAAA,IAAIA,GAAAA,GACD,KAAK,CAAC,CAAA,GAAK,OACV,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,KACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,MACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,EAAA;AAE5B,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AACjB,IAAAA,GAAAA,GAAK,MAAA,CAAOA,GAAAA,EAAI,EAAE,CAAA;AAClB,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AAEjB,IAAA,EAAA,IAAMA,GAAAA;AACN,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAM,KAAA,CAAM,EAAA,EAAI,CAAC,CAAA,GAAI,UAAA,KAAgB,CAAA;AAAA,EACvC;AAEA,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,MAAM,OAAO,GAAA,GAAM,CAAA;AACnB,EAAA,MAAM,YAAY,OAAA,GAAU,CAAA;AAC5B,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,EAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,CAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,EAAA,IAAM,IAAA,CAAK,SAAS,CAAA,GAAK,GAAA;AACzB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,IAAM,EAAA;AAAA,EACR;AAEA,EAAA,EAAA,IAAM,GAAA;AACN,EAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AACd,EAAA,OAAO,EAAA,KAAO,CAAA;AAChB;AAEA,SAAS,MAAA,CAAO,GAAW,CAAA,EAAmB;AAC5C,EAAA,OAAA,CAAS,CAAA,IAAK,CAAA,GAAM,CAAA,KAAO,EAAA,GAAK,CAAA,MAAS,CAAA;AAC3C;AAEA,SAAS,KAAA,CAAM,GAAW,CAAA,EAAmB;AAC3C,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,OAAS,GAAA,GAAM,OAAU,GAAA,GAAM,GAAA,GAAM,MAAM,GAAA,IAAQ,EAAA,KAAQ,CAAA,GAAK,CAAA,CAAA,KAAQ,CAAA,KAAO,CAAA;AACjF;AAEA,SAAS,OAAO,CAAA,EAAmB;AACjC,EAAA,IAAI,IAAI,CAAA,KAAM,CAAA;AACd,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,OAAO,CAAA,KAAM,CAAA;AACf;AAEA,SAAS,UAAU,CAAA,EAAuB;AACxC,EAAA,IAAI,OAAO,gBAAgB,WAAA,EAAa,OAAO,IAAI,WAAA,EAAY,CAAE,OAAO,CAAC,CAAA;AAEzE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AACtB,IAAA,IAAI,IAAI,GAAA,EAAM;AACZ,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,IACZ,CAAA,MAAA,IAAW,IAAI,IAAA,EAAO;AACpB,MAAA,GAAA,CAAI,KAAK,GAAA,GAAQ,CAAA,IAAK,CAAA,EAAI,GAAA,GAAQ,IAAI,EAAK,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,KAAK,KAAA,IAAU,CAAA,IAAK,SAAU,CAAA,GAAI,CAAA,GAAI,EAAE,MAAA,EAAQ;AACzD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,UAAA,CAAW,CAAA,GAAI,CAAC,CAAA;AAC7B,MAAA,IAAI,EAAA,IAAM,KAAA,IAAU,EAAA,IAAM,KAAA,EAAQ;AAChC,QAAA,CAAA,GAAI,KAAA,IAAA,CAAa,CAAA,GAAI,IAAA,KAAU,EAAA,GAAO,EAAA,GAAK,IAAA,CAAA;AAC3C,QAAA,CAAA,EAAA;AACA,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,MAAQ,CAAA,IAAK,EAAA;AAAA,UACb,GAAA,GAAS,KAAK,EAAA,GAAM,EAAA;AAAA,UACpB,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA;AAAA,UACnB,MAAQ,CAAA,GAAI;AAAA,SACd;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,GAAQ,CAAA,IAAK,EAAA,EAAK,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA,EAAO,GAAA,GAAQ,CAAA,GAAI,EAAK,CAAA;AAAA,IACxE;AAAA,EACF;AACA,EAAA,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B;;;ACjGO,IAAM,gBAAA,GAAmB;AAMzB,SAAS,SAAA,CAAU,YAAA,EAAsB,IAAA,EAAc,SAAA,EAA2B;AACvF,EAAA,MAAM,MAAM,CAAA,EAAG,YAAY,CAAA,CAAA,EAAI,IAAI,IAAI,SAAS,CAAA,CAAA;AAChD,EAAA,OAAO,cAAA,CAAe,GAAG,CAAA,GAAI,gBAAA;AAC/B;;;ACsBO,SAAS,OAAO,IAAA,EAAoC;AACzD,EAAA,MAAM,SAAS,SAAA,CAAU,IAAA,CAAK,cAAc,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AAErE,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,MAAM,UAAA,GAAa,KAAK,UAAA,IAAc,CAAA;AACtC,EAAA,IAAI,aAAa,CAAA,EAAG;AAElB,IAAA,MAAM,YAAA,GACJ,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,YAAY,WAAW,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA,GAAI,gBAAA;AACxE,IAAA,IAAI,gBAAgB,UAAA,EAAY;AAC9B,MAAA,OAAO,EAAE,UAAA,EAAY,IAAA,EAAM,MAAA,EAAQ,QAAQ,YAAA,EAAa;AAAA,IAC1D;AAAA,EACF;AAEA,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,IAAU,CAAA,CAAA,EAAI,CAAC,CAAA;AAC3E,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,IAAI,kBAAkB,gBAAA,EAAkB;AACtC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR,cAAc,IAAA,CAAK,YAAY,CAAA,8BAAA,EAAiC,gBAAgB,SAAS,aAAa,CAAA;AAAA,OACxG;AAAA,IACF;AACA,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,UAAA,IAAc,EAAE,MAAA,IAAU,CAAA;AAC1B,MAAA,IAAI,MAAA,GAAS,YAAY,OAAO,EAAE,YAAY,CAAA,CAAE,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAAA,IAClF;AAEA,IAAA,OAAO;AAAA,MACL,YAAY,IAAA,CAAK,QAAA,CAAS,KAAK,QAAA,CAAS,MAAA,GAAS,CAAC,CAAA,CAAG,GAAA;AAAA,MACrD,MAAA;AAAA,MACA,MAAA,EAAQ;AAAA,KACV;AAAA,EACF;AAGA,EAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAO,SAAS,gBAAA,GAAoB,IAAA,CAAK,SAAS,MAAM,CAAA;AACzE,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AACtD,EAAA,OAAO,EAAE,YAAY,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,CAAG,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAC/E","file":"index.js","sourcesContent":["/**\n * MurmurHash3 x86 32-bit. The deterministic bucketing primitive for every\n * Fabric Experiments SDK. See docs/adr/0001-assignment-hash.md.\n *\n * Inputs are hashed as their UTF-8 byte representation.\n * Output is treated as uint32 (sign-fixed via `>>> 0`).\n */\nexport function murmur3_x86_32(key: string, seed = 0): number {\n  const data = utf8Bytes(key);\n  const len = data.length;\n  const nblocks = len >>> 2;\n  let h1 = seed >>> 0;\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n\n  for (let i = 0; i < nblocks; i++) {\n    const o = i * 4;\n    let k1 =\n      (data[o]! & 0xff) |\n      ((data[o + 1]! & 0xff) << 8) |\n      ((data[o + 2]! & 0xff) << 16) |\n      ((data[o + 3]! & 0xff) << 24);\n\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n\n    h1 ^= k1;\n    h1 = rotl32(h1, 13);\n    h1 = (mul32(h1, 5) + 0xe6546b64) >>> 0;\n  }\n\n  let k1 = 0;\n  const tail = len & 3;\n  const tailStart = nblocks * 4;\n  if (tail >= 3) k1 ^= (data[tailStart + 2]! & 0xff) << 16;\n  if (tail >= 2) k1 ^= (data[tailStart + 1]! & 0xff) << 8;\n  if (tail >= 1) {\n    k1 ^= data[tailStart]! & 0xff;\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n    h1 ^= k1;\n  }\n\n  h1 ^= len;\n  h1 = fmix32(h1);\n  return h1 >>> 0;\n}\n\nfunction rotl32(x: number, r: number): number {\n  return ((x << r) | (x >>> (32 - r))) >>> 0;\n}\n\nfunction mul32(a: number, b: number): number {\n  const aHi = (a >>> 16) & 0xffff;\n  const aLo = a & 0xffff;\n  const bHi = (b >>> 16) & 0xffff;\n  const bLo = b & 0xffff;\n  return ((aLo * bLo + ((((aHi * bLo + aLo * bHi) << 16) >>> 0) | 0)) >>> 0) >>> 0;\n}\n\nfunction fmix32(h: number): number {\n  let x = h >>> 0;\n  x ^= x >>> 16;\n  x = mul32(x, 0x85ebca6b);\n  x ^= x >>> 13;\n  x = mul32(x, 0xc2b2ae35);\n  x ^= x >>> 16;\n  return x >>> 0;\n}\n\nfunction utf8Bytes(s: string): Uint8Array {\n  if (typeof TextEncoder !== 'undefined') return new TextEncoder().encode(s);\n  // Fallback for environments without TextEncoder.\n  const out: number[] = [];\n  for (let i = 0; i < s.length; i++) {\n    let c = s.charCodeAt(i);\n    if (c < 0x80) {\n      out.push(c);\n    } else if (c < 0x800) {\n      out.push(0xc0 | (c >> 6), 0x80 | (c & 0x3f));\n    } else if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n      const c2 = s.charCodeAt(i + 1);\n      if (c2 >= 0xdc00 && c2 <= 0xdfff) {\n        c = 0x10000 + (((c & 0x3ff) << 10) | (c2 & 0x3ff));\n        i++;\n        out.push(\n          0xf0 | (c >> 18),\n          0x80 | ((c >> 12) & 0x3f),\n          0x80 | ((c >> 6) & 0x3f),\n          0x80 | (c & 0x3f),\n        );\n      }\n    } else {\n      out.push(0xe0 | (c >> 12), 0x80 | ((c >> 6) & 0x3f), 0x80 | (c & 0x3f));\n    }\n  }\n  return new Uint8Array(out);\n}\n","import { murmur3_x86_32 } from './hash.js';\n\nexport const BUCKET_PRECISION = 10000 as const;\n\n/**\n * Returns an integer in [0, BUCKET_PRECISION) deterministic in (experimentId, salt, subjectId).\n * Contract: see docs/adr/0001-assignment-hash.md.\n */\nexport function bucketFor(experimentId: string, salt: string, subjectId: string): number {\n  const key = `${experimentId}:${salt}:${subjectId}`;\n  return murmur3_x86_32(key) % BUCKET_PRECISION;\n}\n","import { BUCKET_PRECISION, bucketFor } from './bucket.js';\n\nexport interface ManifestVariant {\n  key: string;\n  /** Optional explicit weight; if any variant declares one, weights of all others are required. */\n  weight?: number;\n}\n\nexport interface AssignArgs {\n  experimentId: string;\n  salt: string;\n  subjectId: string;\n  variants: readonly ManifestVariant[];\n  /** Sample rate in [0, 1] of eligible traffic the experiment applies to. */\n  sampleRate?: number;\n  /** Pre-existing sticky assignment — if set and matches a current variant, returned as-is. */\n  stickyVariantKey?: string;\n  /** Forced override (preview / QA). Highest priority. */\n  forcedVariantKey?: string;\n}\n\nexport type AssignmentReason = 'eligible' | 'sticky' | 'forced' | 'ineligible';\n\nexport interface AssignmentResult {\n  variantKey: string | null;\n  bucket: number;\n  reason: AssignmentReason;\n}\n\n/**\n * Returns deterministic assignment for a subject. `null` variant + reason `ineligible`\n * means the subject was sampled out and the SDK must NOT log an exposure.\n */\nexport function assign(args: AssignArgs): AssignmentResult {\n  const bucket = bucketFor(args.experimentId, args.salt, args.subjectId);\n\n  if (args.forcedVariantKey && args.variants.some((v) => v.key === args.forcedVariantKey)) {\n    return { variantKey: args.forcedVariantKey, bucket, reason: 'forced' };\n  }\n\n  if (args.stickyVariantKey && args.variants.some((v) => v.key === args.stickyVariantKey)) {\n    return { variantKey: args.stickyVariantKey, bucket, reason: 'sticky' };\n  }\n\n  const sampleRate = args.sampleRate ?? 1;\n  if (sampleRate < 1) {\n    // Use a separate hash-derived value for sampling so it's independent of variant assignment.\n    const sampleBucket =\n      bucketFor(`${args.experimentId}:sample`, args.salt, args.subjectId) / BUCKET_PRECISION;\n    if (sampleBucket >= sampleRate) {\n      return { variantKey: null, bucket, reason: 'ineligible' };\n    }\n  }\n\n  const totalDeclared = args.variants.reduce((s, v) => s + (v.weight ?? 0), 0);\n  if (totalDeclared > 0) {\n    if (totalDeclared !== BUCKET_PRECISION) {\n      throw new Error(\n        `experiment ${args.experimentId}: variant weights must sum to ${BUCKET_PRECISION}, got ${totalDeclared}`,\n      );\n    }\n    let cumulative = 0;\n    for (const v of args.variants) {\n      cumulative += v.weight ?? 0;\n      if (bucket < cumulative) return { variantKey: v.key, bucket, reason: 'eligible' };\n    }\n    // Numerical safety net.\n    return {\n      variantKey: args.variants[args.variants.length - 1]!.key,\n      bucket,\n      reason: 'eligible',\n    };\n  }\n\n  // Even split.\n  const idx = Math.floor((bucket / BUCKET_PRECISION) * args.variants.length);\n  const safeIdx = Math.min(idx, args.variants.length - 1);\n  return { variantKey: args.variants[safeIdx]!.key, bucket, reason: 'eligible' };\n}\n"]}
+{"version":3,"sources":["../src/hash.ts","../src/bucket.ts","../src/assign.ts","../src/safe-regex.ts","../src/allocation.ts"],"names":["k1"],"mappings":";AAOO,SAAS,cAAA,CAAe,GAAA,EAAa,IAAA,GAAO,CAAA,EAAW;AAC5D,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,MAAM,MAAM,IAAA,CAAK,MAAA;AACjB,EAAA,MAAM,UAAU,GAAA,KAAQ,CAAA;AACxB,EAAA,IAAI,KAAK,IAAA,KAAS,CAAA;AAClB,EAAA,MAAM,EAAA,GAAK,UAAA;AACX,EAAA,MAAM,EAAA,GAAK,SAAA;AAEX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,EAAS,CAAA,EAAA,EAAK;AAChC,IAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,IAAA,IAAIA,GAAAA,GACD,KAAK,CAAC,CAAA,GAAK,OACV,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,KACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,MACxB,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,GAAA,KAAS,EAAA;AAE5B,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AACjB,IAAAA,GAAAA,GAAK,MAAA,CAAOA,GAAAA,EAAI,EAAE,CAAA;AAClB,IAAAA,GAAAA,GAAK,KAAA,CAAMA,GAAAA,EAAI,EAAE,CAAA;AAEjB,IAAA,EAAA,IAAMA,GAAAA;AACN,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAM,KAAA,CAAM,EAAA,EAAI,CAAC,CAAA,GAAI,UAAA,KAAgB,CAAA;AAAA,EACvC;AAEA,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,MAAM,OAAO,GAAA,GAAM,CAAA;AACnB,EAAA,MAAM,YAAY,OAAA,GAAU,CAAA;AAC5B,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,EAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG,EAAA,IAAA,CAAO,KAAK,SAAA,GAAY,CAAC,IAAK,GAAA,KAAS,CAAA;AACtD,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,EAAA,IAAM,IAAA,CAAK,SAAS,CAAA,GAAK,GAAA;AACzB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,GAAK,MAAA,CAAO,IAAI,EAAE,CAAA;AAClB,IAAA,EAAA,GAAK,KAAA,CAAM,IAAI,EAAE,CAAA;AACjB,IAAA,EAAA,IAAM,EAAA;AAAA,EACR;AAEA,EAAA,EAAA,IAAM,GAAA;AACN,EAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AACd,EAAA,OAAO,EAAA,KAAO,CAAA;AAChB;AAEA,SAAS,MAAA,CAAO,GAAW,CAAA,EAAmB;AAC5C,EAAA,OAAA,CAAS,CAAA,IAAK,CAAA,GAAM,CAAA,KAAO,EAAA,GAAK,CAAA,MAAS,CAAA;AAC3C;AAEA,SAAS,KAAA,CAAM,GAAW,CAAA,EAAmB;AAC3C,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,MAAM,GAAA,GAAO,MAAM,EAAA,GAAM,KAAA;AACzB,EAAA,MAAM,MAAM,CAAA,GAAI,KAAA;AAChB,EAAA,OAAS,GAAA,GAAM,OAAU,GAAA,GAAM,GAAA,GAAM,MAAM,GAAA,IAAQ,EAAA,KAAQ,CAAA,GAAK,CAAA,CAAA,KAAQ,CAAA,KAAO,CAAA;AACjF;AAEA,SAAS,OAAO,CAAA,EAAmB;AACjC,EAAA,IAAI,IAAI,CAAA,KAAM,CAAA;AACd,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,CAAA,GAAI,KAAA,CAAM,GAAG,UAAU,CAAA;AACvB,EAAA,CAAA,IAAK,CAAA,KAAM,EAAA;AACX,EAAA,OAAO,CAAA,KAAM,CAAA;AACf;AAEA,SAAS,UAAU,CAAA,EAAuB;AACxC,EAAA,IAAI,OAAO,gBAAgB,WAAA,EAAa,OAAO,IAAI,WAAA,EAAY,CAAE,OAAO,CAAC,CAAA;AAEzE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AACtB,IAAA,IAAI,IAAI,GAAA,EAAM;AACZ,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,IACZ,CAAA,MAAA,IAAW,IAAI,IAAA,EAAO;AACpB,MAAA,GAAA,CAAI,KAAK,GAAA,GAAQ,CAAA,IAAK,CAAA,EAAI,GAAA,GAAQ,IAAI,EAAK,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,KAAK,KAAA,IAAU,CAAA,IAAK,SAAU,CAAA,GAAI,CAAA,GAAI,EAAE,MAAA,EAAQ;AACzD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,UAAA,CAAW,CAAA,GAAI,CAAC,CAAA;AAC7B,MAAA,IAAI,EAAA,IAAM,KAAA,IAAU,EAAA,IAAM,KAAA,EAAQ;AAChC,QAAA,CAAA,GAAI,KAAA,IAAA,CAAa,CAAA,GAAI,IAAA,KAAU,EAAA,GAAO,EAAA,GAAK,IAAA,CAAA;AAC3C,QAAA,CAAA,EAAA;AACA,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,MAAQ,CAAA,IAAK,EAAA;AAAA,UACb,GAAA,GAAS,KAAK,EAAA,GAAM,EAAA;AAAA,UACpB,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA;AAAA,UACnB,MAAQ,CAAA,GAAI;AAAA,SACd;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,GAAQ,CAAA,IAAK,EAAA,EAAK,GAAA,GAAS,KAAK,CAAA,GAAK,EAAA,EAAO,GAAA,GAAQ,CAAA,GAAI,EAAK,CAAA;AAAA,IACxE;AAAA,EACF;AACA,EAAA,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B;;;ACjGO,IAAM,gBAAA,GAAmB;AAMzB,SAAS,SAAA,CAAU,YAAA,EAAsB,IAAA,EAAc,SAAA,EAA2B;AACvF,EAAA,MAAM,MAAM,CAAA,EAAG,YAAY,CAAA,CAAA,EAAI,IAAI,IAAI,SAAS,CAAA,CAAA;AAChD,EAAA,OAAO,cAAA,CAAe,GAAG,CAAA,GAAI,gBAAA;AAC/B;;;ACsBO,SAAS,OAAO,IAAA,EAAoC;AACzD,EAAA,MAAM,SAAS,SAAA,CAAU,IAAA,CAAK,cAAc,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AAErE,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,IAAA,CAAK,gBAAgB,CAAA,EAAG;AACvF,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,gBAAA,EAAkB,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA,EACvE;AAEA,EAAA,MAAM,UAAA,GAAa,KAAK,UAAA,IAAc,CAAA;AACtC,EAAA,IAAI,aAAa,CAAA,EAAG;AAElB,IAAA,MAAM,YAAA,GACJ,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,YAAY,WAAW,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA,GAAI,gBAAA;AACxE,IAAA,IAAI,gBAAgB,UAAA,EAAY;AAC9B,MAAA,OAAO,EAAE,UAAA,EAAY,IAAA,EAAM,MAAA,EAAQ,QAAQ,YAAA,EAAa;AAAA,IAC1D;AAAA,EACF;AAEA,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,IAAU,CAAA,CAAA,EAAI,CAAC,CAAA;AAC3E,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,IAAI,kBAAkB,gBAAA,EAAkB;AACtC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR,cAAc,IAAA,CAAK,YAAY,CAAA,8BAAA,EAAiC,gBAAgB,SAAS,aAAa,CAAA;AAAA,OACxG;AAAA,IACF;AACA,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,UAAA,IAAc,EAAE,MAAA,IAAU,CAAA;AAC1B,MAAA,IAAI,MAAA,GAAS,YAAY,OAAO,EAAE,YAAY,CAAA,CAAE,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAAA,IAClF;AAEA,IAAA,OAAO;AAAA,MACL,YAAY,IAAA,CAAK,QAAA,CAAS,KAAK,QAAA,CAAS,MAAA,GAAS,CAAC,CAAA,CAAG,GAAA;AAAA,MACrD,MAAA;AAAA,MACA,MAAA,EAAQ;AAAA,KACV;AAAA,EACF;AAGA,EAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAO,SAAS,gBAAA,GAAoB,IAAA,CAAK,SAAS,MAAM,CAAA;AACzE,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AACtD,EAAA,OAAO,EAAE,YAAY,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,CAAG,GAAA,EAAK,MAAA,EAAQ,MAAA,EAAQ,UAAA,EAAW;AAC/E;;;AC9EA,IAAM,kBAAA,GAAqB,GAAA;AAC3B,IAAM,gBAAA,GAAmB,IAAA;AAOlB,SAAS,aAAA,CAAc,SAAiB,KAAA,EAAwB;AACrE,EAAA,IAAI,QAAQ,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,MAAA,GAAS,oBAAoB,OAAO,KAAA;AACxE,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,gBAAA,EAAkB,OAAO,KAAA;AAC5C,EAAA,IAAI,SAAA,CAAU,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AACpC,EAAA,IAAI,oBAAA,CAAqB,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AAC/C,EAAA,IAAI,kBAAA,CAAmB,OAAO,CAAA,EAAG,OAAO,KAAA;AACxC,EAAA,IAAI,8CAAA,CAA+C,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AACzE,EAAA,IAAI;AACF,IAAA,OAAO,IAAI,MAAA,CAAO,OAAA,EAAS,GAAG,CAAA,CAAE,KAAK,KAAK,CAAA;AAAA,EAC5C,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAEA,SAAS,mBAAmB,OAAA,EAA0B;AACpD,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,OAAA,CAAQ,MAAA,EAAQ,SAAS,CAAA,EAAG;AACtD,IAAA,MAAM,IAAA,GAAO,QAAQ,KAAK,CAAA;AAC1B,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,OAAA,GAAU,KAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAA,GAAU,IAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,KAAK,OAAA,GAAU,IAAA;AAC5B,IAAA,IAAI,IAAA,KAAS,KAAK,OAAA,GAAU,KAAA;AAC5B,IAAA,IAAI,OAAA,EAAS;AACb,IAAA,IAAI,IAAA,KAAS,GAAA,EAAK,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAClC,IAAA,IAAI,SAAS,GAAA,EAAK;AAChB,MAAA,KAAA,CAAM,GAAA,EAAI;AACV,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,GAAQ,CAAC,CAAA;AAC9B,MAAA,IAAI,IAAA,KAAS,OAAO,IAAA,KAAS,GAAA,IAAO,SAAS,GAAA,IAAO,IAAA,KAAS,KAAK,OAAO,IAAA;AAAA,IAC3E;AAAA,EACF;AACA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA;AACxB;;;AC1CO,SAAS,yBAAyB,QAAA,EAA+C;AACtF,EAAA,IAAI,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,OAAO,KAAA;AAChC,EAAA,MAAM,WAAW,QAAA,CAAS,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,WAAW,MAAS,CAAA;AAC1E,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAClC,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,QAAA,CAAS,MAAA,EAAQ,OAAO,KAAA;AAChD,EAAA,OACE,QAAA,CAAS,KAAA;AAAA,IACP,CAAC,OAAA,KACC,MAAA,CAAO,SAAA,CAAU,QAAQ,MAAM,CAAA,IAC/B,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,IAAK,CAAA,IAC1B,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,IAAK;AAAA,GAC9B,IAAK,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,EAAO,OAAA,KAAY,KAAA,GAAQ,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,GAAA;AAEpF","file":"index.js","sourcesContent":["/**\n * MurmurHash3 x86 32-bit. The deterministic bucketing primitive for every\n * Fabric Experiments SDK. See docs/adr/0001-assignment-hash.md.\n *\n * Inputs are hashed as their UTF-8 byte representation.\n * Output is treated as uint32 (sign-fixed via `>>> 0`).\n */\nexport function murmur3_x86_32(key: string, seed = 0): number {\n  const data = utf8Bytes(key);\n  const len = data.length;\n  const nblocks = len >>> 2;\n  let h1 = seed >>> 0;\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n\n  for (let i = 0; i < nblocks; i++) {\n    const o = i * 4;\n    let k1 =\n      (data[o]! & 0xff) |\n      ((data[o + 1]! & 0xff) << 8) |\n      ((data[o + 2]! & 0xff) << 16) |\n      ((data[o + 3]! & 0xff) << 24);\n\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n\n    h1 ^= k1;\n    h1 = rotl32(h1, 13);\n    h1 = (mul32(h1, 5) + 0xe6546b64) >>> 0;\n  }\n\n  let k1 = 0;\n  const tail = len & 3;\n  const tailStart = nblocks * 4;\n  if (tail >= 3) k1 ^= (data[tailStart + 2]! & 0xff) << 16;\n  if (tail >= 2) k1 ^= (data[tailStart + 1]! & 0xff) << 8;\n  if (tail >= 1) {\n    k1 ^= data[tailStart]! & 0xff;\n    k1 = mul32(k1, c1);\n    k1 = rotl32(k1, 15);\n    k1 = mul32(k1, c2);\n    h1 ^= k1;\n  }\n\n  h1 ^= len;\n  h1 = fmix32(h1);\n  return h1 >>> 0;\n}\n\nfunction rotl32(x: number, r: number): number {\n  return ((x << r) | (x >>> (32 - r))) >>> 0;\n}\n\nfunction mul32(a: number, b: number): number {\n  const aHi = (a >>> 16) & 0xffff;\n  const aLo = a & 0xffff;\n  const bHi = (b >>> 16) & 0xffff;\n  const bLo = b & 0xffff;\n  return ((aLo * bLo + ((((aHi * bLo + aLo * bHi) << 16) >>> 0) | 0)) >>> 0) >>> 0;\n}\n\nfunction fmix32(h: number): number {\n  let x = h >>> 0;\n  x ^= x >>> 16;\n  x = mul32(x, 0x85ebca6b);\n  x ^= x >>> 13;\n  x = mul32(x, 0xc2b2ae35);\n  x ^= x >>> 16;\n  return x >>> 0;\n}\n\nfunction utf8Bytes(s: string): Uint8Array {\n  if (typeof TextEncoder !== 'undefined') return new TextEncoder().encode(s);\n  // Fallback for environments without TextEncoder.\n  const out: number[] = [];\n  for (let i = 0; i < s.length; i++) {\n    let c = s.charCodeAt(i);\n    if (c < 0x80) {\n      out.push(c);\n    } else if (c < 0x800) {\n      out.push(0xc0 | (c >> 6), 0x80 | (c & 0x3f));\n    } else if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n      const c2 = s.charCodeAt(i + 1);\n      if (c2 >= 0xdc00 && c2 <= 0xdfff) {\n        c = 0x10000 + (((c & 0x3ff) << 10) | (c2 & 0x3ff));\n        i++;\n        out.push(\n          0xf0 | (c >> 18),\n          0x80 | ((c >> 12) & 0x3f),\n          0x80 | ((c >> 6) & 0x3f),\n          0x80 | (c & 0x3f),\n        );\n      }\n    } else {\n      out.push(0xe0 | (c >> 12), 0x80 | ((c >> 6) & 0x3f), 0x80 | (c & 0x3f));\n    }\n  }\n  return new Uint8Array(out);\n}\n","import { murmur3_x86_32 } from './hash.js';\n\nexport const BUCKET_PRECISION = 10000 as const;\n\n/**\n * Returns an integer in [0, BUCKET_PRECISION) deterministic in (experimentId, salt, subjectId).\n * Contract: see docs/adr/0001-assignment-hash.md.\n */\nexport function bucketFor(experimentId: string, salt: string, subjectId: string): number {\n  const key = `${experimentId}:${salt}:${subjectId}`;\n  return murmur3_x86_32(key) % BUCKET_PRECISION;\n}\n","import { BUCKET_PRECISION, bucketFor } from './bucket.js';\n\nexport interface ManifestVariant {\n  key: string;\n  /** Optional explicit weight; if any variant declares one, weights of all others are required. */\n  weight?: number;\n}\n\nexport interface AssignArgs {\n  experimentId: string;\n  salt: string;\n  subjectId: string;\n  variants: readonly ManifestVariant[];\n  /** Sample rate in [0, 1] of eligible traffic the experiment applies to. */\n  sampleRate?: number;\n  /** Pre-existing sticky assignment — if set and matches a current variant, returned as-is. */\n  stickyVariantKey?: string;\n  /** Forced override (preview / QA). Highest priority. */\n  forcedVariantKey?: string;\n}\n\nexport type AssignmentReason = 'eligible' | 'sticky' | 'forced' | 'ineligible';\n\nexport interface AssignmentResult {\n  variantKey: string | null;\n  bucket: number;\n  reason: AssignmentReason;\n}\n\n/**\n * Returns deterministic assignment for a subject. `null` variant + reason `ineligible`\n * means the subject was sampled out and the SDK must NOT log an exposure.\n */\nexport function assign(args: AssignArgs): AssignmentResult {\n  const bucket = bucketFor(args.experimentId, args.salt, args.subjectId);\n\n  if (args.forcedVariantKey && args.variants.some((v) => v.key === args.forcedVariantKey)) {\n    return { variantKey: args.forcedVariantKey, bucket, reason: 'forced' };\n  }\n\n  if (args.stickyVariantKey && args.variants.some((v) => v.key === args.stickyVariantKey)) {\n    return { variantKey: args.stickyVariantKey, bucket, reason: 'sticky' };\n  }\n\n  const sampleRate = args.sampleRate ?? 1;\n  if (sampleRate < 1) {\n    // Use a separate hash-derived value for sampling so it's independent of variant assignment.\n    const sampleBucket =\n      bucketFor(`${args.experimentId}:sample`, args.salt, args.subjectId) / BUCKET_PRECISION;\n    if (sampleBucket >= sampleRate) {\n      return { variantKey: null, bucket, reason: 'ineligible' };\n    }\n  }\n\n  const totalDeclared = args.variants.reduce((s, v) => s + (v.weight ?? 0), 0);\n  if (totalDeclared > 0) {\n    if (totalDeclared !== BUCKET_PRECISION) {\n      throw new Error(\n        `experiment ${args.experimentId}: variant weights must sum to ${BUCKET_PRECISION}, got ${totalDeclared}`,\n      );\n    }\n    let cumulative = 0;\n    for (const v of args.variants) {\n      cumulative += v.weight ?? 0;\n      if (bucket < cumulative) return { variantKey: v.key, bucket, reason: 'eligible' };\n    }\n    // Numerical safety net.\n    return {\n      variantKey: args.variants[args.variants.length - 1]!.key,\n      bucket,\n      reason: 'eligible',\n    };\n  }\n\n  // Even split.\n  const idx = Math.floor((bucket / BUCKET_PRECISION) * args.variants.length);\n  const safeIdx = Math.min(idx, args.variants.length - 1);\n  return { variantKey: args.variants[safeIdx]!.key, bucket, reason: 'eligible' };\n}\n","const MAX_PATTERN_LENGTH = 256;\nconst MAX_INPUT_LENGTH = 2048;\n\n/**\n * Evaluate the deliberately small, RE2-compatible subset accepted by audience\n * targeting. Patterns that rely on backreferences, lookarounds, or quantified\n * groups fail closed instead of reaching the JavaScript backtracking engine.\n */\nexport function safeRegexTest(pattern: string, input: string): boolean {\n  if (pattern.length === 0 || pattern.length > MAX_PATTERN_LENGTH) return false;\n  if (input.length > MAX_INPUT_LENGTH) return false;\n  if (/\\\\[1-9]/.test(pattern)) return false;\n  if (/\\(\\?(?:[=!]|<[=!])/.test(pattern)) return false;\n  if (hasQuantifiedGroup(pattern)) return false;\n  if (/(?:\\*|\\+|\\?|\\{\\d+(?:,\\d*)?\\})(?:\\*|\\+|\\?|\\{)/.test(pattern)) return false;\n  try {\n    return new RegExp(pattern, 'u').test(input);\n  } catch {\n    return false;\n  }\n}\n\nfunction hasQuantifiedGroup(pattern: string): boolean {\n  let escaped = false;\n  let inClass = false;\n  const stack: number[] = [];\n  for (let index = 0; index < pattern.length; index += 1) {\n    const char = pattern[index]!;\n    if (escaped) {\n      escaped = false;\n      continue;\n    }\n    if (char === '\\\\') {\n      escaped = true;\n      continue;\n    }\n    if (char === '[') inClass = true;\n    if (char === ']') inClass = false;\n    if (inClass) continue;\n    if (char === '(') stack.push(index);\n    if (char === ')') {\n      stack.pop();\n      const next = pattern[index + 1];\n      if (next === '*' || next === '+' || next === '?' || next === '{') return true;\n    }\n  }\n  return stack.length > 0;\n}\n","export interface WeightedVariant {\n  weight?: number;\n}\n\n/** Validate direct-injection manifests before either SDK buckets a subject. */\nexport function isValidVariantAllocation(variants: readonly WeightedVariant[]): boolean {\n  if (variants.length < 2) return false;\n  const declared = variants.filter((variant) => variant.weight !== undefined);\n  if (declared.length === 0) return true;\n  if (declared.length !== variants.length) return false;\n  return (\n    declared.every(\n      (variant) =>\n        Number.isInteger(variant.weight) &&\n        Number(variant.weight) >= 0 &&\n        Number(variant.weight) <= 10000,\n    ) && declared.reduce((total, variant) => total + Number(variant.weight), 0) === 10000\n  );\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fabricorg/experiments-assignment",
-  "version": "0.0.1",
+  "version": "0.0.2",
   "description": "Deterministic, cross-language bucketing primitives for Fabric Experiments SDKs.",
   "license": "MIT",
   "type": "module",
@@ -10,29 +10,21 @@
   "module": "./dist/index.js",
   "exports": {
     ".": {
-      "import": {
-        "types": "./dist/index.d.ts",
-        "default": "./dist/index.js"
-      },
-      "require": {
-        "types": "./dist/index.d.cts",
-        "default": "./dist/index.cjs"
-      }
+      "import": { "types": "./dist/index.d.ts", "default": "./dist/index.js" },
+      "require": { "types": "./dist/index.d.cts", "default": "./dist/index.cjs" }
     }
   },
-  "files": [
-    "dist"
-  ],
-  "devDependencies": {
-    "fast-check": "^3.23.2",
-    "tsup": "^8.3.5",
-    "typescript": "^5.8.3",
-    "vitest": "^2.1.8"
-  },
+  "files": ["dist"],
   "scripts": {
     "build": "tsup",
     "type-check": "tsc --noEmit",
     "test": "vitest run",
     "clean": "rm -rf dist"
+  },
+  "devDependencies": {
+    "fast-check": "^3.23.2",
+    "tsup": "^8.3.5",
+    "typescript": "^5.8.3",
+    "vitest": "^3.2.7"
   }
-}
+}

package/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2026 Fabric
-
-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.