parQHV
Compute HyperVolumes using threads
|
Structure for uniting two sets, without repetition. More...
#include "tdata.h"
Go to the source code of this file.
Functions | |
void | initUnion (int n, struct unionData *ud) |
void | finishUnion (struct unionData *ud) |
void | resetUnion (struct unionData *ud) |
int | member (int i, struct unionData *ud) |
void | insertUnion (int i, struct unionData *ud) |
Structure for uniting two sets, without repetition.
Definition in file unionFilter.h.
void finishUnion | ( | struct unionData * | ud | ) |
Finish the Union data structure
Definition at line 66 of file unionFilter.c.
void initUnion | ( | int | n, |
struct unionData * | ud | ||
) |
Initial procedures
n | Maximal number of elements |
Definition at line 49 of file unionFilter.c.
void insertUnion | ( | int | i, |
struct unionData * | ud | ||
) |
Insert this element into the current set
i | The element |
Definition at line 93 of file unionFilter.c.
int member | ( | int | i, |
struct unionData * | ud | ||
) |
i | The element |
Definition at line 88 of file unionFilter.c.
void resetUnion | ( | struct unionData * | ud | ) |
Set the object for the empty set
< List of members
< Hash of presences
Definition at line 72 of file unionFilter.c.