Path: csiph.com!newsfeed.xs4all.nl!newsfeed7.news.xs4all.nl!news.uzoreto.com!aioe.org!bofh.it!news.nic.it!robomod From: Pierre Gruet Newsgroups: linux.debian.bugs.dist,linux.debian.devel,linux.debian.maint.java Subject: Bug#974879: ITP: intervalstorej -- Java implementation of the Nested Containment List data structure Date: Sun, 15 Nov 2020 23:10:04 +0100 Message-ID: X-Original-To: Debian Bug Tracking System X-Mailbox-Line: From debian-bugs-dist-request@lists.debian.org Sun Nov 15 22:06:10 2020 Old-Return-Path: X-Spam-Flag: NO X-Spam-Score: -0.528 Reply-To: Pierre Gruet , 974879@bugs.debian.org Resent-To: debian-bugs-dist@lists.debian.org Resent-Cc: debian-devel@lists.debian.org, debian-java@lists.debian.org, wnpp@debian.org, Debian Java team X-Debian-Pr-Message: report 974879 X-Debian-Pr-Package: wnpp X-Spam-Bayes: score:0.0000 Tokens: new, 35; hammy, 150; neutral, 57; spammy, 0. spammytokens: hammytokens:0.000-+--H*M:reportbug, 0.000-+--H*MI:reportbug, 0.000-+--XDebbugsCc, 0.000-+--X-Debbugs-Cc, 0.000-+--H*x:reportbug Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Mailer: reportbug 7.8.0 X-Debian-Message: from BTS X-Mailing-List: archive/latest/1632703 List-ID: List-URL: Approved: robomod@news.nic.it Lines: 34 Organization: linux.* mail to news gateway Sender: robomod@news.nic.it X-Original-Date: Sun, 15 Nov 2020 23:03:12 +0100 X-Original-Message-ID: <160547779285.595577.2138727888911111118.reportbug@mendelssohn> Xref: csiph.com linux.debian.bugs.dist:1032846 linux.debian.devel:98341 linux.debian.maint.java:11908 Package: wnpp Severity: wishlist Owner: Debian Java team X-Debbugs-Cc: debian-devel@lists.debian.org, debian-java@lists.debian.org * Package name : intervalstorej Version : 1.2 Upstream Author : Mungo Carstairs, Barton Group * URL : https://github.com/bartongroup/IntervalStoreJ/ * License : BSD-3-clause Programming Lang: Java 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 ; - so can store any Java type that implements IntervalI, that is, has methods getBegin() and getEnd() (where begin <= end); - extends java.util.AbstractCollection; - may be referred to as Collection 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. This package is needed as a dependency of jalview, which is currently updated as we have a quite old version of it in Debian. jalview now relies on it. It will be maintained inside the Debian Java team.