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

Declare all dsfs as a dedicated type name 'DSF'.

Browse Source 
In this commit, 'DSF' is simply a typedef for 'int', so that the new
declaration form 'DSF *' translates to the same type 'int *' that dsfs
have always had. So all we're doing here is mechanically changing type
declarations throughout the code.
This commit is contained in:
Simon Tatham
2023-04-20 14:06:43 +01:00
parent 7abf85a9c6
commit 89c438e149
24 changed files with 122 additions and 100 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
loopy.c
View File

@ -157,7 +157,7 @@ typedef struct solver_state {
char *face_yes_count;
char *face_no_count;
bool *dot_solved, *face_solved;
int *dotdsf;
DSF *dotdsf;
/* Information for Normal level deductions:
* For each dline, store a bitmask for whether we know:
@ -166,7 +166,7 @@ typedef struct solver_state {
char *dlines;
/* Hard level information */
int *linedsf;
DSF *linedsf;
} solver_state;
/*
@ -1545,7 +1545,8 @@ static bool check_completion(game_state *state)
grid *g = state->game_grid;
int i;
bool ret;
int *dsf, *component_state;
DSF *dsf;
int *component_state;
int nsilly, nloop, npath, largest_comp, largest_size, total_pathsize;
enum { COMP_NONE, COMP_LOOP, COMP_PATH, COMP_SILLY, COMP_EMPTY };
@ -1993,7 +1994,7 @@ static int parity_deductions(solver_state *sstate,
{
game_state *state = sstate->state;
int diff = DIFF_MAX;
int *linedsf = sstate->linedsf;
DSF *linedsf = sstate->linedsf;
if (unknown_count == 2) {
/* Lines are known alike/opposite, depending on inv. */