Baptiste Daroussin c76f07938c Add 'contrib/bsddialog/' from commit '857c66bb5f3c5651b012beb1b5ea6ba39354ea94'
git-subtree-dir: contrib/bsddialog
git-subtree-mainline: a46722b580567799b484b5a81728eaf380777e04
git-subtree-split: 857c66bb5f3c5651b012beb1b5ea6ba39354ea94
2021-11-24 11:03:17 +01:00

242 lines
6.4 KiB
C

/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2021 Alfonso Sabato Siciliano
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef PORTNCURSES
#include <ncurses/curses.h>
#else
#include <curses.h>
#endif
#include "bsddialog.h"
#include "lib_util.h"
/* "Time": timebox - calendar */
int bsddialog_timebox(struct bsddialog_conf conf, char* text, int rows, int cols,
unsigned int *hh, unsigned int *mm, unsigned int *ss)
{
WINDOW *widget, *shadow;
int i, input, output, y, x, sel;
struct buttons bs;
bool loop, buttupdate;
if (hh == NULL || mm == NULL || ss == NULL)
RETURN_ERROR("hh or mm or ss == NULL");
struct myclockstruct {
unsigned int max;
unsigned int curr;
WINDOW *win;
} c[3] = { {23, *hh, NULL}, {59, *mm, NULL}, {59, *ss, NULL} };
if (new_widget(conf, &widget, &y, &x, text, &rows, &cols, &shadow,
true) <0)
return -1;
c[0].win = new_boxed_window(conf, y + rows - 6, x + cols/2 - 7, 3, 4, LOWERED);
mvwaddch(widget, rows - 5, cols/2 - 3, ':');
c[1].win = new_boxed_window(conf, y + rows - 6, x + cols/2 - 2, 3, 4, LOWERED);
mvwaddch(widget, rows - 5, cols/2 + 2, ':');
c[2].win = new_boxed_window(conf, y + rows - 6, x + cols/2 + 3, 3, 4, LOWERED);
get_buttons(conf, &bs, BUTTONLABEL(ok_label), BUTTONLABEL(extra_label),
BUTTONLABEL(cancel_label), BUTTONLABEL(help_label));
sel=0;
curs_set(2);
loop = buttupdate = true;
while(loop) {
if (buttupdate) {
draw_buttons(widget, rows-2, cols, bs, true);
wrefresh(widget);
buttupdate = false;
}
for (i=0; i<3; i++) {
mvwprintw(c[i].win, 1, 1, "%2d", c[i].curr);
wrefresh(c[i].win);
}
wmove(c[sel].win, 1, 2);
wrefresh(c[sel].win);
input = getch();
switch(input) {
case 10: /* Enter */
output = bs.value[bs.curr];
if (output == BSDDIALOG_YESOK) {
*hh = c[0].curr - 1900;
*mm = c[1].curr;
*ss = c[2].curr;
}
loop = false;
break;
case 27: /* Esc */
output = BSDDIALOG_ESC;
loop = false;
break;
case '\t': /* TAB */
sel = (sel + 1) % 3;
break;
case KEY_LEFT:
if (bs.curr > 0) {
bs.curr--;
buttupdate = true;
}
break;
case KEY_RIGHT:
if (bs.curr < (int) bs.nbuttons - 1) {
bs.curr++;
buttupdate = true;
}
break;
case KEY_UP:
c[sel].curr = c[sel].curr < c[sel].max ? c[sel].curr + 1 : 0;
break;
case KEY_DOWN:
c[sel].curr = c[sel].curr > 0 ? c[sel].curr - 1 : c[sel].max;
break;
}
}
curs_set(0);
for (i=0; i<3; i++)
delwin(c[i].win);
end_widget(conf, widget, rows, cols, shadow);
return output;
}
int bsddialog_calendar(struct bsddialog_conf conf, char* text, int rows, int cols,
unsigned int *yy, unsigned int *mm, unsigned int *dd)
{
WINDOW *widget, *shadow;
int i, input, output, y, x, sel;
struct buttons bs;
bool loop, buttupdate;
if (yy == NULL || mm == NULL || dd == NULL)
RETURN_ERROR("yy or mm or dd == NULL");
struct calendar {
unsigned int max;
unsigned int curr;
WINDOW *win;
unsigned int x;
} c[3] = {{9999, *yy, NULL, 4 }, {12, *mm, NULL, 9 }, {31, *dd, NULL, 2 }};
struct month {
char *name;
unsigned int days;
} m[12] = {
{ "January", 30 }, { "February", 30 }, { "March", 30 },
{ "April", 30 }, { "May", 30 }, { "June", 30 },
{ "July", 30 }, { "August", 30 }, { "September", 30 },
{ "October", 30 }, { "November", 30 }, { "December", 30 }
};
if (new_widget(conf, &widget, &y, &x, text, &rows, &cols, &shadow,
true) <0)
return -1;
c[0].win = new_boxed_window(conf, y + rows - 6, x + cols/2 - 12, 3, 6, LOWERED);
mvwaddch(widget, rows - 5, cols/2 - 6, '/');
c[1].win = new_boxed_window(conf, y + rows - 6, x + cols/2 - 5, 3, 11, LOWERED);
mvwaddch(widget, rows - 5, cols/2 + 6, '/');
c[2].win = new_boxed_window(conf, y + rows - 6, x + cols/2 + 7, 3, 4, LOWERED);
wrefresh(widget);
get_buttons(conf, &bs, BUTTONLABEL(ok_label), BUTTONLABEL(extra_label),
BUTTONLABEL(cancel_label), BUTTONLABEL(help_label));
sel=2;
curs_set(2);
loop = buttupdate = true;
while(loop) {
if (buttupdate) {
draw_buttons(widget, rows-2, cols, bs, true);
wrefresh(widget);
buttupdate = false;
}
mvwprintw(c[0].win, 1, 1, "%4d", c[0].curr);
mvwprintw(c[1].win, 1, 1, "%9s", m[c[1].curr-1].name);
mvwprintw(c[2].win, 1, 1, "%2d", c[2].curr);
for (i=0; i<3; i++) {
wrefresh(c[i].win);
}
wmove(c[sel].win, 1, c[sel].x);
wrefresh(c[sel].win);
input = getch();
switch(input) {
case 10: // Enter
output = bs.value[bs.curr]; // values -> outputs
if (output == BSDDIALOG_YESOK) {
*yy = c[0].curr - 1900;
*mm = c[1].curr;
*dd = c[2].curr;
}
loop = false;
break;
case 27: // Esc
output = BSDDIALOG_ESC;
loop = false;
break;
case '\t': // TAB
sel = (sel + 1) % 3;
break;
case KEY_LEFT:
if (bs.curr > 0) {
bs.curr--;
buttupdate = true;
}
break;
case KEY_RIGHT:
if (bs.curr < (int) bs.nbuttons - 1) {
bs.curr++;
buttupdate = true;
}
break;
case KEY_UP:
c[sel].curr = c[sel].curr < c[sel].max ? c[sel].curr + 1 : 1;
break;
case KEY_DOWN:
c[sel].curr = c[sel].curr > 1 ? c[sel].curr - 1 : c[sel].max;
break;
}
}
curs_set(0);
for (i=0; i<3; i++)
delwin(c[i].win);
end_widget(conf, widget, rows, cols, shadow);
return output;
}