Compare commits
17
Commits
ui.c
...
08145cd4a2
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
08145cd4a2 | ||
|
|
f72c98de28 | ||
|
|
a302bfc4e8 | ||
|
|
d428589063 | ||
|
|
1fb016296b | ||
|
|
dd88cd8b64 | ||
|
|
24f0e9e7ec | ||
|
|
63ee77f5c4 | ||
|
|
cf63dc4712 | ||
|
|
bf14307a71 | ||
|
|
b792eed3d2 | ||
|
|
ad20db3995 | ||
|
|
81c62f892d | ||
|
|
f6cea89dd2 | ||
|
|
b308dc4c95 | ||
|
|
834b3270b9 | ||
|
|
0ef20822fd |
No files matched your search
@@ -4,155 +4,128 @@
|
||||
*/
|
||||
/* 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"
|
||||
|
||||
typedef struct task {
|
||||
char name;
|
||||
int priority;
|
||||
struct task *nextTask;
|
||||
};
|
||||
int main(void) {
|
||||
char taskname[256]; // taskName Buffer
|
||||
int taskcreation_date = 0;
|
||||
int taskdeadline_date = 0;
|
||||
int taskpriority = 0;
|
||||
int taskspare = 0;
|
||||
|
||||
typedef struct task task_1;
|
||||
typedef struct task* task_ptr;
|
||||
task_ptr firsttask = NULL;
|
||||
|
||||
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 *list = llistNew(NULL, cmpTaskN);
|
||||
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");
|
||||
printf(" Wähle die gewünschte Option aus\n");
|
||||
if (scanf("%d", &choice) != 1) {
|
||||
printf("Falsche Eingabe\n");};
|
||||
printf("Falsche Eingabe\n");
|
||||
};
|
||||
choice = 0;
|
||||
dump_buffer(stdin);
|
||||
|
||||
switch (choice)
|
||||
{
|
||||
case 1: newTask();break;
|
||||
case 2: newTime();break;
|
||||
case 3: if( firsttask == NULL){
|
||||
printf("Die Liste ist leer");
|
||||
while ((choice < 1 || choice > 5)) {
|
||||
switch (choice) {
|
||||
case 1: {
|
||||
printf(" Geben sie das gewünschte Fach ein: \n");
|
||||
if (scanf("%c", taskname) != 1) {
|
||||
printf("Ungültige Eingabe für den Namen.\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
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 2:
|
||||
printf(
|
||||
"Geben Sie die zur verfuegung stehende Zeit für die Fächer an: \n");
|
||||
scanf("%c", &taskspare);
|
||||
break;
|
||||
|
||||
case 3:
|
||||
// if (task == NULL) {
|
||||
// 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
|
||||
// }
|
||||
// }
|
||||
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:
|
||||
printf(
|
||||
"Geben Sie die zur verfuegung stehende Zeit für die Fächer an: \n");
|
||||
scanf("%d", &taskspare);
|
||||
break;
|
||||
|
||||
case 5:
|
||||
// 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
|
||||
// }
|
||||
// }
|
||||
break;
|
||||
// case 4: iCAl();break;
|
||||
}
|
||||
}
|
||||
else{
|
||||
tasklisting();
|
||||
}break;
|
||||
case 4: iCAl();break;
|
||||
}
|
||||
} while (choice != 5);
|
||||
{
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
}
|
||||
Reference in new issue
Block a user