2019-03-31 18:40:37 -04:00
|
|
|
// TODO(dev): use 'halfdelay()' to parse input for pi menu choice 'secret.'
|
|
|
|
|
|
|
|
// NOTE(dev): Gonna need this:
|
|
|
|
// mvwprintw(win, y, x, string); /* Move to (y, x) relative to window */
|
|
|
|
// /* co-ordinates and then print */
|
|
|
|
|
|
|
|
#include <ncurses.h>
|
|
|
|
|
|
|
|
#include "Problem.h"
|
|
|
|
|
2019-04-01 15:48:20 -04:00
|
|
|
#include <vector>
|
2020-03-10 16:11:16 -04:00
|
|
|
#include <chrono>
|
2019-04-01 15:48:20 -04:00
|
|
|
|
2019-03-31 18:40:37 -04:00
|
|
|
#define PROMPT " > "
|
|
|
|
|
2020-03-10 15:52:49 -04:00
|
|
|
std::vector<Problem*> GenerateProblems(bool addition, bool subtraction,
|
|
|
|
bool multiplication, bool division);
|
2019-04-01 18:47:16 -04:00
|
|
|
char MainMenu();
|
2019-03-31 18:40:37 -04:00
|
|
|
|
|
|
|
int main(int argc, char *argv[])
|
|
|
|
{
|
|
|
|
initscr();
|
|
|
|
noecho(); // don't show user input
|
|
|
|
cbreak(); // handle user input immediately (i.e. don't wait for the user to press enter)
|
|
|
|
keypad(stdscr, true); // enable the numpad, F1-F12 keys, arrow keys, etc.
|
|
|
|
|
|
|
|
while(true)
|
|
|
|
{
|
|
|
|
// game boolean flags:
|
|
|
|
bool addition = false;
|
|
|
|
bool subtraction = false;
|
2020-03-10 15:52:49 -04:00
|
|
|
bool multiplication = false;
|
|
|
|
bool division = false;
|
2019-03-31 18:40:37 -04:00
|
|
|
|
|
|
|
// Main Menu:
|
|
|
|
char menu_action = MainMenu();
|
|
|
|
if(menu_action == 'q')
|
|
|
|
break;
|
|
|
|
else if(menu_action == '1')
|
|
|
|
addition = true;
|
|
|
|
else if(menu_action == '2')
|
|
|
|
subtraction = true;
|
|
|
|
else if(menu_action == '3')
|
|
|
|
addition = subtraction = true;
|
2020-03-10 15:52:49 -04:00
|
|
|
else if(menu_action == '4')
|
|
|
|
multiplication = true;
|
|
|
|
else if(menu_action == '5')
|
|
|
|
division = true;
|
|
|
|
else if(menu_action == '6')
|
|
|
|
multiplication = division = true;
|
2019-03-31 18:40:37 -04:00
|
|
|
else
|
|
|
|
continue; // restart loop
|
|
|
|
|
2019-04-01 15:48:20 -04:00
|
|
|
clear();
|
|
|
|
wrefresh(stdscr);
|
|
|
|
|
2020-03-10 15:52:49 -04:00
|
|
|
std::vector<Problem*> problems = GenerateProblems(addition, subtraction,
|
|
|
|
multiplication, division);
|
2019-04-01 18:47:16 -04:00
|
|
|
std::vector<Problem*>::iterator selected = problems.begin();
|
2019-03-31 18:40:37 -04:00
|
|
|
|
2019-04-03 09:36:08 -04:00
|
|
|
INPUT_STYLE input_style = INPUT_STYLE::INPUT_APPEND;
|
2019-04-01 15:48:20 -04:00
|
|
|
for(auto *problem : problems)
|
|
|
|
if(problem)
|
2019-04-03 09:36:08 -04:00
|
|
|
problem->Draw(problem == *selected, input_style);
|
2019-04-01 09:08:41 -04:00
|
|
|
|
2020-03-10 16:11:16 -04:00
|
|
|
// Keep track of time:
|
|
|
|
auto start_time = std::chrono::steady_clock::now();
|
|
|
|
|
2019-04-01 18:47:16 -04:00
|
|
|
while(selected != problems.end() && *selected)
|
|
|
|
{
|
2020-03-10 16:11:16 -04:00
|
|
|
|
2019-04-01 18:47:16 -04:00
|
|
|
Problem *current_problem = *selected;
|
2019-04-03 09:36:08 -04:00
|
|
|
current_problem->Draw(true, input_style); // refresh with new input
|
2019-04-01 18:47:16 -04:00
|
|
|
auto input = getch();
|
|
|
|
if(input == 'q') // early exit
|
|
|
|
break;
|
|
|
|
switch(input)
|
|
|
|
{
|
|
|
|
case KEY_LEFT:
|
2019-04-03 09:36:08 -04:00
|
|
|
input_style = INPUT_STYLE::INPUT_PREPEND;
|
2019-04-01 18:47:16 -04:00
|
|
|
break;
|
|
|
|
case KEY_RIGHT:
|
2019-04-03 09:36:08 -04:00
|
|
|
input_style = INPUT_STYLE::INPUT_APPEND;
|
|
|
|
break;
|
|
|
|
case KEY_BACKSPACE:
|
|
|
|
current_problem->ClearInput();
|
2019-04-01 18:47:16 -04:00
|
|
|
break;
|
|
|
|
case '0':
|
|
|
|
case '1':
|
|
|
|
case '2':
|
|
|
|
case '3':
|
|
|
|
case '4':
|
|
|
|
case '5':
|
|
|
|
case '6':
|
|
|
|
case '7':
|
|
|
|
case '8':
|
|
|
|
case '9':
|
|
|
|
current_problem->Input(input_style, input);
|
|
|
|
break;
|
|
|
|
};
|
|
|
|
|
2020-03-10 15:52:49 -04:00
|
|
|
// NOTE(dev): If the answer is zero and they hit backspace to clear input, it treated it
|
|
|
|
// as if they had entered zero themselves.
|
|
|
|
if(input != KEY_BACKSPACE && current_problem->Correct())
|
2019-04-01 18:47:16 -04:00
|
|
|
++selected;
|
2019-04-04 07:51:04 -04:00
|
|
|
current_problem->Draw(current_problem == *selected, input_style); // refresh with new input
|
2019-04-01 18:47:16 -04:00
|
|
|
}
|
2019-03-31 18:40:37 -04:00
|
|
|
|
2020-03-10 16:11:16 -04:00
|
|
|
// Keep track of time:
|
|
|
|
auto end_time = std::chrono::steady_clock::now();
|
|
|
|
auto elapsed_time = std::chrono::duration_cast<std::chrono::seconds>(end_time - start_time);
|
|
|
|
int middle_h = COLS / 2;
|
|
|
|
int middle_v = LINES / 2;
|
|
|
|
clear();
|
|
|
|
mvprintw(middle_v - 1, middle_h - 10,
|
|
|
|
"Time Elapsed: %02dm %02ds\n",
|
|
|
|
elapsed_time / 60, elapsed_time % 60);
|
|
|
|
mvprintw(middle_v + 1, middle_h - 8,
|
|
|
|
"Press Q to quit.");
|
|
|
|
wrefresh(stdscr);
|
|
|
|
|
|
|
|
while(!(getch() == 'q'))
|
|
|
|
;
|
|
|
|
|
2019-04-01 15:48:20 -04:00
|
|
|
for(auto *problem : problems)
|
|
|
|
if(problem)
|
|
|
|
delete problem;
|
2019-03-31 18:40:37 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
endwin();
|
|
|
|
return 0;
|
|
|
|
}
|
2019-04-01 18:47:16 -04:00
|
|
|
|
|
|
|
char MainMenu()
|
|
|
|
{
|
2019-04-04 07:51:04 -04:00
|
|
|
int middle_h = COLS / 2;
|
|
|
|
int middle_v = LINES / 2;
|
|
|
|
|
2019-04-01 18:47:16 -04:00
|
|
|
clear();
|
2020-03-10 15:52:49 -04:00
|
|
|
mvprintw(middle_v - 6, middle_h - 20, "\n");
|
|
|
|
mvprintw(middle_v - 5, middle_h - 20, " Welcome to Math Practice.\n");
|
|
|
|
mvprintw(middle_v - 4, middle_h - 20, " Please choose from the following menu:\n");
|
|
|
|
mvprintw(middle_v - 3, middle_h - 20, " 1. Addition\n");
|
|
|
|
mvprintw(middle_v - 2, middle_h - 20, " 2. Subtraction\n");
|
|
|
|
mvprintw(middle_v - 1, middle_h - 20, " 3. Both / Mixed\n");
|
|
|
|
mvprintw(middle_v - 0, middle_h - 20, " 4. Multiplication\n");
|
|
|
|
mvprintw(middle_v + 1, middle_h - 20, " 5. Division\n");
|
|
|
|
mvprintw(middle_v + 2, middle_h - 20, " 6. Both / Mixed\n");
|
|
|
|
mvprintw(middle_v + 3, middle_h - 20, " q. Quit\n");
|
|
|
|
mvprintw(middle_v + 4, middle_h - 20, "\n");
|
|
|
|
mvprintw(middle_v + 5, middle_h - 20, PROMPT);
|
2019-04-01 18:47:16 -04:00
|
|
|
refresh();
|
|
|
|
|
|
|
|
return getch();
|
|
|
|
}
|
|
|
|
|
2020-03-10 15:52:49 -04:00
|
|
|
std::vector<Problem*> GenerateProblems(bool addition, bool subtraction,
|
|
|
|
bool multiplication, bool division)
|
2019-04-01 18:47:16 -04:00
|
|
|
{
|
|
|
|
std::vector<Problem*> rtn;
|
|
|
|
for(auto y = 1; y < LINES - 10; y += 9)
|
|
|
|
{
|
|
|
|
for(auto x = 2; x < COLS - 16; x += 15)
|
|
|
|
{
|
|
|
|
Problem *test = nullptr;
|
2020-03-10 15:52:49 -04:00
|
|
|
if(addition || subtraction)
|
2019-04-01 18:47:16 -04:00
|
|
|
{
|
2020-03-10 15:52:49 -04:00
|
|
|
if(addition != subtraction)
|
|
|
|
{
|
|
|
|
if(addition)
|
|
|
|
test = new Problem(EASY_ADDITION, 3, x, y);
|
|
|
|
if(subtraction)
|
|
|
|
test = new Problem(EASY_SUBTRACTION, 3, x, y);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if(rand() % 2)
|
|
|
|
test = new Problem(HARD_ADDITION, 5, x, y);
|
|
|
|
else
|
|
|
|
test = new Problem(HARD_SUBTRACTION, 5, x, y);
|
|
|
|
}
|
|
|
|
rtn.push_back(test);
|
2019-04-01 18:47:16 -04:00
|
|
|
}
|
2020-03-10 15:52:49 -04:00
|
|
|
|
|
|
|
if(multiplication || division)
|
2019-04-01 18:47:16 -04:00
|
|
|
{
|
2020-03-10 15:52:49 -04:00
|
|
|
if(multiplication && !division)
|
|
|
|
test = new Problem(EASY_MULTIPLICATION, 2, x, y);
|
|
|
|
else if(division && !multiplication)
|
|
|
|
test = new Problem(EASY_DIVISION, 2, x, y);
|
2019-04-01 18:47:16 -04:00
|
|
|
else
|
2020-03-10 15:52:49 -04:00
|
|
|
{
|
|
|
|
// TODO(dev): Add hard problems
|
|
|
|
if(rand() % 2)
|
|
|
|
test = new Problem(HARD_MULTIPLICATION, 3, x, y);
|
|
|
|
else
|
|
|
|
test = new Problem(HARD_DIVISION, 3, x, y);
|
|
|
|
}
|
|
|
|
rtn.push_back(test);
|
2019-04-01 18:47:16 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return rtn;
|
|
|
|
}
|