X-Git-Url: https://git.cworth.org/git?p=mnemon;a=blobdiff_plain;f=mnemon.c;h=737298ed045f4877765118845e2626050ec816bc;hp=e13d3b9ff9f707f458a8ca02ec5b0c31818922a9;hb=abd2230ad0fc47109cbc97a767b87e70f459b053;hpb=a6ba5c83f3b9f07411c5e281488ced3b354d2b53 diff --git a/mnemon.c b/mnemon.c index e13d3b9..737298e 100644 --- a/mnemon.c +++ b/mnemon.c @@ -385,6 +385,8 @@ mnemon_remove_bin (mnemon_t *mnemon, { int i = bin - mnemon->bins; + bin_fini (bin); + memmove (bin, bin + 1, (mnemon->num_bins - i) * sizeof (bin_t)); mnemon->num_bins--; } @@ -543,7 +545,7 @@ mnemon_save (mnemon_t *mnemon) err = rename (lock_filename, filename); if (err < 0) { - fprintf (stderr, "Error: Failes to rename %s to %s: %s\n", + fprintf (stderr, "Error: Failed to rename %s to %s: %s\n", lock_filename, filename, strerror (errno)); continue; } @@ -622,16 +624,46 @@ mnemon_select_item (mnemon_t *mnemon, } static void -mnemon_do_challenges (mnemon_t *mnemon) +mnemon_do_challenges (mnemon_t *mnemon, + int to_introduce) { bin_t *bin; int item_index; item_t *item; char *response; bool_t correct; + int unlearned; + int i; - while (1) { + /* Count the number of items with negative counts. */ + unlearned = 0; + for (i = 0; i < mnemon->num_bins; i++) { + bin = &mnemon->bins[i]; + if (bin->count >= 0) + break; + unlearned += bin->num_items; + } + + to_introduce -= unlearned; + if (to_introduce < 0) + to_introduce = 0; + + if (unlearned) { + printf ("You've got %d items to learn already. ", unlearned); + if (to_introduce) + printf ("I'll introduce %d more as we go.", to_introduce); + printf ("\n"); + } else { + printf ("Introducing %d new items.\n", to_introduce); + } + printf ("\n"); + + do { mnemon_select_item (mnemon, &bin, &item_index); + + if (bin->count == 0) + to_introduce--; + item = bin->items[item_index]; printf ("%s\n", item->challenge); @@ -645,24 +677,61 @@ mnemon_do_challenges (mnemon_t *mnemon) correct = (strcmp (response, item->response) == 0); bin_remove_item (bin, item_index); - if (bin->num_items == 0) + + /* If the bin is now empty, we must remove it. Also if we just + * picked the last word we'll ever pick from the bin with + * count 0, then we can remove that as well. */ + if (bin->num_items == 0 || + (bin->count == 0 && to_introduce == 0)) + { mnemon_remove_bin (mnemon, bin); + } if (correct) { - printf ("Correct!\n\n"); item->count++; + /* We reserve an item count of 0 for an item that has + * never been asked. */ + if (item->count == 0) { + item->count = 1; + unlearned--; + printf ("You got it!"); + } else if (item->count < 0) { + printf ("Yes---just give me %d more.", + - item->count); + } else if (item->count == 1) { + printf ("On your first try, no less!"); + } else { + printf ("Masterful."); + } } else { - printf (" %s is the correct answer.\n\n", + printf (" %s is the correct answer.", item->response); + if (item->count >= 0) + unlearned++; item->count--; - if (item->count > 0) + /* Penalize an incorrect response by forcing the count + * negative. */ + if (item->count >= 0) { item->count = -1; + printf ( " Oops, you knew that, right?\n "); + } } + printf (" ("); + if (to_introduce) + printf ("%d to come.", to_introduce); + if (to_introduce && unlearned) + printf (" "); + if (unlearned) + printf ("%d still unlearned.", unlearned); + if (to_introduce == 0 && unlearned == 0) + printf ("Great job!"); + printf (")\n\n"); + bin = mnemon_get_bin (mnemon, item->count); bin_add_item (bin, item); - } + } while (unlearned || to_introduce); } int @@ -670,13 +739,13 @@ main (int argc, char *argv[]) { mnemon_t mnemon; - srand (1); + srand (time (NULL)); mnemon_init (&mnemon); mnemon_load (&mnemon); - mnemon_do_challenges (&mnemon); + mnemon_do_challenges (&mnemon, 10); mnemon_save (&mnemon);