: Does anyone know of a good way to perform a reverse-sorted facet query (i.e. rarest first)?
I'm fairly confident that code doesn't exist at the moment. If i remember correctly, it would be fairly simply to implement if you'd like to submit a patch: when sorting by count a simple bounded priority queue is used, so we'd just have the change the comparator. If you're interested in working on a patch it should be in SimpleFacets.java. I think the queue is called "BoundedTreeSet" (that's a pretty novel request actually ... i don't remember anyone else ever asking for anything like this before .. can you describe your use case a bit -- i'm curious as to how/when you would use this data) -Hoss
