rule-based file sorter in Go, shows the plan before touching anything, applies only the files you choose, and can undo any run, with s-expression rules and a GTK 4 window https://git.labunix.xyz/krino.git/atom?h=v0.0.1 2026-09-13T00:31:32Z 2026-09-13T00:31:32Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-13T00:31:32Z urn:sha1:26c94eb3db62ec6eebbf8d22c11afe691d9520c4 Also: undo removes the directories its run created; a hardlink is never a duplicate of its own other name; a flag written before "undo" is honoured; --version prints no leading v. Duplicate conditions with different scopes not sharing an original is documented as a known limitation. 2026-09-12T19:34:22Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-12T19:34:22Z urn:sha1:a6e442a645902011b2081c216daaec052cdc6ce6 Lukasz: "no performance goal". Section 13s "under 2 s on a 4-core laptop" is replaced with the decision and its evidence, so it is not reinstated later: measured throughput is dominated by the external extractors, not by krino. A real folder of 265 files with 164 needing pdftotext at roughly 80 ms each takes 12-17 s; a synthetic 4405-file tree needing no extraction takes 1.09 s. A single threshold would describe popplers speed and the shape of one folder. The measurement is still reported in the release notes; nothing is promised. 2026-09-12T18:14:47Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-12T18:14:47Z urn:sha1:3f8679be9373ee7508d512dfdfc1dda0839c7f90 2026-09-12T10:58:14Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-12T10:58:14Z urn:sha1:24a84671ace373ae331fa83a1ff484990f4dff0e 2026-09-11T23:22:12Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-11T23:22:12Z urn:sha1:3b36a48b7ce5a53a9366f3b31f94311f178e2553 2026-09-11T13:01:57Z Lukasz Kasprzak lukas@labunix.xyz 2026-09-11T12:47:10Z urn:sha1:42b02c47be9b285099203e44a2570636d4ca6f03