1 | #ifndef MAD_NAME_H |
---|
2 | #define MAD_NAME_H |
---|
3 | |
---|
4 | // types |
---|
5 | |
---|
6 | struct name_list; |
---|
7 | struct double_array; |
---|
8 | |
---|
9 | struct name_list /* contains list of index sorted names plus int inform. */ |
---|
10 | { |
---|
11 | char name[NAME_L]; |
---|
12 | int max, /* max. pointer array size */ |
---|
13 | curr; /* current occupation */ |
---|
14 | int* index; /* index for alphabetic access */ |
---|
15 | int* inform; /* array parallel to names with integer */ |
---|
16 | int stamp; |
---|
17 | char** names; /* element names for sort */ |
---|
18 | }; |
---|
19 | |
---|
20 | struct vector_list /* contains named vectors */ |
---|
21 | { |
---|
22 | int curr, max; |
---|
23 | struct name_list* names; |
---|
24 | struct double_array** vectors; |
---|
25 | }; |
---|
26 | |
---|
27 | // interface |
---|
28 | |
---|
29 | char* get_new_name(void); |
---|
30 | int add_to_name_list(char* name, int inf, struct name_list* vlist); |
---|
31 | // double find_value(char* name, int ntok, char** toks); |
---|
32 | int name_list_pos(const char* p, struct name_list* vlist); |
---|
33 | |
---|
34 | struct name_list* new_name_list(char* list_name, int length); |
---|
35 | struct name_list* clone_name_list(struct name_list*); |
---|
36 | struct name_list* delete_name_list(struct name_list*); |
---|
37 | void dump_name_list(struct name_list*); |
---|
38 | void copy_name_list(struct name_list* out, struct name_list* in); |
---|
39 | void grow_name_list(struct name_list*); |
---|
40 | int add_to_name_list(char* name, int inf, struct name_list*); |
---|
41 | // int name_list_pos(char* p, struct name_list*); |
---|
42 | |
---|
43 | struct vector_list* new_vector_list(int length); |
---|
44 | struct vector_list* delete_vector_list(struct vector_list*); |
---|
45 | void grow_vector_list(struct vector_list*); |
---|
46 | |
---|
47 | #endif // MAD_NAME_H |
---|
48 | |
---|