-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcyb_types.h
66 lines (54 loc) · 2.41 KB
/
cyb_types.h
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
/* -----------------------------------------------------------------------------
* The Cyberiada GraphML library implemention
*
* The basic data structures
*
* Copyright (C) 2024 Alexey Fedoseev <aleksey@fedoseev.net>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see https://www.gnu.org/licenses/
*
* ----------------------------------------------------------------------------- */
#ifndef __CYBERIADA_TYPES_H
#define __CYBERIADA_TYPES_H
#ifdef __cplusplus
extern "C" {
#endif
/* -----------------------------------------------------------------------------
* The Cyberiada GraphML basic data structures: stack and list
* ----------------------------------------------------------------------------- */
struct _CyberiadaStruct {
void* key;
void* data;
struct _CyberiadaStruct* next;
};
typedef struct _CyberiadaStruct CyberiadaStack;
int cyberiada_stack_push(CyberiadaStack** stack);
int cyberiada_stack_update_top_key(CyberiadaStack** stack, const char* new_key);
int cyberiada_stack_update_top_data(CyberiadaStack** stack, void* new_data);
void* cyberiada_stack_get_top_data(CyberiadaStack** stack);
int cyberiada_stack_pop(CyberiadaStack** stack);
int cyberiada_stack_is_empty(CyberiadaStack** stack);
int cyberiada_stack_free(CyberiadaStack** stack);
typedef struct _CyberiadaStruct CyberiadaList;
int cyberiada_list_add(CyberiadaList** list, const char* key, void* data);
void* cyberiada_list_find(CyberiadaList** list, const char* key);
int cyberiada_list_free(CyberiadaList** list);
typedef struct _CyberiadaStruct CyberiadaQueue;
int cyberiada_queue_add(CyberiadaQueue** queue, void* key, void* data);
int cyberiada_queue_get(CyberiadaQueue** queue, void** key, void**data);
int cyberiada_queue_free(CyberiadaQueue** queue);
#ifdef __cplusplus
}
#endif
#endif