I've opened SOLR-2716 (https://issues.apache.org/jira/browse/SOLR-2716).
Would it be possible to use a custom class or List implementation which generates a hash code in such a way that the order they are combined makes no difference? The change only really needs to effect whether a key is selected from the cache rather than altering the order of the filters. On 17 August 2011 23:52, Chris Hostetter <hossman_luc...@fucit.org> wrote: > > : with cache warming in Solr I found that the order of the Query objects > : within the filters list makes a difference to the equals() and hashCode() > : methods. > ... > : I found that it resulted in a cache miss for two queries that have the > same > : results just because the filters had a different ordering. Am I missing > : something or is there an opportunity to improve the chance of matching > cache > : entries? > > I haven't dug into the code, but i suspect you are probably correct. > > Please open an issue drawing attention to this, but off the top of my head > I'm not sure if there is a practical solution inside Solr -- Query classes > aren't Comparable, so we can't do anythin simple like sort the List > when executing the query or building the cache key. > > > -Hoss > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org > For additional commands, e-mail: dev-h...@lucene.apache.org > >
