Crate croaring_sys [−] [src]
Structs
Enums
| __codecvt_result | |
| _bindgen_ty_1 | |
| _bindgen_ty_2 |
During lazy computations, we can transform array containers into bitset containers as long as we can expect them to have ARRAY_LAZY_LOWERBOUND values. |
| _bindgen_ty_3 | |
| _bindgen_ty_4 | |
| _bindgen_ty_5 | |
| _bindgen_ty_6 | |
| _bindgen_ty_7 | |
| idtype_t |
Constants
Statics
Functions
| _Exit⚠ | |
| _IO_cookie_init⚠ | |
| _IO_feof⚠ | |
| _IO_ferror⚠ | |
| _IO_flockfile⚠ | |
| _IO_free_backup_area⚠ | |
| _IO_ftrylockfile⚠ | |
| _IO_funlockfile⚠ | |
| _IO_getc⚠ | |
| _IO_padn⚠ | |
| _IO_peekc_locked⚠ | |
| _IO_putc⚠ | |
| _IO_seekoff⚠ | |
| _IO_seekpos⚠ | |
| _IO_sgetn⚠ | |
| _IO_vfprintf⚠ | |
| _IO_vfscanf⚠ | |
| __asprintf⚠ | |
| __assert⚠ | |
| __assert_fail⚠ | |
| __assert_perror_fail⚠ | |
| __bzero⚠ | |
| __ctype_get_mb_cur_max⚠ | |
| __default_morecore⚠ | |
| __getdelim⚠ | |
| __malloc_check_init⚠ | |
| __mempcpy⚠ | |
| __overflow⚠ | |
| __stpcpy⚠ | |
| __stpncpy⚠ | |
| __strtok_r⚠ | |
| __uflow⚠ | |
| __underflow⚠ | |
| a64l⚠ | |
| abort⚠ | |
| abs⚠ | |
| aligned_alloc⚠ | |
| alloca⚠ | |
| array_array_container_andnot⚠ | |
| array_array_container_iandnot⚠ | |
| array_array_container_ixor⚠ | |
| array_array_container_lazy_union⚠ | |
| array_array_container_lazy_xor⚠ | |
| array_array_container_union⚠ | |
| array_array_container_xor⚠ | |
| array_bitset_container_andnot⚠ | |
| array_bitset_container_iandnot⚠ | |
| array_bitset_container_intersect⚠ | |
| array_bitset_container_intersection⚠ | |
| array_bitset_container_intersection_cardinality⚠ | |
| array_bitset_container_ixor⚠ | |
| array_bitset_container_lazy_union⚠ | |
| array_bitset_container_lazy_xor⚠ | |
| array_bitset_container_union⚠ | |
| array_bitset_container_xor⚠ | |
| array_container_add_from_range⚠ | |
| array_container_andnot⚠ | |
| array_container_clone⚠ | |
| array_container_contains⚠ | |
| array_container_copy⚠ | |
| array_container_create⚠ | |
| array_container_create_given_capacity⚠ | |
| array_container_deserialize⚠ | |
| array_container_equal_bitset⚠ |
Return true if the two containers have the same content. |
| array_container_equals⚠ |
Return true if the two arrays have the same content. |
| array_container_free⚠ | |
| array_container_from_bitset⚠ | |
| array_container_from_run⚠ | |
| array_container_grow⚠ |
increase capacity to at least min, and to no more than max. Whether the existing data needs to be copied over depends on the value of the "preserve" parameter. If preserve is false, then the new content will be uninitialized, otherwise the original data is copied. |
| array_container_intersect⚠ | |
| array_container_intersection⚠ | |
| array_container_intersection_cardinality⚠ | |
| array_container_intersection_inplace⚠ | |
| array_container_is_subset⚠ |
Return true if container1 is a subset of container2. |
| array_container_is_subset_bitset⚠ |
Return true if container1 is a subset of container2. |
| array_container_is_subset_run⚠ |
Return true if container1 is a subset of container2. |
| array_container_iterate⚠ | |
| array_container_iterate64⚠ | |
| array_container_maximum⚠ | |
| array_container_minimum⚠ | |
| array_container_negation⚠ | |
| array_container_negation_range⚠ | |
| array_container_negation_range_inplace⚠ | |
| array_container_number_of_runs⚠ | |
| array_container_printf⚠ | |
| array_container_printf_as_uint32_array⚠ | |
| array_container_rank⚠ | |
| array_container_read⚠ |
Reads the instance from buf, outputs how many bytes were read. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes read should be array_container_size_in_bytes(container). You need to provide the (known) cardinality. |
| array_container_serialization_len⚠ | |
| array_container_serialize⚠ | |
| array_container_shrink_to_fit⚠ | |
| array_container_to_uint32_array⚠ | |
| array_container_union⚠ | |
| array_container_write⚠ |
Writes the underlying array to buf, outputs how many bytes were written. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes written should be array_container_size_in_bytes(container). |
| array_container_xor⚠ | |
| array_run_container_andnot⚠ | |
| array_run_container_iandnot⚠ | |
| array_run_container_inplace_union⚠ | |
| array_run_container_intersect⚠ | |
| array_run_container_intersection⚠ | |
| array_run_container_intersection_cardinality⚠ | |
| array_run_container_ixor⚠ | |
| array_run_container_lazy_xor⚠ | |
| array_run_container_union⚠ | |
| array_run_container_xor⚠ | |
| asprintf⚠ | |
| at_quick_exit⚠ | |
| atexit⚠ | |
| atof⚠ | |
| atoi⚠ | |
| atol⚠ | |
| atoll⚠ | |
| basename⚠ | |
| bcmp⚠ | |
| bcopy⚠ | |
| binarySearch⚠ | |
| bitset_array_container_andnot⚠ | |
| bitset_array_container_iandnot⚠ | |
| bitset_array_container_ixor⚠ | |
| bitset_bitset_container_andnot⚠ | |
| bitset_bitset_container_iandnot⚠ | |
| bitset_bitset_container_intersection⚠ | |
| bitset_bitset_container_intersection_inplace⚠ | |
| bitset_bitset_container_ixor⚠ | |
| bitset_bitset_container_xor⚠ | |
| bitset_clear_list⚠ | |
| bitset_container_add_from_range⚠ | |
| bitset_container_and⚠ | |
| bitset_container_and_justcard⚠ | |
| bitset_container_and_nocard⚠ | |
| bitset_container_andnot⚠ | |
| bitset_container_andnot_justcard⚠ | |
| bitset_container_andnot_nocard⚠ | |
| bitset_container_clear⚠ | |
| bitset_container_clone⚠ | |
| bitset_container_compute_cardinality⚠ | |
| bitset_container_contains⚠ | |
| bitset_container_copy⚠ | |
| bitset_container_create⚠ | |
| bitset_container_deserialize⚠ | |
| bitset_container_equals⚠ |
Return true if the two containers have the same content. |
| bitset_container_free⚠ | |
| bitset_container_from_array⚠ | |
| bitset_container_from_run⚠ | |
| bitset_container_get⚠ | |
| bitset_container_intersect⚠ | |
| bitset_container_intersection⚠ | |
| bitset_container_intersection_justcard⚠ | |
| bitset_container_is_subset⚠ |
Return true if container1 is a subset of container2. |
| bitset_container_is_subset_run⚠ |
Return true if container1 is a subset of container2. |
| bitset_container_iterate⚠ | |
| bitset_container_iterate64⚠ | |
| bitset_container_maximum⚠ | |
| bitset_container_minimum⚠ | |
| bitset_container_negation⚠ | |
| bitset_container_negation_inplace⚠ | |
| bitset_container_negation_range⚠ | |
| bitset_container_negation_range_inplace⚠ | |
| bitset_container_number_of_runs⚠ |
Return the the number of runs. |
| bitset_container_or⚠ | |
| bitset_container_or_justcard⚠ | |
| bitset_container_or_nocard⚠ | |
| bitset_container_printf⚠ | |
| bitset_container_printf_as_uint32_array⚠ | |
| bitset_container_rank⚠ | |
| bitset_container_read⚠ |
Reads the instance from buf, outputs how many bytes were read. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes read should be bitset_container_size_in_bytes(container). You need to provide the (known) cardinality. |
| bitset_container_select⚠ |
If the element of given rank is in this container, supposing that the first element has rank start_rank, then the function returns true and sets element accordingly. Otherwise, it returns false and update start_rank. |
| bitset_container_serialization_len⚠ | |
| bitset_container_serialize⚠ | |
| bitset_container_set_all⚠ | |
| bitset_container_set_range⚠ | |
| bitset_container_to_uint32_array⚠ | |
| bitset_container_union⚠ | |
| bitset_container_union_justcard⚠ | |
| bitset_container_write⚠ |
Writes the underlying array to buf, outputs how many bytes were written. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes written should be bitset_container_size_in_bytes(container). |
| bitset_container_xor⚠ | |
| bitset_container_xor_justcard⚠ | |
| bitset_container_xor_nocard⚠ | |
| bitset_extract_intersection_setbits_uint16⚠ | |
| bitset_extract_setbits⚠ | |
| bitset_extract_setbits_avx2⚠ | |
| bitset_extract_setbits_sse_uint16⚠ | |
| bitset_extract_setbits_uint16⚠ | |
| bitset_flip_list⚠ | |
| bitset_flip_list_withcard⚠ | |
| bitset_run_container_andnot⚠ | |
| bitset_run_container_iandnot⚠ | |
| bitset_run_container_ixor⚠ | |
| bitset_set_list⚠ | |
| bitset_set_list_withcard⚠ | |
| bsearch⚠ | |
| bzero⚠ | |
| calloc⚠ | |
| canonicalize_file_name⚠ | |
| cfree⚠ | |
| clearenv⚠ | |
| clearerr⚠ | |
| clearerr_unlocked⚠ | |
| container_clone⚠ |
Copies a container, requires a typecode. This allocates new memory, caller is responsible for deallocation. If the container is not shared, then it is physically cloned. Sharable containers are not cloneable. |
| container_contains⚠ |
Check whether a value is in a container, requires a typecode |
| container_deserialize⚠ | |
| container_free⚠ |
Recover memory from a container, requires a typecode |
| container_mutable_unwrap_shared⚠ | |
| container_printf⚠ |
print the container (useful for debugging), requires a typecode |
| container_printf_as_uint32_array⚠ |
print the content of the container as a comma-separated list of 32-bit values starting at base, requires a typecode |
| container_serialization_len⚠ | |
| container_serialize⚠ | |
| container_unwrap_shared⚠ | |
| convert_run_optimize⚠ | |
| convert_run_to_efficient_container⚠ | |
| convert_run_to_efficient_container_and_free⚠ | |
| convert_to_bitset_or_array_container⚠ | |
| ctermid⚠ | |
| cuserid⚠ | |
| difference_uint16⚠ |
Generic difference function (ANDNOT). |
| difference_vector16⚠ |
A fast SSE-based difference function. |
| div⚠ | |
| dprintf⚠ | |
| drand48⚠ | |
| drand48_r⚠ | |
| ecvt⚠ | |
| ecvt_r⚠ | |
| erand48⚠ | |
| erand48_r⚠ | |
| exit⚠ | |
| extend_array⚠ |
If needed, increase the capacity of the array so that it can fit k values (at least); |
| fclose⚠ | |
| fcloseall⚠ | |
| fcvt⚠ | |
| fcvt_r⚠ | |
| fdopen⚠ | |
| feof⚠ | |
| feof_unlocked⚠ | |
| ferror⚠ | |
| ferror_unlocked⚠ | |
| fflush⚠ | |
| fflush_unlocked⚠ | |
| ffs⚠ | |
| ffsl⚠ | |
| ffsll⚠ | |
| fgetc⚠ | |
| fgetc_unlocked⚠ | |
| fgetpos⚠ | |
| fgetpos64⚠ | |
| fgets⚠ | |
| fgets_unlocked⚠ | |
| fileno⚠ | |
| fileno_unlocked⚠ | |
| flockfile⚠ | |
| fmemopen⚠ | |
| fopen⚠ | |
| fopen64⚠ | |
| fopencookie⚠ | |
| fprintf⚠ | |
| fputc⚠ | |
| fputc_unlocked⚠ | |
| fputs⚠ | |
| fputs_unlocked⚠ | |
| fread⚠ | |
| fread_unlocked⚠ | |
| free⚠ | |
| freopen⚠ | |
| freopen64⚠ | |
| fscanf⚠ | |
| fseek⚠ | |
| fseeko⚠ | |
| fseeko64⚠ | |
| fsetpos⚠ | |
| fsetpos64⚠ | |
| ftell⚠ | |
| ftello⚠ | |
| ftello64⚠ | |
| ftrylockfile⚠ | |
| funlockfile⚠ | |
| fwrite⚠ | |
| fwrite_unlocked⚠ | |
| gcvt⚠ | |
| get_copy_of_container⚠ | |
| getc⚠ | |
| getc_unlocked⚠ | |
| getchar⚠ | |
| getchar_unlocked⚠ | |
| getdelim⚠ | |
| getenv⚠ | |
| getline⚠ | |
| getloadavg⚠ | |
| getpt⚠ | |
| getsubopt⚠ | |
| getw⚠ | |
| gnu_dev_major⚠ | |
| gnu_dev_makedev⚠ | |
| gnu_dev_minor⚠ | |
| grantpt⚠ | |
| index⚠ | |
| initstate⚠ | |
| initstate_r⚠ | |
| interleavedBinarySearch⚠ |
Good old binary search through rle data |
| intersect_skewed_uint16⚠ | |
| intersect_skewed_uint16_cardinality⚠ | |
| intersect_skewed_uint16_nonempty⚠ | |
| intersect_uint16⚠ |
Generic intersection function. |
| intersect_uint16_cardinality⚠ |
Compute the size of the intersection (generic). |
| intersect_uint16_nonempty⚠ |
Checking whether the size of the intersection is non-zero. |
| intersect_vector16⚠ |
From Schlegel et al., Fast Sorted-Set Intersection using SIMD Instructions Optimized by D. Lemire on May 3rd 2013 |
| intersect_vector16_cardinality⚠ |
Compute the cardinality of the intersection using SSE4 instructions |
| intersection_uint32⚠ |
Generic intersection function. |
| intersection_uint32_card⚠ |
Generic intersection function, returns just the cardinality. |
| jrand48⚠ | |
| jrand48_r⚠ | |
| l64a⚠ | |
| labs⚠ | |
| lcong48⚠ | |
| lcong48_r⚠ | |
| ldiv⚠ | |
| llabs⚠ | |
| lldiv⚠ | |
| lrand48⚠ | |
| lrand48_r⚠ | |
| mallinfo⚠ | |
| malloc⚠ | |
| malloc_get_state⚠ | |
| malloc_info⚠ | |
| malloc_set_state⚠ | |
| malloc_stats⚠ | |
| malloc_trim⚠ | |
| malloc_usable_size⚠ | |
| mallopt⚠ | |
| mblen⚠ | |
| mbstowcs⚠ | |
| mbtowc⚠ | |
| memalign⚠ | |
| memccpy⚠ | |
| memchr⚠ | |
| memcmp⚠ | |
| memcpy⚠ | |
| memfrob⚠ | |
| memmem⚠ | |
| memmove⚠ | |
| mempcpy⚠ | |
| memrchr⚠ | |
| memset⚠ | |
| mkdtemp⚠ | |
| mkostemp⚠ | |
| mkostemp64⚠ | |
| mkostemps⚠ | |
| mkostemps64⚠ | |
| mkstemp⚠ | |
| mkstemp64⚠ | |
| mkstemps⚠ | |
| mkstemps64⚠ | |
| mktemp⚠ | |
| mrand48⚠ | |
| mrand48_r⚠ | |
| nrand48⚠ | |
| nrand48_r⚠ | |
| obstack_printf⚠ | |
| obstack_vprintf⚠ | |
| on_exit⚠ | |
| open_memstream⚠ | |
| pclose⚠ | |
| perror⚠ | |
| popen⚠ | |
| posix_memalign⚠ | |
| posix_openpt⚠ | |
| printf⚠ | |
| pselect⚠ | |
| ptsname⚠ | |
| ptsname_r⚠ | |
| putc⚠ | |
| putc_unlocked⚠ | |
| putchar⚠ | |
| putchar_unlocked⚠ | |
| putenv⚠ | |
| puts⚠ | |
| putw⚠ | |
| pvalloc⚠ | |
| qecvt⚠ | |
| qecvt_r⚠ | |
| qfcvt⚠ | |
| qfcvt_r⚠ | |
| qgcvt⚠ | |
| qsort⚠ | |
| qsort_r⚠ | |
| quick_exit⚠ | |
| ra_advance_until_freeing⚠ | |
| ra_append⚠ |
Append a new key-value pair |
| ra_append_copies_after⚠ |
appends from sa to ra, starting with the smallest key that is * is strictly greater than before_start |
| ra_append_copies_until⚠ |
appends from sa to ra, ending with the greatest key that is * is less or equal stopping_key |
| ra_append_copy⚠ |
Append a new key-value pair to ra, cloning (in COW sense) a value from sa at index index |
| ra_append_copy_range⚠ |
Append new key-value pairs to ra, cloning (in COW sense) values from sa at indexes [start_index, uint16_t end_index) |
| ra_append_move_range⚠ |
Move the key-value pairs to ra from sa at indexes [start_index, uint16_t end_index), old array should not be freed (use ra_clear_without_containers) |
| ra_append_range⚠ |
Append new key-value pairs to ra, from sa at indexes [start_index, uint16_t end_index) |
| ra_clear⚠ |
Frees the memory used by a roaring array |
| ra_clear_containers⚠ |
Frees just the containers |
| ra_clear_without_containers⚠ |
Frees the memory used by a roaring array, but does not free the containers |
| ra_copy⚠ |
Copies this roaring array, we assume that dest is not initialized |
| ra_copy_range⚠ | |
| ra_create⚠ |
Create a new roaring array |
| ra_downsize⚠ | |
| ra_get_container_at_index⚠ |
Retrieves the container at index i, filling in the typecode |
| ra_get_index⚠ |
Get the index corresponding to a 16-bit key |
| ra_get_key_at_index⚠ |
Retrieves the key at index i |
| ra_get_size⚠ | |
| ra_has_run_container⚠ |
return true if it contains at least one run container. |
| ra_init⚠ |
Initialize with default capacity |
| ra_init_with_capacity⚠ |
Initialize an existing roaring array with the specified capacity (in number of containers) |
| ra_insert_new_key_value_at⚠ |
Add a new key-value pair at index i |
| ra_overwrite⚠ |
Copies this roaring array, we assume that dest is initialized |
| ra_portable_deserialize⚠ |
read a bitmap from a serialized version. This is meant to be compatible with the Java and Go versions. maxbytes indicates how many bytes available from buf. When the function returns true, roaring_array_t is populated with the data and *readbytes indicates how many bytes were read. In all cases, if the function returns true, then maxbytes >= *readbytes. |
| ra_portable_deserialize_size⚠ |
Quickly checks whether there is a serialized bitmap at the pointer, not exceeding size "maxbytes" in bytes. This function does not allocate memory dynamically. |
| ra_portable_header_size⚠ |
Size of the header when serializing (meant to be compatible with Java and Go versions) |
| ra_portable_serialize⚠ |
write a bitmap to a buffer. This is meant to be compatible with the Java and Go versions. Return the size in bytes of the serialized output (which should be ra_portable_size_in_bytes(ra)). |
| ra_portable_size_in_bytes⚠ |
How many bytes are required to serialize this bitmap (meant to be compatible with Java and Go versions) |
| ra_remove_at_index⚠ |
remove at index i, sliding over all entries after i |
| ra_remove_at_index_and_free⚠ |
remove at index i, sliding over all entries after i. Free removed container. |
| ra_replace_key_and_container_at_index⚠ | |
| ra_reset⚠ |
clears all containers, sets the size at 0 and shrinks the memory usage. |
| ra_set_container_at_index⚠ |
Set the container at the corresponding index using the specified typecode. |
| ra_shrink_to_fit⚠ | |
| ra_to_uint32_array⚠ | |
| rand⚠ | |
| rand_r⚠ | |
| random⚠ | |
| random_r⚠ | |
| rawmemchr⚠ | |
| realloc⚠ | |
| realpath⚠ | |
| remove⚠ | |
| rename⚠ | |
| renameat⚠ | |
| rewind⚠ | |
| rindex⚠ | |
| roaring_advance_uint32_iterator⚠ |
Advance the iterator. If there is a new value, then it->has_value is true. The new value is in it->current_value. Values are traversed in increasing orders. For convenience, returns it->has_value. |
| roaring_bitmap_add⚠ |
Add value x |
| roaring_bitmap_add_many⚠ |
Add value n_args from pointer vals, faster than repeatedly calling roaring_bitmap_add |
| roaring_bitmap_and⚠ |
Computes the intersection between two bitmaps and returns new bitmap. The caller is responsible for memory management. |
| roaring_bitmap_and_cardinality⚠ |
Computes the size of the intersection between two bitmaps. |
| roaring_bitmap_and_inplace⚠ |
Inplace version modifies x1, x1 == x2 is allowed |
| roaring_bitmap_andnot⚠ |
Computes the difference (andnot) between two bitmaps and returns new bitmap. The caller is responsible for memory management. |
| roaring_bitmap_andnot_cardinality⚠ |
Computes the size of the difference (andnot) between two bitmaps. |
| roaring_bitmap_andnot_inplace⚠ |
Inplace version of roaring_bitmap_andnot, modifies x1. x1 != x2. |
| roaring_bitmap_clear⚠ |
Empties the bitmap |
| roaring_bitmap_contains⚠ |
Check if value x is present |
| roaring_bitmap_copy⚠ |
Copies a bitmap. This does memory allocation. The caller is responsible for memory management. |
| roaring_bitmap_create⚠ |
Creates a new bitmap (initially empty) |
| roaring_bitmap_create_with_capacity⚠ |
Creates a new bitmap (initially empty) with a provided container-storage capacity (it is a performance hint). |
| roaring_bitmap_deserialize⚠ |
use with roaring_bitmap_serialize * see roaring_bitmap_portable_deserialize if you want a format that's * compatible with Java and Go implementations |
| roaring_bitmap_equals⚠ |
Return true if the two bitmaps contain the same elements. |
| roaring_bitmap_flip⚠ |
compute the negation of the roaring bitmap within a specified interval. areas outside the range are passed through unchanged. |
| roaring_bitmap_flip_inplace⚠ |
compute (in place) the negation of the roaring bitmap within a specified interval. areas outside the range are passed through unchanged. |
| roaring_bitmap_free⚠ |
Frees the memory. |
| roaring_bitmap_from_range⚠ |
Add all the values between min (included) and max (excluded) that are at a distance k*step from min. |
| roaring_bitmap_get_cardinality⚠ |
Get the cardinality of the bitmap (number of elements). |
| roaring_bitmap_intersect⚠ |
Check whether two bitmaps intersect. |
| roaring_bitmap_is_empty⚠ |
Returns true if the bitmap is empty (cardinality is zero). |
| roaring_bitmap_is_strict_subset⚠ |
Return true if all the elements of ra1 are also in ra2 and ra2 is strictly greater than ra1. |
| roaring_bitmap_is_subset⚠ |
Return true if all the elements of ra1 are also in ra2. |
| roaring_bitmap_jaccard_index⚠ |
Computes the Jaccard index between two bitmaps. (Also known as the Tanimoto distance, or the Jaccard similarity coefficient) |
| roaring_bitmap_lazy_or⚠ |
(For expert users who seek high performance.) |
| roaring_bitmap_lazy_or_inplace⚠ |
(For expert users who seek high performance.) Inplace version of roaring_bitmap_lazy_or, modifies x1 The bitsetconversion conversion is a flag which determines whether container-container operations force a bitset conversion. |
| roaring_bitmap_lazy_xor⚠ |
Computes the symmetric difference between two bitmaps and returns new bitmap. The caller is responsible for memory management. |
| roaring_bitmap_lazy_xor_inplace⚠ |
(For expert users who seek high performance.) Inplace version of roaring_bitmap_lazy_xor, modifies x1. x1 != x2 |
| roaring_bitmap_maximum⚠ |
roaring_bitmap_smallest returns the greatest value in the set. Returns 0 if the set is empty. |
| roaring_bitmap_minimum⚠ |
roaring_bitmap_smallest returns the smallest value in the set. Returns UINT32_MAX if the set is empty. |
| roaring_bitmap_of⚠ |
Creates a new bitmap from a list of uint32_t integers |
| roaring_bitmap_of_ptr⚠ |
Creates a new bitmap from a pointer of uint32_t integers |
| roaring_bitmap_or⚠ |
Computes the union between two bitmaps and returns new bitmap. The caller is responsible for memory management. |
| roaring_bitmap_or_cardinality⚠ |
Computes the size of the union between two bitmaps. |
| roaring_bitmap_or_inplace⚠ |
Inplace version of roaring_bitmap_or, modifies x1. TDOO: decide whether x1 == x2 ok |
| roaring_bitmap_or_many⚠ |
Compute the union of 'number' bitmaps. See also roaring_bitmap_or_many_heap. Caller is responsible for freeing the result. |
| roaring_bitmap_or_many_heap⚠ |
Compute the union of 'number' bitmaps using a heap. This can sometimes be faster than roaring_bitmap_or_many which uses a naive algorithm. Caller is responsible for freeing the result. |
| roaring_bitmap_portable_deserialize⚠ |
read a bitmap from a serialized version. This is meant to be compatible with the Java and Go versions. See format specification at https://github.com/RoaringBitmap/RoaringFormatSpec In case of failure, a null pointer is returned. This function is unsafe in the sense that if there is no valid serialized bitmap at the pointer, then many bytes could be read, possibly causing a buffer overflow. For a safer approach, call roaring_bitmap_portable_deserialize_safe. |
| roaring_bitmap_portable_deserialize_safe⚠ |
read a bitmap from a serialized version in a safe manner (reading up to maxbytes). This is meant to be compatible with the Java and Go versions. See format specification at https://github.com/RoaringBitmap/RoaringFormatSpec In case of failure, a null pointer is returned. |
| roaring_bitmap_portable_deserialize_size⚠ |
Check how many bytes would be read (up to maxbytes) at this pointer if there is a bitmap, returns zero if there is no valid bitmap. This is meant to be compatible with the Java and Go versions. See format specification at https://github.com/RoaringBitmap/RoaringFormatSpec |
| roaring_bitmap_portable_serialize⚠ |
write a bitmap to a char buffer. The output buffer should refer to at least roaring_bitmap_portable_size_in_bytes(ra) bytes of allocated memory. This is meant to be compatible with the Java and Go versions. Returns how many bytes were written which should be roaring_bitmap_portable_size_in_bytes(ra). See format specification at https://github.com/RoaringBitmap/RoaringFormatSpec |
| roaring_bitmap_portable_size_in_bytes⚠ |
How many bytes are required to serialize this bitmap (meant to be compatible with Java and Go versions). See format specification at https://github.com/RoaringBitmap/RoaringFormatSpec |
| roaring_bitmap_printf⚠ |
Print the content of the bitmap. |
| roaring_bitmap_printf_describe⚠ |
Describe the inner structure of the bitmap. |
| roaring_bitmap_rank⚠ |
roaring_bitmap_rank returns the number of integers that are smaller or equal to x. |
| roaring_bitmap_remove⚠ |
Remove value x |
| roaring_bitmap_remove_run_compression⚠ |
Remove run-length encoding even when it is more space efficient return whether a change was applied |
| roaring_bitmap_repair_after_lazy⚠ |
(For expert users who seek high performance.) |
| roaring_bitmap_run_optimize⚠ |
convert array and bitmap containers to run containers when it is more * efficient; * also convert from run containers when more space efficient. Returns * true if the result has at least one run container. * Additional savings might be possible by calling shrinkToFit(). |
| roaring_bitmap_select⚠ |
|
| roaring_bitmap_serialize⚠ |
write the bitmap to an output pointer, this output buffer should refer to at least roaring_bitmap_size_in_bytes(ra) allocated bytes. |
| roaring_bitmap_shrink_to_fit⚠ |
If needed, reallocate memory to shrink the memory usage. Returns the number of bytes saved. |
| roaring_bitmap_size_in_bytes⚠ |
How many bytes are required to serialize this bitmap (NOT compatible with Java and Go versions) |
| roaring_bitmap_statistics⚠ |
(For advanced users.) Collect statistics about the bitmap, see roaring_types.h for a description of roaring_statistics_t |
| roaring_bitmap_to_uint32_array⚠ |
Convert the bitmap to an array. Write the output to "ans", caller is responsible to ensure that there is enough memory allocated (e.g., ans = malloc(roaring_bitmap_get_cardinality(mybitmap) * sizeof(uint32_t)) |
| roaring_bitmap_xor⚠ |
Computes the symmetric difference (xor) between two bitmaps and returns new bitmap. The caller is responsible for memory management. |
| roaring_bitmap_xor_cardinality⚠ |
Computes the size of the symmetric difference (andnot) between two bitmaps. |
| roaring_bitmap_xor_inplace⚠ |
Inplace version of roaring_bitmap_xor, modifies x1. x1 != x2. |
| roaring_bitmap_xor_many⚠ |
Compute the xor of 'number' bitmaps. Caller is responsible for freeing the result. |
| roaring_copy_uint32_iterator⚠ |
Creates a copy of an iterator. Caller must free it. |
| roaring_create_iterator⚠ |
Create an iterator object that can be used to iterate through the values. Caller is responsible for calling roaring_free_iterator. The iterator is initialized. If there is a value, then it->has_value is true. The first value is in it->current_value. The iterator traverses the values in increasing order. |
| roaring_free_uint32_iterator⚠ |
Free memory following roaring_create_iterator |
| roaring_init_iterator⚠ |
Initialize an iterator object that can be used to iterate through the values. If there is a value, then it->has_value is true. The first value is in it->current_value. The iterator traverses the values in increasing order. |
| roaring_iterate⚠ |
Iterate over the bitmap elements. The function iterator is called once for all the values with ptr (can be NULL) as the second parameter of each call. |
| roaring_iterate64⚠ | |
| rpmatch⚠ | |
| run_array_container_andnot⚠ | |
| run_array_container_iandnot⚠ | |
| run_array_container_ixor⚠ | |
| run_bitset_container_andnot⚠ | |
| run_bitset_container_iandnot⚠ | |
| run_bitset_container_intersect⚠ | |
| run_bitset_container_intersection⚠ | |
| run_bitset_container_intersection_cardinality⚠ | |
| run_bitset_container_ixor⚠ | |
| run_bitset_container_lazy_union⚠ | |
| run_bitset_container_lazy_xor⚠ | |
| run_bitset_container_union⚠ | |
| run_bitset_container_xor⚠ | |
| run_container_add⚠ | |
| run_container_andnot⚠ | |
| run_container_cardinality⚠ | |
| run_container_clone⚠ | |
| run_container_contains⚠ | |
| run_container_copy⚠ | |
| run_container_create⚠ | |
| run_container_create_given_capacity⚠ | |
| run_container_deserialize⚠ | |
| run_container_equals⚠ |
Return true if the two containers have the same content. |
| run_container_equals_array⚠ |
Return true if the two containers have the same content. |
| run_container_equals_bitset⚠ |
Return true if the two containers have the same content. |
| run_container_free⚠ | |
| run_container_from_array⚠ | |
| run_container_grow⚠ |
increase capacity to at least min. Whether the existing data needs to be copied over depends on copy. If "copy" is false, then the new content will be uninitialized, otherwise a copy is made. |
| run_container_intersect⚠ | |
| run_container_intersection⚠ | |
| run_container_intersection_cardinality⚠ | |
| run_container_is_subset⚠ |
Return true if container1 is a subset of container2. |
| run_container_is_subset_array⚠ |
Return true if container1 is a subset of container2. |
| run_container_is_subset_bitset⚠ |
Return true if container1 is a subset of container2. |
| run_container_iterate⚠ | |
| run_container_iterate64⚠ | |
| run_container_maximum⚠ | |
| run_container_minimum⚠ | |
| run_container_negation⚠ | |
| run_container_negation_inplace⚠ | |
| run_container_negation_range⚠ | |
| run_container_negation_range_inplace⚠ | |
| run_container_printf⚠ | |
| run_container_printf_as_uint32_array⚠ | |
| run_container_rank⚠ | |
| run_container_read⚠ |
Reads the instance from buf, outputs how many bytes were read. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes read should be bitset_container_size_in_bytes(container). The cardinality parameter is provided for consistency with other containers, but it might be effectively ignored.. |
| run_container_select⚠ |
If the element of given rank is in this container, supposing that the first element has rank start_rank, then the function returns true and sets element accordingly. Otherwise, it returns false and update start_rank. |
| run_container_serialization_len⚠ | |
| run_container_serialize⚠ | |
| run_container_shrink_to_fit⚠ | |
| run_container_smart_append_exclusive⚠ |
Used in a start-finish scan that appends segments, for XOR and NOT |
| run_container_to_uint32_array⚠ | |
| run_container_union⚠ | |
| run_container_union_inplace⚠ | |
| run_container_write⚠ |
Writes the underlying array to buf, outputs how many bytes were written. This is meant to be byte-by-byte compatible with the Java and Go versions of Roaring. The number of bytes written should be run_container_size_in_bytes(container). |
| run_container_xor⚠ | |
| run_run_container_andnot⚠ | |
| run_run_container_iandnot⚠ | |
| run_run_container_ixor⚠ | |
| run_run_container_xor⚠ | |
| scanf⚠ | |
| secure_getenv⚠ | |
| seed48⚠ | |
| seed48_r⚠ | |
| select⚠ | |
| setbuf⚠ | |
| setbuffer⚠ | |
| setenv⚠ | |
| setkey⚠ | |
| setlinebuf⚠ | |
| setstate⚠ | |
| setstate_r⚠ | |
| setvbuf⚠ | |
| shared_container_extract_copy⚠ | |
| shared_container_free⚠ | |
| snprintf⚠ | |
| sprintf⚠ | |
| srand⚠ | |
| srand48⚠ | |
| srand48_r⚠ | |
| srandom⚠ | |
| srandom_r⚠ | |
| sscanf⚠ | |
| stpcpy⚠ | |
| stpncpy⚠ | |
| strcasecmp⚠ | |
| strcasecmp_l⚠ | |
| strcasestr⚠ | |
| strcat⚠ | |
| strchr⚠ | |
| strchrnul⚠ | |
| strcmp⚠ | |
| strcoll⚠ | |
| strcoll_l⚠ | |
| strcpy⚠ | |
| strcspn⚠ | |
| strdup⚠ | |
| strerror⚠ | |
| strerror_l⚠ | |
| strerror_r⚠ | |
| strfry⚠ | |
| strlen⚠ | |
| strncasecmp⚠ | |
| strncasecmp_l⚠ | |
| strncat⚠ | |
| strncmp⚠ | |
| strncpy⚠ | |
| strndup⚠ | |
| strnlen⚠ | |
| strpbrk⚠ | |
| strrchr⚠ | |
| strsep⚠ | |
| strsignal⚠ | |
| strspn⚠ | |
| strstr⚠ | |
| strtod⚠ | |
| strtod_l⚠ | |
| strtof⚠ | |
| strtof_l⚠ | |
| strtok⚠ | |
| strtok_r⚠ | |
| strtol⚠ | |
| strtol_l⚠ | |
| strtold⚠ | |
| strtold_l⚠ | |
| strtoll⚠ | |
| strtoll_l⚠ | |
| strtoq⚠ | |
| strtoul⚠ | |
| strtoul_l⚠ | |
| strtoull⚠ | |
| strtoull_l⚠ | |
| strtouq⚠ | |
| strverscmp⚠ | |
| strxfrm⚠ | |
| strxfrm_l⚠ | |
| system⚠ | |
| tempnam⚠ | |
| tmpfile⚠ | |
| tmpfile64⚠ | |
| tmpnam⚠ | |
| tmpnam_r⚠ | |
| ungetc⚠ | |
| union_uint16⚠ |
Generic union function. |
| union_uint32⚠ |
Generic union function. |
| union_uint32_card⚠ |
Generic union function, returns just the cardinality. |
| union_vector16⚠ |
A fast SSE-based union function. |
| unlockpt⚠ | |
| unsetenv⚠ | |
| valloc⚠ | |
| vasprintf⚠ | |
| vdprintf⚠ | |
| vfprintf⚠ | |
| vfscanf⚠ | |
| vprintf⚠ | |
| vscanf⚠ | |
| vsnprintf⚠ | |
| vsprintf⚠ | |
| vsscanf⚠ | |
| wcstombs⚠ | |
| wctomb⚠ | |
| xor_uint16⚠ |
Generic XOR function. |
| xor_vector16⚠ |
A fast SSE-based XOR function. |