Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-30 Thread DM Smith
Andrzej Bialecki wrote: Paul Elschot wrote: On Saturday 28 January 2006 19:27, eks dev wrote: might be interesting: http://www.iis.uni-stuttgart.de/intset/ Another way to represent Bit(Integer)Set. Should outperform nicely BitSet or HashBitSet as far as iteration speed and memory is concern.

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-29 Thread Andrzej Bialecki
eks dev wrote: Unfortunately, the license distributed with the JAR (which we must assume takes precedence over whatever is stated on the web pages) is much more restrictive, it's the Java Research License, which specifically disallows any commercial use. So, short of reimplementing it from sc

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-29 Thread eks dev
> Unfortunately, the license distributed with the JAR > (which we must > assume takes precedence over whatever is stated on > the web pages) is > much more restrictive, it's the Java Research > License, which > specifically disallows any commercial use. So, short > of reimplementing > it from s

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread Paul Smith
No, I'm pretty sure it wouldn't, so long as you don't look at this code, lest you become "tainted" ... ;-) Isn't that where the phrase "I have no recollection of that Senator" comes in handy? :) Paul - To unsubscribe, e-

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread Andrzej Bialecki
Paul Smith wrote: Unfortunately, the license distributed with the JAR (which we must assume takes precedence over whatever is stated on the web pages) is much more restrictive, it's the Java Research License, which specifically disallows any commercial use. So, short of reimplementing it fro

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread Paul Smith
Unfortunately, the license distributed with the JAR (which we must assume takes precedence over whatever is stated on the web pages) is much more restrictive, it's the Java Research License, which specifically disallows any commercial use. So, short of reimplementing it from scratch it's

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread Andrzej Bialecki
Paul Elschot wrote: On Saturday 28 January 2006 19:27, eks dev wrote: might be interesting: http://www.iis.uni-stuttgart.de/intset/ Another way to represent Bit(Integer)Set. Should outperform nicely BitSet or HashBitSet as far as iteration speed and memory is concern. In Lucene where distrib

Re: Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread Paul Elschot
On Saturday 28 January 2006 19:27, eks dev wrote: > might be interesting: > http://www.iis.uni-stuttgart.de/intset/ > > Another way to represent Bit(Integer)Set. Should > outperform nicely BitSet or HashBitSet as far as > iteration speed and memory is concern. In Lucene where > distribution of set

Tree based BitSet (aka IntegerSet, DocSet...)

2006-01-28 Thread eks dev
might be interesting: http://www.iis.uni-stuttgart.de/intset/ Another way to represent Bit(Integer)Set. Should outperform nicely BitSet or HashBitSet as far as iteration speed and memory is concern. In Lucene where distribution of set bits is typically exponential... usage in caching, Filter...