Strahinja Val Markovic ced1d0ad5a Adding new candidates is now faster; + more ... Also fixed a memory leak and started work on adding filepath-aware candidate repos.		2012-04-29 16:36:31 -07:00
..
tests	One more test case for RatioUtilizationTieBreak	2012-04-29 13:44:11 -07:00
Candidate.cpp	For "foo" vs "Foo", the all-lowercase one wins	2012-04-16 22:13:05 -07:00
Candidate.h	For "foo" vs "Foo", the all-lowercase one wins	2012-04-16 22:13:05 -07:00
CMakeLists.txt	Initial import	2012-04-15 16:57:10 -07:00
Completer.cpp	Adding new candidates is now faster; + more	2012-04-29 16:36:31 -07:00
Completer.h	Adding new candidates is now faster; + more	2012-04-29 16:36:31 -07:00
indexer.cpp	Updating copyright line	2012-04-15 20:28:46 -07:00
LetterHash.cpp	Updating copyright line	2012-04-15 20:28:46 -07:00
LetterHash.h	Updating copyright line	2012-04-15 20:28:46 -07:00
LetterNode.cpp	Updating copyright line	2012-04-15 20:28:46 -07:00
LetterNode.h	Updating copyright line	2012-04-15 20:28:46 -07:00
Makefile	Initial import	2012-04-15 16:57:10 -07:00
Result.cpp	For "foo" vs "Foo", the all-lowercase one wins	2012-04-16 22:13:05 -07:00
Result.h	For "foo" vs "Foo", the all-lowercase one wins	2012-04-16 22:13:05 -07:00
RootLetterNode.h	Updating copyright line	2012-04-15 20:28:46 -07:00
standard.h	Updating copyright line	2012-04-15 20:28:46 -07:00
Utils.cpp	Updating copyright line	2012-04-15 20:28:46 -07:00
Utils.h	Adding new candidates is now faster; + more	2012-04-29 16:36:31 -07:00