Util (RoaringBitmap 0.9.27-bitlap API)

java.lang.Object
- org.bitlap.roaringbitmap.Util

public final class Util
extends java.lang.Object

Various useful methods for roaring bitmaps.

字段概要

字段
限定符和类型	字段和说明
`static boolean`	`USE_HYBRID_BINSEARCH` optimization flag: whether to use hybrid binary search: hybrid formats combine a binary search with a sequential search

方法概要

所有方法静态方法具体方法已过时的方法
限定符和类型	方法和说明
`static Container[]`	`addOffset(Container source, char offsets)` Add value "offset" to all values in the container, producing two new containers.
`static int`	`advanceUntil(char[] array, int pos, int length, char min)` Find the smallest integer larger than pos such that array[pos]>= min.
`protected static int`	`branchyUnsignedBinarySearch(char[] array, int begin, int end, char k)`
`static int`	`cardinalityInBitmapRange(long[] bitmap, int start, int end)` Hamming weight of the bitset in the range start, start+1,..., end-1
`static int`	`cardinalityInBitmapWordRange(long[] bitmap, int start, int end)` 已过时。
`static void`	`fillArrayAND(char[] container, long[] bitmap1, long[] bitmap2)` Compute the bitwise AND between two long arrays and write the set bits in the container.
`static void`	`fillArrayANDNOT(char[] container, long[] bitmap1, long[] bitmap2)` Compute the bitwise ANDNOT between two long arrays and write the set bits in the container.
`static void`	`fillArrayXOR(char[] container, long[] bitmap1, long[] bitmap2)` Compute the bitwise XOR between two long arrays and write the set bits in the container.
`static void`	`flipBitmapRange(long[] bitmap, int start, int end)` flip bits at start, start+1,..., end-1
`static int`	`flipBitmapRangeAndCardinalityChange(long[] bitmap, int start, int end)` 已过时。
`protected static char`	`highbits(int x)`
`protected static char`	`highbits(long x)`
`protected static int`	`hybridUnsignedBinarySearch(char[] array, int begin, int end, char k)`
`static int`	`intersectArrayIntoBitmap(long[] bitmap, char[] array, int length)` Intersects the bitmap with the array, returning the cardinality of the result
`static int`	`iterateUntil(char[] array, int pos, int length, int min)` Find the smallest integer larger than pos such that array[pos]>= min.
`protected static char`	`lowbits(int x)`
`protected static char`	`lowbits(long x)`
`protected static int`	`lowbitsAsInteger(int x)`
`protected static int`	`lowbitsAsInteger(long x)`
`static int`	`maxLowBitAsInteger()`
`static void`	`partialRadixSort(int[] data)` Sorts the data by the 16 bit prefix using Radix sort.
`static void`	`resetBitmapRange(long[] bitmap, int start, int end)` clear bits at start, start+1,..., end-1
`static int`	`resetBitmapRangeAndCardinalityChange(long[] bitmap, int start, int end)` 已过时。
`static int`	`reverseUntil(char[] array, int pos, int length, char max)` Find the largest integer smaller than pos such that array[pos]<= max.
`static int`	`select(long w, int j)` Given a word w, return the position of the jth true bit.
`static void`	`setBitmapRange(long[] bitmap, int start, int end)` set bits at start, start+1,..., end-1
`static int`	`setBitmapRangeAndCardinalityChange(long[] bitmap, int start, int end)` 已过时。
`static long`	`toUnsignedLong(int x)` Converts the argument to a `long` by an unsigned conversion.
`static int`	`unsignedBinarySearch(char[] array, int begin, int end, char k)` Look for value k in array in the range [begin,end).
`static int`	`unsignedDifference(char[] set1, int length1, char[] set2, int length2, char[] buffer)` Compute the difference between two sorted lists and write the result to the provided output array
`static int`	`unsignedDifference(CharIterator set1, CharIterator set2, char[] buffer)` Compute the difference between two sorted lists and write the result to the provided output array
`static int`	`unsignedExclusiveUnion2by2(char[] set1, int length1, char[] set2, int length2, char[] buffer)` Compute the exclusive union of two sorted lists and write the result to the provided output array
`static int`	`unsignedIntersect2by2(char[] set1, int length1, char[] set2, int length2, char[] buffer)` Intersect two sorted lists and write the result to the provided output array
`static boolean`	`unsignedIntersects(char[] set1, int length1, char[] set2, int length2)` Checks if two arrays intersect
`protected static int`	`unsignedLocalIntersect2by2(char[] set1, int length1, char[] set2, int length2, char[] buffer)`
`static int`	`unsignedLocalIntersect2by2Cardinality(char[] set1, int length1, char[] set2, int length2)` Compute the cardinality of the intersection
`protected static int`	`unsignedOneSidedGallopingIntersect2by2(char[] smallSet, int smallLength, char[] largeSet, int largeLength, char[] buffer)`
`static int`	`unsignedUnion2by2(char[] set1, int offset1, int length1, char[] set2, int offset2, int length2, char[] buffer)` Unite two sorted lists and write the result to the provided output array

从类继承的方法 java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- 字段详细资料
  - USE_HYBRID_BINSEARCH
```
public static final boolean USE_HYBRID_BINSEARCH
```
    optimization flag: whether to use hybrid binary search: hybrid formats combine a binary search with a sequential search
    
    另请参阅:
    
    常量字段值
- 方法详细资料
  - addOffset
```
public static Container[] addOffset(Container source,
                                    char offsets)
```
    Add value "offset" to all values in the container, producing two new containers. The existing container remains unchanged. The new container are not converted, so they need to be checked: e.g., we could produce two bitmap containers having low cardinality.
    
    参数:
    
    source - source container
    
    offsets - value to add to each value in the container
    
    返回:
    
    return an array made of two containers
  - advanceUntil
```
public static int advanceUntil(char[] array,
                               int pos,
                               int length,
                               char min)
```
    Find the smallest integer larger than pos such that array[pos]>= min. If none can be found, return length. Based on code by O. Kaser.
    
    参数:
    
    array - array to search within
    
    pos - starting position of the search
    
    length - length of the array to search
    
    min - minimum value
    
    返回:
    
    x greater than pos such that array[pos] is at least as large as min, pos is is equal to length if it is not possible.
  - reverseUntil
```
public static int reverseUntil(char[] array,
                               int pos,
                               int length,
                               char max)
```
    Find the largest integer smaller than pos such that array[pos]<= max. If none can be found, return length. Based on code by O. Kaser.
    
    参数:
    
    array - array to search within
    
    pos - starting position of the search
    
    length - length of the array to search
    
    max - maximum value
    
    返回:
    
    x less than pos such that array[pos] is at least as small as max, pos is is equal to 0 if it is not possible.
  - iterateUntil
```
public static int iterateUntil(char[] array,
                               int pos,
                               int length,
                               int min)
```
    Find the smallest integer larger than pos such that array[pos]>= min. If none can be found, return length.
    
    参数:
    
    array - array to search within
    
    pos - starting position of the search
    
    length - length of the array to search
    
    min - minimum value
    
    返回:
    
    x greater than pos such that array[pos] is at least as large as min, pos is is equal to length if it is not possible.
  - branchyUnsignedBinarySearch
```
protected static int branchyUnsignedBinarySearch(char[] array,
                                                 int begin,
                                                 int end,
                                                 char k)
```
  - fillArrayAND
```
public static void fillArrayAND(char[] container,
                                long[] bitmap1,
                                long[] bitmap2)
```
    Compute the bitwise AND between two long arrays and write the set bits in the container.
    
    参数:
    
    container - where we write
    
    bitmap1 - first bitmap
    
    bitmap2 - second bitmap
  - fillArrayANDNOT
```
public static void fillArrayANDNOT(char[] container,
                                   long[] bitmap1,
                                   long[] bitmap2)
```
    Compute the bitwise ANDNOT between two long arrays and write the set bits in the container.
    
    参数:
    
    container - where we write
    
    bitmap1 - first bitmap
    
    bitmap2 - second bitmap
  - fillArrayXOR
```
public static void fillArrayXOR(char[] container,
                                long[] bitmap1,
                                long[] bitmap2)
```
    Compute the bitwise XOR between two long arrays and write the set bits in the container.
    
    参数:
    
    container - where we write
    
    bitmap1 - first bitmap
    
    bitmap2 - second bitmap
  - flipBitmapRange
```
public static void flipBitmapRange(long[] bitmap,
                                   int start,
                                   int end)
```
    flip bits at start, start+1,..., end-1
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
  - cardinalityInBitmapWordRange
```
@Deprecated
public static int cardinalityInBitmapWordRange(long[] bitmap,
                                                           int start,
                                                           int end)
```
    已过时。
    
    Hamming weight of the 64-bit words involved in the range start, start+1,..., end-1, that is, it will compute the cardinality of the bitset from index (floor(start/64) to floor((end-1)/64)) inclusively.
    
    参数:
    
    bitmap - array of words representing a bitset
    
    start - first index (inclusive)
    
    end - last index (exclusive)
    
    返回:
    
    the hamming weight of the corresponding words
  - cardinalityInBitmapRange
```
public static int cardinalityInBitmapRange(long[] bitmap,
                                           int start,
                                           int end)
```
    Hamming weight of the bitset in the range start, start+1,..., end-1
    
    参数:
    
    bitmap - array of words representing a bitset
    
    start - first index (inclusive)
    
    end - last index (exclusive)
    
    返回:
    
    the hamming weight of the corresponding range
  - highbits
```
protected static char highbits(int x)
```
  - highbits
```
protected static char highbits(long x)
```
  - hybridUnsignedBinarySearch
```
protected static int hybridUnsignedBinarySearch(char[] array,
                                                int begin,
                                                int end,
                                                char k)
```
  - lowbits
```
protected static char lowbits(int x)
```
  - lowbits
```
protected static char lowbits(long x)
```
  - lowbitsAsInteger
```
protected static int lowbitsAsInteger(int x)
```
  - lowbitsAsInteger
```
protected static int lowbitsAsInteger(long x)
```
  - maxLowBitAsInteger
```
public static int maxLowBitAsInteger()
```
  - resetBitmapRange
```
public static void resetBitmapRange(long[] bitmap,
                                    int start,
                                    int end)
```
    clear bits at start, start+1,..., end-1
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
  - intersectArrayIntoBitmap
```
public static int intersectArrayIntoBitmap(long[] bitmap,
                                           char[] array,
                                           int length)
```
    Intersects the bitmap with the array, returning the cardinality of the result
    
    参数:
    
    bitmap - the bitmap, modified
    
    array - the array, not modified
    
    length - how much of the array to consume
    
    返回:
    
    the size of the intersection, i.e. how many bits still set in the bitmap
  - select
```
public static int select(long w,
                         int j)
```
    Given a word w, return the position of the jth true bit.
    
    参数:
    
    w - word
    
    j - index
    
    返回:
    
    position of jth true bit in w
  - setBitmapRange
```
public static void setBitmapRange(long[] bitmap,
                                  int start,
                                  int end)
```
    set bits at start, start+1,..., end-1
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
  - setBitmapRangeAndCardinalityChange
```
@Deprecated
public static int setBitmapRangeAndCardinalityChange(long[] bitmap,
                                                                 int start,
                                                                 int end)
```
    已过时。
    
    set bits at start, start+1,..., end-1 and report the cardinality change
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
    
    返回:
    
    cardinality change
  - flipBitmapRangeAndCardinalityChange
```
@Deprecated
public static int flipBitmapRangeAndCardinalityChange(long[] bitmap,
                                                                  int start,
                                                                  int end)
```
    已过时。
    
    flip bits at start, start+1,..., end-1 and report the cardinality change
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
    
    返回:
    
    cardinality change
  - resetBitmapRangeAndCardinalityChange
```
@Deprecated
public static int resetBitmapRangeAndCardinalityChange(long[] bitmap,
                                                                   int start,
                                                                   int end)
```
    已过时。
    
    reset bits at start, start+1,..., end-1 and report the cardinality change
    
    参数:
    
    bitmap - array of words to be modified
    
    start - first index to be modified (inclusive)
    
    end - last index to be modified (exclusive)
    
    返回:
    
    cardinality change
  - unsignedBinarySearch
```
public static int unsignedBinarySearch(char[] array,
                                       int begin,
                                       int end,
                                       char k)
```
    Look for value k in array in the range [begin,end). If the value is found, return its index. If not, return -(i+1) where i is the index where the value would be inserted. The array is assumed to contain sorted values where shorts are interpreted as unsigned integers.
    
    参数:
    
    array - array where we search
    
    begin - first index (inclusive)
    
    end - last index (exclusive)
    
    k - value we search for
    
    返回:
    
    count
  - unsignedDifference
```
public static int unsignedDifference(char[] set1,
                                     int length1,
                                     char[] set2,
                                     int length2,
                                     char[] buffer)
```
    Compute the difference between two sorted lists and write the result to the provided output array
    
    参数:
    
    set1 - first array
    
    length1 - length of first array
    
    set2 - second array
    
    length2 - length of second array
    
    buffer - output array
    
    返回:
    
    cardinality of the difference
  - unsignedDifference
```
public static int unsignedDifference(CharIterator set1,
                                     CharIterator set2,
                                     char[] buffer)
```
    Compute the difference between two sorted lists and write the result to the provided output array
    
    参数:
    
    set1 - first array
    
    set2 - second array
    
    buffer - output array
    
    返回:
    
    cardinality of the difference
  - unsignedExclusiveUnion2by2
```
public static int unsignedExclusiveUnion2by2(char[] set1,
                                             int length1,
                                             char[] set2,
                                             int length2,
                                             char[] buffer)
```
    Compute the exclusive union of two sorted lists and write the result to the provided output array
    
    参数:
    
    set1 - first array
    
    length1 - length of first array
    
    set2 - second array
    
    length2 - length of second array
    
    buffer - output array
    
    返回:
    
    cardinality of the exclusive union
  - unsignedIntersect2by2
```
public static int unsignedIntersect2by2(char[] set1,
                                        int length1,
                                        char[] set2,
                                        int length2,
                                        char[] buffer)
```
    Intersect two sorted lists and write the result to the provided output array
    
    参数:
    
    set1 - first array
    
    length1 - length of first array
    
    set2 - second array
    
    length2 - length of second array
    
    buffer - output array
    
    返回:
    
    cardinality of the intersection
  - unsignedIntersects
```
public static boolean unsignedIntersects(char[] set1,
                                         int length1,
                                         char[] set2,
                                         int length2)
```
    Checks if two arrays intersect
    
    参数:
    
    set1 - first array
    
    length1 - length of first array
    
    set2 - second array
    
    length2 - length of second array
    
    返回:
    
    true if they intersect
  - unsignedLocalIntersect2by2
```
protected static int unsignedLocalIntersect2by2(char[] set1,
                                                int length1,
                                                char[] set2,
                                                int length2,
                                                char[] buffer)
```
  - unsignedLocalIntersect2by2Cardinality
```
public static int unsignedLocalIntersect2by2Cardinality(char[] set1,
                                                        int length1,
                                                        char[] set2,
                                                        int length2)
```
    Compute the cardinality of the intersection
    
    参数:
    
    set1 - first set
    
    length1 - how many values to consider in the first set
    
    set2 - second set
    
    length2 - how many values to consider in the second set
    
    返回:
    
    cardinality of the intersection
  - unsignedOneSidedGallopingIntersect2by2
```
protected static int unsignedOneSidedGallopingIntersect2by2(char[] smallSet,
                                                            int smallLength,
                                                            char[] largeSet,
                                                            int largeLength,
                                                            char[] buffer)
```
  - unsignedUnion2by2
```
public static int unsignedUnion2by2(char[] set1,
                                    int offset1,
                                    int length1,
                                    char[] set2,
                                    int offset2,
                                    int length2,
                                    char[] buffer)
```
    Unite two sorted lists and write the result to the provided output array
    
    参数:
    
    set1 - first array
    
    offset1 - offset of first array
    
    length1 - length of first array
    
    set2 - second array
    
    offset2 - offset of second array
    
    length2 - length of second array
    
    buffer - output array
    
    返回:
    
    cardinality of the union
  - toUnsignedLong
```
public static long toUnsignedLong(int x)
```
    Converts the argument to a long by an unsigned conversion. In an unsigned conversion to a long, the high-order 32 bits of the long are zero and the low-order 32 bits are equal to the bits of the integer argument. Consequently, zero and positive int values are mapped to a numerically equal long value and negative int values are mapped to a long value equal to the input plus 2³².
    
    参数:
    
    x - the value to convert to an unsigned long
    
    返回:
    
    the argument converted to long by an unsigned conversion
    
    从以下版本开始:
    
    1.8
  - partialRadixSort
```
public static void partialRadixSort(int[] data)
```
    Sorts the data by the 16 bit prefix using Radix sort. The resulting data will be partially sorted if you just take into account the most significant 16 bits. The least significant 16 bits are unsorted. Note that we treat int values as unsigned integers (from 0 to 2^32).
    
    参数:
    
    data - - the data (sorted in place)

类 Util

字段概要

方法概要

从类继承的方法 java.lang.Object

字段详细资料

USE_HYBRID_BINSEARCH

方法详细资料

addOffset

advanceUntil

reverseUntil

iterateUntil

branchyUnsignedBinarySearch

fillArrayAND

fillArrayANDNOT

fillArrayXOR

flipBitmapRange

cardinalityInBitmapWordRange

cardinalityInBitmapRange

highbits

highbits

hybridUnsignedBinarySearch

lowbits

lowbits

lowbitsAsInteger

lowbitsAsInteger

maxLowBitAsInteger

resetBitmapRange

intersectArrayIntoBitmap

select

setBitmapRange

setBitmapRangeAndCardinalityChange

flipBitmapRangeAndCardinalityChange

resetBitmapRangeAndCardinalityChange

unsignedBinarySearch

unsignedDifference

unsignedDifference

unsignedExclusiveUnion2by2

unsignedIntersect2by2

unsignedIntersects

unsignedLocalIntersect2by2

unsignedLocalIntersect2by2Cardinality

unsignedOneSidedGallopingIntersect2by2

unsignedUnion2by2

toUnsignedLong

partialRadixSort