Top Description Constructors Methods

com.carrotsearch.hppc

pack-priv final Class BitUtil

Class Inheritance

extends Object

java.lang.Object
com.carrotsearch.hppc.BitUtil

A variety of high efficiency bit twiddling routines.

Constructor Summary

Access	Constructor and Description
private	BitUtil()

Method Summary

Modifier and Type	Method and Description
public static int	nextHighestPowerOfTwo(int v) returns the next highest power of two, or the current value if it's already a power of two or zero
public static long	nextHighestPowerOfTwo(long v) returns the next highest power of two, or the current value if it's already a power of two or zero
public static long	pop_andnot(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of A & ~B.
public static long	pop_array(long[] arr, int wordOffset, int numWords) Returns the number of set bits in an array of longs.
public static long	pop_intersect(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of the two sets after an intersection.
public static long	pop_union(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of the union of two sets.
public static long	pop_xor(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of A ^ B Neither array is modified.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Constructor Detail

BitUtil	back to summary
private BitUtil()

Method Detail

nextHighestPowerOfTwo	back to summary
public static int nextHighestPowerOfTwo(int v) returns the next highest power of two, or the current value if it's already a power of two or zero

nextHighestPowerOfTwo	back to summary
public static long nextHighestPowerOfTwo(long v) returns the next highest power of two, or the current value if it's already a power of two or zero

pop_andnot	back to summary
public static long pop_andnot(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of A & ~B. Neither array is modified.

pop_array	back to summary
public static long pop_array(long[] arr, int wordOffset, int numWords) Returns the number of set bits in an array of longs.

pop_intersect	back to summary
public static long pop_intersect(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of the two sets after an intersection. Neither array is modified.

pop_union	back to summary
public static long pop_union(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of the union of two sets. Neither array is modified.

pop_xor	back to summary
public static long pop_xor(long[] arr1, long[] arr2, int wordOffset, int numWords) Returns the popcount or cardinality of A ^ B Neither array is modified.