X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ian/git?a=blobdiff_plain;f=bridges.c;h=6975208fd62094c64f8c8d1d5bbcd4c170efcc92;hb=a0a581c8b5422bf0c5ed3fde6aa25811e4eb89fc;hp=a5eef25d740c21f520facc4e45c3cf02845dc771;hpb=3b250baa02a7332510685948bf17576c397b8ceb;p=sgt-puzzles.git diff --git a/bridges.c b/bridges.c index a5eef25..6975208 100644 --- a/bridges.c +++ b/bridges.c @@ -78,7 +78,6 @@ /* Turn this on for hints about which lines are considered possibilities. */ #undef DRAW_GRID -#undef DRAW_DSF /* --- structures for params, state, etc. --- */ @@ -122,12 +121,8 @@ struct game_params { #define G_NOLINEH 0x0040 #define G_NOLINE (G_NOLINEV|G_NOLINEH) -/* flags used by the drawstate */ -#define G_ISSEL 0x0080 -#define G_REDRAW 0x0100 -#define G_FLASH 0x0200 -#define G_WARN 0x0400 -#define G_CURSOR 0x0800 +/* flags used by the error checker */ +#define G_WARN 0x0080 /* flags used by the solver etc. */ #define G_SWEEP 0x1000 @@ -161,7 +156,7 @@ struct island { struct game_state { int w, h, completed, solved, allowloops, maxb; - grid_type *grid, *scratch; + grid_type *grid; struct island *islands; int n_islands, n_islands_alloc; game_params params; /* used by the aux solver. */ @@ -180,7 +175,6 @@ struct game_state { #define INDEX(s,g,x,y) ((s)->g[(y)*((s)->w) + (x)]) #define IDX(s,g,i) ((s)->g[(i)]) #define GRID(s,x,y) INDEX(s,grid,x,y) -#define SCRATCH(s,x,y) INDEX(s,scratch,x,y) #define POSSIBLES(s,dx,x,y) ((dx) ? (INDEX(s,possh,x,y)) : (INDEX(s,possv,x,y))) #define MAXIMUM(s,dx,x,y) ((dx) ? (INDEX(s,maxh,x,y)) : (INDEX(s,maxv,x,y))) @@ -210,12 +204,12 @@ static void fixup_islands_for_realloc(game_state *state) } } -static int game_can_format_as_text_now(game_params *params) +static int game_can_format_as_text_now(const game_params *params) { return TRUE; } -static char *game_text_format(game_state *state) +static char *game_text_format(const game_state *state) { int x, y, len, nl; char *ret, *p; @@ -679,7 +673,7 @@ static void free_params(game_params *params) sfree(params); } -static game_params *dup_params(game_params *params) +static game_params *dup_params(const game_params *params) { game_params *ret = snew(game_params); *ret = *params; /* structure copy */ @@ -722,7 +716,7 @@ static void decode_params(game_params *params, char const *string) } } -static char *encode_params(game_params *params, int full) +static char *encode_params(const game_params *params, int full) { char buf[80]; @@ -738,7 +732,7 @@ static char *encode_params(game_params *params, int full) return dupstr(buf); } -static config_item *game_configure(game_params *params) +static config_item *game_configure(const game_params *params) { config_item *ret; char buf[80]; @@ -790,7 +784,7 @@ static config_item *game_configure(game_params *params) return ret; } -static game_params *custom_params(config_item *cfg) +static game_params *custom_params(const config_item *cfg) { game_params *ret = snew(game_params); @@ -805,7 +799,7 @@ static game_params *custom_params(config_item *cfg) return ret; } -static char *validate_params(game_params *params, int full) +static char *validate_params(const game_params *params, int full) { if (params->w < 3 || params->h < 3) return "Width and height must be at least 3"; @@ -862,7 +856,7 @@ static char *encode_game(game_state *state) return ret; } -static char *game_state_diff(game_state *src, game_state *dest) +static char *game_state_diff(const game_state *src, const game_state *dest) { int movesize = 256, movelen = 0; char *move = snewn(movesize, char), buf[80]; @@ -1056,95 +1050,84 @@ static void map_find_orthogonal(game_state *state) } } -static int grid_degree(game_state *state, int x, int y, int *nx_r, int *ny_r) +struct bridges_neighbour_ctx { + game_state *state; + int i, n, neighbours[4]; +}; +static int bridges_neighbour(int vertex, void *vctx) { - grid_type grid = SCRATCH(state, x, y), gline = grid & G_LINE; - struct island *is; - int x1, y1, x2, y2, c = 0, i, nx, ny; - - nx = ny = -1; /* placate optimiser */ - is = INDEX(state, gridi, x, y); - if (is) { - for (i = 0; i < is->adj.npoints; i++) { - gline = is->adj.points[i].dx ? G_LINEH : G_LINEV; - if (SCRATCH(state, - is->adj.points[i].x, - is->adj.points[i].y) & gline) { - nx = is->adj.points[i].x; - ny = is->adj.points[i].y; - c++; + struct bridges_neighbour_ctx *ctx = (struct bridges_neighbour_ctx *)vctx; + if (vertex >= 0) { + game_state *state = ctx->state; + int w = state->w, x = vertex % w, y = vertex / w; + grid_type grid = GRID(state, x, y), gline = grid & G_LINE; + struct island *is; + int x1, y1, x2, y2, i; + + ctx->i = ctx->n = 0; + + is = INDEX(state, gridi, x, y); + if (is) { + for (i = 0; i < is->adj.npoints; i++) { + gline = is->adj.points[i].dx ? G_LINEH : G_LINEV; + if (GRID(state, is->adj.points[i].x, + is->adj.points[i].y) & gline) { + ctx->neighbours[ctx->n++] = + (is->adj.points[i].y * w + is->adj.points[i].x); + } } + } else if (gline) { + if (gline & G_LINEV) { + x1 = x2 = x; + y1 = y-1; y2 = y+1; + } else { + x1 = x-1; x2 = x+1; + y1 = y2 = y; + } + /* Non-island squares with edges in should never be + * pointing off the edge of the grid. */ + assert(INGRID(state, x1, y1)); + assert(INGRID(state, x2, y2)); + if (GRID(state, x1, y1) & (gline | G_ISLAND)) + ctx->neighbours[ctx->n++] = y1 * w + x1; + if (GRID(state, x2, y2) & (gline | G_ISLAND)) + ctx->neighbours[ctx->n++] = y2 * w + x2; } - } else if (gline) { - if (gline & G_LINEV) { - x1 = x2 = x; - y1 = y-1; y2 = y+1; - } else { - x1 = x-1; x2 = x+1; - y1 = y2 = y; - } - /* Non-island squares with edges in should never be pointing off the - * edge of the grid. */ - assert(INGRID(state, x1, y1)); - assert(INGRID(state, x2, y2)); - if (SCRATCH(state, x1, y1) & (gline | G_ISLAND)) { - nx = x1; ny = y1; c++; - } - if (SCRATCH(state, x2, y2) & (gline | G_ISLAND)) { - nx = x2; ny = y2; c++; - } - } - if (c == 1) { - assert(nx != -1 && ny != -1); /* paranoia */ - *nx_r = nx; *ny_r = ny; } - return c; + + if (ctx->i < ctx->n) + return ctx->neighbours[ctx->i++]; + else + return -1; } static int map_hasloops(game_state *state, int mark) { - int x, y, ox, oy, nx = 0, ny = 0, loop = 0; - - memcpy(state->scratch, state->grid, GRIDSZ(state)); + int x, y; + struct findloopstate *fls; + struct bridges_neighbour_ctx ctx; + int ret; - /* This algorithm is actually broken; if there are two loops connected - * by bridges this will also highlight bridges. The correct algorithm - * uses a dsf and a two-pass edge-detection algorithm (see check_correct - * in slant.c); this is BALGE for now, especially since disallow-loops - * is not the default for this puzzle. If we want to fix this later then - * copy the alg in slant.c to the empty statement in map_group. */ + fls = findloop_new_state(state->w * state->h); + ctx.state = state; + ret = findloop_run(fls, state->w * state->h, bridges_neighbour, &ctx); - /* Remove all 1-degree edges. */ - for (y = 0; y < state->h; y++) { - for (x = 0; x < state->w; x++) { - ox = x; oy = y; - while (grid_degree(state, ox, oy, &nx, &ny) == 1) { - /*debug(("hasloops: removing 1-degree at (%d,%d).\n", ox, oy));*/ - SCRATCH(state, ox, oy) &= ~(G_LINE|G_ISLAND); - ox = nx; oy = ny; - } - } - } - /* Mark any remaining edges as G_WARN, if required. */ - for (x = 0; x < state->w; x++) { + if (mark) { for (y = 0; y < state->h; y++) { - if (GRID(state,x,y) & G_ISLAND) continue; - - if (SCRATCH(state, x, y) & G_LINE) { - if (mark) { - /*debug(("hasloops: marking loop square at (%d,%d).\n", - x, y));*/ - GRID(state,x,y) |= G_WARN; - loop = 1; - } else - return 1; /* short-cut as soon as we find one */ - } else { - if (mark) - GRID(state,x,y) &= ~G_WARN; + for (x = 0; x < state->w; x++) { + int u, v; + + u = y * state->w + x; + for (v = bridges_neighbour(u, &ctx); v >= 0; + v = bridges_neighbour(-1, &ctx)) + if (findloop_is_loop_edge(fls, u, v)) + GRID(state,x,y) |= G_WARN; } } } - return loop; + + findloop_free_state(fls); + return ret; } static void map_group(game_state *state) @@ -1735,7 +1718,7 @@ static int solve_from_scratch(game_state *state, int difficulty) /* --- New game functions --- */ -static game_state *new_state(game_params *params) +static game_state *new_state(const game_params *params) { game_state *ret = snew(game_state); int wh = params->w * params->h, i; @@ -1748,8 +1731,6 @@ static game_state *new_state(game_params *params) ret->grid = snewn(wh, grid_type); memset(ret->grid, 0, GRIDSZ(ret)); - ret->scratch = snewn(wh, grid_type); - memset(ret->scratch, 0, GRIDSZ(ret)); ret->wha = snewn(wh*N_WH_ARRAYS, char); memset(ret->wha, 0, wh*N_WH_ARRAYS*sizeof(char)); @@ -1781,7 +1762,7 @@ static game_state *new_state(game_params *params) return ret; } -static game_state *dup_game(game_state *state) +static game_state *dup_game(const game_state *state) { game_state *ret = snew(game_state); int wh = state->w*state->h; @@ -1794,8 +1775,6 @@ static game_state *dup_game(game_state *state) ret->grid = snewn(wh, grid_type); memcpy(ret->grid, state->grid, GRIDSZ(ret)); - ret->scratch = snewn(wh, grid_type); - memcpy(ret->scratch, state->scratch, GRIDSZ(ret)); ret->wha = snewn(wh*N_WH_ARRAYS, char); memcpy(ret->wha, state->wha, wh*N_WH_ARRAYS*sizeof(char)); @@ -1835,7 +1814,6 @@ static void free_game(game_state *state) sfree(state->wha); - sfree(state->scratch); sfree(state->grid); sfree(state); } @@ -1845,7 +1823,7 @@ static void free_game(game_state *state) #define ORDER(a,b) do { if (a < b) { int tmp=a; int a=b; int b=tmp; } } while(0) -static char *new_game_desc(game_params *params, random_state *rs, +static char *new_game_desc(const game_params *params, random_state *rs, char **aux, int interactive) { game_state *tobuild = NULL; @@ -2015,7 +1993,7 @@ generated: return ret; } -static char *validate_desc(game_params *params, char *desc) +static char *validate_desc(const game_params *params, const char *desc) { int i, wh = params->w * params->h; @@ -2034,7 +2012,7 @@ static char *validate_desc(game_params *params, char *desc) else if (!*desc) return "Game description shorter than expected"; else - return "Game description containers unexpected character"; + return "Game description contains unexpected character"; desc++; } if (*desc || i > wh) @@ -2043,7 +2021,7 @@ static char *validate_desc(game_params *params, char *desc) return NULL; } -static game_state *new_game_sub(game_params *params, char *desc) +static game_state *new_game_sub(const game_params *params, const char *desc) { game_state *state = new_state(params); int x, y, run = 0; @@ -2095,7 +2073,8 @@ static game_state *new_game_sub(game_params *params, char *desc) return state; } -static game_state *new_game(midend *me, game_params *params, char *desc) +static game_state *new_game(midend *me, const game_params *params, + const char *desc) { return new_game_sub(params, desc); } @@ -2118,7 +2097,7 @@ static char *ui_cancel_drag(game_ui *ui) return ""; } -static game_ui *new_ui(game_state *state) +static game_ui *new_ui(const game_state *state) { game_ui *ui = snew(game_ui); ui_cancel_drag(ui); @@ -2134,30 +2113,107 @@ static void free_ui(game_ui *ui) sfree(ui); } -static char *encode_ui(game_ui *ui) +static char *encode_ui(const game_ui *ui) { return NULL; } -static void decode_ui(game_ui *ui, char *encoding) +static void decode_ui(game_ui *ui, const char *encoding) { } -static void game_changed_state(game_ui *ui, game_state *oldstate, - game_state *newstate) +static void game_changed_state(game_ui *ui, const game_state *oldstate, + const game_state *newstate) { } struct game_drawstate { int tilesize; int w, h; - grid_type *grid; + unsigned long *grid, *newgrid; int *lv, *lh; int started, dragging; - int show_hints; }; -static char *update_drag_dst(game_state *state, game_ui *ui, +/* + * The contents of ds->grid are complicated, because of the circular + * islands which overlap their own grid square into neighbouring + * squares. An island square can contain pieces of the bridges in all + * directions, and conversely a bridge square can be intruded on by + * islands from any direction. + * + * So we define one group of flags describing what's important about + * an island, and another describing a bridge. Island squares' entries + * in ds->grid contain one of the former and four of the latter; bridge + * squares, four of the former and _two_ of the latter - because a + * horizontal and vertical 'bridge' can cross, when one of them is a + * 'no bridge here' pencil mark. + * + * Bridge flags need to indicate 0-4 actual bridges (3 bits), a 'no + * bridge' row of crosses, or a grey hint line; that's 7 + * possibilities, so 3 bits suffice. But then we also need to vary the + * colours: the bridges can turn COL_WARNING if they're part of a loop + * in no-loops mode, COL_HIGHLIGHT during a victory flash, or + * COL_SELECTED if they're the bridge the user is currently dragging, + * so that's 2 more bits for foreground colour. Also bridges can be + * backed by COL_MARK if they're locked by the user, so that's one + * more bit, making 6 bits per bridge direction. + * + * Island flags omit the actual island clue (it never changes during + * the game, so doesn't have to be stored in ds->grid to check against + * the previous version), so they just need to include 2 bits for + * foreground colour (an island can be normal, COL_HIGHLIGHT during + * victory, COL_WARNING if its clue is unsatisfiable, or COL_SELECTED + * if it's part of the user's drag) and 2 bits for background (normal, + * COL_MARK for a locked island, COL_CURSOR for the keyboard cursor). + * That's 4 bits per island direction. We must also indicate whether + * no island is present at all (in the case where the island is + * potentially intruding into the side of a line square), which we do + * using the unused 4th value of the background field. + * + * So an island square needs 4 + 4*6 = 28 bits, while a bridge square + * needs 4*4 + 2*6 = 28 bits too. Both only just fit in 32 bits, which + * is handy, because otherwise we'd have to faff around forever with + * little structs! + */ +/* Flags for line data */ +#define DL_COUNTMASK 0x07 +#define DL_COUNT_CROSS 0x06 +#define DL_COUNT_HINT 0x07 +#define DL_COLMASK 0x18 +#define DL_COL_NORMAL 0x00 +#define DL_COL_WARNING 0x08 +#define DL_COL_FLASH 0x10 +#define DL_COL_SELECTED 0x18 +#define DL_LOCK 0x20 +#define DL_MASK 0x3F +/* Flags for island data */ +#define DI_COLMASK 0x03 +#define DI_COL_NORMAL 0x00 +#define DI_COL_FLASH 0x01 +#define DI_COL_WARNING 0x02 +#define DI_COL_SELECTED 0x03 +#define DI_BGMASK 0x0C +#define DI_BG_NO_ISLAND 0x00 +#define DI_BG_NORMAL 0x04 +#define DI_BG_MARK 0x08 +#define DI_BG_CURSOR 0x0C +#define DI_MASK 0x0F +/* Shift counts for the format of a 32-bit word in an island square */ +#define D_I_ISLAND_SHIFT 0 +#define D_I_LINE_SHIFT_L 4 +#define D_I_LINE_SHIFT_R 10 +#define D_I_LINE_SHIFT_U 16 +#define D_I_LINE_SHIFT_D 24 +/* Shift counts for the format of a 32-bit word in a line square */ +#define D_L_ISLAND_SHIFT_L 0 +#define D_L_ISLAND_SHIFT_R 4 +#define D_L_ISLAND_SHIFT_U 8 +#define D_L_ISLAND_SHIFT_D 12 +#define D_L_LINE_SHIFT_H 16 +#define D_L_LINE_SHIFT_V 22 + +static char *update_drag_dst(const game_state *state, game_ui *ui, const game_drawstate *ds, int nx, int ny) { int ox, oy, dx, dy, i, currl, maxb; @@ -2229,7 +2285,7 @@ static char *update_drag_dst(game_state *state, game_ui *ui, return ""; } -static char *finish_drag(game_state *state, game_ui *ui) +static char *finish_drag(const game_state *state, game_ui *ui) { char buf[80]; @@ -2253,24 +2309,29 @@ static char *finish_drag(game_state *state, game_ui *ui) return dupstr(buf); } -static char *interpret_move(game_state *state, game_ui *ui, const game_drawstate *ds, - int x, int y, int button) +static char *interpret_move(const game_state *state, game_ui *ui, + const game_drawstate *ds, + int x, int y, int button) { int gx = FROMCOORD(x), gy = FROMCOORD(y); char buf[80], *ret; grid_type ggrid = INGRID(state,gx,gy) ? GRID(state,gx,gy) : 0; + int shift = button & MOD_SHFT, control = button & MOD_CTRL; + button &= ~MOD_MASK; if (button == LEFT_BUTTON || button == RIGHT_BUTTON) { if (!INGRID(state, gx, gy)) return NULL; ui->cur_visible = 0; - if ((ggrid & G_ISLAND) && !(ggrid & G_MARK)) { + if (ggrid & G_ISLAND) { ui->dragx_src = gx; ui->dragy_src = gy; return ""; } else return ui_cancel_drag(ui); } else if (button == LEFT_DRAG || button == RIGHT_DRAG) { - if (gx != ui->dragx_src || gy != ui->dragy_src) { + if (INGRID(state, ui->dragx_src, ui->dragy_src) + && (gx != ui->dragx_src || gy != ui->dragy_src) + && !(GRID(state,ui->dragx_src,ui->dragy_src) & G_MARK)) { ui->dragging = 1; ui->drag_is_noline = (button == RIGHT_DRAG) ? 1 : 0; return update_drag_dst(state, ui, ds, x, y); @@ -2284,6 +2345,10 @@ static char *interpret_move(game_state *state, game_ui *ui, const game_drawstate if (ui->dragging) { return finish_drag(state, ui); } else { + if (!INGRID(state, ui->dragx_src, ui->dragy_src) + || gx != ui->dragx_src || gy != ui->dragy_src) { + return ui_cancel_drag(ui); + } ui_cancel_drag(ui); if (!INGRID(state, gx, gy)) return NULL; if (!(GRID(state, gx, gy) & G_ISLAND)) return NULL; @@ -2298,10 +2363,18 @@ static char *interpret_move(game_state *state, game_ui *ui, const game_drawstate return ret; } else if (IS_CURSOR_MOVE(button)) { ui->cur_visible = 1; + if (control || shift) { + ui->dragx_src = ui->cur_x; + ui->dragy_src = ui->cur_y; + ui->dragging = TRUE; + ui->drag_is_noline = !control; + } if (ui->dragging) { int nx = ui->cur_x, ny = ui->cur_y; move_cursor(button, &nx, &ny, state->w, state->h, 0); + if (nx == ui->cur_x && ny == ui->cur_y) + return NULL; update_drag_dst(state, ui, ds, COORD(nx)+TILE_SIZE/2, COORD(ny)+TILE_SIZE/2); @@ -2365,7 +2438,7 @@ found: ui->cur_visible = 1; return ""; } - if (ui->dragging) { + if (ui->dragging || button == CURSOR_SELECT2) { ui_cancel_drag(ui); if (ui->dragx_dst == -1 && ui->dragy_dst == -1) { sprintf(buf, "M%d,%d", ui->cur_x, ui->cur_y); @@ -2383,6 +2456,51 @@ found: return ""; } } + } else if ((button >= '0' && button <= '9') || + (button >= 'a' && button <= 'f') || + (button >= 'A' && button <= 'F')) { + /* jump to island with .count == number closest to cur_{x,y} */ + int best_x = -1, best_y = -1, best_sqdist = -1, number = -1, i; + + if (button >= '0' && button <= '9') + number = (button == '0' ? 16 : button - '0'); + else if (button >= 'a' && button <= 'f') + number = 10 + button - 'a'; + else if (button >= 'A' && button <= 'F') + number = 10 + button - 'A'; + + if (!ui->cur_visible) { + ui->cur_visible = 1; + return ""; + } + + for (i = 0; i < state->n_islands; ++i) { + int x = state->islands[i].x, y = state->islands[i].y; + int dx = x - ui->cur_x, dy = y - ui->cur_y; + int sqdist = dx*dx + dy*dy; + + if (state->islands[i].count != number) + continue; + if (x == ui->cur_x && y == ui->cur_y) + continue; + + /* new_game() reads the islands in row-major order, so by + * breaking ties in favor of `first in state->islands' we + * also break ties by `lexicographically smallest (y, x)'. + * Thus, there's a stable pattern to how ties are broken + * which the user can learn and use to navigate faster. */ + if (best_sqdist == -1 || sqdist < best_sqdist) { + best_x = x; + best_y = y; + best_sqdist = sqdist; + } + } + if (best_x != -1 && best_y != -1) { + ui->cur_x = best_x; + ui->cur_y = best_y; + return ""; + } else + return NULL; } else if (button == 'g' || button == 'G') { ui->show_hints = 1 - ui->show_hints; return ""; @@ -2391,7 +2509,7 @@ found: return NULL; } -static game_state *execute_move(game_state *state, char *move) +static game_state *execute_move(const game_state *state, const char *move) { game_state *ret = dup_game(state); int x1, y1, x2, y2, nl, n; @@ -2458,8 +2576,8 @@ badmove: return NULL; } -static char *solve_game(game_state *state, game_state *currstate, - char *aux, char **error) +static char *solve_game(const game_state *state, const game_state *currstate, + const char *aux, char **error) { char *ret; game_state *solved; @@ -2490,8 +2608,8 @@ static char *solve_game(game_state *state, game_state *currstate, * Drawing routines. */ -static void game_compute_size(game_params *params, int tilesize, - int *x, int *y) +static void game_compute_size(const game_params *params, int tilesize, + int *x, int *y) { /* Ick: fake up `ds->tilesize' for macro expansion purposes */ struct { int tilesize; } ads, *ds = &ads; @@ -2502,7 +2620,7 @@ static void game_compute_size(game_params *params, int tilesize, } static void game_set_size(drawing *dr, game_drawstate *ds, - game_params *params, int tilesize) + const game_params *params, int tilesize) { ds->tilesize = tilesize; } @@ -2537,22 +2655,25 @@ static float *game_colours(frontend *fe, int *ncolours) return ret; } -static game_drawstate *game_new_drawstate(drawing *dr, game_state *state) +static game_drawstate *game_new_drawstate(drawing *dr, const game_state *state) { struct game_drawstate *ds = snew(struct game_drawstate); int wh = state->w*state->h; + int i; ds->tilesize = 0; ds->w = state->w; ds->h = state->h; ds->started = 0; - ds->grid = snewn(wh, grid_type); - memset(ds->grid, -1, wh*sizeof(grid_type)); + ds->dragging = 0; + ds->grid = snewn(wh, unsigned long); + for (i = 0; i < wh; i++) + ds->grid[i] = ~0UL; + ds->newgrid = snewn(wh, unsigned long); ds->lv = snewn(wh, int); ds->lh = snewn(wh, int); memset(ds->lv, 0, wh*sizeof(int)); memset(ds->lh, 0, wh*sizeof(int)); - ds->show_hints = 0; return ds; } @@ -2561,6 +2682,7 @@ static void game_free_drawstate(drawing *dr, game_drawstate *ds) { sfree(ds->lv); sfree(ds->lh); + sfree(ds->newgrid); sfree(ds->grid); sfree(ds); } @@ -2570,41 +2692,8 @@ static void game_free_drawstate(drawing *dr, game_drawstate *ds) #define OFFSET(thing) ((TILE_SIZE/2) - ((thing)/2)) -static void lines_vert(drawing *dr, game_drawstate *ds, - int ox, int oy, int lv, int col, grid_type v) -{ - int lw = LINE_WIDTH, gw = LINE_WIDTH, bw, i, loff; - while ((bw = lw * lv + gw * (lv+1)) > TILE_SIZE) - gw--; - loff = OFFSET(bw); - if (v & G_MARKV) - draw_rect(dr, ox + loff, oy, bw, TILE_SIZE, COL_MARK); - for (i = 0; i < lv; i++, loff += lw + gw) - draw_rect(dr, ox + loff + gw, oy, lw, TILE_SIZE, col); -} - -static void lines_horiz(drawing *dr, game_drawstate *ds, - int ox, int oy, int lh, int col, grid_type v) -{ - int lw = LINE_WIDTH, gw = LINE_WIDTH, bw, i, loff; - while ((bw = lw * lh + gw * (lh+1)) > TILE_SIZE) - gw--; - loff = OFFSET(bw); - if (v & G_MARKH) - draw_rect(dr, ox, oy + loff, TILE_SIZE, bw, COL_MARK); - for (i = 0; i < lh; i++, loff += lw + gw) - draw_rect(dr, ox, oy + loff + gw, TILE_SIZE, lw, col); -} - -static void line_cross(drawing *dr, game_drawstate *ds, - int ox, int oy, int col, grid_type v) -{ - int off = TS8(2); - draw_line(dr, ox, oy, ox+off, oy+off, col); - draw_line(dr, ox+off, oy, ox, oy+off, col); -} - -static int between_island(game_state *state, int sx, int sy, int dx, int dy) +static int between_island(const game_state *state, int sx, int sy, + int dx, int dy) { int x = sx - dx, y = sy - dy; @@ -2622,8 +2711,8 @@ found: return 0; } -static void lines_lvlh(game_state *state, game_ui *ui, int x, int y, grid_type v, - int *lv_r, int *lh_r) +static void lines_lvlh(const game_state *state, const game_ui *ui, + int x, int y, grid_type v, int *lv_r, int *lh_r) { int lh = 0, lv = 0; @@ -2638,120 +2727,234 @@ static void lines_lvlh(game_state *state, game_ui *ui, int x, int y, grid_type v *lv_r = lv; *lh_r = lh; } -static void dsf_debug_draw(drawing *dr, - game_state *state, game_drawstate *ds, - int x, int y) +static void draw_cross(drawing *dr, game_drawstate *ds, + int ox, int oy, int col) { -#ifdef DRAW_DSF - int ts = TILE_SIZE/2; - int ox = COORD(x) + ts/2, oy = COORD(y) + ts/2; - char str[32]; - - sprintf(str, "%d", dsf_canonify(state->solver->dsf, DINDEX(x,y))); - draw_text(dr, ox, oy, FONT_VARIABLE, ts, - ALIGN_VCENTRE | ALIGN_HCENTRE, COL_WARNING, str); -#endif + int off = TS8(2); + draw_line(dr, ox, oy, ox+off, oy+off, col); + draw_line(dr, ox+off, oy, ox, oy+off, col); } -static void lines_redraw(drawing *dr, - game_state *state, game_drawstate *ds, game_ui *ui, - int x, int y, grid_type v, int lv, int lh) +static void draw_general_line(drawing *dr, game_drawstate *ds, + int ox, int oy, int fx, int fy, int ax, int ay, + int len, unsigned long ldata, int which) { - int ox = COORD(x), oy = COORD(y); - int vcol = (v & G_FLASH) ? COL_HIGHLIGHT : - (v & G_WARN) ? COL_WARNING : COL_FOREGROUND, hcol = vcol; - grid_type todraw = v & G_NOLINE; + /* + * Draw one direction of lines in a square. To permit the same + * code to handle horizontal and vertical lines, fx,fy are the + * 'forward' direction (along the lines) and ax,ay are the + * 'across' direction. + * + * We draw the white background for a locked bridge if (which & + * 1), and draw the bridges themselves if (which & 2). This + * permits us to get two overlapping locked bridges right without + * one of them erasing part of the other. + */ + int fg; - if (v & G_ISSEL) { - if (ui->todraw & G_FLAGSH) hcol = COL_SELECTED; - if (ui->todraw & G_FLAGSV) vcol = COL_SELECTED; - todraw |= ui->todraw; - } + fg = ((ldata & DL_COUNTMASK) == DL_COUNT_HINT ? COL_HINT : + (ldata & DL_COLMASK) == DL_COL_SELECTED ? COL_SELECTED : + (ldata & DL_COLMASK) == DL_COL_FLASH ? COL_HIGHLIGHT : + (ldata & DL_COLMASK) == DL_COL_WARNING ? COL_WARNING : + COL_FOREGROUND); - draw_rect(dr, ox, oy, TILE_SIZE, TILE_SIZE, COL_BACKGROUND); - /*if (v & G_CURSOR) - draw_rect(dr, ox+TILE_SIZE/4, oy+TILE_SIZE/4, - TILE_SIZE/2, TILE_SIZE/2, COL_CURSOR);*/ + if ((ldata & DL_COUNTMASK) == DL_COUNT_CROSS) { + draw_cross(dr, ds, + ox + TS8(1)*fx + TS8(3)*ax, + oy + TS8(1)*fy + TS8(3)*ay, fg); + draw_cross(dr, ds, + ox + TS8(5)*fx + TS8(3)*ax, + oy + TS8(5)*fy + TS8(3)*ay, fg); + } else if ((ldata & DL_COUNTMASK) != 0) { + int lh, lw, gw, bw, i, loff; + lh = (ldata & DL_COUNTMASK); + if (lh == DL_COUNT_HINT) + lh = 1; - if (ui->show_hints) { - if (between_island(state, x, y, 0, 1) && !(v & G_LINEV)) - vcol = COL_HINT; - if (between_island(state, x, y, 1, 0) && !(v & G_LINEH)) - hcol = COL_HINT; - } -#ifdef DRAW_GRID - draw_rect_outline(dr, ox, oy, TILE_SIZE, TILE_SIZE, COL_GRID); -#endif + lw = gw = LINE_WIDTH; + while ((bw = lw * lh + gw * (lh+1)) > TILE_SIZE) + gw--; - if (todraw & G_NOLINEV) { - line_cross(dr, ds, ox + TS8(3), oy + TS8(1), vcol, todraw); - line_cross(dr, ds, ox + TS8(3), oy + TS8(5), vcol, todraw); - } - if (todraw & G_NOLINEH) { - line_cross(dr, ds, ox + TS8(1), oy + TS8(3), hcol, todraw); - line_cross(dr, ds, ox + TS8(5), oy + TS8(3), hcol, todraw); + loff = OFFSET(bw); + + if (which & 1) { + if ((ldata & DL_LOCK) && fg != COL_HINT) + draw_rect(dr, ox + loff*ax, oy + loff*ay, + len*fx+bw*ax, len*fy+bw*ay, COL_MARK); + } + if (which & 2) { + for (i = 0; i < lh; i++, loff += lw + gw) + draw_rect(dr, ox + (loff+gw)*ax, oy + (loff+gw)*ay, + len*fx+lw*ax, len*fy+lw*ay, fg); + } } - /* if we're drawing a real line and a hint, make sure we draw the real - * line on top. */ - if (lv && vcol == COL_HINT) lines_vert(dr, ds, ox, oy, lv, vcol, v); - if (lh) lines_horiz(dr, ds, ox, oy, lh, hcol, v); - if (lv && vcol != COL_HINT) lines_vert(dr, ds, ox, oy, lv, vcol, v); +} - dsf_debug_draw(dr, state, ds, x, y); - draw_update(dr, ox, oy, TILE_SIZE, TILE_SIZE); +static void draw_hline(drawing *dr, game_drawstate *ds, + int ox, int oy, int w, unsigned long vdata, int which) +{ + draw_general_line(dr, ds, ox, oy, 1, 0, 0, 1, w, vdata, which); +} + +static void draw_vline(drawing *dr, game_drawstate *ds, + int ox, int oy, int h, unsigned long vdata, int which) +{ + draw_general_line(dr, ds, ox, oy, 0, 1, 1, 0, h, vdata, which); } #define ISLAND_RADIUS ((TILE_SIZE*12)/20) -#define ISLAND_NUMSIZE(is) \ - (((is)->count < 10) ? (TILE_SIZE*7)/10 : (TILE_SIZE*5)/10) - -static void island_redraw(drawing *dr, - game_state *state, game_drawstate *ds, - struct island *is, grid_type v) -{ - /* These overlap the edges of their squares, which is why they're drawn later. - * We know they can't overlap each other because they're not allowed within 2 - * squares of each other. */ - int half = TILE_SIZE/2; - int ox = COORD(is->x) + half, oy = COORD(is->y) + half; - int orad = ISLAND_RADIUS, irad = orad - LINE_WIDTH; - int updatesz = orad*2+1; - int tcol = (v & G_FLASH) ? COL_HIGHLIGHT : - (v & G_WARN) ? COL_WARNING : COL_FOREGROUND; - int col = (v & G_ISSEL) ? COL_SELECTED : tcol; - int bg = (v & G_CURSOR) ? COL_CURSOR : - (v & G_MARK) ? COL_MARK : COL_BACKGROUND; - char str[32]; +#define ISLAND_NUMSIZE(clue) \ + (((clue) < 10) ? (TILE_SIZE*7)/10 : (TILE_SIZE*5)/10) -#ifdef DRAW_GRID - draw_rect_outline(dr, COORD(is->x), COORD(is->y), - TILE_SIZE, TILE_SIZE, COL_GRID); -#endif +static void draw_island(drawing *dr, game_drawstate *ds, + int ox, int oy, int clue, unsigned long idata) +{ + int half, orad, irad, fg, bg; + + if ((idata & DI_BGMASK) == DI_BG_NO_ISLAND) + return; + + half = TILE_SIZE/2; + orad = ISLAND_RADIUS; + irad = orad - LINE_WIDTH; + fg = ((idata & DI_COLMASK) == DI_COL_SELECTED ? COL_SELECTED : + (idata & DI_COLMASK) == DI_COL_WARNING ? COL_WARNING : + (idata & DI_COLMASK) == DI_COL_FLASH ? COL_HIGHLIGHT : + COL_FOREGROUND); + bg = ((idata & DI_BGMASK) == DI_BG_CURSOR ? COL_CURSOR : + (idata & DI_BGMASK) == DI_BG_MARK ? COL_MARK : + COL_BACKGROUND); /* draw a thick circle */ - draw_circle(dr, ox, oy, orad, col, col); - draw_circle(dr, ox, oy, irad, bg, bg); + draw_circle(dr, ox+half, oy+half, orad, fg, fg); + draw_circle(dr, ox+half, oy+half, irad, bg, bg); + + if (clue > 0) { + char str[32]; + int textcolour = (fg == COL_SELECTED ? COL_FOREGROUND : fg); + sprintf(str, "%d", clue); + draw_text(dr, ox+half, oy+half, FONT_VARIABLE, ISLAND_NUMSIZE(clue), + ALIGN_VCENTRE | ALIGN_HCENTRE, textcolour, str); + } +} + +static void draw_island_tile(drawing *dr, game_drawstate *ds, + int x, int y, int clue, unsigned long data) +{ + int ox = COORD(x), oy = COORD(y); + int which; + + clip(dr, ox, oy, TILE_SIZE, TILE_SIZE); + draw_rect(dr, ox, oy, TILE_SIZE, TILE_SIZE, COL_BACKGROUND); + + /* + * Because of the possibility of incoming bridges just about + * meeting at one corner, we must split the line-drawing into + * background and foreground segments. + */ + for (which = 1; which <= 2; which <<= 1) { + draw_hline(dr, ds, ox, oy, TILE_SIZE/2, + (data >> D_I_LINE_SHIFT_L) & DL_MASK, which); + draw_hline(dr, ds, ox + TILE_SIZE - TILE_SIZE/2, oy, TILE_SIZE/2, + (data >> D_I_LINE_SHIFT_R) & DL_MASK, which); + draw_vline(dr, ds, ox, oy, TILE_SIZE/2, + (data >> D_I_LINE_SHIFT_U) & DL_MASK, which); + draw_vline(dr, ds, ox, oy + TILE_SIZE - TILE_SIZE/2, TILE_SIZE/2, + (data >> D_I_LINE_SHIFT_D) & DL_MASK, which); + } + draw_island(dr, ds, ox, oy, clue, (data >> D_I_ISLAND_SHIFT) & DI_MASK); + + unclip(dr); + draw_update(dr, ox, oy, TILE_SIZE, TILE_SIZE); +} + +static void draw_line_tile(drawing *dr, game_drawstate *ds, + int x, int y, unsigned long data) +{ + int ox = COORD(x), oy = COORD(y); + unsigned long hdata, vdata; + + clip(dr, ox, oy, TILE_SIZE, TILE_SIZE); + draw_rect(dr, ox, oy, TILE_SIZE, TILE_SIZE, COL_BACKGROUND); + + /* + * We have to think about which of the horizontal and vertical + * line to draw first, if both exist. + * + * The rule is that hint lines are drawn at the bottom, then + * NOLINE crosses, then actual bridges. The enumeration in the + * DL_COUNTMASK field is set up so that this drops out of a + * straight comparison between the two. + * + * Since lines crossing in this type of square cannot both be + * actual bridges, there's no need to pass a nontrivial 'which' + * parameter to draw_[hv]line. + */ + hdata = (data >> D_L_LINE_SHIFT_H) & DL_MASK; + vdata = (data >> D_L_LINE_SHIFT_V) & DL_MASK; + if ((hdata & DL_COUNTMASK) > (vdata & DL_COUNTMASK)) { + draw_hline(dr, ds, ox, oy, TILE_SIZE, hdata, 3); + draw_vline(dr, ds, ox, oy, TILE_SIZE, vdata, 3); + } else { + draw_vline(dr, ds, ox, oy, TILE_SIZE, vdata, 3); + draw_hline(dr, ds, ox, oy, TILE_SIZE, hdata, 3); + } + + /* + * The islands drawn at the edges of a line tile don't need clue + * numbers. + */ + draw_island(dr, ds, ox - TILE_SIZE, oy, -1, + (data >> D_L_ISLAND_SHIFT_L) & DI_MASK); + draw_island(dr, ds, ox + TILE_SIZE, oy, -1, + (data >> D_L_ISLAND_SHIFT_R) & DI_MASK); + draw_island(dr, ds, ox, oy - TILE_SIZE, -1, + (data >> D_L_ISLAND_SHIFT_U) & DI_MASK); + draw_island(dr, ds, ox, oy + TILE_SIZE, -1, + (data >> D_L_ISLAND_SHIFT_D) & DI_MASK); + + unclip(dr); + draw_update(dr, ox, oy, TILE_SIZE, TILE_SIZE); +} + +static void draw_edge_tile(drawing *dr, game_drawstate *ds, + int x, int y, int dx, int dy, unsigned long data) +{ + int ox = COORD(x), oy = COORD(y); + int cx = ox, cy = oy, cw = TILE_SIZE, ch = TILE_SIZE; + + if (dy) { + if (dy > 0) + cy += TILE_SIZE/2; + ch -= TILE_SIZE/2; + } else { + if (dx > 0) + cx += TILE_SIZE/2; + cw -= TILE_SIZE/2; + } + clip(dr, cx, cy, cw, ch); + draw_rect(dr, cx, cy, cw, ch, COL_BACKGROUND); - sprintf(str, "%d", is->count); - draw_text(dr, ox, oy, FONT_VARIABLE, ISLAND_NUMSIZE(is), - ALIGN_VCENTRE | ALIGN_HCENTRE, tcol, str); + draw_island(dr, ds, ox + TILE_SIZE*dx, oy + TILE_SIZE*dy, -1, + (data >> D_I_ISLAND_SHIFT) & DI_MASK); - dsf_debug_draw(dr, state, ds, is->x, is->y); - draw_update(dr, ox - orad, oy - orad, updatesz, updatesz); + unclip(dr); + draw_update(dr, cx, cy, cw, ch); } -static void game_redraw(drawing *dr, game_drawstate *ds, game_state *oldstate, - game_state *state, int dir, game_ui *ui, - float animtime, float flashtime) +static void game_redraw(drawing *dr, game_drawstate *ds, + const game_state *oldstate, const game_state *state, + int dir, const game_ui *ui, + float animtime, float flashtime) { - int x, y, force = 0, i, j, redraw, lv, lh; - grid_type v, dsv, flash = 0; + int x, y, lv, lh; + grid_type v, flash = 0; struct island *is, *is_drag_src = NULL, *is_drag_dst = NULL; if (flashtime) { int f = (int)(flashtime * 5 / FLASH_TIME); - if (f == 1 || f == 3) flash = G_FLASH; + if (f == 1 || f == 3) flash = TRUE; } /* Clear screen, if required. */ @@ -2769,7 +2972,6 @@ static void game_redraw(drawing *dr, game_drawstate *ds, game_state *oldstate, TILE_SIZE * ds->w + 2 * BORDER, TILE_SIZE * ds->h + 2 * BORDER); ds->started = 1; - force = 1; } if (ui->dragx_src != -1 && ui->dragy_src != -1) { @@ -2783,81 +2985,157 @@ static void game_redraw(drawing *dr, game_drawstate *ds, game_state *oldstate, } else ds->dragging = 0; - if (ui->show_hints != ds->show_hints) { - force = 1; - ds->show_hints = ui->show_hints; - } + /* + * Set up ds->newgrid with the current grid contents. + */ + for (x = 0; x < ds->w; x++) + for (y = 0; y < ds->h; y++) + INDEX(ds,newgrid,x,y) = 0; - /* Draw all lines (and hints, if we want), but *not* islands. */ for (x = 0; x < ds->w; x++) { for (y = 0; y < ds->h; y++) { - v = GRID(state, x, y) | flash; - dsv = GRID(ds,x,y) & ~G_REDRAW; + v = GRID(state, x, y); - if (v & G_ISLAND) continue; + if (v & G_ISLAND) { + /* + * An island square. Compute the drawing data for the + * island, and put it in this square and surrounding + * squares. + */ + unsigned long idata = 0; + + is = INDEX(state, gridi, x, y); + + if (flash) + idata |= DI_COL_FLASH; + if (is_drag_src && (is == is_drag_src || + (is_drag_dst && is == is_drag_dst))) + idata |= DI_COL_SELECTED; + else if (island_impossible(is, v & G_MARK) || (v & G_WARN)) + idata |= DI_COL_WARNING; + else + idata |= DI_COL_NORMAL; - if (is_drag_dst) { - if (WITHIN(x,is_drag_src->x, is_drag_dst->x) && - WITHIN(y,is_drag_src->y, is_drag_dst->y)) - v |= G_ISSEL; + if (ui->cur_visible && + ui->cur_x == is->x && ui->cur_y == is->y) + idata |= DI_BG_CURSOR; + else if (v & G_MARK) + idata |= DI_BG_MARK; + else + idata |= DI_BG_NORMAL; + + INDEX(ds,newgrid,x,y) |= idata << D_I_ISLAND_SHIFT; + if (x > 0 && !(GRID(state,x-1,y) & G_ISLAND)) + INDEX(ds,newgrid,x-1,y) |= idata << D_L_ISLAND_SHIFT_R; + if (x+1 < state->w && !(GRID(state,x+1,y) & G_ISLAND)) + INDEX(ds,newgrid,x+1,y) |= idata << D_L_ISLAND_SHIFT_L; + if (y > 0 && !(GRID(state,x,y-1) & G_ISLAND)) + INDEX(ds,newgrid,x,y-1) |= idata << D_L_ISLAND_SHIFT_D; + if (y+1 < state->h && !(GRID(state,x,y+1) & G_ISLAND)) + INDEX(ds,newgrid,x,y+1) |= idata << D_L_ISLAND_SHIFT_U; + } else { + unsigned long hdata, vdata; + int selh = FALSE, selv = FALSE; + + /* + * A line (non-island) square. Compute the drawing + * data for any horizontal and vertical lines in the + * square, and put them in this square's entry and + * optionally those for neighbouring islands too. + */ + + if (is_drag_dst && + WITHIN(x,is_drag_src->x, is_drag_dst->x) && + WITHIN(y,is_drag_src->y, is_drag_dst->y)) { + if (is_drag_src->x != is_drag_dst->x) + selh = TRUE; + else + selv = TRUE; + } + lines_lvlh(state, ui, x, y, v, &lv, &lh); + + hdata = (v & G_NOLINEH ? DL_COUNT_CROSS : + v & G_LINEH ? lh : + (ui->show_hints && + between_island(state,x,y,1,0)) ? DL_COUNT_HINT : 0); + vdata = (v & G_NOLINEV ? DL_COUNT_CROSS : + v & G_LINEV ? lv : + (ui->show_hints && + between_island(state,x,y,0,1)) ? DL_COUNT_HINT : 0); + + hdata |= (flash ? DL_COL_FLASH : + v & G_WARN ? DL_COL_WARNING : + selh ? DL_COL_SELECTED : + DL_COL_NORMAL); + vdata |= (flash ? DL_COL_FLASH : + v & G_WARN ? DL_COL_WARNING : + selv ? DL_COL_SELECTED : + DL_COL_NORMAL); + + if (v & G_MARKH) + hdata |= DL_LOCK; + if (v & G_MARKV) + vdata |= DL_LOCK; + + INDEX(ds,newgrid,x,y) |= hdata << D_L_LINE_SHIFT_H; + INDEX(ds,newgrid,x,y) |= vdata << D_L_LINE_SHIFT_V; + if (x > 0 && (GRID(state,x-1,y) & G_ISLAND)) + INDEX(ds,newgrid,x-1,y) |= hdata << D_I_LINE_SHIFT_R; + if (x+1 < state->w && (GRID(state,x+1,y) & G_ISLAND)) + INDEX(ds,newgrid,x+1,y) |= hdata << D_I_LINE_SHIFT_L; + if (y > 0 && (GRID(state,x,y-1) & G_ISLAND)) + INDEX(ds,newgrid,x,y-1) |= vdata << D_I_LINE_SHIFT_D; + if (y+1 < state->h && (GRID(state,x,y+1) & G_ISLAND)) + INDEX(ds,newgrid,x,y+1) |= vdata << D_I_LINE_SHIFT_U; } - lines_lvlh(state, ui, x, y, v, &lv, &lh); - - /*if (ui->cur_visible && ui->cur_x == x && ui->cur_y == y) - v |= G_CURSOR;*/ - - if (v != dsv || - lv != INDEX(ds,lv,x,y) || - lh != INDEX(ds,lh,x,y) || - force) { - GRID(ds, x, y) = v | G_REDRAW; - INDEX(ds,lv,x,y) = lv; - INDEX(ds,lh,x,y) = lh; - lines_redraw(dr, state, ds, ui, x, y, v, lv, lh); - } else - GRID(ds,x,y) &= ~G_REDRAW; } } - /* Draw islands. */ - for (i = 0; i < state->n_islands; i++) { - is = &state->islands[i]; - v = GRID(state, is->x, is->y) | flash; - - redraw = 0; - for (j = 0; j < is->adj.npoints; j++) { - if (GRID(ds,is->adj.points[j].x,is->adj.points[j].y) & G_REDRAW) { - redraw = 1; + /* + * Now go through and draw any changed grid square. + */ + for (x = 0; x < ds->w; x++) { + for (y = 0; y < ds->h; y++) { + unsigned long newval = INDEX(ds,newgrid,x,y); + if (INDEX(ds,grid,x,y) != newval) { + v = GRID(state, x, y); + if (v & G_ISLAND) { + is = INDEX(state, gridi, x, y); + draw_island_tile(dr, ds, x, y, is->count, newval); + + /* + * If this tile is right at the edge of the grid, + * we must also draw the part of the island that + * goes completely out of bounds. We don't bother + * keeping separate entries in ds->newgrid for + * these tiles; it's easier just to redraw them + * iff we redraw their parent island tile. + */ + if (x == 0) + draw_edge_tile(dr, ds, x-1, y, +1, 0, newval); + if (y == 0) + draw_edge_tile(dr, ds, x, y-1, 0, +1, newval); + if (x == state->w-1) + draw_edge_tile(dr, ds, x+1, y, -1, 0, newval); + if (y == state->h-1) + draw_edge_tile(dr, ds, x, y+1, 0, -1, newval); + } else { + draw_line_tile(dr, ds, x, y, newval); + } + INDEX(ds,grid,x,y) = newval; } } - - if (is_drag_src) { - if (is == is_drag_src) - v |= G_ISSEL; - else if (is_drag_dst && is == is_drag_dst) - v |= G_ISSEL; - } - - if (island_impossible(is, v & G_MARK)) v |= G_WARN; - - if (ui->cur_visible && ui->cur_x == is->x && ui->cur_y == is->y) - v |= G_CURSOR; - - if ((v != GRID(ds, is->x, is->y)) || force || redraw) { - GRID(ds,is->x,is->y) = v; - island_redraw(dr, state, ds, is, v); - } } } -static float game_anim_length(game_state *oldstate, game_state *newstate, - int dir, game_ui *ui) +static float game_anim_length(const game_state *oldstate, + const game_state *newstate, int dir, game_ui *ui) { return 0.0F; } -static float game_flash_length(game_state *oldstate, game_state *newstate, - int dir, game_ui *ui) +static float game_flash_length(const game_state *oldstate, + const game_state *newstate, int dir, game_ui *ui) { if (!oldstate->completed && newstate->completed && !oldstate->solved && !newstate->solved) @@ -2866,17 +3144,17 @@ static float game_flash_length(game_state *oldstate, game_state *newstate, return 0.0F; } -static int game_status(game_state *state) +static int game_status(const game_state *state) { return state->completed ? +1 : 0; } -static int game_timing_state(game_state *state, game_ui *ui) +static int game_timing_state(const game_state *state, game_ui *ui) { return TRUE; } -static void game_print_size(game_params *params, float *x, float *y) +static void game_print_size(const game_params *params, float *x, float *y) { int pw, ph; @@ -2886,7 +3164,7 @@ static void game_print_size(game_params *params, float *x, float *y) *y = ph / 100.0F; } -static void game_print(drawing *dr, game_state *state, int ts) +static void game_print(drawing *dr, const game_state *state, int ts) { int ink = print_mono_colour(dr, 0); int paper = print_mono_colour(dr, 1); @@ -2934,7 +3212,7 @@ static void game_print(drawing *dr, game_state *state, int ts) draw_circle(dr, cx, cy, ISLAND_RADIUS, paper, ink); sprintf(str, "%d", is->count); - draw_text(dr, cx, cy, FONT_VARIABLE, ISLAND_NUMSIZE(is), + draw_text(dr, cx, cy, FONT_VARIABLE, ISLAND_NUMSIZE(is->count), ALIGN_VCENTRE | ALIGN_HCENTRE, ink, str); } } @@ -2946,7 +3224,7 @@ static void game_print(drawing *dr, game_state *state, int ts) const struct game thegame = { "Bridges", "games.bridges", "bridges", default_params, - game_fetch_preset, + game_fetch_preset, NULL, decode_params, encode_params, free_params,