Joshua Clayton 4c8e8b2d72 Switch to faster implementation of grouping a list ... Why? ==== Immediately after searching the codebase after tokens, we group results together based on match. This can be slow, especially within large codebases. This improves the time taken, previously O(n^2). Code reference: http://stackoverflow.com/a/15412231 Corresponding benchmark: https://gist.github.com/joshuaclayton/3dcde3b19e2c3006ee922053edebc417		2016-05-18 06:45:39 -04:00
..
Cache	Read unchanged results from the cache	2016-05-16 21:48:36 -04:00
CLI	Handle Ctrl-C both at top thread and forked thread for progressbar	2016-05-16 21:52:38 -04:00
Grouping	Allow search result grouping	2016-05-14 06:36:01 -04:00
Parser	Extract internal parsing handling to separate module	2016-05-12 18:02:59 -04:00
TermSearch	Use regex in ag for simple words	2016-05-14 08:14:54 -04:00
Cache.hs	Read unchanged results from the cache	2016-05-16 21:48:36 -04:00
CLI.hs	hlint suggestions	2016-05-05 18:06:25 -04:00
Grouping.hs	Allow search result grouping	2016-05-14 06:36:01 -04:00
LikelihoodCalculator.hs	Initial Haskell support for allowed tokens	2016-05-14 06:37:48 -04:00
Parser.hs	Extract internal parsing handling to separate module	2016-05-12 18:02:59 -04:00
Regex.hs	Initial pass at RemovalLikelihood calculator	2016-05-03 21:41:03 -04:00
ResponseFilter.hs	Initial Haskell support for allowed tokens	2016-05-14 06:37:48 -04:00
TermSearch.hs	Use regex in ag for simple words	2016-05-14 08:14:54 -04:00
Types.hs	Include features/ in the list of directories counting as tests	2016-05-11 11:31:52 -04:00
Util.hs	Switch to faster implementation of grouping a list	2016-05-18 06:45:39 -04:00