mirror of
https://seed.radicle.dev/rad:z4V1sjrXqjvFdnCUbxPFqd5p4DtH5.git
synced 2026-11-21 14:20:42 +08:00
Every status chip of a repository shares one list of its jobs, which refreshes when a job changes, at most every few seconds, since listing them scans every job of the repository.
97 lines
2.8 KiB
TypeScript
97 lines
2.8 KiB
TypeScript
import type { Query } from "@tanstack/query-core";
|
|
|
|
import { keys } from "@radicle-gui/core/keys";
|
|
import { afterEach, beforeEach, describe, expect, test, vi } from "vitest";
|
|
|
|
import { batch, onRefUpdate } from "@app/lib/startup.svelte";
|
|
|
|
const { invalidateQueries } = vi.hoisted(() => ({
|
|
invalidateQueries: vi.fn(),
|
|
}));
|
|
vi.mock("@app/lib/query", () => ({ queryClient: { invalidateQueries } }));
|
|
vi.mock("@app/lib/invoke", () => ({ invoke: vi.fn() }));
|
|
vi.mock("@tauri-apps/api/event", () => ({ listen: vi.fn() }));
|
|
vi.mock("@app/lib/seedRepo", async () => {
|
|
const { writable } = await import("svelte/store");
|
|
return { fetchingRepos: writable([]) };
|
|
});
|
|
|
|
const rid = "rad:z3gqcJUoA1n9HaHKufZs5FCSGazv5";
|
|
|
|
// Whether an invalidation with the given filter refetches a query of `key`.
|
|
function covers(call: unknown[], key: readonly unknown[]): boolean {
|
|
const { predicate } = call[0] as {
|
|
predicate: (query: Pick<Query, "queryKey">) => boolean;
|
|
};
|
|
return predicate({ queryKey: [...key] });
|
|
}
|
|
|
|
// Invalidations of the repository's data, leaving out others such as the
|
|
// notification count.
|
|
function repoCalls() {
|
|
return invalidateQueries.mock.calls.filter(
|
|
call => call[0].queryKey[0] === "repo",
|
|
);
|
|
}
|
|
|
|
beforeEach(() => {
|
|
vi.useFakeTimers();
|
|
});
|
|
|
|
afterEach(() => {
|
|
vi.useRealTimers();
|
|
invalidateQueries.mockReset();
|
|
});
|
|
|
|
describe("batch", () => {
|
|
test("invalidates each key once after the delay", () => {
|
|
const invalidate = batch(100, false);
|
|
|
|
invalidate([keys.issues(rid)]);
|
|
invalidate([keys.issues(rid), keys.patches(rid)]);
|
|
expect(invalidateQueries).not.toHaveBeenCalled();
|
|
vi.advanceTimersByTime(100);
|
|
|
|
expect(invalidateQueries.mock.calls.map(call => call[0].queryKey)).toEqual([
|
|
keys.issues(rid),
|
|
keys.patches(rid),
|
|
]);
|
|
});
|
|
|
|
test("leaves job lists under a repository key to their own batch", () => {
|
|
const invalidate = batch(100, false);
|
|
|
|
invalidate([keys.repo(rid)]);
|
|
vi.advanceTimersByTime(100);
|
|
|
|
const [call] = invalidateQueries.mock.calls;
|
|
expect(covers(call, keys.issues(rid))).toBe(true);
|
|
expect(covers(call, keys.jobs(rid))).toBe(false);
|
|
});
|
|
|
|
test("the job batch refetches job lists", () => {
|
|
const invalidateJobs = batch(5_000, true);
|
|
|
|
invalidateJobs([keys.jobs(rid)]);
|
|
vi.advanceTimersByTime(5_000);
|
|
|
|
const [call] = invalidateQueries.mock.calls;
|
|
expect(covers(call, keys.jobs(rid))).toBe(true);
|
|
});
|
|
|
|
test("an update naming no refs refreshes job lists in their own batch", () => {
|
|
onRefUpdate({ rid });
|
|
|
|
vi.advanceTimersByTime(100);
|
|
const [first] = repoCalls();
|
|
expect(first[0].queryKey).toEqual(keys.repo(rid));
|
|
expect(covers(first, keys.jobs(rid))).toBe(false);
|
|
|
|
vi.advanceTimersByTime(5_000);
|
|
expect(repoCalls().map(call => call[0].queryKey)).toEqual([
|
|
keys.repo(rid),
|
|
keys.jobs(rid),
|
|
]);
|
|
});
|
|
});
|