blob: e4140a6d451772e0b08691205de2d1e775441e5f (
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
|
#ifndef UTILS_H_
#define UTILS_H_
#include <stddef.h>
typedef void *data_t;
typedef struct str_array {
char **str;
size_t n;
} str_array_t;
typedef struct generic_array {
void *data;
size_t elem_size;
size_t n;
} generic_array_t;
typedef struct node {
data_t data;
struct node *next;
} node_t;
typedef struct queue {
node_t *front;
node_t *rear;
} queue_t;
int regex_match(const char *, str_array_t, str_array_t *);
generic_array_t create_array(size_t elem_size, size_t n);
void free_array(generic_array_t *array);
void resize_array(generic_array_t *array, size_t new_size);
void *get_element(generic_array_t *array, size_t index);
void free_and_nullify(void *p);
str_array_t create_str_array(size_t n);
void free_str_array(str_array_t *array);
void resize_str_array(str_array_t *array, size_t new_size);
int set_str_element(str_array_t *array, size_t index, const char *value);
const char *get_str_element(str_array_t *array, size_t index);
queue_t create_queue(void);
int is_empty_queue(queue_t *queue);
void enqueue(queue_t *queue, data_t data);
data_t dequeue(queue_t *queue);
void free_queue(queue_t *queue);
#endif
|
