1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
Source: intervalstorej
Section: java
Priority: optional
Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Uploaders: Pierre Gruet <pgt@debian.org>
Build-Depends: debhelper-compat (= 13),
default-jdk-headless,
javahelper,
maven-repo-helper,
testng <!nocheck>,
libjcommander-java <!nocheck>,
unzip <!nocheck>
Standards-Version: 4.6.1
Vcs-Browser: https://salsa.debian.org/java-team/intervalstorej
Vcs-Git: https://salsa.debian.org/java-team/intervalstorej.git
Homepage: https://github.com/bartongroup/IntervalStoreJ
Rules-Requires-Root: no
Package: libintervalstorej-java
Architecture: all
Depends: ${misc:Depends},
${java:Depends}
Multi-Arch: foreign
Description: Java implementation of the Nested Containment List data structure
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.
|
