Strahinja Val Markovic d18b89bceb Fixed another bug in the word boundary condition ... The problem was that should have been using a longest common subsequence algorithm for the "number of word boundary character matches" calculation. Our old approach would fail for the following case: Query: "caafoo" Candidate1 : "acaaCaaFooGxx" Candidate2 : "aCaafoog" Candidate1 needs to win. This is now also a test case.		2012-06-24 17:58:20 -07:00
..
gmock	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00
Candidate_test.cpp	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00
CMakeLists.txt	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00
Completer_test.cpp	Fixed another bug in the word boundary condition	2012-06-24 17:58:20 -07:00
IndexForChar_test.cpp	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00
IsUppercase_test.cpp	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00
LetterBitsetFromString_test.cpp	Using custom collection of Boost libs	2012-05-09 21:45:30 -07:00