mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-20 23:51:29 -07:00
35f796542e
The loop that selects one of the disconnected regions (represented as equivalence classes in a dsf) to _not_ highlight as an error was failing to call dsf_canonify() to get the canonical element of the class. Instead, it was relying on having met the canonical element of the class first, because it iterates up the array in order, and in the old dsf implementation, canonical elements were always minimal ones. But the DSF refactoring made that untrue, so now we have to explicitly canonify each value we come to. Thanks to Steffen Bauer for the diagnosis and suggested fix.
This is the README accompanying the source code to Simon Tatham's puzzle collection. The collection's web site is at <https://www.chiark.greenend.org.uk/~sgtatham/puzzles/>. The puzzle collection is built using CMake <https://cmake.org/>. To compile in the simplest way (on any of Linux, Windows or Mac), run these commands in the source directory: cmake . cmake --build . The manual is provided in Windows Help format for the Windows build; in text format for anyone who needs it; and in HTML for the Mac OS X application and for the web site. It is generated from a Halibut source file (puzzles.but), which is the preferred form for modification. To generate the manual in other formats, rebuild it, or learn about Halibut, visit the Halibut website at <https://www.chiark.greenend.org.uk/~sgtatham/halibut/>.