/* $calcurse: todo.c,v 1.13 2007/07/28 13:11:42 culot Exp $ */
/*
* Calcurse - text-based organizer
* Copyright (c) 2004-2007 Frederic Culot
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*
* Send your feedback or comments to : calcurse@culot.org
* Calcurse home page : http://culot.org/calcurse
*
*/
#include <stdlib.h>
#include <string.h>
#include "utils.h"
#include "i18n.h"
#include "todo.h"
struct todo_s *todolist;
/* Request user to enter a new todo item. */
int
todo_new_item(int total)
{
int ch = 0;
char *mesg = _("Enter the new ToDo item : ");
char *mesg_id =
_("Enter the ToDo priority [1 (highest) - 9 (lowest)] :");
char todo_input[BUFSIZ] = "";
status_mesg(mesg, "");
if (getstring(swin, todo_input, BUFSIZ, 0, 1) ==
GETSTRING_VALID) {
while ( (ch < '1') || (ch > '9') ) {
status_mesg(mesg_id, "");
ch = wgetch(swin);
}
todo_add(todo_input, ch - '0');
total++;
}
return total;
}
/* Add an item in the todo linked list. */
struct todo_s *
todo_add(char *mesg, int id)
{
struct todo_s *o, **i;
o = (struct todo_s *) malloc(sizeof(struct todo_s));
o->mesg = (char *) malloc(strlen(mesg) + 1);
strncpy(o->mesg, mesg, strlen(mesg) + 1);
o->id = id;
i = &todolist;
for (;;) {
if (*i == 0 || (*i)->id > id) {
o->next = *i;
*i = o;
break;
}
i = &(*i)->next;
}
return o;
}
/* Delete an item from the todo linked list. */
static void
todo_delete_bynum(unsigned num)
{
unsigned n;
struct todo_s *i, **iptr;
n = 0;
iptr = &todolist;
for (i = todolist; i != 0; i = i->next) {
if (n == num) {
*iptr = i->next;
free(i->mesg);
free(i);
return;
}
iptr = &i->next;
n++;
}
/* NOTREACHED */
fputs(_("FATAL ERROR in todo_delete_bynum: no such todo\n"), stderr);
exit(EXIT_FAILURE);
}
/* Delete an item from the ToDo list. */
void
todo_delete(conf_t *conf, int *nb_tod, int *hilt_tod)
{
char *choices = "[y/n] ";
char *del_todo_str = _("Do you really want to delete this task ?");
bool go_for_todo_del = false;
int answer = 0;
if (conf->confirm_delete) {
status_mesg(del_todo_str, choices);
answer = wgetch(swin);
if ( (answer == 'y') && (*nb_tod > 0) ) {
go_for_todo_del = true;
} else {
erase_status_bar();
return;
}
} else
if (*nb_tod > 0)
go_for_todo_del = true;
if (go_for_todo_del) {
todo_delete_bynum(*hilt_tod - 1);
(*nb_tod)--;
if (*hilt_tod > 1)
(*hilt_tod)--;
if (*nb_tod == 0)
*hilt_tod = 0;
}
}
/*
* Returns the position into the linked list corresponding to the
* given todo_s item.
*/
static int
todo_get_position(struct todo_s *i)
{
struct todo_s *o;
int n = 1, found = 0;
for (o = todolist; o; o = o->next) {
if (o == i) {
found = 1;
break;
}
n++;
}
if (found) {
return n;
} else {
fputs(_("FATAL ERROR in todo_get_position: todo not found\n"),
stderr);
exit(EXIT_FAILURE);
}
}
/* Returns a structure containing the selected item. */
static struct todo_s *
todo_get_item(int item_number)
{
struct todo_s *o;
int i;
o = todolist;
for (i = 1; i < item_number; i++) {
o = o->next;
}
return o;
}
/* Change an item priority by pressing '+' or '-' inside TODO panel. */
int
todo_chg_priority(int action, int item_num)
{
struct todo_s *backup;
char backup_mesg[BUFSIZ];
int backup_id;
int do_chg = 1, new_position;
backup = todo_get_item(item_num);
strncpy(backup_mesg, backup->mesg, strlen(backup->mesg) + 1);
backup_id = backup->id;
if (action == '+') {
(backup_id > 1) ? backup_id-- : do_chg--;
} else if (action == '-') {
(backup_id < 9) ? backup_id++ : do_chg--;
} else { /* NOTREACHED */
fputs(_("FATAL ERROR in todo_chg_priority: no such action\n"),
stderr);
}
if (do_chg) {
todo_delete_bynum(item_num - 1);
backup = todo_add(backup_mesg, backup_id);
new_position = todo_get_position(backup);
} else {
new_position = item_num;
}
return new_position;
}
/* Edit the description of an already existing todo item. */
void
todo_edit_item(int item_num)
{
struct todo_s *i;
char *mesg = _("Enter the new ToDo description :");
status_mesg(mesg, "");
i = todo_get_item(item_num);
updatestring(swin, &i->mesg, 0, 1);
}
/* Updates the ToDo panel. */
void
todo_update_panel(window_t *wintod, int hilt_tod, int nb_tod, int which_pan,
int first_todo_onscreen, char **saved_t_mesg)
{
struct todo_s *i;
int len = wintod->w - 6;
int num_todo = 0;
int y_offset = 3, x_offset = 1;
int t_realpos = -1;
int title_lines = 3;
int todo_lines = 1;
int max_items = wintod->h - 4;
int incolor = -1;
char mesg[BUFSIZ] = "";
/* Print todo item in the panel. */
erase_window_part(twin, 1, title_lines, wintod->w - 2, wintod->h - 2);
for (i = todolist; i != 0; i = i->next) {
num_todo++;
t_realpos = num_todo - first_todo_onscreen;
incolor = num_todo - hilt_tod;
if (incolor == 0)
*saved_t_mesg = i->mesg;
if (t_realpos >= 0 && t_realpos < max_items) {
snprintf(mesg, BUFSIZ, "%d. ", i->id);
strncat(mesg, i->mesg, strlen(i->mesg));
display_item(twin, incolor, mesg, 0,
len, y_offset, x_offset);
y_offset = y_offset + todo_lines;
}
}
/* Draw the scrollbar if necessary. */
if (nb_tod > max_items){
float ratio = ((float) max_items) / ((float) nb_tod);
int sbar_length = (int) (ratio * (max_items + 1));
int highend = (int) (ratio * first_todo_onscreen);
bool hilt_bar = (which_pan == TODO) ? true : false;
int sbar_top = highend + title_lines;
if ((sbar_top + sbar_length) > wintod->h - 1)
sbar_length = wintod->h - 1 - sbar_top;
draw_scrollbar(twin, sbar_top, wintod->w - 2,
sbar_length, title_lines, wintod->h - 1, hilt_bar);
}
wnoutrefresh(twin);
}
