summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
aa0ff41)
Currently just printing to stdout, no yet providing graphical verification.
{
tile_t *tiles[MAX_TILES];
int num_tiles;
{
tile_t *tiles[MAX_TILES];
int num_tiles;
+ char guess[MAX_TILES+1];
} rack_t;
static rack_t the_rack;
} rack_t;
static rack_t the_rack;
-rack_init (rack_t *rack, GooCanvasItem *parent, char *word)
+rack_init (rack_t *rack, GooCanvasItem *parent, char *word, dict_t *solution)
while (i < MAX_TILES)
rack->tiles[i] = NULL;
rack->guess_length = 0;
while (i < MAX_TILES)
rack->tiles[i] = NULL;
rack->guess_length = 0;
+ rack->solution = solution;
tile_glide_to (tile, x, y);
tile->guessed = FALSE;
rack->guess_length--;
tile_glide_to (tile, x, y);
tile->guessed = FALSE;
rack->guess_length--;
+ rack->guess[rack->guess_length] = '\0';
rack_return_tile (rack, rack->tiles[i]);
}
rack->guess_length = 0;
rack_return_tile (rack, rack->tiles[i]);
}
rack->guess_length = 0;
rack_t *rack = user_data;
if (event->keyval == GDK_Return) {
rack_t *rack = user_data;
if (event->keyval == GDK_Return) {
+ dict_entry_t *entry;
+ entry = dict_lookup (rack->solution, rack->guess);
+ if (DICT_ENTRY_IS_WORD (entry))
+ printf ("%s is good\n", rack->guess);
+ else
+ printf ("%s is not a word\n", rack->guess);
rack_return_all (rack);
return TRUE;
}
rack_return_all (rack);
return TRUE;
}
tile_glide_to (rack->tiles[i], x, y);
rack->tiles[i]->guessed = TRUE;
rack->guess[rack->guess_length++] = guess_letter;
tile_glide_to (rack->tiles[i], x, y);
rack->tiles[i]->guessed = TRUE;
rack->guess[rack->guess_length++] = guess_letter;
+ rack->guess[rack->guess_length] = '\0';
root = goo_canvas_get_root_item (GOO_CANVAS (canvas));
root = goo_canvas_get_root_item (GOO_CANVAS (canvas));
- rack_init (&the_rack, root, word);
+ rack_init (&the_rack, root, word, solution);
goo_demo_item_new (root,
LETTER_PAD,
goo_demo_item_new (root,
LETTER_PAD,