|
Relational Algebra Engine
|
Set implementation for the Relational Algebra Engine. More...

Classes | |
| struct | SetNode |
| struct | Set |
Typedefs | |
| typedef struct SetNode | SetNode |
Functions | |
| Set * | set_create (SetCompareFn cmp, SetFreeFn freer) |
| Create a new Set. | |
| void | set_destroy (Set *set) |
| Destroy a Set and free its memory. | |
| int | set_contains (const Set *set, const void *elem) |
| Check if a Set contains an element. | |
| int | set_add (Set *set, void *elem) |
| Add an element to a Set. | |
| int | set_remove (Set *set, const void *elem) |
| Remove an element from a Set. | |
| size_t | set_size (const Set *set) |
| Get the number of elements in a Set. | |
| void | set_foreach (const Set *set, SetIterFn fn, void *userdata) |
| Iterate over all elements in a Set. | |
Set implementation for the Relational Algebra Engine.
Implements a generic set data structure used to represent relations and tuples as sets, in accordance with relational theory.
| int set_add | ( | Set * | set, |
| void * | elem | ||
| ) |
| int set_contains | ( | const Set * | set, |
| const void * | elem | ||
| ) |
| Set * set_create | ( | SetCompareFn | cmp, |
| SetFreeFn | freer | ||
| ) |
| void set_destroy | ( | Set * | set | ) |
| int set_remove | ( | Set * | set, |
| const void * | elem | ||
| ) |