parQHV
Compute HyperVolumes using threads
|
A splitter for storing classified points. The splitter is an array that grows dinamically, when all points are inserted they are separeted into classes by sorting. Preferably count sort or hased count sort. More...
#include "division.h"
#include "tdata.h"
Go to the source code of this file.
Functions | |
void | initSplitter (struct spData *sd) |
void | destroySplitter (struct spData *sd) |
void | push (int idx, int tp, struct spData *sd) |
division | newDivision (point *PS, point *o, point *p, struct spData *sd) |
A splitter for storing classified points. The splitter is an array that grows dinamically, when all points are inserted they are separeted into classes by sorting. Preferably count sort or hased count sort.
Definition in file splitter.h.
void destroySplitter | ( | struct spData * | sd | ) |
void initSplitter | ( | struct spData * | sd | ) |
Initial routines of the splitter object
< Change to binomials
Definition at line 78 of file splitter.c.
< Alloced point index space
< Total counter
< First time hypoct is seen
1.2 Group Elements together
< left part of oct
< Right part of oct
< Bit, dimension project
Computes the number of dominant points j and reorders the array so that they appear at the beginning
Last position was there because of the previous procedure Update
Doing cleanUp Stuff
Preparing the struct for output
Definition at line 129 of file splitter.c.
void push | ( | int | idx, |
int | tp, | ||
struct spData * | sd | ||
) |
Push a new elements into the splitter
S | The splitter |
idx | The point index |
tp | The type/oct |
< Put type
< Put point
< Add another one of this type
Definition at line 114 of file splitter.c.