Package: libintervalstorej-java
Source: intervalstorej
Version: 1.2+dfsg-5build1
Architecture: all
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Installed-Size: 70
Section: java
Priority: optional
Multi-Arch: foreign
Homepage: https://github.com/bartongroup/IntervalStoreJ
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.
