Skip to content
Snippets Groups Projects
This project is mirrored from https://github.com/junegunn/fzf. Pull mirroring failed .
Repository mirroring has been paused due to too many failed attempts. It can be resumed by a project maintainer or owner.
Last successful update .
  1. Apr 28, 2015
  2. Apr 26, 2015
  3. Apr 25, 2015
  4. Apr 24, 2015
  5. Apr 23, 2015
  6. Apr 22, 2015
  7. Apr 21, 2015
  8. Apr 20, 2015
  9. Apr 19, 2015
    • Junegunn Choi's avatar
      [vim] Use "system" fzf when available · 537d07c1
      Junegunn Choi authored
      1. Go binary: ../bin/fzf
      2. System fzf: $(which fzf)
      3. Download fzf from GitHub or create wrapper script to Ruby version (../fzf)
         when the binary for the platform is not available
      4. If install script is not found or for some reason failed, try to use Ruby
         version in its expected location (../fzf)
      5. If fzf is found to be a shell function, use it (type fzf)
      537d07c1
  10. Apr 18, 2015
  11. Apr 17, 2015
    • Junegunn Choi's avatar
      Improvements in performance and memory usage · 2fe1e282
      Junegunn Choi authored
      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.
      2fe1e282
  12. Apr 16, 2015
Loading