intervalstorej 1.2+dfsg-5 source package in Ubuntu
Changelog
intervalstorej (1.2+dfsg-5) unstable; urgency=medium * Raising Standards version to 4.6.1 (no change) * Deactivating tests that try to access security sensitive fields, which is forbidden since the JDK-8210522 issue on OpenJDK. (Closes: #1012098) -- Pierre Gruet <email address hidden> Fri, 04 Nov 2022 14:16:33 +0100
Upload details
- Uploaded by:
- Debian Java Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian Java Maintainers
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | misc | |
Noble | release | universe | misc | |
Mantic | release | universe | misc | |
Lunar | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
intervalstorej_1.2+dfsg-5.dsc | 2.2 KiB | cdaed9607b6067fc783e2cfe88090977369c92b087f879864e867f2725ccb51f |
intervalstorej_1.2+dfsg.orig.tar.xz | 1.5 MiB | 07b2f89cb8d523a4b8beee1d75ec728bee4f38e542f5b2a2769d95728626ef4f |
intervalstorej_1.2+dfsg-5.debian.tar.xz | 4.8 KiB | d03513b2cccc229f0c0ed3f439fe0e57fe97b342c80517058f778e7d1ac8b341 |
Available diffs
- diff from 1.2+dfsg-4 to 1.2+dfsg-5 (1.2 KiB)
No changes file available.
Binary packages built by this source
- libintervalstorej-java: 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.AbstractCollect ion<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.