Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Andreas Leitgeb <avl@logic.at>
Newsgroups: comp.lang.java.programmer
Subject: Re: Wanted: List of intervals
Date: Thu, 9 Mar 2017 23:05:34 -0000 (UTC)
Organization: A noiseless patient Spider
Lines: 10
Message-ID: <slrnoc3o37.sk7.avl@logic.at>
References: <o854lm$f4d$1@Gaia.teknon.de> <6jjvbc1irodjda97u74rd9e855hm75oqd1@4ax.com> <o9sajn$j53$1@Gaia.teknon.de>
Reply-To: avl@logic.at
Injection-Date: Thu, 9 Mar 2017 23:05:34 -0000 (UTC)
Injection-Info: mx02.eternal-september.org; posting-host="6efabe14fa30c2091fb69613eb1117dc"; logging-data="18472"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19Ay9nbGsY/VZZZEPYV9nk5"
User-Agent: slrn/1.0.2 (Linux)
Cancel-Lock: sha1:huruU+BuiPikI0BpKicXGAzNKRg=
Xref: csiph.com comp.lang.java.programmer:36394

Volker Borchert <v_borchert@despammed.com> wrote:
> Was hoping to find a solution to avoid creating possibly large
> numbers of adjacent intervals without slowing down. Lesson learnt.

Just wondering if you actually noticed the suggestions about
large sparse Bitsets.

PS: No, they wouldn't require a final loop over all possible
   numbers - that's where the "sparse" kicks in.