KanBan.c

#include <stdio.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "header.h"
#include "prints.c"
#include "files.c"

#define N 5

void program_kill_handler(int num){
    write(STDOUT_FILENO,"\ngo to menu and then quit the program by pressing 0\n",53);
}

void quit(List a,List b,List c,List d){
    printf("Storing %s...",a->name);
    fflush(stdout); // to flush out the printf buffer
    storeList(a);
    sleep(0.5);
    printf("Storing %s...",b->name);
    fflush(stdout);
    storeList(b);
    sleep(0.5);
    printf("Storing %s...",c->name);
    fflush(stdout);
    storeList(c);
    exit(0);
}

Card* load_card(char *line){
    Card *c = malloc(sizeof(Card));
    char *word = strtok(line, " ");
    c->id = atoi(word);
    c->priority = atoi(strtok(NULL, " "));
    c->begin= digestCharDate(strtok(NULL, " "));
    printf("%d ", c->begin.day);
    c->description = strtok(NULL," ");
    c->person = strtok(NULL," ");
    c->deadline = digestCharDate(strtok(NULL," "));
    c->end = digestCharDate(strtok(NULL," "));  
    
    return c;
}

Date digestCharDate(char* word){
    Date d;

    char * num = strtok(word,"/");
    d.day = atoi(num);

    num = strtok(NULL,"/");
    d.month = atoi(num);
    
    num = strtok(NULL,"/");
    d.year = atoi(num);

    printf("%d/%d/%d\n", d.day, d.month, d.year);
    
    return d;
}

int IsDateValid(Date input){
    //check year
    if(input.year>=2000 && input.year<=9999)
    {
        //check month
        if(input.month>=1 && input.month<=12)
        {
            //check days
            if((input.day>=1 && input.day<=31) && (input.month==1 || input.month==3 || input.month==5 || input.month==7 || input.month==8 || input.month==10 || input.month==12))
                return 1;
            else if((input.day>=1 && input.day<=30) && (input.month==4 || input.month==6 || input.month==9 || input.month==11))
                return 1;
            else if((input.day>=1 && input.day<=28) && (input.month==2))
                return 1;
            else if(input.day==29 && input.month==2 && (input.year%400==0 ||(input.year%4==0 && input.year%100!=0)))
                return 1;
            else
                printf("Invalid Date, try again\n");
        }
        else
            printf("Invalid Date, try again\n");
    }
    else
        printf("Invalid Date, try again\n");
    return 0;
}

int datecmp(Date d1, Date d2){
    if(d1.year<d2.year)
        return 1;
    else if(d1.month<d2.month)
        return 1;
    else if(d1.day<d2.day)
        return 1;
    else if(d1.day == d2.day)
        return 0;
    else
        return -1;
}

List create_list() {
    List a = (List)malloc(sizeof(List_node));
    if (a!=NULL) {
        a->n = 0;
        a->next = NULL;
    }
    return a;
}

Card* create_card() {
    Card *c = malloc(sizeof(*c));
    char *aux = malloc(256*sizeof(char));
    c->id = get_newid();
    printf("\nCREATE NEW CARD || id=%d\n",c->id);
    
    printf("Priority (1-10) = "); scanf("%d", &c->priority);
    Date input;
    do{
        printf("Creation date (day month year) = "); scanf("%d%d%d", &input.day, &input.month, &input.year); 
    }while(!IsDateValid(input));
    c->begin.day=input.day;
    c->begin.month=input.month;
    c->begin.year=input.year;
    getchar();
    printf("Description: "); fgets(aux, 256, stdin); c->description=aux;
    return c;
}

void look_list(List l, int p, List *ant, List *atual) {
    *ant = l; *atual = l->next;
    while ((*atual)!=NULL && (*atual)->card->id>p) {
        *ant = *atual;
        *atual = (*atual)->next;
    }
    if ((*atual)!=NULL && (*atual)->card->id!=p)
        *atual = NULL;
}

void look_list1(List l, int p, List *ant, List *atual) {
    *ant = l; *atual = l->next;
    while ((*atual)!=NULL && (*atual)->card->priority>p) {
        *ant = *atual;
        *atual = (*atual)->next;
    }
    if ((*atual)!=NULL && (*atual)->card->priority!=p)
        *atual = NULL;
}

void look_list2(List l, char *person, List *ant, List *atual) {
    *ant = l; *atual = l->next;
    while ((*atual)!=NULL && strcmp((*atual)->card->person,person) > 0) {
        *ant = *atual;
        *atual = (*atual)->next;
    }
    if ((*atual)!=NULL && strcmp((*atual)->card->person,person) != 0)
        *atual = NULL;
}

void look_list3(List l, Date d, List *ant, List *atual) {
    *ant = l; *atual = l->next;
    while ((*atual)!=NULL && datecmp((*atual)->card->end,d) > 0) {
        *ant = *atual;
        *atual = (*atual)->next;
    }
    if ((*atual)!=NULL && datecmp((*atual)->card->end,d) !=0)
        *atual = NULL;
}

void look_listCrono(List l, Date d, List *ant, List *atual) {
    *ant = l; *atual = l->next;
    while ((*atual)!=NULL && datecmp((*atual)->card->begin,d) > 0) {
        *ant = *atual;
        *atual = (*atual)->next;
    }
    if ((*atual)!=NULL && datecmp((*atual)->card->begin,d) !=0)
        *atual = NULL;
}

List search_list(List l, int n) {
    List ant, atual;
    look_list(l,n,&ant,&atual);
    return (atual);
}

void delete_list(List l, int n) {
    List ant1, atual1;
    look_list(l,n,&ant1,&atual1);
    if (atual1!=NULL) {
        ant1->next = atual1->next;
        free(atual1);
    }
}

void insert_1(List l, List Crono) { // this one should insert them ordered by priority
    List no;
    List ant, inutil;
    no = (List)malloc(sizeof(List_node));
    if (no!=NULL) {
        no->card = create_card();
        look_list1(l,no->card->priority,&ant,&inutil);
        no->next = ant->next;
        ant->next = no;
    }
    l->n++;
    insertCrono(Crono,no->card);
    getchar();system("clear");printf("card %d inserted into ToDo\n",no->card->id);menu();
}

void insert_2(List l1, List l2) { // this one should insert them ordered by name
    List no, ant, inutil;
    char *aux2 = malloc(256*sizeof(char));
    if (l2->n == N)
        printf("Error: List is full\n");
    else {
        int n; printf("Type the card ID you want to move (ToDo -> Doing) - "); scanf("%d", &n);
        List aux = search_list(l1,n);
        if (aux == NULL)
            printf("Error: Card not found\n");
        else {
            no = (List)malloc(sizeof(List_node));
            no->card = aux->card;
            getchar(); printf("Person responsable - "); fgets(aux2, 256, stdin); no->card->person = aux2;
            Date input;
            do{
                printf("Write a deadline (day month year) - "); scanf("%d%d%d", &input.day, &input.month, &input.year); 
            }while(!IsDateValid(input));
            no->card->deadline.day=input.day;
            no->card->deadline.month=input.month;
            no->card->deadline.year=input.year;
            look_list2(l2,no->card->person,&ant,&inutil);
            no->next = ant->next;
            ant->next = no;
            delete_list(l1,n);
            l1->n--; l2->n++;
        }
    }
    system("clear");
    printf("card %d from ToDo moved to DOING\n",no->card->id);menu();
}

void insert_3(List l2, List l3) { //this one should be ordered by end date
    List no, ant, inutil;
    int n; printf("Type the card ID you want to move (Doing -> Done) - "); scanf("%d", &n);
    List aux = search_list(l2,n);
    if (aux == NULL)
        printf("Error: Card not found\n");
    else {
        no = (List)malloc(sizeof(List_node));
        no->card = aux->card;
        Date input;
        do{
            printf("Write date of conclusion (day month year) - "); scanf("%d%d%d", &input.day, &input.month, &input.year); 
        }while(!IsDateValid(input));
        no->card->end.day=input.day;
        no->card->end.month=input.month;
        no->card->end.year=input.year;
        look_list3(l3,no->card->end,&ant,&inutil);
        no->next = ant->next;
        ant->next = no;
        delete_list(l2,n);
        l2->n--; l3->n++;
    }
    system("clear");printf("card %d from DOING moved to DONE\n",no->card->id);menu();
}

void insertCrono(List Crono, Card *c){
    List no;
    List ant,inutil;
    no = (List)malloc(sizeof(List_node));
    if(no!=NULL){
        no->card = c;
        look_listCrono(Crono,no->card->begin,&ant,&inutil);
        no->next = ant->next;
        ant->next = no;
    }
    Crono->n++;
}

void reopen(List l3, List l1){
    List no,ant,inutil;
    int n; printf("Type the card ID you want to move (Done -> ToDo) - "); scanf("%d", &n);
    List aux=search_list(l3,n);
     if (aux == NULL)
        printf("Error: Card not found\n");
    else {
        /* First copy everything we want to keep and then insert it into "ToDo" list*/
        no = (List)malloc(sizeof(List_node));
        no->card->id = aux->card->id; // copy id
        no->card->priority = aux->card->priority; // copy priority
        no->card->begin = aux->card->begin; // copy begin date
        no->card->description = aux->card->description; // copy description
        look_list(l1,no->card->id,&ant,&inutil);
        no->next = ant->next;
        ant->next = no;
        /* delete the card from "Done" list once we have stored a copy of itself on the "ToDo" list*/
        delete_list(l3,n);
        l3->n--;l1->n++;
    }
    system("clear");printf("task %d reopened\n",no->card->id);menu();
}

void change_person(List l2) {
    List aux;
    int n; printf("Type the card ID you want to change the person (Doing) - "); scanf("%d", &n);
    char*aux2 = malloc(256*sizeof(char));
    aux = search_list(l2,n);
    if (aux == NULL)
        printf("Error: Card not found\n");
    else {
        getchar(); printf("New person responsable - "); fgets(aux2, 256, stdin); aux->card->person = aux2;
    }
    getchar();system("clear");printf("%s is now in charge of the card %d\n",aux2,n);menu();
}

void spy(List l2,List l3){
    int foundflag = 0;
    char * name = malloc(256*sizeof(char));
    getchar();printf("Insert the name of the person whose tasks you would like to view\n"); fgets(name, 256, stdin);

    printf("\n____________________________________\n");
    printf("             DOING    //person:%s\n",name);
    printf("____________________________________\n");
    /*while funct searching for the person*/
    List k2 = l2->next;
    while(k2){
        if(!strcmp(k2->card->person,name)){ // comparing the two names
            foundflag = 1;
            printf(" ___________________\n");
            printf("| ID - %d\n", k2->card->id);
            printf("| PRIORITY - %d\n", k2->card->priority);
            printf("| DATE - %d/%d/%d\n", k2->card->begin.day, k2->card->begin.month, k2->card->begin.year);
            printf("| DESCRIPTION - %s", k2->card->description);
            printf("| DEADLINE - %d/%d/%d\n", k2->card->deadline.day, k2->card->deadline.month, k2->card->deadline.year);
        }
        k2 = k2->next;
    }
    if(!foundflag){
        printf("No tasks\n");
        foundflag = 0;
    }

    printf("\n____________________________________\n");
    printf("             DONE   //person:%s\n",name);
    printf("____________________________________\n");
    /*while funct searching for the person*/
    List k3 = l3->next;
    while(k3){
        if(!strcmp(k3->card->person,name)){ // comparing the two names
            foundflag =1;
            printf(" ___________________\n");
            printf("| ID - %d\n", k3->card->id);
            printf("| PRIORITY - %d\n", k3->card->priority);
            printf("| DATE - %d/%d/%d\n", k3->card->begin.day, k3->card->begin.month, k3->card->begin.year);
            printf("| DESCRIPTION - %s", k3->card->description);
            printf("| DEADLINE - %d/%d/%d\n", k3->card->deadline.day, k3->card->deadline.month, k3->card->deadline.year);
            printf("| DATE OF CONCLUSION - %d/%d/%d\n", k3->card->end.day, k3->card->end.month, k3->card->end.year);   
        }
        k3 = k3->next;
    }
    if(!foundflag){
        printf("No tasks\n");
        foundflag = 0;
    }
    getchar();system("clear");menu();
}

int main() {
    signal(SIGINT,program_kill_handler);
    List ToDo = create_list();
    List Doing = create_list();
    List Done = create_list();   
    List Crono = create_list();
    ToDo->name = "ToDo";
    Doing->name = "Doing";
    Done->name = "Done";
    Crono->name = "Crono";
    loadList(ToDo, Crono);
    loadList(Doing, Crono);
    loadList(Done, Crono);
    
    menu();
    int input;
    printf("$ "); scanf("%d", &input);

    while(1) {   
        if         (input==0) quit(ToDo,Doing,Done,Crono);
        else if (input==1){insert_1(ToDo,Crono);}                   // 1. inserir uma nova tarefa na lista "To Do"
        else if (input==3) change_person(Doing);                   // 3. Alterar a pessoa responsável por um cartão em "Doing"
        else if (input==2) insert_2(ToDo,Doing);                      // 2. Mover cartões "To Do" -> "Doing"
        else if (input==4) insert_3(Doing,Done);                     // 4. Fechar tarefa. "Doing" -> "Done"
        else if (input==6) print_board(ToDo,Doing,Done);       // 6. Visualizar o quadro
        else if (input==5) reopen(Done,ToDo);                        // 5. Reabrir tarefa. "Done" -> "To Do"
        else if (input==7) spy(Doing,Done);                            // 7. Visualizar as tarefas de uma pessoa
        else if (input==8) cronologic_print(Crono);                 // 8.Print tasks by creation order
        
        else printf("Error: invalid input\n");
        
        printf("\n$ "); scanf("%d", &input);
    }
    printf("See you next time!\n");
    return 0;
}