@getcommunity/gc-validators 0.0.271-alpha.8 → 0.0.271

package/dist/generators/index.cjs

@@ -0,0 +1,231 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_chunk = require("../chunk-CKQMccvm.cjs");
+const require_regex = require("../regex-BEFTMiHO.cjs");
+let valibot = require("valibot");
+valibot = require_chunk.__toESM(valibot, 1);
+let randexp = require("randexp");
+randexp = require_chunk.__toESM(randexp, 1);
+//#region src/generators/index.ts
+function generateValid(opts) {
+	const includeOptionalProb = opts?.includeOptionalProb ?? .7;
+	const maxAttempts = opts?.maxAttempts ?? 30;
+	const hooks = opts?.hooks ?? {};
+	for (let attempt = 0; attempt < maxAttempts; attempt++) {
+		const raw = _genWithHooks(opts.schema, { includeOptionalProb }, hooks, []);
+		const value = opts.overrides ? deepMerge(raw, opts.overrides) : raw;
+		const res = valibot.safeParse(opts.schema, value);
+		if (res.success) {
+			const output = res.output;
+			for (const field of opts.excludedFields ?? []) delete output[field];
+			return output;
+		}
+	}
+	throw new Error("generateValid could not satisfy schema");
+}
+function _genWithHooks(schema, ctx, hooks, path) {
+	const val = _gen(schema, ctx, path);
+	const key = path[path.length - 1];
+	const pathKey = path.join(".");
+	if (hooks[pathKey]) return hooks[pathKey](val, schema, path);
+	if (key && hooks[key]) return hooks[key](val, schema, path);
+	return val;
+}
+function _gen(schema, ctx, path = []) {
+	switch (schema?.type) {
+		case "object": {
+			const out = {};
+			const entries = schema.entries ?? {};
+			for (const [key, sub] of Object.entries(entries)) {
+				const isOptional = sub?.type === "optional";
+				if (isOptional && Math.random() > ctx.includeOptionalProb) continue;
+				out[key] = _gen(isOptional ? unwrapOptional(sub) : sub, ctx, [...path, key]);
+			}
+			return out;
+		}
+		case "array": {
+			const item = schema.item ?? schema.items;
+			const min = getArrayMin(schema) ?? 0;
+			const len = randInt(min, Math.max(min, Math.min(5, getArrayMax(schema) ?? 3)));
+			return Array.from({ length: len }, () => _gen(item, ctx, [...path, String(len)]));
+		}
+		case "tuple": return (schema.items ?? schema.entries ?? []).map((s, i) => _gen(s, ctx, [...path, String(i)]));
+		case "union": {
+			const options = schema.options ?? schema.variants ?? [];
+			for (const opt of shuffle([...options])) {
+				const val = _gen(opt, ctx, path);
+				if (valibot.safeParse(opt, val).success) return val;
+			}
+			return _gen(options[0], ctx, path);
+		}
+		case "literal": return schema.literal;
+		case "enum": return randomItem(schema.options ?? schema.values ?? schema.variants ?? []);
+		case "picklist": return randomItem(schema.options ?? schema.values ?? schema.variants ?? []);
+		case "record": {
+			const keySchema = schema.key ?? schema.keySchema ?? valibot.string();
+			const valueSchema = schema.value ?? schema.valueSchema ?? valibot.unknown();
+			const count = randInt(1, 3);
+			const obj = {};
+			for (let i = 0; i < count; i++) {
+				const k = String(_gen(keySchema, ctx, [...path, "key"]));
+				obj[k] = _gen(valueSchema, ctx, [...path, k]);
+			}
+			return obj;
+		}
+		case "string":
+			const stringPipe = schema?.pipe || [];
+			for (const p of stringPipe) {
+				if (p?.type === "iso_date") {
+					const [min, max] = getDateBounds(schema);
+					return new Date(randInt(min.getTime(), max.getTime())).toISOString().split("T")[0];
+				}
+				if (p?.type === "iso_datetime") {
+					const [min, max] = getDateBounds(schema);
+					return new Date(randInt(min.getTime(), max.getTime())).toISOString();
+				}
+			}
+			return makeString(schema);
+		case "number":
+			schema.pipe;
+			return makeNumber(schema);
+		case "boolean": return Math.random() < .5;
+		case "bigint": {
+			const n = makeNumber(schema);
+			return BigInt(Math.trunc(n));
+		}
+		case "date": {
+			const [min, max] = getDateBounds(schema);
+			return new Date(randInt(min.getTime(), max.getTime()));
+		}
+		case "nullable": {
+			const inner = schema.wrapped ?? schema.inner ?? schema.item;
+			return Math.random() < .2 ? null : _gen(inner, ctx, path);
+		}
+		case "optional": return _gen(unwrapOptional(schema), ctx, path);
+		default: return {};
+	}
+}
+function unwrapOptional(s) {
+	return s.wrapped ?? s.inner ?? s.item ?? s.schema ?? s;
+}
+function getChecks(schema) {
+	return Array.isArray(schema?.pipe) ? schema.pipe : [];
+}
+function getArrayMin(schema) {
+	const min = getChecks(schema).find((c) => c?.type === "min_length")?.requirement;
+	return typeof min === "number" ? min : void 0;
+}
+function getArrayMax(schema) {
+	const max = getChecks(schema).find((c) => c?.type === "max_length")?.requirement;
+	return typeof max === "number" ? max : void 0;
+}
+function makeString(schema) {
+	const checks = getChecks(schema);
+	const has = (k) => checks.some((c) => c?.type === k);
+	if (has("email")) return `${boundedAscii(5, 10).toLowerCase()}@${boundedAscii(3, 8).toLowerCase()}.com`;
+	if (has("url")) return `https://${boundedAscii(3, 8).toLowerCase()}.dev/${boundedAscii(3, 10)}`;
+	if (has("uuid")) return cryptoLikeRandomUUID();
+	if (checks.some((c) => c?.message?.includes("valid phone number"))) return `+1${fromPool("0123456789", 10)}`;
+	const minLen = checks.find((c) => c?.type === "min_length")?.requirement ?? 0;
+	const maxLen = checks.find((c) => c?.type === "max_length")?.requirement ?? Math.max(8, minLen + 8);
+	const targetLen = clamp(randInt(minLen, Math.max(minLen, Math.min(24, maxLen))), minLen, maxLen);
+	const rx = checks.find((c) => c?.type === "regex")?.requirement;
+	if (rx) {
+		pickPoolForRegex(rx);
+		const rxp = new randexp.default(rx);
+		for (let i = 0; i < 80; i++) {
+			const limit = randInt(minLen, Math.min(maxLen, targetLen));
+			let candidate = rxp.gen();
+			if (candidate.length > limit) candidate = candidate.slice(0, limit);
+			if (rx.test(candidate) && candidate.length >= minLen && candidate.length <= maxLen) return candidate;
+		}
+	}
+	return boundedAscii(minLen, targetLen);
+}
+function makeNumber(schema) {
+	const checks = getChecks(schema);
+	let min = checks.find((c) => c?.type === "min_value")?.requirement ?? 0;
+	let max = checks.find((c) => c?.type === "max_value")?.requirement ?? 1e3;
+	if (min > max) [min, max] = [max, min];
+	return checks.some((c) => c?.type === "number" || c?.type === "int") ? randInt(Math.ceil(min), Math.floor(max)) : randFloat(min, max);
+}
+function getDateBounds(schema) {
+	const checks = getChecks(schema);
+	const min = checks.find((c) => c?.type === "min_value")?.requirement;
+	const max = checks.find((c) => c?.type === "max_value")?.requirement;
+	return [min instanceof Date ? min : /* @__PURE__ */ new Date(Date.now() - 365 * 24 * 3600 * 1e3), max instanceof Date ? max : new Date(Date.now() + 365 * 24 * 3600 * 1e3)];
+}
+const ABC = "abcdefghijklmnopqrstuvwxyz";
+const NUM = "0123456789";
+const ALNUM = ABC + ABC.toUpperCase() + NUM;
+const VALUE_SAFE = ALNUM + "._-";
+function pickPoolForRegex(rx) {
+	const src = rx.source;
+	if (/^\^?[\(\[]?[A-Za-z0-9._-]+\+[\)\]]\??\$?$/.test(src) || require_regex.REGEX_UTM_VALUE.test(src)) return VALUE_SAFE;
+	if (/\[0-9\]|\\d/.test(src)) {
+		if (!/[a-zA-Z]/.test(src)) return NUM;
+		return ALNUM;
+	}
+	if (/\[a-z]/.test(src) && /\[A-Z]/.test(src)) return ALNUM;
+	if (/\[a-z]/.test(src)) return ABC;
+	if (/\[A-Z]/.test(src)) return ABC.toUpperCase();
+	return ALNUM;
+}
+function fromPool(pool, len) {
+	let s = "";
+	for (let i = 0; i < len; i++) s += pool[randInt(0, pool.length - 1)];
+	return s;
+}
+function boundedAscii(min, max) {
+	const len = randInt(min, Math.max(min, max));
+	let s = "";
+	for (let i = 0; i < len; i++) s += ALNUM[randInt(0, ALNUM.length - 1)];
+	return s;
+}
+function cryptoLikeRandomUUID() {
+	if (typeof crypto !== "undefined" && typeof crypto.randomUUID === "function") return crypto.randomUUID();
+	const s = [];
+	const hex = "0123456789abcdef";
+	for (let i = 0; i < 36; i++) s[i] = hex[randInt(0, 15)];
+	s[14] = "4";
+	s[19] = hex[parseInt(s[19], 16) & 3 | 8];
+	s[8] = s[13] = s[18] = s[23] = "-";
+	return s.join("");
+}
+function randInt(min, max) {
+	const lo = Math.ceil(min);
+	return Math.floor(Math.random() * (Math.floor(max) - lo + 1)) + lo;
+}
+function randFloat(min, max) {
+	return Math.random() * (max - min) + min;
+}
+function randomItem(arr) {
+	return arr[randInt(0, arr.length - 1)];
+}
+function shuffle(arr) {
+	for (let i = arr.length - 1; i > 0; i--) {
+		const j = randInt(0, i);
+		[arr[i], arr[j]] = [arr[j], arr[i]];
+	}
+	return arr;
+}
+function deepMerge(a, b) {
+	if (Array.isArray(a) && Array.isArray(b)) return b;
+	if (isPlain(a) && isPlain(b)) {
+		const out = { ...a };
+		for (const [k, v] of Object.entries(b)) {
+			if (v === void 0) continue;
+			out[k] = k in a ? deepMerge(a[k], v) : v;
+		}
+		return out;
+	}
+	return b ?? a;
+}
+function isPlain(x) {
+	return typeof x === "object" && x !== null && !Array.isArray(x);
+}
+function clamp(n, lo, hi) {
+	return Math.max(lo, Math.min(hi, n));
+}
+//#endregion
+exports.boundedAscii = boundedAscii;
+exports.generateValid = generateValid;

package/dist/generators/index.d.cts

@@ -0,0 +1,19 @@
+import * as v from "valibot";
+
+//#region src/generators/index.d.ts
+/**
+ * Generate a random valid value for a given Valibot schema.
+ * Tuned to hit 100% validity for the user's CreateCampaign* schemas.
+ */
+type Hook = (input: unknown, schema: any, path: string[]) => unknown;
+declare function generateValid<T, O = unknown>(opts: {
+  schema: v.BaseSchema<T, T, v.BaseIssue<O>>;
+  overrides?: Partial<T>;
+  excludedFields?: (keyof T)[];
+  includeOptionalProb?: number;
+  maxAttempts?: number;
+  hooks?: Record<string, Hook>;
+}): T;
+declare function boundedAscii(min: number, max: number): string;
+//#endregion
+export { boundedAscii, generateValid };

package/dist/generators/index.d.mts

@@ -0,0 +1,19 @@
+import * as v from "valibot";
+
+//#region src/generators/index.d.ts
+/**
+ * Generate a random valid value for a given Valibot schema.
+ * Tuned to hit 100% validity for the user's CreateCampaign* schemas.
+ */
+type Hook = (input: unknown, schema: any, path: string[]) => unknown;
+declare function generateValid<T, O = unknown>(opts: {
+  schema: v.BaseSchema<T, T, v.BaseIssue<O>>;
+  overrides?: Partial<T>;
+  excludedFields?: (keyof T)[];
+  includeOptionalProb?: number;
+  maxAttempts?: number;
+  hooks?: Record<string, Hook>;
+}): T;
+declare function boundedAscii(min: number, max: number): string;
+//#endregion
+export { boundedAscii, generateValid };

package/dist/generators/index.mjs

@@ -0,0 +1,226 @@
+import { s as REGEX_UTM_VALUE } from "../regex-pSdcbWzV.mjs";
+import * as v from "valibot";
+import RandExp from "randexp";
+//#region src/generators/index.ts
+function generateValid(opts) {
+	const includeOptionalProb = opts?.includeOptionalProb ?? .7;
+	const maxAttempts = opts?.maxAttempts ?? 30;
+	const hooks = opts?.hooks ?? {};
+	for (let attempt = 0; attempt < maxAttempts; attempt++) {
+		const raw = _genWithHooks(opts.schema, { includeOptionalProb }, hooks, []);
+		const value = opts.overrides ? deepMerge(raw, opts.overrides) : raw;
+		const res = v.safeParse(opts.schema, value);
+		if (res.success) {
+			const output = res.output;
+			for (const field of opts.excludedFields ?? []) delete output[field];
+			return output;
+		}
+	}
+	throw new Error("generateValid could not satisfy schema");
+}
+function _genWithHooks(schema, ctx, hooks, path) {
+	const val = _gen(schema, ctx, path);
+	const key = path[path.length - 1];
+	const pathKey = path.join(".");
+	if (hooks[pathKey]) return hooks[pathKey](val, schema, path);
+	if (key && hooks[key]) return hooks[key](val, schema, path);
+	return val;
+}
+function _gen(schema, ctx, path = []) {
+	switch (schema?.type) {
+		case "object": {
+			const out = {};
+			const entries = schema.entries ?? {};
+			for (const [key, sub] of Object.entries(entries)) {
+				const isOptional = sub?.type === "optional";
+				if (isOptional && Math.random() > ctx.includeOptionalProb) continue;
+				out[key] = _gen(isOptional ? unwrapOptional(sub) : sub, ctx, [...path, key]);
+			}
+			return out;
+		}
+		case "array": {
+			const item = schema.item ?? schema.items;
+			const min = getArrayMin(schema) ?? 0;
+			const len = randInt(min, Math.max(min, Math.min(5, getArrayMax(schema) ?? 3)));
+			return Array.from({ length: len }, () => _gen(item, ctx, [...path, String(len)]));
+		}
+		case "tuple": return (schema.items ?? schema.entries ?? []).map((s, i) => _gen(s, ctx, [...path, String(i)]));
+		case "union": {
+			const options = schema.options ?? schema.variants ?? [];
+			for (const opt of shuffle([...options])) {
+				const val = _gen(opt, ctx, path);
+				if (v.safeParse(opt, val).success) return val;
+			}
+			return _gen(options[0], ctx, path);
+		}
+		case "literal": return schema.literal;
+		case "enum": return randomItem(schema.options ?? schema.values ?? schema.variants ?? []);
+		case "picklist": return randomItem(schema.options ?? schema.values ?? schema.variants ?? []);
+		case "record": {
+			const keySchema = schema.key ?? schema.keySchema ?? v.string();
+			const valueSchema = schema.value ?? schema.valueSchema ?? v.unknown();
+			const count = randInt(1, 3);
+			const obj = {};
+			for (let i = 0; i < count; i++) {
+				const k = String(_gen(keySchema, ctx, [...path, "key"]));
+				obj[k] = _gen(valueSchema, ctx, [...path, k]);
+			}
+			return obj;
+		}
+		case "string":
+			const stringPipe = schema?.pipe || [];
+			for (const p of stringPipe) {
+				if (p?.type === "iso_date") {
+					const [min, max] = getDateBounds(schema);
+					return new Date(randInt(min.getTime(), max.getTime())).toISOString().split("T")[0];
+				}
+				if (p?.type === "iso_datetime") {
+					const [min, max] = getDateBounds(schema);
+					return new Date(randInt(min.getTime(), max.getTime())).toISOString();
+				}
+			}
+			return makeString(schema);
+		case "number":
+			schema.pipe;
+			return makeNumber(schema);
+		case "boolean": return Math.random() < .5;
+		case "bigint": {
+			const n = makeNumber(schema);
+			return BigInt(Math.trunc(n));
+		}
+		case "date": {
+			const [min, max] = getDateBounds(schema);
+			return new Date(randInt(min.getTime(), max.getTime()));
+		}
+		case "nullable": {
+			const inner = schema.wrapped ?? schema.inner ?? schema.item;
+			return Math.random() < .2 ? null : _gen(inner, ctx, path);
+		}
+		case "optional": return _gen(unwrapOptional(schema), ctx, path);
+		default: return {};
+	}
+}
+function unwrapOptional(s) {
+	return s.wrapped ?? s.inner ?? s.item ?? s.schema ?? s;
+}
+function getChecks(schema) {
+	return Array.isArray(schema?.pipe) ? schema.pipe : [];
+}
+function getArrayMin(schema) {
+	const min = getChecks(schema).find((c) => c?.type === "min_length")?.requirement;
+	return typeof min === "number" ? min : void 0;
+}
+function getArrayMax(schema) {
+	const max = getChecks(schema).find((c) => c?.type === "max_length")?.requirement;
+	return typeof max === "number" ? max : void 0;
+}
+function makeString(schema) {
+	const checks = getChecks(schema);
+	const has = (k) => checks.some((c) => c?.type === k);
+	if (has("email")) return `${boundedAscii(5, 10).toLowerCase()}@${boundedAscii(3, 8).toLowerCase()}.com`;
+	if (has("url")) return `https://${boundedAscii(3, 8).toLowerCase()}.dev/${boundedAscii(3, 10)}`;
+	if (has("uuid")) return cryptoLikeRandomUUID();
+	if (checks.some((c) => c?.message?.includes("valid phone number"))) return `+1${fromPool("0123456789", 10)}`;
+	const minLen = checks.find((c) => c?.type === "min_length")?.requirement ?? 0;
+	const maxLen = checks.find((c) => c?.type === "max_length")?.requirement ?? Math.max(8, minLen + 8);
+	const targetLen = clamp(randInt(minLen, Math.max(minLen, Math.min(24, maxLen))), minLen, maxLen);
+	const rx = checks.find((c) => c?.type === "regex")?.requirement;
+	if (rx) {
+		pickPoolForRegex(rx);
+		const rxp = new RandExp(rx);
+		for (let i = 0; i < 80; i++) {
+			const limit = randInt(minLen, Math.min(maxLen, targetLen));
+			let candidate = rxp.gen();
+			if (candidate.length > limit) candidate = candidate.slice(0, limit);
+			if (rx.test(candidate) && candidate.length >= minLen && candidate.length <= maxLen) return candidate;
+		}
+	}
+	return boundedAscii(minLen, targetLen);
+}
+function makeNumber(schema) {
+	const checks = getChecks(schema);
+	let min = checks.find((c) => c?.type === "min_value")?.requirement ?? 0;
+	let max = checks.find((c) => c?.type === "max_value")?.requirement ?? 1e3;
+	if (min > max) [min, max] = [max, min];
+	return checks.some((c) => c?.type === "number" || c?.type === "int") ? randInt(Math.ceil(min), Math.floor(max)) : randFloat(min, max);
+}
+function getDateBounds(schema) {
+	const checks = getChecks(schema);
+	const min = checks.find((c) => c?.type === "min_value")?.requirement;
+	const max = checks.find((c) => c?.type === "max_value")?.requirement;
+	return [min instanceof Date ? min : /* @__PURE__ */ new Date(Date.now() - 365 * 24 * 3600 * 1e3), max instanceof Date ? max : new Date(Date.now() + 365 * 24 * 3600 * 1e3)];
+}
+const ABC = "abcdefghijklmnopqrstuvwxyz";
+const NUM = "0123456789";
+const ALNUM = ABC + ABC.toUpperCase() + NUM;
+const VALUE_SAFE = ALNUM + "._-";
+function pickPoolForRegex(rx) {
+	const src = rx.source;
+	if (/^\^?[\(\[]?[A-Za-z0-9._-]+\+[\)\]]\??\$?$/.test(src) || REGEX_UTM_VALUE.test(src)) return VALUE_SAFE;
+	if (/\[0-9\]|\\d/.test(src)) {
+		if (!/[a-zA-Z]/.test(src)) return NUM;
+		return ALNUM;
+	}
+	if (/\[a-z]/.test(src) && /\[A-Z]/.test(src)) return ALNUM;
+	if (/\[a-z]/.test(src)) return ABC;
+	if (/\[A-Z]/.test(src)) return ABC.toUpperCase();
+	return ALNUM;
+}
+function fromPool(pool, len) {
+	let s = "";
+	for (let i = 0; i < len; i++) s += pool[randInt(0, pool.length - 1)];
+	return s;
+}
+function boundedAscii(min, max) {
+	const len = randInt(min, Math.max(min, max));
+	let s = "";
+	for (let i = 0; i < len; i++) s += ALNUM[randInt(0, ALNUM.length - 1)];
+	return s;
+}
+function cryptoLikeRandomUUID() {
+	if (typeof crypto !== "undefined" && typeof crypto.randomUUID === "function") return crypto.randomUUID();
+	const s = [];
+	const hex = "0123456789abcdef";
+	for (let i = 0; i < 36; i++) s[i] = hex[randInt(0, 15)];
+	s[14] = "4";
+	s[19] = hex[parseInt(s[19], 16) & 3 | 8];
+	s[8] = s[13] = s[18] = s[23] = "-";
+	return s.join("");
+}
+function randInt(min, max) {
+	const lo = Math.ceil(min);
+	return Math.floor(Math.random() * (Math.floor(max) - lo + 1)) + lo;
+}
+function randFloat(min, max) {
+	return Math.random() * (max - min) + min;
+}
+function randomItem(arr) {
+	return arr[randInt(0, arr.length - 1)];
+}
+function shuffle(arr) {
+	for (let i = arr.length - 1; i > 0; i--) {
+		const j = randInt(0, i);
+		[arr[i], arr[j]] = [arr[j], arr[i]];
+	}
+	return arr;
+}
+function deepMerge(a, b) {
+	if (Array.isArray(a) && Array.isArray(b)) return b;
+	if (isPlain(a) && isPlain(b)) {
+		const out = { ...a };
+		for (const [k, v] of Object.entries(b)) {
+			if (v === void 0) continue;
+			out[k] = k in a ? deepMerge(a[k], v) : v;
+		}
+		return out;
+	}
+	return b ?? a;
+}
+function isPlain(x) {
+	return typeof x === "object" && x !== null && !Array.isArray(x);
+}
+function clamp(n, lo, hi) {
+	return Math.max(lo, Math.min(hi, n));
+}
+//#endregion
+export { boundedAscii, generateValid };