Check existence of integers in table

Source: R/bit.R

If the table is sorted, this can be much faster than %in%

in.bitwhich(x, table, is.unsorted = NULL)

Arguments

x

a vector of integer

table

a bitwhich() object or a vector of integer

is.unsorted

logical telling the function whether the table is (un)sorted. With the default NULL FALSE is assumed for bitwhich() tables, otherwise TRUE

Value

logical vector

See also

%in%

Examples

x <- bitwhich(100)
x[3] <- TRUE
in.bitwhich(c(NA, 2, 3), x)
#> [1] FALSE FALSE  TRUE