QHV
Compute HyperVolumes sequentially
|
Structure for uniting two sets, without repetition. More...
Go to the source code of this file.
Functions | |
void | initUnion (int n) |
void | finishUnion (void) |
void | resetUnion (void) |
int | member (int i) |
void | insertUnion (int i) |
Structure for uniting two sets, without repetition.
Definition in file unionFilter.h.
void finishUnion | ( | void | ) |
Finish the Union data structure
Definition at line 72 of file unionFilter.c.
void initUnion | ( | int | n | ) |
Initial procedures
n | Maximal number of elements |
Definition at line 53 of file unionFilter.c.
void insertUnion | ( | int | i | ) |
Insert this element into the current set
i | The element |
Definition at line 96 of file unionFilter.c.
int member | ( | int | i | ) |
i | The element |
Definition at line 91 of file unionFilter.c.
void resetUnion | ( | void | ) |
Set the object for the empty set
Definition at line 78 of file unionFilter.c.