Learn R Programming

bit (version 4.5.0.1)

Classes and Methods for Fast Memory-Efficient Boolean Selections

Description

Provided are classes for boolean and skewed boolean vectors, fast boolean methods, fast unique and non-unique integer sorting, fast set operations on sorted and unsorted sets of integers, and foundations for ff (range index, compression, chunked processing).

Copy Link

Version

Install

install.packages('bit')

Monthly Downloads

864,981

Version

4.5.0.1

License

GPL-2 | GPL-3

Issues

Pull Requests

Stars

Forks

Last Published

December 3rd, 2024

Functions in bit (4.5.0.1)

bit-package

bit: Classes and methods for fast memory-efficient boolean selections
c.booltype

Concatenating booltype vectors
bit_unidup

bit unique and duplicated
booltype

Diagnosing boolean types
bitsort

Low-level sorting: bit sort
bit_sort_unique

bit sort unique
bit_sort

bit sort
booltypes

Boolean types
chunk

Methods for chunked range index
bitwhich

Create bitwhich vector (skewed boolean)
firstNA

Position of first NA
bit

Create empty bit vector
chunks

Function for chunked range index
countsort

Low-level sorting: counting sort
copy_vector

Copy atomic R vector
clone

Cloning ff and ram objects
get_length

Get C length of a vector
intrle

Hybrid Index, C-coded utilities
range_na

Get range and number of NAs
print.bitwhich

Print method for bitwhich
merge_rev

Fast functions for sorted sets of integer
maxindex.default

Get maxindex (length of boolean vector) and poslength (number of 'selected' elements)
is.booltype

Testing for boolean types
print.bit

Print method for bit
range_nanozero

Remove zeros and get range and number of NAs
is.na.bit

Test for NA in bit and bitwhich
getsetattr

Attribute setting by reference
in.bitwhich

Check existence of integers in table
bitwhich_representation

Diagnose representation of bitwhich
quicksort3

Low-level sorting: threeway quicksort
range_sortna

Prepare for sorting and get range, number of NAs and unsortedness
reverse_vector

Reverse atomic vector
str.bitwhich

Str method for bitwhich
quicksort2

Low-level sorting: binary quicksort
length.bit

Getting and setting length of bit, bitwhich and ri objects
str.bit

Str method for bit
still.identical

Test for C-level identity of two atomic vectors
symdiff

Symmetric set complement
rev.booltype

Reversing bit and bitwhich vectors
rep.booltype

Replicating bit and bitwhich vectors
repfromto

Virtual recycling
ri

Range index
xor.default

Boolean operators and functions
rlepack

Hybrid Index, rle-pack utilities
repeat.time

Adaptive timer
vecseq

Vectorized Sequences
unattr

Attribute removal
as.character.bit

Coerce bit to character
as.booltype.default

Coerce to booltype (generic)
as.bit.NULL

Coercing to bit
as.character.bitwhich

Coerce bitwhich to character
bit_rangediff

bit range difference
bit_setops

bit set operations
bit_in

bit %in%
Summaries

Summaries of boolean vectors
Metadata

Generics related to cache access
as.which.which

Coercion to (positive) integer positions
CoercionToStandard

Coercion from bit, bitwhich, which and ri to logical, integer, double
bbatch

Balanced Batch sizes
Extract

Extract or replace part of an boolean vector
physical.default

Physical and virtual attributes
as.bitwhich.NULL

Coercing to bitwhich
.BITS

Initializing bit masks
Sorting

Generics for in-RAM sorting and ordering
as.ri.ri

Coerce to ri