78da928727
Experimental implementation of "reload" action
...
# Reload input list with different sources
seq 10 | fzf --bind 'ctrl-a:reload(seq 100),ctrl-b:reload(seq 1000)'
# Reload as you type
seq 10 | fzf --bind 'change:reload:seq {q}' --phony
# Integration with ripgrep
RG_PREFIX="rg --column --line-number --no-heading --color=always --smart-case "
INITIAL_QUERY=""
FZF_DEFAULT_COMMAND="$RG_PREFIX '$INITIAL_QUERY'" \
fzf --bind "change:reload:$RG_PREFIX {q} || true" \
--ansi --phony --query "$INITIAL_QUERY"
Close #751
Close #965
Close #974
Close #1736
Related #1723
2019-11-10 11:43:37 +09:00
0558dfee79
Remove count field from ChunkList
2017-08-16 12:26:06 +09:00
0d171ba1d8
Remove special nilItem
2017-08-15 01:10:41 +09:00
a56489bc7f
Remove non-exclusive access to ChunkList field
2017-08-02 00:09:00 +09:00
37370f057f
Do not use defer in performance-sensitive contexts
2017-08-01 03:44:55 +09:00
6725151a99
Remove unnecessary copy of Chunk slice
2017-07-16 23:34:32 +09:00
d4f3d5a164
Remove pointer indirection by changing Chunk definition
2017-07-16 23:34:32 +09:00
e13bafc1ab
Performance fix - unnecessary rune convertion on --ansi
...
> time cat /tmp/list | fzf-0.10.1-darwin_amd64 --ansi -fqwerty > /dev/null
real 0m4.364s
user 0m8.231s
sys 0m0.820s
> time cat /tmp/list | fzf --ansi -fqwerty > /dev/null
real 0m4.624s
user 0m5.755s
sys 0m0.732s
2015-08-02 14:25:57 +09:00
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
2015-08-02 14:00:18 +09:00
f469c25730
Add --header-lines option
2015-07-22 03:21:20 +09:00
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
cd847affb7
Reorganize source code
2015-01-12 12:56:17 +09:00
7a2bc2cada
Lint
2015-01-12 03:18:40 +09:00
d2f7acbc69
Remove race conditions when accessing the last chunk
2015-01-04 05:01:13 +09:00
f3177305d5
Rewrite fzf in Go
2015-01-04 00:37:29 +09:00
Junegunn Choi