Package index • bit

All functions
`as.logical(<bit>)` `as.integer(<bit>)` `as.double(<bit>)` `as.integer(<bitwhich>)` `as.double(<bitwhich>)` `as.logical(<bitwhich>)` `as.logical(<ri>)` `as.integer(<ri>)` `as.double(<ri>)` `as.logical(<which>)`	Coercion from bit, bitwhich, which and ri to logical, integer, double
`[[`(<bit>) `[[<-`(<bit>) `[`(<bit>) `[<-`(<bit>) `[[`(<bitwhich>) `[[<-`(<bitwhich>) `[`(<bitwhich>) `[<-`(<bitwhich>)	Extract or replace part of an boolean vector
`is.sorted()` `is.sorted<-`() `na.count()` `na.count<-`() `nvalid()` `nunique()` `nunique<-`() `nties()` `nties<-`()	Generics related to cache access
`print(<physical>)` `print(<virtual>)` `physical()` `physical<-`() `virtual()` `virtual<-`()	Physical and virtual attributes
`ramsort()` `ramorder()` `ramsortorder()` `mergesort()` `mergeorder()` `mergesortorder()` `quicksort()` `quickorder()` `quicksortorder()` `shellsort()` `shellorder()` `shellsortorder()` `radixsort()` `radixorder()` `radixsortorder()` `keysort()` `keyorder()` `keysortorder()`	Generics for in-RAM sorting and ordering
`all(<bit>)` `any(<bit>)` `anyNA(<bit>)` `sum(<bit>)` `min(<bit>)` `max(<bit>)` `range(<bit>)` `summary(<bit>)` `all(<bitwhich>)` `any(<bitwhich>)` `anyNA(<bitwhich>)` `sum(<bitwhich>)` `min(<bitwhich>)` `max(<bitwhich>)` `range(<bitwhich>)` `summary(<bitwhich>)` `all(<which>)` `any(<which>)` `anyNA(<which>)` `sum(<which>)` `min(<which>)` `max(<which>)` `range(<which>)` `summary(<which>)` `all(<booltype>)` `any(<booltype>)` `anyNA(<booltype>)` `sum(<booltype>)` `min(<booltype>)` `max(<booltype>)` `range(<booltype>)` `summary(<booltype>)` `all(<ri>)` `any(<ri>)` `anyNA(<ri>)` `sum(<ri>)` `min(<ri>)` `max(<ri>)` `range(<ri>)` `summary(<ri>)`	Summaries of boolean vectors
`as.bit()`	Coercing to bit
`as.bitwhich()`	Coercing to bitwhich
`as.booltype()`	Coerce to booltype (generic)
`as.character(<bit>)`	Coerce bit to character
`as.character(<bitwhich>)`	Coerce bitwhich to character
`as.ri()`	Coerce to ri
`as.which()`	Coercion to (positive) integer positions
`bbatch()`	Balanced Batch sizes
`bit-package`	bit: Classes and methods for fast memory-efficient boolean selections
`bit()`	Create empty bit vector
`bit_in()`	bit %in%
`.BITS` `bit_init()` `bit_done()`	Initializing bit masks
`bit_rangediff()`	bit range difference
`bit_union()` `bit_intersect()` `bit_setdiff()` `bit_symdiff()` `bit_setequal()`	bit set operations
`bit_sort()`	bit sort
`bit_sort_unique()`	bit sort unique
`bit_unique()` `bit_duplicated()` `bit_anyDuplicated()` `bit_sumDuplicated()`	bit unique and duplicated
`bitsort()`	Low-level sorting: bit sort
`bitwhich()`	Create bitwhich vector (skewed boolean)
`bitwhich_representation()`	Diagnose representation of bitwhich
`booltype()`	Diagnosing boolean types
`booltypes`	Boolean types
`c(<booltype>)` `c(<bit>)` `c(<bitwhich>)`	Concatenating booltype vectors
`chunk()`	Methods for chunked range index
`chunks()`	Function for chunked range index
`clone()`	Cloning ff and ram objects
`copy_vector()`	Copy atomic R vector
`countsort()`	Low-level sorting: counting sort
`firstNA()`	Position of first NA
`get_length()`	Get C length of a vector
`getsetattr()` `setattr()` `setattributes()`	Attribute setting by reference
`in.bitwhich()`	Check existence of integers in table
`intrle()` `intisasc()` `intisdesc()`	Hybrid Index, C-coded utilities
`is.booltype()` `is.bit()` `is.bitwhich()` `is.which()` `is.hi()` `is.ri()`	Testing for boolean types
`is.na(<bit>)` `is.na(<bitwhich>)`	Test for NA in bit and bitwhich
`length(<bit>)` `length<-`(<bit>) `length(<bitwhich>)` `length<-`(<bitwhich>) `length(<ri>)`	Getting and setting length of bit, bitwhich and ri objects
`maxindex()` `poslength()`	Get maxindex (length of boolean vector) and poslength (number of 'selected' elements)
`merge_rev()` `merge_match()` `merge_in()` `merge_notin()` `merge_duplicated()` `merge_anyDuplicated()` `merge_sumDuplicated()` `merge_unique()` `merge_union()` `merge_setdiff()` `merge_symdiff()` `merge_intersect()` `merge_setequal()` `merge_rangein()` `merge_rangenotin()` `merge_rangesect()` `merge_rangediff()` `merge_first()` `merge_last()` `merge_firstin()` `merge_lastin()` `merge_firstnotin()` `merge_lastnotin()`	Fast functions for sorted sets of integer
`print(<bit>)`	Print method for bit
`print(<bitwhich>)`	Print method for bitwhich
`quicksort2()`	Low-level sorting: binary quicksort
`quicksort3()`	Low-level sorting: threeway quicksort
`range_na()`	Get range and number of NAs
`range_nanozero()`	Remove zeros and get range and number of NAs
`range_sortna()`	Prepare for sorting and get range, number of NAs and unsortedness
`rep(<bit>)` `rep(<bitwhich>)`	Replicating bit and bitwhich vectors
`repeat.time()`	Adaptive timer
`repfromto()` `repfromto<-`()	Virtual recycling
`rev(<bit>)` `rev(<bitwhich>)`	Reversing bit and bitwhich vectors
`reverse_vector()`	Reverse atomic vector
`ri()` `print(<ri>)`	Range index
`rlepack()` `rleunpack()` `rev(<rlepack>)` `unique(<rlepack>)` `anyDuplicated(<rlepack>)`	Hybrid Index, rle-pack utilities
`still.identical()`	Test for C-level identity of two atomic vectors
`str(<bit>)`	Str method for bit
`str(<bitwhich>)`	Str method for bitwhich
`symdiff()`	Symmetric set complement
`unattr()`	Attribute removal
`vecseq()`	Vectorized Sequences
`!`(<bit>) `&`(<bit>) `\|`(<bit>) `==`(<bit>) `!=`(<bit>) `!`(<bitwhich>) `&`(<bitwhich>) `\|`(<bitwhich>) `==`(<bitwhich>) `!=`(<bitwhich>) `&`(<booltype>) `\|`(<booltype>) `==`(<booltype>) `!=`(<booltype>) `xor()`	Boolean operators and functions

Reference

All functions