lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Uwe Schindler" <>
Subject RE: trie* fields and sortMissingLast?
Date Thu, 16 Sep 2010 21:21:55 GMT
> It seems that this could be done, but would require some rejiggering to
the API.
> The API could return an object like:
> class ByteValues {
>   byte[] values;
>   BitSet valid;
> }
> public ByteValues  getBytes (IndexReader reader, String field)

Thats the plan how to do it. Only replace BitSet by the "Bits" interface
(which is available in trunk). Bits is also implemented by OpenBitSet, so
the cache can be backed by OpenBitSet. You have to only consult terms one
time. Start with empty Bits and place a mark on each document that has a got
a value assigned.

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message