forked from MadsBuus/gedit-snapopen-plugin
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathREADME
49 lines (35 loc) · 1.81 KB
/
README
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
Fuzzy Open (Gedit Plugin)
Andrew Liu <andrewliu33 (at) gmail com>
Mads Buus Jensen <[email protected]> (SnapOpen)
Github location: http://github.com/eggegg/fuzzyopen
This plugin is base on SnapOpen plugin.
(http://github.com/MadsBuus/gedit-snapopen-plugin)
It use a totally different algorithm to find and rank the search result.
It depends on File Browser Plugin to get the root of searching.
FEATURES:
- Enable partial matching search, search with path
- Metedatas showed when searching: modified time, git status, file extention
- Ignore the hidden files and the file cannot be opened by gedit
- Options for case ignored or space ignored search
USAGE:
Shortcut: Ctrl + Shift + O
When you type the query in the new query window, the box under the query line
will simultaneously update the search result. The search space start from the
root of the file show in the file browser plugin.
The search result contains the files which matches the query along with some
metadata, including the extension name, the time of modification displayed in
relative form, and the git diff status if a folder .git is detected under the
root of the file browser.
SEARCH ALGORITHM:
The algorithm is intended to solve the problem that sometimes there are many
files having the same name (ie. index.erb), so search with path is a solution
to the problem. However, I'm too lazy to enter the whole path name. So this
is how the fuzzy search algorithm comes out.
- there is point for each single match
- the points increase for continue match, 1 point at first, 2 points at second,
3 points at third, ... and so on
Eventually, the algorithm will match something like this:
amus => app/models/user.rb
a/v/tclub => app/view/theme/plain/club.erb
If you have any suggestion about the algorithm, please contact me and help me
improve it.