binsegRcpp
Efficient Implementation of Binary Segmentation
Standard template library containers are used to implement an efficient binary segmentation algorithm, which is log-linear on average and quadratic in the worst case.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
2025.5.13 |
rolling linux/jammy R-4.5 | binsegRcpp_2025.5.13.tar.gz |
195.5 KiB |
2025.5.13 |
rolling linux/noble R-4.5 | binsegRcpp_2025.5.13.tar.gz |
198.7 KiB |
2025.5.13 |
rolling source/ R- | binsegRcpp_2025.5.13.tar.gz |
56.7 KiB |
2025.5.13 |
latest linux/jammy R-4.5 | binsegRcpp_2025.5.13.tar.gz |
195.5 KiB |
2025.5.13 |
latest linux/noble R-4.5 | binsegRcpp_2025.5.13.tar.gz |
198.7 KiB |
2025.5.13 |
latest source/ R- | binsegRcpp_2025.5.13.tar.gz |
56.7 KiB |
2025.5.13 |
2026-04-26 source/ R- | binsegRcpp_2025.5.13.tar.gz |
56.7 KiB |
2025.5.13 |
2026-04-23 source/ R- | binsegRcpp_2025.5.13.tar.gz |
56.7 KiB |
2025.5.13 |
2026-04-09 windows/windows R-4.5 | binsegRcpp_2025.5.13.zip |
522.3 KiB |
2023.8.31 |
2025-04-20 source/ R- | binsegRcpp_2023.8.31.tar.gz |
75.8 KiB |