blob: b4b2c017c8bb3ad22c0e41bbd878200be2fbc886 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
#ifndef VCAL_H
#define VCAL_H
#include <stdlib.h>
#include "strbuf.h"
#define TYPE strbuf
#include "linked_list.h"
#undef TYPE
typedef struct {
strbuf key;
strbuf value;
strbuf* vals;
int val_count;
} parameter;
typedef struct {
strbuf key;
LLIST(strbuf) vals;
parameter* params;
int param_count;
} content_line;
INIT_F(content_line);
INIT_F(content_line, int keylen, int vallen);
/*
* Resolves a collision in some form of structure (probably a hash-map
* or a trie). If dest is NULL just return new. Otherwise mutates dest
* to have the correct form, and returns it. Destroying new in the
* process.
*/
content_line* RESOLVE(content_line)
(content_line* dest, content_line* new);
#define TYPE content_line
#include "trie.h"
#undef TYPE
typedef struct s_vevent {
char* filename;
struct s_vcalendar* calendar;
TRIE(content_line) clines;
} vevent;
INIT_F(vevent, char* filename);
FREE_F(content_line);
int content_line_copy (content_line* dest, content_line* src);
content_line* get_property (vevent* ev, char* key);
int add_content_line (vevent* ev, content_line* c);
FREE_F(vevent);
typedef struct s_vcalendar {
size_t n_events;
size_t alloc;
vevent** events;
} vcalendar;
INIT_F(vcalendar);
int free_vcalendar (vcalendar* cal);
/*
* Appends ev to cal. Doesn't copy ev. So make sure that it wont go
* out of scope.
* TODO change this into PUSH(VCALENDAR) (vevent*) ?
*/
int push_event(vcalendar* cal, vevent* ev);
#endif /* VCAL_H */
|
