On Thu, Apr 2, 2015 at 9:44 AM, Yago Riveiro wrote:
> Where can I found the source code used in index sorting? I need to ensure
> that the external data has the same sorting that the facet result.
If you step over the indexed terms of a field you get them in sorted
order (hence for a single node
The result is a custom responseWriter, I found a bug in my code that append de
\ to “.
The JSON response shows the data without the \.
Where can I found the source code used in index sorting? I need to ensure that
the external data has the same sorting that the facet result.
—
/Yago Rivei
On Thu, Apr 2, 2015 at 6:36 AM, yriveiro wrote:
> Hi,
>
> I have an external application that use the output of a facet to join other
> dataset using the keys of the facet result.
>
> The facet query use index sort but in some point, my application crash
> because the order of the keys "is not cor
uot; has lower ord than character 8, if \" is " then this sort
makes sense ...
My question here is how index sort works and how I can replicate it in C++
-
Best regards
--
View this message in context:
http://lucene.472066.n3.nabble.com/Facet-sorting-algorithm-for-index-tp4197174
Good Morning All,
The alphabetical sorting is causing slight issues as below:
I have 3 documents with title value as below:
1) "Acer Palmatum (Tree)"
2) "Aceraceae (Tree Family)"
3) "Acer Pseudoplatanus (Tree)"
I have created title_sort field which is defined with field type as
alphaNumericalSo
Hi Tomás
Thanks, that makes a lot of sense, and your math is sound.
It is working well. An if() function would be great, and it seems its coming
soon.
Richard
--
View this message in context:
http://lucene.472066.n3.nabble.com/Sorting-algorithm-tp3014549p3019077.html
Sent from the Solr - User
M, Richard Hodsdon
> wrote:
>
>> Thanks for the response,
>>
>> You are correct, but my pseudo code was not.
>> this line
>> var t = (CreationDate - 1131428803) / 1000;
>> should be
>> var t = (CreationDate - now()) / 1000;
>>
>> This will ca
ou are correct, but my pseudo code was not.
> this line
> var t = (CreationDate - 1131428803) / 1000;
> should be
> var t = (CreationDate - now()) / 1000;
>
> This will cause the items ranking to depreciate over time.
>
> Richard
>
>
> --
> View this message in
.472066.n3.nabble.com/Sorting-algorithm-tp3014549p3014961.html
Sent from the Solr - User mailing list archive at Nabble.com.
; desc
>
> Currently I am getting errors relating to my date field when trying to
> convert it from the TrieDate to timestamp with the _val_:MyDateField.
>
> Also I wanted to know if their is another way to do this? If my query is
> even correct.
>
> Thanks in advance
>
> Richard
>
>
> --
> View this message in context:
> http://lucene.472066.n3.nabble.com/Sorting-algorithm-tp3014549p3014549.html
> Sent from the Solr - User mailing list archive at Nabble.com.
>
orrect.
Thanks in advance
Richard
--
View this message in context:
http://lucene.472066.n3.nabble.com/Sorting-algorithm-tp3014549p3014549.html
Sent from the Solr - User mailing list archive at Nabble.com.
On Wed, Feb 4, 2009 at 4:45 PM, wojtekpia wrote:
> Ok, so maybe a better question is: should I bother trying to change the
> "sorting" algorithm? I'm concerned that with large data sets, sorting
> becomes a severe bottleneck (this is an assumption, I haven't profil
Ok, so maybe a better question is: should I bother trying to change the
"sorting" algorithm? I'm concerned that with large data sets, sorting
becomes a severe bottleneck (this is an assumption, I haven't profiled
anything to verify). Does it become a severe bottleneck? Do y
on Sort method orders by relevance score - the
Sort method orders by field, relevance, or doc id.
- Mark
wojtekpia wrote:
That's not quite what I meant. I'm not looking for a custom comparator, I'm
looking for a custom sorting algorithm. Is there a way to use quick sort o
That's not quite what I meant. I'm not looking for a custom comparator, I'm
looking for a custom sorting algorithm. Is there a way to use quick sort or
merge sort or... rather than the current algorithm? Also, what is the
current algorithm?
Otis Gospodnetic wrote:
>
>
>
he.org
> Sent: Wednesday, February 4, 2009 2:28:56 PM
> Subject: Custom Sorting Algorithm
>
>
> Is an easy way to choose/create an alternate sorting algorithm? I'm
> frequently dealing with large result sets (a few million results) and I
> might be able to benefit domain kn
Is an easy way to choose/create an alternate sorting algorithm? I'm
frequently dealing with large result sets (a few million results) and I
might be able to benefit domain knowledge in my sort.
--
View this message in context:
http://www.nabble.com/Custom-Sorting-Algorithm-tp21837721p218
17 matches
Mail list logo
