splithub 0.1.9 → 0.2.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (80) hide show
  1. package/README.md +11 -0
  2. package/dist/chunk-3RVNT2HA.js +54 -0
  3. package/dist/chunk-3RVNT2HA.js.map +1 -0
  4. package/dist/chunk-5C24F2ZN.js +113 -0
  5. package/dist/chunk-5C24F2ZN.js.map +1 -0
  6. package/dist/chunk-B6FITBWN.js +384 -0
  7. package/dist/chunk-B6FITBWN.js.map +1 -0
  8. package/dist/chunk-BJQJGLOB.js +160 -0
  9. package/dist/chunk-BJQJGLOB.js.map +1 -0
  10. package/dist/chunk-DDWYTOX4.js +565 -0
  11. package/dist/chunk-DDWYTOX4.js.map +1 -0
  12. package/dist/chunk-DUIJ5DTV.js +170 -0
  13. package/dist/chunk-DUIJ5DTV.js.map +1 -0
  14. package/dist/chunk-E5VH4BQX.js +326 -0
  15. package/dist/chunk-E5VH4BQX.js.map +1 -0
  16. package/dist/chunk-EYYLDI5J.js +195 -0
  17. package/dist/chunk-EYYLDI5J.js.map +1 -0
  18. package/dist/chunk-GVARYUL3.js +28 -0
  19. package/dist/chunk-GVARYUL3.js.map +1 -0
  20. package/dist/chunk-KMO5GGGC.js +185 -0
  21. package/dist/chunk-KMO5GGGC.js.map +1 -0
  22. package/dist/chunk-LT4JP3IF.js +119 -0
  23. package/dist/chunk-LT4JP3IF.js.map +1 -0
  24. package/dist/chunk-NMN5YGNP.js +72 -0
  25. package/dist/chunk-NMN5YGNP.js.map +1 -0
  26. package/dist/chunk-OHA2M7QR.js +264 -0
  27. package/dist/chunk-OHA2M7QR.js.map +1 -0
  28. package/dist/chunk-OYM64FMD.js +63 -0
  29. package/dist/chunk-OYM64FMD.js.map +1 -0
  30. package/dist/chunk-PLXDG4B5.js +134 -0
  31. package/dist/chunk-PLXDG4B5.js.map +1 -0
  32. package/dist/chunk-PNPOOAHF.js +393 -0
  33. package/dist/chunk-PNPOOAHF.js.map +1 -0
  34. package/dist/chunk-RYDA7PQF.js +97 -0
  35. package/dist/chunk-RYDA7PQF.js.map +1 -0
  36. package/dist/chunk-V3DLUVOE.js +112 -0
  37. package/dist/chunk-V3DLUVOE.js.map +1 -0
  38. package/dist/ci-ZQZ6RBUJ.js +16 -0
  39. package/dist/ci-ZQZ6RBUJ.js.map +1 -0
  40. package/dist/create-AEJVXN25.js +18 -0
  41. package/dist/create-AEJVXN25.js.map +1 -0
  42. package/dist/dev-W2JGUV2A.js +11 -0
  43. package/dist/dev-W2JGUV2A.js.map +1 -0
  44. package/dist/doctor-D3KOGOX6.js +14 -0
  45. package/dist/doctor-D3KOGOX6.js.map +1 -0
  46. package/dist/holdout-BWVTTLEY.js +44 -0
  47. package/dist/holdout-BWVTTLEY.js.map +1 -0
  48. package/dist/index.js +94 -2240
  49. package/dist/index.js.map +1 -1
  50. package/dist/init-UBUDSJBD.js +15 -0
  51. package/dist/init-UBUDSJBD.js.map +1 -0
  52. package/dist/lifecycle-ZLZUTASA.js +12 -0
  53. package/dist/lifecycle-ZLZUTASA.js.map +1 -0
  54. package/dist/login-TIIX5V4O.js +18 -0
  55. package/dist/login-TIIX5V4O.js.map +1 -0
  56. package/dist/menu-S3WDS4JY.js +163 -0
  57. package/dist/menu-S3WDS4JY.js.map +1 -0
  58. package/dist/plan-G2A55FR7.js +135 -0
  59. package/dist/plan-G2A55FR7.js.map +1 -0
  60. package/dist/push-OJX4F2BH.js +16 -0
  61. package/dist/push-OJX4F2BH.js.map +1 -0
  62. package/dist/refs-RY7H3J7L.js +44 -0
  63. package/dist/refs-RY7H3J7L.js.map +1 -0
  64. package/dist/remove-EQQCDJRU.js +54 -0
  65. package/dist/remove-EQQCDJRU.js.map +1 -0
  66. package/dist/report-6WNO576N.js +69 -0
  67. package/dist/report-6WNO576N.js.map +1 -0
  68. package/dist/results-ZDOCWN6U.js +21 -0
  69. package/dist/results-ZDOCWN6U.js.map +1 -0
  70. package/dist/review-7E7JVMMV.js +34 -0
  71. package/dist/review-7E7JVMMV.js.map +1 -0
  72. package/dist/ship-MRBHWFZR.js +450 -0
  73. package/dist/ship-MRBHWFZR.js.map +1 -0
  74. package/dist/skills-JJOKGNO5.js +13 -0
  75. package/dist/skills-JJOKGNO5.js.map +1 -0
  76. package/dist/status-SATP23WK.js +12 -0
  77. package/dist/status-SATP23WK.js.map +1 -0
  78. package/dist/update-67QDJ6GF.js +37 -0
  79. package/dist/update-67QDJ6GF.js.map +1 -0
  80. package/package.json +22 -5
@@ -0,0 +1,18 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ deviceLogin,
4
+ login,
5
+ logout,
6
+ projects,
7
+ whoami
8
+ } from "./chunk-5C24F2ZN.js";
9
+ import "./chunk-BJQJGLOB.js";
10
+ import "./chunk-V3DLUVOE.js";
11
+ export {
12
+ deviceLogin,
13
+ login,
14
+ logout,
15
+ projects,
16
+ whoami
17
+ };
18
+ //# sourceMappingURL=login-TIIX5V4O.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}
@@ -0,0 +1,163 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ lifecycle
4
+ } from "./chunk-3RVNT2HA.js";
5
+ import {
6
+ pull,
7
+ push
8
+ } from "./chunk-KMO5GGGC.js";
9
+ import {
10
+ status
11
+ } from "./chunk-OYM64FMD.js";
12
+ import {
13
+ results
14
+ } from "./chunk-DUIJ5DTV.js";
15
+ import {
16
+ create
17
+ } from "./chunk-E5VH4BQX.js";
18
+ import {
19
+ dev
20
+ } from "./chunk-NMN5YGNP.js";
21
+ import {
22
+ doctor
23
+ } from "./chunk-LT4JP3IF.js";
24
+ import "./chunk-GVARYUL3.js";
25
+ import "./chunk-OHA2M7QR.js";
26
+ import "./chunk-B6FITBWN.js";
27
+ import {
28
+ init
29
+ } from "./chunk-PNPOOAHF.js";
30
+ import {
31
+ login,
32
+ logout
33
+ } from "./chunk-5C24F2ZN.js";
34
+ import {
35
+ cloudTarget,
36
+ fetchStatus,
37
+ loadCredential,
38
+ resolveTarget
39
+ } from "./chunk-BJQJGLOB.js";
40
+ import {
41
+ skills
42
+ } from "./chunk-RYDA7PQF.js";
43
+ import "./chunk-DDWYTOX4.js";
44
+ import "./chunk-EYYLDI5J.js";
45
+ import {
46
+ detectProject
47
+ } from "./chunk-PLXDG4B5.js";
48
+ import {
49
+ c
50
+ } from "./chunk-V3DLUVOE.js";
51
+
52
+ // src/commands/menu.ts
53
+ import * as p from "@clack/prompts";
54
+ import { readFileSync } from "fs";
55
+ function state(flags) {
56
+ const project = detectProject();
57
+ const api = cloudTarget({ api: flags.api }).url;
58
+ const cred = loadCredential(api, project.root);
59
+ const mode = project.configFile ? /mode\s*:\s*['"]cloud['"]/.test(readSafe(project.configFile)) ? "cloud" : "self" : null;
60
+ return { project, cred, mode, connected: Boolean(cred || process.env.SPLITHUB_API_KEY) };
61
+ }
62
+ function readSafe(file) {
63
+ try {
64
+ return readFileSync(file, "utf8");
65
+ } catch {
66
+ return "";
67
+ }
68
+ }
69
+ async function pickExperiment(flags, message) {
70
+ try {
71
+ const data = await fetchStatus(resolveTarget(flags, detectProject()));
72
+ if (data.experiments.length === 0) {
73
+ p.log.warn("no experiments yet");
74
+ return null;
75
+ }
76
+ const picked = await p.select({ message, options: data.experiments.map((e) => ({ value: e.experiment, label: e.experiment, hint: `${e.status} \xB7 ${e.visitors} visitors${e.headline ? ` \xB7 ${e.headline}` : ""}` })) });
77
+ if (p.isCancel(picked)) return null;
78
+ return picked;
79
+ } catch (error) {
80
+ p.log.error(error instanceof Error ? error.message : String(error));
81
+ return null;
82
+ }
83
+ }
84
+ async function menu(flags) {
85
+ p.intro(c.bold("splithub"));
86
+ for (; ; ) {
87
+ const s = state(flags);
88
+ const where = s.project.configFile ? `${c.green("config")} ${s.mode === "cloud" ? "cloud mode" : "self-hosted"}` : c.yellow("no config yet");
89
+ const who = s.cred ? `${c.green("connected")} to ${c.cyan(s.cred.projectName ?? s.cred.projectId ?? "project")}` : s.mode === "cloud" ? c.yellow("not connected") : c.dim("local only");
90
+ p.log.info(`${c.bold(s.project.name)} (${s.project.framework}) \xB7 ${where} \xB7 ${who}`);
91
+ const options = [];
92
+ if (!s.project.configFile) options.push({ value: "init", label: "Set up this app", hint: "config, framework files, agent docs, sign-in link" });
93
+ else {
94
+ if (s.mode === "cloud" && !s.connected) options.push({ value: "login", label: "Connect to SplitHub Cloud", hint: "opens a sign-in link" });
95
+ options.push({ value: "create", label: "Create an experiment", hint: "step by step" });
96
+ options.push({ value: "status", label: "Status of all experiments" });
97
+ options.push({ value: "results", label: "Results of one experiment", hint: "verdict, lift, confidence" });
98
+ options.push({ value: "start", label: "Start an experiment" }, { value: "pause", label: "Pause an experiment" }, { value: "finish", label: "Finish an experiment" });
99
+ if (s.mode === "cloud") options.push({ value: "push", label: "Push config to the cloud", hint: "after editing splithub.config.ts" }, { value: "pull", label: "Pull dashboard changes into the file" });
100
+ options.push({ value: "dev", label: "Test locally in the browser", hint: "debug panel: variants, reasons, events" });
101
+ options.push({ value: "doctor", label: "Check the installation" });
102
+ options.push({ value: "skills", label: "Install agent skills + MCP server", hint: "Claude Code, Cursor, Codex" });
103
+ if (s.cred) options.push({ value: "logout", label: "Disconnect this folder" });
104
+ }
105
+ options.push({ value: "exit", label: "Exit" });
106
+ const action = await p.select({ message: "What do you want to do?", options });
107
+ if (p.isCancel(action) || action === "exit") break;
108
+ try {
109
+ switch (action) {
110
+ case "init":
111
+ await init({ ...flags, mode: flags.mode ?? "cloud" });
112
+ break;
113
+ case "login":
114
+ await login({ ...flags, yes: true });
115
+ break;
116
+ case "create":
117
+ await create(flags);
118
+ break;
119
+ case "status":
120
+ await status(flags);
121
+ break;
122
+ case "results": {
123
+ const key = await pickExperiment(flags, "Which experiment?");
124
+ if (key) await results(key, flags);
125
+ break;
126
+ }
127
+ case "start":
128
+ case "pause":
129
+ case "finish": {
130
+ const key = await pickExperiment(flags, `Which experiment to ${action}?`);
131
+ if (key) await lifecycle(action, key, flags);
132
+ break;
133
+ }
134
+ case "push":
135
+ await push(flags);
136
+ break;
137
+ case "pull":
138
+ await pull(flags);
139
+ break;
140
+ case "logout":
141
+ await logout(flags);
142
+ break;
143
+ case "dev":
144
+ await dev(flags);
145
+ break;
146
+ case "doctor":
147
+ await doctor(flags);
148
+ break;
149
+ case "skills":
150
+ await skills({ ...flags, mcp: true });
151
+ break;
152
+ }
153
+ } catch (error) {
154
+ p.log.error(error instanceof Error ? error.message : String(error));
155
+ }
156
+ console.log();
157
+ }
158
+ p.outro(`Scripts and agents: ${c.cyan("splithub --help")} lists every command; add ${c.cyan("--json")} for machine output.`);
159
+ }
160
+ export {
161
+ menu
162
+ };
163
+ //# sourceMappingURL=menu-S3WDS4JY.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/commands/menu.ts"],"sourcesContent":["// `npx splithub` with no arguments: a menu that walks through everything step\n// by step (like an interactive assistant), so nobody has to learn the flags.\n// Agents and scripts keep using the subcommands + --json.\nimport * as p from '@clack/prompts';\nimport { readFileSync } from 'node:fs';\nimport { cloudTarget, fetchStatus, resolveTarget } from '../api';\nimport { loadCredential } from '../credentials';\nimport { detectProject } from '../project';\nimport { c } from '../ui';\nimport { create } from './create';\nimport { dev } from './dev';\nimport { doctor } from './doctor';\nimport { init, type Flags } from './init';\nimport { lifecycle } from './lifecycle';\nimport { login, logout } from './login';\nimport { pull, push } from './push';\nimport { results } from './results';\nimport { skills } from './skills';\nimport { status } from './status';\n\ntype Action = 'init' | 'create' | 'status' | 'results' | 'start' | 'pause' | 'finish' | 'push' | 'pull' | 'login' | 'logout' | 'dev' | 'doctor' | 'skills' | 'exit';\n\nfunction state(flags: Flags) {\n const project = detectProject();\n const api = cloudTarget({ api: flags.api }).url;\n const cred = loadCredential(api, project.root);\n const mode = project.configFile ? (/mode\\s*:\\s*['\"]cloud['\"]/.test(readSafe(project.configFile)) ? 'cloud' : 'self') : null;\n return { project, cred, mode, connected: Boolean(cred || process.env.SPLITHUB_API_KEY) };\n}\n\nfunction readSafe(file: string): string {\n try {\n return readFileSync(file, 'utf8');\n } catch {\n return '';\n }\n}\n\nasync function pickExperiment(flags: Flags, message: string): Promise<string | null> {\n try {\n const data = await fetchStatus(resolveTarget(flags, detectProject()));\n if (data.experiments.length === 0) {\n p.log.warn('no experiments yet');\n return null;\n }\n const picked = await p.select({ message, options: data.experiments.map((e) => ({ value: e.experiment, label: e.experiment, hint: `${e.status} · ${e.visitors} visitors${e.headline ? ` · ${e.headline}` : ''}` })) });\n if (p.isCancel(picked)) return null;\n return picked as string;\n } catch (error) {\n p.log.error(error instanceof Error ? error.message : String(error));\n return null;\n }\n}\n\nexport async function menu(flags: Flags): Promise<void> {\n p.intro(c.bold('splithub'));\n for (;;) {\n const s = state(flags);\n const where = s.project.configFile ? `${c.green('config')} ${s.mode === 'cloud' ? 'cloud mode' : 'self-hosted'}` : c.yellow('no config yet');\n const who = s.cred ? `${c.green('connected')} to ${c.cyan(s.cred.projectName ?? s.cred.projectId ?? 'project')}` : s.mode === 'cloud' ? c.yellow('not connected') : c.dim('local only');\n p.log.info(`${c.bold(s.project.name)} (${s.project.framework}) · ${where} · ${who}`);\n\n const options: Array<{ value: Action; label: string; hint?: string }> = [];\n if (!s.project.configFile) options.push({ value: 'init', label: 'Set up this app', hint: 'config, framework files, agent docs, sign-in link' });\n else {\n if (s.mode === 'cloud' && !s.connected) options.push({ value: 'login', label: 'Connect to SplitHub Cloud', hint: 'opens a sign-in link' });\n options.push({ value: 'create', label: 'Create an experiment', hint: 'step by step' });\n options.push({ value: 'status', label: 'Status of all experiments' });\n options.push({ value: 'results', label: 'Results of one experiment', hint: 'verdict, lift, confidence' });\n options.push({ value: 'start', label: 'Start an experiment' }, { value: 'pause', label: 'Pause an experiment' }, { value: 'finish', label: 'Finish an experiment' });\n if (s.mode === 'cloud') options.push({ value: 'push', label: 'Push config to the cloud', hint: 'after editing splithub.config.ts' }, { value: 'pull', label: 'Pull dashboard changes into the file' });\n options.push({ value: 'dev', label: 'Test locally in the browser', hint: 'debug panel: variants, reasons, events' });\n options.push({ value: 'doctor', label: 'Check the installation' });\n options.push({ value: 'skills', label: 'Install agent skills + MCP server', hint: 'Claude Code, Cursor, Codex' });\n if (s.cred) options.push({ value: 'logout', label: 'Disconnect this folder' });\n }\n options.push({ value: 'exit', label: 'Exit' });\n\n const action = await p.select<Action>({ message: 'What do you want to do?', options });\n if (p.isCancel(action) || action === 'exit') break;\n try {\n switch (action) {\n case 'init':\n await init({ ...flags, mode: flags.mode ?? 'cloud' });\n break;\n case 'login':\n await login({ ...flags, yes: true });\n break;\n case 'create':\n await create(flags);\n break;\n case 'status':\n await status(flags);\n break;\n case 'results': {\n const key = await pickExperiment(flags, 'Which experiment?');\n if (key) await results(key, flags);\n break;\n }\n case 'start':\n case 'pause':\n case 'finish': {\n const key = await pickExperiment(flags, `Which experiment to ${action}?`);\n if (key) await lifecycle(action, key, flags);\n break;\n }\n case 'push':\n await push(flags);\n break;\n case 'pull':\n await pull(flags);\n break;\n case 'logout':\n await logout(flags);\n break;\n case 'dev':\n await dev(flags);\n break;\n case 'doctor':\n await doctor(flags);\n break;\n case 'skills':\n await skills({ ...flags, mcp: true });\n break;\n }\n } catch (error) {\n p.log.error(error instanceof Error ? error.message : String(error));\n }\n console.log();\n }\n p.outro(`Scripts and agents: ${c.cyan('splithub --help')} lists every command; add ${c.cyan('--json')} for machine output.`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGA,YAAY,OAAO;AACnB,SAAS,oBAAoB;AAkB7B,SAAS,MAAM,OAAc;AAC3B,QAAM,UAAU,cAAc;AAC9B,QAAM,MAAM,YAAY,EAAE,KAAK,MAAM,IAAI,CAAC,EAAE;AAC5C,QAAM,OAAO,eAAe,KAAK,QAAQ,IAAI;AAC7C,QAAM,OAAO,QAAQ,aAAc,2BAA2B,KAAK,SAAS,QAAQ,UAAU,CAAC,IAAI,UAAU,SAAU;AACvH,SAAO,EAAE,SAAS,MAAM,MAAM,WAAW,QAAQ,QAAQ,QAAQ,IAAI,gBAAgB,EAAE;AACzF;AAEA,SAAS,SAAS,MAAsB;AACtC,MAAI;AACF,WAAO,aAAa,MAAM,MAAM;AAAA,EAClC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,eAAe,OAAc,SAAyC;AACnF,MAAI;AACF,UAAM,OAAO,MAAM,YAAY,cAAc,OAAO,cAAc,CAAC,CAAC;AACpE,QAAI,KAAK,YAAY,WAAW,GAAG;AACjC,MAAE,MAAI,KAAK,oBAAoB;AAC/B,aAAO;AAAA,IACT;AACA,UAAM,SAAS,MAAQ,SAAO,EAAE,SAAS,SAAS,KAAK,YAAY,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,OAAO,EAAE,YAAY,MAAM,GAAG,EAAE,MAAM,SAAM,EAAE,QAAQ,YAAY,EAAE,WAAW,SAAM,EAAE,QAAQ,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;AACpN,QAAM,WAAS,MAAM,EAAG,QAAO;AAC/B,WAAO;AAAA,EACT,SAAS,OAAO;AACd,IAAE,MAAI,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAClE,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,KAAK,OAA6B;AACtD,EAAE,QAAM,EAAE,KAAK,UAAU,CAAC;AAC1B,aAAS;AACP,UAAM,IAAI,MAAM,KAAK;AACrB,UAAM,QAAQ,EAAE,QAAQ,aAAa,GAAG,EAAE,MAAM,QAAQ,CAAC,IAAI,EAAE,SAAS,UAAU,eAAe,aAAa,KAAK,EAAE,OAAO,eAAe;AAC3I,UAAM,MAAM,EAAE,OAAO,GAAG,EAAE,MAAM,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,eAAe,EAAE,KAAK,aAAa,SAAS,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,OAAO,eAAe,IAAI,EAAE,IAAI,YAAY;AACtL,IAAE,MAAI,KAAK,GAAG,EAAE,KAAK,EAAE,QAAQ,IAAI,CAAC,KAAK,EAAE,QAAQ,SAAS,UAAO,KAAK,SAAM,GAAG,EAAE;AAEnF,UAAM,UAAkE,CAAC;AACzE,QAAI,CAAC,EAAE,QAAQ,WAAY,SAAQ,KAAK,EAAE,OAAO,QAAQ,OAAO,mBAAmB,MAAM,oDAAoD,CAAC;AAAA,SACzI;AACH,UAAI,EAAE,SAAS,WAAW,CAAC,EAAE,UAAW,SAAQ,KAAK,EAAE,OAAO,SAAS,OAAO,6BAA6B,MAAM,uBAAuB,CAAC;AACzI,cAAQ,KAAK,EAAE,OAAO,UAAU,OAAO,wBAAwB,MAAM,eAAe,CAAC;AACrF,cAAQ,KAAK,EAAE,OAAO,UAAU,OAAO,4BAA4B,CAAC;AACpE,cAAQ,KAAK,EAAE,OAAO,WAAW,OAAO,6BAA6B,MAAM,4BAA4B,CAAC;AACxG,cAAQ,KAAK,EAAE,OAAO,SAAS,OAAO,sBAAsB,GAAG,EAAE,OAAO,SAAS,OAAO,sBAAsB,GAAG,EAAE,OAAO,UAAU,OAAO,uBAAuB,CAAC;AACnK,UAAI,EAAE,SAAS,QAAS,SAAQ,KAAK,EAAE,OAAO,QAAQ,OAAO,4BAA4B,MAAM,mCAAmC,GAAG,EAAE,OAAO,QAAQ,OAAO,uCAAuC,CAAC;AACrM,cAAQ,KAAK,EAAE,OAAO,OAAO,OAAO,+BAA+B,MAAM,yCAAyC,CAAC;AACnH,cAAQ,KAAK,EAAE,OAAO,UAAU,OAAO,yBAAyB,CAAC;AACjE,cAAQ,KAAK,EAAE,OAAO,UAAU,OAAO,qCAAqC,MAAM,6BAA6B,CAAC;AAChH,UAAI,EAAE,KAAM,SAAQ,KAAK,EAAE,OAAO,UAAU,OAAO,yBAAyB,CAAC;AAAA,IAC/E;AACA,YAAQ,KAAK,EAAE,OAAO,QAAQ,OAAO,OAAO,CAAC;AAE7C,UAAM,SAAS,MAAQ,SAAe,EAAE,SAAS,2BAA2B,QAAQ,CAAC;AACrF,QAAM,WAAS,MAAM,KAAK,WAAW,OAAQ;AAC7C,QAAI;AACF,cAAQ,QAAQ;AAAA,QACd,KAAK;AACH,gBAAM,KAAK,EAAE,GAAG,OAAO,MAAM,MAAM,QAAQ,QAAQ,CAAC;AACpD;AAAA,QACF,KAAK;AACH,gBAAM,MAAM,EAAE,GAAG,OAAO,KAAK,KAAK,CAAC;AACnC;AAAA,QACF,KAAK;AACH,gBAAM,OAAO,KAAK;AAClB;AAAA,QACF,KAAK;AACH,gBAAM,OAAO,KAAK;AAClB;AAAA,QACF,KAAK,WAAW;AACd,gBAAM,MAAM,MAAM,eAAe,OAAO,mBAAmB;AAC3D,cAAI,IAAK,OAAM,QAAQ,KAAK,KAAK;AACjC;AAAA,QACF;AAAA,QACA,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,UAAU;AACb,gBAAM,MAAM,MAAM,eAAe,OAAO,uBAAuB,MAAM,GAAG;AACxE,cAAI,IAAK,OAAM,UAAU,QAAQ,KAAK,KAAK;AAC3C;AAAA,QACF;AAAA,QACA,KAAK;AACH,gBAAM,KAAK,KAAK;AAChB;AAAA,QACF,KAAK;AACH,gBAAM,KAAK,KAAK;AAChB;AAAA,QACF,KAAK;AACH,gBAAM,OAAO,KAAK;AAClB;AAAA,QACF,KAAK;AACH,gBAAM,IAAI,KAAK;AACf;AAAA,QACF,KAAK;AACH,gBAAM,OAAO,KAAK;AAClB;AAAA,QACF,KAAK;AACH,gBAAM,OAAO,EAAE,GAAG,OAAO,KAAK,KAAK,CAAC;AACpC;AAAA,MACJ;AAAA,IACF,SAAS,OAAO;AACd,MAAE,MAAI,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACpE;AACA,YAAQ,IAAI;AAAA,EACd;AACA,EAAE,QAAM,uBAAuB,EAAE,KAAK,iBAAiB,CAAC,6BAA6B,EAAE,KAAK,QAAQ,CAAC,sBAAsB;AAC7H;","names":[]}
@@ -0,0 +1,135 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ fetchStatus,
4
+ resolveTarget
5
+ } from "./chunk-BJQJGLOB.js";
6
+ import {
7
+ detectProject
8
+ } from "./chunk-PLXDG4B5.js";
9
+ import {
10
+ c,
11
+ fail,
12
+ printJson
13
+ } from "./chunk-V3DLUVOE.js";
14
+
15
+ // ../stats/dist/index.js
16
+ function inverseNormalCdf(p) {
17
+ if (p <= 0) return -Infinity;
18
+ if (p >= 1) return Infinity;
19
+ const a = [-39.69683028665376, 220.9460984245205, -275.9285104469687, 138.357751867269, -30.66479806614716, 2.506628277459239];
20
+ const b = [-54.47609879822406, 161.5858368580409, -155.6989798598866, 66.80131188771972, -13.28068155288572];
21
+ const c2 = [-0.007784894002430293, -0.3223964580411365, -2.400758277161838, -2.549732539343734, 4.374664141464968, 2.938163982698783];
22
+ const d = [0.007784695709041462, 0.3224671290700398, 2.445134137142996, 3.754408661907416];
23
+ const pLow = 0.02425;
24
+ let q;
25
+ if (p < pLow) {
26
+ q = Math.sqrt(-2 * Math.log(p));
27
+ return (((((c2[0] * q + c2[1]) * q + c2[2]) * q + c2[3]) * q + c2[4]) * q + c2[5]) / ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1);
28
+ }
29
+ if (p > 1 - pLow) {
30
+ q = Math.sqrt(-2 * Math.log(1 - p));
31
+ return -(((((c2[0] * q + c2[1]) * q + c2[2]) * q + c2[3]) * q + c2[4]) * q + c2[5]) / ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1);
32
+ }
33
+ q = p - 0.5;
34
+ const r = q * q;
35
+ return (((((a[0] * r + a[1]) * r + a[2]) * r + a[3]) * r + a[4]) * r + a[5]) * q / (((((b[0] * r + b[1]) * r + b[2]) * r + b[3]) * r + b[4]) * r + 1);
36
+ }
37
+ function requiredExposuresPerVariant(baselineRate, relativeLift, confidence = 0.95, power = 0.8) {
38
+ if (baselineRate <= 0 || baselineRate >= 1 || !Number.isFinite(relativeLift) || relativeLift === 0) return null;
39
+ const p1 = baselineRate;
40
+ const p2 = Math.min(0.999, Math.max(1e-3, p1 * (1 + relativeLift)));
41
+ const zA = inverseNormalCdf(1 - (1 - confidence) / 2);
42
+ const zB = inverseNormalCdf(power);
43
+ const pBar = (p1 + p2) / 2;
44
+ const n = Math.pow(zA * Math.sqrt(2 * pBar * (1 - pBar)) + zB * Math.sqrt(p1 * (1 - p1) + p2 * (1 - p2)), 2) / Math.pow(p2 - p1, 2);
45
+ return Math.ceil(n);
46
+ }
47
+ function boundary(variance, tau2, alpha) {
48
+ const total = variance + tau2;
49
+ return Math.sqrt(variance * total / tau2 * (Math.log(total / variance) - 2 * Math.log(alpha)));
50
+ }
51
+ var DEFAULT_MIXTURE = 0.2;
52
+ function proportionTau2(pooledRate, mixture) {
53
+ return Math.pow(mixture * pooledRate, 2);
54
+ }
55
+ function sequentialExposuresPerVariant({ baselineRate, relativeLift, alpha = 0.05, power = 0.8, mixture = DEFAULT_MIXTURE }) {
56
+ if (baselineRate <= 0 || baselineRate >= 1 || !Number.isFinite(relativeLift) || relativeLift === 0) return null;
57
+ const p1 = baselineRate;
58
+ const p2 = Math.min(0.999, Math.max(1e-3, p1 * (1 + relativeLift)));
59
+ const theta = Math.abs(p2 - p1);
60
+ const unit = p1 * (1 - p1) + p2 * (1 - p2);
61
+ const tau2 = proportionTau2((p1 + p2) / 2, mixture);
62
+ const zB = inverseNormalCdf(power);
63
+ const enough = (n) => {
64
+ const v = unit / n;
65
+ return theta >= boundary(v, tau2, alpha) + zB * Math.sqrt(v);
66
+ };
67
+ let lo = Math.max(1, (requiredExposuresPerVariant(p1, relativeLift, 1 - alpha, power) ?? 2) - 1);
68
+ if (enough(lo)) return Math.ceil(lo);
69
+ let hi = lo * 2;
70
+ while (!enough(hi)) {
71
+ lo = hi;
72
+ hi *= 2;
73
+ if (hi > 1e12) return null;
74
+ }
75
+ while (hi - lo > 1) {
76
+ const mid = Math.floor((lo + hi) / 2);
77
+ if (enough(mid)) hi = mid;
78
+ else lo = mid;
79
+ }
80
+ return hi;
81
+ }
82
+ function planSample({ baselineRate, mde, alpha = 0.05, power = 0.8, variants = 2, sequential = true, mixture }) {
83
+ const comparisons = Math.max(1, Math.floor(variants) - 1);
84
+ const a = alpha / comparisons;
85
+ if (!sequential) return requiredExposuresPerVariant(baselineRate, mde, 1 - a, power);
86
+ return sequentialExposuresPerVariant({ baselineRate, relativeLift: mde, alpha: a, power, mixture: mixture ?? DEFAULT_MIXTURE });
87
+ }
88
+
89
+ // src/commands/plan.ts
90
+ function num(flags, name) {
91
+ const v = flags[name];
92
+ if (typeof v !== "string" || v === "") return void 0;
93
+ const n = Number(v.replace(/%$/, "")) / (v.endsWith("%") ? 100 : 1);
94
+ if (!Number.isFinite(n)) fail("INVALID_FLAG", `--${name} "${v}" isn't a number.`);
95
+ return n;
96
+ }
97
+ function planSample2(baseline, mde, variants = 2, confidence = 0.95) {
98
+ if (!(baseline > 0 && baseline < 1)) fail("INVALID_FLAG", `--baseline ${baseline} must be a rate between 0 and 1.`, "For example --baseline 0.05 for 5% of visitors converting today.");
99
+ if (!(mde > 0)) fail("INVALID_FLAG", `--mde ${mde} must be above 0.`, "The smallest relative lift worth finding, e.g. --mde 0.1 for +10%.");
100
+ if (!Number.isInteger(variants) || variants < 2) fail("INVALID_FLAG", "--variants must be a whole number of 2 or more.");
101
+ const perVariant = planSample({ baselineRate: baseline, mde, alpha: 1 - confidence, variants });
102
+ if (perVariant === null) fail("INVALID_FLAG", "Those numbers don't give a sample size.", "Check --baseline and --mde.");
103
+ return { baseline, mde, variants, confidence, perVariant, total: perVariant * variants };
104
+ }
105
+ async function plan(id, flags) {
106
+ const baseline = num(flags, "baseline");
107
+ const mde = num(flags, "mde");
108
+ if (baseline === void 0 || mde === void 0) fail("USAGE", "Pass --baseline (conversion rate today) and --mde (smallest lift worth finding).", "For example: npx splithub plan --baseline 0.05 --mde 0.1");
109
+ const variants = num(flags, "variants") ?? 2;
110
+ const p = planSample2(baseline, mde, variants);
111
+ let traffic = null;
112
+ if (id) {
113
+ const data = await fetchStatus(resolveTarget(flags, detectProject()));
114
+ const row = data.experiments.find((e) => e.experiment === id);
115
+ if (!row) fail("EXPERIMENT_NOT_FOUND", `There's no experiment "${id}" in the results.`, "See the ids with npx splithub status.");
116
+ const perDay = row.days > 0 ? row.visitors / row.days : 0;
117
+ traffic = { experiment: id, visitors: row.visitors, days: row.days, perDay: Math.round(perDay), daysLeft: perDay > 0 ? Math.max(0, Math.ceil((p.total - row.visitors) / perDay)) : null };
118
+ }
119
+ if (flags.json) {
120
+ printJson({ ...p, traffic });
121
+ return;
122
+ }
123
+ console.log(`${c.bold(p.perVariant.toLocaleString("en-US"))} visitors per variant, ${p.total.toLocaleString("en-US")} in all`);
124
+ console.log(c.dim(`to find a ${(mde * 100).toFixed(0)}% lift on a ${(baseline * 100).toFixed(1)}% rate (95% confidence, 80% power, safe to check daily)`));
125
+ if (traffic) {
126
+ if (traffic.daysLeft === null) console.log(c.yellow(`${id} has no visitors yet, so there's no pace to go by.`));
127
+ else if (traffic.daysLeft === 0) console.log(c.green(`${id} already has enough visitors (${traffic.visitors.toLocaleString("en-US")}).`));
128
+ else console.log(`About ${traffic.daysLeft} more days for ${id} at ${traffic.perDay.toLocaleString("en-US")} visitors a day.`);
129
+ }
130
+ }
131
+ export {
132
+ plan,
133
+ planSample2 as planSample
134
+ };
135
+ //# sourceMappingURL=plan-G2A55FR7.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../stats/src/math.ts","../../stats/src/plan.ts","../../stats/src/sequential.ts","../../stats/src/metrics.ts","../../stats/src/verdict.ts","../../stats/src/revenue.ts","../src/commands/plan.ts"],"sourcesContent":["/** Lanczos approximation of ln Γ(x). */\nexport function logGamma(x: number): number {\n const g = [\n 676.5203621218851, -1259.1392167224028, 771.32342877765313, -176.61502916214059,\n 12.507343278686905, -0.13857109526572012, 9.9843695780195716e-6, 1.5056327351493116e-7,\n ];\n if (x < 0.5) return Math.log(Math.PI / Math.sin(Math.PI * x)) - logGamma(1 - x);\n const z = x - 1;\n let a = 0.99999999999980993;\n const t = z + 7.5;\n for (let i = 0; i < g.length; i++) a += g[i]! / (z + i + 1);\n return 0.5 * Math.log(2 * Math.PI) + (z + 0.5) * Math.log(t) - t + Math.log(a);\n}\n\n/** Regularized lower incomplete gamma P(a, x). */\nexport function regularizedGammaP(a: number, x: number): number {\n if (x <= 0) return 0;\n if (x < a + 1) {\n let sum = 1 / a;\n let term = sum;\n for (let n = 1; n < 200; n++) {\n term *= x / (a + n);\n sum += term;\n if (Math.abs(term) < Math.abs(sum) * 1e-14) break;\n }\n return sum * Math.exp(-x + a * Math.log(x) - logGamma(a));\n }\n const tiny = 1e-30;\n let b = x + 1 - a;\n let c = 1 / tiny;\n let d = 1 / b;\n let h = d;\n for (let i = 1; i < 200; i++) {\n const an = -i * (i - a);\n b += 2;\n d = an * d + b;\n if (Math.abs(d) < tiny) d = tiny;\n c = b + an / c;\n if (Math.abs(c) < tiny) c = tiny;\n d = 1 / d;\n const del = d * c;\n h *= del;\n if (Math.abs(del - 1) < 1e-14) break;\n }\n return 1 - Math.exp(-x + a * Math.log(x) - logGamma(a)) * h;\n}\n\n/** Chi-square upper-tail p-value. */\nexport function chiSquarePValue(chi2: number, df: number): number {\n if (df <= 0 || chi2 <= 0) return 1;\n return 1 - regularizedGammaP(df / 2, chi2 / 2);\n}\n\nexport function erf(x: number): number {\n const sign = x < 0 ? -1 : 1;\n return sign * regularizedGammaP(0.5, x * x);\n}\n\n/** Standard normal CDF. */\nexport function normalCdf(z: number): number {\n return 0.5 * (1 + erf(z / Math.SQRT2));\n}\n\n/** Inverse standard normal CDF (Acklam). */\nexport function inverseNormalCdf(p: number): number {\n if (p <= 0) return -Infinity;\n if (p >= 1) return Infinity;\n const a = [-3.969683028665376e1, 2.209460984245205e2, -2.759285104469687e2, 1.38357751867269e2, -3.066479806614716e1, 2.506628277459239];\n const b = [-5.447609879822406e1, 1.615858368580409e2, -1.556989798598866e2, 6.680131188771972e1, -1.328068155288572e1];\n const c = [-7.784894002430293e-3, -3.223964580411365e-1, -2.400758277161838, -2.549732539343734, 4.374664141464968, 2.938163982698783];\n const d = [7.784695709041462e-3, 3.224671290700398e-1, 2.445134137142996, 3.754408661907416];\n const pLow = 0.02425;\n let q: number;\n if (p < pLow) {\n q = Math.sqrt(-2 * Math.log(p));\n return (((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) / ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1);\n }\n if (p > 1 - pLow) {\n q = Math.sqrt(-2 * Math.log(1 - p));\n return -(((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) / ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1);\n }\n q = p - 0.5;\n const r = q * q;\n return ((((((a[0]! * r + a[1]!) * r + a[2]!) * r + a[3]!) * r + a[4]!) * r + a[5]!) * q) / (((((b[0]! * r + b[1]!) * r + b[2]!) * r + b[3]!) * r + b[4]!) * r + 1);\n}\n\n/** Continued fraction for the regularized incomplete beta (Numerical Recipes betacf). */\nfunction betaContinuedFraction(x: number, a: number, b: number): number {\n const tiny = 1e-30;\n const qab = a + b;\n const qap = a + 1;\n const qam = a - 1;\n let c = 1;\n let d = 1 - (qab * x) / qap;\n if (Math.abs(d) < tiny) d = tiny;\n d = 1 / d;\n let h = d;\n for (let m = 1; m <= 300; m++) {\n const m2 = 2 * m;\n let aa = (m * (b - m) * x) / ((qam + m2) * (a + m2));\n d = 1 + aa * d;\n if (Math.abs(d) < tiny) d = tiny;\n c = 1 + aa / c;\n if (Math.abs(c) < tiny) c = tiny;\n d = 1 / d;\n h *= d * c;\n aa = (-(a + m) * (qab + m) * x) / ((a + m2) * (qap + m2));\n d = 1 + aa * d;\n if (Math.abs(d) < tiny) d = tiny;\n c = 1 + aa / c;\n if (Math.abs(c) < tiny) c = tiny;\n d = 1 / d;\n const del = d * c;\n h *= del;\n if (Math.abs(del - 1) < 1e-14) break;\n }\n return h;\n}\n\n/** Regularized incomplete beta I_x(a, b). */\nexport function regularizedBeta(x: number, a: number, b: number): number {\n if (x <= 0) return 0;\n if (x >= 1) return 1;\n const front = Math.exp(logGamma(a + b) - logGamma(a) - logGamma(b) + a * Math.log(x) + b * Math.log(1 - x));\n return x < (a + 1) / (a + b + 2) ? (front * betaContinuedFraction(x, a, b)) / a : 1 - (front * betaContinuedFraction(1 - x, b, a)) / b;\n}\n\n/** Student t CDF with `df` degrees of freedom (any positive real df, as Welch needs). */\nexport function studentTCdf(t: number, df: number): number {\n if (!Number.isFinite(df) || df > 1e7) return normalCdf(t);\n const tail = 0.5 * regularizedBeta(df / (df + t * t), df / 2, 0.5);\n return t >= 0 ? 1 - tail : tail;\n}\n\n/** Inverse Student t CDF by bisection on the CDF (monotone); fine for CI widths. */\nexport function inverseStudentT(p: number, df: number): number {\n if (p <= 0) return -Infinity;\n if (p >= 1) return Infinity;\n if (!Number.isFinite(df) || df > 1e7) return inverseNormalCdf(p);\n let lo = -1;\n let hi = 1;\n while (studentTCdf(lo, df) > p) lo *= 2;\n while (studentTCdf(hi, df) < p) hi *= 2;\n for (let i = 0; i < 100; i++) {\n const mid = (lo + hi) / 2;\n if (studentTCdf(mid, df) < p) lo = mid;\n else hi = mid;\n if (hi - lo < 1e-10) break;\n }\n return (lo + hi) / 2;\n}\n","import { inverseNormalCdf } from './math';\n\n/**\n * Classic fixed-horizon sample size per variant to detect a relative lift at\n * the given confidence and power (two-sided, equal split). Null when not estimable.\n */\nexport function requiredExposuresPerVariant(baselineRate: number, relativeLift: number, confidence = 0.95, power = 0.8): number | null {\n if (baselineRate <= 0 || baselineRate >= 1 || !Number.isFinite(relativeLift) || relativeLift === 0) return null;\n const p1 = baselineRate;\n const p2 = Math.min(0.999, Math.max(0.001, p1 * (1 + relativeLift)));\n const zA = inverseNormalCdf(1 - (1 - confidence) / 2);\n const zB = inverseNormalCdf(power);\n const pBar = (p1 + p2) / 2;\n const n = Math.pow(zA * Math.sqrt(2 * pBar * (1 - pBar)) + zB * Math.sqrt(p1 * (1 - p1) + p2 * (1 - p2)), 2) / Math.pow(p2 - p1, 2);\n return Math.ceil(n);\n}\n","import { inverseNormalCdf } from './math';\nimport { requiredExposuresPerVariant } from './plan';\n\n/**\n * Always-valid inference (mixture SPRT, Johari et al. 2017, the method behind\n * Optimizely's Stats Engine). Agents poll results all the time; a fixed-horizon\n * p-value checked on every poll inflates false positives far beyond 5%. The\n * mixture likelihood ratio Λ is a martingale under \"no difference\", so\n * P(Λ ever exceeds 1/α) ≤ α however often you look.\n *\n * With an estimate θ̂ (variance V) and a N(0, τ²) prior on the true effect:\n * Λ = sqrt(V / (V + τ²)) · exp(θ̂² τ² / (2 V (V + τ²)))\n * p = min(1, 1/Λ) and the confidence sequence is every θ0 whose Λ stays < 1/α.\n */\nexport interface SequentialEstimate {\n /** Always-valid p-value: safe to read at any time. */\n pValue: number;\n /** Always-valid (1 - alpha) confidence interval of the effect. */\n ci: { low: number; high: number };\n}\n\nexport function mixtureSPRT(estimate: number, variance: number, tau2: number, alpha: number): SequentialEstimate {\n if (!(variance > 0) || !(tau2 > 0) || !Number.isFinite(estimate)) return { pValue: 1, ci: { low: estimate, high: estimate } };\n const total = variance + tau2;\n const logLambda = 0.5 * Math.log(variance / total) + (estimate * estimate * tau2) / (2 * variance * total);\n const pValue = Math.min(1, Math.exp(-logLambda));\n const half = Math.sqrt(((variance * total) / tau2) * (Math.log(total / variance) - 2 * Math.log(alpha)));\n return { pValue, ci: { low: estimate - half, high: estimate + half } };\n}\n\n/** Half-width of the always-valid interval at a given variance. */\nfunction boundary(variance: number, tau2: number, alpha: number): number {\n const total = variance + tau2;\n return Math.sqrt(((variance * total) / tau2) * (Math.log(total / variance) - 2 * Math.log(alpha)));\n}\n\n/**\n * Holm-Bonferroni step-down: which hypotheses to reject at family-wise `alpha`.\n * Uniformly more powerful than plain Bonferroni, same guarantee.\n */\nexport function holm(pValues: number[], alpha: number): boolean[] {\n const m = pValues.length;\n const order = pValues.map((p, i) => ({ p, i })).sort((a, b) => a.p - b.p);\n const out = new Array<boolean>(m).fill(false);\n for (let k = 0; k < m; k++) {\n const { p, i } = order[k]!;\n if (!(p < alpha / (m - k))) break;\n out[i] = true;\n }\n return out;\n}\n\n/**\n * Prior scale of the mixture for a two-proportion test: the mixture expects\n * effects around `mixture` (relative) of the pooled rate. Tuned to the minimum\n * effect worth detecting, so small real effects are not drowned out.\n */\n/**\n * Default relative effect scale of the mixing prior. Simulated plans show the\n * sample needed is flat between 0.1 and 0.3 for lifts of 5%–100%, about twice\n * the fixed-horizon figure; 0.2 sits in the middle.\n */\nexport const DEFAULT_MIXTURE = 0.2;\n\nexport function proportionTau2(pooledRate: number, mixture: number): number {\n return Math.pow(mixture * pooledRate, 2);\n}\n\nexport interface SequentialPlanInput {\n baselineRate: number;\n /** Relative lift to detect (0.1 = +10%). */\n relativeLift: number;\n /** Per-comparison alpha (already divided by the number of comparisons). */\n alpha?: number;\n power?: number;\n /** Relative effect scale of the mixing prior. */\n mixture?: number;\n}\n\n/**\n * Visitors per variant at which the always-valid test reaches `power` for the\n * given lift (the mixture boundary is wider than the fixed z = 1.96, so this is\n * larger than the classic figure). Null when not estimable.\n */\nexport function sequentialExposuresPerVariant({ baselineRate, relativeLift, alpha = 0.05, power = 0.8, mixture = DEFAULT_MIXTURE }: SequentialPlanInput): number | null {\n if (baselineRate <= 0 || baselineRate >= 1 || !Number.isFinite(relativeLift) || relativeLift === 0) return null;\n const p1 = baselineRate;\n const p2 = Math.min(0.999, Math.max(0.001, p1 * (1 + relativeLift)));\n const theta = Math.abs(p2 - p1);\n const unit = p1 * (1 - p1) + p2 * (1 - p2);\n const tau2 = proportionTau2((p1 + p2) / 2, mixture);\n const zB = inverseNormalCdf(power);\n const enough = (n: number) => {\n const v = unit / n;\n return theta >= boundary(v, tau2, alpha) + zB * Math.sqrt(v);\n };\n let lo = Math.max(1, (requiredExposuresPerVariant(p1, relativeLift, 1 - alpha, power) ?? 2) - 1);\n if (enough(lo)) return Math.ceil(lo);\n let hi = lo * 2;\n while (!enough(hi)) {\n lo = hi;\n hi *= 2;\n if (hi > 1e12) return null;\n }\n while (hi - lo > 1) {\n const mid = Math.floor((lo + hi) / 2);\n if (enough(mid)) hi = mid;\n else lo = mid;\n }\n return hi;\n}\n\nexport interface PlanSampleInput {\n /** Control conversion rate, 0..1. */\n baselineRate: number;\n /** Minimum detectable effect, relative (0.1 = +10%). */\n mde: number;\n /** Family-wise false positive rate. Default 0.05. */\n alpha?: number;\n /** Default 0.8. */\n power?: number;\n /** Number of variants including the control. Default 2. Alpha is split over the comparisons. */\n variants?: number;\n /**\n * true (default): visitors SplitHub's always-valid verdict needs, the number\n * that matches `computeVerdict`. false: the classic fixed-horizon figure.\n */\n sequential?: boolean;\n /** Relative effect scale of the mixing prior; defaults to the verdict's. */\n mixture?: number;\n}\n\n/** Visitors per variant to plan for. Null when not estimable (rate outside 0..1, mde 0). */\nexport function planSample({ baselineRate, mde, alpha = 0.05, power = 0.8, variants = 2, sequential = true, mixture }: PlanSampleInput): number | null {\n const comparisons = Math.max(1, Math.floor(variants) - 1);\n const a = alpha / comparisons;\n if (!sequential) return requiredExposuresPerVariant(baselineRate, mde, 1 - a, power);\n return sequentialExposuresPerVariant({ baselineRate, relativeLift: mde, alpha: a, power, mixture: mixture ?? DEFAULT_MIXTURE });\n}\n","import { normalCdf } from './math';\nimport { holm } from './sequential';\nimport { compareVariants, VERDICT_DEFAULTS, type Comparison, type VariantCounts } from './verdict';\n\n/** A goal read beside the primary one. */\nexport interface MetricInput {\n metric: string;\n role: 'secondary' | 'guardrail';\n /** Guardrails: which direction is bad. Default `lower`. */\n worse?: 'lower' | 'higher';\n /** Per-variant counts for this goal, control first, same variants as the primary goal. */\n counts: VariantCounts[];\n}\n\nexport interface MetricComparison extends Comparison {\n /**\n * Guardrails only: always-valid one-sided p-value that this variant is worse than\n * the control in the guardrail's bad direction. `significant` is decided on it.\n * Absent while either side is below the minimum sample: not judged yet.\n */\n harmPValue?: number;\n}\n\nexport interface MetricResult {\n metric: string;\n role: 'secondary' | 'guardrail';\n /** Guardrails: the bad direction. */\n worse?: 'lower' | 'higher';\n variants: VariantCounts[];\n /**\n * Secondary: two-sided, Holm-corrected across every secondary comparison of the experiment\n * (informational, never changes the verdict). Guardrail: `significant` means significantly\n * worse (one-sided), Holm-corrected across every guardrail comparison.\n */\n comparisons: MetricComparison[];\n}\n\n/** A variant that is significantly worse than the control on a guardrail. */\nexport interface GuardrailBreach {\n metric: string;\n variant: string;\n /** Relative change of the guardrail's conversion rate vs the control (negative = fewer conversions). */\n lift: number | null;\n /** One-sided always-valid p-value of the harm. */\n pValue: number;\n}\n\n/**\n * One-sided always-valid p-value from the two-sided mixture SPRT. With a N(0, τ²)\n * mixing prior, the half-normal mixture over effects in the bad direction is its\n * own test martingale: Λ₋ = 2Λ·P(θ in the bad direction | data), the posterior\n * being N(θ̂τ²/(V+τ²), Vτ²/(V+τ²)). So p₋ = min(1, p / (2·Φ(z))) with z the\n * posterior mean over its sd, signed towards harm.\n */\nexport function oneSidedPValue(twoSided: number, estimate: number, variance: number, tau2: number, bad: 'lower' | 'higher'): number {\n if (!(variance > 0) || !(tau2 > 0)) return 1;\n const z = (estimate * Math.sqrt(tau2)) / Math.sqrt(variance * (variance + tau2));\n const towardsHarm = bad === 'lower' ? -z : z;\n const share = normalCdf(towardsHarm);\n return share > 0 ? Math.min(1, twoSided / (2 * share)) : 1;\n}\n\nexport interface MetricOptions {\n confidence?: number;\n mixture?: number;\n /** Below this many visitors in the control or the variant, a guardrail is not judged. */\n minExposuresPerVariant?: number;\n}\n\n/**\n * Secondary metrics and guardrails, each compared with the control by the same\n * always-valid test as the primary goal. Two Holm families: all secondary\n * comparisons (two-sided), all guardrail comparisons (one-sided, harm only). The\n * primary goal's family is left alone, so adding metrics never weakens the verdict.\n */\nexport function compareMetrics(metrics: MetricInput[], options: MetricOptions = {}): { metrics: MetricResult[]; guardrailBreached: GuardrailBreach[] } {\n const confidence = options.confidence ?? VERDICT_DEFAULTS.confidence;\n const mixture = options.mixture ?? VERDICT_DEFAULTS.mixture;\n const minExposures = options.minExposuresPerVariant ?? VERDICT_DEFAULTS.minExposuresPerVariant;\n const alpha = 1 - confidence;\n\n const results: MetricResult[] = metrics.map((m) => {\n const comparisons: MetricComparison[] = compareVariants(m.counts, confidence, { mixture });\n if (m.role === 'guardrail') {\n const bad = m.worse ?? 'lower';\n for (const c of comparisons) {\n const p1 = c.baselineRate;\n const p2 = c.rate;\n const variance = (p1 * (1 - p1)) / Math.max(1, c.baselineExposures) + (p2 * (1 - p2)) / Math.max(1, c.exposures);\n const pooled = (c.baselineConversions + c.conversions) / Math.max(1, c.baselineExposures + c.exposures);\n const tau2 = Math.pow(mixture * pooled, 2);\n const enough = c.exposures >= minExposures && c.baselineExposures >= minExposures;\n if (enough) c.harmPValue = oneSidedPValue(c.sequential.pValue, c.absoluteLift, variance, tau2, bad);\n }\n }\n return { metric: m.metric, role: m.role, ...(m.role === 'guardrail' ? { worse: m.worse ?? 'lower' } : {}), variants: m.counts, comparisons };\n });\n\n // Holm within each family.\n for (const role of ['secondary', 'guardrail'] as const) {\n const family = results.filter((r) => r.role === role).flatMap((r) => r.comparisons);\n const rejected = holm(family.map((c) => (role === 'guardrail' ? (c.harmPValue ?? 1) : c.sequential.pValue)), alpha);\n family.forEach((c, i) => (c.significant = rejected[i]!));\n }\n\n const guardrailBreached: GuardrailBreach[] = [];\n for (const r of results) {\n if (r.role !== 'guardrail') continue;\n for (const c of r.comparisons) if (c.significant) guardrailBreached.push({ metric: r.metric, variant: c.variant, lift: c.relativeLift, pValue: c.harmPValue ?? 1 });\n }\n return { metrics: results, guardrailBreached };\n}\n","import { chiSquarePValue, inverseNormalCdf, normalCdf } from './math';\nimport { requiredExposuresPerVariant } from './plan';\nimport { compareMetrics, type GuardrailBreach, type MetricInput, type MetricResult } from './metrics';\nimport { DEFAULT_MIXTURE, holm, mixtureSPRT, proportionTau2, sequentialExposuresPerVariant, type SequentialEstimate } from './sequential';\n\nexport { requiredExposuresPerVariant };\n\n/** Per-variant counts. Unit is the visitor: unique exposed, unique converted. */\nexport interface VariantCounts {\n variant: string;\n exposures: number;\n conversions: number;\n /** Optional revenue sum for the goal. */\n revenue?: number;\n /** Revenue summed per visitor over the variant's visitors (same as `revenue` when both are present). */\n revenueSum?: number;\n /** Sum over visitors of (that visitor's revenue)². With `revenueSum`, enables the revenue-per-visitor test. */\n revenueSumSq?: number;\n}\n\nexport interface Comparison {\n variant: string;\n baseline: string;\n exposures: number;\n conversions: number;\n baselineExposures: number;\n baselineConversions: number;\n rate: number;\n baselineRate: number;\n absoluteLift: number;\n relativeLift: number | null;\n zScore: number;\n /** Fixed-horizon p-value (z-test). Shown for reference; only valid if read once at a planned sample. */\n pValue: number;\n /**\n * Significant on the always-valid p-value (`sequential.pValue`), Holm-corrected\n * across every comparison of the experiment. This is what decisions use.\n */\n significant: boolean;\n /** The fixed-horizon test would call it significant (Holm on `pValue`). Reference only. */\n fixedSignificant: boolean;\n /** Fixed-horizon confidence interval of the absolute lift. */\n ci: { low: number; high: number };\n /** Always-valid p-value and confidence interval of the absolute lift: safe to read on every poll. */\n sequential: SequentialEstimate;\n /** Probability that this variant beats the baseline (normal approximation, flat prior). */\n probabilityToBeat: number;\n}\n\nexport interface SRM {\n chiSquare: number;\n df: number;\n pValue: number;\n threshold: number;\n detected: boolean;\n}\n\nexport type VerdictStatus =\n | 'no_data'\n | 'srm_detected'\n | 'insufficient_sample'\n | 'winner_found'\n | 'no_significant_difference'\n /** A variant is significantly worse on a guardrail metric: do not ship it. */\n | 'guardrail_breached';\n\n/**\n * How much the sample can carry, for display: `small` is below the minimums,\n * `good` has every variant at its share of `goodSample`, `ok` is in between.\n * Informational only; the decision comes from the sequential test.\n */\nexport type SampleQuality = 'small' | 'ok' | 'good';\n\nexport type DataCheckKey = 'minimum' | 'split' | 'goodSample' | 'power' | 'week';\n\n/** One line of the data-quality score. */\nexport interface DataCheck {\n key: DataCheckKey;\n met: boolean;\n label: string;\n}\n\nexport interface Verdict {\n experiment: string;\n status: VerdictStatus;\n /** One-sentence recommendation for a human or an agent. */\n message: string;\n computedAt: string;\n confidence: number;\n /** How decisions are made: always-valid (mixture SPRT) inference, safe under continuous monitoring. */\n method: 'sequential';\n /** Relative minimum detectable effect the plan is built on. */\n mde: number;\n /** Days of data so far, when known. */\n days: number | null;\n /** Opt-in runtime minimum in days (24-hour periods); 0 = none, the default. */\n minDays: number;\n sample: {\n totalExposures: number;\n totalConversions: number;\n variants: VariantCounts[];\n minExposuresPerVariant: number;\n minTotalConversions: number;\n /** Visitors per variant needed to reach a verdict (total, not additional), when insufficient. */\n neededPerVariant: number | null;\n /** Visitors per variant at which the test can rule out effects of `mde` (the planned horizon). */\n horizonPerVariant: number | null;\n quality: SampleQuality;\n /** Total visitors at which the sample counts as good (split evenly across variants). */\n goodSample: number;\n /** Data-quality score, 0..5: the number of met `checks`, capped at 1 when the split is broken. Informational. */\n stars: number;\n /** The five checks behind `stars`, in a fixed order. */\n checks: DataCheck[];\n };\n srm: SRM | null;\n comparisons: Comparison[];\n winner: string | null;\n /** Caveats, e.g. why the split check was skipped. */\n notes: string[];\n /** Secondary and guardrail metrics, when the experiment declares any. */\n metrics?: MetricResult[];\n /** Variants significantly worse than the control on a guardrail (empty when none; absent without guardrails). */\n guardrailBreached?: GuardrailBreach[];\n}\n\nexport const VERDICT_DEFAULTS = {\n minExposuresPerVariant: 100,\n minTotalConversions: 50,\n /** Verdicts depend on sample size, not runtime; an experiment can opt into a minimum. */\n minDays: 0,\n /** Total visitors at which `sample.quality` turns good. */\n goodSample: 5000,\n /** Total visitors before the split check counts toward the data-quality score. */\n splitVisitors: 1000,\n /** Relative change the power check is sized for. */\n powerLift: 0.1,\n /** Days of data the week check wants. */\n weekDays: 7,\n /** Relative effect worth detecting; sets the horizon for \"no difference\". */\n mde: 0.1,\n mixture: DEFAULT_MIXTURE,\n srmAlpha: 0.001,\n confidence: 0.95,\n} as const;\n\nexport interface VerdictOptions {\n minExposuresPerVariant?: number;\n minTotalConversions?: number;\n confidence?: number;\n /** Expected traffic shares (any scale). Defaults to an equal split. */\n expectedWeights?: number[];\n /** Skip the SRM check and record this reason in `notes` (e.g. targeting decides the split). */\n skipSrm?: string;\n /** Days the experiment has collected data, fractional (36 hours = 1.5). Unknown → the minimum runtime is not enforced. */\n days?: number;\n /** Minimum runtime in days before a verdict. Default 0 = none. */\n minDays?: number;\n /** Total visitors at which `sample.quality` turns good. Default 5000. */\n goodSample?: number;\n /** Relative minimum detectable effect. Default 0.1. */\n mde?: number;\n /** Relative effect scale of the mixing prior. Default 0.2. */\n mixture?: number;\n /** Always-valid p-values of other hypotheses in the same family (e.g. MVT factor effects), for Holm. */\n familyPValues?: number[];\n /** Secondary and guardrail goals, same variants as `counts`. A guardrail breach keeps a variant from being shipped. */\n metrics?: MetricInput[];\n now?: Date;\n}\n\nexport interface CompareOptions {\n mixture?: number;\n /** Always-valid p-values of other hypotheses tested alongside, included in the Holm correction. */\n familyPValues?: number[];\n}\n\n/** Chi-square goodness-of-fit of observed exposures vs expected shares. */\nexport function computeSRM(counts: VariantCounts[], expectedWeights?: number[], alpha: number = VERDICT_DEFAULTS.srmAlpha): SRM | null {\n const k = counts.length;\n if (k < 2) return null;\n let weights = expectedWeights && expectedWeights.length === k ? expectedWeights : new Array<number>(k).fill(1);\n const totalWeight = weights.reduce((s, w) => s + w, 0);\n if (totalWeight <= 0) return null;\n weights = weights.map((w) => w / totalWeight);\n\n const total = counts.reduce((s, c) => s + c.exposures, 0);\n if (total === 0) return null;\n\n let chi2 = 0;\n for (let i = 0; i < k; i++) {\n const expected = total * weights[i]!;\n if (expected === 0) continue;\n chi2 += Math.pow(counts[i]!.exposures - expected, 2) / expected;\n }\n const df = k - 1;\n const pValue = chiSquarePValue(chi2, df);\n return { chiSquare: chi2, df, pValue, threshold: alpha, detected: pValue < alpha };\n}\n\n/**\n * Each variant against the first one: fixed-horizon z-test (for display) and\n * always-valid mixture SPRT (for decisions), Holm-corrected across comparisons.\n */\nexport function compareVariants(counts: VariantCounts[], confidence: number = VERDICT_DEFAULTS.confidence, options: CompareOptions = {}): Comparison[] {\n const baseline = counts[0];\n if (!baseline || baseline.exposures === 0) return [];\n const alpha = 1 - confidence;\n const zCrit = inverseNormalCdf(1 - alpha / 2);\n const mixture = options.mixture ?? VERDICT_DEFAULTS.mixture;\n\n const comparisons = counts.slice(1).map((variant): Comparison => {\n const p1 = baseline.conversions / baseline.exposures;\n const p2 = variant.exposures > 0 ? variant.conversions / variant.exposures : 0;\n const pooled = (baseline.conversions + variant.conversions) / (baseline.exposures + variant.exposures);\n const sePooled = Math.sqrt(pooled * (1 - pooled) * (1 / baseline.exposures + 1 / Math.max(1, variant.exposures)));\n const z = sePooled > 0 ? (p2 - p1) / sePooled : 0;\n const pValue = 2 * (1 - normalCdf(Math.abs(z)));\n const varUnpooled = (p1 * (1 - p1)) / baseline.exposures + (p2 * (1 - p2)) / Math.max(1, variant.exposures);\n const seUnpooled = Math.sqrt(varUnpooled);\n // Plug-in (unpooled) variance so the always-valid p-value and interval always agree.\n const sequential = variant.exposures > 0 ? mixtureSPRT(p2 - p1, varUnpooled, proportionTau2(pooled, mixture), alpha) : { pValue: 1, ci: { low: -1, high: 1 } };\n return {\n variant: variant.variant,\n baseline: baseline.variant,\n exposures: variant.exposures,\n conversions: variant.conversions,\n baselineExposures: baseline.exposures,\n baselineConversions: baseline.conversions,\n rate: p2,\n baselineRate: p1,\n absoluteLift: p2 - p1,\n relativeLift: p1 > 0 ? (p2 - p1) / p1 : null,\n zScore: z,\n pValue,\n significant: false,\n fixedSignificant: false,\n ci: { low: p2 - p1 - zCrit * seUnpooled, high: p2 - p1 + zCrit * seUnpooled },\n sequential: { pValue: sequential.pValue, ci: { low: Math.max(-1, sequential.ci.low), high: Math.min(1, sequential.ci.high) } },\n probabilityToBeat: seUnpooled > 0 ? normalCdf((p2 - p1) / seUnpooled) : 0.5,\n };\n });\n\n const family = options.familyPValues ?? [];\n const seq = holm([...comparisons.map((c) => c.sequential.pValue), ...family], alpha);\n const fixed = holm(comparisons.map((c) => c.pValue), alpha);\n comparisons.forEach((c, i) => {\n c.significant = seq[i]!;\n c.fixedSignificant = fixed[i]!;\n });\n return comparisons;\n}\n\nfunction pct(x: number | null): string {\n return x === null ? 'n/a' : `${x >= 0 ? '+' : ''}${(x * 100).toFixed(1)}%`;\n}\n\nfunction plural(n: number, word: string): string {\n return `${n} ${word}${n === 1 ? '' : 's'}`;\n}\n\n/** small below the minimums, good when every variant has its even share of `goodSample`, ok otherwise. */\nexport function sampleQuality(counts: VariantCounts[], minExposures: number, minConversions: number, goodSample: number): SampleQuality {\n const totalConversions = counts.reduce((s, c) => s + c.conversions, 0);\n if (counts.length < 2 || counts.some((c) => c.exposures < minExposures) || totalConversions < minConversions) return 'small';\n const perVariant = Math.ceil(goodSample / counts.length);\n return counts.every((c) => c.exposures >= perVariant) ? 'good' : 'ok';\n}\n\nconst num = (n: number) => n.toLocaleString('en-US');\n\n/**\n * Five plain checks of how far the data can be trusted, for display. Never changes the verdict.\n * Takes the finished verdict so the split check sees the SRM result it was decided with.\n */\nfunction withChecks(v: Verdict, options: VerdictOptions): Verdict {\n const s = v.sample;\n const counts = s.variants;\n const k = Math.max(1, counts.length);\n const control = counts[0];\n const controlRate = control && control.exposures > 0 ? control.conversions / control.exposures : 0;\n const family = Math.max(1, counts.length - 1 + (options.familyPValues?.length ?? 0));\n const power = sequentialExposuresPerVariant({ baselineRate: controlRate, relativeLift: VERDICT_DEFAULTS.powerLift, alpha: (1 - v.confidence) / family, mixture: options.mixture ?? VERDICT_DEFAULTS.mixture });\n const goodPerVariant = Math.ceil(s.goodSample / k);\n const every = (n: number) => counts.length >= 2 && counts.every((c) => c.exposures >= n);\n const checks: DataCheck[] = [\n { key: 'minimum', met: every(s.minExposuresPerVariant) && s.totalConversions >= s.minTotalConversions, label: `At least ${num(s.minExposuresPerVariant)} visitors per variant and ${num(s.minTotalConversions)} conversions` },\n { key: 'split', met: !v.srm?.detected && s.totalExposures >= VERDICT_DEFAULTS.splitVisitors, label: `Traffic splits as configured, ${num(VERDICT_DEFAULTS.splitVisitors)}+ visitors` },\n { key: 'goodSample', met: every(goodPerVariant), label: `${num(s.goodSample)} visitors across variants` },\n { key: 'power', met: power !== null && every(power), label: `Big enough to spot a ${Math.round(VERDICT_DEFAULTS.powerLift * 100)}% change` },\n { key: 'week', met: v.days !== null && v.days >= VERDICT_DEFAULTS.weekDays, label: 'Running for a full week' },\n ];\n const met = checks.filter((c) => c.met).length;\n return { ...v, sample: { ...s, stars: v.srm?.detected ? Math.min(met, 1) : met, checks } };\n}\n\n/** \"5 more hours\" under a day, \"2 more days\" above. Only reached when the experiment set `minDays`. */\nfunction waitFor(daysLeft: number): string {\n return daysLeft < 1 ? plural(Math.max(1, Math.ceil(daysLeft * 24)), 'more hour') : plural(Math.ceil(daysLeft), 'more day');\n}\n\nfunction fullDays(minDays: number): string {\n return minDays === 1 ? 'a full day of visitors is in' : `${minDays} full days of visitors are in`;\n}\n\n/**\n * Verdict from per-variant counts. Order of checks:\n * data present → SRM → minimum sample → always-valid significance → minimum runtime.\n *\n * Decisions are peeking-safe: a winner needs the always-valid p-value (mixture\n * SPRT, Holm across comparisons) below 1 - confidence; \"no difference\" needs the\n * always-valid interval of every comparison inside ±mde of the control rate, or\n * every variant past the horizon where the test has 80% power for `mde`. When the\n * experiment opts into `minDays` and `days` is known, neither is announced earlier.\n */\nexport function computeVerdict(experiment: string, counts: VariantCounts[], options: VerdictOptions = {}): Verdict {\n const verdict = withChecks(primaryVerdict(experiment, counts, options), options);\n if (!options.metrics?.length) return verdict;\n const { metrics, guardrailBreached } = compareMetrics(options.metrics, {\n confidence: options.confidence,\n mixture: options.mixture,\n minExposuresPerVariant: options.minExposuresPerVariant,\n });\n const out: Verdict = { ...verdict, metrics, guardrailBreached };\n if (verdict.status === 'no_data' || verdict.status === 'srm_detected' || guardrailBreached.length === 0) return out;\n\n const control = counts[0]?.variant;\n const harm = (b: GuardrailBreach) => `hurts ${b.metric} (${pct(b.lift)}, always-valid p=${b.pValue.toFixed(4)})`;\n const winnerHurts = verdict.winner && verdict.winner !== control ? guardrailBreached.find((b) => b.variant === verdict.winner) : undefined;\n if (winnerHurts) {\n const w = verdict.comparisons.find((c) => c.variant === winnerHurts.variant);\n return {\n ...out,\n status: 'guardrail_breached',\n winner: null,\n message: `\"${winnerHurts.variant}\" wins (${pct(w?.relativeLift ?? null)}) but ${harm(winnerHurts)}. Don't ship it yet; find out what broke first.`,\n };\n }\n if (verdict.status === 'winner_found') {\n // The decided winner is clean (or it is the control): the call stands, the harm is a caveat.\n return { ...out, notes: [...out.notes, ...guardrailBreached.map((b) => `\"${b.variant}\" ${harm(b)}.`)] };\n }\n const first = guardrailBreached[0]!;\n return {\n ...out,\n status: 'guardrail_breached',\n winner: null,\n message: `Don't ship \"${first.variant}\": it ${harm(first)}. Finish the test or fix what broke.`,\n notes: [...out.notes, ...guardrailBreached.slice(1).map((b) => `\"${b.variant}\" ${harm(b)}.`)],\n };\n}\n\nfunction primaryVerdict(experiment: string, counts: VariantCounts[], options: VerdictOptions): Verdict {\n const minExposures = options.minExposuresPerVariant ?? VERDICT_DEFAULTS.minExposuresPerVariant;\n const minConversions = options.minTotalConversions ?? VERDICT_DEFAULTS.minTotalConversions;\n const confidence = options.confidence ?? VERDICT_DEFAULTS.confidence;\n const minDays = options.minDays ?? VERDICT_DEFAULTS.minDays;\n const mde = Math.abs(options.mde ?? VERDICT_DEFAULTS.mde);\n const mixture = options.mixture ?? VERDICT_DEFAULTS.mixture;\n const goodSample = options.goodSample ?? VERDICT_DEFAULTS.goodSample;\n const days = options.days ?? null;\n const alpha = 1 - confidence;\n const notes: string[] = [];\n\n const totalExposures = counts.reduce((s, c) => s + c.exposures, 0);\n const totalConversions = counts.reduce((s, c) => s + c.conversions, 0);\n const base = {\n experiment,\n computedAt: (options.now ?? new Date()).toISOString(),\n confidence,\n method: 'sequential' as const,\n mde,\n days,\n minDays,\n sample: {\n totalExposures,\n totalConversions,\n variants: counts,\n minExposuresPerVariant: minExposures,\n minTotalConversions: minConversions,\n neededPerVariant: null as number | null,\n horizonPerVariant: null as number | null,\n quality: sampleQuality(counts, minExposures, minConversions, goodSample),\n goodSample,\n // Filled by withChecks once the verdict is decided.\n stars: 0,\n checks: [] as DataCheck[],\n },\n notes,\n };\n\n if (counts.length < 2 || totalExposures === 0) {\n return { ...base, status: 'no_data', message: 'No data yet. Check that the SDK is installed and the experiment is running.', srm: null, comparisons: [], winner: null };\n }\n\n let srm: SRM | null = null;\n if (options.skipSrm) notes.push(options.skipSrm);\n else srm = computeSRM(counts, options.expectedWeights);\n if (srm?.detected) {\n return {\n ...base,\n status: 'srm_detected',\n message: `Sample ratio mismatch (p=${srm.pValue.toExponential(1)}): variants receive traffic that does not match the configured weights. Results cannot be trusted; run \\`splithub doctor\\`.`,\n srm,\n comparisons: [],\n winner: null,\n };\n }\n\n const comparisons = compareVariants(counts, confidence, { mixture, familyPValues: options.familyPValues });\n const family = comparisons.length + (options.familyPValues?.length ?? 0);\n const perTestAlpha = alpha / Math.max(1, family);\n const control = counts[0]!;\n const controlRate = control.exposures > 0 ? control.conversions / control.exposures : 0;\n const horizon = sequentialExposuresPerVariant({ baselineRate: controlRate, relativeLift: mde, alpha: perTestAlpha, mixture });\n // Visitors needed to settle the experiment: confirm the current leader, or reach the horizon, whichever comes first.\n const leader = comparisons.slice().sort((a, b) => Math.abs(b.relativeLift ?? 0) - Math.abs(a.relativeLift ?? 0))[0];\n const forLeader = leader && leader.relativeLift ? sequentialExposuresPerVariant({ baselineRate: controlRate, relativeLift: leader.relativeLift, alpha: perTestAlpha, mixture }) : null;\n const neededRaw = forLeader !== null && horizon !== null ? Math.min(forLeader, horizon) : (forLeader ?? horizon);\n const needed = neededRaw === null ? null : Math.max(neededRaw, minExposures);\n const sample = { ...base.sample, horizonPerVariant: horizon };\n // Fractional: one day means 24 hours elapsed, not a calendar date change.\n const daysLeft = minDays > 0 && days !== null && days < minDays ? minDays - days : 0;\n\n if (counts.some((c) => c.exposures < minExposures) || totalConversions < minConversions) {\n return {\n ...base,\n sample: { ...sample, neededPerVariant: needed },\n status: 'insufficient_sample',\n message: `Too early: need at least ${minExposures} visitors per variant and ${minConversions} conversions in total${needed ? ` (about ${needed} visitors per variant for a verdict)` : ''}. Keep it running.`,\n srm,\n comparisons,\n winner: null,\n };\n }\n\n const winners = comparisons.filter((c) => c.significant && c.absoluteLift > 0).sort((a, b) => b.absoluteLift - a.absoluteLift);\n const losses = comparisons.filter((c) => c.significant && c.absoluteLift < 0).sort((a, b) => a.absoluteLift - b.absoluteLift);\n const decided = winners[0] ?? losses[0];\n if (decided && daysLeft > 0) {\n const lead = winners[0] ? `\"${decided.variant}\" leads (${pct(decided.relativeLift)})` : `\"${decided.variant}\" trails the control (${pct(decided.relativeLift)})`;\n return {\n ...base,\n sample: { ...sample, neededPerVariant: null },\n status: 'insufficient_sample',\n message: `${lead} and the gap is already significant, but wait ${waitFor(daysLeft)} so ${fullDays(minDays)}. Keep it running.`,\n srm,\n comparisons,\n winner: null,\n };\n }\n if (winners[0]) {\n const w = winners[0];\n return {\n ...base,\n sample,\n status: 'winner_found',\n message: `Stop: \"${w.variant}\" beats \"${w.baseline}\" (${pct(w.relativeLift)}, always-valid p=${w.sequential.pValue.toFixed(4)}). Ship \"${w.variant}\".`,\n srm,\n comparisons,\n winner: w.variant,\n };\n }\n if (losses[0]) {\n const l = losses[0];\n return {\n ...base,\n sample,\n status: 'winner_found',\n message: `Stop: \"${l.baseline}\" wins. \"${l.variant}\" is significantly worse (${pct(l.relativeLift)}, always-valid p=${l.sequential.pValue.toFixed(4)}). Keep \"${l.baseline}\".`,\n srm,\n comparisons,\n winner: l.baseline,\n };\n }\n\n // \"No difference\" must be earned too: every interval rules out an mde-sized effect, or the horizon is reached.\n const bound = mde * controlRate;\n const equivalent = controlRate > 0 && comparisons.every((c) => c.sequential.ci.low > -bound && c.sequential.ci.high < bound);\n const pastHorizon = horizon !== null && counts.every((c) => c.exposures >= horizon);\n if ((equivalent || pastHorizon) && daysLeft === 0) {\n return {\n ...base,\n sample,\n status: 'no_significant_difference',\n message: `No difference of ${pct(mde).slice(1)} or more. Stop and keep the control, or test a bolder change.`,\n srm,\n comparisons,\n winner: null,\n };\n }\n\n const wait = equivalent || pastHorizon ? `wait ${waitFor(daysLeft)} so ${fullDays(minDays)}` : `${needed ? `about ${needed} visitors per variant` : 'more visitors'} will settle it`;\n return {\n ...base,\n sample: { ...sample, neededPerVariant: equivalent || pastHorizon ? null : needed },\n status: 'insufficient_sample',\n message: `No clear difference yet; ${wait}. Keep it running.`,\n srm,\n comparisons,\n winner: null,\n };\n}\n\n/**\n * Days until `computeVerdict` can decide at the current traffic. 0 when it has\n * decided, null when there is no estimate (no data, SRM, no traffic, no plan).\n */\nexport function estimateDaysToVerdict(verdict: Verdict, visitorsPerDay: number | null | undefined): number | null {\n if (verdict.status === 'winner_found' || verdict.status === 'no_significant_difference' || verdict.status === 'guardrail_breached') return 0;\n if (verdict.status !== 'insufficient_sample') return null;\n // The runtime floor applies only when the experiment opted into minDays.\n const daysLeft = verdict.minDays > 0 && verdict.days !== null && verdict.days < verdict.minDays ? verdict.minDays - verdict.days : 0;\n const needed = verdict.sample.neededPerVariant;\n if (needed === null) return daysLeft > 0 ? Math.ceil(daysLeft) : null;\n if (!visitorsPerDay || !(visitorsPerDay > 0)) return null;\n const total = verdict.sample.totalExposures;\n const variants = verdict.sample.variants;\n // Each variant fills at its observed share of the traffic; the slowest one sets the pace.\n let bySample = 0;\n for (const v of variants) {\n const share = total > 0 && v.exposures > 0 ? v.exposures / total : 1 / variants.length;\n bySample = Math.max(bySample, Math.max(0, needed - v.exposures) / (visitorsPerDay * share));\n }\n return Math.ceil(Math.max(bySample, daysLeft));\n}\n","import { inverseStudentT, normalCdf, studentTCdf } from './math';\nimport { DEFAULT_MIXTURE, holm, mixtureSPRT, type SequentialEstimate } from './sequential';\n\n/** Sufficient statistics of a per-visitor metric (e.g. revenue, 0 for visitors who did not buy). */\nexport interface MetricMoments {\n /** Visitors. */\n n: number;\n /** Sum of the metric over visitors. */\n sum: number;\n /** Sum of the squared per-visitor metric. */\n sumSq: number;\n}\n\nexport interface WelchResult {\n meanA: number;\n meanB: number;\n /** meanB - meanA. */\n difference: number;\n relativeLift: number | null;\n t: number;\n /** Welch–Satterthwaite degrees of freedom. */\n df: number;\n /** Fixed-horizon two-sided p-value. */\n pValue: number;\n /** Fixed-horizon CI of the difference. */\n ci: { low: number; high: number };\n /** Probability that B's mean beats A's (normal approximation). */\n probabilityToBeat: number;\n /** Always-valid p-value and CI of the difference (mixture SPRT). */\n sequential: SequentialEstimate;\n}\n\nfunction moments(m: MetricMoments): { mean: number; variance: number } {\n const mean = m.n > 0 ? m.sum / m.n : 0;\n const variance = m.n > 1 ? Math.max(0, (m.sumSq - m.n * mean * mean) / (m.n - 1)) : 0;\n return { mean, variance };\n}\n\n/**\n * Welch's unequal-variance t-test of mean(B) - mean(A), plus its always-valid\n * counterpart. Null with fewer than two visitors on either side.\n */\nexport function welchTest(a: MetricMoments, b: MetricMoments, confidence = 0.95, mixture = DEFAULT_MIXTURE): WelchResult | null {\n if (a.n < 2 || b.n < 2) return null;\n const ma = moments(a);\n const mb = moments(b);\n const va = ma.variance / a.n;\n const vb = mb.variance / b.n;\n const v = va + vb;\n const diff = mb.mean - ma.mean;\n const alpha = 1 - confidence;\n const df = v > 0 ? (v * v) / ((va * va) / (a.n - 1) + (vb * vb) / (b.n - 1)) : a.n + b.n - 2;\n const se = Math.sqrt(v);\n const t = se > 0 ? diff / se : 0;\n const pValue = se > 0 ? 2 * (1 - studentTCdf(Math.abs(t), df)) : 1;\n const tCrit = inverseStudentT(1 - alpha / 2, df);\n const pooledMean = (a.sum + b.sum) / (a.n + b.n);\n return {\n meanA: ma.mean,\n meanB: mb.mean,\n difference: diff,\n relativeLift: ma.mean !== 0 ? diff / Math.abs(ma.mean) : null,\n t,\n df,\n pValue,\n ci: { low: diff - tCrit * se, high: diff + tCrit * se },\n probabilityToBeat: se > 0 ? normalCdf(diff / se) : 0.5,\n sequential: mixtureSPRT(diff, v, Math.pow(mixture * pooledMean, 2), alpha),\n };\n}\n\nexport interface MeanComparison extends WelchResult {\n variant: string;\n baseline: string;\n /** Significant on the always-valid p-value, Holm-corrected across comparisons. */\n significant: boolean;\n}\n\n/**\n * Every variant's per-visitor mean against the first one (the control).\n * Rows with fewer than two visitors are left out.\n */\nexport function compareMeans(rows: Array<MetricMoments & { variant: string }>, confidence = 0.95, mixture = DEFAULT_MIXTURE): MeanComparison[] {\n const base = rows[0];\n if (!base) return [];\n const out: MeanComparison[] = [];\n for (const row of rows.slice(1)) {\n const r = welchTest(base, row, confidence, mixture);\n if (r) out.push({ ...r, variant: row.variant, baseline: base.variant, significant: false });\n }\n const sig = holm(out.map((c) => c.sequential.pValue), 1 - confidence);\n out.forEach((c, i) => (c.significant = sig[i]!));\n return out;\n}\n","import { planSample as statsPlan } from '@splithub/stats';\nimport { fetchStatus, resolveTarget } from '../api';\nimport { fail, printJson } from '../errors';\nimport { detectProject } from '../project';\nimport { c } from '../ui';\nimport type { Flags } from './init';\n\nfunction num(flags: Flags, name: string): number | undefined {\n const v = flags[name];\n if (typeof v !== 'string' || v === '') return undefined;\n const n = Number(v.replace(/%$/, '')) / (v.endsWith('%') ? 100 : 1);\n if (!Number.isFinite(n)) fail('INVALID_FLAG', `--${name} \"${v}\" isn't a number.`);\n return n;\n}\n\nexport interface Plan {\n baseline: number;\n mde: number;\n variants: number;\n confidence: number;\n perVariant: number;\n total: number;\n}\n\n/**\n * Visitors per variant to detect a relative lift `mde` on a `baseline` rate with 80% power, sized for\n * the sequential test the verdict uses (safe to check any day). More variants split the error across comparisons.\n */\nexport function planSample(baseline: number, mde: number, variants = 2, confidence = 0.95): Plan {\n if (!(baseline > 0 && baseline < 1)) fail('INVALID_FLAG', `--baseline ${baseline} must be a rate between 0 and 1.`, 'For example --baseline 0.05 for 5% of visitors converting today.');\n if (!(mde > 0)) fail('INVALID_FLAG', `--mde ${mde} must be above 0.`, 'The smallest relative lift worth finding, e.g. --mde 0.1 for +10%.');\n if (!Number.isInteger(variants) || variants < 2) fail('INVALID_FLAG', '--variants must be a whole number of 2 or more.');\n const perVariant = statsPlan({ baselineRate: baseline, mde, alpha: 1 - confidence, variants });\n if (perVariant === null) fail('INVALID_FLAG', \"Those numbers don't give a sample size.\", 'Check --baseline and --mde.');\n return { baseline, mde, variants, confidence, perVariant, total: perVariant * variants };\n}\n\n/** `splithub plan --baseline 0.05 --mde 0.1 [--variants 2] [<id>]` */\nexport async function plan(id: string | undefined, flags: Flags): Promise<void> {\n const baseline = num(flags, 'baseline');\n const mde = num(flags, 'mde');\n if (baseline === undefined || mde === undefined) fail('USAGE', 'Pass --baseline (conversion rate today) and --mde (smallest lift worth finding).', 'For example: npx splithub plan --baseline 0.05 --mde 0.1');\n const variants = num(flags, 'variants') ?? 2;\n const p = planSample(baseline, mde, variants);\n\n // With an experiment id: days at its current traffic.\n let traffic: { experiment: string; visitors: number; days: number; perDay: number; daysLeft: number | null } | null = null;\n if (id) {\n const data = await fetchStatus(resolveTarget(flags, detectProject()));\n const row = data.experiments.find((e) => e.experiment === id);\n if (!row) fail('EXPERIMENT_NOT_FOUND', `There's no experiment \"${id}\" in the results.`, 'See the ids with npx splithub status.');\n const perDay = row.days > 0 ? row.visitors / row.days : 0;\n traffic = { experiment: id, visitors: row.visitors, days: row.days, perDay: Math.round(perDay), daysLeft: perDay > 0 ? Math.max(0, Math.ceil((p.total - row.visitors) / perDay)) : null };\n }\n\n if (flags.json) {\n printJson({ ...p, traffic });\n return;\n }\n console.log(`${c.bold(p.perVariant.toLocaleString('en-US'))} visitors per variant, ${p.total.toLocaleString('en-US')} in all`);\n console.log(c.dim(`to find a ${(mde * 100).toFixed(0)}% lift on a ${(baseline * 100).toFixed(1)}% rate (95% confidence, 80% power, safe to check daily)`));\n if (traffic) {\n if (traffic.daysLeft === null) console.log(c.yellow(`${id} has no visitors yet, so there's no pace to go by.`));\n else if (traffic.daysLeft === 0) console.log(c.green(`${id} already has enough visitors (${traffic.visitors.toLocaleString('en-US')}).`));\n else console.log(`About ${traffic.daysLeft} more days for ${id} at ${traffic.perDay.toLocaleString('en-US')} visitors a day.`);\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAgEO,SAAS,iBAAiB,GAAmB;AAClD,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,IAAI,CAAC,oBAAsB,mBAAqB,oBAAsB,kBAAoB,oBAAsB,iBAAiB;AACvI,QAAM,IAAI,CAAC,oBAAsB,mBAAqB,oBAAsB,mBAAqB,kBAAoB;AACrH,QAAMA,KAAI,CAAC,uBAAuB,qBAAuB,oBAAoB,oBAAoB,mBAAmB,iBAAiB;AACrI,QAAM,IAAI,CAAC,sBAAsB,oBAAsB,mBAAmB,iBAAiB;AAC3F,QAAM,OAAO;AACb,MAAI;AACJ,MAAI,IAAI,MAAM;AACZ,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAC9B,gBAAYA,GAAE,CAAC,IAAK,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,SAAU,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;EAC9I;AACA,MAAI,IAAI,IAAI,MAAM;AAChB,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAClC,WAAO,MAAMA,GAAE,CAAC,IAAK,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,KAAM,IAAIA,GAAE,CAAC,SAAU,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;EAC/I;AACA,MAAI,IAAI;AACR,QAAM,IAAI,IAAI;AACd,cAAa,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,SAAU,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAClK;AC9EO,SAAS,4BAA4B,cAAsB,cAAsB,aAAa,MAAM,QAAQ,KAAoB;AACrI,MAAI,gBAAgB,KAAK,gBAAgB,KAAK,CAAC,OAAO,SAAS,YAAY,KAAK,iBAAiB,EAAG,QAAO;AAC3G,QAAM,KAAK;AACX,QAAM,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI,MAAO,MAAM,IAAI,aAAa,CAAC;AACnE,QAAM,KAAK,iBAAiB,KAAK,IAAI,cAAc,CAAC;AACpD,QAAM,KAAK,iBAAiB,KAAK;AACjC,QAAM,QAAQ,KAAK,MAAM;AACzB,QAAM,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,QAAQ,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI,CAAC;AAClI,SAAO,KAAK,KAAK,CAAC;AACpB;ACgBA,SAAS,SAAS,UAAkB,MAAc,OAAuB;AACvE,QAAM,QAAQ,WAAW;AACzB,SAAO,KAAK,KAAO,WAAW,QAAS,QAAS,KAAK,IAAI,QAAQ,QAAQ,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE;AACnG;AA4BO,IAAM,kBAAkB;AAExB,SAAS,eAAe,YAAoB,SAAyB;AAC1E,SAAO,KAAK,IAAI,UAAU,YAAY,CAAC;AACzC;AAkBO,SAAS,8BAA8B,EAAE,cAAc,cAAc,QAAQ,MAAM,QAAQ,KAAK,UAAU,gBAAgB,GAAuC;AACtK,MAAI,gBAAgB,KAAK,gBAAgB,KAAK,CAAC,OAAO,SAAS,YAAY,KAAK,iBAAiB,EAAG,QAAO;AAC3G,QAAM,KAAK;AACX,QAAM,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI,MAAO,MAAM,IAAI,aAAa,CAAC;AACnE,QAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;AAC9B,QAAM,OAAO,MAAM,IAAI,MAAM,MAAM,IAAI;AACvC,QAAM,OAAO,gBAAgB,KAAK,MAAM,GAAG,OAAO;AAClD,QAAM,KAAK,iBAAiB,KAAK;AACjC,QAAM,SAAS,CAAC,MAAc;AAC5B,UAAM,IAAI,OAAO;AACjB,WAAO,SAAS,SAAS,GAAG,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,CAAC;EAC7D;AACA,MAAI,KAAK,KAAK,IAAI,IAAI,4BAA4B,IAAI,cAAc,IAAI,OAAO,KAAK,KAAK,KAAK,CAAC;AAC/F,MAAI,OAAO,EAAE,EAAG,QAAO,KAAK,KAAK,EAAE;AACnC,MAAI,KAAK,KAAK;AACd,SAAO,CAAC,OAAO,EAAE,GAAG;AAClB,SAAK;AACL,UAAM;AACN,QAAI,KAAK,KAAM,QAAO;EACxB;AACA,SAAO,KAAK,KAAK,GAAG;AAClB,UAAM,MAAM,KAAK,OAAO,KAAK,MAAM,CAAC;AACpC,QAAI,OAAO,GAAG,EAAG,MAAK;QACjB,MAAK;EACZ;AACA,SAAO;AACT;AAuBO,SAAS,WAAW,EAAE,cAAc,KAAK,QAAQ,MAAM,QAAQ,KAAK,WAAW,GAAG,aAAa,MAAM,QAAQ,GAAmC;AACrJ,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAI,CAAC;AACxD,QAAM,IAAI,QAAQ;AAClB,MAAI,CAAC,WAAY,QAAO,4BAA4B,cAAc,KAAK,IAAI,GAAG,KAAK;AACnF,SAAO,8BAA8B,EAAE,cAAc,cAAc,KAAK,OAAO,GAAG,OAAO,SAAS,WAAW,gBAAgB,CAAC;AAChI;;;AInIA,SAAS,IAAI,OAAc,MAAkC;AAC3D,QAAM,IAAI,MAAM,IAAI;AACpB,MAAI,OAAO,MAAM,YAAY,MAAM,GAAI,QAAO;AAC9C,QAAM,IAAI,OAAO,EAAE,QAAQ,MAAM,EAAE,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,MAAM;AACjE,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,MAAK,gBAAgB,KAAK,IAAI,KAAK,CAAC,mBAAmB;AAChF,SAAO;AACT;AAeO,SAASC,YAAW,UAAkB,KAAa,WAAW,GAAG,aAAa,MAAY;AAC/F,MAAI,EAAE,WAAW,KAAK,WAAW,GAAI,MAAK,gBAAgB,cAAc,QAAQ,oCAAoC,kEAAkE;AACtL,MAAI,EAAE,MAAM,GAAI,MAAK,gBAAgB,SAAS,GAAG,qBAAqB,oEAAoE;AAC1I,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,EAAG,MAAK,gBAAgB,iDAAiD;AACvH,QAAM,aAAa,WAAU,EAAE,cAAc,UAAU,KAAK,OAAO,IAAI,YAAY,SAAS,CAAC;AAC7F,MAAI,eAAe,KAAM,MAAK,gBAAgB,2CAA2C,6BAA6B;AACtH,SAAO,EAAE,UAAU,KAAK,UAAU,YAAY,YAAY,OAAO,aAAa,SAAS;AACzF;AAGA,eAAsB,KAAK,IAAwB,OAA6B;AAC9E,QAAM,WAAW,IAAI,OAAO,UAAU;AACtC,QAAM,MAAM,IAAI,OAAO,KAAK;AAC5B,MAAI,aAAa,UAAa,QAAQ,OAAW,MAAK,SAAS,oFAAoF,0DAA0D;AAC7M,QAAM,WAAW,IAAI,OAAO,UAAU,KAAK;AAC3C,QAAM,IAAIA,YAAW,UAAU,KAAK,QAAQ;AAG5C,MAAI,UAAkH;AACtH,MAAI,IAAI;AACN,UAAM,OAAO,MAAM,YAAY,cAAc,OAAO,cAAc,CAAC,CAAC;AACpE,UAAM,MAAM,KAAK,YAAY,KAAK,CAAC,MAAM,EAAE,eAAe,EAAE;AAC5D,QAAI,CAAC,IAAK,MAAK,wBAAwB,0BAA0B,EAAE,qBAAqB,uCAAuC;AAC/H,UAAM,SAAS,IAAI,OAAO,IAAI,IAAI,WAAW,IAAI,OAAO;AACxD,cAAU,EAAE,YAAY,IAAI,UAAU,IAAI,UAAU,MAAM,IAAI,MAAM,QAAQ,KAAK,MAAM,MAAM,GAAG,UAAU,SAAS,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,QAAQ,IAAI,YAAY,MAAM,CAAC,IAAI,KAAK;AAAA,EAC1L;AAEA,MAAI,MAAM,MAAM;AACd,cAAU,EAAE,GAAG,GAAG,QAAQ,CAAC;AAC3B;AAAA,EACF;AACA,UAAQ,IAAI,GAAG,EAAE,KAAK,EAAE,WAAW,eAAe,OAAO,CAAC,CAAC,0BAA0B,EAAE,MAAM,eAAe,OAAO,CAAC,SAAS;AAC7H,UAAQ,IAAI,EAAE,IAAI,cAAc,MAAM,KAAK,QAAQ,CAAC,CAAC,gBAAgB,WAAW,KAAK,QAAQ,CAAC,CAAC,yDAAyD,CAAC;AACzJ,MAAI,SAAS;AACX,QAAI,QAAQ,aAAa,KAAM,SAAQ,IAAI,EAAE,OAAO,GAAG,EAAE,oDAAoD,CAAC;AAAA,aACrG,QAAQ,aAAa,EAAG,SAAQ,IAAI,EAAE,MAAM,GAAG,EAAE,iCAAiC,QAAQ,SAAS,eAAe,OAAO,CAAC,IAAI,CAAC;AAAA,QACnI,SAAQ,IAAI,SAAS,QAAQ,QAAQ,kBAAkB,EAAE,OAAO,QAAQ,OAAO,eAAe,OAAO,CAAC,kBAAkB;AAAA,EAC/H;AACF;","names":["c","planSample"]}
@@ -0,0 +1,16 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ configDiff,
4
+ pull,
5
+ push
6
+ } from "./chunk-KMO5GGGC.js";
7
+ import "./chunk-B6FITBWN.js";
8
+ import "./chunk-BJQJGLOB.js";
9
+ import "./chunk-PLXDG4B5.js";
10
+ import "./chunk-V3DLUVOE.js";
11
+ export {
12
+ configDiff,
13
+ pull,
14
+ push
15
+ };
16
+ //# sourceMappingURL=push-OJX4F2BH.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}
@@ -0,0 +1,44 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ findRefs
4
+ } from "./chunk-GVARYUL3.js";
5
+ import {
6
+ loadConfig
7
+ } from "./chunk-B6FITBWN.js";
8
+ import {
9
+ requireConfig
10
+ } from "./chunk-PLXDG4B5.js";
11
+ import {
12
+ c,
13
+ fail,
14
+ printJson
15
+ } from "./chunk-V3DLUVOE.js";
16
+
17
+ // src/commands/refs.ts
18
+ async function refs(id, flags) {
19
+ if (!id) fail("USAGE", "Which experiment? npx splithub refs <id>");
20
+ const project = requireConfig();
21
+ let config = null;
22
+ try {
23
+ config = await loadConfig(project.configFile);
24
+ } catch {
25
+ config = null;
26
+ }
27
+ const result = findRefs(project.root, config, id);
28
+ const inConfig = Boolean(config?.experiments.some((e) => e.key === id));
29
+ if (flags.json) {
30
+ printJson({ ...result, inConfig, count: result.refs.length });
31
+ return;
32
+ }
33
+ if (result.refs.length === 0) {
34
+ console.log(c.dim(`Nothing in the code mentions "${id}"${result.goal ? ` or its goal "${result.goal}"` : ""}.`));
35
+ return;
36
+ }
37
+ for (const r of result.refs) console.log(`${c.cyan(`${r.file}:${r.line}`)} ${r.match === "goal" ? c.dim("[goal] ") : ""}${r.text}`);
38
+ if (result.goal && result.goalShared) console.log(c.dim(`
39
+ Another experiment also measures "${result.goal}": keep its track() calls.`));
40
+ }
41
+ export {
42
+ refs
43
+ };
44
+ //# sourceMappingURL=refs-RY7H3J7L.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/commands/refs.ts"],"sourcesContent":["import type { SplitHubConfig } from '@splithub/core';\nimport { loadConfig } from '../config-file';\nimport { fail, printJson } from '../errors';\nimport { requireConfig } from '../project';\nimport { findRefs } from '../refs';\nimport { c } from '../ui';\nimport type { Flags } from './init';\n\n/** `splithub refs <id>`: every file and line that mentions the experiment or its goal. */\nexport async function refs(id: string | undefined, flags: Flags): Promise<void> {\n if (!id) fail('USAGE', 'Which experiment? npx splithub refs <id>');\n const project = requireConfig();\n // A config that doesn't load still lets us search for the id itself.\n let config: SplitHubConfig | null = null;\n try {\n config = await loadConfig(project.configFile);\n } catch {\n config = null;\n }\n const result = findRefs(project.root, config, id);\n const inConfig = Boolean(config?.experiments.some((e) => e.key === id));\n if (flags.json) {\n printJson({ ...result, inConfig, count: result.refs.length });\n return;\n }\n if (result.refs.length === 0) {\n console.log(c.dim(`Nothing in the code mentions \"${id}\"${result.goal ? ` or its goal \"${result.goal}\"` : ''}.`));\n return;\n }\n for (const r of result.refs) console.log(`${c.cyan(`${r.file}:${r.line}`)} ${r.match === 'goal' ? c.dim('[goal] ') : ''}${r.text}`);\n if (result.goal && result.goalShared) console.log(c.dim(`\\nAnother experiment also measures \"${result.goal}\": keep its track() calls.`));\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AASA,eAAsB,KAAK,IAAwB,OAA6B;AAC9E,MAAI,CAAC,GAAI,MAAK,SAAS,0CAA0C;AACjE,QAAM,UAAU,cAAc;AAE9B,MAAI,SAAgC;AACpC,MAAI;AACF,aAAS,MAAM,WAAW,QAAQ,UAAU;AAAA,EAC9C,QAAQ;AACN,aAAS;AAAA,EACX;AACA,QAAM,SAAS,SAAS,QAAQ,MAAM,QAAQ,EAAE;AAChD,QAAM,WAAW,QAAQ,QAAQ,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;AACtE,MAAI,MAAM,MAAM;AACd,cAAU,EAAE,GAAG,QAAQ,UAAU,OAAO,OAAO,KAAK,OAAO,CAAC;AAC5D;AAAA,EACF;AACA,MAAI,OAAO,KAAK,WAAW,GAAG;AAC5B,YAAQ,IAAI,EAAE,IAAI,iCAAiC,EAAE,IAAI,OAAO,OAAO,iBAAiB,OAAO,IAAI,MAAM,EAAE,GAAG,CAAC;AAC/G;AAAA,EACF;AACA,aAAW,KAAK,OAAO,KAAM,SAAQ,IAAI,GAAG,EAAE,KAAK,GAAG,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,UAAU,SAAS,EAAE,IAAI,SAAS,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE;AACnI,MAAI,OAAO,QAAQ,OAAO,WAAY,SAAQ,IAAI,EAAE,IAAI;AAAA,oCAAuC,OAAO,IAAI,4BAA4B,CAAC;AACzI;","names":[]}
@@ -0,0 +1,54 @@
1
+ #!/usr/bin/env node
2
+ import {
3
+ findRefs
4
+ } from "./chunk-GVARYUL3.js";
5
+ import {
6
+ loadConfig,
7
+ readSource,
8
+ removeExperiment,
9
+ writeConfigChecked
10
+ } from "./chunk-B6FITBWN.js";
11
+ import {
12
+ archiveLive
13
+ } from "./chunk-BJQJGLOB.js";
14
+ import {
15
+ requireConfig
16
+ } from "./chunk-PLXDG4B5.js";
17
+ import {
18
+ c,
19
+ fail,
20
+ printJson
21
+ } from "./chunk-V3DLUVOE.js";
22
+
23
+ // src/commands/remove.ts
24
+ import { relative } from "path";
25
+ async function removeFromConfig(id, flags) {
26
+ const project = requireConfig();
27
+ const before = await loadConfig(project.configFile);
28
+ if (!before.experiments.some((e) => e.key === id)) fail("EXPERIMENT_NOT_FOUND", `There's no experiment "${id}" in the config.`, "See the ids with npx splithub status.");
29
+ const original = readSource(project.configFile);
30
+ await writeConfigChecked(project.configFile, original, removeExperiment(original, id), (config) => config.experiments.some((e) => e.key === id) ? `"${id}" is still in the config` : config.experiments.length !== before.experiments.length - 1 ? "another experiment went missing" : null);
31
+ const cloud = before.storage.mode === "cloud" ? await archiveLive(flags, id) : "skipped";
32
+ return { configFile: relative(project.root, project.configFile), cloud, mode: before.storage.mode };
33
+ }
34
+ async function remove(id, flags) {
35
+ if (!id) fail("USAGE", "Which experiment? npx splithub remove <id>");
36
+ const project = requireConfig();
37
+ const { configFile, cloud, mode } = await removeFromConfig(id, flags);
38
+ const left = findRefs(project.root, null, id).refs;
39
+ const next = [mode === "cloud" ? "npx splithub push" : null, left.length ? `remove the ${left.length} line(s) in the code that still use "${id}" (npx splithub refs ${id})` : null].filter(Boolean).join(", then ");
40
+ if (flags.json) {
41
+ printJson({ experiment: id, removed: true, configFile, cloud, refs: left, ...next ? { next } : {} });
42
+ return;
43
+ }
44
+ console.log(`${c.green("\u2714")} removed ${c.bold(id)} from ${configFile}`);
45
+ if (cloud === "archived" || cloud === "finished") console.log(`${c.green("\u2714")} ${cloud} in the cloud; its numbers stay readable`);
46
+ else if (cloud !== "skipped") console.log(c.yellow(`! ${cloud}`));
47
+ for (const r of left) console.log(` ${c.cyan(`${r.file}:${r.line}`)} ${r.text}`);
48
+ if (next) console.log(c.dim(`Next: ${next}.`));
49
+ }
50
+ export {
51
+ remove,
52
+ removeFromConfig
53
+ };
54
+ //# sourceMappingURL=remove-EQQCDJRU.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/commands/remove.ts"],"sourcesContent":["import { relative } from 'node:path';\nimport { archiveLive } from '../api';\nimport { loadConfig, readSource, removeExperiment, writeConfigChecked } from '../config-file';\nimport { fail, printJson } from '../errors';\nimport { requireConfig } from '../project';\nimport { findRefs } from '../refs';\nimport { c } from '../ui';\nimport type { Flags } from './init';\n\n/**\n * Take an experiment out of splithub.config.ts. In cloud mode it is also set to\n * finished, so visitors stop entering it right away and its numbers stay readable.\n */\nexport async function removeFromConfig(id: string, flags: Flags): Promise<{ configFile: string; cloud: string; mode: string }> {\n const project = requireConfig();\n const before = await loadConfig(project.configFile);\n if (!before.experiments.some((e) => e.key === id)) fail('EXPERIMENT_NOT_FOUND', `There's no experiment \"${id}\" in the config.`, 'See the ids with npx splithub status.');\n const original = readSource(project.configFile);\n await writeConfigChecked(project.configFile, original, removeExperiment(original, id), (config) => (config.experiments.some((e) => e.key === id) ? `\"${id}\" is still in the config` : config.experiments.length !== before.experiments.length - 1 ? 'another experiment went missing' : null));\n const cloud = before.storage.mode === 'cloud' ? await archiveLive(flags, id) : 'skipped';\n return { configFile: relative(project.root, project.configFile), cloud, mode: before.storage.mode };\n}\n\n/** `splithub remove <id>` */\nexport async function remove(id: string | undefined, flags: Flags): Promise<void> {\n if (!id) fail('USAGE', 'Which experiment? npx splithub remove <id>');\n const project = requireConfig();\n const { configFile, cloud, mode } = await removeFromConfig(id, flags);\n const left = findRefs(project.root, null, id).refs;\n const next = [mode === 'cloud' ? 'npx splithub push' : null, left.length ? `remove the ${left.length} line(s) in the code that still use \"${id}\" (npx splithub refs ${id})` : null].filter(Boolean).join(', then ');\n if (flags.json) {\n printJson({ experiment: id, removed: true, configFile, cloud, refs: left, ...(next ? { next } : {}) });\n return;\n }\n console.log(`${c.green('✔')} removed ${c.bold(id)} from ${configFile}`);\n if (cloud === 'archived' || cloud === 'finished') console.log(`${c.green('✔')} ${cloud} in the cloud; its numbers stay readable`);\n else if (cloud !== 'skipped') console.log(c.yellow(`! ${cloud}`));\n for (const r of left) console.log(` ${c.cyan(`${r.file}:${r.line}`)} ${r.text}`);\n if (next) console.log(c.dim(`Next: ${next}.`));\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,gBAAgB;AAazB,eAAsB,iBAAiB,IAAY,OAA4E;AAC7H,QAAM,UAAU,cAAc;AAC9B,QAAM,SAAS,MAAM,WAAW,QAAQ,UAAU;AAClD,MAAI,CAAC,OAAO,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAG,MAAK,wBAAwB,0BAA0B,EAAE,oBAAoB,uCAAuC;AACvK,QAAM,WAAW,WAAW,QAAQ,UAAU;AAC9C,QAAM,mBAAmB,QAAQ,YAAY,UAAU,iBAAiB,UAAU,EAAE,GAAG,CAAC,WAAY,OAAO,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,6BAA6B,OAAO,YAAY,WAAW,OAAO,YAAY,SAAS,IAAI,oCAAoC,IAAK;AAC7R,QAAM,QAAQ,OAAO,QAAQ,SAAS,UAAU,MAAM,YAAY,OAAO,EAAE,IAAI;AAC/E,SAAO,EAAE,YAAY,SAAS,QAAQ,MAAM,QAAQ,UAAU,GAAG,OAAO,MAAM,OAAO,QAAQ,KAAK;AACpG;AAGA,eAAsB,OAAO,IAAwB,OAA6B;AAChF,MAAI,CAAC,GAAI,MAAK,SAAS,4CAA4C;AACnE,QAAM,UAAU,cAAc;AAC9B,QAAM,EAAE,YAAY,OAAO,KAAK,IAAI,MAAM,iBAAiB,IAAI,KAAK;AACpE,QAAM,OAAO,SAAS,QAAQ,MAAM,MAAM,EAAE,EAAE;AAC9C,QAAM,OAAO,CAAC,SAAS,UAAU,sBAAsB,MAAM,KAAK,SAAS,cAAc,KAAK,MAAM,wCAAwC,EAAE,wBAAwB,EAAE,MAAM,IAAI,EAAE,OAAO,OAAO,EAAE,KAAK,SAAS;AAClN,MAAI,MAAM,MAAM;AACd,cAAU,EAAE,YAAY,IAAI,SAAS,MAAM,YAAY,OAAO,MAAM,MAAM,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC,EAAG,CAAC;AACrG;AAAA,EACF;AACA,UAAQ,IAAI,GAAG,EAAE,MAAM,QAAG,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC,SAAS,UAAU,EAAE;AACtE,MAAI,UAAU,cAAc,UAAU,WAAY,SAAQ,IAAI,GAAG,EAAE,MAAM,QAAG,CAAC,IAAI,KAAK,0CAA0C;AAAA,WACvH,UAAU,UAAW,SAAQ,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,CAAC;AAChE,aAAW,KAAK,KAAM,SAAQ,IAAI,KAAK,EAAE,KAAK,GAAG,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE;AACjF,MAAI,KAAM,SAAQ,IAAI,EAAE,IAAI,SAAS,IAAI,GAAG,CAAC;AAC/C;","names":[]}