libintervalstorej-java
Java implementation of the Nested Containment List data structure
Description
NCList provides efficient lookup of intervals overlapping a given range in time O(M log N) where N is the number of intervals stored, and M the number of overlaps found. IntervalStore: - is parameterised by <T extends IntervalI>;
- so can store any Java type that implements IntervalI, that is, has methods
getBegin() and getEnd() (where begin <= end);
- extends java.util.AbstractCollection<T>;
- may be referred to as Collection<T> in code;
- exposes methods for add, contains, remove, iterator, size etc;
- has a 'bulk load' constructor, and methods to add or remove entries, while
retaining lookup efficiency;
- optimises storage and search of sparsely nested intervals by storing
non-nested intervals separately;
- incorporates NCList to store any properly nested intervals.
Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://github.com/bartongroup/IntervalStoreJ
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install libintervalstorej-java