Pre-launch — Gluecron is in final validation. Public signups and git hosting for non-owner users open after launch review.
CodeIssuesDiscussionsWikiPull RequestsProjectsCommitsActionsReleasesContributorsPulse● GatesSecuritySettingsDeploymentsPipelineInsightsAgents✨ Explain✨ Ask AI✨ Workspace✨ Spec✨ Tests▓ Debt Map✨ NL Search🏛 Archaeology
claude/adoring-hopper-5x74bqclaude/affectionate-feynman-ykrf1hclaude/architecture-audit-design-wxprenclaude/build-status-update-3MXsfclaude/charming-meitner-mllb5rclaude/compare-gate-gluecron-s4mFQclaude/confident-faraday-tikcwbclaude/continue-work-XMTlIclaude/crontech-gluecron-deploy-7MIECclaude/crontech-platform-setup-SeKfwclaude/design-2026claude/ecstatic-ptolemy-jMdigclaude/enhance-github-integration-QNHdGclaude/fix-aa-loop-issue-PonMQclaude/fix-actions-and-processclaude/fix-desktop-errors-XqoW8claude/fix-red-workflowsclaude/fix-website-access-6FKJNclaude/gatetest-integration-hardeningclaude/github-audit-improvements-bDFr9claude/gluecron-launch-status-FoMRlclaude/hopeful-lamport-olfCTclaude/issue-to-pr-and-protectionsclaude/jolly-heisenberg-2sg1Qclaude/launch-preparation-QmTb6claude/new-session-xk1l7claude/plan-platform-architecture-kkN4yclaude/platform-analysis-roadmap-1nUGLclaude/platform-launch-assessment-8dWV8claude/polish-platform-release-AeDrUclaude/resume-previous-work-KzyLwclaude/review-crontech-handoff-qYEVqclaude/review-project-completeness-lHhS2claude/review-readme-docs-ulqPKclaude/serene-edison-rj87weclaude/setup-multi-repo-dev-BCwNQclaude/ship-fixes-and-tests-Jvz1cclaude/site-audit-competitive-pctlwgclaude/site-migration-vercel-XstpKclaude/standalone-product-repos-XHFTDcopilot/feat-smart-empty-states-keyboard-first-enhancementcopilot/feat-smart-morning-digest-review-context-restorecopilot/fix-and-process-workflowscopilot/update-ai-powered-code-reviewfeat/debt-mapfeat/push-policy-codeowners-hardeningfeat/smart-digest-contextfeat/stage-impactfeat/t1-secret-migrationfeat/u-polishfeat/w-self-hostfeat/w2-claude-configfix/agent-journey-orphan-sweepgatetest/auto-fix-1776586424172gatetest/auto-fix-1776586534814gatetest/auto-fix-1776590685143gatetest/auto-fix-1776590808199mainops/redeploy-retriggerstyle/dxt-cta-themeworktree-agent-a3377aad30d55da26worktree-agent-a7ef607b7ee1d6c74
workflow-matrix.ts8.4 KB · 245 lines
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
/**
 * workflow-matrix.ts
 *
 * Pure-function matrix expansion for workflow jobs. No DB, no I/O, no deps.
 *
 * Semantics mirror GitHub Actions `strategy.matrix`:
 *   - Cartesian product of named axes.
 *   - `exclude`: remove any cartesian combo whose keys all match an exclude entry.
 *   - `include`: extend an existing combo if it matches on all of include's keys,
 *                otherwise append as a standalone combo.
 *
 * Never throws. On bad input returns [].
 */

export type MatrixSpec = {
  axes: Record<string, unknown[]>;
  include?: Record<string, unknown>[];
  exclude?: Record<string, unknown>[];
  failFast?: boolean;
  maxParallel?: number;
};

export type MatrixCombo = Record<string, unknown>;

// ---------------------------------------------------------------------------
// Deep-equality for primitive-holding matrix values.
// Supports scalars, arrays, and plain objects nested arbitrarily.
// ---------------------------------------------------------------------------

function deepEqual(a: unknown, b: unknown): boolean {
  if (a === b) return true;
  if (a === null || b === null) return a === b;
  if (typeof a !== typeof b) return false;
  if (typeof a !== "object") return false;
  if (Array.isArray(a) !== Array.isArray(b)) return false;
  if (Array.isArray(a) && Array.isArray(b)) {
    if (a.length !== b.length) return false;
    for (let i = 0; i < a.length; i++) {
      if (!deepEqual(a[i], b[i])) return false;
    }
    return true;
  }
  const ao = a as Record<string, unknown>;
  const bo = b as Record<string, unknown>;
  const ak = Object.keys(ao).sort();
  const bk = Object.keys(bo).sort();
  if (ak.length !== bk.length) return false;
  for (let i = 0; i < ak.length; i++) {
    if (ak[i] !== bk[i]) return false;
    if (!deepEqual(ao[ak[i]!], bo[bk[i]!])) return false;
  }
  return true;
}

// A combo matches a partial entry iff every key in the entry deep-equals
// the same key in the combo. Keys not in the entry are ignored.
function matchesPartial(combo: MatrixCombo, partial: Record<string, unknown>): boolean {
  for (const k of Object.keys(partial)) {
    if (!(k in combo)) return false;
    if (!deepEqual(combo[k], partial[k])) return false;
  }
  return true;
}

// ---------------------------------------------------------------------------
// Cartesian expansion.
// Sort axis keys alphabetically so ordering is deterministic across runs.
// ---------------------------------------------------------------------------

function cartesian(axes: Record<string, unknown[]>): MatrixCombo[] {
  const keys = Object.keys(axes).sort();
  if (keys.length === 0) return [];
  // If any axis has zero values, the product is empty — matches GitHub Actions.
  for (const k of keys) {
    const v = axes[k];
    if (!Array.isArray(v) || v.length === 0) return [];
  }
  let combos: MatrixCombo[] = [{}];
  for (const k of keys) {
    const values = axes[k]!;
    const next: MatrixCombo[] = [];
    for (const combo of combos) {
      for (const val of values) {
        next.push({ ...combo, [k]: val });
      }
    }
    combos = next;
  }
  return combos;
}

export function expandMatrix(spec: MatrixSpec): MatrixCombo[] {
  if (!spec || typeof spec !== "object") return [];
  const axes = spec.axes;
  const include = Array.isArray(spec.include) ? spec.include : [];
  const exclude = Array.isArray(spec.exclude) ? spec.exclude : [];

  // Validate axes: must be a plain object mapping string -> array.
  let validAxes: Record<string, unknown[]> = {};
  if (axes && typeof axes === "object" && !Array.isArray(axes)) {
    for (const k of Object.keys(axes)) {
      const v = (axes as Record<string, unknown>)[k];
      if (!Array.isArray(v)) return [];
      validAxes[k] = v;
    }
  } else if (axes !== undefined && axes !== null) {
    return [];
  }

  // 1. Cartesian product (possibly empty if no axes).
  let combos: MatrixCombo[] = cartesian(validAxes);

  // 2. Apply exclude. An exclude entry removes any cartesian combo that
  //    partially matches all of the exclude's keys.
  if (exclude.length > 0) {
    combos = combos.filter((combo) => {
      for (const ex of exclude) {
        if (ex && typeof ex === "object" && matchesPartial(combo, ex)) return false;
      }
      return true;
    });
  }

  // 3. Apply include. For each include entry:
  //    - If it fully matches an existing combo (partial match on include's
  //      keys), merge extra keys into that combo.
  //    - Otherwise append as a standalone combo.
  //    "Matches an existing combo" means the include entry's keys that are
  //    also axis keys deep-equal the combo's values for those keys.
  const axisKeySet = new Set(Object.keys(validAxes));
  for (const inc of include) {
    if (!inc || typeof inc !== "object") continue;
    // Build the matcher: only axis-key fields count for matching.
    const matcher: Record<string, unknown> = {};
    let hasAxisKeys = false;
    for (const k of Object.keys(inc)) {
      if (axisKeySet.has(k)) {
        matcher[k] = inc[k];
        hasAxisKeys = true;
      }
    }
    let extended = false;
    if (hasAxisKeys && combos.length > 0) {
      for (const combo of combos) {
        if (matchesPartial(combo, matcher)) {
          // Extend with extra (non-axis or additive) keys that are not already
          // present in the combo. GitHub Actions semantics: include's extra
          // fields are added, but they never overwrite an axis value.
          for (const k of Object.keys(inc)) {
            if (!(k in combo)) combo[k] = inc[k];
          }
          extended = true;
        }
      }
    }
    if (!extended) {
      // Append as a standalone combo (copy to avoid aliasing caller's object).
      combos.push({ ...inc });
    }
  }

  return combos;
}

// ---------------------------------------------------------------------------
// validateMatrix — type-guard / sanitiser for untrusted input.
// ---------------------------------------------------------------------------

export function validateMatrix(
  spec: unknown,
): { ok: true; spec: MatrixSpec } | { ok: false; error: string } {
  if (spec === null || spec === undefined) {
    return { ok: false, error: "matrix: spec is null or undefined" };
  }
  if (typeof spec !== "object" || Array.isArray(spec)) {
    return { ok: false, error: "matrix: spec must be an object" };
  }
  const s = spec as Record<string, unknown>;

  const axes: Record<string, unknown[]> = {};
  const rawAxes = s.axes;
  if (rawAxes !== undefined && rawAxes !== null) {
    if (typeof rawAxes !== "object" || Array.isArray(rawAxes)) {
      return { ok: false, error: "matrix: axes must be an object" };
    }
    for (const k of Object.keys(rawAxes as object)) {
      const v = (rawAxes as Record<string, unknown>)[k];
      if (!Array.isArray(v)) {
        return { ok: false, error: `matrix: axis "${k}" must be an array` };
      }
      axes[k] = v;
    }
  }

  let include: Record<string, unknown>[] | undefined;
  if (s.include !== undefined && s.include !== null) {
    if (!Array.isArray(s.include)) {
      return { ok: false, error: "matrix: include must be an array" };
    }
    include = [];
    for (let i = 0; i < s.include.length; i++) {
      const e = s.include[i];
      if (!e || typeof e !== "object" || Array.isArray(e)) {
        return { ok: false, error: `matrix: include[${i}] must be an object` };
      }
      include.push(e as Record<string, unknown>);
    }
  }

  let exclude: Record<string, unknown>[] | undefined;
  if (s.exclude !== undefined && s.exclude !== null) {
    if (!Array.isArray(s.exclude)) {
      return { ok: false, error: "matrix: exclude must be an array" };
    }
    exclude = [];
    for (let i = 0; i < s.exclude.length; i++) {
      const e = s.exclude[i];
      if (!e || typeof e !== "object" || Array.isArray(e)) {
        return { ok: false, error: `matrix: exclude[${i}] must be an object` };
      }
      exclude.push(e as Record<string, unknown>);
    }
  }

  let failFast: boolean | undefined;
  if (s.failFast !== undefined) {
    if (typeof s.failFast !== "boolean") {
      return { ok: false, error: "matrix: failFast must be boolean" };
    }
    failFast = s.failFast;
  }

  let maxParallel: number | undefined;
  if (s.maxParallel !== undefined) {
    if (typeof s.maxParallel !== "number" || !Number.isFinite(s.maxParallel) || s.maxParallel < 1) {
      return { ok: false, error: "matrix: maxParallel must be a positive number" };
    }
    maxParallel = Math.floor(s.maxParallel);
  }

  return {
    ok: true,
    spec: { axes, include, exclude, failFast, maxParallel },
  };
}