Compare commits
22
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
809239492d | ||
|
|
5e3d89fb57 | ||
|
|
5d76c54213 | ||
|
|
b5dc110cd2 | ||
|
|
9b3238978b | ||
|
|
08145cd4a2 | ||
|
|
f72c98de28 | ||
|
|
a302bfc4e8 | ||
|
|
d428589063 | ||
|
|
1fb016296b | ||
|
|
dd88cd8b64 | ||
|
|
24f0e9e7ec | ||
|
|
63ee77f5c4 | ||
|
|
cf63dc4712 | ||
|
|
bf14307a71 | ||
|
|
b792eed3d2 | ||
|
|
ad20db3995 | ||
|
|
81c62f892d | ||
|
|
f6cea89dd2 | ||
|
|
b308dc4c95 | ||
|
|
834b3270b9 | ||
|
|
0ef20822fd |
No files matched your search
@@ -10,39 +10,37 @@
|
||||
*
|
||||
*/
|
||||
|
||||
|
||||
#include "llist.h"
|
||||
#include "planner.h"
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include "planner.h"
|
||||
#include "list.h"
|
||||
|
||||
/*
|
||||
write a complete linkedlist to a task csv file.
|
||||
*/
|
||||
void write_linkedlist_to_csv(llist* head, const char* filename) {
|
||||
//Open file with write permision
|
||||
FILE* file = fopen(filename, "w");
|
||||
//if there is no file or a wrong file path you becom an error
|
||||
void write_linkedlist_to_csv(llist *head, const char *filename) {
|
||||
// Open file with write permision
|
||||
FILE *file = fopen(filename, "w");
|
||||
// if there is no file or a wrong file path you becom an error
|
||||
if (file == NULL) {
|
||||
perror("Could not open file %s\n", filename);
|
||||
}
|
||||
else{
|
||||
//write the file header
|
||||
fprintf(stderr, "Could not open file %s\n", filename);
|
||||
exit(1);
|
||||
|
||||
} else {
|
||||
// write the file header
|
||||
fprintf(file, "TaskName, Created, Deadline, Priority, Spare\n");
|
||||
|
||||
// Iterate through the linked list and write the data to the CSV
|
||||
llist* current = head;
|
||||
llist *current = head;
|
||||
Task *task;
|
||||
while (current != NULL) {
|
||||
task = current->data;
|
||||
|
||||
// Write the task data to the CSV file
|
||||
fprintf(file, "%s, %lu, %lu, %d, %lu\n",
|
||||
task->name,
|
||||
task->created,
|
||||
task->deadline,
|
||||
task->priority,
|
||||
task->spare,
|
||||
|
||||
fprintf(file, "%s, %lu, %lu, %d, %lu\n", task->name, task->created,
|
||||
task->deadline, task->priority, task->spare);
|
||||
|
||||
current = current->next;
|
||||
}
|
||||
@@ -54,49 +52,47 @@ void write_linkedlist_to_csv(llist* head, const char* filename) {
|
||||
read a task csv file and write the data in a linked list
|
||||
*/
|
||||
|
||||
void write_csv_to_llist(const char* filename) {
|
||||
//Open file with read permision
|
||||
FILE* file = fopen(filename, "r");
|
||||
llist *write_csv_to_llist(const char *filename) {
|
||||
llist *list = NULL; // list to return
|
||||
// Open file with read permision
|
||||
FILE *file = fopen(filename, "r");
|
||||
if (file == NULL) {
|
||||
perror("Could not open file %s\n", filename);
|
||||
}
|
||||
else{
|
||||
char line[1024]; //Line Buffer
|
||||
int count = 0; //task counter
|
||||
llist *list = NULL
|
||||
fgets(line, sizeof(line), file); //read and ignore file head
|
||||
fprintf(stderr, "Could not open file %s\n", filename);
|
||||
|
||||
} else {
|
||||
char line[1024]; // Line Buffer
|
||||
int count = 0; // task counter
|
||||
fgets(line, sizeof(line), file); // read and ignore file head
|
||||
|
||||
while (fgets(line, sizeof(line), file)) {
|
||||
count++;
|
||||
//remove newline sign
|
||||
// remove newline sign
|
||||
line[strcspn(line, "\n")] = '\0';
|
||||
|
||||
// column slice
|
||||
char *taskname = strtok(line, ",");
|
||||
char *tsakcreation_dateSTR = strtok(NULL, ",");
|
||||
char *tsakdeadline_dateSTR = strtok(NULL, ",");
|
||||
char *tsakprioritySTR = strtok(NULL, ",");
|
||||
char *tsakspareSTR = strtok(NULL, ",");
|
||||
|
||||
char *taskcreation_dateSTR = strtok(NULL, ",");
|
||||
char *taskdeadline_dateSTR = strtok(NULL, ",");
|
||||
char *taskprioritySTR = strtok(NULL, ",");
|
||||
char *taskspareSTR = strtok(NULL, ",");
|
||||
|
||||
// convert char in integer and date
|
||||
unsigned long int taskcreation_date = strtoul(taskcreation_dateSTR,NULL,10);
|
||||
unsigned long int taskdeadline_date = strtoul(taskdeadline_dateSTR,NULL,10);
|
||||
unsigned long int taskspare = strtoul(taskspareSTR,NULL,10);
|
||||
int priority = atoi(prioritySTR);
|
||||
|
||||
|
||||
|
||||
//create Task
|
||||
Task *task = newTask(taskname, taskcreation_date, taskdeadline_date, taskpriority, taskspare);
|
||||
|
||||
unsigned long int taskcreation_date =
|
||||
strtoul(taskcreation_dateSTR, NULL, 10);
|
||||
unsigned long int taskdeadline_date =
|
||||
strtoul(taskdeadline_dateSTR, NULL, 10);
|
||||
unsigned long int taskspare = strtoul(taskspareSTR, NULL, 10);
|
||||
int priority = atoi(taskprioritySTR);
|
||||
|
||||
// create Task
|
||||
Task *task = newTask(taskname, taskcreation_date, taskdeadline_date,
|
||||
priority, taskspare);
|
||||
|
||||
// Insert task into the linked list
|
||||
if (list == NULL) {
|
||||
// If the list is empty, initialize it with the first task
|
||||
list = llistNew(task, cmpTaskN);
|
||||
}
|
||||
else {
|
||||
} else {
|
||||
// Append the task to the linked list
|
||||
llistAppend(list, task);
|
||||
}
|
||||
@@ -104,8 +100,5 @@ void write_csv_to_llist(const char* filename) {
|
||||
|
||||
fclose(file);
|
||||
}
|
||||
|
||||
|
||||
|
||||
return list; // null on error
|
||||
}
|
||||
|
||||
@@ -5,5 +5,5 @@
|
||||
|
||||
#endif
|
||||
|
||||
extern void write_linkedlist_to_csv(llist* head, const char* filename)
|
||||
extern void write_csv_to_llist(const char* filename)
|
||||
void write_linkedlist_to_csv(llist *head, const char *filename);
|
||||
llist *write_csv_to_llist(const char *filename);
|
||||
@@ -269,3 +269,71 @@ llist *genPlan(llist *head, time_t timeAvail) {
|
||||
|
||||
return events_ll;
|
||||
}
|
||||
|
||||
const char *iCalHeader = "BEGIN:VCALENDAR\r\n"
|
||||
"VERSION:2.0\r\n"
|
||||
"PRODID:-//hacksw/handcal//NONSGML v1.0//EN\r\n";
|
||||
const char *iCalEvent = "BEGIN:VEVENT\r\n"
|
||||
"UID:%s%d\r\n"
|
||||
"DTSTAMP:%s\r\n"
|
||||
"DTSTART:%s\r\n"
|
||||
"DTEND:%s\r\n"
|
||||
"SUMMARY:%s\r\n"
|
||||
"END:VEVENT\r\n";
|
||||
|
||||
int exportiCal(llist *events_ll) {
|
||||
|
||||
llist *ev_ll = events_ll;
|
||||
|
||||
llistPrintE(ev_ll);
|
||||
|
||||
printf("%s", iCalHeader);
|
||||
|
||||
time_t now = time(NULL);
|
||||
struct tm lc;
|
||||
localtime_r(&now, &lc);
|
||||
|
||||
// gen filename & open for write
|
||||
char nameBuf[32];
|
||||
strftime(nameBuf, 32 - 12, "%F", &lc);
|
||||
strcat(nameBuf, "dayplan.ics");
|
||||
FILE *fp = fopen(nameBuf, "w");
|
||||
if (fp == NULL) {
|
||||
planLog("fopen failed!!", 1);
|
||||
return 1;
|
||||
}
|
||||
// write iCal header to file
|
||||
fprintf(fp, "%s", iCalHeader);
|
||||
|
||||
// for every event in events_ll create VEVENT str and write to fp
|
||||
int count = 0;
|
||||
while (ev_ll != NULL) {
|
||||
// gen iCal compatible time str
|
||||
Event *current = ev_ll->data;
|
||||
struct tm startlc;
|
||||
struct tm endlc;
|
||||
localtime_r(¤t->plannedStartTime, &startlc);
|
||||
localtime_r(¤t->plannedEndTime, &endlc);
|
||||
char timeStartBuf[17];
|
||||
char timeEndBuf[17];
|
||||
char timeStamp[17];
|
||||
strftime(timeStamp, 17, "%Y%m%dT%k%M%SZ", &lc);
|
||||
printf("%s\n", timeStamp);
|
||||
strftime(timeStartBuf, 17, "%Y%m%dT%k%M%SZ", &startlc);
|
||||
printf("%s\n", timeStartBuf);
|
||||
strftime(timeEndBuf, 17, "%Y%m%dT%k%M%SZ", &endlc);
|
||||
printf("%s\n", timeEndBuf);
|
||||
|
||||
fprintf(fp, iCalEvent, current->task->name, count, timeStamp, timeStartBuf,
|
||||
timeEndBuf, current->task->name);
|
||||
ev_ll = ev_ll->next;
|
||||
count += 1;
|
||||
}
|
||||
|
||||
// after all events are written end cal with
|
||||
// END:VCALENDAR
|
||||
fprintf(fp, "END:VCALENDAR\r\n");
|
||||
fclose(fp);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -83,4 +83,6 @@ int cmpEvent(const void *a, const void *b);
|
||||
*/
|
||||
llist *genPlan(llist *head, time_t timeAvail);
|
||||
|
||||
int exportiCal(llist *head);
|
||||
|
||||
#endif // !PLANNER
|
||||
+1
-1
@@ -9,7 +9,7 @@
|
||||
#include <stdlib.h>
|
||||
#include <time.h>
|
||||
|
||||
int main() {
|
||||
int test() {
|
||||
|
||||
time_t now = time(NULL);
|
||||
|
||||
|
||||
@@ -3,156 +3,167 @@
|
||||
*
|
||||
*/
|
||||
/* Created by Juergen Buechel, 13.12.2024/
|
||||
*/
|
||||
*/
|
||||
#include "ui.h"
|
||||
#include "db.h"
|
||||
#include "llist.h"
|
||||
#include "planner.h" // for subject and event structs
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include "ui.h"
|
||||
#include "planner.h"
|
||||
#include "iCal.h"
|
||||
#include "db.h"
|
||||
#include <time.h>
|
||||
|
||||
typedef struct task {
|
||||
char name;
|
||||
int priority;
|
||||
struct task *nextTask;
|
||||
};
|
||||
const char *dbName = "db.csv";
|
||||
|
||||
typedef struct task task_1;
|
||||
typedef struct task* task_ptr;
|
||||
task_ptr firsttask = NULL;
|
||||
int main(void) {
|
||||
char taskname[256]; // taskName Buffer
|
||||
int taskcreation_date = 0;
|
||||
int taskdeadline_date = 0;
|
||||
int taskpriority = 0;
|
||||
int taskspare = 0;
|
||||
|
||||
typedef struct time {
|
||||
int time;
|
||||
struct time *nextTime;
|
||||
};
|
||||
|
||||
typedef struct time time_1;
|
||||
typedef struct time* time_ptr;
|
||||
time_ptr firsttime = NULL;
|
||||
|
||||
void dump_buffer(FILE *fp){
|
||||
int ch;
|
||||
while((ch = fgetc(fp)) != EOF && ch != '\n');
|
||||
}
|
||||
|
||||
|
||||
void insertTask(task_ptr newtask)
|
||||
{
|
||||
task_ptr TaskPointer;
|
||||
if (firsttask == NULL){
|
||||
firsttask = newtask;
|
||||
newtask->nextTask ;
|
||||
}
|
||||
else {
|
||||
TaskPointer = firsttask;
|
||||
while(TaskPointer->nextTask!=NULL)
|
||||
{
|
||||
TaskPointer = TaskPointer->nextTask;
|
||||
}
|
||||
TaskPointer->nextTask = newtask;
|
||||
newtask ->nextTask;
|
||||
}
|
||||
}
|
||||
|
||||
void newTask (void)
|
||||
{
|
||||
task_ptr new = malloc(sizeof(task_1));
|
||||
if (new == NULL){
|
||||
printf("Die Liste ist leer?!\n");
|
||||
}
|
||||
printf(" Neues Fach eigeben: ");
|
||||
if(scanf("%d", &newTask)!=1)
|
||||
{
|
||||
dump_buffer(stdin);
|
||||
printf("Fehlerhafte eingabe\n");
|
||||
free(new);
|
||||
return;
|
||||
}
|
||||
dump_buffer (stdin);
|
||||
insertTask(new);
|
||||
}
|
||||
|
||||
void inserttime(time_ptr newtime)
|
||||
{
|
||||
time_ptr TimePointer;
|
||||
if (firsttime == NULL){
|
||||
firsttime = newtime;
|
||||
newtime->nextTime =NULL;
|
||||
}
|
||||
else {
|
||||
TimePointer = firsttime;
|
||||
while(TimePointer->nextTime!=NULL)
|
||||
{
|
||||
TimePointer = TimePointer->nextTime;
|
||||
}
|
||||
TimePointer->nextTime = newtime;
|
||||
newtime ->nextTime = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
void newTime(void)
|
||||
{
|
||||
time_ptr newtime = malloc(sizeof(task_1));
|
||||
if (newtime == NULL){
|
||||
printf("Die Liste ist leer?!\n");
|
||||
}
|
||||
printf(" Neue Zeit eingeben: ");
|
||||
if(scanf("%d",&newTime)!=1)
|
||||
{
|
||||
dump_buffer(stdin);
|
||||
printf("Fehlerhafte eingabe\n");
|
||||
free(newtime);
|
||||
return;
|
||||
}
|
||||
dump_buffer (stdin);
|
||||
inserttime(newtime);
|
||||
}
|
||||
|
||||
void tasklisting(void){
|
||||
task_ptr TaskPointer = firsttask;
|
||||
printf("Erfasste Fächer:\n");
|
||||
while(TaskPointer!=NULL)
|
||||
printf("\t->%d\n", TaskPointer->name);
|
||||
TaskPointer = TaskPointer->nextTask;
|
||||
}
|
||||
|
||||
void getlink (void)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
llist *listT = NULL;
|
||||
llist *listE = NULL;
|
||||
int choice = 0, i = 0;
|
||||
do
|
||||
{
|
||||
do {
|
||||
printf(" -1- Neues Fach eingeben\n");
|
||||
printf(" -2- Verfuegbare Zeit eingeben\n");
|
||||
printf(" -3- Alle vorhandenen Faecher aufliesten\n");
|
||||
printf(" -4- Kalenderlink ausgeben\n");
|
||||
printf(" -5- Planer beenden\n");
|
||||
if( scanf("%d", &choice) != 1){
|
||||
printf("Falsche Eingabe\n");};
|
||||
choice = 0;
|
||||
dump_buffer(stdin);
|
||||
printf(" -5- Faecher Importieren\n");
|
||||
printf(" -6- Planer beenden\n");
|
||||
printf(" Wähle die gewünschte Option aus\n");
|
||||
if (scanf("%d", &choice) != 1) {
|
||||
printf("Falsche Eingabe\n");
|
||||
};
|
||||
// choice = 0;
|
||||
|
||||
switch (choice)
|
||||
{
|
||||
case 1: newTask();break;
|
||||
case 2: newTime();break;
|
||||
case 3: if( firsttask == NULL){
|
||||
switch (choice) {
|
||||
case 1:
|
||||
printf(" Geben sie das gewünschte Fach ein: \n");
|
||||
time_t now = time(NULL);
|
||||
struct tm lc;
|
||||
localtime_r(&now, &lc);
|
||||
if (fscanf(stdin, "%s", taskname) <= 0) {
|
||||
printf("Ungültige Eingabe für den Namen.\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
printf(" Wie viel Zeit bleibt ihnen (tage bis deadline):\n");
|
||||
if (scanf("%d", &taskdeadline_date) != 1) {
|
||||
printf("Ungültige Eingabe.\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
printf(" Gib die Priorität des Faches an: \n");
|
||||
if (scanf("%d", &taskpriority) != 1) {
|
||||
printf("Ungültige Eingabe.\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
// printf(" Wie viel Zeit habe Sie für dieses Fach: \n");
|
||||
// if (scanf("%d", &taskspare) != 1) {
|
||||
// printf("Ungültige Eingabe.\n");
|
||||
// return -1;
|
||||
// }
|
||||
|
||||
// create deadline timestamp
|
||||
lc.tm_yday += taskdeadline_date;
|
||||
time_t deadline = mktime(&lc);
|
||||
Task *newT = newTask(taskname, now, deadline, taskpriority, 0);
|
||||
if (listT == NULL) {
|
||||
listT = llistNew(newT, cmpTaskN);
|
||||
} else {
|
||||
llistAppend(listT, newT);
|
||||
}
|
||||
|
||||
break;
|
||||
case 2:
|
||||
printf(
|
||||
"Geben Sie die zur verfuegung stehende Zeit für die Fächer an: \n");
|
||||
scanf("%d", &taskspare);
|
||||
// if list exists use it to generate plan
|
||||
if (listT != NULL) {
|
||||
listE = genPlan(listT, taskspare);
|
||||
write_linkedlist_to_csv(listT, dbName);
|
||||
} else {
|
||||
printf("list is empty!");
|
||||
return -1;
|
||||
}
|
||||
break;
|
||||
|
||||
case 3:
|
||||
if (listT == NULL) {
|
||||
printf("Die Liste ist leer");
|
||||
} else {
|
||||
llistPrintT(listT);
|
||||
// llist *iterator = list;
|
||||
// while (iterator != NULL) {
|
||||
// Task *currentTask = (Task *)(iterator->data); // Cast zu Task
|
||||
// printf("Fach: %s, Deadline: %ld, Priorität: %d\n",
|
||||
// currentTask->name, currentTask->deadline,
|
||||
// currentTask->priority);
|
||||
// iterator = iterator->next; // Gehe zum nächsten Listenelement
|
||||
// }
|
||||
}
|
||||
else{
|
||||
tasklisting();
|
||||
}break;
|
||||
case 4: iCAl();break;
|
||||
break;
|
||||
// // case 4: iCAl();break;
|
||||
//
|
||||
// printf(" Wie viel Zeit bleibt ihnen:\n");
|
||||
// if (scanf("%d", &taskdeadline_date) != 1) {
|
||||
// printf("Ungültige Eingabe.\n");
|
||||
// return -1;
|
||||
// }
|
||||
//
|
||||
// printf(" Gib die Priorität des Faches an: \n");
|
||||
// if (scanf("%d", &taskpriority) != 1) {
|
||||
// printf("Ungültige Eingabe.\n");
|
||||
// return -1;
|
||||
// }
|
||||
//
|
||||
// printf(" Wie viel Zeit habe Sie für dieses Fach: \n");
|
||||
// if (scanf("%d", &taskspare) != 1) {
|
||||
// printf("Ungültige Eingabe.\n");
|
||||
// return -1;
|
||||
// }
|
||||
// break;
|
||||
case 4:
|
||||
if (listE == NULL || taskspare <= 0) {
|
||||
printf("vor Export erst task list erstellen, dann verfuegbare zeit "
|
||||
"eingeben!\n");
|
||||
break;
|
||||
}
|
||||
}while (choice !=5);
|
||||
exportiCal(listE);
|
||||
// printf(
|
||||
// "Geben Sie die zur verfuegung stehende Zeit für die Fächer an:
|
||||
// \n");
|
||||
// scanf("%d", &taskspare);
|
||||
|
||||
break;
|
||||
case 5:
|
||||
listT = write_csv_to_llist(dbName);
|
||||
break;
|
||||
|
||||
case 6:
|
||||
printf("Goodbye!\n");
|
||||
if (listE != NULL)
|
||||
llistFreeE(listE);
|
||||
if (listT != NULL)
|
||||
llistPrintT(listT);
|
||||
// if (task == NULL) {//task?
|
||||
// printf("Die Liste ist leer");
|
||||
// } else {
|
||||
// llist *iterator = list;
|
||||
// while (iterator != NULL) {
|
||||
// Task *currentTask = (Task *)(iterator->data); // Cast zu Task
|
||||
// printf("Fach: %s, Deadline: %ld, Priorität: %d\n",
|
||||
// currentTask->name, currentTask->deadline,
|
||||
// currentTask->priority);
|
||||
// iterator = iterator->next; // Gehe zum nächsten Listenelement
|
||||
// }
|
||||
// }
|
||||
return EXIT_SUCCESS;
|
||||
// case 4: iCAl();break;
|
||||
}
|
||||
} while (choice < 6);
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in new issue
Block a user