Archives
/
fzf
mirror of https://github.com/junegunn/fzf
2
0
Fork 0
Code Issues Projects Releases Wiki Activity
1,370 Commits
2 Branches
138 Tags
21 MiB
devel
master
0.52.1
0.52.0
0.51.0
0.50.0
0.49.0
0.48.1
0.48.0
0.47.0
0.46.1
0.46.0
0.45.0
0.44.1
0.44.0
0.43.0
0.42.0
0.41.1
0.41.0
0.40.0
0.39.0
0.38.0
0.37.0
0.36.0
0.35.1
0.35.0
0.34.0
0.33.0
0.32.1
0.32.0
0.31.0
0.30.0
0.29.0
0.28.0
0.27.3
0.27.2
0.27.1
0.27.0
0.26.0
0.25.1
0.25.0
0.24.4
0.24.3
0.24.2
0.24.1
0.24.0-1
0.24.0
0.24.0-rc1
0.23.1
0.23.0
0.22.0
0.21.1
0.21.0-1
0.21.0
0.20.0
0.19.0
0.18.0
0.17.5
0.17.4
0.17.3
0.17.1
0.17.0-2
0.17.0
0.16.11
0.16.10
0.16.9
0.16.8
0.16.7
0.16.6
0.16.5
0.16.4
0.16.3
0.16.2
0.16.1
0.16.0
0.15.9
0.15.8
0.15.7
0.15.6
0.15.5
0.15.4
0.15.3
0.15.2
0.15.1
0.15.0
0.13.5
0.13.4
0.13.3
0.13.2
0.13.1
0.13.0
0.12.2
0.12.1
0.11.2
0.10.6
0.10.5
0.10.0
0.9.12
0.9.11
0.9.10
0.9.7-1
0.9.7
0.9.4-1
0.9.4
0.9.3
0.9.2
0.9.1
0.9.0
0.8.9
0.8.8
0.8.7
0.8.6
0.8.5
0.8.4
0.1.0
0.10.1
0.10.2
0.10.3
0.10.4
0.10.7
0.10.8
0.10.9
0.11.0
0.11.1
0.11.3
0.11.4
0.12.0
0.3.1
0.4.0
0.4.2
0.5.0
0.5.1
0.6.0
0.7.0
0.7.1
0.8.0
0.8.1
0.8.2
0.8.3
0.9.13
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'bbe10f4f77'
${ noResults }
Commit Graph

44 Commits (bbe10f4f7745000c121b629ff68e81bba5a497f6)

Author SHA1 Message Date
Junegunn Choi bbe10f4f77
Consolidate Result and rank structs 
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.
 7 years ago
Junegunn Choi 9e85cba0d0
Reduce memory footprint of Item struct 7 years ago
Junegunn Choi 8dbdd55730
Refactor cache lookup 
- Remove multiple mutex locks in partial cache lookup
- Simplify return values
 7 years ago
Junegunn Choi d4f3d5a164
Remove pointer indirection by changing Chunk definition 7 years ago
Junegunn Choi 2e3dc75425
Fix inconsistent tiebreak scores when --nth is used 
Make sure to consistently calculate tiebreak scores based on the
original line.

This change may not be preferable if you filter aligned tabular input on
a subset of columns using --nth. However, if we calculate length
tiebreak only on the matched components instead of the entire line, the
result can be very confusing when multiple --nth components are
specified, so let's keep it simple and consistent.

Close #926
 7 years ago
Junegunn Choi dd1f26522c
Fix caching scheme when --exact is set and '-prefix is used 7 years ago
Junegunn Choi a16d8f66a9
Normalize pattern string before passing it to Algo function 8 years ago
Junegunn Choi 45793d75c2
Add --normalize option to normalize latin script characters 
Close #790
 8 years ago
Junegunn Choi aeb957a285
Use exact match by default for inverse search term 
This is a breaking change, but I believe it makes much more sense. It is
almost impossible to predict which entries will be filtered out due to
a fuzzy inverse term. You can still perform inverse-fuzzy-match by
prepending `!'` to the term.

| Token    | Match type                 | Description                       |
| -------- | -------------------------- | --------------------------------- |
| `sbtrkt` | fuzzy-match                | Items that match `sbtrkt`         |
| `^music` | prefix-exact-match         | Items that start with `music`     |
| `.mp3$`  | suffix-exact-match         | Items that end with `.mp3`        |
| `'wild`  | exact-match (quoted)       | Items that include `wild`         |
| `!fire`  | inverse-exact-match        | Items that do not include `fire`  |
| `!.mp3$` | inverse-suffix-exact-match | Items that do not end with `.mp3` |
 8 years ago
Junegunn Choi 2fc7c18747
Revise ranking algorithm 8 years ago
Junegunn Choi f8fdf9618a
No need to cache the result in filtering mode (--filter) 8 years ago
Junegunn Choi 827a83efbc
Remove Offset slice from Result struct 8 years ago
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
 8 years ago
Junegunn Choi d4b6338102
Lint 8 years ago
Junegunn Choi 1d4057c209
[perf] Avoid allocating rune array for ascii string 
In the best case (all ascii), this reduces the memory footprint by 60%
and the response time by 15% to 20%. In the worst case (every line has
non-ascii characters), 3 to 4% overhead is observed.
 8 years ago
Junegunn Choi 85ef3263fc Fix incorrect cache reference in --exact mode (#547) 
When we prepend a single quote to our query in --exact mode, we are not
supposed to limit the scope of the new search to the previous
exact-match result.
 8 years ago
Junegunn Choi 2f6d23b91e Enhanced ranking algorithm 
Based on the patch by Matt Westcott (@mjwestcott).
But with a more conservative approach:
- Does not use linearly increasing penalties; It is agreed upon that we
  should prefer matching characters at the beginnings of the words, but
  it's not always clear that the relevance is inversely proportional to
  the distance from the beginning.
- The approach here is more conservative in that the bonus is never
  large enough to override the matchlen, so it can be thought of as the
  first implicit tiebreak criterion.
- One may argue the change breaks the contract of --tiebreak, but the
  judgement depends on the definition of "tie".
 8 years ago
Junegunn Choi 8d3a302a17 Simplify Item structure 
This commit compensates for the performance overhead from the
extended tiebreak option.
 9 years ago
Junegunn Choi 1d2d32c847 Accept comma-separated list of sort criteria 9 years ago
Junegunn Choi 31278bcc68 Fix compatibility issues with OR operator and inverse terms 9 years ago
Junegunn Choi e7e86b68f4 Add OR operator 
Close #412
 9 years ago
Junegunn Choi 81a88693c1 Make --extended default 
Close #400
 9 years ago
Junegunn Choi 92a75c9563 Use trimmed length when --nth is used with --tiebreak=length 
This change improves sort ordering for aligned tabular input.
Given the following input:

    apple   juice   100
    apple   pie     200

fzf --nth=2 will now prefer the one with pie. Before this change fzf
compared "juice   " and "pie     ", both of which have the same length.
 9 years ago
Junegunn Choi 64443221aa Fix #344 - Backward scan when `--tiebreak=end` 9 years ago
Junegunn Choi 9017e29741 Make it possible to unquote the term in extended-exact mode 
Close #338
 9 years ago
Junegunn Choi 766427de0c Fix --with-nth performance; avoid regex if possible 
Close #317
 9 years ago
Junegunn Choi 0ea66329b8 Performance tuning - eager rune array conversion 
> wc -l /tmp/list2
     2594098 /tmp/list2

    > time cat /tmp/list2 | fzf-0.10.1-darwin_amd64 -fqwerty > /dev/null

    real    0m5.418s
    user    0m10.990s
    sys     0m1.302s

    > time cat /tmp/list2 | fzf-head -fqwerty > /dev/null

    real    0m4.862s
    user    0m6.619s
    sys     0m0.982s
 9 years ago
Junegunn Choi 0be4cead20 Allow ^EqualMatch$ 9 years ago
Junegunn Choi e82eb27787 Smart-case for each term in extended-search mode 
Close #208
 9 years ago
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.
 9 years ago
Junegunn Choi 5c25984ea0 Fix Unicode case handling (#186) 9 years ago
Junegunn Choi 50292adacb Implement --toggle-sort option (#173) 9 years ago
Junegunn Choi e70a2a5817 Add support for ANSI color codes 9 years ago
Junegunn Choi 94e8e6419f Make --filter non-blocking when --no-sort (#132) 
When fzf works in filtering mode (--filter) and sorting is disabled
(--no-sort), there's no need to block until input is complete. This
commit makes fzf print the matches on-the-fly when the following
condition is met:

    --filter FILTER --no-sort [--no-tac --no-sync]

or simply:

    -f FILTER +s

This removes unnecessary delay in use cases like the following:

    fzf -f xxx +s | head -5

However, in this case, fzf processes the input lines sequentially, so it
cannot utilize multiple cores, which makes it slightly slower than the
previous mode of execution where filtering is done in parallel after the
entire input is loaded. If the user is concerned about the performance
problem, one can add --sync option to re-enable buffering.
 9 years ago
Junegunn Choi cd847affb7 Reorganize source code 10 years ago
Junegunn Choi 7a2bc2cada Lint 10 years ago
Junegunn Choi 9dbf6b02d2 Fix race conditions 
- Wait for completions of goroutines when cancelling a search
- Remove shared access to rank field of Item
 10 years ago
Junegunn Choi 313578a1a0 Improve prefix/suffix cache lookup 10 years ago
Junegunn Choi bd7331ecf5 Remove unnecessary loop label 10 years ago
Junegunn Choi ca4bdfb4bd Fix Transform result cache to speed up subsequent searches 10 years ago
Junegunn Choi 4f40314433 Fix --with-nth option when query is non-empty 10 years ago
Junegunn Choi aa05bf5206 Reduce memory footprint 10 years ago
Junegunn Choi 4a5142c60b Do not sort terms when building cache key 10 years ago
Junegunn Choi f3177305d5 Rewrite fzf in Go 10 years ago