TaKl/src/main.c

276 lines
6.8 KiB
C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "main/include/colors.h"
#include "main/include/config.h"
#include "main/include/tasks.h"
#include "main/include/db.h"
void help(char* name) {
printf(BLUE "\t-- TaKl " VERSION " --\n" RESET);
printf("Utilisation: %s ( list | add | reschedule | info | rm | done )\n", name);
printf("\tlist [category] [-a:voir les tâches complétées]\n");
printf("\tadd [category:]<task> [date]\n");
printf("\treschedule <id> [date]\n");
printf("\tinfo <id1> <id2> ...\n");
printf("\tdone <id1> <id2> ...\n");
printf("\trm <id1> <id2> ...\n");
printf("\nFormat des dates:\n");
printf("\tRelatif: min+%%d, h+%%d, j+%%d\n");
printf("\tAbsolu: dd/mm (pas de changement d'année pour l'instant)\n");
}
time_t parseDateTime(const char* input) {
struct tm date = {0}; // Initialize with zeros
// Get current time
time_t now = time(NULL);
struct tm* current_time = localtime(&now);
// Copy current time to 'date' structure
date.tm_year = current_time->tm_year;
date.tm_mon = current_time->tm_mon;
date.tm_mday = current_time->tm_mday;
date.tm_hour = current_time->tm_hour-1; //TODO: buggy in non-UTC
date.tm_min = current_time->tm_min;
date.tm_sec = current_time->tm_sec;
int offset;
// Accepted formats: min+%d, h+%d, j+%d
if (sscanf(input, "min+%d", &offset)) {
date.tm_min += offset;
return mktime(&date);
} else if (sscanf(input, "h+%d", &offset)) {
date.tm_hour += offset;
return mktime(&date);
} else if (sscanf(input, "j+%d", &offset)) {
date.tm_mday += offset;
return mktime(&date);
}
// Check if the input format is "dd/mm"
if (sscanf(input, "%d/%d", &date.tm_mday, &date.tm_mon) == 2) {
// Set the year to the current year
date.tm_year = current_time->tm_year;
// Adjust month and day values to be zero-based
date.tm_hour = 0;
date.tm_min = 0;
date.tm_sec = 0;
// Convert 'date' structure to 'time_t' value
return mktime(&date);
}
return -1; // Return an error value
}
int add(int argc, char* argv[]) {
if (argc < 3) {
printf(BOLD YELLOW "Argument manquant\n" RESET);
help(argv[0]);
return 1;
}
time_t due_to = 0;
if (argc > 3) {
due_to = parseDateTime(argv[3]);
if (due_to == -1) {
printf(BOLD YELLOW "Échéance invalide, la tâche sera créé sans échéance.\n" RESET);
due_to = 0;
}
}
task_t t = create_task(argv[2], due_to);
if (t.id == -1) {
if (t.category) {
free(t.category);
free(t.text);
}
return 1;
}
if (add_task(t) != 0) {
printf("Erreur lors de l'ajout à la base de données\n");
if (t.category) {
free(t.category);
free(t.text);
}
return 1;
}
if (t.category) {
free(t.category);
free(t.text);
}
printf(BOLD YELLOW "[%d]" RESET " ajoutée\n", t.id);
return 0;
}
int reschedule(int argc, char* argv[]) {
if (argc < 3) {
printf(BOLD YELLOW "Argument manquant\n" RESET);
help(argv[0]);
return 1;
}
int id = strtol(argv[2], NULL, 10);
task_t t;
t.id = -1;
get_task(id, &t);
if (t.id == -1) {
printf(YELLOW "Tâche " BOLD "[%d]" RESET YELLOW " inexistante. Vérifiez que l'identifiant est bien correct\n" RESET, id);
return 1;
}
time_t due_to = parseDateTime(argv[3]);
if (due_to == -1) {
printf(RED "Échéance invalide, impossible de reprogrammer la tâche.\n" RESET);
return 1;
}
t.due_to = due_to;
if (update_task(t) != 0) {
printf("Erreur lors de la modification de la tâche\n");
return 1;
}
return 0;
}
int list_tasks(int argc, char* argv[]) {
bool show_completed = false;
char* category = NULL;
for (int i=2; i < argc; i++) {
if (!strcmp(argv[i], "-a")) {
show_completed = true;
} else {
category = argv[i];
}
}
task_list_t* tasks = get_task_list(category, show_completed);
print_task_list(tasks, !category, show_completed); // show_completed: true would work as all the tasks are not loaded if false
free_task_list(tasks);
return 0;
}
int info(int argc, char* argv[]) {
if (argc < 3) {
printf(BOLD YELLOW "Argument manquant\n" RESET);
help(argv[0]);
return 1;
}
for (int i=2; i < argc; i++) {
int id = strtol(argv[i], NULL, 10);
task_t t;
t.id = -1;
get_task(id, &t);
if (t.id == -1) {
printf(YELLOW "Tâche " BOLD "[%s]" RESET YELLOW " inexistante. Vérifiez que l'identifiant est bien correct\n" RESET, argv[i]);
return 1;
}
print_task(t);
free(t.text);
if (t.category) {
free(t.category);
}
}
return 0;
}
int mark_done(int argc, char* argv[]) {
if (argc < 3) {
printf(BOLD YELLOW "Argument manquant\n" RESET);
help(argv[0]);
return 1;
}
for (int i=2; i < argc; i++) {
int id = strtol(argv[i], NULL, 10);
task_t t;
t.id = -1;
get_task(id, &t);
if (t.id == -1) {
printf(YELLOW "Tâche " BOLD "[%s]" RESET YELLOW " inexistante. Vérifiez que l'identifiant est bien correct\n" RESET, argv[i]);
return 1;
}
t.done = true;
update_task(t);
}
return 0;
}
int delete(int argc, char* argv[]) {
if (argc < 3) {
printf(BOLD YELLOW "Argument manquant\n" RESET);
help(argv[0]);
return 1;
}
for (int i=2; i < argc; i++) {
int id = strtol(argv[i], NULL, 10);
task_t t;
t.id = -1;
get_task(id, &t);
if (t.id == -1) {
printf(YELLOW "Tâche " BOLD "[%s]" RESET YELLOW " inexistante. Vérifiez que l'identifiant est bien correct\n" RESET, argv[i]);
return 1;
}
delete_task(t.id);
}
return 0;
}
int main(int argc, char* argv[]) {
srand(time(NULL));
if (argc <= 1) {
help(argv[0]);
return 0;
}
if (!strcmp(argv[1], "add")) {
return add(argc, argv);
} else if (!strcmp(argv[1], "reschedule")) {
return reschedule(argc, argv);
} else if (!strcmp(argv[1], "list")) {
return list_tasks(argc, argv);
} else if (!strcmp(argv[1], "info")) {
return info(argc, argv);
} else if (!strcmp(argv[1], "done")) {
return mark_done(argc, argv);
} else if (!strcmp(argv[1], "rm")) {
return delete(argc, argv);
}
printf(YELLOW "Option invalide " BOLD "%s\n" RESET, argv[1]);
return 1;
}