powered by
If the table is sorted, this can be much faster than %in%
%in%
in.bitwhich(x, table, is.unsorted = NULL)
logical vector
a vector of integer
a bitwhich object or a vector of integer
bitwhich
logical telling the function whether the table is (un)sorted. With the defautl NULL FALSE is assumed for bitwhich tables, otherwise TRUE
NULL
FALSE
TRUE
x <- bitwhich(100) x[3] <- TRUE in.bitwhich(c(NA,2,3), x)
Run the code above in your browser using DataLab