Uses of Interface
com.google.uzaygezen.core.BitVector

Packages that use BitVector

Package	Description
com.google.uzaygezen.core	Compact Hilbert index mappings and backtracking query building support for persistence systems.

Uses of BitVector in com.google.uzaygezen.core

Classes in com.google.uzaygezen.core that implement BitVector

Modifier and Type	Class and Description
class	BitSetBackedBitVector Adapts BitSet to the BitVector abstraction.
class	LongArrayBitVector An implementation of BitVector based on an array of longs.
class	LongBitVector BitVector implementation for vectors of length 64 or less.

Methods in com.google.uzaygezen.core that return BitVector

Modifier and Type	Method and Description
BitVector	BitVector.clone()
static BitVector	TestUtils.createBitVector(long initialValue, int bitCount) To be used by those tests methods which don't care about which type of bit vector is instantiated.
BitVector	Pow2LengthBitSetRange.getStart()

Methods in com.google.uzaygezen.core that return types with arguments of type BitVector

Modifier and Type	Method and Description
Map<BitVector,V>	MapRegionInspector.getDisguisedCacheHits()

Methods in com.google.uzaygezen.core with parameters of type BitVector

Modifier and Type	Method and Description
void	LongBitVector.and(BitVector o)
void	LongArrayBitVector.and(BitVector o)
void	BitVector.and(BitVector o)
void	BitSetBackedBitVector.and(BitVector o)
void	LongBitVector.andNot(BitVector o)
void	LongArrayBitVector.andNot(BitVector o)
void	BitVector.andNot(BitVector o)
void	BitSetBackedBitVector.andNot(BitVector o)
int	LongBitVector.compareTo(BitVector o)
int	LongArrayBitVector.compareTo(BitVector o)
int	BitVector.compareTo(BitVector o) Compares the unsigned numbers having the pattern in this and the other bit vectors, respectively, as the little endian representation.
int	BitSetBackedBitVector.compareTo(BitVector o)
static LongArrayBitVector	LongArrayBitVector.concat(BitVector... bits)
void	LongBitVector.copyFrom(BitVector from)
void	LongArrayBitVector.copyFrom(BitVector from)
void	BitVector.copyFrom(BitVector from) Makes this BitVector equal to the other bit vector.
void	BitSetBackedBitVector.copyFrom(BitVector from)
void	LongBitVector.copyFromSection(BitVector src, int fromIndex)
void	LongArrayBitVector.copyFromSection(BitVector src, int fromIndex)
void	BitVector.copyFromSection(BitVector src, int fromIndex) Copies size() bits from src, starting with fromIndex.
void	BitSetBackedBitVector.copyFromSection(BitVector src, int fromIndex)
void	HilbertIndexMasks.copyMaskTo(int i, int d, BitVector mu) Computes the mask pattern that identifies at iteration i which dimensions have enough bits to be meaningful.
void	LongBitVector.copySectionFrom(int offset, BitVector src)
void	LongArrayBitVector.copySectionFrom(int offset, BitVector src)
void	BitVector.copySectionFrom(int offset, BitVector src) Copies all src.size() bits from src into this bit vector, starting with position offset.
void	BitSetBackedBitVector.copySectionFrom(int offset, BitVector src)
void	LongBitVector.grayCodeRank(BitVector mu, BitVector w)
void	LongArrayBitVector.grayCodeRank(BitVector mu, BitVector w)
void	BitVector.grayCodeRank(BitVector mu, BitVector w) If one puts all the numbers which have the gray code inverse fixed in all bit positions which are zero in mu, and they are equal in those bit positions to the corresponding bits in w, and sorts all those numbers increasingly, then there will be exactly one such number that has the gray code inverse exactly equal to w.
void	BitSetBackedBitVector.grayCodeRank(BitVector mu, BitVector w)
void	LongBitVector.grayCodeRankInverse(BitVector mu, BitVector known, BitVector r)
void	LongArrayBitVector.grayCodeRankInverse(BitVector mu, BitVector known, BitVector r)
void	BitVector.grayCodeRankInverse(BitVector mu, BitVector known, BitVector r) Giving the name i to the bit set represented by this, this method computes the inverse function for grayCodeRank(com.google.uzaygezen.core.BitVector, com.google.uzaygezen.core.BitVector).
void	BitSetBackedBitVector.grayCodeRankInverse(BitVector mu, BitVector known, BitVector r)
void	CompactHilbertCurve.index(BitVector[] p, int minLevel, BitVector index) Computes the compact Hilbert index of the n-point p.
void	CompactHilbertCurve.index(BitVector[] p, int minLevel, BitVector index) Computes the compact Hilbert index of the n-point p.
void	IndexCalculator.index(BitVector[] p, int minLevel, BitVector index) Computes the index on the curve of the multidimensional point p.
void	IndexCalculator.index(BitVector[] p, int minLevel, BitVector index) Computes the index on the curve of the multidimensional point p.
void	CompactHilbertCurve.indexInverse(BitVector index, BitVector[] p) Computes the unique n-point p having index as its compact Hilbert index in this multidimensional space.
void	CompactHilbertCurve.indexInverse(BitVector index, BitVector[] p) Computes the unique n-point p having index as its compact Hilbert index in this multidimensional space.
void	SpaceFillingCurve.indexInverse(BitVector index, BitVector[] p) Given the index of a point, computes the coordinates of the point.
void	SpaceFillingCurve.indexInverse(BitVector index, BitVector[] p) Given the index of a point, computes the coordinates of the point.
boolean	LongBitVector.intersects(BitVector o)
boolean	LongArrayBitVector.intersects(BitVector set)
boolean	BitVector.intersects(BitVector set)
boolean	BitSetBackedBitVector.intersects(BitVector o)
static LongArrayBitVector	LongArrayBitVector.of(BitVector bitvector)
void	LongBitVector.or(BitVector o)
void	LongArrayBitVector.or(BitVector o)
void	BitVector.or(BitVector o) Bitwise or with given BitVector
void	BitSetBackedBitVector.or(BitVector o)
static void	BitVectorMath.split(BitVector bs, BitVector[] result) Splits the bits from bs into result by putting the lowest bits at the end of result and so on until the highest bits are put at the beginning of result.
static void	BitVectorMath.split(BitVector bs, BitVector[] result) Splits the bits from bs into result by putting the lowest bits at the end of result and so on until the highest bits are put at the beginning of result.
boolean	ZoomingSpaceVisitorAdapter.visit(int level, BitVector index, BitVector[] p)
boolean	ZoomingSpaceVisitorAdapter.visit(int level, BitVector index, BitVector[] p)
boolean	ZoomingNavigator.visit(int level, BitVector index, BitVector[] p)
boolean	ZoomingNavigator.visit(int level, BitVector index, BitVector[] p)
void	LongBitVector.xor(BitVector o)
void	LongArrayBitVector.xor(BitVector o)
void	BitVector.xor(BitVector o)
void	BitSetBackedBitVector.xor(BitVector o)

Method parameters in com.google.uzaygezen.core with type arguments of type BitVector

Modifier and Type	Method and Description
Map<Pow2LengthBitSetRange,NodeValue<V>>	Pow2LengthBitSetRangeFactory.apply(MapNode<BitVector,V> from)
static LongArrayBitVector	LongArrayBitVector.concat(Iterable<BitVector> bitVectors)

Constructors in com.google.uzaygezen.core with parameters of type BitVector

Constructor and Description
Pow2LengthBitSetRange(BitVector start, int level)