| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-10-09 | Introduce 'raw' mode | Junegunn Choi | |
| 2025-07-06 | Fix selection lost on revision bump | Junegunn Choi | |
| 2024-06-04 | Add --tail=NUM to limit the number of items to keep in memory | Junegunn Choi | |
| 2023-05-27 | Fix bug where preview is not updated after reload when --disabled is set | Junegunn Choi | |
| Fix #3311 | |||
| 2023-04-22 | Fixed --track when used with --tac | Junegunn Choi | |
| Fix #3234 | |||
| 2023-04-01 | Add --track option to track the current selection | Junegunn Choi | |
| Close #3186 Related #1890 | |||
| 2021-02-17 | Remove redundant assignment (#2356) | odeson24 | |
| Co-authored-by: Ryan Ou <ryanou@aetherai.com> | |||
| 2017-08-15 | Remove special nilItem | Junegunn Choi | |
| 2017-07-18 | Consolidate Result and rank structs | Junegunn Choi | |
| By not storing item index twice, we can cut down the size of Result struct and now it makes more sense to store and pass Results by values. Benchmarks show no degradation of performance by additional pointer indirection for looking up index. | |||
| 2017-07-16 | Remove pointer indirection by changing Chunk definition | Junegunn Choi | |
| 2016-08-20 | Remove Offset slice from Result struct | Junegunn Choi | |
| 2016-08-19 | Micro-optimizations | Junegunn Choi | |
| - 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-14 | Lint | Junegunn Choi | |
| 2016-01-13 | Accept comma-separated list of sort criteria | Junegunn Choi | |
| 2015-08-02 | Lint | Junegunn Choi | |
| 2015-04-17 | Improvements in performance and memory usage | Junegunn Choi | |
| 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-03-22 | Code cleanup | Junegunn Choi | |
| 2015-03-19 | Fix #151 - reduce initial memory footprint | Junegunn Choi | |
| 2015-02-26 | Add --tac option and reverse display order of --no-sort | Junegunn Choi | |
| DISCLAIMER: This is a backward incompatible change | |||
| 2015-02-18 | Fix race condition in asynchronous -1 and -0 | Junegunn Choi | |
| 2015-01-12 | Lint | Junegunn Choi | |
| 2015-01-11 | Fix race conditions | Junegunn Choi | |
| - Wait for completions of goroutines when cancelling a search - Remove shared access to rank field of Item | |||
| 2015-01-10 | Change Merger implementation on --no-sort | Junegunn Choi | |
| 2015-01-10 | Improve response time by only looking at top-N items | Junegunn Choi | |
 |
index : fzf | |
| Personal fork of fzf |
| summaryrefslogtreecommitdiff |