Coercing to bit
Coercing to bitwhich
Coerce bit to character
bit: Classes and methods for fast memory-efficient boolean selections
Generics related to cache access
Generics for in-RAM sorting and ordering
Summaries of boolean vectors
Coerce bitwhich to character
Diagnosing boolean types
Create empty bit vector
Physical and virtual attributes
bit %in%
Coerce to booltype (generic)
Coerce to ri
bit range difference
Create bitwhich vector (skewed boolean)
Diagnose representation of bitwhich
Initializing bit masks
bit sort
Boolean types
Position of first NA
bit sort unique
Coercion to (positive) integer positions
Get C length of a vector
Getting and setting length of bit, bitwhich and ri objects
bit set operations
Hybrid Index, C-coded utilities
Testing for boolean types
bit unique and duplicated
Balanced Batch sizes
Get maxindex (length of boolean vector) and poslength (number of 'selected' elements)
Concatenating booltype vectors
Low-level sorting: binary quicksort
Methods for chunked range index
Low-level sorting: counting sort
Copy atomic R vector
Low-level sorting: threeway quicksort
Print method for bit
Test for C-level identity of two atomic vectors
Attribute setting by reference
Fast functions for sorted sets of integer
Function for chunked range index
Print method for bitwhich
Str method for bit
Low-level sorting: bit sort
Reversing bit and bitwhich vectors
Get range and number of NAs
Range index
Cloning ff and ram objects
Test for NA in bit and bitwhich
Hybrid Index, rle-pack utilities
Prepare for sorting and get range, number of NAs and unsortedness
Reverse atomic vector
Boolean operators and functions
Check existence of integers in table
Replicating bit and bitwhich vectors
Attribute removal
Vectorized Sequences
Adaptive timer
Virtual recycling
Remove zeros and get range and number of NAs
Str method for bitwhich
Symmetric set complement
Coercion from bit, bitwhich, which and ri to logical, integer, double
Extract or replace part of an boolean vector