mirror of
https://github.com/snapotter-hq/SnapOtter.git
synced 2026-08-03 07:46:42 +02:00
SnapOtter
1727a7a73e
Group 245 flat integration tests and 25 loose unit tests into
discoverable subdirectories per spec section 6:
integration/tools/{image,video,audio,document,data}/ (156 files)
integration/platform/ (64 files)
integration/generated/ (14 files)
integration/security/ (10 files)
unit/security/ (8 files, new subdir)
unit/api/ (7 files moved in)
unit/web/ (3 files moved in)
unit/shared/ (6 files moved in)
unit/image-engine/ (1 file moved in)
All moves via git mv (history preserved). Relative imports repaired
for both depth levels (platform/generated/security = +1, tools/ = +2):
static from-imports, dynamic import() calls, vi.mock() paths,
import.meta.dirname joins, and __dirname joins.
Vitest discovery unchanged (no test.include in config, recursive glob
matches subdirs, shard-by-hash unaffected). test-server.ts and
tool-route-drift.test.ts stay at integration root. fixtures/ untouched.
Parity gate: 13189 passing test names before = 13189 after (0 dropped).
55 lines
1.8 KiB
TypeScript
55 lines
1.8 KiB
TypeScript
import { describe, expect, it } from "vitest";
|
|
import { pairwise } from "../../helpers/pairwise.js";
|
|
|
|
describe("pairwise covering-array generator", () => {
|
|
it("covers every pair of values across all axis pairs", () => {
|
|
const axes = [
|
|
{ key: "fit", values: ["contain", "cover", "fill", "inside"] },
|
|
{ key: "format", values: ["png", "jpeg", "webp"] },
|
|
{ key: "withMetadata", values: [true, false] },
|
|
{ key: "quality", values: [1, 50, 100] },
|
|
];
|
|
const cases = pairwise(axes);
|
|
|
|
for (let i = 0; i < axes.length; i++) {
|
|
for (let j = i + 1; j < axes.length; j++) {
|
|
for (const vi of axes[i].values) {
|
|
for (const vj of axes[j].values) {
|
|
const covered = cases.some((c) => c[axes[i].key] === vi && c[axes[j].key] === vj);
|
|
expect(covered, `pair ${axes[i].key}=${vi} x ${axes[j].key}=${vj} not covered`).toBe(
|
|
true,
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
it("produces far fewer cases than the full cartesian product", () => {
|
|
const axes = [
|
|
{ key: "a", values: [1, 2, 3, 4] },
|
|
{ key: "b", values: [1, 2, 3] },
|
|
{ key: "c", values: [true, false] },
|
|
{ key: "d", values: ["x", "y", "z"] },
|
|
];
|
|
const cases = pairwise(axes);
|
|
// Cartesian product is 72; pairwise needs at least 12 (largest axis pair).
|
|
expect(cases.length).toBeGreaterThanOrEqual(12);
|
|
expect(cases.length).toBeLessThan(30);
|
|
});
|
|
|
|
it("is deterministic", () => {
|
|
const axes = [
|
|
{ key: "a", values: [1, 2, 3] },
|
|
{ key: "b", values: ["x", "y"] },
|
|
{ key: "c", values: [true, false] },
|
|
];
|
|
expect(pairwise(axes)).toEqual(pairwise(axes));
|
|
});
|
|
|
|
it("handles degenerate inputs", () => {
|
|
expect(pairwise([])).toEqual([]);
|
|
expect(pairwise([{ key: "only", values: [1, 2] }])).toEqual([{ only: 1 }, { only: 2 }]);
|
|
});
|
|
});
|