File List

Here is a list of all documented files with brief descriptions:

arrayList.h	This header implements an arrayList for integers
counterHash.c
counterHash.h	A hash for containing counter values
division.c	The splitter data structure
division.h
divisionStruct.c
dominant.c
dominant.h
gdb.h
HSO.c
HSO.h	Header: copy HSO
inexclusion.c	The PTS array is where I store the points. The combinations are simply integers. The bits to one indicate the points included in the combination. The C2P array maps from combinations to positions in PTS
inexclusion.h	Inclusion Exclusion Algorithm better than HSO for high d and small n
macros.h
main.c
naiverandom.c
naiverandom.h	Header: copy naiverandom
point.c
point.h	Simple point interface. Contains simple point manipulation functions
quickhvolume.c
quickhvolume.h
splitter.c
splitter.h	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
subsets.c
subsets.h	This returns iterators for diferent type. WARNING, these objects are singleton, so new overwrites existing iterator;
unionFilter.c
unionFilter.h	Structure for uniting two sets, without repetition