Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
F
fzf
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to JiHu GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
KMSCAKKSCFKA AKFACAMADCAS
fzf
Commits
e82eb277
Commit
e82eb277
authored
9 years ago
by
Junegunn Choi
Browse files
Options
Downloads
Patches
Plain Diff
Smart-case for each term in extended-search mode
Close #208
parent
3f0e6a58
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/pattern.go
+30
-32
30 additions, 32 deletions
src/pattern.go
test/test_go.rb
+4
-0
4 additions, 0 deletions
test/test_go.rb
with
34 additions
and
32 deletions
src/pattern.go
+
30
−
32
View file @
e82eb277
...
...
@@ -4,7 +4,6 @@ import (
"regexp"
"sort"
"strings"
"unicode"
"github.com/junegunn/fzf/src/algo"
)
...
...
@@ -28,10 +27,11 @@ const (
)
type
term
struct
{
typ
termType
inv
bool
text
[]
rune
origText
[]
rune
typ
termType
inv
bool
text
[]
rune
caseSensitive
bool
origText
[]
rune
}
// Pattern represents search pattern
...
...
@@ -88,36 +88,27 @@ func BuildPattern(mode Mode, caseMode Case,
caseSensitive
,
hasInvTerm
:=
true
,
false
terms
:=
[]
term
{}
switch
caseMode
{
case
CaseSmart
:
hasUppercase
:=
false
for
_
,
r
:=
range
runes
{
if
unicode
.
IsUpper
(
r
)
{
hasUppercase
=
true
break
}
}
if
!
hasUppercase
{
runes
,
caseSensitive
=
[]
rune
(
strings
.
ToLower
(
asString
)),
false
}
case
CaseIgnore
:
runes
,
caseSensitive
=
[]
rune
(
strings
.
ToLower
(
asString
)),
false
}
switch
mode
{
case
ModeExtended
,
ModeExtendedExact
:
terms
=
parseTerms
(
mode
,
string
(
runes
)
)
terms
=
parseTerms
(
mode
,
caseMode
,
asString
)
for
_
,
term
:=
range
terms
{
if
term
.
inv
{
hasInvTerm
=
true
}
}
default
:
lowerString
:=
strings
.
ToLower
(
asString
)
caseSensitive
=
caseMode
==
CaseRespect
||
caseMode
==
CaseSmart
&&
lowerString
!=
asString
if
!
caseSensitive
{
asString
=
lowerString
}
}
ptr
:=
&
Pattern
{
mode
:
mode
,
caseSensitive
:
caseSensitive
,
text
:
rune
s
,
text
:
[]
rune
(
asString
)
,
terms
:
terms
,
hasInvTerm
:
hasInvTerm
,
nth
:
nth
,
...
...
@@ -133,11 +124,17 @@ func BuildPattern(mode Mode, caseMode Case,
return
ptr
}
func
parseTerms
(
mode
Mode
,
str
string
)
[]
term
{
func
parseTerms
(
mode
Mode
,
caseMode
Case
,
str
string
)
[]
term
{
tokens
:=
_splitRegex
.
Split
(
str
,
-
1
)
terms
:=
[]
term
{}
for
_
,
token
:=
range
tokens
{
typ
,
inv
,
text
:=
termFuzzy
,
false
,
token
lowerText
:=
strings
.
ToLower
(
text
)
caseSensitive
:=
caseMode
==
CaseRespect
||
caseMode
==
CaseSmart
&&
text
!=
lowerText
if
!
caseSensitive
{
text
=
lowerText
}
origText
:=
[]
rune
(
text
)
if
mode
==
ModeExtendedExact
{
typ
=
termExact
...
...
@@ -163,10 +160,11 @@ func parseTerms(mode Mode, str string) []term {
if
len
(
text
)
>
0
{
terms
=
append
(
terms
,
term
{
typ
:
typ
,
inv
:
inv
,
text
:
[]
rune
(
text
),
origText
:
origText
})
typ
:
typ
,
inv
:
inv
,
text
:
[]
rune
(
text
),
caseSensitive
:
caseSensitive
,
origText
:
origText
})
}
}
return
terms
...
...
@@ -280,7 +278,7 @@ func dupItem(item *Item, offsets []Offset) *Item {
func
(
p
*
Pattern
)
fuzzyMatch
(
item
*
Item
)
(
int
,
int
)
{
input
:=
p
.
prepareInput
(
item
)
return
p
.
iter
(
algo
.
FuzzyMatch
,
input
,
p
.
text
)
return
p
.
iter
(
algo
.
FuzzyMatch
,
input
,
p
.
caseSensitive
,
p
.
text
)
}
func
(
p
*
Pattern
)
extendedMatch
(
item
*
Item
)
[]
Offset
{
...
...
@@ -288,7 +286,7 @@ func (p *Pattern) extendedMatch(item *Item) []Offset {
offsets
:=
[]
Offset
{}
for
_
,
term
:=
range
p
.
terms
{
pfun
:=
p
.
procFun
[
term
.
typ
]
if
sidx
,
eidx
:=
p
.
iter
(
pfun
,
input
,
term
.
text
);
sidx
>=
0
{
if
sidx
,
eidx
:=
p
.
iter
(
pfun
,
input
,
term
.
caseSensitive
,
term
.
text
);
sidx
>=
0
{
if
term
.
inv
{
break
}
...
...
@@ -319,10 +317,10 @@ func (p *Pattern) prepareInput(item *Item) *[]Token {
}
func
(
p
*
Pattern
)
iter
(
pfun
func
(
bool
,
*
[]
rune
,
[]
rune
)
(
int
,
int
),
tokens
*
[]
Token
,
pattern
[]
rune
)
(
int
,
int
)
{
tokens
*
[]
Token
,
caseSensitive
bool
,
pattern
[]
rune
)
(
int
,
int
)
{
for
_
,
part
:=
range
*
tokens
{
prefixLength
:=
part
.
prefixLength
if
sidx
,
eidx
:=
pfun
(
p
.
caseSensitive
,
part
.
text
,
pattern
);
sidx
>=
0
{
if
sidx
,
eidx
:=
pfun
(
caseSensitive
,
part
.
text
,
pattern
);
sidx
>=
0
{
return
sidx
+
prefixLength
,
eidx
+
prefixLength
}
}
...
...
This diff is collapsed.
Click to expand it.
test/test_go.rb
+
4
−
0
View file @
e82eb277
...
...
@@ -535,6 +535,10 @@ class TestGoFZF < TestBase
tmux
.
send_keys
:Enter
end
def
test_smart_case_for_each_term
assert_equal
1
,
`echo Foo bar |
#{
FZF
}
-x -f "foo Fbar" | wc -l`
.
to_i
end
private
def
writelines
path
,
lines
,
timeout
=
10
File
.
open
(
path
,
'w'
)
do
|
f
|
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment