malkuthro
b5b46d7fcc
Phase 1 of #181: read-only side-by-side Compare. A/B toggle renders the existing sidebar twice — live working copy (A) + a loaded snapshot (B), B labeled with its own name + diff-tinted (green=only in comparison, red=same name/graph differs ignoring savedAt). Non-destructive: read-only capture guard on B, onChoose chooser never calls applySnapshot. Phase 2 (pull-in + A<->B swap) tracked in #197.
71 lines
3.2 KiB
JavaScript
71 lines
3.2 KiB
JavaScript
// SPDX-FileCopyrightText: 2025-2026 Kforge Labs <https://github.com/malkuthro/ComfyUI-Koolook>
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
import { sortJsonValue } from "./workflows_store.js";
|
|
|
|
// Pure snapshot-comparison helpers for the Compare-mode sidebar (issue #181).
|
|
// No DOM, no globals, no I/O — every function takes plain data and returns
|
|
// plain data so it can be unit-tested by piping a scenario through Node. The
|
|
// Compare view renders the existing sidebar a second time and uses these
|
|
// results purely to tint comparison rows (green = only in comparison, red =
|
|
// same key, contents differ); it never mutates the working state.
|
|
|
|
// Partition two pick lists (arrays of string identifiers) against each other.
|
|
// Order follows the `working` list for `onlyWorking`/`shared` and the
|
|
// `comparison` list for `onlyComparison`. Membership is by set, so duplicates
|
|
// collapse to a single classification.
|
|
export function diffPicks(working, comparison) {
|
|
const workingSet = new Set(working);
|
|
const comparisonSet = new Set(comparison);
|
|
return {
|
|
onlyWorking: working.filter((id) => !comparisonSet.has(id)),
|
|
onlyComparison: comparison.filter((id) => !workingSet.has(id)),
|
|
shared: working.filter((id) => comparisonSet.has(id)),
|
|
};
|
|
}
|
|
|
|
// Flatten a workflows store ({ directories: { [name]: DirNode } }, the shape
|
|
// returned by getAllWorkflowsForExport / stored under snapshot.workflows) into
|
|
// a Map of full path ("Basics/txt2img", "Basics/Sub/wf") -> WorkflowEntry.
|
|
function collectWorkflows(node, prefix, out) {
|
|
const dirs = node && typeof node.directories === "object" && node.directories ? node.directories : {};
|
|
for (const dirName of Object.keys(dirs)) {
|
|
const child = dirs[dirName];
|
|
if (!child || typeof child !== "object") continue;
|
|
const childPrefix = `${prefix}${dirName}/`;
|
|
const wfs = child.workflows && typeof child.workflows === "object" ? child.workflows : {};
|
|
for (const wfName of Object.keys(wfs)) {
|
|
out.set(`${childPrefix}${wfName}`, wfs[wfName]);
|
|
}
|
|
collectWorkflows(child, childPrefix, out);
|
|
}
|
|
return out;
|
|
}
|
|
|
|
// Two workflow graphs are equal when their canonical (key-order-normalized)
|
|
// JSON matches. Comparing the `graph` subtree alone ignores the sibling
|
|
// `savedAt` stamp, which is rewritten on every save and would otherwise make
|
|
// every re-saved workflow read as changed.
|
|
function graphsEqual(a, b) {
|
|
return JSON.stringify(sortJsonValue(a)) === JSON.stringify(sortJsonValue(b));
|
|
}
|
|
|
|
// Classify every workflow in the comparison store against the working store,
|
|
// keyed by full path:
|
|
// "new" -> present only in the comparison (green tint)
|
|
// "diff" -> present in both, graph differs ignoring savedAt (red tint)
|
|
// "same" -> present in both, identical graph (plain)
|
|
export function diffWorkflows(workingStore, comparisonStore) {
|
|
const working = collectWorkflows(workingStore, "", new Map());
|
|
const comparison = collectWorkflows(comparisonStore, "", new Map());
|
|
const status = {};
|
|
for (const [path, entry] of comparison) {
|
|
if (!working.has(path)) {
|
|
status[path] = "new";
|
|
} else {
|
|
status[path] = graphsEqual(entry.graph, working.get(path).graph) ? "same" : "diff";
|
|
}
|
|
}
|
|
return status;
|
|
}
|