2024-12-09 19:27:50 +01:00
|
|
|
/*
|
2024-12-10 22:12:25 +01:00
|
|
|
* INPUT: query for previous state
|
|
|
|
* linked list of subjects to store
|
2024-12-10 22:06:49 +01:00
|
|
|
*
|
|
|
|
* OUTPUT:
|
|
|
|
* linked list of subjects from file
|
|
|
|
* OK
|
|
|
|
*
|
|
|
|
*
|
2024-12-09 19:27:50 +01:00
|
|
|
*/
|
2024-12-10 17:42:45 +01:00
|
|
|
|
2024-12-10 22:06:49 +01:00
|
|
|
#include "planner.h"
|
|
|
|
#include <stdio.h>
|
2024-12-10 17:42:45 +01:00
|
|
|
|
2024-12-11 01:08:31 +01:00
|
|
|
// serialize struct test format
|
|
|
|
const char format[] = "{%s = {%lu, %lu, %d, %lu}\n";
|
|
|
|
|
|
|
|
int serialize(Task *s) {
|
|
|
|
printf(format, s->name, s->created, s->deadline, s->priority, s->spare);
|
2024-12-10 22:06:49 +01:00
|
|
|
return 0;
|
2024-12-10 17:42:45 +01:00
|
|
|
}
|