lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ryan McKinley <ryan...@gmail.com>
Subject Re: trie* fields and sortMissingLast?
Date Fri, 17 Sep 2010 04:57:47 GMT
I could not find anything similar in JIRA, and went ahead and implemented:
https://issues.apache.org/jira/browse/LUCENE-2649


On Thu, Sep 16, 2010 at 5:21 PM, Uwe Schindler <uwe@thetaphi.de> wrote:
>> 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: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org


Mime
View raw message