public class HilbertIndexMasks extends Object
| Constructor and Description |
|---|
HilbertIndexMasks(MultiDimensionalSpec spec) |
| Modifier and Type | Method and Description |
|---|---|
List<Integer> |
cardinalities() |
void |
copyMaskTo(int i,
int d,
BitVector mu)
Computes the mask pattern that identifies at iteration
i which
dimensions have enough bits to be meaningful. |
int |
getCardinality(int i)
Computes how many dimensions have more than
i bits. |
public HilbertIndexMasks(MultiDimensionalSpec spec)
public int getCardinality(int i)
i bits.i - must be less than mMaxpublic void copyMaskTo(int i,
int d,
BitVector mu)
i which
dimensions have enough bits to be meaningful. The result will have a
capacity of n bits, where each meaningful dimension will have a set
bit in its corresponding position, with a shift of d, but
considering the bits in reverse order. We reverse the order so as to obtain
a standard Hilbert curve orientation.i - iteration number. Must be less than mMax.d - intra subhypercube direction. Must be less than the number of
dimensions.mu - outputCopyright © 2014. All Rights Reserved.