From ebf4767701457f30281aa0ca86159911b0e1edb3 Mon Sep 17 00:00:00 2001 From: MMagueta Date: Sat, 20 Sep 2025 04:42:09 +0000 Subject: deploy: 5ed1406c81044ff73fd919b5aad184aaed0a174b --- set_8h_source.html | 131 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 131 insertions(+) create mode 100644 set_8h_source.html (limited to 'set_8h_source.html') diff --git a/set_8h_source.html b/set_8h_source.html new file mode 100644 index 0000000..f55c229 --- /dev/null +++ b/set_8h_source.html @@ -0,0 +1,131 @@ + + + + + + + +Relational Algebra Engine: include/set.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Relational Algebra Engine +
+
+
+ + + + + + + + + +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ + +
+
+
set.h
+
+
+Go to the documentation of this file.
1#ifndef SET_H
+
2#define SET_H
+
3
+
4#include <stddef.h>
+
5
+
6typedef struct Set Set;
+
7
+
8/* Function pointer type for comparison.
+
9 Should return 0 if equal, <0 if a < b, >0 if a > b */
+
10typedef int (*SetCompareFn)(const void *a, const void *b);
+
11
+
12/* Function pointer type for freeing elements (optional, can be NULL) */
+
13typedef void (*SetFreeFn)(void *elem);
+
14
+
15Set *set_create(SetCompareFn cmp, SetFreeFn freer);
+
16void set_destroy(Set *set);
+
17
+
18/* Basic operations */
+
19int set_add(Set *set, void *elem);
+
20int set_remove(Set *set, const void *elem);
+
21int set_contains(const Set *set, const void *elem);
+
22size_t set_size(const Set *set);
+
23
+
24/* Iteration */
+
25typedef void (*SetIterFn)(void *elem, void *userdata);
+
26void set_foreach(const Set *set, SetIterFn fn, void *userdata);
+
27
+
28#endif // SET_H
+
SetCompareFn
int(* SetCompareFn)(const void *a, const void *b)
Definition set.h:10
+
set_contains
int set_contains(const Set *set, const void *elem)
Check if a Set contains an element.
Definition set.c:70
+
set_size
size_t set_size(const Set *set)
Get the number of elements in a Set.
Definition set.c:131
+
SetIterFn
void(* SetIterFn)(void *elem, void *userdata)
Definition set.h:25
+
set_create
Set * set_create(SetCompareFn cmp, SetFreeFn freer)
Create a new Set.
Definition set.c:31
+
set_add
int set_add(Set *set, void *elem)
Add an element to a Set.
Definition set.c:85
+
set_remove
int set_remove(Set *set, const void *elem)
Remove an element from a Set.
Definition set.c:105
+
set_destroy
void set_destroy(Set *set)
Destroy a Set and free its memory.
Definition set.c:49
+
set_foreach
void set_foreach(const Set *set, SetIterFn fn, void *userdata)
Iterate over all elements in a Set.
Definition set.c:140
+
SetFreeFn
void(* SetFreeFn)(void *elem)
Definition set.h:13
+
Set
Definition set.c:17
+
Set::freer
SetFreeFn freer
Definition set.c:20
+
Set::cmp
SetCompareFn cmp
Definition set.c:19
+
+ +
+Generated by doxygen 1.9.8 +
+ + -- cgit v1.2.3