* Converts the bitmap to a JS array. * The resulting array may be very big, use this function with caution. * * @returns The array containing

* Check whether a range of values from rangeStart (included) to rangeEnd (excluded) is present * * @param rangeStart - The start value (inclusiv

* Checks whether the given value is contained in the set. * * @param value - The value to look for. * @returns True if value exists in the se

* Creates a new roaring bitmap deserializing it from a buffer * * The roaring bitmap allocates in WASM memory, remember to dispose * the Roar

* How many bytes are required to serialize this bitmap. * * @param format - The serialization format.

* Adds all the values in the interval: [rangeStart, rangeEnd). * * First element is included, last element is excluded. * The number of added

* The at() method takes an integer value and returns the item at that index, * allowing for positive and negative integers. Negative integers count

* Creates a new bitmap that contains all the values in the interval: [rangeStart, rangeEnd). * Is possible to specify the step parameter to have a

* Serializes a bitmap to a typed Uint8Array. * The returned array is automatically garbage collected and there is no need to be disposed manually.

* Adds multiple values. * Using this is faster than calling add() multiple times. * Inserting ordered or partially ordered arrays is faster.

* Gets a new JS typed array instance that shares the memory used by this buffer. * Note that the buffer may point to an outdated WASM memory if the

* Creates a new bitmap with the content of the input bitmap but with given range of values flipped. * @param input The input bitmap, it will not be

* Check whether a bitmap and a closed range intersect. * * @param rangeStart The start of the range. * @param rangeEnd The end of the range.

This method is called after the bitmap is modified

* Gets the cardinality (number of elements) between rangeStart (included) to rangeEnd (excluded) of the bitmap. * Returns 0 if range is invalid or

* Converts the bitmap to a string in the format "1,2,3,4,5". * The resulting string may be very big, use this function with caution. * * @par

* Sets the value at the given index. * @param index - Zero-based index of the array element to be set, converted to an integer. Negative index coun

* Adds a 32 bit unsigned integer value. * Values are unique, this function does nothing if the value already exists. * * @param value - 32 bi

* addOffset adds the value 'offset' to each and every value in a bitmap, generating a new bitmap in the process. * If offset + element is outside o

* Writes the given array at the specified position * @param array - A typed or untyped array of values to set. * @param offset - The index in th

* Converts a range of the bitmap to a Uint32Array. * The resulting array may be very big, use this function with caution. * * @param minimumV

* Converts a slice, define by start index (included) and end index (excluded) of the bitmap to a string in the form "1,2,3,4,5". * The resulting st

* Finds the index of the nth set element. * Returns -1 if not found. * * @param value - Element value * @returns element index or -1 if no

* Converts a slice, define by start index (included) and end index (excluded) of the bitmap to a number array. * The resulting array may be very bi

* Converts a slice, define by start index (included) and end index (excluded) of the bitmap to a Set. * The resulting set may be very big, use this

* Converts a slice, define by start index (included) and end index (excluded) of the bitmap to a Uint32Array. * The resulting array may be very big

* Stops the current arena allocator. * @returns The stopped arena allocator. * @see start * @see current * @see with

* Converts the bitmap to a JS Uint32Array. * The resulting array may be very big, use this function with caution. * * @param output - The out

* Performs a union between all the given array of RoaringBitmap32 instances. * * This function is faster than calling or multiple times. * In

* Performs a xor between all the given array of RoaringBitmap32 instances. * * This function is faster than calling xor multiple times. *

* Converts a range of the bitmap to an JS Array. * The resulting array may be very big, use this function with caution. * * @param minimumVal

* Converts a range of the bitmap to a Set. * The resulting set may be very big, use this function with caution. * * @param minimumValue - The

* Removes all the values in the interval: [rangeStart, rangeEnd). * * First element is included, last element is excluded. * The number of re

* Clears the bitmap, removing all values.

* Checks whether the given value is contained in the set. * * @param value - The value to look for. * @returns True if value exists in the se

* Serializes a bitmap to a byte buffer allocated in WASM memory. * * The returned RoaringUint8Array is allocated in WASM memory and not garbage

* Starts a new arena allocator. * @returns The new arena allocator.

* Returns a string representation of an array.

* The RoaringBitmap32.of() static method creates a new Array instance from a variable number of arguments, regardless of number or type of the argumen

* The pop() method removes the last element from a roaring bitmap and returns that element. * This method changes the size of the bitmap * @retu

* Decreases the size of the allocated memory. * It does nothing if the new length is greater or equal to the current length. * If the new length

* Throws an exception if this object was disposed before.

* Copies the content of this buffer to a typed array and returns it * * @param output - The typed array to copy to. If not provided, a new typed

* Returns a new RoaringBitmap32 with the intersection (and) between the given two bitmaps. * * The provided bitmaps are not modified. * *

* Returns a new RoaringBitmap32 with the difference (and not) between the two given bitmaps. * * The provided bitmaps are not modified. *

* Frees the allocated memory. * Is safe to call this method more than once. * @returns True if memory gets freed during this call, false if not.

* Gets the maximum value stored in the bitmap. * If the bitmap is empty, returns 0. * * @returns The maximum 32 bit unsigned integer or 0 if

* Gets the minimum value stored in the bitmap. * If the bitmap is empty, returns 0xFFFFFFFF * * @returns The minimum 32 bit unsigned integer

* Returns a new RoaringBitmap32 with the union (or) of the two given bitmaps. * * The provided bitmaps are not modified. * * @param a The

* Overwrite the content of this bitmap with the content of another bitmap. * @param other - The other bitmap to copy. * @returns This RoaringBit

* Converts a range of the bitmap to a string in the form "1,2,3,4,5". * The resulting string may be very big, use this function with caution. *

* Returns the number of integers that are smaller or equal to the given value. * * @param value - The value to rank * @returns The number of

* Removes a value from the set checking if the bitmap changes. * Use remove() if you don't need to know if something changed. * If the value doe

* Convert array and bitmap containers to run containers when it is more efficient; * also convert from run containers when more space efficient.

* If needed, reallocate memory to shrink the memory usage. * * Returns the number of bytes saved. * * @returns The number of bytes saved.

* Swaps the content of two RoaringBitmap32 instances. * * @static * @param {RoaringBitmap32} a First RoaringBitmap32 instance to swap * @p

* Returns a new RoaringBitmap32 with the symmetric union (xor) between the two given bitmaps. * * The provided bitmaps are not modified. *

* Returns a new bitmap that is a copy of this bitmap, same as new ReadonlyRoaringBitmap32(copy) * @returns A cloned RoaringBitmap32 instance

* Removes a value from the set checking if the bitmap changes. * Use remove() if you don't need to know if something changed. * If the value doe

* Checks wether two roaring bitmap contains the same data. * * @param other - The other bitmap. * @returns True if the bitmaps contains the s

* Returns true if this bitmap is strict subset of the other. * * @param other - The other bitmap * @returns True if this bitmap is a strict s

* Returns true if the bitmap is subset of the other. * * @param other - the other bitmap * @returns true if the bitmap is subset of the other

* If the size of the roaring bitmap is strictly greater than rank, then * this function returns the element of given rank. * Otherwise, it retur

* The shift() method removes the first element from a roaring bitmap and returns that element. * This method changes the size of the bitmap * @r

* Converts the bitmap to a JS Set<number>. * The resulting set may be very big, use this function with caution. * * @param output - The outpu

* Converts the bitmap to a JS Uint32Array. * The resulting array may be very big, use this function with caution. * * @param output - The out

* Adds a 32 bit unsigned integer value checking if the bitmap changes. * Use add() if you don't need to know if something changed. * Values are