4 Commits

Author	SHA1	Message	Date
Junegunn Choi	37dc273148	Micro-optimizations ... - Make structs smaller - Introduce Result struct and use it to represent matched items instead of reusing Item struct for that purpose - Avoid unnecessary memory allocation - Avoid growing slice from the initial capacity - Code cleanup	2016-08-19 02:39:32 +09:00
Junegunn Choi	2fe1e28220	Improvements in performance and memory usage ... I profiled fzf and it turned out that it was spending significant amount of time repeatedly converting character arrays into Unicode codepoints. This commit greatly improves search performance after the initial scan by memoizing the converted results. This commit also addresses the problem of unbounded memory usage of fzf. fzf is a short-lived process that usually processes small input, so it was implemented to cache the intermediate results very aggressively with no notion of cache expiration/eviction. I still think a proper implementation of caching scheme is definitely an overkill. Instead this commit introduces limits to the maximum size (or minimum selectivity) of the intermediate results that can be cached.	2015-04-17 22:23:52 +09:00
Junegunn Choi	7a2bc2cada	Lint	2015-01-12 03:18:40 +09:00
Junegunn Choi	f3177305d5	Rewrite fzf in Go	2015-01-04 00:37:29 +09:00