cppIntersection: fast set intersection tool assumes sorted vectors A and B
In dlmtree: Bayesian Treed Distributed Lag Models
cppIntersection R Documentation
fast set intersection tool assumes sorted vectors A and B
Description
fast set intersection tool assumes sorted vectors A and B
Usage
cppIntersection(A, B)
Arguments
A
sorted integer vector A
B
sorted integer vector B
Value
vector of resulting intersection
dlmtree documentation built on June 22, 2024, 10:05 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| cppIntersection | R Documentation |
fast set intersection tool assumes sorted vectors A and B
Description
fast set intersection tool assumes sorted vectors A and B
Usage
cppIntersection(A, B)
Arguments
A |
sorted integer vector A |
B |
sorted integer vector B |
Value
vector of resulting intersection
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.