search for: probalistic

Hi, I have some ideas that I like to play around with (mostly ideas on how to rank 'spam' sites lower).. All the ideas is based on setting a fixed score to the document, that could override the probalistic relevancy based on the value of the extra score. But I am confused on how I should implement it. I would like to hear what you think is the best approach. My idea. Add the score: to the Xapian::document value ? Add the weight calculation to the abstract weight class? Add the supporting matchers?...

Hi folks, here is a short RFC regarding hashing for the implementation of switch statements and my preliminary patch. I posted this patch on 2014-01-16 21:58 at llvm-commits at cs.uiuc.edu. You can find a copy e.g. on http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20140113/201782.html. Best regards Jasper === Preliminary: Special identifiers n number of given switch labels