On 7/7/06, robert engels <[EMAIL PROTECTED]> wrote:
Exactly. I have been watching to see how the new filer interface works out for 2.0. I am still not certain why it is so involved.I still think interface Filter { boolean include(int doc); int nextInclude(int doc); } should suffice.
It depends on how the interface will be used and the capabilities of the underlying implementation. Paul's sorted vint list is good on space, but it doesn't do random access well. Solr's HashDocSet offers very fast random access, but it doesn't do sequential access. A BitSet does both, but it's always big. There are many other possible implementations & tradeoffs, but you get the idea... -Yonik http://incubator.apache.org/solr Solr, the open-source Lucene search server --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
