Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
lwm1986
roslyn
提交
dcd5ed21
R
roslyn
项目概览
lwm1986
/
roslyn
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
roslyn
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
dcd5ed21
编写于
7月 02, 2017
作者:
C
CyrusNajmabadi
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fast path.
上级
64b98d70
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
37 addition
and
46 deletion
+37
-46
src/Workspaces/Core/Portable/PatternMatching/PatternMatcher.cs
...orkspaces/Core/Portable/PatternMatching/PatternMatcher.cs
+37
-46
未找到文件。
src/Workspaces/Core/Portable/PatternMatching/PatternMatcher.cs
浏览文件 @
dcd5ed21
...
...
@@ -331,62 +331,53 @@ private static bool ContainsSpaceOrAsterisk(string text)
//
// 2) For each word try to match the word against the candidate value.
//
// 3) Matching is as follows:
//
// a) Check if the word matches the candidate entirely, in an case insensitive or
// sensitive manner. If it does, return that there was an exact match.
//
// b) Check if the word is a prefix of the candidate, in a case insensitive or
// sensitive manner. If it does, return that there was a prefix match.
//
// c) If the word is entirely lowercase, then check if it is contained anywhere in the
// candidate in a case insensitive manner. If so, return that there was a substring
// match.
//
// Note: We only have a substring match if the lowercase part is prefix match of
// some word part. That way we don't match something like 'Class' when the user
// types 'a'. But we would match 'FooAttribute' (since 'Attribute' starts with
// 'a').
//
// d) If the word was not entirely lowercase, then check if it is contained in the
// candidate in a case *sensitive* manner. If so, return that there was a substring
// match.
//
// e) If the word was entirely lowercase, then attempt a special lower cased camel cased
// match. i.e. cofipro would match CodeFixProvider.
//
// f) If the word was not entirely lowercase, then attempt a normal camel cased match.
// i.e. CoFiPro would match CodeFixProvider, but CofiPro would not.
//
// g) The word is all lower case. Is it a case insensitive substring of the candidate starting
// on a part boundary of the candidate?
// 3) Matching logic is outlined in NonFuzzyMatchPatternChunk. It's not repeated here to
// prevent having multiple places to keep up to date.
//
// Only if all words have some sort of match is the pattern considered matched.
var
tempMatches
=
ArrayBuilder
<
PatternMatch
>.
GetInstance
();
// Special case a simple pattern (alpha-numeric with no spaces). This is the common
// case and we want to prevent unnecessary overhead.
var
subWordTextChunks
=
segment
.
SubWordTextChunks
;
try
if
(
subWordTextChunks
.
Length
==
1
)
{
var
subWordTextChunks
=
segment
.
SubWordTextChunks
;
foreach
(
var
subWordTextChunk
in
subWordTextChunks
)
var
result
=
MatchPatternChunk
(
candidate
,
subWordTextChunks
[
0
],
punctuationStripped
:
true
,
fuzzyMatch
:
fuzzyMatch
);
if
(
result
==
null
)
{
// Try to match the candidate with this word
var
result
=
MatchPatternChunk
(
candidate
,
subWordTextChunk
,
punctuationStripped
:
true
,
fuzzyMatch
:
fuzzyMatch
);
if
(
result
==
null
)
{
return
false
;
}
tempMatches
.
Add
(
result
.
Value
);
return
false
;
}
matches
.
Add
Range
(
tempMatches
);
return
t
empMatches
.
Count
>
0
;
matches
.
Add
(
result
.
Value
);
return
t
rue
;
}
finally
else
{
tempMatches
.
Free
();
var
tempMatches
=
ArrayBuilder
<
PatternMatch
>.
GetInstance
();
try
{
foreach
(
var
subWordTextChunk
in
subWordTextChunks
)
{
// Try to match the candidate with this word
var
result
=
MatchPatternChunk
(
candidate
,
subWordTextChunk
,
punctuationStripped
:
true
,
fuzzyMatch
:
fuzzyMatch
);
if
(
result
==
null
)
{
return
false
;
}
tempMatches
.
Add
(
result
.
Value
);
}
matches
.
AddRange
(
tempMatches
);
return
tempMatches
.
Count
>
0
;
}
finally
{
tempMatches
.
Free
();
}
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录