Congratulations and welcome, Ben!
Xugang
https://www.amazingkoala.com.cn
> On Jan 28, 2023, at 00:51, Anshum Gupta wrote:
>
> Congratulations and welcome, Ben!
+1 If we would have a new BulkAdder and it could detect long runs of set bits,
It also could be at least used in LRUQueryCache to cache part dense docs
instead of always building a huge BitSet by maxDoc?
Xugang
https://www.amazingkoala.com.cn
> On Nov 4, 2022, at 08:15, Michael Froh
slow too. What the code samples you shared mean
> is that Lucene would only re-evaluate the set of candidates whenever it seems
> that we could reduce the number of candidates by 8x.
>
> On Thu, Jul 1, 2021 at 11:57 AM LuXugang wrote:
> Hi,
>
> While reading Lucen
Hi,
While reading Lucene source code, I have a tiny question about the selection of
threshold：threshold = value >>> 3.
eg. in NumericComparator#updateCompetitiveIterator(), as 'threshold =
iteratorCost >>> 3' a condition for whether to update iterator
eg. in IndexOrDocValuesQuery, as
gt;> sorted (depending on chance/luck), tiny tiny ones with e.g. a single
>>>>> document are sorted. Now we have a mix of monotonic and non-monotonic
>>>>> over the same field.
>>>>>
>>>>> On the other hand, optimization is very f
Hi,
In class Lucene80DocValuesConsumer#writeValues(FieldInfo field,
DocValuesProducer valuesProducer), all numericDocValues will be visited to
calculate gcd, in the meantime, we can check if all values were sorted. if so,
maybe we could use DirectMonotonicWriter to store them.
Hi,
In class ByteBlockPool , per buffer's default maximum size was set 32KB（2 <<
15）, is this such choice relevant with CPU L1 cache which cache size is 32KB？
If not so, could anyone give some tips？
Thanks for your answer, Adrien.
> 2021年1月13日 下午9:26，Adrien Grand 写道：
>
> Hello,
>
> It is indeed because I could get the compiler to use SIMD instructions with
> the loop written this way.
>
> On Wed, Jan 13, 2021 at 11:29 AM LuXugang wrote:
> Hi Adrien,
>
Hi Adrien,
I have some confusion about the method collapse8(long[ ] arr) in ForUtil class
On line 85, the loop times are 16, because there are 128 elements in arr, and
eight elements were processed at a time.
My question is why not choose the elements in order , like in the first loop,
Thanks David
My userId is luxugang
> On Dec 23, 2020, at 21:31, David Smiley wrote:
>
> Please register at the ASF's Confluence / wiki space. Then tell me your
> userId, and I will then grant you permissions to edit our wiki.
> ~ David Smiley
> Apache Lucene/Solr Searc
Actually, I have wrote some other articles to introduce Lucene but with
Chinese, so if it is needed, I would like to write more in English.
> 2020年10月30日 16:57，LuXugang 写道：
>
> Thanks David, add link in javadocs is great, got it ~
>
>> On Oct 30, 2020, at 12:45 PM, David Smi
source code about point’s data structure
> On Oct 30, 2020, at 4:57 PM, LuXugang wrote:
>
> Thanks David, add link in javadocs is great, got it ~
>
>> On Oct 30, 2020, at 12:45 PM, David Smiley > <mailto:dsmi...@apache.org>> wrote:
>>
>> Fantastic co
w.linkedin.com/in/davidwsmiley>
>
> On Wed, Oct 28, 2020 at 11:39 AM LuXugang wrote:
> Hi,
>
> I would like to add javadoc for Lucene86PointsFormat class, it is really
> helpful for source reader to understand the data structure with point value
>
> The attachment
13 matches
Mail list logo
