The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
This tool can be used to build binary interval trees using real number inputs. The tree supports queries of intervals overlapping a single number or an interval (start, end). Intervals with same bounds but different names are treated as distinct intervals. Insertion of intervals is also allowed. Deletion of intervals is not implemented at this point. See Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars (2008). Computational Geometry: Algorithms and Applications, for a reference.
| Version: | 0.1.0 |
| Imports: | methods |
| Published: | 2019-04-23 |
| DOI: | 10.32614/CRAN.package.rIntervalTree |
| Author: | Shuye Pu [aut, cre] |
| Maintainer: | Shuye Pu <shuye2009 at gmail.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | rIntervalTree results |
| Reference manual: | rIntervalTree.pdf |
| Package source: | rIntervalTree_0.1.0.tar.gz |
| Windows binaries: | r-devel: rIntervalTree_0.1.0.zip, r-release: rIntervalTree_0.1.0.zip, r-oldrel: rIntervalTree_0.1.0.zip |
| macOS binaries: | r-release (arm64): rIntervalTree_0.1.0.tgz, r-oldrel (arm64): rIntervalTree_0.1.0.tgz, r-release (x86_64): rIntervalTree_0.1.0.tgz, r-oldrel (x86_64): rIntervalTree_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=rIntervalTree to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.