zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-20 23:51:29 -07:00
Code Issues Packages Projects Releases Wiki Activity

Consistently use snew_dsf to allocate dsfs.

Browse Source 
All remaining cases where a dsf was allocated via snewn(foo, int) are
removed by this change.
This commit is contained in:
Simon Tatham
2023-04-20 13:56:44 +01:00
parent 11a8149d67
commit f21c7d2766
8 changed files with 11 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
tracks.c
View File

@ -1373,8 +1373,7 @@ static int solve_check_loop(game_state *state)
/* TODO eventually we should pull this out into a solver struct and keep it
updated as we connect squares. For now we recreate it every time we try
this particular solver step. */
dsf = snewn(w*h, int);
dsf_init(dsf, w*h);
dsf = snew_dsf(w*h);
/* Work out the connectedness of the current loop set. */
for (x = 0; x < w; x++) {
@ -1878,8 +1877,7 @@ static bool check_completion(game_state *state, bool mark)
}
}
dsf = snewn(w*h, int);
dsf_init(dsf, w*h);
dsf = snew_dsf(w*h);
for (x = 0; x < w; x++) {
for (y = 0; y < h; y++) {